Merge branch 'notagcoll': removed dependencies on tagcoll and wibble.

290 files changed, 5803 insertions, 179929 deletions

diff --git a/CMakeLists.txt b/CMakeLists.txt
index ddf7bb9..9b693c8 100644
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -3,9 +3,9 @@ cmake_minimum_required(VERSION 3.2)
 include( FindPkgConfig )
 include( FindDoxygen )
 
-add_custom_target( unit )
+add_custom_target(check COMMAND ${CMAKE_SOURCE_DIR}/run-check ${CMAKE_BINARY_DIR}/ept/test-ept)
 
-set( EPT_VERSION "1.0.14" )
+set( EPT_VERSION "1.1" )
 
 # Get the soversion from libapt-pkg to include in our own
 execute_process(
@@ -22,32 +22,6 @@ set( APT_INCLUDES "/usr/include/" CACHE STRING "apt include path" )
 set( APT_LINKDIRS "/usr/lib/" CACHE STRING "apt library path" )
 set( OPT_FLAGS "-O0 -g" CACHE STRING "optimization level" )
 
-option( INTERNAL_TAGCOLL "use internal copy of tagcoll" )
-option( INTERNAL_WIBBLE "use internal copy of wibble" )
-option( RPM "using apt-rpm" )
-
-if( INTERNAL_WIBBLE )
-  add_subdirectory( wibble )
-  set( WIBBLE_INCLUDE_DIRS ${CMAKE_SOURCE_DIR} ${CMAKE_BINARY_DIR} )
-  set( WIBBLE_LIBRARY_DIRS ${wibble_BINARY_DIR} )
-  set( WIBBLE_LIBRARIES "wibble" )
-  set( WIBBLE_TEST_CMAKE "${wibble_SOURCE_DIR}/test.cmake" )
-else( INTERNAL_WIBBLE )
-  pkg_check_modules( WIBBLE REQUIRED "libwibble >= 1.0" )
-  find_program( WIBBLE_TEST_GENRUNNER wibble-test-genrunner )
-  set( WIBBLE_TEST_CMAKE "${WIBBLE_PREFIX}/share/wibble/test.cmake" )
-endif( INTERNAL_WIBBLE )
-
-if( INTERNAL_TAGCOLL )
-  set( TAGCOLL_FOUND ON )
-  set( TAGCOLL_INCLUDE_DIRS ${CMAKE_SOURCE_DIR} )
-  set( TAGCOLL_LIBRARY_DIRS ${tagcoll_BINARY_DIR} )
-  set( TAGCOLL_LIBRARIES "tagcoll2" )
-  add_subdirectory( tagcoll )
-else( INTERNAL_TAGCOLL )
-  pkg_check_modules( TAGCOLL REQUIRED "libtagcoll2 >= 2.0" )
-endif( INTERNAL_TAGCOLL )
-
 add_subdirectory( ept )
 add_subdirectory( tools )
 add_subdirectory( doc )
diff --git a/debian/changelog b/debian/changelog
index e45d7f2..819bcb9 100644
--- a/debian/changelog
+++ b/debian/changelog
@@ -1,3 +1,10 @@
+libept (1.1) experimental; urgency=medium
+
+  * Removed need of tagcoll and wibble
+  * Removed popcon/ support
+
+ -- Enrico Zini <enrico@debian.org>  Thu, 10 Sep 2015 19:50:32 +0200
+
 libept (1.0.14) unstable; urgency=medium
 
   * New version that includes Matthias' changes
diff --git a/debian/control b/debian/control
index 8e61f1b..63c22de 100644
--- a/debian/control
+++ b/debian/control
@@ -7,8 +7,6 @@ Build-Depends:
   debhelper (>= 9), dh-exec, dh-buildinfo,
   cmake (>= 2.6), pkg-config, doxygen,
   libapt-pkg-dev (>= 1.0.10),
-  libwibble-dev (>= 1.1-1+b1), libwibble-dev (<< 2.0),
-  libtagcoll2-dev (>= 2.0.14-1+b1), libtagcoll2-dev (<< 2.1),
   libxapian-dev (>= 1.2.21-1.2)
 Standards-Version: 3.9.6.0
 Vcs-Git: git://git.debian.org/git/debtags/libept.git
@@ -20,10 +18,7 @@ Architecture: any
 Recommends: pkg-config
 Depends:
   libept1.4.16 (= ${binary:Version}),
-  libwibble-dev (>= 1.1-1+b1), libwibble-dev (<< 2.0),
-  libtagcoll2-dev (>= 2.0.14-1+b1), libtagcoll2-dev (<< 2.1),
   libapt-pkg-dev (>= 1.0.10), libxapian-dev (>= 1.2.21-1.2), ${misc:Depends}
-Built-Using: ${libwibble:Source}, ${tagcoll2:Source}
 Description: High-level library for managing Debian package information
  The library defines a very minimal framework in which many sources of data
  about Debian packages can be implemented and queried together.
@@ -42,7 +37,6 @@ Section: libs
 Architecture: any
 Multi-Arch: same
 Depends: ${shlibs:Depends}, ${misc:Depends}
-Built-Using: ${libwibble:Source}, ${tagcoll2:Source}
 Description: High-level library for managing Debian package information
  The library defines a very minimal framework in which many sources of data
  about Debian packages can be implemented and queried together.
diff --git a/debian/debuild.opts b/debian/debuild.opts
deleted file mode 100644
index b962575..0000000
--- a/debian/debuild.opts
+++ /dev/null
@@ -1 +0,0 @@
--i_darcs -I_darcs -iwibble -Iwibble
diff --git a/debian/rules b/debian/rules
index 37484a8..e689b30 100755
--- a/debian/rules
+++ b/debian/rules
@@ -2,9 +2,6 @@
 
 BUILDDIR = $(CURDIR)/debian/build
 
-libwibble_source = $(shell dpkg-query -f '$${source:Package} (= $${source:Version}), ' -W libwibble-dev)
-tagcoll2_source = $(shell dpkg-query -f '$${source:Package} (= $${source:Version}), ' -W libtagcoll2-dev)
-
 %:
 	dh $@ --buildsystem=cmake --builddirectory=$(BUILDDIR)
 
@@ -14,7 +11,7 @@ override_dh_fixperms:
 
 override_dh_auto_build:
 	dh_auto_build
-	make -C $(BUILDDIR) unit
+	make -C $(BUILDDIR) check
 	make -C $(BUILDDIR) doc
 
 override_dh_auto_install:
@@ -22,11 +19,6 @@ override_dh_auto_install:
 	dh_installdocs -plibept-dev -n $(BUILDDIR)/doc/html
 	dh_installdocs -plibept-dev -n $(BUILDDIR)/doc/libept.doxytags
 
-override_dh_gencontrol:
-	dh_gencontrol -- \
-	  -Vlibwibble:Source="$(libwibble_source)" \
-	  -Vtagcoll2:Source="$(tagcoll2_source)"
-
 debsrc:
 	debian/check_versions
 	gbp buildpackage --git-pristine-tar -S -us -uc
diff --git a/ept/CMakeLists.txt b/ept/CMakeLists.txt
index 96e1746..079cd95 100644
--- a/ept/CMakeLists.txt
+++ b/ept/CMakeLists.txt
@@ -1,35 +1,38 @@
 project( ept )
-include( ${WIBBLE_TEST_CMAKE} )
 
-file( GLOB src *.cpp debtags/*.cc debtags/maint/*.cc
-  popcon/*.cc popcon/maint/*.cc apt/*.cc axi/*.cc )
+# Find sources and tests
+file(GLOB src *.cpp debtags/*.cc debtags/maint/*.cc debtags/coll/*.cc apt/*.cc axi/*.cc utils/*.cc)
+file(GLOB tests *-test.cc apt/*-test.cc debtags/*-test.cc axi/*-test.cc)
+list(REMOVE_ITEM src ${tests})
 
+# Find headers
 file( GLOB h_top *.h )
 file( GLOB h_apt apt/*.h )
-file( GLOB h_debtags debtags/*.h debtags/*.tcc )
-file( GLOB h_debtags_maint debtags/maint/*.h debtags/maint/*.tcc )
-file( GLOB h_popcon popcon/*.h )
-file( GLOB h_popcon_maint popcon/maint/*.h )
+file( GLOB h_debtags debtags/*.h )
+file( GLOB h_debtags_maint debtags/maint/*.h )
+file( GLOB h_debtags_coll debtags/coll/*.h )
 file( GLOB h_axi axi/*.h )
+file( GLOB h_utils utils/*.h )
 
-file( GLOB debtagstesth debtags/*.test.h debtags/maint/*.test.h )
-file( GLOB popcontesth popcon/*.test.h )
-file( GLOB apttesth apt/*.test.h )
-file( GLOB axitesth axi/*.test.h )
-set( testh ${debtagstesth} ${popcontesth}
-           ${apttesth} ${axitesth} )
+#file( GLOB debtagstesth debtags/*.test.h debtags/maint/*.test.h )
+#file( GLOB apttesth apt/*.test.h )
+#file( GLOB axitesth axi/*.test.h )
+#set( testh ${debtagstesth} ${apttesth} ${axitesth} )
 
 include_directories( ${CMAKE_SOURCE_DIR} ${CMAKE_BINARY_DIR} 
                      ${TAGCOLL_INCLUDE_DIRS} ${WIBBLE_INCLUDE_DIRS} )
 link_libraries( ${WIBBLE_LIBRARIES} ${TAGCOLL_LIBRARIES} apt-pkg xapian -lpthread )
-add_definitions( -fexceptions -fPIC -fvisibility=default )
+add_definitions( --std=c++11 -fexceptions -fPIC -fvisibility=default )
 
 add_library( ept SHARED ${src} )
 add_library( ept-static STATIC ${src} )
 set_target_properties( ept PROPERTIES SOVERSION ${LIBEPT_SOVERSION} CLEAN_DIRECT_OUTPUT 1)
 set_target_properties( ept-static PROPERTIES SOVERSION ${LIBEPT_SOVERSION} OUTPUT_NAME "ept" CLEAN_DIRECT_OUTPUT 1)
 
-set( TEST_ENV_DIR ${ept_BINARY_DIR}/test-env/ )
+add_executable(test-ept EXCLUDE_FROM_ALL utils/tests-main.cc ${tests})
+target_link_libraries(test-ept ept)
+add_test(test-ept test-ept)
+add_dependencies(check test-ept)
 
 configure_file( ${ept_SOURCE_DIR}/config.h.cmake-in
   ${ept_BINARY_DIR}/config.h )
@@ -44,36 +47,6 @@ configure_file( ${ept_SOURCE_DIR}/libept.pc.in
 # regression testing
 link_directories( ${CMAKE_CURRENT_BINARY_DIR}/../lib )
 link_libraries( ept )
-wibble_add_test( ept-test ${testh} )
-
-set( datastamp ${CMAKE_CURRENT_BINARY_DIR}/data-stamp )
-set( datadir ${CMAKE_CURRENT_SOURCE_DIR}/test-data )
-set( listfile wherever_debian_._Packages )
-
-wibble_check_target( ept-test ${datastamp} )
-
-execute_process( COMMAND dpkg --print-architecture OUTPUT_VARIABLE ARCH )
-string( REPLACE "\n" "" ARCH "${ARCH}" )
-
-add_custom_command(
-  OUTPUT ${datastamp}
-  COMMAND mkdir -p test-env/etc test-env/state/lists/partial
-		           test-env/cache test-env/debtags
-			   test-env/cache/archives/partial test-env/desktop
-  COMMAND sed -e s,i386,${ARCH}, < ${datadir}/packagelist > test-env/state/lists/${listfile}
-  COMMAND cp -a ${datadir}/etc/sources.list test-env/etc/
-  COMMAND sed -e s,i386,${ARCH}, < ${datadir}/dpkg-status > test-env/dpkg-status
-  COMMAND cp -a ${datadir}/desktop/*.desktop test-env/desktop/
-  COMMAND cp ${datadir}/debtags/package-tags test-env/debtags/package-tags
-  COMMAND cp ${datadir}/debtags/vocabulary test-env/debtags/vocabulary
-  COMMAND mkdir -p test-env/debtags/empty
-  COMMAND mkdir -p test-env/debtags/user
-  COMMAND mkdir -p test-env/xapian/
-  COMMAND mkdir -p test-env/popcon/
-  COMMAND mkdir -p test-env/popcon/empty
-  COMMAND cp -a ${datadir}/popcon/all-popcon-results.txt.gz test-env/popcon/
-  COMMAND cp -a ${datadir}/popcon/popularity-contest test-env/popcon/
-  COMMAND touch data-stamp )
 
 install( TARGETS ept ept-static
     LIBRARY DESTINATION lib/${CMAKE_LIBRARY_ARCHITECTURE}
@@ -84,6 +57,6 @@ install( FILES ${h_top} DESTINATION include/ept )
 install( FILES ${h_apt} DESTINATION include/ept/apt )
 install( FILES ${h_debtags} DESTINATION include/ept/debtags )
 install( FILES ${h_debtags_maint} DESTINATION include/ept/debtags/maint )
-install( FILES ${h_popcon} DESTINATION include/ept/popcon )
-install( FILES ${h_popcon_maint} DESTINATION include/ept/popcon/maint )
+install( FILES ${h_debtags_coll} DESTINATION include/ept/debtags/coll )
 install( FILES ${h_axi} DESTINATION include/ept/axi )
+install( FILES ${h_utils} DESTINATION include/ept/utils )
diff --git a/ept/apt/apt-test.cc b/ept/apt/apt-test.cc
new file mode 100644
index 0000000..1a34f50
--- /dev/null
+++ b/ept/apt/apt-test.cc
@@ -0,0 +1,209 @@
+#include "ept/test.h"
+#include "apt.h"
+#include <set>
+#include <algorithm>
+
+using namespace std;
+using namespace ept;
+using namespace ept::tests;
+using namespace ept::apt;
+
+namespace {
+
+struct AptTestEnvironment {
+    //ept::core::AptDatabase db;
+    AptTestEnvironment() {
+        pkgInitConfig (*_config);
+        _config->Set("Initialized", 1);
+        _config->Set("Dir", ".");
+        _config->Set("Dir::Cache", "cache");
+        _config->Set("Dir::State", "state");
+        _config->Set("Dir::Etc", "etc");
+        _config->Set("Dir::Etc::sourcelist", "sources.list");
+        _config->Set("Dir::State::status", "./dpkg-status");
+        pkgInitSystem (*_config, _system);
+    }
+};
+
+class Tests : public TestCase
+{
+    using TestCase::TestCase;
+
+    void register_tests() override
+    {
+        add_method("iterators", []() {
+            // Check that iterations iterates among some packages
+            AptTestEnvironment env;
+            Apt apt;
+            Apt::iterator i = apt.begin();
+            wassert_true(i != apt.end());
+
+            size_t count = 0;
+            for (; i != apt.end(); ++i)
+                ++count;
+
+            wassert_true(count > 100);
+        });
+
+        add_method("apt_exists", []() {
+            // Check that iteration gives some well-known packages
+            AptTestEnvironment env;
+            Apt apt;
+            set<string> packages;
+
+            std::copy(apt.begin(), apt.end(), inserter(packages, packages.begin()));
+
+            wassert_true(packages.find("libsp1") != packages.end());
+            // TODO this exposes a bug somewhere... sp definitely is among
+            // the packages
+            // wassert_true(packages.find("sp") != packages.end());
+            wassert_true(packages.find("") == packages.end());
+        });
+
+        add_method("timestamp", []() {
+            // Check that timestamp gives some meaningful timestamp
+            AptTestEnvironment env;
+            Apt apt;
+            time_t ts = apt.timestamp();
+            wassert_true(ts > 1000000);
+        });
+
+        add_method("validity", []() {
+            // Check the package validator
+            AptTestEnvironment env;
+            Apt apt;
+            wassert_true(apt.isValid("apt"));
+            wassert_true(!apt.isValid("this-package-does-not-really-exists"));
+        });
+
+        add_method("versions", []() {
+            // Check the version instantiators
+            AptTestEnvironment env;
+            Apt apt;
+            std::string pkg("apt");
+            Version ver = apt.candidateVersion(pkg);
+            wassert_true(ver.isValid());
+
+            ver = apt.installedVersion(pkg);
+            wassert_true(ver.isValid());
+
+            ver = apt.anyVersion(pkg);
+            wassert_true(ver.isValid());
+
+            std::string pkg1("this-package-does-not-really-exists");
+            ver = apt.candidateVersion(pkg1);
+            wassert_true(!ver.isValid());
+
+            ver = apt.installedVersion(pkg1);
+            wassert_true(!ver.isValid());
+
+            ver = apt.anyVersion(pkg1);
+            wassert_true(!ver.isValid());
+        });
+
+        add_method("version_validity", []() {
+            // Check the version validator
+            AptTestEnvironment env;
+            Apt apt;
+            Version ver = apt.candidateVersion("apt");
+            wassert_true(apt.validate(ver) == ver);
+
+            ver = Version("this-package-does-not-really-exists", "0.1");
+            wassert_true(!apt.validate(ver).isValid());
+
+            ver = Version("apt", "0.31415");
+            wassert_true(!apt.validate(ver).isValid());
+        });
+
+        add_method("raw_record", []() {
+            // Check the raw record accessor
+            AptTestEnvironment env;
+            Apt apt;
+            string pkg("sp");
+            Version ver = apt.candidateVersion(pkg);
+            wassert_true(ver.isValid());
+            wassert_true(apt.validate(ver) == ver);
+
+            string record = apt.rawRecord(ver);
+            wassert_true(record.find("Package: sp") != string::npos);
+            wassert_true(record.find("Section: text") != string::npos);
+
+            record = apt.rawRecord(Version("sp", "0.31415"));
+            wassert(actual(record) == string());
+
+            wassert(actual(apt.rawRecord(pkg)) == apt.rawRecord(apt.anyVersion(pkg)));
+        });
+
+        add_method("state", []() {
+            // Check the package state accessor
+            AptTestEnvironment env;
+            Apt apt;
+            PackageState s = apt.state("kdenetwork");
+            wassert_true(s.isValid());
+            wassert_true(s.isInstalled());
+
+            s = apt.state("this-package-does-not-really-exists");
+            wassert_true(!s.isValid());
+        });
+
+        add_method("record_iteration", []() {
+            // Check the record iterator (accessing with *)
+            AptTestEnvironment env;
+            Apt apt;
+            size_t count = 0;
+            for (Apt::record_iterator i = apt.recordBegin();
+                 i != apt.recordEnd(); ++i)
+                {
+                    wassert_true((*i).size() > 8);
+                    wassert(actual((*i).substr(0, 8)) == "Package:");
+                    ++count;
+                }
+            wassert_true(count > 200);
+        });
+
+        add_method("record_iteration2", []() {
+            // Check the record iterator (accessing with ->)
+            AptTestEnvironment env;
+            Apt apt;
+            size_t count = 0;
+            for (Apt::record_iterator i = apt.recordBegin();
+                 i != apt.recordEnd(); ++i)
+                {
+                    wassert_true(i->size() > 8);
+                    wassert(actual(i->substr(0, 8)) == "Package:");
+                    ++count;
+                }
+            wassert_true(count > 200);
+        });
+
+        add_method("stl_iteration", []() {
+            // Check that the iterators can be used with the algorithms
+            AptTestEnvironment env;
+            Apt apt;
+            vector<string> out;
+            std::copy(apt.begin(), apt.end(), back_inserter(out));
+        });
+
+        add_method("stl_record_iteration", []() {
+            // Check that the iterators can be used with the algorithms
+            AptTestEnvironment env;
+            Apt apt;
+            vector<string> out;
+            std::copy(apt.recordBegin(), apt.recordEnd(), back_inserter(out));
+        });
+
+        add_method("check_updates", []() {
+            // Check that checkUpdates will keep a working Apt object
+            AptTestEnvironment env;
+            Apt apt;
+            wassert_true(apt.isValid("apt"));
+            apt.checkCacheUpdates();
+            wassert_true(apt.isValid("apt"));
+            apt.invalidateTimestamp();
+            apt.checkCacheUpdates();
+            wassert_true(apt.isValid("apt"));
+        });
+    }
+} tests("apt_apt");
+
+}
diff --git a/ept/apt/apt.cc b/ept/apt/apt.cc
index f3552f9..0825828 100644
--- a/ept/apt/apt.cc
+++ b/ept/apt/apt.cc
@@ -20,8 +20,8 @@
  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
  */
 
-#include <ept/apt/apt.h>
-
+#include "apt.h"
+#include "ept/utils/sys.h"
 #include <apt-pkg/error.h>
 #include <apt-pkg/init.h>
 #include <apt-pkg/progress.h>
@@ -29,12 +29,8 @@
 #include <apt-pkg/pkgcachegen.h>
 #include <apt-pkg/policy.h>
 #include <apt-pkg/cachefile.h>
-
-#include <wibble/sys/fs.h>
-
 #include <vector>
 #include <algorithm>
-
 #include <iostream>
 
 using namespace std;
@@ -44,29 +40,36 @@ namespace apt {
 
 static time_t aptTimestamp()
 {
-    namespace wfs = wibble::sys::fs;
+    time_t t1 = sys::timestamp(_config->FindFile("Dir::Cache::pkgcache"), 0);
+    time_t t2 = sys::timestamp(_config->FindFile("Dir::State::status"), 0);
 
-    time_t t1 = wfs::timestamp(_config->FindFile("Dir::Cache::pkgcache"), 0);
-    time_t t2 = wfs::timestamp(_config->FindFile("Dir::State::status"), 0);
- 
     return t1 > t2 ? t1 : t2;
 }
 
-Exception::Exception(const std::string& context) throw ()
-	: Generic(context)
+static std::string apt_annotate_error_message(const std::string& message)
 {
-	// Concatenate all errors and warnings found
-	string err;
-	while (!_error->empty())
-	{
-		bool type = _error->PopMessage(err);
-		if (type)
-			m_message += "E: " + err + "\n";
-		else
-			m_message += "W: " + err + "\n";
-   }
+    string res = message;
+    res += ":\n";
+    // Concatenate all errors and warnings found
+    string err;
+    while (!_error->empty())
+    {
+        bool type = _error->PopMessage(err);
+        if (type)
+            res += "E: " + err + "\n";
+        else
+            res += "W: " + err + "\n";
+    }
+    return res;
 }
 
+Exception::Exception(const std::string& message)
+    : std::runtime_error(apt_annotate_error_message(message))
+{
+}
+
+Exception::~Exception() noexcept {}
+
 static void aptInit ()
 {
     if (_config->FindB("Initialized"))
diff --git a/ept/apt/apt.h b/ept/apt/apt.h
index 6e6ce74..e71ecf7 100644
--- a/ept/apt/apt.h
+++ b/ept/apt/apt.h
@@ -24,27 +24,20 @@
  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
  */
 
-#include <wibble/exception.h>
 #include <ept/apt/version.h>
-
 #include <iterator>
+#include <stdexcept>
 
 class pkgCache;
 
 namespace ept {
 namespace apt {
 
-class Exception : public wibble::exception::Generic
+class Exception : public std::runtime_error
 {
-protected:
-	std::string m_message;
-
 public:
-	Exception(const std::string& context) throw ();
-	~Exception() throw () {}
-
-	virtual const char* type() const throw () { return "Apt"; }
-	virtual std::string desc() const throw () { return m_message; }
+    Exception(const std::string& message);
+    ~Exception() noexcept override;
 };
 
 class Apt;
diff --git a/ept/apt/apt.test.h b/ept/apt/apt.test.h
deleted file mode 100644
index ff4f315..0000000
--- a/ept/apt/apt.test.h
+++ /dev/null
@@ -1,193 +0,0 @@
-/*
- * Copyright (C) 2007  Enrico Zini <enrico@enricozini.org>
- *
- * This library is free software; you can redistribute it and/or
- * modify it under the terms of the GNU Lesser General Public
- * License as published by the Free Software Foundation; either
- * version 2.1 of the License, or (at your option) any later version.
- *
- * This library 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
- * Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public
- * License along with this library; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
- */
-
-#include <ept/test.h>
-#include <ept/apt/apt.h>
-#include <set>
-#include <algorithm>
-
-using namespace std;
-using namespace ept;
-using namespace ept::apt;
-
-struct TestApt : AptTestEnvironment {
-    Apt apt;
-
-    // Check that iterations iterates among some packages
-    Test iterators()
-    {
-        Apt::iterator i = apt.begin();
-        assert(i != apt.end());
-        
-        size_t count = 0;
-        for (; i != apt.end(); ++i)
-            ++count;
-
-        assert(count > 100);
-    }
-
-    // Check that iteration gives some well-known packages
-    Test aptExists()
-    {
-        set<string> packages;
- 
-        std::copy(apt.begin(), apt.end(), inserter(packages, packages.begin()));
-
-        assert(packages.find("libsp1") != packages.end());
-        // TODO this exposes a bug somewhere... sp definitely is among
-        // the packages
-        // assert(packages.find("sp") != packages.end());
-        assert(packages.find("") == packages.end());
-    }
-
-    // Check that timestamp gives some meaningful timestamp
-    Test timestamp()
-    {
-        time_t ts = apt.timestamp();
-        assert(ts > 1000000);
-    }
-
-    // Check the package validator
-    Test validity()
-    {
-        assert(apt.isValid("apt"));
-        assert(!apt.isValid("this-package-does-not-really-exists"));
-    }
-
-    // Check the version instantiators
-    Test versions()
-    {
-        std::string pkg("apt");
-        Version ver = apt.candidateVersion(pkg);
-        assert(ver.isValid());
-        
-        ver = apt.installedVersion(pkg);
-        assert(ver.isValid());
-
-        ver = apt.anyVersion(pkg);
-        assert(ver.isValid());
-
-        std::string pkg1("this-package-does-not-really-exists");
-        ver = apt.candidateVersion(pkg1);
-        assert(!ver.isValid());
-        
-        ver = apt.installedVersion(pkg1);
-        assert(!ver.isValid());
-
-        ver = apt.anyVersion(pkg1);
-        assert(!ver.isValid());
-    }
-
-    // Check the version validator
-    Test versionValidity()
-    {
-        Version ver = apt.candidateVersion("apt");
-        assert(apt.validate(ver) == ver);
-
-        ver = Version("this-package-does-not-really-exists", "0.1");
-        assert(!apt.validate(ver).isValid());
-
-        ver = Version("apt", "0.31415");
-        assert(!apt.validate(ver).isValid());
-    }
-
-    // Check the raw record accessor
-    Test rawRecord()
-    {
-        string pkg("sp");
-        Version ver = apt.candidateVersion(pkg);
-        assert(ver.isValid());
-        assert(apt.validate(ver) == ver);
-
-        string record = apt.rawRecord(ver);
-        assert(record.find("Package: sp") != string::npos);
-        assert(record.find("Section: text") != string::npos);
-
-        record = apt.rawRecord(Version("sp", "0.31415"));
-        assert_eq(record, string());
-
-        assert_eq(apt.rawRecord(pkg), apt.rawRecord(apt.anyVersion(pkg)));
-    }
-
-    // Check the package state accessor
-    Test state()
-    {
-        PackageState s = apt.state("kdenetwork");
-        assert(s.isValid());
-        assert(s.isInstalled());
-
-        s = apt.state("this-package-does-not-really-exists");
-        assert(!s.isValid());
-    }
-
-    // Check the record iterator (accessing with *)
-    Test recordIteration()
-    {
-        size_t count = 0;
-        for (Apt::record_iterator i = apt.recordBegin();
-             i != apt.recordEnd(); ++i)
-            {
-                assert((*i).size() > 8);
-                assert_eq((*i).substr(0, 8), "Package:");
-                ++count;
-            }
-        assert(count > 200);
-    }
-
-    // Check the record iterator (accessing with ->)
-    Test recordIteration2()
-    {
-        size_t count = 0;
-        for (Apt::record_iterator i = apt.recordBegin();
-             i != apt.recordEnd(); ++i)
-            {
-                assert(i->size() > 8);
-                assert_eq(i->substr(0, 8), "Package:");
-                ++count;
-            }
-        assert(count > 200);
-    }
-
-    // Check that the iterators can be used with the algorithms
-    Test stlIteration()
-    {
-        vector<string> out;
-        std::copy(apt.begin(), apt.end(), back_inserter(out));
-    }
-
-    // Check that the iterators can be used with the algorithms
-    Test stlRecordIteration()
-    {
-        vector<string> out;
-        std::copy(apt.recordBegin(), apt.recordEnd(), back_inserter(out));
-    }
-
-	// Check that checkUpdates will keep a working Apt object
-	Test checkUpdates()
-	{
-        assert(apt.isValid("apt"));
-		apt.checkCacheUpdates();
-        assert(apt.isValid("apt"));
-		apt.invalidateTimestamp();		
-		apt.checkCacheUpdates();
-        assert(apt.isValid("apt"));
-	}
-
-};
-
-// vim:set ts=4 sw=4:
diff --git a/ept/apt/packagerecord-test.cc b/ept/apt/packagerecord-test.cc
new file mode 100644
index 0000000..b421f5b
--- /dev/null
+++ b/ept/apt/packagerecord-test.cc
@@ -0,0 +1,126 @@
+#include "ept/test.h"
+#include "packagerecord.h"
+
+namespace std {
+    ostream& operator<<(ostream& out, const set<string>& s)
+        {
+            for (set<string>::const_iterator i = s.begin();
+                 i != s.end(); ++i)
+                if (i == s.begin())
+                    out << *i;
+                else
+                    out << ", " << *i;
+            return out;
+        }
+}
+
+using namespace std;
+using namespace ept;
+using namespace ept::tests;
+using namespace ept::apt;
+
+namespace {
+
+class Tests : public TestCase
+{
+    using TestCase::TestCase;
+
+    void register_tests() override
+    {
+        add_method("supported_fields", []() {
+            // Check that the supported fields are understood
+            string record =
+                "Package: apt\n"
+                "Priority: important\n"
+                "Section: admin\n"
+                "Installed-Size: 4368\n"
+                "Maintainer: APT Development Team <deity@lists.debian.org>\n"
+                "Architecture: amd64\n"
+                "Source: apt\n"
+                "Version: 0.6.46.4-0.1\n"
+                "Replaces: libapt-pkg-doc (<< 0.3.7), libapt-pkg-dev (<< 0.3.7)\n"
+                "Provides: libapt-pkg-libc6.3-6-3.11\n"
+                "Depends: libc6 (>= 2.3.5-1), libgcc1 (>= 1:4.1.1-12), libstdc++6 (>= 4.1.1-12), debian-archive-keyring\n"
+                "Pre-Depends: debtags (maybe)\n"
+                "Suggests: aptitude | synaptic | gnome-apt | wajig, dpkg-dev, apt-doc, bzip2\n"
+                "Recommends: debtags (maybe)\n"
+                "Enhances: debian\n"
+                "Conflicts: marameo\n"
+                "Filename: pool/main/a/apt/apt_0.6.46.4-0.1_amd64.deb\n"
+                "Size: 1436478\n"
+                "MD5sum: 1776421f80d6300c77a608e77a9f4a15\n"
+                "SHA1: 1bd7337d2df56d267632cf72ac930c0a4895898f\n"
+                "SHA256: b92442ab60046b4d0728245f39cc932f26e17db9f7933a5ec9aaa63172f51fda\n"
+                "Description: Advanced front-end for dpkg\n"
+                " This is Debian's next generation front-end for the dpkg package manager.\n"
+                " It provides the apt-get utility and APT dselect method that provides a\n"
+                " simpler, safer way to install and upgrade packages.\n"
+                " .\n"
+                " APT features complete installation ordering, multiple source capability\n"
+                " and several other unique features, see the Users Guide in apt-doc.\n"
+                "Build-Essential: yes\n"
+                "Tag: admin::package-management, filetransfer::ftp, filetransfer::http, hardware::storage:cd, interface::commandline, network::client, protocol::{ftp,http,ipv6}, role::program, suite::debian, use::downloading, use::searching, works-with::software:package\n";
+
+            PackageRecord p(record);
+
+            wassert(actual(p.size()) == 24u);
+
+            wassert(actual(p.package()) == "apt");
+            wassert(actual(p.priority()) == "important");
+            wassert(actual(p.section()) == "admin");
+            wassert(actual(p.installedSize()) == 4368u);
+            wassert(actual(p.maintainer()) == "APT Development Team <deity@lists.debian.org>");
+            wassert(actual(p.architecture()) == "amd64");
+            wassert(actual(p.source()) == "apt");
+            wassert(actual(p.version()) == "0.6.46.4-0.1");
+            wassert(actual(p.replaces()) == "libapt-pkg-doc (<< 0.3.7), libapt-pkg-dev (<< 0.3.7)");
+            wassert(actual(p.provides()) == "libapt-pkg-libc6.3-6-3.11");
+            wassert(actual(p.depends()) == "libc6 (>= 2.3.5-1), libgcc1 (>= 1:4.1.1-12), libstdc++6 (>= 4.1.1-12), debian-archive-keyring");
+            wassert(actual(p.preDepends()) == "debtags (maybe)");
+            wassert(actual(p.recommends()) == "debtags (maybe)");
+            wassert(actual(p.suggests()) == "aptitude | synaptic | gnome-apt | wajig, dpkg-dev, apt-doc, bzip2");
+            wassert(actual(p.enhances()) == "debian");
+            wassert(actual(p.conflicts()) == "marameo");
+            wassert(actual(p.filename()) == "pool/main/a/apt/apt_0.6.46.4-0.1_amd64.deb");
+            wassert(actual(p.packageSize()) == 1436478u);
+            wassert(actual(p.md5sum()) == "1776421f80d6300c77a608e77a9f4a15");
+            wassert(actual(p.sha1()) == "1bd7337d2df56d267632cf72ac930c0a4895898f");
+            wassert(actual(p.sha256()) == "b92442ab60046b4d0728245f39cc932f26e17db9f7933a5ec9aaa63172f51fda");
+            wassert(actual(p.description()) == "Advanced front-end for dpkg\n"
+                          " This is Debian's next generation front-end for the dpkg package manager.\n"
+                          " It provides the apt-get utility and APT dselect method that provides a\n"
+                          " simpler, safer way to install and upgrade packages.\n"
+                          " .\n"
+                          " APT features complete installation ordering, multiple source capability\n"
+                          " and several other unique features, see the Users Guide in apt-doc.");
+            wassert(actual(p.shortDescription()) == "Advanced front-end for dpkg");
+            wassert(actual(p.longDescription()) ==
+                          "This is Debian's next generation front-end for the dpkg package manager.\n"
+                          " It provides the apt-get utility and APT dselect method that provides a\n"
+                          " simpler, safer way to install and upgrade packages.\n"
+                          " .\n"
+                          " APT features complete installation ordering, multiple source capability\n"
+                          " and several other unique features, see the Users Guide in apt-doc.");
+            wassert(actual(p.buildEssential()) == true);
+            
+            std::set<std::string> tags;
+            tags.insert("admin::package-management");
+            tags.insert("filetransfer::ftp");
+            tags.insert("filetransfer::http");
+            tags.insert("hardware::storage:cd");
+            tags.insert("interface::commandline");
+            tags.insert("network::client");
+            tags.insert("protocol::ftp");
+            tags.insert("protocol::http");
+            tags.insert("protocol::ipv6");
+            tags.insert("role::program");
+            tags.insert("suite::debian");
+            tags.insert("use::downloading");
+            tags.insert("use::searching");
+            tags.insert("works-with::software:package");
+            wassert(actual(p.tag()) == tags);
+        });
+    }
+} tests("apt_packagerecord");
+
+}
diff --git a/ept/apt/packagerecord.test.h b/ept/apt/packagerecord.test.h
deleted file mode 100644
index 657cbab..0000000
--- a/ept/apt/packagerecord.test.h
+++ /dev/null
@@ -1,138 +0,0 @@
-/*
- * Copyright (C) 2007  Enrico Zini <enrico@enricozini.org>
- *
- * This library is free software; you can redistribute it and/or
- * modify it under the terms of the GNU Lesser General Public
- * License as published by the Free Software Foundation; either
- * version 2.1 of the License, or (at your option) any later version.
- *
- * This library 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
- * Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public
- * License along with this library; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
- */
-
-#include <ept/test.h>
-#include <ept/apt/packagerecord.h>
-
-namespace std {
-    ostream& operator<<(ostream& out, const set<string>& s)
-        {
-            for (set<string>::const_iterator i = s.begin();
-                 i != s.end(); ++i)
-                if (i == s.begin())
-                    out << *i;
-                else
-                    out << ", " << *i;
-            return out;
-        }
-}
-
-using namespace std;
-using namespace ept;
-using namespace ept::apt;
-
-struct TestAptPackagerecord {
-
-    // Check that the supported fields are understood
-    Test supportedFields()
-    {
-        string record =
-            "Package: apt\n"
-            "Priority: important\n"
-            "Section: admin\n"
-            "Installed-Size: 4368\n"
-            "Maintainer: APT Development Team <deity@lists.debian.org>\n"
-            "Architecture: amd64\n"
-            "Source: apt\n"
-            "Version: 0.6.46.4-0.1\n"
-            "Replaces: libapt-pkg-doc (<< 0.3.7), libapt-pkg-dev (<< 0.3.7)\n"
-            "Provides: libapt-pkg-libc6.3-6-3.11\n"
-            "Depends: libc6 (>= 2.3.5-1), libgcc1 (>= 1:4.1.1-12), libstdc++6 (>= 4.1.1-12), debian-archive-keyring\n"
-            "Pre-Depends: debtags (maybe)\n"
-            "Suggests: aptitude | synaptic | gnome-apt | wajig, dpkg-dev, apt-doc, bzip2\n"
-            "Recommends: debtags (maybe)\n"
-            "Enhances: debian\n"
-            "Conflicts: marameo\n"
-            "Filename: pool/main/a/apt/apt_0.6.46.4-0.1_amd64.deb\n"
-            "Size: 1436478\n"
-            "MD5sum: 1776421f80d6300c77a608e77a9f4a15\n"
-            "SHA1: 1bd7337d2df56d267632cf72ac930c0a4895898f\n"
-            "SHA256: b92442ab60046b4d0728245f39cc932f26e17db9f7933a5ec9aaa63172f51fda\n"
-            "Description: Advanced front-end for dpkg\n"
-            " This is Debian's next generation front-end for the dpkg package manager.\n"
-            " It provides the apt-get utility and APT dselect method that provides a\n"
-            " simpler, safer way to install and upgrade packages.\n"
-            " .\n"
-            " APT features complete installation ordering, multiple source capability\n"
-            " and several other unique features, see the Users Guide in apt-doc.\n"
-            "Build-Essential: yes\n"
-            "Tag: admin::package-management, filetransfer::ftp, filetransfer::http, hardware::storage:cd, interface::commandline, network::client, protocol::{ftp,http,ipv6}, role::program, suite::debian, use::downloading, use::searching, works-with::software:package\n";
-
-        PackageRecord p(record);
-
-        assert_eq(p.size(), 24u);
-
-        assert_eq(p.package(), "apt");
-        assert_eq(p.priority(), "important");
-        assert_eq(p.section(), "admin");
-        assert_eq(p.installedSize(), 4368u);
-        assert_eq(p.maintainer(), "APT Development Team <deity@lists.debian.org>");
-        assert_eq(p.architecture(), "amd64");
-        assert_eq(p.source(), "apt");
-        assert_eq(p.version(), "0.6.46.4-0.1");
-        assert_eq(p.replaces(), "libapt-pkg-doc (<< 0.3.7), libapt-pkg-dev (<< 0.3.7)");
-        assert_eq(p.provides(), "libapt-pkg-libc6.3-6-3.11");
-        assert_eq(p.depends(), "libc6 (>= 2.3.5-1), libgcc1 (>= 1:4.1.1-12), libstdc++6 (>= 4.1.1-12), debian-archive-keyring");
-        assert_eq(p.preDepends(), "debtags (maybe)");
-        assert_eq(p.recommends(), "debtags (maybe)");
-        assert_eq(p.suggests(), "aptitude | synaptic | gnome-apt | wajig, dpkg-dev, apt-doc, bzip2");
-        assert_eq(p.enhances(), "debian");
-        assert_eq(p.conflicts(), "marameo");
-        assert_eq(p.filename(), "pool/main/a/apt/apt_0.6.46.4-0.1_amd64.deb");
-        assert_eq(p.packageSize(), 1436478u);
-        assert_eq(p.md5sum(), "1776421f80d6300c77a608e77a9f4a15");
-        assert_eq(p.sha1(), "1bd7337d2df56d267632cf72ac930c0a4895898f");
-        assert_eq(p.sha256(), "b92442ab60046b4d0728245f39cc932f26e17db9f7933a5ec9aaa63172f51fda");
-        assert_eq(p.description(), "Advanced front-end for dpkg\n"
-                      " This is Debian's next generation front-end for the dpkg package manager.\n"
-                      " It provides the apt-get utility and APT dselect method that provides a\n"
-                      " simpler, safer way to install and upgrade packages.\n"
-                      " .\n"
-                      " APT features complete installation ordering, multiple source capability\n"
-                      " and several other unique features, see the Users Guide in apt-doc.");
-        assert_eq(p.shortDescription(), "Advanced front-end for dpkg");
-        assert_eq(p.longDescription(),
-                      "This is Debian's next generation front-end for the dpkg package manager.\n"
-                      " It provides the apt-get utility and APT dselect method that provides a\n"
-                      " simpler, safer way to install and upgrade packages.\n"
-                      " .\n"
-                      " APT features complete installation ordering, multiple source capability\n"
-                      " and several other unique features, see the Users Guide in apt-doc.");
-        assert_eq(p.buildEssential(), true);
-        
-        std::set<std::string> tags;
-        tags.insert("admin::package-management");
-        tags.insert("filetransfer::ftp");
-        tags.insert("filetransfer::http");
-        tags.insert("hardware::storage:cd");
-        tags.insert("interface::commandline");
-        tags.insert("network::client");
-        tags.insert("protocol::ftp");
-        tags.insert("protocol::http");
-        tags.insert("protocol::ipv6");
-        tags.insert("role::program");
-        tags.insert("suite::debian");
-        tags.insert("use::downloading");
-        tags.insert("use::searching");
-        tags.insert("works-with::software:package");
-        assert_eq(p.tag(), tags);
-    }
-
-};
-
-// vim:set ts=4 sw=4:
diff --git a/ept/apt/recordparser-test.cc b/ept/apt/recordparser-test.cc
new file mode 100644
index 0000000..4e01e6b
--- /dev/null
+++ b/ept/apt/recordparser-test.cc
@@ -0,0 +1,200 @@
+#include "ept/test.h"
+#include "recordparser.h"
+
+using namespace ept::tests;
+using namespace std;
+using namespace ept;
+using namespace ept::apt;
+
+namespace {
+
+const char* test_record =
+    "A:\n"
+    "D: da de di do du\n"
+    "B: b\n"
+    "C: c \n"
+    "Desc: this is the beginning\n"
+    " this is the continuation\n"
+    " this is the end\n";
+
+class Tests : public TestCase
+{
+    using TestCase::TestCase;
+
+    void register_tests() override
+    {
+        add_method("parsing", []() {
+            // Check that the fields are identified and broken up correctly
+            RecordParser p(test_record);
+
+            wassert(actual(p.record()) == test_record);
+            wassert(actual(p.size()) == 5u);
+        });
+
+        add_method("field_tuples", []() {
+            RecordParser p(test_record);
+            wassert(actual(p.field(0)) == "A:\n");
+            wassert(actual(p.field(1)) == "D: da de di do du\n");
+            wassert(actual(p.field(2)) == "B: b\n");
+            wassert(actual(p.field(3)) == "C: c \n");
+            wassert(actual(p.field(4)) == "Desc: this is the beginning\n this is the continuation\n this is the end\n");
+        });
+
+        add_method("field_keys", []() {
+            RecordParser p(test_record);
+            wassert(actual(p.name(0)) == "A");
+            wassert(actual(p.name(1)) == "D");
+            wassert(actual(p.name(2)) == "B");
+            wassert(actual(p.name(3)) == "C");
+            wassert(actual(p.name(4)) == "Desc");
+        });
+
+        add_method("field_values", []() {
+            RecordParser p(test_record);
+            wassert(actual(p[0]) == "");
+            wassert(actual(p[1]) == "da de di do du");
+            wassert(actual(p[2]) == "b");
+            wassert(actual(p[3]) == "c");
+            wassert(actual(p[4]) == "this is the beginning\n this is the continuation\n this is the end");
+        });
+
+        add_method("find_byname", []() {
+            // Check that the field search by name finds all the fields
+            RecordParser p(test_record);
+
+            wassert(actual(p.index("A")) == 0u);
+            wassert(actual(p.index("D")) == 1u);
+            wassert(actual(p.index("B")) == 2u);
+            wassert(actual(p.index("C")) == 3u);
+            wassert(actual(p.index("Desc")) == 4u);
+
+            wassert(actual(p.name(p.index("A"))) == "A");
+            wassert(actual(p.name(p.index("B"))) == "B");
+            wassert(actual(p.name(p.index("C"))) == "C");
+            wassert(actual(p.name(p.index("D"))) == "D");
+            wassert(actual(p.name(p.index("Desc"))) == "Desc");
+        });
+
+        add_method("indexing", []() {
+            RecordParser p(test_record);
+            wassert(actual(p["A"]) == "");
+            wassert(actual(p["B"]) == "b");
+            wassert(actual(p["C"]) == "c");
+            wassert(actual(p["D"]) == "da de di do du");
+            wassert(actual(p["Desc"]) == "this is the beginning\n this is the continuation\n this is the end");
+        });
+
+        add_method("missing_behaviour", []() {
+            RecordParser p(test_record);
+            // Missing fields give empty strings
+            wassert(actual(p.field(100)) == "");
+            wassert(actual(p.name(100)) == "");
+            wassert(actual(p[100]) == "");
+            wassert(actual(p["Missing"]) == "");
+        });
+
+        add_method("rescan", []() {
+            // Check that scanning twice replaces the old fields
+            std::string record =
+                "A: a\n"
+                "B: b\n"
+                "C: c\n";
+
+            RecordParser p(record);
+            wassert(actual(p.size()) == 3u);
+            wassert(actual(p["A"]) == "a");
+            wassert(actual(p["B"]) == "b");
+            wassert(actual(p["C"]) == "c");
+
+            std::string record1 =
+                "Foo: bar\n"
+                "A: different\n";
+
+            p.scan(record1);
+
+            //for (size_t i = 0; i < p.size(); ++i)
+            //      cerr << ">> " << i << "==" << p.index(p.name(i)) << " " << p.name(i) << " " << p[i] << endl;
+
+            wassert(actual(p.size()) == 2u);
+            wassert(actual(p["A"]) == "different");
+            wassert(actual(p["B"]) == "");
+            wassert(actual(p["C"]) == "");
+            wassert(actual(p["Foo"]) == "bar");
+        });
+
+        add_method("real_life", []() {
+            // Real-life example
+            string record = 
+                "Package: apt\n"
+                "Priority: important\n"
+                "Section: admin\n"
+                "Installed-Size: 4368\n"
+                "Maintainer: APT Development Team <deity@lists.debian.org>\n"
+                "Architecture: amd64\n"
+                "Version: 0.6.46.4-0.1\n"
+                "Replaces: libapt-pkg-doc (<< 0.3.7), libapt-pkg-dev (<< 0.3.7)\n"
+                "Provides: libapt-pkg-libc6.3-6-3.11\n"
+                "Depends: libc6 (>= 2.3.5-1), libgcc1 (>= 1:4.1.1-12), libstdc++6 (>= 4.1.1-12), debian-archive-keyring\n"
+                "Suggests: aptitude | synaptic | gnome-apt | wajig, dpkg-dev, apt-doc, bzip2\n"
+                "Filename: pool/main/a/apt/apt_0.6.46.4-0.1_amd64.deb\n"
+                "Size: 1436478\n"
+                "MD5sum: 1776421f80d6300c77a608e77a9f4a15\n"
+                "SHA1: 1bd7337d2df56d267632cf72ac930c0a4895898f\n"
+                "SHA256: b92442ab60046b4d0728245f39cc932f26e17db9f7933a5ec9aaa63172f51fda\n"
+                "Description: Advanced front-end for dpkg\n"
+                " This is Debian's next generation front-end for the dpkg package manager.\n"
+                " It provides the apt-get utility and APT dselect method that provides a\n"
+                " simpler, safer way to install and upgrade packages.\n"
+                " .\n"
+                " APT features complete installation ordering, multiple source capability\n"
+                " and several other unique features, see the Users Guide in apt-doc.\n"
+                "Build-Essential: yes\n"
+                "Tag: admin::package-management, filetransfer::ftp, filetransfer::http, hardware::storage:cd, interface::commandline, network::client, protocol::{ftp,http,ipv6}, role::program, suite::debian, use::downloading, use::searching, works-with::software:package\n";
+            RecordParser p(record);
+
+            wassert(actual(p.size()) == 19u);
+
+            string rec1;
+            for (size_t i = 0; i < p.size(); ++i)
+                rec1 += p.field(i);
+            wassert(actual(record) == rec1);
+        });
+
+        add_method("buffer_termination", []() {
+            // Various buffer termination patterns
+            std::string record =
+                "A: a\n"
+                "B: b";
+
+            RecordParser p(record);
+            wassert(actual(p.size()) == 2u);
+            wassert(actual(p["A"]) == "a");
+            wassert(actual(p["B"]) == "b");
+        });
+
+        add_method("buffer_termination2", []() {
+            std::string record =
+                "A: a\n"
+                "B: b\n\n";
+
+            RecordParser p(record);
+            wassert(actual(p.size()) == 2u);
+            wassert(actual(p["A"]) == "a");
+            wassert(actual(p["B"]) == "b");
+        });
+
+        add_method("buffer_termination3", []() {
+            std::string record =
+                "A: a\n"
+                "B: b\n\n"
+                "C: c\n";
+
+            RecordParser p(record);
+            wassert(actual(p.size()) == 2u);
+            wassert(actual(p["A"]) == "a");
+            wassert(actual(p["B"]) == "b");
+        });
+    }
+} tests("apt_recordparser");
+
+}
diff --git a/ept/apt/recordparser.test.h b/ept/apt/recordparser.test.h
deleted file mode 100644
index 629008f..0000000
--- a/ept/apt/recordparser.test.h
+++ /dev/null
@@ -1,228 +0,0 @@
-/*
- * Copyright (C) 2007  Enrico Zini <enrico@enricozini.org>
- *
- * This library is free software; you can redistribute it and/or
- * modify it under the terms of the GNU Lesser General Public
- * License as published by the Free Software Foundation; either
- * version 2.1 of the License, or (at your option) any later version.
- *
- * This library 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
- * Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public
- * License along with this library; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
- */
-
-#include <ept/test.h>
-#include <ept/apt/recordparser.h>
-
-//#include <iostream>
-
-using namespace std;
-using namespace ept;
-using namespace ept::apt;
-
-struct TestAptRecordparser {
-    std::string record;
-    TestAptRecordparser()
-    {
-        record =
-            "A:\n"
-            "D: da de di do du\n"
-            "B: b\n"
-            "C: c \n"
-            "Desc: this is the beginning\n"
-            " this is the continuation\n"
-            " this is the end\n";
-    }
-
-    // Check that the fields are identified and broken up correctly
-    Test parsing()
-    {
-        RecordParser p(record);
-        
-        assert_eq(p.record(), record);
-        assert_eq(p.size(), 5u);
-    }
-
-    Test fieldTuples()
-    {
-        RecordParser p(record);
-        assert_eq(p.field(0), "A:\n");
-        assert_eq(p.field(1), "D: da de di do du\n");
-        assert_eq(p.field(2), "B: b\n");
-        assert_eq(p.field(3), "C: c \n");
-        assert_eq(p.field(4), "Desc: this is the beginning\n this is the continuation\n this is the end\n");
-    }
-
-    Test fieldKeys()
-    {
-        RecordParser p(record);
-        assert_eq(p.name(0), "A");
-        assert_eq(p.name(1), "D");
-        assert_eq(p.name(2), "B");
-        assert_eq(p.name(3), "C");
-        assert_eq(p.name(4), "Desc");
-    }
-
-    Test fieldValues()
-    {
-        RecordParser p(record);
-        assert_eq(p[0], "");
-        assert_eq(p[1], "da de di do du");
-        assert_eq(p[2], "b");
-        assert_eq(p[3], "c");
-        assert_eq(p[4], "this is the beginning\n this is the continuation\n this is the end");
-    }
-
-    // Check that the field search by name finds all the fields
-    Test findByName()
-    {
-        RecordParser p(record);
-
-        assert_eq(p.index("A"), 0u);
-        assert_eq(p.index("D"), 1u);
-        assert_eq(p.index("B"), 2u);
-        assert_eq(p.index("C"), 3u);
-        assert_eq(p.index("Desc"), 4u);
-
-        assert_eq(p.name(p.index("A")), "A");
-        assert_eq(p.name(p.index("B")), "B");
-        assert_eq(p.name(p.index("C")), "C");
-        assert_eq(p.name(p.index("D")), "D");
-        assert_eq(p.name(p.index("Desc")), "Desc");
-    }
-
-    Test indexing()
-    {
-        RecordParser p(record);
-        assert_eq(p["A"], "");
-        assert_eq(p["B"], "b");
-        assert_eq(p["C"], "c");
-        assert_eq(p["D"], "da de di do du");
-        assert_eq(p["Desc"], "this is the beginning\n this is the continuation\n this is the end");
-    }
-
-    Test missingBehaviour()
-    {
-        RecordParser p(record);
-        // Missing fields give empty strings
-        assert_eq(p.field(100), "");
-        assert_eq(p.name(100), "");
-        assert_eq(p[100], "");
-        assert_eq(p["Missing"], "");
-    }
-
-    // Check that scanning twice replaces the old fields
-    Test rescan()
-    {
-        std::string record =
-            "A: a\n"
-            "B: b\n"
-            "C: c\n";
-
-        RecordParser p(record);
-        assert_eq(p.size(), 3u);
-        assert_eq(p["A"], "a");
-        assert_eq(p["B"], "b");
-        assert_eq(p["C"], "c");
-
-        std::string record1 =
-            "Foo: bar\n"
-            "A: different\n";
-
-        p.scan(record1);
-
-        //for (size_t i = 0; i < p.size(); ++i)
-        //      cerr << ">> " << i << "==" << p.index(p.name(i)) << " " << p.name(i) << " " << p[i] << endl;
-
-        assert_eq(p.size(), 2u);
-        assert_eq(p["A"], "different");
-        assert_eq(p["B"], "");
-        assert_eq(p["C"], "");
-        assert_eq(p["Foo"], "bar");
-    }
-
-    // Real-life example
-    Test realLife()
-    {
-        string record = 
-            "Package: apt\n"
-            "Priority: important\n"
-            "Section: admin\n"
-            "Installed-Size: 4368\n"
-            "Maintainer: APT Development Team <deity@lists.debian.org>\n"
-            "Architecture: amd64\n"
-            "Version: 0.6.46.4-0.1\n"
-            "Replaces: libapt-pkg-doc (<< 0.3.7), libapt-pkg-dev (<< 0.3.7)\n"
-            "Provides: libapt-pkg-libc6.3-6-3.11\n"
-            "Depends: libc6 (>= 2.3.5-1), libgcc1 (>= 1:4.1.1-12), libstdc++6 (>= 4.1.1-12), debian-archive-keyring\n"
-            "Suggests: aptitude | synaptic | gnome-apt | wajig, dpkg-dev, apt-doc, bzip2\n"
-            "Filename: pool/main/a/apt/apt_0.6.46.4-0.1_amd64.deb\n"
-            "Size: 1436478\n"
-            "MD5sum: 1776421f80d6300c77a608e77a9f4a15\n"
-            "SHA1: 1bd7337d2df56d267632cf72ac930c0a4895898f\n"
-            "SHA256: b92442ab60046b4d0728245f39cc932f26e17db9f7933a5ec9aaa63172f51fda\n"
-            "Description: Advanced front-end for dpkg\n"
-            " This is Debian's next generation front-end for the dpkg package manager.\n"
-            " It provides the apt-get utility and APT dselect method that provides a\n"
-            " simpler, safer way to install and upgrade packages.\n"
-            " .\n"
-            " APT features complete installation ordering, multiple source capability\n"
-            " and several other unique features, see the Users Guide in apt-doc.\n"
-            "Build-Essential: yes\n"
-            "Tag: admin::package-management, filetransfer::ftp, filetransfer::http, hardware::storage:cd, interface::commandline, network::client, protocol::{ftp,http,ipv6}, role::program, suite::debian, use::downloading, use::searching, works-with::software:package\n";
-        RecordParser p(record);
-
-        assert_eq(p.size(), 19u);
-
-        string rec1;
-        for (size_t i = 0; i < p.size(); ++i)
-            rec1 += p.field(i);
-        assert_eq(record, rec1);
-    }
-
-    // Various buffer termination patterns
-    Test bufferTermination()
-    {
-        std::string record =
-            "A: a\n"
-            "B: b";
-
-        RecordParser p(record);
-        assert_eq(p.size(), 2u);
-        assert_eq(p["A"], "a");
-        assert_eq(p["B"], "b");
-    }
-
-    Test bufferTermination2()
-    {
-        std::string record =
-            "A: a\n"
-            "B: b\n\n";
-
-        RecordParser p(record);
-        assert_eq(p.size(), 2u);
-        assert_eq(p["A"], "a");
-        assert_eq(p["B"], "b");
-    }
-
-    Test bufferTermination3()
-    {
-        std::string record =
-            "A: a\n"
-            "B: b\n\n"
-            "C: c\n";
-
-        RecordParser p(record);
-        assert_eq(p.size(), 2u);
-        assert_eq(p["A"], "a");
-        assert_eq(p["B"], "b");
-    }
-
-};
-
-// vim:set ts=4 sw=4:
diff --git a/ept/apt/version-test.cc b/ept/apt/version-test.cc
new file mode 100644
index 0000000..0fac7dc
--- /dev/null
+++ b/ept/apt/version-test.cc
@@ -0,0 +1,119 @@
+#include "ept/test.h"
+#include "version.h"
+
+using namespace std;
+using namespace ept::tests;
+using namespace ept::apt;
+
+namespace {
+
+class Tests : public TestCase
+{
+    using TestCase::TestCase;
+
+    void register_tests() override
+    {
+        add_method("invalid", []() {
+            // Basic test for invalid version
+            Version test;
+
+            wassert(actual(test.name()) == "");
+            wassert(actual(test.version()) == "");
+            wassert(actual(test.isValid()) == false);
+
+            string p = test.name();
+
+            wassert(actual(p) == string());
+        });
+
+        add_method("basic", []() {
+            // Basic test for version
+            Version test("test", "1.0");
+
+            wassert(actual(test.name()) == "test");
+            wassert(actual(test.version()) == "1.0");
+            wassert(actual(test.isValid()) == true);
+
+            string p = test.name();
+
+            wassert(actual(p) == "test");
+
+            Version v(p, "1.1");
+            wassert(actual(v.name()) == "test");
+            wassert(actual(v.version()) == "1.1");
+            wassert(actual(v.isValid()) == true);
+        });
+
+        add_method("comparison", []() {
+            // Comparison semanthics
+            Version test("test", "1.0");
+            Version test1("test", "1.0");
+
+            wassert_true(test == test1);
+            wassert_true(! (test != test1));
+            wassert_true(! (test < test1));
+            wassert_true(! (test > test1));
+            wassert_true(test <= test1);
+            wassert_true(test >= test1);
+
+
+            Version test2("test2", "1.0");
+
+            wassert_true(test != test2);
+            wassert_true(test != test2);
+            wassert_true(test < test2);
+            wassert_true(! (test > test2));
+            wassert_true(test <= test2);
+            wassert_true(! (test >= test2));
+
+
+            Version test3("test", "2.0");
+
+            wassert_true(test != test3);
+            wassert_true(test != test3);
+            wassert_true(test < test3);
+            wassert_true(! (test > test3));
+            wassert_true(test <= test3);
+            wassert_true(! (test >= test3));
+        });
+
+        add_method("value_copy", []() {
+            // Value-copy semanthics
+            Version test("test", "1.0");
+            Version test1 = test;
+
+            wassert_true(test == test1);
+
+            Version test2;
+            test2 = test;
+            wassert_true(test == test2);
+            wassert_true(test1 == test2);
+
+            Version test3("test", "1.0");
+            wassert_true(test == test3);
+            wassert_true(test1 == test3);
+            wassert_true(test2 == test3);
+        });
+
+        add_method("upstream_version", []() {
+            // Extraction of upstream version
+            wassert(actual(Version("a", "10.0").upstreamVersion()) == "10.0");
+            wassert(actual(Version("a", "10.0-1").upstreamVersion()) == "10.0");
+            wassert(actual(Version("a", "10.0~foo.1-1.0").upstreamVersion()) == "10.0~foo.1");
+            wassert(actual(Version("a", "1.0:10.0~foo.1-1.0").upstreamVersion()) == "10.0~foo.1");
+        });
+
+        add_method("policy_comparison", []() {
+            // Debian policy comparison semanthics
+            wassert_true(Version("a", "10.0") > Version("a", "2.1"));
+            wassert_true(Version("a", "1:10.0") < Version("a", "2:2.1"));
+            wassert_true(Version("a", "10.0-1") < Version("a", "10.0-2"));
+            wassert_true(Version("a", "10.0-2") > Version("a", "10.0-1"));
+            wassert_true(Version("a", "1:10.0-1") <= Version("a", "1:10.0-1"));
+            wassert_true(Version("a", "1:10.0-1") >= Version("a", "1:10.0-1"));
+            // TODO: add more
+        });
+    }
+} tests("apt_version");
+
+}
diff --git a/ept/apt/version.test.h b/ept/apt/version.test.h
deleted file mode 100644
index a06a5c6..0000000
--- a/ept/apt/version.test.h
+++ /dev/null
@@ -1,136 +0,0 @@
-/*
- * Copyright (C) 2007  Enrico Zini <enrico@enricozini.org>
- *
- * This library is free software; you can redistribute it and/or
- * modify it under the terms of the GNU Lesser General Public
- * License as published by the Free Software Foundation; either
- * version 2.1 of the License, or (at your option) any later version.
- *
- * This library 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
- * Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public
- * License along with this library; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
- */
-
-#include <ept/test.h>
-#include <ept/apt/version.h>
-
-using namespace std;
-using namespace ept::apt;
-
-struct TestAptVersion {
-
-    // Basic test for invalid version
-    Test invalid()
-    {
-        Version test;
-
-        assert_eq(test.name(), "");
-        assert_eq(test.version(), "");
-        assert_eq(test.isValid(), false);
-
-        string p = test.name();
-
-        assert_eq(p, string());
-    }
-
-    // Basic test for version
-    Test basic()
-    {
-        Version test("test", "1.0");
-
-        assert_eq(test.name(), "test");
-        assert_eq(test.version(), "1.0");
-        assert_eq(test.isValid(), true);
-
-        string p = test.name();
-
-        assert_eq(p, "test");
-
-        Version v(p, "1.1");
-        assert_eq(v.name(), "test");
-        assert_eq(v.version(), "1.1");
-        assert_eq(v.isValid(), true);
-    }
-
-    // Comparison semanthics
-    Test comparison()
-    {
-        Version test("test", "1.0");
-        Version test1("test", "1.0");
-
-        assert(test == test1);
-        assert(! (test != test1));
-        assert(! (test < test1));
-        assert(! (test > test1));
-        assert(test <= test1);
-        assert(test >= test1);
-
-
-        Version test2("test2", "1.0");
-
-        assert(test != test2);
-        assert(test != test2);
-        assert(test < test2);
-        assert(! (test > test2));
-        assert(test <= test2);
-        assert(! (test >= test2));
-
-
-        Version test3("test", "2.0");
-
-        assert(test != test3);
-        assert(test != test3);
-        assert(test < test3);
-        assert(! (test > test3));
-        assert(test <= test3);
-        assert(! (test >= test3));
-    }
-
-    // Value-copy semanthics
-    Test valueCopy()
-    {
-        Version test("test", "1.0");
-        Version test1 = test;
-
-        assert(test == test1);
-
-        Version test2;
-        test2 = test;
-        assert(test == test2);
-        assert(test1 == test2);
-
-        Version test3("test", "1.0");
-        assert(test == test3);
-        assert(test1 == test3);
-        assert(test2 == test3);
-    }
-
-    // Extraction of upstream version
-    Test upstreamVersion()
-    {
-        assert_eq(Version("a", "10.0").upstreamVersion(), "10.0");
-        assert_eq(Version("a", "10.0-1").upstreamVersion(), "10.0");
-        assert_eq(Version("a", "10.0~foo.1-1.0").upstreamVersion(), "10.0~foo.1");
-        assert_eq(Version("a", "1.0:10.0~foo.1-1.0").upstreamVersion(), "10.0~foo.1");
-    }
-
-    // Debian policy comparison semanthics
-    Test policyComparison()
-    {
-        assert(Version("a", "10.0") > Version("a", "2.1"));
-        assert(Version("a", "1:10.0") < Version("a", "2:2.1"));
-        assert(Version("a", "10.0-1") < Version("a", "10.0-2"));
-        assert(Version("a", "10.0-2") > Version("a", "10.0-1"));
-        assert(Version("a", "1:10.0-1") <= Version("a", "1:10.0-1"));
-        assert(Version("a", "1:10.0-1") >= Version("a", "1:10.0-1"));
-        // TODO: add more
-    }
-
-};
-
-// vim:set ts=4 sw=4:
diff --git a/ept/axi/axi-test.cc b/ept/axi/axi-test.cc
new file mode 100644
index 0000000..3e39b19
--- /dev/null
+++ b/ept/axi/axi-test.cc
@@ -0,0 +1,30 @@
+#include "ept/test.h"
+#include "axi.h"
+#include "ept/apt/apt.h"
+#include "ept/utils/sys.h"
+#include <set>
+
+using namespace ept::tests;
+using namespace std;
+using namespace ept;
+
+namespace {
+
+class Tests : public TestCase
+{
+    using TestCase::TestCase;
+
+    void register_tests() override
+    {
+        add_method("empty", []() {
+            // Access an empty index
+            sys::mkdir_ifmissing("xapian", 0755);
+            apt::Apt apt;
+            axi::OverrideIndexDir oid("./empty");
+            wassert(actual(axi::timestamp()) == 0);
+            sys::rmdir("xapian");
+        });
+    }
+} tests("axi");
+
+}
diff --git a/ept/axi/axi.cc b/ept/axi/axi.cc
index 020d079..491e181 100644
--- a/ept/axi/axi.cc
+++ b/ept/axi/axi.cc
@@ -23,15 +23,12 @@
  */
 
 #include <ept/config.h>
-#include <ept/axi/axi.h>
-
-#include <wibble/exception.h>
-#include <wibble/string.h>
-#include <wibble/sys/fs.h>
+#include "axi.h"
+#include "ept/utils/sys.h"
+#include "ept/utils/string.h"
 #include <memory>
 
 using namespace std;
-using namespace wibble;
 
 namespace ept {
 namespace axi {
@@ -50,8 +47,8 @@ std::string path_db()
 
 time_t timestamp()
 {
-	string tsfile = str::joinpath(m_index_dir, "update-timestamp");
-    return sys::fs::timestamp(tsfile, 0);
+    string tsfile = str::joinpath(m_index_dir, "update-timestamp");
+    return sys::timestamp(tsfile, 0);
 }
 
 
diff --git a/ept/axi/axi.test.h b/ept/axi/axi.test.h
deleted file mode 100644
index 5481bd8..0000000
--- a/ept/axi/axi.test.h
+++ /dev/null
@@ -1,58 +0,0 @@
-// -*- mode: c++; tab-width: 4; indent-tabs-mode: t -*-
-/*
- * popcon test
- *
- * Copyright (C) 2007  Enrico Zini <enrico@debian.org>
- *
- * 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 2 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, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
- */
-
-#include <ept/test.h>
-#include <ept/axi/axi.h>
-#include <ept/apt/apt.h>
-#include <wibble/sys/fs.h>
-#include <set>
-
-using namespace std;
-using namespace ept;
-
-struct DirMaker
-{
-	DirMaker(const std::string& name)
-	{
-		wibble::sys::fs::mkdirIfMissing(name, 0755);
-	}
-};
-
-struct TestAxi : AptTestEnvironment
-{
-	DirMaker md;
-	axi::OverrideIndexDir oid;
-	apt::Apt apt;
-
-	TestAxi()
-		: md( TEST_ENV_DIR "xapian"), oid( TEST_ENV_DIR "xapian")
-	{
-	}
-
-// Access an empty index
-	Test empty()
-	{
-		axi::OverrideIndexDir oid("./empty");
-		assert_eq(axi::timestamp(), 0);
-	}
-};
-
-// vim:set ts=4 sw=4:
diff --git a/ept/debtags/coll/TextFormat.cc b/ept/debtags/coll/TextFormat.cc
new file mode 100644
index 0000000..7681d3d
--- /dev/null
+++ b/ept/debtags/coll/TextFormat.cc
@@ -0,0 +1,221 @@
+/*
+ * Serialize a tagged collection to a text file
+ *
+ * Copyright (C) 2003--2015  Enrico Zini <enrico@debian.org>
+ *
+ * This library is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU Lesser General Public
+ * License as published by the Free Software Foundation; either
+ * version 2.1 of the License, or (at your option) any later version.
+ *
+ * This library 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
+ * Lesser General Public License for more details.
+ *
+ * You should have received a copy of the GNU Lesser General Public
+ * License along with this library; if not, write to the Free Software
+ * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
+ */
+
+#include "TextFormat.h"
+#include "fast.h"
+#include "operators.h"
+#include <stdexcept>
+#include <system_error>
+#include <set>
+
+using namespace std;
+using namespace ept::debtags::coll::operators;
+
+namespace ept {
+namespace debtags {
+namespace coll {
+namespace textformat {
+
+// Parse an element
+// Return the trailing separating char, that can be:
+//  input::Input::Eof
+//  '\n'
+//  ':'
+//  ','
+// Return the item in `item'
+
+// element: \s*[^ \t,:]\s*([.:])\s*
+// or
+// element: \s*[^ \t,:].*?[^ \t,:]\s*([.:])\s+
+int parseElement(FILE* in, const std::string& pathname, string& item)
+{
+    item = string();
+    string sep;
+    int c;
+    char sepchar = 0;
+    enum {LSPACE, ITEM, ISPACE, ISEP, TSPACE} state = LSPACE;
+    while ((c = getc(in)) != EOF)
+    {
+        if (c == '\n')
+        {
+            if (sepchar && sepchar != ':')
+                throw std::runtime_error("separator character ends the line");
+            else
+                return '\n';
+        }
+        switch (state)
+        {
+            // Optional leading space
+            case LSPACE:
+                switch (c)
+                {
+                    case ' ':
+                    case '\t':
+                        break;
+                    case ':':
+                    case ',':
+                        throw std::runtime_error("element cannot start with a separation character");
+                        break;
+                    default:
+                        item += c;
+                        state = ITEM;
+                        break;
+                }
+                break;
+            // Non-separating characters
+            case ITEM:
+                switch (c)
+                {
+                    case ' ':
+                    case '\t':
+                        sep += c;
+                        state = ISPACE;
+                        break;
+                    case ':':
+                    case ',':
+                        sepchar = c;
+                        sep += c;
+                        state = ISEP;
+                        break;
+                    default:
+                        item += c;
+                        break;
+                }
+                break;
+            // Space inside item or at the end of item
+            case ISPACE:
+                switch (c)
+                {
+                    case ' ':
+                    case '\t':
+                        sep += c;
+                        break;
+                    case ':':
+                    case ',':
+                        sepchar = c;
+                        state = TSPACE;
+                        break;
+                    default:
+                        item += sep;
+                        item += c;
+                        sep = string();
+                        state = ITEM;
+                        break;
+                }
+                break;
+            // Separator inside item or at the end of item
+            case ISEP:
+                switch (c)
+                {
+                    case ' ':
+                    case '\t':
+                        if (sep.size() > 1)
+                            throw std::runtime_error("item is followed by more than one separator characters");
+                        state = TSPACE;
+                        break;
+                    case ':':
+                    case ',':
+                        sep += c;
+                        break;
+                    default:
+                        item += sep;
+                        item += c;
+                        sepchar = 0;
+                        sep = string();
+                        state = ITEM;
+                        break;
+                }
+                break;
+            case TSPACE:
+                switch (c)
+                {
+                    case ' ':
+                    case '\t':
+                        break;
+                    default:
+                        ungetc(c, in);
+                        return sepchar;
+                }
+                break;
+        }
+    }
+    if (ferror(in))
+        throw std::system_error(errno, std::system_category(), "cannot read from " + pathname);
+    return EOF;
+}
+
+
+// item1, item2, item3: tag1, tag2, tag3
+
+//#define TRACE_PARSE
+void parse(FILE* in, const std::string& pathname, Fast& out)
+{
+    string item;
+
+    std::set<string> itemset;
+    std::set<string> tagset;
+    int sep;
+    enum {ITEMS, TAGS} state = ITEMS;
+    int line = 1;
+    do
+    {
+        sep = parseElement(in, pathname, item);
+        
+        if (item.size() != 0)
+        {
+            if (state == ITEMS)
+                itemset |= item;
+            else
+                tagset |= item;
+        }
+        
+        switch (sep)
+        {
+            case '\n':
+                line++;
+            case EOF:
+                if (!(itemset.empty() && tagset.empty()))
+                {
+                    if (itemset.empty())
+                        throw std::runtime_error("no elements before ':' separator");
+                    if (tagset.empty())
+                        out.insert(itemset, std::set<std::string>());
+                    else
+                        out.insert(itemset, tagset);
+                }
+                itemset.clear();
+                tagset.clear();
+                state = ITEMS;
+                break;
+            case ':':
+                if (state == TAGS)
+                    throw std::runtime_error("separator ':' appears twice");
+                state = TAGS;
+                break;
+            default:
+                break;
+        }
+    } while (sep != EOF);
+}
+
+}
+}
+}
+}
diff --git a/ept/debtags/coll/TextFormat.h b/ept/debtags/coll/TextFormat.h
new file mode 100644
index 0000000..663711d
--- /dev/null
+++ b/ept/debtags/coll/TextFormat.h
@@ -0,0 +1,66 @@
+#ifndef EPT_DEBTAGS_COLL_TEXTFORMAT_H
+#define EPT_DEBTAGS_COLL_TEXTFORMAT_H
+
+/** \file
+ * Serialize and deserialize a tagged collection to a text file
+ */
+
+/*
+ * Copyright (C) 2003--2015  Enrico Zini <enrico@debian.org>
+ *
+ * This library is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU Lesser General Public
+ * License as published by the Free Software Foundation; either
+ * version 2.1 of the License, or (at your option) any later version.
+ *
+ * This library 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
+ * Lesser General Public License for more details.
+ *
+ * You should have received a copy of the GNU Lesser General Public
+ * License along with this library; if not, write to the Free Software
+ * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
+ */
+
+#include <cstdio>
+#include <string>
+
+//#define TRACE_PARSE
+
+namespace ept {
+namespace debtags {
+namespace coll {
+struct Fast;
+
+namespace textformat {
+
+/**
+ * Parse an element from input
+ *
+ * @retval item
+ *   The item found on input
+ * @return
+ *   the trailing separating char, that can be:
+ *   \li input::Input::Eof
+ *   \li '\n'
+ *   \li ':'
+ *   \li ','
+ */
+int parseElement(FILE* in, const std::string& pathname, std::string& item);
+
+
+/*
+ * Parse a tagged collection, sending the results to out.
+ *
+ * @param out
+ *   An output iterator accepting a std::pair<string, string>
+ */
+void parse(FILE* in, const std::string& pathname, Fast& out);
+
+}
+}
+}
+}
+
+#endif
diff --git a/ept/debtags/coll/fast.cc b/ept/debtags/coll/fast.cc
new file mode 100644
index 0000000..43ee143
--- /dev/null
+++ b/ept/debtags/coll/fast.cc
@@ -0,0 +1,247 @@
+/*
+ * Fast index for tag data
+ *
+ * Copyright (C) 2005--2015  Enrico Zini <enrico@debian.org>
+ *
+ * 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 2 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, write to the Free Software
+ * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+ */
+
+#include <ept/debtags/coll/fast.h>
+#include <ept/debtags/coll/set.h>
+#include <ept/debtags/coll/operators.h>
+
+using namespace std;
+using namespace ept::debtags::coll::operators;
+
+namespace ept {
+namespace debtags {
+namespace coll {
+
+void Fast::insert(const std::set<std::string>& items, const std::set<std::string>& tags)
+{
+    if (tags.empty())
+        return;
+
+    for (const auto& i: items)
+        insert(i, tags);
+}
+
+void Fast::insert(const std::string& item, const std::set<std::string>& tags)
+{
+    if (tags.empty())
+        return;
+
+    auto iter = this->items.find(item);
+    if (iter == this->items.end())
+        this->items.insert(std::make_pair(item, tags));
+    else
+        iter->second |= tags;
+
+    for (typename std::set<std::string>::const_iterator i = tags.begin();
+            i != tags.end(); ++i)
+    {
+        typename std::map< std::string, std::set<std::string> >::iterator iter = this->tags.find(*i);
+        if (iter == this->tags.end())
+            this->tags.insert(std::make_pair(*i, std::set<std::string>() | item));
+        else
+            iter->second |= item;
+    }
+}
+
+void Fast::insert(const std::set<std::string>& items, const std::string& tag)
+{
+    for (typename std::set<std::string>::const_iterator i = items.begin();
+            i != items.end(); ++i)
+    {
+        typename std::map< std::string, std::set<std::string> >::iterator iter = this->items.find(*i);
+        if (iter == this->items.end())
+            this->items.insert(std::make_pair(*i, std::set<std::string>() | tag));
+        else
+            iter->second |= tag;
+    }
+
+    typename std::map< std::string, std::set<std::string> >::iterator iter = this->tags.find(tag);
+    if (iter == this->tags.end())
+        this->tags.insert(std::make_pair(tag, items));
+    else
+        iter->second |= items;
+}
+
+std::set<std::string> Fast::getItemsHavingTag(const std::string& tag) const
+{
+    typename map<std::string, std::set<std::string> >::const_iterator i = tags.find(tag);
+    if (i != tags.end())
+        return i->second;
+    else
+        return std::set<std::string>();
+}
+
+std::set<std::string> Fast::getItemsHavingTags(const std::set<std::string>& tags) const 
+{
+    if (tags.empty())
+        return std::set<std::string>();
+
+    auto i = tags.begin();
+    auto res = getItemsHavingTag(*i);
+
+    for (++i ; i != tags.end(); ++i)
+        res &= getItemsHavingTag(*i);
+
+    return res;
+}
+
+
+std::set<std::string> Fast::getTagsOfItem(const std::string& item) const
+{
+    typename map<std::string, std::set<std::string> >::const_iterator i = items.find(item);
+    if (i != items.end())
+        return i->second;
+    else
+        return std::set<std::string>();
+}
+
+std::set<std::string> Fast::getTaggedItems() const
+{
+    std::set<std::string> res;
+    for (typename map<std::string, std::set<std::string> >::const_iterator i = items.begin();
+            i != items.end(); i++)
+        res |= i->first;
+    return res;
+}
+
+std::set<std::string> Fast::getAllTags() const
+{
+    std::set<std::string> res;
+    for (typename map<std::string, std::set<std::string> >::const_iterator i = tags.begin();
+            i != tags.end(); i++)
+        res |= i->first;
+    return res;
+}
+
+std::vector<std::string> Fast::getAllTagsAsVector() const
+{
+    std::vector<std::string> res;
+    for (typename map<std::string, std::set<std::string> >::const_iterator i = tags.begin();
+            i != tags.end(); i++)
+        res.push_back(i->first);
+    return res;
+}
+
+std::set<std::string> Fast::getTagsImplying(const std::string& tag) const
+{
+    // tag1 implies tag2 if the itemset of tag1 is a subset of the itemset of tag2
+    std::set<std::string> res;
+    std::set<std::string> itemsToCheck = getItemsHavingTag(tag);
+    // TODO: choose which one is the most efficient implementation
+#if 0
+    // Roughly:
+    // O(n[pkgs per tag] * log(nitems) * log(n[items per pkg]) + n[tags per item] * n[items per tag])
+    std::set<std::string> tagsToCheck;
+    for (std::set<std::string>::const_iterator i = itemsToCheck.begin();
+            i != itemsToCheck.end(); ++i)
+        tagsToCheck |= getTags(*i);
+    for (std::set<std::string>::const_iterator i = tagsToCheck.begin();
+            i != tagsToCheck.end(); ++i)
+        if (utils::set_contains(itemsToCheck, getItems(*i)))
+            res |= *i;
+#else
+    // O(ntags * n[items per tag])
+    for (typename std::map<std::string, std::set<std::string> >::const_iterator i = tags.begin();
+            i != tags.end(); ++i)
+        if (utils::set_contains(itemsToCheck, getItemsHavingTag(i->first)))
+            res |= i->first;
+#endif
+    return res - tag;
+}
+
+std::set<std::string> Fast::getItemsExactMatch(const std::set<std::string>& tags) const
+{
+    std::set<std::string> res = this->getItemsHavingTags(tags);
+    typename std::set<std::string>::iterator i = res.begin();
+    while (i != res.end())
+    {
+        typename std::map<std::string, std::set<std::string> >::const_iterator t = items.find(*i);
+        if (t != items.end() && t->second != tags)
+        {
+            typename std::set<std::string>::iterator j = i;
+            ++i;
+            res.erase(j);
+        } else
+            ++i;
+    }
+    return res;
+}
+
+std::string Fast::findTagWithMaxCardinality(size_t& card) const
+{
+    card = 0;
+    std::string res = std::string();
+    for (typename std::map<std::string, std::set<std::string> >::const_iterator i = tags.begin();
+            i != tags.end(); ++i)
+        if (i->second.size() > card)
+        {
+            card = i->second.size();
+            res = i->first;
+        }
+    return res;
+}
+
+void Fast::removeTag(const std::string& tag)
+{
+    typename std::map<std::string, std::set<std::string> >::iterator itag = tags.find(tag);
+    for (typename std::set<std::string>::const_iterator iitemset = itag->second.begin();
+            iitemset != itag->second.end(); ++iitemset)
+    {
+        typename std::map<std::string, std::set<std::string> >::iterator iitem = items.find(*iitemset);
+        iitem->second -= tag;
+        if (iitem->second.empty())
+            items.erase(iitem);
+    }
+    tags.erase(itag);
+}
+
+Fast Fast::getChildCollection(const std::string& tag) const
+{
+    Fast res;
+
+    auto itag = tags.find(tag);
+    for (const auto& i: itag->second)
+    {
+        auto iitem = items.find(i);
+        res.insert(i, iitem->second);
+    }
+
+    res.removeTag(tag);
+    return res;
+}
+
+void Fast::removeTagsWithCardinalityLessThan(size_t card)
+{
+    typename std::map<std::string, std::set<std::string> >::const_iterator i = tags.begin();
+    while (i != tags.end())
+    {
+        if (i->second.size() < card)
+        {
+            typename std::map<std::string, std::set<std::string> >::const_iterator j = i;
+            ++i;
+            removeTag(j->first);
+        } else
+            ++i;
+    }
+}
+
+}
+}
+}
diff --git a/ept/debtags/coll/fast.h b/ept/debtags/coll/fast.h
new file mode 100644
index 0000000..6cc34ff
--- /dev/null
+++ b/ept/debtags/coll/fast.h
@@ -0,0 +1,111 @@
+#ifndef EPT_DEBTAGS_COLL_FAST_H
+#define EPT_DEBTAGS_COLL_FAST_H
+
+/** \file
+ * Fast index for tag data
+ */
+
+/*
+ * Copyright (C) 2005--2015  Enrico Zini <enrico@debian.org>
+ *
+ * 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 2 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, write to the Free Software
+ * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+ */
+
+#include <set>
+#include <map>
+#include <string>
+#include <vector>
+
+namespace ept {
+namespace debtags {
+namespace coll {
+
+/**
+ * In-memory collection with both item->tags and tag->items mappings.
+ */
+class Fast
+{
+protected:
+    std::map<std::string, std::set<std::string>> items;
+    std::map<std::string, std::set<std::string>> tags;
+
+public:
+    typedef std::map<std::string, std::set<std::string>>::const_iterator const_iterator;
+    typedef std::map<std::string, std::set<std::string>>::iterator iterator;
+    typedef std::map<std::string, std::set<std::string>>::value_type value_type;
+    typedef std::map<std::string, std::set<std::string>>::const_iterator const_tag_iterator;
+    typedef std::map<std::string, std::set<std::string>>::iterator tag_iterator;
+
+    const_iterator begin() const { return items.begin(); }
+    const_iterator end() const { return items.end(); }
+    iterator begin() { return items.begin(); }
+    iterator end() { return items.end(); }
+
+    const_tag_iterator tagBegin() const { return tags.begin(); }
+    const_tag_iterator tagEnd() const { return tags.end(); }
+    tag_iterator tagBegin() { return tags.begin(); }
+    tag_iterator tagEnd() { return tags.end(); }
+
+    void insert(const std::string& item, const std::set<std::string>& tags);
+    void insert(const std::set<std::string>& items, const std::string& tag);
+    void insert(const std::set<std::string>& items, const std::set<std::string>& tags);
+
+    void clear() { items.clear(); tags.clear(); }
+
+    std::set<std::string> getTagsOfItem(const std::string& item) const;
+    std::set<std::string> getItemsHavingTag(const std::string& tag) const;
+
+    /**
+     * Get the items which are tagged with at least the tags `tags'
+     *
+     * \return
+     *   The items found, or an empty set if no items have that tag
+     */
+    std::set<std::string> getItemsHavingTags(const std::set<std::string>& tags) const;
+
+    bool empty() const { return items.empty(); }
+
+    bool hasItem(const std::string& item) const { return items.find(item) != items.end(); }
+    bool hasTag(const std::string& tag) const { return tags.find(tag) != tags.end(); }
+    std::set<std::string> getTaggedItems() const;
+    std::set<std::string> getAllTags() const;
+    std::vector<std::string> getAllTagsAsVector() const;
+
+    unsigned int itemCount() const { return items.size(); }
+    unsigned int tagCount() const { return tags.size(); }
+
+    // tag1 implies tag2 if the itemset of tag1 is a subset of the itemset of
+    // tag2
+    std::set<std::string> getTagsImplying(const std::string& tag) const;
+
+    // Return the items which have the exact tagset 'tags'
+    std::set<std::string> getItemsExactMatch(const std::set<std::string>& tags) const;
+
+    std::string findTagWithMaxCardinality(size_t& card) const;
+
+    /**
+     * Return the collection with only those items that have this tag, but with
+     * the given tag removed
+     */
+    Fast getChildCollection(const std::string& tag) const;
+
+    void removeTag(const std::string& tag);
+    void removeTagsWithCardinalityLessThan(size_t card);
+};
+
+}
+}
+}
+#endif
diff --git a/ept/debtags/coll/operators.h b/ept/debtags/coll/operators.h
new file mode 100644
index 0000000..2fecbad
--- /dev/null
+++ b/ept/debtags/coll/operators.h
@@ -0,0 +1,201 @@
+// -*- C++ -*-
+
+#ifndef EPT_DEBTAGS_COLL_OPERATORS_H
+#define EPT_DEBTAGS_COLL_OPERATORS_H
+
+#include <set>
+#include <algorithm>
+
+namespace ept {
+namespace debtags {
+namespace coll {
+namespace operators {
+
+/*
+template< typename S, typename VT > struct IsContainer {
+    typedef S T;
+};
+
+template< typename S >
+typename IsContainer< S, typename S::value_type >::T operator &&( const S &a, const S &b ) {
+    S ret;
+    std::set_intersection( a.begin(), a.end(), b.begin(), b.end(),
+                           std::inserter( ret, ret.begin() ) );
+    return ret;
+}
+*/
+
+template< typename T >
+T operator+( const T &i, typename T::difference_type o ) {
+    T r = i;
+    std::advance( r, o );
+    return r;
+}
+
+template< typename T >
+std::set< T > operator &( const std::set< T > &a, const std::set< T > &b ) {
+    std::set< T > ret;
+    std::set_intersection( a.begin(), a.end(), b.begin(), b.end(),
+                           std::inserter( ret, ret.begin() ) );
+    return ret;
+}
+
+template< typename T >
+std::set< T > operator &( const std::set< T > &a, const T &b ) {
+    std::set< T > ret;
+    if ( a.find( b ) != a.end() ) {
+        std::set< T > r;
+        r.insert( b );
+        return r;
+    }
+    return std::set< T >();
+}
+
+template< typename T >
+std::set< T > operator |( const std::set< T > &a, const T& item ) {
+    std::set< T > ret = a;
+    ret.insert(item);
+    return ret;
+}
+
+template< typename T >
+std::set< T > operator |( const std::set< T > &a, const std::set< T > &b ) {
+    std::set< T > ret;
+    std::set_union( a.begin(), a.end(), b.begin(), b.end(),
+                    std::inserter( ret, ret.begin() ) );
+    return ret;
+}
+
+template< typename T >
+std::set< T > operator -( const std::set< T > &a, const std::set< T > &b ) {
+    std::set< T > ret;
+    std::set_difference( a.begin(), a.end(), b.begin(), b.end(),
+                         std::inserter(ret, ret.begin() ) );
+    return ret;
+}
+
+template< typename T >
+std::set< T > operator -( const std::set< T > &a, const T& item ) {
+    std::set< T > ret = a;
+    ret.erase(item);
+    return ret;
+}
+
+template< typename T >
+std::set< T > &operator|=( std::set< T > &a, const T& item )
+{
+    a.insert(item);
+    return a;
+}
+
+// General case
+template< typename T, typename SEQ >
+std::set< T > &operator|=( std::set< T > &a, const SEQ& items )
+{
+    for (typename SEQ::const_iterator i = items.begin();
+		    i != items.end(); ++i)
+	    a.insert(*i);
+    return a;
+}
+
+// Little optimization in case a is empty
+template< typename T >
+std::set< T > &operator |=( std::set< T > &a, const std::set< T > &b ) {
+    if (a.empty())
+	    return a = b;
+
+    for (typename std::set<T>::const_iterator i = b.begin();
+		    i != b.end(); ++i)
+	    a.insert(*i);
+    return a;
+}
+
+// General case, but assumes that b is sorted
+template< typename T, typename SEQ >
+std::set< T > &operator &=( std::set< T > &a, const SEQ& b ) {
+	// Little optimization: if b is empty, we avoid a run through a
+    if (b.empty())
+    {
+		a.clear();
+		return a;
+	}
+       
+	typename std::set<T>::iterator ia = a.begin();
+	typename SEQ::const_iterator ib = b.begin();
+	while (ia != a.end())
+	{
+		if (ib != b.end() && *ib < *ia)
+		{
+			++ib;
+		}
+		else if (ib == b.end() || *ia != *ib)
+		{
+			typename std::set<T>::iterator tmp = ia;
+			++ia;
+			a.erase(tmp);
+		}
+		else
+		{
+			++ia;
+			++ib;
+		}
+	}
+    return a;
+}
+
+template< typename T >
+std::set< T > &operator-=( std::set< T > &a, const T& item )
+{
+    a.erase(item);
+    return a;
+}
+
+// General case, but works only if b is sorted
+template< typename T, typename SEQ >
+std::set< T > &operator -=( std::set< T > &a, const SEQ& b )
+{
+	typename std::set<T>::iterator ia = a.begin();
+	typename SEQ::const_iterator ib = b.begin();
+	while (ia != a.end() && ib != b.end())
+	{
+		if (*ia == *ib)
+		{
+			typename std::set<T>::iterator tmp = ia;
+			++ia;
+			++ib;
+			a.erase(tmp);
+		}
+		else if (*ia < *ib)
+			++ia;
+		else
+			++ib;
+	}
+    return a;
+}
+
+template< typename T >
+bool operator<=( const T &a, const std::set< T > &b ) {
+    return b.find( a ) != b.end();
+}
+
+template< typename T >
+bool operator<=( const std::set< T > &a, const std::set< T > &b ) {
+	typename std::set<T>::const_iterator x = a.begin();
+
+	for ( typename std::set<T>::const_iterator y = b.begin(); y != b.end(); ++y )
+		if ( x == a.end() )
+			return true;
+		else if (*x == *y)
+			++x;
+		else if (*x < *y)
+			return false;
+
+	return x == a.end();
+}
+
+}
+}
+}
+}
+
+#endif
diff --git a/ept/debtags/coll/set.h b/ept/debtags/coll/set.h
new file mode 100644
index 0000000..bcc9934
--- /dev/null
+++ b/ept/debtags/coll/set.h
@@ -0,0 +1,91 @@
+#ifndef TAGCOLL_UTILS_SET_H
+#define TAGCOLL_UTILS_SET_H
+
+/** \file
+ * Extra useful set operations
+ */
+
+/*
+ * Copyright (C) 2003,2004,2005,2006  Enrico Zini <enrico@debian.org>
+ *
+ * This library is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU Lesser General Public
+ * License as published by the Free Software Foundation; either
+ * version 2.1 of the License, or (at your option) any later version.
+ *
+ * This library 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
+ * Lesser General Public License for more details.
+ *
+ * You should have received a copy of the GNU Lesser General Public
+ * License along with this library; if not, write to the Free Software
+ * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
+ */
+
+#include <ept/debtags/coll/operators.h>
+#include <set>
+
+namespace ept {
+namespace debtags {
+namespace coll {
+namespace utils {
+
+template<typename T>
+int set_distance(const std::set<T>& set1, const std::set<T>& set2)
+{
+	int res = 0;
+	int intCount = 0;
+
+	typename std::set<T>::const_iterator a = set1.begin();
+	typename std::set<T>::const_iterator b = set2.begin();
+
+	while (a != set1.end() || b != set2.end())
+		if ((b == set2.end()) || (a != set1.end() && *a < *b))
+		{
+			res++;
+			a++;
+		}
+		else if ((a == set1.end()) || (b != set2.end() && *b < *a))
+		{
+			res++;
+			b++;
+		}
+		else
+		{
+			a++;
+			b++;
+			intCount++;
+		}
+	
+	return intCount ? res : -1;
+}
+
+template<typename T>
+bool set_contains(const std::set<T>& set1, const std::set<T>& set2)
+{
+	typename std::set<T>::const_iterator b = set2.begin();
+
+	for (typename std::set<T>::const_iterator a = set1.begin(); a != set1.end(); ++a)
+		if (b == set2.end())
+			return true;
+		else if (*a == *b)
+			b++;
+		else if (*b < *a)
+			return false;
+
+	return b == set2.end();
+}
+
+template<typename T>
+bool set_contains(const std::set<T>& set1, const T& item)
+{
+	return set1.find(item) != set1.end();
+}
+
+}
+}
+}
+}
+
+#endif
diff --git a/ept/debtags/debtags-test.cc b/ept/debtags/debtags-test.cc
new file mode 100644
index 0000000..9ed1eb6
--- /dev/null
+++ b/ept/debtags/debtags-test.cc
@@ -0,0 +1,163 @@
+#include "ept/test.h"
+#include "debtags.h"
+#include "coll/operators.h"
+#include <cstdio>
+
+using namespace std;
+using namespace ept;
+using namespace ept::debtags;
+using namespace ept::tests;
+using namespace ept::debtags::coll::operators;
+
+#define testfile TEST_ENV_DIR "debtags/package-tags"
+
+namespace {
+
+class Tests : public TestCase
+{
+    using TestCase::TestCase;
+
+    void register_tests() override
+    {
+        add_method("iterate", []() {
+            EnvOverride eo("DEBTAGS_TAGS", testfile);
+            Debtags debtags;
+            for (Debtags::const_iterator i = debtags.begin(); i != debtags.end(); ++i)
+            {
+                *i;
+                i->first;
+                i->second;
+            }
+        });
+
+        add_method("lookup_tags", []() {
+            EnvOverride eo("DEBTAGS_TAGS", testfile);
+            Debtags debtags;
+            string p("debtags");
+            std::set<std::string> tags = debtags.getTagsOfItem(p);
+            wassert(actual(tags.empty()).isfalse());
+
+#if 0
+            for ( std::set< Tag >::iterator i = tags.begin(); i != tags.end(); ++ i ) {
+                std::cerr << i->id() << ": " << i->fullname() << std::endl;
+            }
+            std::cerr << "---" << std::endl;
+            Tag t = voc().tagByName( "interface::commandline" );
+            std::cerr << t.id() << ": " << t.fullname() << std::endl;
+#endif
+
+            wassert(actual(tags.size()) == 8u);
+            wassert(actual(tags.find("devel::buildtools") != tags.end()).istrue());
+            wassert(actual(tags.find("implemented-in::c++") != tags.end()).istrue());
+            wassert(actual(tags.find("interface::commandline") != tags.end()).istrue());
+            wassert(actual(tags.find("role::program") != tags.end()).istrue());
+            wassert(actual(tags.find("scope::application") != tags.end()).istrue());
+            wassert(actual(tags.find("suite::debian") != tags.end()).istrue());
+            wassert(actual(tags.find("use::searching") != tags.end()).istrue());
+            wassert(actual(tags.find("works-with::software:package") != tags.end()).istrue());
+        });
+
+        add_method("lookup_packages", []() {
+            using namespace std;
+            EnvOverride eo("DEBTAGS_TAGS", testfile);
+            Debtags debtags;
+
+            /* Get the 'debtags' package */
+            string p("debtags");
+
+            /* Get its tags */
+            std::set<std::string> tags = debtags.getTagsOfItem(p);
+            wassert(actual(tags.empty()).isfalse());
+
+            /*
+            cerr << "Intersection size: " << endl;
+            using namespace wibble::operators;
+            std::set<Tag>::const_iterator dbgi = tags.begin();
+            cerr << "* " << dbgi->fullname() << ": " << dbgi->id() << endl;
+            std::set<int> dbgres = debtags.tagdb().getItemsHavingTag(dbgi->id());
+            std::set<Package> dbgpres = debtags.getItemsHavingTag(*dbgi);
+            cerr << " #pkgs " << dbgres.size() << " == " << dbgpres.size() << endl;
+            cerr << " #isec " << dbgres.size() << " == " << dbgpres.size() << endl;
+            cerr << "  "; ppset(dbgpres); cerr << endl;
+            cerr << "  "; piset(dbgres); cerr << endl;
+            for (++dbgi ; dbgi != tags.end(); ++dbgi)
+            {
+                cerr << "* " << dbgi->fullname() << ": " << dbgi->id() << endl;
+                std::set<Package> dbgpkgs = debtags.getItemsHavingTag(*dbgi);
+                std::set<int> dbgids = debtags.tagdb().getItemsHavingTag(dbgi->id());
+                cerr << "  "; ppset(dbgpkgs); cerr << endl;
+                cerr << "  "; piset(dbgids); cerr << endl;
+                cerr << " #pkgs " << dbgpkgs.size() << " == " << dbgids.size() << endl;
+                dbgres &= dbgids;
+                dbgpres &= dbgpkgs;
+                cerr << " #isec " << dbgres.size() << " == " << dbgpres.size() << endl;
+            }
+            cerr << " " << dbgres.size() << endl << "Results: " << endl;
+            for (std::set<int>::const_iterator i = dbgres.begin(); i != dbgres.end(); ++i)
+                cerr << "   " << *i << endl;
+            */
+
+
+        //	cerr << "Tags of debtags: ";
+        //	for (std::set<Tag>::const_iterator i = tags.begin(); i != tags.end(); ++i)
+        //	{
+        //		cerr << " " + i->fullname() << endl;
+        //		std::set<Package> packages = debtags.getItemsHavingTag(*i);
+        //		for (std::set<Package>::const_iterator p = packages.begin();
+        //				p != packages.end(); ++p)
+        //			cerr << "   PKG " << p->name() << endl;
+        //	}
+        //	cerr << endl;
+
+            /* Get the items for the tagset of 'debtags' */
+            std::set<string> packages = debtags.getItemsHavingTags(tags);
+            //cerr << packages.size() << endl;
+            wassert(actual(packages.empty()).isfalse());
+            /*
+            for ( std::set< Package >::iterator i = packages.begin(); i != packages.end(); ++ i )
+                std::cerr << i->name() << std::endl;
+            std::cerr << "---" << std::endl;
+            std::cerr << p.name() << std::endl;
+            */
+            /* They should at least contain 'debtags' */
+            wassert(actual(p <= packages).istrue());
+
+            /* Get one of the tags of 'debtags' */
+            std::string tag = *tags.begin();
+
+            /* Get its items */
+            {
+                /* Need this workaround until I figure out how to tell the new GCC
+                 * that TagDB is a TDBReadonlyDiskIndex and should behave as such
+                 */
+                std::set<std::string> ts;
+                ts.insert(tag);
+                packages = debtags.getItemsHavingTags(ts);
+            }
+            //packages = c.debtags().tagdb().getItems(tag);
+            wassert(actual(packages.empty()).isfalse());
+            /* They should at least contain 'debtags' */
+            wassert(actual(p <= packages).istrue());
+
+            //c.debtags().getTags(""); // XXX HACK AWW!
+        });
+
+        add_method("empty", []() {
+            // If there is no data, Debtags should work as an empty collection
+            EnvOverride eo("DEBTAGS_TAGS", "./empty/notags");
+            Debtags empty;
+
+            wassert(actual(empty.begin() == empty.end()).istrue());
+            wassert(actual(empty.timestamp()) == 0);
+            wassert(actual(empty.hasData()).isfalse());
+
+            set<std::string> res = empty.getTagsOfItem("apt");
+            wassert(actual(res.empty()).istrue());
+
+            res = empty.getAllTags();
+            wassert(actual(res.empty()).istrue());
+        });
+    }
+} tests("debtags");
+
+}
diff --git a/ept/debtags/debtags.cc b/ept/debtags/debtags.cc
index 4ebf5bf..62cc382 100644
--- a/ept/debtags/debtags.cc
+++ b/ept/debtags/debtags.cc
@@ -6,7 +6,7 @@
 /*
  * System tag database
  *
- * Copyright (C) 2003-2008  Enrico Zini <enrico@debian.org>
+ * Copyright (C) 2003-2015  Enrico Zini <enrico@debian.org>
  *
  * This library is free software; you can redistribute it and/or
  * modify it under the terms of the GNU Lesser General Public
@@ -23,28 +23,18 @@
  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
  */
 
-#include <ept/debtags/debtags.h>
-
-#include <tagcoll/patch.h>
-#include <tagcoll/coll/simple.h>
-#include <tagcoll/input/stdio.h>
-#include <tagcoll/TextFormat.h>
-
-#include <wibble/sys/fs.h>
-#include <wibble/string.h>
-
+#include "debtags.h"
+#include "ept/utils/sys.h"
+#include "coll/TextFormat.h"
+#include <system_error>
 #include <iostream>
 #include <sstream>
-
 #include <sys/wait.h>	// WIFEXITED WEXITSTATUS
 #include <sys/types.h>	// getpwuid, getuid
 #include <pwd.h>	// getpwuid
 #include <unistd.h>	// getuid
 
-
 using namespace std;
-using namespace tagcoll;
-using namespace wibble;
 
 namespace ept {
 namespace debtags {
@@ -53,7 +43,7 @@ Debtags::Debtags()
     : m_timestamp(0)
 {
     string src = pathname();
-    if (!sys::fs::exists(src))
+    if (!sys::exists(src))
         return;
     load(src);
 }
@@ -67,13 +57,21 @@ Debtags::Debtags(const std::string& pathname)
 void Debtags::load(const std::string& pathname)
 {
     // Read uncompressed data
-    tagcoll::input::Stdio in(pathname);
+    FILE* in = fopen(pathname.c_str(), "rt");
+    if (!in)
+        throw std::system_error(errno, std::system_category(), "cannot open " + pathname);
 
     // Read the collection
-    tagcoll::textformat::parse(in, inserter(*this));
+    try {
+        coll::textformat::parse(in, pathname, *this);
+    } catch (...) {
+        fclose(in);
+        throw;
+    }
+    fclose(in);
 
     // Read the timestamp
-    m_timestamp = sys::fs::timestamp(pathname, 0);
+    m_timestamp = sys::timestamp(pathname, 0);
 }
 
 string Debtags::pathname()
@@ -85,12 +83,3 @@ string Debtags::pathname()
 
 }
 }
-
-#include <tagcoll/coll/simple.tcc>
-#include <tagcoll/coll/fast.tcc>
-#include <tagcoll/TextFormat.tcc>
-
-// Explicit template instantiations for our stuff
-template class tagcoll::coll::Fast<std::string, std::string>;
-
-// vim:set ts=4 sw=4:
diff --git a/ept/debtags/debtags.h b/ept/debtags/debtags.h
index c908f0d..52d9347 100644
--- a/ept/debtags/debtags.h
+++ b/ept/debtags/debtags.h
@@ -26,18 +26,11 @@
 #ifndef EPT_DEBTAGS_DEBTAGS_H
 #define EPT_DEBTAGS_DEBTAGS_H
 
-#include <tagcoll/coll/base.h>
-#include <tagcoll/coll/fast.h>
+#include <ept/debtags/coll/fast.h>
 #include <string>
 
 namespace ept {
 namespace debtags {
-class Debtags;
-}
-}
-
-namespace ept {
-namespace debtags {
 
 /**
  * Access the on-disk Debtags tag database.
@@ -51,7 +44,7 @@ namespace debtags {
  * It is possible to get a reference to the Vocabulary object using the
  * vocabulary() method.
  */
-class Debtags : public tagcoll::coll::Fast<std::string, std::string>
+class Debtags : public coll::Fast
 {
 protected:
 	// User rc directory to store patches
@@ -63,8 +56,8 @@ protected:
     void load(const std::string& pathname);
 
 public:
-	typedef tagcoll::coll::Fast<std::string, std::string> coll_type;
-	typedef std::pair< std::string, std::set<std::string> > value_type;
+    typedef ept::debtags::coll::Fast coll_type;
+    typedef std::pair< std::string, std::set<std::string> > value_type;
 
     /// Create a Debtags object, reading the system database
     Debtags();
@@ -90,7 +83,6 @@ public:
     static std::string pathname();
 };
 
-
 }
 }
 
diff --git a/ept/debtags/debtags.test.h b/ept/debtags/debtags.test.h
deleted file mode 100644
index 54b57eb..0000000
--- a/ept/debtags/debtags.test.h
+++ /dev/null
@@ -1,206 +0,0 @@
-// -*- mode: c++; tab-width: 4; indent-tabs-mode: t -*-
-/**
- * @file
- * @author Enrico Zini (enrico) <enrico@enricozini.org>
- */
-
-/*
- * Test for the Debtags data provider
- *
- * Copyright (C) 2003-2007  Enrico Zini <enrico@debian.org>
- *
- * This library is free software; you can redistribute it and/or
- * modify it under the terms of the GNU Lesser General Public
- * License as published by the Free Software Foundation; either
- * version 2.1 of the License, or (at your option) any later version.
- *
- * This library 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
- * Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public
- * License along with this library; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
- */
-
-
-#include <ept/debtags/debtags.h>
-
-#include <tagcoll/coll/simple.h>
-#include <tagcoll/stream/sink.h>
-#include <tagcoll/patch.h>
-
-#include <wibble/operators.h>
-
-#include <ept/test.h>
-#include <cstdio>
-
-#ifndef EPT_DEBTAGS_TESTH
-#define EPT_DEBTAGS_TESTH
-
-using namespace tagcoll;
-using namespace std;
-using namespace ept;
-using namespace ept::debtags;
-using namespace wibble::operators;
-
-#define testfile TEST_ENV_DIR "debtags/package-tags"
-
-struct TestDebtags : DebtagsTestEnvironment
-{
-    TestDebtags() {}
-
-    Test _1()
-    {
-        EnvOverride eo("DEBTAGS_TAGS", testfile);
-        Debtags debtags;
-		for (Debtags::const_iterator i = debtags.begin(); i != debtags.end(); ++i)
-		{
-			*i;
-			i->first;
-			i->second;
-		}
-    }
-
-    Test _2()
-    {
-        EnvOverride eo("DEBTAGS_TAGS", testfile);
-        Debtags debtags;
-	string p("debtags");
-	std::set<std::string> tags = debtags.getTagsOfItem(p);
-	assert( !tags.empty() );
-
-#if 0
-	for ( std::set< Tag >::iterator i = tags.begin(); i != tags.end(); ++ i ) {
-		std::cerr << i->id() << ": " << i->fullname() << std::endl;
-	}
-	std::cerr << "---" << std::endl;
-	Tag t = voc().tagByName( "interface::commandline" );
-	std::cerr << t.id() << ": " << t.fullname() << std::endl;
-#endif
-
-	assert_eq( tags.size(), 8u );
-	assert( tags.find("devel::buildtools") != tags.end() );
-	assert( tags.find("implemented-in::c++") != tags.end() );
-	assert( tags.find("interface::commandline") != tags.end() );
-	assert( tags.find("role::program") != tags.end() );
-	assert( tags.find("scope::application") != tags.end() );
-	assert( tags.find("suite::debian") != tags.end() );
-	assert( tags.find("use::searching") != tags.end() );
-	assert( tags.find("works-with::software:package") != tags.end() );
-}
-
-    Test _3()
-    {
-        using namespace std;
-        EnvOverride eo("DEBTAGS_TAGS", testfile);
-        Debtags debtags;
-
-	/* Get the 'debtags' package */
-	string p("debtags");
-
-	/* Get its tags */
-	std::set<std::string> tags = debtags.getTagsOfItem(p);
-	assert(!tags.empty());
-
-	/*
-	cerr << "Intersection size: " << endl;
-	using namespace wibble::operators;
-	std::set<Tag>::const_iterator dbgi = tags.begin();
-	cerr << "* " << dbgi->fullname() << ": " << dbgi->id() << endl;
-	std::set<int> dbgres = debtags.tagdb().getItemsHavingTag(dbgi->id());
-	std::set<Package> dbgpres = debtags.getItemsHavingTag(*dbgi);
-	cerr << " #pkgs " << dbgres.size() << " == " << dbgpres.size() << endl;
-	cerr << " #isec " << dbgres.size() << " == " << dbgpres.size() << endl;
-	cerr << "  "; ppset(dbgpres); cerr << endl;
-	cerr << "  "; piset(dbgres); cerr << endl;
-	for (++dbgi ; dbgi != tags.end(); ++dbgi)
-	{
-		cerr << "* " << dbgi->fullname() << ": " << dbgi->id() << endl;
-		std::set<Package> dbgpkgs = debtags.getItemsHavingTag(*dbgi);
-		std::set<int> dbgids = debtags.tagdb().getItemsHavingTag(dbgi->id());
-		cerr << "  "; ppset(dbgpkgs); cerr << endl;
-		cerr << "  "; piset(dbgids); cerr << endl;
-		cerr << " #pkgs " << dbgpkgs.size() << " == " << dbgids.size() << endl;
-		dbgres &= dbgids;
-		dbgpres &= dbgpkgs;
-		cerr << " #isec " << dbgres.size() << " == " << dbgpres.size() << endl;
-	}
-	cerr << " " << dbgres.size() << endl << "Results: " << endl;
-	for (std::set<int>::const_iterator i = dbgres.begin(); i != dbgres.end(); ++i)
-		cerr << "   " << *i << endl;
-	*/
-
-
-//	cerr << "Tags of debtags: ";
-//	for (std::set<Tag>::const_iterator i = tags.begin(); i != tags.end(); ++i)
-//	{
-//		cerr << " " + i->fullname() << endl;
-//		std::set<Package> packages = debtags.getItemsHavingTag(*i);
-//		for (std::set<Package>::const_iterator p = packages.begin();
-//				p != packages.end(); ++p)
-//			cerr << "   PKG " << p->name() << endl;
-//	}
-//	cerr << endl;
-
-    /* Get the items for the tagset of 'debtags' */
-	std::set<string> packages = debtags.getItemsHavingTags(tags);
-	//cerr << packages.size() << endl;
-    assert(!packages.empty());
-	/*
-	for ( std::set< Package >::iterator i = packages.begin(); i != packages.end(); ++ i )
-		std::cerr << i->name() << std::endl;
-	std::cerr << "---" << std::endl;
-	std::cerr << p.name() << std::endl;
-	*/
-    /* They should at least contain 'debtags' */
-    assert( p <= packages );
-
-    /* Get one of the tags of 'debtags' */
-    std::string tag = *tags.begin();
-
-    /* Get its items */
-    {
-        /* Need this workaround until I figure out how to tell the new GCC
-         * that TagDB is a TDBReadonlyDiskIndex and should behave as such
-         */
-		std::set<std::string> ts;
-		ts.insert(tag);
-        packages = debtags.getItemsHavingTags(ts);
-    }
-    //packages = c.debtags().tagdb().getItems(tag);
-    assert(!packages.empty());
-    /* They should at least contain 'debtags' */
-    assert( p <= packages );
-
-    //c.debtags().getTags(""); // XXX HACK AWW!
-}
-
-    // If there is no data, Debtags should work as an empty collection
-    Test _4()
-    {
-        EnvOverride eo("DEBTAGS_TAGS", "./empty/notags");
-        Debtags empty;
-
-	assert(empty.begin() == empty.end());
-	assert_eq(empty.timestamp(), 0);
-	assert(!empty.hasData());
-
-	set<std::string> res = empty.getTagsOfItem("apt");
-	assert(res.empty());
-	// TODO: currently does not compile because of a bug in tagcoll
-	//res = empty.getTagsOfItems(wibble::singleton(string("apt")));
-	//assert(res.empty());
-
-	res = empty.getAllTags();
-	assert(res.empty());
-}
-
-};
-
-#include <tagcoll/coll/simple.tcc>
-
-#endif
-
-// vim:set ts=4 sw=4:
diff --git a/ept/debtags/expression.test.h b/ept/debtags/expression.test.h
deleted file mode 100644
index b3789ab..0000000
--- a/ept/debtags/expression.test.h
+++ /dev/null
@@ -1,82 +0,0 @@
-/*
- * Match tag expressions against sets of Debtags Tags
- *
- * Copyright (C) 2005,2006,2007  Enrico Zini <enrico@debian.org>
- *
- * 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 2 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, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
- */
-
-#include <wibble/test.h>
-#include <tagcoll/expression.h>
-#include <ept/debtags/vocabulary.h>
-
-#include "debtags.test.h"
-
-using namespace tagcoll;
-using namespace std;
-using namespace ept::debtags;
-
-struct TestExpression : DebtagsTestEnvironment {
-	Vocabulary voc;
-
-        Test _1()
-{
-	set<std::string> test;
-	test.insert("use::editing");
-	test.insert("use::viewing");
-	test.insert("works-with::text");
-
-	assert_eq(test.size(), 3u);
-
-	Expression e1("use::editing");
-	assert(e1(test));
-
-	Expression e2("use::editing && use::viewing");
-	assert(e2(test));
-
-	e1 = Expression("!use::editing");
-	assert(!e1(test));
-
-	e1 = Expression("use::editing || sugo");
-	assert(e1(test));
-
-	e1 = Expression("use::editing && !sugo");
-	assert(e1(test));
-
-	e1 = Expression("use::editing && !use::viewing");
-	assert(!e1(test));
-
-	e1 = Expression("(use::editing || sugo) && (use::viewing && works-with::text)");
-	assert(e1(test));
-
-	e1 = Expression("!(use::editinuse::editingra && works-with::text)");
-	assert(e1(test));
-
-	e1 = Expression("works-with::*");
-	assert(e1(test));
-
-	e1 = Expression("*::text");
-	assert(e1(test));
-
-	e1 = Expression("!*::antani");
-	assert(e1(test));
-
-	e1 = Expression("*::antani");
-	assert(!e1(test));
-}
-
-};
-
-// vim:set ts=4 sw=4:
diff --git a/ept/debtags/maint/debdbparser.cc b/ept/debtags/maint/debdbparser.cc
index 259cae4..51f2e88 100644
--- a/ept/debtags/maint/debdbparser.cc
+++ b/ept/debtags/maint/debdbparser.cc
@@ -19,14 +19,9 @@
  */
 
 #include <ept/debtags/maint/debdbparser.h>
-
-#include <tagcoll/input/base.h>
-
 #include <map>
-#include <ctype.h>
-
-// using namespace std;
-using namespace tagcoll;
+#include <cctype>
+#include <system_error>
 
 namespace ept {
 namespace debtags {
@@ -35,9 +30,9 @@ namespace debtags {
 // Returns the number of '\n' encountered
 int DebDBParser::eatSpacesAndEmptyLines()
 {
-	int res = 0;
-	int c;
-	while ((c = in.nextChar()) != input::Input::Eof && (isblank(c) || c == '\n'))
+    int res = 0;
+    int c;
+    while ((c = getc(in)) != EOF && (isblank(c) || c == '\n'))
 		if (c == '\n')
 		{
 			isBOL = true;
@@ -46,10 +41,14 @@ int DebDBParser::eatSpacesAndEmptyLines()
 		} else
 			isBOL = false;
 
-	if (c == input::Input::Eof)
-		isEOF = true;
-	else
-		in.pushChar(c);
+    if (c == EOF)
+    {
+        if (ferror(in))
+            throw std::system_error(errno, std::system_category(), "cannot read from " + pathname);
+        isEOF = true;
+    }
+    else
+        ungetc(c, in);
 
 	return res;
 }
@@ -57,24 +56,26 @@ int DebDBParser::eatSpacesAndEmptyLines()
 // Get the ^([A-Za-z0-9]+) field name
 std::string DebDBParser::getFieldName()
 {
-	if (! isBOL)
-		throw exception::Parser(in, "field must start at the beginning of the line");
+    if (! isBOL)
+        throw std::runtime_error("field must start at the beginning of the line");
 
     std::string res;
 
-	int c;
-	while ((c = in.nextChar()) != input::Input::Eof && (isalnum(c) || c == '-'))
-		res += c;
-
-	if (c == input::Input::Eof)
-	{
-		isEOF = true;
-		if (!res.empty())
-			throw exception::Parser(in, "field is truncated at end of file.  Last line begins with: \"" + res + "\n");
-	} else
-		in.pushChar(c);
-
-	return res;
+    int c;
+    while ((c = getc(in)) != EOF && (isalnum(c) || c == '-'))
+        res += c;
+
+    if (c == EOF)
+    {
+        if (ferror(in))
+            throw std::system_error(errno, std::system_category(), "cannot read from " + pathname);
+        isEOF = true;
+        if (!res.empty())
+            throw std::runtime_error("field is truncated at end of file.  Last line begins with: \"" + res + "\n");
+    } else
+        ungetc(c, in);
+
+    return res;
 }
 
 // Eat the \s*: characters that divide the field name and the field
@@ -83,18 +84,20 @@ void DebDBParser::eatFieldSep()
 {
 	int c;
 
-	while ((c = in.nextChar()) != input::Input::Eof && isblank(c))
+	while ((c = getc(in)) != EOF && isblank(c))
 		;
 
 	if (c != ':')
 	{
-		if (c == input::Input::Eof)
-		{
-			isEOF = true;
-			throw exception::Parser(in, "field is truncated at end of file");
-		} else {
-			throw exception::Parser(in, std::string("invalid character `") + (char)c + "' expecting `:'");
-		}
+        if (c == EOF)
+        {
+            if (ferror(in))
+                throw std::system_error(errno, std::system_category(), "cannot read from " + pathname);
+            isEOF = true;
+            throw std::runtime_error("field is truncated at end of file");
+        } else {
+            throw std::runtime_error(std::string("invalid character `") + (char)c + "' expecting `:'");
+        }
 	}
 }
 
@@ -103,31 +106,35 @@ void DebDBParser::appendFieldBody(std::string& body)
 {
 	int c;
 
-	// Skip leading spaces
-	while ((c = in.nextChar()) != input::Input::Eof && isblank(c))
-		;
+    // Skip leading spaces
+    while ((c = getc(in)) != EOF && isblank(c))
+        ;
 
-	// Get the body part
-	for ( ; c != input::Input::Eof && c != '\n'; c = in.nextChar())
-		body += c;
+    // Get the body part
+    for ( ; c != EOF && c != '\n'; c = getc(in))
+        body += c;
 
 	// Delete trailing spaces
 	size_t end = body.find_last_not_of(" \t");
 	if (end != std::string::npos)
 		body.resize(end + 1);
 
-	if (c == input::Input::Eof)
-		isEOF = true;
-	else
-	{
-		//line++;
-		isBOL = true;
-	}
+    if (c == EOF)
+    {
+        if (ferror(in))
+            throw std::system_error(errno, std::system_category(), "cannot read from " + pathname);
+        isEOF = true;
+    }
+    else
+    {
+        //line++;
+        isBOL = true;
+    }
 }
 
 
-DebDBParser::DebDBParser(input::Input& input) :
-    in(input), isBOL(true), isEOF(false)
+DebDBParser::DebDBParser(FILE* input, const std::string& pathname)
+    : in(input), pathname(pathname), isBOL(true), isEOF(false)
 {
 	// Go at the start of the next record
 	eatSpacesAndEmptyLines();
diff --git a/ept/debtags/maint/debdbparser.h b/ept/debtags/maint/debdbparser.h
index e48faec..d26aa5e 100644
--- a/ept/debtags/maint/debdbparser.h
+++ b/ept/debtags/maint/debdbparser.h
@@ -6,7 +6,7 @@
  */
 
 /*
- * Copyright (C) 2003--2007  Enrico Zini <enrico@debian.org>
+ * Copyright (C) 2003--2015  Enrico Zini <enrico@debian.org>
  *
  * 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
@@ -23,17 +23,8 @@
  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
  */
 
-#include <tagcoll/input/base.h>
-
-// TODO: is there a way to forward-declare this?
 #include <map>
 
-namespace tagcoll {
-namespace input {
-class Input;
-}
-}
-
 namespace ept {
 namespace debtags {
 
@@ -52,7 +43,8 @@ public:
 class DebDBParser
 {
 protected:
-	tagcoll::input::Input& in;
+    FILE* in;
+    std::string pathname;
 	bool isBOL;
 	bool isEOF;
 
@@ -73,10 +65,9 @@ protected:
 public:
 	typedef std::map<std::string, std::string> Record;
 
-	DebDBParser(tagcoll::input::Input& input);
+    DebDBParser(FILE* input, const std::string& pathname);
 
-	const std::string& fileName() const throw () { return in.fileName(); }
-	int lineNumber() const throw () { return in.lineNumber(); }
+    const std::string& fileName() const throw () { return pathname; }
 
 	// Read a record and positions itself at the start of the next one
 	// Returns false when there are no more records available
diff --git a/ept/debtags/vocabulary-test.cc b/ept/debtags/vocabulary-test.cc
new file mode 100644
index 0000000..682e521
--- /dev/null
+++ b/ept/debtags/vocabulary-test.cc
@@ -0,0 +1,195 @@
+#include "ept/test.h"
+#include "vocabulary.h"
+#include "coll/set.h"
+#include "ept/test.h"
+
+using namespace std;
+using namespace ept::debtags::coll::utils;
+using namespace ept::debtags;
+using namespace ept::tests;
+
+#define testfile "debtags/vocabulary"
+
+namespace {
+
+class Tests : public TestCase
+{
+    using TestCase::TestCase;
+
+    void register_tests() override
+    {
+        add_method("load", []() {
+            EnvOverride eo("DEBTAGS_VOCABULARY", testfile);
+            Vocabulary  tags; // this will throw if it failed to load
+        });
+
+        add_method("has_facet", []() {
+            EnvOverride eo("DEBTAGS_VOCABULARY", testfile);
+            Vocabulary tags;
+            assert_true( tags.hasFacet( "works-with" ) );
+            assert_true( !tags.hasFacet( "blah" ) );
+        });
+
+        add_method("has_tag", []() {
+            EnvOverride eo("DEBTAGS_VOCABULARY", testfile);
+            Vocabulary tags;
+            assert_true( tags.hasTag( "works-with::people" ) );
+            assert_true( !tags.hasTag( "works-with::foobar" ) );
+        });
+
+        add_method("tagdata", []() {
+            EnvOverride eo("DEBTAGS_VOCABULARY", testfile);
+            Vocabulary tags;
+            const voc::TagData *people = tags.tagData( "works-with::people" ),
+                               *foobar = tags.tagData( "works-with::foobar" ),
+                               *blahg = tags.tagData( "works-with::blahg" ),
+                               *text = tags.tagData( "works-with::text" ),
+                               *people2 = tags.tagData( "works-with::people" );
+            assert_true( people != foobar );
+            assert_true( people != text );
+            assert_true( people != blahg );
+            assert_true( foobar == blahg );
+            assert_true( foobar == foobar );
+            assert_true( people == people2 );
+            assert_true( people == people );
+        });
+
+        add_method("tags", []() {
+            EnvOverride eo("DEBTAGS_VOCABULARY", testfile);
+            Vocabulary tags;
+            std::string a = "works-with::people",
+                        b = "works-with::foobar";
+            std::set<std::string> s = tags.tags(),
+                                  f = tags.tags( "works-with" ),
+                                  n = tags.tags( "nonsense" );
+            assert_true( set_contains(s, a) );
+            assert_true( set_contains(f, a) );
+            assert_true( set_contains(s, f) );
+            assert_true( !set_contains(s, b) );
+            assert_true( !set_contains(f, b) );
+            assert_true( n.empty() );
+        });
+
+        add_method("facetdata", []() {
+            EnvOverride eo("DEBTAGS_VOCABULARY", testfile);
+            Vocabulary tags;
+
+            const voc::FacetData* f = tags.facetData( "works-with" );
+            assert_true(f);
+            wassert(actual(f->name) == "works-with");
+
+            const voc::TagData* t = tags.tagData( "works-with::people" );
+            assert_true(t);
+            wassert(actual(t->name) == "works-with::people");
+        });
+
+        add_method("facettags", []() {
+            EnvOverride eo("DEBTAGS_VOCABULARY", testfile);
+            Vocabulary tags;
+
+            const voc::FacetData* f = tags.facetData( "works-with" );
+            std::set<std::string> x = tags.tags( "works-with" );
+            assert_true( x == f->tags() );
+        });
+
+        add_method("missing_facet", []() {
+            EnvOverride eo("DEBTAGS_VOCABULARY", testfile);
+            Vocabulary tags;
+
+            const voc::FacetData* f = tags.facetData( "does-not-work-with" );
+            assert_true(!f);
+        });
+
+        add_method("missing_facet1", []() {
+            EnvOverride eo("DEBTAGS_VOCABULARY", testfile);
+            Vocabulary tags;
+
+            const voc::FacetData* f = tags.facetData( "legacy" );
+            assert_true(f);
+            wassert(actual(f->shortDescription()) == "");
+            wassert(actual(f->longDescription()) == "");
+            //wassert(actual(f.shortDescription( "weehee" )) == "weehee");
+        });
+
+        add_method("one_letter_tag", []() {
+            EnvOverride eo("DEBTAGS_VOCABULARY", testfile);
+            Vocabulary tags;
+
+            // assert_true that one-character tag names are parsed correctly
+            assert_true( tags.hasTag( "implemented-in::c" ) );
+        });
+
+        add_method("iterate_facets", []() {
+            EnvOverride eo("DEBTAGS_VOCABULARY", testfile);
+            Vocabulary tags;
+
+            // assert_true that all facets are somehow working
+            std::set<std::string> facets = tags.facets();
+
+            for (std::set<std::string>::const_iterator i = facets.begin();
+                    i != facets.end(); i++)
+            {
+                const voc::FacetData* f = tags.facetData(*i);
+                assert_true(f);
+            }
+        });
+
+        add_method("iterate_tags", []() {
+            EnvOverride eo("DEBTAGS_VOCABULARY", testfile);
+            Vocabulary voc;
+
+            // assert_true that all tags are somehow working
+            std::set<std::string> tags = voc.tags();
+            for (std::set<std::string>::const_iterator i = tags.begin();
+                    i != tags.end(); i++)
+            {
+                const voc::TagData* t = voc.tagData(*i);
+                assert_true(t);
+            }
+        });
+
+        add_method("first_last", []() {
+            // Check for correctness of the first and last tag in the vocabulary
+            EnvOverride eo("DEBTAGS_VOCABULARY", testfile);
+            Vocabulary tags;
+
+            const voc::TagData* first = tags.tagData("accessibility::TODO");
+            assert_true(first);
+            wassert(actual(first->name) == string("accessibility::TODO"));
+            wassert(actual(first->shortDescription()) == string("Need an extra tag"));
+
+            const voc::TagData* last = tags.tagData("x11::xserver");
+            assert_true(last);
+            wassert(actual(last->name) == string("x11::xserver"));
+            wassert(actual(last->shortDescription()) == string("X Server"));
+        });
+
+        add_method("get_all_tags", []() {
+            EnvOverride eo("DEBTAGS_VOCABULARY", testfile);
+            Vocabulary tags;
+
+            // check that we're seeing all the tags for a facet
+            std::set<std::string> t = tags.tags("accessibility");
+            wassert(actual(t.size()) == 10u);
+
+            t = tags.tags("works-with-format");
+            wassert(actual(t.size()) == 33u);
+        });
+
+        add_method("empty", []() {
+            // If there is no data, Vocabulary should work as an empty vocabulary
+            EnvOverride eo("DEBTAGS_VOCABULARY", "./empty/novocabularyhere");
+            Vocabulary empty;
+
+            assert_true(!empty.hasData());
+
+            set<std::string> facets = empty.facets();
+            wassert(actual(facets.size()) == 0u);
+
+            set<std::string> tags = empty.tags();
+            wassert(actual(tags.size()) == 0u);
+        });
+    }
+} tests("debtags_vocabulary");
+
+}
diff --git a/ept/debtags/vocabulary.cc b/ept/debtags/vocabulary.cc
index 504fab2..78e2833 100644
--- a/ept/debtags/vocabulary.cc
+++ b/ept/debtags/vocabulary.cc
@@ -18,11 +18,11 @@
  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
  */
 
-#include <ept/debtags/vocabulary.h>
-#include <ept/debtags/maint/debdbparser.h>
-#include <tagcoll/input/memory.h>
-#include <tagcoll/input/stdio.h>
-#include <wibble/sys/fs.h>
+#include "vocabulary.h"
+#include "maint/debdbparser.h"
+#include "ept/utils/sys.h"
+#include <system_error>
+#include <cassert>
 #include <cstring>
 #include <cstdio>
 #include <cstdlib>
@@ -31,8 +31,6 @@
 #include <unistd.h>
 
 using namespace std;
-using namespace tagcoll;
-using namespace wibble;
 
 namespace ept {
 namespace debtags {
@@ -113,11 +111,20 @@ string Vocabulary::pathname()
 
 void Vocabulary::load(const std::string& pathname)
 {
-    if (!sys::fs::exists(pathname)) return;
+    if (!sys::exists(pathname)) return;
     // Read uncompressed data
-    tagcoll::input::Stdio in(pathname);
-    read(in);
-    m_timestamp = sys::fs::timestamp(pathname, 0);
+    FILE* in = fopen(pathname.c_str(), "rt");
+    if (!in)
+        throw std::system_error(errno, std::system_category(), "cannot open " + pathname);
+
+    try {
+        read(in, pathname);
+    } catch (...) {
+        fclose(in);
+        throw;
+    }
+    fclose(in);
+    m_timestamp = sys::timestamp(pathname, 0);
 }
 
 voc::TagData& voc::FacetData::obtainTag(const std::string& name)
@@ -126,7 +133,7 @@ voc::TagData& voc::FacetData::obtainTag(const std::string& name)
 	if (i == m_tags.end())
 	{
 		// Create the tag if it's missing
-		pair<std::map<std::string, TagData>::iterator, bool> res = m_tags.insert(make_pair<std::string, TagData>(name, TagData()));
+		pair<std::map<std::string, TagData>::iterator, bool> res = m_tags.insert(make_pair(name, TagData()));
 		i = res.first;
 		i->second.name = name;
 	}
@@ -139,7 +146,7 @@ voc::FacetData& Vocabulary::obtainFacet(const std::string& name)
 	if (i == m_facets.end())
 	{
 		// Create the facet if it's missing
-		pair<std::map<std::string, voc::FacetData>::iterator, bool> res = m_facets.insert(make_pair<std::string, voc::FacetData>(name, voc::FacetData()));
+		pair<std::map<std::string, voc::FacetData>::iterator, bool> res = m_facets.insert(make_pair(name, voc::FacetData()));
 		i = res.first;
 		i->second.name = name;
 	}
@@ -208,9 +215,9 @@ std::set<std::string> Vocabulary::tags(const std::string& facet) const
 	return f->tags();
 }
 
-void Vocabulary::read(tagcoll::input::Input& input)
+void Vocabulary::read(FILE* input, const std::string& pathname)
 {
-	DebDBParser parser(input);
+	DebDBParser parser(input, pathname);
 	DebDBParser::Record record;
 
 	while (parser.nextRecord(record))
@@ -243,12 +250,11 @@ void Vocabulary::read(tagcoll::input::Input& input)
 				if (i->first != "Tag")
 					tag[i->first] = i->second;
 		}
-		else
-		{
-			fprintf(stderr, "%s:%d: Skipping record without Tag or Facet field\n",
-					input.fileName().c_str(), input.lineNumber());
-		}
-	}
+        else
+        {
+            fprintf(stderr, "%s: Skipping record without Tag or Facet field\n", parser.fileName().c_str());
+        }
+    }
 }
 
 void Vocabulary::write()
@@ -263,116 +269,68 @@ void Vocabulary::write()
 
 void Vocabulary::write(const std::string& fname)
 {
-	// Build the temp file template
-	char tmpfname[fname.size() + 7];
-	strncpy(tmpfname, fname.c_str(), fname.size());
-	strncpy(tmpfname + fname.size(), ".XXXXXX", 8);
-
-	// Create and open the temporary file
-	int fd = mkstemp(tmpfname);
-	if (fd < 0)
-		throw wibble::exception::File(tmpfname, "opening file");
-
-	// Read the current umask
-	mode_t cur_umask = umask(0);
-	umask(cur_umask);
-
-	// Give the file the right permissions
-	if (fchmod(fd, 0666 & ~cur_umask) < 0)
-		throw wibble::exception::File(tmpfname, "setting file permissions");
-
-	// Pass the file descriptor to stdio
-	FILE* out = fdopen(fd, "wt");
-	if (!out)
-		throw wibble::exception::File(tmpfname, "fdopening file");
-
-	// Write out the merged vocabulary data
-	write(out);
-
-	// Flush stdio's buffers
-	fflush(out);
-
-	// Flush OS buffers
-	fdatasync(fd);
-
-	// Close the file
-	fclose(out);
-
-	// Rename the successfully written file to its final name
-	if (rename(tmpfname, fname.c_str()) == -1)
-		throw wibble::exception::System(string("renaming ") + tmpfname + " to " + fname);
+    // Serialize the merged vocabulary data
+    std::stringstream str;
+    write(str);
+    // Write it out atomically
+    sys::write_file_atomically(fname, str.str(), 0666);
 }
 
-static void writeDebStyleField(FILE* out, const string& name, const string& val) throw ()
+static void writeDebStyleField(std::ostream& out, const string& name, const string& val) throw ()
 {
-	fprintf(out, "%s: ", name.c_str());
-
-	// Properly escape newlines
-	bool was_nl = false;
-	for (string::const_iterator s = val.begin(); s != val.end(); s++)
-		if (was_nl)
-			// \n\n -> \n .\n
-			if (*s == '\n')
-			{
-				fputc(' ', out);
-				fputc('.', out);
-				fputc(*s, out);
-			}
-			// \n([^ \t]) -> \n \1
-			else if (*s != ' ' && *s != '\t')
-			{
-				fputc(' ', out);
-				fputc(*s, out);
-				was_nl = false;
-			}
-			// \n[ \t] goes unchanged
-			else
-			{
-				fputc(*s, out);
-				was_nl = false;
-			}
-		else
-			if (*s == '\n')
-			{
-				fputc(*s, out);
-				was_nl = true;
-			}
-			else
-				fputc(*s, out);
-
-	fputc('\n', out);
+    out << name << ": ";
+
+    // Properly escape newlines
+    bool was_nl = false;
+    for (string::const_iterator s = val.begin(); s != val.end(); s++)
+        if (was_nl)
+            // \n\n -> \n .\n
+            if (*s == '\n')
+                out << " ." << *s;
+            // \n([^ \t]) -> \n \1
+            else if (*s != ' ' && *s != '\t')
+            {
+                out << " " << *s;
+                was_nl = false;
+            }
+            // \n[ \t] goes unchanged
+            else
+            {
+                out << *s;
+                was_nl = false;
+            }
+        else
+            if (*s == '\n')
+            {
+                out << *s;
+                was_nl = true;
+            }
+            else
+                out << *s;
+
+    out << endl;
 }
 
-void Vocabulary::write(FILE* out)
+void Vocabulary::write(std::ostream& out)
 {
-	long start_ofs = ftell(out);
-	int facetid = 0;
-	int tagid = 0;
-
-	//fprintf(stderr, "Write\n");
-	for (std::map<std::string, voc::FacetData>::iterator f = m_facets.begin(); f != m_facets.end(); ++f)
-	{
-		//fprintf(stderr, "Writing facet %.*s\n", PFSTR(f->first));
-		writeDebStyleField(out, "Facet", f->first);
-		for (std::map<std::string, std::string>::const_iterator j = f->second.begin();
-				j != f->second.end(); j++)
-			writeDebStyleField(out, j->first, j->second);
-		fputc('\n', out);
-
-		for (std::map<std::string, voc::TagData>::iterator t = f->second.m_tags.begin();
-				t != f->second.m_tags.end(); t++)
-		{
-			//fprintf(stderr, "Writing tag %.*s\n", PFSTR(t->first));
-			writeDebStyleField(out, "Tag", t->first);
-			for (std::map<std::string, std::string>::const_iterator j = t->second.begin();
-					j != t->second.end(); j++)
-				writeDebStyleField(out, j->first, j->second);
-			fputc('\n', out);
-		}
-	}
+    for (const auto& f: m_facets)
+    {
+        //fprintf(stderr, "Writing facet %.*s\n", PFSTR(f->first));
+        writeDebStyleField(out, "Facet", f.first);
+        for (const auto& j : f.second)
+            writeDebStyleField(out, j.first, j.second);
+        out << endl;
+
+        for (const auto& t : f.second.m_tags)
+        {
+            //fprintf(stderr, "Writing tag %.*s\n", PFSTR(t->first));
+            writeDebStyleField(out, "Tag", t.first);
+            for (const auto& j : t.second)
+                writeDebStyleField(out, j.first, j.second);
+            out << endl;
+        }
+    }
 }
 
 }
 }
-
-// vim:set ts=4 sw=4:
diff --git a/ept/debtags/vocabulary.h b/ept/debtags/vocabulary.h
index a5a5fa3..0cc9449 100644
--- a/ept/debtags/vocabulary.h
+++ b/ept/debtags/vocabulary.h
@@ -28,12 +28,8 @@
 #include <vector>
 #include <set>
 #include <map>
-
-namespace tagcoll {
-namespace input {
-struct Input;
-}
-}
+#include <cstdio>
+#include <iosfwd>
 
 namespace ept {
 namespace debtags {
@@ -160,7 +156,12 @@ protected:
 
 	voc::FacetData& obtainFacet(const std::string& name);
 	voc::TagData& obtainTag(const std::string& fullname);
-	
+
+    /**
+     * Write the vocabulary data to the given output stream
+     */
+    void write(std::ostream& out);
+
 public:
 	/**
 	 * Instantiate the Debtags vocabulary
@@ -229,11 +230,11 @@ public:
     /// Load vocabulary data from the given file
     void load(const std::string& pathname);
 
-	/**
-	 * Parse and import the vocabulary from `input', merging the data with the
-	 * previously imported ones
-	 */
-	void read(tagcoll::input::Input& input);
+    /**
+     * Parse and import the vocabulary from `input', merging the data with the
+     * previously imported ones
+     */
+    void read(FILE* input, const std::string& pathname);
 
 	/**
 	 * Atomically update the system vocabulary
@@ -245,11 +246,6 @@ public:
 	 */
 	void write(const std::string& fname);
 
-	/**
-	 * Write the vocabulary data to the given output stream
-	 */
-	void write(FILE* out);
-
     /**
      * Return the default pathname for the vocabulary.
      *
diff --git a/ept/debtags/vocabulary.test.h b/ept/debtags/vocabulary.test.h
deleted file mode 100644
index 00c152c..0000000
--- a/ept/debtags/vocabulary.test.h
+++ /dev/null
@@ -1,223 +0,0 @@
-/*
- * Tag vocabulary access
- *
- * Copyright (C) 2003--2007  Enrico Zini <enrico@debian.org>
- *
- * 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 2 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, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
- */
-
-#include <wibble/test.h>
-#include <ept/debtags/vocabulary.h>
-#include <tagcoll/utils/set.h>
-#include <tagcoll/input/stdio.h>
-#include "ept/test.h"
-
-using namespace std;
-using namespace tagcoll::utils;
-using namespace ept::debtags;
-
-#define testfile TEST_ENV_DIR "debtags/vocabulary"
-
-
-struct TestVocabulary : DebtagsTestEnvironment
-{
-        Test _1()
-{
-    EnvOverride eo("DEBTAGS_VOCABULARY", testfile);
-    Vocabulary  tags; // this will throw if it failed to load
-}
-
-        Test _2()
-{
-    EnvOverride eo("DEBTAGS_VOCABULARY", testfile);
-    Vocabulary tags;
-    assert( tags.hasFacet( "works-with" ) );
-    assert( !tags.hasFacet( "blah" ) );
-}
-
-        Test _3()
-{
-    EnvOverride eo("DEBTAGS_VOCABULARY", testfile);
-    Vocabulary tags;
-    assert( tags.hasTag( "works-with::people" ) );
-    assert( !tags.hasTag( "works-with::midgets" ) );
-}
-
-        Test _4()
-{
-    EnvOverride eo("DEBTAGS_VOCABULARY", testfile);
-    Vocabulary tags;
-    const voc::TagData *people = tags.tagData( "works-with::people" ),
-                       *midgets = tags.tagData( "works-with::midgets" ),
-                       *blahg = tags.tagData( "works-with::blahg" ),
-                       *text = tags.tagData( "works-with::text" ),
-                       *people2 = tags.tagData( "works-with::people" );
-    assert( people != midgets );
-    assert( people != text );
-    assert( people != blahg );
-    assert( midgets == blahg );
-    assert( midgets == midgets );
-    assert( people == people2 );
-    assert( people == people );
-}
-
-        Test _5()
-{
-    EnvOverride eo("DEBTAGS_VOCABULARY", testfile);
-    Vocabulary tags;
-    std::string a = "works-with::people",
-                b = "works-with::midgets";
-    std::set<std::string> s = tags.tags(),
-                          f = tags.tags( "works-with" ),
-                          n = tags.tags( "nonsense" );
-    assert( set_contains(s, a) );
-    assert( set_contains(f, a) );
-    assert( set_contains(s, f) );
-    assert( !set_contains(s, b) );
-    assert( !set_contains(f, b) );
-    assert( n.empty() );
-}
-
-        Test _6()
-{
-    EnvOverride eo("DEBTAGS_VOCABULARY", testfile);
-    Vocabulary tags;
-
-	const voc::FacetData* f = tags.facetData( "works-with" );
-	assert(f);
-	assert_eq(f->name, "works-with");
-
-	const voc::TagData* t = tags.tagData( "works-with::people" );
-	assert(t);
-	assert_eq(t->name, "works-with::people");
-}
-
-        Test _7()
-{
-    EnvOverride eo("DEBTAGS_VOCABULARY", testfile);
-    Vocabulary tags;
-
-	const voc::FacetData* f = tags.facetData( "works-with" );
-	std::set<std::string> x = tags.tags( "works-with" );
-	assert( x == f->tags() );
-}
-
-        Test _8()
-{
-    EnvOverride eo("DEBTAGS_VOCABULARY", testfile);
-    Vocabulary tags;
-
-    const voc::FacetData* f = tags.facetData( "does-not-work-with" );
-    assert(!f);
-}
-
-        Test _9()
-{
-    EnvOverride eo("DEBTAGS_VOCABULARY", testfile);
-    Vocabulary tags;
-
-    const voc::FacetData* f = tags.facetData( "legacy" );
-    assert(f);
-    assert_eq(f->shortDescription(), "");
-    assert_eq(f->longDescription(), "");
-    //assert_eq(f.shortDescription( "weehee" ), "weehee");
-}
-
-        Test _10()
-{
-    EnvOverride eo("DEBTAGS_VOCABULARY", testfile);
-    Vocabulary tags;
-
-	// assert that one-character tag names are parsed correctly
-	assert( tags.hasTag( "implemented-in::c" ) );
-}
-
-        Test _11()
-{
-    EnvOverride eo("DEBTAGS_VOCABULARY", testfile);
-    Vocabulary tags;
-
-	// assert that all facets are somehow working
-	std::set<std::string> facets = tags.facets();
-
-	for (std::set<std::string>::const_iterator i = facets.begin();
-			i != facets.end(); i++)
-	{
-		const voc::FacetData* f = tags.facetData(*i);
-		assert(f);
-	}
-}
-
-        Test _12()
-{
-    EnvOverride eo("DEBTAGS_VOCABULARY", testfile);
-    Vocabulary voc;
-
-	// assert that all tags are somehow working
-	std::set<std::string> tags = voc.tags();
-	for (std::set<std::string>::const_iterator i = tags.begin();
-			i != tags.end(); i++)
-	{
-		const voc::TagData* t = voc.tagData(*i);
-		assert(t);
-	}
-}
-
-// Check for correctness of the first and last tag in the vocabulary
-        Test _13()
-{
-    EnvOverride eo("DEBTAGS_VOCABULARY", testfile);
-    Vocabulary tags;
-
-	const voc::TagData* first = tags.tagData("accessibility::TODO");
-	assert(first);
-	assert_eq(first->name, string("accessibility::TODO"));
-	assert_eq(first->shortDescription(), string("Need an extra tag"));
-
-	const voc::TagData* last = tags.tagData("x11::xserver");
-	assert(last);
-	assert_eq(last->name, string("x11::xserver"));
-	assert_eq(last->shortDescription(), string("X Server"));
-}
-
-        Test _14()
-{
-    EnvOverride eo("DEBTAGS_VOCABULARY", testfile);
-    Vocabulary tags;
-
-    // check that we're seeing all the tags for a facet
-    std::set<std::string> t = tags.tags("accessibility");
-    assert_eq(t.size(), 10u);
-
-	t = tags.tags("works-with-format");
-	assert_eq(t.size(), 33u);
-}
-
-// If there is no data, Vocabulary should work as an empty vocabulary
-        Test _15()
-{
-    EnvOverride eo("DEBTAGS_VOCABULARY", "./empty/novocabularyhere");
-    Vocabulary empty;
-
-	assert(!empty.hasData());
-
-	set<std::string> facets = empty.facets();
-	assert_eq(facets.size(), 0u);
-
-	set<std::string> tags = empty.tags();
-	assert_eq(tags.size(), 0u);
-}
-
-};
diff --git a/ept/libept.pc.in b/ept/libept.pc.in
index efadfce..265f032 100644
--- a/ept/libept.pc.in
+++ b/ept/libept.pc.in
@@ -6,6 +6,5 @@ includedir=@includedir@
 Name: libept
 Description: Access various data sources about software packages
 Version: @EPT_VERSION@
-Requires: libtagcoll2 libwibble
 Cflags: -I${includedir}
 Libs: -L${libdir} -lept -lapt-pkg -lxapian -lz
diff --git a/ept/popcon/local.cc b/ept/popcon/local.cc
deleted file mode 100644
index 308a9e4..0000000
--- a/ept/popcon/local.cc
+++ /dev/null
@@ -1,168 +0,0 @@
-/** @file
- * @author Enrico Zini <enrico@enricozini.org>
- * Correlate popcon data with local popcon information
- */
-
-/*
- * Copyright (C) 2007  Enrico Zini <enrico@debian.org>
- *
- * 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 2 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, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
- */
-
-#include <ept/popcon/local.h>
-#include <ept/popcon/popcon.h>
-#include <ept/popcon/maint/path.h>
-
-#include <wibble/exception.h>
-
-#include <algorithm>
-#include <fstream>
-#include <cmath>
-
-//#include <iostream>
-
-using namespace std;
-
-namespace ept {
-namespace popcon {
-
-// Split a string where there are separators
-static vector<string> split(const std::string& str, char sep = ' ')
-{
-	vector<string> res;
-	size_t start = 0;
-	while (start < str.size())
-	{
-		size_t end = str.find(sep, start);
-		if (end == string::npos)
-		{
-			res.push_back(str.substr(start));
-			break;
-		}
-		else
-		{
-			res.push_back(str.substr(start, end-start));
-			start = end + 1;
-		}
-	}
-	return res;
-}
-
-// Reverse sort pairs by comparing their second element
-struct secondsort
-{
-	bool operator()(const pair<string, float>& a, const pair<string, float>& b) const
-	{
-		if (a.second == b.second)
-			return a.first > b.first;
-		else
-			return a.second > b.second;
-	}
-};
-
-Local::Local(const std::string& file)
-{
-	m_timestamp = Path::timestamp(file);
-	if (m_timestamp == 0)
-		return;
-	
-	ifstream in;
-	in.open(file.c_str());
-	if (!in.good())
-		throw wibble::exception::File(file, "opening file for reading");
-
-	while (!in.eof())
-	{
-		std::string line;
-		getline(in, line);
-		if (line.substr(0, 10) == "POPULARITY")
-			continue;
-		if (line.substr(0, 14) == "END-POPULARITY")
-			continue;
-		vector<string> data = split(line);
-		if (data.size() < 4)
-			continue;
-		if (data[3] == "<NOFILES>")
-			// This is an empty / virtual package
-			m_scores.insert(make_pair(data[2], 0.1));
-		else if (data.size() == 4)
-			// Package normally in use
-			m_scores.insert(make_pair(data[2], 1.0));
-		else if (data[4] == "<OLD>")
-			// Unused packages
-			m_scores.insert(make_pair(data[2], 0.3));
-		else if (data[4] == "<RECENT-CTIME>")
-			// Recently installed packages
-			m_scores.insert(make_pair(data[2], 0.5));
-	}
-}
-
-float Local::score(const std::string& pkg) const
-{
-	std::map<std::string, float>::const_iterator i = m_scores.find(pkg);
-	if (i == m_scores.end())
-		return 0;
-	else
-		return i->second;
-}
-
-/**
- * Return the TFIDF score of the package computed against the popcon
- * information.
- */
-float Local::tfidf(const Popcon& popcon, const std::string& pkg) const
-{
-	float popconScore = popcon.score(pkg);
-	//cerr << pkg << ": " << score(pkg) << " * log(" << (float)popcon.submissions() << " / " << popconScore << ") = " << score(pkg) * log((float)popcon.submissions() / popconScore) << endl;
-	if (popconScore == 0)
-		return 0;
-	else
-		return score(pkg) * log((float)popcon.submissions() / popconScore);
-	
-}
-
-std::vector< std::pair<std::string, float> > Local::scores() const
-{
-	vector< pair<string, float> > res;
-	// Copy the scores in res
-	copy(m_scores.begin(), m_scores.end(), back_inserter(res));
-	// Sort res by score
-	sort(res.begin(), res.end(), secondsort());
-	return res;
-}
-
-std::vector< std::pair<std::string, float> > Local::tfidf(const Popcon& popcon) const
-{
-	vector< pair<string, float> > res;
-	// Compute the tfidf scores and store them into res
-	for (std::map<std::string, float>::const_iterator i = m_scores.begin();
-			i != m_scores.end(); ++i)
-	{
-		float popconScore = popcon.score(i->first);
-		if (popconScore == 0)
-			res.push_back(make_pair(i->first, 0.0f));
-		else
-			res.push_back(make_pair(i->first,
-						i->second * log((float)popcon.submissions() / popconScore)));
-	}
-	// Sort res by score
-	sort(res.begin(), res.end(), secondsort());
-	return res;
-}
-
-}
-}
-
-// vim:set ts=4 sw=4:
diff --git a/ept/popcon/local.h b/ept/popcon/local.h
deleted file mode 100644
index 257cc72..0000000
--- a/ept/popcon/local.h
+++ /dev/null
@@ -1,87 +0,0 @@
-#ifndef EPT_POPCON_LOCAL_H
-#define EPT_POPCON_LOCAL_H
-
-/** @file
- * @author Enrico Zini <enrico@enricozini.org>
- * Correlate popcon data with local popcon information
- */
-
-/*
- * Copyright (C) 2007  Enrico Zini <enrico@debian.org>
- *
- * 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 2 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, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
- */
-
-#include <string>
-#include <vector>
-#include <map>
-
-namespace ept {
-namespace popcon {
-
-class Popcon;
-
-/**
- * Access the results of the local daily popcon scan.
- */
-class Local
-{
-protected:
-	std::map<std::string, float> m_scores;
-	time_t m_timestamp;
-
-public:
-	Local(const std::string& file = std::string("/var/log/popularity-contest"));
-
-	/// Get the timestamp of the local popcon information
-	time_t timestamp() const { return m_timestamp; }
-
-	/// Return true if this data source has data, false if it's empty
-	bool hasData() const { return m_timestamp != 0; }
-
-	/**
-	 * Return the local score of the package
-	 */
-	float score(const std::string& pkg) const;
-
-	/**
-	 * Return the TFIDF score of the package computed against the popcon
-	 * information.
-	 *
-	 * The TFIDF score is high when a package is representative of this system,
-	 * that is, it is used in this system and not much used in other systems.
-	 */
-	float tfidf(const Popcon& popcon, const std::string& pkg) const;
-
-	/**
-	 * Read the local popcon vote and return the list of packages and their
-	 * local scores, sorted by ascending score.
-	 */
-	std::vector< std::pair<std::string, float> > scores() const;
-
-	/**
-	 * Read the local popcon vote and return the list of packages and their
-	 * TFIDF scores computed against the popcon information.
-	 *
-	 * The packages will be sorted by ascending score.
-	 */
-	std::vector< std::pair<std::string, float> > tfidf(const Popcon& popcon) const;
-};
-
-}
-}
-
-// vim:set ts=4 sw=4:
-#endif
diff --git a/ept/popcon/local.test.h b/ept/popcon/local.test.h
deleted file mode 100644
index 66d9919..0000000
--- a/ept/popcon/local.test.h
+++ /dev/null
@@ -1,111 +0,0 @@
-// -*- mode: c++; tab-width: 4; indent-tabs-mode: t -*-
-/*
- * popcon/local test
- *
- * Copyright (C) 2007  Enrico Zini <enrico@debian.org>
- *
- * 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 2 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, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
- */
-
-#include <ept/popcon/local.h>
-#include <ept/popcon/popcon.h>
-#include <ept/popcon/maint/path.h>
-
-#include <ept/test.h>
-
-using namespace std;
-using namespace ept;
-using namespace ept::popcon;
-
-struct TestPopconLocal
-{
-	Path::OverridePopconSourceDir odsd;
-	Path::OverridePopconIndexDir odid;
-	Path::OverridePopconUserSourceDir odusd;
-	Path::OverridePopconUserIndexDir oduid;
-
-	Popcon popcon;
-	Local local;
-
-	TestPopconLocal()
-		: odsd( TEST_ENV_DIR "popcon" ),
-		  odid( TEST_ENV_DIR "popcon" ),
-		  odusd( TEST_ENV_DIR "popcon" ),
-		  oduid( TEST_ENV_DIR "popcon" ),
-		  local( TEST_ENV_DIR "popcon/popularity-contest" )
-	{}
-
-    // Very basic access
-	Test basicAccess()
-	{
-		assert(local.score("apt") > 0);
-		assert(local.tfidf(popcon, "apt") > 0);
-	}
-
-#if 0 // mornfall: apparently left out by enrico, leaving as it is
-// Check that every valid index is accessible
-template<> template<>
-void to::test< 2 >()
-{
-	for (size_t i = 0; i < popcon.size(); ++i)
-	{
-		//cerr << popcon.name(i) << " " << popcon.score(i) << endl;
-		assert(popcon.score(i) > 0);
-	}
-}
-
-// Check that we can get a score for every package
-template<> template<>
-void to::test< 3 >()
-{
-	int has = 0;
-	for (Apt::iterator i = apt.begin(); i != apt.end(); ++i)
-	{
-		float score = popcon.score(*i);
-		if (score > 0)
-			++has;
-	}
-	// At least 1000 packages should have a score
-	assert(has > 1000);
-}
-
-// Check that scores are meaningful
-template<> template<>
-void to::test< 4 >()
-{
-	assert(popcon["apt"] > popcon["libapt-pkg-dev"]);
-}
-
-// If there is no data, Popcon should work as if all scores were 0
-template<> template<>
-void to::test<5>()
-{
-	Path::OverridePopconSourceDir odsd("./empty");
-	Path::OverridePopconIndexDir odid("./empty");
-	Path::OverridePopconUserSourceDir odusd("./empty");
-	Path::OverridePopconUserIndexDir oduid("./empty");
-	Popcon empty;
-
-	assert_eq(empty.timestamp(), 0);
-	assert(!empty.hasData());
-
-	assert(empty.size() == 0);
-	assert(empty.score("apt") == 0.0);
-}
-#endif
-
-};
-
-// vim:set ts=4 sw=4:
diff --git a/ept/popcon/maint/path.cc b/ept/popcon/maint/path.cc
deleted file mode 100644
index aef6314..0000000
--- a/ept/popcon/maint/path.cc
+++ /dev/null
@@ -1,113 +0,0 @@
-// -*- mode: c++; indent-tabs-mode: t -*-
-
-/** \file
- * popcon paths
- */
-
-/*
- * Copyright (C) 2005,2006,2007  Enrico Zini <enrico@debian.org>, Peter Rockai <me@mornfall.net>
- *
- * 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 2 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, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
- */
-
-#include <ept/config.h>
-#include <ept/popcon/maint/path.h>
-
-#include <wibble/sys/fs.h>
-#include <wibble/string.h>
-
-#include <sys/types.h>	// getpwuid, getuid
-#include <pwd.h>		// getpwuid
-#include <unistd.h>		// getuid
-
-using namespace wibble;
-
-namespace ept {
-namespace popcon {
-
-static std::string userdir()
-{
-	std::string rcdir;
-
-	struct passwd* udata = getpwuid(getuid());
-	rcdir = str::joinpath(udata->pw_dir, ".popcon");
-
-	return rcdir;
-}
-
-
-Path &Path::instance() {
-	if (!s_instance) {
-		s_instance = new Path;
-		instance().m_popconSourceDir = POPCON_DB_DIR;
-		instance().m_popconIndexDir = POPCON_DB_DIR;
-		instance().m_popconUserSourceDir = userdir();
-		instance().m_popconUserIndexDir = userdir();
-	}
-	return *s_instance;
-}
-
-int Path::access( const std::string &s, int m ) {
-	return ::access( s.c_str(), m );
-}
-
-time_t Path::timestamp( const std::string& file ) {
-    return sys::fs::timestamp(file, 0);
-}
-
-void Path::setPopconSourceDir( const std::string &s )
-{
-	instance().m_popconSourceDir = s;
-}
-void Path::setPopconIndexDir( const std::string &s )
-{
-	instance().m_popconIndexDir = s;
-}
-void Path::setPopconUserSourceDir( const std::string &s )
-{
-	instance().m_popconUserSourceDir = s;
-}
-void Path::setPopconUserIndexDir( const std::string &s )
-{
-	instance().m_popconUserIndexDir = s;
-}
-
-std::string Path::popconSourceDir() { return instance().m_popconSourceDir; }
-std::string Path::popconIndexDir() { return instance().m_popconIndexDir; }
-std::string Path::popconUserSourceDir() { return instance().m_popconUserSourceDir; }
-std::string Path::popconUserIndexDir() { return instance().m_popconUserIndexDir; }
-
-std::string Path::scores() {
-	return str::joinpath(popconIndexDir(), "scores");
-}
-
-std::string Path::scoresIndex() {
-	return str::joinpath(popconIndexDir(), "scores.idx");
-}
-
-std::string Path::userScores() {
-	return str::joinpath(popconUserIndexDir(), "scores");
-}
-
-std::string Path::userScoresIndex() {
-	return str::joinpath(popconUserIndexDir(), "scores.idx");
-}
-
-Path *Path::s_instance = 0;
-
-}
-}
-
-// vim:set ts=4 sw=4:
diff --git a/ept/popcon/maint/path.h b/ept/popcon/maint/path.h
deleted file mode 100644
index cb4c31d..0000000
--- a/ept/popcon/maint/path.h
+++ /dev/null
@@ -1,125 +0,0 @@
-// -*- mode: c++; indent-tabs-mode: t -*-
-/** \file
- * popcon paths
- */
-
-/*
- * Copyright (C) 2005,2006,2007  Enrico Zini <enrico@debian.org>
- *
- * 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 2 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, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
- */
-
-#ifndef EPT_POPCON_PATH_H
-#define EPT_POPCON_PATH_H
-
-#include <string>
-
-namespace ept {
-namespace popcon {
-
-/**
- * Singleton class to configure and access the various Popcon paths
- */
-class Path
-{
-public:
-	static std::string scores();
-	static std::string scoresIndex();
-	static std::string userScores();
-	static std::string userScoresIndex();
-
-	static std::string popconSourceDir();
-	static std::string popconIndexDir();
-	static std::string popconUserSourceDir();
-	static std::string popconUserIndexDir();
-
-	// Directory where Popcon source data is found
-	static void setPopconSourceDir( const std::string &s );
-
-	// Directory where Popcon indexes are kept
-	static void setPopconIndexDir( const std::string &s );
-
-	// User-specific directory for Popcon source data
-	static void setPopconUserSourceDir( const std::string &s );
-
-	// User-specific directory for Popcon index data
-	static void setPopconUserIndexDir( const std::string &s );
-
-	static int access( const std::string &, int );
-	static time_t timestamp( const std::string& );
-
-	// RAII-style classes to temporarily override directories
-	class OverridePopconSourceDir
-	{
-		std::string old;
-	public:
-		OverridePopconSourceDir(const std::string& path) : old(Path::popconSourceDir())
-		{
-			Path::setPopconSourceDir(path);
-		}
-		~OverridePopconSourceDir() { Path::setPopconSourceDir(old); }
-	};
-	class OverridePopconIndexDir
-	{
-		std::string old;
-	public:
-		OverridePopconIndexDir(const std::string& path) : old(Path::popconIndexDir())
-		{
-			Path::setPopconIndexDir(path);
-		}
-		~OverridePopconIndexDir() { Path::setPopconIndexDir(old); }
-	};
-	class OverridePopconUserSourceDir
-	{
-		std::string old;
-	public:
-		OverridePopconUserSourceDir(const std::string& path) : old(Path::popconUserSourceDir())
-		{
-			Path::setPopconUserSourceDir(path);
-		}
-		~OverridePopconUserSourceDir() { Path::setPopconUserSourceDir(old); }
-	};
-	class OverridePopconUserIndexDir
-	{
-		std::string old;
-	public:
-		OverridePopconUserIndexDir(const std::string& path) : old(Path::popconUserIndexDir())
-		{
-			Path::setPopconUserIndexDir(path);
-		}
-		~OverridePopconUserIndexDir() { Path::setPopconUserIndexDir(old); }
-	};
-protected:
-	static Path *s_instance;
-	static Path &instance();
-
-	// Directory where Popcon source data is found
-	std::string m_popconSourceDir;
-
-	// Directory where Popcon indexes are kept
-	std::string m_popconIndexDir;
-
-	// User-specific directory for Popcon source data
-	std::string m_popconUserSourceDir;
-
-	// User-specific directory for Popcon index data
-	std::string m_popconUserIndexDir;
-};
-
-}
-}
-
-// vim:set ts=4 sw=4:
-#endif
diff --git a/ept/popcon/maint/popconindexer.cc b/ept/popcon/maint/popconindexer.cc
deleted file mode 100644
index a8dea69..0000000
--- a/ept/popcon/maint/popconindexer.cc
+++ /dev/null
@@ -1,248 +0,0 @@
-#include <ept/popcon/popcon.h>
-#include <ept/popcon/maint/popconindexer.h>
-#include <ept/popcon/maint/path.h>
-
-#include <wibble/exception.h>
-#include <wibble/sys/fs.h>
-
-#include <tagcoll/diskindex/mmap.h>
-
-#include <unistd.h>
-#include <set>
-#include <string>
-#include <cstdio>
-#include <cstring>
-
-using namespace std;
-
-namespace ept {
-namespace popcon {
-
-template<typename STRUCT>
-struct StructIndexer : public tagcoll::diskindex::MMapIndexer
-{
-	const STRUCT& data;
-	StructIndexer(const STRUCT& data) : data(data) {}
-
-	int encodedSize() const { return sizeof(STRUCT); }
-	void encode(char* buf) const { *(STRUCT*)buf = data; }
-};
-
-/// MMapIndexer that indexes the package names
-struct PopconGenerator : public tagcoll::diskindex::MMapIndexer
-{
-	// Sorted set of all available package names and data
-	std::map<std::string, Score> data;
-
-	int encodedSize() const
-	{
-		int size = data.size() * sizeof(Score);
-		for (std::map<std::string, Score>::const_iterator i = data.begin();
-				i != data.end(); ++i)
-			size += i->first.size() + 1;
-		return tagcoll::diskindex::MMap::align(size);
-	}
-
-	void encode(char* buf) const
-	{
-		int pos = data.size() * sizeof(Score);
-		int idx = 0;
-		for (std::map<std::string, Score>::const_iterator i = data.begin();
-				i != data.end(); ++i)
-		{
-			((Score*)buf)[idx] = i->second;
-			((Score*)buf)[idx].offset = pos;
-			memcpy(buf + pos, i->first.c_str(), i->first.size() + 1);
-			pos += i->first.size() + 1;
-			++idx;
-		}
-	}
-};
-
-
-PopconIndexer::PopconIndexer()
-	: mainSource(Path::popconSourceDir()),
-	  userSource(Path::popconUserSourceDir())
-{
-	rescan();
-}
-
-void PopconIndexer::rescan()
-{
-	ts_main_src = mainSource.timestamp();
-	ts_user_src = userSource.timestamp();
-	ts_main_sco = Path::timestamp(Path::scores());
-	ts_user_sco = Path::timestamp(Path::userScores());
-	ts_main_idx = Path::timestamp(Path::scoresIndex());
-	ts_user_idx = Path::timestamp(Path::userScoresIndex());
-}
-
-bool PopconIndexer::needsRebuild() const
-{
-	// If there are no indexes of any kind, then we need rebuilding
-	if (ts_user_sco == 0 || ts_main_sco == 0 || ts_user_idx == 0 && ts_main_idx == 0)
-		return true;
-
-	// If the user index is ok, then we are fine
-	if (ts_user_sco >= sourceTimestamp() && ts_user_idx >= sourceTimestamp())
-		return false;
-
-	// If there are user sources, then we cannot use the system index
-	if (ts_user_src > 0)
-		return true;
-
-	// If there are no user sources, then we can fallback on the system
-	// indexes in case the user indexes are not up to date
-	if (ts_main_sco >= sourceTimestamp() && ts_main_idx >= sourceTimestamp())
-		return false;
-
-	return true;
-}
-
-bool PopconIndexer::userIndexIsRedundant() const
-{
-	// If there is no user index, then it is not redundant
-	if (ts_user_idx == 0)
-		return false;
-
-	// If the system index is not up to date, then the user index is not
-	// redundant
-	if (ts_main_idx < sourceTimestamp())
-		return false;
-
-	return true;
-}
-
-bool PopconIndexer::rebuild(const std::string& scofname, const std::string& idxfname)
-{
-	PopconGenerator gen;
-	InfoStruct is;
-	is.submissions = 0;
-	if (!mainSource.readScores(gen.data, is.submissions))
-		userSource.readScores(gen.data, is.submissions);
-	if (gen.data.empty())
-		return false;
-
-	StructIndexer<InfoStruct> infoStruct(is);
-
-	// Create the index
-	tagcoll::diskindex::MasterMMapIndexer master(idxfname);
-	master.append(gen);
-	master.append(infoStruct);
-	master.commit();
-
-//	for (map<string, Score>::const_iterator i = gen.data.begin(); i != gen.data.end(); ++i)
-//	{
-//		fprintf(stderr, "%s   %d   %f\n", i->first.c_str(), i->second.offset, i->second.score);
-//	}
-
-	// Create the score file
-	FILE* out = fopen(scofname.c_str(), "wt");
-	if (out == NULL)
-		throw wibble::exception::File(scofname, "opening and truncating file for writing");
-	for (map<string, Score>::const_iterator i = gen.data.begin();
-			i != gen.data.end(); ++i)
-	{
-		fprintf(out, "%s %f\n", i->first.c_str(), i->second.score);
-	}
-	fclose(out);
-	return true;
-}
-
-bool PopconIndexer::rebuildIfNeeded()
-{
-	if (needsRebuild())
-	{
-		// Decide if we rebuild the user index or the system index
-		if (Path::access(Path::popconIndexDir(), W_OK) == 0)
-		{
-			// Since we can write on the system index directory, we rebuild
-			// the system index
-			if (!rebuild(Path::scores(), Path::scoresIndex()))
-				return false;
-			ts_main_sco = Path::timestamp(Path::scores());
-			ts_main_idx = Path::timestamp(Path::scoresIndex());
-			if (Path::scores() == Path::userScores())
-				ts_user_sco = ts_main_sco;
-			if (Path::scoresIndex() == Path::userScoresIndex())
-				ts_user_idx = ts_main_idx;
-		} else {
-			wibble::sys::fs::mkFilePath(Path::userScores());
-			wibble::sys::fs::mkFilePath(Path::userScoresIndex());
-			if (!rebuild(Path::userScores(), Path::userScoresIndex()))
-				return false;
-			ts_user_sco = Path::timestamp(Path::userScores());
-			ts_user_idx = Path::timestamp(Path::userScoresIndex());
-		}
-		return true;
-	}
-	return false;
-}
-
-bool PopconIndexer::deleteRedundantUserIndex()
-{
-	if (userIndexIsRedundant())
-	{
-		// Delete the user indexes if they exist
-		if (Path::scores() != Path::userScores())
-		{
-			unlink(Path::userScores().c_str());
-			ts_user_sco = 0;
-		}
-		if (Path::scoresIndex() != Path::userScoresIndex())
-		{
-			unlink(Path::userScoresIndex().c_str());
-			ts_user_idx = 0;
-		}
-		return true;
-	}
-	return false;
-}
-
-bool PopconIndexer::getUpToDatePopcon(std::string& scofname, std::string& idxfname)
-{
-	// If there are no indexes of any kind, then we have nothing to return
-	if (ts_user_sco == 0 && ts_main_sco == 0 && ts_user_idx == 0 && ts_main_idx == 0)
-		return false;
-
-	// If the user index is up to date, use it
-	if (ts_user_sco >= sourceTimestamp() &&
-	    ts_user_idx >= sourceTimestamp())
-	{
-		scofname = Path::userScores();
-		idxfname = Path::userScoresIndex();
-		return true;
-	}
-
-	// If the user index is not up to date and we have user sources, we cannot
-	// fall back to the system index
-	if (ts_user_src != 0)
-		return false;
-
-	// Fallback to the system index
-	if (ts_main_sco >= sourceTimestamp() &&
-	    ts_main_idx >= sourceTimestamp())
-	{
-		scofname = Path::scores();
-		idxfname = Path::scoresIndex();
-		return true;
-	}
-
-	return false;
-}
-
-
-bool PopconIndexer::obtainWorkingPopcon(std::string& scofname, std::string& idxfname)
-{
-	PopconIndexer indexer;
-
-	indexer.rebuildIfNeeded();
-	indexer.deleteRedundantUserIndex();
-	return indexer.getUpToDatePopcon(scofname, idxfname);
-}
-
-
-}
-}
-
-// vim:set ts=4 sw=4:
diff --git a/ept/popcon/maint/popconindexer.h b/ept/popcon/maint/popconindexer.h
deleted file mode 100644
index 86789cf..0000000
--- a/ept/popcon/maint/popconindexer.h
+++ /dev/null
@@ -1,75 +0,0 @@
-#ifndef EPT_DEBTAGS_PKGIDINDEXER_H
-#define EPT_DEBTAGS_PKGIDINDEXER_H
-
-/** @file
- * @author Enrico Zini <enrico@enricozini.org>
- * Rebuild and maintain the map from package IDs to package names
- */
-
-/*
- * Copyright (C) 2003-2007  Enrico Zini <enrico@debian.org>
- *
- * 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 2 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, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
- */
-
-#include <ept/popcon/maint/sourcedir.h>
-#include <string>
-
-namespace ept {
-namespace popcon {
-
-struct InfoStruct
-{
-	size_t submissions;
-};
-
-struct PopconIndexer
-{
-	SourceDir mainSource;
-	SourceDir userSource;
-	time_t ts_main_src;
-	time_t ts_user_src;
-	time_t ts_main_sco;
-	time_t ts_user_sco;
-	time_t ts_main_idx;
-	time_t ts_user_idx;
-
-	time_t sourceTimestamp() const
-	{
-		time_t res = ts_main_src;
-		if (ts_user_src > res) res = ts_user_src;
-		return res;
-
-	}
-	bool needsRebuild() const;
-	bool rebuild(const std::string& scofname, const std::string& idxfname);
-	bool rebuildIfNeeded();
-	bool getUpToDatePopcon(std::string& scofname, std::string& idxfname);
-
-	bool userIndexIsRedundant() const;
-	bool deleteRedundantUserIndex();
-
-	void rescan();
-
-	PopconIndexer();
-
-	static bool obtainWorkingPopcon(std::string& scofname, std::string& idxfname);
-};
-
-}
-}
-
-// vim:set ts=4 sw=4:
-#endif
diff --git a/ept/popcon/maint/sourcedir.cc b/ept/popcon/maint/sourcedir.cc
deleted file mode 100644
index c908edd..0000000
--- a/ept/popcon/maint/sourcedir.cc
+++ /dev/null
@@ -1,155 +0,0 @@
-#include <ept/popcon/maint/sourcedir.h>
-#include <ept/popcon/maint/path.h>
-
-#include <wibble/string.h>
-#include <wibble/sys/fs.h>
-
-#include <tagcoll/input/zlib.h>
-#include <tagcoll/input/stdio.h>
-
-#include <cstdlib>
-
-using namespace std;
-using namespace wibble;
-
-namespace ept {
-namespace popcon {
-
-SourceDir::SourceDir(const std::string& path)
-    : sys::fs::Directory(path)
-{
-}
-SourceDir::~SourceDir()
-{
-}
-
-SourceDir::FileType SourceDir::fileType(const std::string& name)
-{
-	if (name[0] == '.') return SKIP;
-
-	if (name == "all-popcon-results.txt") return RAW;
-	if (name == "all-popcon-results.txt.gz") return RAWGZ;
-
-	return SKIP;
-}
-
-time_t SourceDir::timestamp()
-{
-    if (!exists()) return 0;
-
-    time_t max = 0;
-    for (const_iterator d = begin(); d != end(); ++d)
-    {
-        string name = *d;
-        FileType type = fileType(name);
-        if (type == SKIP) continue;
-
-        time_t ts = Path::timestamp(str::joinpath(m_path, name));
-        if (ts > max) max = ts;
-	}
-
-	return max;
-}
-
-bool readLine(tagcoll::input::Input& in, string& str)
-{
-	str.clear();
-	int c;
-	while ((c = in.nextChar()) != tagcoll::input::Input::Eof && c != '\n')
-		str += c;
-	return c != tagcoll::input::Input::Eof;
-}
-
-static void parseScores(tagcoll::input::Input& in, map<std::string, Score>& out, size_t& submissions)
-{
-	string line;
-	while (readLine(in, line))
-	{
-		if (line.size() < 10)
-			continue;
-		if (line.substr(0, 13) == "Submissions: ")
-		{
-			submissions = strtoul(line.substr(13).c_str(), 0, 10);
-			continue;
-		}
-		if (line.substr(0, 9) != "Package: ")
-			continue;
-		size_t start = 9;
-		size_t end = line.find(' ', start);
-		if (end == string::npos)
-			continue;
-		string name = line.substr(start, end-start);
-		// Skip packages not in the apt index
-		//if (!apt.isValid(name))
-			//continue;
-
-		start = line.find_first_not_of(' ', end);
-		if (start == string::npos) continue;
-		end = line.find(' ', start);
-		if (end == string::npos) continue;
-		string vote = line.substr(start, end-start);
-
-		start = line.find_first_not_of(' ', end);
-		if (start == string::npos) continue;
-		end = line.find(' ', start);
-		if (end == string::npos) continue;
-		string old = line.substr(start, end-start);
-
-		start = line.find_first_not_of(' ', end);
-		if (start == string::npos) continue;
-		end = line.find(' ', start);
-		if (end == string::npos) continue;
-		string recent = line.substr(start, end-start);
-
-		start = line.find_first_not_of(' ', end);
-		if (start == string::npos) continue;
-		end = line.find(' ', start);
-		if (end == string::npos) end = line.size();
-		string nofiles = line.substr(start, end-start);
-
-		float score = (float)strtoul(vote.c_str(), NULL, 10) 
-					+ (float)strtoul(recent.c_str(), NULL, 10) * 0.5f
-			        + (float)strtoul(old.c_str(), NULL, 10) * 0.3f
-			        + (float)strtoul(nofiles.c_str(), NULL, 10) * 0.8f;
-
-		if (score > 0)
-			out.insert(make_pair(name, Score(score)));
-	}
-}
-
-bool SourceDir::readScores(map<std::string, Score>& out, size_t& submissions)
-{
-    if (!exists()) return false;
-
-    bool done = false;
-
-    for (const_iterator d = begin(); d != end(); ++d)
-    {
-        string name = *d;
-        FileType type = fileType(name);
-		if (type == RAW)
-		{
-            // Read uncompressed data
-            tagcoll::input::Stdio in(str::joinpath(m_path, name));
-
-			// Read the scores
-			parseScores(in, out, submissions);
-			done = true;
-		}
-		else if (type == RAWGZ)
-		{
-            // Read compressed data
-            tagcoll::input::Zlib in(str::joinpath(m_path, name));
-
-			// Read the scores
-			parseScores(in, out, submissions);
-			done = true;
-		}
-	}
-	return done;
-}
-
-}
-}
-
-// vim:set ts=4 sw=4:
diff --git a/ept/popcon/maint/sourcedir.h b/ept/popcon/maint/sourcedir.h
deleted file mode 100644
index eccb6f1..0000000
--- a/ept/popcon/maint/sourcedir.h
+++ /dev/null
@@ -1,64 +0,0 @@
-#ifndef EPT_POPCON_SOURCEDIR_H
-#define EPT_POPCON_SOURCEDIR_H
-
-/** @file
- * @author Enrico Zini <enrico@enricozini.org>
- * Popcon data source directory access
- */
-
-/*
- * Copyright (C) 2003,2004,2005,2006,2007  Enrico Zini <enrico@debian.org>
- *
- * 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 2 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, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
- */
-
-#include <ept/popcon/popcon.h>
-#include <wibble/sys/fs.h>
-#include <string>
-#include <map>
-
-namespace ept {
-namespace popcon {
-
-/**
- * Access a directory containing Debtags data files
- */
-class SourceDir : public wibble::sys::fs::Directory
-{
-protected:
-	enum FileType { SKIP, RAW, RAWGZ };
-
-	// Check if a file name is a tag file, a vocabulary file or a file to skip.
-	// Please notice that it works on file names, not paths.
-	FileType fileType(const std::string& name);
-
-public:
-    SourceDir(const std::string& path);
-    ~SourceDir();
-
-	/// Return the time of the newest file in the source directory
-	time_t timestamp();
-
-	/**
-	 * Read the tag files in the directory and output their content to the map
-	 */
-	bool readScores(std::map<std::string, Score>& out, size_t& submissions);
-};
-
-}
-}
-
-// vim:set ts=4 sw=4:
-#endif
diff --git a/ept/popcon/popcon.cc b/ept/popcon/popcon.cc
deleted file mode 100644
index 2ce9e53..0000000
--- a/ept/popcon/popcon.cc
+++ /dev/null
@@ -1,95 +0,0 @@
-// -*- mode: c++; tab-width: 4; indent-tabs-mode: t -*-
-
-/** @file
- * @author Enrico Zini <enrico@enricozini.org>
- * Quick map from package IDs to package names
- */
-
-/*
- * Copyright (C) 2007  Enrico Zini <enrico@debian.org>
- *
- * 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 2 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, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
- */
-
-#include <ept/popcon/popcon.h>
-#include <ept/popcon/maint/popconindexer.h>
-#include <ept/popcon/maint/path.h>
-
-//#include <iostream>
-
-using namespace std;
-
-namespace ept {
-namespace popcon {
-
-size_t Popcon::GeneralInfo::submissions() const
-{
-	if (!m_buf) return 0;
-	return ((InfoStruct*)m_buf)->submissions;
-}
-
-Popcon::Popcon()
-{
-	std::string scofname, idxfname;
-
-	if (!PopconIndexer::obtainWorkingPopcon(scofname, idxfname))
-	{
-		m_timestamp = 0;
-		return;
-	}
-
-	//cerr << "GOT " << scofname << " " << idxfname << endl;
-
-	m_timestamp = Path::timestamp(idxfname);
-
-	mastermmap.init(idxfname);
-	tagcoll::diskindex::MMap::init(mastermmap, 0);
-
-	m_info.init(mastermmap, 1);
-
-	//cerr << "SIZE " << size() << endl;
-	//for (size_t i = 0; i < size(); ++i)
-	//{
-	//	cerr << "EL " << i << ": " << ((Score*)m_buf)[i].offset << " " << ((Score*)m_buf)[i].score << endl;
-	//}
-}
-
-float Popcon::scoreByName(const std::string& name) const
-{
-	// Binary search the index to find the package ID
-	int begin, end;
-
-	/* Binary search */
-	begin = -1, end = size();
-	while (end - begin > 1)
-	{
-		int cur = (end + begin) / 2;
-		if (this->name(cur) > name)
-			end = cur;
-		else
-			begin = cur;
-	}
-
-	if (begin == -1 || this->name(begin) != name)
-		//throw NotFoundException(string("looking for the ID of string ") + str);
-		return 0;
-	else
-		return score(begin);
-}
-
-}
-}
-
-// vim:set ts=4 sw=4:
diff --git a/ept/popcon/popcon.h b/ept/popcon/popcon.h
deleted file mode 100644
index 684f98a..0000000
--- a/ept/popcon/popcon.h
+++ /dev/null
@@ -1,153 +0,0 @@
-// -*- mode: c++; tab-width: 4; indent-tabs-mode: t -*-
-#ifndef EPT_POPCON_POPCON_H
-#define EPT_POPCON_POPCON_H
-
-/** @file
- * @author Enrico Zini <enrico@enricozini.org>
- * Access popcon data
- */
-
-/*
- * Copyright (C) 2007  Enrico Zini <enrico@debian.org>
- *
- * 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 2 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, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
- */
-
-#include <tagcoll/diskindex/mmap.h>
-#include <string>
-
-namespace ept {
-namespace apt {
-class Apt;
-}
-
-namespace popcon {
-
-/**
- * Store the score information in the popcon cache.
- *
- * Currently, this is only one float; more can be added in the future.
- */
-class Score
-{
-protected:
-	unsigned offset;
-
-public:
-	float score;
-
-	Score(float score) : offset(offset), score(score) {}
-
-	friend class Popcon;
-	friend class PopconIndexer;
-	friend class PopconGenerator;
-};
-
-/**
- * Maps Packages to IDs and vice-versa.
- *
- * This is used in building the Debtags fast index, which works representing
- * tags and packages as int IDs.
- *
- * Index building works like this:
- *  1. The file all-popcon-results.txt.gz is downloaded from
- *     http://popcon.debian.org/all-popcon-results.txt.gz
- *  2. The file is put in either ~/.popcon/all-popcon-results.txt.gz
- *     or in /var/lib/popcon/all-popcon-results.txt.gz
- *  3. If the file is newer than the index, it will be automatically used to
- *     recompute the scores and rebuild the index.
- */
-class Popcon : public tagcoll::diskindex::MMap
-{
-	struct GeneralInfo : public tagcoll::diskindex::MMap
-	{
-		size_t submissions() const;
-	};
-
-	tagcoll::diskindex::MasterMMap mastermmap;
-	time_t m_timestamp;
-
-	GeneralInfo m_info;
-
-	/// Get the score structure by index
-	const Score* structByIndex(size_t idx) const
-	{
-		if (idx >= 0 && idx < size())
-			return (Score*)m_buf + idx;
-		return 0;
-	}
-
-public:
-	Popcon();
-
-	/// Get the timestamp of when the index was last updated
-	time_t timestamp() const { return m_timestamp; }
-
-	/// Return true if this data source has data, false if it's empty
-	bool hasData() const { return m_timestamp != 0; }
-
-	/// Return the total number of popcon submissions
-	size_t submissions() const { return m_info.submissions(); }
-
-	/// Get the number of packages in the index
-	size_t size() const
-	{
-		if (m_buf)
-			return ((Score*)m_buf)->offset / sizeof(Score);
-		else
-			return 0;
-	}
-
-	/**
-	 * Get a package name by index
-	 *
-	 * If the index is not valid, returns the empty string.
-	 */
-	std::string name(size_t idx) const
-	{
-		const Score* s = structByIndex(idx);
-		if (s == 0) return std::string();
-		return std::string(m_buf + s->offset);
-	}
-
-	/// Get the score by index
-	float scoreByIndex(size_t idx) const
-	{
-		const Score* s = structByIndex(idx);
-		if (!s) return 0;
-		return s->score;
-	}
-
-	/// Get the score structure by package name
-	float scoreByName(const std::string& name) const;
-
-	/// Get the score by index
-	float score(size_t idx) const { return scoreByIndex(idx); }
-
-	/// Get the score by index
-	float operator[](int idx) const { return scoreByIndex(idx); }
-
-	/// Get the score by name
-	float score(const std::string& name) const { return scoreByName(name); }
-
-	/// Get the score structure by package name
-	float operator[](const std::string& name) const { return scoreByName(name); }
-};
-
-}
-}
-
-// vim:set ts=4 sw=4:
-#endif
diff --git a/ept/popcon/popcon.test.h b/ept/popcon/popcon.test.h
deleted file mode 100644
index 4509b85..0000000
--- a/ept/popcon/popcon.test.h
+++ /dev/null
@@ -1,108 +0,0 @@
-// -*- mode: c++; tab-width: 4; indent-tabs-mode: t -*-
-/*
- * popcon test
- *
- * Copyright (C) 2007  Enrico Zini <enrico@debian.org>
- *
- * 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 2 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, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
- */
-
-#include <ept/popcon/popcon.h>
-#include <ept/popcon/maint/path.h>
-#include <ept/apt/apt.h>
-#include <set>
-
-#include <ept/test.h>
-
-using namespace std;
-using namespace ept;
-using namespace ept::popcon;
-using namespace ept::apt;
-
-struct TestPopcon
-{
-	popcon::Path::OverridePopconSourceDir odsd;
-	popcon::Path::OverridePopconIndexDir odid;
-	popcon::Path::OverridePopconUserSourceDir odusd;
-	popcon::Path::OverridePopconUserIndexDir oduid;
-
-	Apt apt;
-	Popcon popcon;
-
-	TestPopcon()
-		: odsd( TEST_ENV_DIR "popcon" ),
-		  odid( TEST_ENV_DIR "popcon" ),
-		  odusd( TEST_ENV_DIR "popcon" ),
-		  oduid( TEST_ENV_DIR "popcon" )
-	{}
-
-	Test basicAccess()
-	{
-		assert_eq(popcon.submissions(), 52024);
-		assert(popcon.size() > 0);
-		assert(popcon.score(0) > 0);
-		assert(!popcon.name(0).empty());
-	}
-
-    // Check that every valid index is accessible
-	Test accessibility()
-	{
-		for (size_t i = 0; i < popcon.size(); ++i)
-		{
-			//cerr << popcon.name(i) << " " << popcon.score(i) << endl;
-			assert(popcon.score(i) > 0);
-		}
-	}
-	
-	// Check that we can get a score for every package
-	Test haveScores()
-	{
-		int has = 0;
-		for (Apt::iterator i = apt.begin(); i != apt.end(); ++i)
-		{
-			float score = popcon.score(*i);
-			if (score > 0)
-				++has;
-		}
-		// At least 1000 packages should have a score
-		assert(has > 1000);
-	}
-
-    // Check that scores are meaningful
-	Test validScores()
-	{
-		assert(popcon["apt"] > popcon["libapt-pkg-dev"]);
-	}
-
-    // If there is no data, Popcon should work as if all scores were 0
-	Test fallbackValues()
-	{
-		popcon::Path::OverridePopconSourceDir odsd("./empty");
-		popcon::Path::OverridePopconIndexDir odid("./empty");
-		popcon::Path::OverridePopconUserSourceDir odusd("./empty");
-		popcon::Path::OverridePopconUserIndexDir oduid("./empty");
-		Popcon empty;
-		
-		assert_eq(empty.timestamp(), 0);
-		assert(!empty.hasData());
-
-		assert_eq(empty.submissions(), 0);
-		assert(empty.size() == 0);
-		assert(empty.score("apt") == 0.0);
-	}
-
-};
-
-// vim:set ts=4 sw=4:
diff --git a/ept/sources.h b/ept/sources.h
deleted file mode 100644
index cefbc56..0000000
--- a/ept/sources.h
+++ /dev/null
@@ -1,220 +0,0 @@
-/** -*- C++ -*-
-	@file ept/sources.h
-	@author Peter Rockai <me@mornfall.net>
-*/
-
-#include <iterator>
-#include <iostream>
-#include <sstream>
-#include <string>
-
-#include <wibble/range.h>
-#include <wibble/mixin.h>
-
-#ifndef EPT_SOURCES_H
-#define EPT_SOURCES_H
-
-namespace ept {
-
-struct Sources {
-    struct Entry : wibble::mixin::Comparable< Entry > {
-        typedef wibble::Range< std::string > StringRange;
-        typedef wibble::Consumer< std::string > StringConsumer;
-        typedef std::vector< std::string > StringVector;
-        struct Word { std::string s; };
-        enum Type { Binary, Source, Comment };
-        Entry( bool e = false, Type t = Comment,
-               std::string u = "", std::string d = "",
-               StringRange c = wibble::range( *new StringVector ) )
-            : m_enabled( e ), m_type( t ), m_url( u ), m_dist( d )
-        {
-            c.output( wibble::consumer( m_components ) );
-        }
-
-        Entry( const Entry &e )
-            : m_enabled( e.m_enabled ), m_type( e.m_type ), m_url( e.m_url ),
-              m_dist( e.m_dist ), m_comment( e.m_comment )
-        {
-            wibble::range( e.m_components ).output( wibble::consumer( m_components ) );
-        }
-
-        bool operator< ( const Entry &o ) const {
-            if (type() < o.type())
-                return true;
-            if (enabled() < o.enabled())
-                return true;
-            if (url() < o.url())
-                return true;
-            if (distribution() < o.distribution())
-                return true;
-            if (components() < o.components())
-                return true;
-            if (comment() < o.comment())
-                return true;
-            return false;
-        }
-
-        bool operator== ( const Entry &e ) const {
-            return not ( ( *this < e ) || ( e < *this ) );
-        }
-
-        std::string components() const {
-            std::ostringstream s;
-            std::copy( m_components.begin(), m_components.end(),
-                       std::ostream_iterator< std::string >( s, " " ) );
-            return s.str();
-        }
-
-        void setComponents( const std::string &s ) {
-            std::istringstream i( s );
-            m_components.clear();
-            std::copy( std::istream_iterator< std::string >( i ),
-                       std::istream_iterator< std::string >(),
-                       wibble::consumer( m_components ) );
-        }
-
-        std::string typeString() const {
-			switch (type())
-			{
-				case Binary: return "deb";
-				case Source: return "deb-src";
-				case Comment: return "comment";
-			}
-        }
-
-        void setTypeString( const std::string &s ) {
-            if (s == "deb") setType( Binary );
-            if (s == "deb-src") setType( Source );
-            if (s == "comment") setType( Comment );
-        }
-
-        std::string distribution() const { return m_dist; }
-        void setDistribution( const std::string &s ) { m_dist = s; }
-
-        std::string url() const { return m_url; }
-        void setUrl( const std::string &s ) { m_url = s; }
-
-        bool enabled() const { return m_enabled; }
-        void setEnabled( bool e ) { m_enabled = e; }
-
-        std::string comment() const { return m_comment; }
-        void setComment( const std::string &s ) { m_comment = s; }
-
-        Type type() const { return m_type; }
-        void setType( Type t ) {
-            m_type = t;
-            if (t == Comment) setEnabled( false );
-        }
-
-        friend std::istream &operator >>( std::istream &i, Entry &s );
-
-        protected:
-
-        bool m_enabled;
-        Type m_type;
-        std::string m_url;
-        std::string m_dist;
-        StringVector m_components;
-        std::string m_comment;
-    };
-    void add( const Entry &e ) {
-        wibble::consumer( m_entries ).consume( e );
-    }
-    void clear() { m_entries.clear(); }
-    void disable( const Entry & );
-    void enable( const Entry & );
-    wibble::Range< Entry > entries() const {
-        return wibble::range( m_entries );
-    }
-    friend std::istream &operator >>( std::istream &i, Sources &s );
-protected:
-    std::vector< Entry > m_entries;
-};
-
-inline std::istream &operator >>( std::istream &i, Sources::Entry::Word &w )
-{
-    bool bracket = false, quote = false, started = false;
-    char c;
-    w.s = "";
-    while (!i.eof()) {
-        c = i.get();
-        if (started && !quote && !bracket && isspace( c ))
-            break;
-        if (!isspace( c ))
-            started = true;
-        if (started)
-            w.s += c;
-        if (bracket && c == ']')
-            bracket = false;
-        if (quote && c == '"')
-            quote = false;
-        if (!quote && c == '[')
-            bracket = true;
-        if (!bracket && c == '"')
-            quote = true;
-    }
-    return i;
-}
-
-inline std::istream &operator >>( std::istream &i, Sources::Entry &e ) {
-    std::string line, tmp;
-    std::getline( i, line );
-    std::istringstream l( line );
-    // std::cerr << "parsing line: " << line << std::endl;
-    l >> tmp;
-    e.setEnabled( true );
-    if (tmp[0] == '#') {
-        if (tmp.size() > 1)
-            tmp = tmp.substr(1);
-        else
-            l >> tmp;
-        e.setEnabled( false );
-    }
-    // std::cerr << "type: " << tmp << std::endl;
-    if (tmp == "deb" || tmp == "deb-src") {
-        e.setTypeString( tmp );
-    } else {
-        // std::cerr << "comment: '" << line << "'" << std::endl;
-        e.setType( Sources::Entry::Comment );
-        e.setEnabled( false );
-        e.setComment( line );
-        return i;
-    }
-    Sources::Entry::Word w;
-    l >> w; e.m_url = w.s;
-    l >> w; e.m_dist = w.s;
-    e.m_components.clear();
-    std::copy( std::istream_iterator< std::string >( l ),
-               std::istream_iterator< std::string >(),
-               wibble::consumer( e.m_components ) );
-    return i;
-}
-
-inline std::ostream &operator <<( std::ostream &o, const Sources::Entry &e )
-{
-    if (e.type() == Sources::Entry::Comment)
-        return o << e.comment();
-    if (! e.enabled())
-        o << "# ";
-    o << e.typeString();
-    o << " " << e.url() << " " << e.distribution() << " " << e.components();
-    return o;
-}
-
-inline std::istream &operator >>( std::istream &i, Sources &s ) {
-    std::copy( std::istream_iterator< Sources::Entry >( i ),
-               std::istream_iterator< Sources::Entry >(),
-               wibble::consumer( s.m_entries ) );
-    return i;
-}
-
-inline std::ostream &operator <<( std::ostream &o, const Sources &s ) {
-    std::copy( s.entries().begin(), s.entries().end(),
-               std::ostream_iterator< Sources::Entry >( o, "\n" ) );
-    return o;
-}
-
-}
-
-#endif
-// vim:set ts=4 sw=4:
diff --git a/ept/test-data/popcon/all-popcon-results.txt.gz b/ept/test-data/popcon/all-popcon-results.txt.gz
deleted file mode 100644
index 8b3bf6a..0000000
--- a/ept/test-data/popcon/all-popcon-results.txt.gz
+++ /dev/null
diff --git a/ept/test-data/popcon/popularity-contest b/ept/test-data/popcon/popularity-contest
deleted file mode 100644
index 6eeec20..0000000
--- a/ept/test-data/popcon/popularity-contest
+++ /dev/null
@@ -1,1904 +0,0 @@
-POPULARITY-CONTEST-0 TIME:1181000000 ID:00000000000000000000000000000000 ARCH:amd64 POPCONVER:1.42
-1181048444 1181048464 powertop /usr/bin/powertop <RECENT-CTIME>
-1181041113 1181041119 signing-party /usr/bin/keylookup <RECENT-CTIME>
-1181041113 1181041118 postgresql-common /usr/share/postgresql-common/t/TestLib.pm <RECENT-CTIME>
-1181041113 1181041114 cpio /bin/mt-gnu <RECENT-CTIME>
-1181041113 1181041118 postgresql-client-common /usr/bin/pg_restore <RECENT-CTIME>
-1180897461 1180897510 libgnome2-0 /usr/bin/gnome-open <RECENT-CTIME>
-1180897461 1180897574 unionfs-tools /usr/sbin/unionimap <RECENT-CTIME>
-1180897461 1180897545 pppoe /usr/sbin/pppoe-relay <RECENT-CTIME>
-1180897461 1180897498 recordmydesktop /usr/bin/recordmydesktop <RECENT-CTIME>
-1180897461 1180897480 aircrack-ng /usr/sbin/airmon-ng <RECENT-CTIME>
-1180897461 1180897461 dmidecode /usr/sbin/dmidecode <RECENT-CTIME>
-1180897461 1180897583 zlib-bin /usr/bin/miniunzip <RECENT-CTIME>
-1180897461 1180897462 info /usr/bin/infokey <RECENT-CTIME>
-1180897461 1180897480 whois /usr/bin/mkpasswd <RECENT-CTIME>
-1180897461 1180897572 tofrodos /usr/bin/dos2unix <RECENT-CTIME>
-1180897461 1180897479 texinfo /usr/bin/ginstall-info <RECENT-CTIME>
-1180897461 1180897510 libgnome2-dev /usr/lib/libgnome-2.a <RECENT-CTIME>
-1180897461 1180897484 fakeroot /usr/bin/faked-sysv <RECENT-CTIME>
-1180897461 1180897479 python-central /usr/bin/dh_pycentral <RECENT-CTIME>
-1180897461 1180897474 file /usr/bin/file <RECENT-CTIME>
-1180897461 1180897575 wdiff /usr/bin/wdiff <RECENT-CTIME>
-1180897461 1180897584 915resolution /usr/sbin/915resolution <RECENT-CTIME>
-1180897461 1180897544 openvpn /usr/include/openvpn/openvpn-plugin.h <RECENT-CTIME>
-1180897461 1180897486 gconf2 /usr/sbin/update-gconf-defaults <RECENT-CTIME>
-1180897461 1180897505 libaudio-dev /usr/lib/libaudio.a <RECENT-CTIME>
-1180897461 1180897555 python2.4 /usr/bin/pdb2.4 <RECENT-CTIME>
-1180897461 1180897469 module-init-tools /sbin/lsmod <RECENT-CTIME>
-1180897461 1180897539 noiz2sa-data /usr/share/games/noiz2sa/ogg/ogg.h <RECENT-CTIME>
-1180897461 1180897462 iputils-ping /bin/ping6 <RECENT-CTIME>
-1180897461 1180897498 gv /usr/bin/gv <RECENT-CTIME>
-1180897461 1180897497 gtk-recordmydesktop /usr/bin/gtk-recordMyDesktop <RECENT-CTIME>
-1180897461 1180897493 mkisofs /usr/bin/mkhybrid <RECENT-CTIME>
-1180897461 1180897586 reprepro /usr/bin/changestool <RECENT-CTIME>
-1180897461 1180897493 genisoimage /usr/bin/isovfy <RECENT-CTIME>
-1180897461 1180897560 qemu /usr/sbin/qemu-make-debian-root <RECENT-CTIME>
-1180897461 1180897575 vde2 /usr/bin/vdeqemu <RECENT-CTIME>
-1180897461 1180897540 ntp /usr/bin/ntpq <RECENT-CTIME>
-1180897461 1180897508 libexif-dev /usr/include/libexif/exif-content.h <RECENT-CTIME>
-1180897461 1180897538 netpbm /usr/bin/bmptoppm <RECENT-CTIME>
-1180897461 1180897586 simple-cdd /usr/bin/build-simple-cdd <RECENT-CTIME>
-1180897461 1180897492 psmisc /usr/bin/pstree.x11 <RECENT-CTIME>
-1180897461 1180897471 dictionaries-common /usr/sbin/update-default-aspell <RECENT-CTIME>
-1180897461 1180897534 libungif4-dev /usr/lib/libgif.a <RECENT-CTIME>
-1180897461 1180897582 xpdf-common /usr/sbin/update-xpdfrc <RECENT-CTIME>
-1180897461 1180897571 testdisk /usr/sbin/photorec <RECENT-CTIME>
-1180897461 1180897470 bind9-host /usr/bin/host <RECENT-CTIME>
-1180897461 1180897484 eject /usr/bin/volname <RECENT-CTIME>
-1180897461 1180897478 pidentd /usr/sbin/ikeygen <RECENT-CTIME>
-1180897461 1180897556 python-minimal /usr/bin/python <RECENT-CTIME>
-1180897461 1180897586 xgsmlib /usr/bin/xgsm <RECENT-CTIME>
-1180897461 1180897585 libccid /usr/bin/RSA_SecurID_getpasswd <RECENT-CTIME>
-1180897461 1180897500 hal /usr/sbin/hald <RECENT-CTIME>
-1180897461 1180897570 samba-common /usr/bin/testparm <RECENT-CTIME>
-1180897461 1180897499 usbutils /usr/bin/lsusb <RECENT-CTIME>
-1180897461 1180897566 smbclient /usr/bin/smbcquotas <RECENT-CTIME>
-1180897461 1180897555 python /usr/bin/pdb <RECENT-CTIME>
-1180897461 1180897581 xpdf-reader /usr/bin/xpdf.bin <RECENT-CTIME>
-1180897461 1180897475 ispell /usr/sbin/ispellconfig <RECENT-CTIME>
-1180897461 1180897575 webcpp /usr/bin/scs2scs2 <RECENT-CTIME>
-1180897461 1180897482 daemon /usr/bin/daemon <RECENT-CTIME>
-1180897461 1180897482 cdparanoia /usr/bin/cdparanoia <RECENT-CTIME>
-1180897461 1180897485 libgconf2-dev /usr/lib/libgconf-2.a <RECENT-CTIME>
-1180897461 1180897549 python-xml /usr/bin/xmlproc_val.python-xml <RECENT-CTIME>
-1180897461 1180897481 blktrace /usr/sbin/blktrace <RECENT-CTIME>
-1180897461 1180897584 hfsutils /usr/bin/humount <RECENT-CTIME>
-1180897461 1180897541 openssl /usr/bin/openssl <RECENT-CTIME>
-1180897461 1180897503 libart-2.0-dev /usr/bin/libart2-config <RECENT-CTIME>
-1180897461 1180897579 xmms /usr/bin/wmxmms <RECENT-CTIME>
-1180897461 1180897560 ruby /usr/bin/ruby <RECENT-CTIME>
-1180897461 1180897570 sdparm /usr/bin/sdparm <RECENT-CTIME>
-1180897461 1180897585 ogdi-bin /usr/bin/ogdi_info <RECENT-CTIME>
-1180897461 1180897569 smbfs /sbin/mount.smb <RECENT-CTIME>
-1180897461 1180897483 libglib2.0-dev /usr/bin/glib-mkenums <RECENT-CTIME>
-1180897461 1180897581 xpdf-utils /usr/bin/pdfimages <RECENT-CTIME>
-1180897461 1180897472 dnsutils /usr/bin/nsupdate <RECENT-CTIME>
-1180897461 1180897545 ppp /usr/sbin/pppdump <RECENT-CTIME>
-1180897461 1180897509 libglib-perl /usr/lib/perl5/Glib.pm <RECENT-CTIME>
-1180897461 1180897576 wodim /usr/bin/wodim <RECENT-CTIME>
-1180897461 1180897556 python2.4-minimal /usr/bin/python2.4 <RECENT-CTIME>
-1180897461 1180897483 desktop-file-utils /usr/bin/update-desktop-database <RECENT-CTIME>
-1180897461 1180897571 syslinux /usr/bin/mkdiskimage <RECENT-CTIME>
-1180897461 1180897550 python2.4-dev /usr/include/python2.4/weakrefobject.h <RECENT-CTIME>
-1180897461 1180897538 noiz2sa /usr/bin/noiz2sa <RECENT-CTIME>
-1180897461 1180897574 unpaper /usr/bin/unpaper <RECENT-CTIME>
-1180897461 1180897463 libssl-dev /usr/include/openssl/pqueue.h <RECENT-CTIME>
-1180897461 1180897560 ruby1.8 /usr/bin/testrb1.8 <RECENT-CTIME>
-1180897461 1180897504 libatk1.0-dev /usr/include/atk-1.0/atk/atk-enum-types.h <RECENT-CTIME>
-1180897461 1180897465 man-db /usr/sbin/accessdb <RECENT-CTIME>
-1180897449 1180897459 xutils-dev /usr/bin/gccmakedep <RECENT-CTIME>
-1180897449 1180897454 libxmu-dev /usr/lib/libXmu.a <RECENT-CTIME>
-1180897449 1180897452 libpng12-dev /usr/bin/libpng-config <RECENT-CTIME>
-1180897449 1180897451 libfreetype6-dev /usr/include/ft2build.h <RECENT-CTIME>
-1180897449 1180897458 xbase-clients /usr/bin/xwud <RECENT-CTIME>
-1180897441 1180897447 libxrandr-dev /usr/lib/libXrandr.a <RECENT-CTIME>
-1180897441 1180897443 libxau-dev /usr/lib/libXau.a <RECENT-CTIME>
-1180897441 1180897446 libxinerama-dev /usr/lib/libXinerama.a <RECENT-CTIME>
-1180897441 1180897446 libxmu-headers /usr/include/X11/Xmu/Xct.h <RECENT-CTIME>
-1180897441 1180897443 libsm-dev /usr/lib/libSM.a <RECENT-CTIME>
-1180897441 1180897447 libxt-dev /usr/include/X11/Shell.h <RECENT-CTIME>
-1180897441 1180897442 flex /usr/lib/libl.a <RECENT-CTIME>
-1180897441 1180897445 libxcursor-dev /usr/lib/libXcursor.a <RECENT-CTIME>
-1180897441 1180897445 libxext-dev /usr/lib/libXext.a <RECENT-CTIME>
-1180897441 1180897444 libxrender-dev /usr/include/X11/extensions/Xrender.h <RECENT-CTIME>
-1180897441 1180897444 libxfixes-dev /usr/lib/libXfixes.a <RECENT-CTIME>
-1180897441 1180897448 zlib1g-dev /usr/include/zconf.h <RECENT-CTIME>
-1180897435 1180897435 libncurses5-dev /usr/lib/libcurses.a <RECENT-CTIME>
-1180897433 1180897434 sed /bin/sed <RECENT-CTIME>
-1180897431 1180897432 ncurses-bin /usr/bin/reset <RECENT-CTIME>
-1180897430 1180897431 mktemp /bin/mktemp <RECENT-CTIME>
-1180897427 1180897429 findutils /usr/bin/updatedb <RECENT-CTIME>
-1180897426 1180897427 diff /usr/bin/sdiff <RECENT-CTIME>
-1180897423 1180897423 debianutils /usr/bin/which <RECENT-CTIME>
-1180787194 1180787195 libept-dev /usr/lib/libept.a <RECENT-CTIME>
-1180774498 1180774499 tagcoll /usr/bin/tagcoll <RECENT-CTIME>
-1180774498 1180774498 libtagcoll2-dev /usr/include/tagcoll-2.0.6/tagcoll/utils/set.h <RECENT-CTIME>
-1180627127 1180627144 libgtkmm-2.4-doc /usr/share/doc/libgtkmm-2.4-doc/examples/treemodelcustom/exampletreemodel.h <RECENT-CTIME>
-1180627127 1180627142 libgtkmm-2.4-dev /usr/include/atkmm-1.6/atkmm.h <RECENT-CTIME>
-1180614103 1180614123 reportbug-ng /usr/bin/rng <RECENT-CTIME>
-1180608501 1180608507 rkhunter /usr/bin/rkhunter <RECENT-CTIME>
-1180608501 1180608504 cdbs /usr/bin/cdbs-edit-patch <RECENT-CTIME>
-1180608501 1180608505 python-nose /usr/bin/nosetests <RECENT-CTIME>
-1180608501 1180608504 libimage-info-perl /usr/share/perl5/Image/Info/SVG.pm <RECENT-CTIME>
-1180526809 1180526811 vim-scripts /usr/bin/vimplate <RECENT-CTIME>
-1180460243 1180460244 hg-load-dirs /usr/bin/hg_load_dirs <RECENT-CTIME>
-1180460243 1180460245 hg-buildpackage /usr/bin/hg-markdeb <RECENT-CTIME>
-1180460221 1180460242 dpkg /sbin/start-stop-daemon <RECENT-CTIME>
-1180460221 1180460240 dpkg-dev /usr/bin/dpkg-source <RECENT-CTIME>
-1180460161 1180460188 binutils /usr/bin/ld <RECENT-CTIME>
-1180460161 1180460196 libc6 /sbin/ldconfig <RECENT-CTIME>
-1180460161 1180460190 libc6-dev /usr/include/syscall.h <RECENT-CTIME>
-1180460161 1180460193 locales /usr/sbin/locale-gen <RECENT-CTIME>
-1180459910 1180459953 linux-image-2.6.21-1-amd64 /boot/System.map-2.6.21-1-amd64 <RECENT-CTIME>
-1180459910 1180459965 python-setuptools /usr/bin/easy_install-2.4 <RECENT-CTIME>
-1180459910 1180459939 linux-headers-2.6.21-1 /usr/src/linux-headers-2.6.21-1/include/asm-generic/audit_change_attr.h <RECENT-CTIME>
-1180254024 1180254033 eric /usr/bin/eric <RECENT-CTIME>
-1180254024 1180254030 bzr-builddeb /usr/bin/bzr-buildpackage <RECENT-CTIME>
-1180081502 1180081530 python-turbogears /usr/bin/tg-admin <RECENT-CTIME>
-1180000910 1180000928 libwibble-dev /usr/lib/libwibble.a <RECENT-CTIME>
-1179997203 1179997209 libdballef-dev /usr/lib/libdballef.a <RECENT-CTIME>
-1179997203 1179997209 dballe /usr/bin/dbamsg <RECENT-CTIME>
-1179997203 1179997210 python-dballe /usr/share/pycentral/python-dballe/site-packages/_dballe.a <RECENT-CTIME>
-1179930200 1179930229 provami /usr/bin/provami <RECENT-CTIME>
-1179908628 1179908651 doc-base /usr/share/perl5/Debian/DocBase/Common.pm <RECENT-CTIME>
-1179908628 1179908651 apt-listchanges /usr/bin/apt-listchanges <RECENT-CTIME>
-1179908628 1179909194 privoxy /usr/sbin/privoxy <RECENT-CTIME>
-1179908628 1179908648 reportbug /usr/bin/querybts <RECENT-CTIME>
-1179692174 1179692199 xclip /usr/bin/xclip <RECENT-CTIME>
-1179657476 1179657496 openbox /usr/include/openbox/3.3/openbox/parse.h <RECENT-CTIME>
-1179657476 1179657496 obconf /usr/bin/obconf <RECENT-CTIME>
-1179655030 1179655048 python2.5-minimal /usr/bin/python2.5 <RECENT-CTIME>
-1179655030 1179655034 bzr /usr/bin/bzr <RECENT-CTIME>
-1179655030 1179655052 uswsusp /usr/sbin/s2ram <RECENT-CTIME>
-1179655030 1179655048 pm-utils /usr/sbin/pm-hibernate <RECENT-CTIME>
-1179655030 1179655050 python2.5 /usr/bin/pdb2.5 <RECENT-CTIME>
-1179655030 1179655037 gs-common /usr/bin/ps2txt <RECENT-CTIME>
-1179655030 1179655035 dpatch /usr/bin/dpatch-get-origtargz <RECENT-CTIME>
-1179655030 1179655031 python-support /usr/sbin/update-python-modules <RECENT-CTIME>
-1179655026 1179655028 libhsqldb-java /usr/bin/hsqldb-databasemanagerswing <RECENT-CTIME>
-1179428033 1179428056 rake /usr/bin/rake <RECENT-CTIME>
-1179428033 1179428055 c++-annotations /usr/share/doc/c++-annotations/examples/yo/overloading/examples/binary3.h <RECENT-CTIME>
-1179428033 1179428060 ucf /usr/bin/ucfq <RECENT-CTIME>
-1179256205 1179256236 kernel-package /usr/sbin/kernel-packageconfig <RECENT-CTIME>
-1179256170 1179256192 linux-image-2.6.18-4-amd64 /boot/System.map-2.6.18-4-amd64 <RECENT-CTIME>
-1178982037 1178982070 pydb /usr/bin/pydb <RECENT-CTIME>
-1178982037 1178982071 python-pastescript /usr/bin/paster <RECENT-CTIME>
-1178982037 1178982057 x11proto-input-dev /usr/include/X11/extensions/XIproto.h <RECENT-CTIME>
-1178982037 1178982058 clive /usr/bin/clive <RECENT-CTIME>
-1178783830 1178783848 meld /usr/bin/meld <RECENT-CTIME>
-1178783830 1178783847 libtimedate-perl /usr/share/perl5/Date/Language.pm <RECENT-CTIME>
-1178783830 1178783838 dvipdfmx /usr/bin/dvipdfmx <RECENT-CTIME>
-1178783830 1178783882 texlive-latex-extra /usr/share/doc/texlive-doc/latex/register/Reg_macro.pm.gz <RECENT-CTIME>
-1178783830 1178783847 lintian /usr/share/lintian/lib/Dep.pm <RECENT-CTIME>
-1178783830 1178783846 ipython /usr/bin/pycolor <RECENT-CTIME>
-1178783824 1178783826 texlive-base-bin /usr/bin/oxdvi <RECENT-CTIME>
-1178783824 1178783826 texlive-latex-base /usr/bin/latex <RECENT-CTIME>
-1178783824 1178783827 texlive-pdfetex /usr/bin/pdfopen <RECENT-CTIME>
-1178633976 1178634000 xvfb /usr/bin/xvfb-run <RECENT-CTIME>
-1178633976 1178634001 python-dogtail /usr/bin/dogtail-recorder <RECENT-CTIME>
-1178142411 1178142444 liblocale-maketext-simple-perl /usr/share/perl5/Locale/Maketext/Simple.pm <OLD>
-1178142411 1178142442 debhelper /usr/share/perl5/Debian/Debhelper/Dh_Version.pm <OLD>
-1178128394 1178128416 python-imaging /usr/include/python2.3/Imaging.h <OLD>
-1178128394 1178128416 keyjnote /usr/bin/keyjnote <OLD>
-1178015044 1178015050 python-docutils /usr/bin/rst2newlatex <OLD>
-1178015044 1178015066 qt4-dev-tools /usr/bin/linguist-qt4 <OLD>
-1178015044 1178015066 wormux /usr/games/wormux <OLD>
-1178015044 1178015055 python-numpy /usr/bin/f2py <OLD>
-1178015044 1178015054 python-numpy-dev /usr/lib/python2.4/site-packages/numpy/f2py/src/fortranobject.h <OLD>
-1178014144 1178014225 xml-core /usr/sbin/update-xmlcatalog <OLD>
-1178014144 1178014226 zenity /usr/bin/gdialog <OLD>
-1178014144 1178014146 r-base-core /usr/lib/R/bin/R <OLD>
-1178014144 1178014228 svn-buildpackage /usr/share/svn-buildpackage/SDCommon.pm <OLD>
-1178014144 1178014184 rdoc1.8 /usr/bin/rdoc1.8 <OLD>
-1178014144 1178014185 recode /usr/bin/recode <OLD>
-1178014144 1178014203 tex-common /usr/bin/update-updmap <OLD>
-1178014144 1178014190 scribus-ng /usr/bin/scribus-ng <OLD>
-1178014144 1178014213 unrar /usr/bin/unrar <OLD>
-1178014144 1178014221 xfsprogs /sbin/xfs_repair <OLD>
-1178014144 1178014222 xine-ui /usr/bin/xine-bugreport <OLD>
-1178014144 1178014201 sudo /usr/sbin/visudo <OLD>
-1178014144 1178014225 xplanet /usr/bin/xplanet <OLD>
-1178014144 1178014212 unp /usr/bin/unp <OLD>
-1178014144 1178014186 rpm /usr/bin/rpmquery <OLD>
-1178014144 1178014202 tcptraceroute /usr/bin/tcptraceroute <OLD>
-1178014144 1178014220 wpasupplicant /sbin/wpa_cli <OLD>
-1178014144 1178014167 ri /usr/bin/ri <OLD>
-1178014144 1178014199 smartmontools /usr/sbin/smartctl <OLD>
-1178014144 1178014206 tsocks /usr/bin/validateconf <OLD>
-1178014144 1178014187 rsync /usr/bin/rsync <OLD>
-1178014144 1178014167 ri1.8 /usr/bin/ri1.8 <OLD>
-1178014144 1178014216 valgrind /usr/include/valgrind/pub_tool_libcassert.h <OLD>
-1178014140 1178014141 x11proto-randr-dev /usr/include/X11/extensions/randrproto.h <OLD>
-1178014140 1178014140 x11proto-core-dev /usr/include/X11/Xwinsock.h <OLD>
-1178014119 1178014125 sun-java5-jdk /usr/lib/jvm/java-1.5.0-sun-1.5.0.11/include/jdwpTransport.h <OLD>
-1178014119 1178014137 x11-common /usr/bin/X <OLD>
-1178014119 1178014121 sun-java5-demo /usr/lib/jvm/java-1.5.0-sun-1.5.0.11/demo/jvmti/heapTracker/src/heapTracker.h <OLD>
-1178014119 1178014130 sun-java5-bin /usr/lib/jvm/java-1.5.0-sun-1.5.0.11/bin/java <OLD>
-1178014098 1178014117 tar /bin/tar <OLD>
-1178012580 1178012681 libqt4-core /usr/bin/qdbus <OLD>
-1178012580 1178012663 liblocale-maketext-lexicon-perl /usr/share/perl5/Locale/Maketext/Lexicon/Auto.pm <OLD>
-1178012580 1178012672 pcscd /usr/sbin/update-reader.conf <OLD>
-1178012580 1178012694 libwmf-bin /usr/bin/wmf2eps <OLD>
-1178012580 1178012731 proj /usr/bin/invgeod <OLD>
-1178012580 1178012713 module-assistant /usr/bin/m-a <OLD>
-1178012580 1178012597 libavahi-common-dev /usr/include/avahi-common/rlist.h <OLD>
-1178012580 1178012661 libhtml-parser-perl /usr/lib/perl5/HTML/Filter.pm <OLD>
-1178012580 1178012592 libbonobo2-dev /usr/include/bonobo-activation-2.0/bonobo-activation/bonobo-activation-version.h <OLD>
-1178012580 1178012612 file-roller /usr/bin/file-roller <OLD>
-1178012580 1178012640 libflash-swfplayer /usr/bin/swfplayer <OLD>
-1178012580 1178012580 libgpg-error-dev /usr/bin/gpg-error-config <OLD>
-1178012580 1178012590 nfs-common /sbin/rpc.lockd <OLD>
-1178012580 1178012582 libgcrypt11-dev /usr/bin/libgcrypt-config <OLD>
-1178012580 1178012740 pstoedit /usr/bin/pstoedit <OLD>
-1178012580 1178012621 intltool /usr/bin/intltool-prepare <OLD>
-1178012580 1178012633 libcaca0 /usr/lib/caca/libgl_plugin.a <OLD>
-1178012580 1178012656 libhdf4g-dev /usr/include/hdf/hfile.h <OLD>
-1178012580 1178012591 libidl-dev /usr/bin/libIDL-config-2 <OLD>
-1178012580 1178012598 libavahi-glib-dev /usr/include/avahi-glib/glib-malloc.h <OLD>
-1178012580 1178012583 libopencdk8-dev /usr/bin/opencdk-config <OLD>
-1178012580 1178012585 libkrb5-dev /usr/include/profile.h <OLD>
-1178012580 1178012690 libsvn-mirror-perl /usr/bin/svn-mirror <OLD>
-1178012580 1178012635 libconvert-binhex-perl /usr/share/perl5/Convert/BinHex.pm <OLD>
-1178012580 1178012636 xdg-utils /usr/bin/xdg-desktop-menu <OLD>
-1178012580 1178012595 libbonoboui2-dev /usr/lib/libglade/2.0/libbonobo.a <OLD>
-1178012580 1178012626 irb /usr/bin/irb <OLD>
-1178012580 1178012729 orbit2 /usr/bin/typelib-dump <OLD>
-1178012580 1178012594 libbonobo2-common /usr/sbin/bonobo-activation-sysconf <OLD>
-1178012580 1178012714 mplayer /usr/bin/gmplayer <OLD>
-1178012580 1178012620 imageindex /usr/bin/imageindex <OLD>
-1178012580 1178012599 libgnomeui-dev /usr/lib/libgnomeui-2.a <OLD>
-1178012580 1178012635 libclone-perl /usr/lib/perl5/Clone.pm <OLD>
-1178012580 1178012678 libqt4-dev /usr/share/qt4/bin/lupdate <OLD>
-1178012580 1178012592 liborbit2-dev /usr/include/orbit-2.0/ORBitservices/CosNaming.h <OLD>
-1178012580 1178012649 libgksu2-0 /usr/bin/gksu-properties <OLD>
-1178012580 1178012732 popularity-contest /usr/sbin/popcon-largest-unused <OLD>
-1178012580 1178012729 p7zip-full /usr/bin/7za <OLD>
-1178012580 1178012695 libxml-simple-perl /usr/share/perl5/XML/Simple.pm <OLD>
-1178012580 1178012635 libdata-hierarchy-perl /usr/share/perl5/Data/Hierarchy.pm <OLD>
-1178012580 1178012636 libdigest-sha1-perl /usr/lib/perl5/Digest/SHA1.pm <OLD>
-1178012580 1178012733 postgresql-autodoc /usr/bin/postgresql_autodoc <OLD>
-1178012580 1178012621 initramfs-tools /usr/sbin/mkinitramfs <OLD>
-1178012580 1178012597 libavahi-client-dev /usr/include/avahi-client/publish.h <OLD>
-1178012580 1178012640 libfile-chdir-perl /usr/share/perl5/File/chdir.pm <OLD>
-1178012580 1178012712 mercurial /usr/bin/hg <OLD>
-1178012580 1178012626 irb1.8 /usr/bin/irb1.8 <OLD>
-1178012580 1178012665 libmysqlclient15-dev /usr/bin/mysql_config <OLD>
-1178012580 1178012662 libhtml-tree-perl /usr/share/perl5/HTML/Element/traverse.pm <OLD>
-1178012580 1178012584 libtasn1-3-dev /usr/bin/libtasn1-config <OLD>
-1178012580 1178012634 libcfitsio-dev /usr/lib/libcfitsio.a <OLD>
-1178012580 1178012661 libhtml-template-perl /usr/share/perl5/HTML/Template.pm <OLD>
-1178012580 1178012691 libwmf-dev /usr/include/libwmf/defs.h <OLD>
-1178012580 1178012689 libsdl-perl /usr/lib/perl5/SDL_perl.pm <OLD>
-1178012580 1178012713 moreutils /usr/bin/zrun <OLD>
-1178012580 1178012664 libmime-perl /usr/share/perl5/MIME/Parser/Reader.pm <OLD>
-1178012580 1178012628 kdiff3 /usr/bin/kdiff3 <OLD>
-1178012580 1178012587 mutt /usr/bin/mutt_dotlock <OLD>
-1178012580 1178012650 libglibmm-2.4-dev /usr/include/glibmm-2.4/glibmm_generate_extra_defs/generate_extra_defs.h <OLD>
-1178012525 1178012530 mysql-server-5.0 /usr/sbin/ndb_mgmd <OLD>
-1178012511 1178012522 libdbd-mysql-perl /usr/lib/perl5/Bundle/DBD/mysql.pm <OLD>
-1178012511 1178012524 mysql-client-5.0 /usr/sbin/mysqlmanager <OLD>
-1178012511 1178012513 libxdmcp-dev /usr/include/X11/Xdmcp.h <OLD>
-1178012511 1178012512 imlib-base /usr/bin/imlib-config <OLD>
-1178012511 1178012512 libice-dev /usr/include/X11/ICE/ICEconn.h <OLD>
-1178012511 1178012514 libxft-dev /usr/bin/xft-config <OLD>
-1178011412 1178011420 m4 /usr/bin/m4 <OLD>
-1178011412 1178011535 gnome-volume-manager /usr/bin/gnome-volume-manager-gthumb <OLD>
-1178011412 1178011442 dvipng /usr/bin/dvigif <OLD>
-1178011412 1178011516 gnome-common /usr/bin/gnome-doc-common <OLD>
-1178011412 1178011470 gdm /usr/bin/gdmXnest <OLD>
-1178011412 1178011540 gpsdrive /usr/lib/libfly.a <OLD>
-1178011412 1178011440 dvbstream /usr/bin/dvbstream <OLD>
-1178011412 1178011495 ggobi /usr/include/ggobi/GGobiEvents.h <OLD>
-1178011412 1178011541 make /usr/bin/make <OLD>
-1178011412 1178011468 gksu /usr/bin/gksudo <OLD>
-1178011412 1178011442 exiftags /usr/bin/exiftime <OLD>
-1178011412 1178011440 dput /usr/bin/dcut <OLD>
-1178011412 1178011539 gpsd-clients /usr/bin/xgpsspeed <OLD>
-1178011412 1178011536 gnupg-agent /usr/bin/gpgkey2ssh <OLD>
-1178011412 1178011443 gaim /usr/bin/gaim-remote <OLD>
-1178011412 1178011515 gnome-bin /usr/bin/new-object <OLD>
-1178011412 1178011426 darcs-load-dirs /usr/bin/darcs_load_dirs <OLD>
-1178011412 1178011415 klogd /sbin/klogd <OLD>
-1178011412 1178011415 laptop-detect /usr/sbin/laptop-detect <OLD>
-1178011412 1178011549 mc /usr/bin/mcedit <OLD>
-1178011412 1178011542 lftp /usr/bin/lftp <OLD>
-1178011412 1178011674 gnome-applets /usr/bin/cpufreq-selector <OLD>
-1178011412 1178011546 mapserver-bin /usr/bin/scalebar <OLD>
-1178011412 1178011552 debootstrap /usr/sbin/debootstrap <OLD>
-1178011412 1178011494 germinate /usr/bin/germinate <OLD>
-1178011412 1178011426 cowdancer /usr/sbin/cowbuilder <OLD>
-1178011412 1178011547 markdown /usr/share/perl5/Text/Markdown.pm <OLD>
-1178011412 1178011415 dhcp3-common /usr/bin/omshell <OLD>
-1178011412 1178011536 gpgsm /usr/bin/gpgsm-gencert.sh <OLD>
-1178011412 1178011460 gnome-session /usr/bin/gnome-wm <OLD>
-1178011412 1178011538 gpsd /usr/include/libgpsmm.h <OLD>
-1178011412 1178011425 cogito /usr/bin/cg-version <OLD>
-1178011412 1178011424 cdrdao /usr/bin/cdrdao <OLD>
-1178011412 1178011493 gedit /usr/bin/gedit <OLD>
-1178011412 1178011414 debconf /usr/bin/debconf-show <OLD>
-1178011412 1178011441 dvd+rw-tools /usr/bin/btcflash <OLD>
-1178011412 1178011461 gnome-terminal /usr/bin/gnome-terminal.wrapper <OLD>
-1178011412 1178011553 gnupg2 /usr/sbin/addgnupghome <OLD>
-1178011412 1178011516 gnome-doc-utils /usr/bin/xml2po <OLD>
-1178011412 1178011428 devscripts /usr/bin/cvs-debc <OLD>
-1178011412 1178011427 debsums /usr/sbin/debsums_gen <OLD>
-1178011412 1178011415 dhcp3-client /sbin/dhclient <OLD>
-1178011412 1178011420 finger /usr/bin/finger <OLD>
-1178011412 1178011426 svk-load-dirs /usr/bin/svk_load_dirs <OLD>
-1178011412 1178011433 docbook-to-man /usr/bin/docbook-to-man <OLD>
-1178011412 1178011441 dvbtune /usr/bin/dvbtune <OLD>
-1178011412 1178011428 discover1 /sbin/discover <OLD>
-1178011412 1178011552 aumix /usr/bin/aumix <OLD>
-1178011401 1178011402 audacity /usr/bin/audacity <OLD>
-1178011380 1178011381 dsniff /usr/sbin/dsniff <OLD>
-1178010287 1178010316 swig /usr/bin/swig-1.3 <OLD>
-1178010287 1178010294 vim-full /usr/bin/vim.full <OLD>
-1178010287 1178010318 swig-examples /usr/share/doc/swig-examples/xml/example_xml.h <OLD>
-1178010287 1178010323 wireshark /usr/bin/wireshark <OLD>
-1178010287 1178010324 wireshark-common /usr/bin/editcap <OLD>
-1178010287 1178010308 acpitool /usr/bin/acpitool <OLD>
-1178010287 1178010304 telnet /usr/bin/telnet.netkit <OLD>
-1178010287 1178010309 graphviz /usr/bin/neato <OLD>
-1178010287 1178010300 vim-common /usr/bin/helpztags <OLD>
-1178010287 1178010304 acpi /usr/bin/acpi <OLD>
-1178010287 1178010313 postfix /usr/bin/mailq <OLD>
-1178010287 1178010321 unison /usr/bin/unison-latest-stable <OLD>
-1178010287 1178010326 xsltproc /usr/bin/xsltproc <OLD>
-1178010287 1178010289 xtrans-dev /usr/include/X11/Xtrans/Xtransint.h <OLD>
-1178010287 1178010327 nmap /usr/bin/nmap <OLD>
-1178010287 1178010322 unison2.9.1 /usr/bin/unison-2.9.1 <OLD>
-1178010287 1178010321 timidity /usr/bin/timidity <OLD>
-1178010287 1178010293 vim-tiny /usr/bin/vim.tiny <OLD>
-1178010287 1178010326 xterm /usr/bin/resize <OLD>
-1178010287 1178010297 vim /usr/bin/vim.basic <OLD>
-1178010287 1178010315 sqlite3 /usr/bin/sqlite3 <OLD>
-1178010287 1178010299 vim-runtime /usr/bin/vimtutor <OLD>
-1178010287 1178010310 offlineimap /usr/bin/offlineimap <OLD>
-1178010287 1178010307 acpid /usr/sbin/acpid <OLD>
-1178010287 1178010291 netcat /bin/netcat <OLD>
-1178010287 1178010323 wammu /usr/bin/wammu <OLD>
-1178010287 1178010292 sysklogd /sbin/syslogd <OLD>
-1178010285 1178010286 gzip /bin/uncompress <OLD>
-1177924535 1177924564 openoffice.org-calc /usr/bin/oocalc <OLD>
-1177924535 1177924564 openoffice.org-math /usr/bin/oomath <OLD>
-1177924535 1177924564 openoffice.org-writer /usr/bin/oowriter <OLD>
-1177924535 1177924564 openoffice.org-base /usr/bin/oobase <OLD>
-1177924535 1177924564 openoffice.org-impress /usr/bin/ooimpress <OLD>
-1177924535 1177924564 openoffice.org-common /usr/bin/soffice <OLD>
-1177924535 1177924564 openoffice.org-draw /usr/bin/oodraw <OLD>
-1177884980 1177885000 scalpel /usr/bin/scalpel <OLD>
-1177884980 1177885000 magicrescue /usr/bin/magicsort <OLD>
-1177884980 1177884998 dosfstools /sbin/mkfs.vfat <OLD>
-1177689577 1177689592 kismet /usr/bin/kismet_drone <OLD>
-1177689577 1177689594 tomatoes /usr/games/tomatoes <OLD>
-1177689577 1177689593 patchutils /usr/bin/lsdiff <OLD>
-1177689577 1177689596 youtube-dl /usr/bin/youtube-dl <OLD>
-1177537338 1166190405 mawk /usr/bin/mawk <OLD>
-1177537338 1172691910 coreutils /usr/bin/sort <OLD>
-1177537187 1166527002 dlocate /usr/bin/dlocate <OLD>
-1177537187 1166980508 perl-base /usr/share/perl/5.8.8/bytes.pm <OLD>
-1177537187 1166980507 perl /usr/lib/perl/5.8.8/Encode/Config.pm <OLD>
-1177537187 1166190366 liblocale-gettext-perl /usr/lib/perl5/Locale/gettext.pm <OLD>
-1177537186 1166980508 perl-suid /usr/bin/suidperl <OLD>
-1177537170 1166190402 less /usr/bin/lessfile <OLD>
-1177537088 1173474006 openssh-client /usr/bin/slogin <OLD>
-1177536554 1173000156 epiphany-browser /usr/bin/epiphany-browser <OLD>
-1177536440 1177159756 metacafe-dl /usr/bin/metacafe-dl <OLD>
-1177536393 1171977084 liferea /usr/bin/liferea-bin <OLD>
-1177526970 1173697161 acpi-support /usr/bin/acpi_fakekey <OLD>
-1177525862 1175633735 xscreensaver /usr/bin/xscreensaver-command <OLD>
-1177525861 1173000087 bsdutils /usr/bin/logger <OLD>
-1177525860 1170084281 alsa-utils /usr/sbin/alsactl <OLD>
-1177525860 1166190402 console-tools /usr/bin/chvt <OLD>
-1177525860 1170794023 sysv-rc /usr/sbin/invoke-rc.d <OLD>
-1177525860 1174317435 guessnet /usr/sbin/guessnet-ifupdown <OLD>
-1177503973 1166980505 perl-modules /usr/share/perl/5.8.8/File/Copy.pm <OLD>
-1177503973 1166372777 svk /usr/share/perl5/SVK/Editor/Delay.pm <OLD>
-1177503971 1166372774 libsvn-perl /usr/lib/perl5/SVN/Core.pm <OLD>
-1177503971 1166372773 libclass-autouse-perl /usr/share/perl5/Class/Autouse.pm <OLD>
-1177503971 1166372775 liburi-perl /usr/share/perl5/URI/Escape.pm <OLD>
-1177503971 1166372773 libperlio-via-dynamic-perl /usr/share/perl5/PerlIO/via/dynamic.pm <OLD>
-1177503971 1166372774 libperlio-via-symlink-perl /usr/share/perl5/PerlIO/via/symlink.pm <OLD>
-1177503971 1166372774 libperlio-eol-perl /usr/lib/perl5/PerlIO/eol.pm <OLD>
-1177503971 1166372774 libsvn-simple-perl /usr/share/perl5/SVN/Simple/Edit.pm <OLD>
-1177503971 1166372775 libyaml-perl /usr/share/perl5/YAML/Loader/Base.pm <OLD>
-1177503969 1166372774 libregexp-shellish-perl /usr/share/perl5/Regexp/Shellish.pm <OLD>
-1177503824 1166372775 libterm-readkey-perl /usr/lib/perl5/Term/ReadKey.pm <OLD>
-1177503775 1166372773 libfile-type-perl /usr/share/perl5/File/Type.pm <OLD>
-1177502279 1174946957 gnupg /usr/bin/gpg <OLD>
-1177502119 1174946957 gpgv /usr/bin/gpgv <OLD>
-1177502117 1174946955 aptitude /usr/bin/aptitude <OLD>
-1177502114 1172691934 apt /usr/bin/apt-key <OLD>
-1177502023 1166190401 groff-base /usr/bin/nroff <OLD>
-1177501942 1166190405 wget /usr/bin/wget <OLD>
-1177498403 1166190613 laptop-mode-tools /usr/sbin/laptop_mode <OLD>
-1177497857 1170084280 w3m /usr/bin/w3m <OLD>
-1177493293 1166190401 mime-support /usr/bin/print <OLD>
-1177489700 1175126570 udev /usr/bin/udevinfo <OLD>
-1177454644 1177159754 tasks /usr/bin/tasks <OLD>
-1177454361 1171415966 imagemagick /usr/bin/display <OLD>
-1177436167 1166190401 procps /usr/bin/top <OLD>
-1177409235 1167739438 lbdb /usr/bin/lbdbq <OLD>
-1177408907 1169982592 evince /usr/bin/evince <OLD>
-1177408326 1166190407 traceroute /usr/bin/traceroute.lbl <OLD>
-1177407856 1166190408 unzip /usr/bin/zipinfo <OLD>
-1177354768 1175443118 azureus /usr/bin/azureus <OLD>
-1177349852 1169982582 dict /usr/bin/dict <OLD>
-1177346933 1166372777 subversion /usr/bin/svn <OLD>
-1177345009 1166190409 grep /usr/bin/rgrep <OLD>
-1177343013 1166190413 libtext-wrapi18n-perl /usr/share/perl5/Text/WrapI18N.pm <OLD>
-1177343013 1166190366 libtext-charwidth-perl /usr/lib/perl5/Text/CharWidth.pm <OLD>
-1177343013 1166190366 libtext-iconv-perl /usr/lib/perl5/Text/Iconv.pm <OLD>
-1177343010 1172691933 apt-utils /usr/bin/apt-extracttemplates <OLD>
-1177338778 1167557339 menu /usr/sbin/install-menu <OLD>
-1177338739 1177338759 k3b /usr/bin/k3b <OLD>
-1177338733 1166190399 xfonts-utils /usr/bin/mkfontscale <OLD>
-1177338731 1171541599 defoma /usr/bin/defoma-font <OLD>
-1177338731 1173127622 fontconfig /usr/bin/fc-cache <OLD>
-1177338697 1174593895 update-inetd /usr/sbin/update-inetd <OLD>
-1177338601 1173553214 passwd /usr/sbin/groupdel <OLD>
-1177338601 1170084279 adduser /usr/sbin/delgroup <OLD>
-1177338597 1169982630 cron /usr/bin/crontab <OLD>
-1177337194 1166544993 qalculate-gtk /usr/bin/qalculate-gtk <OLD>
-1177324149 1175768481 ekiga /usr/bin/ekiga <OLD>
-1177323796 1166190406 lsof /usr/bin/lsof <OLD>
-1177323316 1166190401 pciutils /bin/lspci <OLD>
-1177317323 1166190407 gs-esp /usr/bin/gs-esp <OLD>
-1177278694 1166493256 buffy /usr/bin/buffy <OLD>
-1177264323 1177171053 dosbox /usr/bin/dosbox <OLD>
-1177262780 1174946965 iceweasel /usr/bin/iceweasel <OLD>
-1177261570 1166492130 pv /usr/bin/pv <OLD>
-1177258837 1166527580 gqview /usr/bin/gqview <OLD>
-1177258552 1175633862 xscreensaver-gl /usr/bin/xscreensaver-gl-helper <OLD>
-1177258530 1166526991 compiz-core /usr/bin/compiz.real <OLD>
-1177258530 1166526991 compiz-gtk /usr/bin/gtk-window-decorator <OLD>
-1177258529 1166190406 xserver-xorg-input-synaptics /usr/bin/synclient <OLD>
-1177258528 1166980531 gsynaptics /usr/bin/gsynaptics-init <OLD>
-1177258527 1169039173 cpp-4.1 /usr/bin/x86_64-linux-gnu-cpp-4.1 <OLD>
-1177258527 1166526991 mesa-utils /usr/bin/glxinfo <OLD>
-1177258527 1169039173 cpp /usr/bin/cpp <OLD>
-1177258527 1166493252 bluez-gnome /usr/bin/bluetooth-applet <OLD>
-1177258526 1173000162 gnome-panel /usr/bin/gnome-panel <OLD>
-1177258526 1173805976 nautilus /usr/bin/nautilus <OLD>
-1177258525 1170084317 vino /usr/bin/vino-session <OLD>
-1177258523 1173000161 gnome-control-center /usr/bin/gnome-settings-daemon <OLD>
-1177258523 1166980517 gnome-keyring /usr/bin/gnome-keyring-daemon <OLD>
-1177258518 1166190401 dbus /usr/bin/dbus-launch <OLD>
-1177258518 1168076532 scim /usr/bin/scim <OLD>
-1177258517 1166190402 xutils /usr/bin/sessreg <OLD>
-1177258490 1175426296 apache2.2-common /usr/sbin/apache2ctl <OLD>
-1177258488 1166190613 anacron /usr/sbin/anacron <OLD>
-1177258488 1166190615 at /usr/sbin/atd <OLD>
-1177258488 1175866318 apache2-mpm-prefork /usr/sbin/apache2 <OLD>
-1177258487 1166493249 bluez-utils /usr/sbin/sdpd <OLD>
-1177258485 1175768456 xserver-xorg-core /usr/bin/Xorg <OLD>
-1177258482 1174946960 openbsd-inetd /usr/sbin/inetd <OLD>
-1177258482 1166190615 lpr /usr/sbin/lpd <OLD>
-1177258480 1169982583 dictd /usr/sbin/dictd <OLD>
-1177258471 1170794026 cupsys /usr/sbin/cupsd <OLD>
-1177258471 1166190411 cpufrequtils /usr/bin/cpufreq-set <OLD>
-1177258470 1174389114 postgresql-client-7.4 /usr/lib/postgresql/7.4/bin/psql <OLD>
-1177258464 1174389115 postgresql-7.4 /usr/lib/postgresql/7.4/bin/postmaster <OLD>
-1177258460 1166190613 vbetool /usr/sbin/vbetool <OLD>
-1177258458 1170877544 schroot /usr/bin/schroot <OLD>
-1177258458 1173000091 util-linux /usr/bin/setterm <OLD>
-1177256339 1177256363 gcom /usr/bin/sigmon <OLD>
-1177220593 1166190404 procmail /usr/bin/procmail <OLD>
-1177220578 1173473991 e2fsprogs /usr/bin/lsattr <OLD>
-1177220515 1173000123 tcpd /usr/sbin/tcpd <OLD>
-1177220474 1166190615 logrotate /usr/sbin/logrotate <OLD>
-1177220149 1176889700 faubackup /usr/sbin/faubackup <OLD>
-1177220121 1166190366 libapt-pkg-perl /usr/lib/perl5/AptPkg.pm <OLD>
-1177220121 1166493229 apt-show-versions /usr/bin/apt-show-versions <OLD>
-1177174821 1175720153 kdelibs4c2a /usr/bin/dcopserver_shutdown <OLD>
-1177172601 1175633687 konqueror /usr/bin/konqueror <OLD>
-1177171031 1177171053 libsdl-sound1.2 /usr/bin/playsound <OLD>
-1177168342 1177159756 pangzero /usr/games/pangzero <OLD>
-1177168314 1177159750 gt5 /usr/bin/gt5 <OLD>
-1177168292 1172787014 lynx /usr/bin/lynx.stable <OLD>
-1177168077 1177159749 gaia /usr/bin/gaia <OLD>
-1177166731 1177159749 freedroidrpg /usr/games/freedroidRPG <OLD>
-1177166619 1177159719 balder2d /usr/games/balder2d <OLD>
-1177159695 1177159754 screenkast /usr/lib/libisdvncauth.a <OLD>
-1177159695 1177159755 wfo /usr/bin/wfo <OLD>
-1177159695 1177159751 isdexport /usr/bin/isdexport <OLD>
-1177159695 1177159719 cryopid /usr/bin/freeze <OLD>
-1177149141 1166190411 xdiskusage /usr/bin/xdiskusage <OLD>
-1177068294 1166541760 driftnet /usr/bin/driftnet <OLD>
-1177067033 1173697184 tcpdump /usr/sbin/tcpdump <OLD>
-1177063016 1173553213 whiptail /usr/bin/whiptail <OLD>
-1177060535 1170084291 gnome-system-tools /usr/bin/network-admin <OLD>
-1177060268 1168942055 gnome-cups-manager /usr/bin/gnome-cups-manager <OLD>
-1177057911 1169039178 g++-4.1 /usr/bin/x86_64-linux-gnu-g++-4.1 <OLD>
-1177057911 1169039178 gcc-4.1 /usr/bin/x86_64-linux-gnu-gcc-4.1 <OLD>
-1177057911 1169039178 gcc /usr/bin/gcc <OLD>
-1177057911 1169039178 g++ /usr/bin/g++ <OLD>
-1177057909 1169039179 libstdc++6-4.1-dev /usr/include/c++/4.1.2/x86_64-linux-gnu/bits/gthr-default.h <OLD>
-1177057909 1167557354 libtut-dev /usr/include/tut_reporter.h <OLD>
-1177057908 1171541560 linux-kernel-headers /usr/include/linux/limits.h <OLD>
-1177057891 1166527570 doxygen /usr/bin/doxygen <OLD>
-1177057884 1177057756 libxml++2.6-dev /usr/include/libxml++-2.6/libxml++/noncopyable.h <OLD>
-1177057830 1166526982 pkg-config /usr/bin/pkg-config <OLD>
-1177057829 1169039177 gfortran-4.1 /usr/bin/x86_64-linux-gnu-gfortran-4.1 <OLD>
-1177057829 1169039177 gfortran /usr/bin/gfortran <OLD>
-1177057829 1169039177 libgfortran1-dev /usr/lib/libgfortranbegin.a <OLD>
-1177056234 1177056236 adept-installer /usr/bin/adept_installer <OLD>
-1177056234 1177056235 adept-manager /usr/bin/adept_manager <OLD>
-1177056234 1177056236 adept-notifier /usr/bin/adept_notifier <OLD>
-1177056234 1177056236 adept-updater /usr/bin/adept_updater <OLD>
-1177055863 1177055753 synaptic /usr/sbin/synaptic <OLD>
-1177055757 1171977196 scrollkeeper /usr/bin/scrollkeeper-config <OLD>
-1177053904 1166190407 gimp /usr/bin/gimp <OLD>
-1177053791 1166542134 an /usr/games/an <OLD>
-1177053745 1166545003 sl /usr/bin/sl <OLD>
-1177053465 1177053414 xjokes /usr/games/yasiti <OLD>
-1177048429 1166542775 pwgen /usr/bin/pwgen <OLD>
-1177009159 1166491974 bash /usr/bin/clear_console <OLD>
-1176987113 1168510531 ocaml-base-nox /usr/bin/ocamlrun <OLD>
-1176987113 1166493270 polygen /usr/bin/polygen <OLD>
-1176987113 1166493278 polygen-data /usr/bin/polyfind <OLD>
-1176986681 1172076603 byzanz /usr/bin/byzanz-record <OLD>
-1176986340 1173870371 gnome-utils /usr/bin/gnome-panel-screenshot <OLD>
-1176985997 1166541760 vcdimager /usr/bin/vcdxrip <OLD>
-1176985121 1172822391 metacity /usr/bin/metacity <OLD>
-1176978320 1166544993 qalc /usr/bin/qalc <OLD>
-1176969527 1166190405 pmount /usr/bin/pumount <OLD>
-1176969171 1170794019 sysvinit-utils /usr/bin/mesg <OLD>
-1176928025 1166372773 libio-digest-perl /usr/share/perl5/IO/Digest.pm <OLD>
-1176893896 1166190401 vlock /usr/bin/vlock <OLD>
-1176893459 1166190404 zip /usr/bin/zip <OLD>
-1176886834 1166190403 gdb /usr/bin/gdb <OLD>
-1176886361 1166190409 gnome-system-monitor /usr/bin/gnome-system-monitor <OLD>
-1176879727 1174236295 cvs /usr/bin/cvs <OLD>
-1176838154 1166526994 dctrl-tools /usr/bin/grep-aptavail <OLD>
-1176833972 1173474025 yelp /usr/bin/gnome-help <OLD>
-1176814275 1166493281 bogosort /usr/bin/bogosort <OLD>
-1176813444 1176208146 filters /usr/games/chef <OLD>
-1176813444 1166526993 cowsay /usr/bin/cowthink <OLD>
-1176810639 1169026305 qgis /usr/bin/qgis <OLD>
-1176804771 1176804745 vigor /usr/bin/vigor <OLD>
-1176793976 1168364125 bsdmainutils /usr/bin/col <OLD>
-1176726238 1173553208 login /usr/bin/sg <OLD>
-1176669692 1166190411 gucharmap /usr/bin/charmap <OLD>
-1176564336 1174236322 libgnomevfs2-bin /usr/bin/gnomevfs-copy <OLD>
-1176563873 1174389116 postgresql-contrib-7.4 /usr/lib/postgresql/7.4/bin/pg_autovacuum <OLD>
-1176468989 1175699053 msat /usr/bin/msat <OLD>
-1176468157 1166526994 debtags-edit /usr/bin/debtags-edit <OLD>
-1176462129 1176462102 qtparted /usr/sbin/qtparted <OLD>
-1176455120 1174312930 arping /usr/sbin/arping <OLD>
-1176452788 1167120719 dvb-utils /usr/bin/scan <OLD>
-1176452788 1170892774 ruby-prof /usr/bin/ruby-prof <OLD>
-1176452788 1166545116 libglade2-ruby /usr/bin/ruby-glade-create-template <OLD>
-1176452781 1166527235 libjpeg-progs /usr/bin/rdjpgcom <OLD>
-1176452781 1166372529 gettext /usr/bin/recode-sr-latin <OLD>
-1176452781 1168365726 libgcj-common /usr/bin/rebuild-gcj-db <OLD>
-1176452781 1173647376 rar /usr/bin/rar <OLD>
-1176452781 1166190407 sharutils /usr/bin/remsync <OLD>
-1176452781 1167285834 rcs /usr/bin/rcsmerge <OLD>
-1176452781 1173000171 installation-report /usr/bin/report-hw <OLD>
-1176452780 1166542752 xapian-tools /usr/bin/quest <OLD>
-1176452779 1170011132 pychecker /usr/bin/pychecker <OLD>
-1176452779 1166544994 qemuctl /usr/bin/qemuctl <OLD>
-1176452779 1168429414 qemu-launcher /usr/bin/qemu-launcher <OLD>
-1176452778 1167406185 debian-goodies /usr/bin/popbugs <OLD>
-1176452778 1166527249 psutils /usr/bin/psnup <OLD>
-1176452778 1166527247 perl-tk /usr/bin/ptked <OLD>
-1176452778 1175633785 pinentry-qt /usr/bin/pinentry-qt <OLD>
-1176452778 1167289228 po-debconf /usr/bin/podebconf-display-po <OLD>
-1176452778 1166190410 pinentry-curses /usr/bin/pinentry-curses <OLD>
-1176452778 1166542133 a2ps /usr/bin/psmandup <OLD>
-1176452777 1169039187 pcmanfm /usr/bin/pcmanfm <OLD>
-1176452777 1166370937 pbuilder /usr/bin/pdebuild <OLD>
-1176452777 1166527235 libparse-debianchangelog-perl /usr/bin/parsechangelog <OLD>
-1176452777 1169582960 packagesearch /usr/bin/packagesearch <OLD>
-1176452777 1166190412 patch /usr/bin/patch <OLD>
-1176452777 1166980537 perl-doc /usr/bin/perldoc <OLD>
-1176452777 1166190405 libpcre3 /usr/bin/pcretest <OLD>
-1176452777 1171977060 libpango1.0-dev /usr/bin/pango-view <OLD>
-1176452777 1166544984 libpaper-utils /usr/bin/paperconf <OLD>
-1176452776 1166527004 sp /usr/bin/nsgmls <OLD>
-1176452776 1173452014 unixodbc-bin /usr/bin/ODBCConfig <OLD>
-1176452776 1171415994 gdal-bin /usr/bin/ogrtindex <OLD>
-1176452776 1166527245 octave2.1 /usr/bin/octave2.1 <OLD>
-1176452776 1166372906 odbcinst1debian1 /usr/bin/odbcinst <OLD>
-1176452776 1172692921 liboil0.3 /usr/bin/oil-bugreport <OLD>
-1176452776 1166190411 bin86 /usr/bin/objdump86 <OLD>
-1176452775 1166190411 ftp /usr/bin/pftp <OLD>
-1176452775 1166190402 gettext-base /usr/bin/ngettext <OLD>
-1176452775 1173553215 policycoreutils /usr/bin/newrole <OLD>
-1176452774 1166527253 mtr /usr/bin/mtr <OLD>
-1176452774 1168601034 netcdf-bin /usr/bin/ncdump <OLD>
-1176452774 1166190412 mpack /usr/bin/munpack <OLD>
-1176452774 1173805996 nautilus-cd-burner /usr/bin/nautilus-cd-burner <OLD>
-1176452774 1166190411 mtools /usr/bin/mxtar <OLD>
-1176452773 1175768483 grub /usr/bin/mkbimage <OLD>
-1176452773 1166493277 mixxx /usr/bin/mixxx <OLD>
-1176452773 1166190407 mcrypt /usr/bin/mdecrypt <OLD>
-1176452773 1166492130 mmv /usr/bin/mad <OLD>
-1176452772 1176450674 lwatch /usr/bin/lwatch <OLD>
-1176452772 1166853121 m17n-db /usr/bin/m17n-db <OLD>
-1176452772 1166190412 mailx /usr/bin/mailx <OLD>
-1176452772 1166190402 libnss-db /usr/bin/makedb <OLD>
-1176452772 1171415965 libmagick9-dev /usr/bin/Magick-config <OLD>
-1176452772 1170794026 cupsys-client /usr/bin/lpstat <OLD>
-1176452772 1166527580 libwww-perl /usr/bin/GET <OLD>
-1176452772 1166527244 memtest86+ /usr/bin/make-memtest86+-boot-floppy <OLD>
-1176452772 1171415964 libmagick++9-dev /usr/bin/Magick++-config <OLD>
-1176452771 1166372775 libtool /usr/bin/libtool <OLD>
-1176452771 1166527230 libgnutls-dev /usr/bin/libgnutls-config <OLD>
-1176452771 1168444996 link-grammar /usr/bin/link-grammar <OLD>
-1176452771 1166527242 linda /usr/bin/linda <OLD>
-1176452771 1167557338 libnet1-dev /usr/bin/libnet-config <OLD>
-1176452771 1171415976 kdebase-bin /usr/bin/kxkb <OLD>
-1176452771 1167896485 libglade2-dev /usr/bin/libglade-convert <OLD>
-1176452771 1173870377 ldap-utils /usr/bin/ldapadd <OLD>
-1176452770 1175633689 kwin /usr/bin/kwin <OLD>
-1176452770 1171415975 kcontrol /usr/bin/krdb <OLD>
-1176452770 1171415980 kdebase-kio-plugins /usr/bin/ktrash <OLD>
-1176452770 1171415976 kdesktop /usr/bin/kwebdesktop <OLD>
-1176452769 1175633742 kpdf /usr/bin/kpdf <OLD>
-1176452769 1175633688 konsole /usr/bin/konsole <OLD>
-1176452768 1175633741 kghostview /usr/bin/kghostview <OLD>
-1176452768 1174603739 python-kid /usr/bin/kid <OLD>
-1176452768 1175633686 kfind /usr/bin/kfind <OLD>
-1176452768 1172692925 kino /usr/bin/kino <OLD>
-1176452768 1171415974 kicker /usr/bin/kicker <OLD>
-1176452768 1175633762 kdict /usr/bin/kdict <OLD>
-1176452767 1169371501 console-common /usr/bin/kbd-config <OLD>
-1176452767 1167188509 kaffeine /usr/bin/kaffeine <OLD>
-1176452767 1169667653 kcachegrind /usr/bin/kcachegrind <OLD>
-1176452766 1166527203 inkscape /usr/bin/inkview <OLD>
-1176452766 1173553668 irssi /usr/bin/irssi <OLD>
-1176452766 1166493272 jackd /usr/bin/jack_connect <OLD>
-1176452766 1168510530 im-switch /usr/bin/im-switch <OLD>
-1176452766 1166372906 unixodbc /usr/bin/iusql <OLD>
-1176452766 1169982581 autoconf /usr/bin/ifnames <OLD>
-1176452765 1166544983 libgstreamer0.8-0 /usr/bin/gst-register-0.8 <OLD>
-1176452765 1169039183 gij /usr/bin/grmiregistry <OLD>
-1176452765 1169026304 grass /usr/bin/grass <OLD>
-1176452765 1175426291 apache2-utils /usr/bin/htpasswd <OLD>
-1176452765 1168522526 help2man /usr/bin/help2man <OLD>
-1176452765 1166541751 hanzim /usr/bin/hanzim <OLD>
-1176452765 1169039183 gij-4.1 /usr/bin/grmiregistry-4.1 <OLD>
-1176452765 1167557334 hdf5-tools /usr/bin/h5debug <OLD>
-1176452765 1166372529 html2text /usr/bin/html2text <OLD>
-1176452765 1166527581 gromit /usr/bin/gromit <OLD>
-1176452765 1167896567 gnome-media /usr/bin/gstreamer-properties <OLD>
-1176452764 1174287091 gobby /usr/bin/gobby <OLD>
-1176452764 1166545029 gnuplot-nox /usr/bin/gnuplot <OLD>
-1176452764 1166372952 gperf /usr/bin/gperf <OLD>
-1176452763 1166527580 glademm /usr/bin/glademm-embed <OLD>
-1176452763 1166190406 gnome-nettool /usr/bin/gnome-nettool <OLD>
-1176452763 1173697180 git-core /usr/bin/git-pack-refs <OLD>
-1176452763 1167557320 glade-gnome /usr/bin/glade-2 <OLD>
-1176452763 1170283746 gmt /usr/bin/GMT <OLD>
-1176452763 1172692908 gnome-about /usr/bin/gnome-about <OLD>
-1176452763 1166190408 gnome-keyring-manager /usr/bin/gnome-keyring-manager <OLD>
-1176452763 1172692910 gnome-menus /usr/bin/gnome-menu-spec-test <OLD>
-1176452762 1173474008 libgtk2.0-dev /usr/bin/gdk-pixbuf-csource <OLD>
-1176452762 1169252735 libgeos-dev /usr/bin/geos-config <OLD>
-1176452761 1166853121 libfribidi0 /usr/bin/fribidi <OLD>
-1176452761 1166190410 gcalctool /usr/bin/gnome-calculator <OLD>
-1176452761 1175126572 ffmpeg /usr/bin/ffplay <OLD>
-1176452761 1171415993 libgdal1-1.3.2-dev /usr/bin/gdal-config <OLD>
-1176452761 1166190407 gconf-editor /usr/bin/gconf-editor <OLD>
-1176452761 1171977059 libgda2-bin /usr/bin/gda-test <OLD>
-1176452760 1167197446 ffmpeg2theora /usr/bin/ffmpeg2theora <OLD>
-1176452760 1168883513 exiftran /usr/bin/exiftran <OLD>
-1176452760 1174638054 evolution /usr/bin/evolution <OLD>
-1176452760 1173697172 eog /usr/bin/eog <OLD>
-1176452760 1169987090 libenchant1c2a /usr/bin/enchant <OLD>
-1176452760 1166527569 festival /usr/bin/festival_client <OLD>
-1176452760 1166527229 libesd0-dev /usr/bin/esd-config <OLD>
-1176452760 1168883513 exif /usr/bin/exif <OLD>
-1176452760 1166190411 esound /usr/bin/esd <OLD>
-1176452759 1167185763 dvbsnoop /usr/bin/dvbsnoop <OLD>
-1176452759 1166527023 emma /usr/bin/Emma <OLD>
-1176452758 1166527001 diffstat /usr/bin/diffstat <OLD>
-1176452758 1169982582 dictzip /usr/bin/dictzcat <OLD>
-1176452758 1170968117 dialog /usr/bin/dialog <OLD>
-1176452758 1166541750 dh-buildinfo /usr/bin/dh_buildinfo <OLD>
-1176452758 1166526998 dia-gnome /usr/bin/dia-gnome <OLD>
-1176452758 1168364125 dselect /usr/bin/dselect <OLD>
-1176452758 1166526998 dia /usr/bin/dia-normal <OLD>
-1176452758 1166190405 liblockfile1 /usr/bin/dotlockfile <OLD>
-1176452757 1166526993 dadadodo /usr/bin/dadadodo <OLD>
-1176452757 1166190408 dc /usr/bin/dc <OLD>
-1176452757 1166526994 dbus-1-utils /usr/bin/dbus-monitor <OLD>
-1176452757 1166526994 debtags /usr/bin/debtags <OLD>
-1176452757 1166526993 darcs /usr/bin/darcs <OLD>
-1176452757 1166541745 libdbi-perl /usr/bin/dbiproxy <OLD>
-1176452757 1166526993 darcs-buildpackage /usr/bin/dbp-markdeb <OLD>
-1176452756 1166526993 curl /usr/bin/curl <OLD>
-1176452756 1166190406 libcroco3 /usr/bin/csslint-0.6 <OLD>
-1176452756 1173474001 comerr-dev /usr/bin/compile_et <OLD>
-1176452756 1174593896 cmake /usr/bin/ctest <OLD>
-1176452756 1166526992 conglomerate /usr/bin/conglomerate <OLD>
-1176452756 1166526992 connect-proxy /usr/bin/connect <OLD>
-1176452755 1166370937 cdebootstrap /usr/bin/cdebootstrap <OLD>
-1176452755 1166493253 btscanner /usr/bin/btscanner <OLD>
-1176452755 1166493268 cadaver /usr/bin/cadaver <OLD>
-1176452755 1166194139 bsh /usr/bin/bsh <OLD>
-1176452755 1173647366 python-cheetah /usr/bin/cheetah <OLD>
-1176452755 1168682724 bug-buddy /usr/bin/bug-buddy <OLD>
-1176452755 1166493270 cappuccino /usr/bin/cappuccino <OLD>
-1176452754 1166541750 automake /usr/bin/automake-1.10 <OLD>
-1176452754 1166527227 libaudiofile-dev /usr/bin/audiofile-config <OLD>
-1176452754 1166190410 bc /usr/bin/bc <OLD>
-1176452754 1166493247 autotrace /usr/bin/autotrace <OLD>
-1176452754 1166190402 bison /usr/bin/bison <OLD>
-1176452754 1166527209 libarts1c2a /usr/bin/artswrapper <OLD>
-1176452754 1171620539 boa-constructor /usr/bin/boa-constructor <OLD>
-1176452753 1166492351 libadns1-bin /usr/bin/adnsresfilter <OLD>
-1176452753 1166493228 apt-rdepends /usr/bin/apt-rdepends <OLD>
-1176452753 1166527226 libakode2 /usr/bin/akodeplay <OLD>
-1176452753 1166493217 apt-file /usr/bin/apt-file <OLD>
-1176381709 1167557335 libhdf5-serial-dev /usr/include/H5Ppublic.h <OLD>
-1176381708 1168601033 netcdfg-dev /usr/include/ncvalues.h <OLD>
-1176240161 1172331617 linux-image-2.6.20.1enrico /boot/System.map-2.6.20.1enrico <OLD>
-1176187919 1173870388 totem-xine /usr/bin/totem-video-thumbnailer <OLD>
-1176107897 1175877396 toilet /usr/bin/figlet-toilet <OLD>
-1175968220 1169991072 tftp /usr/bin/tftp <OLD>
-1175939042 1166372774 libpod-simple-perl /usr/share/perl5/Pod/Simple/BlackBox.pm <OLD>
-1175939042 1166372774 libpod-escapes-perl /usr/share/perl5/Pod/Escapes.pm <OLD>
-1175936595 1171977056 klibc-utils /usr/lib/klibc/bin/kill <OLD>
-1175768425 1175768448 libx11-dev /usr/lib/libX11.a <OLD>
-1175720113 1175720149 kdelibs-data /usr/share/apps/dcopidlng/kalyptusCxxToDcopIDL.pm <OLD>
-1175701618 1175699053 libmsat-dev /usr/include/msat/Image.h <OLD>
-1175701618 1166373018 libpopt-dev /usr/include/popt.h <OLD>
-1175699060 1175699053 libhrit-dev /usr/include/hrit/MSG_machine.h <OLD>
-1175699052 1175699052 libgrib-dev /usr/lib/libgrib.a <OLD>
-1175633925 1166527580 libxml-parser-perl /usr/lib/perl5/XML/Parser/Expat.pm <OLD>
-1175633925 1175633668 libxml-sax-expat-perl /usr/share/perl5/XML/SAX/Expat.pm <OLD>
-1175633925 1166527241 libxml-sax-perl /usr/bin/update-perl-sax-parsers <OLD>
-1175633925 1166527241 libxml-namespacesupport-perl /usr/share/perl5/XML/NamespaceSupport.pm <OLD>
-1175633632 1175633862 xli /usr/bin/xli <OLD>
-1175593578 1166603946 libcnf-dev /usr/lib/libcnf.a <OLD>
-1175353646 1175353594 libsdl1.2-dev /usr/include/SDL/close_code.h <OLD>
-1175353646 1172692918 libglu1-mesa-dev /usr/include/GL/glu.h <OLD>
-1175353646 1175353597 libsdl-mixer1.2-dev /usr/include/SDL/SDL_mixer.h <OLD>
-1175353646 1175353594 libsdl-image1.2-dev /usr/include/SDL/SDL_image.h <OLD>
-1175353646 1172692916 mesa-common-dev /usr/include/GL/glext.h <OLD>
-1175353574 1175353595 libvorbis-dev /usr/lib/libvorbisfile.a <OLD>
-1175353574 1175353592 libogg-dev /usr/include/ogg/os_types.h <OLD>
-1175353574 1175353597 libsmpeg-dev /usr/lib/libsmpeg.a <OLD>
-1175212670 1171415989 shared-mime-info /usr/bin/update-mime-database <OLD>
-1175163877 1173202538 xchm /usr/bin/xchm <OLD>
-1175005453 1166372906 unixodbc-dev /usr/include/sqlucode.h <OLD>
-1174947050 1167109785 liblogfile-rotate-perl /usr/share/perl5/Logfile/Rotate.pm <OLD>
-1174947050 1167109785 libconfhelper-perl /usr/share/perl5/ConfHelper.pm <OLD>
-1174639562 1166372530 libcompress-zlib-perl /usr/lib/perl5/Compress/Zlib.pm <OLD>
-1174637980 1166372773 libclass-accessor-perl /usr/share/perl5/Class/Accessor.pm <OLD>
-1174488555 1166190411 strace /usr/bin/strace <OLD>
-1174387948 1174388018 sound-juicer /usr/bin/sound-juicer <OLD>
-1174316026 1167557339 libpcap0.7-dev /usr/include/net/bpf.h <OLD>
-1174314249 1171415962 libsqlite0-dev /usr/include/sqlite.h <OLD>
-1174314249 1173127613 libfontconfig1-dev /usr/include/fontconfig/fcfreetype.h <OLD>
-1174314249 1166190620 python-numeric /usr/include/python2.4/Numeric/ufuncobject.h <OLD>
-1174314249 1166527233 libsigc++-2.0-dev /usr/include/sigc++-2.0/sigc++/sigc++.h <OLD>
-1174314249 1174236298 libgnomevfs2-dev /usr/include/gnome-vfs-module-2.0/libgnomevfs/gnome-vfs-pty.h <OLD>
-1174314249 1168804322 python-numeric-ext /usr/include/python2.4/Numeric/ranlib.h <OLD>
-1174314249 1167557336 liblcms1-dev /usr/include/icc34.h <OLD>
-1174314249 1171977032 libexpat1-dev /usr/include/expat_config.h <OLD>
-1174314249 1167557336 libjasper-1.701-dev /usr/include/jasper/jas_malloc.h <OLD>
-1174314249 1170794018 sysvinit /usr/include/initreq.h <OLD>
-1174314249 1166372774 libltdl3-dev /usr/include/ltdl.h <OLD>
-1174314249 1166526982 x11proto-xinerama-dev /usr/include/X11/extensions/panoramiXext.h <OLD>
-1174314249 1166527229 libxml2-dev /usr/include/libxml2/libxml/globals.h <OLD>
-1174314249 1169582337 libmng-dev /usr/include/libmng.h <OLD>
-1174314249 1166980514 libgnome-keyring-dev /usr/include/gnome-keyring-1/gnome-keyring.h <OLD>
-1174314249 1166542751 libxapian-dev /usr/include/xapian/valueiterator.h <OLD>
-1174314249 1168076530 libtiff4-dev /usr/include/tiffvers.h <OLD>
-1174314249 1166527234 libjpeg62-dev /usr/include/jpegint.h <OLD>
-1174314249 1166526980 x11proto-xext-dev /usr/include/X11/extensions/dpms.h <OLD>
-1174314249 1172691933 libapt-pkg-dev /usr/include/apt-pkg/extracttar.h <OLD>
-1174314249 1166526980 x11proto-kb-dev /usr/include/X11/extensions/XKBstr.h <OLD>
-1174314249 1166493207 python-pygame /usr/include/python2.4/pygame/font.h <OLD>
-1174314249 1166527228 libgnomecanvas2-dev /usr/include/libgnomecanvas-2.0/libgnomecanvas/gnome-canvas-polygon.h <OLD>
-1174314249 1166527229 liblzo-dev /usr/include/lzo2a.h <OLD>
-1174314249 1166527227 libdbus-1-dev /usr/include/dbus-1.0/dbus/dbus-pending-call.h <OLD>
-1174314249 1168445049 liblink-grammar4-dev /usr/include/link-grammar/link-features.h <OLD>
-1174314249 1166527228 libcairo2-dev /usr/include/cairo/cairo.h <OLD>
-1174314249 1167557334 libbz2-dev /usr/include/bzlib.h <OLD>
-1174314249 1169371528 cryptsetup /usr/include/libcryptsetup.h <OLD>
-1174314249 1166526981 x11proto-render-dev /usr/include/X11/extensions/render.h <OLD>
-1174314249 1172692915 libgl1-mesa-dev /usr/include/GL/glx.h <OLD>
-1174314249 1166526981 x11proto-fixes-dev /usr/include/X11/extensions/xfixeswire.h <OLD>
-1174314249 1171415983 libpq-dev /usr/include/postgresql/mb/pg_wchar.h <OLD>
-1174296996 1170426154 python-scipy /usr/share/pycentral/python-scipy/site-packages/scipy/weave/blitz/blitz/bench.h <OLD>
-1173870868 1166527235 libmailtools-perl /usr/share/perl5/Mail/Mailer/sendmail.pm <OLD>
-1173870819 1166544982 libclass-methodmaker-perl /usr/lib/perl5/Class/MethodMaker.pm <OLD>
-1173870819 1172192955 libio-stringy-perl /usr/share/perl5/IO/WrapTie.pm <OLD>
-1173870819 1166544983 libgnupg-interface-perl /usr/share/perl5/GnuPG/Options.pm <OLD>
-1173870818 1166545119 libtext-template-perl /usr/share/perl5/Text/Template.pm <OLD>
-1173870395 1173870361 ca-certificates /usr/sbin/update-ca-certificates <OLD>
-1173866940 1166493253 bsdgames /usr/games/morse <OLD>
-1173697155 1173697160 radeontool /usr/sbin/radeontool <OLD>
-1173553227 1166190615 lvm-common /usr/sbin/lvm-bin-scan <OLD>
-1173481316 1173474010 libgtk2.0-bin /usr/sbin/update-gdkpixbuf-loaders <OLD>
-1173474004 1173474045 xvnc4viewer /usr/bin/xvnc4viewer <OLD>
-1173374741 1173374759 libpg-perl /usr/share/perl5/Pg.pm <OLD>
-1173374741 1173374759 libdbd-pg-perl /usr/lib/perl5/DBD/Pg.pm <OLD>
-1173215667 1173044869 rrootage /usr/games/rrootage <OLD>
-1173032743 1171415983 perlmagick /usr/lib/perl5/Image/Magick.pm <OLD>
-1173000088 1173000089 mount /sbin/swapoff <OLD>
-1172968089 1172967534 bygfoot /usr/games/bygfoot <OLD>
-1172822444 1166190613 sgml-base /usr/sbin/install-sgmlcatalog <OLD>
-1172692896 1172692912 hdparm /sbin/hdparm <OLD>
-1172326759 1168621101 source-highlight /usr/bin/source-highlight <OLD>
-1172326712 1172327116 ant /usr/bin/ant <OLD>
-1172326712 1172326731 java-common /usr/sbin/update-java-alternatives <OLD>
-1172192928 1172192954 portmap /sbin/pmap_set <OLD>
-1171977263 1171977062 libpango1.0-common /usr/sbin/update-pangox-aliases <OLD>
-1171977005 1171977213 ipw3945d /sbin/ipw3945d <OLD>
-1171977005 1171977051 busybox /bin/busybox <OLD>
-1171416038 1171415990 ssl-cert /usr/sbin/make-ssl-cert <OLD>
-1170967425 1170084318 xsane /usr/bin/xsane <OLD>
-1170892768 1170892769 dash /bin/dash <OLD>
-1170877521 1170877544 ceferino /usr/games/ceferinoeditor <OLD>
-1170794020 1170794021 initscripts /sbin/fsck.nfs <OLD>
-1170637598 1170637641 xdelta /usr/bin/xdelta <OLD>
-1170637598 1170637623 gnome-games /usr/games/iagno <OLD>
-1169759887 1169667651 angrydd /usr/games/angrydd <OLD>
-1169252753 1166527581 tk8.4 /usr/bin/wish8.4 <OLD>
-1168896609 1168896624 libimage-base-bundle-perl /usr/share/perl5/Image/Xpm.pm <OLD>
-1168608457 1168608460 xmms-shell /usr/bin/xmms-shell <OLD>
-1168607980 1168607993 xmms-midi /usr/lib/xmms/Input/libmid.a <OLD>
-1168377698 1168377699 libnet-ldap-perl /usr/share/perl5/LWP/Protocol/ldap.pm <OLD>
-1168377698 1168377699 libconvert-asn1-perl /usr/share/perl5/Convert/ASN1/_encode.pm <OLD>
-1168201952 1166190366 libgtk2-perl /usr/lib/perl5/Gtk2/SimpleMenu.pm <OLD>
-1168201952 1168199689 tinyca /usr/bin/tinyca2 <OLD>
-1168201951 1166190366 libcairo-perl /usr/lib/perl5/Cairo.pm <OLD>
-1167557302 1167557318 glade-common /usr/share/doc/glade-common/examples/editor/acconfig.h <OLD>
-1167291089 1167289232 frozen-bubble /usr/share/perl5/fb_stuff.pm <OLD>
-1167285834 1167285834 liberror-perl /usr/share/perl5/Error.pm <OLD>
-1166980509 1166980543 tesseract-ocr /usr/bin/tesseract <OLD>
-1166545113 1166545116 libpango1-ruby /usr/lib/ruby/1.8/x86_64-linux/rbpangoversion.h <OLD>
-1166545113 1166545116 libatk1-ruby /usr/lib/ruby/1.8/x86_64-linux/rbatk.h <OLD>
-1166545113 1166545115 libglib2-ruby /usr/lib/ruby/1.8/x86_64-linux/rbgobject.h <OLD>
-1166545113 1166545116 libgtk2-ruby /usr/lib/ruby/1.8/x86_64-linux/rbgtk.h <OLD>
-1166545113 1166545115 libart2-ruby /usr/lib/ruby/1.8/x86_64-linux/rbart.h <OLD>
-1166545113 1166545116 libcairo-ruby1.8 /usr/lib/ruby/1.8/x86_64-linux/rb_cairo.h <OLD>
-1166544981 1166544990 python-wxglade /usr/bin/wxglade <OLD>
-1166544981 1166545007 stow /usr/bin/stow <OLD>
-1166544981 1166545008 tzwatch /usr/bin/tzwatch <OLD>
-1166544981 1166545008 trickle /usr/bin/trickle <OLD>
-1166544981 1166545008 units /usr/bin/units <OLD>
-1166544981 1166545007 swaks /usr/bin/swaks <OLD>
-1166544981 1166544984 libmd5-perl /usr/share/perl5/MD5.pm <OLD>
-1166544981 1166544983 libgtk2-gladexml-perl /usr/lib/perl5/Gtk2/GladeXML.pm <OLD>
-1166541744 1166541750 tcl8.3 /usr/bin/tclsh8.3 <OLD>
-1166541744 1166541744 libnet-daemon-perl /usr/share/perl5/Net/Daemon.pm <OLD>
-1166541744 1166541760 dopewars /usr/games/dopewars <OLD>
-1166541744 1166541745 libplrpc-perl /usr/share/perl5/Bundle/PlRPC.pm <OLD>
-1166541744 1166541751 tk8.3 /usr/bin/wish8.3 <OLD>
-1166527567 1166527570 doxygen-doc /usr/share/doc/doxygen/examples/structcmd.h <OLD>
-1166527354 1166527241 libxml-libxml-common-perl /usr/lib/perl5/XML/LibXML/Common.pm <OLD>
-1166527354 1166527241 libxml-libxml-perl /usr/lib/perl5/XML/LibXML/Number.pm <OLD>
-1166526979 1166526982 libxi-dev /usr/lib/libXi.a <OLD>
-1166526979 1166527249 stl-manual /usr/share/doc/stl-manual/html/vector.h <OLD>
-1166526979 1166527235 libhtml-format-perl /usr/share/perl5/HTML/FormatPS.pm <OLD>
-1166526979 1166527032 libhtml-tagset-perl /usr/share/perl5/HTML/Tagset.pm <OLD>
-1166526979 1166527234 libfont-afm-perl /usr/share/perl5/Font/Metrics/Courier.pm <OLD>
-1166526979 1166527250 tagcolledit /usr/bin/tagcolledit <OLD>
-1166493179 1166493216 libconfig-file-perl /usr/share/perl5/Config/File.pm <OLD>
-1166491978 1166491979 libsasl2-2 /usr/lib/sasl2/libsasldb.a <OLD>
-1166491978 1166491979 libsasl2-modules /usr/lib/sasl2/liblogin.a <OLD>
-1166372771 1166372772 libalgorithm-annotate-perl /usr/share/perl5/Algorithm/Annotate.pm <OLD>
-1166372771 1166372773 libio-string-perl /usr/share/perl5/IO/String.pm <OLD>
-1166372771 1166372777 subversion-tools /usr/bin/svn_apply_autoprops <OLD>
-1166372771 1166372773 libfreezethaw-perl /usr/share/perl5/FreezeThaw.pm <OLD>
-1166372771 1166372775 libtext-diff-perl /usr/share/perl5/Text/Diff/Table.pm <OLD>
-1166372771 1166372772 libalgorithm-diff-perl /usr/share/perl5/Algorithm/Diff.pm <OLD>
-1166372771 1166372777 python-subversion /usr/bin/svnshell <OLD>
-1166372771 1166372773 libextutils-autoinstall-perl /usr/share/perl5/ExtUtils/AutoInstall.pm <OLD>
-1166372522 1166372530 libmail-sendmail-perl /usr/share/perl5/Mail/Sendmail.pm <OLD>
-1166370841 1166370849 resolvconf /sbin/resolvconf <OLD>
-1166195126 1166195126 xfsdump /usr/sbin/xfsrestore <OLD>
-1166191394 1166191399 dmsetup /sbin/dmsetup <OLD>
-1166191159 1166190413 libconfig-inifiles-perl /usr/share/perl5/Config/IniFiles.pm <OLD>
-1166190917 1166190542 libgnome2-canvas-perl /usr/share/doc/libgnome2-canvas-perl/examples/canvas-primitives.pm.gz <OLD>
-1166190887 1166190615 libpam-runtime /usr/sbin/pam_getenv <OLD>
-1166190887 1166190615 libpam-modules /usr/sbin/pam_tally <OLD>
-1166190887 1166190615 base-passwd /usr/sbin/update-passwd <OLD>
-1166190886 1166190615 libident /usr/sbin/in.identtestd <OLD>
-1166190885 1166190615 net-tools /usr/sbin/arp <OLD>
-1166190884 1166190366 libgnome2-perl /usr/lib/perl5/Gnome2.pm <OLD>
-1166190884 1166190366 libgnome2-vfs-perl /usr/lib/perl5/Gnome2/VFS.pm <OLD>
-1166190775 1166190411 type-handling /usr/bin/type-handling <OLD>
-1166190775 1166190404 tcl8.4 /usr/bin/tclsh8.4 <OLD>
-1166190775 1166190407 language-env /usr/bin/tklanguage <OLD>
-1166190775 1166190406 libxml2-utils /usr/bin/xmllint <OLD>
-1166190775 1166190399 tcsh /bin/tcsh <OLD>
-1166190775 1166190401 time /usr/bin/time <OLD>
-1166190775 1166190410 twm /usr/bin/twm <OLD>
-1166111683 1166111796 pcmciautils /sbin/lspcmcia <OLD>
-1166111683 1166111684 iptables /sbin/iptables-restore <OLD>
-1166111669 1166111669 hostname /bin/dnsdomainname <OLD>
-1166088950 1166088395 makedev /sbin/MAKEDEV <OLD>
-1166088684 1166088872 wireless-tools /sbin/iwconfig <OLD>
-1166088684 1166088719 bzip2 /bin/bzcmp <OLD>
-1166088684 1166088703 powermgmt-base /usr/bin/on_ac_power <OLD>
-1166088409 1166088411 ed /usr/bin/red <OLD>
-1166088409 1166088411 ifupdown /sbin/ifup <OLD>
-0 0 notification-daemon <NOFILES>
-0 0 libslp1 <NOFILES>
-0 0 python-rpy <NOFILES>
-0 0 libgtksourceview-common <NOFILES>
-0 0 compiz-gnome <NOFILES>
-0 0 libvte-ruby <NOFILES>
-0 0 libgphoto2-2 <NOFILES>
-0 0 xserver-xorg-input-kbd <NOFILES>
-0 0 libvorbis0a <NOFILES>
-0 0 python-gnome2 <NOFILES>
-0 0 python-dateutil <NOFILES>
-0 0 libvorbisenc2 <NOFILES>
-0 0 libgstreamer-plugins0.8-0 <NOFILES>
-0 0 libgnome-media0 <NOFILES>
-0 0 libxcursor1 <NOFILES>
-0 0 libcln4 <NOFILES>
-0 0 libsdl1.2debian <NOFILES>
-0 0 libscim8c2a <NOFILES>
-0 0 xserver-xorg-video-s3 <NOFILES>
-0 0 python-sqlite <NOFILES>
-0 0 gedit-common <NOFILES>
-0 0 libdbus-glib-1-2 <NOFILES>
-0 0 python-rpy-doc <NOFILES>
-0 0 proj-ps-doc <NOFILES>
-0 0 xsane-common <NOFILES>
-0 0 libgl1-mesa-dri <NOFILES>
-0 0 libx11-6 <NOFILES>
-0 0 libwnck18 <NOFILES>
-0 0 libxklavier10 <NOFILES>
-0 0 sun-java5-jre <NOFILES>
-0 0 libtasn1-3 <NOFILES>
-0 0 bochsbios <NOFILES>
-0 0 xmms-speex <NOFILES>
-0 0 svgalibg1 <NOFILES>
-0 0 sgml-data <NOFILES>
-0 0 libgtkmm-2.4-1c2a <NOFILES>
-0 0 libboost-regex1.33.1 <NOFILES>
-0 0 texlive-doc-base <NOFILES>
-0 0 libedataserverui1.2-6 <NOFILES>
-0 0 gcj-4.1-base <NOFILES>
-0 0 r-cran-kernsmooth <NOFILES>
-0 0 libdballe-bufrex-doc <NOFILES>
-0 0 python-gtk2-doc <NOFILES>
-0 0 libwmf0.2-7 <NOFILES>
-0 0 librsvg2-ruby <NOFILES>
-0 0 libgnomecupsui1.0-1c2a <NOFILES>
-0 0 proll <NOFILES>
-0 0 libgcj7-0 <NOFILES>
-0 0 libcfitsio2 <NOFILES>
-0 0 xfonts-scalable <NOFILES>
-0 0 xserver-xorg <NOFILES>
-0 0 libxft2 <NOFILES>
-0 0 libmagick++9c2a <NOFILES>
-0 0 gnome-media-common <NOFILES>
-0 0 libasound2 <NOFILES>
-0 0 libnotify1 <NOFILES>
-0 0 libcdio6 <NOFILES>
-0 0 python-cherrypy <NOFILES>
-0 0 libwpd8c2a <NOFILES>
-0 0 libdb4.3 <NOFILES>
-0 0 libgsf-1-common <NOFILES>
-0 0 libxmu6 <NOFILES>
-0 0 libnss3-0d <NOFILES>
-0 0 libcupsys2 <NOFILES>
-0 0 swig-doc <NOFILES>
-0 0 debconf-i18n <NOFILES>
-0 0 openoffice.org-l10n-en-gb <NOFILES>
-0 0 libdballe-msg3 <NOFILES>
-0 0 scim-chewing <NOFILES>
-0 0 libdevmapper1.02 <NOFILES>
-0 0 libfreetype6 <NOFILES>
-0 0 texlive-pictures <NOFILES>
-0 0 openbox-themes <NOFILES>
-0 0 discover1-data <NOFILES>
-0 0 libopal-2.2.0 <NOFILES>
-0 0 libmagick9 <NOFILES>
-0 0 gtk2-engines <NOFILES>
-0 0 console-data <NOFILES>
-0 0 libxv1 <NOFILES>
-0 0 libufsparse <NOFILES>
-0 0 libaprutil1 <NOFILES>
-0 0 libfltk1.1 <NOFILES>
-0 0 libmdbtools <NOFILES>
-0 0 libjline-java <NOFILES>
-0 0 libchewing3 <NOFILES>
-0 0 python-ooolib <NOFILES>
-0 0 cups-pdf <NOFILES>
-0 0 libmcrypt4 <NOFILES>
-0 0 openoffice.org-l10n-it <NOFILES>
-0 0 openoffice.org-java-common <NOFILES>
-0 0 gstreamer0.10-esd <NOFILES>
-0 0 libslang2 <NOFILES>
-0 0 docbook-xsl <NOFILES>
-0 0 iceweasel-webdeveloper <NOFILES>
-0 0 libportaudio0 <NOFILES>
-0 0 libpci2 <NOFILES>
-0 0 libgdal-doc <NOFILES>
-0 0 libreadline-ruby1.8 <NOFILES>
-0 0 gnome-applets-data <NOFILES>
-0 0 python-syck <NOFILES>
-0 0 python-gmenu <NOFILES>
-0 0 libgnome32 <NOFILES>
-0 0 fftw2 <NOFILES>
-0 0 libgnome-window-settings1 <NOFILES>
-0 0 libgnomecanvas2-ruby <NOFILES>
-0 0 libpango1.0-0 <NOFILES>
-0 0 libgeos-c1 <NOFILES>
-0 0 libsdl-pango1 <NOFILES>
-0 0 tesseract-ocr-data <NOFILES>
-0 0 openhackware <NOFILES>
-0 0 libnetcdf3 <NOFILES>
-0 0 libtotem-plparser1 <NOFILES>
-0 0 c++-annotations-txt <NOFILES>
-0 0 python-paste <NOFILES>
-0 0 xserver-xorg-video-voodoo <NOFILES>
-0 0 gcc-3.3-base <NOFILES>
-0 0 gimp-resynthesizer <NOFILES>
-0 0 gstreamer0.10-ffmpeg <NOFILES>
-0 0 tipa <NOFILES>
-0 0 python-celementtree <NOFILES>
-0 0 xserver-xorg-video-vga <NOFILES>
-0 0 libdballepp3 <NOFILES>
-0 0 myspell-en-us <NOFILES>
-0 0 xserver-xorg-video-cirrus <NOFILES>
-0 0 guile-1.6-libs <NOFILES>
-0 0 developers-reference <NOFILES>
-0 0 libkadm55 <NOFILES>
-0 0 metacity-common <NOFILES>
-0 0 libxul-common <NOFILES>
-0 0 grass-doc <NOFILES>
-0 0 python-gtk2 <NOFILES>
-0 0 libtool-doc <NOFILES>
-0 0 libapache2-mod-php5 <NOFILES>
-0 0 libgda2-3 <NOFILES>
-0 0 libdb4.4 <NOFILES>
-0 0 libflac7 <NOFILES>
-0 0 libldap2 <NOFILES>
-0 0 libgnomemm1.2-9c2 <NOFILES>
-0 0 libsexy2 <NOFILES>
-0 0 libvisual-0.4-0 <NOFILES>
-0 0 libglib2.0-0 <NOFILES>
-0 0 libglu1-mesa <NOFILES>
-0 0 libvte4 <NOFILES>
-0 0 c++-annotations-latex <NOFILES>
-0 0 libgnomesupport0 <NOFILES>
-0 0 tomatoes-data <NOFILES>
-0 0 compiz-plugins <NOFILES>
-0 0 libgpgme11 <NOFILES>
-0 0 libmng1 <NOFILES>
-0 0 ttf-arphic-ukai <NOFILES>
-0 0 libxosd2 <NOFILES>
-0 0 python-uno <NOFILES>
-0 0 libpaper1 <NOFILES>
-0 0 ncurses-base <NOFILES>
-0 0 libxul0d <NOFILES>
-0 0 python-debian <NOFILES>
-0 0 gstreamer0.10-plugins-good <NOFILES>
-0 0 libgtksourceview1.0-0 <NOFILES>
-0 0 libice6 <NOFILES>
-0 0 glibc-doc-reference <NOFILES>
-0 0 tzdata <NOFILES>
-0 0 libattr1 <NOFILES>
-0 0 freepats <NOFILES>
-0 0 libgtkspell0 <NOFILES>
-0 0 libgdal1-1.3.2 <NOFILES>
-0 0 libgail-common <NOFILES>
-0 0 gimp-python <NOFILES>
-0 0 libgutenprint2 <NOFILES>
-0 0 libntfs9 <NOFILES>
-0 0 libexchange-storage1.2-1 <NOFILES>
-0 0 libnetcdf++3 <NOFILES>
-0 0 libdirectfb-0.9-25 <NOFILES>
-0 0 libiso9660-4 <NOFILES>
-0 0 iceweasel-l10n-it <NOFILES>
-0 0 libxtst6 <NOFILES>
-0 0 r-cran-sandwich <NOFILES>
-0 0 postgresql-contrib <NOFILES>
-0 0 libgnutls13 <NOFILES>
-0 0 gimp-gap <NOFILES>
-0 0 xserver-xorg-video-mga <NOFILES>
-0 0 dia-common <NOFILES>
-0 0 libxkbfile1 <NOFILES>
-0 0 libogdi3.2 <NOFILES>
-0 0 gimp-print <NOFILES>
-0 0 autoconf-doc <NOFILES>
-0 0 libgnomevfs2-common <NOFILES>
-0 0 readline-common <NOFILES>
-0 0 librsvg2-2 <NOFILES>
-0 0 libscrollkeeper0 <NOFILES>
-0 0 libotf0 <NOFILES>
-0 0 libjasper-1.701-1 <NOFILES>
-0 0 libdballe-msg-doc <NOFILES>
-0 0 libvorbisfile3 <NOFILES>
-0 0 libpoppler0c2-glib <NOFILES>
-0 0 ibritish <NOFILES>
-0 0 linux-doc-2.6.21 <NOFILES>
-0 0 python-ctypes <NOFILES>
-0 0 liba52-0.7.4 <NOFILES>
-0 0 festvox-suopuhe-common <NOFILES>
-0 0 python-webpy <NOFILES>
-0 0 python-sip4 <NOFILES>
-0 0 libgnomecanvas2-common <NOFILES>
-0 0 python-vobject <NOFILES>
-0 0 xserver-xorg-video-tseng <NOFILES>
-0 0 gnome-mime-data <NOFILES>
-0 0 festvox-italp16k <NOFILES>
-0 0 libgnomeprint2.2-data <NOFILES>
-0 0 toilet-fonts <NOFILES>
-0 0 python-numpy-ext <NOFILES>
-0 0 librsvg2-common <NOFILES>
-0 0 libdm0 <NOFILES>
-0 0 libmetacity0 <NOFILES>
-0 0 libgnome2-common <NOFILES>
-0 0 libdv4 <NOFILES>
-0 0 libsmpeg0 <NOFILES>
-0 0 libsane <NOFILES>
-0 0 xapian-examples <NOFILES>
-0 0 libsemanage1 <NOFILES>
-0 0 libgnomecups1.0-1 <NOFILES>
-0 0 xserver-xorg-video-ati <NOFILES>
-0 0 gnome-core <NOFILES>
-0 0 libsqliteodbc <NOFILES>
-0 0 ant-optional <NOFILES>
-0 0 python-flup <NOFILES>
-0 0 lvm2 <NOFILES>
-0 0 lapack3 <NOFILES>
-0 0 libpostproc0d <NOFILES>
-0 0 qalculate <NOFILES>
-0 0 xserver-xorg-video-rendition <NOFILES>
-0 0 freeglut3 <NOFILES>
-0 0 libklibc <NOFILES>
-0 0 manpages-it <NOFILES>
-0 0 libsm6 <NOFILES>
-0 0 cpp-4.1-doc <NOFILES>
-0 0 libapm1 <NOFILES>
-0 0 postfix-doc <NOFILES>
-0 0 adept-common <NOFILES>
-0 0 libpisock9 <NOFILES>
-0 0 libshout3 <NOFILES>
-0 0 libsdl1.2debian-alsa <NOFILES>
-0 0 python-extractor <NOFILES>
-0 0 libsdl-gfx1.2-4 <NOFILES>
-0 0 libstdc++5 <NOFILES>
-0 0 r-cran-abind <NOFILES>
-0 0 libgnomeprintui2.2-common <NOFILES>
-0 0 r-cran-rcmdr <NOFILES>
-0 0 libt1-5 <NOFILES>
-0 0 libglitz-glx1 <NOFILES>
-0 0 festvox-itapc16k <NOFILES>
-0 0 xorg <NOFILES>
-0 0 libbeecrypt6 <NOFILES>
-0 0 link-grammar-dictionaries-en <NOFILES>
-0 0 libraw1394-8 <NOFILES>
-0 0 lesstif2 <NOFILES>
-0 0 libtiffxx0c2 <NOFILES>
-0 0 libvformat1 <NOFILES>
-0 0 python-crypto <NOFILES>
-0 0 libchewing3-data <NOFILES>
-0 0 gcc-3.4-base <NOFILES>
-0 0 libgstreamer-plugins-base0.10-0 <NOFILES>
-0 0 python-bluez <NOFILES>
-0 0 evolution-data-server <NOFILES>
-0 0 python-cairo <NOFILES>
-0 0 base-files <NOFILES>
-0 0 sqlite3-doc <NOFILES>
-0 0 gnome-user-guide <NOFILES>
-0 0 libkrb53 <NOFILES>
-0 0 gnome-panel-data <NOFILES>
-0 0 libhal1 <NOFILES>
-0 0 libaudiofile0 <NOFILES>
-0 0 libexif-ruby1.8 <NOFILES>
-0 0 texlive-base <NOFILES>
-0 0 r-cran-mvtnorm <NOFILES>
-0 0 festvox-kallpc16k <NOFILES>
-0 0 r-cran-strucchange <NOFILES>
-0 0 libdebian-installer-extra4 <NOFILES>
-0 0 libdc1394-13 <NOFILES>
-0 0 libpq4 <NOFILES>
-0 0 xserver-xorg-input-evdev <NOFILES>
-0 0 r-cran-foreign <NOFILES>
-0 0 libkonq4 <NOFILES>
-0 0 vgabios <NOFILES>
-0 0 python-all <NOFILES>
-0 0 qgis-plugin-grass <NOFILES>
-0 0 libmpfr1 <NOFILES>
-0 0 lmodern <NOFILES>
-0 0 python-at-spi <NOFILES>
-0 0 gmt-tutorial <NOFILES>
-0 0 libgnomevfs2-ruby <NOFILES>
-0 0 libkcddb1 <NOFILES>
-0 0 libaspell15 <NOFILES>
-0 0 libmsat0 <NOFILES>
-0 0 libxtrap6 <NOFILES>
-0 0 libextractor-plugins <NOFILES>
-0 0 libgtkhtml2-ruby <NOFILES>
-0 0 python-mysqldb <NOFILES>
-0 0 libaudio2 <NOFILES>
-0 0 xmms-mad <NOFILES>
-0 0 openoffice.org-evolution <NOFILES>
-0 0 libevent1 <NOFILES>
-0 0 postgresql-client <NOFILES>
-0 0 librecode0 <NOFILES>
-0 0 gcc-4.1-base <NOFILES>
-0 0 libstartup-notification0 <NOFILES>
-0 0 libxpm4 <NOFILES>
-0 0 doc-linux-text <NOFILES>
-0 0 gnome-desktop-data <NOFILES>
-0 0 libpanel-applet2-0 <NOFILES>
-0 0 libobby-0.4-0 <NOFILES>
-0 0 libgnomeui-0 <NOFILES>
-0 0 festvox-suopuhe-lj <NOFILES>
-0 0 libnautilus-extension1 <NOFILES>
-0 0 texlive-generic-recommended <NOFILES>
-0 0 texlive-latex-recommended <NOFILES>
-0 0 libcurl3 <NOFILES>
-0 0 libnet1 <NOFILES>
-0 0 libgtop2-7 <NOFILES>
-0 0 wamerican <NOFILES>
-0 0 r-cran-relimp <NOFILES>
-0 0 xmms-xf86audio <NOFILES>
-0 0 openoffice.org-core <NOFILES>
-0 0 libbind9-30 <NOFILES>
-0 0 libdmx1 <NOFILES>
-0 0 gnome-netstatus-applet <NOFILES>
-0 0 python-roman <NOFILES>
-0 0 texpower <NOFILES>
-0 0 libmagic1 <NOFILES>
-0 0 libsvn1 <NOFILES>
-0 0 libtiff4 <NOFILES>
-0 0 python-profiler <NOFILES>
-0 0 linux-image-2.6-amd64 <NOFILES>
-0 0 ncurses-term <NOFILES>
-0 0 libxau6 <NOFILES>
-0 0 dict-bouvier <NOFILES>
-0 0 libxcomposite1 <NOFILES>
-0 0 libieee1284-3 <NOFILES>
-0 0 python-semanage <NOFILES>
-0 0 libqalculate3 <NOFILES>
-0 0 libgconf2-4 <NOFILES>
-0 0 libmpeg2-4 <NOFILES>
-0 0 xserver-xorg-video-fbdev <NOFILES>
-0 0 php5-common <NOFILES>
-0 0 libgmp3c2 <NOFILES>
-0 0 iceweasel-gnome-support <NOFILES>
-0 0 prosper <NOFILES>
-0 0 libsdl-console <NOFILES>
-0 0 scim-modules-socket <NOFILES>
-0 0 libgpmg1 <NOFILES>
-0 0 libxfont1 <NOFILES>
-0 0 netbase <NOFILES>
-0 0 libdjvulibre15 <NOFILES>
-0 0 xfonts-base <NOFILES>
-0 0 autoconf-archive <NOFILES>
-0 0 python-dev <NOFILES>
-0 0 libebook1.2-5 <NOFILES>
-0 0 festvox-suopuhe-mv <NOFILES>
-0 0 libgnomevfs2-extra <NOFILES>
-0 0 gnome-terminal-data <NOFILES>
-0 0 xserver-xorg-input-all <NOFILES>
-0 0 iceweasel-dom-inspector <NOFILES>
-0 0 alsa-base <NOFILES>
-0 0 libpth20 <NOFILES>
-0 0 python-matplotlib-data <NOFILES>
-0 0 libpcap0.7 <NOFILES>
-0 0 postgresql-doc <NOFILES>
-0 0 dia-libs <NOFILES>
-0 0 libgnomevfs2-0 <NOFILES>
-0 0 libcucul0 <NOFILES>
-0 0 libstdc++6-4.1-doc <NOFILES>
-0 0 libgphoto2-port0 <NOFILES>
-0 0 debian-policy <NOFILES>
-0 0 python-numpy-doc <NOFILES>
-0 0 lsb-base <NOFILES>
-0 0 libisccc0 <NOFILES>
-0 0 gmt-coast-low <NOFILES>
-0 0 python-apt <NOFILES>
-0 0 xaw3dg <NOFILES>
-0 0 c++-annotations-pdf <NOFILES>
-0 0 docbook-xsl-doc <NOFILES>
-0 0 libjaxp1.3-java <NOFILES>
-0 0 gnome-cards-data <NOFILES>
-0 0 libmpcdec3 <NOFILES>
-0 0 gimp-data-extras <NOFILES>
-0 0 ttf-dejavu <NOFILES>
-0 0 evolution-data-server-common <NOFILES>
-0 0 libbluetooth2 <NOFILES>
-0 0 texlive-common <NOFILES>
-0 0 libdballe-db3 <NOFILES>
-0 0 libconsole <NOFILES>
-0 0 libodbcinstq1c2 <NOFILES>
-0 0 libavformat0d <NOFILES>
-0 0 libgnome-menu2 <NOFILES>
-0 0 xlibmesa-gl-dev <NOFILES>
-0 0 libspeex1 <NOFILES>
-0 0 libqt3-i18n <NOFILES>
-0 0 libxalan2-java <NOFILES>
-0 0 automake1.10-doc <NOFILES>
-0 0 libgtkglext1-ruby <NOFILES>
-0 0 libbonoboui2-common <NOFILES>
-0 0 libvte-common <NOFILES>
-0 0 libgsl0 <NOFILES>
-0 0 libisc11 <NOFILES>
-0 0 python-sqlalchemy <NOFILES>
-0 0 libss2 <NOFILES>
-0 0 libmad0 <NOFILES>
-0 0 libsvga1 <NOFILES>
-0 0 libncurses5 <NOFILES>
-0 0 libept0 <NOFILES>
-0 0 libsepol1 <NOFILES>
-0 0 python-selinux <NOFILES>
-0 0 libart-2.0-2 <NOFILES>
-0 0 libplot2c2 <NOFILES>
-0 0 iceweasel-greasemonkey <NOFILES>
-0 0 libosp5 <NOFILES>
-0 0 texlive-fonts-recommended <NOFILES>
-0 0 odbc-postgresql <NOFILES>
-0 0 libtheora0 <NOFILES>
-0 0 libnfsidmap2 <NOFILES>
-0 0 python-qtext <NOFILES>
-0 0 xfonts-100dpi <NOFILES>
-0 0 manpages <NOFILES>
-0 0 libvolume-id0 <NOFILES>
-0 0 libdballe-db-doc <NOFILES>
-0 0 gcc-doc <NOFILES>
-0 0 libqt4-gui <NOFILES>
-0 0 libblkid1 <NOFILES>
-0 0 libxss1 <NOFILES>
-0 0 libruby1.8 <NOFILES>
-0 0 libxine1 <NOFILES>
-0 0 xserver-xorg-video-cyrix <NOFILES>
-0 0 fast-user-switch-applet <NOFILES>
-0 0 libmpich1.0c2 <NOFILES>
-0 0 libgtop2-common <NOFILES>
-0 0 mapserver-doc <NOFILES>
-0 0 gnome-themes <NOFILES>
-0 0 frozen-bubble-data <NOFILES>
-0 0 intltool-debian <NOFILES>
-0 0 libsdl-mixer1.2 <NOFILES>
-0 0 libextractor1c2a <NOFILES>
-0 0 python-pysqlite2 <NOFILES>
-0 0 libgpg-error0 <NOFILES>
-0 0 libgksuui1.0-1 <NOFILES>
-0 0 libopengl-ruby <NOFILES>
-0 0 python-gammu <NOFILES>
-0 0 postgresql <NOFILES>
-0 0 libarchive1 <NOFILES>
-0 0 libflac++5 <NOFILES>
-0 0 libxinerama1 <NOFILES>
-0 0 libedataserver1.2-7 <NOFILES>
-0 0 c++-annotations-ps <NOFILES>
-0 0 eric-api-files <NOFILES>
-0 0 python-gnome2-desktop <NOFILES>
-0 0 graphviz-doc <NOFILES>
-0 0 r-cran-lattice <NOFILES>
-0 0 gconf2-common <NOFILES>
-0 0 manpages-dev <NOFILES>
-0 0 libgdk-pixbuf2-ruby <NOFILES>
-0 0 libgnomecanvas2-0 <NOFILES>
-0 0 xserver-xorg-video-sis <NOFILES>
-0 0 r-doc-info <NOFILES>
-0 0 libsmbclient <NOFILES>
-0 0 gmt-examples <NOFILES>
-0 0 libdrm2 <NOFILES>
-0 0 libmusicbrainz4c2a <NOFILES>
-0 0 python-pycurl <NOFILES>
-0 0 libpcsclite1 <NOFILES>
-0 0 libxaw6 <NOFILES>
-0 0 bzr-svn <NOFILES>
-0 0 gcc-doc-base <NOFILES>
-0 0 libgtk1.2 <NOFILES>
-0 0 python2.4-doc <NOFILES>
-0 0 liferea-xulrunner <NOFILES>
-0 0 liblwres30 <NOFILES>
-0 0 libdvdread3 <NOFILES>
-0 0 liblualib50 <NOFILES>
-0 0 libldap-2.3-0 <NOFILES>
-0 0 xmms-oggre <NOFILES>
-0 0 libestools1.2 <NOFILES>
-0 0 libavcodec0d <NOFILES>
-0 0 python-qt3 <NOFILES>
-0 0 fb-music-high <NOFILES>
-0 0 bicyclerepair <NOFILES>
-0 0 libgnome2-ruby <NOFILES>
-0 0 industrial-cursor-theme <NOFILES>
-0 0 python-pyorbit <NOFILES>
-0 0 libgtk2.0-0 <NOFILES>
-0 0 timidity-interfaces-extra <NOFILES>
-0 0 e2fslibs <NOFILES>
-0 0 octave <NOFILES>
-0 0 xserver-xorg-video-glint <NOFILES>
-0 0 libsndfile1 <NOFILES>
-0 0 xbitmaps <NOFILES>
-0 0 librexml-ruby <NOFILES>
-0 0 libdballef3 <NOFILES>
-0 0 grep-dctrl <NOFILES>
-0 0 gcc-4.1-doc <NOFILES>
-0 0 libpanel-applet2-ruby <NOFILES>
-0 0 vim-gui-common <NOFILES>
-0 0 liboggflac3 <NOFILES>
-0 0 w3c-dtd-xhtml <NOFILES>
-0 0 gnuplot-x11 <NOFILES>
-0 0 ruby-gnome2 <NOFILES>
-0 0 gimp-data <NOFILES>
-0 0 libqgis0 <NOFILES>
-0 0 xserver-xorg-video-all <NOFILES>
-0 0 libgdl-1-0 <NOFILES>
-0 0 python-sqlobject <NOFILES>
-0 0 openoffice.org-thesaurus-en-us <NOFILES>
-0 0 xserver-xorg-video-dummy <NOFILES>
-0 0 libapr1 <NOFILES>
-0 0 libxvmc1 <NOFILES>
-0 0 libcurl3-gnutls <NOFILES>
-0 0 libgcc1 <NOFILES>
-0 0 kdebase-data <NOFILES>
-0 0 xpdf <NOFILES>
-0 0 libpng12-0 <NOFILES>
-0 0 libgammu1 <NOFILES>
-0 0 xkb-data <NOFILES>
-0 0 libgnomeui32 <NOFILES>
-0 0 r-cran-effects <NOFILES>
-0 0 libbonoboui2-0 <NOFILES>
-0 0 libcommons-cli-java <NOFILES>
-0 0 python-protocols <NOFILES>
-0 0 libxevie1 <NOFILES>
-0 0 xapian-doc <NOFILES>
-0 0 libxt-java <NOFILES>
-0 0 libsasl2 <NOFILES>
-0 0 gimp-svg <NOFILES>
-0 0 python-tk <NOFILES>
-0 0 xserver-xorg-video-trident <NOFILES>
-0 0 x-ttcidfont-conf <NOFILES>
-0 0 r-cran-vr <NOFILES>
-0 0 python-magic <NOFILES>
-0 0 libgnomeprint2.2-0 <NOFILES>
-0 0 r-cran-cluster <NOFILES>
-0 0 libavahi-common3 <NOFILES>
-0 0 esound-common <NOFILES>
-0 0 libgeos2c2a <NOFILES>
-0 0 libkpathsea4 <NOFILES>
-0 0 libxaw7 <NOFILES>
-0 0 xplanet-images <NOFILES>
-0 0 libmysqlclient15off <NOFILES>
-0 0 libdb3 <NOFILES>
-0 0 libfontenc1 <NOFILES>
-0 0 xserver-xorg-video-savage <NOFILES>
-0 0 libgssapi2 <NOFILES>
-0 0 libpstoedit0c2a <NOFILES>
-0 0 libgimp2.0 <NOFILES>
-0 0 libwrap0 <NOFILES>
-0 0 libpt-plugins-v4l <NOFILES>
-0 0 glade-doc <NOFILES>
-0 0 libxerces2-java <NOFILES>
-0 0 libcupsimage2 <NOFILES>
-0 0 docbook-xml <NOFILES>
-0 0 dict-elements <NOFILES>
-0 0 festlex-poslex <NOFILES>
-0 0 python-glade2 <NOFILES>
-0 0 libcomerr2 <NOFILES>
-0 0 liblzo1 <NOFILES>
-0 0 liblua50 <NOFILES>
-0 0 selinux-policy-refpolicy-targeted <NOFILES>
-0 0 libxt6 <NOFILES>
-0 0 libboost-program-options1.33.1 <NOFILES>
-0 0 libgksu1.2-0 <NOFILES>
-0 0 openoffice.org-hyphenation-it <NOFILES>
-0 0 python-markdown <NOFILES>
-0 0 pgf <NOFILES>
-0 0 python-libxml2 <NOFILES>
-0 0 libguichan0 <NOFILES>
-0 0 libhrit0 <NOFILES>
-0 0 libdebian-installer4 <NOFILES>
-0 0 libgtkhtml3.8-15 <NOFILES>
-0 0 libgnorba27 <NOFILES>
-0 0 xserver-xorg-video-v4l <NOFILES>
-0 0 linux-sound-base <NOFILES>
-0 0 libsoup2.2-8 <NOFILES>
-0 0 libreadline5 <NOFILES>
-0 0 libsysfs2 <NOFILES>
-0 0 libgucharmap4 <NOFILES>
-0 0 libsqlite3-0 <NOFILES>
-0 0 libbonobo2-0 <NOFILES>
-0 0 python-matplotlib-doc <NOFILES>
-0 0 libncursesw5 <NOFILES>
-0 0 python-gtk2-tutorial <NOFILES>
-0 0 python-xapian <NOFILES>
-0 0 nautilus-data <NOFILES>
-0 0 xserver-xorg-video-neomagic <NOFILES>
-0 0 libmikmod2 <NOFILES>
-0 0 libmyodbc <NOFILES>
-0 0 libxerces27 <NOFILES>
-0 0 libecal1.2-6 <NOFILES>
-0 0 libopenssl-ruby1.8 <NOFILES>
-0 0 libgamin0 <NOFILES>
-0 0 python-gnome2-extras <NOFILES>
-0 0 python-doc <NOFILES>
-0 0 xserver-xorg-input-wacom <NOFILES>
-0 0 libgstreamer0.8-ruby <NOFILES>
-0 0 bluetooth <NOFILES>
-0 0 r-cran-nlme <NOFILES>
-0 0 dict-vera <NOFILES>
-0 0 libmozjs0d <NOFILES>
-0 0 desktop-base <NOFILES>
-0 0 libgcrypt11 <NOFILES>
-0 0 libgsf-1-114 <NOFILES>
-0 0 liblockdev1 <NOFILES>
-0 0 libexpat1 <NOFILES>
-0 0 mysql-common <NOFILES>
-0 0 xserver-xorg-video-sisusb <NOFILES>
-0 0 libcap1 <NOFILES>
-0 0 libgda2-ruby <NOFILES>
-0 0 scim-gtk2-immodule <NOFILES>
-0 0 xserver-xorg-video-vesa <NOFILES>
-0 0 libxfixes3 <NOFILES>
-0 0 libneon26 <NOFILES>
-0 0 python-dns <NOFILES>
-0 0 mysql-server <NOFILES>
-0 0 libg2c0 <NOFILES>
-0 0 witalian <NOFILES>
-0 0 libavahi-glib1 <NOFILES>
-0 0 gtk2-engines-pixbuf <NOFILES>
-0 0 libm17n-0 <NOFILES>
-0 0 libstlport4.6c2 <NOFILES>
-0 0 liblcms1 <NOFILES>
-0 0 libedit2 <NOFILES>
-0 0 liblog4j1.2-java <NOFILES>
-0 0 gnome-icon-theme <NOFILES>
-0 0 libxp6 <NOFILES>
-0 0 libsamplerate0 <NOFILES>
-0 0 libsdl-image1.2 <NOFILES>
-0 0 mixxx-data <NOFILES>
-0 0 gstreamer0.10-plugins-base <NOFILES>
-0 0 libseda-java <NOFILES>
-0 0 libxres1 <NOFILES>
-0 0 kdemultimedia-kio-plugins <NOFILES>
-0 0 libadns1 <NOFILES>
-0 0 libgnorbagtk0 <NOFILES>
-0 0 fontconfig-config <NOFILES>
-0 0 xserver-xorg-video-nv <NOFILES>
-0 0 libjack0.100.0-0 <NOFILES>
-0 0 firmware-ipw3945 <NOFILES>
-0 0 libdns22 <NOFILES>
-0 0 gaim-data <NOFILES>
-0 0 scim-m17n <NOFILES>
-0 0 netcdf-doc <NOFILES>
-0 0 libgconf2-ruby <NOFILES>
-0 0 libhtree-ruby1.8 <NOFILES>
-0 0 libusb-0.1-4 <NOFILES>
-0 0 r-cran-sm <NOFILES>
-0 0 libmhash2 <NOFILES>
-0 0 libaa1 <NOFILES>
-0 0 libnspr4-0d <NOFILES>
-0 0 libgdbm3 <NOFILES>
-0 0 python-configobj <NOFILES>
-0 0 libwxbase2.6-0 <NOFILES>
-0 0 python-dispatch <NOFILES>
-0 0 libautotrace3 <NOFILES>
-0 0 libiw28 <NOFILES>
-0 0 libpt-plugins-alsa <NOFILES>
-0 0 libnautilus-burn3 <NOFILES>
-0 0 latex-xcolor <NOFILES>
-0 0 xserver-xorg-video-s3virge <NOFILES>
-0 0 python-elementtree <NOFILES>
-0 0 postgresql-doc-7.4 <NOFILES>
-0 0 conglomerate-common <NOFILES>
-0 0 libhdf5-doc <NOFILES>
-0 0 c++-annotations-contrib <NOFILES>
-0 0 libtag1c2a <NOFILES>
-0 0 libgtk-mozembed-ruby <NOFILES>
-0 0 libxml2 <NOFILES>
-0 0 gnome-libs-data <NOFILES>
-0 0 paste-common <NOFILES>
-0 0 freedroidrpg-data <NOFILES>
-0 0 iitalian <NOFILES>
-0 0 libltdl3 <NOFILES>
-0 0 libavahi-client3 <NOFILES>
-0 0 fftw3 <NOFILES>
-0 0 libgfortran1 <NOFILES>
-0 0 libmyspell3c2 <NOFILES>
-0 0 xserver-xorg-video-tga <NOFILES>
-0 0 r-cran-car <NOFILES>
-0 0 python-newt <NOFILES>
-0 0 xserver-xorg-video-ark <NOFILES>
-0 0 libesd0 <NOFILES>
-0 0 openoffice.org <NOFILES>
-0 0 libsdl-net1.2 <NOFILES>
-0 0 libsigc++-2.0-0c2a <NOFILES>
-0 0 python-simplejson <NOFILES>
-0 0 libcdparanoia0 <NOFILES>
-0 0 libglib1.2 <NOFILES>
-0 0 libpopt0 <NOFILES>
-0 0 scribus-ng-doc <NOFILES>
-0 0 libwnck-common <NOFILES>
-0 0 mplayer-skin-blue <NOFILES>
-0 0 libgail-gnome-module <NOFILES>
-0 0 libopenexr2c2a <NOFILES>
-0 0 libsp1c2 <NOFILES>
-0 0 libvdeplug2 <NOFILES>
-0 0 libmodplug0c2 <NOFILES>
-0 0 ttf-opensymbol <NOFILES>
-0 0 libwxgtk2.6-0 <NOFILES>
-0 0 libqscintilla6 <NOFILES>
-0 0 epiphany-extensions <NOFILES>
-0 0 festlex-ifd <NOFILES>
-0 0 libgle3 <NOFILES>
-0 0 libartsc0 <NOFILES>
-0 0 gmt-doc <NOFILES>
-0 0 libdb4.2 <NOFILES>
-0 0 libcairo-ruby <NOFILES>
-0 0 libid3tag0 <NOFILES>
-0 0 libogg0 <NOFILES>
-0 0 libxdmcp6 <NOFILES>
-0 0 python-turbojson <NOFILES>
-0 0 gdb-doc <NOFILES>
-0 0 python-opengl <NOFILES>
-0 0 r-cran-rgl <NOFILES>
-0 0 load-dirs-common <NOFILES>
-0 0 rrootage-data <NOFILES>
-0 0 latex-beamer <NOFILES>
-0 0 r-cran-mgcv <NOFILES>
-0 0 libfs6 <NOFILES>
-0 0 libgtk2.0-common <NOFILES>
-0 0 libxapian13 <NOFILES>
-0 0 libgnome-pilot2 <NOFILES>
-0 0 libx11-data <NOFILES>
-0 0 libdballe-bufrex3 <NOFILES>
-0 0 liblircclient0 <NOFILES>
-0 0 libeel2-2.14 <NOFILES>
-0 0 libxxf86dga1 <NOFILES>
-0 0 linux-patch-gcov <NOFILES>
-0 0 c++-annotations-html <NOFILES>
-0 0 libqt4-qt3support <NOFILES>
-0 0 libanthy0 <NOFILES>
-0 0 python-matplotlib <NOFILES>
-0 0 libxi6 <NOFILES>
-0 0 docbook-doc <NOFILES>
-0 0 liblzo2-2 <NOFILES>
-0 0 r-cran-boot <NOFILES>
-0 0 libiec61883-0 <NOFILES>
-0 0 libisccc30 <NOFILES>
-0 0 libtextwrap1 <NOFILES>
-0 0 libssp0 <NOFILES>
-0 0 libgstreamer0.10-0 <NOFILES>
-0 0 gdm-themes <NOFILES>
-0 0 balder2d-data <NOFILES>
-0 0 libpam0g <NOFILES>
-0 0 debian-archive-keyring <NOFILES>
-0 0 libgdal1-1.3.2-grass <NOFILES>
-0 0 linux-doc-2.6.18 <NOFILES>
-0 0 libgnomeprint2-ruby <NOFILES>
-0 0 hal-info <NOFILES>
-0 0 python-paramiko <NOFILES>
-0 0 linux-manual-2.6.21 <NOFILES>
-0 0 evolution-common <NOFILES>
-0 0 gnome-games-data <NOFILES>
-0 0 xserver-xorg-video-i128 <NOFILES>
-0 0 libqt3-mt <NOFILES>
-0 0 libnids1.21 <NOFILES>
-0 0 festlex-cmu <NOFILES>
-0 0 gdk-imlib11 <NOFILES>
-0 0 python-formencode <NOFILES>
-0 0 at-spi <NOFILES>
-0 0 libpcap0.8 <NOFILES>
-0 0 imlib11 <NOFILES>
-0 0 xserver-xorg-input-mouse <NOFILES>
-0 0 libxdamage1 <NOFILES>
-0 0 bison-doc <NOFILES>
-0 0 libgsm1 <NOFILES>
-0 0 xmms-osd-plugin <NOFILES>
-0 0 compiz <NOFILES>
-0 0 debian-cd <NOFILES>
-0 0 gimp-texturize <NOFILES>
-0 0 ttf-bitstream-vera <NOFILES>
-0 0 libxdelta2 <NOFILES>
-0 0 libgda2-common <NOFILES>
-0 0 libinstrudeo0 <NOFILES>
-0 0 xserver-xorg-video-via <NOFILES>
-0 0 libxrender1 <NOFILES>
-0 0 libavahi-qt3-1 <NOFILES>
-0 0 libloudmouth1-0 <NOFILES>
-0 0 ttf-freefont <NOFILES>
-0 0 c++-annotations-dvi <NOFILES>
-0 0 gstreamer0.10-gnomevfs <NOFILES>
-0 0 libisccfg1 <NOFILES>
-0 0 libuuid1 <NOFILES>
-0 0 libcpufreq0 <NOFILES>
-0 0 libgcj7-jar <NOFILES>
-0 0 xserver-xorg-video-tdfx <NOFILES>
-0 0 iceweasel-l10n-en-gb <NOFILES>
-0 0 libxext6 <NOFILES>
-0 0 libselinux1 <NOFILES>
-0 0 libvcdinfo0 <NOFILES>
-0 0 ipw3945-source <NOFILES>
-0 0 libparted1.7-1 <NOFILES>
-0 0 recode-doc <NOFILES>
-0 0 libcamel1.2-8 <NOFILES>
-0 0 preview-latex-style <NOFILES>
-0 0 iso-codes <NOFILES>
-0 0 apache2 <NOFILES>
-0 0 xfonts-encodings <NOFILES>
-0 0 menu-xdg <NOFILES>
-0 0 cpp-doc <NOFILES>
-0 0 libeel2-data <NOFILES>
-0 0 libgtkmm1.2-0c2a <NOFILES>
-0 0 libgcj-bc <NOFILES>
-0 0 libexif12 <NOFILES>
-0 0 libgsmme1c2a <NOFILES>
-0 0 gnuplot <NOFILES>
-0 0 libglitz1 <NOFILES>
-0 0 liblink-grammar4 <NOFILES>
-0 0 libxmuu1 <NOFILES>
-0 0 libflash0c2 <NOFILES>
-0 0 python-pastedeploy <NOFILES>
-0 0 libgtk1.2-common <NOFILES>
-0 0 libpt-1.10.0 <NOFILES>
-0 0 libneon25 <NOFILES>
-0 0 gfortran-doc <NOFILES>
-0 0 python-tz <NOFILES>
-0 0 libatk1.0-0 <NOFILES>
-0 0 liborbit0 <NOFILES>
-0 0 kamera <NOFILES>
-0 0 libxml++2.6-2 <NOFILES>
-0 0 libidl0 <NOFILES>
-0 0 build-essential <NOFILES>
-0 0 libxrandr2 <NOFILES>
-0 0 libxslt1.1 <NOFILES>
-0 0 libdns32 <NOFILES>
-0 0 libgnome-keyring0 <NOFILES>
-0 0 libsigc++-1.2-5c2 <NOFILES>
-0 0 libguile-ltdl-1 <NOFILES>
-0 0 gamin <NOFILES>
-0 0 bzrtools <NOFILES>
-0 0 python-wxgtk2.6 <NOFILES>
-0 0 apache2-doc <NOFILES>
-0 0 libnm-glib0 <NOFILES>
-0 0 xserver-xorg-video-apm <NOFILES>
-0 0 texlive-pstricks <NOFILES>
-0 0 libgail17 <NOFILES>
-0 0 libk3b2 <NOFILES>
-0 0 python-all-dev <NOFILES>
-0 0 libksba8 <NOFILES>
-0 0 libsdl-ttf2.0-0 <NOFILES>
-0 0 libboost-filesystem1.33.1 <NOFILES>
-0 0 libpisync0 <NOFILES>
-0 0 python2.4-examples <NOFILES>
-0 0 libgnomeui-common <NOFILES>
-0 0 libexif-ruby <NOFILES>
-0 0 libgnomeprintui2.2-0 <NOFILES>
-0 0 libstdc++6 <NOFILES>
-0 0 gnome-backgrounds <NOFILES>
-0 0 libxxf86misc1 <NOFILES>
-0 0 libedata-cal1.2-5 <NOFILES>
-0 0 libdiscover1 <NOFILES>
-0 0 libbind9-0 <NOFILES>
-0 0 libquicktime0 <NOFILES>
-0 0 totem <NOFILES>
-0 0 iceweasel-torbutton <NOFILES>
-0 0 r-cran-zoo <NOFILES>
-0 0 iamerican <NOFILES>
-0 0 libisc32 <NOFILES>
-0 0 dict-jargon <NOFILES>
-0 0 python-turbokid <NOFILES>
-0 0 libpoppler0c2 <NOFILES>
-0 0 app-install-data <NOFILES>
-0 0 r-cran-survival <NOFILES>
-0 0 libhdf5-serial-1.6.5-0 <NOFILES>
-0 0 libqt4-sql <NOFILES>
-0 0 gstreamer0.10-alsa <NOFILES>
-0 0 zlib1g <NOFILES>
-0 0 python-mapscript <NOFILES>
-0 0 libatspi1.0-0 <NOFILES>
-0 0 libcairo2 <NOFILES>
-0 0 libungif4g <NOFILES>
-0 0 gnome-desktop-environment <NOFILES>
-0 0 libgtkhtml2-0 <NOFILES>
-0 0 libglibmm-2.4-1c2a <NOFILES>
-0 0 libswt-gtk-3.2-jni <NOFILES>
-0 0 libgtkglext1 <NOFILES>
-0 0 libjpeg62 <NOFILES>
-0 0 gtkhtml3.8 <NOFILES>
-0 0 xfonts-75dpi <NOFILES>
-0 0 python-pyrss2gen <NOFILES>
-0 0 r-cran-multcomp <NOFILES>
-0 0 php5-mapscript <NOFILES>
-0 0 libdballe-core-doc <NOFILES>
-0 0 libfontconfig1 <NOFILES>
-0 0 php5-gd <NOFILES>
-0 0 libidn11 <NOFILES>
-0 0 libgdl-1-common <NOFILES>
-0 0 libavahi-compat-howl0 <NOFILES>
-0 0 xulrunner-gnome-support <NOFILES>
-0 0 libgnomeprintui2-ruby <NOFILES>
-0 0 cupsys-common <NOFILES>
-0 0 libgdk-pixbuf2 <NOFILES>
-0 0 libhal-storage1 <NOFILES>
-0 0 libisccfg30 <NOFILES>
-0 0 libnewt0.52 <NOFILES>
-0 0 libchm1 <NOFILES>
-0 0 libao2 <NOFILES>
-0 0 libacl1 <NOFILES>
-0 0 libhdf4g <NOFILES>
-0 0 doc-debian <NOFILES>
-0 0 libedata-book1.2-2 <NOFILES>
-0 0 blt <NOFILES>
-0 0 emacsen-common <NOFILES>
-0 0 libdbus-qt-1-1c2 <NOFILES>
-0 0 libnetpbm10 <NOFILES>
-0 0 python-deb822 <NOFILES>
-0 0 hicolor-icon-theme <NOFILES>
-0 0 libboost-dev <NOFILES>
-0 0 libc6-i386 <NOFILES>
-0 0 wormux-data <NOFILES>
-0 0 libservlet2.4-java <NOFILES>
-0 0 libgc1c2 <NOFILES>
-0 0 libswt-gtk-3.2-java <NOFILES>
-0 0 dict-gcide <NOFILES>
-0 0 libdballe-core3 <NOFILES>
-0 0 dict-moby-thesaurus <NOFILES>
-0 0 libxerces27-dev <NOFILES>
-0 0 libavahi-common-data <NOFILES>
-0 0 libgtksourceview1-ruby <NOFILES>
-0 0 libbz2-1.0 <NOFILES>
-0 0 grub-doc <NOFILES>
-0 0 xserver-xorg-video-i810 <NOFILES>
-0 0 gsfonts <NOFILES>
-0 0 libgd2-xpm <NOFILES>
-0 0 libgutenprintui2-1 <NOFILES>
-0 0 libegroupwise1.2-10 <NOFILES>
-0 0 refblas3 <NOFILES>
-0 0 autotools-dev <NOFILES>
-0 0 libart2 <NOFILES>
-0 0 docbook <NOFILES>
-0 0 r-cran-rpart <NOFILES>
-0 0 texpower-manual <NOFILES>
-0 0 python-pexpect <NOFILES>
-0 0 liborbit2 <NOFILES>
-0 0 librpcsecgss3 <NOFILES>
-0 0 libnet6-1.3-0 <NOFILES>
-0 0 rubybook <NOFILES>
-0 0 python-soappy <NOFILES>
-0 0 make-doc <NOFILES>
-0 0 libssl0.9.8 <NOFILES>
-0 0 libdbus-1-3 <NOFILES>
-0 0 adept <NOFILES>
-0 0 libgl1-mesa-glx <NOFILES>
-0 0 ttf-arphic-uming <NOFILES>
-0 0 ceferino-data <NOFILES>
-0 0 libglade2-0 <NOFILES>
-0 0 texlive-generic-extra <NOFILES>
-0 0 libicu36 <NOFILES>
-0 0 myspell-it <NOFILES>
-0 0 vim-doc <NOFILES>
-0 0 libglu1-xorg-dev <NOFILES>
-0 0 libtdb1 <NOFILES>
-0 0 libarts1-akode <NOFILES>
-0 0 xserver-xorg-video-siliconmotion <NOFILES>
-0 0 openoffice.org-thesaurus-it <NOFILES>
-0 0 capplets-data <NOFILES>
-0 0 gsfonts-x11 <NOFILES>
-0 0 python-wxversion <NOFILES>
-0 0 dballe-common <NOFILES>
-0 0 ipw3945-modules-2.6.20.1enrico <NOFILES>
-0 0 r-recommended <NOFILES>
-0 0 libgrib0 <NOFILES>
-0 0 libxxf86vm1 <NOFILES>
-0 0 libavc1394-0 <NOFILES>
-0 0 gfortran-4.1-doc <NOFILES>
-0 0 libgnome-desktop-2 <NOFILES>
-0 0 system-tools-backends <NOFILES>
-0 0 libpcap-dev <NOFILES>
-0 0 mplayer-doc <NOFILES>
-0 0 libsqlite0 <NOFILES>
-0 0 gutenprint-locales <NOFILES>
-0 0 r-cran-lmtest <NOFILES>
-0 0 librpm4 <NOFILES>
-0 0 libopencdk8 <NOFILES>
-0 0 xserver-xorg-video-chips <NOFILES>
-0 0 dict-foldoc <NOFILES>
-0 0 cgi-mapserver <NOFILES>
-0 0 libperl5.8 <NOFILES>
-END-POPULARITY-CONTEST-0 TIME:1181000000
diff --git a/ept/test-main.h b/ept/test-main.h
deleted file mode 100644
index 7b2afbc..0000000
--- a/ept/test-main.h
+++ /dev/null
@@ -1,186 +0,0 @@
-// -*- C++ -*-
-#include <unistd.h>
-#include <sys/wait.h>
-
-struct Main {
-
-    int suite, test;
-    int status[2];
-    int confirm[2];
-    FILE *f_confirm, *f_status;
-    pid_t pid;
-    int argc;
-    char **argv;
-    pid_t finished;
-    int status_code;
-    int test_ok;
-
-    int suite_ok, suite_failed;
-    int total_ok, total_failed;
-
-    int announced_suite;
-    std::string current;
-
-    RunAll all;
-
-    Main() : suite(0), test(0) {
-        suite_ok = suite_failed = 0;
-        total_ok = total_failed = 0;
-        test_ok = 0;
-        announced_suite = -1;
-    }
-
-    void child() {
-        close( status[0] );
-        close( confirm[1] );
-        all.status = fdopen( status[1], "w" );
-        all.confirm = fdopen( confirm[0], "r" );
-        if ( argc > 1 ) {
-            RunSuite *s = all.findSuite( argv[1] );
-            if (!s) {
-                std::cerr << "No such suite " << argv[1] << std::endl;
-                // todo dump possible suites?
-                exit(250);
-            }
-            all.runSuite( *s, test, 0, 1 );
-        }
-        if ( argc == 1 ) {
-            all.runFrom( suite, test );
-        }
-        fprintf( all.status, "done\n" );
-        exit( 0 );
-    }
-
-    void testDied()
-    {
-        /* std::cerr << "test died: " << test << "/"
-           << suites[suite].testCount << std::endl; */
-        if ( WIFEXITED( status_code ) ) {
-            if ( WEXITSTATUS( status_code ) == 250 )
-                exit( 3 );
-            if ( WEXITSTATUS( status_code ) == 0 )
-                return;
-        }
-        std::cout << "failed test: "<< current;
-        if ( WIFEXITED( status_code ) )
-            std::cout << " (exit status " << WEXITSTATUS( status_code ) << ")";
-        if ( WIFSIGNALED( status_code ) )
-            std::cout << " (caught signal " << WTERMSIG( status_code ) << ")";
-        std::cout << std::endl;
-        // re-announce the suite
-        announced_suite --;
-        ++ test; // continue with next test
-        test_ok = 0;
-        suite_failed ++;
-    }
-
-    void processStatus( const char *line ) {
-        if ( std::string("done") == line ) { // finished
-            finished = waitpid( pid, &status_code, 0 );
-            assert_eq( pid, finished );
-            assert( WIFEXITED( status_code ) );
-            assert_eq( WEXITSTATUS( status_code ), 0 );
-            std::cout << "overall " << total_ok << "/"
-                      << total_ok + total_failed
-                      << " ok" << std::endl;
-            exit( total_failed == 0 ? 0 : 1 );
-        }
-
-        if ( test_ok ) {
-            /* std::cerr << "test ok: " << test << "/"
-               << suites[suite].testCount << std::endl; */
-            std::cout << "." << std::flush;
-            suite_ok ++;
-            ++ test;
-            test_ok = 0;
-        }
-
-        if ( line[0] == 's' ) {
-            if ( line[2] == 'd' ) {
-                std::cout << " " << suite_ok << "/" << suite_ok + suite_failed
-                          << " ok" << std::endl;
-                ++ suite; test = 0;
-                assert( !test_ok );
-                total_ok += suite_ok;
-                total_failed += suite_failed;
-                suite_ok = suite_failed = 0;
-            }
-            if ( line[2] == 's' ) {
-                if ( announced_suite < suite ) {
-                    std::cout << line + 5 << ": " << std::flush;
-                    announced_suite = suite;
-                }
-            }
-        }
-        if ( line[0] == 't' ) {
-            if ( line[2] == 'd' ) {
-                fprintf( f_confirm, "ack\n" );
-                fflush( f_confirm );
-                test_ok = 1;
-            }
-            if ( line[2] == 's' ) {
-                fprintf( f_confirm, "ack\n" );
-                fflush( f_confirm );
-                current = line + 5;
-            }
-        }
-    }
-
-    void parent() {
-        close( status[1] );
-        close( confirm[0] );
-        f_status = fdopen( status[0], "r" );
-        f_confirm = fdopen( confirm[1], "w" );
-        char *line = 0;
-        size_t n;
-
-        while ( true ) {
-            if ( getline( &line, &n, f_status ) < 0 ) {
-                finished = waitpid( pid, &status_code, 0 );
-                if ( finished < 0 ) {
-                    perror( "waitpid failed" );
-                    exit( 5 );
-                }
-                assert_eq( pid, finished );
-                testDied();
-                /* std::cerr << "child will be reforked at: "
-                   << suite << " " << test << std::endl; */
-                return;
-            } else {
-                // std::cerr << "reading pipe: " << line;
-                line[ strlen( line ) - 1 ] = 0;
-                processStatus( line );
-                free( line );
-            }
-            line = 0;
-        }
-    }
-
-    int main( int _argc, char **_argv )
-    {
-        argc = _argc;
-        argv = _argv;
-
-        all.suiteCount = sizeof(suites)/sizeof(RunSuite);
-        all.suites = suites;
-
-        while (true) {
-            if ( pipe( status ) )
-                return 1;
-            if ( pipe( confirm ) )
-                return 1;
-            pid = fork();
-            if ( pid < 0 )
-                return 2;
-            if ( pid == 0 ) { // child
-                child();
-            } else {
-                parent();
-            }
-        }
-    }
-};
-
-int main( int argc, char **argv ) {
-    return Main().main( argc, argv );
-}
diff --git a/ept/test-runner.h b/ept/test-runner.h
deleted file mode 100644
index 8fe4d12..0000000
--- a/ept/test-runner.h
+++ /dev/null
@@ -1,63 +0,0 @@
-#include <unistd.h>
-
-#define RUN(x, y) x().y()
-
-struct RunTest {
-    const char *name;
-    void (*run)();
-};
-
-struct RunSuite {
-    const char *name;
-    RunTest *tests;
-    int testCount;
-};
-
-struct RunAll {
-    RunSuite *suites;
-    int suiteCount;
-    FILE *status, *confirm;
-
-    RunSuite *findSuite( std::string name ) {
-        for ( int i = 0; i < suiteCount; ++i )
-            if ( suites[i].name == name )
-                return suites + i;
-        return 0;
-    }
-
-    void waitForAck() {
-        size_t n = 0; char *line = 0;
-        size_t read = getline( &line, &n, confirm );
-        assert_eq( read, 4 );
-        assert_eq( std::string( "ack\n" ), line );
-        free( line );
-    }
-
-    void runSuite( RunSuite &s, int fromTest, int suite, int suiteCount )
-    {
-        fprintf( status, "s/s: (%d/%d) %s\n", suite + 1, suiteCount, s.name );
-        for ( int i = fromTest; i < s.testCount; ++i ) {
-            fprintf( status, "t/s: (%d/%d) %s\n", i, s.testCount,
-                     s.tests[i].name );
-            fflush( status );
-            waitForAck();
-            s.tests[i].run();
-            fprintf( status, "t/d: %s\n", s.tests[i].name );
-            fflush( status );
-            waitForAck();
-            // exit( 0 ); // TODO make this optional; safety vs
-                       // performance tradeoff
-        }
-        fprintf( status, "s/d: %s\n", s.name );
-    }
-
-    void runFrom( int suite, int test )
-    {
-        for ( int i = suite; i < suiteCount; ++i ) {
-            assert( suite <= suiteCount );
-            runSuite( suites[i], test, i, suiteCount );
-            test = 0;
-        }
-    }
-};
-
diff --git a/ept/test.h b/ept/test.h
index fc29ed6..e0b8d20 100644
--- a/ept/test.h
+++ b/ept/test.h
@@ -1,8 +1,8 @@
-//#include <ept/core/apt.h>
-#include <ept/config.h>
-
-#include <wibble/test.h>
+#ifndef EPT_TEST_H
+#define EPT_TEST_H
 
+#include <ept/utils/tests.h>
+#include <ept/config.h>
 #include <apt-pkg/pkgcache.h>
 #include <apt-pkg/sourcelist.h>
 #include <apt-pkg/error.h>
@@ -13,29 +13,6 @@
 #include <apt-pkg/init.h>
 #include <cstdlib>
 
-
-#ifndef EPT_TEST_H
-#define EPT_TEST_H
-
-struct AptTestEnvironment {
-    //ept::core::AptDatabase db;
-    AptTestEnvironment() {
-        pkgInitConfig (*_config);
-        _config->Set("Initialized", 1);
-        _config->Set("Dir", TEST_ENV_DIR);
-        _config->Set("Dir::Cache", "cache");
-        _config->Set("Dir::State", "state");
-        _config->Set("Dir::Etc", "etc");
-        _config->Set("Dir::Etc::sourcelist", "sources.list");
-        _config->Set("Dir::State::status", TEST_ENV_DIR "dpkg-status");
-        pkgInitSystem (*_config, _system);
-    }
-};
-
-struct DebtagsTestEnvironment : AptTestEnvironment {
-    DebtagsTestEnvironment() {}
-};
-
 struct EnvOverride
 {
     const char* name;
diff --git a/ept/token.h b/ept/token.h
deleted file mode 100644
index ecacc16..0000000
--- a/ept/token.h
+++ /dev/null
@@ -1,55 +0,0 @@
-// -*- C++ -*-
-#include <wibble/mixin.h>
-#include <string>
-
-#ifndef EPT_TOKEN_H
-#define EPT_TOKEN_H
-
-namespace ept {
-
-struct Token : wibble::mixin::Comparable< Token > {
-    std::string _id; // formatted as package[_version]
-    std::string id() const { return _id; }
-
-    Token() : _id( "" ) {}
-    Token( std::string s ) : _id( s ) {}
-
-    std::string version() const {
-        return _id.find( '_' ) == std::string::npos ? "" :
-            std::string( _id, _id.find( '_' ) + 1, _id.size() );
-    }
-
-    std::string package() const {
-        return std::string( _id, 0,
-                            _id.find( '_' ) == std::string::npos ?
-                            _id.size() : _id.find( '_' ) );
-    }
-
-    bool isDesktop() const {
-        return std::string( _id, 0, 8 ) == "desktop:";
-    }
-
-    std::string desktop() const {
-        return isDesktop() ? std::string( _id, 8, _id.size() ) : "";
-    }
-
-    bool hasVersion() const {
-        return version() != "";
-    }
-
-    bool valid() const {
-        return _id != "";
-    }
-
-    bool operator<=( const Token &o ) const {
-        return _id <= o._id;
-    }
-};
-
-}
-
-inline std::ostream &operator<<( std::ostream &o, const ept::Token &t ) {
-    return o << t.id();
-}
-
-#endif
diff --git a/ept/utils/string.cc b/ept/utils/string.cc
new file mode 100644
index 0000000..95d24fd
--- /dev/null
+++ b/ept/utils/string.cc
@@ -0,0 +1,437 @@
+#include "string.h"
+#include <vector>
+
+using namespace std;
+
+namespace ept {
+namespace str {
+
+std::string basename(const std::string& pathname)
+{
+    size_t pos = pathname.rfind("/");
+    if (pos == std::string::npos)
+        return pathname;
+    else
+        return pathname.substr(pos+1);
+}
+
+std::string dirname(const std::string& pathname)
+{
+    if (pathname.empty()) return ".";
+
+    // Skip trailing separators
+    size_t end = pathname.size();
+    while (end > 0 && pathname[end - 1] == '/')
+        --end;
+
+    // If the result is empty again, then the string was only / characters
+    if (!end) return "/";
+
+    // Find the previous separator
+    end = pathname.rfind("/", end - 1);
+
+    if (end == std::string::npos)
+        // No previous separator found, everything should be chopped
+        return std::string(".");
+    else
+    {
+        while (end > 0 && pathname[end - 1] == '/')
+            --end;
+        if (!end) return "/";
+        return pathname.substr(0, end);
+    }
+}
+
+void appendpath(std::string& dest, const char* path2)
+{
+    if (!*path2)
+        return;
+
+    if (dest.empty())
+    {
+        dest = path2;
+        return;
+    }
+
+    if (dest[dest.size() - 1] == '/')
+        if (path2[0] == '/')
+            dest += (path2 + 1);
+        else
+            dest += path2;
+    else
+        if (path2[0] == '/')
+            dest += path2;
+        else
+        {
+            dest += '/';
+            dest += path2;
+        }
+}
+
+void appendpath(std::string& dest, const std::string& path2)
+{
+    if (path2.empty())
+        return;
+
+    if (dest.empty())
+    {
+        dest = path2;
+        return;
+    }
+
+    if (dest[dest.size() - 1] == '/')
+        if (path2[0] == '/')
+            dest += path2.substr(1);
+        else
+            dest += path2;
+    else
+        if (path2[0] == '/')
+            dest += path2;
+        else
+        {
+            dest += '/';
+            dest += path2;
+        }
+}
+
+std::string joinpath(const std::string& path1, const std::string& path2)
+{
+    string res = path1;
+    appendpath(res, path2);
+    return res;
+}
+
+std::string normpath(const std::string& pathname)
+{
+    vector<string> st;
+    if (pathname[0] == '/')
+        st.push_back("/");
+
+    Split split(pathname, "/");
+    for (const auto& i: split)
+    {
+        if (i == "." || i.empty()) continue;
+        if (i == "..")
+            if (st.back() == "..")
+                st.emplace_back(i);
+            else if (st.back() == "/")
+                continue;
+            else
+                st.pop_back();
+        else
+            st.emplace_back(i);
+    }
+
+    if (st.empty())
+        return ".";
+
+    string res;
+    for (const auto& i: st)
+        appendpath(res, i);
+    return res;
+}
+
+Split::const_iterator::const_iterator(const Split& split)
+    : split(&split)
+{
+    // Ignore leading separators if skip_end is true
+    if (split.skip_empty) skip_separators();
+    ++*this;
+}
+
+Split::const_iterator::~const_iterator()
+{
+}
+
+std::string Split::const_iterator::remainder() const
+{
+    if (end == std::string::npos)
+        return std::string();
+    else
+        return split->str.substr(end);
+};
+
+void Split::const_iterator::skip_separators()
+{
+    const std::string& str = split->str;
+    const std::string& sep = split->sep;
+
+    while (end + sep.size() <= str.size())
+    {
+        unsigned i = 0;
+        for ( ; i < sep.size(); ++i)
+            if (str[end + i] != sep[i])
+                break;
+        if (i < sep.size())
+            break;
+        else
+            end += sep.size();
+    }
+}
+
+Split::const_iterator& Split::const_iterator::operator++()
+{
+    if (!split) return *this;
+
+    const std::string& str = split->str;
+    const std::string& sep = split->sep;
+    bool skip_empty = split->skip_empty;
+
+    /// Convert into an end iterator
+    if (end == std::string::npos)
+    {
+        split = nullptr;
+        return *this;
+    }
+
+    /// The string ended with an iterator, and we do not skip empty tokens:
+    /// return it
+    if (end == str.size())
+    {
+        cur = string();
+        end = std::string::npos;
+        return *this;
+    }
+
+    /// Position of the first character past the token that starts at 'end'
+    size_t tok_end;
+    if (sep.empty())
+        /// If separator is empty, advance one character at a time
+        tok_end = end + 1;
+    else
+    {
+        /// The token ends at the next separator
+        tok_end = str.find(sep, end);
+    }
+
+    /// No more separators found, return from end to the end of the string
+    if (tok_end == std::string::npos)
+    {
+        cur = str.substr(end);
+        end = std::string::npos;
+        return *this;
+    }
+
+    /// We have the boundaries of the current token
+    cur = str.substr(end, tok_end - end);
+
+    /// Skip the separator
+    end = tok_end + sep.size();
+
+    /// Skip all the following separators if skip_empty is true
+    if (skip_empty)
+    {
+        skip_separators();
+        if (end == str.size())
+        {
+            end = std::string::npos;
+            return *this;
+        }
+    }
+
+    return *this;
+}
+
+const std::string& Split::const_iterator::operator*() const { return cur; }
+const std::string* Split::const_iterator::operator->() const { return &cur; }
+
+bool Split::const_iterator::operator==(const const_iterator& ti) const
+{
+    if (!split && !ti.split) return true;
+    if (split != ti.split) return false;
+    return end == ti.end;
+}
+
+bool Split::const_iterator::operator!=(const const_iterator& ti) const
+{
+    if (!split && !ti.split) return false;
+    if (split != ti.split) return true;
+    return end != ti.end;
+}
+
+
+std::string encode_cstring(const std::string& str)
+{
+    string res;
+    for (string::const_iterator i = str.begin(); i != str.end(); ++i)
+        if (*i == '\n')
+            res += "\\n";
+        else if (*i == '\t')
+            res += "\\t";
+        else if (*i == 0 || iscntrl(*i))
+        {
+            char buf[5];
+            snprintf(buf, 5, "\\x%02x", (unsigned int)*i);
+            res += buf;
+        }
+        else if (*i == '"' || *i == '\\')
+        {
+            res += "\\";
+            res += *i;
+        }
+        else
+            res += *i;
+    return res;
+}
+
+std::string decode_cstring(const std::string& str, size_t& lenParsed)
+{
+    string res;
+    string::const_iterator i = str.begin();
+    for ( ; i != str.end() && *i != '"'; ++i)
+        if (*i == '\\' && (i+1) != str.end())
+        {
+            switch (*(i+1))
+            {
+                case 'n': res += '\n'; break;
+                case 't': res += '\t'; break;
+                case 'x': {
+                              size_t j;
+                              char buf[5] = "0x\0\0";
+                              // Read up to 2 extra hex digits
+                              for (j = 0; j < 2 && i+2+j != str.end() && isxdigit(*(i+2+j)); ++j)
+                                  buf[2+j] = *(i+2+j);
+                              i += j;
+                              res += (char)atoi(buf);
+                              break;
+                          }
+                default:
+                          res += *(i+1);
+                          break;
+            }
+            ++i;
+        } else
+            res += *i;
+    if (i != str.end() && *i == '"')
+        ++i;
+    lenParsed = i - str.begin();
+    return res;
+}
+
+std::string encode_url(const std::string& str)
+{
+    string res;
+    for (string::const_iterator i = str.begin(); i != str.end(); ++i)
+    {
+        if ( (*i >= '0' && *i <= '9') || (*i >= 'A' && *i <= 'Z')
+          || (*i >= 'a' && *i <= 'z') || *i == '-' || *i == '_'
+          || *i == '!' || *i == '*' || *i == '\'' || *i == '(' || *i == ')')
+            res += *i;
+        else {
+            char buf[4];
+            snprintf(buf, 4, "%%%02x", static_cast<unsigned>(static_cast<unsigned char>(*i)));
+            res += buf;
+        }
+    }
+    return res;
+}
+
+std::string decode_url(const std::string& str)
+{
+    string res;
+    for (size_t i = 0; i < str.size(); ++i)
+    {
+        if (str[i] == '%')
+        {
+            // If there's a partial %something at the end, ignore it
+            if (i >= str.size() - 2)
+                return res;
+            res += static_cast<char>(strtoul(str.substr(i+1, 2).c_str(), 0, 16));
+            i += 2;
+        }
+        else
+            res += str[i];
+    }
+    return res;
+}
+
+static const char* base64 = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+
+template<typename T>
+static const char invbase64(const T& idx)
+{
+    static const char data[] = {62,0,0,0,63,52,53,54,55,56,57,58,59,60,61,0,0,0,0,0,0,0,0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,0,0,0,0,0,0,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51};
+    if (idx < 43) return 0;
+    if (static_cast<unsigned>(idx) > 43 + (sizeof(data)/sizeof(data[0]))) return 0;
+    return data[idx - 43];
+}
+
+std::string encode_base64(const std::string& str)
+{
+    std::string res;
+
+    for (size_t i = 0; i < str.size(); i += 3)
+    {
+        // Pack every triplet into 24 bits
+        unsigned int enc;
+        if (i + 3 < str.size())
+            enc = ((unsigned char)str[i] << 16) | ((unsigned char)str[i + 1] << 8) | (unsigned char)str[i + 2];
+        else
+        {
+            enc = ((unsigned char)str[i] << 16);
+            if (i + 1 < str.size())
+                enc |= (unsigned char)str[i + 1] << 8;
+            if (i + 2 < str.size())
+                enc |= (unsigned char)str[i + 2];
+        }
+
+        // Divide in 4 6-bit values and use them as indexes in the base64 char
+        // array
+        for (int j = 18; j >= 0; j -= 6)
+            res += base64[(enc >> j) & 63];
+    }
+
+    // Replace padding characters with '='
+    if (str.size() % 3)
+        for (size_t i = 0; i < 3 - (str.size() % 3); ++i)
+            res[res.size() - i - 1] = '=';
+
+    return res;
+}
+
+std::string decode_base64(const std::string& str)
+{
+    std::string res;
+
+    for (size_t i = 0; i < str.size(); i += 4)
+    {
+        // Pack every quadruplet into 24 bits
+        unsigned int enc;
+        if (i+4 < str.size())
+        {
+            enc = (invbase64(str[i]) << 18)
+                + (invbase64(str[i+1]) << 12)
+                + (invbase64(str[i+2]) << 6)
+                + (invbase64(str[i+3]));
+        } else {
+            enc = (invbase64(str[i]) << 18);
+            if (i+1 < str.size())
+                enc += (invbase64(str[i+1]) << 12);
+            if (i+2 < str.size())
+                enc += (invbase64(str[i+2]) << 6);
+            if (i+3 < str.size())
+                enc += (invbase64(str[i+3]));
+        }
+
+        // Divide in 3 8-bit values and append them to the result
+        res += enc >> 16 & 0xff;
+        res += enc >> 8 & 0xff;
+        res += enc & 0xff;
+    }
+
+    // Remove trailing padding
+    if (str.size() > 0)
+        for (size_t i = str.size() - 1; str[i] == '='; --i)
+        {
+            if (res.size() > 0)
+                res.resize(res.size() - 1);
+            if (i == 0 || res.size() == 0 )
+                break;
+        }
+
+    return res;
+}
+
+
+}
+}
diff --git a/ept/utils/string.h b/ept/utils/string.h
new file mode 100644
index 0000000..5988365
--- /dev/null
+++ b/ept/utils/string.h
@@ -0,0 +1,301 @@
+#ifndef EPT_STRING_H
+#define EPT_STRING_H
+
+/**
+ * @author Enrico Zini <enrico@enricozini.org>
+ * @brief String functions
+ *
+ * Copyright (C) 2007--2015  Enrico Zini <enrico@debian.org>
+ */
+
+#include <string>
+#include <functional>
+#include <sstream>
+#include <cctype>
+
+namespace ept {
+namespace str {
+
+/// Check if a string starts with the given substring
+inline bool startswith(const std::string& str, const std::string& part)
+{
+    if (str.size() < part.size())
+        return false;
+    return str.substr(0, part.size()) == part;
+}
+
+/// Check if a string ends with the given substring
+inline bool endswith(const std::string& str, const std::string& part)
+{
+    if (str.size() < part.size())
+        return false;
+    return str.substr(str.size() - part.size()) == part;
+}
+
+/**
+ * Stringify and join a sequence of objects
+ */
+template<typename ITER>
+std::string join(const std::string& sep, const ITER& begin, const ITER& end)
+{
+    std::stringstream res;
+    bool first = true;
+    for (ITER i = begin; i != end; ++i)
+    {
+        if (first)
+            first = false;
+        else
+            res << sep;
+        res << *i;
+    }
+    return res.str();
+}
+
+/**
+ * Stringify and join an iterable container
+ */
+template<typename ITEMS>
+std::string join(const std::string& sep, const ITEMS& items)
+{
+    std::stringstream res;
+    bool first = true;
+    for (const auto& i: items)
+    {
+        if (first)
+            first = false;
+        else
+            res << sep;
+        res << i;
+    }
+    return res.str();
+}
+
+/**
+ * Return the substring of 'str' without all leading characters for which
+ * 'classifier' returns true.
+ */
+template<typename FUN>
+inline std::string lstrip(const std::string& str, const FUN& classifier)
+{
+    if (str.empty())
+        return str;
+
+    size_t beg = 0;
+    while (beg < str.size() && classifier(str[beg]))
+        ++beg;
+
+    return str.substr(beg, str.size() - beg + 1);
+}
+
+/**
+ * Return the substring of 'str' without all leading spaces.
+ */
+inline std::string lstrip(const std::string& str)
+{
+    return lstrip(str, ::isspace);
+}
+
+/**
+ * Return the substring of 'str' without all trailing characters for which
+ * 'classifier' returns true.
+ */
+template<typename FUN>
+inline std::string rstrip(const std::string& str, const FUN& classifier)
+{
+    if (str.empty())
+        return str;
+
+    size_t end = str.size();
+    while (end > 0 && classifier(str[end - 1]))
+        --end;
+
+    if (end == 0)
+        return std::string();
+    else
+        return str.substr(0, end);
+}
+
+/**
+ * Return the substring of 'str' without all trailing spaces.
+ */
+inline std::string rstrip(const std::string& str)
+{
+    return rstrip(str, ::isspace);
+}
+
+/**
+ * Return the substring of 'str' without all leading and trailing characters
+ * for which 'classifier' returns true.
+ */
+template<typename FUN>
+inline std::string strip(const std::string& str, const FUN& classifier)
+{
+    if (str.empty())
+        return str;
+
+    size_t beg = 0;
+    size_t end = str.size() - 1;
+    while (beg < end && classifier(str[beg]))
+        ++beg;
+    while (end >= beg && classifier(str[end]))
+        --end;
+
+    return str.substr(beg, end-beg+1);
+}
+
+/**
+ * Return the substring of 'str' without all leading and trailing spaces.
+ */
+inline std::string strip(const std::string& str)
+{
+    return strip(str, ::isspace);
+}
+
+/// Return an uppercased copy of str
+inline std::string upper(const std::string& str)
+{
+    std::string res;
+    res.reserve(str.size());
+    for (std::string::const_iterator i = str.begin(); i != str.end(); ++i)
+        res += ::toupper(*i);
+    return res;
+}
+
+/// Return a lowercased copy of str
+inline std::string lower(const std::string& str)
+{
+    std::string res;
+    res.reserve(str.size());
+    for (std::string::const_iterator i = str.begin(); i != str.end(); ++i)
+        res += ::tolower(*i);
+    return res;
+}
+
+/// Given a pathname, return the file name without its path
+std::string basename(const std::string& pathname);
+
+/// Given a pathname, return the directory name without the file name
+std::string dirname(const std::string& pathname);
+
+/// Append path2 to path1, adding slashes when appropriate
+void appendpath(std::string& dest, const char* path2);
+
+/// Append path2 to path1, adding slashes when appropriate
+void appendpath(std::string& dest, const std::string& path2);
+
+/// Append an arbitrary number of path components to \a dest
+template<typename S1, typename S2, typename... Args>
+void appendpath(std::string& dest, S1 first, S2 second, Args... next)
+{
+    appendpath(dest, first);
+    appendpath(dest, second, next...);
+}
+
+/// Join two or more paths, adding slashes when appropriate
+template<typename... Args>
+std::string joinpath(Args... components)
+{
+    std::string res;
+    appendpath(res, components...);
+    return res;
+}
+
+/**
+ * Normalise a pathname.
+ *
+ * For example, A//B, A/./B and A/foo/../B all become A/B.
+ */
+std::string normpath(const std::string& pathname);
+
+/**
+ * Split a string where a given substring is found
+ *
+ * This does a similar work to the split functions of perl, python and ruby.
+ *
+ * Example code:
+ * \code
+ *   str::Split splitter(my_string, "/");
+ *   vector<string> split;
+ *   std::copy(splitter.begin(), splitter.end(), back_inserter(split));
+ * \endcode
+ */
+struct Split
+{
+    /// String to split
+    std::string str;
+    /// Separator
+    std::string sep;
+    /**
+     * If true, skip empty tokens, effectively grouping consecutive separators
+     * as if they were a single one
+     */
+    bool skip_empty;
+
+    Split(const std::string& str, const std::string& sep, bool skip_empty=false)
+        : str(str), sep(sep), skip_empty(skip_empty) {}
+
+    class const_iterator : public std::iterator<std::input_iterator_tag, std::string>
+    {
+    protected:
+        const Split* split = nullptr;
+        /// Current token
+        std::string cur;
+        /// Position of the first character of the next token
+        size_t end = 0;
+
+        /// Move end past all the consecutive separators that start at its position
+        void skip_separators();
+
+    public:
+        /// Begin iterator
+        const_iterator(const Split& split);
+        /// End iterator
+        const_iterator() {}
+        ~const_iterator();
+
+        const_iterator& operator++();
+        const std::string& operator*() const;
+        const std::string* operator->() const;
+
+        std::string remainder() const;
+
+        bool operator==(const const_iterator& ti) const;
+        bool operator!=(const const_iterator& ti) const;
+    };
+
+    /// Return the begin iterator to split a string on instances of sep
+    const_iterator begin() { return const_iterator(*this); }
+
+    /// Return the end iterator to string split
+    const_iterator end() { return const_iterator(); }
+};
+
+/**
+ * Escape the string so it can safely used as a C string inside double quotes
+ */
+std::string encode_cstring(const std::string& str);
+
+/**
+ * Unescape a C string, stopping at the first double quotes or at the end of
+ * the string.
+ *
+ * lenParsed is set to the number of characters that were pased (which can be
+ * greather than the size of the resulting string in case escapes were found)
+ */
+std::string decode_cstring(const std::string& str, size_t& lenParsed);
+
+/// Urlencode a string
+std::string encode_url(const std::string& str);
+
+/// Decode an urlencoded string
+std::string decode_url(const std::string& str);
+
+/// Encode a string in Base64
+std::string encode_base64(const std::string& str);
+
+/// Decode a string encoded in Base64
+std::string decode_base64(const std::string& str);
+
+}
+}
+#endif
diff --git a/ept/utils/sys.cc b/ept/utils/sys.cc
new file mode 100644
index 0000000..8f6f2ff
--- /dev/null
+++ b/ept/utils/sys.cc
@@ -0,0 +1,786 @@
+#include "sys.h"
+#include "string.h"
+#include <cstddef>
+#include <cstring>
+#include <exception>
+#include <sstream>
+#include <system_error>
+#include <cerrno>
+#include <sys/mman.h>
+#include <sys/types.h>
+#include <sys/stat.h>
+#include <fcntl.h>
+#include <alloca.h>
+
+namespace {
+
+inline const char* to_cstring(const std::string& s)
+{
+    return s.c_str();
+}
+
+inline const char* to_cstring(const char* s)
+{
+    return s;
+}
+
+}
+
+namespace ept {
+namespace sys {
+
+std::unique_ptr<struct stat> stat(const std::string& pathname)
+{
+    std::unique_ptr<struct stat> res(new struct stat);
+    if (::stat(pathname.c_str(), res.get()) == -1)
+    {
+        if (errno == ENOENT)
+            return std::unique_ptr<struct stat>();
+        else
+            throw std::system_error(errno, std::system_category(), "cannot stat " + pathname);
+    }
+    return res;
+}
+
+void stat(const std::string& pathname, struct stat& st)
+{
+    if (::stat(pathname.c_str(), &st) == -1)
+        throw std::system_error(errno, std::system_category(), "cannot stat " + pathname);
+}
+
+#define common_stat_body(testfunc) \
+    struct stat st; \
+    if (::stat(pathname.c_str(), &st) == -1) { \
+        if (errno == ENOENT) \
+            return false; \
+        else \
+            throw std::system_error(errno, std::system_category(), "cannot stat " + pathname); \
+    } \
+    return testfunc(st.st_mode)
+
+bool isdir(const std::string& pathname)
+{
+    common_stat_body(S_ISDIR);
+}
+
+bool isblk(const std::string& pathname)
+{
+    common_stat_body(S_ISBLK);
+}
+
+bool ischr(const std::string& pathname)
+{
+    common_stat_body(S_ISCHR);
+}
+
+bool isfifo(const std::string& pathname)
+{
+    common_stat_body(S_ISFIFO);
+}
+
+bool islnk(const std::string& pathname)
+{
+    common_stat_body(S_ISLNK);
+}
+
+bool isreg(const std::string& pathname)
+{
+    common_stat_body(S_ISREG);
+}
+
+bool issock(const std::string& pathname)
+{
+    common_stat_body(S_ISSOCK);
+}
+
+#undef common_stat_body
+
+time_t timestamp(const std::string& file)
+{
+    struct stat st;
+    stat(file, st);
+    return st.st_mtime;
+}
+
+time_t timestamp(const std::string& file, time_t def)
+{
+    auto st = sys::stat(file);
+    return st.get() ? st->st_mtime : def;
+}
+
+size_t size(const std::string& file)
+{
+    struct stat st;
+    stat(file, st);
+    return (size_t)st.st_size;
+}
+
+size_t size(const std::string& file, size_t def)
+{
+    auto st = sys::stat(file);
+    return st.get() ? (size_t)st->st_size : def;
+}
+
+ino_t inode(const std::string& file)
+{
+    struct stat st;
+    stat(file, st);
+    return st.st_ino;
+}
+
+ino_t inode(const std::string& file, ino_t def)
+{
+    auto st = sys::stat(file);
+    return st.get() ? st->st_ino : def;
+}
+
+
+bool access(const std::string &s, int m)
+{
+    return ::access(s.c_str(), m) == 0;
+}
+
+bool exists(const std::string& file)
+{
+    return sys::access(file, F_OK);
+}
+
+std::string getcwd()
+{
+#if defined(__GLIBC__)
+    char* cwd = ::get_current_dir_name();
+    if (cwd == NULL)
+        throw std::system_error(errno, std::system_category(), "cannot get the current working directory");
+    const std::string str(cwd);
+    ::free(cwd);
+    return str;
+#else
+    size_t size = pathconf(".", _PC_PATH_MAX);
+    char *buf = (char *)alloca( size );
+    if (::getcwd(buf, size) == NULL)
+        throw std::system_error(errno, std::system_category(), "cannot get the current working directory");
+    return buf;
+#endif
+}
+
+std::string abspath(const std::string& pathname)
+{
+    if (pathname[0] == '/')
+        return str::normpath(pathname);
+    else
+        return str::normpath(str::joinpath(sys::getcwd(), pathname));
+}
+
+
+/*
+ * MMap
+ */
+
+MMap::MMap(void* addr, size_t length)
+    : addr(addr), length(length)
+{
+}
+
+MMap::MMap(MMap&& o)
+    : addr(o.addr), length(o.length)
+{
+    o.addr = MAP_FAILED;
+    o.length = 0;
+}
+
+MMap& MMap::operator=(MMap&& o)
+{
+    if (this == &o) return *this;
+
+    munmap();
+    addr = o.addr;
+    length = o.length;
+    o.addr = MAP_FAILED;
+    o.length = 0;
+    return *this;
+}
+
+MMap::~MMap()
+{
+    if (addr != MAP_FAILED) ::munmap(addr, length);
+}
+
+void MMap::munmap()
+{
+    if (::munmap(addr, length) == -1)
+        throw std::system_error(errno, std::system_category(), "cannot unmap memory");
+    addr = MAP_FAILED;
+}
+
+
+/*
+ * FileDescriptor
+ */
+
+FileDescriptor::FileDescriptor() {}
+FileDescriptor::FileDescriptor(FileDescriptor&& o)
+    : fd(o.fd)
+{
+    o.fd = -1;
+}
+FileDescriptor::FileDescriptor(int fd) : fd(fd) {}
+FileDescriptor::~FileDescriptor() {}
+
+void FileDescriptor::throw_error(const char* desc)
+{
+    throw std::system_error(errno, std::system_category(), desc);
+}
+
+void FileDescriptor::close()
+{
+    if (fd == -1) return;
+    if (::close(fd) == -1)
+        throw_error("cannot close");
+    fd = -1;
+}
+
+void FileDescriptor::fstat(struct stat& st)
+{
+    if (::fstat(fd, &st) == -1)
+        throw_error("cannot stat");
+}
+
+void FileDescriptor::fchmod(mode_t mode)
+{
+    if (::fchmod(fd, mode) == -1)
+        throw_error("cannot fchmod");
+}
+
+size_t FileDescriptor::write(const void* buf, size_t count)
+{
+    ssize_t res = ::write(fd, buf, count);
+    if (res == -1)
+        throw_error("cannot write");
+    return res;
+}
+
+void FileDescriptor::write_all(const void* buf, size_t count)
+{
+    size_t written = 0;
+    while (written < count)
+        written += write((unsigned char*)buf + written, count - written);
+}
+
+MMap FileDescriptor::mmap(size_t length, int prot, int flags, off_t offset)
+{
+    void* res =::mmap(0, length, prot, flags, fd, offset);
+    if (res == MAP_FAILED)
+        throw_error("cannot mmap");
+    return MMap(res, length);
+}
+
+
+/*
+ * NamedFileDescriptor
+ */
+
+NamedFileDescriptor::NamedFileDescriptor(int fd, const std::string& pathname)
+    : FileDescriptor(fd), pathname(pathname)
+{
+}
+
+NamedFileDescriptor::NamedFileDescriptor(NamedFileDescriptor&& o)
+    : FileDescriptor(std::move(o)), pathname(std::move(o.pathname))
+{
+}
+
+NamedFileDescriptor& NamedFileDescriptor::operator=(NamedFileDescriptor&& o)
+{
+    if (this == &o) return *this;
+    fd = o.fd;
+    pathname = std::move(o.pathname);
+    o.fd = -1;
+    return *this;
+}
+
+void NamedFileDescriptor::throw_error(const char* desc)
+{
+    throw std::system_error(errno, std::system_category(), pathname + ": " + desc);
+}
+
+
+/*
+ * Path
+ */
+
+Path::Path(const char* pathname, int flags)
+    : NamedFileDescriptor(-1, pathname)
+{
+    fd = open(pathname, flags | O_PATH);
+    if (fd == -1)
+        throw_error("cannot open path");
+}
+
+Path::Path(const std::string& pathname, int flags)
+    : NamedFileDescriptor(-1, pathname)
+{
+    fd = open(pathname.c_str(), flags | O_PATH);
+    if (fd == -1)
+        throw_error("cannot open path");
+}
+
+Path::Path(Path& parent, const char* pathname, int flags)
+    : NamedFileDescriptor(parent.openat(pathname, flags | O_PATH),
+            str::joinpath(parent.name(), pathname))
+{
+}
+
+Path::~Path()
+{
+    if (fd != -1)
+        ::close(fd);
+}
+
+DIR* Path::fdopendir()
+{
+    int fd1 = ::openat(fd, ".", O_DIRECTORY);
+    if (fd1 == -1)
+        throw_error("cannot open directory");
+
+    DIR* res = ::fdopendir(fd1);
+    if (!res)
+        throw_error("cannot fdopendir");
+
+    return res;
+}
+
+Path::iterator Path::begin()
+{
+    if (fd == -1)
+       return iterator();
+    else
+        return iterator(*this);
+}
+
+Path::iterator Path::end()
+{
+    return iterator();
+}
+
+int Path::openat(const char* pathname, int flags, mode_t mode)
+{
+    int res = ::openat(fd, pathname, flags, mode);
+    if (res == -1)
+        throw_error("cannot openat");
+    return res;
+}
+
+void Path::fstatat(const char* pathname, struct stat& st)
+{
+    if (::fstatat(fd, pathname, &st, 0) == -1)
+        throw_error("cannot fstatat");
+}
+
+void Path::lstatat(const char* pathname, struct stat& st)
+{
+    if (::fstatat(fd, pathname, &st, AT_SYMLINK_NOFOLLOW) == -1)
+        throw_error("cannot fstatat");
+}
+
+void Path::unlinkat(const char* pathname)
+{
+    if (::unlinkat(fd, pathname, 0) == -1)
+        throw_error("cannot unlinkat");
+}
+
+void Path::rmdirat(const char* pathname)
+{
+    if (::unlinkat(fd, pathname, AT_REMOVEDIR) == -1)
+        throw_error("cannot unlinkat");
+}
+
+Path::iterator::iterator()
+{
+}
+
+Path::iterator::iterator(Path& dir)
+    : path(&dir)
+{
+    this->dir = dir.fdopendir();
+
+    long name_max = fpathconf(dir.fd, _PC_NAME_MAX);
+    if (name_max == -1) // Limit not defined, or error: take a guess
+        name_max = 255;
+    size_t len = offsetof(dirent, d_name) + name_max + 1;
+    cur_entry = (struct dirent*)malloc(len);
+    if (cur_entry == NULL)
+        throw std::bad_alloc();
+
+    operator++();
+}
+
+Path::iterator::~iterator()
+{
+    if (cur_entry) free(cur_entry);
+    if (dir) closedir(dir);
+}
+
+bool Path::iterator::operator==(const iterator& i) const
+{
+    if (!dir && !i.dir) return true;
+    if (!dir || !i.dir) return false;
+    return cur_entry->d_ino == i.cur_entry->d_ino;
+}
+bool Path::iterator::operator!=(const iterator& i) const
+{
+    if (!dir && !i.dir) return false;
+    if (!dir || !i.dir) return true;
+    return cur_entry->d_ino != i.cur_entry->d_ino;
+}
+
+void Path::iterator::operator++()
+{
+    struct dirent* result;
+    if (readdir_r(dir, cur_entry, &result) != 0)
+        path->throw_error("cannot readdir_r");
+
+    if (result == nullptr)
+    {
+        // Turn into an end iterator
+        free(cur_entry);
+        cur_entry = nullptr;
+        closedir(dir);
+        dir = nullptr;
+    }
+}
+
+bool Path::iterator::isdir() const
+{
+#if defined(_DIRENT_HAVE_D_TYPE) || defined(HAVE_STRUCT_DIRENT_D_TYPE)
+    if (cur_entry->d_type == DT_DIR)
+        return true;
+    if (cur_entry->d_type != DT_UNKNOWN)
+        return false;
+#endif
+    // No d_type, we'll need to stat
+    struct stat st;
+    path->fstatat(cur_entry->d_name, st);
+    return S_ISDIR(st.st_mode);
+}
+
+bool Path::iterator::isblk() const
+{
+#if defined(_DIRENT_HAVE_D_TYPE) || defined(HAVE_STRUCT_DIRENT_D_TYPE)
+    if (cur_entry->d_type == DT_BLK)
+        return true;
+    if (cur_entry->d_type != DT_UNKNOWN)
+        return false;
+#endif
+    // No d_type, we'll need to stat
+    struct stat st;
+    path->fstatat(cur_entry->d_name, st);
+    return S_ISBLK(st.st_mode);
+}
+
+bool Path::iterator::ischr() const
+{
+#if defined(_DIRENT_HAVE_D_TYPE) || defined(HAVE_STRUCT_DIRENT_D_TYPE)
+    if (cur_entry->d_type == DT_CHR)
+        return true;
+    if (cur_entry->d_type != DT_UNKNOWN)
+        return false;
+#endif
+    // No d_type, we'll need to stat
+    struct stat st;
+    path->fstatat(cur_entry->d_name, st);
+    return S_ISCHR(st.st_mode);
+}
+
+bool Path::iterator::isfifo() const
+{
+#if defined(_DIRENT_HAVE_D_TYPE) || defined(HAVE_STRUCT_DIRENT_D_TYPE)
+    if (cur_entry->d_type == DT_FIFO)
+        return true;
+    if (cur_entry->d_type != DT_UNKNOWN)
+        return false;
+#endif
+    // No d_type, we'll need to stat
+    struct stat st;
+    path->fstatat(cur_entry->d_name, st);
+    return S_ISFIFO(st.st_mode);
+}
+
+bool Path::iterator::islnk() const
+{
+#if defined(_DIRENT_HAVE_D_TYPE) || defined(HAVE_STRUCT_DIRENT_D_TYPE)
+    if (cur_entry->d_type == DT_LNK)
+        return true;
+    if (cur_entry->d_type != DT_UNKNOWN)
+        return false;
+#endif
+    struct stat st;
+    path->fstatat(cur_entry->d_name, st);
+    return S_ISLNK(st.st_mode);
+}
+
+bool Path::iterator::isreg() const
+{
+#if defined(_DIRENT_HAVE_D_TYPE) || defined(HAVE_STRUCT_DIRENT_D_TYPE)
+    if (cur_entry->d_type == DT_REG)
+        return true;
+    if (cur_entry->d_type != DT_UNKNOWN)
+        return false;
+#endif
+    struct stat st;
+    path->fstatat(cur_entry->d_name, st);
+    return S_ISREG(st.st_mode);
+}
+
+bool Path::iterator::issock() const
+{
+#if defined(_DIRENT_HAVE_D_TYPE) || defined(HAVE_STRUCT_DIRENT_D_TYPE)
+    if (cur_entry->d_type == DT_SOCK)
+        return true;
+    if (cur_entry->d_type != DT_UNKNOWN)
+        return false;
+#endif
+    struct stat st;
+    path->fstatat(cur_entry->d_name, st);
+    return S_ISSOCK(st.st_mode);
+}
+
+
+void Path::rmtree()
+{
+    for (auto i = begin(); i != end(); ++i)
+    {
+        if (strcmp(i->d_name, ".") == 0 || strcmp(i->d_name, "..") == 0) continue;
+        if (i.isdir())
+        {
+            Path sub(*this, i->d_name);
+            sub.rmtree();
+        }
+        else
+            unlinkat(i->d_name);
+    }
+    // TODO: is there a way to do this using fd instead?
+    rmdir(name());
+}
+
+/*
+ * File
+ */
+
+File::File(const std::string& pathname, int flags, mode_t mode)
+    : NamedFileDescriptor(-1, pathname)
+{
+    fd = open(pathname.c_str(), flags, mode);
+    if (fd == -1)
+        throw std::system_error(errno, std::system_category(), "cannot open file " + pathname);
+}
+
+File::~File()
+{
+    if (fd != -1) ::close(fd);
+}
+
+File File::mkstemp(const std::string& prefix)
+{
+    char* fbuf = (char*)alloca(prefix.size() + 7);
+    memcpy(fbuf, prefix.data(), prefix.size());
+    memcpy(fbuf + prefix.size(), "XXXXXX", 7);
+    int fd = ::mkstemp(fbuf);
+    if (fd < 0)
+        throw std::system_error(errno, std::system_category(), std::string("cannot create temporary file ") + fbuf);
+    return File(fd, fbuf);
+}
+
+std::string read_file(const std::string& file)
+{
+    File in(file, O_RDONLY);
+
+    // Get the file size
+    struct stat st;
+    in.fstat(st);
+
+    // mmap the input file
+    MMap src = in.mmap(st.st_size, PROT_READ, MAP_SHARED);
+
+    return std::string((const char*)src, st.st_size);
+}
+
+void write_file(const std::string& file, const std::string& data, mode_t mode)
+{
+    File out(file, O_WRONLY | O_CREAT, mode);
+    out.write_all(data.data(), data.size());
+    out.close();
+}
+
+void write_file_atomically(const std::string& file, const std::string& data, mode_t mode)
+{
+    File out = File::mkstemp(file);
+
+    // Read the umask
+    mode_t mask = umask(0777);
+    umask(mask);
+
+    // Set the file permissions, honoring umask
+    out.fchmod(mode & ~mask);
+
+    out.write_all(data.data(), data.size());
+    out.close();
+
+    if (rename(out.name().c_str(), file.c_str()) < 0)
+        throw std::system_error(errno, std::system_category(), "cannot rename " + out.name() + " to " + file);
+}
+
+#if 0
+void mkFilePath(const std::string& file)
+{
+    size_t pos = file.rfind('/');
+    if (pos != std::string::npos)
+        mkpath(file.substr(0, pos));
+}
+#endif
+
+bool unlink_ifexists(const std::string& file)
+{
+    if (::unlink(file.c_str()) != 0)
+    {
+        if (errno != ENOENT)
+            throw std::system_error(errno, std::system_category(), "cannot unlink " + file);
+        else
+            return false;
+    }
+    else
+        return true;
+}
+
+bool rename_ifexists(const std::string& src, const std::string& dst)
+{
+    if (::rename(src.c_str(), dst.c_str()) != 0)
+    {
+        if (errno != ENOENT)
+            throw std::system_error(errno, std::system_category(), "cannot rename " + src + " to " + dst);
+        else
+            return false;
+    }
+    else
+        return true;
+}
+
+template<typename String>
+static void impl_mkdir_ifmissing(String pathname, mode_t mode)
+{
+    for (unsigned i = 0; i < 5; ++i)
+    {
+        // If it does not exist, make it
+        if (::mkdir(to_cstring(pathname), mode) != -1)
+            return;
+
+        // throw on all errors except EEXIST. Note that EEXIST "includes the case
+        // where pathname is a symbolic link, dangling or not."
+        if (errno != EEXIST && errno != EISDIR)
+        {
+            std::stringstream msg;
+            msg << "cannot create directory " << pathname;
+            throw std::system_error(errno, std::system_category(), msg.str());
+        }
+
+        // Ensure that, if dir exists, it is a directory
+        std::unique_ptr<struct stat> st = sys::stat(pathname);
+        if (st.get() == NULL)
+        {
+            // Either dir has just been deleted, or we hit a dangling
+            // symlink.
+            //
+            // Retry creating a directory: the more we keep failing, the more
+            // the likelyhood of a dangling symlink increases.
+            //
+            // We could lstat here, but it would add yet another case for a
+            // race condition if the broken symlink gets deleted between the
+            // stat and the lstat.
+            continue;
+        }
+        else if (!S_ISDIR(st->st_mode))
+        {
+            // If it exists but it is not a directory, complain
+            std::stringstream msg;
+            msg << pathname << " exists but is not a directory";
+            throw std::runtime_error(msg.str());
+        }
+        else
+            // If it exists and it is a directory, we're fine
+            return;
+    }
+    std::stringstream msg;
+    msg << pathname << " exists and looks like a dangling symlink";
+    throw std::runtime_error(msg.str());
+}
+
+void mkdir_ifmissing(const char* pathname, mode_t mode)
+{
+    return impl_mkdir_ifmissing(pathname, mode);
+}
+
+void mkdir_ifmissing(const std::string& pathname, mode_t mode)
+{
+    return impl_mkdir_ifmissing(pathname, mode);
+}
+
+void makedirs(const std::string& pathname, mode_t mode)
+{
+    if (pathname == "/" || pathname == ".") return;
+    std::string parent = str::dirname(pathname);
+
+    // First ensure that the upper path exists
+    makedirs(parent, mode);
+
+    // Then create this dir
+    mkdir_ifmissing(pathname, mode);
+}
+
+std::string which(const std::string& name)
+{
+    // argv[0] has an explicit path: ensure it becomes absolute
+    if (name.find('/') != std::string::npos)
+        return sys::abspath(name);
+
+    // argv[0] has no explicit path, look for it in $PATH
+    const char* path = getenv("PATH");
+    if (!path) return name;
+
+    str::Split splitter(path, ":", true);
+    for (const auto& i: splitter)
+    {
+        std::string candidate = str::joinpath(i, name);
+        if (sys::access(candidate, X_OK))
+            return sys::abspath(candidate);
+    }
+
+    return name;
+}
+
+void unlink(const std::string& pathname)
+{
+    if (::unlink(pathname.c_str()) < 0)
+        throw std::system_error(errno, std::system_category(), "cannot unlink " + pathname);
+}
+
+void rmdir(const std::string& pathname)
+{
+    if (::rmdir(pathname.c_str()) < 0)
+        throw std::system_error(errno, std::system_category(), "cannot rmdir " + pathname);
+}
+
+void rmtree(const std::string& pathname)
+{
+    Path path(pathname);
+    path.rmtree();
+}
+
+#if 0
+std::string mkdtemp( std::string tmpl )
+{
+    char *_tmpl = reinterpret_cast< char * >( alloca( tmpl.size() + 1 ) );
+    strcpy( _tmpl, tmpl.c_str() );
+    return ::mkdtemp( _tmpl );
+}
+#endif
+}
+}
diff --git a/ept/utils/sys.h b/ept/utils/sys.h
new file mode 100644
index 0000000..334c983
--- /dev/null
+++ b/ept/utils/sys.h
@@ -0,0 +1,468 @@
+#ifndef EPT_SYS_H
+#define EPT_SYS_H
+
+/**
+ * @author Enrico Zini <enrico@enricozini.org>
+ * @brief Operating system functions
+ *
+ * Copyright (C) 2007--2015  Enrico Zini <enrico@debian.org>
+ */
+
+#include <string>
+//#include <iosfwd>
+#include <memory>
+#include <iterator>
+#include <sys/types.h>
+#include <sys/stat.h>
+#include <unistd.h>
+#include <dirent.h>
+
+namespace ept {
+namespace sys {
+
+/**
+ * stat() the given file and return the struct stat with the results.
+ * If the file does not exist, return NULL.
+ * Raises exceptions in case of errors.
+ */
+std::unique_ptr<struct stat> stat(const std::string& pathname);
+
+/**
+ * stat() the given file filling in the given structure.
+ * Raises exceptions in case of errors, including if the file does not exist.
+ */
+void stat(const std::string& pathname, struct stat& st);
+
+/**
+ * Returns true if the given pathname is a directory, else false.
+ *
+ * It also returns false if the pathname does not exist.
+ */
+bool isdir(const std::string& pathname);
+
+/// Same as isdir but checks for block devices
+bool isblk(const std::string& pathname);
+
+/// Same as isdir but checks for character devices
+bool ischr(const std::string& pathname);
+
+/// Same as isdir but checks for FIFOs
+bool isfifo(const std::string& pathname);
+
+/// Same as isdir but checks for symbolic links
+bool islnk(const std::string& pathname);
+
+/// Same as isdir but checks for regular files
+bool isreg(const std::string& pathname);
+
+/// Same as isdir but checks for sockets
+bool issock(const std::string& pathname);
+
+/// File mtime
+time_t timestamp(const std::string& file);
+
+/// File mtime (or def if the file does not exist)
+time_t timestamp(const std::string& file, time_t def);
+
+/// File size
+size_t size(const std::string& file);
+
+/// File size (or def if the file does not exist)
+size_t size(const std::string& file, size_t def);
+
+/// File inode number
+ino_t inode(const std::string& file);
+
+/// File inode number (or 0 if the file does not exist)
+ino_t inode(const std::string& file, ino_t def);
+
+/// access() a filename
+bool access(const std::string& s, int m);
+
+/// Same as access(s, F_OK);
+bool exists(const std::string& s);
+
+/// Get the absolute path of the current working directory
+std::string getcwd();
+
+/// Get the absolute path of a file
+std::string abspath(const std::string& pathname);
+
+/**
+ * Wraps a mmapped memory area, unmapping it on destruction.
+ *
+ * MMap objects can be used as normal pointers
+ */
+class MMap
+{
+    void* addr;
+    size_t length;
+
+public:
+    MMap(const MMap&) = delete;
+    MMap(MMap&&);
+    MMap(void* addr, size_t length);
+    ~MMap();
+
+    MMap& operator=(const MMap&) = delete;
+    MMap& operator=(MMap&&);
+
+    size_t size() const { return length; }
+
+    void munmap();
+
+    template<typename T>
+    operator const T*() const { return reinterpret_cast<const T*>(addr); }
+
+    template<typename T>
+    operator T*() const { return reinterpret_cast<T*>(addr); };
+};
+
+/**
+ * Common operations on file descriptors.
+ *
+ * Except when documented otherwise, methods of this class are just thin
+ * wrappers around the libc functions with the same name, that check error
+ * results and throw exceptions if the functions failed.
+ *
+ * Implementing what to do on construction and destruction is left to the
+ * subclassers: at the FileDescriptor level, the destructor does nothing and
+ * leaves the file descriptor open.
+ */
+class FileDescriptor
+{
+protected:
+    int fd = -1;
+
+public:
+    FileDescriptor();
+    FileDescriptor(FileDescriptor&& o);
+    FileDescriptor(int fd);
+    virtual ~FileDescriptor();
+
+    /**
+     * Throw an exception based on errno and the given message.
+     *
+     * This can be overridden by subclasses that may have more information
+     * about the file descriptor, so that they can generate more descriptive
+     * messages.
+     */
+    [[noreturn]] virtual void throw_error(const char* desc);
+
+    void close();
+
+    void fstat(struct stat& st);
+    void fchmod(mode_t mode);
+
+    size_t write(const void* buf, size_t count);
+
+    /**
+     * Write all the data in buf, retrying partial writes
+     */
+    void write_all(const void* buf, size_t count);
+
+    MMap mmap(size_t length, int prot, int flags, off_t offset=0);
+
+    operator int() const { return fd; }
+};
+
+
+/**
+ * File descriptor with a name
+ */
+
+class NamedFileDescriptor : public FileDescriptor
+{
+protected:
+    std::string pathname;
+
+public:
+    NamedFileDescriptor(int fd, const std::string& pathname);
+    NamedFileDescriptor(NamedFileDescriptor&&);
+
+    NamedFileDescriptor& operator=(NamedFileDescriptor&&);
+
+    [[noreturn]] virtual void throw_error(const char* desc);
+
+    /// Return the file pathname
+    const std::string& name() const { return pathname; }
+};
+
+/**
+ * Wrap a path on the file system opened with O_PATH
+ */
+struct Path : public NamedFileDescriptor
+{
+    /**
+     * Iterator for directory entries
+     */
+    struct iterator : public std::iterator<std::input_iterator_tag, struct dirent>
+    {
+        Path* path = nullptr;
+        DIR* dir = nullptr;
+        struct dirent* cur_entry = nullptr;
+
+        // End iterator
+        iterator();
+        // Start iteration on dir
+        iterator(Path& dir);
+        iterator(iterator&) = delete;
+        iterator(iterator&& o)
+            : dir(o.dir), cur_entry(o.cur_entry)
+        {
+            o.dir = nullptr;
+            o.cur_entry = nullptr;
+        }
+        ~iterator();
+        iterator& operator=(iterator&) = delete;
+        iterator& operator=(iterator&&) = delete;
+
+        bool operator==(const iterator& i) const;
+        bool operator!=(const iterator& i) const;
+        struct dirent& operator*() const { return *cur_entry; }
+        struct dirent* operator->() const { return cur_entry; }
+        void operator++();
+
+        /// @return true if we refer to a directory, else false
+        bool isdir() const;
+
+        /// @return true if we refer to a block device, else false
+        bool isblk() const;
+
+        /// @return true if we refer to a character device, else false
+        bool ischr() const;
+
+        /// @return true if we refer to a named pipe (FIFO).
+        bool isfifo() const;
+
+        /// @return true if we refer to a symbolic link.
+        bool islnk() const;
+
+        /// @return true if we refer to a regular file.
+        bool isreg() const;
+
+        /// @return true if we refer to a Unix domain socket.
+        bool issock() const;
+    };
+
+    using NamedFileDescriptor::NamedFileDescriptor;
+
+    /**
+     * Open the given pathname with flags | O_PATH.
+     */
+    Path(const char* pathname, int flags=0);
+    /**
+     * Open the given pathname with flags | O_PATH.
+     */
+    Path(const std::string& pathname, int flags=0);
+    /**
+     * Open the given pathname calling parent.openat, with flags | O_PATH
+     */
+    Path(Path& parent, const char* pathname, int flags=0);
+    Path(const Path&) = delete;
+    Path(Path&&) = default;
+    Path& operator=(const Path&) = delete;
+    Path& operator=(Path&&) = default;
+
+    /**
+     * The destructor closes the file descriptor, but does not check errors on
+     * ::close().
+     *
+     * In normal program flow, it is a good idea to explicitly call
+     * Path::close() in places where it can throw safely.
+     */
+    ~Path();
+
+    DIR* fdopendir();
+
+    /// Begin iterator on all directory entries
+    iterator begin();
+
+    /// End iterator on all directory entries
+    iterator end();
+
+    int openat(const char* pathname, int flags, mode_t mode=0777);
+
+    void fstatat(const char* pathname, struct stat& st);
+
+    /// fstatat with the AT_SYMLINK_NOFOLLOW flag set
+    void lstatat(const char* pathname, struct stat& st);
+
+    void unlinkat(const char* pathname);
+
+    /// unlinkat with the AT_REMOVEDIR flag set
+    void rmdirat(const char* pathname);
+
+    /**
+     * Delete the directory pointed to by this Path, with all its contents.
+     *
+     * The path must point to a directory.
+     */
+    void rmtree();
+};
+
+
+/**
+ * open(2) file descriptors
+ */
+class File : public NamedFileDescriptor
+{
+public:
+    using NamedFileDescriptor::NamedFileDescriptor;
+
+    File(File&&) = default;
+    File(const File&) = delete;
+
+    /// Wrapper around open(2)
+    File(const std::string& pathname, int flags, mode_t mode=0777);
+
+    /**
+     * The destructor closes the file descriptor, but does not check errors on
+     * ::close().
+     *
+     * In normal program flow, it is a good idea to explicitly call
+     * File::close() in places where it can throw safely.
+     */
+    ~File();
+
+    File& operator=(const File&) = delete;
+    File& operator=(File&&) = default;
+
+    static File mkstemp(const std::string& prefix);
+};
+
+/// Read whole file into memory. Throws exceptions on failure.
+std::string read_file(const std::string &file);
+
+/**
+ * Write \a data to \a file, replacing existing contents if it already exists.
+ *
+ * New files are created with the given permission mode, honoring umask.
+ * Permissions of existing files do not change.
+ */
+void write_file(const std::string& file, const std::string& data, mode_t mode=0777);
+
+/**
+ * Write \a data to \a file, replacing existing contents if it already exists.
+ *
+ * Files are created with the given permission mode, honoring umask. If the
+ * file already exists, its mode is ignored.
+ *
+ * Data is written to a temporary file, then moved to its final destination, to
+ * ensure an atomic operation.
+ */
+void write_file_atomically(const std::string& file, const std::string& data, mode_t mode=0777);
+
+#if 0
+// Create a temporary directory based on a template.
+std::string mkdtemp(std::string templ);
+
+/// Ensure that the path to the given file exists, creating it if it does not.
+/// The file itself will not get created.
+void mkFilePath(const std::string& file);
+#endif
+
+/**
+ * Delete a file if it exists. If it does not exist, do nothing.
+ *
+ * @return true if the file was deleted, false if it did not exist
+ */
+bool unlink_ifexists(const std::string& file);
+
+/**
+ * Move \a src to \a dst, without raising exception if \a src does not exist
+ *
+ * @return true if the file was renamed, false if it did not exist
+ */
+bool rename_ifexists(const std::string& src, const std::string& dst);
+
+/// Create the given directory, if it does not already exists.
+/// It will complain if the given pathname already exists but is not a
+/// directory.
+void mkdir_ifmissing(const char* pathname, mode_t mode=0777);
+
+void mkdir_ifmissing(const std::string& pathname, mode_t mode=0777);
+
+/// Create all the component of the given directory, including the directory
+/// itself.
+void makedirs(const std::string& pathname, mode_t=0777);
+
+/**
+ * Compute the absolute path of an executable.
+ *
+ * If \a name is specified as a partial path, it ensures it is made absolute.
+ * If \a name is not specified as a path, it looks for the executable in $PATH
+ * and return its absolute pathname.
+ */
+std::string which(const std::string& name);
+
+/// Delete the file using unlink()
+void unlink(const std::string& pathname);
+
+/// Remove the directory using rmdir(2)
+void rmdir(const std::string& pathname);
+
+/// Delete the directory \a pathname and all its contents.
+void rmtree(const std::string& pathname);
+
+#if 0
+/// Nicely wrap access to directories
+class Directory
+{
+protected:
+    /// Directory pathname
+    std::string m_path;
+
+public:
+    class const_iterator
+    {
+        /// Directory we are iterating
+        const Directory* dir;
+        /// DIR* pointer
+        void* dirp;
+        /// dirent structure used for iterating entries
+        struct dirent* direntbuf;
+
+    public:
+        // Create an end iterator
+        const_iterator();
+        // Create a begin iterator
+        const_iterator(const Directory& dir);
+        // Cleanup properly
+        ~const_iterator();
+
+        /// auto_ptr style copy semantics
+        const_iterator(const const_iterator& i);
+        const_iterator& operator=(const const_iterator& i);
+
+        /// Move to the next directory entry
+        const_iterator& operator++();
+
+        /// @return the current file name
+        std::string operator*() const;
+
+        bool operator==(const const_iterator& iter) const;
+        bool operator!=(const const_iterator& iter) const;
+    };
+
+    Directory(const std::string& path);
+    ~Directory();
+
+    /// Pathname of the directory
+    const std::string& path() const { return m_path; }
+
+    /// Check if the directory exists
+    bool exists() const;
+
+    /// Begin iterator
+    const_iterator begin() const;
+
+    /// End iterator
+    const_iterator end() const;
+};
+
+#endif
+}
+}
+
+#endif
diff --git a/ept/utils/tests-main.cc b/ept/utils/tests-main.cc
new file mode 100644
index 0000000..1aec45a
--- /dev/null
+++ b/ept/utils/tests-main.cc
@@ -0,0 +1,139 @@
+#include "tests.h"
+#include <signal.h>
+#include <cstdlib>
+#include <cstring>
+#include <exception>
+
+void signal_to_exception(int)
+{
+    throw std::runtime_error("killing signal catched");
+}
+
+int main(int argc,const char* argv[])
+{
+    using namespace ept::tests;
+
+    signal(SIGSEGV, signal_to_exception);
+    signal(SIGILL, signal_to_exception);
+
+#if 0
+  if( (argc == 2 && (! strcmp ("help", argv[1]))) || argc > 3 )
+  {
+    std::cout << "TUT example test application." << std::endl;
+    std::cout << "Usage: example [regression] | [list] | [ group] [test]" << std::endl;
+    std::cout << "       List all groups: example list" << std::endl;
+    std::cout << "       Run all tests: example regression" << std::endl;
+    std::cout << "       Run one group: example std::auto_ptr" << std::endl;
+    std::cout << "       Run one test: example std::auto_ptr 3" << std::endl;;
+  }
+
+  // std::cout << "\nFAILURE and EXCEPTION in these tests are FAKE ;)\n\n";
+
+  tut::runner.get().set_callback(&visi);
+
+  try
+  {
+    if( argc == 1 || (argc == 2 && std::string(argv[1]) == "regression") )
+    {
+      tut::runner.get().run_tests();
+    }
+    else if( argc == 2 && std::string(argv[1]) == "list" )
+    {
+      std::cout << "registered test groups:" << std::endl;
+      tut::groupnames gl = tut::runner.get().list_groups();
+      tut::groupnames::const_iterator i = gl.begin();
+      tut::groupnames::const_iterator e = gl.end();
+      while( i != e )
+      {
+        std::cout << "  " << *i << std::endl;
+        ++i;
+      }
+    }
+    else if( argc == 2 && std::string(argv[1]) != "regression" )
+    {
+      tut::runner.get().run_tests(argv[1]);
+    }
+    else if( argc == 3 )
+    {
+      tut::runner.get().run_test(argv[1],::atoi(argv[2]));
+    }
+  }
+  catch( const std::exception& ex )
+  {
+    std::cerr << "tut raised exception: " << ex.what() << std::endl;
+  }
+#endif
+
+    auto& tests = TestRegistry::get();
+
+    SimpleTestController controller;
+
+    if (const char* whitelist = getenv("TEST_WHITELIST"))
+        controller.whitelist = whitelist;
+
+    if (const char* blacklist = getenv("TEST_BLACKLIST"))
+        controller.blacklist = blacklist;
+
+  auto all_results = tests.run_tests(controller);
+
+  unsigned methods_ok = 0;
+  unsigned methods_failed = 0;
+  unsigned methods_skipped = 0;
+  unsigned test_cases_ok = 0;
+  unsigned test_cases_failed = 0;
+
+  for (const auto& tc_res: all_results)
+  {
+      if (!tc_res.fail_setup.empty())
+      {
+          fprintf(stderr, "%s: %s\n", tc_res.test_case.c_str(), tc_res.fail_setup.c_str());
+          ++test_cases_failed;
+      } else {
+          if (!tc_res.fail_teardown.empty())
+          {
+              fprintf(stderr, "%s: %s\n", tc_res.test_case.c_str(), tc_res.fail_teardown.c_str());
+              ++test_cases_failed;
+          }
+          else
+              ++test_cases_ok;
+
+          for (const auto& tm_res: tc_res.methods)
+          {
+              if (tm_res.skipped)
+                  ++methods_skipped;
+              else if (tm_res.is_success())
+                  ++methods_ok;
+              else
+              {
+                  fprintf(stderr, "\n");
+                  if (tm_res.exception_typeid.empty())
+                      fprintf(stderr, "%s.%s: %s\n", tm_res.test_case.c_str(), tm_res.test_method.c_str(), tm_res.error_message.c_str());
+                  else
+                      fprintf(stderr, "%s.%s:[%s] %s\n", tm_res.test_case.c_str(), tm_res.test_method.c_str(), tm_res.exception_typeid.c_str(), tm_res.error_message.c_str());
+                  for (const auto& frame : tm_res.error_stack)
+                      fprintf(stderr, "  %s", frame.format().c_str());
+                  ++methods_failed;
+              }
+          }
+      }
+  }
+
+  bool success = true;
+
+  if (test_cases_failed)
+  {
+      success = false;
+      fprintf(stderr, "\n%u/%u test cases had issues initializing or cleaning up\n",
+              test_cases_failed, test_cases_ok + test_cases_failed);
+  }
+
+  if (methods_failed)
+  {
+      success = false;
+      fprintf(stderr, "\n%u/%u tests failed\n", methods_failed, methods_ok + methods_failed);
+  }
+  else
+      fprintf(stderr, "%u tests succeeded\n", methods_ok);
+
+  return success ? 0 : 1;
+}
diff --git a/ept/utils/tests.cc b/ept/utils/tests.cc
new file mode 100644
index 0000000..28ea280
--- /dev/null
+++ b/ept/utils/tests.cc
@@ -0,0 +1,578 @@
+/*
+ * @author Enrico Zini <enrico@enricozini.org>, Peter Rockai (mornfall) <me@mornfall.net>
+ * @brief Utility functions for the unit tests
+ *
+ * Copyright (C) 2006--2007  Peter Rockai (mornfall) <me@mornfall.net>
+ * Copyright (C) 2003--2015  Enrico Zini <enrico@debian.org>
+ */
+
+#include "tests.h"
+#include "string.h"
+#include <fnmatch.h>
+#include <cmath>
+#include <iomanip>
+#include <sys/types.h>
+#include <regex.h>
+
+using namespace std;
+using namespace ept;
+
+const ept::tests::LocationInfo ept_test_location_info;
+
+namespace ept {
+namespace tests {
+
+/*
+ * TestStackFrame
+ */
+
+std::string TestStackFrame::format() const
+{
+    std::stringstream ss;
+    format(ss);
+    return ss.str();
+}
+
+void TestStackFrame::format(std::ostream& out) const
+{
+    out << file << ":" << line << ":" << call;
+    if (!local_info.empty())
+        out << " [" << local_info << "]";
+    out << endl;
+}
+
+
+/*
+ * TestStack
+ */
+
+void TestStack::backtrace(std::ostream& out) const
+{
+    for (const auto& frame: *this)
+        frame.format(out);
+}
+
+std::string TestStack::backtrace() const
+{
+    std::stringstream ss;
+    backtrace(ss);
+    return ss.str();
+}
+
+
+/*
+ * TestFailed
+ */
+
+TestFailed::TestFailed(const std::exception& e)
+    : message(typeid(e).name())
+{
+   message += ": ";
+   message += e.what();
+}
+
+
+#if 0
+std::string Location::fail_msg(const std::string& error) const
+{
+    std::stringstream ss;
+    ss << "test failed at:" << endl;
+    backtrace(ss);
+    ss << file << ":" << line << ":error: " << error << endl;
+    return ss.str();
+}
+
+std::string Location::fail_msg(std::function<void(std::ostream&)> write_error) const
+{
+    std::stringstream ss;
+    ss << "test failed at:" << endl;
+    backtrace(ss);
+    ss << file << ":" << line << ":error: ";
+    write_error(ss);
+    ss << endl;
+    return ss.str();
+}
+#endif
+
+std::ostream& LocationInfo::operator()()
+{
+    str(std::string());
+    clear();
+    return *this;
+}
+
+/*
+ * Assertions
+ */
+
+void assert_startswith(const std::string& actual, const std::string& expected)
+{
+    if (str::startswith(actual, expected)) return;
+    std::stringstream ss;
+    ss << "'" << actual << "' does not start with '" << expected << "'";
+    throw TestFailed(ss.str());
+}
+
+void assert_endswith(const std::string& actual, const std::string& expected)
+{
+    if (str::endswith(actual, expected)) return;
+    std::stringstream ss;
+    ss << "'" << actual << "' does not end with '" << expected << "'";
+    throw TestFailed(ss.str());
+}
+
+void assert_contains(const std::string& actual, const std::string& expected)
+{
+    if (actual.find(expected) != std::string::npos) return;
+    std::stringstream ss;
+    ss << "'" << actual << "' does not contain '" << expected << "'";
+    throw TestFailed(ss.str());
+}
+
+void assert_not_contains(const std::string& actual, const std::string& expected)
+{
+    if (actual.find(expected) == std::string::npos) return;
+    std::stringstream ss;
+    ss << "'" << actual << "' contains '" << expected << "'";
+    throw TestFailed(ss.str());
+}
+
+namespace {
+
+struct Regexp
+{
+    regex_t compiled;
+
+    Regexp(const char* regex)
+    {
+        if (int err = regcomp(&compiled, regex, REG_EXTENDED | REG_NOSUB))
+            raise_error(err);
+    }
+    ~Regexp()
+    {
+        regfree(&compiled);
+    }
+
+    bool search(const char* s)
+    {
+        return regexec(&compiled, s, 0, nullptr, 0) != REG_NOMATCH;
+    }
+
+    void raise_error(int code)
+    {
+        // Get the size of the error message string
+        size_t size = regerror(code, &compiled, nullptr, 0);
+
+        char* buf = new char[size];
+        regerror(code, &compiled, buf, size);
+        string msg(buf);
+        delete[] buf;
+        throw std::runtime_error(msg);
+    }
+};
+
+}
+
+void assert_re_matches(const std::string& actual, const std::string& expected)
+{
+    Regexp re(expected.c_str());
+    if (re.search(actual.c_str())) return;
+    std::stringstream ss;
+    ss << "'" << actual << "' does not match '" << expected << "'";
+    throw TestFailed(ss.str());
+}
+
+void assert_not_re_matches(const std::string& actual, const std::string& expected)
+{
+    Regexp re(expected.c_str());
+    if (!re.search(actual.c_str())) return;
+    std::stringstream ss;
+    ss << "'" << actual << "' should not match '" << expected << "'";
+    throw TestFailed(ss.str());
+}
+
+void assert_true(std::nullptr_t actual)
+{
+    throw TestFailed("actual value nullptr is not true");
+};
+
+void assert_false(std::nullptr_t actual)
+{
+};
+
+
+static void _actual_must_be_set(const char* actual)
+{
+    if (!actual)
+        throw TestFailed("actual value is the null pointer instead of a valid string");
+}
+
+void ActualCString::operator==(const char* expected) const
+{
+    if (expected && _actual)
+        assert_equal<std::string, std::string>(_actual, expected);
+    else if (!expected && !_actual)
+        ;
+    else if (expected)
+    {
+        std::stringstream ss;
+        ss << "actual value is nullptr instead of the expected string \"" << str::encode_cstring(expected) << "\"";
+        throw TestFailed(ss.str());
+    }
+    else
+    {
+        std::stringstream ss;
+        ss << "actual value is the string \"" << str::encode_cstring(_actual) << "\" instead of nullptr";
+        throw TestFailed(ss.str());
+    }
+}
+
+void ActualCString::operator==(const std::string& expected) const
+{
+    _actual_must_be_set(_actual);
+    assert_equal<std::string, std::string>(_actual, expected);
+}
+
+void ActualCString::operator!=(const char* expected) const
+{
+    if (expected && _actual)
+        assert_not_equal<std::string, std::string>(_actual, expected);
+    else if (!expected && !_actual)
+        throw TestFailed("actual and expected values are both nullptr but they should be different");
+}
+
+void ActualCString::operator!=(const std::string& expected) const
+{
+    _actual_must_be_set(_actual);
+    assert_not_equal<std::string, std::string>(_actual, expected);
+}
+
+void ActualCString::operator<(const std::string& expected) const
+{
+    _actual_must_be_set(_actual);
+    assert_less<std::string, std::string>(_actual, expected);
+}
+
+void ActualCString::operator<=(const std::string& expected) const
+{
+    _actual_must_be_set(_actual);
+    assert_less_equal<std::string, std::string>(_actual, expected);
+}
+
+void ActualCString::operator>(const std::string& expected) const
+{
+    _actual_must_be_set(_actual);
+    assert_greater<std::string, std::string>(_actual, expected);
+}
+
+void ActualCString::operator>=(const std::string& expected) const
+{
+    _actual_must_be_set(_actual);
+    assert_greater_equal<std::string, std::string>(_actual, expected);
+}
+
+void ActualCString::matches(const std::string& re) const
+{
+    _actual_must_be_set(_actual);
+    assert_re_matches(_actual, re);
+}
+
+void ActualCString::not_matches(const std::string& re) const
+{
+    _actual_must_be_set(_actual);
+    assert_not_re_matches(_actual, re);
+}
+
+void ActualCString::startswith(const std::string& expected) const
+{
+    _actual_must_be_set(_actual);
+    assert_startswith(_actual, expected);
+}
+
+void ActualCString::endswith(const std::string& expected) const
+{
+    _actual_must_be_set(_actual);
+    assert_endswith(_actual, expected);
+}
+
+void ActualCString::contains(const std::string& expected) const
+{
+    _actual_must_be_set(_actual);
+    assert_contains(_actual, expected);
+}
+
+void ActualCString::not_contains(const std::string& expected) const
+{
+    _actual_must_be_set(_actual);
+    assert_not_contains(_actual, expected);
+}
+
+void ActualStdString::startswith(const std::string& expected) const
+{
+    assert_startswith(_actual, expected);
+}
+
+void ActualStdString::endswith(const std::string& expected) const
+{
+    assert_endswith(_actual, expected);
+}
+
+void ActualStdString::contains(const std::string& expected) const
+{
+    assert_contains(_actual, expected);
+}
+
+void ActualStdString::not_contains(const std::string& expected) const
+{
+    assert_not_contains(_actual, expected);
+}
+
+void ActualStdString::matches(const std::string& re) const
+{
+    assert_re_matches(_actual, re);
+}
+
+void ActualStdString::not_matches(const std::string& re) const
+{
+    assert_not_re_matches(_actual, re);
+}
+
+void ActualDouble::almost_equal(double expected, unsigned places) const
+{
+    if (round((_actual - expected) * exp10(places)) == 0.0)
+        return;
+    std::stringstream ss;
+    ss << std::setprecision(places) << fixed << _actual << " is different than the expected " << expected;
+    throw TestFailed(ss.str());
+}
+
+void ActualDouble::not_almost_equal(double expected, unsigned places) const
+{
+    if (round(_actual - expected * exp10(places)) != 0.0)
+        return;
+    std::stringstream ss;
+    ss << std::setprecision(places) << fixed << _actual << " is the same as the expected " << expected;
+    throw TestFailed(ss.str());
+}
+
+void ActualFunction::throws(const std::string& what_match) const
+{
+    bool thrown = false;
+    try {
+        _actual();
+    } catch (std::exception& e) {
+        thrown = true;
+        wassert(actual(e.what()).matches(what_match));
+    }
+    if (!thrown)
+        throw TestFailed("code did not throw any exception");
+}
+
+#if 0
+void test_assert_file_exists(WIBBLE_TEST_LOCPRM, const std::string& fname)
+{
+    if (not sys::fs::exists(fname))
+    {
+        std::stringstream ss;
+        ss << "file '" << fname << "' does not exists";
+        ept_test_location.fail_test(ss.str());
+    }
+}
+
+void test_assert_not_file_exists(WIBBLE_TEST_LOCPRM, const std::string& fname)
+{
+    if (sys::fs::exists(fname))
+    {
+        std::stringstream ss;
+        ss << "file '" << fname << "' does exists";
+        ept_test_location.fail_test(ss.str());
+    }
+}
+
+#if 0
+struct TestFileExists
+{
+    std::string pathname;
+    bool inverted;
+    TestFileExists(const std::string& pathname, bool inverted=false) : pathname(pathname), inverted(inverted) {}
+    TestFileExists operator!() { return TestFileExists(pathname, !inverted); }
+    void check(EPT_TEST_LOCPRM) const;
+};
+#endif
+
+void TestFileExists::check(WIBBLE_TEST_LOCPRM) const
+{
+    if (!inverted)
+    {
+        if (sys::fs::exists(pathname)) return;
+        std::stringstream ss;
+        ss << "file '" << pathname << "' does not exists";
+        ept_test_location.fail_test(ss.str());
+    } else {
+        if (not sys::fs::exists(pathname)) return;
+        std::stringstream ss;
+        ss << "file '" << pathname << "' exists";
+        ept_test_location.fail_test(ss.str());
+    }
+}
+#endif
+
+TestRegistry& TestRegistry::get()
+{
+    static TestRegistry* instance = 0;
+    if (!instance)
+        instance = new TestRegistry();
+    return *instance;
+}
+
+void TestRegistry::register_test_case(TestCase& test_case)
+{
+    entries.emplace_back(&test_case);
+}
+
+std::vector<TestCaseResult> TestRegistry::run_tests(TestController& controller)
+{
+    std::vector<TestCaseResult> res;
+    for (auto& e: entries)
+    {
+        e->register_tests();
+        // TODO: filter on e.name
+        res.emplace_back(std::move(e->run_tests(controller)));
+    }
+    return res;
+}
+
+TestCaseResult TestCase::run_tests(TestController& controller)
+{
+    TestCaseResult res(name);
+
+    if (!controller.test_case_begin(*this, res))
+    {
+        res.skipped = true;
+        controller.test_case_end(*this, res);
+        return res;
+    }
+
+    try {
+        setup();
+    } catch (std::exception& e) {
+        res.set_setup_failed(e);
+        controller.test_case_end(*this, res);
+        return res;
+    }
+
+    for (auto& m: methods)
+    {
+        // TODO: filter on m.name
+        res.add_test_method(run_test(controller, m));
+    }
+
+    try {
+        teardown();
+    } catch (std::exception& e) {
+        res.set_teardown_failed(e);
+    }
+
+    controller.test_case_end(*this, res);
+    return res;
+}
+
+TestMethodResult TestCase::run_test(TestController& controller, TestMethod& method)
+{
+    TestMethodResult res(name, method.name);
+
+    if (!controller.test_method_begin(method, res))
+    {
+        res.skipped = true;
+        controller.test_method_end(method, res);
+        return res;
+    }
+
+    bool run = true;
+    try {
+        method_setup(res);
+    } catch (std::exception& e) {
+        res.set_setup_exception(e);
+        run = false;
+    }
+
+    if (run)
+    {
+        try {
+            method.test_function();
+        } catch (TestFailed& e) {
+            // Location::fail_test() was called
+            res.set_failed(e);
+        } catch (std::exception& e) {
+            // std::exception was thrown
+            res.set_exception(e);
+        } catch (...) {
+            // An unknown exception was thrown
+            res.set_unknown_exception();
+        }
+    }
+
+    try {
+        method_teardown(res);
+    } catch (std::exception& e) {
+        res.set_teardown_exception(e);
+    }
+
+    controller.test_method_end(method, res);
+    return res;
+}
+
+bool SimpleTestController::test_method_should_run(const std::string& fullname) const
+{
+    if (!whitelist.empty() && fnmatch(whitelist.c_str(), fullname.c_str(), 0) == FNM_NOMATCH)
+        return false;
+
+    if (!blacklist.empty() && fnmatch(blacklist.c_str(), fullname.c_str(), 0) != FNM_NOMATCH)
+        return false;
+
+    return true;
+}
+
+bool SimpleTestController::test_case_begin(const TestCase& test_case, const TestCaseResult& test_case_result)
+{
+    // Skip test case if all its methods should not run
+    bool should_run = false;
+    for (const auto& m : test_case.methods)
+        should_run |= test_method_should_run(test_case.name + "." + m.name);
+    if (!should_run) return false;
+
+    fprintf(stdout, "%s: ", test_case.name.c_str());
+    fflush(stdout);
+    return true;
+}
+
+void SimpleTestController::test_case_end(const TestCase& test_case, const TestCaseResult& test_case_result)
+{
+    if (test_case_result.skipped)
+        ;
+    else if (test_case_result.is_success())
+        fprintf(stdout, "\n");
+    else
+        fprintf(stdout, "\n");
+    fflush(stdout);
+}
+
+bool SimpleTestController::test_method_begin(const TestMethod& test_method, const TestMethodResult& test_method_result)
+{
+    string name = test_method_result.test_case + "." + test_method.name;
+    return test_method_should_run(name);
+}
+
+void SimpleTestController::test_method_end(const TestMethod& test_method, const TestMethodResult& test_method_result)
+{
+    if (test_method_result.skipped)
+        putc('s', stdout);
+    else if (test_method_result.is_success())
+        putc('.', stdout);
+    else
+        putc('x', stdout);
+    fflush(stdout);
+}
+
+}
+}
diff --git a/ept/utils/tests.h b/ept/utils/tests.h
new file mode 100644
index 0000000..3b00a14
--- /dev/null
+++ b/ept/utils/tests.h
@@ -0,0 +1,804 @@
+#ifndef EPT_TESTS_H
+#define EPT_TESTS_H
+
+/**
+ * @author Enrico Zini <enrico@enricozini.org>, Peter Rockai (mornfall) <me@mornfall.net>
+ * @brief Utility functions for the unit tests
+ *
+ * Copyright (C) 2006--2007  Peter Rockai (mornfall) <me@mornfall.net>
+ * Copyright (C) 2003--2013  Enrico Zini <enrico@debian.org>
+ */
+
+#include <string>
+#include <sstream>
+#include <exception>
+#include <functional>
+#include <vector>
+
+namespace ept {
+namespace tests {
+struct LocationInfo;
+}
+}
+
+/*
+ * These global arguments will be shadowed by local variables in functions that
+ * implement tests.
+ *
+ * They are here to act as default root nodes to fulfill method signatures when
+ * tests are called from outside other tests.
+ */
+extern const ept::tests::LocationInfo ept_test_location_info;
+
+namespace ept {
+namespace tests {
+
+/**
+ * Add information to the test backtrace for the tests run in the current
+ * scope.
+ *
+ * Example usage:
+ * \code
+ * test_function(...)
+ * {
+ *    EPT_TEST_INFO(info);
+ *    for (unsigned i = 0; i < 10; ++i)
+ *    {
+ *       info() << "Iteration #" << i;
+ *       ...
+ *    }
+ * }
+ * \endcode
+ */
+struct LocationInfo : public std::stringstream
+{
+    LocationInfo() {}
+
+    /**
+     * Clear the current information and return the output stream to which new
+     * information can be sent
+     */
+    std::ostream& operator()();
+};
+
+/// Information about one stack frame in the test execution stack
+struct TestStackFrame
+{
+    const char* file;
+    int line;
+    const char* call;
+    std::string local_info;
+
+    TestStackFrame(const char* file, int line, const char* call)
+        : file(file), line(line), call(call)
+    {
+    }
+
+    TestStackFrame(const char* file, int line, const char* call, const LocationInfo& local_info)
+        : file(file), line(line), call(call), local_info(local_info.str())
+    {
+    }
+
+    std::string format() const;
+
+    void format(std::ostream& out) const;
+};
+
+struct TestStack : public std::vector<TestStackFrame>
+{
+    using vector::vector;
+
+    /// Return the formatted backtrace for this location
+    std::string backtrace() const;
+
+    /// Write the formatted backtrace for this location to \a out
+    void backtrace(std::ostream& out) const;
+};
+
+/**
+ * Exception raised when a test assertion fails, normally by
+ * Location::fail_test
+ */
+struct TestFailed : public std::exception
+{
+    std::string message;
+    TestStack stack;
+
+    TestFailed(const std::exception& e);
+
+    template<typename ...Args>
+    TestFailed(const std::exception& e, Args&&... args)
+        : TestFailed(e)
+    {
+        add_stack_info(std::forward<Args>(args)...);
+    }
+
+    TestFailed(const std::string& message) : message(message) {}
+
+    template<typename ...Args>
+    TestFailed(const std::string& message, Args&&... args)
+        : TestFailed(message)
+    {
+        add_stack_info(std::forward<Args>(args)...);
+    }
+
+    const char* what() const noexcept override { return message.c_str(); }
+
+    template<typename ...Args>
+    void add_stack_info(Args&&... args) { stack.emplace_back(std::forward<Args>(args)...); }
+};
+
+/**
+ * Use this to declare a local variable with the given name that will be
+ * picked up by tests as extra local info
+ */
+#define EPT_TEST_INFO(name) \
+    ept::tests::LocationInfo ept_test_location_info; \
+    ept::tests::LocationInfo& name = ept_test_location_info
+
+
+/// Test function that ensures that the actual value is true
+template<typename A>
+void assert_true(const A& actual)
+{
+    if (actual) return;
+    std::stringstream ss;
+    ss << "actual value " << actual << " is not true";
+    throw TestFailed(ss.str());
+};
+
+void assert_true(std::nullptr_t actual);
+
+/// Test function that ensures that the actual value is false
+template<typename A>
+void assert_false(const A& actual)
+{
+    if (!actual) return;
+    std::stringstream ss;
+    ss << "actual value " << actual << " is not false";
+    throw TestFailed(ss.str());
+};
+
+void assert_false(std::nullptr_t actual);
+
+/**
+ * Test function that ensures that the actual value is the same as a reference
+ * one
+ */
+template<typename A, typename E>
+void assert_equal(const A& actual, const E& expected)
+{
+    if (actual == expected) return;
+    std::stringstream ss;
+    ss << "value '" << actual << "' is different than the expected '" << expected << "'";
+    throw TestFailed(ss.str());
+}
+
+/**
+ * Test function that ensures that the actual value is different than a
+ * reference one
+ */
+template<typename A, typename E>
+void assert_not_equal(const A& actual, const E& expected)
+{
+    if (actual != expected) return;
+    std::stringstream ss;
+    ss << "value '" << actual << "' is not different than the expected '" << expected << "'";
+    throw TestFailed(ss.str());
+}
+
+/// Ensure that the actual value is less than the reference value
+template<typename A, typename E>
+void assert_less(const A& actual, const E& expected)
+{
+    if (actual < expected) return;
+    std::stringstream ss;
+    ss << "value '" << actual << "' is not less than the expected '" << expected << "'";
+    throw TestFailed(ss.str());
+}
+
+/// Ensure that the actual value is less or equal than the reference value
+template<typename A, typename E>
+void assert_less_equal(const A& actual, const E& expected)
+{
+    if (actual <= expected) return;
+    std::stringstream ss;
+    ss << "value '" << actual << "' is not less than or equals to the expected '" << expected << "'";
+    throw TestFailed(ss.str());
+}
+
+/// Ensure that the actual value is greater than the reference value
+template<typename A, typename E>
+void assert_greater(const A& actual, const E& expected)
+{
+    if (actual > expected) return;
+    std::stringstream ss;
+    ss << "value '" << actual << "' is not greater than the expected '" << expected << "'";
+    throw TestFailed(ss.str());
+}
+
+/// Ensure that the actual value is greather or equal than the reference value
+template<typename A, typename E>
+void assert_greater_equal(const A& actual, const E& expected)
+{
+    if (actual >= expected) return;
+    std::stringstream ss;
+    ss << "value '" << actual << "' is not greater than or equals to the expected '" << expected << "'";
+    throw TestFailed(ss.str());
+}
+
+/// Ensure that the string \a actual starts with \a expected
+void assert_startswith(const std::string& actual, const std::string& expected);
+
+/// Ensure that the string \a actual ends with \a expected
+void assert_endswith(const std::string& actual, const std::string& expected);
+
+/// Ensure that the string \a actual contains \a expected
+void assert_contains(const std::string& actual, const std::string& expected);
+
+/// Ensure that the string \a actual does not contain \a expected
+void assert_not_contains(const std::string& actual, const std::string& expected);
+
+/**
+ * Ensure that the string \a actual matches the extended regular expression
+ * \a expected.
+ *
+ * The syntax is that of extended regular expression (see man regex(7) ).
+ */
+void assert_re_matches(const std::string& actual, const std::string& expected);
+
+/**
+ * Ensure that the string \a actual does not match the extended regular
+ * expression \a expected.
+ *
+ * The syntax is that of extended regular expression (see man regex(7) ).
+ */
+void assert_not_re_matches(const std::string& actual, const std::string& expected);
+
+
+template<class A>
+struct Actual
+{
+    A _actual;
+    Actual(const A& actual) : _actual(actual) {}
+    ~Actual() {}
+
+    void istrue() const { assert_true(_actual); }
+    void isfalse() const { assert_false(_actual); }
+    template<typename E> void operator==(const E& expected) const { assert_equal(_actual, expected); }
+    template<typename E> void operator!=(const E& expected) const { assert_not_equal(_actual, expected); }
+    template<typename E> void operator<(const E& expected) const { return assert_less(_actual, expected); }
+    template<typename E> void operator<=(const E& expected) const { return assert_less_equal(_actual, expected); }
+    template<typename E> void operator>(const E& expected) const { return assert_greater(_actual, expected); }
+    template<typename E> void operator>=(const E& expected) const { return assert_greater_equal(_actual, expected); }
+};
+
+struct ActualCString
+{
+    const char* _actual;
+    ActualCString(const char* s) : _actual(s) {}
+
+    void istrue() const { return assert_true(_actual); }
+    void isfalse() const { return assert_false(_actual); }
+    void operator==(const char* expected) const;
+    void operator==(const std::string& expected) const;
+    void operator!=(const char* expected) const;
+    void operator!=(const std::string& expected) const;
+    void operator<(const std::string& expected) const;
+    void operator<=(const std::string& expected) const;
+    void operator>(const std::string& expected) const;
+    void operator>=(const std::string& expected) const;
+    void startswith(const std::string& expected) const;
+    void endswith(const std::string& expected) const;
+    void contains(const std::string& expected) const;
+    void not_contains(const std::string& expected) const;
+    void matches(const std::string& re) const;
+    void not_matches(const std::string& re) const;
+};
+
+struct ActualStdString : public Actual<std::string>
+{
+    ActualStdString(const std::string& s) : Actual<std::string>(s) {}
+
+    void startswith(const std::string& expected) const;
+    void endswith(const std::string& expected) const;
+    void contains(const std::string& expected) const;
+    void not_contains(const std::string& expected) const;
+    void matches(const std::string& re) const;
+    void not_matches(const std::string& re) const;
+};
+
+struct ActualDouble : public Actual<double>
+{
+    using Actual::Actual;
+
+    void almost_equal(double expected, unsigned places) const;
+    void not_almost_equal(double expected, unsigned places) const;
+};
+
+template<typename A>
+inline Actual<A> actual(const A& actual) { return Actual<A>(actual); }
+inline ActualCString actual(const char* actual) { return ActualCString(actual); }
+inline ActualCString actual(char* actual) { return ActualCString(actual); }
+inline ActualStdString actual(const std::string& actual) { return ActualStdString(actual); }
+inline ActualDouble actual(double actual) { return ActualDouble(actual); }
+
+struct ActualFunction : public Actual<std::function<void()>>
+{
+    using Actual::Actual;
+
+    void throws(const std::string& what_match) const;
+};
+
+inline ActualFunction actual_function(std::function<void()> actual) { return ActualFunction(actual); }
+
+
+/**
+ * Run the given command, raising TestFailed with the appropriate backtrace
+ * information if it threw an exception.
+ *
+ * If the command raises TestFailed, it adds the current stack to its stack
+ * information.
+ */
+#define wassert(...) \
+    do { try { \
+        __VA_ARGS__ ; \
+    } catch (TestFailed& e) { \
+        e.add_stack_info(__FILE__, __LINE__, #__VA_ARGS__, ept_test_location_info); \
+        throw; \
+    } catch (std::exception& e) { \
+        throw TestFailed(e, __FILE__, __LINE__, #__VA_ARGS__, ept_test_location_info); \
+    } } while(0)
+
+/// Shortcut to check that a given expression returns true
+#define wassert_true(...) wassert(actual(__VA_ARGS__).istrue())
+
+/// Shortcut to check that a given expression returns false
+#define wassert_false(...) wassert(actual(__VA_ARGS__).isfalse())
+
+/**
+ * Call a function returning its result, and raising TestFailed with the
+ * appropriate backtrace information if it threw an exception.
+ *
+ * If the function raises TestFailed, it adds the current stack to its stack
+ * information.
+ */
+#define wcallchecked(func) \
+    [&]() { try { \
+        return func; \
+    } catch (TestFailed& e) { \
+        e.add_stack_info(__FILE__, __LINE__, #func, ept_test_location_info); \
+        throw; \
+    } catch (std::exception& e) { \
+        throw TestFailed(e, __FILE__, __LINE__, #func, ept_test_location_info); \
+    } }()
+
+
+struct TestCase;
+
+/**
+ * Result of running a test method.
+ */
+struct TestMethodResult
+{
+    /// Name of the test case
+    std::string test_case;
+
+    /// Name of the test method
+    std::string test_method;
+
+    /// If non-empty, the test failed with this error
+    std::string error_message;
+
+    /// Stack frame of where the error happened
+    TestStack error_stack;
+
+    /// If non-empty, the test raised an exception and this is its type ID
+    std::string exception_typeid;
+
+    /// True if the test has been skipped
+    bool skipped = false;
+
+
+    TestMethodResult(const std::string& test_case, const std::string& test_method)
+        : test_case(test_case), test_method(test_method) {}
+
+    void set_failed(TestFailed& e)
+    {
+        error_message = e.what();
+        error_stack = e.stack;
+        if (error_message.empty())
+            error_message = "test failed with an empty error message";
+    }
+
+    void set_exception(std::exception& e)
+    {
+        error_message = e.what();
+        if (error_message.empty())
+            error_message = "test threw an exception with an empty error message";
+        exception_typeid = typeid(e).name();
+    }
+
+    void set_unknown_exception()
+    {
+        error_message = "unknown exception caught";
+    }
+
+    void set_setup_exception(std::exception& e)
+    {
+        error_message = "[setup failed: ";
+        error_message += e.what();
+        error_message += "]";
+    }
+
+    void set_teardown_exception(std::exception& e)
+    {
+        error_message = "[teardown failed: ";
+        error_message += e.what();
+        error_message += "]";
+    }
+
+    bool is_success() const
+    {
+        return error_message.empty();
+    }
+};
+
+/**
+ * Result of running a whole test case
+ */
+struct TestCaseResult
+{
+    /// Name of the test case
+    std::string test_case;
+    /// Outcome of all the methods that have been run
+    std::vector<TestMethodResult> methods;
+    /// Set to a non-empty string if the setup method of the test case failed
+    std::string fail_setup;
+    /// Set to a non-empty string if the teardown method of the test case
+    /// failed
+    std::string fail_teardown;
+    /// Set to true if this test case has been skipped
+    bool skipped = false;
+
+    TestCaseResult(const std::string& test_case) : test_case(test_case) {}
+
+    void set_setup_failed()
+    {
+        fail_setup = "test case setup method threw an unknown exception";
+    }
+
+    void set_setup_failed(std::exception& e)
+    {
+        fail_setup = "test case setup method threw an exception: ";
+        fail_setup += e.what();
+    }
+
+    void set_teardown_failed()
+    {
+        fail_teardown = "test case teardown method threw an unknown exception";
+    }
+
+    void set_teardown_failed(std::exception& e)
+    {
+        fail_teardown = "test case teardown method threw an exception: ";
+        fail_teardown += e.what();
+    }
+
+    void add_test_method(TestMethodResult&& e)
+    {
+        methods.emplace_back(std::move(e));
+    }
+
+    bool is_success() const
+    {
+        if (!fail_setup.empty() || !fail_teardown.empty()) return false;
+        for (const auto& m: methods)
+            if (!m.is_success())
+                return false;
+        return true;
+    }
+};
+
+struct TestCase;
+struct TestCaseResult;
+struct TestMethod;
+struct TestMethodResult;
+
+/**
+ * Abstract interface for the objects that supervise test execution.
+ *
+ * This can be used for printing progress, or to skip test methods or test
+ * cases.
+ */
+struct TestController
+{
+    virtual ~TestController() {}
+
+    /**
+     * Called before running a test case.
+     *
+     * @returns true if the test case should be run, false if it should be skipped
+     */
+    virtual bool test_case_begin(const TestCase& test_case, const TestCaseResult& test_case_result) { return true; }
+
+    /**
+     * Called after running a test case.
+     */
+    virtual void test_case_end(const TestCase& test_case, const TestCaseResult& test_case_result) {}
+
+    /**
+     * Called before running a test method.
+     *
+     * @returns true if the test method should be run, false if it should be skipped
+     */
+    virtual bool test_method_begin(const TestMethod& test_method, const TestMethodResult& test_method_result) { return true; }
+
+    /**
+     * Called after running a test method.
+     */
+    virtual void test_method_end(const TestMethod& test_method, const TestMethodResult& test_method_result) {}
+};
+
+/**
+ * Simple default implementation of TestController.
+ *
+ * It does progress printing to stdout and basic glob-based test method
+ * filtering.
+ */
+struct SimpleTestController : public TestController
+{
+    /// Any method not matching this glob expression will not be run
+    std::string whitelist;
+
+    /// Any method matching this glob expression will not be run
+    std::string blacklist;
+
+    bool test_case_begin(const TestCase& test_case, const TestCaseResult& test_case_result) override;
+    void test_case_end(const TestCase& test_case, const TestCaseResult& test_case_result) override;
+    bool test_method_begin(const TestMethod& test_method, const TestMethodResult& test_method_result) override;
+    void test_method_end(const TestMethod& test_method, const TestMethodResult& test_method_result) override;
+
+    bool test_method_should_run(const std::string& fullname) const;
+};
+
+
+/**
+ * Test registry.
+ *
+ * It collects information about all known test cases and takes care of running
+ * them.
+ */
+struct TestRegistry
+{
+    /// All known test cases
+    std::vector<TestCase*> entries;
+
+    /**
+     * Register a new test case.
+     *
+     * No memory management is done: test_case needs to exist for the whole
+     * lifetime of TestRegistry.
+     */
+    void register_test_case(TestCase& test_case);
+
+    /**
+     * Run all the registered tests using the given controller
+     */
+    std::vector<TestCaseResult> run_tests(TestController& controller);
+
+    /// Get the singleton instance of TestRegistry
+    static TestRegistry& get();
+};
+
+/**
+ * Test method information
+ */
+struct TestMethod
+{
+    /// Name of the test method
+    std::string name;
+
+    /// Main body of the test method
+    std::function<void()> test_function;
+
+    TestMethod(const std::string& name, std::function<void()> test_function)
+        : name(name), test_function(test_function) {}
+};
+
+
+/**
+ * Test case collecting several test methods, and self-registering with the
+ * singleton instance of TestRegistry.
+ */
+struct TestCase
+{
+    /// Name of the test case
+    std::string name;
+
+    /// All registered test methods
+    std::vector<TestMethod> methods;
+
+    TestCase(const std::string& name)
+        : name(name)
+    {
+        TestRegistry::get().register_test_case(*this);
+    }
+    virtual ~TestCase() {}
+
+    /**
+     * This will be called before running the test case, to populate it with
+     * its test methods.
+     *
+     * This needs to be reimplemented with a function that will mostly be a
+     * sequence of calls to add_method().
+     */
+    virtual void register_tests() = 0;
+
+    /**
+     * Set up the test case before it is run.
+     */
+    virtual void setup() {}
+
+    /**
+     * Clean up after the test case is run
+     */
+    virtual void teardown() {}
+
+    /**
+     * Set up before the test method is run
+     */
+    virtual void method_setup(TestMethodResult&) {}
+
+    /**
+     * Clean up after the test method is run
+     */
+    virtual void method_teardown(TestMethodResult&) {}
+
+    /**
+     * Call setup(), run all the tests that have been registered, then
+     * call teardown().
+     *
+     * Exceptions in setup() and teardown() are caught and reported in
+     * TestCaseResult. Test are run using run_test().
+     */
+    virtual TestCaseResult run_tests(TestController& controller);
+
+    /**
+     * Run a test method.
+     *
+     * Call method_setup(), run all the tests that have been registered, then
+     * call method_teardown().
+     *
+     * Exceptions thrown by the test method are caught and reported in
+     * TestMethodResult.
+     *
+     * Exceptions in method_setup() and method_teardown() are caught and
+     * reported in TestMethodResult.
+     */
+    virtual TestMethodResult run_test(TestController& controller, TestMethod& method);
+
+    /**
+     * Register a new test method
+     */
+    template<typename ...Args>
+    void add_method(const std::string& name, std::function<void()> test_function)
+    {
+        methods.emplace_back(name, test_function);
+    }
+
+    /**
+     * Register a new test method
+     */
+    template<typename ...Args>
+    void add_method(const std::string& name, std::function<void()> test_function, Args&&... args)
+    {
+        methods.emplace_back(name, test_function, std::forward<Args>(args)...);
+    }
+
+    /**
+     * Register a new test metheod, with arguments.
+     *
+     * Any extra arguments to the function will be passed to the test method.
+     */
+    template<typename FUNC, typename ...Args>
+    void add_method(const std::string& name, FUNC test_function, Args&&... args)
+    {
+        methods.emplace_back(name, [test_function, args...]() { test_function(args...); });
+    }
+};
+
+
+/**
+ * Base class for test fixtures.
+ *
+ * A fixture will have a constructor and a destructor to do setup/teardown, and
+ * a reset() function to be called inbetween tests.
+ *
+ * Fixtures do not need to descend from Fixture: this implementation is
+ * provided as a default for tests that do not need one, or as a base for
+ * fixtures that do not need reset().
+ */
+struct Fixture
+{
+    virtual ~Fixture() {}
+
+    // Called before each test
+    virtual void test_setup() {}
+
+    // Called after each test
+    virtual void test_teardown() {}
+};
+
+/**
+ * Test case that includes a fixture
+ */
+template<typename FIXTURE>
+struct FixtureTestCase : public TestCase
+{
+    typedef FIXTURE Fixture;
+
+    Fixture* fixture = 0;
+    std::function<Fixture*()> make_fixture;
+
+    template<typename... Args>
+    FixtureTestCase(const std::string& name, Args... args)
+        : TestCase(name)
+    {
+        make_fixture = [=]() { return new Fixture(args...); };
+    }
+
+    void setup() override
+    {
+        TestCase::setup();
+        fixture = make_fixture();
+    }
+
+    void teardown() override
+    {
+        delete fixture;
+        fixture = 0;
+        TestCase::teardown();
+    }
+
+    void method_setup(TestMethodResult& mr) override
+    {
+        TestCase::method_setup(mr);
+        if (fixture) fixture->test_setup();
+    }
+
+    void method_teardown(TestMethodResult& mr) override
+    {
+        if (fixture) fixture->test_teardown();
+        TestCase::method_teardown(mr);
+    }
+
+    /**
+     * Add a method that takes a reference to the fixture as argument.
+     *
+     * Any extra arguments to the function will be passed to the test method
+     * after the fixture.
+     */
+    template<typename FUNC, typename ...Args>
+    void add_method(const std::string& name, FUNC test_function, Args&&... args)
+    {
+        methods.emplace_back(name, [this, test_function, args...] { test_function(*fixture, args...); });
+    }
+};
+
+#if 0
+    struct Test
+    {
+        std::string name;
+        std::function<void()> test_func;
+    };
+
+    /// Add tests to the test case
+    virtual void add_tests() {}
+#endif
+
+
+}
+}
+
+#endif
diff --git a/rep/amber.png b/rep/amber.png
deleted file mode 100644
index 2cab170..0000000
--- a/rep/amber.png
+++ /dev/null
diff --git a/rep/emerald.png b/rep/emerald.png
deleted file mode 100644
index 38ad4f4..0000000
--- a/rep/emerald.png
+++ /dev/null
diff --git a/rep/ept/apt/apt.cc.gcov.html b/rep/ept/apt/apt.cc.gcov.html
deleted file mode 100644
index ee60a5c..0000000
--- a/rep/ept/apt/apt.cc.gcov.html
+++ /dev/null
@@ -1,707 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/apt/apt.cc</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/apt</a> - apt.cc</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">323</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">76.8 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">248</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /** \file
-<span class="lineNum">       2 </span>                :  * High-level front-end to libapt-pkg, as a data provider for the ept framework.
-<span class="lineNum">       3 </span>                :  */
-<span class="lineNum">       4 </span>                : 
-<span class="lineNum">       5 </span>                : /* 
-<span class="lineNum">       6 </span>                :  * Copyright (C) 2007,2008  Enrico Zini &lt;enrico@enricozini.org&gt;
-<span class="lineNum">       7 </span>                :  *
-<span class="lineNum">       8 </span>                :  * This library is free software; you can redistribute it and/or
-<span class="lineNum">       9 </span>                :  * modify it under the terms of the GNU Lesser General Public
-<span class="lineNum">      10 </span>                :  * License as published by the Free Software Foundation; either
-<span class="lineNum">      11 </span>                :  * version 2.1 of the License, or (at your option) any later version.
-<span class="lineNum">      12 </span>                :  *
-<span class="lineNum">      13 </span>                :  * This library is distributed in the hope that it will be useful,
-<span class="lineNum">      14 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      15 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-<span class="lineNum">      16 </span>                :  * Lesser General Public License for more details.
-<span class="lineNum">      17 </span>                :  *
-<span class="lineNum">      18 </span>                :  * You should have received a copy of the GNU Lesser General Public
-<span class="lineNum">      19 </span>                :  * License along with this library; if not, write to the Free Software
-<span class="lineNum">      20 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
-<span class="lineNum">      21 </span>                :  */
-<span class="lineNum">      22 </span>                : 
-<span class="lineNum">      23 </span>                : #include &lt;ept/apt/apt.h&gt;
-<span class="lineNum">      24 </span>                : 
-<span class="lineNum">      25 </span>                : #include &lt;apt-pkg/error.h&gt;
-<span class="lineNum">      26 </span>                : #include &lt;apt-pkg/init.h&gt;
-<span class="lineNum">      27 </span>                : #include &lt;apt-pkg/progress.h&gt;
-<span class="lineNum">      28 </span>                : #include &lt;apt-pkg/sourcelist.h&gt;
-<span class="lineNum">      29 </span>                : #include &lt;apt-pkg/pkgcachegen.h&gt;
-<span class="lineNum">      30 </span>                : #include &lt;apt-pkg/policy.h&gt;
-<span class="lineNum">      31 </span>                : #include &lt;apt-pkg/cachefile.h&gt;
-<span class="lineNum">      32 </span>                : 
-<span class="lineNum">      33 </span>                : #include &lt;wibble/sys/fs.h&gt;
-<span class="lineNum">      34 </span>                : #include &lt;sys/stat.h&gt;
-<span class="lineNum">      35 </span>                : 
-<span class="lineNum">      36 </span>                : #include &lt;vector&gt;
-<span class="lineNum">      37 </span>                : #include &lt;algorithm&gt;
-<span class="lineNum">      38 </span>                : 
-<span class="lineNum">      39 </span>                : #include &lt;iostream&gt;
-<span class="lineNum">      40 </span>                : 
-<span class="lineNum">      41 </span>                : using namespace std;
-<span class="lineNum">      42 </span>                : 
-<span class="lineNum">      43 </span>                : namespace ept {
-<span class="lineNum">      44 </span>                : namespace apt {
-<span class="lineNum">      45 </span>                : using core::aptTimestamp;
-<span class="lineNum">      46 </span>                : 
-<span class="lineNum">      47 </span><span class="lineNoCov">              0 : Exception::Exception(const std::string&amp; context) throw ()</span>
-<span class="lineNum">      48 </span><span class="lineNoCov">              0 :         : Generic(context)</span>
-<span class="lineNum">      49 </span>                : {
-<span class="lineNum">      50 </span>                :         // Concatenate all errors and warnings found
-<span class="lineNum">      51 </span><span class="lineNoCov">              0 :         string err;</span>
-<span class="lineNum">      52 </span><span class="lineNoCov">              0 :         while (!_error-&gt;empty())</span>
-<span class="lineNum">      53 </span>                :         {
-<span class="lineNum">      54 </span><span class="lineNoCov">              0 :                 bool type = _error-&gt;PopMessage(err);</span>
-<span class="lineNum">      55 </span><span class="lineNoCov">              0 :                 if (type)</span>
-<span class="lineNum">      56 </span><span class="lineNoCov">              0 :                         m_message += &quot;E: &quot; + err + &quot;\n&quot;;</span>
-<span class="lineNum">      57 </span>                :                 else
-<span class="lineNum">      58 </span><span class="lineNoCov">              0 :                         m_message += &quot;W: &quot; + err + &quot;\n&quot;;</span>
-<span class="lineNum">      59 </span><span class="lineNoCov">              0 :    }</span>
-<span class="lineNum">      60 </span><span class="lineNoCov">              0 : }</span>
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span><span class="lineCov">             29 : static void aptInit ()</span>
-<span class="lineNum">      63 </span>                : {
-<span class="lineNum">      64 </span><span class="lineCov">             29 :     if (_config-&gt;FindB(&quot;Initialized&quot;))</span>
-<span class="lineNum">      65 </span><span class="lineCov">             29 :         return;</span>
-<span class="lineNum">      66 </span>                : 
-<span class="lineNum">      67 </span><span class="lineNoCov">              0 :     if (!pkgInitConfig (*_config))</span>
-<span class="lineNum">      68 </span><span class="lineNoCov">              0 :                 throw Exception(&quot;initialising apt configuration&quot;);</span>
-<span class="lineNum">      69 </span>                : 
-<span class="lineNum">      70 </span><span class="lineNoCov">              0 :     _config-&gt;Set(&quot;Initialized&quot;, 1);</span>
-<span class="lineNum">      71 </span>                : 
-<span class="lineNum">      72 </span>                :         /*
-<span class="lineNum">      73 </span>                :     _config-&gt;Set(&quot;Dir&quot;, CACHE_DIR);
-<span class="lineNum">      74 </span>                :     _config-&gt;Set(&quot;Dir::Cache&quot;, &quot;cache&quot;);
-<span class="lineNum">      75 </span>                :     _config-&gt;Set(&quot;Dir::State&quot;, &quot;state&quot;);
-<span class="lineNum">      76 </span>                :     _config-&gt;Set(&quot;Dir::Etc&quot;, &quot;etc&quot;);
-<span class="lineNum">      77 </span>                :     _config-&gt;Set(&quot;Dir::State::status&quot;, CACHE_DIR &quot;dpkg-status&quot;);
-<span class="lineNum">      78 </span>                :         */
-<span class="lineNum">      79 </span><span class="lineNoCov">              0 :     if (!pkgInitSystem (*_config, _system))</span>
-<span class="lineNum">      80 </span><span class="lineNoCov">              0 :                 throw Exception(&quot;initialising apt system&quot;);</span>
-<span class="lineNum">      81 </span>                : }
-<span class="lineNum">      82 </span>                : 
-<span class="lineNum">      83 </span>                : struct AptImplementation
-<span class="lineNum">      84 </span>                : {
-<span class="lineNum">      85 </span>                :         pkgSourceList* m_list;
-<span class="lineNum">      86 </span>                :         MMap *m;
-<span class="lineNum">      87 </span>                :         OpProgress progress;
-<span class="lineNum">      88 </span>                :         pkgCache* m_cache;
-<span class="lineNum">      89 </span>                :         pkgPolicy* m_policy;
-<span class="lineNum">      90 </span>                :         pkgCacheFile* m_depcache;
-<span class="lineNum">      91 </span>                :         time_t m_open_timestamp;
-<span class="lineNum">      92 </span>                :         
-<span class="lineNum">      93 </span><span class="lineCov">             29 :         AptImplementation() : m_list(0), m(0), m_cache(0), m_policy(0), m_depcache(0), m_open_timestamp(0)</span>
-<span class="lineNum">      94 </span>                :         {
-<span class="lineNum">      95 </span>                :                 // Init the apt library if needed
-<span class="lineNum">      96 </span><span class="lineCov">             29 :                 aptInit();</span>
-<span class="lineNum">      97 </span>                : 
-<span class="lineNum">      98 </span><span class="lineCov">             29 :                 m_open_timestamp = aptTimestamp();</span>
-<span class="lineNum">      99 </span>                : 
-<span class="lineNum">     100 </span><span class="lineCov">             29 :                 m_list = new pkgSourceList;</span>
-<span class="lineNum">     101 </span><span class="lineCov">             58 :                 if (!m_list-&gt;ReadMainList())</span>
-<span class="lineNum">     102 </span><span class="lineNoCov">              0 :                         throw Exception(&quot;reading list of sources&quot;);</span>
-<span class="lineNum">     103 </span>                : 
-<span class="lineNum">     104 </span><span class="lineCov">             29 :                 bool res = pkgMakeStatusCache(*m_list, progress, &amp;m, true);</span>
-<span class="lineNum">     105 </span><span class="lineCov">             29 :                 progress.Done();</span>
-<span class="lineNum">     106 </span><span class="lineCov">             29 :                 if (!res)</span>
-<span class="lineNum">     107 </span><span class="lineNoCov">              0 :                         throw Exception(&quot;Reading the package lists or status file&quot;);</span>
-<span class="lineNum">     108 </span>                : 
-<span class="lineNum">     109 </span><span class="lineCov">             29 :                 m_cache = new pkgCache(m);</span>
-<span class="lineNum">     110 </span><span class="lineCov">             58 :                 m_policy = new pkgPolicy(m_cache);</span>
-<span class="lineNum">     111 </span><span class="lineCov">             58 :                 if (!ReadPinFile(*m_policy))</span>
-<span class="lineNum">     112 </span><span class="lineNoCov">              0 :                         throw Exception(&quot;Reading the policy pin file&quot;);</span>
-<span class="lineNum">     113 </span><span class="lineCov">             29 :         }</span>
-<span class="lineNum">     114 </span>                : 
-<span class="lineNum">     115 </span><span class="lineCov">             29 :         ~AptImplementation()</span>
-<span class="lineNum">     116 </span>                :         {
-<span class="lineNum">     117 </span><span class="lineCov">             29 :                 if (m_depcache) delete m_depcache;</span>
-<span class="lineNum">     118 </span><span class="lineCov">             29 :                 if (m_policy) delete m_policy;</span>
-<span class="lineNum">     119 </span><span class="lineCov">             29 :                 if (m_cache) delete m_cache;</span>
-<span class="lineNum">     120 </span><span class="lineCov">             29 :                 if (m) delete m;</span>
-<span class="lineNum">     121 </span><span class="lineCov">             29 :                 if (m_list) delete m_list;</span>
-<span class="lineNum">     122 </span><span class="lineCov">             29 :         }</span>
-<span class="lineNum">     123 </span>                : 
-<span class="lineNum">     124 </span><span class="lineCov">           3980 :         pkgCache&amp; cache()</span>
-<span class="lineNum">     125 </span>                :         {
-<span class="lineNum">     126 </span><span class="lineCov">           3980 :                 return *m_cache;</span>
-<span class="lineNum">     127 </span>                :         }
-<span class="lineNum">     128 </span>                : 
-<span class="lineNum">     129 </span><span class="lineCov">          16099 :         pkgPolicy&amp; policy()</span>
-<span class="lineNum">     130 </span>                :         {
-<span class="lineNum">     131 </span><span class="lineCov">          16099 :                 return *m_policy;</span>
-<span class="lineNum">     132 </span>                :         }
-<span class="lineNum">     133 </span>                : 
-<span class="lineNum">     134 </span><span class="lineCov">              1 :         pkgCacheFile&amp; depcache()</span>
-<span class="lineNum">     135 </span>                :         {
-<span class="lineNum">     136 </span><span class="lineCov">              1 :                 if (!m_depcache)</span>
-<span class="lineNum">     137 </span>                :                 {
-<span class="lineNum">     138 </span><span class="lineCov">              1 :                         m_depcache = new pkgCacheFile;</span>
-<span class="lineNum">     139 </span><span class="lineCov">              1 :                         if (!m_depcache-&gt;Open(progress, false))</span>
-<span class="lineNum">     140 </span><span class="lineNoCov">              0 :                                 throw Exception(&quot;Opening the cache file&quot;);</span>
-<span class="lineNum">     141 </span>                :                 }
-<span class="lineNum">     142 </span><span class="lineCov">              1 :                 return *m_depcache;</span>
-<span class="lineNum">     143 </span>                :         }
-<span class="lineNum">     144 </span>                : };
-<span class="lineNum">     145 </span>                : 
-<span class="lineNum">     146 </span>                : // Sort a version list by package file locality
-<span class="lineNum">     147 </span><span class="lineCov">          39519 : bool localityCompare(const pkgCache::VerFile* a, const pkgCache::VerFile* b)</span>
-<span class="lineNum">     148 </span>                : {
-<span class="lineNum">     149 </span><span class="lineCov">          39519 :    if (a == 0 &amp;&amp; b == 0)</span>
-<span class="lineNum">     150 </span><span class="lineNoCov">              0 :       return false;</span>
-<span class="lineNum">     151 </span><span class="lineCov">          39519 :    if (a == 0)</span>
-<span class="lineNum">     152 </span><span class="lineNoCov">              0 :       return true;</span>
-<span class="lineNum">     153 </span><span class="lineCov">          39519 :    if (b == 0)</span>
-<span class="lineNum">     154 </span><span class="lineNoCov">              0 :       return false;</span>
-<span class="lineNum">     155 </span>                :    
-<span class="lineNum">     156 </span><span class="lineCov">          39519 :    if (a-&gt;File == b-&gt;File)</span>
-<span class="lineNum">     157 </span><span class="lineCov">          39060 :       return a-&gt;Offset &lt; b-&gt;Offset;</span>
-<span class="lineNum">     158 </span><span class="lineCov">            459 :    return a-&gt;File &lt; b-&gt;File;</span>
-<span class="lineNum">     159 </span>                : }
-<span class="lineNum">     160 </span>                : 
-<span class="lineNum">     161 </span>                : // Iterate records using the algorithm used by apt-cache dumpavail
-<span class="lineNum">     162 </span>                : struct RecordIteratorImpl
-<span class="lineNum">     163 </span>                : {
-<span class="lineNum">     164 </span>                :         mutable int _ref;
-<span class="lineNum">     165 </span>                :         AptImplementation&amp; apt;
-<span class="lineNum">     166 </span>                :         vector&lt;pkgCache::VerFile*&gt; vflist;
-<span class="lineNum">     167 </span>                :         pkgCache::PkgFileIterator lastFile;
-<span class="lineNum">     168 </span>                :         FileFd file;
-<span class="lineNum">     169 </span>                :         size_t lastOffset;
-<span class="lineNum">     170 </span>                : 
-<span class="lineNum">     171 </span><span class="lineCov">              9 :         RecordIteratorImpl(AptImplementation&amp; apt) : _ref(0), apt(apt), vflist(0)</span>
-<span class="lineNum">     172 </span>                :         {
-<span class="lineNum">     173 </span>                :                 // We already have an estimate of how many versions we're about to find
-<span class="lineNum">     174 </span><span class="lineCov">              9 :                 vflist.reserve(apt.cache().HeaderP-&gt;PackageCount + 1);</span>
-<span class="lineNum">     175 </span>                : 
-<span class="lineNum">     176 </span>                :                 // Populate the vector of versions to print
-<span class="lineNum">     177 </span><span class="lineCov">          34002 :                 for (pkgCache::PkgIterator pi = apt.cache().PkgBegin(); !pi.end(); ++pi)</span>
-<span class="lineNum">     178 </span>                :                 {    
-<span class="lineNum">     179 </span><span class="lineCov">          33993 :                         if (pi-&gt;VersionList == 0)</span>
-<span class="lineNum">     180 </span><span class="lineCov">          17901 :                                 continue;</span>
-<span class="lineNum">     181 </span>                : 
-<span class="lineNum">     182 </span>                :                         /* Get the candidate version or fallback on the installed version,
-<span class="lineNum">     183 </span>                :                          * as usual */
-<span class="lineNum">     184 </span><span class="lineCov">          16092 :                         pkgCache::VerIterator vi = apt.policy().GetCandidateVer(pi);</span>
-<span class="lineNum">     185 </span><span class="lineCov">          16092 :                         if (vi.end() == true)</span>
-<span class="lineNum">     186 </span>                :                         {
-<span class="lineNum">     187 </span><span class="lineCov">           1926 :                                 if (pi-&gt;CurrentVer == 0)</span>
-<span class="lineNum">     188 </span><span class="lineCov">           1926 :                                         continue;</span>
-<span class="lineNum">     189 </span><span class="lineNoCov">              0 :                                 vi = pi.CurrentVer();</span>
-<span class="lineNum">     190 </span>                :                         }
-<span class="lineNum">     191 </span>                : 
-<span class="lineNum">     192 </span>                :                         // Choose a valid file that contains the record for this version
-<span class="lineNum">     193 </span><span class="lineCov">          14166 :                         pkgCache::VerFileIterator vfi = vi.FileList();</span>
-<span class="lineNum">     194 </span><span class="lineCov">          24507 :                         for ( ; !vfi.end(); ++vfi)</span>
-<span class="lineNum">     195 </span><span class="lineCov">          14166 :                                 if ((vfi.File()-&gt;Flags &amp; pkgCache::Flag::NotSource) == 0)</span>
-<span class="lineNum">     196 </span><span class="lineCov">           3825 :                                         break;</span>
-<span class="lineNum">     197 </span>                : 
-<span class="lineNum">     198 </span>                :                         // Handle packages whose candidate version is currently installed
-<span class="lineNum">     199 </span>                :                         // from outside the archives (like from a locally built .deb
-<span class="lineNum">     200 </span><span class="lineCov">          14166 :                         if (vfi.end() == true)</span>
-<span class="lineNum">     201 </span>                :                         {
-<span class="lineNum">     202 </span><span class="lineCov">          20682 :                                 for (pkgCache::VerIterator cur = pi.VersionList(); cur.end() != true; cur++)</span>
-<span class="lineNum">     203 </span>                :                                 {
-<span class="lineNum">     204 </span><span class="lineCov">          20763 :                                         for (vfi = cur.FileList(); vfi.end() == false; vfi++)</span>
-<span class="lineNum">     205 </span>                :                                         {        
-<span class="lineNum">     206 </span><span class="lineCov">          10422 :                                                 if ((vfi.File()-&gt;Flags &amp; pkgCache::Flag::NotSource) == 0)</span>
-<span class="lineNum">     207 </span>                :                                                 {
-<span class="lineNum">     208 </span><span class="lineCov">             81 :                                                         vfi = vi.FileList();</span>
-<span class="lineNum">     209 </span><span class="lineCov">             81 :                                                         break;</span>
-<span class="lineNum">     210 </span>                :                                                 }
-<span class="lineNum">     211 </span>                :                                         }
-<span class="lineNum">     212 </span>                : 
-<span class="lineNum">     213 </span><span class="lineCov">          10422 :                                         if (vfi.end() == false)</span>
-<span class="lineNum">     214 </span><span class="lineCov">             81 :                                                 break;</span>
-<span class="lineNum">     215 </span>                :                                 }
-<span class="lineNum">     216 </span>                :                         }
-<span class="lineNum">     217 </span><span class="lineCov">          14166 :                         if (!vfi.end())</span>
-<span class="lineNum">     218 </span><span class="lineCov">           3906 :                                 vflist.push_back(vfi);</span>
-<span class="lineNum">     219 </span>                :                 }
-<span class="lineNum">     220 </span>                : 
-<span class="lineNum">     221 </span>                :                 //cerr &lt;&lt; vflist.size() &lt;&lt; &quot; versions found&quot; &lt;&lt; endl;
-<span class="lineNum">     222 </span>                : 
-<span class="lineNum">     223 </span><span class="lineCov">              9 :                 sort(vflist.begin(), vflist.end(), localityCompare);</span>
-<span class="lineNum">     224 </span>                : 
-<span class="lineNum">     225 </span>                :                 //for (size_t i = 0; i &lt; vflist.size(); ++i)
-<span class="lineNum">     226 </span>                :                 //{
-<span class="lineNum">     227 </span>                :                 //      pkgCache::PkgFileIterator fi(apt.cache(), vflist[i]-&gt;File + apt.cache().PkgFileP);
-<span class="lineNum">     228 </span>                :                 //      cerr &lt;&lt; i &lt;&lt; &quot;: &quot; &lt;&lt; fi.FileName() &lt;&lt; &quot;:&quot; &lt;&lt; vflist[i]-&gt;Offset &lt;&lt; &quot;-&quot; &lt;&lt; vflist[i]-&gt;Size &lt;&lt; endl;
-<span class="lineNum">     229 </span>                :                 //}
-<span class="lineNum">     230 </span>                :                 //cerr &lt;&lt; &quot;Done indexing.&quot; &lt;&lt; endl;
-<span class="lineNum">     231 </span><span class="lineCov">              9 :         }</span>
-<span class="lineNum">     232 </span>                : 
-<span class="lineNum">     233 </span><span class="lineCov">              9 :         ~RecordIteratorImpl()</span>
-<span class="lineNum">     234 </span>                :         {
-<span class="lineNum">     235 </span><span class="lineCov">              9 :                 if (file.IsOpen())</span>
-<span class="lineNum">     236 </span><span class="lineCov">              9 :                         file.Close();</span>
-<span class="lineNum">     237 </span><span class="lineCov">              9 :         }</span>
-<span class="lineNum">     238 </span>                : 
-<span class="lineNum">     239 </span><span class="lineCov">             14 :         void ref() { ++_ref; }</span>
-<span class="lineNum">     240 </span><span class="lineCov">             14 :         bool unref() { return --_ref == 0; }</span>
-<span class="lineNum">     241 </span>                : 
-<span class="lineNum">     242 </span><span class="lineCov">           3906 :         size_t size() { return vflist.size(); }</span>
-<span class="lineNum">     243 </span>                : 
-<span class="lineNum">     244 </span><span class="lineCov">           3906 :         string record(size_t idx)</span>
-<span class="lineNum">     245 </span>                :         {
-<span class="lineNum">     246 </span>                :                 //cerr &lt;&lt; &quot;Access record &quot; &lt;&lt; idx &lt;&lt; endl;
-<span class="lineNum">     247 </span>                :                 //cerr &lt;&lt; &quot;lastfile: &quot; &lt;&lt; (lastFile.Cache() != 0) &lt;&lt; endl;
-<span class="lineNum">     248 </span>                :                 // We can't reuse the file that was already open: open the new one
-<span class="lineNum">     249 </span><span class="lineCov">           3906 :                 if ((lastFile.Cache() == 0) || vflist[idx]-&gt;File + apt.cache().PkgFileP != lastFile)</span>
-<span class="lineNum">     250 </span>                :                 {
-<span class="lineNum">     251 </span>                :                         //cerr &lt;&lt; &quot;Needs open/reopen&quot; &lt;&lt; endl;
-<span class="lineNum">     252 </span><span class="lineCov">             18 :                         lastFile = pkgCache::PkgFileIterator(apt.cache(), vflist[idx]-&gt;File + apt.cache().PkgFileP);</span>
-<span class="lineNum">     253 </span><span class="lineCov">             18 :                         if (!lastFile.IsOk())</span>
-<span class="lineNum">     254 </span><span class="lineNoCov">              0 :                                 throw Exception(string(&quot;Reading the data record for a package from file &quot;) + lastFile.FileName());</span>
-<span class="lineNum">     255 </span>                :                         //cerr &lt;&lt; &quot;Ok for &quot; &lt;&lt; lastFile.FileName() &lt;&lt; endl;
-<span class="lineNum">     256 </span><span class="lineCov">             18 :                         if (file.IsOpen())</span>
-<span class="lineNum">     257 </span><span class="lineCov">              9 :                                 file.Close();</span>
-<span class="lineNum">     258 </span><span class="lineCov">             18 :                         if (!file.Open(lastFile.FileName(), FileFd::ReadOnly))</span>
-<span class="lineNum">     259 </span><span class="lineNoCov">              0 :                                 throw Exception(string(&quot;Opening file &quot;) + lastFile.FileName());</span>
-<span class="lineNum">     260 </span>                :                         //cerr &lt;&lt; &quot;Opened &quot; &lt;&lt; lastFile.FileName() &lt;&lt; endl;
-<span class="lineNum">     261 </span><span class="lineCov">             18 :                         lastOffset = 0;</span>
-<span class="lineNum">     262 </span>                :                 }
-<span class="lineNum">     263 </span>                : 
-<span class="lineNum">     264 </span>                :                 //cerr &lt;&lt; &quot;Reading from &quot; &lt;&lt; lastFile.FileName() &lt;&lt; &quot;:&quot; &lt;&lt; vflist[idx]-&gt;Offset &lt;&lt; &quot;-&quot; &lt;&lt; vflist[idx]-&gt;Size &lt;&lt; &quot; (lastOffset: &quot; &lt;&lt; lastOffset &lt;&lt; &quot;)&quot; &lt;&lt; endl;
-<span class="lineNum">     265 </span>                : 
-<span class="lineNum">     266 </span>                :                 // If we start near were we ended, avoid a seek and enlarge the read a bit
-<span class="lineNum">     267 </span><span class="lineCov">           3906 :                 size_t slack = vflist[idx]-&gt;Offset - lastOffset;</span>
-<span class="lineNum">     268 </span>                :                 //cerr &lt;&lt; &quot;Slack: &quot; &lt;&lt; slack &lt;&lt; endl;
-<span class="lineNum">     269 </span><span class="lineCov">           3906 :                 if (slack &gt; 8)</span>
-<span class="lineNum">     270 </span>                :                 {
-<span class="lineNum">     271 </span>                :                         //cerr &lt;&lt; &quot;Slack too big: seek to &quot; &lt;&lt; vflist[idx]-&gt;Offset &lt;&lt; endl;
-<span class="lineNum">     272 </span><span class="lineCov">            171 :                         slack = 0;</span>
-<span class="lineNum">     273 </span><span class="lineCov">            171 :                         if (!file.Seek(vflist[idx]-&gt;Offset))</span>
-<span class="lineNum">     274 </span><span class="lineNoCov">              0 :                                 throw Exception(string(&quot;Cannot seek to package record in file &quot;) + lastFile.FileName());</span>
-<span class="lineNum">     275 </span>                :                 }
-<span class="lineNum">     276 </span>                : 
-<span class="lineNum">     277 </span><span class="lineCov">           3906 :                 char buffer[vflist[idx]-&gt;Size + slack + 1];</span>
-<span class="lineNum">     278 </span><span class="lineCov">           3906 :                 if (!file.Read(buffer, vflist[idx]-&gt;Size + slack))</span>
-<span class="lineNum">     279 </span><span class="lineNoCov">              0 :                         throw Exception(string(&quot;Cannot read package record in file &quot;) + lastFile.FileName());</span>
-<span class="lineNum">     280 </span><span class="lineCov">           3906 :                 buffer[vflist[idx]-&gt;Size + slack] = '\n';</span>
-<span class="lineNum">     281 </span>                :                 //cerr &lt;&lt; &quot;Data read (slack: &quot; &lt;&lt; slack &lt;&lt; &quot;)&quot; &lt;&lt; endl;
-<span class="lineNum">     282 </span>                : 
-<span class="lineNum">     283 </span><span class="lineCov">           3906 :                 lastOffset = vflist[idx]-&gt;Offset + vflist[idx]-&gt;Size;</span>
-<span class="lineNum">     284 </span>                : 
-<span class="lineNum">     285 </span><span class="lineCov">           3906 :                 return string(buffer+slack);</span>
-<span class="lineNum">     286 </span>                :         }
-<span class="lineNum">     287 </span>                : };
-<span class="lineNum">     288 </span>                : 
-<span class="lineNum">     289 </span><span class="lineCov">             20 : Apt::Iterator::Iterator(const Iterator&amp; i)</span>
-<span class="lineNum">     290 </span>                : {
-<span class="lineNum">     291 </span><span class="lineCov">             20 :         if (i.cur)</span>
-<span class="lineNum">     292 </span>                :         {
-<span class="lineNum">     293 </span><span class="lineCov">             10 :                 pkgCache::PkgIterator* p = new pkgCache::PkgIterator;</span>
-<span class="lineNum">     294 </span><span class="lineCov">             10 :                 *p = *static_cast&lt;pkgCache::PkgIterator*&gt;(i.cur);</span>
-<span class="lineNum">     295 </span><span class="lineCov">             10 :                 cur = p;</span>
-<span class="lineNum">     296 </span>                :         } else
-<span class="lineNum">     297 </span><span class="lineCov">             10 :                 cur = 0;</span>
-<span class="lineNum">     298 </span><span class="lineCov">             20 : }</span>
-<span class="lineNum">     299 </span>                : 
-<span class="lineNum">     300 </span><span class="lineNoCov">              0 : Apt::Iterator&amp; Apt::Iterator::operator=(const Iterator&amp; i)</span>
-<span class="lineNum">     301 </span>                : {
-<span class="lineNum">     302 </span><span class="lineNoCov">              0 :         if (cur != i.cur)</span>
-<span class="lineNum">     303 </span>                :         {
-<span class="lineNum">     304 </span><span class="lineNoCov">              0 :                 if (cur) delete static_cast&lt;pkgCache::PkgIterator*&gt;(cur);</span>
-<span class="lineNum">     305 </span><span class="lineNoCov">              0 :                 if (i.cur)</span>
-<span class="lineNum">     306 </span>                :                 {
-<span class="lineNum">     307 </span><span class="lineNoCov">              0 :                         pkgCache::PkgIterator* p = new pkgCache::PkgIterator;</span>
-<span class="lineNum">     308 </span><span class="lineNoCov">              0 :                         *p = *static_cast&lt;pkgCache::PkgIterator*&gt;(i.cur);</span>
-<span class="lineNum">     309 </span><span class="lineNoCov">              0 :                         cur = p;</span>
-<span class="lineNum">     310 </span>                :                 } else
-<span class="lineNum">     311 </span><span class="lineNoCov">              0 :                         cur = 0;</span>
-<span class="lineNum">     312 </span>                :         }
-<span class="lineNum">     313 </span><span class="lineNoCov">              0 :         return *this;</span>
-<span class="lineNum">     314 </span>                : }
-<span class="lineNum">     315 </span>                : 
-<span class="lineNum">     316 </span><span class="lineCov">           3605 : Apt::Iterator::~Iterator()</span>
-<span class="lineNum">     317 </span>                : {
-<span class="lineNum">     318 </span><span class="lineCov">           3605 :         if (cur) delete static_cast&lt;pkgCache::PkgIterator*&gt;(cur);</span>
-<span class="lineNum">     319 </span><span class="lineCov">           3605 : }</span>
-<span class="lineNum">     320 </span><span class="lineCov">           5364 : std::string Apt::Iterator::operator*()</span>
-<span class="lineNum">     321 </span>                : {
-<span class="lineNum">     322 </span><span class="lineCov">           5364 :         return static_cast&lt;pkgCache::PkgIterator*&gt;(cur)-&gt;Name();</span>
-<span class="lineNum">     323 </span>                : }
-<span class="lineNum">     324 </span><span class="lineCov">           7152 : Apt::Iterator&amp; Apt::Iterator::operator++()</span>
-<span class="lineNum">     325 </span>                : {
-<span class="lineNum">     326 </span><span class="lineCov">           7152 :         pkgCache::PkgIterator* iter = static_cast&lt;pkgCache::PkgIterator*&gt;(cur);</span>
-<span class="lineNum">     327 </span><span class="lineCov">           7152 :         ++*iter;</span>
-<span class="lineNum">     328 </span><span class="lineCov">          22260 :         while (!iter-&gt;end() &amp;&amp; (*iter)-&gt;VersionList == 0)</span>
-<span class="lineNum">     329 </span><span class="lineCov">           7956 :                 ++*iter;</span>
-<span class="lineNum">     330 </span><span class="lineCov">           7152 :         if (iter-&gt;end())</span>
-<span class="lineNum">     331 </span>                :         {
-<span class="lineNum">     332 </span><span class="lineCov">              4 :                 delete iter;</span>
-<span class="lineNum">     333 </span><span class="lineCov">              4 :                 cur = 0;</span>
-<span class="lineNum">     334 </span>                :         }
-<span class="lineNum">     335 </span><span class="lineCov">           7152 :         return *this;</span>
-<span class="lineNum">     336 </span>                : }
-<span class="lineNum">     337 </span><span class="lineNoCov">              0 : bool Apt::Iterator::operator==(const Iterator&amp; i) const</span>
-<span class="lineNum">     338 </span>                : {
-<span class="lineNum">     339 </span><span class="lineNoCov">              0 :         if (cur == 0 &amp;&amp; i.cur == 0)</span>
-<span class="lineNum">     340 </span><span class="lineNoCov">              0 :                 return true;</span>
-<span class="lineNum">     341 </span><span class="lineNoCov">              0 :         if (cur == 0 || i.cur == 0)</span>
-<span class="lineNum">     342 </span><span class="lineNoCov">              0 :                 return false;</span>
-<span class="lineNum">     343 </span><span class="lineNoCov">              0 :         pkgCache::PkgIterator* iter1 = static_cast&lt;pkgCache::PkgIterator*&gt;(cur);</span>
-<span class="lineNum">     344 </span><span class="lineNoCov">              0 :         pkgCache::PkgIterator* iter2 = static_cast&lt;pkgCache::PkgIterator*&gt;(i.cur);</span>
-<span class="lineNum">     345 </span><span class="lineNoCov">              0 :         return *iter1 == *iter2;</span>
-<span class="lineNum">     346 </span>                : }
-<span class="lineNum">     347 </span><span class="lineCov">           7157 : bool Apt::Iterator::operator!=(const Iterator&amp; i) const</span>
-<span class="lineNum">     348 </span>                : {
-<span class="lineNum">     349 </span><span class="lineCov">           7157 :         if (cur == 0 &amp;&amp; i.cur == 0)</span>
-<span class="lineNum">     350 </span><span class="lineCov">              4 :                 return false;</span>
-<span class="lineNum">     351 </span><span class="lineCov">           7153 :         if (cur == 0 || i.cur == 0)</span>
-<span class="lineNum">     352 </span><span class="lineCov">           7153 :                 return true;</span>
-<span class="lineNum">     353 </span><span class="lineNoCov">              0 :         pkgCache::PkgIterator* iter1 = static_cast&lt;pkgCache::PkgIterator*&gt;(cur);</span>
-<span class="lineNum">     354 </span><span class="lineNoCov">              0 :         pkgCache::PkgIterator* iter2 = static_cast&lt;pkgCache::PkgIterator*&gt;(i.cur);</span>
-<span class="lineNum">     355 </span><span class="lineNoCov">              0 :         return *iter1 != *iter2;</span>
-<span class="lineNum">     356 </span>                : }
-<span class="lineNum">     357 </span>                : 
-<span class="lineNum">     358 </span>                : 
-<span class="lineNum">     359 </span><span class="lineCov">              9 : Apt::RecordIterator::RecordIterator(RecordIteratorImpl* impl, size_t pos)</span>
-<span class="lineNum">     360 </span><span class="lineCov">              9 :         : impl(impl), pos(pos), cur_pos(pos)</span>
-<span class="lineNum">     361 </span>                : {
-<span class="lineNum">     362 </span><span class="lineCov">              9 :         if (impl)</span>
-<span class="lineNum">     363 </span>                :         {
-<span class="lineNum">     364 </span><span class="lineCov">              9 :                 impl-&gt;ref();</span>
-<span class="lineNum">     365 </span><span class="lineCov">              9 :                 cur = impl-&gt;record(pos);</span>
-<span class="lineNum">     366 </span><span class="lineCov">              9 :                 cur_pos = pos;</span>
-<span class="lineNum">     367 </span>                :         }
-<span class="lineNum">     368 </span><span class="lineCov">              9 : }</span>
-<span class="lineNum">     369 </span><span class="lineCov">             10 : Apt::RecordIterator::RecordIterator(const RecordIterator&amp; r)</span>
-<span class="lineNum">     370 </span><span class="lineCov">             10 :         : impl(r.impl), pos(r.pos), cur(r.cur), cur_pos(r.cur_pos)</span>
-<span class="lineNum">     371 </span>                : {
-<span class="lineNum">     372 </span><span class="lineCov">             10 :         if (impl)</span>
-<span class="lineNum">     373 </span><span class="lineCov">              5 :                 impl-&gt;ref();</span>
-<span class="lineNum">     374 </span><span class="lineCov">             10 : }</span>
-<span class="lineNum">     375 </span><span class="lineCov">           3500 : Apt::RecordIterator::~RecordIterator()</span>
-<span class="lineNum">     376 </span>                : {
-<span class="lineNum">     377 </span><span class="lineCov">           3500 :         if (impl &amp;&amp; impl-&gt;unref())</span>
-<span class="lineNum">     378 </span><span class="lineCov">              1 :                 delete impl;</span>
-<span class="lineNum">     379 </span><span class="lineCov">           3500 : }</span>
-<span class="lineNum">     380 </span><span class="lineCov">           3906 : std::string Apt::RecordIterator::operator*()</span>
-<span class="lineNum">     381 </span>                : {
-<span class="lineNum">     382 </span><span class="lineCov">           3906 :         if (cur_pos != pos)</span>
-<span class="lineNum">     383 </span>                :         {
-<span class="lineNum">     384 </span><span class="lineCov">           3464 :                 cur = impl-&gt;record(pos);</span>
-<span class="lineNum">     385 </span><span class="lineCov">           3464 :                 cur_pos = pos;</span>
-<span class="lineNum">     386 </span>                :         }
-<span class="lineNum">     387 </span><span class="lineCov">           3906 :         return cur;</span>
-<span class="lineNum">     388 </span>                : }
-<span class="lineNum">     389 </span><span class="lineCov">            868 : std::string* Apt::RecordIterator::operator-&gt;()</span>
-<span class="lineNum">     390 </span>                : {
-<span class="lineNum">     391 </span><span class="lineCov">            868 :         if (cur_pos != pos)</span>
-<span class="lineNum">     392 </span>                :         {
-<span class="lineNum">     393 </span><span class="lineCov">            433 :                 cur = impl-&gt;record(pos);</span>
-<span class="lineNum">     394 </span><span class="lineCov">            433 :                 cur_pos = pos;</span>
-<span class="lineNum">     395 </span>                :         }
-<span class="lineNum">     396 </span><span class="lineCov">            868 :         return &amp;cur;</span>
-<span class="lineNum">     397 </span>                : }
-<span class="lineNum">     398 </span><span class="lineCov">           3906 : Apt::RecordIterator&amp; Apt::RecordIterator::operator++()</span>
-<span class="lineNum">     399 </span>                : {
-<span class="lineNum">     400 </span><span class="lineCov">           3906 :         ++pos;</span>
-<span class="lineNum">     401 </span><span class="lineCov">           3906 :         if (pos &gt;= impl-&gt;size())</span>
-<span class="lineNum">     402 </span>                :         {
-<span class="lineNum">     403 </span>                :                 // If we reach the end, we become an end iterator
-<span class="lineNum">     404 </span><span class="lineCov">              9 :                 if (impl &amp;&amp; impl-&gt;unref())</span>
-<span class="lineNum">     405 </span><span class="lineCov">              8 :                         delete impl;</span>
-<span class="lineNum">     406 </span><span class="lineCov">              9 :                 impl = 0;</span>
-<span class="lineNum">     407 </span><span class="lineCov">              9 :                 pos = 0;</span>
-<span class="lineNum">     408 </span>                :         }
-<span class="lineNum">     409 </span><span class="lineCov">           3906 :         return *this;</span>
-<span class="lineNum">     410 </span>                : }
-<span class="lineNum">     411 </span><span class="lineNoCov">              0 : Apt::RecordIterator&amp; Apt::RecordIterator::operator=(const RecordIterator&amp; r)</span>
-<span class="lineNum">     412 </span>                : {
-<span class="lineNum">     413 </span>                :         // Increment first, to avoid it reaching zero on assignment to self
-<span class="lineNum">     414 </span><span class="lineNoCov">              0 :         if (r.impl) r.impl-&gt;ref();</span>
-<span class="lineNum">     415 </span><span class="lineNoCov">              0 :         if (impl &amp;&amp; impl-&gt;unref())</span>
-<span class="lineNum">     416 </span><span class="lineNoCov">              0 :                 delete impl;</span>
-<span class="lineNum">     417 </span><span class="lineNoCov">              0 :         impl = r.impl;</span>
-<span class="lineNum">     418 </span><span class="lineNoCov">              0 :         pos = r.pos;</span>
-<span class="lineNum">     419 </span><span class="lineNoCov">              0 :         cur = r.cur;</span>
-<span class="lineNum">     420 </span><span class="lineNoCov">              0 :         cur_pos = r.cur_pos;</span>
-<span class="lineNum">     421 </span><span class="lineNoCov">              0 :         return *this;</span>
-<span class="lineNum">     422 </span>                : }
-<span class="lineNum">     423 </span><span class="lineNoCov">              0 : bool Apt::RecordIterator::operator==(const RecordIterator&amp; ri) const</span>
-<span class="lineNum">     424 </span>                : {
-<span class="lineNum">     425 </span><span class="lineNoCov">              0 :         return impl == ri.impl &amp;&amp; pos == ri.pos;</span>
-<span class="lineNum">     426 </span>                : }
-<span class="lineNum">     427 </span><span class="lineCov">           3915 : bool Apt::RecordIterator::operator!=(const RecordIterator&amp; ri) const</span>
-<span class="lineNum">     428 </span>                : {
-<span class="lineNum">     429 </span><span class="lineCov">           3915 :         return impl != ri.impl || pos != ri.pos;</span>
-<span class="lineNum">     430 </span>                : }
-<span class="lineNum">     431 </span>                : 
-<span class="lineNum">     432 </span>                : 
-<span class="lineNum">     433 </span><span class="lineCov">             28 : Apt::Apt() : impl(new AptImplementation()) {}</span>
-<span class="lineNum">     434 </span><span class="lineCov">             28 : Apt::~Apt() { delete impl; }</span>
-<span class="lineNum">     435 </span>                : 
-<span class="lineNum">     436 </span><span class="lineCov">              4 : Apt::iterator Apt::begin() const</span>
-<span class="lineNum">     437 </span>                : {
-<span class="lineNum">     438 </span><span class="lineCov">              4 :         pkgCache::PkgIterator* p = new pkgCache::PkgIterator;</span>
-<span class="lineNum">     439 </span><span class="lineCov">              4 :         *p = impl-&gt;cache().PkgBegin();</span>
-<span class="lineNum">     440 </span><span class="lineCov">              4 :         return Apt::Iterator(p);</span>
-<span class="lineNum">     441 </span>                : }
-<span class="lineNum">     442 </span>                : 
-<span class="lineNum">     443 </span><span class="lineCov">           3581 : Apt::iterator Apt::end() const</span>
-<span class="lineNum">     444 </span>                : {
-<span class="lineNum">     445 </span><span class="lineCov">           3581 :         return Apt::Iterator();</span>
-<span class="lineNum">     446 </span>                : }
-<span class="lineNum">     447 </span>                : 
-<span class="lineNum">     448 </span><span class="lineCov">              9 : Apt::record_iterator Apt::recordBegin() const</span>
-<span class="lineNum">     449 </span>                : {
-<span class="lineNum">     450 </span><span class="lineCov">              9 :         return Apt::RecordIterator(new RecordIteratorImpl(*impl));</span>
-<span class="lineNum">     451 </span>                : }
-<span class="lineNum">     452 </span>                : 
-<span class="lineNum">     453 </span><span class="lineCov">           3481 : Apt::record_iterator Apt::recordEnd() const</span>
-<span class="lineNum">     454 </span>                : {
-<span class="lineNum">     455 </span><span class="lineCov">           3481 :         return Apt::RecordIterator();</span>
-<span class="lineNum">     456 </span>                : }
-<span class="lineNum">     457 </span>                : 
-<span class="lineNum">     458 </span><span class="lineNoCov">              0 : size_t Apt::size() const</span>
-<span class="lineNum">     459 </span>                : {
-<span class="lineNum">     460 </span><span class="lineNoCov">              0 :         return impl-&gt;cache().HeaderP-&gt;PackageCount;</span>
-<span class="lineNum">     461 </span>                : }
-<span class="lineNum">     462 </span>                : 
-<span class="lineNum">     463 </span><span class="lineCov">             16 : time_t Apt::timestamp()</span>
-<span class="lineNum">     464 </span>                : {
-<span class="lineNum">     465 </span><span class="lineCov">             16 :         return aptTimestamp();</span>
-<span class="lineNum">     466 </span>                : }
-<span class="lineNum">     467 </span>                : 
-<span class="lineNum">     468 </span><span class="lineCov">              5 : bool Apt::isValid(const std::string&amp; pkg) const</span>
-<span class="lineNum">     469 </span>                : {
-<span class="lineNum">     470 </span><span class="lineCov">              5 :         pkgCache::PkgIterator pi = impl-&gt;cache().FindPkg(pkg);</span>
-<span class="lineNum">     471 </span><span class="lineCov">              5 :         return !pi.end();</span>
-<span class="lineNum">     472 </span>                : }
-<span class="lineNum">     473 </span>                : 
-<span class="lineNum">     474 </span><span class="lineCov">              4 : Version Apt::validate(const Version&amp; ver) const</span>
-<span class="lineNum">     475 </span>                : {
-<span class="lineNum">     476 </span><span class="lineCov">              4 :         pkgCache::PkgIterator pi = impl-&gt;cache().FindPkg(ver.name());</span>
-<span class="lineNum">     477 </span><span class="lineCov">              5 :         if (pi.end()) return Version();</span>
-<span class="lineNum">     478 </span><span class="lineCov">              4 :         for (pkgCache::VerIterator vi = pi.VersionList(); !vi.end(); vi++)</span>
-<span class="lineNum">     479 </span>                :         {
-<span class="lineNum">     480 </span><span class="lineCov">              3 :                 const char* v = vi.VerStr();</span>
-<span class="lineNum">     481 </span><span class="lineCov">              3 :                 if (v == 0) continue;</span>
-<span class="lineNum">     482 </span><span class="lineCov">              3 :                 if (ver.version() == v)</span>
-<span class="lineNum">     483 </span><span class="lineCov">              2 :                         return ver;</span>
-<span class="lineNum">     484 </span>                :         }
-<span class="lineNum">     485 </span><span class="lineCov">              1 :         return Version();</span>
-<span class="lineNum">     486 </span>                : }
-<span class="lineNum">     487 </span>                : 
-<span class="lineNum">     488 </span><span class="lineCov">              4 : Version Apt::candidateVersion(const std::string&amp; pkg) const</span>
-<span class="lineNum">     489 </span>                : {
-<span class="lineNum">     490 </span><span class="lineCov">              4 :         pkgCache::PkgIterator pi = impl-&gt;cache().FindPkg(pkg);</span>
-<span class="lineNum">     491 </span><span class="lineCov">              4 :         if (pi.end()) return Version();</span>
-<span class="lineNum">     492 </span><span class="lineCov">              3 :         pkgCache::VerIterator vi = impl-&gt;policy().GetCandidateVer(pi);</span>
-<span class="lineNum">     493 </span><span class="lineCov">              3 :         if (vi.end()) return Version();</span>
-<span class="lineNum">     494 </span><span class="lineCov">              3 :         return Version(pkg, vi.VerStr());</span>
-<span class="lineNum">     495 </span>                : }
-<span class="lineNum">     496 </span>                : 
-<span class="lineNum">     497 </span><span class="lineCov">              2 : Version Apt::installedVersion(const std::string&amp; pkg) const</span>
-<span class="lineNum">     498 </span>                : {
-<span class="lineNum">     499 </span><span class="lineCov">              2 :         pkgCache::PkgIterator pi = impl-&gt;cache().FindPkg(pkg);</span>
-<span class="lineNum">     500 </span><span class="lineCov">              2 :         if (pi.end()) return Version();</span>
-<span class="lineNum">     501 </span><span class="lineCov">              1 :         if (pi-&gt;CurrentVer == 0) return Version();</span>
-<span class="lineNum">     502 </span><span class="lineCov">              1 :         pkgCache::VerIterator vi = pi.CurrentVer();</span>
-<span class="lineNum">     503 </span><span class="lineCov">              1 :         if (vi.end()) return Version();</span>
-<span class="lineNum">     504 </span><span class="lineCov">              1 :         return Version(pkg, vi.VerStr());</span>
-<span class="lineNum">     505 </span>                : }
-<span class="lineNum">     506 </span>                : 
-<span class="lineNum">     507 </span><span class="lineCov">              4 : Version Apt::anyVersion(const std::string&amp; pkg) const</span>
-<span class="lineNum">     508 </span>                : {
-<span class="lineNum">     509 </span><span class="lineCov">              4 :         pkgCache::PkgIterator pi = impl-&gt;cache().FindPkg(pkg);</span>
-<span class="lineNum">     510 </span><span class="lineCov">              4 :         if (pi.end()) return Version();</span>
-<span class="lineNum">     511 </span>                : 
-<span class="lineNum">     512 </span><span class="lineCov">              3 :         pkgCache::VerIterator vi = impl-&gt;policy().GetCandidateVer(pi);</span>
-<span class="lineNum">     513 </span><span class="lineCov">              3 :         if (vi.end())</span>
-<span class="lineNum">     514 </span>                :         {
-<span class="lineNum">     515 </span><span class="lineNoCov">              0 :                 if (pi-&gt;CurrentVer == 0) return Version();</span>
-<span class="lineNum">     516 </span><span class="lineNoCov">              0 :                 vi = pi.CurrentVer();</span>
-<span class="lineNum">     517 </span><span class="lineNoCov">              0 :                 if (vi.end()) return Version();</span>
-<span class="lineNum">     518 </span>                :         }
-<span class="lineNum">     519 </span><span class="lineCov">              3 :         return Version(pkg, vi.VerStr());</span>
-<span class="lineNum">     520 </span>                : }
-<span class="lineNum">     521 </span>                : 
-<span class="lineNum">     522 </span><span class="lineCov">              2 : PackageState Apt::state(const std::string&amp; pkg) const</span>
-<span class="lineNum">     523 </span>                : {
-<span class="lineNum">     524 </span><span class="lineCov">              2 :         pkgCache::PkgIterator pi = impl-&gt;cache().FindPkg(pkg);</span>
-<span class="lineNum">     525 </span><span class="lineCov">              2 :         if (pi.end()) return PackageState();</span>
-<span class="lineNum">     526 </span><span class="lineCov">              1 :         pkgDepCache::StateCache sc = impl-&gt;depcache()[pi];</span>
-<span class="lineNum">     527 </span>                : 
-<span class="lineNum">     528 </span><span class="lineCov">              1 :         unsigned int flags = PackageState::Valid;</span>
-<span class="lineNum">     529 </span>                : 
-<span class="lineNum">     530 </span>                :         // Check if the package is installed
-<span class="lineNum">     531 </span><span class="lineCov">              1 :     if (pi-&gt;CurrentState != pkgCache::State::ConfigFiles &amp;&amp;</span>
-<span class="lineNum">     532 </span>                :                 pi-&gt;CurrentState != pkgCache::State::NotInstalled &amp;&amp;
-<span class="lineNum">     533 </span>                :                 pi-&gt;CurrentVer != 0)
-<span class="lineNum">     534 </span>                :         {
-<span class="lineNum">     535 </span>                :                 // Try to get a VerIterator to the installed version
-<span class="lineNum">     536 </span><span class="lineCov">              1 :                 pkgCache::VerIterator inst = pi.CurrentVer();</span>
-<span class="lineNum">     537 </span><span class="lineCov">              1 :                 if (!inst.end())</span>
-<span class="lineNum">     538 </span>                :                 {
-<span class="lineNum">     539 </span>                :                         // If we made it so far, it is installed
-<span class="lineNum">     540 </span><span class="lineCov">              1 :                         flags |= PackageState::Installed;</span>
-<span class="lineNum">     541 </span>                : 
-<span class="lineNum">     542 </span>                :                         // Now check if it is upgradable
-<span class="lineNum">     543 </span><span class="lineCov">              1 :                         pkgCache::VerIterator cand = impl-&gt;policy().GetCandidateVer(pi);</span>
-<span class="lineNum">     544 </span>                : 
-<span class="lineNum">     545 </span>                :                         // If the candidate version is different than the installed one, then
-<span class="lineNum">     546 </span>                :                         // it is installable
-<span class="lineNum">     547 </span><span class="lineCov">              1 :                         if (!cand.end() &amp;&amp; inst != cand)</span>
-<span class="lineNum">     548 </span><span class="lineNoCov">              0 :                                 flags |= PackageState::Upgradable;</span>
-<span class="lineNum">     549 </span>                :                 }
-<span class="lineNum">     550 </span>                :         }
-<span class="lineNum">     551 </span><span class="lineCov">              1 :     if (sc.Install())</span>
-<span class="lineNum">     552 </span><span class="lineNoCov">              0 :         flags |= PackageState::Install;</span>
-<span class="lineNum">     553 </span><span class="lineCov">              1 :     if ((sc.iFlags &amp; pkgDepCache::ReInstall) == pkgDepCache::ReInstall)</span>
-<span class="lineNum">     554 </span><span class="lineNoCov">              0 :         flags |= PackageState::ReInstall;</span>
-<span class="lineNum">     555 </span><span class="lineCov">              1 :     if (sc.Keep())</span>
-<span class="lineNum">     556 </span><span class="lineCov">              1 :         flags |= PackageState::Keep;</span>
-<span class="lineNum">     557 </span><span class="lineCov">              1 :     if (sc.Delete())</span>
-<span class="lineNum">     558 </span><span class="lineNoCov">              0 :         flags |= PackageState::Remove;</span>
-<span class="lineNum">     559 </span><span class="lineCov">              1 :     if ((sc.iFlags &amp; pkgDepCache::Purge) == pkgDepCache::Purge)</span>
-<span class="lineNum">     560 </span><span class="lineNoCov">              0 :         flags |= PackageState::Purge;</span>
-<span class="lineNum">     561 </span><span class="lineCov">              1 :     if (sc.NowBroken())</span>
-<span class="lineNum">     562 </span><span class="lineNoCov">              0 :         flags |= PackageState::NowBroken;</span>
-<span class="lineNum">     563 </span><span class="lineCov">              1 :     if (sc.InstBroken())</span>
-<span class="lineNum">     564 </span><span class="lineNoCov">              0 :         flags |= PackageState::WillBreak;</span>
-<span class="lineNum">     565 </span>                : 
-<span class="lineNum">     566 </span><span class="lineCov">              1 :         return PackageState(flags);</span>
-<span class="lineNum">     567 </span>                : }
-<span class="lineNum">     568 </span>                : 
-<span class="lineNum">     569 </span><span class="lineCov">              1 : std::string Apt::rawRecord(const std::string&amp; ver) const</span>
-<span class="lineNum">     570 </span>                : {
-<span class="lineNum">     571 </span>                :         // TODO: possibly reimplement using a single lump of apt code, to avoid
-<span class="lineNum">     572 </span>                :         // repeating lookups
-<span class="lineNum">     573 </span><span class="lineCov">              1 :         return rawRecord(anyVersion(ver));</span>
-<span class="lineNum">     574 </span>                : }
-<span class="lineNum">     575 </span>                : 
-<span class="lineNum">     576 </span><span class="lineCov">              4 : std::string Apt::rawRecord(const Version&amp; ver) const</span>
-<span class="lineNum">     577 </span>                : {
-<span class="lineNum">     578 </span><span class="lineCov">              4 :         pkgCache::PkgIterator pi = impl-&gt;cache().FindPkg(ver.name());</span>
-<span class="lineNum">     579 </span><span class="lineCov">              4 :         if (pi.end()) return std::string();</span>
-<span class="lineNum">     580 </span><span class="lineCov">              5 :         for (pkgCache::VerIterator vi = pi.VersionList(); !vi.end(); vi++)</span>
-<span class="lineNum">     581 </span>                :         {
-<span class="lineNum">     582 </span><span class="lineCov">              4 :                 const char* v = vi.VerStr();</span>
-<span class="lineNum">     583 </span><span class="lineCov">              4 :                 if (v == 0) continue;</span>
-<span class="lineNum">     584 </span><span class="lineCov">              4 :                 if (ver.version() == v)</span>
-<span class="lineNum">     585 </span>                :                 {
-<span class="lineNum">     586 </span>                :                         // Code taken and adapted from apt-cache's DisplayRecord
-<span class="lineNum">     587 </span>                : 
-<span class="lineNum">     588 </span>                :                         // Find an appropriate file
-<span class="lineNum">     589 </span><span class="lineCov">              3 :                         pkgCache::VerFileIterator vfi = vi.FileList();</span>
-<span class="lineNum">     590 </span><span class="lineCov">              3 :                         for (; !vfi.end(); vfi++)</span>
-<span class="lineNum">     591 </span><span class="lineCov">              3 :                                 if ((vfi.File()-&gt;Flags &amp; pkgCache::Flag::NotSource) == 0)</span>
-<span class="lineNum">     592 </span><span class="lineCov">              3 :                                         break;</span>
-<span class="lineNum">     593 </span><span class="lineCov">              3 :                         if (vfi.end())</span>
-<span class="lineNum">     594 </span><span class="lineNoCov">              0 :                                 vfi = vi.FileList();</span>
-<span class="lineNum">     595 </span>                : 
-<span class="lineNum">     596 </span>                :                         // Check and load the package list file
-<span class="lineNum">     597 </span><span class="lineCov">              3 :                         pkgCache::PkgFileIterator pfi = vfi.File();</span>
-<span class="lineNum">     598 </span><span class="lineCov">              3 :                         if (!pfi.IsOk())</span>
-<span class="lineNum">     599 </span><span class="lineNoCov">              0 :                                 throw Exception(string(&quot;Reading the data record for a package version from file &quot;) + pfi.FileName());</span>
-<span class="lineNum">     600 </span>                : 
-<span class="lineNum">     601 </span><span class="lineCov">              3 :                         FileFd pkgf(pfi.FileName(), FileFd::ReadOnly);</span>
-<span class="lineNum">     602 </span><span class="lineCov">              6 :                         if (_error-&gt;PendingError() == true)</span>
-<span class="lineNum">     603 </span><span class="lineNoCov">              0 :                                 return std::string();</span>
-<span class="lineNum">     604 </span>                : 
-<span class="lineNum">     605 </span>                :                         // Read the record and then write it out again.
-<span class="lineNum">     606 </span><span class="lineCov">              3 :                         char* buffer = new char[vfi-&gt;Size+1];</span>
-<span class="lineNum">     607 </span><span class="lineCov">              3 :                         buffer[vfi-&gt;Size] = '\n';</span>
-<span class="lineNum">     608 </span><span class="lineCov">              3 :                         if (!pkgf.Seek(vfi-&gt;Offset) || !pkgf.Read(buffer, vfi-&gt;Size))</span>
-<span class="lineNum">     609 </span>                :                         {
-<span class="lineNum">     610 </span><span class="lineNoCov">              0 :                                 delete[] buffer;</span>
-<span class="lineNum">     611 </span><span class="lineNoCov">              0 :                                 return std::string();</span>
-<span class="lineNum">     612 </span>                :                         }
-<span class="lineNum">     613 </span>                : 
-<span class="lineNum">     614 </span><span class="lineCov">              3 :                         std::string res(buffer, vfi-&gt;Size);</span>
-<span class="lineNum">     615 </span><span class="lineCov">              6 :                         delete[] buffer;</span>
-<span class="lineNum">     616 </span><span class="lineCov">              3 :                         return res;</span>
-<span class="lineNum">     617 </span>                :                 }
-<span class="lineNum">     618 </span>                :         }
-<span class="lineNum">     619 </span><span class="lineCov">              1 :         return std::string();</span>
-<span class="lineNum">     620 </span>                : }
-<span class="lineNum">     621 </span>                : 
-<span class="lineNum">     622 </span><span class="lineCov">              2 : void Apt::checkCacheUpdates()</span>
-<span class="lineNum">     623 </span>                : {
-<span class="lineNum">     624 </span><span class="lineCov">              2 :         if (impl-&gt;m_open_timestamp &lt; timestamp())</span>
-<span class="lineNum">     625 </span>                :         {
-<span class="lineNum">     626 </span>                :                 // Crudely reopen everything
-<span class="lineNum">     627 </span><span class="lineCov">              1 :                 delete impl;</span>
-<span class="lineNum">     628 </span><span class="lineCov">              1 :                 impl = new AptImplementation;</span>
-<span class="lineNum">     629 </span>                :         }
-<span class="lineNum">     630 </span><span class="lineCov">              2 : }</span>
-<span class="lineNum">     631 </span>                : 
-<span class="lineNum">     632 </span><span class="lineCov">              1 : void Apt::invalidateTimestamp()</span>
-<span class="lineNum">     633 </span>                : {
-<span class="lineNum">     634 </span><span class="lineCov">              1 :         impl-&gt;m_open_timestamp = 0;</span>
-<span class="lineNum">     635 </span><span class="lineCov">              1 : }</span>
-<span class="lineNum">     636 </span>                : 
-<span class="lineNum">     637 </span>                : }
-<span class="lineNum">     638 </span><span class="lineCov">              6 : }</span>
-<span class="lineNum">     639 </span>                : 
-<span class="lineNum">     640 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/apt/apt.h.gcov.html b/rep/ept/apt/apt.h.gcov.html
deleted file mode 100644
index 7bde4c7..0000000
--- a/rep/ept/apt/apt.h.gcov.html
+++ /dev/null
@@ -1,286 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/apt/apt.h</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/apt</a> - apt.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">6</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">50.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">3</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- C++ -*-
-<span class="lineNum">       2 </span>                : #ifndef EPT_APT_APT_H
-<span class="lineNum">       3 </span>                : #define EPT_APT_APT_H
-<span class="lineNum">       4 </span>                : 
-<span class="lineNum">       5 </span>                : /** \file
-<span class="lineNum">       6 </span>                :  * High-level front-end to libapt-pkg, as a data provider for the ept framework.
-<span class="lineNum">       7 </span>                :  */
-<span class="lineNum">       8 </span>                : 
-<span class="lineNum">       9 </span>                : /*
-<span class="lineNum">      10 </span>                :  * Copyright (C) 2007,2008  Enrico Zini &lt;enrico@enricozini.org&gt;
-<span class="lineNum">      11 </span>                :  *
-<span class="lineNum">      12 </span>                :  * This library is free software; you can redistribute it and/or
-<span class="lineNum">      13 </span>                :  * modify it under the terms of the GNU Lesser General Public
-<span class="lineNum">      14 </span>                :  * License as published by the Free Software Foundation; either
-<span class="lineNum">      15 </span>                :  * version 2.1 of the License, or (at your option) any later version.
-<span class="lineNum">      16 </span>                :  *
-<span class="lineNum">      17 </span>                :  * This library is distributed in the hope that it will be useful,
-<span class="lineNum">      18 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      19 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-<span class="lineNum">      20 </span>                :  * Lesser General Public License for more details.
-<span class="lineNum">      21 </span>                :  *
-<span class="lineNum">      22 </span>                :  * You should have received a copy of the GNU Lesser General Public
-<span class="lineNum">      23 </span>                :  * License along with this library; if not, write to the Free Software
-<span class="lineNum">      24 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
-<span class="lineNum">      25 </span>                :  */
-<span class="lineNum">      26 </span>                : 
-<span class="lineNum">      27 </span>                : #include &lt;wibble/exception.h&gt;
-<span class="lineNum">      28 </span>                : #include &lt;ept/apt/version.h&gt;
-<span class="lineNum">      29 </span>                : #include &lt;ept/core/apt.h&gt;
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : #include &lt;iterator&gt;
-<span class="lineNum">      32 </span>                : 
-<span class="lineNum">      33 </span>                : namespace ept {
-<span class="lineNum">      34 </span>                : namespace apt {
-<span class="lineNum">      35 </span>                : 
-<span class="lineNum">      36 </span>                : class Exception : public wibble::exception::Generic
-<span class="lineNum">      37 </span>                : {
-<span class="lineNum">      38 </span>                : protected:
-<span class="lineNum">      39 </span>                :         std::string m_message;
-<span class="lineNum">      40 </span>                : 
-<span class="lineNum">      41 </span>                : public:
-<span class="lineNum">      42 </span>                :         Exception(const std::string&amp; context) throw ();
-<span class="lineNum">      43 </span><span class="lineNoCov">              0 :         ~Exception() throw () {}</span>
-<span class="lineNum">      44 </span>                : 
-<span class="lineNum">      45 </span><span class="lineNoCov">              0 :         virtual const char* type() const throw () { return &quot;Apt&quot;; }</span>
-<span class="lineNum">      46 </span><span class="lineNoCov">              0 :         virtual std::string desc() const throw () { return m_message; }</span>
-<span class="lineNum">      47 </span>                : };
-<span class="lineNum">      48 </span>                : 
-<span class="lineNum">      49 </span>                : class Apt;
-<span class="lineNum">      50 </span>                : class AptImplementation;
-<span class="lineNum">      51 </span>                : class RecordIteratorImpl;
-<span class="lineNum">      52 </span>                : using core::PackageState;
-<span class="lineNum">      53 </span>                : 
-<span class="lineNum">      54 </span>                : /**
-<span class="lineNum">      55 </span>                :  * High-level access to the Apt cache, as a data provider for the ept
-<span class="lineNum">      56 </span>                :  * framework.
-<span class="lineNum">      57 </span>                :  *
-<span class="lineNum">      58 </span>                :  * This class wraps the Apt cache and allows to query it in various ways.
-<span class="lineNum">      59 </span>                :  */
-<span class="lineNum">      60 </span>                : class Apt
-<span class="lineNum">      61 </span>                : {
-<span class="lineNum">      62 </span>                : protected:
-<span class="lineNum">      63 </span>                :         AptImplementation* impl;
-<span class="lineNum">      64 </span>                : 
-<span class="lineNum">      65 </span>                : public:
-<span class="lineNum">      66 </span>                :         // Iterate Packages in the Apt cache
-<span class="lineNum">      67 </span>                :         class Iterator : public std::iterator&lt;std::input_iterator_tag, std::string, void, void, void&gt;
-<span class="lineNum">      68 </span>                :         {
-<span class="lineNum">      69 </span>                :                 void* cur;
-<span class="lineNum">      70 </span>                : 
-<span class="lineNum">      71 </span>                :         protected:
-<span class="lineNum">      72 </span>                :                 // Construct a valid iterator
-<span class="lineNum">      73 </span><span class="lineCov">              4 :                 Iterator(void* cur) : cur(cur) {}</span>
-<span class="lineNum">      74 </span>                : 
-<span class="lineNum">      75 </span>                :                 // Construct and end iterator
-<span class="lineNum">      76 </span><span class="lineCov">           3581 :                 Iterator() : cur(0) {}</span>
-<span class="lineNum">      77 </span>                : 
-<span class="lineNum">      78 </span>                :         public:
-<span class="lineNum">      79 </span>                :                 // Copy constructor
-<span class="lineNum">      80 </span>                :                 Iterator(const Iterator&amp;);
-<span class="lineNum">      81 </span>                :                 ~Iterator();
-<span class="lineNum">      82 </span>                :                 std::string operator*();
-<span class="lineNum">      83 </span>                :                 Iterator&amp; operator++();
-<span class="lineNum">      84 </span>                :                 Iterator&amp; operator=(const Iterator&amp;);
-<span class="lineNum">      85 </span>                :                 bool operator==(const Iterator&amp;) const;
-<span class="lineNum">      86 </span>                :                 bool operator!=(const Iterator&amp;) const;
-<span class="lineNum">      87 </span>                : 
-<span class="lineNum">      88 </span>                :                 // FIXME: Iterator operator++(int); cannot be easily implemented
-<span class="lineNum">      89 </span>                :                 // because of how Apt's pkgIterator works
-<span class="lineNum">      90 </span>                : 
-<span class="lineNum">      91 </span>                :                 friend class Apt;
-<span class="lineNum">      92 </span>                :         };
-<span class="lineNum">      93 </span>                : 
-<span class="lineNum">      94 </span>                :         // Iterate Package records in the Apt cache
-<span class="lineNum">      95 </span>                :         class RecordIterator : public std::iterator&lt;std::input_iterator_tag, std::string, void, void, void&gt;
-<span class="lineNum">      96 </span>                :         {
-<span class="lineNum">      97 </span>                :                 RecordIteratorImpl* impl;
-<span class="lineNum">      98 </span>                :                 size_t pos;
-<span class="lineNum">      99 </span>                :                 std::string cur;
-<span class="lineNum">     100 </span>                :                 size_t cur_pos;
-<span class="lineNum">     101 </span>                : 
-<span class="lineNum">     102 </span>                :         protected:
-<span class="lineNum">     103 </span>                :                 // Construct a valid iterator
-<span class="lineNum">     104 </span>                :                 RecordIterator(RecordIteratorImpl* cur, size_t pos = 0);
-<span class="lineNum">     105 </span>                : 
-<span class="lineNum">     106 </span>                :                 // Construct and end iterator
-<span class="lineNum">     107 </span><span class="lineCov">           3481 :                 RecordIterator() : impl(0), pos(0), cur_pos(0) {}</span>
-<span class="lineNum">     108 </span>                : 
-<span class="lineNum">     109 </span>                :         public:
-<span class="lineNum">     110 </span>                :                 // Copy constructor
-<span class="lineNum">     111 </span>                :                 RecordIterator(const RecordIterator&amp; r);
-<span class="lineNum">     112 </span>                : 
-<span class="lineNum">     113 </span>                :                 ~RecordIterator();
-<span class="lineNum">     114 </span>                :                 std::string operator*();
-<span class="lineNum">     115 </span>                :                 std::string* operator-&gt;();
-<span class="lineNum">     116 </span>                :                 RecordIterator&amp; operator++();
-<span class="lineNum">     117 </span>                :                 RecordIterator&amp; operator=(const RecordIterator&amp; r);
-<span class="lineNum">     118 </span>                :                 bool operator==(const RecordIterator&amp;) const;
-<span class="lineNum">     119 </span>                :                 bool operator!=(const RecordIterator&amp;) const;
-<span class="lineNum">     120 </span>                : 
-<span class="lineNum">     121 </span>                :                 // FIXME: Iterator operator++(int); cannot be easily implemented
-<span class="lineNum">     122 </span>                :                 // because of how Apt's pkgIterator works
-<span class="lineNum">     123 </span>                : 
-<span class="lineNum">     124 </span>                :                 friend class Apt;
-<span class="lineNum">     125 </span>                :         };
-<span class="lineNum">     126 </span>                : 
-<span class="lineNum">     127 </span>                :         typedef Iterator iterator;
-<span class="lineNum">     128 </span>                :         typedef RecordIterator record_iterator;
-<span class="lineNum">     129 </span>                : 
-<span class="lineNum">     130 </span>                :         /**
-<span class="lineNum">     131 </span>                :          * Create the Apt data provider
-<span class="lineNum">     132 </span>                :          */
-<span class="lineNum">     133 </span>                :         Apt();
-<span class="lineNum">     134 </span>                :         ~Apt();
-<span class="lineNum">     135 </span>                : 
-<span class="lineNum">     136 </span>                :         iterator begin() const;
-<span class="lineNum">     137 </span>                :         iterator end() const;
-<span class="lineNum">     138 </span>                : 
-<span class="lineNum">     139 </span>                :         record_iterator recordBegin() const;
-<span class="lineNum">     140 </span>                :         record_iterator recordEnd() const;
-<span class="lineNum">     141 </span>                : 
-<span class="lineNum">     142 </span>                : 
-<span class="lineNum">     143 </span>                :         /// Return the number of packages in the archive
-<span class="lineNum">     144 </span>                :         size_t size() const;
-<span class="lineNum">     145 </span>                : 
-<span class="lineNum">     146 </span>                :         /**
-<span class="lineNum">     147 </span>                :          * Validate a package name, returning trye if it exists in the APT database,
-<span class="lineNum">     148 </span>                :          * or false if it does not.
-<span class="lineNum">     149 </span>                :          */
-<span class="lineNum">     150 </span>                :         bool isValid(const std::string&amp; pkg) const;
-<span class="lineNum">     151 </span>                : 
-<span class="lineNum">     152 </span>                :         /// Validate a package name, returning it if it exists in the APT database,
-<span class="lineNum">     153 </span>                :         /// or returning the empty string if it does not.
-<span class="lineNum">     154 </span>                :         std::string validate(const std::string&amp; pkg) const
-<span class="lineNum">     155 </span>                :         {
-<span class="lineNum">     156 </span>                :                 if (isValid(pkg))
-<span class="lineNum">     157 </span>                :                         return pkg;
-<span class="lineNum">     158 </span>                :                 return std::string();
-<span class="lineNum">     159 </span>                :         }
-<span class="lineNum">     160 </span>                : 
-<span class="lineNum">     161 </span>                :         /// Validate a Version, returning it if it exists in the APT database, or
-<span class="lineNum">     162 </span>                :         /// returning the invalid version if it does not.
-<span class="lineNum">     163 </span>                :         Version validate(const Version&amp; ver) const;
-<span class="lineNum">     164 </span>                : 
-<span class="lineNum">     165 </span>                :         /// Return the installed version for a package
-<span class="lineNum">     166 </span>                :         Version installedVersion(const std::string&amp; pkg) const;
-<span class="lineNum">     167 </span>                : 
-<span class="lineNum">     168 </span>                :         /// Return the candidate version for a package
-<span class="lineNum">     169 </span>                :         Version candidateVersion(const std::string&amp; pkg) const;
-<span class="lineNum">     170 </span>                : 
-<span class="lineNum">     171 </span>                :         /**
-<span class="lineNum">     172 </span>                :          * Return the candidate version for a package, if available, or the
-<span class="lineNum">     173 </span>                :          * installed version otherwise
-<span class="lineNum">     174 </span>                :          */
-<span class="lineNum">     175 </span>                :         Version anyVersion(const std::string&amp; pkg) const;
-<span class="lineNum">     176 </span>                : 
-<span class="lineNum">     177 </span>                :         /// Return state information on a package
-<span class="lineNum">     178 </span>                :         PackageState state(const std::string&amp; pkg) const;
-<span class="lineNum">     179 </span>                : 
-<span class="lineNum">     180 </span>                :         /**
-<span class="lineNum">     181 </span>                :          * Perform a package search.
-<span class="lineNum">     182 </span>                :          *
-<span class="lineNum">     183 </span>                :          * All packages for which the functor filter returns true, are passed to
-<span class="lineNum">     184 </span>                :          * the functor out.
-<span class="lineNum">     185 </span>                :          */
-<span class="lineNum">     186 </span>                :         //template&lt;typename FILTER, typename OUT&gt;
-<span class="lineNum">     187 </span>                :         //void search(const FILTER&amp; filter, OUT&amp; out);
-<span class="lineNum">     188 </span>                : 
-<span class="lineNum">     189 </span>                :         /// Get the raw package record for the given Version
-<span class="lineNum">     190 </span>                :         std::string rawRecord(const std::string&amp; pkg) const;
-<span class="lineNum">     191 </span>                : 
-<span class="lineNum">     192 </span>                :         /// Get the raw package record for the given Version
-<span class="lineNum">     193 </span>                :         std::string rawRecord(const Version&amp; ver) const;
-<span class="lineNum">     194 </span>                : 
-<span class="lineNum">     195 </span>                :         /// Timestamp of when the apt index was last modified
-<span class="lineNum">     196 </span>                :         time_t timestamp();
-<span class="lineNum">     197 </span>                : 
-<span class="lineNum">     198 </span>                :         /**
-<span class="lineNum">     199 </span>                :          * Check if the cache has been changed by another process, and reopen it if
-<span class="lineNum">     200 </span>                :          * that is the case.
-<span class="lineNum">     201 </span>                :          *
-<span class="lineNum">     202 </span>                :          * Note that this method can invalidate all existing iterators.
-<span class="lineNum">     203 </span>                :          */
-<span class="lineNum">     204 </span>                :         void checkCacheUpdates();
-<span class="lineNum">     205 </span>                : 
-<span class="lineNum">     206 </span>                :         /**
-<span class="lineNum">     207 </span>                :          * Invalidate the cache timestamp used to track cache updates.
-<span class="lineNum">     208 </span>                :          *
-<span class="lineNum">     209 </span>                :          * @warning Do not use this method: it is here only to support the test
-<span class="lineNum">     210 </span>                :          * cases, and may disappear in any future version.
-<span class="lineNum">     211 </span>                :          */
-<span class="lineNum">     212 </span>                :         void invalidateTimestamp();
-<span class="lineNum">     213 </span>                : };
-<span class="lineNum">     214 </span>                : 
-<span class="lineNum">     215 </span>                : }
-<span class="lineNum">     216 </span>                : }
-<span class="lineNum">     217 </span>                : 
-<span class="lineNum">     218 </span>                : // vim:set ts=4 sw=4:
-<span class="lineNum">     219 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/apt/apt.test.h.gcov.html b/rep/ept/apt/apt.test.h.gcov.html
deleted file mode 100644
index cd79123..0000000
--- a/rep/ept/apt/apt.test.h.gcov.html
+++ /dev/null
@@ -1,259 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/apt/apt.test.h</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/apt</a> - apt.test.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">99</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">99</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /*
-<span class="lineNum">       2 </span>                :  * Copyright (C) 2007  Enrico Zini &lt;enrico@enricozini.org&gt;
-<span class="lineNum">       3 </span>                :  *
-<span class="lineNum">       4 </span>                :  * This library is free software; you can redistribute it and/or
-<span class="lineNum">       5 </span>                :  * modify it under the terms of the GNU Lesser General Public
-<span class="lineNum">       6 </span>                :  * License as published by the Free Software Foundation; either
-<span class="lineNum">       7 </span>                :  * version 2.1 of the License, or (at your option) any later version.
-<span class="lineNum">       8 </span>                :  *
-<span class="lineNum">       9 </span>                :  * This library is distributed in the hope that it will be useful,
-<span class="lineNum">      10 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      11 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-<span class="lineNum">      12 </span>                :  * Lesser General Public License for more details.
-<span class="lineNum">      13 </span>                :  *
-<span class="lineNum">      14 </span>                :  * You should have received a copy of the GNU Lesser General Public
-<span class="lineNum">      15 </span>                :  * License along with this library; if not, write to the Free Software
-<span class="lineNum">      16 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
-<span class="lineNum">      17 </span>                :  */
-<span class="lineNum">      18 </span>                : 
-<span class="lineNum">      19 </span>                : #include &lt;ept/test.h&gt;
-<span class="lineNum">      20 </span>                : #include &lt;ept/apt/apt.h&gt;
-<span class="lineNum">      21 </span>                : #include &lt;set&gt;
-<span class="lineNum">      22 </span>                : #include &lt;algorithm&gt;
-<span class="lineNum">      23 </span>                : 
-<span class="lineNum">      24 </span>                : using namespace std;
-<span class="lineNum">      25 </span>                : using namespace ept;
-<span class="lineNum">      26 </span>                : using namespace ept::apt;
-<span class="lineNum">      27 </span>                : 
-<span class="lineNum">      28 </span><span class="lineCov">             26 : struct TestApt : AptTestEnvironment {</span>
-<span class="lineNum">      29 </span>                :     Apt apt;
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                :     // Check that iterations iterates among some packages
-<span class="lineNum">      32 </span><span class="lineCov">              1 :     Test iterators()</span>
-<span class="lineNum">      33 </span>                :     {
-<span class="lineNum">      34 </span><span class="lineCov">              1 :         Apt::iterator i = apt.begin();</span>
-<span class="lineNum">      35 </span><span class="lineCov">              1 :         assert(i != apt.end());</span>
-<span class="lineNum">      36 </span>                :         
-<span class="lineNum">      37 </span><span class="lineCov">              1 :         size_t count = 0;</span>
-<span class="lineNum">      38 </span><span class="lineCov">           1789 :         for (; i != apt.end(); ++i)</span>
-<span class="lineNum">      39 </span><span class="lineCov">           1788 :             ++count;</span>
-<span class="lineNum">      40 </span>                : 
-<span class="lineNum">      41 </span><span class="lineCov">              1 :         assert(count &gt; 100);</span>
-<span class="lineNum">      42 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      43 </span>                : 
-<span class="lineNum">      44 </span>                :     // Check that iteration gives some well-known packages
-<span class="lineNum">      45 </span><span class="lineCov">              1 :     Test aptExists()</span>
-<span class="lineNum">      46 </span>                :     {
-<span class="lineNum">      47 </span><span class="lineCov">              1 :         set&lt;string&gt; packages;</span>
-<span class="lineNum">      48 </span>                :  
-<span class="lineNum">      49 </span><span class="lineCov">              1 :         std::copy(apt.begin(), apt.end(), inserter(packages, packages.begin()));</span>
-<span class="lineNum">      50 </span>                : 
-<span class="lineNum">      51 </span><span class="lineCov">              1 :         assert(packages.find(&quot;libsp1&quot;) != packages.end());</span>
-<span class="lineNum">      52 </span>                :         // TODO this exposes a bug somewhere... sp definitely is among
-<span class="lineNum">      53 </span>                :         // the packages
-<span class="lineNum">      54 </span>                :         // assert(packages.find(&quot;sp&quot;) != packages.end());
-<span class="lineNum">      55 </span><span class="lineCov">              2 :         assert(packages.find(&quot;&quot;) == packages.end());</span>
-<span class="lineNum">      56 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      57 </span>                : 
-<span class="lineNum">      58 </span>                :     // Check that timestamp gives some meaningful timestamp
-<span class="lineNum">      59 </span><span class="lineCov">              1 :     Test timestamp()</span>
-<span class="lineNum">      60 </span>                :     {
-<span class="lineNum">      61 </span><span class="lineCov">              1 :         time_t ts = apt.timestamp();</span>
-<span class="lineNum">      62 </span><span class="lineCov">              1 :         assert(ts &gt; 1000000);</span>
-<span class="lineNum">      63 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      64 </span>                : 
-<span class="lineNum">      65 </span>                :     // Check the package validator
-<span class="lineNum">      66 </span><span class="lineCov">              1 :     Test validity()</span>
-<span class="lineNum">      67 </span>                :     {
-<span class="lineNum">      68 </span><span class="lineCov">              1 :         assert(apt.isValid(&quot;apt&quot;));</span>
-<span class="lineNum">      69 </span><span class="lineCov">              2 :         assert(!apt.isValid(&quot;this-package-does-not-really-exists&quot;));</span>
-<span class="lineNum">      70 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      71 </span>                : 
-<span class="lineNum">      72 </span>                :     // Check the version instantiators
-<span class="lineNum">      73 </span><span class="lineCov">              1 :     Test versions()</span>
-<span class="lineNum">      74 </span>                :     {
-<span class="lineNum">      75 </span><span class="lineCov">              1 :         std::string pkg(&quot;apt&quot;);</span>
-<span class="lineNum">      76 </span><span class="lineCov">              1 :         Version ver = apt.candidateVersion(pkg);</span>
-<span class="lineNum">      77 </span><span class="lineCov">              1 :         assert(ver.isValid());</span>
-<span class="lineNum">      78 </span>                :         
-<span class="lineNum">      79 </span><span class="lineCov">              2 :         ver = apt.installedVersion(pkg);</span>
-<span class="lineNum">      80 </span><span class="lineCov">              1 :         assert(ver.isValid());</span>
-<span class="lineNum">      81 </span>                : 
-<span class="lineNum">      82 </span><span class="lineCov">              2 :         ver = apt.anyVersion(pkg);</span>
-<span class="lineNum">      83 </span><span class="lineCov">              1 :         assert(ver.isValid());</span>
-<span class="lineNum">      84 </span>                : 
-<span class="lineNum">      85 </span><span class="lineCov">              2 :         std::string pkg1(&quot;this-package-does-not-really-exists&quot;);</span>
-<span class="lineNum">      86 </span><span class="lineCov">              2 :         ver = apt.candidateVersion(pkg1);</span>
-<span class="lineNum">      87 </span><span class="lineCov">              1 :         assert(!ver.isValid());</span>
-<span class="lineNum">      88 </span>                :         
-<span class="lineNum">      89 </span><span class="lineCov">              2 :         ver = apt.installedVersion(pkg1);</span>
-<span class="lineNum">      90 </span><span class="lineCov">              1 :         assert(!ver.isValid());</span>
-<span class="lineNum">      91 </span>                : 
-<span class="lineNum">      92 </span><span class="lineCov">              2 :         ver = apt.anyVersion(pkg1);</span>
-<span class="lineNum">      93 </span><span class="lineCov">              1 :         assert(!ver.isValid());</span>
-<span class="lineNum">      94 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      95 </span>                : 
-<span class="lineNum">      96 </span>                :     // Check the version validator
-<span class="lineNum">      97 </span><span class="lineCov">              1 :     Test versionValidity()</span>
-<span class="lineNum">      98 </span>                :     {
-<span class="lineNum">      99 </span><span class="lineCov">              1 :         Version ver = apt.candidateVersion(&quot;apt&quot;);</span>
-<span class="lineNum">     100 </span><span class="lineCov">              2 :         assert(apt.validate(ver) == ver);</span>
-<span class="lineNum">     101 </span>                : 
-<span class="lineNum">     102 </span><span class="lineCov">              1 :         ver = Version(&quot;this-package-does-not-really-exists&quot;, &quot;0.1&quot;);</span>
-<span class="lineNum">     103 </span><span class="lineCov">              2 :         assert(!apt.validate(ver).isValid());</span>
-<span class="lineNum">     104 </span>                : 
-<span class="lineNum">     105 </span><span class="lineCov">              1 :         ver = Version(&quot;apt&quot;, &quot;0.31415&quot;);</span>
-<span class="lineNum">     106 </span><span class="lineCov">              2 :         assert(!apt.validate(ver).isValid());</span>
-<span class="lineNum">     107 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">     108 </span>                : 
-<span class="lineNum">     109 </span>                :     // Check the raw record accessor
-<span class="lineNum">     110 </span><span class="lineCov">              1 :     Test rawRecord()</span>
-<span class="lineNum">     111 </span>                :     {
-<span class="lineNum">     112 </span><span class="lineCov">              1 :         string pkg(&quot;sp&quot;);</span>
-<span class="lineNum">     113 </span><span class="lineCov">              1 :         Version ver = apt.candidateVersion(pkg);</span>
-<span class="lineNum">     114 </span><span class="lineCov">              1 :         assert(apt.validate(ver) == ver);</span>
-<span class="lineNum">     115 </span>                : 
-<span class="lineNum">     116 </span><span class="lineCov">              1 :         string record = apt.rawRecord(ver);</span>
-<span class="lineNum">     117 </span><span class="lineCov">              1 :         assert(record.find(&quot;Package: sp&quot;) != string::npos);</span>
-<span class="lineNum">     118 </span><span class="lineCov">              2 :         assert(record.find(&quot;Section: text&quot;) != string::npos);</span>
-<span class="lineNum">     119 </span>                : 
-<span class="lineNum">     120 </span><span class="lineCov">              2 :         record = apt.rawRecord(Version(&quot;sp&quot;, &quot;0.31415&quot;));</span>
-<span class="lineNum">     121 </span><span class="lineCov">              2 :         assert_eq(record, string());</span>
-<span class="lineNum">     122 </span>                : 
-<span class="lineNum">     123 </span><span class="lineCov">              1 :         assert_eq(apt.rawRecord(pkg), apt.rawRecord(apt.anyVersion(pkg)));</span>
-<span class="lineNum">     124 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">     125 </span>                : 
-<span class="lineNum">     126 </span>                :     // Check the package state accessor
-<span class="lineNum">     127 </span><span class="lineCov">              1 :     Test state()</span>
-<span class="lineNum">     128 </span>                :     {
-<span class="lineNum">     129 </span><span class="lineCov">              1 :         PackageState s = apt.state(&quot;kdenetwork&quot;);</span>
-<span class="lineNum">     130 </span><span class="lineCov">              2 :         assert(s.isValid());</span>
-<span class="lineNum">     131 </span><span class="lineCov">              2 :         assert(s.isInstalled());</span>
-<span class="lineNum">     132 </span>                : 
-<span class="lineNum">     133 </span><span class="lineCov">              2 :         s = apt.state(&quot;this-package-does-not-really-exists&quot;);</span>
-<span class="lineNum">     134 </span><span class="lineCov">              2 :         assert(!s.isValid());</span>
-<span class="lineNum">     135 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">     136 </span>                : 
-<span class="lineNum">     137 </span>                :     // Check the record iterator (accessing with *)
-<span class="lineNum">     138 </span><span class="lineCov">              1 :     Test recordIteration()</span>
-<span class="lineNum">     139 </span>                :     {
-<span class="lineNum">     140 </span><span class="lineCov">              1 :         size_t count = 0;</span>
-<span class="lineNum">     141 </span><span class="lineCov">            435 :         for (Apt::record_iterator i = apt.recordBegin();</span>
-<span class="lineNum">     142 </span>                :              i != apt.recordEnd(); ++i)
-<span class="lineNum">     143 </span>                :             {
-<span class="lineNum">     144 </span><span class="lineCov">            434 :                 assert((*i).size() &gt; 8);</span>
-<span class="lineNum">     145 </span><span class="lineCov">            434 :                 assert_eq((*i).substr(0, 8), &quot;Package:&quot;);</span>
-<span class="lineNum">     146 </span><span class="lineCov">            434 :                 ++count;</span>
-<span class="lineNum">     147 </span><span class="lineCov">              1 :             }</span>
-<span class="lineNum">     148 </span><span class="lineCov">              2 :         assert(count &gt; 200);</span>
-<span class="lineNum">     149 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">     150 </span>                : 
-<span class="lineNum">     151 </span>                :     // Check the record iterator (accessing with -&gt;)
-<span class="lineNum">     152 </span><span class="lineCov">              1 :     Test recordIteration2()</span>
-<span class="lineNum">     153 </span>                :     {
-<span class="lineNum">     154 </span><span class="lineCov">              1 :         size_t count = 0;</span>
-<span class="lineNum">     155 </span><span class="lineCov">            435 :         for (Apt::record_iterator i = apt.recordBegin();</span>
-<span class="lineNum">     156 </span>                :              i != apt.recordEnd(); ++i)
-<span class="lineNum">     157 </span>                :             {
-<span class="lineNum">     158 </span><span class="lineCov">            434 :                 assert(i-&gt;size() &gt; 8);</span>
-<span class="lineNum">     159 </span><span class="lineCov">            868 :                 assert_eq(i-&gt;substr(0, 8), &quot;Package:&quot;);</span>
-<span class="lineNum">     160 </span><span class="lineCov">            434 :                 ++count;</span>
-<span class="lineNum">     161 </span><span class="lineCov">              1 :             }</span>
-<span class="lineNum">     162 </span><span class="lineCov">              2 :         assert(count &gt; 200);</span>
-<span class="lineNum">     163 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">     164 </span>                : 
-<span class="lineNum">     165 </span>                :     // Check that the iterators can be used with the algorithms
-<span class="lineNum">     166 </span><span class="lineCov">              1 :     Test stlIteration()</span>
-<span class="lineNum">     167 </span>                :     {
-<span class="lineNum">     168 </span><span class="lineCov">              1 :         vector&lt;string&gt; out;</span>
-<span class="lineNum">     169 </span><span class="lineCov">              1 :         std::copy(apt.begin(), apt.end(), back_inserter(out));</span>
-<span class="lineNum">     170 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">     171 </span>                : 
-<span class="lineNum">     172 </span>                :     // Check that the iterators can be used with the algorithms
-<span class="lineNum">     173 </span><span class="lineCov">              1 :     Test stlRecordIteration()</span>
-<span class="lineNum">     174 </span>                :     {
-<span class="lineNum">     175 </span><span class="lineCov">              1 :         vector&lt;string&gt; out;</span>
-<span class="lineNum">     176 </span><span class="lineCov">              1 :         std::copy(apt.recordBegin(), apt.recordEnd(), back_inserter(out));</span>
-<span class="lineNum">     177 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">     178 </span>                : 
-<span class="lineNum">     179 </span>                :         // Check that checkUpdates will keep a working Apt object
-<span class="lineNum">     180 </span><span class="lineCov">              1 :         Test checkUpdates()</span>
-<span class="lineNum">     181 </span>                :         {
-<span class="lineNum">     182 </span><span class="lineCov">              1 :         assert(apt.isValid(&quot;apt&quot;));</span>
-<span class="lineNum">     183 </span><span class="lineCov">              1 :                 apt.checkCacheUpdates();</span>
-<span class="lineNum">     184 </span><span class="lineCov">              2 :         assert(apt.isValid(&quot;apt&quot;));</span>
-<span class="lineNum">     185 </span><span class="lineCov">              1 :                 apt.invalidateTimestamp();              </span>
-<span class="lineNum">     186 </span><span class="lineCov">              1 :                 apt.checkCacheUpdates();</span>
-<span class="lineNum">     187 </span><span class="lineCov">              2 :         assert(apt.isValid(&quot;apt&quot;));</span>
-<span class="lineNum">     188 </span><span class="lineCov">              1 :         }</span>
-<span class="lineNum">     189 </span>                : 
-<span class="lineNum">     190 </span>                : };
-<span class="lineNum">     191 </span>                : 
-<span class="lineNum">     192 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/apt/index.html b/rep/ept/apt/index.html
deleted file mode 100644
index 9a94d3e..0000000
--- a/rep/ept/apt/index.html
+++ /dev/null
@@ -1,182 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/apt</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - ept/apt</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">880</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">89.2 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">785</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <center>
-  <table width="80%" cellpadding=2 cellspacing=1 border=0>
-
-    <tr>
-      <td width="50%"><br></td>
-      <td width="15%"></td>
-      <td width="15%"></td>
-      <td width="20%"></td>
-    </tr>
-
-    <tr>
-      <td class="tableHead">Filename</td>
-      <td class="tableHead" colspan=3>Coverage</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="apt.cc.gcov.html">apt.cc</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=77 height=10 alt="76.8%"><img src="../../snow.png" width=23 height=10 alt="76.8%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">76.8&nbsp;%</td>
-      <td class="coverNumHi">248&nbsp;/&nbsp;323&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="apt.h.gcov.html">apt.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=50 height=10 alt="50.0%"><img src="../../snow.png" width=50 height=10 alt="50.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">50.0&nbsp;%</td>
-      <td class="coverNumHi">3&nbsp;/&nbsp;6&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="apt.test.h.gcov.html">apt.test.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">99&nbsp;/&nbsp;99&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="packagerecord.cc.gcov.html">packagerecord.cc</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=91 height=10 alt="90.9%"><img src="../../snow.png" width=9 height=10 alt="90.9%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">90.9&nbsp;%</td>
-      <td class="coverNumHi">40&nbsp;/&nbsp;44&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="packagerecord.h.gcov.html">packagerecord.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=95 height=10 alt="95.4%"><img src="../../snow.png" width=5 height=10 alt="95.4%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">95.4&nbsp;%</td>
-      <td class="coverNumHi">62&nbsp;/&nbsp;65&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="packagerecord.test.h.gcov.html">packagerecord.test.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=88 height=10 alt="88.5%"><img src="../../snow.png" width=12 height=10 alt="88.5%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">88.5&nbsp;%</td>
-      <td class="coverNumHi">46&nbsp;/&nbsp;52&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="recordparser.cc.gcov.html">recordparser.cc</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">62&nbsp;/&nbsp;62&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="recordparser.h.gcov.html">recordparser.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">8&nbsp;/&nbsp;8&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="recordparser.test.h.gcov.html">recordparser.test.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">107&nbsp;/&nbsp;107&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="version.cc.gcov.html">version.cc</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=88 height=10 alt="88.2%"><img src="../../snow.png" width=12 height=10 alt="88.2%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">88.2&nbsp;%</td>
-      <td class="coverNumHi">30&nbsp;/&nbsp;34&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="version.h.gcov.html">version.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">9&nbsp;/&nbsp;9&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="version.test.h.gcov.html">version.test.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">71&nbsp;/&nbsp;71&nbsp;lines</td>
-    </tr>
-
-  </table>
-  </center>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/apt/packagerecord.cc.gcov.html b/rep/ept/apt/packagerecord.cc.gcov.html
deleted file mode 100644
index bf04344..0000000
--- a/rep/ept/apt/packagerecord.cc.gcov.html
+++ /dev/null
@@ -1,185 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/apt/packagerecord.cc</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/apt</a> - packagerecord.cc</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">44</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">90.9 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">40</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /** \file
-<span class="lineNum">       2 </span>                :  * Parser for APT records, with specialised accessors for package records
-<span class="lineNum">       3 </span>                :  */
-<span class="lineNum">       4 </span>                : 
-<span class="lineNum">       5 </span>                : /* 
-<span class="lineNum">       6 </span>                :  * Copyright (C) 2007  Enrico Zini &lt;enrico@enricozini.org&gt;
-<span class="lineNum">       7 </span>                :  *
-<span class="lineNum">       8 </span>                :  * This library is free software; you can redistribute it and/or
-<span class="lineNum">       9 </span>                :  * modify it under the terms of the GNU Lesser General Public
-<span class="lineNum">      10 </span>                :  * License as published by the Free Software Foundation; either
-<span class="lineNum">      11 </span>                :  * version 2.1 of the License, or (at your option) any later version.
-<span class="lineNum">      12 </span>                :  *
-<span class="lineNum">      13 </span>                :  * This library is distributed in the hope that it will be useful,
-<span class="lineNum">      14 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      15 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-<span class="lineNum">      16 </span>                :  * Lesser General Public License for more details.
-<span class="lineNum">      17 </span>                :  *
-<span class="lineNum">      18 </span>                :  * You should have received a copy of the GNU Lesser General Public
-<span class="lineNum">      19 </span>                :  * License along with this library; if not, write to the Free Software
-<span class="lineNum">      20 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
-<span class="lineNum">      21 </span>                :  */
-<span class="lineNum">      22 </span>                : 
-<span class="lineNum">      23 </span>                : #include &lt;ept/apt/packagerecord.h&gt;
-<span class="lineNum">      24 </span>                : 
-<span class="lineNum">      25 </span>                : #include &lt;cctype&gt;
-<span class="lineNum">      26 </span>                : #include &lt;cstdlib&gt;
-<span class="lineNum">      27 </span>                : 
-<span class="lineNum">      28 </span>                : //#include &lt;iostream&gt;
-<span class="lineNum">      29 </span>                : 
-<span class="lineNum">      30 </span>                : using namespace std;
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span>                : namespace ept {
-<span class="lineNum">      33 </span>                : namespace apt {
-<span class="lineNum">      34 </span>                : 
-<span class="lineNum">      35 </span><span class="lineCov">           5210 : size_t PackageRecord::parseSize(size_t def, const std::string&amp; str) const</span>
-<span class="lineNum">      36 </span>                : {
-<span class="lineNum">      37 </span><span class="lineCov">           5210 :         if (str == string())</span>
-<span class="lineNum">      38 </span><span class="lineCov">             54 :                 return def;</span>
-<span class="lineNum">      39 </span><span class="lineCov">           5156 :         return (size_t)strtoul(str.c_str(), NULL, 10);</span>
-<span class="lineNum">      40 </span>                : }
-<span class="lineNum">      41 </span>                : 
-<span class="lineNum">      42 </span><span class="lineCov">              1 : std::string PackageRecord::parseShortDescription(const std::string&amp; def, const std::string&amp; str) const</span>
-<span class="lineNum">      43 </span>                : {
-<span class="lineNum">      44 </span><span class="lineCov">              1 :         if (str == std::string())</span>
-<span class="lineNum">      45 </span><span class="lineNoCov">              0 :                 return def;</span>
-<span class="lineNum">      46 </span><span class="lineCov">              1 :         size_t pos = str.find(&quot;\n&quot;);</span>
-<span class="lineNum">      47 </span><span class="lineCov">              1 :         if (pos == std::string::npos)</span>
-<span class="lineNum">      48 </span><span class="lineNoCov">              0 :                 return str;</span>
-<span class="lineNum">      49 </span>                :         else
-<span class="lineNum">      50 </span><span class="lineCov">              1 :                 return str.substr(0, pos);</span>
-<span class="lineNum">      51 </span>                : }
-<span class="lineNum">      52 </span>                : 
-<span class="lineNum">      53 </span><span class="lineCov">              1 : std::string PackageRecord::parseLongDescription(const std::string&amp; def, const std::string&amp; str) const</span>
-<span class="lineNum">      54 </span>                : {
-<span class="lineNum">      55 </span><span class="lineCov">              1 :         if (str == std::string())</span>
-<span class="lineNum">      56 </span><span class="lineNoCov">              0 :                 return def;</span>
-<span class="lineNum">      57 </span><span class="lineCov">              1 :         size_t pos = str.find(&quot;\n&quot;);</span>
-<span class="lineNum">      58 </span><span class="lineCov">              1 :         if (pos == std::string::npos)</span>
-<span class="lineNum">      59 </span><span class="lineNoCov">              0 :                 return str;</span>
-<span class="lineNum">      60 </span>                :         else
-<span class="lineNum">      61 </span>                :         {
-<span class="lineNum">      62 </span>                :                 // Trim trailing spaces
-<span class="lineNum">      63 </span><span class="lineCov">              1 :                 for (++pos; pos &lt; str.size() &amp;&amp; isspace(str[pos]); ++pos)</span>
-<span class="lineNum">      64 </span>                :                         ;
-<span class="lineNum">      65 </span><span class="lineCov">              1 :                 return str.substr(pos);</span>
-<span class="lineNum">      66 </span>                :         }
-<span class="lineNum">      67 </span>                : }
-<span class="lineNum">      68 </span>                : 
-<span class="lineNum">      69 </span><span class="lineCov">           2605 : std::set&lt;std::string&gt; PackageRecord::parseTags(const std::set&lt;std::string&gt;&amp; def, const std::string&amp; str) const</span>
-<span class="lineNum">      70 </span>                : {
-<span class="lineNum">      71 </span><span class="lineCov">           2605 :         if (str == string())</span>
-<span class="lineNum">      72 </span><span class="lineCov">           2604 :                 return def;</span>
-<span class="lineNum">      73 </span>                : 
-<span class="lineNum">      74 </span><span class="lineCov">              1 :         set&lt;string&gt; res;</span>
-<span class="lineNum">      75 </span>                : 
-<span class="lineNum">      76 </span><span class="lineCov">              1 :         size_t pos = 0;</span>
-<span class="lineNum">      77 </span><span class="lineCov">             13 :         while (pos &lt; str.size())</span>
-<span class="lineNum">      78 </span>                :         {
-<span class="lineNum">      79 </span><span class="lineCov">             12 :                 string tag;</span>
-<span class="lineNum">      80 </span><span class="lineCov">             12 :                 size_t i = str.find(&quot;, &quot;, pos);</span>
-<span class="lineNum">      81 </span><span class="lineCov">             12 :                 if (i == string::npos)</span>
-<span class="lineNum">      82 </span><span class="lineCov">              1 :                         tag = str.substr(pos);</span>
-<span class="lineNum">      83 </span>                :                 else
-<span class="lineNum">      84 </span><span class="lineCov">             11 :                         tag = str.substr(pos, i-pos);</span>
-<span class="lineNum">      85 </span>                : 
-<span class="lineNum">      86 </span>                :                 // Check if we need curly brace expansion
-<span class="lineNum">      87 </span><span class="lineCov">             12 :                 if (tag[tag.size() - 1] == '}')</span>
-<span class="lineNum">      88 </span>                :                 {
-<span class="lineNum">      89 </span><span class="lineCov">              1 :                         size_t begin = tag.find('{');</span>
-<span class="lineNum">      90 </span><span class="lineCov">              1 :                         if (begin != string::npos)</span>
-<span class="lineNum">      91 </span>                :                         {
-<span class="lineNum">      92 </span><span class="lineCov">              1 :                                 string prefix(tag, 0, begin);</span>
-<span class="lineNum">      93 </span><span class="lineCov">              1 :                                 ++begin;</span>
-<span class="lineNum">      94 </span>                :                                 size_t end;
-<span class="lineNum">      95 </span><span class="lineCov">              4 :                                 while ((end = tag.find(',', begin)) != string::npos)</span>
-<span class="lineNum">      96 </span>                :                                 {
-<span class="lineNum">      97 </span><span class="lineCov">              2 :                                         res.insert(prefix + tag.substr(begin, end-begin));</span>
-<span class="lineNum">      98 </span><span class="lineCov">              2 :                                         begin = end + 1;</span>
-<span class="lineNum">      99 </span>                :                                 }
-<span class="lineNum">     100 </span><span class="lineCov">              1 :                                 res.insert(prefix + tag.substr(begin, tag.size() - 1 - begin));</span>
-<span class="lineNum">     101 </span>                :                         }
-<span class="lineNum">     102 </span>                :                 } else {
-<span class="lineNum">     103 </span><span class="lineCov">             11 :                         res.insert(tag);</span>
-<span class="lineNum">     104 </span>                :                 }
-<span class="lineNum">     105 </span>                : 
-<span class="lineNum">     106 </span><span class="lineCov">             12 :                 if (i == string::npos)</span>
-<span class="lineNum">     107 </span><span class="lineCov">              1 :                         break;</span>
-<span class="lineNum">     108 </span>                :                 else
-<span class="lineNum">     109 </span><span class="lineCov">             11 :                         pos = i + 2;</span>
-<span class="lineNum">     110 </span>                :         }
-<span class="lineNum">     111 </span>                : 
-<span class="lineNum">     112 </span><span class="lineCov">              1 :         return res;</span>
-<span class="lineNum">     113 </span>                : }
-<span class="lineNum">     114 </span>                : 
-<span class="lineNum">     115 </span>                : }
-<span class="lineNum">     116 </span>                : }
-<span class="lineNum">     117 </span>                : 
-<span class="lineNum">     118 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/apt/packagerecord.h.gcov.html b/rep/ept/apt/packagerecord.h.gcov.html
deleted file mode 100644
index afd295c..0000000
--- a/rep/ept/apt/packagerecord.h.gcov.html
+++ /dev/null
@@ -1,243 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/apt/packagerecord.h</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/apt</a> - packagerecord.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">65</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">95.4 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">62</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #ifndef EPT_APT_PACKAGERECORD_H
-<span class="lineNum">       2 </span>                : #define EPT_APT_PACKAGERECORD_H
-<span class="lineNum">       3 </span>                : 
-<span class="lineNum">       4 </span>                : /** \file
-<span class="lineNum">       5 </span>                :  * Parser for APT records, with specialised accessors for package records
-<span class="lineNum">       6 </span>                :  */
-<span class="lineNum">       7 </span>                : 
-<span class="lineNum">       8 </span>                : /*
-<span class="lineNum">       9 </span>                :  * Copyright (C) 2007  Enrico Zini &lt;enrico@enricozini.org&gt;
-<span class="lineNum">      10 </span>                :  *
-<span class="lineNum">      11 </span>                :  * This library is free software; you can redistribute it and/or
-<span class="lineNum">      12 </span>                :  * modify it under the terms of the GNU Lesser General Public
-<span class="lineNum">      13 </span>                :  * License as published by the Free Software Foundation; either
-<span class="lineNum">      14 </span>                :  * version 2.1 of the License, or (at your option) any later version.
-<span class="lineNum">      15 </span>                :  *
-<span class="lineNum">      16 </span>                :  * This library is distributed in the hope that it will be useful,
-<span class="lineNum">      17 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      18 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-<span class="lineNum">      19 </span>                :  * Lesser General Public License for more details.
-<span class="lineNum">      20 </span>                :  *
-<span class="lineNum">      21 </span>                :  * You should have received a copy of the GNU Lesser General Public
-<span class="lineNum">      22 </span>                :  * License along with this library; if not, write to the Free Software
-<span class="lineNum">      23 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
-<span class="lineNum">      24 </span>                :  */
-<span class="lineNum">      25 </span>                : 
-<span class="lineNum">      26 </span>                : #include &lt;ept/apt/recordparser.h&gt;
-<span class="lineNum">      27 </span>                : #include &lt;set&gt;
-<span class="lineNum">      28 </span>                : 
-<span class="lineNum">      29 </span>                : namespace ept {
-<span class="lineNum">      30 </span>                : namespace apt {
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span>                : /**
-<span class="lineNum">      33 </span>                :  * RecordParser specialised with access methods for common Debian package
-<span class="lineNum">      34 </span>                :  * information.
-<span class="lineNum">      35 </span>                :  */
-<span class="lineNum">      36 </span>                : class PackageRecord : public RecordParser
-<span class="lineNum">      37 </span><span class="lineCov">              7 : {</span>
-<span class="lineNum">      38 </span><span class="lineCov">              1 :         bool parseBool(bool&amp; def, const std::string&amp; str) const</span>
-<span class="lineNum">      39 </span>                :         {
-<span class="lineNum">      40 </span>                :                 // Believe it or not, this is what apt does to interpret bool fields
-<span class="lineNum">      41 </span><span class="lineCov">              1 :                 if (str == &quot;no&quot; || str == &quot;false&quot; || str == &quot;without&quot; ||</span>
-<span class="lineNum">      42 </span>                :                         str == &quot;off&quot; || str == &quot;disable&quot;)
-<span class="lineNum">      43 </span><span class="lineNoCov">              0 :                         return false;</span>
-<span class="lineNum">      44 </span>                : 
-<span class="lineNum">      45 </span><span class="lineCov">              1 :                 if (str == &quot;yes&quot; || str == &quot;true&quot; || str == &quot;with&quot; ||</span>
-<span class="lineNum">      46 </span>                :                         str == &quot;on&quot; || str == &quot;enable&quot;)
-<span class="lineNum">      47 </span><span class="lineCov">              1 :                         return true;</span>
-<span class="lineNum">      48 </span>                : 
-<span class="lineNum">      49 </span><span class="lineNoCov">              0 :                 return def;</span>
-<span class="lineNum">      50 </span>                :         }
-<span class="lineNum">      51 </span><span class="lineCov">          10436 :         std::string parseString(const std::string&amp; def, const std::string&amp; str) const</span>
-<span class="lineNum">      52 </span>                :         {
-<span class="lineNum">      53 </span><span class="lineCov">          10436 :                 if (str == std::string())</span>
-<span class="lineNum">      54 </span><span class="lineNoCov">              0 :                         return def;</span>
-<span class="lineNum">      55 </span><span class="lineCov">          10436 :                 return str;</span>
-<span class="lineNum">      56 </span>                :         }
-<span class="lineNum">      57 </span>                :         std::string parseShortDescription(const std::string&amp; def, const std::string&amp; str) const;
-<span class="lineNum">      58 </span>                :         std::string parseLongDescription(const std::string&amp; def, const std::string&amp; str) const;
-<span class="lineNum">      59 </span>                :         size_t parseSize(size_t def, const std::string&amp; str) const;
-<span class="lineNum">      60 </span>                :         std::set&lt;std::string&gt; parseTags(const std::set&lt;std::string&gt;&amp; def, const std::string&amp; str) const;
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span>                : public:
-<span class="lineNum">      63 </span><span class="lineCov">              6 :         PackageRecord() : RecordParser() {}</span>
-<span class="lineNum">      64 </span><span class="lineCov">              1 :         PackageRecord(const std::string&amp; str) : RecordParser(str) {}</span>
-<span class="lineNum">      65 </span>                : 
-<span class="lineNum">      66 </span><span class="lineCov">           7813 :         std::string package(const std::string&amp; def = std::string()) const</span>
-<span class="lineNum">      67 </span>                :         {
-<span class="lineNum">      68 </span><span class="lineCov">           7813 :                 return parseString(def, lookup(&quot;Package&quot;));</span>
-<span class="lineNum">      69 </span>                :         }
-<span class="lineNum">      70 </span><span class="lineCov">              1 :         std::string priority(const std::string&amp; def = std::string()) const</span>
-<span class="lineNum">      71 </span>                :         {
-<span class="lineNum">      72 </span><span class="lineCov">              1 :                 return parseString(def, lookup(&quot;Priority&quot;));</span>
-<span class="lineNum">      73 </span>                :         }
-<span class="lineNum">      74 </span><span class="lineCov">              1 :         std::string section(const std::string&amp; def = std::string()) const</span>
-<span class="lineNum">      75 </span>                :         {
-<span class="lineNum">      76 </span><span class="lineCov">              1 :                 return parseString(def, lookup(&quot;Section&quot;));</span>
-<span class="lineNum">      77 </span>                :         }
-<span class="lineNum">      78 </span><span class="lineCov">           2605 :         size_t installedSize(size_t def = 0) const</span>
-<span class="lineNum">      79 </span>                :         {
-<span class="lineNum">      80 </span><span class="lineCov">           2605 :                 return parseSize(def, lookup(&quot;Installed-Size&quot;));</span>
-<span class="lineNum">      81 </span>                :         }
-<span class="lineNum">      82 </span><span class="lineCov">              1 :         std::string maintainer(const std::string&amp; def = std::string()) const</span>
-<span class="lineNum">      83 </span>                :         {
-<span class="lineNum">      84 </span><span class="lineCov">              1 :                 return parseString(def, lookup(&quot;Maintainer&quot;));</span>
-<span class="lineNum">      85 </span>                :         }
-<span class="lineNum">      86 </span><span class="lineCov">              1 :         std::string architecture(const std::string&amp; def = std::string()) const</span>
-<span class="lineNum">      87 </span>                :         {
-<span class="lineNum">      88 </span><span class="lineCov">              1 :                 return parseString(def, lookup(&quot;Architecture&quot;));</span>
-<span class="lineNum">      89 </span>                :         }
-<span class="lineNum">      90 </span><span class="lineCov">              1 :         std::string source(const std::string&amp; def = std::string()) const</span>
-<span class="lineNum">      91 </span>                :         {
-<span class="lineNum">      92 </span><span class="lineCov">              1 :                 return parseString(def, lookup(&quot;Source&quot;));</span>
-<span class="lineNum">      93 </span>                :         }
-<span class="lineNum">      94 </span><span class="lineCov">              1 :         std::string version(const std::string&amp; def = std::string()) const</span>
-<span class="lineNum">      95 </span>                :         {
-<span class="lineNum">      96 </span><span class="lineCov">              1 :                 return parseString(def, lookup(&quot;Version&quot;));</span>
-<span class="lineNum">      97 </span>                :         }
-<span class="lineNum">      98 </span><span class="lineCov">              1 :         std::string replaces(const std::string&amp; def = std::string()) const</span>
-<span class="lineNum">      99 </span>                :         {
-<span class="lineNum">     100 </span><span class="lineCov">              1 :                 return parseString(def, lookup(&quot;Replaces&quot;));</span>
-<span class="lineNum">     101 </span>                :         }
-<span class="lineNum">     102 </span><span class="lineCov">              1 :         std::string depends(const std::string&amp; def = std::string()) const</span>
-<span class="lineNum">     103 </span>                :         {
-<span class="lineNum">     104 </span><span class="lineCov">              1 :                 return parseString(def, lookup(&quot;Depends&quot;));</span>
-<span class="lineNum">     105 </span>                :         }
-<span class="lineNum">     106 </span><span class="lineCov">              1 :         std::string preDepends(const std::string&amp; def = std::string()) const</span>
-<span class="lineNum">     107 </span>                :         {
-<span class="lineNum">     108 </span><span class="lineCov">              1 :                 return parseString(def, lookup(&quot;Pre-Depends&quot;));</span>
-<span class="lineNum">     109 </span>                :         }
-<span class="lineNum">     110 </span><span class="lineCov">              1 :         std::string recommends(const std::string&amp; def = std::string()) const</span>
-<span class="lineNum">     111 </span>                :         {
-<span class="lineNum">     112 </span><span class="lineCov">              1 :                 return parseString(def, lookup(&quot;Recommends&quot;));</span>
-<span class="lineNum">     113 </span>                :         }
-<span class="lineNum">     114 </span><span class="lineCov">              1 :         std::string suggests(const std::string&amp; def = std::string()) const</span>
-<span class="lineNum">     115 </span>                :         {
-<span class="lineNum">     116 </span><span class="lineCov">              1 :                 return parseString(def, lookup(&quot;Suggests&quot;));</span>
-<span class="lineNum">     117 </span>                :         }
-<span class="lineNum">     118 </span><span class="lineCov">              1 :         std::string enhances(const std::string&amp; def = std::string()) const</span>
-<span class="lineNum">     119 </span>                :         {
-<span class="lineNum">     120 </span><span class="lineCov">              1 :                 return parseString(def, lookup(&quot;Enhances&quot;));</span>
-<span class="lineNum">     121 </span>                :         }
-<span class="lineNum">     122 </span><span class="lineCov">              1 :         std::string provides(const std::string&amp; def = std::string()) const</span>
-<span class="lineNum">     123 </span>                :         {
-<span class="lineNum">     124 </span><span class="lineCov">              1 :                 return parseString(def, lookup(&quot;Provides&quot;));</span>
-<span class="lineNum">     125 </span>                :         }
-<span class="lineNum">     126 </span><span class="lineCov">              1 :         std::string conflicts(const std::string&amp; def = std::string()) const</span>
-<span class="lineNum">     127 </span>                :         {
-<span class="lineNum">     128 </span><span class="lineCov">              1 :                 return parseString(def, lookup(&quot;Conflicts&quot;));</span>
-<span class="lineNum">     129 </span>                :         }
-<span class="lineNum">     130 </span><span class="lineCov">              1 :         std::string filename(const std::string&amp; def = std::string()) const</span>
-<span class="lineNum">     131 </span>                :         {
-<span class="lineNum">     132 </span><span class="lineCov">              1 :                 return parseString(def, lookup(&quot;Filename&quot;));</span>
-<span class="lineNum">     133 </span>                :         }
-<span class="lineNum">     134 </span><span class="lineCov">           2605 :         size_t packageSize(size_t def = 0) const</span>
-<span class="lineNum">     135 </span>                :         {
-<span class="lineNum">     136 </span><span class="lineCov">           2605 :                 return parseSize(def, lookup(&quot;Size&quot;));</span>
-<span class="lineNum">     137 </span>                :         }
-<span class="lineNum">     138 </span><span class="lineCov">              1 :         std::string md5sum(const std::string&amp; def = std::string()) const</span>
-<span class="lineNum">     139 </span>                :         {
-<span class="lineNum">     140 </span><span class="lineCov">              1 :                 return parseString(def, lookup(&quot;MD5sum&quot;));</span>
-<span class="lineNum">     141 </span>                :         }
-<span class="lineNum">     142 </span><span class="lineCov">              1 :         std::string sha1(const std::string&amp; def = std::string()) const</span>
-<span class="lineNum">     143 </span>                :         {
-<span class="lineNum">     144 </span><span class="lineCov">              1 :                 return parseString(def, lookup(&quot;SHA1&quot;));</span>
-<span class="lineNum">     145 </span>                :         }
-<span class="lineNum">     146 </span><span class="lineCov">              1 :         std::string sha256(const std::string&amp; def = std::string()) const</span>
-<span class="lineNum">     147 </span>                :         {
-<span class="lineNum">     148 </span><span class="lineCov">              1 :                 return parseString(def, lookup(&quot;SHA256&quot;));</span>
-<span class="lineNum">     149 </span>                :         }
-<span class="lineNum">     150 </span><span class="lineCov">           2605 :         std::string description(const std::string&amp; def = std::string()) const</span>
-<span class="lineNum">     151 </span>                :         {
-<span class="lineNum">     152 </span><span class="lineCov">           2605 :                 return parseString(def, lookup(&quot;Description&quot;));</span>
-<span class="lineNum">     153 </span>                :         }
-<span class="lineNum">     154 </span><span class="lineCov">              1 :         std::string shortDescription(const std::string&amp; def = std::string()) const</span>
-<span class="lineNum">     155 </span>                :         {
-<span class="lineNum">     156 </span><span class="lineCov">              1 :                 return parseShortDescription(def, lookup(&quot;Description&quot;));</span>
-<span class="lineNum">     157 </span>                :         }
-<span class="lineNum">     158 </span><span class="lineCov">              1 :         std::string longDescription(const std::string&amp; def = std::string()) const</span>
-<span class="lineNum">     159 </span>                :         {
-<span class="lineNum">     160 </span><span class="lineCov">              1 :                 return parseLongDescription(def, lookup(&quot;Description&quot;));</span>
-<span class="lineNum">     161 </span>                :         }
-<span class="lineNum">     162 </span><span class="lineCov">              1 :         bool buildEssential(bool def = false) const</span>
-<span class="lineNum">     163 </span>                :         {
-<span class="lineNum">     164 </span><span class="lineCov">              1 :                 return parseBool(def, lookup(&quot;Build-Essential&quot;));</span>
-<span class="lineNum">     165 </span>                :         }
-<span class="lineNum">     166 </span><span class="lineCov">           2605 :         std::set&lt;std::string&gt; tag(const std::set&lt;std::string&gt;&amp; def = std::set&lt;std::string&gt;()) const</span>
-<span class="lineNum">     167 </span>                :         {
-<span class="lineNum">     168 </span><span class="lineCov">           2605 :                 return parseTags(def, lookup(&quot;Tag&quot;));</span>
-<span class="lineNum">     169 </span>                :         }
-<span class="lineNum">     170 </span>                : };
-<span class="lineNum">     171 </span>                : 
-<span class="lineNum">     172 </span>                : }
-<span class="lineNum">     173 </span>                : }
-<span class="lineNum">     174 </span>                : 
-<span class="lineNum">     175 </span>                : // vim:set ts=4 sw=4:
-<span class="lineNum">     176 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/apt/packagerecord.test.h.gcov.html b/rep/ept/apt/packagerecord.test.h.gcov.html
deleted file mode 100644
index c2c2709..0000000
--- a/rep/ept/apt/packagerecord.test.h.gcov.html
+++ /dev/null
@@ -1,205 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/apt/packagerecord.test.h</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/apt</a> - packagerecord.test.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">52</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">88.5 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">46</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /*
-<span class="lineNum">       2 </span>                :  * Copyright (C) 2007  Enrico Zini &lt;enrico@enricozini.org&gt;
-<span class="lineNum">       3 </span>                :  *
-<span class="lineNum">       4 </span>                :  * This library is free software; you can redistribute it and/or
-<span class="lineNum">       5 </span>                :  * modify it under the terms of the GNU Lesser General Public
-<span class="lineNum">       6 </span>                :  * License as published by the Free Software Foundation; either
-<span class="lineNum">       7 </span>                :  * version 2.1 of the License, or (at your option) any later version.
-<span class="lineNum">       8 </span>                :  *
-<span class="lineNum">       9 </span>                :  * This library is distributed in the hope that it will be useful,
-<span class="lineNum">      10 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      11 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-<span class="lineNum">      12 </span>                :  * Lesser General Public License for more details.
-<span class="lineNum">      13 </span>                :  *
-<span class="lineNum">      14 </span>                :  * You should have received a copy of the GNU Lesser General Public
-<span class="lineNum">      15 </span>                :  * License along with this library; if not, write to the Free Software
-<span class="lineNum">      16 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
-<span class="lineNum">      17 </span>                :  */
-<span class="lineNum">      18 </span>                : 
-<span class="lineNum">      19 </span>                : #include &lt;ept/test.h&gt;
-<span class="lineNum">      20 </span>                : #include &lt;ept/apt/packagerecord.h&gt;
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                : namespace std {
-<span class="lineNum">      23 </span><span class="lineNoCov">              0 :     ostream&amp; operator&lt;&lt;(ostream&amp; out, const set&lt;string&gt;&amp; s)</span>
-<span class="lineNum">      24 </span>                :         {
-<span class="lineNum">      25 </span><span class="lineNoCov">              0 :             for (set&lt;string&gt;::const_iterator i = s.begin();</span>
-<span class="lineNum">      26 </span>                :                  i != s.end(); ++i)
-<span class="lineNum">      27 </span><span class="lineNoCov">              0 :                 if (i == s.begin())</span>
-<span class="lineNum">      28 </span><span class="lineNoCov">              0 :                     out &lt;&lt; *i;</span>
-<span class="lineNum">      29 </span>                :                 else
-<span class="lineNum">      30 </span><span class="lineNoCov">              0 :                     out &lt;&lt; &quot;, &quot; &lt;&lt; *i;</span>
-<span class="lineNum">      31 </span><span class="lineNoCov">              0 :             return out;</span>
-<span class="lineNum">      32 </span>                :         }
-<span class="lineNum">      33 </span>                : }
-<span class="lineNum">      34 </span>                : 
-<span class="lineNum">      35 </span>                : using namespace std;
-<span class="lineNum">      36 </span>                : using namespace ept;
-<span class="lineNum">      37 </span>                : using namespace ept::apt;
-<span class="lineNum">      38 </span>                : 
-<span class="lineNum">      39 </span>                : struct TestAptPackagerecord {
-<span class="lineNum">      40 </span>                : 
-<span class="lineNum">      41 </span>                :     // Check that the supported fields are understood
-<span class="lineNum">      42 </span><span class="lineCov">              1 :     Test supportedFields()</span>
-<span class="lineNum">      43 </span>                :     {
-<span class="lineNum">      44 </span>                :         string record =
-<span class="lineNum">      45 </span>                :             &quot;Package: apt\n&quot;
-<span class="lineNum">      46 </span>                :             &quot;Priority: important\n&quot;
-<span class="lineNum">      47 </span>                :             &quot;Section: admin\n&quot;
-<span class="lineNum">      48 </span>                :             &quot;Installed-Size: 4368\n&quot;
-<span class="lineNum">      49 </span>                :             &quot;Maintainer: APT Development Team &lt;deity@lists.debian.org&gt;\n&quot;
-<span class="lineNum">      50 </span>                :             &quot;Architecture: amd64\n&quot;
-<span class="lineNum">      51 </span>                :             &quot;Source: apt\n&quot;
-<span class="lineNum">      52 </span>                :             &quot;Version: 0.6.46.4-0.1\n&quot;
-<span class="lineNum">      53 </span>                :             &quot;Replaces: libapt-pkg-doc (&lt;&lt; 0.3.7), libapt-pkg-dev (&lt;&lt; 0.3.7)\n&quot;
-<span class="lineNum">      54 </span>                :             &quot;Provides: libapt-pkg-libc6.3-6-3.11\n&quot;
-<span class="lineNum">      55 </span>                :             &quot;Depends: libc6 (&gt;= 2.3.5-1), libgcc1 (&gt;= 1:4.1.1-12), libstdc++6 (&gt;= 4.1.1-12), debian-archive-keyring\n&quot;
-<span class="lineNum">      56 </span>                :             &quot;Pre-Depends: debtags (maybe)\n&quot;
-<span class="lineNum">      57 </span>                :             &quot;Suggests: aptitude | synaptic | gnome-apt | wajig, dpkg-dev, apt-doc, bzip2\n&quot;
-<span class="lineNum">      58 </span>                :             &quot;Recommends: debtags (maybe)\n&quot;
-<span class="lineNum">      59 </span>                :             &quot;Enhances: debian\n&quot;
-<span class="lineNum">      60 </span>                :             &quot;Conflicts: marameo\n&quot;
-<span class="lineNum">      61 </span>                :             &quot;Filename: pool/main/a/apt/apt_0.6.46.4-0.1_amd64.deb\n&quot;
-<span class="lineNum">      62 </span>                :             &quot;Size: 1436478\n&quot;
-<span class="lineNum">      63 </span>                :             &quot;MD5sum: 1776421f80d6300c77a608e77a9f4a15\n&quot;
-<span class="lineNum">      64 </span>                :             &quot;SHA1: 1bd7337d2df56d267632cf72ac930c0a4895898f\n&quot;
-<span class="lineNum">      65 </span>                :             &quot;SHA256: b92442ab60046b4d0728245f39cc932f26e17db9f7933a5ec9aaa63172f51fda\n&quot;
-<span class="lineNum">      66 </span>                :             &quot;Description: Advanced front-end for dpkg\n&quot;
-<span class="lineNum">      67 </span>                :             &quot; This is Debian's next generation front-end for the dpkg package manager.\n&quot;
-<span class="lineNum">      68 </span>                :             &quot; It provides the apt-get utility and APT dselect method that provides a\n&quot;
-<span class="lineNum">      69 </span>                :             &quot; simpler, safer way to install and upgrade packages.\n&quot;
-<span class="lineNum">      70 </span>                :             &quot; .\n&quot;
-<span class="lineNum">      71 </span>                :             &quot; APT features complete installation ordering, multiple source capability\n&quot;
-<span class="lineNum">      72 </span>                :             &quot; and several other unique features, see the Users Guide in apt-doc.\n&quot;
-<span class="lineNum">      73 </span>                :             &quot;Build-Essential: yes\n&quot;
-<span class="lineNum">      74 </span><span class="lineCov">              1 :             &quot;Tag: admin::package-management, filetransfer::ftp, filetransfer::http, hardware::storage:cd, interface::commandline, network::client, protocol::{ftp,http,ipv6}, role::program, suite::debian, use::downloading, use::searching, works-with::software:package\n&quot;;</span>
-<span class="lineNum">      75 </span>                : 
-<span class="lineNum">      76 </span><span class="lineCov">              1 :         PackageRecord p(record);</span>
-<span class="lineNum">      77 </span>                : 
-<span class="lineNum">      78 </span><span class="lineCov">              1 :         assert_eq(p.size(), 24u);</span>
-<span class="lineNum">      79 </span>                : 
-<span class="lineNum">      80 </span><span class="lineCov">              2 :         assert_eq(p.package(), &quot;apt&quot;);</span>
-<span class="lineNum">      81 </span><span class="lineCov">              1 :         assert_eq(p.priority(), &quot;important&quot;);</span>
-<span class="lineNum">      82 </span><span class="lineCov">              1 :         assert_eq(p.section(), &quot;admin&quot;);</span>
-<span class="lineNum">      83 </span><span class="lineCov">              1 :         assert_eq(p.installedSize(), 4368u);</span>
-<span class="lineNum">      84 </span><span class="lineCov">              2 :         assert_eq(p.maintainer(), &quot;APT Development Team &lt;deity@lists.debian.org&gt;&quot;);</span>
-<span class="lineNum">      85 </span><span class="lineCov">              1 :         assert_eq(p.architecture(), &quot;amd64&quot;);</span>
-<span class="lineNum">      86 </span><span class="lineCov">              1 :         assert_eq(p.source(), &quot;apt&quot;);</span>
-<span class="lineNum">      87 </span><span class="lineCov">              1 :         assert_eq(p.version(), &quot;0.6.46.4-0.1&quot;);</span>
-<span class="lineNum">      88 </span><span class="lineCov">              1 :         assert_eq(p.replaces(), &quot;libapt-pkg-doc (&lt;&lt; 0.3.7), libapt-pkg-dev (&lt;&lt; 0.3.7)&quot;);</span>
-<span class="lineNum">      89 </span><span class="lineCov">              1 :         assert_eq(p.provides(), &quot;libapt-pkg-libc6.3-6-3.11&quot;);</span>
-<span class="lineNum">      90 </span><span class="lineCov">              1 :         assert_eq(p.depends(), &quot;libc6 (&gt;= 2.3.5-1), libgcc1 (&gt;= 1:4.1.1-12), libstdc++6 (&gt;= 4.1.1-12), debian-archive-keyring&quot;);</span>
-<span class="lineNum">      91 </span><span class="lineCov">              1 :         assert_eq(p.preDepends(), &quot;debtags (maybe)&quot;);</span>
-<span class="lineNum">      92 </span><span class="lineCov">              1 :         assert_eq(p.recommends(), &quot;debtags (maybe)&quot;);</span>
-<span class="lineNum">      93 </span><span class="lineCov">              1 :         assert_eq(p.suggests(), &quot;aptitude | synaptic | gnome-apt | wajig, dpkg-dev, apt-doc, bzip2&quot;);</span>
-<span class="lineNum">      94 </span><span class="lineCov">              1 :         assert_eq(p.enhances(), &quot;debian&quot;);</span>
-<span class="lineNum">      95 </span><span class="lineCov">              1 :         assert_eq(p.conflicts(), &quot;marameo&quot;);</span>
-<span class="lineNum">      96 </span><span class="lineCov">              1 :         assert_eq(p.filename(), &quot;pool/main/a/apt/apt_0.6.46.4-0.1_amd64.deb&quot;);</span>
-<span class="lineNum">      97 </span><span class="lineCov">              1 :         assert_eq(p.packageSize(), 1436478u);</span>
-<span class="lineNum">      98 </span><span class="lineCov">              2 :         assert_eq(p.md5sum(), &quot;1776421f80d6300c77a608e77a9f4a15&quot;);</span>
-<span class="lineNum">      99 </span><span class="lineCov">              1 :         assert_eq(p.sha1(), &quot;1bd7337d2df56d267632cf72ac930c0a4895898f&quot;);</span>
-<span class="lineNum">     100 </span><span class="lineCov">              1 :         assert_eq(p.sha256(), &quot;b92442ab60046b4d0728245f39cc932f26e17db9f7933a5ec9aaa63172f51fda&quot;);</span>
-<span class="lineNum">     101 </span>                :         assert_eq(p.description(), &quot;Advanced front-end for dpkg\n&quot;
-<span class="lineNum">     102 </span>                :                       &quot; This is Debian's next generation front-end for the dpkg package manager.\n&quot;
-<span class="lineNum">     103 </span>                :                       &quot; It provides the apt-get utility and APT dselect method that provides a\n&quot;
-<span class="lineNum">     104 </span>                :                       &quot; simpler, safer way to install and upgrade packages.\n&quot;
-<span class="lineNum">     105 </span>                :                       &quot; .\n&quot;
-<span class="lineNum">     106 </span>                :                       &quot; APT features complete installation ordering, multiple source capability\n&quot;
-<span class="lineNum">     107 </span><span class="lineCov">              1 :                       &quot; and several other unique features, see the Users Guide in apt-doc.&quot;);</span>
-<span class="lineNum">     108 </span><span class="lineCov">              1 :         assert_eq(p.shortDescription(), &quot;Advanced front-end for dpkg&quot;);</span>
-<span class="lineNum">     109 </span>                :         assert_eq(p.longDescription(),
-<span class="lineNum">     110 </span>                :                       &quot;This is Debian's next generation front-end for the dpkg package manager.\n&quot;
-<span class="lineNum">     111 </span>                :                       &quot; It provides the apt-get utility and APT dselect method that provides a\n&quot;
-<span class="lineNum">     112 </span>                :                       &quot; simpler, safer way to install and upgrade packages.\n&quot;
-<span class="lineNum">     113 </span>                :                       &quot; .\n&quot;
-<span class="lineNum">     114 </span>                :                       &quot; APT features complete installation ordering, multiple source capability\n&quot;
-<span class="lineNum">     115 </span><span class="lineCov">              1 :                       &quot; and several other unique features, see the Users Guide in apt-doc.&quot;);</span>
-<span class="lineNum">     116 </span><span class="lineCov">              1 :         assert_eq(p.buildEssential(), true);</span>
-<span class="lineNum">     117 </span>                :         
-<span class="lineNum">     118 </span><span class="lineCov">              1 :         std::set&lt;std::string&gt; tags;</span>
-<span class="lineNum">     119 </span><span class="lineCov">              1 :         tags.insert(&quot;admin::package-management&quot;);</span>
-<span class="lineNum">     120 </span><span class="lineCov">              2 :         tags.insert(&quot;filetransfer::ftp&quot;);</span>
-<span class="lineNum">     121 </span><span class="lineCov">              2 :         tags.insert(&quot;filetransfer::http&quot;);</span>
-<span class="lineNum">     122 </span><span class="lineCov">              2 :         tags.insert(&quot;hardware::storage:cd&quot;);</span>
-<span class="lineNum">     123 </span><span class="lineCov">              2 :         tags.insert(&quot;interface::commandline&quot;);</span>
-<span class="lineNum">     124 </span><span class="lineCov">              2 :         tags.insert(&quot;network::client&quot;);</span>
-<span class="lineNum">     125 </span><span class="lineCov">              2 :         tags.insert(&quot;protocol::ftp&quot;);</span>
-<span class="lineNum">     126 </span><span class="lineCov">              2 :         tags.insert(&quot;protocol::http&quot;);</span>
-<span class="lineNum">     127 </span><span class="lineCov">              2 :         tags.insert(&quot;protocol::ipv6&quot;);</span>
-<span class="lineNum">     128 </span><span class="lineCov">              2 :         tags.insert(&quot;role::program&quot;);</span>
-<span class="lineNum">     129 </span><span class="lineCov">              2 :         tags.insert(&quot;suite::debian&quot;);</span>
-<span class="lineNum">     130 </span><span class="lineCov">              2 :         tags.insert(&quot;use::downloading&quot;);</span>
-<span class="lineNum">     131 </span><span class="lineCov">              2 :         tags.insert(&quot;use::searching&quot;);</span>
-<span class="lineNum">     132 </span><span class="lineCov">              2 :         tags.insert(&quot;works-with::software:package&quot;);</span>
-<span class="lineNum">     133 </span><span class="lineCov">              2 :         assert_eq(p.tag(), tags);</span>
-<span class="lineNum">     134 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">     135 </span>                : 
-<span class="lineNum">     136 </span>                : };
-<span class="lineNum">     137 </span>                : 
-<span class="lineNum">     138 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/apt/recordparser.cc.gcov.html b/rep/ept/apt/recordparser.cc.gcov.html
deleted file mode 100644
index f1f46c3..0000000
--- a/rep/ept/apt/recordparser.cc.gcov.html
+++ /dev/null
@@ -1,237 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/apt/recordparser.cc</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/apt</a> - recordparser.cc</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">62</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">62</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /** \file
-<span class="lineNum">       2 </span>                :  * Parser for APT records
-<span class="lineNum">       3 </span>                :  */
-<span class="lineNum">       4 </span>                : 
-<span class="lineNum">       5 </span>                : /* 
-<span class="lineNum">       6 </span>                :  * Copyright (C) 2007  Enrico Zini &lt;enrico@enricozini.org&gt;
-<span class="lineNum">       7 </span>                :  *
-<span class="lineNum">       8 </span>                :  * This library is free software; you can redistribute it and/or
-<span class="lineNum">       9 </span>                :  * modify it under the terms of the GNU Lesser General Public
-<span class="lineNum">      10 </span>                :  * License as published by the Free Software Foundation; either
-<span class="lineNum">      11 </span>                :  * version 2.1 of the License, or (at your option) any later version.
-<span class="lineNum">      12 </span>                :  *
-<span class="lineNum">      13 </span>                :  * This library is distributed in the hope that it will be useful,
-<span class="lineNum">      14 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      15 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-<span class="lineNum">      16 </span>                :  * Lesser General Public License for more details.
-<span class="lineNum">      17 </span>                :  *
-<span class="lineNum">      18 </span>                :  * You should have received a copy of the GNU Lesser General Public
-<span class="lineNum">      19 </span>                :  * License along with this library; if not, write to the Free Software
-<span class="lineNum">      20 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
-<span class="lineNum">      21 </span>                :  */
-<span class="lineNum">      22 </span>                : 
-<span class="lineNum">      23 </span>                : #include &lt;ept/apt/recordparser.h&gt;
-<span class="lineNum">      24 </span>                : 
-<span class="lineNum">      25 </span>                : #include &lt;algorithm&gt;
-<span class="lineNum">      26 </span>                : #include &lt;cctype&gt;
-<span class="lineNum">      27 </span>                : 
-<span class="lineNum">      28 </span>                : //#include &lt;iostream&gt;
-<span class="lineNum">      29 </span>                : 
-<span class="lineNum">      30 </span>                : using namespace std;
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span>                : namespace ept {
-<span class="lineNum">      33 </span>                : namespace apt {
-<span class="lineNum">      34 </span>                : 
-<span class="lineNum">      35 </span>                : struct rpcompare
-<span class="lineNum">      36 </span>                : {
-<span class="lineNum">      37 </span>                :         const RecordParser&amp; rp;
-<span class="lineNum">      38 </span><span class="lineCov">           2618 :         rpcompare(const RecordParser&amp; rp) : rp(rp) {}</span>
-<span class="lineNum">      39 </span><span class="lineCov">         177724 :         bool operator()(size_t a, size_t b)</span>
-<span class="lineNum">      40 </span>                :         {
-<span class="lineNum">      41 </span><span class="lineCov">         177724 :                 return rp.name(a) &lt; rp.name(b);</span>
-<span class="lineNum">      42 </span>                :         }
-<span class="lineNum">      43 </span>                : };
-<span class="lineNum">      44 </span>                : 
-<span class="lineNum">      45 </span><span class="lineCov">           2618 : void RecordParser::scan(const std::string&amp; str)</span>
-<span class="lineNum">      46 </span>                : {
-<span class="lineNum">      47 </span><span class="lineCov">           2618 :         buffer = str;</span>
-<span class="lineNum">      48 </span><span class="lineCov">           2618 :         ends.clear();</span>
-<span class="lineNum">      49 </span><span class="lineCov">           2618 :         sorted.clear();</span>
-<span class="lineNum">      50 </span>                : 
-<span class="lineNum">      51 </span>                :         //cerr &lt;&lt; &quot;PARSE &quot; &lt;&lt; endl &lt;&lt; buffer &lt;&lt; &quot;*****&quot; &lt;&lt; endl;
-<span class="lineNum">      52 </span>                : 
-<span class="lineNum">      53 </span>                :         // Scan the buffer, taking note of all ending offsets of the various fields
-<span class="lineNum">      54 </span><span class="lineCov">           2618 :         size_t pos = 0;</span>
-<span class="lineNum">      55 </span><span class="lineCov">           2618 :         size_t idx = 0;</span>
-<span class="lineNum">      56 </span><span class="lineCov">          59427 :         while (pos &lt; buffer.size() - 1)</span>
-<span class="lineNum">      57 </span>                :         {
-<span class="lineNum">      58 </span>                :                 //cerr &lt;&lt; &quot;PREPOS &quot; &lt;&lt; pos &lt;&lt; &quot; left: &quot; &lt;&lt; buffer.substr(pos, 10) &lt;&lt; endl;
-<span class="lineNum">      59 </span><span class="lineCov">          56809 :                 pos = buffer.find(&quot;\n&quot;, pos);</span>
-<span class="lineNum">      60 </span>                :                 //cerr &lt;&lt; &quot;POSTPOS &quot; &lt;&lt; pos &lt;&lt; &quot; left: &quot; &lt;&lt; (pos == string::npos ? &quot;NONE&quot; : buffer.substr(pos, 10)) &lt;&lt; endl;
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span>                :                 // The buffer does not end with a newline
-<span class="lineNum">      63 </span><span class="lineCov">          56809 :                 if (pos == string::npos)</span>
-<span class="lineNum">      64 </span>                :                 {
-<span class="lineNum">      65 </span>                :                         //cerr &lt;&lt; &quot;ENDNOTEOL&quot; &lt;&lt; endl;
-<span class="lineNum">      66 </span><span class="lineCov">              1 :                         pos = buffer.size();</span>
-<span class="lineNum">      67 </span><span class="lineCov">              1 :                         ends.push_back(pos);</span>
-<span class="lineNum">      68 </span><span class="lineCov">              1 :                         sorted.push_back(idx++);</span>
-<span class="lineNum">      69 </span><span class="lineCov">              1 :                         break;</span>
-<span class="lineNum">      70 </span>                :                 }
-<span class="lineNum">      71 </span>                : 
-<span class="lineNum">      72 </span><span class="lineCov">          56808 :                 ++pos;</span>
-<span class="lineNum">      73 </span>                :                 //cerr &lt;&lt; &quot;POSTPOSINC &quot; &lt;&lt; pos &lt;&lt; &quot; left: &quot; &lt;&lt; buffer.substr(pos, 10) &lt;&lt; endl;
-<span class="lineNum">      74 </span>                : 
-<span class="lineNum">      75 </span>                :                 // The buffer ends with a newline
-<span class="lineNum">      76 </span><span class="lineCov">          56808 :                 if (pos == buffer.size())</span>
-<span class="lineNum">      77 </span>                :                 {
-<span class="lineNum">      78 </span>                :                         //cerr &lt;&lt; &quot;ENDEOL&quot; &lt;&lt; endl;
-<span class="lineNum">      79 </span><span class="lineCov">             11 :                         ends.push_back(pos);</span>
-<span class="lineNum">      80 </span><span class="lineCov">             11 :                         sorted.push_back(idx++);</span>
-<span class="lineNum">      81 </span><span class="lineCov">             11 :                         break;</span>
-<span class="lineNum">      82 </span>                :                 }
-<span class="lineNum">      83 </span>                : 
-<span class="lineNum">      84 </span>                :                 // Terminate parsing on double newlines
-<span class="lineNum">      85 </span><span class="lineCov">          56797 :                 if (buffer[pos] == '\n')</span>
-<span class="lineNum">      86 </span>                :                 {
-<span class="lineNum">      87 </span>                :                         //cerr &lt;&lt; &quot;ENDDOUBLENL&quot; &lt;&lt; endl;
-<span class="lineNum">      88 </span><span class="lineCov">           2606 :                         ends.push_back(pos);</span>
-<span class="lineNum">      89 </span><span class="lineCov">           2606 :                         sorted.push_back(idx++);</span>
-<span class="lineNum">      90 </span><span class="lineCov">           2606 :                         break;</span>
-<span class="lineNum">      91 </span>                :                 }
-<span class="lineNum">      92 </span>                : 
-<span class="lineNum">      93 </span>                :                 // Mark the end of the field if it's not a continuation line
-<span class="lineNum">      94 </span><span class="lineCov">          54191 :                 if (!isspace(buffer[pos]))</span>
-<span class="lineNum">      95 </span>                :                 {
-<span class="lineNum">      96 </span>                :                         //cerr &lt;&lt; &quot;INNERFIELD&quot; &lt;&lt; endl;
-<span class="lineNum">      97 </span><span class="lineCov">          34233 :                         ends.push_back(pos);</span>
-<span class="lineNum">      98 </span><span class="lineCov">          34233 :                         sorted.push_back(idx++);</span>
-<span class="lineNum">      99 </span>                :                 } //else
-<span class="lineNum">     100 </span>                :                         //cerr &lt;&lt; &quot;CONTLINE&quot; &lt;&lt; endl;
-<span class="lineNum">     101 </span>                :         }
-<span class="lineNum">     102 </span>                : 
-<span class="lineNum">     103 </span>                :         // Sort the sorted array
-<span class="lineNum">     104 </span><span class="lineCov">           2618 :         sort(sorted.begin(), sorted.end(), rpcompare(*this));</span>
-<span class="lineNum">     105 </span>                : 
-<span class="lineNum">     106 </span>                :         //for (size_t i = 0; i &lt; ends.size(); ++i)
-<span class="lineNum">     107 </span>                :         //      cerr &lt;&lt; ends[i] &lt;&lt; &quot;\t&quot; &lt;&lt; name(i) &lt;&lt; &quot;\t&quot; &lt;&lt; sorted[i] &lt;&lt; &quot;\t&quot; &lt;&lt; name(sorted[i]) &lt;&lt; endl;
-<span class="lineNum">     108 </span><span class="lineCov">           2618 : }</span>
-<span class="lineNum">     109 </span>                : 
-<span class="lineNum">     110 </span><span class="lineCov">         465183 : std::string RecordParser::field(size_t idx) const</span>
-<span class="lineNum">     111 </span>                : {
-<span class="lineNum">     112 </span><span class="lineCov">         465183 :         if (idx &gt;= ends.size())</span>
-<span class="lineNum">     113 </span><span class="lineCov">           2664 :                 return string();</span>
-<span class="lineNum">     114 </span><span class="lineCov">         462519 :         if (idx == 0)</span>
-<span class="lineNum">     115 </span><span class="lineCov">          52771 :                 return buffer.substr(0, ends[0]);</span>
-<span class="lineNum">     116 </span>                :         else
-<span class="lineNum">     117 </span><span class="lineCov">         409748 :                 return buffer.substr(ends[idx-1], ends[idx]-ends[idx-1]);</span>
-<span class="lineNum">     118 </span>                : }
-<span class="lineNum">     119 </span>                : 
-<span class="lineNum">     120 </span><span class="lineCov">         446879 : std::string RecordParser::name(size_t idx) const</span>
-<span class="lineNum">     121 </span>                : {
-<span class="lineNum">     122 </span><span class="lineCov">         446879 :         string res = field(idx);</span>
-<span class="lineNum">     123 </span><span class="lineCov">         446879 :         size_t pos = res.find(&quot;:&quot;);</span>
-<span class="lineNum">     124 </span><span class="lineCov">         446879 :         if (pos == string::npos)</span>
-<span class="lineNum">     125 </span><span class="lineCov">              1 :                 return res;</span>
-<span class="lineNum">     126 </span><span class="lineCov">         446878 :         return res.substr(0, pos);</span>
-<span class="lineNum">     127 </span>                : }
-<span class="lineNum">     128 </span>                : 
-<span class="lineNum">     129 </span><span class="lineCov">          18279 : std::string RecordParser::lookup(size_t idx) const</span>
-<span class="lineNum">     130 </span>                : {
-<span class="lineNum">     131 </span><span class="lineCov">          18279 :         string res = field(idx);</span>
-<span class="lineNum">     132 </span><span class="lineCov">          18279 :         size_t pos = res.find(&quot;:&quot;);</span>
-<span class="lineNum">     133 </span><span class="lineCov">          18279 :         if (pos == string::npos)</span>
-<span class="lineNum">     134 </span><span class="lineCov">           2662 :                 return res;</span>
-<span class="lineNum">     135 </span>                :         // Skip initial whitespace after the :
-<span class="lineNum">     136 </span><span class="lineCov">          15617 :         for (++pos; pos &lt; res.size() &amp;&amp; isspace(res[pos]); ++pos)</span>
-<span class="lineNum">     137 </span>                :                 ;
-<span class="lineNum">     138 </span><span class="lineCov">          15617 :         res = res.substr(pos);</span>
-<span class="lineNum">     139 </span>                :         // Trim spaces at the end
-<span class="lineNum">     140 </span><span class="lineCov">          46850 :         while (!res.empty() &amp;&amp; isspace(res[res.size() - 1]))</span>
-<span class="lineNum">     141 </span><span class="lineCov">          15616 :                 res.resize(res.size() - 1);</span>
-<span class="lineNum">     142 </span><span class="lineCov">          15617 :         return res;</span>
-<span class="lineNum">     143 </span>                : }
-<span class="lineNum">     144 </span>                : 
-<span class="lineNum">     145 </span><span class="lineCov">          18283 : size_t RecordParser::index(const std::string&amp; str) const</span>
-<span class="lineNum">     146 </span>                : {
-<span class="lineNum">     147 </span>                :         int begin, end;
-<span class="lineNum">     148 </span>                : 
-<span class="lineNum">     149 </span>                :         /* Binary search */
-<span class="lineNum">     150 </span><span class="lineCov">          18283 :         begin = -1, end = size();</span>
-<span class="lineNum">     151 </span><span class="lineCov">         109703 :         while (end - begin &gt; 1)</span>
-<span class="lineNum">     152 </span>                :         {
-<span class="lineNum">     153 </span><span class="lineCov">          73137 :                 int cur = (end + begin) / 2;</span>
-<span class="lineNum">     154 </span>                :                 //cerr &lt;&lt; &quot;Test &quot; &lt;&lt; cur &lt;&lt; &quot; &quot; &lt;&lt; str &lt;&lt; &quot; &lt; &quot; &lt;&lt; name(cur) &lt;&lt; endl;
-<span class="lineNum">     155 </span><span class="lineCov">          73137 :                 if (name(sorted[cur]) &gt; str)</span>
-<span class="lineNum">     156 </span><span class="lineCov">          32507 :                         end = cur;</span>
-<span class="lineNum">     157 </span>                :                 else
-<span class="lineNum">     158 </span><span class="lineCov">          40630 :                         begin = cur;</span>
-<span class="lineNum">     159 </span>                :         }
-<span class="lineNum">     160 </span>                : 
-<span class="lineNum">     161 </span><span class="lineCov">          18283 :         if (begin == -1 || name(sorted[begin]) != str)</span>
-<span class="lineNum">     162 </span><span class="lineCov">           2661 :                 return size();</span>
-<span class="lineNum">     163 </span>                :         else
-<span class="lineNum">     164 </span><span class="lineCov">          15622 :                 return sorted[begin];</span>
-<span class="lineNum">     165 </span>                : }
-<span class="lineNum">     166 </span>                : 
-<span class="lineNum">     167 </span>                : }
-<span class="lineNum">     168 </span>                : }
-<span class="lineNum">     169 </span>                : 
-<span class="lineNum">     170 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/apt/recordparser.h.gcov.html b/rep/ept/apt/recordparser.h.gcov.html
deleted file mode 100644
index 60082e3..0000000
--- a/rep/ept/apt/recordparser.h.gcov.html
+++ /dev/null
@@ -1,162 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/apt/recordparser.h</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/apt</a> - recordparser.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">8</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">8</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #ifndef EPT_APT_RECORDPARSER_H
-<span class="lineNum">       2 </span>                : #define EPT_APT_RECORDPARSER_H
-<span class="lineNum">       3 </span>                : 
-<span class="lineNum">       4 </span>                : /** \file
-<span class="lineNum">       5 </span>                :  * Parser for APT records
-<span class="lineNum">       6 </span>                :  */
-<span class="lineNum">       7 </span>                : 
-<span class="lineNum">       8 </span>                : /*
-<span class="lineNum">       9 </span>                :  * Copyright (C) 2007  Enrico Zini &lt;enrico@enricozini.org&gt;
-<span class="lineNum">      10 </span>                :  *
-<span class="lineNum">      11 </span>                :  * This library is free software; you can redistribute it and/or
-<span class="lineNum">      12 </span>                :  * modify it under the terms of the GNU Lesser General Public
-<span class="lineNum">      13 </span>                :  * License as published by the Free Software Foundation; either
-<span class="lineNum">      14 </span>                :  * version 2.1 of the License, or (at your option) any later version.
-<span class="lineNum">      15 </span>                :  *
-<span class="lineNum">      16 </span>                :  * This library is distributed in the hope that it will be useful,
-<span class="lineNum">      17 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      18 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-<span class="lineNum">      19 </span>                :  * Lesser General Public License for more details.
-<span class="lineNum">      20 </span>                :  *
-<span class="lineNum">      21 </span>                :  * You should have received a copy of the GNU Lesser General Public
-<span class="lineNum">      22 </span>                :  * License along with this library; if not, write to the Free Software
-<span class="lineNum">      23 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
-<span class="lineNum">      24 </span>                :  */
-<span class="lineNum">      25 </span>                : 
-<span class="lineNum">      26 </span>                : #include &lt;vector&gt;
-<span class="lineNum">      27 </span>                : #include &lt;string&gt;
-<span class="lineNum">      28 </span>                : 
-<span class="lineNum">      29 </span>                : namespace ept {
-<span class="lineNum">      30 </span>                : namespace apt {
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span>                : /**
-<span class="lineNum">      33 </span>                :  * Access the fields of a package record contained inside a std::string.
-<span class="lineNum">      34 </span>                :  *
-<span class="lineNum">      35 </span>                :  * Implementation note: this implementation should take advantage of
-<span class="lineNum">      36 </span>                :  * std::string sharing buffer space among them.
-<span class="lineNum">      37 </span>                :  */
-<span class="lineNum">      38 </span>                : class RecordParser
-<span class="lineNum">      39 </span><span class="lineCov">             19 : {</span>
-<span class="lineNum">      40 </span>                :         /// Buffer containing the whole record
-<span class="lineNum">      41 </span>                :         std::string buffer;
-<span class="lineNum">      42 </span>                : 
-<span class="lineNum">      43 </span>                :         /// End offsets of the various fields in the record
-<span class="lineNum">      44 </span>                :         std::vector&lt;size_t&gt; ends;
-<span class="lineNum">      45 </span>                : 
-<span class="lineNum">      46 </span>                :         /// Indexes on the ends vector, sorted by field name
-<span class="lineNum">      47 </span>                :         std::vector&lt;size_t&gt; sorted;
-<span class="lineNum">      48 </span>                : 
-<span class="lineNum">      49 </span>                : public:
-<span class="lineNum">      50 </span><span class="lineCov">              6 :         RecordParser() {}</span>
-<span class="lineNum">      51 </span><span class="lineCov">             13 :         RecordParser(const std::string&amp; str) { scan(str); }</span>
-<span class="lineNum">      52 </span>                : 
-<span class="lineNum">      53 </span>                :         /// Index a new record
-<span class="lineNum">      54 </span>                :         void scan(const std::string&amp; str);
-<span class="lineNum">      55 </span>                : 
-<span class="lineNum">      56 </span>                :         /**
-<span class="lineNum">      57 </span>                :          * Get the index of the field with the given name.
-<span class="lineNum">      58 </span>                :          *
-<span class="lineNum">      59 </span>                :          * size() is returned if not found
-<span class="lineNum">      60 </span>                :          */
-<span class="lineNum">      61 </span>                :         size_t index(const std::string&amp; str) const;
-<span class="lineNum">      62 </span>                : 
-<span class="lineNum">      63 </span>                :         /// Return the field by its index
-<span class="lineNum">      64 </span>                :         std::string field(size_t idx) const;
-<span class="lineNum">      65 </span>                : 
-<span class="lineNum">      66 </span>                :         /// Return the name of a field by its index
-<span class="lineNum">      67 </span>                :         std::string name(size_t idx) const;
-<span class="lineNum">      68 </span>                : 
-<span class="lineNum">      69 </span>                :         /// Return the content of a field by its index
-<span class="lineNum">      70 </span>                :         std::string lookup(size_t idx) const;
-<span class="lineNum">      71 </span>                : 
-<span class="lineNum">      72 </span>                :         /// Return the content of a field by its name
-<span class="lineNum">      73 </span><span class="lineCov">          18273 :         std::string lookup(const std::string&amp; name) const { return lookup(index(name)); }</span>
-<span class="lineNum">      74 </span>                : 
-<span class="lineNum">      75 </span>                :         /// Return the content of a field by its index
-<span class="lineNum">      76 </span><span class="lineCov">              6 :         std::string operator[](size_t idx) const { return lookup(idx); }</span>
-<span class="lineNum">      77 </span>                : 
-<span class="lineNum">      78 </span>                :         /// Return the content of a field by its name
-<span class="lineNum">      79 </span><span class="lineCov">             19 :         std::string operator[](const std::string&amp; name) const { return lookup(name); }</span>
-<span class="lineNum">      80 </span>                : 
-<span class="lineNum">      81 </span>                :         /// Return the entire record
-<span class="lineNum">      82 </span>                :         const std::string&amp; record() const { return buffer; }
-<span class="lineNum">      83 </span>                : 
-<span class="lineNum">      84 </span>                :         /// Return the entire record
-<span class="lineNum">      85 </span><span class="lineCov">              1 :         std::string record() { return buffer; }</span>
-<span class="lineNum">      86 </span>                : 
-<span class="lineNum">      87 </span>                :         /// Return the number of fields in the record
-<span class="lineNum">      88 </span><span class="lineCov">          20972 :         size_t size() const { return ends.size(); }</span>
-<span class="lineNum">      89 </span>                : };
-<span class="lineNum">      90 </span>                : 
-<span class="lineNum">      91 </span>                : }
-<span class="lineNum">      92 </span>                : }
-<span class="lineNum">      93 </span>                : 
-<span class="lineNum">      94 </span>                : // vim:set ts=4 sw=4:
-<span class="lineNum">      95 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/apt/recordparser.test.h.gcov.html b/rep/ept/apt/recordparser.test.h.gcov.html
deleted file mode 100644
index 477be3f..0000000
--- a/rep/ept/apt/recordparser.test.h.gcov.html
+++ /dev/null
@@ -1,295 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/apt/recordparser.test.h</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/apt</a> - recordparser.test.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">107</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">107</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /*
-<span class="lineNum">       2 </span>                :  * Copyright (C) 2007  Enrico Zini &lt;enrico@enricozini.org&gt;
-<span class="lineNum">       3 </span>                :  *
-<span class="lineNum">       4 </span>                :  * This library is free software; you can redistribute it and/or
-<span class="lineNum">       5 </span>                :  * modify it under the terms of the GNU Lesser General Public
-<span class="lineNum">       6 </span>                :  * License as published by the Free Software Foundation; either
-<span class="lineNum">       7 </span>                :  * version 2.1 of the License, or (at your option) any later version.
-<span class="lineNum">       8 </span>                :  *
-<span class="lineNum">       9 </span>                :  * This library is distributed in the hope that it will be useful,
-<span class="lineNum">      10 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      11 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-<span class="lineNum">      12 </span>                :  * Lesser General Public License for more details.
-<span class="lineNum">      13 </span>                :  *
-<span class="lineNum">      14 </span>                :  * You should have received a copy of the GNU Lesser General Public
-<span class="lineNum">      15 </span>                :  * License along with this library; if not, write to the Free Software
-<span class="lineNum">      16 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
-<span class="lineNum">      17 </span>                :  */
-<span class="lineNum">      18 </span>                : 
-<span class="lineNum">      19 </span>                : #include &lt;ept/test.h&gt;
-<span class="lineNum">      20 </span>                : #include &lt;ept/apt/recordparser.h&gt;
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                : //#include &lt;iostream&gt;
-<span class="lineNum">      23 </span>                : 
-<span class="lineNum">      24 </span>                : using namespace std;
-<span class="lineNum">      25 </span>                : using namespace ept;
-<span class="lineNum">      26 </span>                : using namespace ept::apt;
-<span class="lineNum">      27 </span>                : 
-<span class="lineNum">      28 </span><span class="lineCov">             12 : struct TestAptRecordparser {</span>
-<span class="lineNum">      29 </span>                :     std::string record;
-<span class="lineNum">      30 </span><span class="lineCov">             12 :     TestAptRecordparser()</span>
-<span class="lineNum">      31 </span><span class="lineCov">             12 :     {</span>
-<span class="lineNum">      32 </span>                :         record =
-<span class="lineNum">      33 </span>                :             &quot;A:\n&quot;
-<span class="lineNum">      34 </span>                :             &quot;D: da de di do du\n&quot;
-<span class="lineNum">      35 </span>                :             &quot;B: b\n&quot;
-<span class="lineNum">      36 </span>                :             &quot;C: c \n&quot;
-<span class="lineNum">      37 </span>                :             &quot;Desc: this is the beginning\n&quot;
-<span class="lineNum">      38 </span>                :             &quot; this is the continuation\n&quot;
-<span class="lineNum">      39 </span><span class="lineCov">             12 :             &quot; this is the end\n&quot;;</span>
-<span class="lineNum">      40 </span><span class="lineCov">             12 :     }</span>
-<span class="lineNum">      41 </span>                : 
-<span class="lineNum">      42 </span>                :     // Check that the fields are identified and broken up correctly
-<span class="lineNum">      43 </span><span class="lineCov">              1 :     Test parsing()</span>
-<span class="lineNum">      44 </span>                :     {
-<span class="lineNum">      45 </span><span class="lineCov">              1 :         RecordParser p(record);</span>
-<span class="lineNum">      46 </span>                :         
-<span class="lineNum">      47 </span><span class="lineCov">              1 :         assert_eq(p.record(), record);</span>
-<span class="lineNum">      48 </span><span class="lineCov">              1 :         assert_eq(p.size(), 5u);</span>
-<span class="lineNum">      49 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      50 </span>                : 
-<span class="lineNum">      51 </span><span class="lineCov">              1 :     Test fieldTuples()</span>
-<span class="lineNum">      52 </span>                :     {
-<span class="lineNum">      53 </span><span class="lineCov">              1 :         RecordParser p(record);</span>
-<span class="lineNum">      54 </span><span class="lineCov">              1 :         assert_eq(p.field(0), &quot;A:\n&quot;);</span>
-<span class="lineNum">      55 </span><span class="lineCov">              1 :         assert_eq(p.field(1), &quot;D: da de di do du\n&quot;);</span>
-<span class="lineNum">      56 </span><span class="lineCov">              1 :         assert_eq(p.field(2), &quot;B: b\n&quot;);</span>
-<span class="lineNum">      57 </span><span class="lineCov">              1 :         assert_eq(p.field(3), &quot;C: c \n&quot;);</span>
-<span class="lineNum">      58 </span><span class="lineCov">              1 :         assert_eq(p.field(4), &quot;Desc: this is the beginning\n this is the continuation\n this is the end\n&quot;);</span>
-<span class="lineNum">      59 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      60 </span>                : 
-<span class="lineNum">      61 </span><span class="lineCov">              1 :     Test fieldKeys()</span>
-<span class="lineNum">      62 </span>                :     {
-<span class="lineNum">      63 </span><span class="lineCov">              1 :         RecordParser p(record);</span>
-<span class="lineNum">      64 </span><span class="lineCov">              1 :         assert_eq(p.name(0), &quot;A&quot;);</span>
-<span class="lineNum">      65 </span><span class="lineCov">              1 :         assert_eq(p.name(1), &quot;D&quot;);</span>
-<span class="lineNum">      66 </span><span class="lineCov">              1 :         assert_eq(p.name(2), &quot;B&quot;);</span>
-<span class="lineNum">      67 </span><span class="lineCov">              1 :         assert_eq(p.name(3), &quot;C&quot;);</span>
-<span class="lineNum">      68 </span><span class="lineCov">              1 :         assert_eq(p.name(4), &quot;Desc&quot;);</span>
-<span class="lineNum">      69 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      70 </span>                : 
-<span class="lineNum">      71 </span><span class="lineCov">              1 :     Test fieldValues()</span>
-<span class="lineNum">      72 </span>                :     {
-<span class="lineNum">      73 </span><span class="lineCov">              1 :         RecordParser p(record);</span>
-<span class="lineNum">      74 </span><span class="lineCov">              1 :         assert_eq(p[0], &quot;&quot;);</span>
-<span class="lineNum">      75 </span><span class="lineCov">              1 :         assert_eq(p[1], &quot;da de di do du&quot;);</span>
-<span class="lineNum">      76 </span><span class="lineCov">              1 :         assert_eq(p[2], &quot;b&quot;);</span>
-<span class="lineNum">      77 </span><span class="lineCov">              1 :         assert_eq(p[3], &quot;c&quot;);</span>
-<span class="lineNum">      78 </span><span class="lineCov">              1 :         assert_eq(p[4], &quot;this is the beginning\n this is the continuation\n this is the end&quot;);</span>
-<span class="lineNum">      79 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      80 </span>                : 
-<span class="lineNum">      81 </span>                :     // Check that the field search by name finds all the fields
-<span class="lineNum">      82 </span><span class="lineCov">              1 :     Test findByName()</span>
-<span class="lineNum">      83 </span>                :     {
-<span class="lineNum">      84 </span><span class="lineCov">              1 :         RecordParser p(record);</span>
-<span class="lineNum">      85 </span>                : 
-<span class="lineNum">      86 </span><span class="lineCov">              1 :         assert_eq(p.index(&quot;A&quot;), 0u);</span>
-<span class="lineNum">      87 </span><span class="lineCov">              2 :         assert_eq(p.index(&quot;D&quot;), 1u);</span>
-<span class="lineNum">      88 </span><span class="lineCov">              2 :         assert_eq(p.index(&quot;B&quot;), 2u);</span>
-<span class="lineNum">      89 </span><span class="lineCov">              2 :         assert_eq(p.index(&quot;C&quot;), 3u);</span>
-<span class="lineNum">      90 </span><span class="lineCov">              2 :         assert_eq(p.index(&quot;Desc&quot;), 4u);</span>
-<span class="lineNum">      91 </span>                : 
-<span class="lineNum">      92 </span><span class="lineCov">              2 :         assert_eq(p.name(p.index(&quot;A&quot;)), &quot;A&quot;);</span>
-<span class="lineNum">      93 </span><span class="lineCov">              2 :         assert_eq(p.name(p.index(&quot;B&quot;)), &quot;B&quot;);</span>
-<span class="lineNum">      94 </span><span class="lineCov">              2 :         assert_eq(p.name(p.index(&quot;C&quot;)), &quot;C&quot;);</span>
-<span class="lineNum">      95 </span><span class="lineCov">              2 :         assert_eq(p.name(p.index(&quot;D&quot;)), &quot;D&quot;);</span>
-<span class="lineNum">      96 </span><span class="lineCov">              2 :         assert_eq(p.name(p.index(&quot;Desc&quot;)), &quot;Desc&quot;);</span>
-<span class="lineNum">      97 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      98 </span>                : 
-<span class="lineNum">      99 </span><span class="lineCov">              1 :     Test indexing()</span>
-<span class="lineNum">     100 </span>                :     {
-<span class="lineNum">     101 </span><span class="lineCov">              1 :         RecordParser p(record);</span>
-<span class="lineNum">     102 </span><span class="lineCov">              1 :         assert_eq(p[&quot;A&quot;], &quot;&quot;);</span>
-<span class="lineNum">     103 </span><span class="lineCov">              2 :         assert_eq(p[&quot;B&quot;], &quot;b&quot;);</span>
-<span class="lineNum">     104 </span><span class="lineCov">              2 :         assert_eq(p[&quot;C&quot;], &quot;c&quot;);</span>
-<span class="lineNum">     105 </span><span class="lineCov">              2 :         assert_eq(p[&quot;D&quot;], &quot;da de di do du&quot;);</span>
-<span class="lineNum">     106 </span><span class="lineCov">              2 :         assert_eq(p[&quot;Desc&quot;], &quot;this is the beginning\n this is the continuation\n this is the end&quot;);</span>
-<span class="lineNum">     107 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">     108 </span>                : 
-<span class="lineNum">     109 </span><span class="lineCov">              1 :     Test missingBehaviour()</span>
-<span class="lineNum">     110 </span>                :     {
-<span class="lineNum">     111 </span><span class="lineCov">              1 :         RecordParser p(record);</span>
-<span class="lineNum">     112 </span>                :         // Missing fields give empty strings
-<span class="lineNum">     113 </span><span class="lineCov">              1 :         assert_eq(p.field(100), &quot;&quot;);</span>
-<span class="lineNum">     114 </span><span class="lineCov">              1 :         assert_eq(p.name(100), &quot;&quot;);</span>
-<span class="lineNum">     115 </span><span class="lineCov">              1 :         assert_eq(p[100], &quot;&quot;);</span>
-<span class="lineNum">     116 </span><span class="lineCov">              1 :         assert_eq(p[&quot;Missing&quot;], &quot;&quot;);</span>
-<span class="lineNum">     117 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">     118 </span>                : 
-<span class="lineNum">     119 </span>                :     // Check that scanning twice replaces the old fields
-<span class="lineNum">     120 </span><span class="lineCov">              1 :     Test rescan()</span>
-<span class="lineNum">     121 </span>                :     {
-<span class="lineNum">     122 </span>                :         std::string record =
-<span class="lineNum">     123 </span>                :             &quot;A: a\n&quot;
-<span class="lineNum">     124 </span>                :             &quot;B: b\n&quot;
-<span class="lineNum">     125 </span><span class="lineCov">              1 :             &quot;C: c\n&quot;;</span>
-<span class="lineNum">     126 </span>                : 
-<span class="lineNum">     127 </span><span class="lineCov">              1 :         RecordParser p(record);</span>
-<span class="lineNum">     128 </span><span class="lineCov">              1 :         assert_eq(p.size(), 3u);</span>
-<span class="lineNum">     129 </span><span class="lineCov">              2 :         assert_eq(p[&quot;A&quot;], &quot;a&quot;);</span>
-<span class="lineNum">     130 </span><span class="lineCov">              2 :         assert_eq(p[&quot;B&quot;], &quot;b&quot;);</span>
-<span class="lineNum">     131 </span><span class="lineCov">              2 :         assert_eq(p[&quot;C&quot;], &quot;c&quot;);</span>
-<span class="lineNum">     132 </span>                : 
-<span class="lineNum">     133 </span>                :         std::string record1 =
-<span class="lineNum">     134 </span>                :             &quot;Foo: bar\n&quot;
-<span class="lineNum">     135 </span><span class="lineCov">              2 :             &quot;A: different\n&quot;;</span>
-<span class="lineNum">     136 </span>                : 
-<span class="lineNum">     137 </span><span class="lineCov">              1 :         p.scan(record1);</span>
-<span class="lineNum">     138 </span>                : 
-<span class="lineNum">     139 </span>                :         //for (size_t i = 0; i &lt; p.size(); ++i)
-<span class="lineNum">     140 </span>                :         //      cerr &lt;&lt; &quot;&gt;&gt; &quot; &lt;&lt; i &lt;&lt; &quot;==&quot; &lt;&lt; p.index(p.name(i)) &lt;&lt; &quot; &quot; &lt;&lt; p.name(i) &lt;&lt; &quot; &quot; &lt;&lt; p[i] &lt;&lt; endl;
-<span class="lineNum">     141 </span>                : 
-<span class="lineNum">     142 </span><span class="lineCov">              1 :         assert_eq(p.size(), 2u);</span>
-<span class="lineNum">     143 </span><span class="lineCov">              2 :         assert_eq(p[&quot;A&quot;], &quot;different&quot;);</span>
-<span class="lineNum">     144 </span><span class="lineCov">              2 :         assert_eq(p[&quot;B&quot;], &quot;&quot;);</span>
-<span class="lineNum">     145 </span><span class="lineCov">              2 :         assert_eq(p[&quot;C&quot;], &quot;&quot;);</span>
-<span class="lineNum">     146 </span><span class="lineCov">              2 :         assert_eq(p[&quot;Foo&quot;], &quot;bar&quot;);</span>
-<span class="lineNum">     147 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">     148 </span>                : 
-<span class="lineNum">     149 </span>                :     // Real-life example
-<span class="lineNum">     150 </span><span class="lineCov">              1 :     Test realLife()</span>
-<span class="lineNum">     151 </span>                :     {
-<span class="lineNum">     152 </span>                :         string record = 
-<span class="lineNum">     153 </span>                :             &quot;Package: apt\n&quot;
-<span class="lineNum">     154 </span>                :             &quot;Priority: important\n&quot;
-<span class="lineNum">     155 </span>                :             &quot;Section: admin\n&quot;
-<span class="lineNum">     156 </span>                :             &quot;Installed-Size: 4368\n&quot;
-<span class="lineNum">     157 </span>                :             &quot;Maintainer: APT Development Team &lt;deity@lists.debian.org&gt;\n&quot;
-<span class="lineNum">     158 </span>                :             &quot;Architecture: amd64\n&quot;
-<span class="lineNum">     159 </span>                :             &quot;Version: 0.6.46.4-0.1\n&quot;
-<span class="lineNum">     160 </span>                :             &quot;Replaces: libapt-pkg-doc (&lt;&lt; 0.3.7), libapt-pkg-dev (&lt;&lt; 0.3.7)\n&quot;
-<span class="lineNum">     161 </span>                :             &quot;Provides: libapt-pkg-libc6.3-6-3.11\n&quot;
-<span class="lineNum">     162 </span>                :             &quot;Depends: libc6 (&gt;= 2.3.5-1), libgcc1 (&gt;= 1:4.1.1-12), libstdc++6 (&gt;= 4.1.1-12), debian-archive-keyring\n&quot;
-<span class="lineNum">     163 </span>                :             &quot;Suggests: aptitude | synaptic | gnome-apt | wajig, dpkg-dev, apt-doc, bzip2\n&quot;
-<span class="lineNum">     164 </span>                :             &quot;Filename: pool/main/a/apt/apt_0.6.46.4-0.1_amd64.deb\n&quot;
-<span class="lineNum">     165 </span>                :             &quot;Size: 1436478\n&quot;
-<span class="lineNum">     166 </span>                :             &quot;MD5sum: 1776421f80d6300c77a608e77a9f4a15\n&quot;
-<span class="lineNum">     167 </span>                :             &quot;SHA1: 1bd7337d2df56d267632cf72ac930c0a4895898f\n&quot;
-<span class="lineNum">     168 </span>                :             &quot;SHA256: b92442ab60046b4d0728245f39cc932f26e17db9f7933a5ec9aaa63172f51fda\n&quot;
-<span class="lineNum">     169 </span>                :             &quot;Description: Advanced front-end for dpkg\n&quot;
-<span class="lineNum">     170 </span>                :             &quot; This is Debian's next generation front-end for the dpkg package manager.\n&quot;
-<span class="lineNum">     171 </span>                :             &quot; It provides the apt-get utility and APT dselect method that provides a\n&quot;
-<span class="lineNum">     172 </span>                :             &quot; simpler, safer way to install and upgrade packages.\n&quot;
-<span class="lineNum">     173 </span>                :             &quot; .\n&quot;
-<span class="lineNum">     174 </span>                :             &quot; APT features complete installation ordering, multiple source capability\n&quot;
-<span class="lineNum">     175 </span>                :             &quot; and several other unique features, see the Users Guide in apt-doc.\n&quot;
-<span class="lineNum">     176 </span>                :             &quot;Build-Essential: yes\n&quot;
-<span class="lineNum">     177 </span><span class="lineCov">              1 :             &quot;Tag: admin::package-management, filetransfer::ftp, filetransfer::http, hardware::storage:cd, interface::commandline, network::client, protocol::{ftp,http,ipv6}, role::program, suite::debian, use::downloading, use::searching, works-with::software:package\n&quot;;</span>
-<span class="lineNum">     178 </span><span class="lineCov">              1 :         RecordParser p(record);</span>
-<span class="lineNum">     179 </span>                : 
-<span class="lineNum">     180 </span><span class="lineCov">              1 :         assert_eq(p.size(), 19u);</span>
-<span class="lineNum">     181 </span>                : 
-<span class="lineNum">     182 </span><span class="lineCov">              1 :         string rec1;</span>
-<span class="lineNum">     183 </span><span class="lineCov">             20 :         for (size_t i = 0; i &lt; p.size(); ++i)</span>
-<span class="lineNum">     184 </span><span class="lineCov">             19 :             rec1 += p.field(i);</span>
-<span class="lineNum">     185 </span><span class="lineCov">              1 :         assert_eq(record, rec1);</span>
-<span class="lineNum">     186 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">     187 </span>                : 
-<span class="lineNum">     188 </span>                :     // Various buffer termination patterns
-<span class="lineNum">     189 </span><span class="lineCov">              1 :     Test bufferTermination()</span>
-<span class="lineNum">     190 </span>                :     {
-<span class="lineNum">     191 </span>                :         std::string record =
-<span class="lineNum">     192 </span>                :             &quot;A: a\n&quot;
-<span class="lineNum">     193 </span><span class="lineCov">              1 :             &quot;B: b&quot;;</span>
-<span class="lineNum">     194 </span>                : 
-<span class="lineNum">     195 </span><span class="lineCov">              1 :         RecordParser p(record);</span>
-<span class="lineNum">     196 </span><span class="lineCov">              1 :         assert_eq(p.size(), 2u);</span>
-<span class="lineNum">     197 </span><span class="lineCov">              2 :         assert_eq(p[&quot;A&quot;], &quot;a&quot;);</span>
-<span class="lineNum">     198 </span><span class="lineCov">              2 :         assert_eq(p[&quot;B&quot;], &quot;b&quot;);</span>
-<span class="lineNum">     199 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">     200 </span>                : 
-<span class="lineNum">     201 </span><span class="lineCov">              1 :     Test bufferTermination2()</span>
-<span class="lineNum">     202 </span>                :     {
-<span class="lineNum">     203 </span>                :         std::string record =
-<span class="lineNum">     204 </span>                :             &quot;A: a\n&quot;
-<span class="lineNum">     205 </span><span class="lineCov">              1 :             &quot;B: b\n\n&quot;;</span>
-<span class="lineNum">     206 </span>                : 
-<span class="lineNum">     207 </span><span class="lineCov">              1 :         RecordParser p(record);</span>
-<span class="lineNum">     208 </span><span class="lineCov">              1 :         assert_eq(p.size(), 2u);</span>
-<span class="lineNum">     209 </span><span class="lineCov">              2 :         assert_eq(p[&quot;A&quot;], &quot;a&quot;);</span>
-<span class="lineNum">     210 </span><span class="lineCov">              2 :         assert_eq(p[&quot;B&quot;], &quot;b&quot;);</span>
-<span class="lineNum">     211 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">     212 </span>                : 
-<span class="lineNum">     213 </span><span class="lineCov">              1 :     Test bufferTermination3()</span>
-<span class="lineNum">     214 </span>                :     {
-<span class="lineNum">     215 </span>                :         std::string record =
-<span class="lineNum">     216 </span>                :             &quot;A: a\n&quot;
-<span class="lineNum">     217 </span>                :             &quot;B: b\n\n&quot;
-<span class="lineNum">     218 </span><span class="lineCov">              1 :             &quot;C: c\n&quot;;</span>
-<span class="lineNum">     219 </span>                : 
-<span class="lineNum">     220 </span><span class="lineCov">              1 :         RecordParser p(record);</span>
-<span class="lineNum">     221 </span><span class="lineCov">              1 :         assert_eq(p.size(), 2u);</span>
-<span class="lineNum">     222 </span><span class="lineCov">              2 :         assert_eq(p[&quot;A&quot;], &quot;a&quot;);</span>
-<span class="lineNum">     223 </span><span class="lineCov">              2 :         assert_eq(p[&quot;B&quot;], &quot;b&quot;);</span>
-<span class="lineNum">     224 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">     225 </span>                : 
-<span class="lineNum">     226 </span>                : };
-<span class="lineNum">     227 </span>                : 
-<span class="lineNum">     228 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/apt/version.cc.gcov.html b/rep/ept/apt/version.cc.gcov.html
deleted file mode 100644
index d850ed3..0000000
--- a/rep/ept/apt/version.cc.gcov.html
+++ /dev/null
@@ -1,154 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/apt/version.cc</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/apt</a> - version.cc</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">34</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">88.2 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">30</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /** \file
-<span class="lineNum">       2 </span>                :  * Provide a very lightweight Version class that represent a package with a
-<span class="lineNum">       3 </span>                :  * version, with very cheap value copy operations.
-<span class="lineNum">       4 </span>                :  */
-<span class="lineNum">       5 </span>                : 
-<span class="lineNum">       6 </span>                : /* 
-<span class="lineNum">       7 </span>                :  * Copyright (C) 2007  Enrico Zini &lt;enrico@enricozini.org&gt;
-<span class="lineNum">       8 </span>                :  *
-<span class="lineNum">       9 </span>                :  * This library is free software; you can redistribute it and/or
-<span class="lineNum">      10 </span>                :  * modify it under the terms of the GNU Lesser General Public
-<span class="lineNum">      11 </span>                :  * License as published by the Free Software Foundation; either
-<span class="lineNum">      12 </span>                :  * version 2.1 of the License, or (at your option) any later version.
-<span class="lineNum">      13 </span>                :  *
-<span class="lineNum">      14 </span>                :  * This library is distributed in the hope that it will be useful,
-<span class="lineNum">      15 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      16 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-<span class="lineNum">      17 </span>                :  * Lesser General Public License for more details.
-<span class="lineNum">      18 </span>                :  *
-<span class="lineNum">      19 </span>                :  * You should have received a copy of the GNU Lesser General Public
-<span class="lineNum">      20 </span>                :  * License along with this library; if not, write to the Free Software
-<span class="lineNum">      21 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
-<span class="lineNum">      22 </span>                :  */
-<span class="lineNum">      23 </span>                : 
-<span class="lineNum">      24 </span>                : #include &lt;ept/apt/version.h&gt;
-<span class="lineNum">      25 </span>                : #include &lt;apt-pkg/debversion.h&gt;
-<span class="lineNum">      26 </span>                : 
-<span class="lineNum">      27 </span>                : using namespace std;
-<span class="lineNum">      28 </span>                : 
-<span class="lineNum">      29 </span>                : namespace ept {
-<span class="lineNum">      30 </span>                : namespace apt {
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span><span class="lineCov">              4 : std::string Version::upstreamVersion() const</span>
-<span class="lineNum">      33 </span>                : {
-<span class="lineNum">      34 </span>                :         // Skip the epoch, if it is there
-<span class="lineNum">      35 </span><span class="lineCov">              4 :         size_t start = m_version.find(':');</span>
-<span class="lineNum">      36 </span><span class="lineCov">              4 :         if (start == string::npos)</span>
-<span class="lineNum">      37 </span><span class="lineCov">              3 :                 start = 0;</span>
-<span class="lineNum">      38 </span>                :         else
-<span class="lineNum">      39 </span><span class="lineCov">              1 :                 ++start;</span>
-<span class="lineNum">      40 </span>                : 
-<span class="lineNum">      41 </span>                :         // Skip everything after the trailing '-', if it is there
-<span class="lineNum">      42 </span><span class="lineCov">              4 :         size_t end = m_version.rfind('-');</span>
-<span class="lineNum">      43 </span><span class="lineCov">              4 :         if (end == string::npos)</span>
-<span class="lineNum">      44 </span><span class="lineCov">              1 :                 end = m_version.size();</span>
-<span class="lineNum">      45 </span>                : 
-<span class="lineNum">      46 </span><span class="lineCov">              4 :         return m_version.substr(start, end-start);</span>
-<span class="lineNum">      47 </span>                : }
-<span class="lineNum">      48 </span>                : 
-<span class="lineNum">      49 </span>                : /* Version comparison by Debian policy */
-<span class="lineNum">      50 </span>                : 
-<span class="lineNum">      51 </span><span class="lineCov">              4 : bool Version::operator&lt;=(const Version&amp; pkg) const</span>
-<span class="lineNum">      52 </span>                : {
-<span class="lineNum">      53 </span><span class="lineCov">              4 :         if (name() &lt; pkg.name())</span>
-<span class="lineNum">      54 </span><span class="lineCov">              1 :                 return true;</span>
-<span class="lineNum">      55 </span><span class="lineCov">              3 :         if (name() == pkg.name())</span>
-<span class="lineNum">      56 </span><span class="lineCov">              3 :                 return debVS.CmpVersion(version(), pkg.version()) &lt;= 0;</span>
-<span class="lineNum">      57 </span><span class="lineNoCov">              0 :         return false;</span>
-<span class="lineNum">      58 </span>                : }
-<span class="lineNum">      59 </span><span class="lineCov">              5 : bool Version::operator&lt;(const Version&amp; pkg) const</span>
-<span class="lineNum">      60 </span>                : {
-<span class="lineNum">      61 </span><span class="lineCov">              5 :         if (name() &lt; pkg.name())</span>
-<span class="lineNum">      62 </span><span class="lineCov">              1 :                 return true;</span>
-<span class="lineNum">      63 </span><span class="lineCov">              4 :         if (name() == pkg.name())</span>
-<span class="lineNum">      64 </span><span class="lineCov">              4 :                 return debVS.CmpVersion(version(), pkg.version()) &lt; 0;</span>
-<span class="lineNum">      65 </span><span class="lineNoCov">              0 :         return false;</span>
-<span class="lineNum">      66 </span>                : }
-<span class="lineNum">      67 </span><span class="lineCov">              4 : bool Version::operator&gt;=(const Version&amp; pkg) const</span>
-<span class="lineNum">      68 </span>                : {
-<span class="lineNum">      69 </span><span class="lineCov">              4 :         if (name() &gt; pkg.name())</span>
-<span class="lineNum">      70 </span><span class="lineNoCov">              0 :                 return true;</span>
-<span class="lineNum">      71 </span><span class="lineCov">              4 :         if (name() == pkg.name())</span>
-<span class="lineNum">      72 </span><span class="lineCov">              3 :                 return debVS.CmpVersion(version(), pkg.version()) &gt;= 0;</span>
-<span class="lineNum">      73 </span><span class="lineCov">              1 :         return false;</span>
-<span class="lineNum">      74 </span>                : }
-<span class="lineNum">      75 </span><span class="lineCov">              5 : bool Version::operator&gt;(const Version&amp; pkg) const</span>
-<span class="lineNum">      76 </span>                : {
-<span class="lineNum">      77 </span><span class="lineCov">              5 :         if (name() &gt; pkg.name())</span>
-<span class="lineNum">      78 </span><span class="lineNoCov">              0 :                 return true;</span>
-<span class="lineNum">      79 </span><span class="lineCov">              5 :         if (name() == pkg.name())</span>
-<span class="lineNum">      80 </span><span class="lineCov">              4 :                 return debVS.CmpVersion(version(), pkg.version()) &gt; 0;</span>
-<span class="lineNum">      81 </span><span class="lineCov">              1 :         return false;</span>
-<span class="lineNum">      82 </span>                : }
-<span class="lineNum">      83 </span>                : 
-<span class="lineNum">      84 </span>                : }
-<span class="lineNum">      85 </span><span class="lineCov">              6 : }</span>
-<span class="lineNum">      86 </span>                : 
-<span class="lineNum">      87 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/apt/version.h.gcov.html b/rep/ept/apt/version.h.gcov.html
deleted file mode 100644
index 0f48a29..0000000
--- a/rep/ept/apt/version.h.gcov.html
+++ /dev/null
@@ -1,161 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/apt/version.h</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/apt</a> - version.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">9</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">9</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #ifndef EPT_APT_VERSION_H
-<span class="lineNum">       2 </span>                : #define EPT_APT_VERSION_H
-<span class="lineNum">       3 </span>                : 
-<span class="lineNum">       4 </span>                : /** \file
-<span class="lineNum">       5 </span>                :  * Representation of a package with a version
-<span class="lineNum">       6 </span>                :  */
-<span class="lineNum">       7 </span>                : 
-<span class="lineNum">       8 </span>                : /*
-<span class="lineNum">       9 </span>                :  * Copyright (C) 2007  Enrico Zini &lt;enrico@enricozini.org&gt;
-<span class="lineNum">      10 </span>                :  *
-<span class="lineNum">      11 </span>                :  * This library is free software; you can redistribute it and/or
-<span class="lineNum">      12 </span>                :  * modify it under the terms of the GNU Lesser General Public
-<span class="lineNum">      13 </span>                :  * License as published by the Free Software Foundation; either
-<span class="lineNum">      14 </span>                :  * version 2.1 of the License, or (at your option) any later version.
-<span class="lineNum">      15 </span>                :  *
-<span class="lineNum">      16 </span>                :  * This library is distributed in the hope that it will be useful,
-<span class="lineNum">      17 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      18 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-<span class="lineNum">      19 </span>                :  * Lesser General Public License for more details.
-<span class="lineNum">      20 </span>                :  *
-<span class="lineNum">      21 </span>                :  * You should have received a copy of the GNU Lesser General Public
-<span class="lineNum">      22 </span>                :  * License along with this library; if not, write to the Free Software
-<span class="lineNum">      23 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
-<span class="lineNum">      24 </span>                :  */
-<span class="lineNum">      25 </span>                : 
-<span class="lineNum">      26 </span>                : #include &lt;string&gt;
-<span class="lineNum">      27 </span>                : 
-<span class="lineNum">      28 </span>                : namespace ept {
-<span class="lineNum">      29 </span>                : namespace apt {
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : /**
-<span class="lineNum">      32 </span>                :  * Lightweight Version class that represent a package with a version, with very
-<span class="lineNum">      33 </span>                :  * cheap value copy operations.
-<span class="lineNum">      34 </span>                :  *
-<span class="lineNum">      35 </span>                :  * This class can be used to query package information from various information
-<span class="lineNum">      36 </span>                :  * sources.  The purpose is create a middle ground that makes sure that all
-<span class="lineNum">      37 </span>                :  * sort of different information sources about packages are referring to the
-<span class="lineNum">      38 </span>                :  * same package.
-<span class="lineNum">      39 </span>                :  */
-<span class="lineNum">      40 </span>                : class Version
-<span class="lineNum">      41 </span><span class="lineCov">             55 : {</span>
-<span class="lineNum">      42 </span>                : protected:
-<span class="lineNum">      43 </span>                :         std::string m_name;
-<span class="lineNum">      44 </span>                :         std::string m_version;
-<span class="lineNum">      45 </span>                : 
-<span class="lineNum">      46 </span>                : public:
-<span class="lineNum">      47 </span>                :         /**
-<span class="lineNum">      48 </span>                :          * Create an invalid Version
-<span class="lineNum">      49 </span>                :          */
-<span class="lineNum">      50 </span><span class="lineCov">              7 :         Version() {}</span>
-<span class="lineNum">      51 </span>                : 
-<span class="lineNum">      52 </span>                :         /**
-<span class="lineNum">      53 </span>                :          * Create a Version from strings
-<span class="lineNum">      54 </span>                :          */
-<span class="lineNum">      55 </span><span class="lineCov">             34 :         Version(const std::string&amp; name, const std::string&amp; version)</span>
-<span class="lineNum">      56 </span><span class="lineCov">             34 :                 : m_name(name), m_version(version) {}</span>
-<span class="lineNum">      57 </span>                : 
-<span class="lineNum">      58 </span>                :         /**
-<span class="lineNum">      59 </span>                :          * Return the package name
-<span class="lineNum">      60 </span>                :          */
-<span class="lineNum">      61 </span><span class="lineCov">             81 :         std::string name() const { return m_name; }</span>
-<span class="lineNum">      62 </span>                : 
-<span class="lineNum">      63 </span>                :         /**
-<span class="lineNum">      64 </span>                :          * Return the package version, or the empty string if this is a
-<span class="lineNum">      65 </span>                :          * versionless package.
-<span class="lineNum">      66 </span>                :          */
-<span class="lineNum">      67 </span><span class="lineCov">             38 :         std::string version() const { return m_version; }</span>
-<span class="lineNum">      68 </span>                : 
-<span class="lineNum">      69 </span>                :         /**
-<span class="lineNum">      70 </span>                :          * Return the upstream part of the version
-<span class="lineNum">      71 </span>                :          */
-<span class="lineNum">      72 </span>                :         std::string upstreamVersion() const;
-<span class="lineNum">      73 </span>                : 
-<span class="lineNum">      74 </span>                :         /**
-<span class="lineNum">      75 </span>                :          * Return true if this package contains a valid value
-<span class="lineNum">      76 </span>                :          */
-<span class="lineNum">      77 </span><span class="lineCov">             11 :         bool isValid() const { return !m_name.empty() &amp;&amp; !m_version.empty(); }</span>
-<span class="lineNum">      78 </span>                : 
-<span class="lineNum">      79 </span>                :         /**
-<span class="lineNum">      80 </span>                :          * Comparison operators
-<span class="lineNum">      81 </span>                :          */
-<span class="lineNum">      82 </span><span class="lineCov">              9 :         bool operator==(const Version&amp; pkg) const { return m_name == pkg.m_name &amp;&amp; m_version == pkg.m_version; }</span>
-<span class="lineNum">      83 </span><span class="lineCov">              5 :         bool operator!=(const Version&amp; pkg) const { return m_name != pkg.m_name || m_version != pkg.m_version; }</span>
-<span class="lineNum">      84 </span>                :         bool operator&lt;=(const Version&amp; pkg) const;
-<span class="lineNum">      85 </span>                :         bool operator&lt;(const Version&amp; pkg) const;
-<span class="lineNum">      86 </span>                :         bool operator&gt;=(const Version&amp; pkg) const;
-<span class="lineNum">      87 </span>                :         bool operator&gt;(const Version&amp; pkg) const;
-<span class="lineNum">      88 </span>                : };
-<span class="lineNum">      89 </span>                : 
-<span class="lineNum">      90 </span>                : }
-<span class="lineNum">      91 </span>                : }
-<span class="lineNum">      92 </span>                : 
-<span class="lineNum">      93 </span>                : // vim:set ts=4 sw=4:
-<span class="lineNum">      94 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/apt/version.test.h.gcov.html b/rep/ept/apt/version.test.h.gcov.html
deleted file mode 100644
index 0f645e7..0000000
--- a/rep/ept/apt/version.test.h.gcov.html
+++ /dev/null
@@ -1,203 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/apt/version.test.h</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/apt</a> - version.test.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">71</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">71</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /*
-<span class="lineNum">       2 </span>                :  * Copyright (C) 2007  Enrico Zini &lt;enrico@enricozini.org&gt;
-<span class="lineNum">       3 </span>                :  *
-<span class="lineNum">       4 </span>                :  * This library is free software; you can redistribute it and/or
-<span class="lineNum">       5 </span>                :  * modify it under the terms of the GNU Lesser General Public
-<span class="lineNum">       6 </span>                :  * License as published by the Free Software Foundation; either
-<span class="lineNum">       7 </span>                :  * version 2.1 of the License, or (at your option) any later version.
-<span class="lineNum">       8 </span>                :  *
-<span class="lineNum">       9 </span>                :  * This library is distributed in the hope that it will be useful,
-<span class="lineNum">      10 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      11 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-<span class="lineNum">      12 </span>                :  * Lesser General Public License for more details.
-<span class="lineNum">      13 </span>                :  *
-<span class="lineNum">      14 </span>                :  * You should have received a copy of the GNU Lesser General Public
-<span class="lineNum">      15 </span>                :  * License along with this library; if not, write to the Free Software
-<span class="lineNum">      16 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
-<span class="lineNum">      17 </span>                :  */
-<span class="lineNum">      18 </span>                : 
-<span class="lineNum">      19 </span>                : #include &lt;ept/test.h&gt;
-<span class="lineNum">      20 </span>                : #include &lt;ept/apt/version.h&gt;
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                : using namespace std;
-<span class="lineNum">      23 </span>                : using namespace ept::apt;
-<span class="lineNum">      24 </span>                : 
-<span class="lineNum">      25 </span>                : struct TestAptVersion {
-<span class="lineNum">      26 </span>                : 
-<span class="lineNum">      27 </span>                :     // Basic test for invalid version
-<span class="lineNum">      28 </span><span class="lineCov">              1 :     Test invalid()</span>
-<span class="lineNum">      29 </span>                :     {
-<span class="lineNum">      30 </span><span class="lineCov">              1 :         Version test;</span>
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span><span class="lineCov">              1 :         assert_eq(test.name(), &quot;&quot;);</span>
-<span class="lineNum">      33 </span><span class="lineCov">              1 :         assert_eq(test.version(), &quot;&quot;);</span>
-<span class="lineNum">      34 </span><span class="lineCov">              1 :         assert_eq(test.isValid(), false);</span>
-<span class="lineNum">      35 </span>                : 
-<span class="lineNum">      36 </span><span class="lineCov">              1 :         string p = test.name();</span>
-<span class="lineNum">      37 </span>                : 
-<span class="lineNum">      38 </span><span class="lineCov">              1 :         assert_eq(p, string());</span>
-<span class="lineNum">      39 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      40 </span>                : 
-<span class="lineNum">      41 </span>                :     // Basic test for version
-<span class="lineNum">      42 </span><span class="lineCov">              1 :     Test basic()</span>
-<span class="lineNum">      43 </span>                :     {
-<span class="lineNum">      44 </span><span class="lineCov">              1 :         Version test(&quot;test&quot;, &quot;1.0&quot;);</span>
-<span class="lineNum">      45 </span>                : 
-<span class="lineNum">      46 </span><span class="lineCov">              2 :         assert_eq(test.name(), &quot;test&quot;);</span>
-<span class="lineNum">      47 </span><span class="lineCov">              1 :         assert_eq(test.version(), &quot;1.0&quot;);</span>
-<span class="lineNum">      48 </span><span class="lineCov">              1 :         assert_eq(test.isValid(), true);</span>
-<span class="lineNum">      49 </span>                : 
-<span class="lineNum">      50 </span><span class="lineCov">              1 :         string p = test.name();</span>
-<span class="lineNum">      51 </span>                : 
-<span class="lineNum">      52 </span><span class="lineCov">              1 :         assert_eq(p, &quot;test&quot;);</span>
-<span class="lineNum">      53 </span>                : 
-<span class="lineNum">      54 </span><span class="lineCov">              1 :         Version v(p, &quot;1.1&quot;);</span>
-<span class="lineNum">      55 </span><span class="lineCov">              2 :         assert_eq(v.name(), &quot;test&quot;);</span>
-<span class="lineNum">      56 </span><span class="lineCov">              1 :         assert_eq(v.version(), &quot;1.1&quot;);</span>
-<span class="lineNum">      57 </span><span class="lineCov">              1 :         assert_eq(v.isValid(), true);</span>
-<span class="lineNum">      58 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      59 </span>                : 
-<span class="lineNum">      60 </span>                :     // Comparison semanthics
-<span class="lineNum">      61 </span><span class="lineCov">              1 :     Test comparison()</span>
-<span class="lineNum">      62 </span>                :     {
-<span class="lineNum">      63 </span><span class="lineCov">              1 :         Version test(&quot;test&quot;, &quot;1.0&quot;);</span>
-<span class="lineNum">      64 </span><span class="lineCov">              2 :         Version test1(&quot;test&quot;, &quot;1.0&quot;);</span>
-<span class="lineNum">      65 </span>                : 
-<span class="lineNum">      66 </span><span class="lineCov">              2 :         assert(test == test1);</span>
-<span class="lineNum">      67 </span><span class="lineCov">              2 :         assert(! (test != test1));</span>
-<span class="lineNum">      68 </span><span class="lineCov">              2 :         assert(! (test &lt; test1));</span>
-<span class="lineNum">      69 </span><span class="lineCov">              2 :         assert(! (test &gt; test1));</span>
-<span class="lineNum">      70 </span><span class="lineCov">              2 :         assert(test &lt;= test1);</span>
-<span class="lineNum">      71 </span><span class="lineCov">              2 :         assert(test &gt;= test1);</span>
-<span class="lineNum">      72 </span>                : 
-<span class="lineNum">      73 </span>                : 
-<span class="lineNum">      74 </span><span class="lineCov">              2 :         Version test2(&quot;test2&quot;, &quot;1.0&quot;);</span>
-<span class="lineNum">      75 </span>                : 
-<span class="lineNum">      76 </span><span class="lineCov">              2 :         assert(test != test2);</span>
-<span class="lineNum">      77 </span><span class="lineCov">              2 :         assert(test != test2);</span>
-<span class="lineNum">      78 </span><span class="lineCov">              2 :         assert(test &lt; test2);</span>
-<span class="lineNum">      79 </span><span class="lineCov">              2 :         assert(! (test &gt; test2));</span>
-<span class="lineNum">      80 </span><span class="lineCov">              2 :         assert(test &lt;= test2);</span>
-<span class="lineNum">      81 </span><span class="lineCov">              2 :         assert(! (test &gt;= test2));</span>
-<span class="lineNum">      82 </span>                : 
-<span class="lineNum">      83 </span>                : 
-<span class="lineNum">      84 </span><span class="lineCov">              2 :         Version test3(&quot;test&quot;, &quot;2.0&quot;);</span>
-<span class="lineNum">      85 </span>                : 
-<span class="lineNum">      86 </span><span class="lineCov">              2 :         assert(test != test3);</span>
-<span class="lineNum">      87 </span><span class="lineCov">              2 :         assert(test != test3);</span>
-<span class="lineNum">      88 </span><span class="lineCov">              2 :         assert(test &lt; test3);</span>
-<span class="lineNum">      89 </span><span class="lineCov">              2 :         assert(! (test &gt; test3));</span>
-<span class="lineNum">      90 </span><span class="lineCov">              2 :         assert(test &lt;= test3);</span>
-<span class="lineNum">      91 </span><span class="lineCov">              2 :         assert(! (test &gt;= test3));</span>
-<span class="lineNum">      92 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      93 </span>                : 
-<span class="lineNum">      94 </span>                :     // Value-copy semanthics
-<span class="lineNum">      95 </span><span class="lineCov">              1 :     Test valueCopy()</span>
-<span class="lineNum">      96 </span>                :     {
-<span class="lineNum">      97 </span><span class="lineCov">              1 :         Version test(&quot;test&quot;, &quot;1.0&quot;);</span>
-<span class="lineNum">      98 </span><span class="lineCov">              1 :         Version test1 = test;</span>
-<span class="lineNum">      99 </span>                : 
-<span class="lineNum">     100 </span><span class="lineCov">              1 :         assert(test == test1);</span>
-<span class="lineNum">     101 </span>                : 
-<span class="lineNum">     102 </span><span class="lineCov">              1 :         Version test2;</span>
-<span class="lineNum">     103 </span><span class="lineCov">              1 :         test2 = test;</span>
-<span class="lineNum">     104 </span><span class="lineCov">              1 :         assert(test == test2);</span>
-<span class="lineNum">     105 </span><span class="lineCov">              2 :         assert(test1 == test2);</span>
-<span class="lineNum">     106 </span>                : 
-<span class="lineNum">     107 </span><span class="lineCov">              2 :         Version test3(&quot;test&quot;, &quot;1.0&quot;);</span>
-<span class="lineNum">     108 </span><span class="lineCov">              2 :         assert(test == test3);</span>
-<span class="lineNum">     109 </span><span class="lineCov">              2 :         assert(test1 == test3);</span>
-<span class="lineNum">     110 </span><span class="lineCov">              2 :         assert(test2 == test3);</span>
-<span class="lineNum">     111 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">     112 </span>                : 
-<span class="lineNum">     113 </span>                :     // Extraction of upstream version
-<span class="lineNum">     114 </span><span class="lineCov">              1 :     Test upstreamVersion()</span>
-<span class="lineNum">     115 </span>                :     {
-<span class="lineNum">     116 </span><span class="lineCov">              1 :         assert_eq(Version(&quot;a&quot;, &quot;10.0&quot;).upstreamVersion(), &quot;10.0&quot;);</span>
-<span class="lineNum">     117 </span><span class="lineCov">              2 :         assert_eq(Version(&quot;a&quot;, &quot;10.0-1&quot;).upstreamVersion(), &quot;10.0&quot;);</span>
-<span class="lineNum">     118 </span><span class="lineCov">              2 :         assert_eq(Version(&quot;a&quot;, &quot;10.0~foo.1-1.0&quot;).upstreamVersion(), &quot;10.0~foo.1&quot;);</span>
-<span class="lineNum">     119 </span><span class="lineCov">              2 :         assert_eq(Version(&quot;a&quot;, &quot;1.0:10.0~foo.1-1.0&quot;).upstreamVersion(), &quot;10.0~foo.1&quot;);</span>
-<span class="lineNum">     120 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">     121 </span>                : 
-<span class="lineNum">     122 </span>                :     // Debian policy comparison semanthics
-<span class="lineNum">     123 </span><span class="lineCov">              1 :     Test policyComparison()</span>
-<span class="lineNum">     124 </span>                :     {
-<span class="lineNum">     125 </span><span class="lineCov">              1 :         assert(Version(&quot;a&quot;, &quot;10.0&quot;) &gt; Version(&quot;a&quot;, &quot;2.1&quot;));</span>
-<span class="lineNum">     126 </span><span class="lineCov">              2 :         assert(Version(&quot;a&quot;, &quot;1:10.0&quot;) &lt; Version(&quot;a&quot;, &quot;2:2.1&quot;));</span>
-<span class="lineNum">     127 </span><span class="lineCov">              2 :         assert(Version(&quot;a&quot;, &quot;10.0-1&quot;) &lt; Version(&quot;a&quot;, &quot;10.0-2&quot;));</span>
-<span class="lineNum">     128 </span><span class="lineCov">              2 :         assert(Version(&quot;a&quot;, &quot;10.0-2&quot;) &gt; Version(&quot;a&quot;, &quot;10.0-1&quot;));</span>
-<span class="lineNum">     129 </span><span class="lineCov">              2 :         assert(Version(&quot;a&quot;, &quot;1:10.0-1&quot;) &lt;= Version(&quot;a&quot;, &quot;1:10.0-1&quot;));</span>
-<span class="lineNum">     130 </span><span class="lineCov">              2 :         assert(Version(&quot;a&quot;, &quot;1:10.0-1&quot;) &gt;= Version(&quot;a&quot;, &quot;1:10.0-1&quot;));</span>
-<span class="lineNum">     131 </span>                :         // TODO: add more
-<span class="lineNum">     132 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">     133 </span>                : 
-<span class="lineNum">     134 </span>                : };
-<span class="lineNum">     135 </span>                : 
-<span class="lineNum">     136 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/core/apt.cpp.gcov.html b/rep/ept/core/apt.cpp.gcov.html
deleted file mode 100644
index 159b490..0000000
--- a/rep/ept/core/apt.cpp.gcov.html
+++ /dev/null
@@ -1,90 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/core/apt.cpp</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/core</a> - apt.cpp</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">7</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">7</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- C++ -*-
-<span class="lineNum">       2 </span>                : #include &lt;ept/core/apt.h&gt;
-<span class="lineNum">       3 </span>                : #include &lt;wibble/sys/fs.h&gt;
-<span class="lineNum">       4 </span>                : 
-<span class="lineNum">       5 </span>                : namespace wfs = wibble::sys::fs;
-<span class="lineNum">       6 </span>                : 
-<span class="lineNum">       7 </span>                : namespace ept {
-<span class="lineNum">       8 </span>                : namespace core {
-<span class="lineNum">       9 </span><span class="lineCov">             45 : time_t aptTimestamp()</span>
-<span class="lineNum">      10 </span>                : {
-<span class="lineNum">      11 </span>                :     std::auto_ptr&lt;struct stat&gt; st = wfs::stat(
-<span class="lineNum">      12 </span><span class="lineCov">             45 :         _config-&gt;FindFile( &quot;Dir::Cache::pkgcache&quot; ) );</span>
-<span class="lineNum">      13 </span><span class="lineCov">             45 :     time_t t1 = st.get() == NULL ? 0 : st-&gt;st_mtime;</span>
-<span class="lineNum">      14 </span>                :  
-<span class="lineNum">      15 </span>                :     std::auto_ptr&lt;struct stat&gt; st1 = wfs::stat(
-<span class="lineNum">      16 </span><span class="lineCov">             45 :         _config-&gt;FindFile( &quot;Dir::State::status&quot; ) );</span>
-<span class="lineNum">      17 </span><span class="lineCov">             45 :     time_t t2 = st1.get() == NULL ? 0 : st1-&gt;st_mtime;</span>
-<span class="lineNum">      18 </span>                :  
-<span class="lineNum">      19 </span><span class="lineCov">             45 :     return t1 &gt; t2 ? t1 : t2;</span>
-<span class="lineNum">      20 </span>                : }
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                : }
-<span class="lineNum">      23 </span><span class="lineCov">              6 : }</span>
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/core/apt.h.gcov.html b/rep/ept/core/apt.h.gcov.html
deleted file mode 100644
index b8d3ec9..0000000
--- a/rep/ept/core/apt.h.gcov.html
+++ /dev/null
@@ -1,474 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/core/apt.h</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/core</a> - apt.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">173</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">79.8 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">138</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : #include &lt;string&gt;
-<span class="lineNum">       4 </span>                : #include &lt;wibble/test.h&gt;
-<span class="lineNum">       5 </span>                : 
-<span class="lineNum">       6 </span>                : #include &lt;ept/token.h&gt;
-<span class="lineNum">       7 </span>                : #include &lt;ept/core/source.h&gt;
-<span class="lineNum">       8 </span>                : 
-<span class="lineNum">       9 </span>                : #include &lt;iostream&gt;
-<span class="lineNum">      10 </span>                : #include &lt;wibble/exception.h&gt;
-<span class="lineNum">      11 </span>                : 
-<span class="lineNum">      12 </span>                : #include &lt;apt-pkg/pkgcache.h&gt;
-<span class="lineNum">      13 </span>                : #include &lt;apt-pkg/sourcelist.h&gt;
-<span class="lineNum">      14 </span>                : #include &lt;apt-pkg/error.h&gt;
-<span class="lineNum">      15 </span>                : #include &lt;apt-pkg/policy.h&gt;
-<span class="lineNum">      16 </span>                : #include &lt;apt-pkg/cachefile.h&gt;
-<span class="lineNum">      17 </span>                : #include &lt;apt-pkg/progress.h&gt;
-<span class="lineNum">      18 </span>                : #include &lt;apt-pkg/pkgcachegen.h&gt;
-<span class="lineNum">      19 </span>                : #include &lt;apt-pkg/init.h&gt;
-<span class="lineNum">      20 </span>                : 
-<span class="lineNum">      21 </span>                : #ifndef EPT_APT_H
-<span class="lineNum">      22 </span>                : #define EPT_APT_H
-<span class="lineNum">      23 </span>                : 
-<span class="lineNum">      24 </span>                : namespace ept {
-<span class="lineNum">      25 </span>                : namespace core {
-<span class="lineNum">      26 </span>                : 
-<span class="lineNum">      27 </span><span class="lineNoCov">              0 : struct AptException : wibble::exception::Generic {</span>
-<span class="lineNum">      28 </span><span class="lineNoCov">              0 :     std::string desc() const throw () {</span>
-<span class="lineNum">      29 </span><span class="lineNoCov">              0 :         return &quot;APT Error&quot;;</span>
-<span class="lineNum">      30 </span>                :     }
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span><span class="lineNoCov">              0 :     AptException( const std::string &amp;ctx ) : Generic( ctx ) {</span>
-<span class="lineNum">      33 </span><span class="lineNoCov">              0 :         while ( !_error-&gt;empty() ) {</span>
-<span class="lineNum">      34 </span><span class="lineNoCov">              0 :             std::string err;</span>
-<span class="lineNum">      35 </span><span class="lineNoCov">              0 :             _error-&gt;PopMessage( err );</span>
-<span class="lineNum">      36 </span><span class="lineNoCov">              0 :             std::cerr &lt;&lt; err &lt;&lt; std::endl;</span>
-<span class="lineNum">      37 </span><span class="lineNoCov">              0 :             addContext( err );</span>
-<span class="lineNum">      38 </span>                :         }
-<span class="lineNum">      39 </span><span class="lineNoCov">              0 :     }</span>
-<span class="lineNum">      40 </span>                : };
-<span class="lineNum">      41 </span>                : 
-<span class="lineNum">      42 </span>                : struct PackageState {
-<span class="lineNum">      43 </span>                :     enum Query {
-<span class="lineNum">      44 </span>                :         Install = 1 &lt;&lt; 0,
-<span class="lineNum">      45 </span>                :         Upgrade = 1 &lt;&lt; 1,
-<span class="lineNum">      46 </span>                :         Keep = 1 &lt;&lt; 2,
-<span class="lineNum">      47 </span>                :         Remove = 1 &lt;&lt; 3,
-<span class="lineNum">      48 </span>                :         Installed = 1 &lt;&lt; 4,
-<span class="lineNum">      49 </span>                :         Upgradable = 1 &lt;&lt; 5,
-<span class="lineNum">      50 </span>                :         NowBroken = 1 &lt;&lt; 6,
-<span class="lineNum">      51 </span>                :         WillBreak = 1 &lt;&lt; 7,
-<span class="lineNum">      52 </span>                :         ReInstall = 1 &lt;&lt; 8,
-<span class="lineNum">      53 </span>                :         Purge = 1 &lt;&lt; 9,
-<span class="lineNum">      54 </span>                :         Hold = 1 &lt;&lt; 10,
-<span class="lineNum">      55 </span>                :         Valid = 1 &lt;&lt; 11
-<span class="lineNum">      56 </span>                :     };
-<span class="lineNum">      57 </span>                : 
-<span class="lineNum">      58 </span>                :     typedef unsigned state;
-<span class="lineNum">      59 </span>                :     
-<span class="lineNum">      60 </span><span class="lineCov">           3786 :     operator unsigned() { return m_state; };</span>
-<span class="lineNum">      61 </span>                :     
-<span class="lineNum">      62 </span>                :     PackageState &amp;operator=( unsigned i ) {
-<span class="lineNum">      63 </span>                :         m_state = i;
-<span class="lineNum">      64 </span>                :         return *this;
-<span class="lineNum">      65 </span>                :     }
-<span class="lineNum">      66 </span>                :     
-<span class="lineNum">      67 </span><span class="lineCov">           5218 :     PackageState &amp;operator|=( const PackageState &amp;s ) {</span>
-<span class="lineNum">      68 </span><span class="lineCov">           5218 :         m_state |= s.m_state;</span>
-<span class="lineNum">      69 </span><span class="lineCov">           5218 :         return *this;</span>
-<span class="lineNum">      70 </span>                :     }
-<span class="lineNum">      71 </span>                :     
-<span class="lineNum">      72 </span><span class="lineCov">           9003 :     PackageState( unsigned a ) {</span>
-<span class="lineNum">      73 </span><span class="lineCov">           9003 :         m_state = a;</span>
-<span class="lineNum">      74 </span><span class="lineCov">           9003 :     }</span>
-<span class="lineNum">      75 </span>                :     
-<span class="lineNum">      76 </span><span class="lineCov">              1 :     PackageState() : m_state( 0 ) {}</span>
-<span class="lineNum">      77 </span>                : 
-<span class="lineNum">      78 </span>                :     // FIXME this probably needs to be used consistently in core and out of core
-<span class="lineNum">      79 </span><span class="lineCov">              2 :     bool isValid() const { return m_state &amp; Valid; }</span>
-<span class="lineNum">      80 </span>                :     // FIXME compatibility API for non-core apt
-<span class="lineNum">      81 </span><span class="lineCov">              1 :     bool isInstalled() const { return installed(); }</span>
-<span class="lineNum">      82 </span>                : 
-<span class="lineNum">      83 </span><span class="lineCov">              2 :     bool install() const { return m_state &amp; Install; }</span>
-<span class="lineNum">      84 </span>                :     // reinstall() implies install()
-<span class="lineNum">      85 </span>                :     bool reinstall() const { return m_state &amp; ReInstall; }
-<span class="lineNum">      86 </span>                :     bool remove() const { return m_state &amp; Remove; }
-<span class="lineNum">      87 </span>                :     // purge() implies remove()
-<span class="lineNum">      88 </span><span class="lineCov">           3775 :     bool purge() const { return m_state &amp; Purge; }</span>
-<span class="lineNum">      89 </span><span class="lineCov">           3780 :     bool keep() const { return m_state &amp; Keep; }</span>
-<span class="lineNum">      90 </span>                :     bool willBreak() const { return m_state &amp; WillBreak; }
-<span class="lineNum">      91 </span>                :     // upgrade() implies install()
-<span class="lineNum">      92 </span>                :     bool upgrade() const { return hasNewVersion() &amp;&amp; install(); }
-<span class="lineNum">      93 </span>                :     // newInsstal() implies install()
-<span class="lineNum">      94 </span>                :     bool newInstall() const { return !installed() &amp;&amp; install(); }
-<span class="lineNum">      95 </span>                :     bool hold() const { return m_state &amp; Hold; }
-<span class="lineNum">      96 </span>                : 
-<span class="lineNum">      97 </span><span class="lineCov">              1 :     bool installed() const { return m_state &amp; Installed; }</span>
-<span class="lineNum">      98 </span>                :     bool hasNewVersion() const { return m_state &amp; Upgradable; }
-<span class="lineNum">      99 </span>                :     bool upgradable() const { return hasNewVersion() &amp;&amp; !hold(); }
-<span class="lineNum">     100 </span>                :     bool held() const { return hasNewVersion() &amp;&amp; hold(); }
-<span class="lineNum">     101 </span>                :     bool nowBroken() const { return m_state &amp; NowBroken; }
-<span class="lineNum">     102 </span>                : 
-<span class="lineNum">     103 </span>                :     bool modify() const { return install() || remove(); }
-<span class="lineNum">     104 </span>                :     
-<span class="lineNum">     105 </span>                : protected:
-<span class="lineNum">     106 </span>                :     unsigned m_state;
-<span class="lineNum">     107 </span>                : };
-<span class="lineNum">     108 </span>                : 
-<span class="lineNum">     109 </span>                : time_t aptTimestamp();
-<span class="lineNum">     110 </span>                : 
-<span class="lineNum">     111 </span>                : // wrap the apt's database
-<span class="lineNum">     112 </span>                : struct AptDatabase {
-<span class="lineNum">     113 </span><span class="lineCov">           5093 :     pkgCache &amp;cache() {</span>
-<span class="lineNum">     114 </span><span class="lineCov">           5093 :         if ( !m_cache )</span>
-<span class="lineNum">     115 </span><span class="lineCov">             20 :             openCache();</span>
-<span class="lineNum">     116 </span><span class="lineCov">           5093 :         return *m_cache;</span>
-<span class="lineNum">     117 </span>                :     }
-<span class="lineNum">     118 </span>                : 
-<span class="lineNum">     119 </span><span class="lineCov">           3793 :     pkgDepCache &amp;state() {</span>
-<span class="lineNum">     120 </span><span class="lineCov">           3793 :         if ( !m_state )</span>
-<span class="lineNum">     121 </span><span class="lineCov">              5 :             openState();</span>
-<span class="lineNum">     122 </span><span class="lineCov">           3793 :         return *m_state;</span>
-<span class="lineNum">     123 </span>                :     }
-<span class="lineNum">     124 </span>                : 
-<span class="lineNum">     125 </span><span class="lineCov">           1436 :     pkgPolicy &amp;policy() {</span>
-<span class="lineNum">     126 </span><span class="lineCov">           1436 :         if ( !m_policy )</span>
-<span class="lineNum">     127 </span><span class="lineNoCov">              0 :             openCache();</span>
-<span class="lineNum">     128 </span><span class="lineCov">           1436 :         return *m_policy;</span>
-<span class="lineNum">     129 </span>                :     }
-<span class="lineNum">     130 </span>                : 
-<span class="lineNum">     131 </span>                :     OpProgress *m_progress;
-<span class="lineNum">     132 </span>                :     bool m_tryWriteable;
-<span class="lineNum">     133 </span>                :     bool m_writeable;
-<span class="lineNum">     134 </span>                : 
-<span class="lineNum">     135 </span>                :     time_t timestamp() {
-<span class="lineNum">     136 </span>                :         return aptTimestamp();
-<span class="lineNum">     137 </span>                :     }
-<span class="lineNum">     138 </span>                : 
-<span class="lineNum">     139 </span><span class="lineCov">             73 :     AptDatabase() {</span>
-<span class="lineNum">     140 </span><span class="lineCov">             73 :         m_cache = 0;</span>
-<span class="lineNum">     141 </span><span class="lineCov">             73 :         m_state = 0;</span>
-<span class="lineNum">     142 </span><span class="lineCov">             73 :         m_policy = 0;</span>
-<span class="lineNum">     143 </span><span class="lineCov">             73 :         m_progress = new OpProgress();</span>
-<span class="lineNum">     144 </span><span class="lineCov">             73 :         m_tryWriteable = true;</span>
-<span class="lineNum">     145 </span><span class="lineCov">             73 :         m_writeable = false;</span>
-<span class="lineNum">     146 </span><span class="lineCov">             73 :     }</span>
-<span class="lineNum">     147 </span>                : 
-<span class="lineNum">     148 </span>                :     void setProgress( OpProgress *p ) {
-<span class="lineNum">     149 </span>                :         m_progress = p;
-<span class="lineNum">     150 </span>                :     }
-<span class="lineNum">     151 </span>                : 
-<span class="lineNum">     152 </span>                :     bool writeable() {
-<span class="lineNum">     153 </span>                :         if ( !m_cache )
-<span class="lineNum">     154 </span>                :             openCache();
-<span class="lineNum">     155 </span>                :         return m_writeable;
-<span class="lineNum">     156 </span>                :     }
-<span class="lineNum">     157 </span>                : 
-<span class="lineNum">     158 </span><span class="lineCov">              5 :     void openState() {</span>
-<span class="lineNum">     159 </span><span class="lineCov">              5 :         m_state = new pkgDepCache( &amp;cache(), m_policy );</span>
-<span class="lineNum">     160 </span><span class="lineCov">              5 :         m_state-&gt;Init( m_progress );</span>
-<span class="lineNum">     161 </span><span class="lineCov">              5 :         m_progress-&gt;Done();</span>
-<span class="lineNum">     162 </span><span class="lineCov">              5 :     }</span>
-<span class="lineNum">     163 </span>                : 
-<span class="lineNum">     164 </span><span class="lineCov">             20 :     void openCache() {</span>
-<span class="lineNum">     165 </span><span class="lineCov">             20 :         if ( !_config-&gt;FindB(&quot;Initialized&quot;) ) {</span>
-<span class="lineNum">     166 </span><span class="lineNoCov">              0 :             pkgInitConfig(*_config);</span>
-<span class="lineNum">     167 </span><span class="lineNoCov">              0 :             _config-&gt;Set(&quot;Initialized&quot;, 1);</span>
-<span class="lineNum">     168 </span><span class="lineNoCov">              0 :             pkgInitSystem(*_config, _system);</span>
-<span class="lineNum">     169 </span>                :         }
-<span class="lineNum">     170 </span>                : 
-<span class="lineNum">     171 </span><span class="lineCov">             20 :         m_writeable = m_tryWriteable;</span>
-<span class="lineNum">     172 </span>                : 
-<span class="lineNum">     173 </span><span class="lineCov">             20 :         if ( m_tryWriteable ) {</span>
-<span class="lineNum">     174 </span>                :             try {
-<span class="lineNum">     175 </span><span class="lineCov">             20 :                 _system-&gt;Lock();</span>
-<span class="lineNum">     176 </span><span class="lineNoCov">              0 :             } catch ( std::exception e ) {</span>
-<span class="lineNum">     177 </span><span class="lineNoCov">              0 :                 m_tryWriteable = false;</span>
-<span class="lineNum">     178 </span><span class="lineNoCov">              0 :                 openCache();</span>
-<span class="lineNum">     179 </span><span class="lineNoCov">              0 :                 m_tryWriteable = true;</span>
-<span class="lineNum">     180 </span><span class="lineNoCov">              0 :                 throw;</span>
-<span class="lineNum">     181 </span>                :             }
-<span class="lineNum">     182 </span>                :         }
-<span class="lineNum">     183 </span>                : 
-<span class="lineNum">     184 </span><span class="lineCov">             20 :         pkgSourceList list;</span>
-<span class="lineNum">     185 </span><span class="lineCov">             20 :         if ( list.ReadMainList() == false ) {</span>
-<span class="lineNum">     186 </span><span class="lineNoCov">              0 :             _error-&gt;DumpErrors();</span>
-<span class="lineNum">     187 </span>                :             throw wibble::exception::System(
-<span class="lineNum">     188 </span><span class="lineNoCov">              0 :                 &quot;The list of sources could not be read.&quot; );</span>
-<span class="lineNum">     189 </span>                :         }
-<span class="lineNum">     190 </span>                : 
-<span class="lineNum">     191 </span><span class="lineCov">             20 :         MMap *m = 0;</span>
-<span class="lineNum">     192 </span><span class="lineCov">             20 :         bool Res = pkgMakeStatusCache( list, *m_progress, &amp;m, !m_writeable );</span>
-<span class="lineNum">     193 </span>                : 
-<span class="lineNum">     194 </span><span class="lineCov">             20 :         if ( !Res ) {</span>
-<span class="lineNum">     195 </span>                :             std::cerr &lt;&lt; &quot;The package lists or status file &quot;
-<span class="lineNum">     196 </span><span class="lineNoCov">              0 :                 &quot;could not be parsed or opened.&quot; &lt;&lt; std::endl;</span>
-<span class="lineNum">     197 </span>                :             throw AptException(
-<span class="lineNum">     198 </span>                :                 &quot;The package lists or status file &quot;
-<span class="lineNum">     199 </span><span class="lineNoCov">              0 :                 &quot;could not be parsed or opened.&quot; );</span>
-<span class="lineNum">     200 </span>                :         }
-<span class="lineNum">     201 </span>                : 
-<span class="lineNum">     202 </span><span class="lineCov">             20 :         m_cache = new pkgCache( m, true );</span>
-<span class="lineNum">     203 </span><span class="lineCov">             40 :         m_policy = new pkgPolicy( m_cache );</span>
-<span class="lineNum">     204 </span><span class="lineCov">             40 :         if ( ReadPinFile( *m_policy )  == false )</span>
-<span class="lineNum">     205 </span><span class="lineNoCov">              0 :             throw wibble::exception::System( &quot;error reading pin file&quot; );</span>
-<span class="lineNum">     206 </span><span class="lineCov">             20 :         m_progress-&gt;Done();</span>
-<span class="lineNum">     207 </span><span class="lineCov">             20 :     }</span>
-<span class="lineNum">     208 </span>                : 
-<span class="lineNum">     209 </span><span class="lineCov">             74 :     void invalidate() {</span>
-<span class="lineNum">     210 </span><span class="lineCov">             74 :         if ( _config-&gt;FindB(&quot;Initialized&quot;) ) {</span>
-<span class="lineNum">     211 </span><span class="lineCov">             74 :             _system-&gt;UnLock();</span>
-<span class="lineNum">     212 </span>                :         }
-<span class="lineNum">     213 </span>                : 
-<span class="lineNum">     214 </span><span class="lineCov">             74 :         delete m_state;</span>
-<span class="lineNum">     215 </span><span class="lineCov">             74 :         m_state = 0;</span>
-<span class="lineNum">     216 </span><span class="lineCov">             74 :         delete m_policy;</span>
-<span class="lineNum">     217 </span><span class="lineCov">             74 :         m_policy = 0;</span>
-<span class="lineNum">     218 </span><span class="lineCov">             74 :         delete m_cache;</span>
-<span class="lineNum">     219 </span><span class="lineCov">             74 :         m_cache = 0;</span>
-<span class="lineNum">     220 </span><span class="lineCov">             74 :     }</span>
-<span class="lineNum">     221 </span>                : 
-<span class="lineNum">     222 </span>                :     pkgCache::VerIterator anyVersion( pkgCache::PkgIterator pi ) {
-<span class="lineNum">     223 </span>                :         if ( pi.end() ) return pkgCache::VerIterator();
-<span class="lineNum">     224 </span>                :         return pi.VersionList();
-<span class="lineNum">     225 </span>                :     }
-<span class="lineNum">     226 </span>                : 
-<span class="lineNum">     227 </span><span class="lineCov">              5 :     Token candidateVersion( Token p ) {</span>
-<span class="lineNum">     228 </span><span class="lineCov">              5 :         pkgCache::PkgIterator pi = cache().FindPkg( p.package() );</span>
-<span class="lineNum">     229 </span><span class="lineCov">              6 :         if ( pi.end() ) return Token();</span>
-<span class="lineNum">     230 </span><span class="lineCov">              4 :         pkgCache::VerIterator vi = policy().GetCandidateVer( pi );</span>
-<span class="lineNum">     231 </span><span class="lineCov">              4 :         if ( vi.end() ) return Token();</span>
-<span class="lineNum">     232 </span>                : 
-<span class="lineNum">     233 </span><span class="lineCov">              4 :         Token t; t._id = p.package() + &quot;_&quot; + vi.VerStr();</span>
-<span class="lineNum">     234 </span><span class="lineCov">              4 :         return t;</span>
-<span class="lineNum">     235 </span>                :     }
-<span class="lineNum">     236 </span>                : 
-<span class="lineNum">     237 </span><span class="lineCov">           1432 :     pkgCache::VerIterator candidateVersion( pkgCache::PkgIterator pi ) {</span>
-<span class="lineNum">     238 </span><span class="lineCov">           1432 :         if ( pi.end() ) return pkgCache::VerIterator();</span>
-<span class="lineNum">     239 </span><span class="lineCov">           1432 :         pkgCache::VerIterator vi = policy().GetCandidateVer( pi );</span>
-<span class="lineNum">     240 </span><span class="lineCov">           1432 :         if ( vi.end() ) return pkgCache::VerIterator();</span>
-<span class="lineNum">     241 </span><span class="lineCov">           1432 :         return vi;</span>
-<span class="lineNum">     242 </span>                :     }
-<span class="lineNum">     243 </span>                : 
-<span class="lineNum">     244 </span><span class="lineCov">           1432 :     pkgCache::VerIterator installedVersion( pkgCache::PkgIterator pi ) {</span>
-<span class="lineNum">     245 </span><span class="lineCov">           1432 :         if ( pi.end() ) return pkgCache::VerIterator();</span>
-<span class="lineNum">     246 </span>                :         pkgCache::VerIterator vi = pkgCache::VerIterator( cache(),
-<span class="lineNum">     247 </span><span class="lineCov">           1432 :                                                           cache().VerP + pi-&gt;CurrentVer );</span>
-<span class="lineNum">     248 </span><span class="lineCov">           1432 :         if ( vi.end() ) return pkgCache::VerIterator();</span>
-<span class="lineNum">     249 </span><span class="lineCov">           1432 :         return vi;</span>
-<span class="lineNum">     250 </span>                :     }
-<span class="lineNum">     251 </span>                : 
-<span class="lineNum">     252 </span><span class="lineCov">             27 :     pkgCache::PkgIterator lookupPackage( Token t ) {</span>
-<span class="lineNum">     253 </span><span class="lineCov">             27 :         return cache().FindPkg( t.package() );</span>
-<span class="lineNum">     254 </span>                :     }
-<span class="lineNum">     255 </span>                : 
-<span class="lineNum">     256 </span><span class="lineCov">              5 :     pkgCache::VerIterator lookupVersion( Token t ) {</span>
-<span class="lineNum">     257 </span><span class="lineCov">              5 :         if ( !t.hasVersion() )</span>
-<span class="lineNum">     258 </span><span class="lineCov">              5 :             t = candidateVersion( t );</span>
-<span class="lineNum">     259 </span><span class="lineCov">              5 :         pkgCache::PkgIterator pi = lookupPackage( t );</span>
-<span class="lineNum">     260 </span><span class="lineCov">              5 :         if ( pi.end() )</span>
-<span class="lineNum">     261 </span><span class="lineCov">              1 :             return pkgCache::VerIterator();</span>
-<span class="lineNum">     262 </span><span class="lineCov">              4 :         for (pkgCache::VerIterator vi = pi.VersionList(); !vi.end(); ++vi)</span>
-<span class="lineNum">     263 </span><span class="lineCov">              4 :             if ( t.version() == vi.VerStr() )</span>
-<span class="lineNum">     264 </span><span class="lineCov">              4 :                 return vi;</span>
-<span class="lineNum">     265 </span><span class="lineNoCov">              0 :         return pkgCache::VerIterator();</span>
-<span class="lineNum">     266 </span>                :     }
-<span class="lineNum">     267 </span>                : 
-<span class="lineNum">     268 </span>                :     static pkgCache::VerFileIterator lookupVersionFile(
-<span class="lineNum">     269 </span><span class="lineCov">              5 :         pkgCache::VerIterator vi )</span>
-<span class="lineNum">     270 </span>                :     {
-<span class="lineNum">     271 </span><span class="lineCov">              5 :         if ( vi.end() )</span>
-<span class="lineNum">     272 </span><span class="lineCov">              1 :             return pkgCache::VerFileIterator();</span>
-<span class="lineNum">     273 </span><span class="lineCov">              4 :         pkgCache::VerFileIterator vfi = vi.FileList();</span>
-<span class="lineNum">     274 </span><span class="lineCov">              4 :         for ( ; !vfi.end(); vfi++ )</span>
-<span class="lineNum">     275 </span><span class="lineCov">              4 :             if ( ( vfi.File()-&gt;Flags &amp; pkgCache::Flag::NotSource ) == 0)</span>
-<span class="lineNum">     276 </span><span class="lineCov">              4 :                 break;</span>
-<span class="lineNum">     277 </span><span class="lineCov">              4 :         if ( vfi.end() )</span>
-<span class="lineNum">     278 </span><span class="lineNoCov">              0 :             vfi = vi.FileList();</span>
-<span class="lineNum">     279 </span><span class="lineCov">              4 :         return vfi;</span>
-<span class="lineNum">     280 </span>                :     }
-<span class="lineNum">     281 </span>                : 
-<span class="lineNum">     282 </span><span class="lineNoCov">              0 :     PackageState invalidState() {</span>
-<span class="lineNum">     283 </span><span class="lineNoCov">              0 :         return PackageState( PackageState::NowBroken | PackageState::Keep );</span>
-<span class="lineNum">     284 </span>                :     }
-<span class="lineNum">     285 </span>                : 
-<span class="lineNum">     286 </span><span class="lineCov">           3784 :     PackageState packageState( pkgCache::PkgIterator P )</span>
-<span class="lineNum">     287 </span>                :     {
-<span class="lineNum">     288 </span><span class="lineCov">           3784 :         PackageState s = 0;</span>
-<span class="lineNum">     289 </span><span class="lineCov">           3784 :         if ( P.end() )</span>
-<span class="lineNum">     290 </span><span class="lineNoCov">              0 :             return invalidState();</span>
-<span class="lineNum">     291 </span><span class="lineCov">           3784 :         if ( ! ( P-&gt;CurrentState == pkgCache::State::ConfigFiles</span>
-<span class="lineNum">     292 </span>                :                  || P-&gt;CurrentState == pkgCache::State::NotInstalled ) )
-<span class="lineNum">     293 </span><span class="lineCov">           1432 :             s |= PackageState::Installed;</span>
-<span class="lineNum">     294 </span><span class="lineCov">           3784 :         if ( s &amp; PackageState::Installed &amp;&amp;</span>
-<span class="lineNum">     295 </span>                :              candidateVersion( P ) != installedVersion( P ) )
-<span class="lineNum">     296 </span><span class="lineCov">              1 :             s |= PackageState::Upgradable;</span>
-<span class="lineNum">     297 </span><span class="lineCov">           3784 :         pkgDepCache::StateCache S = state()[ P ];</span>
-<span class="lineNum">     298 </span><span class="lineCov">           3784 :         if ( S.Install() )</span>
-<span class="lineNum">     299 </span><span class="lineCov">              3 :             s |= PackageState::Install;</span>
-<span class="lineNum">     300 </span><span class="lineCov">           3784 :         if ( ( S.iFlags &amp; pkgDepCache::ReInstall )</span>
-<span class="lineNum">     301 </span>                :              == pkgDepCache::ReInstall )
-<span class="lineNum">     302 </span><span class="lineNoCov">              0 :             s |= PackageState::ReInstall;</span>
-<span class="lineNum">     303 </span><span class="lineCov">           3784 :         if ( S.Keep() )</span>
-<span class="lineNum">     304 </span><span class="lineCov">           3780 :             s |= PackageState::Keep;</span>
-<span class="lineNum">     305 </span><span class="lineCov">           3784 :         if ( S.Delete() )</span>
-<span class="lineNum">     306 </span><span class="lineCov">              1 :             s |= PackageState::Remove;</span>
-<span class="lineNum">     307 </span><span class="lineCov">           3784 :         if ( ( S.iFlags &amp; pkgDepCache::Purge ) == pkgDepCache::Purge )</span>
-<span class="lineNum">     308 </span><span class="lineNoCov">              0 :             s |= PackageState::Purge;</span>
-<span class="lineNum">     309 </span><span class="lineCov">           3784 :         if ( S.NowBroken() )</span>
-<span class="lineNum">     310 </span><span class="lineCov">              1 :             s |= PackageState::NowBroken;</span>
-<span class="lineNum">     311 </span><span class="lineCov">           3784 :         if ( S.InstBroken() )</span>
-<span class="lineNum">     312 </span><span class="lineNoCov">              0 :             s |= PackageState::WillBreak;</span>
-<span class="lineNum">     313 </span><span class="lineCov">           3784 :         if ( P-&gt;SelectedState == pkgCache::State::Hold )</span>
-<span class="lineNum">     314 </span><span class="lineNoCov">              0 :             s |= PackageState::Hold;</span>
-<span class="lineNum">     315 </span><span class="lineCov">           3784 :         return s;</span>
-<span class="lineNum">     316 </span>                :     }
-<span class="lineNum">     317 </span>                : 
-<span class="lineNum">     318 </span><span class="lineCov">              1 :     PackageState packageState( Token t ) {</span>
-<span class="lineNum">     319 </span><span class="lineCov">              1 :         t = validate( t );</span>
-<span class="lineNum">     320 </span><span class="lineCov">              1 :         if ( t.valid() )</span>
-<span class="lineNum">     321 </span><span class="lineCov">              1 :             return packageState( lookupPackage( t ) );</span>
-<span class="lineNum">     322 </span><span class="lineNoCov">              0 :         return invalidState();</span>
-<span class="lineNum">     323 </span>                :     }
-<span class="lineNum">     324 </span>                : 
-<span class="lineNum">     325 </span><span class="lineCov">              4 :     Token validate( Token t ) {</span>
-<span class="lineNum">     326 </span><span class="lineCov">              4 :         if ( t.hasVersion() )</span>
-<span class="lineNum">     327 </span><span class="lineNoCov">              0 :             return lookupVersion( t ).end() ? Token() : t;</span>
-<span class="lineNum">     328 </span><span class="lineCov">              4 :         return lookupPackage( t ).end() ? Token() : t;</span>
-<span class="lineNum">     329 </span>                :     }
-<span class="lineNum">     330 </span>                : 
-<span class="lineNum">     331 </span><span class="lineCov">             73 :     ~AptDatabase() {</span>
-<span class="lineNum">     332 </span><span class="lineCov">             73 :         invalidate();</span>
-<span class="lineNum">     333 </span><span class="lineCov">             73 :     }</span>
-<span class="lineNum">     334 </span>                : 
-<span class="lineNum">     335 </span>                : protected:
-<span class="lineNum">     336 </span>                :     pkgCache *m_cache;
-<span class="lineNum">     337 </span>                :     pkgDepCache *m_state;
-<span class="lineNum">     338 </span>                :     pkgPolicy *m_policy;
-<span class="lineNum">     339 </span>                : };
-<span class="lineNum">     340 </span>                : 
-<span class="lineNum">     341 </span>                : template&lt; typename Internal &gt;
-<span class="lineNum">     342 </span>                : struct AptInternalList {
-<span class="lineNum">     343 </span>                :     Internal m_head;
-<span class="lineNum">     344 </span>                :     typedef Internal Type;
-<span class="lineNum">     345 </span><span class="lineCov">          11331 :     AptInternalList tail() const {</span>
-<span class="lineNum">     346 </span><span class="lineCov">          11331 :         AptInternalList t = *this;</span>
-<span class="lineNum">     347 </span><span class="lineCov">          11331 :         t.m_head++;</span>
-<span class="lineNum">     348 </span>                :         return t;
-<span class="lineNum">     349 </span>                :     }
-<span class="lineNum">     350 </span><span class="lineCov">           7554 :     const Internal &amp;head() const { return m_head; }</span>
-<span class="lineNum">     351 </span><span class="lineCov">           3781 :     Internal &amp;head() { return m_head; }</span>
-<span class="lineNum">     352 </span><span class="lineCov">          11334 :     bool empty() const { return m_head.end(); }</span>
-<span class="lineNum">     353 </span><span class="lineCov">              3 :     AptInternalList( Internal head ) : m_head( head ) {}</span>
-<span class="lineNum">     354 </span>                :     AptInternalList() {}
-<span class="lineNum">     355 </span>                : };
-<span class="lineNum">     356 </span>                : 
-<span class="lineNum">     357 </span>                : namespace version {
-<span class="lineNum">     358 </span>                : 
-<span class="lineNum">     359 </span>                : typedef enum { Package, VersionString, Section, Architecture,
-<span class="lineNum">     360 </span>                :                Depends, Recommends, Record } PropertyId;
-<span class="lineNum">     361 </span>                : 
-<span class="lineNum">     362 </span>                : typedef pkgCache::VerIterator Internal;
-<span class="lineNum">     363 </span>                : template&lt; PropertyId &gt; struct PropertyType {};
-<span class="lineNum">     364 </span>                : 
-<span class="lineNum">     365 </span>                : }
-<span class="lineNum">     366 </span>                : 
-<span class="lineNum">     367 </span>                : namespace package {
-<span class="lineNum">     368 </span>                : 
-<span class="lineNum">     369 </span>                : typedef enum { Name, Versions, AnyVersion, State, CandidateVersion,
-<span class="lineNum">     370 </span>                :                InstalledVersion } PropertyId;
-<span class="lineNum">     371 </span>                : typedef pkgCache::PkgIterator Internal;
-<span class="lineNum">     372 </span>                : template&lt; PropertyId &gt; struct PropertyType {};
-<span class="lineNum">     373 </span>                : 
-<span class="lineNum">     374 </span>                : struct VersionList {
-<span class="lineNum">     375 </span>                :     version::Internal m_head;
-<span class="lineNum">     376 </span>                :     VersionList tail() const;
-<span class="lineNum">     377 </span>                :     const version::Internal &amp;head() const { return m_head; }
-<span class="lineNum">     378 </span>                :     version::Internal &amp;head() { return m_head; }
-<span class="lineNum">     379 </span>                : };
-<span class="lineNum">     380 </span>                : 
-<span class="lineNum">     381 </span>                : typedef AptInternalList&lt; Internal &gt; InternalList;
-<span class="lineNum">     382 </span>                : 
-<span class="lineNum">     383 </span>                : }
-<span class="lineNum">     384 </span>                : 
-<span class="lineNum">     385 </span>                : namespace record {
-<span class="lineNum">     386 </span>                : 
-<span class="lineNum">     387 </span>                : typedef enum { Record, Name, Priority, Section, InstalledSize, Maintainer,
-<span class="lineNum">     388 </span>                :                Architecture, SourcePackage, Version, Description,
-<span class="lineNum">     389 </span>                :                ShortDescription, LongDescription, PackageSize } PropertyId;
-<span class="lineNum">     390 </span>                : 
-<span class="lineNum">     391 </span>                : extern const char *fields[];
-<span class="lineNum">     392 </span>                : 
-<span class="lineNum">     393 </span>                : typedef pkgCache::VerFileIterator Internal;
-<span class="lineNum">     394 </span>                : 
-<span class="lineNum">     395 </span>                : template&lt; PropertyId &gt; struct PropertyType {
-<span class="lineNum">     396 </span>                :     typedef std::string T;
-<span class="lineNum">     397 </span>                : };
-<span class="lineNum">     398 </span>                : 
-<span class="lineNum">     399 </span>                : }
-<span class="lineNum">     400 </span>                : }
-<span class="lineNum">     401 </span>                : }
-<span class="lineNum">     402 </span>                : 
-<span class="lineNum">     403 </span>                : #include &lt;ept/core/apt/package.h&gt;
-<span class="lineNum">     404 </span>                : #include &lt;ept/core/apt/version.h&gt;
-<span class="lineNum">     405 </span>                : #include &lt;ept/core/apt/record.h&gt;
-<span class="lineNum">     406 </span>                : 
-<span class="lineNum">     407 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/core/apt.test.h.gcov.html b/rep/ept/core/apt.test.h.gcov.html
deleted file mode 100644
index 8586911..0000000
--- a/rep/ept/core/apt.test.h.gcov.html
+++ /dev/null
@@ -1,162 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/core/apt.test.h</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/core</a> - apt.test.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">60</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">60</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- C++ -*-
-<span class="lineNum">       2 </span>                : #include &lt;ept/config.h&gt;
-<span class="lineNum">       3 </span>                : #include &lt;ept/core/apt.h&gt;
-<span class="lineNum">       4 </span>                : #include &lt;ept/core/list.h&gt;
-<span class="lineNum">       5 </span>                : #include &lt;ept/test.h&gt;
-<span class="lineNum">       6 </span>                : 
-<span class="lineNum">       7 </span>                : using namespace ept::core;
-<span class="lineNum">       8 </span>                : 
-<span class="lineNum">       9 </span>                : struct TestCoreApt : AptTestEnvironment
-<span class="lineNum">      10 </span><span class="lineCov">             12 : {</span>
-<span class="lineNum">      11 </span>                :     package::Source pkgs;
-<span class="lineNum">      12 </span>                :     version::Source vers;
-<span class="lineNum">      13 </span>                :     ept::Token t;
-<span class="lineNum">      14 </span>                : 
-<span class="lineNum">      15 </span><span class="lineCov">             12 :     TestCoreApt() : pkgs( db ), vers( db ) {</span>
-<span class="lineNum">      16 </span><span class="lineCov">             12 :         t._id = &quot;sp&quot;;</span>
-<span class="lineNum">      17 </span><span class="lineCov">             12 :     }</span>
-<span class="lineNum">      18 </span>                : 
-<span class="lineNum">      19 </span><span class="lineCov">              1 :     Test token() {</span>
-<span class="lineNum">      20 </span><span class="lineCov">              1 :         assert_eq( t.package(), &quot;sp&quot; );</span>
-<span class="lineNum">      21 </span><span class="lineCov">              2 :         assert_eq( t.version(), &quot;&quot; );</span>
-<span class="lineNum">      22 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      23 </span>                : 
-<span class="lineNum">      24 </span><span class="lineCov">              1 :     Test tokenVersion() {</span>
-<span class="lineNum">      25 </span><span class="lineCov">              1 :         ept::Token t2;</span>
-<span class="lineNum">      26 </span><span class="lineCov">              1 :         t2._id = &quot;libwibble-dev_0.1.10&quot;;</span>
-<span class="lineNum">      27 </span><span class="lineCov">              1 :         assert_eq( t2.package(), &quot;libwibble-dev&quot; );</span>
-<span class="lineNum">      28 </span><span class="lineCov">              1 :         assert_eq( t2.version(), &quot;0.1.10&quot; );</span>
-<span class="lineNum">      29 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span><span class="lineCov">              1 :     Test packageName() {</span>
-<span class="lineNum">      32 </span><span class="lineCov">              1 :         assert_eq( t.package(), pkgs.get&lt; package::Name &gt;( t ) );</span>
-<span class="lineNum">      33 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      34 </span>                : 
-<span class="lineNum">      35 </span>                :     template&lt; typename List &gt;
-<span class="lineNum">      36 </span><span class="lineCov">              1 :     void checkPackageNameList( List l ) {</span>
-<span class="lineNum">      37 </span><span class="lineCov">           3779 :         while ( !l.empty() ) {</span>
-<span class="lineNum">      38 </span><span class="lineCov">           3777 :             assert_eq( l.token().package(), l.property() );</span>
-<span class="lineNum">      39 </span><span class="lineCov">           3777 :             l = l.tail();</span>
-<span class="lineNum">      40 </span>                :         }
-<span class="lineNum">      41 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      42 </span>                : 
-<span class="lineNum">      43 </span>                :     template&lt; typename List &gt;
-<span class="lineNum">      44 </span><span class="lineCov">              1 :     void checkVersionPackageList( List l ) {</span>
-<span class="lineNum">      45 </span><span class="lineCov">           1810 :         while ( !l.empty() ) {</span>
-<span class="lineNum">      46 </span><span class="lineCov">           1808 :             assert_eq( l.property().package(), l.token().package() );</span>
-<span class="lineNum">      47 </span><span class="lineCov">           3616 :             assert_eq( l.property().version(), &quot;&quot; );</span>
-<span class="lineNum">      48 </span><span class="lineCov">           1808 :             l = l.tail();</span>
-<span class="lineNum">      49 </span>                :         }
-<span class="lineNum">      50 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      51 </span>                : 
-<span class="lineNum">      52 </span><span class="lineCov">              1 :     Test packageCount() {</span>
-<span class="lineNum">      53 </span>                :         assert_eq( list::count( pkgs.list&lt; package::Name &gt;() ),
-<span class="lineNum">      54 </span><span class="lineCov">              1 :                    3777 );</span>
-<span class="lineNum">      55 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span><span class="lineCov">              1 :     Test packageNameList() {</span>
-<span class="lineNum">      58 </span><span class="lineCov">              1 :         checkPackageNameList( pkgs.list&lt; package::Name &gt;() );</span>
-<span class="lineNum">      59 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      60 </span>                : 
-<span class="lineNum">      61 </span><span class="lineCov">              1 :     Test versionCount() {</span>
-<span class="lineNum">      62 </span>                :         assert_eq( list::count( vers.list&lt; version::Package &gt;() ),
-<span class="lineNum">      63 </span><span class="lineCov">              1 :                   1808 );</span>
-<span class="lineNum">      64 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      65 </span>                : 
-<span class="lineNum">      66 </span><span class="lineCov">              1 :     Test versionPackage() {</span>
-<span class="lineNum">      67 </span><span class="lineCov">              1 :         checkVersionPackageList( vers.list&lt; version::Package &gt;() );</span>
-<span class="lineNum">      68 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      69 </span>                : 
-<span class="lineNum">      70 </span><span class="lineCov">              1 :     Test validate() {</span>
-<span class="lineNum">      71 </span><span class="lineCov">              1 :         assert_eq( t, db.validate( t ) );</span>
-<span class="lineNum">      72 </span>                :         assert_neq( ept::Token( &quot;libfoobar&quot; ),
-<span class="lineNum">      73 </span><span class="lineCov">              2 :                     db.validate( ept::Token( &quot;libfooar&quot; ) ) );</span>
-<span class="lineNum">      74 </span><span class="lineCov">              2 :         assert_eq( ept::Token(), db.validate( ept::Token( &quot;libfoobar&quot; ) ) );</span>
-<span class="lineNum">      75 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      76 </span>                : 
-<span class="lineNum">      77 </span><span class="lineCov">              1 :     Test packageState() {</span>
-<span class="lineNum">      78 </span><span class="lineCov">              1 :         assert( db.packageState( t ) &amp; PackageState::Keep );</span>
-<span class="lineNum">      79 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      80 </span>                : 
-<span class="lineNum">      81 </span><span class="lineCov">              1 :     Test packageState2() {</span>
-<span class="lineNum">      82 </span><span class="lineCov">              1 :         assert( pkgs.get&lt; package::State &gt;( t ) &amp; PackageState::Keep );</span>
-<span class="lineNum">      83 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      84 </span>                : 
-<span class="lineNum">      85 </span><span class="lineCov">              1 :     Test exists() {</span>
-<span class="lineNum">      86 </span><span class="lineCov">              1 :         assert( pkgs.exists( t ) );</span>
-<span class="lineNum">      87 </span><span class="lineCov">              2 :         assert( !pkgs.exists( ept::Token( &quot;nonexistent-package&quot; ) ) );</span>
-<span class="lineNum">      88 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      89 </span>                : 
-<span class="lineNum">      90 </span><span class="lineCov">              1 :     Test invalidate() {</span>
-<span class="lineNum">      91 </span><span class="lineCov">              1 :         assert( pkgs.exists( t ) );</span>
-<span class="lineNum">      92 </span><span class="lineCov">              1 :         db.invalidate();</span>
-<span class="lineNum">      93 </span><span class="lineCov">              2 :         assert( pkgs.exists( t ) );</span>
-<span class="lineNum">      94 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      95 </span>                : };
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/core/apt/action.h.gcov.html b/rep/ept/core/apt/action.h.gcov.html
deleted file mode 100644
index 08b2810..0000000
--- a/rep/ept/core/apt/action.h.gcov.html
+++ /dev/null
@@ -1,202 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/core/apt/action.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">ept/core/apt</a> - action.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">48</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">85.4 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">41</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : #include &lt;string&gt;
-<span class="lineNum">       4 </span>                : #include &lt;ept/token.h&gt;
-<span class="lineNum">       5 </span>                : #include &lt;ept/core/apt.h&gt;
-<span class="lineNum">       6 </span>                : #include &lt;apt-pkg/algorithms.h&gt;
-<span class="lineNum">       7 </span>                : 
-<span class="lineNum">       8 </span>                : #ifndef EPT_APT_ACTION_H
-<span class="lineNum">       9 </span>                : #define EPT_APT_ACTION_H
-<span class="lineNum">      10 </span>                : 
-<span class="lineNum">      11 </span>                : namespace ept {
-<span class="lineNum">      12 </span>                : namespace core {
-<span class="lineNum">      13 </span>                : namespace package {
-<span class="lineNum">      14 </span>                : 
-<span class="lineNum">      15 </span><span class="lineCov">             13 : struct Action {</span>
-<span class="lineNum">      16 </span>                :     enum Type { Install, ReInstall, Remove, Keep, Purge, SystemUpgrade };
-<span class="lineNum">      17 </span>                :     Token m_token;
-<span class="lineNum">      18 </span>                :     Type m_type;
-<span class="lineNum">      19 </span>                : 
-<span class="lineNum">      20 </span><span class="lineCov">              4 :     Token token() { return m_token; }</span>
-<span class="lineNum">      21 </span>                :     Type type() { return m_type; }
-<span class="lineNum">      22 </span>                : 
-<span class="lineNum">      23 </span><span class="lineCov">              4 :     void apply( package::Source &amp;pkgs )</span>
-<span class="lineNum">      24 </span>                :     {
-<span class="lineNum">      25 </span><span class="lineCov">              4 :         Type a = m_type;</span>
-<span class="lineNum">      26 </span><span class="lineCov">              4 :         pkgDepCache &amp;dc = pkgs.db().state();</span>
-<span class="lineNum">      27 </span>                : 
-<span class="lineNum">      28 </span><span class="lineCov">              4 :         if ( a == SystemUpgrade ) {</span>
-<span class="lineNum">      29 </span><span class="lineNoCov">              0 :             pkgDistUpgrade( dc );</span>
-<span class="lineNum">      30 </span>                :         } else {
-<span class="lineNum">      31 </span><span class="lineCov">              4 :             if ( !pkgs.exists( m_token ) )</span>
-<span class="lineNum">      32 </span><span class="lineNoCov">              0 :                 return;</span>
-<span class="lineNum">      33 </span><span class="lineCov">              4 :             pkgCache::PkgIterator p = pkgs.lookupToken( m_token );</span>
-<span class="lineNum">      34 </span>                : 
-<span class="lineNum">      35 </span><span class="lineCov">              4 :             pkgProblemResolver fix( &amp;dc );</span>
-<span class="lineNum">      36 </span><span class="lineCov">              8 :             if ( a == Install || a == ReInstall ) {</span>
-<span class="lineNum">      37 </span><span class="lineCov">              2 :                 fix.Clear( p );</span>
-<span class="lineNum">      38 </span><span class="lineCov">              2 :                 fix.Protect( p );</span>
-<span class="lineNum">      39 </span><span class="lineCov">              2 :                 dc.MarkInstall( p, true );</span>
-<span class="lineNum">      40 </span><span class="lineCov">              2 :                 fix.InstallProtect();</span>
-<span class="lineNum">      41 </span><span class="lineCov">              2 :                 if ( a == ReInstall )</span>
-<span class="lineNum">      42 </span><span class="lineNoCov">              0 :                     dc.SetReInstall( p, true );</span>
-<span class="lineNum">      43 </span><span class="lineCov">              2 :             } else if ( a == Remove || a == Purge ) {</span>
-<span class="lineNum">      44 </span><span class="lineNoCov">              0 :                 fix.Clear( p );</span>
-<span class="lineNum">      45 </span><span class="lineNoCov">              0 :                 fix.Protect( p );</span>
-<span class="lineNum">      46 </span><span class="lineNoCov">              0 :                 fix.Remove( p );</span>
-<span class="lineNum">      47 </span><span class="lineNoCov">              0 :                 dc.MarkDelete( p, a == Purge ? true : false );</span>
-<span class="lineNum">      48 </span><span class="lineCov">              2 :             } else if ( a == Keep ) {</span>
-<span class="lineNum">      49 </span><span class="lineCov">              2 :                 fix.Clear( p );</span>
-<span class="lineNum">      50 </span><span class="lineCov">              2 :                 fix.Protect( p );</span>
-<span class="lineNum">      51 </span><span class="lineCov">              2 :                 dc.MarkKeep( p, true );</span>
-<span class="lineNum">      52 </span>                :             }
-<span class="lineNum">      53 </span><span class="lineCov">              4 :             fix.Resolve( true );</span>
-<span class="lineNum">      54 </span>                :         }
-<span class="lineNum">      55 </span>                :     }
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span>                :     bool redundant( package::Source &amp;pkgs ) {
-<span class="lineNum">      58 </span>                :         if ( m_type == SystemUpgrade ) {
-<span class="lineNum">      59 </span>                :             // check whether we have any upgradable packages
-<span class="lineNum">      60 </span>                :             return false;
-<span class="lineNum">      61 </span>                :         }
-<span class="lineNum">      62 </span>                :         if ( !pkgs.exists( m_token ) )
-<span class="lineNum">      63 </span>                :             return true;
-<span class="lineNum">      64 </span>                :         PackageState s = pkgs.db().packageState( m_token );
-<span class="lineNum">      65 </span>                :         Type a = m_type;
-<span class="lineNum">      66 </span>                :         // if ( a == Keep &amp;&amp; !s.upgradable() )
-<span class="lineNum">      67 </span>                :         // return true;
-<span class="lineNum">      68 </span>                :         if ( ( a == Install || a == ReInstall )
-<span class="lineNum">      69 </span>                :              &amp;&amp; ( !s.upgradable() &amp;&amp; s.installed() ) )
-<span class="lineNum">      70 </span>                :             return true;
-<span class="lineNum">      71 </span>                :         if ( ( a == Remove || a == Purge ) &amp;&amp; !s.installed() )
-<span class="lineNum">      72 </span>                :             return true;
-<span class="lineNum">      73 </span>                :         return false;
-<span class="lineNum">      74 </span>                :     }
-<span class="lineNum">      75 </span>                : 
-<span class="lineNum">      76 </span><span class="lineCov">              6 :     Action( Token t, Type a )</span>
-<span class="lineNum">      77 </span><span class="lineCov">              6 :         : m_token( t ), m_type( a )</span>
-<span class="lineNum">      78 </span><span class="lineCov">              6 :     {}</span>
-<span class="lineNum">      79 </span>                : };
-<span class="lineNum">      80 </span>                : 
-<span class="lineNum">      81 </span><span class="lineCov">              2 : struct ActionList {</span>
-<span class="lineNum">      82 </span>                :     typedef std::vector&lt; Action &gt; List;
-<span class="lineNum">      83 </span>                :     List m_list;
-<span class="lineNum">      84 </span>                : 
-<span class="lineNum">      85 </span>                :     void clear() {
-<span class="lineNum">      86 </span>                :         m_list.clear();
-<span class="lineNum">      87 </span>                :     }
-<span class="lineNum">      88 </span>                : 
-<span class="lineNum">      89 </span><span class="lineCov">              1 :     bool empty() {</span>
-<span class="lineNum">      90 </span><span class="lineCov">              1 :         return m_list.empty();</span>
-<span class="lineNum">      91 </span>                :     }
-<span class="lineNum">      92 </span>                : 
-<span class="lineNum">      93 </span><span class="lineCov">              3 :     void add( Action a ) {</span>
-<span class="lineNum">      94 </span><span class="lineCov">              3 :         List::iterator rm = m_list.end(), i;</span>
-<span class="lineNum">      95 </span><span class="lineCov">              3 :         for ( i = m_list.begin(); i != m_list.end(); ++i ) {</span>
-<span class="lineNum">      96 </span><span class="lineCov">              2 :             if ( i-&gt;token() == a.token() ) {</span>
-<span class="lineNum">      97 </span><span class="lineCov">              2 :                 rm = i;</span>
-<span class="lineNum">      98 </span><span class="lineCov">              2 :                 break;</span>
-<span class="lineNum">      99 </span>                :             }
-<span class="lineNum">     100 </span>                :         }
-<span class="lineNum">     101 </span><span class="lineCov">              3 :         if ( rm != m_list.end() )</span>
-<span class="lineNum">     102 </span><span class="lineCov">              2 :             m_list.erase( rm );</span>
-<span class="lineNum">     103 </span>                :         // if ( a.type() != Action::Keep )
-<span class="lineNum">     104 </span><span class="lineCov">              3 :         m_list.push_back( a );</span>
-<span class="lineNum">     105 </span><span class="lineCov">              3 :     }</span>
-<span class="lineNum">     106 </span>                : 
-<span class="lineNum">     107 </span>                :     Action latest() {
-<span class="lineNum">     108 </span>                :         return m_list.back();
-<span class="lineNum">     109 </span>                :     }
-<span class="lineNum">     110 </span>                : 
-<span class="lineNum">     111 </span><span class="lineCov">              1 :     void replay( package::Source &amp;pkgs ) {</span>
-<span class="lineNum">     112 </span><span class="lineCov">              2 :         for ( List::iterator i = m_list.begin(); i != m_list.end(); ++i ) {</span>
-<span class="lineNum">     113 </span><span class="lineCov">              1 :             i-&gt;apply( pkgs );</span>
-<span class="lineNum">     114 </span>                :         }
-<span class="lineNum">     115 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">     116 </span>                : 
-<span class="lineNum">     117 </span>                :     void prune( package::Source &amp;pkgs ) {
-<span class="lineNum">     118 </span>                :         List l;
-<span class="lineNum">     119 </span>                :         std::swap( l, m_list );
-<span class="lineNum">     120 </span>                :         for ( List::iterator i = m_list.begin(); i != m_list.end(); ++i ) {
-<span class="lineNum">     121 </span>                :             if ( !i-&gt;redundant( pkgs ) )
-<span class="lineNum">     122 </span>                :                 m_list.push_back( *i );
-<span class="lineNum">     123 </span>                :         }
-<span class="lineNum">     124 </span>                :         /* We want to do but can't bind reference parameters.... (or
-<span class="lineNum">     125 </span>                :            maybe use remove_copy_if or whatever ... ugly
-<span class="lineNum">     126 </span>                :            std::remove_if( m_list.begin(), m_list.end(), std::bind2nd(
-<span class="lineNum">     127 </span>                :            std::mem_fun_ref( &amp;Action::redundant ), pkgs ) ); */
-<span class="lineNum">     128 </span>                :     }
-<span class="lineNum">     129 </span>                : };
-<span class="lineNum">     130 </span>                : 
-<span class="lineNum">     131 </span>                : }
-<span class="lineNum">     132 </span>                : }
-<span class="lineNum">     133 </span>                : }
-<span class="lineNum">     134 </span>                : 
-<span class="lineNum">     135 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/core/apt/action.test.h.gcov.html b/rep/ept/core/apt/action.test.h.gcov.html
deleted file mode 100644
index 86e5fcc..0000000
--- a/rep/ept/core/apt/action.test.h.gcov.html
+++ /dev/null
@@ -1,108 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/core/apt/action.test.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">ept/core/apt</a> - action.test.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">29</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">29</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- C++ -*-
-<span class="lineNum">       2 </span>                : #include &lt;ept/core/apt/action.h&gt;
-<span class="lineNum">       3 </span>                : #include &lt;ept/test.h&gt;
-<span class="lineNum">       4 </span>                : 
-<span class="lineNum">       5 </span>                : using namespace ept::core;
-<span class="lineNum">       6 </span>                : 
-<span class="lineNum">       7 </span>                : struct TestAptAction : AptTestEnvironment
-<span class="lineNum">       8 </span><span class="lineCov">              3 : {</span>
-<span class="lineNum">       9 </span>                :     package::Source pkgs;
-<span class="lineNum">      10 </span><span class="lineCov">              3 :     TestAptAction() : pkgs( db ) {}</span>
-<span class="lineNum">      11 </span>                : 
-<span class="lineNum">      12 </span><span class="lineCov">              1 :     Test basic() {</span>
-<span class="lineNum">      13 </span><span class="lineCov">              1 :         ept::Token t( &quot;sp&quot; );</span>
-<span class="lineNum">      14 </span><span class="lineCov">              2 :         package::Action a( t, package::Action::Install );</span>
-<span class="lineNum">      15 </span><span class="lineCov">              1 :         a.apply( pkgs );</span>
-<span class="lineNum">      16 </span><span class="lineCov">              1 :         assert( pkgs.get&lt; package::State &gt;( t ).install() );</span>
-<span class="lineNum">      17 </span><span class="lineCov">              1 :         a = package::Action( t, package::Action::Keep );</span>
-<span class="lineNum">      18 </span><span class="lineCov">              1 :         a.apply( pkgs );</span>
-<span class="lineNum">      19 </span><span class="lineCov">              1 :         assert( pkgs.get&lt; package::State &gt;( t ).keep() );</span>
-<span class="lineNum">      20 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span><span class="lineCov">              1 :     Test revert() {</span>
-<span class="lineNum">      23 </span><span class="lineCov">              1 :         ept::Token t( &quot;sp&quot; );</span>
-<span class="lineNum">      24 </span><span class="lineCov">              2 :         package::Action a( t, package::Action::Install );</span>
-<span class="lineNum">      25 </span><span class="lineCov">              1 :         a.apply( pkgs );</span>
-<span class="lineNum">      26 </span><span class="lineCov">              1 :         assert( pkgs.get&lt; package::State &gt;( t ).install() );</span>
-<span class="lineNum">      27 </span><span class="lineCov">              1 :         pkgs.revertStates();</span>
-<span class="lineNum">      28 </span><span class="lineCov">              1 :         assert( pkgs.get&lt; package::State &gt;( t ).keep() );</span>
-<span class="lineNum">      29 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span><span class="lineCov">              1 :     Test keep() {</span>
-<span class="lineNum">      32 </span><span class="lineCov">              1 :         package::ActionList al;</span>
-<span class="lineNum">      33 </span><span class="lineCov">              1 :         ept::Token t( &quot;sp&quot; );</span>
-<span class="lineNum">      34 </span><span class="lineCov">              2 :         al.add( package::Action( t, package::Action::Install ) );</span>
-<span class="lineNum">      35 </span><span class="lineCov">              1 :         assert( !al.empty() );</span>
-<span class="lineNum">      36 </span><span class="lineCov">              2 :         al.add( package::Action( t, package::Action::Remove ) );</span>
-<span class="lineNum">      37 </span><span class="lineCov">              1 :         al.add( package::Action( t, package::Action::Keep ) );</span>
-<span class="lineNum">      38 </span><span class="lineCov">              1 :         al.replay( pkgs );</span>
-<span class="lineNum">      39 </span><span class="lineCov">              1 :         assert( pkgs.get&lt; package::State &gt;( t ).keep() );</span>
-<span class="lineNum">      40 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      41 </span>                : };
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/core/apt/index.html b/rep/ept/core/apt/index.html
deleted file mode 100644
index ebae680..0000000
--- a/rep/ept/core/apt/index.html
+++ /dev/null
@@ -1,155 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/core/apt</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - ept/core/apt</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">334</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">91.9 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">307</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <center>
-  <table width="80%" cellpadding=2 cellspacing=1 border=0>
-
-    <tr>
-      <td width="50%"><br></td>
-      <td width="15%"></td>
-      <td width="15%"></td>
-      <td width="20%"></td>
-    </tr>
-
-    <tr>
-      <td class="tableHead">Filename</td>
-      <td class="tableHead" colspan=3>Coverage</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="action.h.gcov.html">action.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=85 height=10 alt="85.4%"><img src="../../../snow.png" width=15 height=10 alt="85.4%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">85.4&nbsp;%</td>
-      <td class="coverNumHi">41&nbsp;/&nbsp;48&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="action.test.h.gcov.html">action.test.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">29&nbsp;/&nbsp;29&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="package.h.gcov.html">package.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=94 height=10 alt="93.9%"><img src="../../../snow.png" width=6 height=10 alt="93.9%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">93.9&nbsp;%</td>
-      <td class="coverNumHi">31&nbsp;/&nbsp;33&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="record.cpp.gcov.html">record.cpp</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">1&nbsp;/&nbsp;1&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="record.h.gcov.html">record.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=86 height=10 alt="86.5%"><img src="../../../snow.png" width=14 height=10 alt="86.5%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">86.5&nbsp;%</td>
-      <td class="coverNumHi">83&nbsp;/&nbsp;96&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="record.test.h.gcov.html">record.test.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">29&nbsp;/&nbsp;29&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="recordparser.cpp.gcov.html">recordparser.cpp</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=95 height=10 alt="95.2%"><img src="../../../snow.png" width=5 height=10 alt="95.2%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">95.2&nbsp;%</td>
-      <td class="coverNumHi">59&nbsp;/&nbsp;62&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="recordparser.h.gcov.html">recordparser.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">4&nbsp;/&nbsp;4&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="version.h.gcov.html">version.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=94 height=10 alt="93.8%"><img src="../../../snow.png" width=6 height=10 alt="93.8%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">93.8&nbsp;%</td>
-      <td class="coverNumHi">30&nbsp;/&nbsp;32&nbsp;lines</td>
-    </tr>
-
-  </table>
-  </center>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/core/apt/package.h.gcov.html b/rep/ept/core/apt/package.h.gcov.html
deleted file mode 100644
index deea250..0000000
--- a/rep/ept/core/apt/package.h.gcov.html
+++ /dev/null
@@ -1,194 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/core/apt/package.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">ept/core/apt</a> - package.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">33</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">93.9 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">31</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : #ifndef EPT_APT_PACKAGE_H
-<span class="lineNum">       4 </span>                : #define EPT_APT_PACKAGE_H
-<span class="lineNum">       5 </span>                : 
-<span class="lineNum">       6 </span>                : namespace ept {
-<span class="lineNum">       7 </span>                : namespace core {
-<span class="lineNum">       8 </span>                : namespace package {
-<span class="lineNum">       9 </span>                : 
-<span class="lineNum">      10 </span>                : struct Setup {
-<span class="lineNum">      11 </span>                :     typedef ept::Token Token;
-<span class="lineNum">      12 </span>                :     typedef package::Internal Internal;
-<span class="lineNum">      13 </span>                :     typedef package::PropertyId PropertyId;
-<span class="lineNum">      14 </span>                :     typedef package::InternalList InternalList;
-<span class="lineNum">      15 </span>                : };
-<span class="lineNum">      16 </span>                : 
-<span class="lineNum">      17 </span>                : template&lt;&gt; struct PropertyType&lt; Name &gt; { typedef std::string T; };
-<span class="lineNum">      18 </span>                : template&lt;&gt; struct PropertyType&lt; Versions &gt; { typedef VersionList T; };
-<span class="lineNum">      19 </span>                : template&lt;&gt; struct PropertyType&lt; AnyVersion &gt; { typedef Token T; };
-<span class="lineNum">      20 </span>                : template&lt;&gt; struct PropertyType&lt; State &gt; { typedef PackageState T; };
-<span class="lineNum">      21 </span>                : template&lt;&gt; struct PropertyType&lt; CandidateVersion &gt; { typedef Token T; };
-<span class="lineNum">      22 </span>                : template&lt;&gt; struct PropertyType&lt; InstalledVersion &gt; { typedef Token T; };
-<span class="lineNum">      23 </span>                : 
-<span class="lineNum">      24 </span>                : struct Source : core::Source&lt; Source, Setup, PropertyType &gt;
-<span class="lineNum">      25 </span><span class="lineCov">             15 : {</span>
-<span class="lineNum">      26 </span>                :     AptDatabase &amp;m_db;
-<span class="lineNum">      27 </span>                : 
-<span class="lineNum">      28 </span><span class="lineCov">             15 :     Source( AptDatabase &amp;db ) : m_db( db ) {}</span>
-<span class="lineNum">      29 </span>                : 
-<span class="lineNum">      30 </span><span class="lineCov">              3 :     InternalList listInternal() {</span>
-<span class="lineNum">      31 </span><span class="lineCov">              3 :         return InternalList( m_db.cache().PkgBegin() );</span>
-<span class="lineNum">      32 </span>                :     }
-<span class="lineNum">      33 </span>                : 
-<span class="lineNum">      34 </span><span class="lineCov">             17 :     Internal lookupToken( Token t ) {</span>
-<span class="lineNum">      35 </span><span class="lineCov">             17 :         return m_db.lookupPackage( t );</span>
-<span class="lineNum">      36 </span>                :     }
-<span class="lineNum">      37 </span>                : 
-<span class="lineNum">      38 </span><span class="lineCov">           3777 :     Token getToken( Internal i ) {</span>
-<span class="lineNum">      39 </span><span class="lineCov">           3777 :         Token t;</span>
-<span class="lineNum">      40 </span><span class="lineCov">           3777 :         t._id = i.Name();</span>
-<span class="lineNum">      41 </span><span class="lineNoCov">              0 :         return t;</span>
-<span class="lineNum">      42 </span>                :     }
-<span class="lineNum">      43 </span>                : 
-<span class="lineNum">      44 </span><span class="lineCov">              8 :     bool exists( Token t ) {</span>
-<span class="lineNum">      45 </span><span class="lineCov">              8 :         if ( t.hasVersion() )</span>
-<span class="lineNum">      46 </span><span class="lineNoCov">              0 :             return !m_db.lookupVersion( t ).end();</span>
-<span class="lineNum">      47 </span>                :         else
-<span class="lineNum">      48 </span><span class="lineCov">              8 :             return !lookupToken( t ).end();</span>
-<span class="lineNum">      49 </span>                :     }
-<span class="lineNum">      50 </span>                : 
-<span class="lineNum">      51 </span>                :     Token versionToken( pkgCache::VerIterator vi ) {
-<span class="lineNum">      52 </span>                :         if ( vi.end() )
-<span class="lineNum">      53 </span>                :             return Token();
-<span class="lineNum">      54 </span>                :         return Token( std::string( vi.ParentPkg().Name() ) + &quot;_&quot; + vi.VerStr() );
-<span class="lineNum">      55 </span>                :     }
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span>                :     template&lt; PropertyId p &gt;
-<span class="lineNum">      58 </span>                :     typename PropertyType&lt; p &gt;::T getInternal( Internal );
-<span class="lineNum">      59 </span>                : 
-<span class="lineNum">      60 </span>                :     template&lt; typename List &gt;
-<span class="lineNum">      61 </span><span class="lineCov">              1 :     void revertState( List l ) {</span>
-<span class="lineNum">      62 </span><span class="lineCov">           3779 :         while ( !l.empty() ) {</span>
-<span class="lineNum">      63 </span><span class="lineCov">           3777 :             PackageState s = getInternal&lt; State &gt;( l.head() );</span>
-<span class="lineNum">      64 </span><span class="lineCov">           3777 :             if ( !s.keep() || s.purge() ) {</span>
-<span class="lineNum">      65 </span><span class="lineCov">              2 :                 pkgDepCache::StateCache &amp;S = db().state()[ l.head() ];</span>
-<span class="lineNum">      66 </span><span class="lineCov">              2 :                 db().state().MarkKeep( l.head(), false, false );</span>
-<span class="lineNum">      67 </span><span class="lineCov">              2 :                 S.iFlags &amp;= ~pkgDepCache::Purge;</span>
-<span class="lineNum">      68 </span><span class="lineCov">              2 :                 S.iFlags &amp;= ~pkgDepCache::ReInstall;</span>
-<span class="lineNum">      69 </span>                :             }
-<span class="lineNum">      70 </span><span class="lineCov">           3777 :             l = l.tail();</span>
-<span class="lineNum">      71 </span>                :         }
-<span class="lineNum">      72 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      73 </span>                : 
-<span class="lineNum">      74 </span><span class="lineCov">              1 :     void revertStates() {</span>
-<span class="lineNum">      75 </span><span class="lineCov">              1 :         pkgDepCache::ActionGroup group( db().state() );</span>
-<span class="lineNum">      76 </span><span class="lineCov">              1 :         revertState( listInternal() );</span>
-<span class="lineNum">      77 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      78 </span>                : 
-<span class="lineNum">      79 </span>                :     typedef ComposedList&lt; State &gt; ChangeList;
-<span class="lineNum">      80 </span>                : 
-<span class="lineNum">      81 </span>                :     static bool isChanged( Token t, PackageState s );
-<span class="lineNum">      82 </span>                :     static bool isUpgradable( Token t, PackageState s );
-<span class="lineNum">      83 </span>                : 
-<span class="lineNum">      84 </span>                :     PropertyFilter&lt; State, __typeof( &amp;isChanged ) &gt;::T changedList() {
-<span class="lineNum">      85 </span>                :         return propertyFilter&lt; State &gt;( isChanged );
-<span class="lineNum">      86 </span>                :     }
-<span class="lineNum">      87 </span>                : 
-<span class="lineNum">      88 </span>                :     PropertyFilter&lt; State, __typeof( &amp;isUpgradable ) &gt;::T upgradableList() {
-<span class="lineNum">      89 </span>                :         return propertyFilter&lt; State &gt;( isUpgradable );
-<span class="lineNum">      90 </span>                :     }
-<span class="lineNum">      91 </span>                : 
-<span class="lineNum">      92 </span><span class="lineCov">              9 :     AptDatabase &amp;db() { return m_db; }</span>
-<span class="lineNum">      93 </span>                : };
-<span class="lineNum">      94 </span>                : 
-<span class="lineNum">      95 </span><span class="lineCov">           3778 : template&lt;&gt; inline std::string Source::getInternal&lt; Name &gt;( Internal i ) {</span>
-<span class="lineNum">      96 </span><span class="lineCov">           3778 :     return i.Name();</span>
-<span class="lineNum">      97 </span>                : }
-<span class="lineNum">      98 </span>                : 
-<span class="lineNum">      99 </span><span class="lineCov">           3783 : template&lt;&gt; inline PackageState Source::getInternal&lt; State &gt;( Internal i ) {</span>
-<span class="lineNum">     100 </span><span class="lineCov">           3783 :     return m_db.packageState( i );</span>
-<span class="lineNum">     101 </span>                : }
-<span class="lineNum">     102 </span>                : 
-<span class="lineNum">     103 </span>                : template&lt;&gt; inline Token Source::getInternal&lt; CandidateVersion &gt;( Internal i ) {
-<span class="lineNum">     104 </span>                :     return versionToken( m_db.candidateVersion( i ) );
-<span class="lineNum">     105 </span>                : }
-<span class="lineNum">     106 </span>                : 
-<span class="lineNum">     107 </span>                : template&lt;&gt; inline Token Source::getInternal&lt; AnyVersion &gt;( Internal i ) {
-<span class="lineNum">     108 </span>                :     return versionToken( m_db.candidateVersion( i ) );
-<span class="lineNum">     109 </span>                : }
-<span class="lineNum">     110 </span>                : 
-<span class="lineNum">     111 </span>                : template&lt;&gt; inline Token Source::getInternal&lt; InstalledVersion &gt;( Internal i ) {
-<span class="lineNum">     112 </span>                :     return versionToken( m_db.installedVersion( i ) );
-<span class="lineNum">     113 </span>                : }
-<span class="lineNum">     114 </span>                : 
-<span class="lineNum">     115 </span>                : inline bool Source::isChanged( Token, PackageState s ) {
-<span class="lineNum">     116 </span>                :     return s.modify();
-<span class="lineNum">     117 </span>                : }
-<span class="lineNum">     118 </span>                : 
-<span class="lineNum">     119 </span>                : inline bool Source::isUpgradable( Token, PackageState s ) {
-<span class="lineNum">     120 </span>                :     return s.upgradable();
-<span class="lineNum">     121 </span>                : }
-<span class="lineNum">     122 </span>                : 
-<span class="lineNum">     123 </span>                : }
-<span class="lineNum">     124 </span>                : }
-<span class="lineNum">     125 </span>                : }
-<span class="lineNum">     126 </span>                : 
-<span class="lineNum">     127 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/core/apt/record.cpp.gcov.html b/rep/ept/core/apt/record.cpp.gcov.html
deleted file mode 100644
index 453b7a7..0000000
--- a/rep/ept/core/apt/record.cpp.gcov.html
+++ /dev/null
@@ -1,83 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/core/apt/record.cpp</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">ept/core/apt</a> - record.cpp</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">1</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">1</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #include &lt;ept/core/apt.h&gt;
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : namespace ept {
-<span class="lineNum">       4 </span>                : namespace core {
-<span class="lineNum">       5 </span>                : namespace record {
-<span class="lineNum">       6 </span>                : 
-<span class="lineNum">       7 </span>                : // needs to be kept in sync with record::PropertyId, see apt.h
-<span class="lineNum">       8 </span>                : const char *fields[] = {
-<span class="lineNum">       9 </span>                :     &quot;&quot;, &quot;Package&quot;, &quot;Priority&quot;, &quot;Section&quot;, &quot;Installed-Size&quot;,
-<span class="lineNum">      10 </span>                :     &quot;Maintainer&quot;, &quot;Architecture&quot;, &quot;Source&quot;, &quot;Version&quot;,
-<span class="lineNum">      11 </span>                :     &quot;Description&quot;, &quot;&quot;, &quot;&quot;, &quot;Size&quot;
-<span class="lineNum">      12 </span>                : };
-<span class="lineNum">      13 </span>                : 
-<span class="lineNum">      14 </span>                : }
-<span class="lineNum">      15 </span>                : }
-<span class="lineNum">      16 </span><span class="lineCov">              3 : }</span>
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/core/apt/record.h.gcov.html b/rep/ept/core/apt/record.h.gcov.html
deleted file mode 100644
index 4e0e3a4..0000000
--- a/rep/ept/core/apt/record.h.gcov.html
+++ /dev/null
@@ -1,355 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/core/apt/record.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">ept/core/apt</a> - record.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">96</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">86.5 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">83</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : #include &lt;ept/core/apt/recordparser.h&gt;
-<span class="lineNum">       4 </span>                : 
-<span class="lineNum">       5 </span>                : #ifndef EPT_APT_RECORD_H
-<span class="lineNum">       6 </span>                : #define EPT_APT_RECORD_H
-<span class="lineNum">       7 </span>                : 
-<span class="lineNum">       8 </span>                : namespace ept {
-<span class="lineNum">       9 </span>                : namespace core {
-<span class="lineNum">      10 </span>                : namespace record {
-<span class="lineNum">      11 </span>                : 
-<span class="lineNum">      12 </span>                : struct Source;
-<span class="lineNum">      13 </span>                : 
-<span class="lineNum">      14 </span>                : struct InternalList {
-<span class="lineNum">      15 </span>                :     Source *m_source;
-<span class="lineNum">      16 </span>                :     size_t m_idx;
-<span class="lineNum">      17 </span>                : 
-<span class="lineNum">      18 </span>                :     Internal head();
-<span class="lineNum">      19 </span>                :     const Internal head() const;
-<span class="lineNum">      20 </span>                :     bool empty() const;
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span><span class="lineCov">            870 :     InternalList tail() const {</span>
-<span class="lineNum">      23 </span><span class="lineCov">            870 :         InternalList t = *this;</span>
-<span class="lineNum">      24 </span><span class="lineCov">            870 :         ++ t.m_idx;</span>
-<span class="lineNum">      25 </span>                :         return t;
-<span class="lineNum">      26 </span>                :     }
-<span class="lineNum">      27 </span>                : 
-<span class="lineNum">      28 </span><span class="lineCov">              2 :     InternalList( Source &amp;s )</span>
-<span class="lineNum">      29 </span><span class="lineCov">              2 :         : m_source( &amp;s ), m_idx( 0 )</span>
-<span class="lineNum">      30 </span><span class="lineCov">              2 :     {}</span>
-<span class="lineNum">      31 </span>                : };
-<span class="lineNum">      32 </span>                : 
-<span class="lineNum">      33 </span>                : struct Setup {
-<span class="lineNum">      34 </span>                :     typedef ept::Token Token;
-<span class="lineNum">      35 </span>                :     typedef record::Internal Internal;
-<span class="lineNum">      36 </span>                :     typedef record::PropertyId PropertyId;
-<span class="lineNum">      37 </span>                :     typedef record::InternalList InternalList;
-<span class="lineNum">      38 </span>                : };
-<span class="lineNum">      39 </span>                : 
-<span class="lineNum">      40 </span>                : template&lt;&gt; struct PropertyType&lt; InstalledSize &gt; { typedef int T; };
-<span class="lineNum">      41 </span>                : template&lt;&gt; struct PropertyType&lt; PackageSize &gt; { typedef int T; };
-<span class="lineNum">      42 </span>                : 
-<span class="lineNum">      43 </span>                : struct Parser: RecordParser
-<span class="lineNum">      44 </span><span class="lineCov">           1310 : {</span>
-<span class="lineNum">      45 </span>                :     bool parseBool(bool&amp; def, const std::string&amp; str) const
-<span class="lineNum">      46 </span>                :     {
-<span class="lineNum">      47 </span>                :         // Believe it or not, this is what apt does to interpret bool fields
-<span class="lineNum">      48 </span>                :         if (str == &quot;no&quot; || str == &quot;false&quot; || str == &quot;without&quot; ||
-<span class="lineNum">      49 </span>                :             str == &quot;off&quot; || str == &quot;disable&quot;)
-<span class="lineNum">      50 </span>                :             return false;
-<span class="lineNum">      51 </span>                : 
-<span class="lineNum">      52 </span>                :         if (str == &quot;yes&quot; || str == &quot;true&quot; || str == &quot;with&quot; ||
-<span class="lineNum">      53 </span>                :             str == &quot;on&quot; || str == &quot;enable&quot;)
-<span class="lineNum">      54 </span>                :             return true;
-<span class="lineNum">      55 </span>                : 
-<span class="lineNum">      56 </span>                :         return def;
-<span class="lineNum">      57 </span>                :     }
-<span class="lineNum">      58 </span>                : 
-<span class="lineNum">      59 </span>                : public:
-<span class="lineNum">      60 </span>                :     Parser() : RecordParser() {}
-<span class="lineNum">      61 </span><span class="lineCov">           1310 :     Parser(const std::string&amp; str) : RecordParser(str) {}</span>
-<span class="lineNum">      62 </span>                : 
-<span class="lineNum">      63 </span>                :     template&lt; PropertyId p &gt;
-<span class="lineNum">      64 </span>                :     typename PropertyType&lt; p &gt;::T parse( typename PropertyType&lt; p &gt;::T def,
-<span class="lineNum">      65 </span>                :                                          std::string data );
-<span class="lineNum">      66 </span>                : 
-<span class="lineNum">      67 </span>                :     template&lt; typename T &gt;
-<span class="lineNum">      68 </span>                :     struct Default {
-<span class="lineNum">      69 </span>                :         static T def;
-<span class="lineNum">      70 </span>                :     };
-<span class="lineNum">      71 </span>                : 
-<span class="lineNum">      72 </span>                :     template&lt; typename T &gt; T parse( const T &amp;def,
-<span class="lineNum">      73 </span>                :                                     const std::string &amp;field ) const;
-<span class="lineNum">      74 </span>                : 
-<span class="lineNum">      75 </span>                :     template&lt; PropertyId p &gt;
-<span class="lineNum">      76 </span>                :     typename PropertyType&lt; p &gt;::T get(
-<span class="lineNum">      77 </span>                :         const typename PropertyType&lt; p &gt;::T &amp;def
-<span class="lineNum">      78 </span><span class="lineCov">           1308 :         = Default&lt; typename PropertyType&lt; p &gt;::T &gt;::def ) const</span>
-<span class="lineNum">      79 </span>                :     {
-<span class="lineNum">      80 </span>                :         return parse&lt; typename PropertyType&lt; p &gt;::T &gt;( def,
-<span class="lineNum">      81 </span><span class="lineCov">           1308 :                                                        lookup( fields[ p ] ) );</span>
-<span class="lineNum">      82 </span>                :     }
-<span class="lineNum">      83 </span>                : 
-<span class="lineNum">      84 </span>                : };
-<span class="lineNum">      85 </span>                : 
-<span class="lineNum">      86 </span><span class="lineCov">             25 : template&lt; typename T &gt; T Parser::Default&lt; T &gt;::def = T();</span>
-<span class="lineNum">      87 </span>                : 
-<span class="lineNum">      88 </span>                : template&lt;&gt; inline std::string Parser::get&lt; ShortDescription &gt;(
-<span class="lineNum">      89 </span><span class="lineCov">              2 :     const std::string&amp; def ) const</span>
-<span class="lineNum">      90 </span>                : {
-<span class="lineNum">      91 </span><span class="lineCov">              2 :     std::string str = lookup( fields[ Description ] );</span>
-<span class="lineNum">      92 </span><span class="lineCov">              4 :     if (str == std::string())</span>
-<span class="lineNum">      93 </span><span class="lineCov">              1 :         return def;</span>
-<span class="lineNum">      94 </span><span class="lineCov">              1 :     size_t pos = str.find(&quot;\n&quot;);</span>
-<span class="lineNum">      95 </span><span class="lineCov">              1 :     if (pos == std::string::npos)</span>
-<span class="lineNum">      96 </span><span class="lineNoCov">              0 :         return str;</span>
-<span class="lineNum">      97 </span>                :     else
-<span class="lineNum">      98 </span><span class="lineCov">              1 :         return str.substr(0, pos);</span>
-<span class="lineNum">      99 </span>                : }
-<span class="lineNum">     100 </span>                : 
-<span class="lineNum">     101 </span>                : template&lt;&gt; inline std::string Parser::get&lt; LongDescription &gt;(
-<span class="lineNum">     102 </span>                :     const std::string&amp; def ) const
-<span class="lineNum">     103 </span>                : {
-<span class="lineNum">     104 </span>                :     std::string str = lookup( fields[ Description ] );
-<span class="lineNum">     105 </span>                :     if (str == std::string())
-<span class="lineNum">     106 </span>                :         return def;
-<span class="lineNum">     107 </span>                :     size_t pos = str.find(&quot;\n&quot;);
-<span class="lineNum">     108 </span>                :     if (pos == std::string::npos)
-<span class="lineNum">     109 </span>                :         return str;
-<span class="lineNum">     110 </span>                :     else
-<span class="lineNum">     111 </span>                :     {
-<span class="lineNum">     112 </span>                :         // Trim trailing spaces
-<span class="lineNum">     113 </span>                :         for (++pos; pos &lt; str.size() &amp;&amp; isspace(str[pos]); ++pos)
-<span class="lineNum">     114 </span>                :             ;
-<span class="lineNum">     115 </span>                :         return str.substr(pos);
-<span class="lineNum">     116 </span>                :     }
-<span class="lineNum">     117 </span>                : }
-<span class="lineNum">     118 </span>                : 
-<span class="lineNum">     119 </span>                : template&lt;&gt; inline std::string Parser::parse&lt; std::string &gt;(
-<span class="lineNum">     120 </span><span class="lineCov">           1307 :     const std::string&amp; def, const std::string&amp; str) const</span>
-<span class="lineNum">     121 </span>                : {
-<span class="lineNum">     122 </span><span class="lineCov">           1307 :     if (str == std::string())</span>
-<span class="lineNum">     123 </span><span class="lineNoCov">              0 :         return def;</span>
-<span class="lineNum">     124 </span><span class="lineCov">           1307 :     return str;</span>
-<span class="lineNum">     125 </span>                : }
-<span class="lineNum">     126 </span>                : 
-<span class="lineNum">     127 </span>                : template&lt;&gt; inline int Parser::parse&lt; int &gt;(
-<span class="lineNum">     128 </span><span class="lineCov">              1 :     const int&amp; def, const std::string&amp; str) const</span>
-<span class="lineNum">     129 </span>                : {
-<span class="lineNum">     130 </span><span class="lineCov">              1 :         if (str == string())</span>
-<span class="lineNum">     131 </span><span class="lineNoCov">              0 :                 return def;</span>
-<span class="lineNum">     132 </span><span class="lineCov">              1 :         return (size_t)strtoul(str.c_str(), NULL, 10);</span>
-<span class="lineNum">     133 </span>                : }
-<span class="lineNum">     134 </span>                : 
-<span class="lineNum">     135 </span>                : struct Source : core::Source&lt; Source, Setup, PropertyType &gt;
-<span class="lineNum">     136 </span><span class="lineCov">              6 : {</span>
-<span class="lineNum">     137 </span>                :     AptDatabase &amp;m_db;
-<span class="lineNum">     138 </span>                : 
-<span class="lineNum">     139 </span>                :     /* caching */
-<span class="lineNum">     140 </span>                :     pkgCache::PkgFileIterator lastFile;
-<span class="lineNum">     141 </span>                :     FileFd file;
-<span class="lineNum">     142 </span>                :     size_t lastOffset;
-<span class="lineNum">     143 </span>                : 
-<span class="lineNum">     144 </span>                :     /* in-order retrieval of records, for InternalList */
-<span class="lineNum">     145 </span>                :     typedef vector&lt; pkgCache::VerFile * &gt; VfList;
-<span class="lineNum">     146 </span>                :     VfList m_vflist;
-<span class="lineNum">     147 </span>                : 
-<span class="lineNum">     148 </span><span class="lineCov">           1742 :     VfList &amp;vfList() {</span>
-<span class="lineNum">     149 </span><span class="lineCov">           1742 :         if ( m_vflist.size() &gt; 0 )</span>
-<span class="lineNum">     150 </span><span class="lineCov">           1741 :             return m_vflist;</span>
-<span class="lineNum">     151 </span>                : 
-<span class="lineNum">     152 </span><span class="lineCov">              1 :         m_vflist.reserve(m_db.cache().HeaderP-&gt;PackageCount + 1);</span>
-<span class="lineNum">     153 </span>                : 
-<span class="lineNum">     154 </span>                :         // Populate the vector of versions to print
-<span class="lineNum">     155 </span><span class="lineCov">           3778 :         for (pkgCache::PkgIterator pi = m_db.cache().PkgBegin(); !pi.end(); ++pi)</span>
-<span class="lineNum">     156 </span>                :         {
-<span class="lineNum">     157 </span><span class="lineCov">           3777 :             if (pi-&gt;VersionList == 0)</span>
-<span class="lineNum">     158 </span><span class="lineCov">           1989 :                 continue;</span>
-<span class="lineNum">     159 </span>                : 
-<span class="lineNum">     160 </span><span class="lineCov">           3596 :             for( pkgCache::VerIterator vi = pi.VersionList(); !vi.end(); ++vi ) {</span>
-<span class="lineNum">     161 </span>                : 
-<span class="lineNum">     162 </span>                :                 // Choose a valid file that contains the record for this version
-<span class="lineNum">     163 </span><span class="lineCov">           1808 :                 pkgCache::VerFileIterator vfi = vi.FileList();</span>
-<span class="lineNum">     164 </span><span class="lineCov">           3181 :                 for ( ; !vfi.end(); ++vfi )</span>
-<span class="lineNum">     165 </span><span class="lineCov">           1808 :                     if ((vfi.File()-&gt;Flags &amp; pkgCache::Flag::NotSource) == 0)</span>
-<span class="lineNum">     166 </span><span class="lineCov">            435 :                         break;</span>
-<span class="lineNum">     167 </span>                : 
-<span class="lineNum">     168 </span><span class="lineCov">           1808 :                 if ( !vfi.end() )</span>
-<span class="lineNum">     169 </span><span class="lineCov">            435 :                     m_vflist.push_back( vfi );</span>
-<span class="lineNum">     170 </span>                :             }
-<span class="lineNum">     171 </span>                :         }
-<span class="lineNum">     172 </span>                : 
-<span class="lineNum">     173 </span><span class="lineCov">              1 :         sort(m_vflist.begin(), m_vflist.end(), localityCompare);</span>
-<span class="lineNum">     174 </span><span class="lineCov">              1 :         return m_vflist;</span>
-<span class="lineNum">     175 </span>                :     }
-<span class="lineNum">     176 </span>                : 
-<span class="lineNum">     177 </span><span class="lineCov">              6 :     Source( AptDatabase &amp;db ) : m_db( db ) {}</span>
-<span class="lineNum">     178 </span>                : 
-<span class="lineNum">     179 </span><span class="lineCov">              2 :     InternalList listInternal() {</span>
-<span class="lineNum">     180 </span><span class="lineCov">              2 :         return InternalList( *this );</span>
-<span class="lineNum">     181 </span>                :     }
-<span class="lineNum">     182 </span>                : 
-<span class="lineNum">     183 </span><span class="lineCov">              5 :     Internal lookupToken( Token t ) {</span>
-<span class="lineNum">     184 </span><span class="lineCov">              5 :         return m_db.lookupVersionFile( m_db.lookupVersion( t ) );</span>
-<span class="lineNum">     185 </span>                :     }
-<span class="lineNum">     186 </span>                : 
-<span class="lineNum">     187 </span>                :     // Sort a version list by package file locality
-<span class="lineNum">     188 </span>                :     static bool localityCompare(const pkgCache::VerFile* a,
-<span class="lineNum">     189 </span><span class="lineCov">           4371 :                                 const pkgCache::VerFile* b)</span>
-<span class="lineNum">     190 </span>                :     {
-<span class="lineNum">     191 </span><span class="lineCov">           4371 :         if (a == 0 &amp;&amp; b == 0)</span>
-<span class="lineNum">     192 </span><span class="lineNoCov">              0 :             return false;</span>
-<span class="lineNum">     193 </span><span class="lineCov">           4371 :         if (a == 0)</span>
-<span class="lineNum">     194 </span><span class="lineNoCov">              0 :             return true;</span>
-<span class="lineNum">     195 </span><span class="lineCov">           4371 :         if (b == 0)</span>
-<span class="lineNum">     196 </span><span class="lineNoCov">              0 :             return false;</span>
-<span class="lineNum">     197 </span>                : 
-<span class="lineNum">     198 </span><span class="lineCov">           4371 :         if (a-&gt;File == b-&gt;File)</span>
-<span class="lineNum">     199 </span><span class="lineCov">           4371 :             return a-&gt;Offset &lt; b-&gt;Offset;</span>
-<span class="lineNum">     200 </span><span class="lineNoCov">              0 :         return a-&gt;File &lt; b-&gt;File;</span>
-<span class="lineNum">     201 </span>                :     }
-<span class="lineNum">     202 </span>                : 
-<span class="lineNum">     203 </span>                :     void invalidate() {
-<span class="lineNum">     204 </span>                :         core::Source&lt; Source, Setup, PropertyType &gt;::invalidate();
-<span class="lineNum">     205 </span>                :         lastFile = pkgCache::PkgFileIterator();
-<span class="lineNum">     206 </span>                :     }
-<span class="lineNum">     207 </span>                : 
-<span class="lineNum">     208 </span><span class="lineCov">           1311 :     std::string getRecord( Internal vfi ) {</span>
-<span class="lineNum">     209 </span><span class="lineCov">           1311 :         if ( vfi.Cache() == 0 || vfi.end() )</span>
-<span class="lineNum">     210 </span><span class="lineCov">              1 :             return &quot;&quot;;</span>
-<span class="lineNum">     211 </span>                : 
-<span class="lineNum">     212 </span><span class="lineCov">           1310 :         if ((lastFile.Cache() == 0)</span>
-<span class="lineNum">     213 </span>                :             || vfi-&gt;File + m_db.cache().PkgFileP != lastFile)
-<span class="lineNum">     214 </span>                :         {
-<span class="lineNum">     215 </span>                :             lastFile = pkgCache::PkgFileIterator(
-<span class="lineNum">     216 </span><span class="lineCov">              5 :                 m_db.cache(), vfi-&gt;File + m_db.cache().PkgFileP);</span>
-<span class="lineNum">     217 </span><span class="lineCov">              5 :             if (!lastFile.IsOk())</span>
-<span class="lineNum">     218 </span>                :                 throw wibble::exception::System(
-<span class="lineNum">     219 </span>                :                     std::string(&quot;Reading the&quot;
-<span class="lineNum">     220 </span>                :                                 &quot; data record for a package from file &quot;)
-<span class="lineNum">     221 </span><span class="lineNoCov">              0 :                     + lastFile.FileName() );</span>
-<span class="lineNum">     222 </span><span class="lineCov">              5 :             if (file.IsOpen())</span>
-<span class="lineNum">     223 </span><span class="lineNoCov">              0 :                 file.Close();</span>
-<span class="lineNum">     224 </span><span class="lineCov">              5 :             if (!file.Open(lastFile.FileName(), FileFd::ReadOnly))</span>
-<span class="lineNum">     225 </span>                :                 throw wibble::exception::System( std::string(&quot;Opening file &quot;)
-<span class="lineNum">     226 </span><span class="lineNoCov">              0 :                                                  + lastFile.FileName() );</span>
-<span class="lineNum">     227 </span><span class="lineCov">              5 :             lastOffset = 0;</span>
-<span class="lineNum">     228 </span>                :         }
-<span class="lineNum">     229 </span>                : 
-<span class="lineNum">     230 </span>                :         // If we start near were we ended, avoid a seek
-<span class="lineNum">     231 </span>                :         // and enlarge the read a bit
-<span class="lineNum">     232 </span><span class="lineCov">           1310 :         size_t slack = vfi-&gt;Offset - lastOffset;</span>
-<span class="lineNum">     233 </span><span class="lineCov">           1310 :         if ( slack &gt; 128 ) // mornfall: was 8, making it 128</span>
-<span class="lineNum">     234 </span>                :         {
-<span class="lineNum">     235 </span><span class="lineCov">            871 :             slack = 0;</span>
-<span class="lineNum">     236 </span><span class="lineCov">            871 :             if ( !file.Seek( vfi-&gt;Offset ) )</span>
-<span class="lineNum">     237 </span>                :                 throw wibble::exception::System(
-<span class="lineNum">     238 </span>                :                     std::string(&quot;Cannot seek to package record in file &quot;)
-<span class="lineNum">     239 </span><span class="lineNoCov">              0 :                     + lastFile.FileName() );</span>
-<span class="lineNum">     240 </span>                :         }
-<span class="lineNum">     241 </span>                : 
-<span class="lineNum">     242 </span><span class="lineCov">           1310 :         char buffer[vfi-&gt;Size + slack + 1];</span>
-<span class="lineNum">     243 </span><span class="lineCov">           1310 :         if (!file.Read(buffer, vfi-&gt;Size + slack))</span>
-<span class="lineNum">     244 </span>                :             throw wibble::exception::System(
-<span class="lineNum">     245 </span>                :                 std::string(&quot;Cannot read package &quot;
-<span class="lineNum">     246 </span><span class="lineNoCov">              0 :                             &quot;record in file &quot;) + lastFile.FileName() );</span>
-<span class="lineNum">     247 </span>                : 
-<span class="lineNum">     248 </span><span class="lineCov">           1310 :         buffer[vfi-&gt;Size + slack] = '\0';</span>
-<span class="lineNum">     249 </span>                :         //cerr &lt;&lt; &quot;Data read (slack: &quot; &lt;&lt; slack &lt;&lt; &quot;)&quot; &lt;&lt; endl;
-<span class="lineNum">     250 </span>                : 
-<span class="lineNum">     251 </span><span class="lineCov">           1310 :         lastOffset = vfi-&gt;Offset + vfi-&gt;Size;</span>
-<span class="lineNum">     252 </span>                : 
-<span class="lineNum">     253 </span><span class="lineCov">           1310 :         return string(buffer+slack);</span>
-<span class="lineNum">     254 </span>                :     }
-<span class="lineNum">     255 </span>                : 
-<span class="lineNum">     256 </span><span class="lineCov">            435 :     Token getToken( Internal i ) {</span>
-<span class="lineNum">     257 </span><span class="lineCov">            435 :         Token t;</span>
-<span class="lineNum">     258 </span><span class="lineCov">            435 :         t._id = getInternal&lt; Name &gt;( i ) + &quot;_&quot; + getInternal&lt; Version &gt;( i );</span>
-<span class="lineNum">     259 </span><span class="lineNoCov">              0 :         return t;</span>
-<span class="lineNum">     260 </span>                :     }
-<span class="lineNum">     261 </span>                : 
-<span class="lineNum">     262 </span>                :     template&lt; PropertyId p &gt;
-<span class="lineNum">     263 </span><span class="lineCov">           1310 :     typename PropertyType&lt; p &gt;::T getInternal( Internal i ) {</span>
-<span class="lineNum">     264 </span><span class="lineCov">           1310 :         Parser rec( getRecord( i ) );</span>
-<span class="lineNum">     265 </span><span class="lineCov">           1310 :         return rec.get&lt; p &gt;();</span>
-<span class="lineNum">     266 </span>                :     }
-<span class="lineNum">     267 </span>                : };
-<span class="lineNum">     268 </span>                : 
-<span class="lineNum">     269 </span><span class="lineCov">              1 : template&lt;&gt; inline std::string Source::getInternal&lt; Record &gt;( Internal i ) {</span>
-<span class="lineNum">     270 </span><span class="lineCov">              1 :     assert( !i.end() );</span>
-<span class="lineNum">     271 </span><span class="lineCov">              1 :     return getRecord( i );</span>
-<span class="lineNum">     272 </span>                : }
-<span class="lineNum">     273 </span>                : 
-<span class="lineNum">     274 </span><span class="lineCov">            870 : inline const Internal InternalList::head() const {</span>
-<span class="lineNum">     275 </span>                :     return pkgCache::VerFileIterator( m_source-&gt;m_db.cache(),
-<span class="lineNum">     276 </span><span class="lineCov">            870 :                                       m_source-&gt;vfList()[ m_idx ] );</span>
-<span class="lineNum">     277 </span>                : }
-<span class="lineNum">     278 </span>                : 
-<span class="lineNum">     279 </span><span class="lineCov">            872 : inline bool InternalList::empty() const {</span>
-<span class="lineNum">     280 </span><span class="lineCov">            872 :     return m_idx == m_source-&gt;vfList().size();</span>
-<span class="lineNum">     281 </span>                : }
-<span class="lineNum">     282 </span>                : 
-<span class="lineNum">     283 </span>                : 
-<span class="lineNum">     284 </span>                : }
-<span class="lineNum">     285 </span>                : }
-<span class="lineNum">     286 </span>                : }
-<span class="lineNum">     287 </span>                : 
-<span class="lineNum">     288 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/core/apt/record.test.h.gcov.html b/rep/ept/core/apt/record.test.h.gcov.html
deleted file mode 100644
index afee746..0000000
--- a/rep/ept/core/apt/record.test.h.gcov.html
+++ /dev/null
@@ -1,123 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/core/apt/record.test.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">ept/core/apt</a> - record.test.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">29</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">29</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- C++ -*-
-<span class="lineNum">       2 </span>                : #include &lt;ept/core/apt.h&gt;
-<span class="lineNum">       3 </span>                : 
-<span class="lineNum">       4 </span>                : #include &lt;ept/test.h&gt;
-<span class="lineNum">       5 </span>                : 
-<span class="lineNum">       6 </span>                : using namespace ept::core;
-<span class="lineNum">       7 </span>                : 
-<span class="lineNum">       8 </span>                : struct TestAptRecord : AptTestEnvironment
-<span class="lineNum">       9 </span><span class="lineCov">              6 : {</span>
-<span class="lineNum">      10 </span>                :     record::Source recs;
-<span class="lineNum">      11 </span>                :     ept::Token t;
-<span class="lineNum">      12 </span>                : 
-<span class="lineNum">      13 </span><span class="lineCov">              6 :     TestAptRecord() : recs( db ) {</span>
-<span class="lineNum">      14 </span><span class="lineCov">              6 :         t._id = &quot;sp&quot;;</span>
-<span class="lineNum">      15 </span><span class="lineCov">              6 :     }</span>
-<span class="lineNum">      16 </span>                : 
-<span class="lineNum">      17 </span><span class="lineCov">              1 :     Test checkLookup() {</span>
-<span class="lineNum">      18 </span><span class="lineCov">              1 :         recs.get&lt; record::Record &gt;( t );</span>
-<span class="lineNum">      19 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      20 </span>                : 
-<span class="lineNum">      21 </span><span class="lineCov">              1 :     Test checkLookupValue() {</span>
-<span class="lineNum">      22 </span><span class="lineCov">              1 :         assert_eq( recs.get&lt; record::Name &gt;( t ), t.package() );</span>
-<span class="lineNum">      23 </span>                :         assert_eq( recs.get&lt; record::Maintainer &gt;( t ),
-<span class="lineNum">      24 </span><span class="lineCov">              2 :                    &quot;Neil Roeth &lt;neil@debian.org&gt;&quot; );</span>
-<span class="lineNum">      25 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      26 </span>                : 
-<span class="lineNum">      27 </span><span class="lineCov">              1 :     Test checkLookupNumeric() {</span>
-<span class="lineNum">      28 </span>                :         assert_eq( recs.get&lt; record::InstalledSize &gt;( t ),
-<span class="lineNum">      29 </span><span class="lineCov">              1 :                    600 );</span>
-<span class="lineNum">      30 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span><span class="lineCov">              1 :     Test checkShortDescription() {</span>
-<span class="lineNum">      33 </span>                :         assert_eq( recs.get&lt; record::ShortDescription &gt;( t ),
-<span class="lineNum">      34 </span><span class="lineCov">              1 :                    &quot;James Clark's SGML parsing tools&quot; );</span>
-<span class="lineNum">      35 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      36 </span>                : 
-<span class="lineNum">      37 </span>                :     template&lt; typename List &gt;
-<span class="lineNum">      38 </span><span class="lineCov">              1 :     void checkRecordNameList( List l ) {</span>
-<span class="lineNum">      39 </span><span class="lineCov">            437 :         while ( !l.empty() ) {</span>
-<span class="lineNum">      40 </span><span class="lineCov">            435 :             assert_eq( l.property(), l.token().package() );</span>
-<span class="lineNum">      41 </span><span class="lineCov">            435 :             l = l.tail();</span>
-<span class="lineNum">      42 </span>                :         }
-<span class="lineNum">      43 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      44 </span>                : 
-<span class="lineNum">      45 </span><span class="lineCov">              1 :     Test checkList() {</span>
-<span class="lineNum">      46 </span>                :         // there are 435 valid records in the list file
-<span class="lineNum">      47 </span>                :         assert_eq( list::count( recs.list&lt;
-<span class="lineNum">      48 </span><span class="lineCov">              1 :                                 record::Name &gt;() ), 435 );</span>
-<span class="lineNum">      49 </span><span class="lineCov">              1 :         checkRecordNameList( recs.list&lt; record::Name &gt;() );</span>
-<span class="lineNum">      50 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      51 </span>                : 
-<span class="lineNum">      52 </span><span class="lineCov">              1 :     Test nonexistent() {</span>
-<span class="lineNum">      53 </span>                :         assert_eq( recs.get&lt; record::ShortDescription &gt;(
-<span class="lineNum">      54 </span><span class="lineCov">              1 :                        ept::Token( &quot;nonexistent-package&quot; ) ), &quot;&quot; );</span>
-<span class="lineNum">      55 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      56 </span>                : };
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/core/apt/recordparser.cpp.gcov.html b/rep/ept/core/apt/recordparser.cpp.gcov.html
deleted file mode 100644
index de47e25..0000000
--- a/rep/ept/core/apt/recordparser.cpp.gcov.html
+++ /dev/null
@@ -1,239 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/core/apt/recordparser.cpp</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">ept/core/apt</a> - recordparser.cpp</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">62</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">95.2 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">59</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /** \file
-<span class="lineNum">       2 </span>                :  * Parser for APT records
-<span class="lineNum">       3 </span>                :  */
-<span class="lineNum">       4 </span>                : 
-<span class="lineNum">       5 </span>                : /*
-<span class="lineNum">       6 </span>                :  * Copyright (C) 2007  Enrico Zini &lt;enrico@enricozini.org&gt;
-<span class="lineNum">       7 </span>                :  *
-<span class="lineNum">       8 </span>                :  * This library is free software; you can redistribute it and/or
-<span class="lineNum">       9 </span>                :  * modify it under the terms of the GNU Lesser General Public
-<span class="lineNum">      10 </span>                :  * License as published by the Free Software Foundation; either
-<span class="lineNum">      11 </span>                :  * version 2.1 of the License, or (at your option) any later version.
-<span class="lineNum">      12 </span>                :  *
-<span class="lineNum">      13 </span>                :  * This library is distributed in the hope that it will be useful,
-<span class="lineNum">      14 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      15 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-<span class="lineNum">      16 </span>                :  * Lesser General Public License for more details.
-<span class="lineNum">      17 </span>                :  *
-<span class="lineNum">      18 </span>                :  * You should have received a copy of the GNU Lesser General Public
-<span class="lineNum">      19 </span>                :  * License along with this library; if not, write to the Free Software
-<span class="lineNum">      20 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
-<span class="lineNum">      21 </span>                :  */
-<span class="lineNum">      22 </span>                : 
-<span class="lineNum">      23 </span>                : #include &lt;ept/core/apt/recordparser.h&gt;
-<span class="lineNum">      24 </span>                : 
-<span class="lineNum">      25 </span>                : #include &lt;algorithm&gt;
-<span class="lineNum">      26 </span>                : #include &lt;cctype&gt;
-<span class="lineNum">      27 </span>                : 
-<span class="lineNum">      28 </span>                : //#include &lt;iostream&gt;
-<span class="lineNum">      29 </span>                : 
-<span class="lineNum">      30 </span>                : using namespace std;
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span>                : namespace ept {
-<span class="lineNum">      33 </span>                : namespace core {
-<span class="lineNum">      34 </span>                : namespace record {
-<span class="lineNum">      35 </span>                : 
-<span class="lineNum">      36 </span>                : struct rpcompare
-<span class="lineNum">      37 </span>                : {
-<span class="lineNum">      38 </span>                :         const RecordParser&amp; rp;
-<span class="lineNum">      39 </span><span class="lineCov">           1310 :         rpcompare(const RecordParser&amp; rp) : rp(rp) {}</span>
-<span class="lineNum">      40 </span><span class="lineCov">          89600 :         bool operator()(size_t a, size_t b)</span>
-<span class="lineNum">      41 </span>                :         {
-<span class="lineNum">      42 </span><span class="lineCov">          89600 :                 return rp.name(a) &lt; rp.name(b);</span>
-<span class="lineNum">      43 </span>                :         }
-<span class="lineNum">      44 </span>                : };
-<span class="lineNum">      45 </span>                : 
-<span class="lineNum">      46 </span><span class="lineCov">           1310 : void RecordParser::scan(const std::string&amp; str)</span>
-<span class="lineNum">      47 </span>                : {
-<span class="lineNum">      48 </span><span class="lineCov">           1310 :         buffer = str;</span>
-<span class="lineNum">      49 </span><span class="lineCov">           1310 :         ends.clear();</span>
-<span class="lineNum">      50 </span><span class="lineCov">           1310 :         sorted.clear();</span>
-<span class="lineNum">      51 </span>                : 
-<span class="lineNum">      52 </span>                :         //cerr &lt;&lt; &quot;PARSE &quot; &lt;&lt; endl &lt;&lt; buffer &lt;&lt; &quot;*****&quot; &lt;&lt; endl;
-<span class="lineNum">      53 </span>                : 
-<span class="lineNum">      54 </span>                :         // Scan the buffer, taking note of all ending offsets of the various fields
-<span class="lineNum">      55 </span><span class="lineCov">           1310 :         size_t pos = 0;</span>
-<span class="lineNum">      56 </span><span class="lineCov">           1310 :         size_t idx = 0;</span>
-<span class="lineNum">      57 </span><span class="lineCov">          29815 :         while (pos &lt; buffer.size() - 1)</span>
-<span class="lineNum">      58 </span>                :         {
-<span class="lineNum">      59 </span>                :                 //cerr &lt;&lt; &quot;PREPOS &quot; &lt;&lt; pos &lt;&lt; &quot; left: &quot; &lt;&lt; buffer.substr(pos, 10) &lt;&lt; endl;
-<span class="lineNum">      60 </span><span class="lineCov">          28505 :                 pos = buffer.find(&quot;\n&quot;, pos);</span>
-<span class="lineNum">      61 </span>                :                 //cerr &lt;&lt; &quot;POSTPOS &quot; &lt;&lt; pos &lt;&lt; &quot; left: &quot; &lt;&lt; (pos == string::npos ? &quot;NONE&quot; : buffer.substr(pos, 10)) &lt;&lt; endl;
-<span class="lineNum">      62 </span>                : 
-<span class="lineNum">      63 </span>                :                 // The buffer does not end with a newline
-<span class="lineNum">      64 </span><span class="lineCov">          28505 :                 if (pos == string::npos)</span>
-<span class="lineNum">      65 </span>                :                 {
-<span class="lineNum">      66 </span>                :                         //cerr &lt;&lt; &quot;ENDNOTEOL&quot; &lt;&lt; endl;
-<span class="lineNum">      67 </span><span class="lineCov">              1 :                         pos = buffer.size();</span>
-<span class="lineNum">      68 </span><span class="lineCov">              1 :                         ends.push_back(pos);</span>
-<span class="lineNum">      69 </span><span class="lineCov">              1 :                         sorted.push_back(idx++);</span>
-<span class="lineNum">      70 </span><span class="lineCov">              1 :                         break;</span>
-<span class="lineNum">      71 </span>                :                 }
-<span class="lineNum">      72 </span>                : 
-<span class="lineNum">      73 </span><span class="lineCov">          28504 :                 ++pos;</span>
-<span class="lineNum">      74 </span>                :                 //cerr &lt;&lt; &quot;POSTPOSINC &quot; &lt;&lt; pos &lt;&lt; &quot; left: &quot; &lt;&lt; buffer.substr(pos, 10) &lt;&lt; endl;
-<span class="lineNum">      75 </span>                : 
-<span class="lineNum">      76 </span>                :                 // The buffer ends with a newline
-<span class="lineNum">      77 </span><span class="lineCov">          28504 :                 if (pos == buffer.size())</span>
-<span class="lineNum">      78 </span>                :                 {
-<span class="lineNum">      79 </span>                :                         //cerr &lt;&lt; &quot;ENDEOL&quot; &lt;&lt; endl;
-<span class="lineNum">      80 </span><span class="lineCov">           1309 :                         ends.push_back(pos);</span>
-<span class="lineNum">      81 </span><span class="lineCov">           1309 :                         sorted.push_back(idx++);</span>
-<span class="lineNum">      82 </span><span class="lineCov">           1309 :                         break;</span>
-<span class="lineNum">      83 </span>                :                 }
-<span class="lineNum">      84 </span>                : 
-<span class="lineNum">      85 </span>                :                 // Terminate parsing on double newlines
-<span class="lineNum">      86 </span><span class="lineCov">          27195 :                 if (buffer[pos] == '\n')</span>
-<span class="lineNum">      87 </span>                :                 {
-<span class="lineNum">      88 </span>                :                         //cerr &lt;&lt; &quot;ENDDOUBLENL&quot; &lt;&lt; endl;
-<span class="lineNum">      89 </span><span class="lineNoCov">              0 :                         ends.push_back(pos);</span>
-<span class="lineNum">      90 </span><span class="lineNoCov">              0 :                         sorted.push_back(idx++);</span>
-<span class="lineNum">      91 </span><span class="lineNoCov">              0 :                         break;</span>
-<span class="lineNum">      92 </span>                :                 }
-<span class="lineNum">      93 </span>                : 
-<span class="lineNum">      94 </span>                :                 // Mark the end of the field if it's not a continuation line
-<span class="lineNum">      95 </span><span class="lineCov">          27195 :                 if (!isspace(buffer[pos]))</span>
-<span class="lineNum">      96 </span>                :                 {
-<span class="lineNum">      97 </span>                :                         //cerr &lt;&lt; &quot;INNERFIELD&quot; &lt;&lt; endl;
-<span class="lineNum">      98 </span><span class="lineCov">          17224 :                         ends.push_back(pos);</span>
-<span class="lineNum">      99 </span><span class="lineCov">          17224 :                         sorted.push_back(idx++);</span>
-<span class="lineNum">     100 </span>                :                 } //else
-<span class="lineNum">     101 </span>                :                         //cerr &lt;&lt; &quot;CONTLINE&quot; &lt;&lt; endl;
-<span class="lineNum">     102 </span>                :         }
-<span class="lineNum">     103 </span>                : 
-<span class="lineNum">     104 </span>                :         // Sort the sorted array
-<span class="lineNum">     105 </span><span class="lineCov">           1310 :         sort(sorted.begin(), sorted.end(), rpcompare(*this));</span>
-<span class="lineNum">     106 </span>                : 
-<span class="lineNum">     107 </span>                :         //for (size_t i = 0; i &lt; ends.size(); ++i)
-<span class="lineNum">     108 </span>                :         //      cerr &lt;&lt; ends[i] &lt;&lt; &quot;\t&quot; &lt;&lt; name(i) &lt;&lt; &quot;\t&quot; &lt;&lt; sorted[i] &lt;&lt; &quot;\t&quot; &lt;&lt; name(sorted[i]) &lt;&lt; endl;
-<span class="lineNum">     109 </span><span class="lineCov">           1310 : }</span>
-<span class="lineNum">     110 </span>                : 
-<span class="lineNum">     111 </span><span class="lineCov">         187124 : std::string RecordParser::field(size_t idx) const</span>
-<span class="lineNum">     112 </span>                : {
-<span class="lineNum">     113 </span><span class="lineCov">         187124 :         if (idx &gt;= ends.size())</span>
-<span class="lineNum">     114 </span><span class="lineCov">              1 :                 return string();</span>
-<span class="lineNum">     115 </span><span class="lineCov">         187123 :         if (idx == 0)</span>
-<span class="lineNum">     116 </span><span class="lineCov">          16577 :                 return buffer.substr(0, ends[0]);</span>
-<span class="lineNum">     117 </span>                :         else
-<span class="lineNum">     118 </span><span class="lineCov">         170546 :                 return buffer.substr(ends[idx-1], ends[idx]-ends[idx-1]);</span>
-<span class="lineNum">     119 </span>                : }
-<span class="lineNum">     120 </span>                : 
-<span class="lineNum">     121 </span><span class="lineCov">         185814 : std::string RecordParser::name(size_t idx) const</span>
-<span class="lineNum">     122 </span>                : {
-<span class="lineNum">     123 </span><span class="lineCov">         185814 :         string res = field(idx);</span>
-<span class="lineNum">     124 </span><span class="lineCov">         185814 :         size_t pos = res.find(&quot;:&quot;);</span>
-<span class="lineNum">     125 </span><span class="lineCov">         185814 :         if (pos == string::npos)</span>
-<span class="lineNum">     126 </span><span class="lineCov">              2 :                 return res;</span>
-<span class="lineNum">     127 </span><span class="lineCov">         185812 :         return res.substr(0, pos);</span>
-<span class="lineNum">     128 </span>                : }
-<span class="lineNum">     129 </span>                : 
-<span class="lineNum">     130 </span><span class="lineCov">           1310 : std::string RecordParser::lookup(size_t idx) const</span>
-<span class="lineNum">     131 </span>                : {
-<span class="lineNum">     132 </span><span class="lineCov">           1310 :         string res = field(idx);</span>
-<span class="lineNum">     133 </span><span class="lineCov">           1310 :         size_t pos = res.find(&quot;:&quot;);</span>
-<span class="lineNum">     134 </span><span class="lineCov">           1310 :         if (pos == string::npos)</span>
-<span class="lineNum">     135 </span><span class="lineCov">              1 :                 return res;</span>
-<span class="lineNum">     136 </span>                :         // Skip initial whitespace after the :
-<span class="lineNum">     137 </span><span class="lineCov">           1309 :         for (++pos; pos &lt; res.size() &amp;&amp; isspace(res[pos]); ++pos)</span>
-<span class="lineNum">     138 </span>                :                 ;
-<span class="lineNum">     139 </span><span class="lineCov">           1309 :         res = res.substr(pos);</span>
-<span class="lineNum">     140 </span>                :         // Trim spaces at the end
-<span class="lineNum">     141 </span><span class="lineCov">           3927 :         while (!res.empty() &amp;&amp; isspace(res[res.size() - 1]))</span>
-<span class="lineNum">     142 </span><span class="lineCov">           1309 :                 res.resize(res.size() - 1);</span>
-<span class="lineNum">     143 </span><span class="lineCov">           1309 :         return res;</span>
-<span class="lineNum">     144 </span>                : }
-<span class="lineNum">     145 </span>                : 
-<span class="lineNum">     146 </span><span class="lineCov">           1310 : size_t RecordParser::index(const std::string&amp; str) const</span>
-<span class="lineNum">     147 </span>                : {
-<span class="lineNum">     148 </span>                :         int begin, end;
-<span class="lineNum">     149 </span>                : 
-<span class="lineNum">     150 </span>                :         /* Binary search */
-<span class="lineNum">     151 </span><span class="lineCov">           1310 :         begin = -1, end = size();</span>
-<span class="lineNum">     152 </span><span class="lineCov">           7924 :         while (end - begin &gt; 1)</span>
-<span class="lineNum">     153 </span>                :         {
-<span class="lineNum">     154 </span><span class="lineCov">           5304 :                 int cur = (end + begin) / 2;</span>
-<span class="lineNum">     155 </span>                :                 //cerr &lt;&lt; &quot;Test &quot; &lt;&lt; cur &lt;&lt; &quot; &quot; &lt;&lt; str &lt;&lt; &quot; &lt; &quot; &lt;&lt; name(cur) &lt;&lt; endl;
-<span class="lineNum">     156 </span><span class="lineCov">           5304 :                 if (name(sorted[cur]) &gt; str)</span>
-<span class="lineNum">     157 </span><span class="lineCov">           1724 :                         end = cur;</span>
-<span class="lineNum">     158 </span>                :                 else
-<span class="lineNum">     159 </span><span class="lineCov">           3580 :                         begin = cur;</span>
-<span class="lineNum">     160 </span>                :         }
-<span class="lineNum">     161 </span>                : 
-<span class="lineNum">     162 </span><span class="lineCov">           1310 :         if (begin == -1 || name(sorted[begin]) != str)</span>
-<span class="lineNum">     163 </span><span class="lineCov">              1 :                 return size();</span>
-<span class="lineNum">     164 </span>                :         else
-<span class="lineNum">     165 </span><span class="lineCov">           1309 :                 return sorted[begin];</span>
-<span class="lineNum">     166 </span>                : }
-<span class="lineNum">     167 </span>                : 
-<span class="lineNum">     168 </span>                : }
-<span class="lineNum">     169 </span>                : }
-<span class="lineNum">     170 </span>                : }
-<span class="lineNum">     171 </span>                : 
-<span class="lineNum">     172 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/core/apt/recordparser.h.gcov.html b/rep/ept/core/apt/recordparser.h.gcov.html
deleted file mode 100644
index 13eb803..0000000
--- a/rep/ept/core/apt/recordparser.h.gcov.html
+++ /dev/null
@@ -1,165 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/core/apt/recordparser.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">ept/core/apt</a> - recordparser.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">4</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">4</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- C++ -*-
-<span class="lineNum">       2 </span>                : #ifndef EPT_CORE_APT_RECORDPARSER_H
-<span class="lineNum">       3 </span>                : #define EPT_CORE_APT_RECORDPARSER_H
-<span class="lineNum">       4 </span>                : 
-<span class="lineNum">       5 </span>                : /** \file
-<span class="lineNum">       6 </span>                :  * Parser for APT records
-<span class="lineNum">       7 </span>                :  */
-<span class="lineNum">       8 </span>                : 
-<span class="lineNum">       9 </span>                : /*
-<span class="lineNum">      10 </span>                :  * Copyright (C) 2007  Enrico Zini &lt;enrico@enricozini.org&gt;
-<span class="lineNum">      11 </span>                :  *
-<span class="lineNum">      12 </span>                :  * This library is free software; you can redistribute it and/or
-<span class="lineNum">      13 </span>                :  * modify it under the terms of the GNU Lesser General Public
-<span class="lineNum">      14 </span>                :  * License as published by the Free Software Foundation; either
-<span class="lineNum">      15 </span>                :  * version 2.1 of the License, or (at your option) any later version.
-<span class="lineNum">      16 </span>                :  *
-<span class="lineNum">      17 </span>                :  * This library is distributed in the hope that it will be useful,
-<span class="lineNum">      18 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      19 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-<span class="lineNum">      20 </span>                :  * Lesser General Public License for more details.
-<span class="lineNum">      21 </span>                :  *
-<span class="lineNum">      22 </span>                :  * You should have received a copy of the GNU Lesser General Public
-<span class="lineNum">      23 </span>                :  * License along with this library; if not, write to the Free Software
-<span class="lineNum">      24 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
-<span class="lineNum">      25 </span>                :  */
-<span class="lineNum">      26 </span>                : 
-<span class="lineNum">      27 </span>                : #include &lt;vector&gt;
-<span class="lineNum">      28 </span>                : #include &lt;string&gt;
-<span class="lineNum">      29 </span>                : 
-<span class="lineNum">      30 </span>                : namespace ept {
-<span class="lineNum">      31 </span>                : namespace core {
-<span class="lineNum">      32 </span>                : namespace record {
-<span class="lineNum">      33 </span>                : 
-<span class="lineNum">      34 </span>                : /**
-<span class="lineNum">      35 </span>                :  * Access the fields of a package record contained inside a std::string.
-<span class="lineNum">      36 </span>                :  *
-<span class="lineNum">      37 </span>                :  * Implementation note: this implementation should take advantage of
-<span class="lineNum">      38 </span>                :  * std::string sharing buffer space among them.
-<span class="lineNum">      39 </span>                :  */
-<span class="lineNum">      40 </span>                : class RecordParser
-<span class="lineNum">      41 </span><span class="lineCov">           1310 : {</span>
-<span class="lineNum">      42 </span>                :         /// Buffer containing the whole record
-<span class="lineNum">      43 </span>                :         std::string buffer;
-<span class="lineNum">      44 </span>                : 
-<span class="lineNum">      45 </span>                :         /// End offsets of the various fields in the record
-<span class="lineNum">      46 </span>                :         std::vector&lt;size_t&gt; ends;
-<span class="lineNum">      47 </span>                : 
-<span class="lineNum">      48 </span>                :         /// Indexes on the ends vector, sorted by field name
-<span class="lineNum">      49 </span>                :         std::vector&lt;size_t&gt; sorted;
-<span class="lineNum">      50 </span>                : 
-<span class="lineNum">      51 </span>                : public:
-<span class="lineNum">      52 </span>                :         RecordParser() {}
-<span class="lineNum">      53 </span><span class="lineCov">           1310 :         RecordParser(const std::string&amp; str) { scan(str); }</span>
-<span class="lineNum">      54 </span>                : 
-<span class="lineNum">      55 </span>                :         /// Index a new record
-<span class="lineNum">      56 </span>                :         void scan(const std::string&amp; str);
-<span class="lineNum">      57 </span>                : 
-<span class="lineNum">      58 </span>                :         /**
-<span class="lineNum">      59 </span>                :          * Get the index of the field with the given name.
-<span class="lineNum">      60 </span>                :          *
-<span class="lineNum">      61 </span>                :          * size() is returned if not found
-<span class="lineNum">      62 </span>                :          */
-<span class="lineNum">      63 </span>                :         size_t index(const std::string&amp; str) const;
-<span class="lineNum">      64 </span>                : 
-<span class="lineNum">      65 </span>                :         /// Return the field by its index
-<span class="lineNum">      66 </span>                :         std::string field(size_t idx) const;
-<span class="lineNum">      67 </span>                : 
-<span class="lineNum">      68 </span>                :         /// Return the name of a field by its index
-<span class="lineNum">      69 </span>                :         std::string name(size_t idx) const;
-<span class="lineNum">      70 </span>                : 
-<span class="lineNum">      71 </span>                :         /// Return the content of a field by its index
-<span class="lineNum">      72 </span>                :         std::string lookup(size_t idx) const;
-<span class="lineNum">      73 </span>                : 
-<span class="lineNum">      74 </span>                :         /// Return the content of a field by its name
-<span class="lineNum">      75 </span><span class="lineCov">           1310 :         std::string lookup(const std::string&amp; name) const { return lookup(index(name)); }</span>
-<span class="lineNum">      76 </span>                : 
-<span class="lineNum">      77 </span>                :         /// Return the content of a field by its index
-<span class="lineNum">      78 </span>                :         std::string operator[](size_t idx) const { return lookup(idx); }
-<span class="lineNum">      79 </span>                : 
-<span class="lineNum">      80 </span>                :         /// Return the content of a field by its name
-<span class="lineNum">      81 </span>                :         std::string operator[](const std::string&amp; name) const { return lookup(name); }
-<span class="lineNum">      82 </span>                : 
-<span class="lineNum">      83 </span>                :         /// Return the entire record
-<span class="lineNum">      84 </span>                :         const std::string&amp; record() const { return buffer; }
-<span class="lineNum">      85 </span>                : 
-<span class="lineNum">      86 </span>                :         /// Return the entire record
-<span class="lineNum">      87 </span>                :         std::string record() { return buffer; }
-<span class="lineNum">      88 </span>                : 
-<span class="lineNum">      89 </span>                :         /// Return the number of fields in the record
-<span class="lineNum">      90 </span><span class="lineCov">           1311 :         size_t size() const { return ends.size(); }</span>
-<span class="lineNum">      91 </span>                : };
-<span class="lineNum">      92 </span>                : 
-<span class="lineNum">      93 </span>                : }
-<span class="lineNum">      94 </span>                : }
-<span class="lineNum">      95 </span>                : }
-<span class="lineNum">      96 </span>                : 
-<span class="lineNum">      97 </span>                : // vim:set ts=4 sw=4:
-<span class="lineNum">      98 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/core/apt/version.h.gcov.html b/rep/ept/core/apt/version.h.gcov.html
deleted file mode 100644
index b17fdfb..0000000
--- a/rep/ept/core/apt/version.h.gcov.html
+++ /dev/null
@@ -1,160 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/core/apt/version.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">ept/core/apt</a> - version.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">32</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">93.8 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">30</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- C++ -*-
-<span class="lineNum">       2 </span>                : #ifndef EPT_CORE_APT_VERSION_H
-<span class="lineNum">       3 </span>                : #define EPT_CORE_APT_VERSION_H
-<span class="lineNum">       4 </span>                : 
-<span class="lineNum">       5 </span>                : namespace ept {
-<span class="lineNum">       6 </span>                : namespace core {
-<span class="lineNum">       7 </span>                : namespace version {
-<span class="lineNum">       8 </span>                : 
-<span class="lineNum">       9 </span><span class="lineCov">           3616 : struct InternalList {</span>
-<span class="lineNum">      10 </span>                :     package::Internal m_pkg;
-<span class="lineNum">      11 </span>                :     Internal m_ver;
-<span class="lineNum">      12 </span>                : 
-<span class="lineNum">      13 </span>                :     typedef Internal Type;
-<span class="lineNum">      14 </span>                : 
-<span class="lineNum">      15 </span><span class="lineCov">           3616 :     InternalList tail() const {</span>
-<span class="lineNum">      16 </span><span class="lineCov">           3616 :         InternalList t = *this;</span>
-<span class="lineNum">      17 </span><span class="lineCov">           3616 :         t.m_ver ++;</span>
-<span class="lineNum">      18 </span><span class="lineCov">           3616 :         t.seek();</span>
-<span class="lineNum">      19 </span>                :         return t;
-<span class="lineNum">      20 </span>                :     }
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span><span class="lineCov">           5424 :     const Internal head() const {</span>
-<span class="lineNum">      23 </span><span class="lineCov">           5424 :         return m_ver;</span>
-<span class="lineNum">      24 </span>                :     }
-<span class="lineNum">      25 </span>                : 
-<span class="lineNum">      26 </span>                :     Internal head() {
-<span class="lineNum">      27 </span>                :         return m_ver;
-<span class="lineNum">      28 </span>                :     }
-<span class="lineNum">      29 </span>                : 
-<span class="lineNum">      30 </span><span class="lineCov">           3618 :     bool empty() const {</span>
-<span class="lineNum">      31 </span><span class="lineCov">           3618 :         return m_pkg.end();</span>
-<span class="lineNum">      32 </span>                :     }
-<span class="lineNum">      33 </span>                : 
-<span class="lineNum">      34 </span><span class="lineCov">           3618 :     void seek()</span>
-<span class="lineNum">      35 </span>                :     {
-<span class="lineNum">      36 </span><span class="lineCov">          14790 :         while ( m_ver.end() &amp;&amp; !m_pkg.end() ) {</span>
-<span class="lineNum">      37 </span><span class="lineCov">           7554 :             m_pkg ++;</span>
-<span class="lineNum">      38 </span><span class="lineCov">           7554 :             m_ver = m_pkg.VersionList();</span>
-<span class="lineNum">      39 </span>                :         }
-<span class="lineNum">      40 </span><span class="lineCov">           3618 :     }</span>
-<span class="lineNum">      41 </span>                : 
-<span class="lineNum">      42 </span><span class="lineCov">              2 :     InternalList( package::Internal i )</span>
-<span class="lineNum">      43 </span><span class="lineCov">              2 :         : m_pkg( i )</span>
-<span class="lineNum">      44 </span>                :     {
-<span class="lineNum">      45 </span><span class="lineCov">              2 :         m_ver = m_pkg.VersionList();</span>
-<span class="lineNum">      46 </span><span class="lineCov">              2 :         seek();</span>
-<span class="lineNum">      47 </span><span class="lineCov">              2 :     }</span>
-<span class="lineNum">      48 </span>                : };
-<span class="lineNum">      49 </span>                : 
-<span class="lineNum">      50 </span>                : struct Setup {
-<span class="lineNum">      51 </span>                :     typedef ept::Token Token;
-<span class="lineNum">      52 </span>                :     typedef version::Internal Internal;
-<span class="lineNum">      53 </span>                :     typedef version::PropertyId PropertyId;
-<span class="lineNum">      54 </span>                :     typedef version::InternalList InternalList;
-<span class="lineNum">      55 </span>                : };
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span>                : struct Source : core::Source&lt; Source, Setup, PropertyType &gt;
-<span class="lineNum">      58 </span><span class="lineCov">             12 : {</span>
-<span class="lineNum">      59 </span>                :     AptDatabase &amp;m_db;
-<span class="lineNum">      60 </span><span class="lineCov">             12 :     Source( AptDatabase &amp;db ) : m_db( db ) {}</span>
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span><span class="lineCov">              2 :     InternalList listInternal() {</span>
-<span class="lineNum">      63 </span><span class="lineCov">              2 :         return InternalList( m_db.cache().PkgBegin() );</span>
-<span class="lineNum">      64 </span>                :     }
-<span class="lineNum">      65 </span>                : 
-<span class="lineNum">      66 </span><span class="lineCov">           1808 :     Token getToken( Internal i ) {</span>
-<span class="lineNum">      67 </span><span class="lineCov">           1808 :         Token t;</span>
-<span class="lineNum">      68 </span><span class="lineCov">           1808 :         t._id = std::string( i.ParentPkg().Name() ) + &quot;_&quot; + i.VerStr();</span>
-<span class="lineNum">      69 </span><span class="lineNoCov">              0 :         return t;</span>
-<span class="lineNum">      70 </span>                :     }
-<span class="lineNum">      71 </span>                : 
-<span class="lineNum">      72 </span>                :     Internal lookupToken( Token t ) {
-<span class="lineNum">      73 </span>                :         return m_db.lookupVersion( t );
-<span class="lineNum">      74 </span>                :     }
-<span class="lineNum">      75 </span>                : 
-<span class="lineNum">      76 </span>                :     template&lt; PropertyId p &gt;
-<span class="lineNum">      77 </span>                :     typename PropertyType&lt; p &gt;::T getInternal( Internal );
-<span class="lineNum">      78 </span>                : };
-<span class="lineNum">      79 </span>                : 
-<span class="lineNum">      80 </span>                : template&lt;&gt; struct PropertyType&lt; Package &gt; { typedef Token T; };
-<span class="lineNum">      81 </span>                : 
-<span class="lineNum">      82 </span><span class="lineCov">           3616 : template&lt;&gt; inline Token Source::getInternal&lt; Package &gt;( Internal i ) {</span>
-<span class="lineNum">      83 </span><span class="lineCov">           3616 :     assert( !i.end() );</span>
-<span class="lineNum">      84 </span><span class="lineCov">           3616 :     Token t;</span>
-<span class="lineNum">      85 </span><span class="lineCov">           7232 :     t._id = i.ParentPkg().Name();</span>
-<span class="lineNum">      86 </span><span class="lineNoCov">              0 :     return t;</span>
-<span class="lineNum">      87 </span>                : }
-<span class="lineNum">      88 </span>                : 
-<span class="lineNum">      89 </span>                : }
-<span class="lineNum">      90 </span>                : }
-<span class="lineNum">      91 </span>                : }
-<span class="lineNum">      92 </span>                : 
-<span class="lineNum">      93 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/core/desktop.h.gcov.html b/rep/ept/core/desktop.h.gcov.html
deleted file mode 100644
index 27d0be3..0000000
--- a/rep/ept/core/desktop.h.gcov.html
+++ /dev/null
@@ -1,344 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/core/desktop.h</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/core</a> - desktop.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">103</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">94.2 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">97</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /// -*- C++ -*- (c) 2006, 2007 Petr Rockai &lt;me@mornfall.net&gt;
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : #include &lt;wibble/string.h&gt;
-<span class="lineNum">       4 </span>                : 
-<span class="lineNum">       5 </span>                : #include &lt;ept/token.h&gt;
-<span class="lineNum">       6 </span>                : #include &lt;ept/core/desktopfile.h&gt;
-<span class="lineNum">       7 </span>                : #include &lt;ept/core/source.h&gt;
-<span class="lineNum">       8 </span>                : 
-<span class="lineNum">       9 </span>                : #include &lt;set&gt;
-<span class="lineNum">      10 </span>                : #include &lt;vector&gt;
-<span class="lineNum">      11 </span>                : #include &lt;fstream&gt;
-<span class="lineNum">      12 </span>                : #include &lt;sstream&gt;
-<span class="lineNum">      13 </span>                : #include &lt;iterator&gt;
-<span class="lineNum">      14 </span>                : #include &lt;functional&gt;
-<span class="lineNum">      15 </span>                : 
-<span class="lineNum">      16 </span>                : #include &lt;dirent.h&gt;
-<span class="lineNum">      17 </span>                : 
-<span class="lineNum">      18 </span>                : #ifndef EPT_CORE_DESKTOP_H
-<span class="lineNum">      19 </span>                : #define EPT_CORE_DESKTOP_H
-<span class="lineNum">      20 </span>                : 
-<span class="lineNum">      21 </span>                : namespace ept {
-<span class="lineNum">      22 </span>                : namespace core {
-<span class="lineNum">      23 </span>                : namespace desktop {
-<span class="lineNum">      24 </span>                : 
-<span class="lineNum">      25 </span>                : typedef enum { Name, Group, ShortDescription, Package, Icon } PropertyId;
-<span class="lineNum">      26 </span>                : 
-<span class="lineNum">      27 </span>                : template&lt; PropertyId &gt; struct PropertyType {};
-<span class="lineNum">      28 </span>                : template&lt;&gt; struct PropertyType&lt; Name &gt; { typedef std::string T; };
-<span class="lineNum">      29 </span>                : template&lt;&gt; struct PropertyType&lt; Group &gt; { typedef std::string T; };
-<span class="lineNum">      30 </span>                : template&lt;&gt; struct PropertyType&lt; ShortDescription &gt; { typedef std::string T; };
-<span class="lineNum">      31 </span>                : template&lt;&gt; struct PropertyType&lt; Package &gt; { typedef ept::Token T; };
-<span class="lineNum">      32 </span>                : template&lt;&gt; struct PropertyType&lt; Icon &gt; { typedef std::string T; };
-<span class="lineNum">      33 </span>                : 
-<span class="lineNum">      34 </span>                : typedef std::set&lt; std::string &gt; Categories;
-<span class="lineNum">      35 </span>                : 
-<span class="lineNum">      36 </span><span class="lineCov">             64 : struct Category {</span>
-<span class="lineNum">      37 </span>                :     std::string name;
-<span class="lineNum">      38 </span><span class="lineCov">            112 :     operator std::string() const { return name; }</span>
-<span class="lineNum">      39 </span>                : };
-<span class="lineNum">      40 </span>                : 
-<span class="lineNum">      41 </span><span class="lineCov">             80 : inline std::istream &amp;operator &gt;&gt;( std::istream &amp;i, Category &amp;cat ) {</span>
-<span class="lineNum">      42 </span>                :     char c;
-<span class="lineNum">      43 </span><span class="lineCov">             80 :     cat.name = &quot;&quot;;</span>
-<span class="lineNum">      44 </span><span class="lineCov">            468 :     while ( i.peek() != EOF ) {</span>
-<span class="lineNum">      45 </span><span class="lineCov">            356 :         c = i.get();</span>
-<span class="lineNum">      46 </span><span class="lineCov">            356 :         if ( c == ';' ) return i;</span>
-<span class="lineNum">      47 </span><span class="lineCov">            308 :         cat.name += c;</span>
-<span class="lineNum">      48 </span>                :     }
-<span class="lineNum">      49 </span><span class="lineCov">             32 :     return i;</span>
-<span class="lineNum">      50 </span>                : }
-<span class="lineNum">      51 </span>                : 
-<span class="lineNum">      52 </span><span class="lineCov">            567 : struct Entry : wibble::mixin::Comparable&lt; Entry &gt; {</span>
-<span class="lineNum">      53 </span><span class="lineCov">             18 :     Entry() {}</span>
-<span class="lineNum">      54 </span>                :     Entry( std::string n, std::string g,
-<span class="lineNum">      55 </span>                :            std::string p, std::string d , std::string i )
-<span class="lineNum">      56 </span>                :         : m_name( n ),
-<span class="lineNum">      57 </span>                :           m_package( p ),
-<span class="lineNum">      58 </span>                :           m_description( d ),
-<span class="lineNum">      59 </span>                :           m_icon( i )
-<span class="lineNum">      60 </span>                :     { setCategories( g ); }
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span><span class="lineCov">             16 :     void load( std::string file ) {</span>
-<span class="lineNum">      63 </span><span class="lineCov">             16 :         m_id = file;</span>
-<span class="lineNum">      64 </span><span class="lineCov">             16 :         std::ifstream i( file.c_str() );</span>
-<span class="lineNum">      65 </span><span class="lineCov">             16 :         if ( !i.is_open() )</span>
-<span class="lineNum">      66 </span><span class="lineNoCov">              0 :             return; // throw?</span>
-<span class="lineNum">      67 </span><span class="lineCov">             16 :         desktop::File e;</span>
-<span class="lineNum">      68 </span><span class="lineCov">             16 :         i &gt;&gt; e;</span>
-<span class="lineNum">      69 </span><span class="lineCov">             16 :         i.close();</span>
-<span class="lineNum">      70 </span><span class="lineCov">             16 :         desktop::File::Group &amp;g = e.group( &quot;Desktop Entry&quot; );</span>
-<span class="lineNum">      71 </span><span class="lineCov">             32 :         m_name = g.entry( &quot;Name&quot; ).value;</span>
-<span class="lineNum">      72 </span><span class="lineCov">             32 :         m_description = g.entry( &quot;Comment&quot; ).value;</span>
-<span class="lineNum">      73 </span><span class="lineCov">             32 :         if ( m_description == &quot;&quot; )</span>
-<span class="lineNum">      74 </span><span class="lineCov">              8 :             m_description = g.entry( &quot;GenericName&quot; ).value;</span>
-<span class="lineNum">      75 </span><span class="lineCov">             16 :         m_package = g.entry( &quot;X-AppInstall-Package&quot; ).value;</span>
-<span class="lineNum">      76 </span>                :         // m_group = g.entry( &quot;Categories&quot; ).value;
-<span class="lineNum">      77 </span><span class="lineCov">             32 :         m_icon = g.entry( &quot;Icon&quot; ).value;</span>
-<span class="lineNum">      78 </span><span class="lineCov">             32 :         setCategories( g.entry( &quot;Categories&quot; ).value );</span>
-<span class="lineNum">      79 </span>                :     }
-<span class="lineNum">      80 </span>                : 
-<span class="lineNum">      81 </span><span class="lineCov">             16 :     void setCategories( std::string s ) {</span>
-<span class="lineNum">      82 </span><span class="lineCov">             16 :         std::istringstream i( s );</span>
-<span class="lineNum">      83 </span><span class="lineCov">             16 :         m_categories.clear();</span>
-<span class="lineNum">      84 </span>                :         std::remove_copy_if(
-<span class="lineNum">      85 </span>                :             std::istream_iterator&lt; Category &gt;( i ),
-<span class="lineNum">      86 </span>                :             std::istream_iterator&lt; Category &gt;(),
-<span class="lineNum">      87 </span>                :             std::inserter( m_categories, m_categories.begin() ),
-<span class="lineNum">      88 </span><span class="lineCov">             16 :             std::bind1st( std::equal_to&lt; std::string &gt;(), &quot;&quot; ) );</span>
-<span class="lineNum">      89 </span><span class="lineCov">             16 :     }</span>
-<span class="lineNum">      90 </span>                : 
-<span class="lineNum">      91 </span><span class="lineCov">             16 :     Categories categories() const { return m_categories; }</span>
-<span class="lineNum">      92 </span>                :     bool inCategory( std::string c ) const {
-<span class="lineNum">      93 </span>                :         return m_categories.find( c ) != m_categories.end();
-<span class="lineNum">      94 </span>                :     }
-<span class="lineNum">      95 </span><span class="lineCov">             34 :     std::string id() const { return m_id; }</span>
-<span class="lineNum">      96 </span><span class="lineCov">              6 :     std::string name() const { return m_name; }</span>
-<span class="lineNum">      97 </span>                :     std::string package() const { return m_package; }
-<span class="lineNum">      98 </span>                :     std::string description() const { return m_description; }
-<span class="lineNum">      99 </span>                :     std::string icon() const { return m_icon; }
-<span class="lineNum">     100 </span>                :     bool operator&lt; ( const Entry &amp;o ) const {
-<span class="lineNum">     101 </span>                :         if ( m_name &lt; o.m_name ) return true;
-<span class="lineNum">     102 </span>                :         if ( m_name == o.m_name )
-<span class="lineNum">     103 </span>                :             if ( m_package &lt; o.m_package ) return true;
-<span class="lineNum">     104 </span>                :         return false;
-<span class="lineNum">     105 </span>                :     }
-<span class="lineNum">     106 </span>                : protected:
-<span class="lineNum">     107 </span>                :     std::string m_name, m_package, m_description, m_icon, m_id;
-<span class="lineNum">     108 </span>                :     bool m_supported, m_free;
-<span class="lineNum">     109 </span>                :     Categories m_categories;
-<span class="lineNum">     110 </span>                : };
-<span class="lineNum">     111 </span>                : 
-<span class="lineNum">     112 </span><span class="lineCov">            450 : struct InternalList {</span>
-<span class="lineNum">     113 </span>                :     std::string dir;
-<span class="lineNum">     114 </span>                :     std::string current;
-<span class="lineNum">     115 </span>                :     mutable Entry entry;
-<span class="lineNum">     116 </span>                :     off_t offset;
-<span class="lineNum">     117 </span>                :     mutable bool loaded;
-<span class="lineNum">     118 </span>                : 
-<span class="lineNum">     119 </span><span class="lineCov">              9 :     InternalList() : dir( &quot;&quot; ), offset( -2 ), loaded( false ) {}</span>
-<span class="lineNum">     120 </span><span class="lineCov">              4 :     InternalList( std::string d ) : dir( d ), offset( -1 ), loaded( false )</span>
-<span class="lineNum">     121 </span>                :     {
-<span class="lineNum">     122 </span><span class="lineCov">              4 :         firstFile();</span>
-<span class="lineNum">     123 </span><span class="lineCov">              4 :     }</span>
-<span class="lineNum">     124 </span>                : 
-<span class="lineNum">     125 </span><span class="lineCov">             56 :     Entry head() const {</span>
-<span class="lineNum">     126 </span><span class="lineCov">             56 :         if (!loaded)</span>
-<span class="lineNum">     127 </span><span class="lineCov">             16 :             entry.load( current );</span>
-<span class="lineNum">     128 </span><span class="lineCov">             56 :         loaded = true;</span>
-<span class="lineNum">     129 </span><span class="lineCov">             56 :         return entry;</span>
-<span class="lineNum">     130 </span>                :     }
-<span class="lineNum">     131 </span>                : 
-<span class="lineNum">     132 </span><span class="lineCov">             33 :     bool empty() const {</span>
-<span class="lineNum">     133 </span><span class="lineCov">             33 :         return (offset == -2);</span>
-<span class="lineNum">     134 </span>                :     }
-<span class="lineNum">     135 </span>                : 
-<span class="lineNum">     136 </span><span class="lineCov">              4 :     void firstFile() {</span>
-<span class="lineNum">     137 </span><span class="lineCov">              4 :         offset = -1;</span>
-<span class="lineNum">     138 </span><span class="lineCov">              4 :         nextFile();</span>
-<span class="lineNum">     139 </span><span class="lineCov">              4 :     }</span>
-<span class="lineNum">     140 </span>                : 
-<span class="lineNum">     141 </span><span class="lineCov">             16 :     InternalList tail() const {</span>
-<span class="lineNum">     142 </span><span class="lineCov">             16 :         InternalList r = *this;</span>
-<span class="lineNum">     143 </span><span class="lineCov">             16 :         r.nextFile();</span>
-<span class="lineNum">     144 </span><span class="lineNoCov">              0 :         return r;</span>
-<span class="lineNum">     145 </span>                :     }
-<span class="lineNum">     146 </span>                : 
-<span class="lineNum">     147 </span><span class="lineCov">             20 :     void nextFile() {</span>
-<span class="lineNum">     148 </span><span class="lineCov">             20 :         loaded = false;</span>
-<span class="lineNum">     149 </span><span class="lineCov">             20 :         DIR *d = opendir( dir.c_str() );</span>
-<span class="lineNum">     150 </span><span class="lineCov">             20 :         if ( !d ) {</span>
-<span class="lineNum">     151 </span><span class="lineNoCov">              0 :             offset = -2;</span>
-<span class="lineNum">     152 </span><span class="lineNoCov">              0 :             closedir( d );</span>
-<span class="lineNum">     153 </span><span class="lineNoCov">              0 :             return;</span>
-<span class="lineNum">     154 </span>                :         }
-<span class="lineNum">     155 </span>                : 
-<span class="lineNum">     156 </span><span class="lineCov">             20 :         if ( offset != -1 )</span>
-<span class="lineNum">     157 </span><span class="lineCov">             16 :             seekdir( d, offset );</span>
-<span class="lineNum">     158 </span>                : 
-<span class="lineNum">     159 </span><span class="lineCov">             20 :         dirent *ent = 0;</span>
-<span class="lineNum">     160 </span><span class="lineCov">             48 :         while ( ( ent = readdir( d ) ) != 0 ) {</span>
-<span class="lineNum">     161 </span><span class="lineCov">             24 :             std::string name( ent-&gt;d_name );</span>
-<span class="lineNum">     162 </span><span class="lineCov">             48 :             if ( name == &quot;.&quot; || name == &quot;..&quot; )</span>
-<span class="lineNum">     163 </span><span class="lineCov">              8 :                 continue;</span>
-<span class="lineNum">     164 </span><span class="lineCov">             16 :             if ( !wibble::str::endsWith( name, &quot;.desktop&quot; ) )</span>
-<span class="lineNum">     165 </span>                :                 continue;
-<span class="lineNum">     166 </span><span class="lineCov">             16 :             current = dir + &quot;/&quot; + name;</span>
-<span class="lineNum">     167 </span><span class="lineCov">             16 :             offset = telldir( d );</span>
-<span class="lineNum">     168 </span><span class="lineCov">             16 :             closedir( d );</span>
-<span class="lineNum">     169 </span><span class="lineCov">             16 :             return;</span>
-<span class="lineNum">     170 </span>                :         }
-<span class="lineNum">     171 </span><span class="lineCov">              4 :         closedir( d );</span>
-<span class="lineNum">     172 </span><span class="lineCov">              4 :         offset = -2;</span>
-<span class="lineNum">     173 </span>                :     }
-<span class="lineNum">     174 </span>                : };
-<span class="lineNum">     175 </span>                : 
-<span class="lineNum">     176 </span>                : struct Setup {
-<span class="lineNum">     177 </span>                :     typedef ept::Token Token;
-<span class="lineNum">     178 </span>                :     typedef Entry Internal;
-<span class="lineNum">     179 </span>                :     typedef desktop::PropertyId PropertyId;
-<span class="lineNum">     180 </span>                :     typedef desktop::InternalList InternalList;
-<span class="lineNum">     181 </span>                : };
-<span class="lineNum">     182 </span>                : 
-<span class="lineNum">     183 </span><span class="lineCov">              5 : struct GroupPolicy {</span>
-<span class="lineNum">     184 </span><span class="lineCov">             16 :     virtual std::string group( const Entry &amp;e )</span>
-<span class="lineNum">     185 </span>                :     {
-<span class="lineNum">     186 </span><span class="lineCov">             16 :         return wibble::str::fmt( e.categories() );</span>
-<span class="lineNum">     187 </span>                :     }
-<span class="lineNum">     188 </span><span class="lineCov">              5 :     virtual ~GroupPolicy() {}</span>
-<span class="lineNum">     189 </span>                : };
-<span class="lineNum">     190 </span>                : 
-<span class="lineNum">     191 </span>                : struct Source : core::Source&lt; Source, Setup, PropertyType &gt;
-<span class="lineNum">     192 </span><span class="lineCov">              5 : {</span>
-<span class="lineNum">     193 </span>                :     std::string m_dir;
-<span class="lineNum">     194 </span>                : 
-<span class="lineNum">     195 </span>                :     GroupPolicy m_defaultPolicy;
-<span class="lineNum">     196 </span>                :     GroupPolicy *m_policy;
-<span class="lineNum">     197 </span>                : 
-<span class="lineNum">     198 </span><span class="lineCov">              5 :     Source( std::string dir ) : m_dir( dir ),</span>
-<span class="lineNum">     199 </span><span class="lineCov">              5 :                                 m_policy( &amp;m_defaultPolicy ) {}</span>
-<span class="lineNum">     200 </span>                : 
-<span class="lineNum">     201 </span><span class="lineCov">              4 :     InternalList listInternal() {</span>
-<span class="lineNum">     202 </span><span class="lineCov">              4 :         return InternalList( m_dir );</span>
-<span class="lineNum">     203 </span>                :     }
-<span class="lineNum">     204 </span>                : 
-<span class="lineNum">     205 </span><span class="lineCov">             34 :     Token getToken( Entry i ) {</span>
-<span class="lineNum">     206 </span><span class="lineCov">             34 :         Token t;</span>
-<span class="lineNum">     207 </span><span class="lineCov">             34 :         t._id = std::string( &quot;desktop:&quot; ) + i.id();</span>
-<span class="lineNum">     208 </span><span class="lineNoCov">              0 :         return t;</span>
-<span class="lineNum">     209 </span>                :     }
-<span class="lineNum">     210 </span>                : 
-<span class="lineNum">     211 </span>                :     Entry lookupToken( Token t ) {
-<span class="lineNum">     212 </span>                :         Entry e;
-<span class="lineNum">     213 </span>                :         e.load( t.desktop() );
-<span class="lineNum">     214 </span>                :         return e;
-<span class="lineNum">     215 </span>                :     }
-<span class="lineNum">     216 </span>                : 
-<span class="lineNum">     217 </span>                :     void setGroupPolicy( GroupPolicy *p ) {
-<span class="lineNum">     218 </span>                :         m_policy = p;
-<span class="lineNum">     219 </span>                :     }
-<span class="lineNum">     220 </span>                : 
-<span class="lineNum">     221 </span>                :     template&lt; PropertyId p &gt;
-<span class="lineNum">     222 </span>                :     typename PropertyType&lt; p &gt;::T getInternal( Entry );
-<span class="lineNum">     223 </span>                : 
-<span class="lineNum">     224 </span><span class="lineCov">             56 :     struct IsInGroup {</span>
-<span class="lineNum">     225 </span>                :         std::string g;
-<span class="lineNum">     226 </span><span class="lineCov">              2 :         IsInGroup( std::string _g = &quot;&quot; ) : g( _g ) {}</span>
-<span class="lineNum">     227 </span><span class="lineCov">              8 :         bool operator()( Token, std::string gr ) const {</span>
-<span class="lineNum">     228 </span><span class="lineCov">              8 :             return gr == g;</span>
-<span class="lineNum">     229 </span>                :         }
-<span class="lineNum">     230 </span>                :     };
-<span class="lineNum">     231 </span>                : 
-<span class="lineNum">     232 </span><span class="lineCov">              1 :     PropertyFilter&lt; Group, IsInGroup &gt;::T group( std::string id )</span>
-<span class="lineNum">     233 </span>                :     {
-<span class="lineNum">     234 </span><span class="lineCov">              1 :         return propertyFilter&lt; Group &gt;( IsInGroup( id ) );</span>
-<span class="lineNum">     235 </span>                :     }
-<span class="lineNum">     236 </span>                : 
-<span class="lineNum">     237 </span><span class="lineCov">              4 :     static std::string projectGroup( ComposedList&lt; Name &gt; t ) {</span>
-<span class="lineNum">     238 </span><span class="lineCov">              4 :         return t.get&lt; Group &gt;();</span>
-<span class="lineNum">     239 </span>                :     }
-<span class="lineNum">     240 </span>                : 
-<span class="lineNum">     241 </span>                :     list::Unique&lt; list::Sorted&lt;
-<span class="lineNum">     242 </span>                :                       list::Map&lt; ComposedList&lt; Name &gt;,
-<span class="lineNum">     243 </span>                :                                  __typeof( std::ptr_fun( &amp;projectGroup ) ) &gt; &gt; &gt;
-<span class="lineNum">     244 </span><span class="lineCov">              1 :     groupList() {</span>
-<span class="lineNum">     245 </span>                :         return list::unique(
-<span class="lineNum">     246 </span>                :             list::sort( list::map( list&lt; Name &gt;(),
-<span class="lineNum">     247 </span><span class="lineCov">              1 :                                    std::ptr_fun( &amp;projectGroup ) ) ) );</span>
-<span class="lineNum">     248 </span>                :     }
-<span class="lineNum">     249 </span>                : };
-<span class="lineNum">     250 </span>                : 
-<span class="lineNum">     251 </span><span class="lineCov">              6 : template&lt;&gt; inline std::string Source::getInternal&lt; Name &gt;( Entry e ) {</span>
-<span class="lineNum">     252 </span><span class="lineCov">              6 :     return e.name();</span>
-<span class="lineNum">     253 </span>                : }
-<span class="lineNum">     254 </span>                : 
-<span class="lineNum">     255 </span>                : template&lt;&gt; inline std::string Source::getInternal&lt; Icon &gt;( Entry e ) {
-<span class="lineNum">     256 </span>                :     return e.icon();
-<span class="lineNum">     257 </span>                : }
-<span class="lineNum">     258 </span>                : 
-<span class="lineNum">     259 </span>                : template&lt;&gt; inline ept::Token Source::getInternal&lt; Package &gt;( Entry e ) {
-<span class="lineNum">     260 </span>                :     ept::Token t;
-<span class="lineNum">     261 </span>                :     t._id = e.package();
-<span class="lineNum">     262 </span>                :     return t;
-<span class="lineNum">     263 </span>                : }
-<span class="lineNum">     264 </span>                : 
-<span class="lineNum">     265 </span><span class="lineCov">             16 : template&lt;&gt; inline std::string Source::getInternal&lt; Group &gt;( Entry e ) {</span>
-<span class="lineNum">     266 </span><span class="lineCov">             16 :     return m_policy-&gt;group( e );</span>
-<span class="lineNum">     267 </span>                : }
-<span class="lineNum">     268 </span>                : 
-<span class="lineNum">     269 </span>                : template&lt;&gt; inline std::string Source::getInternal&lt; ShortDescription &gt;( Entry e ) {
-<span class="lineNum">     270 </span>                :     return e.description();
-<span class="lineNum">     271 </span>                : }
-<span class="lineNum">     272 </span>                : 
-<span class="lineNum">     273 </span>                : }
-<span class="lineNum">     274 </span>                : }
-<span class="lineNum">     275 </span>                : }
-<span class="lineNum">     276 </span>                : 
-<span class="lineNum">     277 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/core/desktop.test.h.gcov.html b/rep/ept/core/desktop.test.h.gcov.html
deleted file mode 100644
index 0d08106..0000000
--- a/rep/ept/core/desktop.test.h.gcov.html
+++ /dev/null
@@ -1,135 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/core/desktop.test.h</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/core</a> - desktop.test.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">33</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">33</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- C++ -*-
-<span class="lineNum">       2 </span>                : #include &lt;ept/config.h&gt;
-<span class="lineNum">       3 </span>                : #include &lt;ept/core/desktop.h&gt;
-<span class="lineNum">       4 </span>                : #include &lt;ept/core/list.h&gt;
-<span class="lineNum">       5 </span>                : #include &lt;ept/test.h&gt;
-<span class="lineNum">       6 </span>                : 
-<span class="lineNum">       7 </span>                : using namespace ept::core;
-<span class="lineNum">       8 </span>                : 
-<span class="lineNum">       9 </span><span class="lineCov">              5 : struct TestDesktop {</span>
-<span class="lineNum">      10 </span>                :     desktop::Source desk;
-<span class="lineNum">      11 </span>                :     ept::Token t;
-<span class="lineNum">      12 </span>                : 
-<span class="lineNum">      13 </span><span class="lineCov">              5 :     TestDesktop() : desk( TEST_ENV_DIR &quot;desktop&quot; ) {}</span>
-<span class="lineNum">      14 </span>                : 
-<span class="lineNum">      15 </span>                :     template&lt; desktop::PropertyId P, typename L &gt;
-<span class="lineNum">      16 </span><span class="lineCov">              3 :     void checkIteration2( int c, const char **check, L l ) {</span>
-<span class="lineNum">      17 </span><span class="lineCov">              3 :         int i = 0;</span>
-<span class="lineNum">      18 </span><span class="lineCov">             16 :         while ( !l.empty() ) {</span>
-<span class="lineNum">      19 </span><span class="lineCov">             10 :             assert_eq( l.head().template get&lt; P &gt;(), check[ i ] );</span>
-<span class="lineNum">      20 </span><span class="lineCov">             20 :             l = l.tail();</span>
-<span class="lineNum">      21 </span><span class="lineCov">             10 :             ++ i;</span>
-<span class="lineNum">      22 </span>                :         }
-<span class="lineNum">      23 </span><span class="lineCov">              3 :         assert_eq( i, c );</span>
-<span class="lineNum">      24 </span><span class="lineCov">              3 :     }</span>
-<span class="lineNum">      25 </span>                : 
-<span class="lineNum">      26 </span>                :     template&lt; desktop::PropertyId P, typename L &gt;
-<span class="lineNum">      27 </span><span class="lineCov">              3 :     void checkIteration( int c, const char **check, L l ) {</span>
-<span class="lineNum">      28 </span><span class="lineCov">              3 :         checkIteration2&lt; P &gt;( c, check, list::sort( l ) );</span>
-<span class="lineNum">      29 </span><span class="lineCov">              3 :     }</span>
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span><span class="lineCov">              1 :     Test iteration() {</span>
-<span class="lineNum">      32 </span><span class="lineCov">              1 :         const char *check[] = { &quot;Kdict&quot;, &quot;foo&quot;, &quot;XQF&quot;, &quot;X-Server&quot; };</span>
-<span class="lineNum">      33 </span>                :         checkIteration&lt; desktop::Name &gt;(
-<span class="lineNum">      34 </span><span class="lineCov">              1 :             4, check, desk.list&lt; desktop::Name &gt;() );</span>
-<span class="lineNum">      35 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      36 </span>                : 
-<span class="lineNum">      37 </span><span class="lineCov">              1 :     Test groupProperty() {</span>
-<span class="lineNum">      38 </span>                :         const char *check[] = {
-<span class="lineNum">      39 </span>                :             &quot;{ KDE, Qt, Utility }&quot;,
-<span class="lineNum">      40 </span>                :             &quot;{ KDE, Qt, Utility }&quot;,
-<span class="lineNum">      41 </span>                :             &quot;{ Application, Game, X-SuSE-Core-Game }&quot;,
-<span class="lineNum">      42 </span>                :             &quot;{ KDE, Qt, X-KDE-information }&quot;,
-<span class="lineNum">      43 </span><span class="lineCov">              1 :         };</span>
-<span class="lineNum">      44 </span>                :         checkIteration&lt; desktop::Group &gt;(
-<span class="lineNum">      45 </span><span class="lineCov">              1 :             4, check, desk.list&lt; desktop::Name &gt;() );</span>
-<span class="lineNum">      46 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      47 </span>                : 
-<span class="lineNum">      48 </span><span class="lineCov">              1 :     Test groups() {</span>
-<span class="lineNum">      49 </span><span class="lineCov">              1 :         const char *check[] = { &quot;Kdict&quot;, &quot;foo&quot; };</span>
-<span class="lineNum">      50 </span>                :         checkIteration&lt; desktop::Name &gt;(
-<span class="lineNum">      51 </span><span class="lineCov">              1 :             2, check, desk.group( &quot;{ KDE, Qt, Utility }&quot; ) );</span>
-<span class="lineNum">      52 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      53 </span>                : 
-<span class="lineNum">      54 </span><span class="lineCov">              1 :     Test groupList() {</span>
-<span class="lineNum">      55 </span>                :         std::string check[] = { 
-<span class="lineNum">      56 </span>                :             &quot;{ Application, Game, X-SuSE-Core-Game }&quot;,
-<span class="lineNum">      57 </span>                :             &quot;{ KDE, Qt, Utility }&quot;,
-<span class="lineNum">      58 </span>                :             &quot;{ KDE, Qt, X-KDE-information }&quot;,
-<span class="lineNum">      59 </span><span class="lineCov">              1 :         };</span>
-<span class="lineNum">      60 </span>                : 
-<span class="lineNum">      61 </span><span class="lineCov">              2 :         assert_list_eq( desk.groupList(), check );</span>
-<span class="lineNum">      62 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      63 </span>                : 
-<span class="lineNum">      64 </span><span class="lineCov">              1 :     Test emptyGroupList() {</span>
-<span class="lineNum">      65 </span><span class="lineCov">              1 :         desktop::InternalList l;</span>
-<span class="lineNum">      66 </span><span class="lineCov">              1 :         assert( l.empty() );</span>
-<span class="lineNum">      67 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      68 </span>                : };
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/core/desktopfile.h.gcov.html b/rep/ept/core/desktopfile.h.gcov.html
deleted file mode 100644
index 9ed8552..0000000
--- a/rep/ept/core/desktopfile.h.gcov.html
+++ /dev/null
@@ -1,205 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/core/desktopfile.h</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/core</a> - desktopfile.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">77</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">75.3 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">58</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /// -*- C++ -*- (c) 2006, 2007 Petr Rockai &lt;me@mornfall.net&gt;
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : #include &lt;iostream&gt;
-<span class="lineNum">       4 </span>                : #include &lt;string&gt;
-<span class="lineNum">       5 </span>                : #include &lt;map&gt;
-<span class="lineNum">       6 </span>                : 
-<span class="lineNum">       7 </span>                : #ifndef EPT_CORE_DESKTOPFILE_H
-<span class="lineNum">       8 </span>                : #define EPT_CORE_DESKTOPFILE_H
-<span class="lineNum">       9 </span>                : 
-<span class="lineNum">      10 </span>                : namespace ept {
-<span class="lineNum">      11 </span>                : namespace core {
-<span class="lineNum">      12 </span>                : namespace desktop {
-<span class="lineNum">      13 </span>                : 
-<span class="lineNum">      14 </span><span class="lineCov">             32 : struct File {</span>
-<span class="lineNum">      15 </span><span class="lineCov">          13540 :     struct Entry {</span>
-<span class="lineNum">      16 </span>                :         std::string key;
-<span class="lineNum">      17 </span>                :         std::string value;
-<span class="lineNum">      18 </span>                :     };
-<span class="lineNum">      19 </span>                :     typedef std::map&lt; std::string, Entry &gt; EntryMap;
-<span class="lineNum">      20 </span>                : 
-<span class="lineNum">      21 </span><span class="lineCov">            144 :     struct Group {</span>
-<span class="lineNum">      22 </span>                :         std::string name;
-<span class="lineNum">      23 </span>                :         EntryMap entries;
-<span class="lineNum">      24 </span><span class="lineCov">             88 :         Entry &amp;entry( std::string k ) { return entries[ k ]; }</span>
-<span class="lineNum">      25 </span>                :     };
-<span class="lineNum">      26 </span>                : 
-<span class="lineNum">      27 </span>                :     typedef std::map&lt; std::string, Group &gt; GroupMap;
-<span class="lineNum">      28 </span>                :     GroupMap groups;
-<span class="lineNum">      29 </span><span class="lineCov">             16 :     Group &amp;group( std::string k ) { return groups[ k ]; }</span>
-<span class="lineNum">      30 </span>                : };
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span><span class="lineCov">           1228 : inline std::istream &amp;operator &gt;&gt;( std::istream &amp;i, File::Entry &amp;e )</span>
-<span class="lineNum">      33 </span>                : {
-<span class="lineNum">      34 </span><span class="lineCov">           1228 :     std::string spaces = &quot;&quot;; char c; bool started = false;</span>
-<span class="lineNum">      35 </span>                : 
-<span class="lineNum">      36 </span><span class="lineCov">           1228 :     e.key = &quot;&quot;;</span>
-<span class="lineNum">      37 </span>                :     // read key
-<span class="lineNum">      38 </span><span class="lineCov">          16056 :     while ( i.peek() != EOF ) {</span>
-<span class="lineNum">      39 </span><span class="lineCov">          14820 :         c = i.get();</span>
-<span class="lineNum">      40 </span><span class="lineCov">          14820 :         if ( !started &amp;&amp; c == '\n' )</span>
-<span class="lineNum">      41 </span><span class="lineCov">              8 :             return i &gt;&gt; e;</span>
-<span class="lineNum">      42 </span><span class="lineCov">          14812 :         if ( isspace( c ) ) {</span>
-<span class="lineNum">      43 </span><span class="lineNoCov">              0 :             spaces += c;</span>
-<span class="lineNum">      44 </span><span class="lineNoCov">              0 :             continue;</span>
-<span class="lineNum">      45 </span>                :         }
-<span class="lineNum">      46 </span><span class="lineCov">          14812 :         if ( !started &amp;&amp; c == '#' ) {</span>
-<span class="lineNum">      47 </span><span class="lineNoCov">              0 :             while ( i.peek() != EOF &amp;&amp; i.get() != '\n' )</span>
-<span class="lineNum">      48 </span>                :                 ; // read till eol
-<span class="lineNum">      49 </span><span class="lineNoCov">              0 :             return i &gt;&gt; e; // restart reading</span>
-<span class="lineNum">      50 </span>                :         }
-<span class="lineNum">      51 </span><span class="lineCov">          14812 :         started = true;</span>
-<span class="lineNum">      52 </span><span class="lineCov">          14812 :         if ( c == '=' )</span>
-<span class="lineNum">      53 </span><span class="lineCov">           1212 :             break;</span>
-<span class="lineNum">      54 </span><span class="lineCov">          13600 :         e.key += spaces;</span>
-<span class="lineNum">      55 </span><span class="lineCov">          13600 :         e.key += c;</span>
-<span class="lineNum">      56 </span><span class="lineCov">          13600 :         spaces = &quot;&quot;;</span>
-<span class="lineNum">      57 </span>                :     }
-<span class="lineNum">      58 </span>                :     // std::cerr &lt;&lt; &quot;read key: &quot; &lt;&lt; e.key &lt;&lt; std::endl;
-<span class="lineNum">      59 </span>                : 
-<span class="lineNum">      60 </span><span class="lineCov">           1220 :     started = false;</span>
-<span class="lineNum">      61 </span><span class="lineCov">           1220 :     bool backslash = false;</span>
-<span class="lineNum">      62 </span>                :     // read value
-<span class="lineNum">      63 </span><span class="lineCov">          37496 :     while ( i.peek() != EOF ) {</span>
-<span class="lineNum">      64 </span><span class="lineCov">          36268 :         c = i.get();</span>
-<span class="lineNum">      65 </span><span class="lineCov">          36268 :         if ( c == '\n' ) {</span>
-<span class="lineNum">      66 </span><span class="lineCov">           1212 :             if ( backslash )</span>
-<span class="lineNum">      67 </span><span class="lineNoCov">              0 :                 e.value += '\\';</span>
-<span class="lineNum">      68 </span><span class="lineCov">           1212 :             return i;</span>
-<span class="lineNum">      69 </span>                :         }
-<span class="lineNum">      70 </span><span class="lineCov">          35056 :         if ( !started &amp;&amp; isspace( c ) )</span>
-<span class="lineNum">      71 </span><span class="lineNoCov">              0 :             continue;</span>
-<span class="lineNum">      72 </span><span class="lineCov">          35056 :         started = true;</span>
-<span class="lineNum">      73 </span><span class="lineCov">          35056 :         if ( backslash ) { // interpret escape sequences</span>
-<span class="lineNum">      74 </span><span class="lineNoCov">              0 :             if ( c == '\\' ) e.value += '\\';</span>
-<span class="lineNum">      75 </span><span class="lineNoCov">              0 :             else if ( c == 'n' ) e.value += '\n';</span>
-<span class="lineNum">      76 </span><span class="lineNoCov">              0 :             else if ( c == 't' ) e.value += '\t';</span>
-<span class="lineNum">      77 </span><span class="lineNoCov">              0 :             else if ( c == 'r' ) e.value += '\r';</span>
-<span class="lineNum">      78 </span><span class="lineNoCov">              0 :             else if ( c == 's' ) e.value += ' ';</span>
-<span class="lineNum">      79 </span><span class="lineNoCov">              0 :             else { e.value += '\\'; e.value += c; }</span>
-<span class="lineNum">      80 </span><span class="lineNoCov">              0 :             backslash = false;</span>
-<span class="lineNum">      81 </span><span class="lineNoCov">              0 :             continue;</span>
-<span class="lineNum">      82 </span>                :         }
-<span class="lineNum">      83 </span><span class="lineCov">          35056 :         if ( c == '\\' ) {</span>
-<span class="lineNum">      84 </span><span class="lineNoCov">              0 :             backslash = true;</span>
-<span class="lineNum">      85 </span><span class="lineNoCov">              0 :             continue;</span>
-<span class="lineNum">      86 </span>                :         }
-<span class="lineNum">      87 </span><span class="lineCov">          35056 :         e.value += c;</span>
-<span class="lineNum">      88 </span>                :     }
-<span class="lineNum">      89 </span><span class="lineCov">              8 :     return i;</span>
-<span class="lineNum">      90 </span>                : }
-<span class="lineNum">      91 </span>                : 
-<span class="lineNum">      92 </span><span class="lineCov">             16 : inline std::istream &amp;operator &gt;&gt;( std::istream &amp;i, File::Group &amp;g )</span>
-<span class="lineNum">      93 </span>                : {
-<span class="lineNum">      94 </span><span class="lineCov">             16 :     bool started = false; char c;</span>
-<span class="lineNum">      95 </span><span class="lineCov">             16 :     g.name = &quot;&quot;;</span>
-<span class="lineNum">      96 </span><span class="lineCov">            256 :     while ( i.peek() != EOF ) {</span>
-<span class="lineNum">      97 </span><span class="lineCov">            240 :         c = i.get();</span>
-<span class="lineNum">      98 </span><span class="lineCov">            240 :         if ( !started &amp;&amp; isspace( c ) )</span>
-<span class="lineNum">      99 </span><span class="lineNoCov">              0 :             continue;</span>
-<span class="lineNum">     100 </span><span class="lineCov">            240 :         if ( !started &amp;&amp; c == '#' ) {</span>
-<span class="lineNum">     101 </span><span class="lineNoCov">              0 :             while( i.peek() != EOF &amp;&amp; i.get() != '\n' )</span>
-<span class="lineNum">     102 </span>                :                 ; // read till eol
-<span class="lineNum">     103 </span><span class="lineNoCov">              0 :             return i &gt;&gt; g; // restart reading</span>
-<span class="lineNum">     104 </span>                :         }
-<span class="lineNum">     105 </span><span class="lineCov">            240 :         if ( !started &amp;&amp; c == '[' ) {</span>
-<span class="lineNum">     106 </span><span class="lineCov">             16 :             started = true;</span>
-<span class="lineNum">     107 </span><span class="lineCov">             16 :             continue;</span>
-<span class="lineNum">     108 </span>                :         }
-<span class="lineNum">     109 </span><span class="lineCov">            224 :         if ( started &amp;&amp; c == ']' ) {</span>
-<span class="lineNum">     110 </span><span class="lineCov">             16 :             while( i.peek() != EOF &amp;&amp; i.get() != '\n' )</span>
-<span class="lineNum">     111 </span>                :                 ; // read till eol
-<span class="lineNum">     112 </span><span class="lineCov">             16 :             break;</span>
-<span class="lineNum">     113 </span>                :         }
-<span class="lineNum">     114 </span><span class="lineCov">            208 :         g.name += c;</span>
-<span class="lineNum">     115 </span>                :     }
-<span class="lineNum">     116 </span><span class="lineCov">           1236 :     while ( i.peek() != EOF ) {</span>
-<span class="lineNum">     117 </span><span class="lineCov">           1220 :         File::Entry e;</span>
-<span class="lineNum">     118 </span><span class="lineCov">           1220 :         i &gt;&gt; e;</span>
-<span class="lineNum">     119 </span><span class="lineCov">           1220 :         g.entries[ e.key ] = e;</span>
-<span class="lineNum">     120 </span>                :     }
-<span class="lineNum">     121 </span><span class="lineCov">             16 :     return i;</span>
-<span class="lineNum">     122 </span>                : }
-<span class="lineNum">     123 </span>                : 
-<span class="lineNum">     124 </span><span class="lineCov">             16 : inline std::istream &amp;operator &gt;&gt;( std::istream &amp;i, File &amp;f )</span>
-<span class="lineNum">     125 </span>                : {
-<span class="lineNum">     126 </span><span class="lineCov">             32 :     while ( i.peek() != EOF ) {</span>
-<span class="lineNum">     127 </span><span class="lineCov">             16 :         File::Group g;</span>
-<span class="lineNum">     128 </span><span class="lineCov">             16 :         i &gt;&gt; g;</span>
-<span class="lineNum">     129 </span><span class="lineCov">             16 :         f.groups[ g.name ] = g;</span>
-<span class="lineNum">     130 </span>                :     }
-<span class="lineNum">     131 </span><span class="lineCov">             16 :     return i;</span>
-<span class="lineNum">     132 </span>                : }
-<span class="lineNum">     133 </span>                : 
-<span class="lineNum">     134 </span>                : }
-<span class="lineNum">     135 </span>                : }
-<span class="lineNum">     136 </span>                : }
-<span class="lineNum">     137 </span>                : 
-<span class="lineNum">     138 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/core/index.html b/rep/ept/core/index.html
deleted file mode 100644
index bec608b..0000000
--- a/rep/ept/core/index.html
+++ /dev/null
@@ -1,164 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/core</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - ept/core</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">688</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">82.8 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">570</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <center>
-  <table width="80%" cellpadding=2 cellspacing=1 border=0>
-
-    <tr>
-      <td width="50%"><br></td>
-      <td width="15%"></td>
-      <td width="15%"></td>
-      <td width="20%"></td>
-    </tr>
-
-    <tr>
-      <td class="tableHead">Filename</td>
-      <td class="tableHead" colspan=3>Coverage</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="apt.cpp.gcov.html">apt.cpp</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">7&nbsp;/&nbsp;7&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="apt.h.gcov.html">apt.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=80 height=10 alt="79.8%"><img src="../../snow.png" width=20 height=10 alt="79.8%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">79.8&nbsp;%</td>
-      <td class="coverNumHi">138&nbsp;/&nbsp;173&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="apt.test.h.gcov.html">apt.test.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">60&nbsp;/&nbsp;60&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="desktop.h.gcov.html">desktop.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=94 height=10 alt="94.2%"><img src="../../snow.png" width=6 height=10 alt="94.2%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">94.2&nbsp;%</td>
-      <td class="coverNumHi">97&nbsp;/&nbsp;103&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="desktop.test.h.gcov.html">desktop.test.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">33&nbsp;/&nbsp;33&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="desktopfile.h.gcov.html">desktopfile.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=75 height=10 alt="75.3%"><img src="../../snow.png" width=25 height=10 alt="75.3%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">75.3&nbsp;%</td>
-      <td class="coverNumHi">58&nbsp;/&nbsp;77&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="source.h.gcov.html">source.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">34&nbsp;/&nbsp;34&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="xapian.cpp.gcov.html">xapian.cpp</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../amber.png" width=21 height=10 alt="21.4%"><img src="../../snow.png" width=79 height=10 alt="21.4%"></td></tr></table>
-      </td>
-      <td class="coverPerMed">21.4&nbsp;%</td>
-      <td class="coverNumMed">12&nbsp;/&nbsp;56&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="xapian.h.gcov.html">xapian.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=87 height=10 alt="87.2%"><img src="../../snow.png" width=13 height=10 alt="87.2%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">87.2&nbsp;%</td>
-      <td class="coverNumHi">95&nbsp;/&nbsp;109&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="xapian.test.h.gcov.html">xapian.test.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">36&nbsp;/&nbsp;36&nbsp;lines</td>
-    </tr>
-
-  </table>
-  </center>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/core/source.h.gcov.html b/rep/ept/core/source.h.gcov.html
deleted file mode 100644
index 2c2d8e5..0000000
--- a/rep/ept/core/source.h.gcov.html
+++ /dev/null
@@ -1,181 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/core/source.h</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/core</a> - source.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">34</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">34</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : #include &lt;ept/core/list.h&gt;
-<span class="lineNum">       4 </span>                : 
-<span class="lineNum">       5 </span>                : #ifndef EPT_CORE_SOURCE_H
-<span class="lineNum">       6 </span>                : #define EPT_CORE_SOURCE_H
-<span class="lineNum">       7 </span>                : 
-<span class="lineNum">       8 </span>                : namespace ept {
-<span class="lineNum">       9 </span>                : namespace core {
-<span class="lineNum">      10 </span>                : 
-<span class="lineNum">      11 </span>                : template&lt; typename Self, typename Setup,
-<span class="lineNum">      12 </span>                :           template&lt; typename Setup::PropertyId &gt; class PType &gt;
-<span class="lineNum">      13 </span><span class="lineCov">             38 : struct Source {</span>
-<span class="lineNum">      14 </span>                :     typedef typename Setup::PropertyId PropertyId;
-<span class="lineNum">      15 </span>                :     typedef typename Setup::Token Token;
-<span class="lineNum">      16 </span>                : 
-<span class="lineNum">      17 </span>                :     Token m_cachedToken;
-<span class="lineNum">      18 </span>                :     typename Setup::Internal m_cached;
-<span class="lineNum">      19 </span>                : 
-<span class="lineNum">      20 </span><span class="lineCov">             43 :     Self &amp;self() { return *static_cast&lt; Self * &gt;( this ); }</span>
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                :     template&lt; PropertyId property &gt;
-<span class="lineNum">      23 </span><span class="lineCov">             13 :     typename PType&lt; property &gt;::T get( Token t ) {</span>
-<span class="lineNum">      24 </span><span class="lineCov">             13 :         if ( m_cachedToken != t ) {</span>
-<span class="lineNum">      25 </span><span class="lineCov">             10 :             m_cachedToken = t;</span>
-<span class="lineNum">      26 </span><span class="lineCov">             10 :             m_cached = self().lookupToken( t );</span>
-<span class="lineNum">      27 </span>                :         }
-<span class="lineNum">      28 </span><span class="lineCov">             13 :         return self().template getInternal&lt; property &gt;( m_cached );</span>
-<span class="lineNum">      29 </span>                :     }
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                :     void invalidate() {
-<span class="lineNum">      32 </span>                :         m_cachedToken = ept::Token();
-<span class="lineNum">      33 </span>                :         m_cached = typename Setup::Internal();
-<span class="lineNum">      34 </span>                :     }
-<span class="lineNum">      35 </span>                : 
-<span class="lineNum">      36 </span>                :     template&lt; PropertyId _property &gt;
-<span class="lineNum">      37 </span>                :     struct ComposedList : wibble::mixin::Comparable&lt; ComposedList&lt; _property &gt; &gt;
-<span class="lineNum">      38 </span><span class="lineCov">           4009 :     {</span>
-<span class="lineNum">      39 </span>                :         typedef Self Origin;
-<span class="lineNum">      40 </span>                :         typedef typename Setup::Token Token;
-<span class="lineNum">      41 </span>                :         typedef typename PType&lt; _property &gt;::T Property;
-<span class="lineNum">      42 </span>                :         typedef ComposedList Type;
-<span class="lineNum">      43 </span>                : 
-<span class="lineNum">      44 </span>                :         Origin *origin;
-<span class="lineNum">      45 </span>                :         typename Setup::InternalList internal;
-<span class="lineNum">      46 </span>                : 
-<span class="lineNum">      47 </span><span class="lineCov">          12056 :         ComposedList tail() const {</span>
-<span class="lineNum">      48 </span><span class="lineCov">          12056 :             return ComposedList&lt; _property &gt;( *origin, internal.tail() );</span>
-<span class="lineNum">      49 </span>                :         }
-<span class="lineNum">      50 </span>                : 
-<span class="lineNum">      51 </span><span class="lineCov">          12078 :         bool empty() const { return internal.empty(); }</span>
-<span class="lineNum">      52 </span>                : 
-<span class="lineNum">      53 </span><span class="lineCov">             13 :         bool operator&lt;( const ComposedList &amp;o ) const {</span>
-<span class="lineNum">      54 </span><span class="lineCov">             13 :             return token() &lt; o.token();</span>
-<span class="lineNum">      55 </span>                :         }
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span><span class="lineCov">             18 :         ComposedList &amp;head() { return *this; }</span>
-<span class="lineNum">      58 </span><span class="lineCov">              4 :         const ComposedList &amp;head() const { return *this; }</span>
-<span class="lineNum">      59 </span>                : 
-<span class="lineNum">      60 </span><span class="lineCov">           6054 :         Token token() const { return origin-&gt;getToken( internal.head() ); }</span>
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span><span class="lineCov">           7836 :         Property property() const {</span>
-<span class="lineNum">      63 </span>                :             return origin-&gt;template getInternal&lt; _property &gt;(
-<span class="lineNum">      64 </span><span class="lineCov">           7836 :                 internal.head() );</span>
-<span class="lineNum">      65 </span>                :         }
-<span class="lineNum">      66 </span>                : 
-<span class="lineNum">      67 </span>                :         template&lt; PropertyId P &gt;
-<span class="lineNum">      68 </span>                :         typename PType&lt; P &gt;::T
-<span class="lineNum">      69 </span><span class="lineCov">             14 :         get() const {</span>
-<span class="lineNum">      70 </span><span class="lineCov">             14 :             return origin-&gt;template getInternal&lt; P &gt;( internal.head() );</span>
-<span class="lineNum">      71 </span>                :         }
-<span class="lineNum">      72 </span>                : 
-<span class="lineNum">      73 </span><span class="lineCov">              8 :         ComposedList() : origin( 0 ) {}</span>
-<span class="lineNum">      74 </span>                : 
-<span class="lineNum">      75 </span><span class="lineCov">          12066 :         ComposedList( Origin &amp;o, typename Setup::InternalList i )</span>
-<span class="lineNum">      76 </span><span class="lineCov">          12066 :             : origin( &amp;o ), internal( i ) {}</span>
-<span class="lineNum">      77 </span>                :     };
-<span class="lineNum">      78 </span>                : 
-<span class="lineNum">      79 </span>                :     template&lt; PropertyId property &gt;
-<span class="lineNum">      80 </span><span class="lineCov">             10 :     ComposedList&lt; property &gt; list()</span>
-<span class="lineNum">      81 </span>                :     {
-<span class="lineNum">      82 </span><span class="lineCov">             10 :         return ComposedList&lt; property &gt;( self(), self().listInternal() );</span>
-<span class="lineNum">      83 </span>                :     }
-<span class="lineNum">      84 </span>                : 
-<span class="lineNum">      85 </span>                :     template&lt; PropertyId P, typename F &gt;
-<span class="lineNum">      86 </span><span class="lineCov">             50 :     struct Propertify {</span>
-<span class="lineNum">      87 </span>                :         F f;
-<span class="lineNum">      88 </span><span class="lineCov">              2 :         Propertify( F _f = F() ) : f( _f ) {}</span>
-<span class="lineNum">      89 </span><span class="lineCov">              8 :         bool operator()( const ComposedList&lt; P &gt; &amp;x ) const {</span>
-<span class="lineNum">      90 </span><span class="lineCov">              8 :             return f( x.token(), x.property() );</span>
-<span class="lineNum">      91 </span>                :         }
-<span class="lineNum">      92 </span>                :     };
-<span class="lineNum">      93 </span>                : 
-<span class="lineNum">      94 </span>                :     template&lt; PropertyId P, typename F &gt;
-<span class="lineNum">      95 </span>                :     struct PropertyFilter {
-<span class="lineNum">      96 </span>                :         typedef typename list::Filtered&lt;
-<span class="lineNum">      97 </span>                :             ComposedList&lt; P &gt;, Propertify&lt; P, F &gt; &gt; T;
-<span class="lineNum">      98 </span>                :     };
-<span class="lineNum">      99 </span>                : 
-<span class="lineNum">     100 </span>                :     template&lt; PropertyId P, typename F &gt;
-<span class="lineNum">     101 </span>                :     typename PropertyFilter&lt; P, F &gt;::T
-<span class="lineNum">     102 </span><span class="lineCov">              1 :     propertyFilter( F f ) {</span>
-<span class="lineNum">     103 </span><span class="lineCov">              1 :         return list::filter( list&lt; P &gt;(), Propertify&lt; P, F &gt;( f ) );</span>
-<span class="lineNum">     104 </span>                :     }
-<span class="lineNum">     105 </span>                : 
-<span class="lineNum">     106 </span><span class="lineCov">             38 :     Source()</span>
-<span class="lineNum">     107 </span><span class="lineCov">             38 :     {</span>
-<span class="lineNum">     108 </span><span class="lineCov">             38 :     }</span>
-<span class="lineNum">     109 </span>                : };
-<span class="lineNum">     110 </span>                : 
-<span class="lineNum">     111 </span>                : }
-<span class="lineNum">     112 </span>                : }
-<span class="lineNum">     113 </span>                : 
-<span class="lineNum">     114 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/core/xapian.cpp.gcov.html b/rep/ept/core/xapian.cpp.gcov.html
deleted file mode 100644
index fdd7a16..0000000
--- a/rep/ept/core/xapian.cpp.gcov.html
+++ /dev/null
@@ -1,208 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/core/xapian.cpp</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/core</a> - xapian.cpp</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">56</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">21.4 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">12</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- C++ -*- (c) 2007 Enrico Zini &lt;enrico@enricozini.org&gt;
-<span class="lineNum">       2 </span>                : //                      Petr Rockai &lt;me@mornfall.net&gt;
-<span class="lineNum">       3 </span>                : 
-<span class="lineNum">       4 </span>                : /*
-<span class="lineNum">       5 </span>                :  * Copyright (C) 2007  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">       6 </span>                :  *
-<span class="lineNum">       7 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">       8 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">       9 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">      10 </span>                :  * (at your option) any later version.
-<span class="lineNum">      11 </span>                :  *
-<span class="lineNum">      12 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      13 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      14 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      15 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      16 </span>                :  *
-<span class="lineNum">      17 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      18 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      19 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      20 </span>                :  */
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                : #include &lt;ept/core/xapian.h&gt;
-<span class="lineNum">      23 </span>                : #include &lt;ept/core/apt.h&gt;
-<span class="lineNum">      24 </span>                : #include &lt;ept/core/apt/record.h&gt;
-<span class="lineNum">      25 </span>                : 
-<span class="lineNum">      26 </span>                : #include &lt;ept/textsearch/maint/path.h&gt;
-<span class="lineNum">      27 </span>                : 
-<span class="lineNum">      28 </span>                : #include &lt;wibble/regexp.h&gt;
-<span class="lineNum">      29 </span>                : #include &lt;cctype&gt;
-<span class="lineNum">      30 </span>                : #include &lt;cmath&gt;
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span>                : #include &lt;xapian/queryparser.h&gt;
-<span class="lineNum">      33 </span>                : #include &lt;xapian/base.h&gt;
-<span class="lineNum">      34 </span>                : 
-<span class="lineNum">      35 </span>                : #include &lt;algorithm&gt;
-<span class="lineNum">      36 </span>                : 
-<span class="lineNum">      37 </span>                : #include &lt;iostream&gt;
-<span class="lineNum">      38 </span>                : 
-<span class="lineNum">      39 </span>                : using namespace std;
-<span class="lineNum">      40 </span>                : using namespace ept;
-<span class="lineNum">      41 </span>                : // using namespace ept::debtags;
-<span class="lineNum">      42 </span>                : 
-<span class="lineNum">      43 </span>                : namespace ept {
-<span class="lineNum">      44 </span>                : namespace core {
-<span class="lineNum">      45 </span>                : namespace xapian {
-<span class="lineNum">      46 </span>                : 
-<span class="lineNum">      47 </span>                : size_t max_index = 0;
-<span class="lineNum">      48 </span>                : 
-<span class="lineNum">      49 </span><span class="lineCov">              4 : Source::Source()</span>
-<span class="lineNum">      50 </span><span class="lineCov">              4 :     : m_stem(&quot;en&quot;), m_opened( false )</span>
-<span class="lineNum">      51 </span>                : {
-<span class="lineNum">      52 </span><span class="lineCov">              4 : }</span>
-<span class="lineNum">      53 </span>                : 
-<span class="lineNum">      54 </span><span class="lineCov">              9 : time_t Source::timestamp() const {</span>
-<span class="lineNum">      55 </span><span class="lineCov">              9 :     return textsearch::Path::indexTimestamp();</span>
-<span class="lineNum">      56 </span>                : }
-<span class="lineNum">      57 </span>                : 
-<span class="lineNum">      58 </span><span class="lineCov">              9 : void Source::open() const {</span>
-<span class="lineNum">      59 </span><span class="lineCov">              9 :     if (timestamp()) {</span>
-<span class="lineNum">      60 </span><span class="lineCov">              9 :         std::string path = textsearch::Path::index();</span>
-<span class="lineNum">      61 </span><span class="lineCov">              9 :         m_db = Xapian::Database( path );</span>
-<span class="lineNum">      62 </span><span class="lineCov">              9 :         m_opened = true;</span>
-<span class="lineNum">      63 </span>                :     }
-<span class="lineNum">      64 </span><span class="lineCov">              9 : }</span>
-<span class="lineNum">      65 </span>                : 
-<span class="lineNum">      66 </span><span class="lineNoCov">              0 : std::string Source::toLower(const std::string&amp; str)</span>
-<span class="lineNum">      67 </span>                : {
-<span class="lineNum">      68 </span><span class="lineNoCov">              0 :     std::string res;</span>
-<span class="lineNum">      69 </span><span class="lineNoCov">              0 :     res.reserve(str.size());</span>
-<span class="lineNum">      70 </span><span class="lineNoCov">              0 :     for (std::string::const_iterator i = str.begin(); i != str.end(); ++i)</span>
-<span class="lineNum">      71 </span><span class="lineNoCov">              0 :         res += tolower(*i);</span>
-<span class="lineNum">      72 </span><span class="lineNoCov">              0 :     return res;</span>
-<span class="lineNum">      73 </span>                : }
-<span class="lineNum">      74 </span>                : 
-<span class="lineNum">      75 </span>                : void Source::normalize_and_add(Xapian::Document&amp; doc, const std::string&amp; term,
-<span class="lineNum">      76 </span><span class="lineNoCov">              0 :                                int&amp; /* pos */) const</span>
-<span class="lineNum">      77 </span>                : {
-<span class="lineNum">      78 </span><span class="lineNoCov">              0 :     string t = Source::toLower(term);</span>
-<span class="lineNum">      79 </span><span class="lineNoCov">              0 :     string s = m_stem(t);</span>
-<span class="lineNum">      80 </span><span class="lineNoCov">              0 :     doc.add_term(t);</span>
-<span class="lineNum">      81 </span><span class="lineNoCov">              0 :     if (s != t)</span>
-<span class="lineNum">      82 </span><span class="lineNoCov">              0 :         doc.add_term(s);</span>
-<span class="lineNum">      83 </span><span class="lineNoCov">              0 : }</span>
-<span class="lineNum">      84 </span>                : 
-<span class="lineNum">      85 </span><span class="lineNoCov">              0 : Xapian::docid Source::docidByName(const std::string&amp; pkgname) const</span>
-<span class="lineNum">      86 </span>                : {
-<span class="lineNum">      87 </span><span class="lineNoCov">              0 :     Xapian::PostingIterator i = m_db.postlist_begin(&quot;pkg:&quot;+pkgname);</span>
-<span class="lineNum">      88 </span><span class="lineNoCov">              0 :     if (i == m_db.postlist_end(&quot;pkg:&quot;+pkgname))</span>
-<span class="lineNum">      89 </span><span class="lineNoCov">              0 :         return 0;</span>
-<span class="lineNum">      90 </span>                :     else
-<span class="lineNum">      91 </span><span class="lineNoCov">              0 :         return *i;</span>
-<span class="lineNum">      92 </span>                : }
-<span class="lineNum">      93 </span>                : 
-<span class="lineNum">      94 </span><span class="lineNoCov">              0 : Xapian::Query Source::makeRelatedQuery(const std::string&amp; pkgname) const</span>
-<span class="lineNum">      95 </span>                : {
-<span class="lineNum">      96 </span><span class="lineNoCov">              0 :     Xapian::Enquire enquire(db());</span>
-<span class="lineNum">      97 </span>                : 
-<span class="lineNum">      98 </span>                :     // Retrieve the document for the given package
-<span class="lineNum">      99 </span><span class="lineNoCov">              0 :     enquire.set_query(Xapian::Query(&quot;pkg:&quot;+pkgname));</span>
-<span class="lineNum">     100 </span><span class="lineNoCov">              0 :     Xapian::MSet matches = enquire.get_mset(0, 1);</span>
-<span class="lineNum">     101 </span><span class="lineNoCov">              0 :     Xapian::MSetIterator mi = matches.begin();</span>
-<span class="lineNum">     102 </span><span class="lineNoCov">              0 :     if (mi == matches.end()) return Xapian::Query();</span>
-<span class="lineNum">     103 </span><span class="lineNoCov">              0 :     Xapian::Document doc = mi.get_document();</span>
-<span class="lineNum">     104 </span>                : 
-<span class="lineNum">     105 </span>                :     // Return the query to get the list of similar documents
-<span class="lineNum">     106 </span><span class="lineNoCov">              0 :     return Xapian::Query(Xapian::Query::OP_OR, doc.termlist_begin(), doc.termlist_end());</span>
-<span class="lineNum">     107 </span>                : }
-<span class="lineNum">     108 </span>                : 
-<span class="lineNum">     109 </span>                : double Source::getDoubleValue(const std::string&amp; pkgname,
-<span class="lineNum">     110 </span><span class="lineNoCov">              0 :                               Xapian::valueno val_id) const</span>
-<span class="lineNum">     111 </span>                : {
-<span class="lineNum">     112 </span><span class="lineNoCov">              0 :     Xapian::docid id = docidByName(pkgname);</span>
-<span class="lineNum">     113 </span><span class="lineNoCov">              0 :     if (id == 0)</span>
-<span class="lineNum">     114 </span><span class="lineNoCov">              0 :         return 0.0;</span>
-<span class="lineNum">     115 </span><span class="lineNoCov">              0 :     Xapian::Document doc = db().get_document(id);</span>
-<span class="lineNum">     116 </span><span class="lineNoCov">              0 :     string val = doc.get_value(val_id);</span>
-<span class="lineNum">     117 </span><span class="lineNoCov">              0 :     if (val.empty())</span>
-<span class="lineNum">     118 </span><span class="lineNoCov">              0 :         return 0.0;</span>
-<span class="lineNum">     119 </span>                :     else
-<span class="lineNum">     120 </span><span class="lineNoCov">              0 :         return Xapian::sortable_unserialise(val);</span>
-<span class="lineNum">     121 </span>                : }
-<span class="lineNum">     122 </span>                : 
-<span class="lineNum">     123 </span>                : int Source::getIntValue(const std::string&amp; pkgname,
-<span class="lineNum">     124 </span><span class="lineNoCov">              0 :                         Xapian::valueno val_id) const</span>
-<span class="lineNum">     125 </span>                : {
-<span class="lineNum">     126 </span><span class="lineNoCov">              0 :     Xapian::docid id = docidByName(pkgname);</span>
-<span class="lineNum">     127 </span><span class="lineNoCov">              0 :     if (id == 0)</span>
-<span class="lineNum">     128 </span><span class="lineNoCov">              0 :         return 0;</span>
-<span class="lineNum">     129 </span><span class="lineNoCov">              0 :     Xapian::Document doc = db().get_document(id);</span>
-<span class="lineNum">     130 </span><span class="lineNoCov">              0 :     string val = doc.get_value(val_id);</span>
-<span class="lineNum">     131 </span><span class="lineNoCov">              0 :     if (val.empty())</span>
-<span class="lineNum">     132 </span><span class="lineNoCov">              0 :         return 0;</span>
-<span class="lineNum">     133 </span>                :     else
-<span class="lineNum">     134 </span><span class="lineNoCov">              0 :         return (int)nearbyint(Xapian::sortable_unserialise(val));</span>
-<span class="lineNum">     135 </span>                : }
-<span class="lineNum">     136 </span>                : 
-<span class="lineNum">     137 </span>                : }
-<span class="lineNum">     138 </span>                : }
-<span class="lineNum">     139 </span><span class="lineCov">              3 : }</span>
-<span class="lineNum">     140 </span>                : 
-<span class="lineNum">     141 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/core/xapian.h.gcov.html b/rep/ept/core/xapian.h.gcov.html
deleted file mode 100644
index d38457e..0000000
--- a/rep/ept/core/xapian.h.gcov.html
+++ /dev/null
@@ -1,456 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/core/xapian.h</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/core</a> - xapian.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">109</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">87.2 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">95</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- C++ -*-
-<span class="lineNum">       2 </span>                : #include &lt;xapian.h&gt;
-<span class="lineNum">       3 </span>                : #include &lt;ept/core/apt.h&gt;
-<span class="lineNum">       4 </span>                : #include &lt;wibble/regexp.h&gt;
-<span class="lineNum">       5 </span>                : #include &lt;wibble/sys/pipe.h&gt;
-<span class="lineNum">       6 </span>                : #include &lt;wibble/sys/exec.h&gt;
-<span class="lineNum">       7 </span>                : 
-<span class="lineNum">       8 </span>                : #ifndef EPT_XAPIAN_H
-<span class="lineNum">       9 </span>                : #define EPT_XAPIAN_H
-<span class="lineNum">      10 </span>                : 
-<span class="lineNum">      11 </span>                : namespace ept {
-<span class="lineNum">      12 </span>                : namespace core {
-<span class="lineNum">      13 </span>                : namespace xapian {
-<span class="lineNum">      14 </span>                : 
-<span class="lineNum">      15 </span>                : // Allocate value indexes for known values
-<span class="lineNum">      16 </span>                : const Xapian::valueno VAL_APT_INSTALLED_SIZE      =  1;
-<span class="lineNum">      17 </span>                : const Xapian::valueno VAL_APT_PACKAGE_SIZE        =  2;
-<span class="lineNum">      18 </span>                : const Xapian::valueno VAL_POPCON                  = 10;
-<span class="lineNum">      19 </span>                : const Xapian::valueno VAL_ITERATING_RATING        = 20;
-<span class="lineNum">      20 </span>                : const Xapian::valueno VAL_ITERATING_FUNCTIONALITY = 21;
-<span class="lineNum">      21 </span>                : const Xapian::valueno VAL_ITERATING_USABILITY     = 22;
-<span class="lineNum">      22 </span>                : const Xapian::valueno VAL_ITERATING_SECURITY      = 23;
-<span class="lineNum">      23 </span>                : const Xapian::valueno VAL_ITERATING_PERFORMANCE   = 24;
-<span class="lineNum">      24 </span>                : const Xapian::valueno VAL_ITERATING_QUALITY       = 25;
-<span class="lineNum">      25 </span>                : const Xapian::valueno VAL_ITERATING_SUPPORT       = 26;
-<span class="lineNum">      26 </span>                : const Xapian::valueno VAL_ITERATING_ADOPTION      = 27;
-<span class="lineNum">      27 </span>                : 
-<span class="lineNum">      28 </span>                : struct TagFilter : public Xapian::ExpandDecider
-<span class="lineNum">      29 </span><span class="lineCov">              8 : {</span>
-<span class="lineNum">      30 </span><span class="lineCov">           1760 :     virtual bool operator()(const std::string &amp;term) const {</span>
-<span class="lineNum">      31 </span><span class="lineCov">           1760 :         return term[0] == 'X' &amp;&amp; term[1] == 'T';</span>
-<span class="lineNum">      32 </span>                :     }
-<span class="lineNum">      33 </span>                : };
-<span class="lineNum">      34 </span>                : 
-<span class="lineNum">      35 </span><span class="lineCov">             91 : struct List {</span>
-<span class="lineNum">      36 </span>                :     char m_enqPlace[sizeof(Xapian::Enquire)];
-<span class="lineNum">      37 </span>                :     mutable Xapian::MSet m_matches;
-<span class="lineNum">      38 </span>                :     mutable Xapian::MSet::const_iterator m_iter;
-<span class="lineNum">      39 </span>                :     mutable int m_pos;
-<span class="lineNum">      40 </span>                :     typedef List Type;
-<span class="lineNum">      41 </span>                : 
-<span class="lineNum">      42 </span>                :     static const size_t chunkSize = 20;
-<span class="lineNum">      43 </span>                : 
-<span class="lineNum">      44 </span>                :     List head() const {
-<span class="lineNum">      45 </span>                :         seek();
-<span class="lineNum">      46 </span>                :         return *this;
-<span class="lineNum">      47 </span>                :     }
-<span class="lineNum">      48 </span>                : 
-<span class="lineNum">      49 </span><span class="lineCov">             15 :     Token token() const {</span>
-<span class="lineNum">      50 </span><span class="lineCov">             15 :         Token t;</span>
-<span class="lineNum">      51 </span><span class="lineCov">             15 :         t._id = m_iter.get_document().get_data();</span>
-<span class="lineNum">      52 </span><span class="lineNoCov">              0 :         return t;</span>
-<span class="lineNum">      53 </span>                :     }
-<span class="lineNum">      54 </span>                : 
-<span class="lineNum">      55 </span>                :     bool operator&lt;( const List &amp;o ) const {
-<span class="lineNum">      56 </span>                :         return token() &lt; o.token();
-<span class="lineNum">      57 </span>                :     }
-<span class="lineNum">      58 </span>                : 
-<span class="lineNum">      59 </span><span class="lineCov">             58 :     void seek() const {</span>
-<span class="lineNum">      60 </span><span class="lineCov">             58 :         if ( m_matches.size() == chunkSize &amp;&amp; m_iter == m_matches.end() ) {</span>
-<span class="lineNum">      61 </span><span class="lineNoCov">              0 :             m_matches = enq().get_mset( m_pos, chunkSize );</span>
-<span class="lineNum">      62 </span><span class="lineNoCov">              0 :             m_iter = m_matches.begin();</span>
-<span class="lineNum">      63 </span><span class="lineNoCov">              0 :             m_pos += chunkSize;</span>
-<span class="lineNum">      64 </span>                :         }
-<span class="lineNum">      65 </span><span class="lineCov">             58 :     }</span>
-<span class="lineNum">      66 </span>                : 
-<span class="lineNum">      67 </span><span class="lineCov">             30 :     bool empty() const {</span>
-<span class="lineNum">      68 </span><span class="lineCov">             30 :         if ( m_pos == -1 )</span>
-<span class="lineNum">      69 </span><span class="lineNoCov">              0 :             return true;</span>
-<span class="lineNum">      70 </span><span class="lineCov">             30 :         seek();</span>
-<span class="lineNum">      71 </span><span class="lineCov">             30 :         return m_matches.size() &lt; 30 &amp;&amp; m_iter == m_matches.end();</span>
-<span class="lineNum">      72 </span>                :     }
-<span class="lineNum">      73 </span>                : 
-<span class="lineNum">      74 </span><span class="lineCov">             28 :     List tail() const {</span>
-<span class="lineNum">      75 </span><span class="lineCov">             28 :         List t = *this;</span>
-<span class="lineNum">      76 </span><span class="lineCov">             28 :         t.seek();</span>
-<span class="lineNum">      77 </span><span class="lineCov">             28 :         t.m_iter ++;</span>
-<span class="lineNum">      78 </span><span class="lineNoCov">              0 :         return t;</span>
-<span class="lineNum">      79 </span>                :     }
-<span class="lineNum">      80 </span>                : 
-<span class="lineNum">      81 </span><span class="lineCov">              6 :     Xapian::Enquire const &amp;enq() const {</span>
-<span class="lineNum">      82 </span><span class="lineCov">              6 :         return *reinterpret_cast&lt; Xapian::Enquire const * &gt;( m_enqPlace );</span>
-<span class="lineNum">      83 </span>                :     }
-<span class="lineNum">      84 </span>                : 
-<span class="lineNum">      85 </span><span class="lineCov">              3 :     List( Xapian::Enquire _enq )</span>
-<span class="lineNum">      86 </span><span class="lineCov">              3 :     {</span>
-<span class="lineNum">      87 </span><span class="lineCov">              3 :         Xapian::Enquire *e = new (m_enqPlace) Xapian::Enquire( _enq );</span>
-<span class="lineNum">      88 </span><span class="lineCov">              3 :         assert_eq( e, &amp;enq() );</span>
-<span class="lineNum">      89 </span><span class="lineCov">              6 :         m_matches = enq().get_mset( 0, chunkSize );</span>
-<span class="lineNum">      90 </span><span class="lineCov">              3 :         m_iter = m_matches.begin();</span>
-<span class="lineNum">      91 </span><span class="lineCov">              3 :         m_pos = chunkSize;</span>
-<span class="lineNum">      92 </span><span class="lineCov">              3 :     }</span>
-<span class="lineNum">      93 </span>                : 
-<span class="lineNum">      94 </span>                :     List() {}
-<span class="lineNum">      95 </span>                : };
-<span class="lineNum">      96 </span>                : 
-<span class="lineNum">      97 </span><span class="lineCov">             13 : struct Query {</span>
-<span class="lineNum">      98 </span>                :     Xapian::Database *m_db;
-<span class="lineNum">      99 </span>                :     Xapian::Enquire m_enq;
-<span class="lineNum">     100 </span>                :     Xapian::Stem m_stem;
-<span class="lineNum">     101 </span>                :     typedef std::set&lt; std::string &gt; Terms;
-<span class="lineNum">     102 </span>                :     Terms m_include, m_exclude;
-<span class="lineNum">     103 </span>                :     int m_cutoff;
-<span class="lineNum">     104 </span>                :     bool m_expand;
-<span class="lineNum">     105 </span>                : 
-<span class="lineNum">     106 </span><span class="lineCov">              5 :     void setQualityCutoff( int c ) {</span>
-<span class="lineNum">     107 </span><span class="lineCov">              5 :         m_cutoff = c;</span>
-<span class="lineNum">     108 </span><span class="lineCov">              5 :     }</span>
-<span class="lineNum">     109 </span>                : 
-<span class="lineNum">     110 </span><span class="lineCov">              5 :     void setExpand( bool e ) { m_expand = e; }</span>
-<span class="lineNum">     111 </span>                : 
-<span class="lineNum">     112 </span><span class="lineCov">              9 :     Query( Xapian::Database &amp;e ) : m_db( &amp;e ), m_enq( e ) {</span>
-<span class="lineNum">     113 </span><span class="lineCov">              9 :         m_cutoff = 50;</span>
-<span class="lineNum">     114 </span><span class="lineCov">              9 :         m_expand = true;</span>
-<span class="lineNum">     115 </span><span class="lineCov">              9 :     }</span>
-<span class="lineNum">     116 </span>                : 
-<span class="lineNum">     117 </span><span class="lineCov">              5 :     wibble::Tokenizer queryTokenizer( std::string q ) const {</span>
-<span class="lineNum">     118 </span><span class="lineCov">              5 :         return wibble::Tokenizer( q, &quot;[A-Za-z0-9_+:-]+&quot;, REG_EXTENDED );</span>
-<span class="lineNum">     119 </span>                :     }
-<span class="lineNum">     120 </span>                : 
-<span class="lineNum">     121 </span>                :     template&lt; typename Out &gt;
-<span class="lineNum">     122 </span><span class="lineCov">              5 :     void tokenizeQuery( std::string q, Out o ) const</span>
-<span class="lineNum">     123 </span>                :     {
-<span class="lineNum">     124 </span><span class="lineCov">              5 :         wibble::Tokenizer tok = queryTokenizer( q );</span>
-<span class="lineNum">     125 </span><span class="lineCov">             15 :         for (wibble::Tokenizer::const_iterator i = tok.begin(); i != tok.end(); ++i )</span>
-<span class="lineNum">     126 </span>                :         {
-<span class="lineNum">     127 </span><span class="lineCov">             10 :             if ( (*i).find( &quot;::&quot; ) != std::string::npos ) { // assume tag</span>
-<span class="lineNum">     128 </span><span class="lineNoCov">              0 :                 *o++ = (&quot;XT&quot; + *i);</span>
-<span class="lineNum">     129 </span>                :             } else {
-<span class="lineNum">     130 </span><span class="lineCov">             10 :                 std::string t = wibble::str::tolower(*i);</span>
-<span class="lineNum">     131 </span><span class="lineCov">             10 :                 std::string s = m_stem(t);</span>
-<span class="lineNum">     132 </span><span class="lineCov">             10 :                 *o++ = t;</span>
-<span class="lineNum">     133 </span><span class="lineCov">             10 :                 if (s != t)</span>
-<span class="lineNum">     134 </span><span class="lineCov">              5 :                     *o++ = (&quot;Z&quot; + s);</span>
-<span class="lineNum">     135 </span>                :             }
-<span class="lineNum">     136 </span>                :         }
-<span class="lineNum">     137 </span><span class="lineCov">              5 :     }</span>
-<span class="lineNum">     138 </span>                : 
-<span class="lineNum">     139 </span>                :     template&lt; typename Out &gt;
-<span class="lineNum">     140 </span><span class="lineCov">              4 :     void expand( Out o ) const</span>
-<span class="lineNum">     141 </span>                :     {
-<span class="lineNum">     142 </span><span class="lineCov">              4 :         Xapian::RSet rset;</span>
-<span class="lineNum">     143 </span>                :         // Get the top 5 results as 'good ones' to compute the search expansion
-<span class="lineNum">     144 </span><span class="lineCov">              4 :         Xapian::MSet mset = m_enq.get_mset(0, 5);</span>
-<span class="lineNum">     145 </span><span class="lineCov">             24 :         for ( Xapian::MSet::iterator i = mset.begin(); i != mset.end(); ++i )</span>
-<span class="lineNum">     146 </span><span class="lineCov">             24 :             rset.add_document(i);</span>
-<span class="lineNum">     147 </span>                :         // Get the expanded set, only expanding the query with tag names
-<span class="lineNum">     148 </span><span class="lineCov">              4 :         TagFilter tagf;</span>
-<span class="lineNum">     149 </span><span class="lineCov">              4 :         Xapian::ESet eset = m_enq.get_eset(5, rset, &amp;tagf);</span>
-<span class="lineNum">     150 </span><span class="lineCov">              4 :         for ( Xapian::ESetIterator i = eset.begin(); i != eset.end(); ++i )</span>
-<span class="lineNum">     151 </span><span class="lineCov">              4 :             *o++ = *i;</span>
-<span class="lineNum">     152 </span><span class="lineCov">              4 :     }</span>
-<span class="lineNum">     153 </span>                : 
-<span class="lineNum">     154 </span><span class="lineCov">              8 :     void updateEnquire() {</span>
-<span class="lineNum">     155 </span>                :         // set up query now
-<span class="lineNum">     156 </span>                :         Xapian::Query inc( Xapian::Query::OP_OR,
-<span class="lineNum">     157 </span>                :                            m_include.begin(),
-<span class="lineNum">     158 </span><span class="lineCov">              8 :                            m_include.end() ),</span>
-<span class="lineNum">     159 </span>                :             exc( Xapian::Query::OP_OR,
-<span class="lineNum">     160 </span>                :                  m_exclude.begin(),
-<span class="lineNum">     161 </span><span class="lineCov">              8 :                  m_exclude.end() ),</span>
-<span class="lineNum">     162 </span><span class="lineCov">              8 :             query( Xapian::Query::OP_AND_NOT, inc, exc );</span>
-<span class="lineNum">     163 </span>                : 
-<span class="lineNum">     164 </span><span class="lineCov">              8 :         m_enq.set_query( query );</span>
-<span class="lineNum">     165 </span>                : 
-<span class="lineNum">     166 </span><span class="lineCov">              8 :         if ( m_expand ) {</span>
-<span class="lineNum">     167 </span><span class="lineCov">              4 :             m_expand = false;</span>
-<span class="lineNum">     168 </span><span class="lineCov">              4 :             expand( std::inserter( m_include, m_include.begin() ) );</span>
-<span class="lineNum">     169 </span><span class="lineCov">              4 :             updateEnquire();</span>
-<span class="lineNum">     170 </span><span class="lineCov">              4 :             m_expand = true;</span>
-<span class="lineNum">     171 </span><span class="lineCov">              4 :             return;</span>
-<span class="lineNum">     172 </span>                :         }
-<span class="lineNum">     173 </span>                : 
-<span class="lineNum">     174 </span><span class="lineCov">              4 :         Xapian::MSet first = m_enq.get_mset(0, 1, 0, 0, 0);</span>
-<span class="lineNum">     175 </span><span class="lineCov">              4 :         Xapian::MSetIterator ifirst = first.begin();</span>
-<span class="lineNum">     176 </span><span class="lineCov">              4 :         if ( ifirst != first.end() ) {</span>
-<span class="lineNum">     177 </span><span class="lineCov">              4 :             Xapian::percent cutoff = ifirst.get_percent() * m_cutoff / 100;</span>
-<span class="lineNum">     178 </span><span class="lineCov">              4 :             m_enq.set_cutoff(cutoff);</span>
-<span class="lineNum">     179 </span><span class="lineCov">              4 :         }</span>
-<span class="lineNum">     180 </span>                :     }
-<span class="lineNum">     181 </span>                : 
-<span class="lineNum">     182 </span><span class="lineCov">              3 :     List results() {</span>
-<span class="lineNum">     183 </span><span class="lineCov">              3 :         updateEnquire();</span>
-<span class="lineNum">     184 </span><span class="lineCov">              3 :         return List( m_enq );</span>
-<span class="lineNum">     185 </span>                :     }
-<span class="lineNum">     186 </span>                : 
-<span class="lineNum">     187 </span>                :     std::map&lt; std::string, int &gt; relevantTags( int n = 30 ) {
-<span class="lineNum">     188 </span>                :         updateEnquire();
-<span class="lineNum">     189 </span>                :         std::map&lt; std::string, int &gt; relev;
-<span class="lineNum">     190 </span>                :         Xapian::RSet rset;
-<span class="lineNum">     191 </span>                :         Xapian::MSet mset = m_enq.get_mset(0, 100);
-<span class="lineNum">     192 </span>                :         for ( Xapian::MSet::iterator i = mset.begin(); i != mset.end(); ++i )
-<span class="lineNum">     193 </span>                :             rset.add_document(i);
-<span class="lineNum">     194 </span>                :         // Get the expanded set, only expanding the query with tag names
-<span class="lineNum">     195 </span>                :         TagFilter tagf;
-<span class="lineNum">     196 </span>                :         Xapian::ESet eset = m_enq.get_eset(n, rset, &amp;tagf);
-<span class="lineNum">     197 </span>                :         for ( Xapian::ESetIterator i = eset.begin(); i != eset.end(); ++i )
-<span class="lineNum">     198 </span>                :             relev.insert( relev.begin(),
-<span class="lineNum">     199 </span>                :                           std::make_pair(
-<span class="lineNum">     200 </span>                :                               std::string( *i, 2, std::string::npos ),
-<span class="lineNum">     201 </span>                :                               i.get_weight() ) );
-<span class="lineNum">     202 </span>                :         return relev;
-<span class="lineNum">     203 </span>                :     }
-<span class="lineNum">     204 </span>                : 
-<span class="lineNum">     205 </span><span class="lineCov">              5 :     void addTerms( std::string t, bool partial = false, bool exclude = false ) {</span>
-<span class="lineNum">     206 </span><span class="lineCov">              5 :         Terms &amp;to = exclude ? m_exclude : m_include;</span>
-<span class="lineNum">     207 </span><span class="lineCov">              5 :         std::vector&lt; std::string &gt; tok;</span>
-<span class="lineNum">     208 </span><span class="lineCov">              5 :         tokenizeQuery( t, std::back_inserter( tok ) );</span>
-<span class="lineNum">     209 </span><span class="lineCov">              5 :         if ( partial ) {</span>
-<span class="lineNum">     210 </span><span class="lineNoCov">              0 :             if ( tok.back().size() == 1 ) {</span>
-<span class="lineNum">     211 </span><span class="lineNoCov">              0 :                 tok.pop_back();</span>
-<span class="lineNum">     212 </span>                :             } else {
-<span class="lineNum">     213 </span>                :                 std::copy(
-<span class="lineNum">     214 </span>                :                     m_db-&gt;allterms_begin( tok.back() ),
-<span class="lineNum">     215 </span>                :                     m_db-&gt;allterms_end( tok.back() ),
-<span class="lineNum">     216 </span><span class="lineNoCov">              0 :                     std::back_inserter( tok ) );</span>
-<span class="lineNum">     217 </span>                :             }
-<span class="lineNum">     218 </span>                :         }
-<span class="lineNum">     219 </span><span class="lineCov">              5 :         std::copy( tok.begin(), tok.end(), std::inserter( to, to.begin() ) );</span>
-<span class="lineNum">     220 </span><span class="lineCov">              5 :     }</span>
-<span class="lineNum">     221 </span>                : 
-<span class="lineNum">     222 </span>                :     void addTerms( const Terms &amp;t, bool exclude = false ) {
-<span class="lineNum">     223 </span>                :         Terms &amp;to = exclude ? m_exclude : m_include;
-<span class="lineNum">     224 </span>                :         std::copy( t.begin(), t.end(), std::inserter( to, to.begin() ) );
-<span class="lineNum">     225 </span>                :     }
-<span class="lineNum">     226 </span>                : 
-<span class="lineNum">     227 </span>                : };
-<span class="lineNum">     228 </span>                : 
-<span class="lineNum">     229 </span>                : struct Source
-<span class="lineNum">     230 </span><span class="lineCov">              4 : {</span>
-<span class="lineNum">     231 </span>                : protected:
-<span class="lineNum">     232 </span>                :     mutable Xapian::Database m_db;
-<span class="lineNum">     233 </span>                :     Xapian::Stem m_stem;
-<span class="lineNum">     234 </span>                :     mutable bool m_opened;
-<span class="lineNum">     235 </span>                : 
-<span class="lineNum">     236 </span>                :     /// Return a lowercased copy of the string
-<span class="lineNum">     237 </span>                :     static std::string toLower(const std::string&amp; str);
-<span class="lineNum">     238 </span>                : 
-<span class="lineNum">     239 </span>                :     /**
-<span class="lineNum">     240 </span>                :      * Add normalised tokens computed from the string to the document doc.
-<span class="lineNum">     241 </span>                :      *
-<span class="lineNum">     242 </span>                :      * pos is used as a sequence generator for entering the token position in
-<span class="lineNum">     243 </span>                :      * the document.
-<span class="lineNum">     244 </span>                :      */
-<span class="lineNum">     245 </span>                :     void normalize_and_add(Xapian::Document&amp; doc, const std::string&amp; term,
-<span class="lineNum">     246 </span>                :                            int&amp; pos) const;
-<span class="lineNum">     247 </span>                : 
-<span class="lineNum">     248 </span>                : public:
-<span class="lineNum">     249 </span>                :     Source();
-<span class="lineNum">     250 </span>                : 
-<span class="lineNum">     251 </span>                :     /// Access the Xapian database
-<span class="lineNum">     252 </span><span class="lineCov">              9 :     Xapian::Database&amp; db() {</span>
-<span class="lineNum">     253 </span><span class="lineCov">              9 :         open();</span>
-<span class="lineNum">     254 </span><span class="lineCov">              9 :         return m_db;</span>
-<span class="lineNum">     255 </span>                :     }
-<span class="lineNum">     256 </span>                : 
-<span class="lineNum">     257 </span>                :     /// Access the Xapian database
-<span class="lineNum">     258 </span><span class="lineNoCov">              0 :     const Xapian::Database&amp; db() const {</span>
-<span class="lineNum">     259 </span><span class="lineNoCov">              0 :         open();</span>
-<span class="lineNum">     260 </span><span class="lineNoCov">              0 :         return m_db;</span>
-<span class="lineNum">     261 </span>                :     }
-<span class="lineNum">     262 </span>                : 
-<span class="lineNum">     263 </span>                :     void open() const;
-<span class="lineNum">     264 </span>                :     void invalidate() {
-<span class="lineNum">     265 </span>                :         m_db = Xapian::Database();
-<span class="lineNum">     266 </span>                :         m_opened = false;
-<span class="lineNum">     267 </span>                :     }
-<span class="lineNum">     268 </span>                : 
-<span class="lineNum">     269 </span>                :     /// Timestamp of when the Xapian database was last updated
-<span class="lineNum">     270 </span>                :     time_t timestamp() const;
-<span class="lineNum">     271 </span>                : 
-<span class="lineNum">     272 </span>                :     void updateLeniently( AptDatabase &amp;apt, OpProgress *op = 0 ) {
-<span class="lineNum">     273 </span>                :         if (apt.timestamp() - timestamp() &gt; 86400 * 8) // a little over a week
-<span class="lineNum">     274 </span>                :             update( op );
-<span class="lineNum">     275 </span>                :     }
-<span class="lineNum">     276 </span>                : 
-<span class="lineNum">     277 </span>                :     void update( OpProgress *op = 0 ) {
-<span class="lineNum">     278 </span>                :         if ( !op )
-<span class="lineNum">     279 </span>                :             op = new OpProgress();
-<span class="lineNum">     280 </span>                : 
-<span class="lineNum">     281 </span>                :         wibble::exception::AddContext _ctx( &quot;Rebuilding Xapian database.&quot; );
-<span class="lineNum">     282 </span>                :         int outfd;
-<span class="lineNum">     283 </span>                :         std::string op_str;
-<span class="lineNum">     284 </span>                : 
-<span class="lineNum">     285 </span>                :         wibble::sys::Exec ex( &quot;update-apt-xapian-index&quot; );
-<span class="lineNum">     286 </span>                :         ex.args.push_back( &quot;--batch-mode&quot; );
-<span class="lineNum">     287 </span>                :         ex.searchInPath = true;
-<span class="lineNum">     288 </span>                :         ex.forkAndRedirect( 0, &amp;outfd, 0 );
-<span class="lineNum">     289 </span>                : 
-<span class="lineNum">     290 </span>                :         wibble::sys::Pipe monit( outfd );
-<span class="lineNum">     291 </span>                :         while ( !monit.eof() ) {
-<span class="lineNum">     292 </span>                :             std::string line = monit.nextLine();
-<span class="lineNum">     293 </span>                :             if ( line.empty() ) {
-<span class="lineNum">     294 </span>                :                 usleep( 100000 );
-<span class="lineNum">     295 </span>                :                 continue;
-<span class="lineNum">     296 </span>                :             }
-<span class="lineNum">     297 </span>                :             std::cerr &lt;&lt; &quot;got : &quot; &lt;&lt; line &lt;&lt; std::endl;
-<span class="lineNum">     298 </span>                :             if ( wibble::str::startsWith( line, &quot;begin: &quot; ) ) {
-<span class="lineNum">     299 </span>                :                 op_str = std::string( line, 7, std::string::npos );
-<span class="lineNum">     300 </span>                :                 op-&gt;OverallProgress( 0, 100, 100, op_str );
-<span class="lineNum">     301 </span>                :                     
-<span class="lineNum">     302 </span>                :             } else if ( wibble::str::startsWith( line, &quot;done: &quot; ) ) {
-<span class="lineNum">     303 </span>                :                 op-&gt;Done();
-<span class="lineNum">     304 </span>                :             } else if ( wibble::str::startsWith( line, &quot;progress: &quot; ) ) {
-<span class="lineNum">     305 </span>                :                 wibble::ERegexp re( &quot;progress: ([0-9]+)/([0-9]+)&quot;, 3 );
-<span class="lineNum">     306 </span>                :                 if ( re.match( line ) ) {
-<span class="lineNum">     307 </span>                :                     assert_eq( re[2], &quot;100&quot; );
-<span class="lineNum">     308 </span>                :                     op-&gt;OverallProgress( atoi( re[1].c_str() ), 100, 100, op_str );
-<span class="lineNum">     309 </span>                :                 }
-<span class="lineNum">     310 </span>                :             }
-<span class="lineNum">     311 </span>                :         }
-<span class="lineNum">     312 </span>                :         ex.waitForSuccess();
-<span class="lineNum">     313 </span>                :         invalidate();
-<span class="lineNum">     314 </span>                :     }
-<span class="lineNum">     315 </span>                : 
-<span class="lineNum">     316 </span>                :     /// Returns true if the index has data
-<span class="lineNum">     317 </span>                :     bool hasData() const { return timestamp() &gt; 0; }
-<span class="lineNum">     318 </span>                : 
-<span class="lineNum">     319 </span>                :     Query query( const std::string &amp;s,
-<span class="lineNum">     320 </span>                :                  bool expand = true,
-<span class="lineNum">     321 </span><span class="lineCov">              5 :                  int qualityCutoff = 50 )</span>
-<span class="lineNum">     322 </span>                :     {
-<span class="lineNum">     323 </span><span class="lineCov">              5 :         Query q( db() );</span>
-<span class="lineNum">     324 </span><span class="lineCov">              5 :         q.setQualityCutoff( qualityCutoff );</span>
-<span class="lineNum">     325 </span><span class="lineCov">              5 :         q.setExpand( expand );</span>
-<span class="lineNum">     326 </span><span class="lineCov">              5 :         q.addTerms( s );</span>
-<span class="lineNum">     327 </span><span class="lineNoCov">              0 :         return q;</span>
-<span class="lineNum">     328 </span>                :     }
-<span class="lineNum">     329 </span>                : 
-<span class="lineNum">     330 </span>                :     Query partialQuery( const std::string &amp;s ) {
-<span class="lineNum">     331 </span>                :         Query q( db() );
-<span class="lineNum">     332 </span>                :         q.addTerms( s, true ); // partial
-<span class="lineNum">     333 </span>                :         return q;
-<span class="lineNum">     334 </span>                :     }
-<span class="lineNum">     335 </span>                : 
-<span class="lineNum">     336 </span>                :     /// Returns true if the index is older than the Apt database information
-<span class="lineNum">     337 </span>                :     // bool needsRebuild(apt::Apt&amp; apt);
-<span class="lineNum">     338 </span>                : 
-<span class="lineNum">     339 </span>                :     Xapian::docid docidByName(const std::string&amp; pkgname) const;
-<span class="lineNum">     340 </span>                : 
-<span class="lineNum">     341 </span>                :     /**
-<span class="lineNum">     342 </span>                :      * Tokenize the string and build an OR query with the resulting keywords
-<span class="lineNum">     343 </span>                :      */
-<span class="lineNum">     344 </span>                :     Xapian::Query makeORQuery(const std::string&amp; keywords) const;
-<span class="lineNum">     345 </span>                : 
-<span class="lineNum">     346 </span>                :     /**
-<span class="lineNum">     347 </span>                :      * Tokenize the string and build an OR query with the resulting keywords.
-<span class="lineNum">     348 </span>                :      *
-<span class="lineNum">     349 </span>                :      * The last token in keywords is considered to be typed only partially, to
-<span class="lineNum">     350 </span>                :      * implement proper search-as-you-type.
-<span class="lineNum">     351 </span>                :      */
-<span class="lineNum">     352 </span>                :     Xapian::Query makePartialORQuery(const std::string&amp; keywords) const;
-<span class="lineNum">     353 </span>                : 
-<span class="lineNum">     354 </span>                :     /**
-<span class="lineNum">     355 </span>                :      * Build a query with the given keywords, specified as iterators of strings
-<span class="lineNum">     356 </span>                :      */
-<span class="lineNum">     357 </span>                :     template&lt;typename ITER&gt;
-<span class="lineNum">     358 </span>                :     Xapian::Query makeORQuery(const ITER&amp; begin, const ITER&amp; end) const
-<span class="lineNum">     359 </span>                :     {
-<span class="lineNum">     360 </span>                :         return Xapian::Query(Xapian::Query::OP_OR, begin, end);
-<span class="lineNum">     361 </span>                :     }
-<span class="lineNum">     362 </span>                : 
-<span class="lineNum">     363 </span>                :     /// Return a list of tag-based terms that can be used to expand an OR query
-<span class="lineNum">     364 </span>                :     std::vector&lt;std::string&gt; expand(Xapian::Enquire&amp; enq) const;
-<span class="lineNum">     365 </span>                : 
-<span class="lineNum">     366 </span>                : //      std::vector&lt;std::string&gt; similar(const std::string&amp; pkg);
-<span class="lineNum">     367 </span>                : 
-<span class="lineNum">     368 </span>                :     /**
-<span class="lineNum">     369 </span>                :      * Create a query to look for packages similar to the given one
-<span class="lineNum">     370 </span>                :      */
-<span class="lineNum">     371 </span>                :     Xapian::Query makeRelatedQuery(const std::string&amp; pkgname) const;
-<span class="lineNum">     372 </span>                : 
-<span class="lineNum">     373 </span>                :     /**
-<span class="lineNum">     374 </span>                :      * Get the integer value for
-<span class="lineNum">     375 </span>                :      */
-<span class="lineNum">     376 </span>                :     double getDoubleValue(const std::string&amp; pkgname,
-<span class="lineNum">     377 </span>                :                           Xapian::valueno val_id) const;
-<span class="lineNum">     378 </span>                : 
-<span class="lineNum">     379 </span>                :     /**
-<span class="lineNum">     380 </span>                :      * Get the integer value for
-<span class="lineNum">     381 </span>                :      */
-<span class="lineNum">     382 </span>                :     int getIntValue(const std::string&amp; pkgname, Xapian::valueno val_id) const;
-<span class="lineNum">     383 </span>                : };
-<span class="lineNum">     384 </span>                : 
-<span class="lineNum">     385 </span>                : }
-<span class="lineNum">     386 </span>                : }
-<span class="lineNum">     387 </span>                : }
-<span class="lineNum">     388 </span>                : 
-<span class="lineNum">     389 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/core/xapian.test.h.gcov.html b/rep/ept/core/xapian.test.h.gcov.html
deleted file mode 100644
index 17fc9dd..0000000
--- a/rep/ept/core/xapian.test.h.gcov.html
+++ /dev/null
@@ -1,141 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/core/xapian.test.h</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/core</a> - xapian.test.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">36</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">36</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- C++ -*-
-<span class="lineNum">       2 </span>                : #include &lt;ept/test.h&gt;
-<span class="lineNum">       3 </span>                : #include &lt;ept/core/list.h&gt;
-<span class="lineNum">       4 </span>                : #include &lt;ept/core/xapian.h&gt;
-<span class="lineNum">       5 </span>                : 
-<span class="lineNum">       6 </span>                : // TODO temporary, for building test database
-<span class="lineNum">       7 </span>                : #include &lt;ept/apt/apt.h&gt;
-<span class="lineNum">       8 </span>                : #include &lt;ept/textsearch/textsearch.h&gt;
-<span class="lineNum">       9 </span>                : #include &lt;ept/textsearch/maint/path.h&gt;
-<span class="lineNum">      10 </span>                : 
-<span class="lineNum">      11 </span>                : using namespace ept;
-<span class="lineNum">      12 </span>                : using namespace core;
-<span class="lineNum">      13 </span>                : 
-<span class="lineNum">      14 </span>                : namespace ept {
-<span class="lineNum">      15 </span>                : namespace textsearch {
-<span class="lineNum">      16 </span>                : extern size_t max_index;
-<span class="lineNum">      17 </span>                : }
-<span class="lineNum">      18 </span>                : }
-<span class="lineNum">      19 </span>                : 
-<span class="lineNum">      20 </span><span class="lineCov">              4 : struct XapianTestEnvironment : AptTestEnvironment {</span>
-<span class="lineNum">      21 </span>                :     textsearch::Path::OverrideIndexDir oid;
-<span class="lineNum">      22 </span>                :     textsearch::TextSearch textsearch;
-<span class="lineNum">      23 </span>                :     apt::Apt apt;
-<span class="lineNum">      24 </span><span class="lineCov">              4 :     XapianTestEnvironment()</span>
-<span class="lineNum">      25 </span><span class="lineCov">              4 :         : oid( TEST_ENV_DIR &quot;xapian&quot; )</span>
-<span class="lineNum">      26 </span>                :     {
-<span class="lineNum">      27 </span><span class="lineCov">              4 :         ept::textsearch::max_index = 1000;</span>
-<span class="lineNum">      28 </span><span class="lineCov">              4 :         textsearch.rebuildIfNeeded(apt);</span>
-<span class="lineNum">      29 </span><span class="lineCov">              4 :     }</span>
-<span class="lineNum">      30 </span>                : };
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span><span class="lineCov">              4 : struct TestXapian : XapianTestEnvironment {</span>
-<span class="lineNum">      33 </span>                :     xapian::Source xap;
-<span class="lineNum">      34 </span>                :     xapian::Query query;
-<span class="lineNum">      35 </span>                : 
-<span class="lineNum">      36 </span><span class="lineCov">              4 :     TestXapian() : query( xap.db() )</span>
-<span class="lineNum">      37 </span>                :     {
-<span class="lineNum">      38 </span><span class="lineCov">              4 :         query = xap.query( &quot;sgml tool&quot; );</span>
-<span class="lineNum">      39 </span><span class="lineCov">              4 :     }</span>
-<span class="lineNum">      40 </span>                : 
-<span class="lineNum">      41 </span><span class="lineCov">              1 :     Test enquire() {</span>
-<span class="lineNum">      42 </span><span class="lineCov">              1 :         query.updateEnquire();</span>
-<span class="lineNum">      43 </span><span class="lineCov">              1 :         Xapian::MSet matches = query.m_enq.get_mset(0, 100);</span>
-<span class="lineNum">      44 </span><span class="lineCov">              1 :         assert( matches.size() &gt; 0 );</span>
-<span class="lineNum">      45 </span><span class="lineCov">              2 :         assert_eq( matches.begin().get_document().get_data(), &quot;psgml&quot; );</span>
-<span class="lineNum">      46 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      47 </span>                : 
-<span class="lineNum">      48 </span><span class="lineCov">              1 :     Test listCount() {</span>
-<span class="lineNum">      49 </span><span class="lineCov">              1 :         xapian::List l( query.results() );</span>
-<span class="lineNum">      50 </span><span class="lineCov">              1 :         Xapian::MSet matches = query.m_enq.get_mset(0, 6000);</span>
-<span class="lineNum">      51 </span><span class="lineCov">              1 :         assert_eq( list::count( l ), matches.size() );</span>
-<span class="lineNum">      52 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      53 </span>                : 
-<span class="lineNum">      54 </span>                :     template&lt; typename List &gt;
-<span class="lineNum">      55 </span><span class="lineCov">              1 :     void checkXapianList( List l, Xapian::MSet m ) {</span>
-<span class="lineNum">      56 </span><span class="lineCov">              1 :         Xapian::MSet::const_iterator i = m.begin();</span>
-<span class="lineNum">      57 </span><span class="lineCov">             16 :         while (! l.empty() ) {</span>
-<span class="lineNum">      58 </span><span class="lineCov">             14 :             assert_eq( l.token().package(), i.get_document().get_data() );</span>
-<span class="lineNum">      59 </span><span class="lineCov">             14 :             l = l.tail();</span>
-<span class="lineNum">      60 </span><span class="lineCov">             15 :             ++ i;</span>
-<span class="lineNum">      61 </span>                :         }
-<span class="lineNum">      62 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      63 </span>                : 
-<span class="lineNum">      64 </span><span class="lineCov">              1 :     Test list() {</span>
-<span class="lineNum">      65 </span><span class="lineCov">              1 :         xapian::List l( query.results() );</span>
-<span class="lineNum">      66 </span><span class="lineCov">              1 :         Xapian::MSet matches = query.m_enq.get_mset(0, 6000);</span>
-<span class="lineNum">      67 </span><span class="lineCov">              1 :         checkXapianList( l, matches );</span>
-<span class="lineNum">      68 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      69 </span>                : 
-<span class="lineNum">      70 </span><span class="lineCov">              1 :     Test checkQuery() {</span>
-<span class="lineNum">      71 </span><span class="lineCov">              1 :         assert_eq( xap.query( &quot;sgml tool&quot; ).results().token().package(), &quot;psgml&quot; );</span>
-<span class="lineNum">      72 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">      73 </span>                : 
-<span class="lineNum">      74 </span>                : };
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/debtags/debtags.cc.gcov.html b/rep/ept/debtags/debtags.cc.gcov.html
deleted file mode 100644
index a924a43..0000000
--- a/rep/ept/debtags/debtags.cc.gcov.html
+++ /dev/null
@@ -1,317 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/debtags/debtags.cc</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/debtags</a> - debtags.cc</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">81</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">48.1 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">39</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /** -*- C++ -*-
-<span class="lineNum">       2 </span>                :  * @file
-<span class="lineNum">       3 </span>                :  * @author Enrico Zini (enrico) &lt;enrico@enricozini.org&gt;
-<span class="lineNum">       4 </span>                :  */
-<span class="lineNum">       5 </span>                : 
-<span class="lineNum">       6 </span>                : /*
-<span class="lineNum">       7 </span>                :  * System tag database
-<span class="lineNum">       8 </span>                :  *
-<span class="lineNum">       9 </span>                :  * Copyright (C) 2003-2008  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">      10 </span>                :  *
-<span class="lineNum">      11 </span>                :  * This library is free software; you can redistribute it and/or
-<span class="lineNum">      12 </span>                :  * modify it under the terms of the GNU Lesser General Public
-<span class="lineNum">      13 </span>                :  * License as published by the Free Software Foundation; either
-<span class="lineNum">      14 </span>                :  * version 2.1 of the License, or (at your option) any later version.
-<span class="lineNum">      15 </span>                :  *
-<span class="lineNum">      16 </span>                :  * This library is distributed in the hope that it will be useful,
-<span class="lineNum">      17 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      18 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-<span class="lineNum">      19 </span>                :  * Lesser General Public License for more details.
-<span class="lineNum">      20 </span>                :  *
-<span class="lineNum">      21 </span>                :  * You should have received a copy of the GNU Lesser General Public
-<span class="lineNum">      22 </span>                :  * License along with this library; if not, write to the Free Software
-<span class="lineNum">      23 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
-<span class="lineNum">      24 </span>                :  */
-<span class="lineNum">      25 </span>                : 
-<span class="lineNum">      26 </span>                : #include &lt;ept/debtags/debtags.h&gt;
-<span class="lineNum">      27 </span>                : #include &lt;ept/debtags/maint/path.h&gt;
-<span class="lineNum">      28 </span>                : #include &lt;ept/debtags/maint/serializer.h&gt;
-<span class="lineNum">      29 </span>                : #include &lt;ept/debtags/maint/debtagsindexer.h&gt;
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : #include &lt;tagcoll/input/stdio.h&gt;
-<span class="lineNum">      32 </span>                : #include &lt;tagcoll/TextFormat.h&gt;
-<span class="lineNum">      33 </span>                : 
-<span class="lineNum">      34 </span>                : #include &lt;wibble/sys/fs.h&gt;
-<span class="lineNum">      35 </span>                : #include &lt;wibble/string.h&gt;
-<span class="lineNum">      36 </span>                : 
-<span class="lineNum">      37 </span>                : #include &lt;iostream&gt;
-<span class="lineNum">      38 </span>                : #include &lt;sstream&gt;
-<span class="lineNum">      39 </span>                : 
-<span class="lineNum">      40 </span>                : #include &lt;sys/wait.h&gt;     // WIFEXITED WEXITSTATUS
-<span class="lineNum">      41 </span>                : #include &lt;sys/types.h&gt;    // getpwuid, stat, mkdir, getuid
-<span class="lineNum">      42 </span>                : #include &lt;sys/stat.h&gt;     // stat, mkdir
-<span class="lineNum">      43 </span>                : #include &lt;pwd.h&gt;  // getpwuid
-<span class="lineNum">      44 </span>                : #include &lt;unistd.h&gt;       // stat, getuid
-<span class="lineNum">      45 </span>                : 
-<span class="lineNum">      46 </span>                : 
-<span class="lineNum">      47 </span>                : using namespace std;
-<span class="lineNum">      48 </span>                : using namespace tagcoll;
-<span class="lineNum">      49 </span>                : using namespace wibble;
-<span class="lineNum">      50 </span>                : 
-<span class="lineNum">      51 </span>                : namespace ept {
-<span class="lineNum">      52 </span>                : namespace debtags {
-<span class="lineNum">      53 </span>                : 
-<span class="lineNum">      54 </span><span class="lineCov">             10 : Debtags::Debtags(bool editable)</span>
-<span class="lineNum">      55 </span><span class="lineCov">             10 :         : m_coll(m_rocoll)</span>
-<span class="lineNum">      56 </span>                : {
-<span class="lineNum">      57 </span><span class="lineCov">             10 :         std::string tagfname;</span>
-<span class="lineNum">      58 </span><span class="lineCov">             10 :         std::string idxfname;</span>
-<span class="lineNum">      59 </span>                : 
-<span class="lineNum">      60 </span><span class="lineCov">             10 :         if (!DebtagsIndexer::obtainWorkingDebtags(vocabulary(), tagfname, idxfname))</span>
-<span class="lineNum">      61 </span>                :         {
-<span class="lineNum">      62 </span><span class="lineCov">              1 :                 m_timestamp = 0;</span>
-<span class="lineNum">      63 </span><span class="lineCov">              1 :                 return;</span>
-<span class="lineNum">      64 </span>                :         } else {
-<span class="lineNum">      65 </span><span class="lineCov">              9 :                 m_timestamp = Path::timestamp(idxfname);</span>
-<span class="lineNum">      66 </span>                : 
-<span class="lineNum">      67 </span><span class="lineCov">              9 :                 mastermmap.init(idxfname);</span>
-<span class="lineNum">      68 </span>                : 
-<span class="lineNum">      69 </span>                :                 // Initialize the readonly index
-<span class="lineNum">      70 </span><span class="lineCov">              9 :                 m_pkgid.init(mastermmap, 0);</span>
-<span class="lineNum">      71 </span><span class="lineCov">              9 :                 m_rocoll.init(mastermmap, 1, 2);</span>
-<span class="lineNum">      72 </span>                :         }
-<span class="lineNum">      73 </span>                : 
-<span class="lineNum">      74 </span>                :         // Initialize the patch collection layer
-<span class="lineNum">      75 </span><span class="lineCov">              9 :         rcdir = Path::debtagsUserSourceDir();</span>
-<span class="lineNum">      76 </span>                : 
-<span class="lineNum">      77 </span><span class="lineCov">              9 :         string patchFile = str::joinpath(rcdir, &quot;patch&quot;);</span>
-<span class="lineNum">      78 </span><span class="lineCov">             18 :         if (Path::access(patchFile, F_OK) == 0)</span>
-<span class="lineNum">      79 </span>                :         {
-<span class="lineNum">      80 </span><span class="lineNoCov">              0 :                 input::Stdio in(patchFile);</span>
-<span class="lineNum">      81 </span><span class="lineNoCov">              0 :                 PatchList&lt;int, int&gt; patch;</span>
-<span class="lineNum">      82 </span><span class="lineNoCov">              0 :                 textformat::parsePatch(in, patchStringToInt(m_pkgid, vocabulary(), inserter(patch)));</span>
-<span class="lineNum">      83 </span><span class="lineNoCov">              0 :                 m_coll.setChanges(patch);</span>
-<span class="lineNum">      84 </span><span class="lineCov">              9 :         }</span>
-<span class="lineNum">      85 </span><span class="lineNoCov">              0 : }</span>
-<span class="lineNum">      86 </span>                : 
-<span class="lineNum">      87 </span><span class="lineCov">              3 : tagcoll::PatchList&lt;std::string, Tag&gt; Debtags::changes() const</span>
-<span class="lineNum">      88 </span>                : {
-<span class="lineNum">      89 </span><span class="lineCov">              3 :         tagcoll::PatchList&lt;int, int&gt; patches = m_coll.changes();</span>
-<span class="lineNum">      90 </span><span class="lineCov">              3 :         tagcoll::PatchList&lt;std::string, Tag&gt; res;</span>
-<span class="lineNum">      91 </span>                : 
-<span class="lineNum">      92 </span><span class="lineCov">              5 :         for (tagcoll::PatchList&lt;int, int&gt;::const_iterator i = patches.begin();</span>
-<span class="lineNum">      93 </span>                :                         i != patches.end(); ++i)
-<span class="lineNum">      94 </span>                :         {
-<span class="lineNum">      95 </span><span class="lineCov">              2 :                 std::string pkg = packageByID(i-&gt;second.item);</span>
-<span class="lineNum">      96 </span><span class="lineCov">              2 :                 if (pkg.empty())</span>
-<span class="lineNum">      97 </span><span class="lineNoCov">              0 :                         continue;</span>
-<span class="lineNum">      98 </span>                : 
-<span class="lineNum">      99 </span>                :                 res.addPatch(tagcoll::Patch&lt;std::string, Tag&gt;(pkg,
-<span class="lineNum">     100 </span>                :                         vocabulary().tagsByID(i-&gt;second.added),
-<span class="lineNum">     101 </span><span class="lineCov">              2 :                         vocabulary().tagsByID(i-&gt;second.removed)));</span>
-<span class="lineNum">     102 </span>                :         }
-<span class="lineNum">     103 </span>                : 
-<span class="lineNum">     104 </span><span class="lineCov">              3 :         return res;</span>
-<span class="lineNum">     105 </span>                : }
-<span class="lineNum">     106 </span>                : 
-<span class="lineNum">     107 </span>                : 
-<span class="lineNum">     108 </span>                : #if 0
-<span class="lineNum">     109 </span>                : bool Debtags::hasTagDatabase()
-<span class="lineNum">     110 </span>                : {
-<span class="lineNum">     111 </span>                :         if (Path::access(Path::tagdb(), R_OK) == -1)
-<span class="lineNum">     112 </span>                :         {
-<span class="lineNum">     113 </span>                :                 std::cerr &lt;&lt; &quot;Missing tag database &quot; &lt;&lt; Path::tagdb() &lt;&lt; std::endl;
-<span class="lineNum">     114 </span>                :                 return false;
-<span class="lineNum">     115 </span>                :         }
-<span class="lineNum">     116 </span>                :         if (Path::access(Path::tagdbIndex(), R_OK) == -1)
-<span class="lineNum">     117 </span>                :         {
-<span class="lineNum">     118 </span>                :                 std::cerr &lt;&lt; &quot;Missing tag database index &quot; &lt;&lt; Path::tagdbIndex() &lt;&lt; std::endl;
-<span class="lineNum">     119 </span>                :                 return false;
-<span class="lineNum">     120 </span>                :         }
-<span class="lineNum">     121 </span>                :         if (Path::access(Path::vocabulary(), R_OK) == -1)
-<span class="lineNum">     122 </span>                :         {
-<span class="lineNum">     123 </span>                :                 std::cerr &lt;&lt; &quot;Missing tag vocabulary &quot; &lt;&lt; Path::vocabulary() &lt;&lt; std::endl;
-<span class="lineNum">     124 </span>                :                 return false;
-<span class="lineNum">     125 </span>                :         }
-<span class="lineNum">     126 </span>                :         if (Path::access(Path::vocabularyIndex(), R_OK) == -1)
-<span class="lineNum">     127 </span>                :         {
-<span class="lineNum">     128 </span>                :                 std::cerr &lt;&lt; &quot;Missing index for tag vocabulary &quot; &lt;&lt; Path::vocabularyIndex() &lt;&lt; std::endl;
-<span class="lineNum">     129 </span>                :                 return false;
-<span class="lineNum">     130 </span>                :         }
-<span class="lineNum">     131 </span>                :         return true;
-<span class="lineNum">     132 </span>                : }
-<span class="lineNum">     133 </span>                : #endif
-<span class="lineNum">     134 </span>                : 
-<span class="lineNum">     135 </span>                : 
-<span class="lineNum">     136 </span><span class="lineCov">              1 : void Debtags::savePatch()</span>
-<span class="lineNum">     137 </span>                : {
-<span class="lineNum">     138 </span><span class="lineCov">              1 :         PatchList&lt;std::string, std::string&gt; spatch;</span>
-<span class="lineNum">     139 </span><span class="lineCov">              1 :         m_coll.changes().output(patchIntToString(m_pkgid, vocabulary(), tagcoll::inserter(spatch)));</span>
-<span class="lineNum">     140 </span><span class="lineCov">              1 :         savePatch(spatch);</span>
-<span class="lineNum">     141 </span><span class="lineCov">              1 : }</span>
-<span class="lineNum">     142 </span>                : 
-<span class="lineNum">     143 </span><span class="lineCov">              1 : void Debtags::savePatch(const PatchList&lt;std::string, std::string&gt;&amp; patch)</span>
-<span class="lineNum">     144 </span>                : {
-<span class="lineNum">     145 </span><span class="lineCov">              1 :         std::string patchFile = str::joinpath(rcdir, &quot;patch&quot;);</span>
-<span class="lineNum">     146 </span><span class="lineCov">              1 :         std::string backup = patchFile + &quot;~&quot;;</span>
-<span class="lineNum">     147 </span>                : 
-<span class="lineNum">     148 </span><span class="lineCov">              1 :         wibble::sys::fs::mkFilePath(patchFile);</span>
-<span class="lineNum">     149 </span>                : 
-<span class="lineNum">     150 </span><span class="lineCov">              1 :         if (access(patchFile.c_str(), F_OK) == 0)</span>
-<span class="lineNum">     151 </span><span class="lineNoCov">              0 :                 if (rename(patchFile.c_str(), backup.c_str()) == -1)</span>
-<span class="lineNum">     152 </span><span class="lineNoCov">              0 :                         throw wibble::exception::System(&quot;Can't rename &quot; + patchFile + &quot; to &quot; + backup);</span>
-<span class="lineNum">     153 </span>                : 
-<span class="lineNum">     154 </span>                :         try {
-<span class="lineNum">     155 </span><span class="lineCov">              1 :                 FILE* out = fopen(patchFile.c_str(), &quot;w&quot;);</span>
-<span class="lineNum">     156 </span><span class="lineCov">              1 :                 if (out == 0)</span>
-<span class="lineNum">     157 </span><span class="lineNoCov">              0 :                         throw wibble::exception::System(&quot;Can't write to &quot; + patchFile);</span>
-<span class="lineNum">     158 </span>                : 
-<span class="lineNum">     159 </span><span class="lineCov">              1 :                 textformat::outputPatch(patch, out);</span>
-<span class="lineNum">     160 </span>                : 
-<span class="lineNum">     161 </span><span class="lineCov">              1 :                 fclose(out);</span>
-<span class="lineNum">     162 </span><span class="lineNoCov">              0 :         } catch (std::exception&amp; e) {</span>
-<span class="lineNum">     163 </span><span class="lineNoCov">              0 :                 if (rename(backup.c_str(), patchFile.c_str()) == -1)</span>
-<span class="lineNum">     164 </span><span class="lineNoCov">              0 :             std::cerr &lt;&lt; &quot;Warning: Cannot restore previous backup copy: &quot; &lt;&lt; e.what() &lt;&lt; std::endl;</span>
-<span class="lineNum">     165 </span><span class="lineNoCov">              0 :                 throw;</span>
-<span class="lineNum">     166 </span><span class="lineCov">              1 :         }</span>
-<span class="lineNum">     167 </span><span class="lineCov">              1 : }</span>
-<span class="lineNum">     168 </span>                : 
-<span class="lineNum">     169 </span><span class="lineNoCov">              0 : void Debtags::savePatch(const PatchList&lt;std::string, Tag&gt;&amp; patch)</span>
-<span class="lineNum">     170 </span>                : {
-<span class="lineNum">     171 </span><span class="lineNoCov">              0 :         PatchList&lt;std::string, std::string&gt; spatch;</span>
-<span class="lineNum">     172 </span>                :         // patch.output(patchToString&lt;C&gt;(m_pkgs, m_pkgidx, m_tags, tagcoll::inserter(spatch)));
-<span class="lineNum">     173 </span><span class="lineNoCov">              0 :         savePatch(spatch);</span>
-<span class="lineNum">     174 </span><span class="lineNoCov">              0 : }</span>
-<span class="lineNum">     175 </span>                : 
-<span class="lineNum">     176 </span><span class="lineNoCov">              0 : void Debtags::sendPatch()</span>
-<span class="lineNum">     177 </span>                : {
-<span class="lineNum">     178 </span><span class="lineNoCov">              0 :         PatchList&lt;std::string, std::string&gt; spatch;</span>
-<span class="lineNum">     179 </span><span class="lineNoCov">              0 :         m_coll.changes().output(patchIntToString(m_pkgid, vocabulary(), tagcoll::inserter(spatch)));</span>
-<span class="lineNum">     180 </span><span class="lineNoCov">              0 :         if (!spatch.empty())</span>
-<span class="lineNum">     181 </span>                :         {
-<span class="lineNum">     182 </span><span class="lineNoCov">              0 :                 sendPatch(spatch);</span>
-<span class="lineNum">     183 </span><span class="lineNoCov">              0 :         }</span>
-<span class="lineNum">     184 </span><span class="lineNoCov">              0 : }</span>
-<span class="lineNum">     185 </span>                : 
-<span class="lineNum">     186 </span><span class="lineNoCov">              0 : void Debtags::sendPatch(const PatchList&lt;std::string, Tag&gt;&amp; patch)</span>
-<span class="lineNum">     187 </span>                : {
-<span class="lineNum">     188 </span><span class="lineNoCov">              0 :         PatchList&lt;std::string, std::string&gt; spatch;</span>
-<span class="lineNum">     189 </span>                :         // patch.output(patchToString&lt;C&gt;(m_pkgs, m_pkgidx, m_tags, tagcoll::inserter(spatch)));
-<span class="lineNum">     190 </span><span class="lineNoCov">              0 :         sendPatch(spatch);</span>
-<span class="lineNum">     191 </span><span class="lineNoCov">              0 : }</span>
-<span class="lineNum">     192 </span>                : 
-<span class="lineNum">     193 </span><span class="lineNoCov">              0 : void Debtags::sendPatch(const PatchList&lt;std::string, std::string&gt;&amp; patch)</span>
-<span class="lineNum">     194 </span>                : {
-<span class="lineNum">     195 </span>                :         static const char* cmd = &quot;/usr/sbin/sendmail -t&quot;;
-<span class="lineNum">     196 </span><span class="lineNoCov">              0 :         FILE* out = popen(cmd, &quot;w&quot;);</span>
-<span class="lineNum">     197 </span><span class="lineNoCov">              0 :         if (out == 0)</span>
-<span class="lineNum">     198 </span><span class="lineNoCov">              0 :                 throw wibble::exception::System(std::string(&quot;trying to run `&quot;) + cmd + &quot;'&quot;);</span>
-<span class="lineNum">     199 </span>                : 
-<span class="lineNum">     200 </span><span class="lineNoCov">              0 :         struct passwd* udata = getpwuid(getuid());</span>
-<span class="lineNum">     201 </span>                : 
-<span class="lineNum">     202 </span>                :         fprintf(out,
-<span class="lineNum">     203 </span>                :                         &quot;To: enrico-debtags@debian.org\n&quot;
-<span class="lineNum">     204 </span>                :                         &quot;Bcc: %s\n&quot;
-<span class="lineNum">     205 </span>                :                         &quot;Subject: Tag patch\n&quot;
-<span class="lineNum">     206 </span>                :                         &quot;Mime-Version: 1.0\n&quot;
-<span class="lineNum">     207 </span>                :                         &quot;Content-Type: multipart/mixed; boundary=\&quot;9amGYk9869ThD9tj\&quot;\n&quot;
-<span class="lineNum">     208 </span>                :                         &quot;Content-Disposition: inline\n&quot;
-<span class="lineNum">     209 </span>                :                         &quot;X-Mailer: debtags-edit\n\n&quot;
-<span class="lineNum">     210 </span>                :                         &quot;This mail contains a Debtags patch for the central archive\n\n&quot;
-<span class="lineNum">     211 </span>                :                         &quot;--9amGYk9869ThD9tj\n&quot;
-<span class="lineNum">     212 </span>                :                         &quot;Content-Type: text/plain; charset=utf-8\n&quot;
-<span class="lineNum">     213 </span>                :                         &quot;Content-Disposition: inline\n\n&quot;
-<span class="lineNum">     214 </span><span class="lineNoCov">              0 :                         &quot;-- DEBTAGS DIFF V0.1 --\n&quot;, udata-&gt;pw_name);</span>
-<span class="lineNum">     215 </span>                : 
-<span class="lineNum">     216 </span><span class="lineNoCov">              0 :         textformat::outputPatch(patch, out);</span>
-<span class="lineNum">     217 </span>                : 
-<span class="lineNum">     218 </span><span class="lineNoCov">              0 :         fprintf(out, &quot;\n--9amGYk9869ThD9tj\n&quot;);</span>
-<span class="lineNum">     219 </span>                : 
-<span class="lineNum">     220 </span><span class="lineNoCov">              0 :         int res = pclose(out);</span>
-<span class="lineNum">     221 </span><span class="lineNoCov">              0 :         if (!WIFEXITED(res) || WEXITSTATUS(res) != 0)</span>
-<span class="lineNum">     222 </span>                :         {
-<span class="lineNum">     223 </span><span class="lineNoCov">              0 :                 std::stringstream str;</span>
-<span class="lineNum">     224 </span><span class="lineNoCov">              0 :                 str &lt;&lt; res;</span>
-<span class="lineNum">     225 </span><span class="lineNoCov">              0 :                 throw wibble::exception::Consistency(&quot;checking mailer exit status&quot;, &quot;sendmail returned nonzero (&quot; + str.str() + &quot;): the mail may have not been sent&quot;);</span>
-<span class="lineNum">     226 </span>                :         }
-<span class="lineNum">     227 </span><span class="lineNoCov">              0 : }</span>
-<span class="lineNum">     228 </span>                : 
-<span class="lineNum">     229 </span>                : 
-<span class="lineNum">     230 </span>                : template&lt;typename OUT&gt;
-<span class="lineNum">     231 </span>                : void Debtags::outputSystem(const OUT&amp; cons)
-<span class="lineNum">     232 </span>                : {
-<span class="lineNum">     233 </span>                :         m_rocoll.output(intToPkg(m_pkgid, vocabulary(), cons));
-<span class="lineNum">     234 </span>                : }
-<span class="lineNum">     235 </span>                : 
-<span class="lineNum">     236 </span>                : template&lt;typename OUT&gt;
-<span class="lineNum">     237 </span>                : void Debtags::outputPatched(const OUT&amp; cons)
-<span class="lineNum">     238 </span>                : {
-<span class="lineNum">     239 </span>                :         m_coll.output(intToPkg(m_pkgid, vocabulary(), cons));
-<span class="lineNum">     240 </span>                : }
-<span class="lineNum">     241 </span>                : 
-<span class="lineNum">     242 </span>                : }
-<span class="lineNum">     243 </span>                : }
-<span class="lineNum">     244 </span>                : 
-<span class="lineNum">     245 </span>                : #include &lt;tagcoll/patch.tcc&gt;
-<span class="lineNum">     246 </span>                : #include &lt;tagcoll/coll/patched.tcc&gt;
-<span class="lineNum">     247 </span>                : #include &lt;tagcoll/TextFormat.tcc&gt;
-<span class="lineNum">     248 </span>                : //#include &lt;tagcoll/stream/filters.tcc&gt;
-<span class="lineNum">     249 </span>                : 
-<span class="lineNum">     250 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/debtags/debtags.h.gcov.html b/rep/ept/debtags/debtags.h.gcov.html
deleted file mode 100644
index a115a32..0000000
--- a/rep/ept/debtags/debtags.h.gcov.html
+++ /dev/null
@@ -1,484 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/debtags/debtags.h</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/debtags</a> - debtags.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">72</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">93.1 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">67</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- mode: c++; tab-width: 4; indent-tabs-mode: t -*-
-<span class="lineNum">       2 </span>                : /* @file
-<span class="lineNum">       3 </span>                :  * @author Enrico Zini (enrico) &lt;enrico@enricozini.org&gt;
-<span class="lineNum">       4 </span>                :  */
-<span class="lineNum">       5 </span>                : 
-<span class="lineNum">       6 </span>                : /*
-<span class="lineNum">       7 </span>                :  * libpkg Debtags data provider
-<span class="lineNum">       8 </span>                :  *
-<span class="lineNum">       9 </span>                :  * Copyright (C) 2003-2007  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">      10 </span>                :  *
-<span class="lineNum">      11 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">      12 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">      13 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">      14 </span>                :  * (at your option) any later version.
-<span class="lineNum">      15 </span>                :  *
-<span class="lineNum">      16 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      17 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      18 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      19 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      20 </span>                :  *
-<span class="lineNum">      21 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      22 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      23 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      24 </span>                :  */
-<span class="lineNum">      25 </span>                : 
-<span class="lineNum">      26 </span>                : #ifndef EPT_DEBTAGS_DEBTAGS_H
-<span class="lineNum">      27 </span>                : #define EPT_DEBTAGS_DEBTAGS_H
-<span class="lineNum">      28 </span>                : 
-<span class="lineNum">      29 </span>                : #include &lt;ept/debtags/tag.h&gt;
-<span class="lineNum">      30 </span>                : #include &lt;ept/debtags/vocabulary.h&gt;
-<span class="lineNum">      31 </span>                : #include &lt;ept/debtags/maint/pkgid.h&gt;
-<span class="lineNum">      32 </span>                : 
-<span class="lineNum">      33 </span>                : #include &lt;tagcoll/coll/base.h&gt;
-<span class="lineNum">      34 </span>                : #include &lt;tagcoll/coll/intdiskindex.h&gt;
-<span class="lineNum">      35 </span>                : #include &lt;tagcoll/coll/patched.h&gt;
-<span class="lineNum">      36 </span>                : 
-<span class="lineNum">      37 </span>                : namespace ept {
-<span class="lineNum">      38 </span>                : namespace debtags {
-<span class="lineNum">      39 </span>                : class Debtags;
-<span class="lineNum">      40 </span>                : }
-<span class="lineNum">      41 </span>                : }
-<span class="lineNum">      42 </span>                : 
-<span class="lineNum">      43 </span>                : namespace tagcoll {
-<span class="lineNum">      44 </span>                : template&lt; typename _, typename _1 &gt; class PatchList;
-<span class="lineNum">      45 </span>                : 
-<span class="lineNum">      46 </span>                : namespace coll {
-<span class="lineNum">      47 </span>                : 
-<span class="lineNum">      48 </span>                : template&lt;&gt;
-<span class="lineNum">      49 </span>                : struct coll_traits&lt; ept::debtags::Debtags &gt;
-<span class="lineNum">      50 </span>                : {
-<span class="lineNum">      51 </span>                :         typedef std::string item_type;
-<span class="lineNum">      52 </span>                :         typedef ept::debtags::Tag tag_type;
-<span class="lineNum">      53 </span>                :         typedef std::set&lt; ept::debtags::Tag &gt; tagset_type;
-<span class="lineNum">      54 </span>                :         typedef std::set&lt; std::string &gt; itemset_type;
-<span class="lineNum">      55 </span>                : };
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span>                : }
-<span class="lineNum">      58 </span>                : }
-<span class="lineNum">      59 </span>                : 
-<span class="lineNum">      60 </span>                : namespace ept {
-<span class="lineNum">      61 </span>                : namespace debtags {
-<span class="lineNum">      62 </span>                : 
-<span class="lineNum">      63 </span>                : /**
-<span class="lineNum">      64 </span>                :  * Access the on-disk Debtags tag database.
-<span class="lineNum">      65 </span>                :  *
-<span class="lineNum">      66 </span>                :  * The database is normally found in /var/lib/debtags.
-<span class="lineNum">      67 </span>                :  *
-<span class="lineNum">      68 </span>                :  * Tags and Facets are returned as Tag and Facet objects.  The objects follow
-<span class="lineNum">      69 </span>                :  * the flyweight pattern and access the data contained in the Vocabulary
-<span class="lineNum">      70 </span>                :  * instantiated inside Debtags.
-<span class="lineNum">      71 </span>                :  *
-<span class="lineNum">      72 </span>                :  * It is possible to get a reference to the Vocabulary object using the
-<span class="lineNum">      73 </span>                :  * vocabulary() method.
-<span class="lineNum">      74 </span>                :  */
-<span class="lineNum">      75 </span>                : class Debtags : public tagcoll::coll::Collection&lt;Debtags&gt;
-<span class="lineNum">      76 </span>                : {
-<span class="lineNum">      77 </span>                : protected:
-<span class="lineNum">      78 </span>                :         // Master mmap index container
-<span class="lineNum">      79 </span>                :         tagcoll::diskindex::MasterMMap mastermmap;
-<span class="lineNum">      80 </span>                : 
-<span class="lineNum">      81 </span>                :         // Debtags database
-<span class="lineNum">      82 </span>                :         tagcoll::coll::IntDiskIndex m_rocoll;
-<span class="lineNum">      83 </span>                :         tagcoll::coll::Patched&lt; tagcoll::coll::IntDiskIndex &gt; m_coll;
-<span class="lineNum">      84 </span>                : 
-<span class="lineNum">      85 </span>                :         // Package name to ID mapping
-<span class="lineNum">      86 </span>                :         PkgId m_pkgid;
-<span class="lineNum">      87 </span>                : 
-<span class="lineNum">      88 </span>                :         // Tag vocabulary
-<span class="lineNum">      89 </span>                :         Vocabulary m_voc;
-<span class="lineNum">      90 </span>                : 
-<span class="lineNum">      91 </span>                :         // User rc directory to store patches
-<span class="lineNum">      92 </span>                :         std::string rcdir;
-<span class="lineNum">      93 </span>                : 
-<span class="lineNum">      94 </span>                :         // Last modification timestamp of the index
-<span class="lineNum">      95 </span>                :         time_t m_timestamp;
-<span class="lineNum">      96 </span>                : 
-<span class="lineNum">      97 </span><span class="lineCov">          84710 :         std::string packageByID(int id) const</span>
-<span class="lineNum">      98 </span>                :         {
-<span class="lineNum">      99 </span><span class="lineCov">          84710 :                 return m_pkgid.byID(id);</span>
-<span class="lineNum">     100 </span>                :         }
-<span class="lineNum">     101 </span>                : 
-<span class="lineNum">     102 </span>                :         template&lt;typename IDS&gt;
-<span class="lineNum">     103 </span><span class="lineCov">              2 :         std::set&lt;std::string&gt; packagesById(const IDS&amp; ids) const</span>
-<span class="lineNum">     104 </span>                :         {
-<span class="lineNum">     105 </span><span class="lineCov">              2 :                 std::set&lt;std::string&gt; pkgs;</span>
-<span class="lineNum">     106 </span><span class="lineCov">            130 :                 for (typename IDS::const_iterator i = ids.begin();</span>
-<span class="lineNum">     107 </span>                :                                 i != ids.end(); ++i)
-<span class="lineNum">     108 </span><span class="lineCov">            128 :                         pkgs.insert(packageByID(*i));</span>
-<span class="lineNum">     109 </span><span class="lineNoCov">              0 :                 return pkgs;</span>
-<span class="lineNum">     110 </span>                :         }
-<span class="lineNum">     111 </span>                : 
-<span class="lineNum">     112 </span><span class="lineCov">              8 :         int idByPackage(const std::string&amp; pkg) const</span>
-<span class="lineNum">     113 </span>                :         {
-<span class="lineNum">     114 </span><span class="lineCov">              8 :                 return m_pkgid.byName(pkg);</span>
-<span class="lineNum">     115 </span>                :         }
-<span class="lineNum">     116 </span>                : 
-<span class="lineNum">     117 </span>                :         template&lt;typename PKGS&gt;
-<span class="lineNum">     118 </span><span class="lineCov">              1 :         std::set&lt;int&gt; idsByPackages(const PKGS&amp; pkgs) const</span>
-<span class="lineNum">     119 </span>                :         {
-<span class="lineNum">     120 </span><span class="lineCov">              1 :                 std::set&lt;int&gt; ids;</span>
-<span class="lineNum">     121 </span><span class="lineCov">              2 :                 for (typename PKGS::const_iterator i = pkgs.begin();</span>
-<span class="lineNum">     122 </span>                :                                 i != pkgs.end(); ++i)
-<span class="lineNum">     123 </span><span class="lineCov">              1 :                         ids.insert(idByPackage(*i));</span>
-<span class="lineNum">     124 </span><span class="lineNoCov">              0 :                 return ids;</span>
-<span class="lineNum">     125 </span>                :         }
-<span class="lineNum">     126 </span>                : 
-<span class="lineNum">     127 </span>                : public:
-<span class="lineNum">     128 </span>                :         typedef tagcoll::coll::Patched&lt; tagcoll::coll::IntDiskIndex &gt; coll_type;
-<span class="lineNum">     129 </span>                :         typedef std::pair&lt; std::string, std::set&lt;Tag&gt; &gt; value_type;
-<span class="lineNum">     130 </span>                : 
-<span class="lineNum">     131 </span>                :         class const_iterator
-<span class="lineNum">     132 </span>                :         {
-<span class="lineNum">     133 </span>                :                 const Debtags&amp; coll;
-<span class="lineNum">     134 </span>                :                 Debtags::coll_type::const_iterator ci;
-<span class="lineNum">     135 </span>                :                 mutable const Debtags::value_type* cached_val;
-<span class="lineNum">     136 </span>                : 
-<span class="lineNum">     137 </span>                :         protected:
-<span class="lineNum">     138 </span>                :                 const_iterator(const Debtags&amp; coll,
-<span class="lineNum">     139 </span><span class="lineCov">          63443 :                                                 const Debtags::coll_type::const_iterator&amp; ci)</span>
-<span class="lineNum">     140 </span><span class="lineCov">          63443 :                         : coll(coll), ci(ci), cached_val(0) {}</span>
-<span class="lineNum">     141 </span>                : 
-<span class="lineNum">     142 </span>                :         public:
-<span class="lineNum">     143 </span><span class="lineCov">          63443 :                 ~const_iterator()</span>
-<span class="lineNum">     144 </span>                :                 {
-<span class="lineNum">     145 </span><span class="lineCov">          63443 :                         if (cached_val)</span>
-<span class="lineNum">     146 </span><span class="lineNoCov">              0 :                                 delete cached_val;</span>
-<span class="lineNum">     147 </span><span class="lineCov">          63443 :                 }</span>
-<span class="lineNum">     148 </span><span class="lineCov">          84580 :                 const Debtags::value_type operator*() const</span>
-<span class="lineNum">     149 </span>                :                 {
-<span class="lineNum">     150 </span><span class="lineCov">          84580 :                         if (cached_val)</span>
-<span class="lineNum">     151 </span><span class="lineNoCov">              0 :                                 return *cached_val;</span>
-<span class="lineNum">     152 </span>                : 
-<span class="lineNum">     153 </span><span class="lineCov">          84580 :                         return make_pair(coll.packageByID(ci-&gt;first), coll.vocabulary().tagsByID(ci-&gt;second));</span>
-<span class="lineNum">     154 </span>                :                 }
-<span class="lineNum">     155 </span><span class="lineCov">         105725 :                 const Debtags::value_type* operator-&gt;() const</span>
-<span class="lineNum">     156 </span>                :                 {
-<span class="lineNum">     157 </span><span class="lineCov">         105725 :                         if (cached_val)</span>
-<span class="lineNum">     158 </span><span class="lineCov">          42290 :                                 return cached_val;</span>
-<span class="lineNum">     159 </span><span class="lineCov">          63435 :                         return cached_val = new Debtags::value_type(*(*this));</span>
-<span class="lineNum">     160 </span>                :                 }
-<span class="lineNum">     161 </span><span class="lineCov">          63435 :                 const_iterator&amp; operator++()</span>
-<span class="lineNum">     162 </span>                :                 {
-<span class="lineNum">     163 </span><span class="lineCov">          63435 :                         ++ci;</span>
-<span class="lineNum">     164 </span><span class="lineCov">          63435 :                         if (cached_val)</span>
-<span class="lineNum">     165 </span>                :                         {
-<span class="lineNum">     166 </span><span class="lineCov">          63435 :                                 delete cached_val;</span>
-<span class="lineNum">     167 </span><span class="lineCov">          63435 :                                 cached_val = 0;</span>
-<span class="lineNum">     168 </span>                :                         }
-<span class="lineNum">     169 </span><span class="lineCov">          63435 :                         return *this;</span>
-<span class="lineNum">     170 </span>                :                 }
-<span class="lineNum">     171 </span><span class="lineCov">              1 :                 bool operator==(const const_iterator&amp; iter) const</span>
-<span class="lineNum">     172 </span>                :                 {
-<span class="lineNum">     173 </span><span class="lineCov">              1 :                         return ci == iter.ci;</span>
-<span class="lineNum">     174 </span>                :                 }
-<span class="lineNum">     175 </span><span class="lineCov">          63438 :                 bool operator!=(const const_iterator&amp; iter) const</span>
-<span class="lineNum">     176 </span>                :                 {
-<span class="lineNum">     177 </span><span class="lineCov">          63438 :                         return ci != iter.ci;</span>
-<span class="lineNum">     178 </span>                :                 }
-<span class="lineNum">     179 </span>                : 
-<span class="lineNum">     180 </span>                :                 friend class Debtags;
-<span class="lineNum">     181 </span>                :         };
-<span class="lineNum">     182 </span><span class="lineCov">              4 :         const_iterator begin() const { return const_iterator(*this, m_coll.begin()); }</span>
-<span class="lineNum">     183 </span><span class="lineCov">          63439 :         const_iterator end() const { return const_iterator(*this, m_coll.end()); }</span>
-<span class="lineNum">     184 </span>                : 
-<span class="lineNum">     185 </span>                :         /**
-<span class="lineNum">     186 </span>                :          * Create a new accessor for the on-disk Debtags database
-<span class="lineNum">     187 </span>                :          *
-<span class="lineNum">     188 </span>                :          * \param editable
-<span class="lineNum">     189 </span>                :          * Specifies if recording of modifications should be enabled.  If editable
-<span class="lineNum">     190 </span>                :          * is true, then the local state directory will be created when the object
-<span class="lineNum">     191 </span>                :          * is instantiated.
-<span class="lineNum">     192 </span>                :          */
-<span class="lineNum">     193 </span>                :     Debtags(bool editable = false);
-<span class="lineNum">     194 </span><span class="lineCov">             10 :     ~Debtags() {}</span>
-<span class="lineNum">     195 </span>                : 
-<span class="lineNum">     196 </span>                :         /// Get the timestamp of when the index was last updated
-<span class="lineNum">     197 </span><span class="lineCov">              1 :         time_t timestamp() const { return m_timestamp; }</span>
-<span class="lineNum">     198 </span>                : 
-<span class="lineNum">     199 </span>                :         /// Return true if this data source has data, false if it's empty
-<span class="lineNum">     200 </span><span class="lineCov">              1 :         bool hasData() const { return m_timestamp != 0; }</span>
-<span class="lineNum">     201 </span>                : 
-<span class="lineNum">     202 </span>                :         coll_type&amp; tagdb() { return m_coll; }
-<span class="lineNum">     203 </span>                :         const coll_type&amp; tagdb() const { return m_coll; }
-<span class="lineNum">     204 </span>                :         tagcoll::PatchList&lt;std::string, Tag&gt; changes() const;
-<span class="lineNum">     205 </span>                : 
-<span class="lineNum">     206 </span>                : #if 0
-<span class="lineNum">     207 </span>                :         template&lt;typename ITEMS, typename TAGS&gt;
-<span class="lineNum">     208 </span>                :         void insert(const ITEMS&amp; items, const TAGS&amp; tags)
-<span class="lineNum">     209 </span>                :         {
-<span class="lineNum">     210 </span>                :                 for (typename ITEMS::const_iterator i = items.begin();
-<span class="lineNum">     211 </span>                :                                 i != items.end(); ++i)
-<span class="lineNum">     212 </span>                :                         m_changes.addPatch(Patch(*i, tags, TagSet()));
-<span class="lineNum">     213 </span>                :         }
-<span class="lineNum">     214 </span>                : 
-<span class="lineNum">     215 </span>                :         template&lt;typename ITEMS&gt;
-<span class="lineNum">     216 </span>                :         void insert(const ITEMS&amp; items, const wibble::Empty&lt;Tag&gt;&amp; tags)
-<span class="lineNum">     217 </span>                :         {
-<span class="lineNum">     218 </span>                :                 // Nothing to do in this case
-<span class="lineNum">     219 </span>                :         }
-<span class="lineNum">     220 </span>                : 
-<span class="lineNum">     221 </span>                :         /**
-<span class="lineNum">     222 </span>                :          * Get the changes that have been applied to this collection
-<span class="lineNum">     223 </span>                :          */
-<span class="lineNum">     224 </span>                :         const Patches&amp; changes() const { return m_changes; }
-<span class="lineNum">     225 </span>                : 
-<span class="lineNum">     226 </span>                :         /**
-<span class="lineNum">     227 </span>                :          * Throw away all changes previously applied to this collection
-<span class="lineNum">     228 </span>                :          */
-<span class="lineNum">     229 </span>                :         void resetChanges() { m_changes.clear(); }
-<span class="lineNum">     230 </span>                : 
-<span class="lineNum">     231 </span>                :         /**
-<span class="lineNum">     232 </span>                :          * Set the changes list to a specific patch list
-<span class="lineNum">     233 </span>                :          */
-<span class="lineNum">     234 </span>                :         void setChanges(const Patches&amp; changes);
-<span class="lineNum">     235 </span>                : 
-<span class="lineNum">     236 </span>                :         /**
-<span class="lineNum">     237 </span>                :          * Add a specific patch list to the changes list
-<span class="lineNum">     238 </span>                :          */
-<span class="lineNum">     239 </span>                :         void addChanges(const Patches&amp; changes);
-<span class="lineNum">     240 </span>                : #endif
-<span class="lineNum">     241 </span>                : 
-<span class="lineNum">     242 </span>                :     bool hasTag(const Tag&amp; tag) const { return m_coll.hasTag(tag.id()); }
-<span class="lineNum">     243 </span>                : 
-<span class="lineNum">     244 </span><span class="lineCov">              5 :         std::set&lt;Tag&gt; getTagsOfItem(const std::string&amp; item) const</span>
-<span class="lineNum">     245 </span>                :         {
-<span class="lineNum">     246 </span><span class="lineCov">              5 :                 int id = idByPackage(item);</span>
-<span class="lineNum">     247 </span><span class="lineCov">              5 :                 if (id == -1) return std::set&lt;Tag&gt;();</span>
-<span class="lineNum">     248 </span><span class="lineCov">              4 :                 return vocabulary().tagsByID(m_coll.getTagsOfItem(id));</span>
-<span class="lineNum">     249 </span>                :         }
-<span class="lineNum">     250 </span>                : 
-<span class="lineNum">     251 </span>                :         template&lt;typename ITEMS&gt;
-<span class="lineNum">     252 </span><span class="lineCov">              1 :         std::set&lt;Tag&gt; getTagsOfItems(const ITEMS&amp; items) const</span>
-<span class="lineNum">     253 </span>                :         {
-<span class="lineNum">     254 </span><span class="lineCov">              1 :                 return vocabulary().tagsByID(m_coll.getTagsOfItems(idsByPackages(items)));</span>
-<span class="lineNum">     255 </span>                :         }
-<span class="lineNum">     256 </span>                : 
-<span class="lineNum">     257 </span>                :         std::set&lt;std::string&gt; getItemsHavingTag(const Tag&amp; tag) const
-<span class="lineNum">     258 </span>                :         {
-<span class="lineNum">     259 </span>                :                 return packagesById(m_coll.getItemsHavingTag(tag.id()));
-<span class="lineNum">     260 </span>                :         }
-<span class="lineNum">     261 </span>                :         template&lt;typename TAGS&gt;
-<span class="lineNum">     262 </span><span class="lineCov">              2 :         std::set&lt;std::string&gt; getItemsHavingTags(const TAGS&amp; tags) const</span>
-<span class="lineNum">     263 </span>                :         {
-<span class="lineNum">     264 </span><span class="lineCov">              2 :                 std::set&lt;int&gt; itags;</span>
-<span class="lineNum">     265 </span><span class="lineCov">             11 :                 for (typename TAGS::const_iterator i = tags.begin();</span>
-<span class="lineNum">     266 </span>                :                                 i != tags.end(); ++i)
-<span class="lineNum">     267 </span><span class="lineCov">              9 :                         itags.insert(i-&gt;id());</span>
-<span class="lineNum">     268 </span><span class="lineCov">              2 :                 return packagesById(m_coll.getItemsHavingTags(itags));</span>
-<span class="lineNum">     269 </span>                :         }
-<span class="lineNum">     270 </span>                : 
-<span class="lineNum">     271 </span>                : #if 0
-<span class="lineNum">     272 </span>                :         ItemSet getTaggedItems() const;
-<span class="lineNum">     273 </span>                : #endif
-<span class="lineNum">     274 </span><span class="lineCov">              1 :         std::set&lt;Tag&gt; getAllTags() const</span>
-<span class="lineNum">     275 </span>                :         {
-<span class="lineNum">     276 </span><span class="lineCov">              1 :                 return vocabulary().tagsByID(m_coll.getAllTags());</span>
-<span class="lineNum">     277 </span>                :         }
-<span class="lineNum">     278 </span>                : 
-<span class="lineNum">     279 </span>                :         /// Access the vocabulary in use
-<span class="lineNum">     280 </span><span class="lineCov">             27 :     Vocabulary&amp; vocabulary() { return m_voc; }</span>
-<span class="lineNum">     281 </span>                :         /// Access the vocabulary in use
-<span class="lineNum">     282 </span><span class="lineCov">          84590 :     const Vocabulary&amp; vocabulary() const { return m_voc; }</span>
-<span class="lineNum">     283 </span>                : 
-<span class="lineNum">     284 </span>                :         /**
-<span class="lineNum">     285 </span>                :          * Access the PkgId in use.
-<span class="lineNum">     286 </span>                :          *
-<span class="lineNum">     287 </span>                :          * \note Future implementations may not rely on a PkgId
-<span class="lineNum">     288 </span>                :          */
-<span class="lineNum">     289 </span><span class="lineCov">              4 :         PkgId&amp; pkgid() { return m_pkgid; }</span>
-<span class="lineNum">     290 </span>                :         /**
-<span class="lineNum">     291 </span>                :          * Access the PkgId in use.
-<span class="lineNum">     292 </span>                :          *
-<span class="lineNum">     293 </span>                :          * \note Future implementations may not rely on a PkgId
-<span class="lineNum">     294 </span>                :          */
-<span class="lineNum">     295 </span>                :         const PkgId&amp; pkgid() const { return m_pkgid; }
-<span class="lineNum">     296 </span>                : 
-<span class="lineNum">     297 </span>                :         int getCardinality(const Tag&amp; tag) const
-<span class="lineNum">     298 </span>                :         {
-<span class="lineNum">     299 </span>                :                 return m_coll.getCardinality(tag.id());
-<span class="lineNum">     300 </span>                :         }
-<span class="lineNum">     301 </span>                : 
-<span class="lineNum">     302 </span><span class="lineCov">              2 :         void applyChange(const tagcoll::PatchList&lt;std::string, Tag&gt;&amp; change)</span>
-<span class="lineNum">     303 </span>                :         {
-<span class="lineNum">     304 </span>                :                 using namespace tagcoll;
-<span class="lineNum">     305 </span><span class="lineCov">              2 :                 PatchList&lt;int, int&gt; intp;</span>
-<span class="lineNum">     306 </span><span class="lineCov">              4 :                 for (PatchList&lt;std::string, Tag&gt;::const_iterator i = change.begin();</span>
-<span class="lineNum">     307 </span>                :                                 i != change.end(); ++i)
-<span class="lineNum">     308 </span>                :                 {
-<span class="lineNum">     309 </span><span class="lineCov">              2 :                         Patch&lt;int, int&gt; p(idByPackage(i-&gt;first));</span>
-<span class="lineNum">     310 </span><span class="lineCov">              4 :                         for (std::set&lt;Tag&gt;::const_iterator j = i-&gt;second.added.begin();</span>
-<span class="lineNum">     311 </span>                :                                         j != i-&gt;second.added.end(); ++j)
-<span class="lineNum">     312 </span><span class="lineCov">              2 :                                 p.add(j-&gt;id());</span>
-<span class="lineNum">     313 </span><span class="lineCov">              2 :                         for (std::set&lt;Tag&gt;::const_iterator j = i-&gt;second.removed.begin();</span>
-<span class="lineNum">     314 </span>                :                                         j != i-&gt;second.removed.end(); ++j)
-<span class="lineNum">     315 </span><span class="lineNoCov">              0 :                                 p.remove(j-&gt;id());</span>
-<span class="lineNum">     316 </span><span class="lineCov">              2 :                         intp.addPatch(p);</span>
-<span class="lineNum">     317 </span>                :                 }
-<span class="lineNum">     318 </span><span class="lineCov">              2 :                 m_coll.applyChange(intp);</span>
-<span class="lineNum">     319 </span><span class="lineCov">              2 :         }</span>
-<span class="lineNum">     320 </span>                : 
-<span class="lineNum">     321 </span>                : #if 0
-<span class="lineNum">     322 </span>                :         template&lt;typename OUT&gt;
-<span class="lineNum">     323 </span>                :         void output(OUT out) const
-<span class="lineNum">     324 </span>                :         {
-<span class="lineNum">     325 </span>                :                 for (const_iterator i = begin(); i != end(); ++i)
-<span class="lineNum">     326 </span>                :                 {
-<span class="lineNum">     327 </span>                :                         *out = *i;
-<span class="lineNum">     328 </span>                :                         ++out;
-<span class="lineNum">     329 </span>                :                 }
-<span class="lineNum">     330 </span>                :         }
-<span class="lineNum">     331 </span>                : #endif
-<span class="lineNum">     332 </span>                : 
-<span class="lineNum">     333 </span>                : 
-<span class="lineNum">     334 </span>                : 
-<span class="lineNum">     335 </span>                :         /**
-<span class="lineNum">     336 </span>                :          * Check if the tag database has been created (i.e. if something
-<span class="lineNum">     337 </span>                :          * equivalend to debtags update has been run)
-<span class="lineNum">     338 </span>                :          */
-<span class="lineNum">     339 </span>                :         //static bool hasTagDatabase();
-<span class="lineNum">     340 </span>                : 
-<span class="lineNum">     341 </span>                : 
-<span class="lineNum">     342 </span>                :         /**
-<span class="lineNum">     343 </span>                :          * Save in the state storage directory a patch that can be used to turn
-<span class="lineNum">     344 </span>                :          * the system database into the collection given
-<span class="lineNum">     345 </span>                :          */
-<span class="lineNum">     346 </span>                :         void savePatch();
-<span class="lineNum">     347 </span>                : 
-<span class="lineNum">     348 </span>                :         /**
-<span class="lineNum">     349 </span>                :          * Save in the state storage directory a patch to turn the system database
-<span class="lineNum">     350 </span>                :          * into the collection given
-<span class="lineNum">     351 </span>                :          */
-<span class="lineNum">     352 </span>                :         void savePatch(const tagcoll::PatchList&lt;std::string, std::string&gt;&amp; patch);
-<span class="lineNum">     353 </span>                : 
-<span class="lineNum">     354 </span>                :         /**
-<span class="lineNum">     355 </span>                :          * Save in the state storage directory a patch to turn the system database
-<span class="lineNum">     356 </span>                :          * into the collection given
-<span class="lineNum">     357 </span>                :          */
-<span class="lineNum">     358 </span>                :         void savePatch(const tagcoll::PatchList&lt;std::string, Tag&gt;&amp; patch);
-<span class="lineNum">     359 </span>                : 
-<span class="lineNum">     360 </span>                :         /**
-<span class="lineNum">     361 </span>                :          * Send to the central archive a patch that can be used to turn
-<span class="lineNum">     362 </span>                :          * the system database into the collection given
-<span class="lineNum">     363 </span>                :          */
-<span class="lineNum">     364 </span>                :         void sendPatch();
-<span class="lineNum">     365 </span>                : 
-<span class="lineNum">     366 </span>                :         /**
-<span class="lineNum">     367 </span>                :          * Send the given patch to the central archive
-<span class="lineNum">     368 </span>                :          */
-<span class="lineNum">     369 </span>                :         void sendPatch(const tagcoll::PatchList&lt;std::string, std::string&gt;&amp; patch);
-<span class="lineNum">     370 </span>                : 
-<span class="lineNum">     371 </span>                :         /**
-<span class="lineNum">     372 </span>                :          * Send the given patch to the central archive
-<span class="lineNum">     373 </span>                :          */
-<span class="lineNum">     374 </span>                :         void sendPatch(const tagcoll::PatchList&lt;std::string, Tag&gt;&amp; patch);
-<span class="lineNum">     375 </span>                : 
-<span class="lineNum">     376 </span>                : 
-<span class="lineNum">     377 </span>                :         /**
-<span class="lineNum">     378 </span>                :          * Output the current Debian tags database to a consumer of &lt;std::string, Tag&gt;
-<span class="lineNum">     379 </span>                :          *
-<span class="lineNum">     380 </span>                :          * \note The collection is sent to 'cons' without merging repeated items
-<span class="lineNum">     381 </span>                :          */
-<span class="lineNum">     382 </span>                :         template&lt;typename OUT&gt;
-<span class="lineNum">     383 </span><span class="lineCov">              2 :         void outputSystem(const OUT&amp; cons);</span>
-<span class="lineNum">     384 </span>                : 
-<span class="lineNum">     385 </span>                :         /**
-<span class="lineNum">     386 </span>                :          * Output the given tag file to a consumer of &lt;std::string, Tag&gt;
-<span class="lineNum">     387 </span>                :          *
-<span class="lineNum">     388 </span>                :          * \note The collection is sent to 'cons' without merging repeated items
-<span class="lineNum">     389 </span>                :          */
-<span class="lineNum">     390 </span>                :         template&lt;typename OUT&gt;
-<span class="lineNum">     391 </span>                :         void outputSystem(const std::string&amp; filename, const OUT&amp; out);
-<span class="lineNum">     392 </span>                : 
-<span class="lineNum">     393 </span>                :         /**
-<span class="lineNum">     394 </span>                :          * Output the current Debian tags database, patched with local patch,
-<span class="lineNum">     395 </span>                :          * to a Consumer of &lt;std::string, Tag&gt;
-<span class="lineNum">     396 </span>                :          *
-<span class="lineNum">     397 </span>                :          * \note The collection is sent to 'cons' without merging repeated items
-<span class="lineNum">     398 </span>                :          */
-<span class="lineNum">     399 </span>                :         template&lt;typename OUT&gt;
-<span class="lineNum">     400 </span><span class="lineCov">              2 :         void outputPatched(const OUT&amp; cons);</span>
-<span class="lineNum">     401 </span>                : 
-<span class="lineNum">     402 </span>                :         /**
-<span class="lineNum">     403 </span>                :          * Output the given tag file, patched with local patch,
-<span class="lineNum">     404 </span>                :          * to a Consumer of &lt;std::string, Tag&gt;
-<span class="lineNum">     405 </span>                :          *
-<span class="lineNum">     406 </span>                :          * \note The collection is sent to 'cons' without merging repeated items
-<span class="lineNum">     407 </span>                :          */
-<span class="lineNum">     408 </span>                :         template&lt;typename OUT&gt;
-<span class="lineNum">     409 </span>                :         void outputPatched(const std::string&amp; filename, const OUT&amp; out);
-<span class="lineNum">     410 </span>                : };
-<span class="lineNum">     411 </span>                : 
-<span class="lineNum">     412 </span>                : 
-<span class="lineNum">     413 </span>                : }
-<span class="lineNum">     414 </span>                : }
-<span class="lineNum">     415 </span>                : 
-<span class="lineNum">     416 </span>                : // vim:set ts=4 sw=4:
-<span class="lineNum">     417 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/debtags/debtags.tcc.gcov.html b/rep/ept/debtags/debtags.tcc.gcov.html
deleted file mode 100644
index 3d2907f..0000000
--- a/rep/ept/debtags/debtags.tcc.gcov.html
+++ /dev/null
@@ -1,156 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/debtags/debtags.tcc</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/debtags</a> - debtags.tcc</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">4</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">4</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /** -*- C++ -*-
-<span class="lineNum">       2 </span>                :  * @file
-<span class="lineNum">       3 </span>                :  * @author Enrico Zini (enrico) &lt;enrico@enricozini.org&gt;
-<span class="lineNum">       4 </span>                :  */
-<span class="lineNum">       5 </span>                : 
-<span class="lineNum">       6 </span>                : /*
-<span class="lineNum">       7 </span>                :  * libpkg Debtags data provider
-<span class="lineNum">       8 </span>                :  *
-<span class="lineNum">       9 </span>                :  * Copyright (C) 2003-2007  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">      10 </span>                :  *
-<span class="lineNum">      11 </span>                :  * This library is free software; you can redistribute it and/or
-<span class="lineNum">      12 </span>                :  * modify it under the terms of the GNU Lesser General Public
-<span class="lineNum">      13 </span>                :  * License as published by the Free Software Foundation; either
-<span class="lineNum">      14 </span>                :  * version 2.1 of the License, or (at your option) any later version.
-<span class="lineNum">      15 </span>                :  *
-<span class="lineNum">      16 </span>                :  * This library is distributed in the hope that it will be useful,
-<span class="lineNum">      17 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      18 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-<span class="lineNum">      19 </span>                :  * Lesser General Public License for more details.
-<span class="lineNum">      20 </span>                :  *
-<span class="lineNum">      21 </span>                :  * You should have received a copy of the GNU Lesser General Public
-<span class="lineNum">      22 </span>                :  * License along with this library; if not, write to the Free Software
-<span class="lineNum">      23 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
-<span class="lineNum">      24 </span>                :  */
-<span class="lineNum">      25 </span>                : 
-<span class="lineNum">      26 </span>                : #ifndef EPT_DEBTAGS_DEBTAGS_TCC
-<span class="lineNum">      27 </span>                : #define EPT_DEBTAGS_DEBTAGS_TCC
-<span class="lineNum">      28 </span>                : 
-<span class="lineNum">      29 </span>                : #include &lt;ept/debtags/debtags.h&gt;
-<span class="lineNum">      30 </span>                : #include &lt;ept/debtags/maint/serializer.h&gt;
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span>                : #include &lt;tagcoll/input/stdio.h&gt;
-<span class="lineNum">      33 </span>                : #include &lt;tagcoll/stream/patcher.h&gt;
-<span class="lineNum">      34 </span>                : #include &lt;tagcoll/TextFormat.h&gt;
-<span class="lineNum">      35 </span>                : 
-<span class="lineNum">      36 </span>                : namespace ept {
-<span class="lineNum">      37 </span>                : namespace debtags {
-<span class="lineNum">      38 </span>                : 
-<span class="lineNum">      39 </span>                : template&lt;typename OUT&gt;
-<span class="lineNum">      40 </span>                : void Debtags::outputSystem(const OUT&amp; cons)
-<span class="lineNum">      41 </span>                : {
-<span class="lineNum">      42 </span><span class="lineCov">              2 :         m_rocoll.output(intToPkg(m_pkgid, vocabulary(), cons));</span>
-<span class="lineNum">      43 </span><span class="lineCov">              2 : }</span>
-<span class="lineNum">      44 </span>                : 
-<span class="lineNum">      45 </span>                : template&lt;typename OUT&gt;
-<span class="lineNum">      46 </span>                : void Debtags::outputSystem(const std::string&amp; filename, const OUT&amp; out)
-<span class="lineNum">      47 </span>                : {
-<span class="lineNum">      48 </span>                :         if (filename == &quot;-&quot;)
-<span class="lineNum">      49 </span>                :         {
-<span class="lineNum">      50 </span>                :                 tagcoll::input::Stdio input(stdin, &quot;&lt;stdin&gt;&quot;);
-<span class="lineNum">      51 </span>                :                 tagcoll::textformat::parse(input, ept::debtags::stringToPkg(m_pkgid, m_voc, out));
-<span class="lineNum">      52 </span>                :         }
-<span class="lineNum">      53 </span>                :         else
-<span class="lineNum">      54 </span>                :         {
-<span class="lineNum">      55 </span>                :                 tagcoll::input::Stdio input(filename);
-<span class="lineNum">      56 </span>                :                 tagcoll::textformat::parse(input, ept::debtags::stringToPkg(m_pkgid, m_voc, out));
-<span class="lineNum">      57 </span>                :         }
-<span class="lineNum">      58 </span>                : }
-<span class="lineNum">      59 </span>                : 
-<span class="lineNum">      60 </span>                : template&lt;typename OUT&gt;
-<span class="lineNum">      61 </span>                : void Debtags::outputPatched(const OUT&amp; cons)
-<span class="lineNum">      62 </span>                : {
-<span class="lineNum">      63 </span><span class="lineCov">              2 :         m_coll.output(intToPkg(m_pkgid, vocabulary(), cons));</span>
-<span class="lineNum">      64 </span><span class="lineCov">              2 : }</span>
-<span class="lineNum">      65 </span>                : 
-<span class="lineNum">      66 </span>                : template&lt;typename OUT&gt;
-<span class="lineNum">      67 </span>                : void Debtags::outputPatched(const std::string&amp; filename, const OUT&amp; out)
-<span class="lineNum">      68 </span>                : {
-<span class="lineNum">      69 </span>                :         const tagcoll::PatchList&lt;string, Tag&gt;&amp; patch = m_coll.changes();
-<span class="lineNum">      70 </span>                :         if (filename == &quot;-&quot;)
-<span class="lineNum">      71 </span>                :         {
-<span class="lineNum">      72 </span>                :                 tagcoll::input::Stdio input(stdin, &quot;&lt;stdin&gt;&quot;);
-<span class="lineNum">      73 </span>                :                 tagcoll::textformat::parse(input, ept::debtags::stringToPkg(m_pkgid, m_voc, patcher(patch, out)));
-<span class="lineNum">      74 </span>                :         }
-<span class="lineNum">      75 </span>                :         else
-<span class="lineNum">      76 </span>                :         {
-<span class="lineNum">      77 </span>                :                 tagcoll::input::Stdio input(filename);
-<span class="lineNum">      78 </span>                :                 tagcoll::textformat::parse(input, ept::debtags::stringToPkg(m_pkgid, m_voc, patcher(patch, out)));
-<span class="lineNum">      79 </span>                :         }
-<span class="lineNum">      80 </span>                : }
-<span class="lineNum">      81 </span>                : 
-<span class="lineNum">      82 </span>                : }
-<span class="lineNum">      83 </span>                : }
-<span class="lineNum">      84 </span>                : 
-<span class="lineNum">      85 </span>                : #include &lt;tagcoll/coll/patched.tcc&gt;
-<span class="lineNum">      86 </span>                : 
-<span class="lineNum">      87 </span>                : #endif
-<span class="lineNum">      88 </span>                : 
-<span class="lineNum">      89 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/debtags/debtags.test.h.gcov.html b/rep/ept/debtags/debtags.test.h.gcov.html
deleted file mode 100644
index e78c69b..0000000
--- a/rep/ept/debtags/debtags.test.h.gcov.html
+++ /dev/null
@@ -1,350 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/debtags/debtags.test.h</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/debtags</a> - debtags.test.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">103</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">103</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- mode: c++; tab-width: 4; indent-tabs-mode: t -*-
-<span class="lineNum">       2 </span>                : /**
-<span class="lineNum">       3 </span>                :  * @file
-<span class="lineNum">       4 </span>                :  * @author Enrico Zini (enrico) &lt;enrico@enricozini.org&gt;
-<span class="lineNum">       5 </span>                :  */
-<span class="lineNum">       6 </span>                : 
-<span class="lineNum">       7 </span>                : /*
-<span class="lineNum">       8 </span>                :  * Test for the Debtags data provider
-<span class="lineNum">       9 </span>                :  *
-<span class="lineNum">      10 </span>                :  * Copyright (C) 2003-2007  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">      11 </span>                :  *
-<span class="lineNum">      12 </span>                :  * This library is free software; you can redistribute it and/or
-<span class="lineNum">      13 </span>                :  * modify it under the terms of the GNU Lesser General Public
-<span class="lineNum">      14 </span>                :  * License as published by the Free Software Foundation; either
-<span class="lineNum">      15 </span>                :  * version 2.1 of the License, or (at your option) any later version.
-<span class="lineNum">      16 </span>                :  *
-<span class="lineNum">      17 </span>                :  * This library is distributed in the hope that it will be useful,
-<span class="lineNum">      18 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      19 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-<span class="lineNum">      20 </span>                :  * Lesser General Public License for more details.
-<span class="lineNum">      21 </span>                :  *
-<span class="lineNum">      22 </span>                :  * You should have received a copy of the GNU Lesser General Public
-<span class="lineNum">      23 </span>                :  * License along with this library; if not, write to the Free Software
-<span class="lineNum">      24 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
-<span class="lineNum">      25 </span>                :  */
-<span class="lineNum">      26 </span>                : 
-<span class="lineNum">      27 </span>                : 
-<span class="lineNum">      28 </span>                : #include &lt;ept/debtags/debtags.h&gt;
-<span class="lineNum">      29 </span>                : #include &lt;ept/core/apt.h&gt;
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : #include &lt;tagcoll/coll/simple.h&gt;
-<span class="lineNum">      32 </span>                : #include &lt;tagcoll/stream/sink.h&gt;
-<span class="lineNum">      33 </span>                : 
-<span class="lineNum">      34 </span>                : #include &lt;wibble/operators.h&gt;
-<span class="lineNum">      35 </span>                : 
-<span class="lineNum">      36 </span>                : #include &lt;ept/test.h&gt;
-<span class="lineNum">      37 </span>                : 
-<span class="lineNum">      38 </span>                : #ifndef EPT_DEBTAGS_TESTH
-<span class="lineNum">      39 </span>                : #define EPT_DEBTAGS_TESTH
-<span class="lineNum">      40 </span>                : 
-<span class="lineNum">      41 </span>                : using namespace tagcoll;
-<span class="lineNum">      42 </span>                : using namespace std;
-<span class="lineNum">      43 </span>                : using namespace ept;
-<span class="lineNum">      44 </span>                : using namespace ept::debtags;
-<span class="lineNum">      45 </span>                : using namespace wibble::operators;
-<span class="lineNum">      46 </span>                : 
-<span class="lineNum">      47 </span>                : struct TestDebtags : DebtagsTestEnvironment
-<span class="lineNum">      48 </span><span class="lineCov">              5 : {</span>
-<span class="lineNum">      49 </span>                :         Debtags debtags;
-<span class="lineNum">      50 </span>                : 
-<span class="lineNum">      51 </span><span class="lineCov">              5 :     TestDebtags() {}</span>
-<span class="lineNum">      52 </span>                : 
-<span class="lineNum">      53 </span><span class="lineCov">             10 :         Vocabulary&amp; voc() { return debtags.vocabulary(); }</span>
-<span class="lineNum">      54 </span>                : 
-<span class="lineNum">      55 </span><span class="lineCov">              1 :         Test _1() {</span>
-<span class="lineNum">      56 </span><span class="lineCov">          21146 :                 for (Debtags::const_iterator i = debtags.begin(); i != debtags.end(); ++i)</span>
-<span class="lineNum">      57 </span>                :                 {
-<span class="lineNum">      58 </span><span class="lineCov">          21145 :                         *i;</span>
-<span class="lineNum">      59 </span><span class="lineCov">          21145 :                         i-&gt;first;</span>
-<span class="lineNum">      60 </span><span class="lineCov">          21145 :                         i-&gt;second;</span>
-<span class="lineNum">      61 </span><span class="lineCov">              1 :                 }</span>
-<span class="lineNum">      62 </span><span class="lineCov">              1 :                 int items = 0, tags = 0;</span>
-<span class="lineNum">      63 </span><span class="lineCov">              1 :                 debtags.outputSystem(stream::countingSink(items, tags));</span>
-<span class="lineNum">      64 </span>                :                 
-<span class="lineNum">      65 </span><span class="lineCov">              1 :                 int pitems = 0, ptags = 0;</span>
-<span class="lineNum">      66 </span><span class="lineCov">              1 :         debtags.outputPatched(stream::countingSink(pitems, ptags));</span>
-<span class="lineNum">      67 </span>                : 
-<span class="lineNum">      68 </span><span class="lineCov">              2 :         assert(items &gt; 10);</span>
-<span class="lineNum">      69 </span><span class="lineCov">              2 :         assert(tags &gt; 10);</span>
-<span class="lineNum">      70 </span><span class="lineCov">              2 :         assert(items &lt;= pitems);</span>
-<span class="lineNum">      71 </span><span class="lineCov">              2 :         assert(tags &lt;= ptags);</span>
-<span class="lineNum">      72 </span><span class="lineCov">              1 : }</span>
-<span class="lineNum">      73 </span>                : 
-<span class="lineNum">      74 </span><span class="lineCov">              1 :         Test _2()</span>
-<span class="lineNum">      75 </span>                : {
-<span class="lineNum">      76 </span><span class="lineCov">              1 :     string p(&quot;debtags&quot;);</span>
-<span class="lineNum">      77 </span><span class="lineCov">              1 :         std::set&lt;Tag&gt; tags = debtags.getTagsOfItem(p);</span>
-<span class="lineNum">      78 </span><span class="lineCov">              1 :         assert( !tags.empty() );</span>
-<span class="lineNum">      79 </span>                : 
-<span class="lineNum">      80 </span>                : #if 0
-<span class="lineNum">      81 </span>                :         for ( std::set&lt; Tag &gt;::iterator i = tags.begin(); i != tags.end(); ++ i ) {
-<span class="lineNum">      82 </span>                :                 std::cerr &lt;&lt; i-&gt;id() &lt;&lt; &quot;: &quot; &lt;&lt; i-&gt;fullname() &lt;&lt; std::endl;
-<span class="lineNum">      83 </span>                :         }
-<span class="lineNum">      84 </span>                :         std::cerr &lt;&lt; &quot;---&quot; &lt;&lt; std::endl;
-<span class="lineNum">      85 </span>                :         Tag t = voc().tagByName( &quot;interface::commandline&quot; );
-<span class="lineNum">      86 </span>                :         std::cerr &lt;&lt; t.id() &lt;&lt; &quot;: &quot; &lt;&lt; t.fullname() &lt;&lt; std::endl;
-<span class="lineNum">      87 </span>                : #endif
-<span class="lineNum">      88 </span>                : 
-<span class="lineNum">      89 </span><span class="lineCov">              2 :         assert_eq( tags.size(), 8u );</span>
-<span class="lineNum">      90 </span><span class="lineCov">              2 :         assert( voc().tagByName( &quot;devel::buildtools&quot; ) &lt;= tags );</span>
-<span class="lineNum">      91 </span><span class="lineCov">              2 :         assert( voc().tagByName( &quot;implemented-in::c++&quot; ) &lt;= tags );</span>
-<span class="lineNum">      92 </span><span class="lineCov">              2 :         assert( voc().tagByName( &quot;interface::commandline&quot; ) &lt;= tags );</span>
-<span class="lineNum">      93 </span><span class="lineCov">              2 :         assert( voc().tagByName( &quot;role::program&quot; ) &lt;= tags );</span>
-<span class="lineNum">      94 </span><span class="lineCov">              2 :         assert( voc().tagByName( &quot;scope::application&quot; ) &lt;= tags );</span>
-<span class="lineNum">      95 </span><span class="lineCov">              2 :         assert( voc().tagByName( &quot;suite::debian&quot; ) &lt;= tags );</span>
-<span class="lineNum">      96 </span><span class="lineCov">              2 :         assert( voc().tagByName( &quot;use::searching&quot; ) &lt;= tags );</span>
-<span class="lineNum">      97 </span><span class="lineCov">              2 :         assert( voc().tagByName( &quot;works-with::software:package&quot; ) &lt;= tags );</span>
-<span class="lineNum">      98 </span><span class="lineCov">              1 : }</span>
-<span class="lineNum">      99 </span>                : 
-<span class="lineNum">     100 </span><span class="lineCov">              1 :         Test _3()</span>
-<span class="lineNum">     101 </span>                : {
-<span class="lineNum">     102 </span>                :         using namespace std;
-<span class="lineNum">     103 </span>                : 
-<span class="lineNum">     104 </span>                :     /* Get the 'debtags' package */
-<span class="lineNum">     105 </span><span class="lineCov">              1 :     string p(&quot;debtags&quot;);</span>
-<span class="lineNum">     106 </span>                : 
-<span class="lineNum">     107 </span>                :     /* Get its tags */
-<span class="lineNum">     108 </span><span class="lineCov">              1 :         std::set&lt;Tag&gt; tags = debtags.getTagsOfItem(p);</span>
-<span class="lineNum">     109 </span><span class="lineCov">              1 :     assert(!tags.empty());</span>
-<span class="lineNum">     110 </span>                : 
-<span class="lineNum">     111 </span>                :         /*
-<span class="lineNum">     112 </span>                :         cerr &lt;&lt; &quot;Intersection size: &quot; &lt;&lt; endl;
-<span class="lineNum">     113 </span>                :         using namespace wibble::operators;
-<span class="lineNum">     114 </span>                :         std::set&lt;Tag&gt;::const_iterator dbgi = tags.begin();
-<span class="lineNum">     115 </span>                :         cerr &lt;&lt; &quot;* &quot; &lt;&lt; dbgi-&gt;fullname() &lt;&lt; &quot;: &quot; &lt;&lt; dbgi-&gt;id() &lt;&lt; endl;
-<span class="lineNum">     116 </span>                :         std::set&lt;int&gt; dbgres = debtags.tagdb().getItemsHavingTag(dbgi-&gt;id());
-<span class="lineNum">     117 </span>                :         std::set&lt;Package&gt; dbgpres = debtags.getItemsHavingTag(*dbgi);
-<span class="lineNum">     118 </span>                :         cerr &lt;&lt; &quot; #pkgs &quot; &lt;&lt; dbgres.size() &lt;&lt; &quot; == &quot; &lt;&lt; dbgpres.size() &lt;&lt; endl;
-<span class="lineNum">     119 </span>                :         cerr &lt;&lt; &quot; #isec &quot; &lt;&lt; dbgres.size() &lt;&lt; &quot; == &quot; &lt;&lt; dbgpres.size() &lt;&lt; endl;
-<span class="lineNum">     120 </span>                :         cerr &lt;&lt; &quot;  &quot;; ppset(dbgpres); cerr &lt;&lt; endl;
-<span class="lineNum">     121 </span>                :         cerr &lt;&lt; &quot;  &quot;; piset(dbgres); cerr &lt;&lt; endl;
-<span class="lineNum">     122 </span>                :         for (++dbgi ; dbgi != tags.end(); ++dbgi)
-<span class="lineNum">     123 </span>                :         {
-<span class="lineNum">     124 </span>                :                 cerr &lt;&lt; &quot;* &quot; &lt;&lt; dbgi-&gt;fullname() &lt;&lt; &quot;: &quot; &lt;&lt; dbgi-&gt;id() &lt;&lt; endl;
-<span class="lineNum">     125 </span>                :                 std::set&lt;Package&gt; dbgpkgs = debtags.getItemsHavingTag(*dbgi);
-<span class="lineNum">     126 </span>                :                 std::set&lt;int&gt; dbgids = debtags.tagdb().getItemsHavingTag(dbgi-&gt;id());
-<span class="lineNum">     127 </span>                :                 cerr &lt;&lt; &quot;  &quot;; ppset(dbgpkgs); cerr &lt;&lt; endl;
-<span class="lineNum">     128 </span>                :                 cerr &lt;&lt; &quot;  &quot;; piset(dbgids); cerr &lt;&lt; endl;
-<span class="lineNum">     129 </span>                :                 cerr &lt;&lt; &quot; #pkgs &quot; &lt;&lt; dbgpkgs.size() &lt;&lt; &quot; == &quot; &lt;&lt; dbgids.size() &lt;&lt; endl;
-<span class="lineNum">     130 </span>                :                 dbgres &amp;= dbgids;
-<span class="lineNum">     131 </span>                :                 dbgpres &amp;= dbgpkgs;
-<span class="lineNum">     132 </span>                :                 cerr &lt;&lt; &quot; #isec &quot; &lt;&lt; dbgres.size() &lt;&lt; &quot; == &quot; &lt;&lt; dbgpres.size() &lt;&lt; endl;
-<span class="lineNum">     133 </span>                :         }
-<span class="lineNum">     134 </span>                :         cerr &lt;&lt; &quot; &quot; &lt;&lt; dbgres.size() &lt;&lt; endl &lt;&lt; &quot;Results: &quot; &lt;&lt; endl;
-<span class="lineNum">     135 </span>                :         for (std::set&lt;int&gt;::const_iterator i = dbgres.begin(); i != dbgres.end(); ++i)
-<span class="lineNum">     136 </span>                :                 cerr &lt;&lt; &quot;   &quot; &lt;&lt; *i &lt;&lt; endl;
-<span class="lineNum">     137 </span>                :         */
-<span class="lineNum">     138 </span>                : 
-<span class="lineNum">     139 </span>                : 
-<span class="lineNum">     140 </span>                : //      cerr &lt;&lt; &quot;Tags of debtags: &quot;;
-<span class="lineNum">     141 </span>                : //      for (std::set&lt;Tag&gt;::const_iterator i = tags.begin(); i != tags.end(); ++i)
-<span class="lineNum">     142 </span>                : //      {
-<span class="lineNum">     143 </span>                : //              cerr &lt;&lt; &quot; &quot; + i-&gt;fullname() &lt;&lt; endl;
-<span class="lineNum">     144 </span>                : //              std::set&lt;Package&gt; packages = debtags.getItemsHavingTag(*i);
-<span class="lineNum">     145 </span>                : //              for (std::set&lt;Package&gt;::const_iterator p = packages.begin();
-<span class="lineNum">     146 </span>                : //                              p != packages.end(); ++p)
-<span class="lineNum">     147 </span>                : //                      cerr &lt;&lt; &quot;   PKG &quot; &lt;&lt; p-&gt;name() &lt;&lt; endl;
-<span class="lineNum">     148 </span>                : //      }
-<span class="lineNum">     149 </span>                : //      cerr &lt;&lt; endl;
-<span class="lineNum">     150 </span>                : 
-<span class="lineNum">     151 </span>                :     /* Get the items for the tagset of 'debtags' */
-<span class="lineNum">     152 </span><span class="lineCov">              1 :         std::set&lt;string&gt; packages = debtags.getItemsHavingTags(tags);</span>
-<span class="lineNum">     153 </span>                :         //cerr &lt;&lt; packages.size() &lt;&lt; endl;
-<span class="lineNum">     154 </span><span class="lineCov">              1 :     assert(!packages.empty());</span>
-<span class="lineNum">     155 </span>                :         /*
-<span class="lineNum">     156 </span>                :         for ( std::set&lt; Package &gt;::iterator i = packages.begin(); i != packages.end(); ++ i )
-<span class="lineNum">     157 </span>                :                 std::cerr &lt;&lt; i-&gt;name() &lt;&lt; std::endl;
-<span class="lineNum">     158 </span>                :         std::cerr &lt;&lt; &quot;---&quot; &lt;&lt; std::endl;
-<span class="lineNum">     159 </span>                :         std::cerr &lt;&lt; p.name() &lt;&lt; std::endl;
-<span class="lineNum">     160 </span>                :         */
-<span class="lineNum">     161 </span>                :     /* They should at least contain 'debtags' */
-<span class="lineNum">     162 </span><span class="lineCov">              2 :     assert( p &lt;= packages );</span>
-<span class="lineNum">     163 </span>                : 
-<span class="lineNum">     164 </span>                :     /* Get one of the tags of 'debtags' */
-<span class="lineNum">     165 </span><span class="lineCov">              2 :     Tag tag = *tags.begin();</span>
-<span class="lineNum">     166 </span><span class="lineCov">              1 :     assert(tag);</span>
-<span class="lineNum">     167 </span>                : 
-<span class="lineNum">     168 </span>                :     /* Get its items */
-<span class="lineNum">     169 </span>                :     {
-<span class="lineNum">     170 </span>                :         /* Need this workaround until I figure out how to tell the new GCC
-<span class="lineNum">     171 </span>                :          * that TagDB is a TDBReadonlyDiskIndex and should behave as such
-<span class="lineNum">     172 </span>                :          */
-<span class="lineNum">     173 </span><span class="lineCov">              1 :                 std::set&lt;Tag&gt; ts;</span>
-<span class="lineNum">     174 </span><span class="lineCov">              1 :                 ts.insert(tag);</span>
-<span class="lineNum">     175 </span><span class="lineCov">              1 :         packages = debtags.getItemsHavingTags(ts);</span>
-<span class="lineNum">     176 </span>                :     }
-<span class="lineNum">     177 </span>                :     //packages = c.debtags().tagdb().getItems(tag);
-<span class="lineNum">     178 </span><span class="lineCov">              1 :     assert(!packages.empty());</span>
-<span class="lineNum">     179 </span>                :     /* They should at least contain 'debtags' */
-<span class="lineNum">     180 </span><span class="lineCov">              2 :     assert( p &lt;= packages );</span>
-<span class="lineNum">     181 </span>                : 
-<span class="lineNum">     182 </span>                :     //c.debtags().getTags(&quot;&quot;); // XXX HACK AWW!
-<span class="lineNum">     183 </span><span class="lineCov">              1 : }</span>
-<span class="lineNum">     184 </span>                : 
-<span class="lineNum">     185 </span><span class="lineCov">              1 :         Test _4()</span>
-<span class="lineNum">     186 </span>                : {
-<span class="lineNum">     187 </span><span class="lineCov">              1 :         std::string patchfile = Path::debtagsUserSourceDir() + &quot;patch&quot;;</span>
-<span class="lineNum">     188 </span><span class="lineCov">              1 :         unlink(patchfile.c_str());</span>
-<span class="lineNum">     189 </span>                : 
-<span class="lineNum">     190 </span><span class="lineCov">              1 :         string p(&quot;debtags&quot;);</span>
-<span class="lineNum">     191 </span>                : 
-<span class="lineNum">     192 </span>                :     /* Get its tags */
-<span class="lineNum">     193 </span><span class="lineCov">              1 :         std::set&lt;Tag&gt; tags = debtags.getTagsOfItem(p);</span>
-<span class="lineNum">     194 </span><span class="lineCov">              1 :     assert(!tags.empty());</span>
-<span class="lineNum">     195 </span>                : 
-<span class="lineNum">     196 </span>                :         // Ensure that it's not tagged with gameplaying
-<span class="lineNum">     197 </span><span class="lineCov">              2 :         Tag t = voc().tagByName(&quot;use::gameplaying&quot;);</span>
-<span class="lineNum">     198 </span><span class="lineCov">              2 :     assert(! (t &lt;= tags) );</span>
-<span class="lineNum">     199 </span>                : 
-<span class="lineNum">     200 </span>                :         // Add the gameplaying tag
-<span class="lineNum">     201 </span><span class="lineCov">              1 :         PatchList&lt;string, Tag&gt; change;</span>
-<span class="lineNum">     202 </span><span class="lineCov">              1 :         change.addPatch(Patch&lt;string, Tag&gt;(p, wibble::singleton(t), wibble::Empty&lt;Tag&gt;()));</span>
-<span class="lineNum">     203 </span><span class="lineCov">              1 :         debtags.applyChange(change);</span>
-<span class="lineNum">     204 </span>                : 
-<span class="lineNum">     205 </span>                :         // See that the patch is non empty
-<span class="lineNum">     206 </span><span class="lineCov">              1 :         PatchList&lt;string, Tag&gt; tmp = debtags.changes();</span>
-<span class="lineNum">     207 </span><span class="lineCov">              1 :         assert(tmp.size() &gt; 0);</span>
-<span class="lineNum">     208 </span><span class="lineCov">              2 :         assert_eq(tmp.size(), 1u);</span>
-<span class="lineNum">     209 </span>                : 
-<span class="lineNum">     210 </span>                :         // Ensure that the tag has been added
-<span class="lineNum">     211 </span><span class="lineCov">              2 :         tags = debtags.getTagsOfItem(p);</span>
-<span class="lineNum">     212 </span><span class="lineCov">              1 :     assert(!tags.empty());</span>
-<span class="lineNum">     213 </span>                : 
-<span class="lineNum">     214 </span><span class="lineCov">              2 :         t = voc().tagByName(&quot;use::gameplaying&quot;);</span>
-<span class="lineNum">     215 </span><span class="lineCov">              2 :     assert( t &lt;= tags );</span>
-<span class="lineNum">     216 </span>                : 
-<span class="lineNum">     217 </span>                :         // Save the patch
-<span class="lineNum">     218 </span><span class="lineCov">              1 :         debtags.savePatch();</span>
-<span class="lineNum">     219 </span>                : 
-<span class="lineNum">     220 </span>                :         // Check that the saved patch is correct
-<span class="lineNum">     221 </span><span class="lineCov">              1 :         FILE* in = fopen(patchfile.c_str(), &quot;r&quot;);</span>
-<span class="lineNum">     222 </span><span class="lineCov">              1 :         string writtenPatch;</span>
-<span class="lineNum">     223 </span>                :         int c;
-<span class="lineNum">     224 </span><span class="lineCov">             29 :         while ((c = getc(in)) != EOF)</span>
-<span class="lineNum">     225 </span><span class="lineCov">             27 :                 writtenPatch += c;</span>
-<span class="lineNum">     226 </span><span class="lineCov">              1 :         fclose(in);</span>
-<span class="lineNum">     227 </span>                : 
-<span class="lineNum">     228 </span><span class="lineCov">              1 :         assert_eq(writtenPatch, string(&quot;debtags: +use::gameplaying\n&quot;));</span>
-<span class="lineNum">     229 </span>                : 
-<span class="lineNum">     230 </span><span class="lineCov">              2 :         unlink(patchfile.c_str());</span>
-<span class="lineNum">     231 </span>                : 
-<span class="lineNum">     232 </span>                :         // Reapply the patch and see that it doesn't disrept things
-<span class="lineNum">     233 </span><span class="lineCov">              1 :         debtags.applyChange(change);</span>
-<span class="lineNum">     234 </span>                : 
-<span class="lineNum">     235 </span>                :         // The patch should not have changed
-<span class="lineNum">     236 </span><span class="lineCov">              1 :         tmp = debtags.changes();</span>
-<span class="lineNum">     237 </span><span class="lineCov">              1 :         assert_eq(tmp.size(), 1u);</span>
-<span class="lineNum">     238 </span><span class="lineCov">              2 :         assert_eq(tmp.begin()-&gt;first, p);</span>
-<span class="lineNum">     239 </span><span class="lineCov">              1 :         assert_eq(tmp.begin()-&gt;second.item, p);</span>
-<span class="lineNum">     240 </span><span class="lineCov">              1 : }</span>
-<span class="lineNum">     241 </span>                : 
-<span class="lineNum">     242 </span>                : // If there is no data, Debtags should work as an empty collection
-<span class="lineNum">     243 </span><span class="lineCov">              1 :         Test _5()</span>
-<span class="lineNum">     244 </span>                : {
-<span class="lineNum">     245 </span><span class="lineCov">              1 :         Path::OverrideDebtagsSourceDir odsd(&quot;./empty&quot;);</span>
-<span class="lineNum">     246 </span><span class="lineCov">              2 :         Path::OverrideDebtagsIndexDir odid(&quot;./empty&quot;);</span>
-<span class="lineNum">     247 </span><span class="lineCov">              2 :         Path::OverrideDebtagsUserSourceDir odusd(&quot;./empty&quot;);</span>
-<span class="lineNum">     248 </span><span class="lineCov">              2 :         Path::OverrideDebtagsUserIndexDir oduid(&quot;./empty&quot;);</span>
-<span class="lineNum">     249 </span><span class="lineCov">              1 :         Debtags empty;</span>
-<span class="lineNum">     250 </span>                : 
-<span class="lineNum">     251 </span><span class="lineCov">              1 :         assert(empty.begin() == empty.end());</span>
-<span class="lineNum">     252 </span><span class="lineCov">              1 :         assert_eq(empty.timestamp(), 0);</span>
-<span class="lineNum">     253 </span><span class="lineCov">              2 :         assert(!empty.hasData());</span>
-<span class="lineNum">     254 </span>                : 
-<span class="lineNum">     255 </span><span class="lineCov">              1 :         tagcoll::PatchList&lt;std::string, Tag&gt; patches = empty.changes();</span>
-<span class="lineNum">     256 </span><span class="lineCov">              1 :         assert(patches.empty());</span>
-<span class="lineNum">     257 </span>                : 
-<span class="lineNum">     258 </span><span class="lineCov">              2 :         set&lt;Tag&gt; res = empty.getTagsOfItem(&quot;apt&quot;);</span>
-<span class="lineNum">     259 </span><span class="lineCov">              2 :         assert(res.empty());</span>
-<span class="lineNum">     260 </span><span class="lineCov">              2 :         res = empty.getTagsOfItems(wibble::singleton(string(&quot;apt&quot;)));</span>
-<span class="lineNum">     261 </span><span class="lineCov">              2 :         assert(res.empty());</span>
-<span class="lineNum">     262 </span>                : 
-<span class="lineNum">     263 </span><span class="lineCov">              2 :         res = empty.getAllTags();</span>
-<span class="lineNum">     264 </span><span class="lineCov">              1 :         assert(res.empty());</span>
-<span class="lineNum">     265 </span>                : 
-<span class="lineNum">     266 </span><span class="lineCov">              1 :         tagcoll::coll::Simple&lt;string, Tag&gt; coll;</span>
-<span class="lineNum">     267 </span><span class="lineCov">              1 :         empty.outputSystem(tagcoll::coll::inserter(coll));</span>
-<span class="lineNum">     268 </span><span class="lineCov">              1 :         assert_eq(coll.itemCount(), 0u);</span>
-<span class="lineNum">     269 </span>                : 
-<span class="lineNum">     270 </span><span class="lineCov">              1 :         coll.clear();</span>
-<span class="lineNum">     271 </span>                : 
-<span class="lineNum">     272 </span><span class="lineCov">              1 :         empty.outputPatched(tagcoll::coll::inserter(coll));</span>
-<span class="lineNum">     273 </span><span class="lineCov">              1 :         assert_eq(coll.itemCount(), 0u);</span>
-<span class="lineNum">     274 </span><span class="lineCov">              1 : }</span>
-<span class="lineNum">     275 </span>                : 
-<span class="lineNum">     276 </span>                : };
-<span class="lineNum">     277 </span>                : 
-<span class="lineNum">     278 </span>                : #include &lt;ept/debtags/debtags.tcc&gt;
-<span class="lineNum">     279 </span>                : #include &lt;tagcoll/coll/simple.tcc&gt;
-<span class="lineNum">     280 </span>                : 
-<span class="lineNum">     281 </span>                : #endif
-<span class="lineNum">     282 </span>                : 
-<span class="lineNum">     283 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/debtags/expression.cc.gcov.html b/rep/ept/debtags/expression.cc.gcov.html
deleted file mode 100644
index 08ed2aa..0000000
--- a/rep/ept/debtags/expression.cc.gcov.html
+++ /dev/null
@@ -1,118 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/debtags/expression.cc</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/debtags</a> - expression.cc</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">5</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">5</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /** \file
-<span class="lineNum">       2 </span>                :  * Match tag expressions against sets of Debtags Tags
-<span class="lineNum">       3 </span>                :  */
-<span class="lineNum">       4 </span>                : 
-<span class="lineNum">       5 </span>                : /*
-<span class="lineNum">       6 </span>                :  * Copyright (C) 2003,2004,2005,2006,2007  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">       7 </span>                :  *
-<span class="lineNum">       8 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">       9 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">      10 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">      11 </span>                :  * (at your option) any later version.
-<span class="lineNum">      12 </span>                :  *
-<span class="lineNum">      13 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      14 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      15 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      16 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      17 </span>                :  *
-<span class="lineNum">      18 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      19 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      20 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      21 </span>                :  */
-<span class="lineNum">      22 </span>                : 
-<span class="lineNum">      23 </span>                : #include &lt;ept/debtags/expression.h&gt;
-<span class="lineNum">      24 </span>                : #include &lt;string&gt;
-<span class="lineNum">      25 </span>                : 
-<span class="lineNum">      26 </span>                : namespace tagcoll
-<span class="lineNum">      27 </span>                : {
-<span class="lineNum">      28 </span>                : 
-<span class="lineNum">      29 </span>                : template&lt;&gt;
-<span class="lineNum">      30 </span><span class="lineCov">             12 : bool Expression::operator()(const std::set&lt;ept::debtags::Tag&gt;&amp; tags) const</span>
-<span class="lineNum">      31 </span>                : {
-<span class="lineNum">      32 </span><span class="lineCov">             12 :         std::set&lt;std::string&gt; names;</span>
-<span class="lineNum">      33 </span><span class="lineCov">             48 :         for (std::set&lt;ept::debtags::Tag&gt;::const_iterator i = tags.begin();</span>
-<span class="lineNum">      34 </span>                :                         i != tags.end(); ++i)
-<span class="lineNum">      35 </span><span class="lineCov">             36 :                 names.insert(i-&gt;fullname());</span>
-<span class="lineNum">      36 </span><span class="lineCov">             12 :         return this-&gt;m_impl-&gt;eval(names);</span>
-<span class="lineNum">      37 </span>                : }
-<span class="lineNum">      38 </span>                : 
-<span class="lineNum">      39 </span>                : template&lt;&gt;
-<span class="lineNum">      40 </span>                : bool Expression::operator()(const std::set&lt;ept::debtags::Facet&gt;&amp; tags) const
-<span class="lineNum">      41 </span>                : {
-<span class="lineNum">      42 </span>                :         std::set&lt;std::string&gt; names;
-<span class="lineNum">      43 </span>                :         for (std::set&lt;ept::debtags::Facet&gt;::const_iterator i = tags.begin();
-<span class="lineNum">      44 </span>                :                         i != tags.end(); ++i)
-<span class="lineNum">      45 </span>                :                 names.insert(i-&gt;name());
-<span class="lineNum">      46 </span>                :         return this-&gt;m_impl-&gt;eval(names);
-<span class="lineNum">      47 </span>                : }
-<span class="lineNum">      48 </span>                : 
-<span class="lineNum">      49 </span>                : };
-<span class="lineNum">      50 </span>                : 
-<span class="lineNum">      51 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/debtags/expression.test.h.gcov.html b/rep/ept/debtags/expression.test.h.gcov.html
deleted file mode 100644
index 3a099a8..0000000
--- a/rep/ept/debtags/expression.test.h.gcov.html
+++ /dev/null
@@ -1,150 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/debtags/expression.test.h</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/debtags</a> - expression.test.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">32</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">32</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /*
-<span class="lineNum">       2 </span>                :  * Match tag expressions against sets of Debtags Tags
-<span class="lineNum">       3 </span>                :  *
-<span class="lineNum">       4 </span>                :  * Copyright (C) 2005,2006,2007  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">       5 </span>                :  *
-<span class="lineNum">       6 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">       7 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">       8 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">       9 </span>                :  * (at your option) any later version.
-<span class="lineNum">      10 </span>                :  *
-<span class="lineNum">      11 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      12 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      13 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      14 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      15 </span>                :  *
-<span class="lineNum">      16 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      17 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      18 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      19 </span>                :  */
-<span class="lineNum">      20 </span>                : 
-<span class="lineNum">      21 </span>                : #include &lt;wibble/test.h&gt;
-<span class="lineNum">      22 </span>                : #include &lt;ept/debtags/maint/path.h&gt;
-<span class="lineNum">      23 </span>                : #include &lt;ept/debtags/expression.h&gt;
-<span class="lineNum">      24 </span>                : #include &lt;ept/debtags/vocabulary.h&gt;
-<span class="lineNum">      25 </span>                : 
-<span class="lineNum">      26 </span>                : #include &quot;debtags.test.h&quot;
-<span class="lineNum">      27 </span>                : 
-<span class="lineNum">      28 </span>                : using namespace tagcoll;
-<span class="lineNum">      29 </span>                : using namespace std;
-<span class="lineNum">      30 </span>                : using namespace ept::debtags;
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span><span class="lineCov">              2 : struct TestExpression : DebtagsTestEnvironment {</span>
-<span class="lineNum">      33 </span>                :         Vocabulary voc;
-<span class="lineNum">      34 </span>                : 
-<span class="lineNum">      35 </span><span class="lineCov">              1 :         Test _1()</span>
-<span class="lineNum">      36 </span>                : {
-<span class="lineNum">      37 </span><span class="lineCov">              1 :         set&lt;Tag&gt; test;</span>
-<span class="lineNum">      38 </span><span class="lineCov">              1 :         test.insert(voc.tagByName(&quot;use::editing&quot;));</span>
-<span class="lineNum">      39 </span><span class="lineCov">              2 :         test.insert(voc.tagByName(&quot;use::viewing&quot;));</span>
-<span class="lineNum">      40 </span><span class="lineCov">              2 :         test.insert(voc.tagByName(&quot;works-with::text&quot;));</span>
-<span class="lineNum">      41 </span>                : 
-<span class="lineNum">      42 </span><span class="lineCov">              2 :         assert_eq(test.size(), 3u);</span>
-<span class="lineNum">      43 </span>                : 
-<span class="lineNum">      44 </span><span class="lineCov">              2 :         Expression e1(&quot;use::editing&quot;);</span>
-<span class="lineNum">      45 </span><span class="lineCov">              2 :         assert(e1(test));</span>
-<span class="lineNum">      46 </span>                : 
-<span class="lineNum">      47 </span><span class="lineCov">              2 :         Expression e2(&quot;use::editing &amp;&amp; use::viewing&quot;);</span>
-<span class="lineNum">      48 </span><span class="lineCov">              2 :         assert(e2(test));</span>
-<span class="lineNum">      49 </span>                : 
-<span class="lineNum">      50 </span><span class="lineCov">              2 :         e1 = Expression(&quot;!use::editing&quot;);</span>
-<span class="lineNum">      51 </span><span class="lineCov">              2 :         assert(!e1(test));</span>
-<span class="lineNum">      52 </span>                : 
-<span class="lineNum">      53 </span><span class="lineCov">              2 :         e1 = Expression(&quot;use::editing || sugo&quot;);</span>
-<span class="lineNum">      54 </span><span class="lineCov">              2 :         assert(e1(test));</span>
-<span class="lineNum">      55 </span>                : 
-<span class="lineNum">      56 </span><span class="lineCov">              2 :         e1 = Expression(&quot;use::editing &amp;&amp; !sugo&quot;);</span>
-<span class="lineNum">      57 </span><span class="lineCov">              2 :         assert(e1(test));</span>
-<span class="lineNum">      58 </span>                : 
-<span class="lineNum">      59 </span><span class="lineCov">              2 :         e1 = Expression(&quot;use::editing &amp;&amp; !use::viewing&quot;);</span>
-<span class="lineNum">      60 </span><span class="lineCov">              2 :         assert(!e1(test));</span>
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span><span class="lineCov">              2 :         e1 = Expression(&quot;(use::editing || sugo) &amp;&amp; (use::viewing &amp;&amp; works-with::text)&quot;);</span>
-<span class="lineNum">      63 </span><span class="lineCov">              2 :         assert(e1(test));</span>
-<span class="lineNum">      64 </span>                : 
-<span class="lineNum">      65 </span><span class="lineCov">              2 :         e1 = Expression(&quot;!(use::editinuse::editingra &amp;&amp; works-with::text)&quot;);</span>
-<span class="lineNum">      66 </span><span class="lineCov">              2 :         assert(e1(test));</span>
-<span class="lineNum">      67 </span>                : 
-<span class="lineNum">      68 </span><span class="lineCov">              2 :         e1 = Expression(&quot;works-with::*&quot;);</span>
-<span class="lineNum">      69 </span><span class="lineCov">              2 :         assert(e1(test));</span>
-<span class="lineNum">      70 </span>                : 
-<span class="lineNum">      71 </span><span class="lineCov">              2 :         e1 = Expression(&quot;*::text&quot;);</span>
-<span class="lineNum">      72 </span><span class="lineCov">              2 :         assert(e1(test));</span>
-<span class="lineNum">      73 </span>                : 
-<span class="lineNum">      74 </span><span class="lineCov">              2 :         e1 = Expression(&quot;!*::antani&quot;);</span>
-<span class="lineNum">      75 </span><span class="lineCov">              2 :         assert(e1(test));</span>
-<span class="lineNum">      76 </span>                : 
-<span class="lineNum">      77 </span><span class="lineCov">              2 :         e1 = Expression(&quot;*::antani&quot;);</span>
-<span class="lineNum">      78 </span><span class="lineCov">              2 :         assert(!e1(test));</span>
-<span class="lineNum">      79 </span><span class="lineCov">              1 : }</span>
-<span class="lineNum">      80 </span>                : 
-<span class="lineNum">      81 </span>                : };
-<span class="lineNum">      82 </span>                : 
-<span class="lineNum">      83 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/debtags/index.html b/rep/ept/debtags/index.html
deleted file mode 100644
index 1f5c5bd..0000000
--- a/rep/ept/debtags/index.html
+++ /dev/null
@@ -1,173 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/debtags</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - ept/debtags</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">702</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">89.2 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">626</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <center>
-  <table width="80%" cellpadding=2 cellspacing=1 border=0>
-
-    <tr>
-      <td width="50%"><br></td>
-      <td width="15%"></td>
-      <td width="15%"></td>
-      <td width="20%"></td>
-    </tr>
-
-    <tr>
-      <td class="tableHead">Filename</td>
-      <td class="tableHead" colspan=3>Coverage</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="debtags.cc.gcov.html">debtags.cc</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../amber.png" width=48 height=10 alt="48.1%"><img src="../../snow.png" width=52 height=10 alt="48.1%"></td></tr></table>
-      </td>
-      <td class="coverPerMed">48.1&nbsp;%</td>
-      <td class="coverNumMed">39&nbsp;/&nbsp;81&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="debtags.h.gcov.html">debtags.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=93 height=10 alt="93.1%"><img src="../../snow.png" width=7 height=10 alt="93.1%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">93.1&nbsp;%</td>
-      <td class="coverNumHi">67&nbsp;/&nbsp;72&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="debtags.tcc.gcov.html">debtags.tcc</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">4&nbsp;/&nbsp;4&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="debtags.test.h.gcov.html">debtags.test.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">103&nbsp;/&nbsp;103&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="expression.cc.gcov.html">expression.cc</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">5&nbsp;/&nbsp;5&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="expression.test.h.gcov.html">expression.test.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">32&nbsp;/&nbsp;32&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="tag.cc.gcov.html">tag.cc</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=75 height=10 alt="74.6%"><img src="../../snow.png" width=25 height=10 alt="74.6%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">74.6&nbsp;%</td>
-      <td class="coverNumHi">44&nbsp;/&nbsp;59&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="tag.h.gcov.html">tag.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=94 height=10 alt="93.8%"><img src="../../snow.png" width=6 height=10 alt="93.8%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">93.8&nbsp;%</td>
-      <td class="coverNumHi">15&nbsp;/&nbsp;16&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="vocabulary.cc.gcov.html">vocabulary.cc</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=95 height=10 alt="95.1%"><img src="../../snow.png" width=5 height=10 alt="95.1%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">95.1&nbsp;%</td>
-      <td class="coverNumHi">97&nbsp;/&nbsp;102&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="vocabulary.h.gcov.html">vocabulary.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=87 height=10 alt="87.3%"><img src="../../snow.png" width=13 height=10 alt="87.3%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">87.3&nbsp;%</td>
-      <td class="coverNumHi">48&nbsp;/&nbsp;55&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="vocabulary.test.h.gcov.html">vocabulary.test.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=99 height=10 alt="99.4%"><img src="../../snow.png" width=1 height=10 alt="99.4%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">99.4&nbsp;%</td>
-      <td class="coverNumHi">172&nbsp;/&nbsp;173&nbsp;lines</td>
-    </tr>
-
-  </table>
-  </center>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/debtags/maint/debdbparser.cc.gcov.html b/rep/ept/debtags/maint/debdbparser.cc.gcov.html
deleted file mode 100644
index df9b37c..0000000
--- a/rep/ept/debtags/maint/debdbparser.cc.gcov.html
+++ /dev/null
@@ -1,255 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/debtags/maint/debdbparser.cc</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">ept/debtags/maint</a> - debdbparser.cc</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">64</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">84.4 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">54</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /*
-<span class="lineNum">       2 </span>                :  * Parser for debian database files
-<span class="lineNum">       3 </span>                :  *
-<span class="lineNum">       4 </span>                :  * Copyright (C) 2003--2007  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">       5 </span>                :  *
-<span class="lineNum">       6 </span>                :  * This library is free software; you can redistribute it and/or
-<span class="lineNum">       7 </span>                :  * modify it under the terms of the GNU Lesser General Public
-<span class="lineNum">       8 </span>                :  * License as published by the Free Software Foundation; either
-<span class="lineNum">       9 </span>                :  * version 2.1 of the License, or (at your option) any later version.
-<span class="lineNum">      10 </span>                :  *
-<span class="lineNum">      11 </span>                :  * This library is distributed in the hope that it will be useful,
-<span class="lineNum">      12 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      13 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-<span class="lineNum">      14 </span>                :  * Lesser General Public License for more details.
-<span class="lineNum">      15 </span>                :  *
-<span class="lineNum">      16 </span>                :  * You should have received a copy of the GNU Lesser General Public
-<span class="lineNum">      17 </span>                :  * License along with this library; if not, write to the Free Software
-<span class="lineNum">      18 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
-<span class="lineNum">      19 </span>                :  */
-<span class="lineNum">      20 </span>                : 
-<span class="lineNum">      21 </span>                : #include &lt;ept/debtags/maint/debdbparser.h&gt;
-<span class="lineNum">      22 </span>                : 
-<span class="lineNum">      23 </span>                : #include &lt;tagcoll/input/base.h&gt;
-<span class="lineNum">      24 </span>                : 
-<span class="lineNum">      25 </span>                : #include &lt;map&gt;
-<span class="lineNum">      26 </span>                : #include &lt;ctype.h&gt;
-<span class="lineNum">      27 </span>                : 
-<span class="lineNum">      28 </span>                : // using namespace std;
-<span class="lineNum">      29 </span>                : using namespace tagcoll;
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : namespace ept {
-<span class="lineNum">      32 </span>                : namespace debtags {
-<span class="lineNum">      33 </span>                : 
-<span class="lineNum">      34 </span>                : // Eat spaces and empty lines
-<span class="lineNum">      35 </span>                : // Returns the number of '\n' encountered
-<span class="lineNum">      36 </span><span class="lineCov">          12089 : int DebDBParser::eatSpacesAndEmptyLines()</span>
-<span class="lineNum">      37 </span>                : {
-<span class="lineNum">      38 </span><span class="lineCov">          12089 :         int res = 0;</span>
-<span class="lineNum">      39 </span>                :         int c;
-<span class="lineNum">      40 </span><span class="lineCov">          31183 :         while ((c = in.nextChar()) != input::Input::Eof &amp;&amp; (isblank(c) || c == '\n'))</span>
-<span class="lineNum">      41 </span><span class="lineCov">           7005 :                 if (c == '\n')</span>
-<span class="lineNum">      42 </span>                :                 {
-<span class="lineNum">      43 </span><span class="lineCov">           3314 :                         isBOL = true;</span>
-<span class="lineNum">      44 </span>                :                         //line++;
-<span class="lineNum">      45 </span><span class="lineCov">           3314 :                         res++;</span>
-<span class="lineNum">      46 </span>                :                 } else
-<span class="lineNum">      47 </span><span class="lineCov">           3691 :                         isBOL = false;</span>
-<span class="lineNum">      48 </span>                : 
-<span class="lineNum">      49 </span><span class="lineCov">          12089 :         if (c == input::Input::Eof)</span>
-<span class="lineNum">      50 </span><span class="lineCov">           1308 :                 isEOF = true;</span>
-<span class="lineNum">      51 </span>                :         else
-<span class="lineNum">      52 </span><span class="lineCov">          10781 :                 in.pushChar(c);</span>
-<span class="lineNum">      53 </span>                : 
-<span class="lineNum">      54 </span><span class="lineCov">          12089 :         return res;</span>
-<span class="lineNum">      55 </span>                : }
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span>                : // Get the ^([A-Za-z0-9]+) field name
-<span class="lineNum">      58 </span><span class="lineCov">           7094 : std::string DebDBParser::getFieldName()</span>
-<span class="lineNum">      59 </span>                : {
-<span class="lineNum">      60 </span><span class="lineCov">           7094 :         if (! isBOL)</span>
-<span class="lineNum">      61 </span><span class="lineNoCov">              0 :                 throw exception::Parser(in, &quot;field must start at the beginning of the line&quot;);</span>
-<span class="lineNum">      62 </span>                : 
-<span class="lineNum">      63 </span><span class="lineCov">           7094 :     std::string res;</span>
-<span class="lineNum">      64 </span>                : 
-<span class="lineNum">      65 </span>                :         int c;
-<span class="lineNum">      66 </span><span class="lineCov">          63954 :         while ((c = in.nextChar()) != input::Input::Eof &amp;&amp; (isalnum(c) || c == '-'))</span>
-<span class="lineNum">      67 </span><span class="lineCov">          49766 :                 res += c;</span>
-<span class="lineNum">      68 </span>                : 
-<span class="lineNum">      69 </span><span class="lineCov">           7094 :         if (c == input::Input::Eof)</span>
-<span class="lineNum">      70 </span>                :         {
-<span class="lineNum">      71 </span><span class="lineNoCov">              0 :                 isEOF = true;</span>
-<span class="lineNum">      72 </span><span class="lineNoCov">              0 :                 if (!res.empty())</span>
-<span class="lineNum">      73 </span><span class="lineNoCov">              0 :                         throw exception::Parser(in, &quot;field is truncated at end of file.  Last line begins with: \&quot;&quot; + res + &quot;\n&quot;);</span>
-<span class="lineNum">      74 </span>                :         } else
-<span class="lineNum">      75 </span><span class="lineCov">           7094 :                 in.pushChar(c);</span>
-<span class="lineNum">      76 </span>                : 
-<span class="lineNum">      77 </span><span class="lineNoCov">              0 :         return res;</span>
-<span class="lineNum">      78 </span>                : }
-<span class="lineNum">      79 </span>                : 
-<span class="lineNum">      80 </span>                : // Eat the \s*: characters that divide the field name and the field
-<span class="lineNum">      81 </span>                : // data
-<span class="lineNum">      82 </span><span class="lineCov">           7094 : void DebDBParser::eatFieldSep()</span>
-<span class="lineNum">      83 </span>                : {
-<span class="lineNum">      84 </span>                :         int c;
-<span class="lineNum">      85 </span>                : 
-<span class="lineNum">      86 </span><span class="lineCov">           7094 :         while ((c = in.nextChar()) != input::Input::Eof &amp;&amp; isblank(c))</span>
-<span class="lineNum">      87 </span>                :                 ;
-<span class="lineNum">      88 </span>                : 
-<span class="lineNum">      89 </span><span class="lineCov">           7094 :         if (c != ':')</span>
-<span class="lineNum">      90 </span>                :         {
-<span class="lineNum">      91 </span><span class="lineNoCov">              0 :                 if (c == input::Input::Eof)</span>
-<span class="lineNum">      92 </span>                :                 {
-<span class="lineNum">      93 </span><span class="lineNoCov">              0 :                         isEOF = true;</span>
-<span class="lineNum">      94 </span><span class="lineNoCov">              0 :                         throw exception::Parser(in, &quot;field is truncated at end of file&quot;);</span>
-<span class="lineNum">      95 </span>                :                 } else {
-<span class="lineNum">      96 </span><span class="lineNoCov">              0 :                         throw exception::Parser(in, std::string(&quot;invalid character `&quot;) + (char)c + &quot;' expecting `:'&quot;);</span>
-<span class="lineNum">      97 </span>                :                 }
-<span class="lineNum">      98 </span>                :         }
-<span class="lineNum">      99 </span><span class="lineCov">           7094 : }</span>
-<span class="lineNum">     100 </span>                : 
-<span class="lineNum">     101 </span>                : // Get the \s*(.+?)\s*\n of a body line
-<span class="lineNum">     102 </span><span class="lineCov">          17875 : void DebDBParser::appendFieldBody(std::string&amp; body)</span>
-<span class="lineNum">     103 </span>                : {
-<span class="lineNum">     104 </span>                :         int c;
-<span class="lineNum">     105 </span>                : 
-<span class="lineNum">     106 </span>                :         // Skip leading spaces
-<span class="lineNum">     107 </span><span class="lineCov">          17875 :         while ((c = in.nextChar()) != input::Input::Eof &amp;&amp; isblank(c))</span>
-<span class="lineNum">     108 </span>                :                 ;
-<span class="lineNum">     109 </span>                : 
-<span class="lineNum">     110 </span>                :         // Get the body part
-<span class="lineNum">     111 </span><span class="lineCov">         280757 :         for ( ; c != input::Input::Eof &amp;&amp; c != '\n'; c = in.nextChar())</span>
-<span class="lineNum">     112 </span><span class="lineCov">         269976 :                 body += c;</span>
-<span class="lineNum">     113 </span>                : 
-<span class="lineNum">     114 </span>                :         // Delete trailing spaces
-<span class="lineNum">     115 </span><span class="lineCov">          10781 :         size_t end = body.find_last_not_of(&quot; \t&quot;);</span>
-<span class="lineNum">     116 </span><span class="lineCov">          10781 :         if (end != std::string::npos)</span>
-<span class="lineNum">     117 </span><span class="lineCov">          10781 :                 body.resize(end + 1);</span>
-<span class="lineNum">     118 </span>                : 
-<span class="lineNum">     119 </span><span class="lineCov">          10781 :         if (c == input::Input::Eof)</span>
-<span class="lineNum">     120 </span><span class="lineNoCov">              0 :                 isEOF = true;</span>
-<span class="lineNum">     121 </span>                :         else
-<span class="lineNum">     122 </span>                :         {
-<span class="lineNum">     123 </span>                :                 //line++;
-<span class="lineNum">     124 </span><span class="lineCov">          10781 :                 isBOL = true;</span>
-<span class="lineNum">     125 </span>                :         }
-<span class="lineNum">     126 </span><span class="lineCov">          10781 : }</span>
-<span class="lineNum">     127 </span>                : 
-<span class="lineNum">     128 </span>                : 
-<span class="lineNum">     129 </span><span class="lineCov">           1308 : DebDBParser::DebDBParser(input::Input&amp; input) :</span>
-<span class="lineNum">     130 </span><span class="lineCov">           1308 :     in(input), isBOL(true), isEOF(false)</span>
-<span class="lineNum">     131 </span>                : {
-<span class="lineNum">     132 </span>                :         // Go at the start of the next record
-<span class="lineNum">     133 </span><span class="lineCov">           1308 :         eatSpacesAndEmptyLines();</span>
-<span class="lineNum">     134 </span><span class="lineCov">           1308 : }</span>
-<span class="lineNum">     135 </span>                : 
-<span class="lineNum">     136 </span>                : 
-<span class="lineNum">     137 </span>                : // Read a record and positions itself at the start of the next one
-<span class="lineNum">     138 </span>                : // Returns false when there are no more records available
-<span class="lineNum">     139 </span><span class="lineCov">           3261 : bool DebDBParser::nextRecord(Record&amp; rec)</span>
-<span class="lineNum">     140 </span>                : {
-<span class="lineNum">     141 </span><span class="lineCov">           3261 :         if (isEOF)</span>
-<span class="lineNum">     142 </span><span class="lineCov">              7 :                 return false;</span>
-<span class="lineNum">     143 </span>                : 
-<span class="lineNum">     144 </span><span class="lineCov">           3254 :         rec.clear();</span>
-<span class="lineNum">     145 </span>                : 
-<span class="lineNum">     146 </span>                :         int n;
-<span class="lineNum">     147 </span><span class="lineCov">          12880 :         do {</span>
-<span class="lineNum">     148 </span>                :                 // Read the field name
-<span class="lineNum">     149 </span><span class="lineCov">           7094 :         std::string field = getFieldName();</span>
-<span class="lineNum">     150 </span><span class="lineCov">           7094 :         std::string body;</span>
-<span class="lineNum">     151 </span>                : 
-<span class="lineNum">     152 </span>                :                 //fprintf(stderr, &quot;Got field: %.*s\n&quot;, field.size(), field.data());
-<span class="lineNum">     153 </span>                : 
-<span class="lineNum">     154 </span>                :                 // Read the colon
-<span class="lineNum">     155 </span><span class="lineCov">           7094 :                 eatFieldSep();</span>
-<span class="lineNum">     156 </span>                : 
-<span class="lineNum">     157 </span>                :                 // Read the first line of the field body
-<span class="lineNum">     158 </span><span class="lineCov">           7094 :                 appendFieldBody(body);</span>
-<span class="lineNum">     159 </span>                :                 //fprintf(stderr, &quot;Got body: %.*s\n&quot;, body.size(), body.data());
-<span class="lineNum">     160 </span>                : 
-<span class="lineNum">     161 </span>                :                 // Read the continuation lines of field body
-<span class="lineNum">     162 </span><span class="lineCov">          17875 :                 while ((n = eatSpacesAndEmptyLines()) == 0 &amp;&amp; ! isBOL)</span>
-<span class="lineNum">     163 </span>                :                 {
-<span class="lineNum">     164 </span><span class="lineCov">           3687 :                         body += '\n';</span>
-<span class="lineNum">     165 </span>                : 
-<span class="lineNum">     166 </span><span class="lineCov">           3687 :                         size_t start_size = body.size();</span>
-<span class="lineNum">     167 </span>                : 
-<span class="lineNum">     168 </span><span class="lineCov">           3687 :                         appendFieldBody(body);</span>
-<span class="lineNum">     169 </span>                : 
-<span class="lineNum">     170 </span>                :                         // Check for dot-only lines to be changed to empty lines
-<span class="lineNum">     171 </span><span class="lineCov">           3687 :                         if (body.size() - start_size == 1 &amp;&amp; body[body.size() - 1] == '.')</span>
-<span class="lineNum">     172 </span><span class="lineCov">            601 :                                 body.resize(body.size() - 1);</span>
-<span class="lineNum">     173 </span>                : 
-<span class="lineNum">     174 </span>                :                         //fprintf(stderr, &quot;Appended body: %.*s\n&quot;, body.size(), body.data());
-<span class="lineNum">     175 </span>                :                 }
-<span class="lineNum">     176 </span>                :                 //fprintf(stderr, &quot;Trailing newlines: %d\n&quot;, n);
-<span class="lineNum">     177 </span>                : 
-<span class="lineNum">     178 </span>                : 
-<span class="lineNum">     179 </span><span class="lineCov">           7094 :                 rec.insert(std::pair&lt;std::string,std::string&gt;(field, body));</span>
-<span class="lineNum">     180 </span>                :         } while (!isEOF &amp;&amp; !n);
-<span class="lineNum">     181 </span>                : 
-<span class="lineNum">     182 </span><span class="lineCov">           3254 :         return true;</span>
-<span class="lineNum">     183 </span>                : }
-<span class="lineNum">     184 </span>                : 
-<span class="lineNum">     185 </span>                : }
-<span class="lineNum">     186 </span><span class="lineCov">              6 : }</span>
-<span class="lineNum">     187 </span>                : 
-<span class="lineNum">     188 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/debtags/maint/debtagsindexer.cc.gcov.html b/rep/ept/debtags/maint/debtagsindexer.cc.gcov.html
deleted file mode 100644
index 143e907..0000000
--- a/rep/ept/debtags/maint/debtagsindexer.cc.gcov.html
+++ /dev/null
@@ -1,332 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/debtags/maint/debtagsindexer.cc</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">ept/debtags/maint</a> - debtagsindexer.cc</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">119</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">74.8 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">89</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #include &lt;ept/debtags/maint/debtagsindexer.h&gt;
-<span class="lineNum">       2 </span>                : #include &lt;ept/debtags/maint/path.h&gt;
-<span class="lineNum">       3 </span>                : #include &lt;ept/debtags/maint/pkgid.h&gt;
-<span class="lineNum">       4 </span>                : #include &lt;ept/debtags/maint/serializer.h&gt;
-<span class="lineNum">       5 </span>                : #include &lt;ept/debtags/vocabulary.h&gt;
-<span class="lineNum">       6 </span>                : 
-<span class="lineNum">       7 </span>                : #include &lt;tagcoll/coll/intdiskindex.h&gt;
-<span class="lineNum">       8 </span>                : #include &lt;tagcoll/coll/simple.h&gt;
-<span class="lineNum">       9 </span>                : #include &lt;tagcoll/TextFormat.h&gt;
-<span class="lineNum">      10 </span>                : #include &lt;tagcoll/stream/filters.h&gt;
-<span class="lineNum">      11 </span>                : 
-<span class="lineNum">      12 </span>                : #include &lt;wibble/exception.h&gt;
-<span class="lineNum">      13 </span>                : 
-<span class="lineNum">      14 </span>                : #include &lt;cstring&gt;
-<span class="lineNum">      15 </span>                : 
-<span class="lineNum">      16 </span>                : using namespace std;
-<span class="lineNum">      17 </span>                : 
-<span class="lineNum">      18 </span>                : namespace ept {
-<span class="lineNum">      19 </span>                : namespace debtags {
-<span class="lineNum">      20 </span>                : 
-<span class="lineNum">      21 </span>                : /// MMapIndexer that indexes the package names
-<span class="lineNum">      22 </span>                : struct PkgIdGenerator : public tagcoll::diskindex::MMapIndexer
-<span class="lineNum">      23 </span><span class="lineCov">              2 : {</span>
-<span class="lineNum">      24 </span>                :         // Sorted set of all available package names
-<span class="lineNum">      25 </span>                :         std::set&lt;std::string&gt; pkgs;
-<span class="lineNum">      26 </span>                : 
-<span class="lineNum">      27 </span><span class="lineCov">              3 :         int encodedSize() const</span>
-<span class="lineNum">      28 </span>                :         {
-<span class="lineNum">      29 </span><span class="lineCov">              3 :                 int size = pkgs.size() * sizeof(int);</span>
-<span class="lineNum">      30 </span><span class="lineCov">          63438 :                 for (std::set&lt;std::string&gt;::const_iterator i = pkgs.begin();</span>
-<span class="lineNum">      31 </span>                :                                 i != pkgs.end(); ++i)
-<span class="lineNum">      32 </span><span class="lineCov">          63435 :                         size += i-&gt;size() + 1;</span>
-<span class="lineNum">      33 </span><span class="lineCov">              3 :                 return tagcoll::diskindex::MMap::align(size);</span>
-<span class="lineNum">      34 </span>                :         }
-<span class="lineNum">      35 </span>                : 
-<span class="lineNum">      36 </span><span class="lineCov">              2 :         void encode(char* buf) const</span>
-<span class="lineNum">      37 </span>                :         {
-<span class="lineNum">      38 </span><span class="lineCov">              2 :                 int pos = pkgs.size() * sizeof(int);</span>
-<span class="lineNum">      39 </span><span class="lineCov">              2 :                 int idx = 0;</span>
-<span class="lineNum">      40 </span><span class="lineCov">          42292 :                 for (std::set&lt;std::string&gt;::const_iterator i = pkgs.begin();</span>
-<span class="lineNum">      41 </span>                :                                 i != pkgs.end(); ++i)
-<span class="lineNum">      42 </span>                :                 {
-<span class="lineNum">      43 </span><span class="lineCov">          42290 :                         ((int*)buf)[idx++] = pos;</span>
-<span class="lineNum">      44 </span><span class="lineCov">          42290 :                         memcpy(buf + pos, i-&gt;c_str(), i-&gt;size() + 1);</span>
-<span class="lineNum">      45 </span><span class="lineCov">          42290 :                         pos += i-&gt;size() + 1;</span>
-<span class="lineNum">      46 </span>                :                 }
-<span class="lineNum">      47 </span><span class="lineCov">              2 :         }</span>
-<span class="lineNum">      48 </span>                : };
-<span class="lineNum">      49 </span>                : 
-<span class="lineNum">      50 </span>                : 
-<span class="lineNum">      51 </span><span class="lineCov">             10 : DebtagsIndexer::DebtagsIndexer(Vocabulary&amp; voc)</span>
-<span class="lineNum">      52 </span>                :         : voc(voc),
-<span class="lineNum">      53 </span>                :           mainSource(Path::debtagsSourceDir()),
-<span class="lineNum">      54 </span><span class="lineCov">             10 :           userSource(Path::debtagsUserSourceDir())</span>
-<span class="lineNum">      55 </span>                : {
-<span class="lineNum">      56 </span><span class="lineCov">             10 :         rescan();</span>
-<span class="lineNum">      57 </span><span class="lineCov">             10 : }</span>
-<span class="lineNum">      58 </span>                : 
-<span class="lineNum">      59 </span><span class="lineCov">             10 : void DebtagsIndexer::rescan()</span>
-<span class="lineNum">      60 </span>                : {
-<span class="lineNum">      61 </span><span class="lineCov">             10 :         ts_main_src = mainSource.timestamp();</span>
-<span class="lineNum">      62 </span><span class="lineCov">             10 :         ts_user_src = userSource.timestamp();</span>
-<span class="lineNum">      63 </span><span class="lineCov">             10 :         ts_main_tag = Path::timestamp(Path::tagdb());</span>
-<span class="lineNum">      64 </span><span class="lineCov">             20 :         ts_main_idx = Path::timestamp(Path::tagdbIndex());</span>
-<span class="lineNum">      65 </span><span class="lineCov">             20 :         ts_user_tag = Path::timestamp(Path::userTagdb());</span>
-<span class="lineNum">      66 </span><span class="lineCov">             20 :         ts_user_idx = Path::timestamp(Path::userTagdbIndex());</span>
-<span class="lineNum">      67 </span><span class="lineCov">             10 : }</span>
-<span class="lineNum">      68 </span>                : 
-<span class="lineNum">      69 </span><span class="lineCov">             10 : bool DebtagsIndexer::needsRebuild() const</span>
-<span class="lineNum">      70 </span>                : {
-<span class="lineNum">      71 </span>                :         // If there are no indexes of any kind, then we need rebuilding
-<span class="lineNum">      72 </span><span class="lineCov">             10 :         if (ts_user_tag == 0 &amp;&amp; ts_user_idx == 0 &amp;&amp; ts_main_tag == 0 &amp;&amp; ts_main_idx == 0)</span>
-<span class="lineNum">      73 </span><span class="lineCov">              2 :                 return true;</span>
-<span class="lineNum">      74 </span>                : 
-<span class="lineNum">      75 </span>                :         // If the user index is ok, then we are fine
-<span class="lineNum">      76 </span><span class="lineCov">              8 :         if (ts_user_tag &gt;= sourceTimestamp() &amp;&amp; ts_user_idx &gt;= sourceTimestamp())</span>
-<span class="lineNum">      77 </span><span class="lineCov">              8 :                 return false;</span>
-<span class="lineNum">      78 </span>                : 
-<span class="lineNum">      79 </span>                :         // If there are user sources, then we cannot use the system index
-<span class="lineNum">      80 </span><span class="lineNoCov">              0 :         if (ts_user_src &gt; 0)</span>
-<span class="lineNum">      81 </span><span class="lineNoCov">              0 :                 return true;</span>
-<span class="lineNum">      82 </span>                : 
-<span class="lineNum">      83 </span>                :         // If there are no user sources, then we can fallback on the system
-<span class="lineNum">      84 </span>                :         // indexes in case the user indexes are not up to date
-<span class="lineNum">      85 </span><span class="lineNoCov">              0 :         if (ts_main_tag &gt;= sourceTimestamp() &amp;&amp; ts_main_idx &gt;= sourceTimestamp())</span>
-<span class="lineNum">      86 </span><span class="lineNoCov">              0 :                 return false;</span>
-<span class="lineNum">      87 </span>                : 
-<span class="lineNum">      88 </span><span class="lineNoCov">              0 :         return true;</span>
-<span class="lineNum">      89 </span>                : }
-<span class="lineNum">      90 </span>                : 
-<span class="lineNum">      91 </span><span class="lineCov">             10 : bool DebtagsIndexer::userIndexIsRedundant() const</span>
-<span class="lineNum">      92 </span>                : {
-<span class="lineNum">      93 </span>                :         // If there is no user index, then it is not redundant
-<span class="lineNum">      94 </span><span class="lineCov">             10 :         if (ts_user_tag == 0 &amp;&amp; ts_user_idx == 0)</span>
-<span class="lineNum">      95 </span><span class="lineCov">              1 :                 return false;</span>
-<span class="lineNum">      96 </span>                : 
-<span class="lineNum">      97 </span>                :         // If we have user sources, then the user index is never redundant
-<span class="lineNum">      98 </span><span class="lineCov">              9 :         if (ts_user_src &gt; 0)</span>
-<span class="lineNum">      99 </span><span class="lineCov">              9 :                 return false;</span>
-<span class="lineNum">     100 </span>                : 
-<span class="lineNum">     101 </span>                :         // If the system index is not up to date, then the user index is not
-<span class="lineNum">     102 </span>                :         // redundant
-<span class="lineNum">     103 </span><span class="lineNoCov">              0 :         if (ts_main_tag &lt; sourceTimestamp() || ts_main_idx &lt; sourceTimestamp())</span>
-<span class="lineNum">     104 </span><span class="lineNoCov">              0 :                 return false;</span>
-<span class="lineNum">     105 </span>                : 
-<span class="lineNum">     106 </span><span class="lineNoCov">              0 :         return true;</span>
-<span class="lineNum">     107 </span>                : }
-<span class="lineNum">     108 </span>                : 
-<span class="lineNum">     109 </span><span class="lineCov">              2 : bool DebtagsIndexer::rebuild(const std::string&amp; tagfname, const std::string&amp; idxfname)</span>
-<span class="lineNum">     110 </span>                : {
-<span class="lineNum">     111 </span>                :         using namespace tagcoll;
-<span class="lineNum">     112 </span>                : 
-<span class="lineNum">     113 </span><span class="lineCov">              2 :         diskindex::MasterMMapIndexer master(idxfname);</span>
-<span class="lineNum">     114 </span>                : 
-<span class="lineNum">     115 </span>                :         // Read and merge tag data
-<span class="lineNum">     116 </span><span class="lineCov">              2 :         coll::Simple&lt;string, string&gt; merged;</span>
-<span class="lineNum">     117 </span><span class="lineCov">              2 :         mainSource.readTags(inserter(merged));</span>
-<span class="lineNum">     118 </span><span class="lineCov">              2 :         userSource.readTags(inserter(merged));</span>
-<span class="lineNum">     119 </span>                : 
-<span class="lineNum">     120 </span><span class="lineCov">              2 :         if (merged.empty())</span>
-<span class="lineNum">     121 </span>                :                 //throw wibble::exception::Consistency(&quot;Reading debtags sources from &quot; + Path::debtagsSourceDir() + &quot; and &quot; + Path::debtagsUserSourceDir(), &quot;Unable to find any tag data&quot;);
-<span class="lineNum">     122 </span><span class="lineCov">              1 :                 return false;</span>
-<span class="lineNum">     123 </span>                : 
-<span class="lineNum">     124 </span>                :         // Create the pkgid index
-<span class="lineNum">     125 </span><span class="lineCov">              1 :         PkgIdGenerator pkgidGen;</span>
-<span class="lineNum">     126 </span><span class="lineCov">          21146 :         for (coll::Simple&lt;string, string&gt;::const_iterator i = merged.begin();</span>
-<span class="lineNum">     127 </span>                :                         i != merged.end(); ++i)
-<span class="lineNum">     128 </span><span class="lineCov">          21145 :                 pkgidGen.pkgs.insert(i-&gt;first);</span>
-<span class="lineNum">     129 </span>                : 
-<span class="lineNum">     130 </span>                :         // Temporary in-memory index to use for converting packages to ints while
-<span class="lineNum">     131 </span>                :         // creating the debtags index
-<span class="lineNum">     132 </span><span class="lineCov">              1 :         char buf[pkgidGen.encodedSize()];</span>
-<span class="lineNum">     133 </span><span class="lineCov">              1 :         pkgidGen.encode(buf);</span>
-<span class="lineNum">     134 </span><span class="lineCov">              1 :         PkgId pkgid(buf, pkgidGen.encodedSize());</span>
-<span class="lineNum">     135 </span>                : 
-<span class="lineNum">     136 </span>                :         // Create the Debtags index
-<span class="lineNum">     137 </span><span class="lineCov">              1 :         coll::IntDiskIndexer tagindexer;</span>
-<span class="lineNum">     138 </span><span class="lineCov">              1 :         merged.output(stringToInt(pkgid, voc, inserter(tagindexer)));</span>
-<span class="lineNum">     139 </span>                : 
-<span class="lineNum">     140 </span>                :         // MMap 0: pkgid
-<span class="lineNum">     141 </span><span class="lineCov">              1 :         master.append(pkgidGen);</span>
-<span class="lineNum">     142 </span>                :         // MMap 1: pkg-&gt;tag
-<span class="lineNum">     143 </span><span class="lineCov">              1 :         master.append(tagindexer.pkgIndexer());</span>
-<span class="lineNum">     144 </span>                :         // MMap 2: tag-&gt;pkg
-<span class="lineNum">     145 </span><span class="lineCov">              1 :         master.append(tagindexer.tagIndexer());</span>
-<span class="lineNum">     146 </span>                : 
-<span class="lineNum">     147 </span>                :         // Write the tag database in text format
-<span class="lineNum">     148 </span><span class="lineCov">              1 :         std::string tmpdb = tagfname + &quot;.tmp&quot;;</span>
-<span class="lineNum">     149 </span><span class="lineCov">              1 :         FILE* out = fopen(tmpdb.c_str(), &quot;wt&quot;);</span>
-<span class="lineNum">     150 </span><span class="lineCov">              1 :         if (!out) throw wibble::exception::File(tmpdb, &quot;creating temporary copy of tag index&quot;);</span>
-<span class="lineNum">     151 </span><span class="lineCov">              1 :         merged.output(textformat::StdioWriter(out));</span>
-<span class="lineNum">     152 </span><span class="lineCov">              1 :         fclose(out);</span>
-<span class="lineNum">     153 </span>                : 
-<span class="lineNum">     154 </span>                :         // Perform &quot;atomic&quot; update of the tag database
-<span class="lineNum">     155 </span>                :         // FIXME: cannot be atomic because race conditions happening between file
-<span class="lineNum">     156 </span>                :         // renames
-<span class="lineNum">     157 </span><span class="lineCov">              1 :         if (rename(tmpdb.c_str(), tagfname.c_str()) == -1)</span>
-<span class="lineNum">     158 </span><span class="lineNoCov">              0 :                 throw wibble::exception::System(&quot;Renaming &quot; + tmpdb + &quot; to &quot; + tagfname);</span>
-<span class="lineNum">     159 </span>                : 
-<span class="lineNum">     160 </span><span class="lineCov">              1 :         master.commit();</span>
-<span class="lineNum">     161 </span><span class="lineCov">              1 :         return true;</span>
-<span class="lineNum">     162 </span>                : }
-<span class="lineNum">     163 </span>                : 
-<span class="lineNum">     164 </span><span class="lineCov">             10 : bool DebtagsIndexer::rebuildIfNeeded()</span>
-<span class="lineNum">     165 </span>                : {
-<span class="lineNum">     166 </span><span class="lineCov">             10 :         if (needsRebuild())</span>
-<span class="lineNum">     167 </span>                :         {
-<span class="lineNum">     168 </span>                :                 // Decide if we rebuild the user index or the system index
-<span class="lineNum">     169 </span>                : 
-<span class="lineNum">     170 </span><span class="lineCov">              2 :                 if (ts_user_src == 0 &amp;&amp; Path::access(Path::debtagsIndexDir(), W_OK) == 0)</span>
-<span class="lineNum">     171 </span>                :                 {
-<span class="lineNum">     172 </span>                :                         // There are no user sources and we can write to the system index
-<span class="lineNum">     173 </span>                :                         // directory: rebuild the system index
-<span class="lineNum">     174 </span><span class="lineCov">              1 :                         if (!rebuild(Path::tagdb(), Path::tagdbIndex()))</span>
-<span class="lineNum">     175 </span><span class="lineCov">              1 :                                 return false;</span>
-<span class="lineNum">     176 </span><span class="lineNoCov">              0 :                         ts_main_tag = Path::timestamp(Path::tagdb());</span>
-<span class="lineNum">     177 </span><span class="lineNoCov">              0 :                         ts_main_idx = Path::timestamp(Path::tagdbIndex());</span>
-<span class="lineNum">     178 </span><span class="lineNoCov">              0 :                         if (Path::tagdb() == Path::userTagdb())</span>
-<span class="lineNum">     179 </span><span class="lineNoCov">              0 :                                 ts_user_tag = ts_main_tag;</span>
-<span class="lineNum">     180 </span><span class="lineNoCov">              0 :                         if (Path::tagdbIndex() == Path::userTagdbIndex())</span>
-<span class="lineNum">     181 </span><span class="lineNoCov">              0 :                                 ts_user_idx = ts_main_idx;</span>
-<span class="lineNum">     182 </span>                :                 } else {
-<span class="lineNum">     183 </span><span class="lineCov">              1 :                         wibble::sys::fs::mkFilePath(Path::userTagdb());</span>
-<span class="lineNum">     184 </span><span class="lineCov">              2 :                         wibble::sys::fs::mkFilePath(Path::userTagdbIndex());</span>
-<span class="lineNum">     185 </span><span class="lineCov">              2 :                         if (!rebuild(Path::userTagdb(), Path::userTagdbIndex()))</span>
-<span class="lineNum">     186 </span><span class="lineNoCov">              0 :                                 return false;</span>
-<span class="lineNum">     187 </span><span class="lineCov">              1 :                         ts_user_tag = Path::timestamp(Path::userTagdb());</span>
-<span class="lineNum">     188 </span><span class="lineCov">              2 :                         ts_user_idx = Path::timestamp(Path::userTagdbIndex());</span>
-<span class="lineNum">     189 </span>                :                 }
-<span class="lineNum">     190 </span><span class="lineCov">              1 :                 return true;</span>
-<span class="lineNum">     191 </span>                :         }
-<span class="lineNum">     192 </span><span class="lineCov">              8 :         return false;</span>
-<span class="lineNum">     193 </span>                : }
-<span class="lineNum">     194 </span>                : 
-<span class="lineNum">     195 </span><span class="lineCov">             10 : bool DebtagsIndexer::deleteRedundantUserIndex()</span>
-<span class="lineNum">     196 </span>                : {
-<span class="lineNum">     197 </span><span class="lineCov">             10 :         if (userIndexIsRedundant())</span>
-<span class="lineNum">     198 </span>                :         {
-<span class="lineNum">     199 </span>                :                 // Delete the user indexes if they exist
-<span class="lineNum">     200 </span><span class="lineNoCov">              0 :                 if (Path::tagdb() != Path::userTagdb())</span>
-<span class="lineNum">     201 </span>                :                 {
-<span class="lineNum">     202 </span><span class="lineNoCov">              0 :                         unlink(Path::userTagdb().c_str());</span>
-<span class="lineNum">     203 </span><span class="lineNoCov">              0 :                         ts_user_tag = 0;</span>
-<span class="lineNum">     204 </span>                :                 }
-<span class="lineNum">     205 </span><span class="lineNoCov">              0 :                 if (Path::tagdbIndex() != Path::userTagdbIndex())</span>
-<span class="lineNum">     206 </span>                :                 {
-<span class="lineNum">     207 </span><span class="lineNoCov">              0 :                         unlink(Path::userTagdbIndex().c_str());</span>
-<span class="lineNum">     208 </span><span class="lineNoCov">              0 :                         ts_user_idx = 0;</span>
-<span class="lineNum">     209 </span>                :                 }
-<span class="lineNum">     210 </span><span class="lineNoCov">              0 :                 return true;</span>
-<span class="lineNum">     211 </span>                :         }
-<span class="lineNum">     212 </span><span class="lineCov">             10 :         return false;</span>
-<span class="lineNum">     213 </span>                : }
-<span class="lineNum">     214 </span>                : 
-<span class="lineNum">     215 </span><span class="lineCov">             10 : bool DebtagsIndexer::getUpToDateTagdb(std::string&amp; tagfname, std::string&amp; idxfname)</span>
-<span class="lineNum">     216 </span>                : {
-<span class="lineNum">     217 </span>                :         // If there are no indexes of any kind, then we have nothing to return
-<span class="lineNum">     218 </span><span class="lineCov">             10 :         if (ts_user_tag == 0 &amp;&amp; ts_user_idx == 0 &amp;&amp; ts_main_tag == 0 &amp;&amp; ts_main_idx == 0)</span>
-<span class="lineNum">     219 </span><span class="lineCov">              1 :                 return false;</span>
-<span class="lineNum">     220 </span>                : 
-<span class="lineNum">     221 </span>                :         // If the user index is up to date, use it
-<span class="lineNum">     222 </span><span class="lineCov">              9 :         if (ts_user_tag &gt;= sourceTimestamp() &amp;&amp;</span>
-<span class="lineNum">     223 </span>                :                 ts_user_idx &gt;= sourceTimestamp())
-<span class="lineNum">     224 </span>                :         {
-<span class="lineNum">     225 </span><span class="lineCov">              9 :                 tagfname = Path::userTagdb();</span>
-<span class="lineNum">     226 </span><span class="lineCov">             18 :                 idxfname = Path::userTagdbIndex();</span>
-<span class="lineNum">     227 </span><span class="lineCov">              9 :                 return true;</span>
-<span class="lineNum">     228 </span>                :         }
-<span class="lineNum">     229 </span>                : 
-<span class="lineNum">     230 </span>                :         // If the user index is not up to date and we have user sources, we cannot
-<span class="lineNum">     231 </span>                :         // fall back to the system index
-<span class="lineNum">     232 </span><span class="lineNoCov">              0 :         if (ts_user_src != 0)</span>
-<span class="lineNum">     233 </span><span class="lineNoCov">              0 :                 return false;</span>
-<span class="lineNum">     234 </span>                :         
-<span class="lineNum">     235 </span>                :         // Fallback to the system index
-<span class="lineNum">     236 </span><span class="lineNoCov">              0 :         if (ts_main_tag &gt;= sourceTimestamp() &amp;&amp;</span>
-<span class="lineNum">     237 </span>                :                 ts_main_idx &gt;= sourceTimestamp())
-<span class="lineNum">     238 </span>                :         {
-<span class="lineNum">     239 </span><span class="lineNoCov">              0 :                 tagfname = Path::tagdb();</span>
-<span class="lineNum">     240 </span><span class="lineNoCov">              0 :                 idxfname = Path::tagdbIndex();</span>
-<span class="lineNum">     241 </span><span class="lineNoCov">              0 :                 return true;</span>
-<span class="lineNum">     242 </span>                :         }
-<span class="lineNum">     243 </span>                :         
-<span class="lineNum">     244 </span><span class="lineNoCov">              0 :         return false;</span>
-<span class="lineNum">     245 </span>                : }
-<span class="lineNum">     246 </span>                : 
-<span class="lineNum">     247 </span>                : 
-<span class="lineNum">     248 </span>                : 
-<span class="lineNum">     249 </span><span class="lineCov">             10 : bool DebtagsIndexer::obtainWorkingDebtags(Vocabulary&amp; voc, std::string&amp; tagfname, std::string&amp; idxfname)</span>
-<span class="lineNum">     250 </span>                : {
-<span class="lineNum">     251 </span><span class="lineCov">             10 :         DebtagsIndexer t(voc);</span>
-<span class="lineNum">     252 </span>                : 
-<span class="lineNum">     253 </span><span class="lineCov">             10 :         t.rebuildIfNeeded();</span>
-<span class="lineNum">     254 </span><span class="lineCov">             10 :         t.deleteRedundantUserIndex();</span>
-<span class="lineNum">     255 </span><span class="lineCov">             10 :         return t.getUpToDateTagdb(tagfname, idxfname);</span>
-<span class="lineNum">     256 </span>                : }
-<span class="lineNum">     257 </span>                : 
-<span class="lineNum">     258 </span>                : }
-<span class="lineNum">     259 </span>                : }
-<span class="lineNum">     260 </span>                : 
-<span class="lineNum">     261 </span>                : #include &lt;ept/debtags/maint/sourcedir.tcc&gt;
-<span class="lineNum">     262 </span>                : #include &lt;tagcoll/coll/simple.tcc&gt;
-<span class="lineNum">     263 </span>                : 
-<span class="lineNum">     264 </span>                : // vim:set ts=4 sw=4:
-<span class="lineNum">     265 </span>                : // -*- C++ -*-
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/debtags/maint/debtagsindexer.h.gcov.html b/rep/ept/debtags/maint/debtagsindexer.h.gcov.html
deleted file mode 100644
index a67cc3a..0000000
--- a/rep/ept/debtags/maint/debtagsindexer.h.gcov.html
+++ /dev/null
@@ -1,118 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/debtags/maint/debtagsindexer.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">ept/debtags/maint</a> - debtagsindexer.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">5</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">5</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #ifndef EPT_DEBTAGS_DEBTAGSINDEXER_H
-<span class="lineNum">       2 </span>                : #define EPT_DEBTAGS_DEBTAGSINDEXER_H
-<span class="lineNum">       3 </span>                : 
-<span class="lineNum">       4 </span>                : #include &lt;ept/debtags/maint/sourcedir.h&gt;
-<span class="lineNum">       5 </span>                : #include &lt;string&gt;
-<span class="lineNum">       6 </span>                : 
-<span class="lineNum">       7 </span>                : namespace ept {
-<span class="lineNum">       8 </span>                : namespace debtags {
-<span class="lineNum">       9 </span>                : 
-<span class="lineNum">      10 </span>                : class Vocabulary;
-<span class="lineNum">      11 </span>                : 
-<span class="lineNum">      12 </span>                : struct DebtagsIndexer
-<span class="lineNum">      13 </span><span class="lineCov">             10 : {</span>
-<span class="lineNum">      14 </span>                :         Vocabulary&amp; voc;
-<span class="lineNum">      15 </span>                : 
-<span class="lineNum">      16 </span>                :         SourceDir mainSource;
-<span class="lineNum">      17 </span>                :         SourceDir userSource;
-<span class="lineNum">      18 </span>                :         time_t ts_main_src;
-<span class="lineNum">      19 </span>                :         time_t ts_user_src;
-<span class="lineNum">      20 </span>                :         time_t ts_main_tag;
-<span class="lineNum">      21 </span>                :         time_t ts_main_idx;
-<span class="lineNum">      22 </span>                :         time_t ts_user_tag;
-<span class="lineNum">      23 </span>                :         time_t ts_user_idx;
-<span class="lineNum">      24 </span>                : 
-<span class="lineNum">      25 </span><span class="lineCov">             34 :         time_t sourceTimestamp() const</span>
-<span class="lineNum">      26 </span>                :         {
-<span class="lineNum">      27 </span><span class="lineCov">             34 :                 time_t res = ts_main_src;</span>
-<span class="lineNum">      28 </span><span class="lineCov">             34 :                 if (ts_user_src &gt; res) res = ts_user_src;</span>
-<span class="lineNum">      29 </span><span class="lineCov">             34 :                 return res;</span>
-<span class="lineNum">      30 </span>                :         }
-<span class="lineNum">      31 </span>                :         bool needsRebuild() const;
-<span class="lineNum">      32 </span>                :         bool rebuild(const std::string&amp; tagfname, const std::string&amp; idxfname);
-<span class="lineNum">      33 </span>                :         bool rebuildIfNeeded();
-<span class="lineNum">      34 </span>                :         bool getUpToDateTagdb(std::string&amp; tagfname, std::string&amp; idxfname);
-<span class="lineNum">      35 </span>                : 
-<span class="lineNum">      36 </span>                :         bool userIndexIsRedundant() const;
-<span class="lineNum">      37 </span>                :         bool deleteRedundantUserIndex();
-<span class="lineNum">      38 </span>                : 
-<span class="lineNum">      39 </span>                :         void rescan();
-<span class="lineNum">      40 </span>                : 
-<span class="lineNum">      41 </span>                :         DebtagsIndexer(Vocabulary&amp; voc);
-<span class="lineNum">      42 </span>                : 
-<span class="lineNum">      43 </span>                :         static bool obtainWorkingDebtags(Vocabulary&amp; voc, std::string&amp; tagfname, std::string&amp; idxfname);
-<span class="lineNum">      44 </span>                : };
-<span class="lineNum">      45 </span>                : 
-<span class="lineNum">      46 </span>                : 
-<span class="lineNum">      47 </span>                : }
-<span class="lineNum">      48 </span>                : }
-<span class="lineNum">      49 </span>                : 
-<span class="lineNum">      50 </span>                : // vim:set ts=4 sw=4:
-<span class="lineNum">      51 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/debtags/maint/index.html b/rep/ept/debtags/maint/index.html
deleted file mode 100644
index ca8f250..0000000
--- a/rep/ept/debtags/maint/index.html
+++ /dev/null
@@ -1,236 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/debtags/maint</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - ept/debtags/maint</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">846</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">84.9 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">718</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <center>
-  <table width="80%" cellpadding=2 cellspacing=1 border=0>
-
-    <tr>
-      <td width="50%"><br></td>
-      <td width="15%"></td>
-      <td width="15%"></td>
-      <td width="20%"></td>
-    </tr>
-
-    <tr>
-      <td class="tableHead">Filename</td>
-      <td class="tableHead" colspan=3>Coverage</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="debdbparser.cc.gcov.html">debdbparser.cc</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=84 height=10 alt="84.4%"><img src="../../../snow.png" width=16 height=10 alt="84.4%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">84.4&nbsp;%</td>
-      <td class="coverNumHi">54&nbsp;/&nbsp;64&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="debtagsindexer.cc.gcov.html">debtagsindexer.cc</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=75 height=10 alt="74.8%"><img src="../../../snow.png" width=25 height=10 alt="74.8%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">74.8&nbsp;%</td>
-      <td class="coverNumHi">89&nbsp;/&nbsp;119&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="debtagsindexer.h.gcov.html">debtagsindexer.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">5&nbsp;/&nbsp;5&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="path.cc.gcov.html">path.cc</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=91 height=10 alt="90.7%"><img src="../../../snow.png" width=9 height=10 alt="90.7%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">90.7&nbsp;%</td>
-      <td class="coverNumHi">49&nbsp;/&nbsp;54&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="path.h.gcov.html">path.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">17&nbsp;/&nbsp;17&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="pkgid.cc.gcov.html">pkgid.cc</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=87 height=10 alt="86.7%"><img src="../../../snow.png" width=13 height=10 alt="86.7%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">86.7&nbsp;%</td>
-      <td class="coverNumHi">13&nbsp;/&nbsp;15&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="pkgid.h.gcov.html">pkgid.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=83 height=10 alt="83.3%"><img src="../../../snow.png" width=17 height=10 alt="83.3%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">83.3&nbsp;%</td>
-      <td class="coverNumHi">5&nbsp;/&nbsp;6&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="pkgid.test.h.gcov.html">pkgid.test.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">18&nbsp;/&nbsp;18&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="serializer.h.gcov.html">serializer.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=98 height=10 alt="97.8%"><img src="../../../snow.png" width=2 height=10 alt="97.8%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">97.8&nbsp;%</td>
-      <td class="coverNumHi">87&nbsp;/&nbsp;89&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="serializer.test.h.gcov.html">serializer.test.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">48&nbsp;/&nbsp;48&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="sourcedir.cc.gcov.html">sourcedir.cc</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=75 height=10 alt="75.4%"><img src="../../../snow.png" width=25 height=10 alt="75.4%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">75.4&nbsp;%</td>
-      <td class="coverNumHi">43&nbsp;/&nbsp;57&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="sourcedir.h.gcov.html">sourcedir.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">3&nbsp;/&nbsp;3&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="sourcedir.tcc.gcov.html">sourcedir.tcc</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=89 height=10 alt="88.9%"><img src="../../../snow.png" width=11 height=10 alt="88.9%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">88.9&nbsp;%</td>
-      <td class="coverNumHi">8&nbsp;/&nbsp;9&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="vocabularyindexer.cc.gcov.html">vocabularyindexer.cc</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=69 height=10 alt="69.1%"><img src="../../../snow.png" width=31 height=10 alt="69.1%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">69.1&nbsp;%</td>
-      <td class="coverNumHi">65&nbsp;/&nbsp;94&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="vocabularyindexer.h.gcov.html">vocabularyindexer.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">2&nbsp;/&nbsp;2&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="vocabularymerger.cc.gcov.html">vocabularymerger.cc</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=81 height=10 alt="81.2%"><img src="../../../snow.png" width=19 height=10 alt="81.2%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">81.2&nbsp;%</td>
-      <td class="coverNumHi">147&nbsp;/&nbsp;181&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="vocabularymerger.h.gcov.html">vocabularymerger.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">13&nbsp;/&nbsp;13&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="vocabularymerger.test.h.gcov.html">vocabularymerger.test.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">52&nbsp;/&nbsp;52&nbsp;lines</td>
-    </tr>
-
-  </table>
-  </center>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/debtags/maint/path.cc.gcov.html b/rep/ept/debtags/maint/path.cc.gcov.html
deleted file mode 100644
index c9af780..0000000
--- a/rep/ept/debtags/maint/path.cc.gcov.html
+++ /dev/null
@@ -1,207 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/debtags/maint/path.cc</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">ept/debtags/maint</a> - path.cc</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">54</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">90.7 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">49</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- mode: c++; indent-tabs-mode: t -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : /** \file
-<span class="lineNum">       4 </span>                :  * debtags paths
-<span class="lineNum">       5 </span>                :  */
-<span class="lineNum">       6 </span>                : 
-<span class="lineNum">       7 </span>                : /*
-<span class="lineNum">       8 </span>                :  * Copyright (C) 2005,2006,2007  Enrico Zini &lt;enrico@debian.org&gt;, Peter Rockai &lt;me@mornfall.net&gt;
-<span class="lineNum">       9 </span>                :  *
-<span class="lineNum">      10 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">      11 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">      12 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">      13 </span>                :  * (at your option) any later version.
-<span class="lineNum">      14 </span>                :  *
-<span class="lineNum">      15 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      16 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      17 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      18 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      19 </span>                :  *
-<span class="lineNum">      20 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      21 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      22 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      23 </span>                :  */
-<span class="lineNum">      24 </span>                : 
-<span class="lineNum">      25 </span>                : #include &lt;ept/debtags/maint/path.h&gt;
-<span class="lineNum">      26 </span>                : #include &lt;ept/config.h&gt;
-<span class="lineNum">      27 </span>                : 
-<span class="lineNum">      28 </span>                : #include &lt;wibble/sys/fs.h&gt;
-<span class="lineNum">      29 </span>                : #include &lt;wibble/string.h&gt;
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : #include &lt;sys/types.h&gt;    // getpwuid, stat, mkdir, getuid
-<span class="lineNum">      32 </span>                : #include &lt;sys/stat.h&gt;     // stat, mkdir
-<span class="lineNum">      33 </span>                : #include &lt;pwd.h&gt;          // getpwuid
-<span class="lineNum">      34 </span>                : #include &lt;unistd.h&gt;               // stat, getuid
-<span class="lineNum">      35 </span>                : 
-<span class="lineNum">      36 </span>                : using namespace wibble;
-<span class="lineNum">      37 </span>                : 
-<span class="lineNum">      38 </span>                : namespace ept {
-<span class="lineNum">      39 </span>                : namespace debtags {
-<span class="lineNum">      40 </span>                : 
-<span class="lineNum">      41 </span><span class="lineCov">              2 : static std::string userdir()</span>
-<span class="lineNum">      42 </span>                : {
-<span class="lineNum">      43 </span><span class="lineCov">              2 :         std::string rcdir;</span>
-<span class="lineNum">      44 </span>                : 
-<span class="lineNum">      45 </span><span class="lineCov">              2 :         struct passwd* udata = getpwuid(getuid());</span>
-<span class="lineNum">      46 </span><span class="lineCov">              2 :         rcdir = str::joinpath(udata-&gt;pw_dir, &quot;.debtags&quot;);</span>
-<span class="lineNum">      47 </span>                : 
-<span class="lineNum">      48 </span><span class="lineNoCov">              0 :         return rcdir;</span>
-<span class="lineNum">      49 </span>                : }
-<span class="lineNum">      50 </span>                : 
-<span class="lineNum">      51 </span>                : 
-<span class="lineNum">      52 </span><span class="lineCov">            732 : Path &amp;Path::instance() {</span>
-<span class="lineNum">      53 </span><span class="lineCov">            732 :         if (!s_instance) {</span>
-<span class="lineNum">      54 </span><span class="lineCov">              1 :                 s_instance = new Path;</span>
-<span class="lineNum">      55 </span><span class="lineCov">              1 :                 instance().m_debtagsSourceDir = DEBTAGS_DB_DIR;</span>
-<span class="lineNum">      56 </span><span class="lineCov">              1 :                 instance().m_debtagsIndexDir = DEBTAGS_DB_DIR;</span>
-<span class="lineNum">      57 </span><span class="lineCov">              2 :                 instance().m_debtagsUserSourceDir = userdir();</span>
-<span class="lineNum">      58 </span><span class="lineCov">              2 :                 instance().m_debtagsUserIndexDir = userdir();</span>
-<span class="lineNum">      59 </span>                :         }
-<span class="lineNum">      60 </span><span class="lineCov">            732 :         return *s_instance;</span>
-<span class="lineNum">      61 </span>                : }
-<span class="lineNum">      62 </span>                : 
-<span class="lineNum">      63 </span><span class="lineCov">             12 : int Path::access( const std::string &amp;s, int m ) {</span>
-<span class="lineNum">      64 </span><span class="lineCov">             12 :         return ::access( s.c_str(), m );</span>
-<span class="lineNum">      65 </span>                : }
-<span class="lineNum">      66 </span>                : 
-<span class="lineNum">      67 </span><span class="lineCov">            300 : time_t Path::timestamp( const std::string&amp; file ) {</span>
-<span class="lineNum">      68 </span><span class="lineCov">            300 :         std::auto_ptr&lt;struct stat&gt; st = wibble::sys::fs::stat(file);</span>
-<span class="lineNum">      69 </span><span class="lineCov">            580 :         return st.get() == NULL ? 0 : st-&gt;st_mtime;</span>
-<span class="lineNum">      70 </span>                : }
-<span class="lineNum">      71 </span>                : 
-<span class="lineNum">      72 </span><span class="lineCov">             62 : void Path::setDebtagsSourceDir( const std::string &amp;s )</span>
-<span class="lineNum">      73 </span>                : {
-<span class="lineNum">      74 </span><span class="lineCov">             62 :         instance().m_debtagsSourceDir = s;</span>
-<span class="lineNum">      75 </span><span class="lineCov">             62 : }</span>
-<span class="lineNum">      76 </span><span class="lineCov">             62 : void Path::setDebtagsIndexDir( const std::string &amp;s )</span>
-<span class="lineNum">      77 </span>                : {
-<span class="lineNum">      78 </span><span class="lineCov">             62 :         instance().m_debtagsIndexDir = s;</span>
-<span class="lineNum">      79 </span><span class="lineCov">             62 : }</span>
-<span class="lineNum">      80 </span><span class="lineCov">             62 : void Path::setDebtagsUserSourceDir( const std::string &amp;s )</span>
-<span class="lineNum">      81 </span>                : {
-<span class="lineNum">      82 </span><span class="lineCov">             62 :         instance().m_debtagsUserSourceDir = s;</span>
-<span class="lineNum">      83 </span><span class="lineCov">             62 : }</span>
-<span class="lineNum">      84 </span><span class="lineCov">             62 : void Path::setDebtagsUserIndexDir( const std::string &amp;s )</span>
-<span class="lineNum">      85 </span>                : {
-<span class="lineNum">      86 </span><span class="lineCov">             62 :         instance().m_debtagsUserIndexDir = s;</span>
-<span class="lineNum">      87 </span><span class="lineCov">             62 : }</span>
-<span class="lineNum">      88 </span>                : 
-<span class="lineNum">      89 </span><span class="lineCov">             72 : std::string Path::debtagsSourceDir() { return instance().m_debtagsSourceDir; }</span>
-<span class="lineNum">      90 </span><span class="lineCov">            121 : std::string Path::debtagsIndexDir() { return instance().m_debtagsIndexDir; }</span>
-<span class="lineNum">      91 </span><span class="lineCov">             82 : std::string Path::debtagsUserSourceDir() { return instance().m_debtagsUserSourceDir; }</span>
-<span class="lineNum">      92 </span><span class="lineCov">            205 : std::string Path::debtagsUserIndexDir() { return instance().m_debtagsUserIndexDir; }</span>
-<span class="lineNum">      93 </span>                : 
-<span class="lineNum">      94 </span><span class="lineCov">             33 : std::string Path::vocabulary() {</span>
-<span class="lineNum">      95 </span><span class="lineCov">             33 :         return str::joinpath(debtagsIndexDir(), &quot;vocabulary&quot;);</span>
-<span class="lineNum">      96 </span>                : }
-<span class="lineNum">      97 </span>                : 
-<span class="lineNum">      98 </span><span class="lineCov">             32 : std::string Path::vocabularyIndex() {</span>
-<span class="lineNum">      99 </span><span class="lineCov">             32 :         return str::joinpath(debtagsIndexDir(), &quot;vocabulary.idx&quot;);</span>
-<span class="lineNum">     100 </span>                : }
-<span class="lineNum">     101 </span>                : 
-<span class="lineNum">     102 </span><span class="lineCov">             65 : std::string Path::userVocabulary() {</span>
-<span class="lineNum">     103 </span><span class="lineCov">             65 :         return str::joinpath(debtagsUserIndexDir(), &quot;vocabulary&quot;);</span>
-<span class="lineNum">     104 </span>                : }
-<span class="lineNum">     105 </span>                : 
-<span class="lineNum">     106 </span><span class="lineCov">             65 : std::string Path::userVocabularyIndex() {</span>
-<span class="lineNum">     107 </span><span class="lineCov">             65 :         return str::joinpath(debtagsUserIndexDir(), &quot;vocabulary.idx&quot;);</span>
-<span class="lineNum">     108 </span>                : }
-<span class="lineNum">     109 </span>                : 
-<span class="lineNum">     110 </span><span class="lineCov">             11 : std::string Path::tagdb() {</span>
-<span class="lineNum">     111 </span><span class="lineCov">             11 :         return str::joinpath(debtagsIndexDir(), &quot;package-tags&quot;);</span>
-<span class="lineNum">     112 </span>                : }
-<span class="lineNum">     113 </span>                : 
-<span class="lineNum">     114 </span><span class="lineCov">             11 : std::string Path::tagdbIndex() {</span>
-<span class="lineNum">     115 </span><span class="lineCov">             11 :         return str::joinpath(debtagsIndexDir(), &quot;package-tags.idx&quot;);</span>
-<span class="lineNum">     116 </span>                : }
-<span class="lineNum">     117 </span>                : 
-<span class="lineNum">     118 </span><span class="lineCov">             22 : std::string Path::userTagdb() {</span>
-<span class="lineNum">     119 </span><span class="lineCov">             22 :         return str::joinpath(debtagsUserIndexDir(), &quot;package-tags&quot;);</span>
-<span class="lineNum">     120 </span>                : }
-<span class="lineNum">     121 </span>                : 
-<span class="lineNum">     122 </span><span class="lineCov">             22 : std::string Path::userTagdbIndex() {</span>
-<span class="lineNum">     123 </span><span class="lineCov">             22 :         return str::joinpath(debtagsUserIndexDir(), &quot;package-tags.idx&quot;);</span>
-<span class="lineNum">     124 </span>                : }
-<span class="lineNum">     125 </span>                : 
-<span class="lineNum">     126 </span><span class="lineNoCov">              0 : std::string Path::pkgidx() {</span>
-<span class="lineNum">     127 </span><span class="lineNoCov">              0 :         return str::joinpath(debtagsIndexDir(), &quot;pkgidx.idx&quot;);</span>
-<span class="lineNum">     128 </span>                : }
-<span class="lineNum">     129 </span>                : 
-<span class="lineNum">     130 </span><span class="lineNoCov">              0 : std::string Path::userPkgidx() {</span>
-<span class="lineNum">     131 </span><span class="lineNoCov">              0 :         return str::joinpath(debtagsUserIndexDir(), &quot;pkgidx.idx&quot;);</span>
-<span class="lineNum">     132 </span>                : }
-<span class="lineNum">     133 </span>                : 
-<span class="lineNum">     134 </span>                : 
-<span class="lineNum">     135 </span>                : Path *Path::s_instance = 0;
-<span class="lineNum">     136 </span>                : 
-<span class="lineNum">     137 </span>                : }
-<span class="lineNum">     138 </span>                : }
-<span class="lineNum">     139 </span>                : 
-<span class="lineNum">     140 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/debtags/maint/path.h.gcov.html b/rep/ept/debtags/maint/path.h.gcov.html
deleted file mode 100644
index 35e7710..0000000
--- a/rep/ept/debtags/maint/path.h.gcov.html
+++ /dev/null
@@ -1,200 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/debtags/maint/path.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">ept/debtags/maint</a> - path.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">17</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">17</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- mode: c++; indent-tabs-mode: t -*-
-<span class="lineNum">       2 </span>                : /** \file
-<span class="lineNum">       3 </span>                :  * debtags paths
-<span class="lineNum">       4 </span>                :  */
-<span class="lineNum">       5 </span>                : 
-<span class="lineNum">       6 </span>                : /*
-<span class="lineNum">       7 </span>                :  * Copyright (C) 2005,2006,2007  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">       8 </span>                :  *
-<span class="lineNum">       9 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">      10 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">      11 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">      12 </span>                :  * (at your option) any later version.
-<span class="lineNum">      13 </span>                :  *
-<span class="lineNum">      14 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      15 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      16 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      17 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      18 </span>                :  *
-<span class="lineNum">      19 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      20 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      21 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      22 </span>                :  */
-<span class="lineNum">      23 </span>                : 
-<span class="lineNum">      24 </span>                : #include &lt;string&gt;
-<span class="lineNum">      25 </span>                : 
-<span class="lineNum">      26 </span>                : struct stat;
-<span class="lineNum">      27 </span>                : 
-<span class="lineNum">      28 </span>                : #ifndef EPT_DEBTAGS_PATH_H
-<span class="lineNum">      29 </span>                : #define EPT_DEBTAGS_PATH_H
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : namespace ept {
-<span class="lineNum">      32 </span>                : namespace debtags {
-<span class="lineNum">      33 </span>                : 
-<span class="lineNum">      34 </span>                : /**
-<span class="lineNum">      35 </span>                :  * Singleton class to configure and access the various Debtags paths
-<span class="lineNum">      36 </span>                :  */
-<span class="lineNum">      37 </span>                : class Path
-<span class="lineNum">      38 </span><span class="lineCov">              1 : {</span>
-<span class="lineNum">      39 </span>                : public:
-<span class="lineNum">      40 </span>                :         static std::string vocabulary();
-<span class="lineNum">      41 </span>                :         static std::string vocabularyIndex();
-<span class="lineNum">      42 </span>                :         static std::string userVocabulary();
-<span class="lineNum">      43 </span>                :         static std::string userVocabularyIndex();
-<span class="lineNum">      44 </span>                :         static std::string tagdb();
-<span class="lineNum">      45 </span>                :         static std::string tagdbIndex();
-<span class="lineNum">      46 </span>                :         static std::string userTagdb();
-<span class="lineNum">      47 </span>                :         static std::string userTagdbIndex();
-<span class="lineNum">      48 </span>                :         static std::string pkgidx();
-<span class="lineNum">      49 </span>                :         static std::string userPkgidx();
-<span class="lineNum">      50 </span>                : 
-<span class="lineNum">      51 </span>                :         static std::string debtagsSourceDir();
-<span class="lineNum">      52 </span>                :         static std::string debtagsIndexDir();
-<span class="lineNum">      53 </span>                :         static std::string debtagsUserSourceDir();
-<span class="lineNum">      54 </span>                :         static std::string debtagsUserIndexDir();
-<span class="lineNum">      55 </span>                : 
-<span class="lineNum">      56 </span>                :         // Directory where Debtags source data is found
-<span class="lineNum">      57 </span>                :         static void setDebtagsSourceDir( const std::string &amp;s );
-<span class="lineNum">      58 </span>                : 
-<span class="lineNum">      59 </span>                :         // Directory where Debtags indexes are kept
-<span class="lineNum">      60 </span>                :         static void setDebtagsIndexDir( const std::string &amp;s );
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span>                :         // User-specific directory for Debtags source data
-<span class="lineNum">      63 </span>                :         static void setDebtagsUserSourceDir( const std::string &amp;s );
-<span class="lineNum">      64 </span>                : 
-<span class="lineNum">      65 </span>                :         // User-specific directory for Debtags index data
-<span class="lineNum">      66 </span>                :         static void setDebtagsUserIndexDir( const std::string &amp;s );
-<span class="lineNum">      67 </span>                : 
-<span class="lineNum">      68 </span>                :         static int access( const std::string &amp;, int );
-<span class="lineNum">      69 </span>                :         static time_t timestamp( const std::string&amp; );
-<span class="lineNum">      70 </span>                : 
-<span class="lineNum">      71 </span>                :         // RAII-style classes to temporarily override directories
-<span class="lineNum">      72 </span>                :         class OverrideDebtagsSourceDir
-<span class="lineNum">      73 </span>                :         {
-<span class="lineNum">      74 </span>                :                 std::string old;
-<span class="lineNum">      75 </span>                :         public:
-<span class="lineNum">      76 </span><span class="lineCov">             31 :                 OverrideDebtagsSourceDir(const std::string&amp; path) : old(Path::debtagsSourceDir())</span>
-<span class="lineNum">      77 </span>                :                 {
-<span class="lineNum">      78 </span><span class="lineCov">             31 :                         Path::setDebtagsSourceDir(path);</span>
-<span class="lineNum">      79 </span><span class="lineCov">             31 :                 }</span>
-<span class="lineNum">      80 </span><span class="lineCov">             31 :                 ~OverrideDebtagsSourceDir() { Path::setDebtagsSourceDir(old); }</span>
-<span class="lineNum">      81 </span>                :         };
-<span class="lineNum">      82 </span>                :         class OverrideDebtagsIndexDir
-<span class="lineNum">      83 </span>                :         {
-<span class="lineNum">      84 </span>                :                 std::string old;
-<span class="lineNum">      85 </span>                :         public:
-<span class="lineNum">      86 </span><span class="lineCov">             31 :                 OverrideDebtagsIndexDir(const std::string&amp; path) : old(Path::debtagsIndexDir())</span>
-<span class="lineNum">      87 </span>                :                 {
-<span class="lineNum">      88 </span><span class="lineCov">             31 :                         Path::setDebtagsIndexDir(path);</span>
-<span class="lineNum">      89 </span><span class="lineCov">             31 :                 }</span>
-<span class="lineNum">      90 </span><span class="lineCov">             31 :                 ~OverrideDebtagsIndexDir() { Path::setDebtagsIndexDir(old); }</span>
-<span class="lineNum">      91 </span>                :         };
-<span class="lineNum">      92 </span>                :         class OverrideDebtagsUserSourceDir
-<span class="lineNum">      93 </span>                :         {
-<span class="lineNum">      94 </span>                :                 std::string old;
-<span class="lineNum">      95 </span>                :         public:
-<span class="lineNum">      96 </span><span class="lineCov">             31 :                 OverrideDebtagsUserSourceDir(const std::string&amp; path) : old(Path::debtagsUserSourceDir())</span>
-<span class="lineNum">      97 </span>                :                 {
-<span class="lineNum">      98 </span><span class="lineCov">             31 :                         Path::setDebtagsUserSourceDir(path);</span>
-<span class="lineNum">      99 </span><span class="lineCov">             31 :                 }</span>
-<span class="lineNum">     100 </span><span class="lineCov">             31 :                 ~OverrideDebtagsUserSourceDir() { Path::setDebtagsUserSourceDir(old); }</span>
-<span class="lineNum">     101 </span>                :         };
-<span class="lineNum">     102 </span>                :         class OverrideDebtagsUserIndexDir
-<span class="lineNum">     103 </span>                :         {
-<span class="lineNum">     104 </span>                :                 std::string old;
-<span class="lineNum">     105 </span>                :         public:
-<span class="lineNum">     106 </span><span class="lineCov">             31 :                 OverrideDebtagsUserIndexDir(const std::string&amp; path) : old(Path::debtagsUserIndexDir())</span>
-<span class="lineNum">     107 </span>                :                 {
-<span class="lineNum">     108 </span><span class="lineCov">             31 :                         Path::setDebtagsUserIndexDir(path);</span>
-<span class="lineNum">     109 </span><span class="lineCov">             31 :                 }</span>
-<span class="lineNum">     110 </span><span class="lineCov">             31 :                 ~OverrideDebtagsUserIndexDir() { Path::setDebtagsUserIndexDir(old); }</span>
-<span class="lineNum">     111 </span>                :         };
-<span class="lineNum">     112 </span>                : protected:
-<span class="lineNum">     113 </span>                :         static Path *s_instance;
-<span class="lineNum">     114 </span>                :         static Path &amp;instance();
-<span class="lineNum">     115 </span>                : 
-<span class="lineNum">     116 </span>                :         // Directory where Debtags source data is found
-<span class="lineNum">     117 </span>                :         std::string m_debtagsSourceDir;
-<span class="lineNum">     118 </span>                : 
-<span class="lineNum">     119 </span>                :         // Directory where Debtags indexes are kept
-<span class="lineNum">     120 </span>                :         std::string m_debtagsIndexDir;
-<span class="lineNum">     121 </span>                : 
-<span class="lineNum">     122 </span>                :         // User-specific directory for Debtags source data
-<span class="lineNum">     123 </span>                :         std::string m_debtagsUserSourceDir;
-<span class="lineNum">     124 </span>                : 
-<span class="lineNum">     125 </span>                :         // User-specific directory for Debtags index data
-<span class="lineNum">     126 </span>                :         std::string m_debtagsUserIndexDir;
-<span class="lineNum">     127 </span>                : };
-<span class="lineNum">     128 </span>                : 
-<span class="lineNum">     129 </span>                : }
-<span class="lineNum">     130 </span>                : }
-<span class="lineNum">     131 </span>                : 
-<span class="lineNum">     132 </span>                : // vim:set ts=4 sw=4:
-<span class="lineNum">     133 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/debtags/maint/pkgid.cc.gcov.html b/rep/ept/debtags/maint/pkgid.cc.gcov.html
deleted file mode 100644
index 62de1a1..0000000
--- a/rep/ept/debtags/maint/pkgid.cc.gcov.html
+++ /dev/null
@@ -1,133 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/debtags/maint/pkgid.cc</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">ept/debtags/maint</a> - pkgid.cc</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">15</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">86.7 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">13</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- mode: c++; tab-width: 4; indent-tabs-mode: t -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : /** @file
-<span class="lineNum">       4 </span>                :  * @author Enrico Zini &lt;enrico@enricozini.org&gt;
-<span class="lineNum">       5 </span>                :  * Quick map from package IDs to package names
-<span class="lineNum">       6 </span>                :  */
-<span class="lineNum">       7 </span>                : 
-<span class="lineNum">       8 </span>                : /*
-<span class="lineNum">       9 </span>                :  * Copyright (C) 2003-2007  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">      10 </span>                :  *
-<span class="lineNum">      11 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">      12 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">      13 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">      14 </span>                :  * (at your option) any later version.
-<span class="lineNum">      15 </span>                :  *
-<span class="lineNum">      16 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      17 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      18 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      19 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      20 </span>                :  *
-<span class="lineNum">      21 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      22 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      23 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      24 </span>                :  */
-<span class="lineNum">      25 </span>                : 
-<span class="lineNum">      26 </span>                : #include &lt;ept/debtags/maint/pkgid.h&gt;
-<span class="lineNum">      27 </span>                : #include &lt;ept/debtags/maint/path.h&gt;
-<span class="lineNum">      28 </span>                : 
-<span class="lineNum">      29 </span>                : namespace ept {
-<span class="lineNum">      30 </span>                : namespace debtags {
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span><span class="lineCov">             10 : PkgId::PkgId() {}</span>
-<span class="lineNum">      33 </span>                : 
-<span class="lineNum">      34 </span><span class="lineCov">              1 : PkgId::PkgId(const char* buf, int size)</span>
-<span class="lineNum">      35 </span><span class="lineCov">              1 :         : MMap(buf, size) {}</span>
-<span class="lineNum">      36 </span>                : 
-<span class="lineNum">      37 </span><span class="lineNoCov">              0 : PkgId::PkgId(const tagcoll::diskindex::MasterMMap&amp; master, size_t idx)</span>
-<span class="lineNum">      38 </span><span class="lineNoCov">              0 :         : MMap(master, idx) {}</span>
-<span class="lineNum">      39 </span>                : 
-<span class="lineNum">      40 </span><span class="lineCov">          63445 : int PkgId::byName(const std::string&amp; name) const</span>
-<span class="lineNum">      41 </span>                : {
-<span class="lineNum">      42 </span>                :         // Binary search the index to find the package ID
-<span class="lineNum">      43 </span>                :         int begin, end;
-<span class="lineNum">      44 </span>                : 
-<span class="lineNum">      45 </span>                :         /* Binary search */
-<span class="lineNum">      46 </span><span class="lineCov">          63445 :         begin = -1, end = size();</span>
-<span class="lineNum">      47 </span><span class="lineCov">        1043664 :         while (end - begin &gt; 1)</span>
-<span class="lineNum">      48 </span>                :         {
-<span class="lineNum">      49 </span><span class="lineCov">         916774 :                 int cur = (end + begin) / 2;</span>
-<span class="lineNum">      50 </span><span class="lineCov">         916774 :                 if (byID(cur) &gt; name)</span>
-<span class="lineNum">      51 </span><span class="lineCov">         443057 :                         end = cur;</span>
-<span class="lineNum">      52 </span>                :                 else
-<span class="lineNum">      53 </span><span class="lineCov">         473717 :                         begin = cur;</span>
-<span class="lineNum">      54 </span>                :         }
-<span class="lineNum">      55 </span>                : 
-<span class="lineNum">      56 </span><span class="lineCov">          63445 :         if (begin == -1 || byID(begin) != name)</span>
-<span class="lineNum">      57 </span>                :                 //throw NotFoundException(string(&quot;looking for the ID of string &quot;) + str);
-<span class="lineNum">      58 </span><span class="lineCov">              2 :                 return -1;</span>
-<span class="lineNum">      59 </span>                :         else
-<span class="lineNum">      60 </span><span class="lineCov">          63443 :                 return begin;</span>
-<span class="lineNum">      61 </span>                : }
-<span class="lineNum">      62 </span>                : 
-<span class="lineNum">      63 </span>                : }
-<span class="lineNum">      64 </span>                : }
-<span class="lineNum">      65 </span>                : 
-<span class="lineNum">      66 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/debtags/maint/pkgid.h.gcov.html b/rep/ept/debtags/maint/pkgid.h.gcov.html
deleted file mode 100644
index 05beeb3..0000000
--- a/rep/ept/debtags/maint/pkgid.h.gcov.html
+++ /dev/null
@@ -1,158 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/debtags/maint/pkgid.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">ept/debtags/maint</a> - pkgid.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">6</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">83.3 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">5</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- mode: c++; tab-width: 4; indent-tabs-mode: t -*-
-<span class="lineNum">       2 </span>                : #ifndef EPT_DEBTAGS_PKGID_H
-<span class="lineNum">       3 </span>                : #define EPT_DEBTAGS_PKGID_H
-<span class="lineNum">       4 </span>                : 
-<span class="lineNum">       5 </span>                : /** @file
-<span class="lineNum">       6 </span>                :  * @author Enrico Zini &lt;enrico@enricozini.org&gt;
-<span class="lineNum">       7 </span>                :  * Quick map from package IDs to package names
-<span class="lineNum">       8 </span>                :  */
-<span class="lineNum">       9 </span>                : 
-<span class="lineNum">      10 </span>                : /*
-<span class="lineNum">      11 </span>                :  * Copyright (C) 2003-2007  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">      12 </span>                :  *
-<span class="lineNum">      13 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">      14 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">      15 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">      16 </span>                :  * (at your option) any later version.
-<span class="lineNum">      17 </span>                :  *
-<span class="lineNum">      18 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      19 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      20 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      21 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      22 </span>                :  *
-<span class="lineNum">      23 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      24 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      25 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      26 </span>                :  */
-<span class="lineNum">      27 </span>                : 
-<span class="lineNum">      28 </span>                : #include &lt;tagcoll/diskindex/mmap.h&gt;
-<span class="lineNum">      29 </span>                : #include &lt;string&gt;
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : namespace ept {
-<span class="lineNum">      32 </span>                : namespace debtags {
-<span class="lineNum">      33 </span>                : 
-<span class="lineNum">      34 </span>                : /**
-<span class="lineNum">      35 </span>                :  * Maps Packages to IDs and vice-versa.
-<span class="lineNum">      36 </span>                :  *
-<span class="lineNum">      37 </span>                :  * This is used in building the Debtags fast index, which works representing
-<span class="lineNum">      38 </span>                :  * tags and packages as int IDs
-<span class="lineNum">      39 </span>                :  */
-<span class="lineNum">      40 </span>                : class PkgId : public tagcoll::diskindex::MMap
-<span class="lineNum">      41 </span><span class="lineCov">             11 : {</span>
-<span class="lineNum">      42 </span>                :         tagcoll::diskindex::MasterMMap mastermmap;
-<span class="lineNum">      43 </span>                :         time_t m_timestamp;
-<span class="lineNum">      44 </span>                : 
-<span class="lineNum">      45 </span>                : public:
-<span class="lineNum">      46 </span>                :         PkgId();
-<span class="lineNum">      47 </span>                :         PkgId(const tagcoll::diskindex::MasterMMap&amp; master, size_t idx);
-<span class="lineNum">      48 </span>                :         PkgId(const char* buf, int size);
-<span class="lineNum">      49 </span>                : 
-<span class="lineNum">      50 </span>                :         /// Get the timestamp of when the index was last updated
-<span class="lineNum">      51 </span>                :         time_t timestamp() const { return m_timestamp; }
-<span class="lineNum">      52 </span>                : 
-<span class="lineNum">      53 </span>                :         /// Get the number of packages in the index
-<span class="lineNum">      54 </span><span class="lineCov">          63445 :         size_t size() const { return m_buf ? *(int*)m_buf / sizeof(int) : 0; }</span>
-<span class="lineNum">      55 </span>                : 
-<span class="lineNum">      56 </span>                :         /**
-<span class="lineNum">      57 </span>                :          * Get the ID of a package given its name.
-<span class="lineNum">      58 </span>                :          *
-<span class="lineNum">      59 </span>                :          * If not found, returns -1.
-<span class="lineNum">      60 </span>                :          */
-<span class="lineNum">      61 </span>                :         int byName(const std::string&amp; name) const;
-<span class="lineNum">      62 </span>                : 
-<span class="lineNum">      63 </span>                :         /**
-<span class="lineNum">      64 </span>                :          * Get a package name given its ID.
-<span class="lineNum">      65 </span>                :          *
-<span class="lineNum">      66 </span>                :          * If not found, returns the empty string.
-<span class="lineNum">      67 </span>                :          */
-<span class="lineNum">      68 </span><span class="lineCov">        1128365 :         std::string byID(int id) const</span>
-<span class="lineNum">      69 </span>                :         {
-<span class="lineNum">      70 </span><span class="lineCov">        1128365 :                 if (id &gt;= 0 || static_cast&lt;unsigned&gt;(id) &lt; size())</span>
-<span class="lineNum">      71 </span><span class="lineCov">        1128365 :                         return std::string(m_buf + ((int*)m_buf)[id]);</span>
-<span class="lineNum">      72 </span><span class="lineNoCov">              0 :                 return std::string();</span>
-<span class="lineNum">      73 </span>                :         }
-<span class="lineNum">      74 </span>                : 
-<span class="lineNum">      75 </span>                :         /// Get the number of packages in the index
-<span class="lineNum">      76 </span>                :         int size(int id) const
-<span class="lineNum">      77 </span>                :         {
-<span class="lineNum">      78 </span>                :                 if (id &lt; 0 || (unsigned)id &gt;= size())
-<span class="lineNum">      79 </span>                :                         return 0;
-<span class="lineNum">      80 </span>                :                 if ((unsigned)id == size() - 1)
-<span class="lineNum">      81 </span>                :                         return m_size - ((int*)m_buf)[id] - 1;
-<span class="lineNum">      82 </span>                :                 else
-<span class="lineNum">      83 </span>                :                         return ((int*)m_buf)[id + 1] - ((int*)m_buf)[id] - 1;
-<span class="lineNum">      84 </span>                :         }
-<span class="lineNum">      85 </span>                : };
-<span class="lineNum">      86 </span>                : 
-<span class="lineNum">      87 </span>                : }
-<span class="lineNum">      88 </span>                : }
-<span class="lineNum">      89 </span>                : 
-<span class="lineNum">      90 </span>                : // vim:set ts=4 sw=4:
-<span class="lineNum">      91 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/debtags/maint/pkgid.test.h.gcov.html b/rep/ept/debtags/maint/pkgid.test.h.gcov.html
deleted file mode 100644
index 11f3ea5..0000000
--- a/rep/ept/debtags/maint/pkgid.test.h.gcov.html
+++ /dev/null
@@ -1,142 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/debtags/maint/pkgid.test.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">ept/debtags/maint</a> - pkgid.test.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">18</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">18</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- mode: c++; tab-width: 4; indent-tabs-mode: t -*-
-<span class="lineNum">       2 </span>                : /*
-<span class="lineNum">       3 </span>                :  * id-&gt;package mapping
-<span class="lineNum">       4 </span>                :  *
-<span class="lineNum">       5 </span>                :  * Copyright (C) 2006  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">       6 </span>                :  *
-<span class="lineNum">       7 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">       8 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">       9 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">      10 </span>                :  * (at your option) any later version.
-<span class="lineNum">      11 </span>                :  *
-<span class="lineNum">      12 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      13 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      14 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      15 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      16 </span>                :  *
-<span class="lineNum">      17 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      18 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      19 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      20 </span>                :  */
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                : #include &lt;ept/debtags/maint/pkgid.h&gt;
-<span class="lineNum">      23 </span>                : #include &lt;ept/debtags/maint/path.h&gt;
-<span class="lineNum">      24 </span>                : #include &lt;ept/debtags/debtags.h&gt;
-<span class="lineNum">      25 </span>                : #include &lt;set&gt;
-<span class="lineNum">      26 </span>                : 
-<span class="lineNum">      27 </span>                : #include &lt;ept/test.h&gt;
-<span class="lineNum">      28 </span>                : 
-<span class="lineNum">      29 </span>                : using namespace std;
-<span class="lineNum">      30 </span>                : using namespace ept;
-<span class="lineNum">      31 </span>                : using namespace ept::debtags;
-<span class="lineNum">      32 </span>                : 
-<span class="lineNum">      33 </span>                : struct TestPkgid : DebtagsTestEnvironment
-<span class="lineNum">      34 </span><span class="lineCov">              2 : {</span>
-<span class="lineNum">      35 </span>                :         Debtags debtags;
-<span class="lineNum">      36 </span>                :         PkgId&amp; pkgid;
-<span class="lineNum">      37 </span>                : 
-<span class="lineNum">      38 </span><span class="lineCov">              2 :         TestPkgid()</span>
-<span class="lineNum">      39 </span><span class="lineCov">              2 :                 : pkgid(debtags.pkgid())</span>
-<span class="lineNum">      40 </span>                :         {
-<span class="lineNum">      41 </span><span class="lineCov">              2 :         }</span>
-<span class="lineNum">      42 </span>                : 
-<span class="lineNum">      43 </span>                : // Check that we can go from name to ID and back
-<span class="lineNum">      44 </span><span class="lineCov">              1 :         Test _1()</span>
-<span class="lineNum">      45 </span>                : {
-<span class="lineNum">      46 </span>                :         //int x = 0;
-<span class="lineNum">      47 </span><span class="lineCov">          21146 :         for (Debtags::const_iterator i = debtags.begin();</span>
-<span class="lineNum">      48 </span>                :                         i != debtags.end(); ++i)
-<span class="lineNum">      49 </span>                :         {
-<span class="lineNum">      50 </span><span class="lineCov">          21145 :                 int id = pkgid.byName(i-&gt;first);</span>
-<span class="lineNum">      51 </span><span class="lineCov">          21145 :                 std::string pkg = pkgid.byID(id);</span>
-<span class="lineNum">      52 </span><span class="lineCov">          21145 :                 assert(i-&gt;first == pkg);</span>
-<span class="lineNum">      53 </span>                : 
-<span class="lineNum">      54 </span>                :                 /* std::cerr &lt;&lt; x &lt;&lt; &quot;: &quot; &lt;&lt; i-&gt;id() &lt;&lt; &quot;: &quot;
-<span class="lineNum">      55 </span>                :                                   &lt;&lt; i-&gt;name() &lt;&lt; &quot;, &quot; &lt;&lt; pkgidx().name( i-&gt;id() ) &lt;&lt;
-<span class="lineNum">      56 </span>                :                                   std::endl; */
-<span class="lineNum">      57 </span>                :                 //++ x;
-<span class="lineNum">      58 </span><span class="lineCov">              1 :         }</span>
-<span class="lineNum">      59 </span><span class="lineCov">              1 : }</span>
-<span class="lineNum">      60 </span>                : 
-<span class="lineNum">      61 </span>                : // Check that IDs are distinct
-<span class="lineNum">      62 </span><span class="lineCov">              1 :         Test _2()</span>
-<span class="lineNum">      63 </span>                : {
-<span class="lineNum">      64 </span>                :         using namespace std;
-<span class="lineNum">      65 </span>                : 
-<span class="lineNum">      66 </span><span class="lineCov">              1 :         size_t count = 0;</span>
-<span class="lineNum">      67 </span><span class="lineCov">              1 :         set&lt;int&gt; ids;</span>
-<span class="lineNum">      68 </span><span class="lineCov">          21146 :         for (Debtags::const_iterator i = debtags.begin(); i != debtags.end(); ++i, ++count)</span>
-<span class="lineNum">      69 </span><span class="lineCov">          21146 :                 ids.insert(pkgid.byName(i-&gt;first));</span>
-<span class="lineNum">      70 </span><span class="lineCov">              1 :         assert_eq(ids.size(), count);</span>
-<span class="lineNum">      71 </span><span class="lineCov">              1 : }</span>
-<span class="lineNum">      72 </span>                : 
-<span class="lineNum">      73 </span>                : };
-<span class="lineNum">      74 </span>                : 
-<span class="lineNum">      75 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/debtags/maint/serializer.h.gcov.html b/rep/ept/debtags/maint/serializer.h.gcov.html
deleted file mode 100644
index 2945ccd..0000000
--- a/rep/ept/debtags/maint/serializer.h.gcov.html
+++ /dev/null
@@ -1,1016 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/debtags/maint/serializer.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">ept/debtags/maint</a> - serializer.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">89</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">97.8 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">87</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- mode: c++; tab-width: 4; indent-tabs-mode: t -*-
-<span class="lineNum">       2 </span>                : /**
-<span class="lineNum">       3 </span>                :  * @file cache/component/debtags/serializer.h
-<span class="lineNum">       4 </span>                :  * @author Enrico Zini (enrico) &lt;enrico@enricozini.org&gt;
-<span class="lineNum">       5 </span>                :  */
-<span class="lineNum">       6 </span>                : 
-<span class="lineNum">       7 </span>                : #ifndef EPT_DEBTAGS_SERIALIZER_H
-<span class="lineNum">       8 </span>                : #define EPT_DEBTAGS_SERIALIZER_H
-<span class="lineNum">       9 </span>                : 
-<span class="lineNum">      10 </span>                : #include &lt;ept/debtags/vocabulary.h&gt;
-<span class="lineNum">      11 </span>                : #include &lt;ept/debtags/maint/pkgid.h&gt;
-<span class="lineNum">      12 </span>                : #include &lt;tagcoll/patch.h&gt;
-<span class="lineNum">      13 </span>                : #include &lt;wibble/mixin.h&gt;
-<span class="lineNum">      14 </span>                : #include &lt;string&gt;
-<span class="lineNum">      15 </span>                : 
-<span class="lineNum">      16 </span>                : namespace ept {
-<span class="lineNum">      17 </span>                : namespace debtags {
-<span class="lineNum">      18 </span>                : 
-<span class="lineNum">      19 </span>                : template&lt;typename OUT&gt;
-<span class="lineNum">      20 </span>                : class IntToPkg : public wibble::mixin::OutputIterator&lt; IntToPkg&lt;OUT&gt; &gt;
-<span class="lineNum">      21 </span>                : {
-<span class="lineNum">      22 </span>                :         PkgId&amp; pkgid;
-<span class="lineNum">      23 </span>                :         Vocabulary&amp; voc;
-<span class="lineNum">      24 </span>                :         OUT out;
-<span class="lineNum">      25 </span>                : 
-<span class="lineNum">      26 </span>                : public:
-<span class="lineNum">      27 </span><span class="lineCov">              5 :         IntToPkg(PkgId&amp; pkgid, Vocabulary&amp; voc, const OUT&amp; out)</span>
-<span class="lineNum">      28 </span><span class="lineCov">              5 :                 : pkgid(pkgid), voc(voc), out(out) {}</span>
-<span class="lineNum">      29 </span>                : 
-<span class="lineNum">      30 </span>                :         template&lt;typename ITEMS, typename TAGS&gt;
-<span class="lineNum">      31 </span><span class="lineCov">          42291 :         IntToPkg&lt;OUT&gt;&amp; operator=(const std::pair&lt;ITEMS, TAGS&gt;&amp; data)</span>
-<span class="lineNum">      32 </span>                :         {
-<span class="lineNum">      33 </span><span class="lineCov">          42291 :                 std::set&lt;std::string&gt; ritems;</span>
-<span class="lineNum">      34 </span><span class="lineCov">          42291 :                 std::set&lt;Tag&gt; rtags;</span>
-<span class="lineNum">      35 </span>                : 
-<span class="lineNum">      36 </span><span class="lineCov">          84582 :                 for (typename ITEMS::const_iterator i = data.first.begin();</span>
-<span class="lineNum">      37 </span>                :                                 i != data.first.end(); ++i)
-<span class="lineNum">      38 </span>                :                 {
-<span class="lineNum">      39 </span><span class="lineCov">          42291 :                         std::string pkg = pkgid.byID(*i);</span>
-<span class="lineNum">      40 </span><span class="lineCov">          42291 :                         if (!pkg.empty())</span>
-<span class="lineNum">      41 </span><span class="lineCov">          42291 :                                 ritems.insert(pkg);</span>
-<span class="lineNum">      42 </span>                :                 }
-<span class="lineNum">      43 </span>                : 
-<span class="lineNum">      44 </span><span class="lineCov">         253489 :                 for (typename TAGS::const_iterator i = data.second.begin();</span>
-<span class="lineNum">      45 </span>                :                                 i != data.second.end(); ++i)
-<span class="lineNum">      46 </span>                :                 {
-<span class="lineNum">      47 </span><span class="lineCov">         211198 :                         Tag t = voc.tagByID(*i);</span>
-<span class="lineNum">      48 </span><span class="lineCov">         211198 :                         if (t.valid())</span>
-<span class="lineNum">      49 </span><span class="lineCov">         211198 :                                 rtags.insert(t);</span>
-<span class="lineNum">      50 </span>                :                 }
-<span class="lineNum">      51 </span>                : 
-<span class="lineNum">      52 </span><span class="lineCov">          42291 :                 if (!ritems.empty() &amp;&amp; !rtags.empty())</span>
-<span class="lineNum">      53 </span>                :                 {
-<span class="lineNum">      54 </span><span class="lineCov">          42267 :                         *out = make_pair(ritems, rtags);</span>
-<span class="lineNum">      55 </span><span class="lineCov">          42267 :                         ++out;</span>
-<span class="lineNum">      56 </span>                :                 }
-<span class="lineNum">      57 </span><span class="lineCov">          42291 :                 return *this;</span>
-<span class="lineNum">      58 </span>                :         }
-<span class="lineNum">      59 </span>                : };
-<span class="lineNum">      60 </span>                : 
-<span class="lineNum">      61 </span>                : template&lt;typename OUT&gt;
-<span class="lineNum">      62 </span><span class="lineCov">              5 : IntToPkg&lt;OUT&gt; intToPkg(PkgId&amp; pkgid, Vocabulary&amp; voc, const OUT&amp; out)</span>
-<span class="lineNum">      63 </span>                : {
-<span class="lineNum">      64 </span><span class="lineCov">              5 :         return IntToPkg&lt;OUT&gt;(pkgid, voc, out);</span>
-<span class="lineNum">      65 </span>                : }
-<span class="lineNum">      66 </span>                : 
-<span class="lineNum">      67 </span>                : template&lt;typename OUT&gt;
-<span class="lineNum">      68 </span>                : class StringToInt : public wibble::mixin::OutputIterator&lt; StringToInt&lt;OUT&gt; &gt;
-<span class="lineNum">      69 </span>                : {
-<span class="lineNum">      70 </span>                :         PkgId&amp; pkgid;
-<span class="lineNum">      71 </span>                :         Vocabulary&amp; voc;
-<span class="lineNum">      72 </span>                :         OUT out;
-<span class="lineNum">      73 </span>                : 
-<span class="lineNum">      74 </span>                : public:
-<span class="lineNum">      75 </span><span class="lineCov">              2 :         StringToInt(PkgId&amp; pkgid, Vocabulary&amp; voc, const OUT&amp; out)</span>
-<span class="lineNum">      76 </span><span class="lineCov">              2 :                 : pkgid(pkgid), voc(voc), out(out) {}</span>
-<span class="lineNum">      77 </span>                : 
-<span class="lineNum">      78 </span>                :         template&lt;typename ITEMS, typename TAGS&gt;
-<span class="lineNum">      79 </span><span class="lineCov">          21146 :         StringToInt&lt;OUT&gt;&amp; operator=(const std::pair&lt;ITEMS, TAGS&gt;&amp; data)</span>
-<span class="lineNum">      80 </span>                :         {
-<span class="lineNum">      81 </span><span class="lineCov">          21146 :                 std::set&lt;int&gt; ritems;</span>
-<span class="lineNum">      82 </span><span class="lineCov">          21146 :                 std::set&lt;int&gt; rtags;</span>
-<span class="lineNum">      83 </span>                : 
-<span class="lineNum">      84 </span><span class="lineCov">          42292 :                 for (typename ITEMS::const_iterator i = data.first.begin();</span>
-<span class="lineNum">      85 </span>                :                                 i != data.first.end(); ++i)
-<span class="lineNum">      86 </span>                :                 {
-<span class="lineNum">      87 </span><span class="lineCov">          21146 :                         int id = pkgid.byName(*i);</span>
-<span class="lineNum">      88 </span><span class="lineCov">          21146 :                         if (id != -1)</span>
-<span class="lineNum">      89 </span><span class="lineCov">          21146 :                                 ritems.insert(id);</span>
-<span class="lineNum">      90 </span>                :                 }
-<span class="lineNum">      91 </span>                : 
-<span class="lineNum">      92 </span><span class="lineCov">         126874 :                 for (typename TAGS::const_iterator i = data.second.begin();</span>
-<span class="lineNum">      93 </span>                :                                 i != data.second.end(); ++i)
-<span class="lineNum">      94 </span>                :                 {
-<span class="lineNum">      95 </span><span class="lineCov">         105728 :                         Tag t = voc.tagByName(*i);</span>
-<span class="lineNum">      96 </span><span class="lineCov">         105728 :                         if (t.valid())</span>
-<span class="lineNum">      97 </span><span class="lineCov">         105600 :                                 rtags.insert(t.id());</span>
-<span class="lineNum">      98 </span>                :                 }
-<span class="lineNum">      99 </span>                : 
-<span class="lineNum">     100 </span><span class="lineCov">          21146 :                 if (!ritems.empty() &amp;&amp; !rtags.empty())</span>
-<span class="lineNum">     101 </span>                :                 {
-<span class="lineNum">     102 </span><span class="lineCov">          21134 :                         *out = make_pair(ritems, rtags);</span>
-<span class="lineNum">     103 </span><span class="lineCov">          21134 :                         ++out;</span>
-<span class="lineNum">     104 </span>                :                 }
-<span class="lineNum">     105 </span><span class="lineCov">          21146 :                 return *this;</span>
-<span class="lineNum">     106 </span>                :         }
-<span class="lineNum">     107 </span>                : 
-<span class="lineNum">     108 </span>                : };
-<span class="lineNum">     109 </span>                : 
-<span class="lineNum">     110 </span>                : template&lt;typename OUT&gt;
-<span class="lineNum">     111 </span><span class="lineCov">              2 : StringToInt&lt;OUT&gt; stringToInt(PkgId&amp; pkgid, Vocabulary&amp; voc, const OUT&amp; out)</span>
-<span class="lineNum">     112 </span>                : {
-<span class="lineNum">     113 </span><span class="lineCov">              2 :         return StringToInt&lt;OUT&gt;(pkgid, voc, out);</span>
-<span class="lineNum">     114 </span>                : }
-<span class="lineNum">     115 </span>                : 
-<span class="lineNum">     116 </span>                : template&lt;typename OUT&gt;
-<span class="lineNum">     117 </span>                : class StringToPkg : public wibble::mixin::OutputIterator&lt; StringToPkg&lt;OUT&gt; &gt;
-<span class="lineNum">     118 </span>                : {
-<span class="lineNum">     119 </span>                :         PkgId&amp; pkgid;
-<span class="lineNum">     120 </span>                :         Vocabulary&amp; voc;
-<span class="lineNum">     121 </span>                :         OUT out;
-<span class="lineNum">     122 </span>                : 
-<span class="lineNum">     123 </span>                : public:
-<span class="lineNum">     124 </span>                :         StringToPkg(PkgId&amp; pkgid, Vocabulary&amp; voc, const OUT&amp; out)
-<span class="lineNum">     125 </span>                :                 : pkgid(pkgid), voc(voc), out(out) {}
-<span class="lineNum">     126 </span>                : 
-<span class="lineNum">     127 </span>                :         template&lt;typename ITEMS, typename TAGS&gt;
-<span class="lineNum">     128 </span>                :         StringToPkg&lt;OUT&gt;&amp; operator=(const std::pair&lt;ITEMS, TAGS&gt;&amp; data)
-<span class="lineNum">     129 </span>                :         {
-<span class="lineNum">     130 </span>                :                 std::set&lt;std::string&gt; ritems;
-<span class="lineNum">     131 </span>                :                 std::set&lt;Tag&gt; rtags;
-<span class="lineNum">     132 </span>                : 
-<span class="lineNum">     133 </span>                :                 for (typename ITEMS::const_iterator i = data.first.begin();
-<span class="lineNum">     134 </span>                :                                 i != data.first.end(); ++i)
-<span class="lineNum">     135 </span>                :                 {
-<span class="lineNum">     136 </span>                :                         // Ensure that the package exists in the pkgid database
-<span class="lineNum">     137 </span>                :                         if (pkgid.byName(*i) == -1)
-<span class="lineNum">     138 </span>                :                                 continue;
-<span class="lineNum">     139 </span>                :                         ritems.insert(*i);
-<span class="lineNum">     140 </span>                :                 }
-<span class="lineNum">     141 </span>                : 
-<span class="lineNum">     142 </span>                :                 for (typename TAGS::const_iterator i = data.second.begin();
-<span class="lineNum">     143 </span>                :                                 i != data.second.end(); ++i)
-<span class="lineNum">     144 </span>                :                 {
-<span class="lineNum">     145 </span>                :                         Tag t = voc.tagByName(*i);
-<span class="lineNum">     146 </span>                :                         if (t.valid())
-<span class="lineNum">     147 </span>                :                                 rtags.insert(t);
-<span class="lineNum">     148 </span>                :                 }
-<span class="lineNum">     149 </span>                : 
-<span class="lineNum">     150 </span>                :                 if (!ritems.empty() &amp;&amp; !rtags.empty())
-<span class="lineNum">     151 </span>                :                 {
-<span class="lineNum">     152 </span>                :                         *out = make_pair(ritems, rtags);
-<span class="lineNum">     153 </span>                :                         ++out;
-<span class="lineNum">     154 </span>                :                 }
-<span class="lineNum">     155 </span>                :                 return *this;
-<span class="lineNum">     156 </span>                :         }
-<span class="lineNum">     157 </span>                : 
-<span class="lineNum">     158 </span>                : };
-<span class="lineNum">     159 </span>                : 
-<span class="lineNum">     160 </span>                : template&lt;typename OUT&gt;
-<span class="lineNum">     161 </span>                : StringToPkg&lt;OUT&gt; stringToPkg(PkgId&amp; pkgid, Vocabulary&amp; voc, const OUT&amp; out)
-<span class="lineNum">     162 </span>                : {
-<span class="lineNum">     163 </span>                :         return StringToPkg&lt;OUT&gt;(pkgid, voc, out);
-<span class="lineNum">     164 </span>                : }
-<span class="lineNum">     165 </span>                : 
-<span class="lineNum">     166 </span>                : template&lt;typename OUT&gt;
-<span class="lineNum">     167 </span>                : class PkgToString : public wibble::mixin::OutputIterator&lt; PkgToString&lt;OUT&gt; &gt;
-<span class="lineNum">     168 </span>                : {
-<span class="lineNum">     169 </span>                :         OUT out;
-<span class="lineNum">     170 </span>                : public:
-<span class="lineNum">     171 </span><span class="lineCov">              1 :         PkgToString(const OUT&amp; out) : out(out) {}</span>
-<span class="lineNum">     172 </span>                : 
-<span class="lineNum">     173 </span>                :         template&lt;typename ITEMS, typename TAGS&gt;
-<span class="lineNum">     174 </span><span class="lineCov">              1 :         PkgToString&lt;OUT&gt;&amp; operator=(const std::pair&lt;ITEMS, TAGS&gt;&amp; data)</span>
-<span class="lineNum">     175 </span>                :         {
-<span class="lineNum">     176 </span><span class="lineCov">              1 :                 std::set&lt;std::string&gt; stags;</span>
-<span class="lineNum">     177 </span><span class="lineCov">              3 :                 for (typename TAGS::const_iterator i = data.second.begin();</span>
-<span class="lineNum">     178 </span>                :                                 i != data.second.end(); ++i)
-<span class="lineNum">     179 </span><span class="lineCov">              2 :                         if (i-&gt;valid())</span>
-<span class="lineNum">     180 </span><span class="lineCov">              2 :                                 stags.insert(i-&gt;fullname());</span>
-<span class="lineNum">     181 </span><span class="lineCov">              1 :                 *out = make_pair(data.first, stags);</span>
-<span class="lineNum">     182 </span><span class="lineCov">              1 :                 ++out;</span>
-<span class="lineNum">     183 </span><span class="lineCov">              1 :                 return *this;</span>
-<span class="lineNum">     184 </span>                :         }
-<span class="lineNum">     185 </span>                : };
-<span class="lineNum">     186 </span>                : 
-<span class="lineNum">     187 </span>                : template&lt;typename OUT&gt;
-<span class="lineNum">     188 </span><span class="lineCov">              1 : PkgToString&lt;OUT&gt; pkgToString(const OUT&amp; out)</span>
-<span class="lineNum">     189 </span>                : {
-<span class="lineNum">     190 </span><span class="lineCov">              1 :         return PkgToString&lt;OUT&gt;(out);</span>
-<span class="lineNum">     191 </span>                : }
-<span class="lineNum">     192 </span>                : 
-<span class="lineNum">     193 </span>                : template&lt;typename OUT&gt;
-<span class="lineNum">     194 </span>                : class PatchStringToInt : public wibble::mixin::OutputIterator&lt; PatchStringToInt&lt;OUT&gt; &gt;
-<span class="lineNum">     195 </span>                : {
-<span class="lineNum">     196 </span>                :         PkgId&amp; pkgid;
-<span class="lineNum">     197 </span>                :         Vocabulary&amp; voc;
-<span class="lineNum">     198 </span>                :         OUT out;
-<span class="lineNum">     199 </span>                : 
-<span class="lineNum">     200 </span>                : public:
-<span class="lineNum">     201 </span><span class="lineCov">              1 :         PatchStringToInt(PkgId&amp; pkgid, Vocabulary&amp; voc, const OUT&amp; out)</span>
-<span class="lineNum">     202 </span><span class="lineCov">              1 :                 : pkgid(pkgid), voc(voc), out(out) {}</span>
-<span class="lineNum">     203 </span>                : 
-<span class="lineNum">     204 </span><span class="lineCov">              1 :         PatchStringToInt&lt;OUT&gt;&amp; operator=(const tagcoll::Patch&lt;std::string, std::string&gt;&amp; patch)</span>
-<span class="lineNum">     205 </span>                :         {
-<span class="lineNum">     206 </span><span class="lineCov">              1 :                 int id = pkgid.byName(patch.item);</span>
-<span class="lineNum">     207 </span><span class="lineCov">              1 :                 if (id == -1)</span>
-<span class="lineNum">     208 </span><span class="lineNoCov">              0 :                         return *this;</span>
-<span class="lineNum">     209 </span>                : 
-<span class="lineNum">     210 </span><span class="lineCov">              1 :                 tagcoll::Patch&lt;int, int&gt; res(id);</span>
-<span class="lineNum">     211 </span><span class="lineCov">              2 :                 for (std::set&lt;std::string&gt;::const_iterator i = patch.added.begin();</span>
-<span class="lineNum">     212 </span>                :                                 i != patch.added.end(); ++i)
-<span class="lineNum">     213 </span>                :                 {
-<span class="lineNum">     214 </span><span class="lineCov">              1 :                         Tag tag = voc.tagByName(*i);</span>
-<span class="lineNum">     215 </span><span class="lineCov">              1 :                         if (tag.valid())</span>
-<span class="lineNum">     216 </span><span class="lineCov">              1 :                                 res.add(tag.id());</span>
-<span class="lineNum">     217 </span>                :                 }
-<span class="lineNum">     218 </span><span class="lineCov">              2 :                 for (std::set&lt;std::string&gt;::const_iterator i = patch.removed.begin();</span>
-<span class="lineNum">     219 </span>                :                                 i != patch.removed.end(); ++i)
-<span class="lineNum">     220 </span>                :                 {
-<span class="lineNum">     221 </span><span class="lineCov">              1 :                         Tag tag = voc.tagByName(*i);</span>
-<span class="lineNum">     222 </span><span class="lineCov">              1 :                         if (tag.valid())</span>
-<span class="lineNum">     223 </span><span class="lineCov">              1 :                                 res.remove(tag.id());</span>
-<span class="lineNum">     224 </span>                :                 }
-<span class="lineNum">     225 </span><span class="lineCov">              1 :                 *out = res;</span>
-<span class="lineNum">     226 </span><span class="lineCov">              1 :                 ++out;</span>
-<span class="lineNum">     227 </span><span class="lineCov">              1 :                 return *this;</span>
-<span class="lineNum">     228 </span>                :         }
-<span class="lineNum">     229 </span>                : };
-<span class="lineNum">     230 </span>                : 
-<span class="lineNum">     231 </span>                : template&lt;typename OUT&gt;
-<span class="lineNum">     232 </span><span class="lineCov">              1 : PatchStringToInt&lt;OUT&gt; patchStringToInt(PkgId&amp; pkgid, Vocabulary&amp; voc, const OUT&amp; out)</span>
-<span class="lineNum">     233 </span>                : {
-<span class="lineNum">     234 </span><span class="lineCov">              1 :         return PatchStringToInt&lt;OUT&gt;(pkgid, voc, out);</span>
-<span class="lineNum">     235 </span>                : }
-<span class="lineNum">     236 </span>                : 
-<span class="lineNum">     237 </span>                : template&lt;typename OUT&gt;
-<span class="lineNum">     238 </span>                : class PatchIntToString : public wibble::mixin::OutputIterator&lt; PatchIntToString&lt;OUT&gt; &gt;
-<span class="lineNum">     239 </span>                : {
-<span class="lineNum">     240 </span>                :         PkgId&amp; pkgid;
-<span class="lineNum">     241 </span>                :         Vocabulary&amp; voc;
-<span class="lineNum">     242 </span>                :         OUT out;
-<span class="lineNum">     243 </span>                : 
-<span class="lineNum">     244 </span>                : public:
-<span class="lineNum">     245 </span><span class="lineCov">              2 :         PatchIntToString(PkgId&amp; pkgid, Vocabulary&amp; voc, const OUT&amp; out)</span>
-<span class="lineNum">     246 </span><span class="lineCov">              2 :                 : pkgid(pkgid), voc(voc), out(out) {}</span>
-<span class="lineNum">     247 </span>                : 
-<span class="lineNum">     248 </span><span class="lineCov">              2 :         PatchIntToString&lt;OUT&gt;&amp; operator=(const tagcoll::Patch&lt;int, int&gt;&amp; patch)</span>
-<span class="lineNum">     249 </span>                :         {
-<span class="lineNum">     250 </span><span class="lineCov">              2 :                 std::string name = pkgid.byID(patch.item);</span>
-<span class="lineNum">     251 </span><span class="lineCov">              2 :                 if (name.empty())</span>
-<span class="lineNum">     252 </span><span class="lineNoCov">              0 :                         return *this;</span>
-<span class="lineNum">     253 </span>                : 
-<span class="lineNum">     254 </span><span class="lineCov">              2 :                 tagcoll::Patch&lt;std::string, std::string&gt; res(name);</span>
-<span class="lineNum">     255 </span><span class="lineCov">              4 :                 for (std::set&lt;int&gt;::const_iterator i = patch.added.begin();</span>
-<span class="lineNum">     256 </span>                :                                 i != patch.added.end(); ++i)
-<span class="lineNum">     257 </span>                :                 {
-<span class="lineNum">     258 </span><span class="lineCov">              2 :                         Tag tag = voc.tagByID(*i);</span>
-<span class="lineNum">     259 </span><span class="lineCov">              2 :                         if (tag.valid())</span>
-<span class="lineNum">     260 </span><span class="lineCov">              2 :                                 res.add(tag.fullname());</span>
-<span class="lineNum">     261 </span>                :                 }
-<span class="lineNum">     262 </span><span class="lineCov">              3 :                 for (std::set&lt;int&gt;::const_iterator i = patch.removed.begin();</span>
-<span class="lineNum">     263 </span>                :                                 i != patch.removed.end(); ++i)
-<span class="lineNum">     264 </span>                :                 {
-<span class="lineNum">     265 </span><span class="lineCov">              1 :                         Tag tag = voc.tagByID(*i);</span>
-<span class="lineNum">     266 </span><span class="lineCov">              1 :                         if (tag.valid())</span>
-<span class="lineNum">     267 </span><span class="lineCov">              1 :                                 res.remove(tag.fullname());</span>
-<span class="lineNum">     268 </span>                :                 }
-<span class="lineNum">     269 </span><span class="lineCov">              2 :                 *out = res;</span>
-<span class="lineNum">     270 </span><span class="lineCov">              2 :                 ++out;</span>
-<span class="lineNum">     271 </span><span class="lineCov">              2 :                 return *this;</span>
-<span class="lineNum">     272 </span>                :         }
-<span class="lineNum">     273 </span>                : };
-<span class="lineNum">     274 </span>                : 
-<span class="lineNum">     275 </span>                : template&lt;typename OUT&gt;
-<span class="lineNum">     276 </span><span class="lineCov">              2 : PatchIntToString&lt;OUT&gt; patchIntToString(PkgId&amp; pkgid, Vocabulary&amp; voc, const OUT&amp; out)</span>
-<span class="lineNum">     277 </span>                : {
-<span class="lineNum">     278 </span><span class="lineCov">              2 :         return PatchIntToString&lt;OUT&gt;(pkgid, voc, out);</span>
-<span class="lineNum">     279 </span>                : }
-<span class="lineNum">     280 </span>                : 
-<span class="lineNum">     281 </span>                : #if 0
-<span class="lineNum">     282 </span>                :         GOOD STUFF
-<span class="lineNum">     283 </span>                : 
-<span class="lineNum">     284 </span>                : template&lt;typename OUT&gt;
-<span class="lineNum">     285 </span>                : class ToInt : public wibble::mixin::OutputIterator&lt; ToInt&lt;OUT&gt; &gt;
-<span class="lineNum">     286 </span>                : {
-<span class="lineNum">     287 </span>                :         OUT out;
-<span class="lineNum">     288 </span>                : public:
-<span class="lineNum">     289 </span>                :         ToInt(const OUT&amp; out) : out(out) {}
-<span class="lineNum">     290 </span>                : 
-<span class="lineNum">     291 </span>                :         template&lt;typename ITEMS, typename TAGS&gt;
-<span class="lineNum">     292 </span>                :         ToInt&lt;OUT&gt;&amp; operator=(const std::pair&lt;ITEMS, TAGS&gt;&amp; data)
-<span class="lineNum">     293 </span>                :         {
-<span class="lineNum">     294 </span>                :                 std::set&lt;int&gt; iitems;
-<span class="lineNum">     295 </span>                :                 std::set&lt;int&gt; itags;
-<span class="lineNum">     296 </span>                :                 for (typename ITEMS::const_iterator i = data.first.begin();
-<span class="lineNum">     297 </span>                :                                 i != data.first.end(); ++i)
-<span class="lineNum">     298 </span>                :                         if (i-&gt;valid())
-<span class="lineNum">     299 </span>                :                                 iitems.insert(i-&gt;ondiskId());
-<span class="lineNum">     300 </span>                :                 for (typename TAGS::const_iterator i = data.second.begin();
-<span class="lineNum">     301 </span>                :                                 i != data.second.end(); ++i)
-<span class="lineNum">     302 </span>                :                         if (i-&gt;valid())
-<span class="lineNum">     303 </span>                :                                 itags.insert(i-&gt;id());
-<span class="lineNum">     304 </span>                :                 *out = make_pair(iitems, itags);
-<span class="lineNum">     305 </span>                :                 ++out;
-<span class="lineNum">     306 </span>                :                 return *this;
-<span class="lineNum">     307 </span>                :         }
-<span class="lineNum">     308 </span>                : };
-<span class="lineNum">     309 </span>                : 
-<span class="lineNum">     310 </span>                : template&lt;typename OUT&gt;
-<span class="lineNum">     311 </span>                : ToInt&lt;OUT&gt; toInt(const OUT&amp; out)
-<span class="lineNum">     312 </span>                : {
-<span class="lineNum">     313 </span>                :         return ToInt&lt;OUT&gt;(out);
-<span class="lineNum">     314 </span>                : }
-<span class="lineNum">     315 </span>                : 
-<span class="lineNum">     316 </span>                : template&lt;typename ITEMCONV, typename TAGCONV, typename OUT&gt;
-<span class="lineNum">     317 </span>                : class Converter : public wibble::mixin::OutputIterator&lt; Converter&lt;ITEMCONV, TAGCONV, OUT&gt; &gt;
-<span class="lineNum">     318 </span>                : {
-<span class="lineNum">     319 </span>                :         ITEMCONV itemconv;
-<span class="lineNum">     320 </span>                :         TAGCONV tagconv;
-<span class="lineNum">     321 </span>                :         OUT out;
-<span class="lineNum">     322 </span>                : 
-<span class="lineNum">     323 </span>                : public:
-<span class="lineNum">     324 </span>                :         Converter(const ITEMCONV&amp; itemconv, const TAGCONV&amp; tagconv, const OUT&amp; out)
-<span class="lineNum">     325 </span>                :                 : itemconv(itemconv), tagconv(tagconv), out(out) {}
-<span class="lineNum">     326 </span>                : 
-<span class="lineNum">     327 </span>                :         template&lt;typename ITEMS, typename TAGS&gt;
-<span class="lineNum">     328 </span>                :         Converter&lt;ITEMCONV, TAGCONV, OUT&gt;&amp; operator=(const std::pair&lt;ITEMS, TAGS&gt;&amp; data)
-<span class="lineNum">     329 </span>                :         {
-<span class="lineNum">     330 </span>                :                 *out = make_pair(itemconv(data.first), tagconv(data.second));
-<span class="lineNum">     331 </span>                :                 ++out;
-<span class="lineNum">     332 </span>                :                 return *this;
-<span class="lineNum">     333 </span>                :         }
-<span class="lineNum">     334 </span>                : };
-<span class="lineNum">     335 </span>                : 
-<span class="lineNum">     336 </span>                : template&lt;typename ITEMCONV, typename TAGCONV, typename OUT&gt;
-<span class="lineNum">     337 </span>                : Converter&lt;ITEMCONV, TAGCONV, OUT&gt; converter(const ITEMCONV&amp; itemconv, const TAGCONV&amp; tagconv, const OUT&amp; out)
-<span class="lineNum">     338 </span>                : {
-<span class="lineNum">     339 </span>                :         return Converter&lt;ITEMCONV, TAGCONV, OUT&gt;(itemconv, tagconv, out);
-<span class="lineNum">     340 </span>                : }
-<span class="lineNum">     341 </span>                : 
-<span class="lineNum">     342 </span>                : 
-<span class="lineNum">     343 </span>                : template&lt;typename OUT&gt;
-<span class="lineNum">     344 </span>                : class PatchToString : public wibble::mixin::OutputIterator&lt; PatchToString&lt;OUT&gt; &gt;
-<span class="lineNum">     345 </span>                : {
-<span class="lineNum">     346 </span>                :         OUT out;
-<span class="lineNum">     347 </span>                : 
-<span class="lineNum">     348 </span>                : public:
-<span class="lineNum">     349 </span>                :         PatchToString(const OUT&amp; out) : out(out) {}
-<span class="lineNum">     350 </span>                : 
-<span class="lineNum">     351 </span>                :         template&lt;typename PKG, typename TAG&gt;
-<span class="lineNum">     352 </span>                :         PatchToString&lt;OUT&gt;&amp; operator=(const tagcoll::Patch&lt;PKG, TAG&gt;&amp; patch)
-<span class="lineNum">     353 </span>                :         {
-<span class="lineNum">     354 </span>                :                 if (!patch.item.valid())
-<span class="lineNum">     355 </span>                :                         return *this;
-<span class="lineNum">     356 </span>                : 
-<span class="lineNum">     357 </span>                :                 tagcoll::Patch&lt;std::string, std::string&gt; res(patch.item.name());
-<span class="lineNum">     358 </span>                :                 for (typename std::set&lt;TAG&gt;::const_iterator i = patch.added.begin();
-<span class="lineNum">     359 </span>                :                                 i != patch.added.end(); ++i)
-<span class="lineNum">     360 </span>                :                         if (i-&gt;valid())
-<span class="lineNum">     361 </span>                :                                 res.add(i-&gt;fullname());
-<span class="lineNum">     362 </span>                :                 for (typename std::set&lt;TAG&gt;::const_iterator i = patch.removed.begin();
-<span class="lineNum">     363 </span>                :                                 i != patch.removed.end(); ++i)
-<span class="lineNum">     364 </span>                :                         if (i-&gt;valid())
-<span class="lineNum">     365 </span>                :                                 res.remove(i-&gt;fullname());
-<span class="lineNum">     366 </span>                :                 *out = res;
-<span class="lineNum">     367 </span>                :                 ++out;
-<span class="lineNum">     368 </span>                :                 return *this;
-<span class="lineNum">     369 </span>                :         }
-<span class="lineNum">     370 </span>                : };
-<span class="lineNum">     371 </span>                : 
-<span class="lineNum">     372 </span>                : template&lt;typename OUT&gt;
-<span class="lineNum">     373 </span>                : PatchToString&lt;OUT&gt; patchToString(const OUT&amp; out)
-<span class="lineNum">     374 </span>                : {
-<span class="lineNum">     375 </span>                :         return PatchToString&lt;OUT&gt;(out);
-<span class="lineNum">     376 </span>                : }
-<span class="lineNum">     377 </span>                : 
-<span class="lineNum">     378 </span>                : #endif
-<span class="lineNum">     379 </span>                : 
-<span class="lineNum">     380 </span>                : }
-<span class="lineNum">     381 </span>                : }
-<span class="lineNum">     382 </span>                : 
-<span class="lineNum">     383 </span>                : #if 0
-<span class="lineNum">     384 </span>                : 
-<span class="lineNum">     385 </span>                : namespace tagcoll {
-<span class="lineNum">     386 </span>                : namespace coll {
-<span class="lineNum">     387 </span>                : 
-<span class="lineNum">     388 </span>                : template&lt;&gt;
-<span class="lineNum">     389 </span>                : struct coll_traits&lt; ept::cache::debtags::DebtagsIndex &gt;
-<span class="lineNum">     390 </span>                : {
-<span class="lineNum">     391 </span>                :         typedef ept::cache::Package&lt;&gt; item_type;
-<span class="lineNum">     392 </span>                :         typedef ept::cache::debtags::Tag tag_type;
-<span class="lineNum">     393 </span>                :         typedef std::set&lt; ept::cache::Package&lt;&gt; &gt; itemset_type;
-<span class="lineNum">     394 </span>                :         typedef std::set&lt;ept::cache::debtags::Tag&gt; tagset_type;
-<span class="lineNum">     395 </span>                : };
-<span class="lineNum">     396 </span>                : 
-<span class="lineNum">     397 </span>                : }
-<span class="lineNum">     398 </span>                : }
-<span class="lineNum">     399 </span>                : 
-<span class="lineNum">     400 </span>                : namespace ept {
-<span class="lineNum">     401 </span>                : namespace cache {
-<span class="lineNum">     402 </span>                : namespace debtags {
-<span class="lineNum">     403 </span>                : 
-<span class="lineNum">     404 </span>                : #if 0
-<span class="lineNum">     405 </span>                : /**
-<span class="lineNum">     406 </span>                :  * Convert Facets to ints
-<span class="lineNum">     407 </span>                :  */
-<span class="lineNum">     408 </span>                : class FacetIntConverter : public Implementation&lt;FacetIntConverter&gt;,
-<span class="lineNum">     409 </span>                :         public Tagcoll::Converter&lt;aptFront::cache::entity::Facet, int&gt;,
-<span class="lineNum">     410 </span>                :         public Tagcoll::Converter&lt;int, aptFront::cache::entity::Facet&gt;
-<span class="lineNum">     411 </span>                : {
-<span class="lineNum">     412 </span>                :         typedef aptFront::cache::entity::Facet Facet;
-<span class="lineNum">     413 </span>                :         typedef Tagcoll::OpSet&lt;aptFront::cache::entity::Facet&gt; FacetSet;
-<span class="lineNum">     414 </span>                :         typedef Tagcoll::OpSet&lt;int&gt; IntSet;
-<span class="lineNum">     415 </span>                : public:
-<span class="lineNum">     416 </span>                :         virtual int operator()(const aptFront::cache::entity::Facet&amp; item) const;
-<span class="lineNum">     417 </span>                :         virtual aptFront::cache::entity::Facet operator()(const int&amp; item) const;
-<span class="lineNum">     418 </span>                : 
-<span class="lineNum">     419 </span>                :         virtual IntSet operator()(const FacetSet&amp; item) const
-<span class="lineNum">     420 </span>                :                 { return Tagcoll::Converter&lt;Facet, int&gt;::operator()(item); }
-<span class="lineNum">     421 </span>                :         virtual FacetSet operator()(const IntSet&amp; item) const
-<span class="lineNum">     422 </span>                :                 { return Tagcoll::Converter&lt;int, Facet&gt;::operator()(item); }
-<span class="lineNum">     423 </span>                : 
-<span class="lineNum">     424 </span>                :         static std::string componentName();
-<span class="lineNum">     425 </span>                : };
-<span class="lineNum">     426 </span>                : 
-<span class="lineNum">     427 </span>                : /**
-<span class="lineNum">     428 </span>                :  * Convert Facets to strings
-<span class="lineNum">     429 </span>                :  */
-<span class="lineNum">     430 </span>                : class FacetStringConverter : public Implementation&lt;FacetStringConverter&gt;,
-<span class="lineNum">     431 </span>                :         public Tagcoll::Converter&lt;aptFront::cache::entity::Facet, std::string&gt;,
-<span class="lineNum">     432 </span>                :         public Tagcoll::Converter&lt;std::string, aptFront::cache::entity::Facet&gt;
-<span class="lineNum">     433 </span>                : {
-<span class="lineNum">     434 </span>                :         typedef aptFront::cache::entity::Facet Facet;
-<span class="lineNum">     435 </span>                :         typedef Tagcoll::OpSet&lt;aptFront::cache::entity::Facet&gt; FacetSet;
-<span class="lineNum">     436 </span>                :         typedef Tagcoll::OpSet&lt;std::string&gt; StringSet;
-<span class="lineNum">     437 </span>                : public:
-<span class="lineNum">     438 </span>                :         virtual std::string operator()(const aptFront::cache::entity::Facet&amp; item) const;
-<span class="lineNum">     439 </span>                :         virtual aptFront::cache::entity::Facet operator()(const std::string&amp; item) const;
-<span class="lineNum">     440 </span>                : 
-<span class="lineNum">     441 </span>                :         virtual StringSet operator()(const FacetSet&amp; item) const
-<span class="lineNum">     442 </span>                :                 { return Tagcoll::Converter&lt;Facet, std::string&gt;::operator()(item); }
-<span class="lineNum">     443 </span>                :         virtual FacetSet operator()(const StringSet&amp; item) const
-<span class="lineNum">     444 </span>                :                 { return Tagcoll::Converter&lt;std::string, Facet&gt;::operator()(item); }
-<span class="lineNum">     445 </span>                : 
-<span class="lineNum">     446 </span>                :         static std::string componentName();
-<span class="lineNum">     447 </span>                : };
-<span class="lineNum">     448 </span>                : 
-<span class="lineNum">     449 </span>                : /**
-<span class="lineNum">     450 </span>                :  * Convert Vocabulary to ints
-<span class="lineNum">     451 </span>                :  */
-<span class="lineNum">     452 </span>                : class TagIntConverter : public Implementation&lt;TagIntConverter&gt;,
-<span class="lineNum">     453 </span>                :         public Tagcoll::Converter&lt;aptFront::cache::entity::Tag, int&gt;,
-<span class="lineNum">     454 </span>                :         public Tagcoll::Converter&lt;int, aptFront::cache::entity::Tag&gt;
-<span class="lineNum">     455 </span>                : {
-<span class="lineNum">     456 </span>                :         typedef aptFront::cache::entity::Tag Tag;
-<span class="lineNum">     457 </span>                :         typedef Tagcoll::OpSet&lt;aptFront::cache::entity::Tag&gt; TagSet;
-<span class="lineNum">     458 </span>                :         typedef Tagcoll::OpSet&lt;int&gt; IntSet;
-<span class="lineNum">     459 </span>                : public:
-<span class="lineNum">     460 </span>                :         virtual int operator()(const aptFront::cache::entity::Tag&amp; item) const;
-<span class="lineNum">     461 </span>                :         virtual aptFront::cache::entity::Tag operator()(const int&amp; item) const;
-<span class="lineNum">     462 </span>                : 
-<span class="lineNum">     463 </span>                :         virtual IntSet operator()(const TagSet&amp; item) const
-<span class="lineNum">     464 </span>                :                 { return Tagcoll::Converter&lt;Tag, int&gt;::operator()(item); }
-<span class="lineNum">     465 </span>                :         virtual TagSet operator()(const IntSet&amp; item) const
-<span class="lineNum">     466 </span>                :                 { return Tagcoll::Converter&lt;int, Tag&gt;::operator()(item); }
-<span class="lineNum">     467 </span>                : 
-<span class="lineNum">     468 </span>                :         static std::string componentName();
-<span class="lineNum">     469 </span>                : };
-<span class="lineNum">     470 </span>                : 
-<span class="lineNum">     471 </span>                : /**
-<span class="lineNum">     472 </span>                :  * Convert Vocabulary to strings
-<span class="lineNum">     473 </span>                :  */
-<span class="lineNum">     474 </span>                : class TagStringConverter : public Implementation&lt;TagStringConverter&gt;,
-<span class="lineNum">     475 </span>                :         public Tagcoll::Converter&lt;aptFront::cache::entity::Tag, std::string&gt;,
-<span class="lineNum">     476 </span>                :         public Tagcoll::Converter&lt;std::string, aptFront::cache::entity::Tag&gt;
-<span class="lineNum">     477 </span>                : {
-<span class="lineNum">     478 </span>                :         typedef aptFront::cache::entity::Tag Tag;
-<span class="lineNum">     479 </span>                :         typedef Tagcoll::OpSet&lt;aptFront::cache::entity::Tag&gt; TagSet;
-<span class="lineNum">     480 </span>                :         typedef Tagcoll::OpSet&lt;std::string&gt; StringSet;
-<span class="lineNum">     481 </span>                : public:
-<span class="lineNum">     482 </span>                :         virtual std::string operator()(const Tag&amp; item) const;
-<span class="lineNum">     483 </span>                :         virtual Tag operator()(const std::string&amp; item) const;
-<span class="lineNum">     484 </span>                : 
-<span class="lineNum">     485 </span>                :         virtual StringSet operator()(const TagSet&amp; item) const
-<span class="lineNum">     486 </span>                :                 { return Tagcoll::Converter&lt;Tag, std::string&gt;::operator()(item); }
-<span class="lineNum">     487 </span>                :         virtual TagSet operator()(const StringSet&amp; item) const
-<span class="lineNum">     488 </span>                :                 { return Tagcoll::Converter&lt;std::string, Tag&gt;::operator()(item); }
-<span class="lineNum">     489 </span>                : 
-<span class="lineNum">     490 </span>                :         TagSet parseTagList(const std::string&amp; str) const;
-<span class="lineNum">     491 </span>                : 
-<span class="lineNum">     492 </span>                :         static std::string componentName();
-<span class="lineNum">     493 </span>                : };
-<span class="lineNum">     494 </span>                : 
-<span class="lineNum">     495 </span>                : /**
-<span class="lineNum">     496 </span>                :  * Convert Aggregator to ints
-<span class="lineNum">     497 </span>                :  */
-<span class="lineNum">     498 </span>                : class PackageIntConverter : public Implementation&lt;PackageIntConverter&gt;,
-<span class="lineNum">     499 </span>                :         public Tagcoll::Converter&lt;aptFront::cache::entity::Package, int&gt;,
-<span class="lineNum">     500 </span>                :         public Tagcoll::Converter&lt;int, aptFront::cache::entity::Package&gt;
-<span class="lineNum">     501 </span>                : {
-<span class="lineNum">     502 </span>                :         typedef aptFront::cache::entity::Package Package;
-<span class="lineNum">     503 </span>                :         typedef Tagcoll::OpSet&lt;aptFront::cache::entity::Package&gt; PackageSet;
-<span class="lineNum">     504 </span>                :         typedef Tagcoll::OpSet&lt;int&gt; IntSet;
-<span class="lineNum">     505 </span>                : public:
-<span class="lineNum">     506 </span>                :         virtual int operator()(const Package&amp; item) const;
-<span class="lineNum">     507 </span>                :         virtual Package operator()(const int&amp; item) const;
-<span class="lineNum">     508 </span>                : 
-<span class="lineNum">     509 </span>                :         virtual IntSet operator()(const PackageSet&amp; item) const
-<span class="lineNum">     510 </span>                :                 { return Tagcoll::Converter&lt;Package, int&gt;::operator()(item); }
-<span class="lineNum">     511 </span>                :         virtual PackageSet operator()(const IntSet&amp; item) const
-<span class="lineNum">     512 </span>                :                 { return Tagcoll::Converter&lt;int, Package&gt;::operator()(item); }
-<span class="lineNum">     513 </span>                : 
-<span class="lineNum">     514 </span>                :         static std::string componentName();
-<span class="lineNum">     515 </span>                : };
-<span class="lineNum">     516 </span>                : 
-<span class="lineNum">     517 </span>                : /**
-<span class="lineNum">     518 </span>                :  * Convert Aggregator to strings
-<span class="lineNum">     519 </span>                :  */
-<span class="lineNum">     520 </span>                : class PackageStringConverter : public Implementation&lt;PackageStringConverter&gt;,
-<span class="lineNum">     521 </span>                :         public Tagcoll::Converter&lt;aptFront::cache::entity::Package, std::string&gt;,
-<span class="lineNum">     522 </span>                :         public Tagcoll::Converter&lt;std::string, aptFront::cache::entity::Package&gt;
-<span class="lineNum">     523 </span>                : {
-<span class="lineNum">     524 </span>                :         typedef aptFront::cache::entity::Package Package;
-<span class="lineNum">     525 </span>                :         typedef Tagcoll::OpSet&lt;aptFront::cache::entity::Package&gt; PackageSet;
-<span class="lineNum">     526 </span>                :         typedef Tagcoll::OpSet&lt;std::string&gt; StringSet;
-<span class="lineNum">     527 </span>                : public:
-<span class="lineNum">     528 </span>                :         virtual std::string operator()(const Package&amp; item) const;
-<span class="lineNum">     529 </span>                :         virtual Package operator()(const std::string&amp; item) const;
-<span class="lineNum">     530 </span>                : 
-<span class="lineNum">     531 </span>                :         virtual StringSet operator()(const PackageSet&amp; item) const
-<span class="lineNum">     532 </span>                :                 { return Tagcoll::Converter&lt;Package, std::string&gt;::operator()(item); }
-<span class="lineNum">     533 </span>                :         virtual PackageSet operator()(const StringSet&amp; item) const
-<span class="lineNum">     534 </span>                :                 { return Tagcoll::Converter&lt;std::string, Package&gt;::operator()(item); }
-<span class="lineNum">     535 </span>                : 
-<span class="lineNum">     536 </span>                :         static std::string componentName();
-<span class="lineNum">     537 </span>                : };
-<span class="lineNum">     538 </span>                : 
-<span class="lineNum">     539 </span>                : #endif
-<span class="lineNum">     540 </span>                : 
-<span class="lineNum">     541 </span>                : }
-<span class="lineNum">     542 </span>                : }
-<span class="lineNum">     543 </span>                : }
-<span class="lineNum">     544 </span>                : 
-<span class="lineNum">     545 </span>                : #endif
-<span class="lineNum">     546 </span>                : 
-<span class="lineNum">     547 </span>                : #endif
-<span class="lineNum">     548 </span>                : // -*- mode: c++; tab-width: 4; indent-tabs-mode: t -*-
-<span class="lineNum">     549 </span>                : 
-<span class="lineNum">     550 </span>                : #if 0
-<span class="lineNum">     551 </span>                : /**
-<span class="lineNum">     552 </span>                :  * @file cache/debtags/serializer.h
-<span class="lineNum">     553 </span>                :  * @author Enrico Zini (enrico) &lt;enrico@enricozini.org&gt;
-<span class="lineNum">     554 </span>                :  */
-<span class="lineNum">     555 </span>                : 
-<span class="lineNum">     556 </span>                : #ifndef EPT_CACHE_DEBTAGS_SERIALIZER_TCC
-<span class="lineNum">     557 </span>                : #define EPT_CACHE_DEBTAGS_SERIALIZER_TCC
-<span class="lineNum">     558 </span>                : 
-<span class="lineNum">     559 </span>                : #include &lt;ept/cache/debtags/serializer.h&gt;
-<span class="lineNum">     560 </span>                : #if 0
-<span class="lineNum">     561 </span>                : #include &lt;ept/cache/debtags/pkgidx.h&gt;
-<span class="lineNum">     562 </span>                : #include &lt;ept/cache/debtags/vocabulary.h&gt;
-<span class="lineNum">     563 </span>                : #include &lt;ept/cache/package.h&gt;
-<span class="lineNum">     564 </span>                : //#include &lt;ept/cache/cache.h&gt;
-<span class="lineNum">     565 </span>                : #endif
-<span class="lineNum">     566 </span>                : 
-<span class="lineNum">     567 </span>                : namespace ept {
-<span class="lineNum">     568 </span>                : namespace t {
-<span class="lineNum">     569 </span>                : namespace cache {
-<span class="lineNum">     570 </span>                : namespace debtags {
-<span class="lineNum">     571 </span>                : 
-<span class="lineNum">     572 </span>                : 
-<span class="lineNum">     573 </span>                : 
-<span class="lineNum">     574 </span>                : #if 0
-<span class="lineNum">     575 </span>                : string FacetIntConverter::componentName() { return &quot;FacetIntConverter&quot;; }
-<span class="lineNum">     576 </span>                : 
-<span class="lineNum">     577 </span>                : int FacetIntConverter::operator()(const aptFront::cache::entity::Facet&amp; item) const
-<span class="lineNum">     578 </span>                : {
-<span class="lineNum">     579 </span>                :         if (!item.valid()) return -1;
-<span class="lineNum">     580 </span>                :         return item.id();
-<span class="lineNum">     581 </span>                : }
-<span class="lineNum">     582 </span>                : aptFront::cache::entity::Facet FacetIntConverter::operator()(const int&amp; item) const
-<span class="lineNum">     583 </span>                : {
-<span class="lineNum">     584 </span>                :         return cache().tags().facetByID(item);
-<span class="lineNum">     585 </span>                : }
-<span class="lineNum">     586 </span>                : 
-<span class="lineNum">     587 </span>                : string FacetStringConverter::componentName() { return &quot;FacetStringConverter&quot;; }
-<span class="lineNum">     588 </span>                : 
-<span class="lineNum">     589 </span>                : std::string FacetStringConverter::operator()(const aptFront::cache::entity::Facet&amp; item) const
-<span class="lineNum">     590 </span>                : {
-<span class="lineNum">     591 </span>                :         if (!item.valid()) return string();
-<span class="lineNum">     592 </span>                :         return item.name();
-<span class="lineNum">     593 </span>                : }
-<span class="lineNum">     594 </span>                : aptFront::cache::entity::Facet FacetStringConverter::operator()(const std::string&amp; item) const
-<span class="lineNum">     595 </span>                : {
-<span class="lineNum">     596 </span>                :         return cache().tags().facetByName(item);
-<span class="lineNum">     597 </span>                : }
-<span class="lineNum">     598 </span>                : 
-<span class="lineNum">     599 </span>                : string TagIntConverter::componentName() { return &quot;TagIntConverter&quot;; }
-<span class="lineNum">     600 </span>                : 
-<span class="lineNum">     601 </span>                : int TagIntConverter::operator()(const aptFront::cache::entity::Tag&amp; item) const
-<span class="lineNum">     602 </span>                : {
-<span class="lineNum">     603 </span>                :         if (!item.valid()) return -1;
-<span class="lineNum">     604 </span>                :         return item.id();
-<span class="lineNum">     605 </span>                : }
-<span class="lineNum">     606 </span>                : aptFront::cache::entity::Tag TagIntConverter::operator()(const int&amp; item) const
-<span class="lineNum">     607 </span>                : {
-<span class="lineNum">     608 </span>                :         return cache().tags().tagByID(item);
-<span class="lineNum">     609 </span>                : }
-<span class="lineNum">     610 </span>                : 
-<span class="lineNum">     611 </span>                : string TagStringConverter::componentName() { return &quot;TagStringConverter&quot;; }
-<span class="lineNum">     612 </span>                : 
-<span class="lineNum">     613 </span>                : std::string TagStringConverter::operator()(const aptFront::cache::entity::Tag&amp; item) const
-<span class="lineNum">     614 </span>                : {
-<span class="lineNum">     615 </span>                :         if (!item.valid()) return string();
-<span class="lineNum">     616 </span>                :         return item.fullname();
-<span class="lineNum">     617 </span>                : }
-<span class="lineNum">     618 </span>                : aptFront::cache::entity::Tag TagStringConverter::operator()(const std::string&amp; item) const
-<span class="lineNum">     619 </span>                : {
-<span class="lineNum">     620 </span>                :         return cache().tags().tagByName(item);
-<span class="lineNum">     621 </span>                : }
-<span class="lineNum">     622 </span>                : 
-<span class="lineNum">     623 </span>                : Tagcoll::OpSet&lt;entity::Tag&gt; TagStringConverter::parseTagList(const std::string&amp; str) const
-<span class="lineNum">     624 </span>                : {
-<span class="lineNum">     625 </span>                :         if (str.empty())
-<span class="lineNum">     626 </span>                :                 return Tagcoll::OpSet&lt;entity::Tag&gt;();
-<span class="lineNum">     627 </span>                : 
-<span class="lineNum">     628 </span>                :         size_t i = str.find(&quot;, &quot;);
-<span class="lineNum">     629 </span>                :         if (i == string::npos)
-<span class="lineNum">     630 </span>                :         {
-<span class="lineNum">     631 </span>                :                 // Check if we need curly brace expansion
-<span class="lineNum">     632 </span>                :                 if (str[str.size() - 1] == '}')
-<span class="lineNum">     633 </span>                :                 {
-<span class="lineNum">     634 </span>                :                         using namespace std;
-<span class="lineNum">     635 </span>                :                         Tagcoll::OpSet&lt;entity::Tag&gt; res;
-<span class="lineNum">     636 </span>                :                         size_t begin = str.find('{');
-<span class="lineNum">     637 </span>                :                         if (begin == string::npos)
-<span class="lineNum">     638 </span>                :                                 return res;
-<span class="lineNum">     639 </span>                :                         string prefix(str, 0, begin);
-<span class="lineNum">     640 </span>                :                         ++begin;
-<span class="lineNum">     641 </span>                :                         size_t end;
-<span class="lineNum">     642 </span>                :                         while ((end = str.find(',', begin)) != string::npos)
-<span class="lineNum">     643 </span>                :                         {
-<span class="lineNum">     644 </span>                :                                 res += (*this)(prefix + str.substr(begin, end-begin));
-<span class="lineNum">     645 </span>                :                                 begin = end + 1;
-<span class="lineNum">     646 </span>                :                         }
-<span class="lineNum">     647 </span>                :                         res += (*this)(prefix + str.substr(begin, str.size() - 1 - begin));
-<span class="lineNum">     648 </span>                :                         return res;
-<span class="lineNum">     649 </span>                :                 } else {
-<span class="lineNum">     650 </span>                :                         entity::Tag t = (*this)(str);
-<span class="lineNum">     651 </span>                :                         if (t.valid())
-<span class="lineNum">     652 </span>                :                                 return Tagcoll::OpSet&lt;entity::Tag&gt;() + t;
-<span class="lineNum">     653 </span>                :                         else
-<span class="lineNum">     654 </span>                :                                 return Tagcoll::OpSet&lt;entity::Tag&gt;();
-<span class="lineNum">     655 </span>                :                 }
-<span class="lineNum">     656 </span>                :         } else {
-<span class="lineNum">     657 </span>                :                 return parseTagList(string(str, 0, i)) + parseTagList(string(str, i+2));
-<span class="lineNum">     658 </span>                :         }
-<span class="lineNum">     659 </span>                : }
-<span class="lineNum">     660 </span>                : 
-<span class="lineNum">     661 </span>                : string PackageIntConverter::componentName() { return &quot;PackageIntConverter&quot;; }
-<span class="lineNum">     662 </span>                : 
-<span class="lineNum">     663 </span>                : int PackageIntConverter::operator()(const aptFront::cache::entity::Package&amp; item) const
-<span class="lineNum">     664 </span>                : {
-<span class="lineNum">     665 </span>                :         if (!item.valid()) return -1;
-<span class="lineNum">     666 </span>                :         return item.id();
-<span class="lineNum">     667 </span>                : }
-<span class="lineNum">     668 </span>                : aptFront::cache::entity::Package PackageIntConverter::operator()(const int&amp; item) const
-<span class="lineNum">     669 </span>                : {
-<span class="lineNum">     670 </span>                :         PkgIdx&amp; p = cache().pkgidx();
-<span class="lineNum">     671 </span>                :         return cache().packages().packageByName(string(p.name(item), p.size(item)));
-<span class="lineNum">     672 </span>                : }
-<span class="lineNum">     673 </span>                : 
-<span class="lineNum">     674 </span>                : string PackageStringConverter::componentName() { return &quot;PackageStringConverter&quot;; }
-<span class="lineNum">     675 </span>                : 
-<span class="lineNum">     676 </span>                : std::string PackageStringConverter::operator()(const aptFront::cache::entity::Package&amp; item) const
-<span class="lineNum">     677 </span>                : {
-<span class="lineNum">     678 </span>                :         if (!item.valid()) return string();
-<span class="lineNum">     679 </span>                :         return item.name();
-<span class="lineNum">     680 </span>                : }
-<span class="lineNum">     681 </span>                : aptFront::cache::entity::Package PackageStringConverter::operator()(const std::string&amp; item) const
-<span class="lineNum">     682 </span>                : {
-<span class="lineNum">     683 </span>                :         return cache().packages().packageByName(item);
-<span class="lineNum">     684 </span>                : }
-<span class="lineNum">     685 </span>                : #endif
-<span class="lineNum">     686 </span>                : 
-<span class="lineNum">     687 </span>                : }
-<span class="lineNum">     688 </span>                : }
-<span class="lineNum">     689 </span>                : 
-<span class="lineNum">     690 </span>                : #endif
-<span class="lineNum">     691 </span>                : 
-<span class="lineNum">     692 </span>                : #if 0
-<span class="lineNum">     693 </span>                : #ifdef COMPILE_TESTSUITE
-<span class="lineNum">     694 </span>                : //#include &lt;apt-front/cache/component/debtags/update.h&gt;
-<span class="lineNum">     695 </span>                : #include &lt;iostream&gt;
-<span class="lineNum">     696 </span>                : #include &quot;test-utils.h&quot;
-<span class="lineNum">     697 </span>                : 
-<span class="lineNum">     698 </span>                : namespace tut {
-<span class="lineNum">     699 </span>                : using namespace aptFront::cache;
-<span class="lineNum">     700 </span>                : using namespace component;
-<span class="lineNum">     701 </span>                : using namespace debtags;
-<span class="lineNum">     702 </span>                : using namespace std;
-<span class="lineNum">     703 </span>                : 
-<span class="lineNum">     704 </span>                : struct cache_component_debtags_serializer_shar {
-<span class="lineNum">     705 </span>                :     cache_component_debtags_serializer_shar () {
-<span class="lineNum">     706 </span>                :         aptInit ();
-<span class="lineNum">     707 </span>                :         ok = true;
-<span class="lineNum">     708 </span>                :         debtags::fetchNewData();
-<span class="lineNum">     709 </span>                :         c.open( Cache::OpenDefault |
-<span class="lineNum">     710 </span>                :                 Cache::OpenReadOnly | Cache::OpenDebtags );
-<span class="lineNum">     711 </span>                :     }
-<span class="lineNum">     712 </span>                :     void check() {
-<span class="lineNum">     713 </span>                :         if (ok) return;
-<span class="lineNum">     714 </span>                :         ok = true;
-<span class="lineNum">     715 </span>                :         throw warning( &quot;debtags init failed, cancelling&quot; );
-<span class="lineNum">     716 </span>                :     }
-<span class="lineNum">     717 </span>                :     ~cache_component_debtags_serializer_shar() {
-<span class="lineNum">     718 </span>                :         check();
-<span class="lineNum">     719 </span>                :     }
-<span class="lineNum">     720 </span>                :     Cache c;
-<span class="lineNum">     721 </span>                :     bool ok;
-<span class="lineNum">     722 </span>                : };
-<span class="lineNum">     723 </span>                : 
-<span class="lineNum">     724 </span>                : TESTGRP( cache_component_debtags_serializer );
-<span class="lineNum">     725 </span>                : 
-<span class="lineNum">     726 </span>                : using namespace Tagcoll;
-<span class="lineNum">     727 </span>                : 
-<span class="lineNum">     728 </span>                : template&lt;&gt; template&lt;&gt;
-<span class="lineNum">     729 </span>                : void to::test&lt;1&gt; ()
-<span class="lineNum">     730 </span>                : {
-<span class="lineNum">     731 </span>                :     check();
-<span class="lineNum">     732 </span>                : 
-<span class="lineNum">     733 </span>                :         PackageStringConverter&amp; psc = c.packagestringconverter();
-<span class="lineNum">     734 </span>                : 
-<span class="lineNum">     735 </span>                :         ensure(psc(&quot;Slartibartsfart&quot;) == entity::Package());
-<span class="lineNum">     736 </span>                : 
-<span class="lineNum">     737 </span>                :     /* Get the 'debtags' package */
-<span class="lineNum">     738 </span>                :     entity::Package p = c.packages().packageByName( &quot;debtags&quot; );
-<span class="lineNum">     739 </span>                :     ensure(p.valid());
-<span class="lineNum">     740 </span>                : 
-<span class="lineNum">     741 </span>                :         /* Get the 'debtags' package using the serializer */
-<span class="lineNum">     742 </span>                :         entity::Package p1 = psc(&quot;debtags&quot;);
-<span class="lineNum">     743 </span>                :         ensure(p1.valid());
-<span class="lineNum">     744 </span>                : 
-<span class="lineNum">     745 </span>                :         /* They must be the same */
-<span class="lineNum">     746 </span>                :         ensure(p == p1);
-<span class="lineNum">     747 </span>                : 
-<span class="lineNum">     748 </span>                :         ensure_equals(psc(p), &quot;debtags&quot;);
-<span class="lineNum">     749 </span>                :         ensure_equals(psc(p1), &quot;debtags&quot;);
-<span class="lineNum">     750 </span>                :         ensure_equals(psc(p), psc(p1));
-<span class="lineNum">     751 </span>                : 
-<span class="lineNum">     752 </span>                :         /* If there is an invalid package to serialize, it should be discarded */
-<span class="lineNum">     753 </span>                :         {
-<span class="lineNum">     754 </span>                :                 Tagcoll::OpSet&lt;entity::Package&gt; pkgs;
-<span class="lineNum">     755 </span>                :                 pkgs += c.packages().packageByName( &quot;debtags&quot; );
-<span class="lineNum">     756 </span>                :                 pkgs += c.packages().packageByName( &quot;tagcoll&quot; );
-<span class="lineNum">     757 </span>                :                 pkgs += entity::Package();
-<span class="lineNum">     758 </span>                : 
-<span class="lineNum">     759 </span>                :                 ensure_equals (pkgs.size(), 3u);
-<span class="lineNum">     760 </span>                :                 ensure_equals (psc(pkgs).size(), 2u);
-<span class="lineNum">     761 </span>                :                 ensure (psc(pkgs).contains(&quot;debtags&quot;));
-<span class="lineNum">     762 </span>                :                 ensure (psc(pkgs).contains(&quot;tagcoll&quot;));
-<span class="lineNum">     763 </span>                :         }
-<span class="lineNum">     764 </span>                : 
-<span class="lineNum">     765 </span>                :         /* If there is an invalid package to serialize, it should be discarded */
-<span class="lineNum">     766 </span>                :         {
-<span class="lineNum">     767 </span>                :                 Tagcoll::OpSet&lt;std::string&gt; pkgs;
-<span class="lineNum">     768 </span>                :                 pkgs += &quot;debtags&quot;;
-<span class="lineNum">     769 </span>                :                 pkgs += &quot;tagcoll&quot;;
-<span class="lineNum">     770 </span>                :                 pkgs += &quot;Slartibartsfart&quot;;
-<span class="lineNum">     771 </span>                : 
-<span class="lineNum">     772 </span>                :                 ensure_equals (pkgs.size(), 3u);
-<span class="lineNum">     773 </span>                :                 ensure_equals (psc(pkgs).size(), 2u);
-<span class="lineNum">     774 </span>                :                 ensure (psc(pkgs).contains(psc(&quot;debtags&quot;)));
-<span class="lineNum">     775 </span>                :                 ensure (psc(pkgs).contains(psc(&quot;tagcoll&quot;)));
-<span class="lineNum">     776 </span>                :                 ensure (!psc(pkgs).contains(entity::Package()));
-<span class="lineNum">     777 </span>                :         }
-<span class="lineNum">     778 </span>                : }
-<span class="lineNum">     779 </span>                : 
-<span class="lineNum">     780 </span>                : ostream&amp; operator&lt;&lt;(ostream&amp; out, const entity::Package&amp; pkg)
-<span class="lineNum">     781 </span>                : {
-<span class="lineNum">     782 </span>                :         if (pkg.valid())
-<span class="lineNum">     783 </span>                :                 return out &lt;&lt; pkg.name();
-<span class="lineNum">     784 </span>                :         else
-<span class="lineNum">     785 </span>                :                 return out &lt;&lt; &quot;(invalid package)&quot;;
-<span class="lineNum">     786 </span>                : }
-<span class="lineNum">     787 </span>                : 
-<span class="lineNum">     788 </span>                : // Check that package conversions work two-way
-<span class="lineNum">     789 </span>                : template&lt;&gt; template&lt;&gt;
-<span class="lineNum">     790 </span>                : void to::test&lt;2&gt; ()
-<span class="lineNum">     791 </span>                : {
-<span class="lineNum">     792 </span>                :         PackageStringConverter&amp; psc = c.packagestringconverter();
-<span class="lineNum">     793 </span>                :         for (component::Aggregator::iterator i = c.packages().packagesBegin();
-<span class="lineNum">     794 </span>                :                         i != c.packages().packagesEnd(); ++i)
-<span class="lineNum">     795 </span>                :         {
-<span class="lineNum">     796 </span>                :                 try {
-<span class="lineNum">     797 </span>                :                         ensure_equals(*i, psc(psc(*i)));
-<span class="lineNum">     798 </span>                :                 } catch (...) {
-<span class="lineNum">     799 </span>                :                         cerr &lt;&lt; &quot;Note: exception thrown during processing[string] of package &quot; &lt;&lt; i-&gt;name(string(&quot;(invalid package)&quot;)) &lt;&lt; endl;
-<span class="lineNum">     800 </span>                :                         throw;
-<span class="lineNum">     801 </span>                :                 }
-<span class="lineNum">     802 </span>                :         }
-<span class="lineNum">     803 </span>                : 
-<span class="lineNum">     804 </span>                :         PackageIntConverter&amp; pic = c.packageintconverter();
-<span class="lineNum">     805 </span>                :         for (component::Aggregator::iterator i = c.packages().packagesBegin();
-<span class="lineNum">     806 </span>                :                         i != c.packages().packagesEnd(); ++i)
-<span class="lineNum">     807 </span>                :         {
-<span class="lineNum">     808 </span>                :                 try {
-<span class="lineNum">     809 </span>                :                         ensure_equals(*i, pic(pic(*i)));
-<span class="lineNum">     810 </span>                :                 } catch (...) {
-<span class="lineNum">     811 </span>                :                         cerr &lt;&lt; &quot;Note: exception thrown during processing[int] of package &quot; &lt;&lt; i-&gt;name(string(&quot;(invalid package)&quot;)) &lt;&lt; endl;
-<span class="lineNum">     812 </span>                :                         throw;
-<span class="lineNum">     813 </span>                :                 }
-<span class="lineNum">     814 </span>                :         }
-<span class="lineNum">     815 </span>                : }
-<span class="lineNum">     816 </span>                : 
-<span class="lineNum">     817 </span>                : // Check that facet conversions work two-way
-<span class="lineNum">     818 </span>                : template&lt;&gt; template&lt;&gt;
-<span class="lineNum">     819 </span>                : void to::test&lt;3&gt; ()
-<span class="lineNum">     820 </span>                : {
-<span class="lineNum">     821 </span>                :         typedef Tagcoll::OpSet&lt;entity::Facet&gt; FacetSet;
-<span class="lineNum">     822 </span>                : 
-<span class="lineNum">     823 </span>                :         FacetStringConverter&amp; fsc = c.facetstringconverter();
-<span class="lineNum">     824 </span>                :         FacetSet allFacets(c.tags().facets());
-<span class="lineNum">     825 </span>                :         for (FacetSet::const_iterator i = allFacets.begin(); i != allFacets.end(); i++)
-<span class="lineNum">     826 </span>                :         {
-<span class="lineNum">     827 </span>                :                 try {
-<span class="lineNum">     828 </span>                :                         ensure_equals(*i, fsc(fsc(*i)));
-<span class="lineNum">     829 </span>                :                 } catch (...) {
-<span class="lineNum">     830 </span>                :                         cerr &lt;&lt; &quot;Note: exception thrown during processing[string] of facet &quot; &lt;&lt; i-&gt;name() &lt;&lt; endl;
-<span class="lineNum">     831 </span>                :                         throw;
-<span class="lineNum">     832 </span>                :                 }
-<span class="lineNum">     833 </span>                :         }
-<span class="lineNum">     834 </span>                : 
-<span class="lineNum">     835 </span>                :         FacetIntConverter&amp; fic = c.facetintconverter();
-<span class="lineNum">     836 </span>                :         for (FacetSet::const_iterator i = allFacets.begin(); i != allFacets.end(); i++)
-<span class="lineNum">     837 </span>                :         {
-<span class="lineNum">     838 </span>                :                 try {
-<span class="lineNum">     839 </span>                :                         ensure_equals(*i, fic(fic(*i)));
-<span class="lineNum">     840 </span>                :                 } catch (...) {
-<span class="lineNum">     841 </span>                :                         cerr &lt;&lt; &quot;Note: exception thrown during processing[int] of facet &quot; &lt;&lt; i-&gt;name() &lt;&lt; endl;
-<span class="lineNum">     842 </span>                :                         throw;
-<span class="lineNum">     843 </span>                :                 }
-<span class="lineNum">     844 </span>                :         }
-<span class="lineNum">     845 </span>                : }
-<span class="lineNum">     846 </span>                : 
-<span class="lineNum">     847 </span>                : // Check that tag conversions work two-way
-<span class="lineNum">     848 </span>                : template&lt;&gt; template&lt;&gt;
-<span class="lineNum">     849 </span>                : void to::test&lt;4&gt; ()
-<span class="lineNum">     850 </span>                : {
-<span class="lineNum">     851 </span>                :         typedef Tagcoll::OpSet&lt;entity::Tag&gt; TagSet;
-<span class="lineNum">     852 </span>                : 
-<span class="lineNum">     853 </span>                :         TagStringConverter&amp; tsc = c.tagstringconverter();
-<span class="lineNum">     854 </span>                :         TagSet allTags(c.tags().tags());
-<span class="lineNum">     855 </span>                :         for (TagSet::const_iterator i = allTags.begin(); i != allTags.end(); i++)
-<span class="lineNum">     856 </span>                :         {
-<span class="lineNum">     857 </span>                :                 try {
-<span class="lineNum">     858 </span>                :                         ensure_equals(*i, tsc(tsc(*i)));
-<span class="lineNum">     859 </span>                :                 } catch (...) {
-<span class="lineNum">     860 </span>                :                         cerr &lt;&lt; &quot;Note: exception thrown during processing[string] of tag &quot; &lt;&lt; i-&gt;fullname() &lt;&lt; endl;
-<span class="lineNum">     861 </span>                :                         throw;
-<span class="lineNum">     862 </span>                :                 }
-<span class="lineNum">     863 </span>                :         }
-<span class="lineNum">     864 </span>                : 
-<span class="lineNum">     865 </span>                :         TagIntConverter&amp; tic = c.tagintconverter();
-<span class="lineNum">     866 </span>                :         for (TagSet::const_iterator i = allTags.begin(); i != allTags.end(); i++)
-<span class="lineNum">     867 </span>                :         {
-<span class="lineNum">     868 </span>                :                 try {
-<span class="lineNum">     869 </span>                :                         ensure_equals(*i, tic(tic(*i)));
-<span class="lineNum">     870 </span>                :                 } catch (...) {
-<span class="lineNum">     871 </span>                :                         cerr &lt;&lt; &quot;Note: exception thrown during processing[int] of tag &quot; &lt;&lt; i-&gt;fullname() &lt;&lt; endl;
-<span class="lineNum">     872 </span>                :                         throw;
-<span class="lineNum">     873 </span>                :                 }
-<span class="lineNum">     874 </span>                :         }
-<span class="lineNum">     875 </span>                : }
-<span class="lineNum">     876 </span>                : 
-<span class="lineNum">     877 </span>                : // Check TagStringConverter::parseTagList
-<span class="lineNum">     878 </span>                : template&lt;&gt; template&lt;&gt;
-<span class="lineNum">     879 </span>                : void to::test&lt;5&gt; ()
-<span class="lineNum">     880 </span>                : {
-<span class="lineNum">     881 </span>                :         TagStringConverter&amp; tsc = c.tagstringconverter();
-<span class="lineNum">     882 </span>                :         OpSet&lt;entity::Tag&gt; ts;
-<span class="lineNum">     883 </span>                : 
-<span class="lineNum">     884 </span>                :         // First ensure that we're using existing tags as samples
-<span class="lineNum">     885 </span>                :         ensure(tsc(&quot;accessibility::TODO&quot;) != entity::Tag());
-<span class="lineNum">     886 </span>                :         ensure(tsc(&quot;role::sw:devel-lib&quot;) != entity::Tag());
-<span class="lineNum">     887 </span>                :         ensure(tsc(&quot;x11::xserver&quot;) != entity::Tag());
-<span class="lineNum">     888 </span>                :         ensure(tsc(&quot;antani&quot;) == entity::Tag());
-<span class="lineNum">     889 </span>                :         ensure(tsc(&quot;blinda&quot;) == entity::Tag());
-<span class="lineNum">     890 </span>                :         ensure(tsc(&quot;supercazzola&quot;) == entity::Tag());
-<span class="lineNum">     891 </span>                : 
-<span class="lineNum">     892 </span>                :         ts = tsc.parseTagList(&quot;role::sw:devel-lib&quot;);
-<span class="lineNum">     893 </span>                :         ensure_equals(ts.size(), 1u);
-<span class="lineNum">     894 </span>                :         ensure(ts.contains(tsc(&quot;role::sw:devel-lib&quot;)));
-<span class="lineNum">     895 </span>                : 
-<span class="lineNum">     896 </span>                :         ts = tsc.parseTagList(&quot;accessibility::TODO, x11::xserver, role::sw:devel-lib&quot;);
-<span class="lineNum">     897 </span>                :         ensure_equals(ts.size(), 3u);
-<span class="lineNum">     898 </span>                :         ensure(ts.contains(tsc(&quot;accessibility::TODO&quot;)));
-<span class="lineNum">     899 </span>                :         ensure(ts.contains(tsc(&quot;role::sw:devel-lib&quot;)));
-<span class="lineNum">     900 </span>                :         ensure(ts.contains(tsc(&quot;x11::xserver&quot;)));
-<span class="lineNum">     901 </span>                : 
-<span class="lineNum">     902 </span>                :         ts = tsc.parseTagList(&quot;antani&quot;);
-<span class="lineNum">     903 </span>                :         ensure_equals(ts.size(), 0u);
-<span class="lineNum">     904 </span>                : 
-<span class="lineNum">     905 </span>                :         ts = tsc.parseTagList(&quot;antani, blinda, supercazzola&quot;);
-<span class="lineNum">     906 </span>                :         ensure_equals(ts.size(), 0u);
-<span class="lineNum">     907 </span>                : 
-<span class="lineNum">     908 </span>                :         ts = tsc.parseTagList(&quot;antani, x11::xserver, blinda&quot;);
-<span class="lineNum">     909 </span>                :         ensure_equals(ts.size(), 1u);
-<span class="lineNum">     910 </span>                :         ensure(ts.contains(tsc(&quot;x11::xserver&quot;)));
-<span class="lineNum">     911 </span>                : }
-<span class="lineNum">     912 </span>                : 
-<span class="lineNum">     913 </span>                : // Check TagStringConverter::parseTagList's handling of curly brace expansion
-<span class="lineNum">     914 </span>                : template&lt;&gt; template&lt;&gt;
-<span class="lineNum">     915 </span>                : void to::test&lt;6&gt; ()
-<span class="lineNum">     916 </span>                : {
-<span class="lineNum">     917 </span>                :         TagStringConverter&amp; tsc = c.tagstringconverter();
-<span class="lineNum">     918 </span>                :         OpSet&lt;entity::Tag&gt; ts;
-<span class="lineNum">     919 </span>                : 
-<span class="lineNum">     920 </span>                :         // First ensure that we're using existing tags as samples
-<span class="lineNum">     921 </span>                :         ensure(tsc(&quot;role::TODO&quot;) != entity::Tag());
-<span class="lineNum">     922 </span>                :         ensure(tsc(&quot;role::sw:server&quot;) != entity::Tag());
-<span class="lineNum">     923 </span>                :         ensure(tsc(&quot;role::aux:dummy&quot;) != entity::Tag());
-<span class="lineNum">     924 </span>                :         ensure(tsc(&quot;role::sw:amusement&quot;) != entity::Tag());
-<span class="lineNum">     925 </span>                :         ensure(tsc(&quot;role::sw:server{}&quot;) == entity::Tag());
-<span class="lineNum">     926 </span>                :         ensure(tsc(&quot;role::{}&quot;) == entity::Tag());
-<span class="lineNum">     927 </span>                :         ensure(tsc(&quot;role::{&quot;) == entity::Tag());
-<span class="lineNum">     928 </span>                :         ensure(tsc(&quot;role::}&quot;) == entity::Tag());
-<span class="lineNum">     929 </span>                : 
-<span class="lineNum">     930 </span>                :         ts = tsc.parseTagList(&quot;role::{TODO,sw:server,aux:dummy,sw:amusement}&quot;);
-<span class="lineNum">     931 </span>                :         ensure_equals(ts.size(), 4u);
-<span class="lineNum">     932 </span>                :         ensure(ts.contains(tsc(&quot;role::TODO&quot;)));
-<span class="lineNum">     933 </span>                :         ensure(ts.contains(tsc(&quot;role::sw:server&quot;)));
-<span class="lineNum">     934 </span>                :         ensure(ts.contains(tsc(&quot;role::aux:dummy&quot;)));
-<span class="lineNum">     935 </span>                :         ensure(ts.contains(tsc(&quot;role::sw:amusement&quot;)));
-<span class="lineNum">     936 </span>                : 
-<span class="lineNum">     937 </span>                :         ts = tsc.parseTagList(&quot;role::{TODO,aux:dummy}, role::sw:{server,amusement}&quot;);
-<span class="lineNum">     938 </span>                :         ensure_equals(ts.size(), 4u);
-<span class="lineNum">     939 </span>                :         ensure(ts.contains(tsc(&quot;role::TODO&quot;)));
-<span class="lineNum">     940 </span>                :         ensure(ts.contains(tsc(&quot;role::sw:server&quot;)));
-<span class="lineNum">     941 </span>                :         ensure(ts.contains(tsc(&quot;role::aux:dummy&quot;)));
-<span class="lineNum">     942 </span>                :         ensure(ts.contains(tsc(&quot;role::sw:amusement&quot;)));
-<span class="lineNum">     943 </span>                : }
-<span class="lineNum">     944 </span>                : 
-<span class="lineNum">     945 </span>                : }
-<span class="lineNum">     946 </span>                : #endif
-<span class="lineNum">     947 </span>                : #endif
-<span class="lineNum">     948 </span>                : #endif
-<span class="lineNum">     949 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/debtags/maint/serializer.test.h.gcov.html b/rep/ept/debtags/maint/serializer.test.h.gcov.html
deleted file mode 100644
index 4980e32..0000000
--- a/rep/ept/debtags/maint/serializer.test.h.gcov.html
+++ /dev/null
@@ -1,200 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/debtags/maint/serializer.test.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">ept/debtags/maint</a> - serializer.test.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">48</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">48</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- mode: c++; tab-width: 4; indent-tabs-mode: t -*-
-<span class="lineNum">       2 </span>                : /**
-<span class="lineNum">       3 </span>                :  * @file
-<span class="lineNum">       4 </span>                :  * @author Enrico Zini (enrico) &lt;enrico@enricozini.org&gt;
-<span class="lineNum">       5 </span>                :  */
-<span class="lineNum">       6 </span>                : 
-<span class="lineNum">       7 </span>                : /*
-<span class="lineNum">       8 </span>                :  * Tests for Debtags serialization filters
-<span class="lineNum">       9 </span>                :  *
-<span class="lineNum">      10 </span>                :  * Copyright (C) 2003-2007  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">      11 </span>                :  *
-<span class="lineNum">      12 </span>                :  * This library is free software; you can redistribute it and/or
-<span class="lineNum">      13 </span>                :  * modify it under the terms of the GNU Lesser General Public
-<span class="lineNum">      14 </span>                :  * License as published by the Free Software Foundation; either
-<span class="lineNum">      15 </span>                :  * version 2.1 of the License, or (at your option) any later version.
-<span class="lineNum">      16 </span>                :  *
-<span class="lineNum">      17 </span>                :  * This library is distributed in the hope that it will be useful,
-<span class="lineNum">      18 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      19 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-<span class="lineNum">      20 </span>                :  * Lesser General Public License for more details.
-<span class="lineNum">      21 </span>                :  *
-<span class="lineNum">      22 </span>                :  * You should have received a copy of the GNU Lesser General Public
-<span class="lineNum">      23 </span>                :  * License along with this library; if not, write to the Free Software
-<span class="lineNum">      24 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
-<span class="lineNum">      25 </span>                :  */
-<span class="lineNum">      26 </span>                : 
-<span class="lineNum">      27 </span>                : #include &lt;ept/debtags/maint/serializer.h&gt;
-<span class="lineNum">      28 </span>                : #include &lt;ept/debtags/maint/pkgid.h&gt;
-<span class="lineNum">      29 </span>                : #include &lt;ept/debtags/maint/path.h&gt;
-<span class="lineNum">      30 </span>                : #include &lt;ept/debtags/vocabulary.h&gt;
-<span class="lineNum">      31 </span>                : #include &lt;ept/debtags/debtags.h&gt;
-<span class="lineNum">      32 </span>                : 
-<span class="lineNum">      33 </span>                : #include &lt;tagcoll/coll/simple.h&gt;
-<span class="lineNum">      34 </span>                : 
-<span class="lineNum">      35 </span>                : #include &lt;wibble/singleton.h&gt;
-<span class="lineNum">      36 </span>                : 
-<span class="lineNum">      37 </span>                : #include &lt;ept/test.h&gt;
-<span class="lineNum">      38 </span>                : 
-<span class="lineNum">      39 </span>                : using namespace std;
-<span class="lineNum">      40 </span>                : using namespace tagcoll;
-<span class="lineNum">      41 </span>                : using namespace ept;
-<span class="lineNum">      42 </span>                : using namespace ept::debtags;
-<span class="lineNum">      43 </span>                : 
-<span class="lineNum">      44 </span>                : struct TestSerializer : DebtagsTestEnvironment
-<span class="lineNum">      45 </span><span class="lineCov">              2 : {</span>
-<span class="lineNum">      46 </span>                :         Debtags debtags;
-<span class="lineNum">      47 </span>                :         Vocabulary&amp; voc;
-<span class="lineNum">      48 </span>                :         PkgId&amp; pkgid;
-<span class="lineNum">      49 </span>                : 
-<span class="lineNum">      50 </span><span class="lineCov">              2 :         TestSerializer()</span>
-<span class="lineNum">      51 </span><span class="lineCov">              2 :                 : voc(debtags.vocabulary()), pkgid(debtags.pkgid()) {}</span>
-<span class="lineNum">      52 </span>                : 
-<span class="lineNum">      53 </span>                : /* Test going from a stream of tag data &lt;string, string&gt; to a stream of tag
-<span class="lineNum">      54 </span>                :  * data &lt;int, int&gt; to a stream of tag data &lt;Package, Tag&gt; and finally back to a
-<span class="lineNum">      55 </span>                :  * stream of tag data &lt;string, string&gt;
-<span class="lineNum">      56 </span>                :  */
-<span class="lineNum">      57 </span><span class="lineCov">              1 :         Test _1()</span>
-<span class="lineNum">      58 </span>                : {
-<span class="lineNum">      59 </span>                :         // Source data &lt;string, string&gt;
-<span class="lineNum">      60 </span><span class="lineCov">              1 :         coll::Simple&lt;string, string&gt; source;</span>
-<span class="lineNum">      61 </span><span class="lineCov">              1 :         source.insert(wibble::singleton(string(&quot;debtags&quot;)), wibble::singleton(string(&quot;use::editing&quot;)));</span>
-<span class="lineNum">      62 </span><span class="lineCov">              2 :         source.insert(wibble::singleton(string(&quot;debtags&quot;)), wibble::singleton(string(&quot;role::program&quot;)));</span>
-<span class="lineNum">      63 </span>                : 
-<span class="lineNum">      64 </span>                :         // &lt;string, string&gt; -&gt; &lt;int, int&gt;
-<span class="lineNum">      65 </span><span class="lineCov">              1 :         coll::Simple&lt;int, int&gt; dest;</span>
-<span class="lineNum">      66 </span><span class="lineCov">              1 :         source.output(stringToInt(pkgid, voc, inserter(dest)));</span>
-<span class="lineNum">      67 </span>                : 
-<span class="lineNum">      68 </span><span class="lineCov">              1 :         assert_eq(dest.itemCount(), 1u);</span>
-<span class="lineNum">      69 </span><span class="lineCov">              2 :         assert_eq(dest.tagCount(), 2u);</span>
-<span class="lineNum">      70 </span>                : 
-<span class="lineNum">      71 </span>                :         // &lt;int, int&gt; -&gt; &lt;Package, Tag&gt;
-<span class="lineNum">      72 </span><span class="lineCov">              1 :         coll::Simple&lt;string, Tag&gt; dest1;</span>
-<span class="lineNum">      73 </span><span class="lineCov">              1 :         dest.output(intToPkg(pkgid, voc, inserter(dest1)));</span>
-<span class="lineNum">      74 </span>                : 
-<span class="lineNum">      75 </span><span class="lineCov">              1 :         assert_eq(dest1.itemCount(), 1u);</span>
-<span class="lineNum">      76 </span><span class="lineCov">              2 :         assert_eq(dest1.tagCount(), 2u);</span>
-<span class="lineNum">      77 </span>                : 
-<span class="lineNum">      78 </span><span class="lineCov">              2 :         std::set&lt;Tag&gt; tags = dest1.getTagsOfItem(&quot;debtags&quot;);</span>
-<span class="lineNum">      79 </span><span class="lineCov">              2 :         assert_eq(tags.size(), 2u);</span>
-<span class="lineNum">      80 </span>                : 
-<span class="lineNum">      81 </span><span class="lineCov">              2 :         Tag useEditing = voc.tagByName(&quot;use::editing&quot;);</span>
-<span class="lineNum">      82 </span><span class="lineCov">              2 :         Tag roleProgram = voc.tagByName(&quot;role::program&quot;);</span>
-<span class="lineNum">      83 </span>                : 
-<span class="lineNum">      84 </span><span class="lineCov">              2 :         assert(tags.find(useEditing) != tags.end());</span>
-<span class="lineNum">      85 </span><span class="lineCov">              2 :         assert(tags.find(roleProgram) != tags.end());</span>
-<span class="lineNum">      86 </span>                : 
-<span class="lineNum">      87 </span>                :         // &lt;Package, Tag&gt; -&gt; &lt;string, string&gt;
-<span class="lineNum">      88 </span><span class="lineCov">              1 :         coll::Simple&lt;string, string&gt; dest2;</span>
-<span class="lineNum">      89 </span><span class="lineCov">              1 :         dest1.output(pkgToString(inserter(dest2)));</span>
-<span class="lineNum">      90 </span>                : 
-<span class="lineNum">      91 </span><span class="lineCov">              1 :         assert_eq(dest2.itemCount(), 1u);</span>
-<span class="lineNum">      92 </span><span class="lineCov">              2 :         assert_eq(dest2.tagCount(), 2u);</span>
-<span class="lineNum">      93 </span>                : 
-<span class="lineNum">      94 </span><span class="lineCov">              2 :         std::set&lt;std::string&gt; tags1 = dest2.getTagsOfItem(&quot;debtags&quot;);</span>
-<span class="lineNum">      95 </span><span class="lineCov">              2 :         assert_eq(tags1.size(), 2u);</span>
-<span class="lineNum">      96 </span>                : 
-<span class="lineNum">      97 </span><span class="lineCov">              2 :         assert(tags1.find(&quot;use::editing&quot;) != tags1.end());</span>
-<span class="lineNum">      98 </span><span class="lineCov">              2 :         assert(tags1.find(&quot;role::program&quot;) != tags1.end());</span>
-<span class="lineNum">      99 </span><span class="lineCov">              1 : }</span>
-<span class="lineNum">     100 </span>                : 
-<span class="lineNum">     101 </span>                : /* Test going from patch with strings to patch with ints and vice versa */
-<span class="lineNum">     102 </span><span class="lineCov">              1 :         Test _2()</span>
-<span class="lineNum">     103 </span>                : {
-<span class="lineNum">     104 </span><span class="lineCov">              1 :         PatchList&lt;string, string&gt; change;</span>
-<span class="lineNum">     105 </span>                :         change.addPatch(Patch&lt;string, string&gt;(&quot;debtags&quot;,
-<span class="lineNum">     106 </span>                :                                 wibble::singleton(string(&quot;use::gameplaying&quot;)),
-<span class="lineNum">     107 </span><span class="lineCov">              1 :                                 wibble::singleton(string(&quot;use::editing&quot;))));</span>
-<span class="lineNum">     108 </span>                : 
-<span class="lineNum">     109 </span>                :         // Deserialise to ints
-<span class="lineNum">     110 </span><span class="lineCov">              1 :         PatchList&lt;int, int&gt; intChange;</span>
-<span class="lineNum">     111 </span><span class="lineCov">              1 :         change.output(patchStringToInt(pkgid, voc, tagcoll::inserter(intChange)));</span>
-<span class="lineNum">     112 </span><span class="lineCov">              1 :         assert_eq(intChange.size(), 1u);</span>
-<span class="lineNum">     113 </span><span class="lineCov">              2 :         assert_eq(intChange.begin()-&gt;second.added.size(), 1u);</span>
-<span class="lineNum">     114 </span><span class="lineCov">              2 :         assert_eq(intChange.begin()-&gt;second.removed.size(), 1u);</span>
-<span class="lineNum">     115 </span>                :         
-<span class="lineNum">     116 </span>                :         // Serialise back to strings
-<span class="lineNum">     117 </span><span class="lineCov">              1 :         PatchList&lt;string, string&gt; change1;</span>
-<span class="lineNum">     118 </span><span class="lineCov">              1 :         intChange.output(patchIntToString(pkgid, voc, tagcoll::inserter(change1)));</span>
-<span class="lineNum">     119 </span><span class="lineCov">              1 :         assert_eq(change1.size(), 1u);</span>
-<span class="lineNum">     120 </span><span class="lineCov">              2 :         assert_eq(change1.begin()-&gt;first, string(&quot;debtags&quot;));</span>
-<span class="lineNum">     121 </span><span class="lineCov">              2 :         assert_eq(change1.begin()-&gt;second.item, string(&quot;debtags&quot;));</span>
-<span class="lineNum">     122 </span><span class="lineCov">              2 :         assert_eq(change1.begin()-&gt;second.added.size(), 1u);</span>
-<span class="lineNum">     123 </span><span class="lineCov">              2 :         assert_eq(*change1.begin()-&gt;second.added.begin(), string(&quot;use::gameplaying&quot;));</span>
-<span class="lineNum">     124 </span><span class="lineCov">              2 :         assert_eq(change1.begin()-&gt;second.removed.size(), 1u);</span>
-<span class="lineNum">     125 </span><span class="lineCov">              2 :         assert_eq(*change1.begin()-&gt;second.removed.begin(), string(&quot;use::editing&quot;));</span>
-<span class="lineNum">     126 </span><span class="lineCov">              1 : }</span>
-<span class="lineNum">     127 </span>                : 
-<span class="lineNum">     128 </span>                : };
-<span class="lineNum">     129 </span>                : 
-<span class="lineNum">     130 </span>                : #include &lt;tagcoll/coll/simple.tcc&gt;
-<span class="lineNum">     131 </span>                : #include &lt;tagcoll/patch.tcc&gt;
-<span class="lineNum">     132 </span>                : 
-<span class="lineNum">     133 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/debtags/maint/sourcedir.cc.gcov.html b/rep/ept/debtags/maint/sourcedir.cc.gcov.html
deleted file mode 100644
index 8f0db9e..0000000
--- a/rep/ept/debtags/maint/sourcedir.cc.gcov.html
+++ /dev/null
@@ -1,190 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/debtags/maint/sourcedir.cc</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">ept/debtags/maint</a> - sourcedir.cc</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">57</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">75.4 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">43</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #include &lt;ept/debtags/maint/sourcedir.h&gt;
-<span class="lineNum">       2 </span>                : #include &lt;ept/debtags/maint/vocabularymerger.h&gt;
-<span class="lineNum">       3 </span>                : #include &lt;ept/debtags/maint/path.h&gt;
-<span class="lineNum">       4 </span>                : 
-<span class="lineNum">       5 </span>                : #include &lt;wibble/string.h&gt;
-<span class="lineNum">       6 </span>                : 
-<span class="lineNum">       7 </span>                : #include &lt;tagcoll/input/zlib.h&gt;
-<span class="lineNum">       8 </span>                : #include &lt;tagcoll/input/stdio.h&gt;
-<span class="lineNum">       9 </span>                : 
-<span class="lineNum">      10 </span>                : using namespace wibble;
-<span class="lineNum">      11 </span>                : 
-<span class="lineNum">      12 </span>                : namespace ept {
-<span class="lineNum">      13 </span>                : namespace debtags {
-<span class="lineNum">      14 </span>                : 
-<span class="lineNum">      15 </span><span class="lineCov">            802 : SourceDir::FileType SourceDir::fileType(const std::string&amp; name)</span>
-<span class="lineNum">      16 </span>                : {
-<span class="lineNum">      17 </span><span class="lineCov">            802 :         if (name[0] == '.') return SKIP;</span>
-<span class="lineNum">      18 </span>                : 
-<span class="lineNum">      19 </span>                :         // Filenames need to be at least 5 characters long (one char plus
-<span class="lineNum">      20 </span>                :         // extension)
-<span class="lineNum">      21 </span><span class="lineCov">            622 :         if (name.size() &lt;= 4) return SKIP;</span>
-<span class="lineNum">      22 </span>                : 
-<span class="lineNum">      23 </span>                :         // Only look at .voc and .tag files
-<span class="lineNum">      24 </span><span class="lineCov">            542 :         std::string ext(name, name.size() - 4);</span>
-<span class="lineNum">      25 </span><span class="lineCov">            542 :         if (ext == &quot;.voc&quot;)</span>
-<span class="lineNum">      26 </span><span class="lineCov">             80 :                 return VOC;</span>
-<span class="lineNum">      27 </span><span class="lineCov">            462 :         if (ext == &quot;.tag&quot;)</span>
-<span class="lineNum">      28 </span><span class="lineCov">             80 :                 return TAG;</span>
-<span class="lineNum">      29 </span>                : 
-<span class="lineNum">      30 </span>                :         // Now look for compressed files, which must have the 4 character extension
-<span class="lineNum">      31 </span>                :         // plus the 3 chars of '.gz'
-<span class="lineNum">      32 </span><span class="lineCov">            382 :         if (name.size() &lt;= 7) return SKIP;</span>
-<span class="lineNum">      33 </span>                : 
-<span class="lineNum">      34 </span><span class="lineCov">            302 :         ext = name.substr(name.size() - 7);</span>
-<span class="lineNum">      35 </span><span class="lineCov">            302 :         if (ext == &quot;.voc.gz&quot;)</span>
-<span class="lineNum">      36 </span><span class="lineNoCov">              0 :                 return VOCGZ;</span>
-<span class="lineNum">      37 </span><span class="lineCov">            302 :         if (ext == &quot;.tag.gz&quot;)</span>
-<span class="lineNum">      38 </span><span class="lineNoCov">              0 :                 return TAGGZ;</span>
-<span class="lineNum">      39 </span>                : 
-<span class="lineNum">      40 </span><span class="lineCov">            302 :         return SKIP;</span>
-<span class="lineNum">      41 </span>                : }
-<span class="lineNum">      42 </span>                : 
-<span class="lineNum">      43 </span><span class="lineCov">             20 : time_t SourceDir::timestamp()</span>
-<span class="lineNum">      44 </span>                : {
-<span class="lineNum">      45 </span><span class="lineCov">             20 :         if (!valid()) return 0;</span>
-<span class="lineNum">      46 </span>                : 
-<span class="lineNum">      47 </span><span class="lineCov">             20 :         time_t max = 0;</span>
-<span class="lineNum">      48 </span><span class="lineCov">            200 :         for (const_iterator d = begin(); d != end(); ++d)</span>
-<span class="lineNum">      49 </span>                :         {
-<span class="lineNum">      50 </span><span class="lineCov">            180 :                 FileType type = fileType(d-&gt;d_name);</span>
-<span class="lineNum">      51 </span><span class="lineCov">            180 :                 if (type == SKIP) continue;</span>
-<span class="lineNum">      52 </span>                : 
-<span class="lineNum">      53 </span><span class="lineCov">             36 :                 time_t ts = Path::timestamp(str::joinpath(path(), d-&gt;d_name));</span>
-<span class="lineNum">      54 </span><span class="lineCov">             54 :                 if (ts &gt; max) max = ts;</span>
-<span class="lineNum">      55 </span><span class="lineCov">             20 :         }</span>
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span><span class="lineCov">             20 :         return max;</span>
-<span class="lineNum">      58 </span>                : }
-<span class="lineNum">      59 </span>                : 
-<span class="lineNum">      60 </span><span class="lineCov">             62 : time_t SourceDir::vocTimestamp()</span>
-<span class="lineNum">      61 </span>                : {
-<span class="lineNum">      62 </span><span class="lineCov">             62 :         if (!valid()) return 0;</span>
-<span class="lineNum">      63 </span>                : 
-<span class="lineNum">      64 </span><span class="lineCov">             60 :         time_t max = 0;</span>
-<span class="lineNum">      65 </span><span class="lineCov">            632 :         for (const_iterator d = begin(); d != end(); ++d)</span>
-<span class="lineNum">      66 </span>                :         {
-<span class="lineNum">      67 </span><span class="lineCov">            572 :                 FileType type = fileType(d-&gt;d_name);</span>
-<span class="lineNum">      68 </span><span class="lineCov">           1086 :                 if (type != VOC and type != VOCGZ) continue;</span>
-<span class="lineNum">      69 </span>                : 
-<span class="lineNum">      70 </span><span class="lineCov">             58 :                 time_t ts = Path::timestamp(str::joinpath(path(), d-&gt;d_name));</span>
-<span class="lineNum">      71 </span><span class="lineCov">            116 :                 if (ts &gt; max) max = ts;</span>
-<span class="lineNum">      72 </span><span class="lineCov">             60 :         }</span>
-<span class="lineNum">      73 </span>                : 
-<span class="lineNum">      74 </span><span class="lineCov">             60 :         return max;</span>
-<span class="lineNum">      75 </span>                : }
-<span class="lineNum">      76 </span>                : 
-<span class="lineNum">      77 </span><span class="lineNoCov">              0 : time_t SourceDir::tagTimestamp()</span>
-<span class="lineNum">      78 </span>                : {
-<span class="lineNum">      79 </span><span class="lineNoCov">              0 :         if (!valid()) return 0;</span>
-<span class="lineNum">      80 </span>                : 
-<span class="lineNum">      81 </span><span class="lineNoCov">              0 :         time_t max = 0;</span>
-<span class="lineNum">      82 </span><span class="lineNoCov">              0 :         for (const_iterator d = begin(); d != end(); ++d)</span>
-<span class="lineNum">      83 </span>                :         {
-<span class="lineNum">      84 </span><span class="lineNoCov">              0 :                 FileType type = fileType(d-&gt;d_name);</span>
-<span class="lineNum">      85 </span><span class="lineNoCov">              0 :                 if (type != TAG and type != TAGGZ) continue;</span>
-<span class="lineNum">      86 </span>                : 
-<span class="lineNum">      87 </span><span class="lineNoCov">              0 :                 time_t ts = Path::timestamp(str::joinpath(path(), d-&gt;d_name));</span>
-<span class="lineNum">      88 </span><span class="lineNoCov">              0 :                 if (ts &gt; max) max = ts;</span>
-<span class="lineNum">      89 </span><span class="lineNoCov">              0 :         }</span>
-<span class="lineNum">      90 </span>                : 
-<span class="lineNum">      91 </span><span class="lineNoCov">              0 :         return max;</span>
-<span class="lineNum">      92 </span>                : }
-<span class="lineNum">      93 </span>                : 
-<span class="lineNum">      94 </span><span class="lineCov">              6 : void SourceDir::readVocabularies(VocabularyMerger&amp; out)</span>
-<span class="lineNum">      95 </span>                : {
-<span class="lineNum">      96 </span><span class="lineCov">              6 :         if (!valid()) return;</span>
-<span class="lineNum">      97 </span>                : 
-<span class="lineNum">      98 </span><span class="lineCov">             32 :         for (const_iterator d = begin(); d != end(); ++d)</span>
-<span class="lineNum">      99 </span>                :         {
-<span class="lineNum">     100 </span><span class="lineCov">             26 :                 FileType type = fileType(d-&gt;d_name);</span>
-<span class="lineNum">     101 </span><span class="lineCov">             26 :                 if (type == VOC)</span>
-<span class="lineNum">     102 </span>                :                 {
-<span class="lineNum">     103 </span>                :                         // Read uncompressed data
-<span class="lineNum">     104 </span><span class="lineCov">              2 :                         tagcoll::input::Stdio in(str::joinpath(path(), d-&gt;d_name));</span>
-<span class="lineNum">     105 </span>                : 
-<span class="lineNum">     106 </span>                :                         // Read the vocabulary
-<span class="lineNum">     107 </span><span class="lineCov">              4 :                         out.read(in);</span>
-<span class="lineNum">     108 </span>                :                 }
-<span class="lineNum">     109 </span><span class="lineCov">             24 :                 else if (type == VOCGZ)</span>
-<span class="lineNum">     110 </span>                :                 {
-<span class="lineNum">     111 </span>                :                         // Read compressed data
-<span class="lineNum">     112 </span><span class="lineNoCov">              0 :                         tagcoll::input::Zlib in(str::joinpath(path(), d-&gt;d_name));</span>
-<span class="lineNum">     113 </span>                : 
-<span class="lineNum">     114 </span>                :                         // Read the vocabulary
-<span class="lineNum">     115 </span><span class="lineNoCov">              0 :                         out.read(in);</span>
-<span class="lineNum">     116 </span>                :                 }
-<span class="lineNum">     117 </span><span class="lineCov">              6 :         }</span>
-<span class="lineNum">     118 </span>                : }
-<span class="lineNum">     119 </span>                : 
-<span class="lineNum">     120 </span>                : }
-<span class="lineNum">     121 </span><span class="lineCov">              6 : }</span>
-<span class="lineNum">     122 </span>                : 
-<span class="lineNum">     123 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/debtags/maint/sourcedir.h.gcov.html b/rep/ept/debtags/maint/sourcedir.h.gcov.html
deleted file mode 100644
index 64aa522..0000000
--- a/rep/ept/debtags/maint/sourcedir.h.gcov.html
+++ /dev/null
@@ -1,141 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/debtags/maint/sourcedir.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">ept/debtags/maint</a> - sourcedir.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">3</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">3</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #ifndef EPT_DEBTAGS_SOURCEDIR_H
-<span class="lineNum">       2 </span>                : #define EPT_DEBTAGS_SOURCEDIR_H
-<span class="lineNum">       3 </span>                : 
-<span class="lineNum">       4 </span>                : /** @file
-<span class="lineNum">       5 </span>                :  * @author Enrico Zini &lt;enrico@enricozini.org&gt;
-<span class="lineNum">       6 </span>                :  * Debtags data source directory access
-<span class="lineNum">       7 </span>                :  */
-<span class="lineNum">       8 </span>                : 
-<span class="lineNum">       9 </span>                : /*
-<span class="lineNum">      10 </span>                :  * Copyright (C) 2003,2004,2005,2006,2007  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">      11 </span>                :  *
-<span class="lineNum">      12 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">      13 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">      14 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">      15 </span>                :  * (at your option) any later version.
-<span class="lineNum">      16 </span>                :  *
-<span class="lineNum">      17 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      18 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      19 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      20 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      21 </span>                :  *
-<span class="lineNum">      22 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      23 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      24 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      25 </span>                :  */
-<span class="lineNum">      26 </span>                : 
-<span class="lineNum">      27 </span>                : #include &lt;wibble/sys/fs.h&gt;
-<span class="lineNum">      28 </span>                : #include &lt;string&gt;
-<span class="lineNum">      29 </span>                : 
-<span class="lineNum">      30 </span>                : namespace ept {
-<span class="lineNum">      31 </span>                : namespace debtags {
-<span class="lineNum">      32 </span>                : 
-<span class="lineNum">      33 </span>                : class VocabularyMerger;
-<span class="lineNum">      34 </span>                : 
-<span class="lineNum">      35 </span>                : /**
-<span class="lineNum">      36 </span>                :  * Access a directory containing Debtags data files
-<span class="lineNum">      37 </span>                :  */
-<span class="lineNum">      38 </span>                : class SourceDir : public wibble::sys::fs::Directory
-<span class="lineNum">      39 </span><span class="lineCov">             82 : {</span>
-<span class="lineNum">      40 </span>                : protected:
-<span class="lineNum">      41 </span>                :         enum FileType { SKIP, TAG, VOC, TAGGZ, VOCGZ };
-<span class="lineNum">      42 </span>                : 
-<span class="lineNum">      43 </span>                :         // Check if a file name is a tag file, a vocabulary file or a file to skip.
-<span class="lineNum">      44 </span>                :         // Please notice that it works on file names, not paths.
-<span class="lineNum">      45 </span>                :         FileType fileType(const std::string&amp; name);
-<span class="lineNum">      46 </span>                : 
-<span class="lineNum">      47 </span>                : public:
-<span class="lineNum">      48 </span><span class="lineCov">             82 :         SourceDir(const std::string&amp; path) : Directory(path) {}</span>
-<span class="lineNum">      49 </span>                : 
-<span class="lineNum">      50 </span>                :         /// Return the time of the newest file in the source directory
-<span class="lineNum">      51 </span>                :         time_t timestamp();
-<span class="lineNum">      52 </span>                : 
-<span class="lineNum">      53 </span>                :         /// Return the time of the newest vocabulary file in the source directory
-<span class="lineNum">      54 </span>                :         time_t vocTimestamp();
-<span class="lineNum">      55 </span>                : 
-<span class="lineNum">      56 </span>                :         /// Return the time of the newest tag file in the source directory
-<span class="lineNum">      57 </span>                :         time_t tagTimestamp();
-<span class="lineNum">      58 </span>                : 
-<span class="lineNum">      59 </span>                :         /// Read the tag files in the directory and output their content to out
-<span class="lineNum">      60 </span>                :         template&lt;typename OUT&gt;
-<span class="lineNum">      61 </span><span class="lineCov">              4 :         void readTags(OUT out);</span>
-<span class="lineNum">      62 </span>                : 
-<span class="lineNum">      63 </span>                :         /**
-<span class="lineNum">      64 </span>                :          * Read the vocabulary files in the directory and output their content to
-<span class="lineNum">      65 </span>                :          * out
-<span class="lineNum">      66 </span>                :          */
-<span class="lineNum">      67 </span>                :         void readVocabularies(VocabularyMerger&amp; out);
-<span class="lineNum">      68 </span>                : };
-<span class="lineNum">      69 </span>                : 
-<span class="lineNum">      70 </span>                : }
-<span class="lineNum">      71 </span>                : }
-<span class="lineNum">      72 </span>                : 
-<span class="lineNum">      73 </span>                : // vim:set ts=4 sw=4:
-<span class="lineNum">      74 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/debtags/maint/sourcedir.tcc.gcov.html b/rep/ept/debtags/maint/sourcedir.tcc.gcov.html
deleted file mode 100644
index 429ec73..0000000
--- a/rep/ept/debtags/maint/sourcedir.tcc.gcov.html
+++ /dev/null
@@ -1,118 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/debtags/maint/sourcedir.tcc</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">ept/debtags/maint</a> - sourcedir.tcc</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">9</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">88.9 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">8</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #ifndef EPT_DEBTAGS_SOURCEDIR_TCC
-<span class="lineNum">       2 </span>                : #define EPT_DEBTAGS_SOURCEDIR_TCC
-<span class="lineNum">       3 </span>                : 
-<span class="lineNum">       4 </span>                : /** @file
-<span class="lineNum">       5 </span>                :  * @author Enrico Zini &lt;enrico@enricozini.org&gt;
-<span class="lineNum">       6 </span>                :  * Debtags data source directory access
-<span class="lineNum">       7 </span>                :  */
-<span class="lineNum">       8 </span>                : #include &lt;ept/debtags/maint/sourcedir.h&gt;
-<span class="lineNum">       9 </span>                : 
-<span class="lineNum">      10 </span>                : #include &lt;tagcoll/input/zlib.h&gt;
-<span class="lineNum">      11 </span>                : #include &lt;tagcoll/input/stdio.h&gt;
-<span class="lineNum">      12 </span>                : 
-<span class="lineNum">      13 </span>                : namespace ept {
-<span class="lineNum">      14 </span>                : namespace debtags {
-<span class="lineNum">      15 </span>                : 
-<span class="lineNum">      16 </span>                : template&lt;typename OUT&gt;
-<span class="lineNum">      17 </span>                : void SourceDir::readTags(OUT out)
-<span class="lineNum">      18 </span>                : {
-<span class="lineNum">      19 </span><span class="lineCov">              4 :         if (!valid()) return;</span>
-<span class="lineNum">      20 </span>                : 
-<span class="lineNum">      21 </span><span class="lineCov">             28 :         for (const_iterator d = begin(); d != end(); ++d)</span>
-<span class="lineNum">      22 </span>                :         {
-<span class="lineNum">      23 </span><span class="lineCov">             24 :                 FileType type = fileType(d-&gt;d_name);</span>
-<span class="lineNum">      24 </span><span class="lineCov">             24 :                 if (type == TAG)</span>
-<span class="lineNum">      25 </span>                :                 {
-<span class="lineNum">      26 </span>                :                         // Read uncompressed data
-<span class="lineNum">      27 </span><span class="lineCov">              2 :                         tagcoll::input::Stdio in(path() + &quot;/&quot; + d-&gt;d_name);</span>
-<span class="lineNum">      28 </span>                : 
-<span class="lineNum">      29 </span>                :                         // Read the collection
-<span class="lineNum">      30 </span><span class="lineCov">              2 :                         tagcoll::textformat::parse(in, out);</span>
-<span class="lineNum">      31 </span>                :                 }
-<span class="lineNum">      32 </span><span class="lineCov">             22 :                 else if (type == TAGGZ)</span>
-<span class="lineNum">      33 </span>                :                 {
-<span class="lineNum">      34 </span>                :                         // Read compressed data
-<span class="lineNum">      35 </span><span class="lineNoCov">              0 :                         tagcoll::input::Zlib in(path() + &quot;/&quot; + d-&gt;d_name);</span>
-<span class="lineNum">      36 </span>                : 
-<span class="lineNum">      37 </span>                :                         // Read the collection
-<span class="lineNum">      38 </span><span class="lineCov">              4 :                         tagcoll::textformat::parse(in, out);</span>
-<span class="lineNum">      39 </span>                :                 }
-<span class="lineNum">      40 </span>                :         }
-<span class="lineNum">      41 </span>                : }
-<span class="lineNum">      42 </span>                : 
-<span class="lineNum">      43 </span>                : }
-<span class="lineNum">      44 </span>                : }
-<span class="lineNum">      45 </span>                : 
-<span class="lineNum">      46 </span>                : #include &lt;tagcoll/TextFormat.tcc&gt;
-<span class="lineNum">      47 </span>                : 
-<span class="lineNum">      48 </span>                : #endif
-<span class="lineNum">      49 </span>                : 
-<span class="lineNum">      50 </span>                : // -*- C++ -*-
-<span class="lineNum">      51 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/debtags/maint/vocabularyindexer.cc.gcov.html b/rep/ept/debtags/maint/vocabularyindexer.cc.gcov.html
deleted file mode 100644
index bf21509..0000000
--- a/rep/ept/debtags/maint/vocabularyindexer.cc.gcov.html
+++ /dev/null
@@ -1,262 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/debtags/maint/vocabularyindexer.cc</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">ept/debtags/maint</a> - vocabularyindexer.cc</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">94</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">69.1 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">65</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #include &lt;ept/debtags/maint/vocabularyindexer.h&gt;
-<span class="lineNum">       2 </span>                : #include &lt;ept/debtags/vocabulary.h&gt;
-<span class="lineNum">       3 </span>                : #include &lt;ept/debtags/maint/vocabularymerger.h&gt;
-<span class="lineNum">       4 </span>                : #include &lt;ept/debtags/maint/path.h&gt;
-<span class="lineNum">       5 </span>                : 
-<span class="lineNum">       6 </span>                : namespace ept {
-<span class="lineNum">       7 </span>                : namespace debtags {
-<span class="lineNum">       8 </span>                : 
-<span class="lineNum">       9 </span><span class="lineCov">             31 : VocabularyIndexer::VocabularyIndexer()</span>
-<span class="lineNum">      10 </span><span class="lineCov">             31 :         : mainSource(Path::debtagsSourceDir()), userSource(Path::debtagsUserSourceDir())</span>
-<span class="lineNum">      11 </span>                : {
-<span class="lineNum">      12 </span><span class="lineCov">             31 :         rescan();</span>
-<span class="lineNum">      13 </span><span class="lineCov">             31 : }</span>
-<span class="lineNum">      14 </span>                : 
-<span class="lineNum">      15 </span><span class="lineCov">             31 : void VocabularyIndexer::rescan()</span>
-<span class="lineNum">      16 </span>                : {
-<span class="lineNum">      17 </span><span class="lineCov">             31 :         ts_main_src = mainSource.vocTimestamp();</span>
-<span class="lineNum">      18 </span><span class="lineCov">             31 :         ts_user_src = userSource.vocTimestamp();</span>
-<span class="lineNum">      19 </span><span class="lineCov">             31 :         ts_main_voc = Path::timestamp(Path::vocabulary());</span>
-<span class="lineNum">      20 </span><span class="lineCov">             62 :         ts_main_idx = Path::timestamp(Path::vocabularyIndex());</span>
-<span class="lineNum">      21 </span><span class="lineCov">             62 :         ts_user_voc = Path::timestamp(Path::userVocabulary());</span>
-<span class="lineNum">      22 </span><span class="lineCov">             62 :         ts_user_idx = Path::timestamp(Path::userVocabularyIndex());</span>
-<span class="lineNum">      23 </span><span class="lineCov">             31 : }</span>
-<span class="lineNum">      24 </span>                : 
-<span class="lineNum">      25 </span><span class="lineCov">             31 : bool VocabularyIndexer::needsRebuild() const</span>
-<span class="lineNum">      26 </span>                : {
-<span class="lineNum">      27 </span>                :         // If there are no indexes of any kind, then we need rebuilding
-<span class="lineNum">      28 </span><span class="lineCov">             31 :         if (ts_user_voc == 0 &amp;&amp; ts_user_idx == 0 &amp;&amp; ts_main_voc == 0 &amp;&amp; ts_main_idx == 0)</span>
-<span class="lineNum">      29 </span><span class="lineCov">              3 :                 return true;</span>
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                :         // If the user index is ok, then we are fine
-<span class="lineNum">      32 </span><span class="lineCov">             28 :         if (ts_user_voc &gt;= sourceTimestamp() &amp;&amp; ts_user_idx &gt;= sourceTimestamp())</span>
-<span class="lineNum">      33 </span><span class="lineCov">             28 :                 return false;</span>
-<span class="lineNum">      34 </span>                : 
-<span class="lineNum">      35 </span>                :         // If there are user sources, then we cannot use the system index
-<span class="lineNum">      36 </span><span class="lineNoCov">              0 :         if (ts_user_src &gt; 0)</span>
-<span class="lineNum">      37 </span><span class="lineNoCov">              0 :                 return true;</span>
-<span class="lineNum">      38 </span>                : 
-<span class="lineNum">      39 </span>                :         // If there are no user sources, then we can fallback on the system
-<span class="lineNum">      40 </span>                :         // indexes in case the user indexes are not up to date
-<span class="lineNum">      41 </span><span class="lineNoCov">              0 :         if (ts_main_voc &gt;= sourceTimestamp() &amp;&amp; ts_main_idx &gt;= sourceTimestamp())</span>
-<span class="lineNum">      42 </span><span class="lineNoCov">              0 :                 return false;</span>
-<span class="lineNum">      43 </span>                : 
-<span class="lineNum">      44 </span><span class="lineNoCov">              0 :         return true;</span>
-<span class="lineNum">      45 </span>                : }
-<span class="lineNum">      46 </span>                : 
-<span class="lineNum">      47 </span><span class="lineCov">             31 : bool VocabularyIndexer::userIndexIsRedundant() const</span>
-<span class="lineNum">      48 </span>                : {
-<span class="lineNum">      49 </span>                :         // If there is no user index, then it is not redundant
-<span class="lineNum">      50 </span><span class="lineCov">             31 :         if (ts_user_voc == 0 &amp;&amp; ts_user_idx == 0)</span>
-<span class="lineNum">      51 </span><span class="lineCov">              2 :                 return false;</span>
-<span class="lineNum">      52 </span>                : 
-<span class="lineNum">      53 </span>                :         // If we have user sources, then the user index is never redundant
-<span class="lineNum">      54 </span><span class="lineCov">             29 :         if (ts_user_src &gt; 0)</span>
-<span class="lineNum">      55 </span><span class="lineCov">             29 :                 return false;</span>
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span>                :         // If the system index is not up to date, then the user index is not
-<span class="lineNum">      58 </span>                :         // redundant
-<span class="lineNum">      59 </span><span class="lineNoCov">              0 :         if (ts_main_voc &lt; sourceTimestamp() || ts_main_idx &lt; sourceTimestamp())</span>
-<span class="lineNum">      60 </span><span class="lineNoCov">              0 :                 return false;</span>
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span><span class="lineNoCov">              0 :         return true;</span>
-<span class="lineNum">      63 </span>                : }
-<span class="lineNum">      64 </span>                : 
-<span class="lineNum">      65 </span><span class="lineCov">              3 : bool VocabularyIndexer::rebuild(const std::string&amp; vocfname, const std::string&amp; idxfname)</span>
-<span class="lineNum">      66 </span>                : {
-<span class="lineNum">      67 </span>                :         using namespace tagcoll;
-<span class="lineNum">      68 </span>                : 
-<span class="lineNum">      69 </span>                :         // Create the master MMap index
-<span class="lineNum">      70 </span><span class="lineCov">              3 :         diskindex::MasterMMapIndexer master(idxfname);</span>
-<span class="lineNum">      71 </span>                : 
-<span class="lineNum">      72 </span>                :         // Read and merge vocabulary data
-<span class="lineNum">      73 </span><span class="lineCov">              3 :         VocabularyMerger voc;</span>
-<span class="lineNum">      74 </span><span class="lineCov">              3 :         mainSource.readVocabularies(voc);</span>
-<span class="lineNum">      75 </span><span class="lineCov">              3 :         userSource.readVocabularies(voc);</span>
-<span class="lineNum">      76 </span>                : 
-<span class="lineNum">      77 </span><span class="lineCov">              3 :         if (voc.empty())</span>
-<span class="lineNum">      78 </span><span class="lineCov">              2 :                 return false;</span>
-<span class="lineNum">      79 </span>                :                 //throw wibble::exception::Consistency(&quot;Reading debtags sources from &quot; + mainSource.path() + &quot; and &quot; + userSource.path(), &quot;Unable to find any vocabulary data&quot;);
-<span class="lineNum">      80 </span>                : 
-<span class="lineNum">      81 </span>                :         // Write the merged vocabulary, and generate tag and facet IDs as a side
-<span class="lineNum">      82 </span>                :         // effect
-<span class="lineNum">      83 </span><span class="lineCov">              1 :         std::string tmpvocfname = vocfname + &quot;.tmp&quot;;</span>
-<span class="lineNum">      84 </span><span class="lineCov">              1 :         voc.write(tmpvocfname);</span>
-<span class="lineNum">      85 </span>                : 
-<span class="lineNum">      86 </span>                :         // Add the indexed vocabulary data to the master index
-<span class="lineNum">      87 </span>                :         // 0: facets
-<span class="lineNum">      88 </span><span class="lineCov">              1 :         master.append(voc.facetIndexer());</span>
-<span class="lineNum">      89 </span>                :         // 1: tags
-<span class="lineNum">      90 </span><span class="lineCov">              1 :         master.append(voc.tagIndexer());</span>
-<span class="lineNum">      91 </span>                : 
-<span class="lineNum">      92 </span><span class="lineCov">              1 :         if (rename(tmpvocfname.c_str(), vocfname.c_str()) == -1)</span>
-<span class="lineNum">      93 </span><span class="lineNoCov">              0 :                 throw wibble::exception::System(&quot;renaming &quot; + tmpvocfname + &quot; to &quot; + vocfname);</span>
-<span class="lineNum">      94 </span>                : 
-<span class="lineNum">      95 </span><span class="lineCov">              1 :         master.commit();</span>
-<span class="lineNum">      96 </span><span class="lineCov">              1 :         return true;</span>
-<span class="lineNum">      97 </span>                : }
-<span class="lineNum">      98 </span>                : 
-<span class="lineNum">      99 </span><span class="lineCov">             31 : bool VocabularyIndexer::rebuildIfNeeded()</span>
-<span class="lineNum">     100 </span>                : {
-<span class="lineNum">     101 </span><span class="lineCov">             31 :         if (needsRebuild())</span>
-<span class="lineNum">     102 </span>                :         {
-<span class="lineNum">     103 </span>                :                 // Decide if we rebuild the user index or the system index
-<span class="lineNum">     104 </span>                : 
-<span class="lineNum">     105 </span><span class="lineCov">              3 :                 if (ts_user_src == 0 &amp;&amp; Path::access(Path::debtagsIndexDir(), W_OK) == 0)</span>
-<span class="lineNum">     106 </span>                :                 {
-<span class="lineNum">     107 </span>                :                         // There are no user sources and we can write to the system index
-<span class="lineNum">     108 </span>                :                         // directory: rebuild the system index
-<span class="lineNum">     109 </span><span class="lineCov">              1 :                         if (!rebuild(Path::vocabulary(), Path::vocabularyIndex()))</span>
-<span class="lineNum">     110 </span><span class="lineCov">              1 :                                 return false;</span>
-<span class="lineNum">     111 </span><span class="lineNoCov">              0 :                         ts_main_voc = Path::timestamp(Path::vocabulary());</span>
-<span class="lineNum">     112 </span><span class="lineNoCov">              0 :                         ts_main_idx = Path::timestamp(Path::vocabularyIndex());</span>
-<span class="lineNum">     113 </span><span class="lineNoCov">              0 :                         if (Path::vocabulary() == Path::userVocabulary())</span>
-<span class="lineNum">     114 </span><span class="lineNoCov">              0 :                                 ts_user_voc = ts_main_voc;</span>
-<span class="lineNum">     115 </span><span class="lineNoCov">              0 :                         if (Path::vocabularyIndex() == Path::userVocabularyIndex())</span>
-<span class="lineNum">     116 </span><span class="lineNoCov">              0 :                                 ts_user_idx = ts_main_idx;</span>
-<span class="lineNum">     117 </span>                :                 } else {
-<span class="lineNum">     118 </span><span class="lineCov">              2 :                         wibble::sys::fs::mkFilePath(Path::userVocabulary());</span>
-<span class="lineNum">     119 </span><span class="lineCov">              4 :                         wibble::sys::fs::mkFilePath(Path::userVocabularyIndex());</span>
-<span class="lineNum">     120 </span><span class="lineCov">              4 :                         if (!rebuild(Path::userVocabulary(), Path::userVocabularyIndex()))</span>
-<span class="lineNum">     121 </span><span class="lineCov">              1 :                                 return false;</span>
-<span class="lineNum">     122 </span><span class="lineCov">              1 :                         ts_user_voc = Path::timestamp(Path::userVocabulary());</span>
-<span class="lineNum">     123 </span><span class="lineCov">              2 :                         ts_user_idx = Path::timestamp(Path::userVocabularyIndex());</span>
-<span class="lineNum">     124 </span>                :                 }
-<span class="lineNum">     125 </span><span class="lineCov">              1 :                 return true;</span>
-<span class="lineNum">     126 </span>                :         }
-<span class="lineNum">     127 </span><span class="lineCov">             28 :         return false;</span>
-<span class="lineNum">     128 </span>                : }
-<span class="lineNum">     129 </span>                : 
-<span class="lineNum">     130 </span><span class="lineCov">             31 : bool VocabularyIndexer::deleteRedundantUserIndex()</span>
-<span class="lineNum">     131 </span>                : {
-<span class="lineNum">     132 </span><span class="lineCov">             31 :         if (userIndexIsRedundant())</span>
-<span class="lineNum">     133 </span>                :         {
-<span class="lineNum">     134 </span>                :                 // Delete the user indexes if they exist
-<span class="lineNum">     135 </span><span class="lineNoCov">              0 :                 if (Path::vocabulary() != Path::userVocabulary())</span>
-<span class="lineNum">     136 </span>                :                 {
-<span class="lineNum">     137 </span><span class="lineNoCov">              0 :                         unlink(Path::userVocabulary().c_str());</span>
-<span class="lineNum">     138 </span><span class="lineNoCov">              0 :                         ts_user_voc = 0;</span>
-<span class="lineNum">     139 </span>                :                 }
-<span class="lineNum">     140 </span><span class="lineNoCov">              0 :                 if (Path::vocabularyIndex() != Path::userVocabularyIndex())</span>
-<span class="lineNum">     141 </span>                :                 {
-<span class="lineNum">     142 </span><span class="lineNoCov">              0 :                         unlink(Path::userVocabularyIndex().c_str());</span>
-<span class="lineNum">     143 </span><span class="lineNoCov">              0 :                         ts_user_idx = 0;</span>
-<span class="lineNum">     144 </span>                :                 }
-<span class="lineNum">     145 </span><span class="lineNoCov">              0 :                 return true;</span>
-<span class="lineNum">     146 </span>                :         }
-<span class="lineNum">     147 </span><span class="lineCov">             31 :         return false;</span>
-<span class="lineNum">     148 </span>                : }
-<span class="lineNum">     149 </span>                : 
-<span class="lineNum">     150 </span><span class="lineCov">             31 : bool VocabularyIndexer::getUpToDateVocabulary(std::string&amp; vocfname, std::string&amp; idxfname)</span>
-<span class="lineNum">     151 </span>                : {
-<span class="lineNum">     152 </span>                :         // If there are no indexes of any kind, then we have nothing to return
-<span class="lineNum">     153 </span><span class="lineCov">             31 :         if (ts_user_voc == 0 &amp;&amp; ts_user_idx == 0 &amp;&amp; ts_main_voc == 0 &amp;&amp; ts_main_idx == 0)</span>
-<span class="lineNum">     154 </span><span class="lineCov">              2 :                 return false;</span>
-<span class="lineNum">     155 </span>                : 
-<span class="lineNum">     156 </span>                :         // If the user index is up to date, use it
-<span class="lineNum">     157 </span><span class="lineCov">             29 :         if (ts_user_voc &gt;= sourceTimestamp() &amp;&amp;</span>
-<span class="lineNum">     158 </span>                :                 ts_user_idx &gt;= sourceTimestamp())
-<span class="lineNum">     159 </span>                :         {
-<span class="lineNum">     160 </span><span class="lineCov">             29 :                 vocfname = Path::userVocabulary();</span>
-<span class="lineNum">     161 </span><span class="lineCov">             58 :                 idxfname = Path::userVocabularyIndex();</span>
-<span class="lineNum">     162 </span><span class="lineCov">             29 :                 return true;</span>
-<span class="lineNum">     163 </span>                :         }
-<span class="lineNum">     164 </span>                : 
-<span class="lineNum">     165 </span>                :         // If the user index is not up to date and we have user sources, we cannot
-<span class="lineNum">     166 </span>                :         // fall back to the system index
-<span class="lineNum">     167 </span><span class="lineNoCov">              0 :         if (ts_user_src != 0)</span>
-<span class="lineNum">     168 </span><span class="lineNoCov">              0 :                 return false;</span>
-<span class="lineNum">     169 </span>                :         
-<span class="lineNum">     170 </span>                :         // Fallback to the system index
-<span class="lineNum">     171 </span><span class="lineNoCov">              0 :         if (ts_main_voc &gt;= sourceTimestamp() &amp;&amp;</span>
-<span class="lineNum">     172 </span>                :                 ts_main_idx &gt;= sourceTimestamp())
-<span class="lineNum">     173 </span>                :         {
-<span class="lineNum">     174 </span><span class="lineNoCov">              0 :                 vocfname = Path::vocabulary();</span>
-<span class="lineNum">     175 </span><span class="lineNoCov">              0 :                 idxfname = Path::vocabularyIndex();</span>
-<span class="lineNum">     176 </span><span class="lineNoCov">              0 :                 return true;</span>
-<span class="lineNum">     177 </span>                :         }
-<span class="lineNum">     178 </span>                :         
-<span class="lineNum">     179 </span><span class="lineNoCov">              0 :         return false;</span>
-<span class="lineNum">     180 </span>                : }
-<span class="lineNum">     181 </span>                : 
-<span class="lineNum">     182 </span>                : 
-<span class="lineNum">     183 </span><span class="lineCov">             31 : bool VocabularyIndexer::obtainWorkingVocabulary(std::string&amp; vocfname, std::string&amp; idxfname)</span>
-<span class="lineNum">     184 </span>                : {
-<span class="lineNum">     185 </span><span class="lineCov">             31 :         VocabularyIndexer v;</span>
-<span class="lineNum">     186 </span>                : 
-<span class="lineNum">     187 </span><span class="lineCov">             31 :         v.rebuildIfNeeded();</span>
-<span class="lineNum">     188 </span><span class="lineCov">             31 :         v.deleteRedundantUserIndex();</span>
-<span class="lineNum">     189 </span><span class="lineCov">             31 :         return v.getUpToDateVocabulary(vocfname, idxfname);</span>
-<span class="lineNum">     190 </span>                : }
-<span class="lineNum">     191 </span>                : 
-<span class="lineNum">     192 </span>                : }
-<span class="lineNum">     193 </span><span class="lineCov">              6 : }</span>
-<span class="lineNum">     194 </span>                : 
-<span class="lineNum">     195 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/debtags/maint/vocabularyindexer.h.gcov.html b/rep/ept/debtags/maint/vocabularyindexer.h.gcov.html
deleted file mode 100644
index 5e8b99f..0000000
--- a/rep/ept/debtags/maint/vocabularyindexer.h.gcov.html
+++ /dev/null
@@ -1,183 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/debtags/maint/vocabularyindexer.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">ept/debtags/maint</a> - vocabularyindexer.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">2</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">2</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #ifndef EPT_DEBTAGS_VOCABULARYINDEXER_H
-<span class="lineNum">       2 </span>                : #define EPT_DEBTAGS_VOCABULARYINDEXER_H
-<span class="lineNum">       3 </span>                : 
-<span class="lineNum">       4 </span>                : /** @file
-<span class="lineNum">       5 </span>                :  * @author Enrico Zini &lt;enrico@enricozini.org&gt;
-<span class="lineNum">       6 </span>                :  * Debtags vocabulary indexer
-<span class="lineNum">       7 </span>                :  */
-<span class="lineNum">       8 </span>                : 
-<span class="lineNum">       9 </span>                : /*
-<span class="lineNum">      10 </span>                :  * Copyright (C) 2003,2004,2005,2006,2007  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">      11 </span>                :  *
-<span class="lineNum">      12 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">      13 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">      14 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">      15 </span>                :  * (at your option) any later version.
-<span class="lineNum">      16 </span>                :  *
-<span class="lineNum">      17 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      18 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      19 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      20 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      21 </span>                :  *
-<span class="lineNum">      22 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      23 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      24 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      25 </span>                :  */
-<span class="lineNum">      26 </span>                : 
-<span class="lineNum">      27 </span>                : #include &lt;ept/debtags/maint/sourcedir.h&gt;
-<span class="lineNum">      28 </span>                : #include &lt;string&gt;
-<span class="lineNum">      29 </span>                : 
-<span class="lineNum">      30 </span>                : namespace ept {
-<span class="lineNum">      31 </span>                : namespace debtags {
-<span class="lineNum">      32 </span>                : 
-<span class="lineNum">      33 </span>                : /**
-<span class="lineNum">      34 </span>                :  * Infrastructure used to rebuild the vocabulary index when needed
-<span class="lineNum">      35 </span>                :  */
-<span class="lineNum">      36 </span>                : struct VocabularyIndexer
-<span class="lineNum">      37 </span><span class="lineCov">             31 : {</span>
-<span class="lineNum">      38 </span>                :         SourceDir mainSource;
-<span class="lineNum">      39 </span>                :         SourceDir userSource;
-<span class="lineNum">      40 </span>                :         time_t ts_main_src;
-<span class="lineNum">      41 </span>                :         time_t ts_user_src;
-<span class="lineNum">      42 </span>                :         time_t ts_main_voc;
-<span class="lineNum">      43 </span>                :         time_t ts_main_idx;
-<span class="lineNum">      44 </span>                :         time_t ts_user_voc;
-<span class="lineNum">      45 </span>                :         time_t ts_user_idx;
-<span class="lineNum">      46 </span>                : 
-<span class="lineNum">      47 </span>                :         /**
-<span class="lineNum">      48 </span>                :          * Get the timestamp of the newest vocabulary data source
-<span class="lineNum">      49 </span>                :          */
-<span class="lineNum">      50 </span><span class="lineCov">            114 :         time_t sourceTimestamp() const { return ts_main_src &lt; ts_user_src ? ts_user_src : ts_main_src; }</span>
-<span class="lineNum">      51 </span>                :         /**
-<span class="lineNum">      52 </span>                :          * Return true if the vocabulary index needs rebuilding
-<span class="lineNum">      53 </span>                :          */
-<span class="lineNum">      54 </span>                :         bool needsRebuild() const;
-<span class="lineNum">      55 </span>                : 
-<span class="lineNum">      56 </span>                :         /**
-<span class="lineNum">      57 </span>                :          * Rebuild the vocabulary index
-<span class="lineNum">      58 </span>                :          * @param vocfname
-<span class="lineNum">      59 </span>                :          *   Full pathname of the merged vocabulary to create
-<span class="lineNum">      60 </span>                :          * @param idxfname
-<span class="lineNum">      61 </span>                :          *   Full pathname of the vocabulary index to create
-<span class="lineNum">      62 </span>                :          */
-<span class="lineNum">      63 </span>                :         bool rebuild(const std::string&amp; vocfname, const std::string&amp; idxfname);
-<span class="lineNum">      64 </span>                : 
-<span class="lineNum">      65 </span>                :         /**
-<span class="lineNum">      66 </span>                :          * Rebuild the vocabulary if needed
-<span class="lineNum">      67 </span>                :          */
-<span class="lineNum">      68 </span>                :         bool rebuildIfNeeded();
-<span class="lineNum">      69 </span>                : 
-<span class="lineNum">      70 </span>                :         /**
-<span class="lineNum">      71 </span>                :          * Get the names of the merged vocabulary and vocabulary index that can be
-<span class="lineNum">      72 </span>                :          * used to access Debtags vocabulary data.
-<span class="lineNum">      73 </span>                :          *
-<span class="lineNum">      74 </span>                :          * The system or the user index will be returned according to which one is
-<span class="lineNum">      75 </span>                :          * up to date.
-<span class="lineNum">      76 </span>                :          */
-<span class="lineNum">      77 </span>                :         bool getUpToDateVocabulary(std::string&amp; vocfname, std::string&amp; idxfname);
-<span class="lineNum">      78 </span>                : 
-<span class="lineNum">      79 </span>                :         /**
-<span class="lineNum">      80 </span>                :          * Returns true if the index in the user home directory is redundant and
-<span class="lineNum">      81 </span>                :          * can be deleted.
-<span class="lineNum">      82 </span>                :          *
-<span class="lineNum">      83 </span>                :          * The user index is redundant if the system index is up to date.
-<span class="lineNum">      84 </span>                :          */
-<span class="lineNum">      85 </span>                :         bool userIndexIsRedundant() const;
-<span class="lineNum">      86 </span>                : 
-<span class="lineNum">      87 </span>                :         /**
-<span class="lineNum">      88 </span>                :          * Deletes the user index if it is redundant
-<span class="lineNum">      89 </span>                :          */
-<span class="lineNum">      90 </span>                :         bool deleteRedundantUserIndex();
-<span class="lineNum">      91 </span>                : 
-<span class="lineNum">      92 </span>                :         /**
-<span class="lineNum">      93 </span>                :          * Rescan the various timestamps
-<span class="lineNum">      94 </span>                :          */
-<span class="lineNum">      95 </span>                :         void rescan();
-<span class="lineNum">      96 </span>                : 
-<span class="lineNum">      97 </span>                :         VocabularyIndexer();
-<span class="lineNum">      98 </span>                : 
-<span class="lineNum">      99 </span>                :         /**
-<span class="lineNum">     100 </span>                :          * Get the names of the merged vocabulary and vocabulary index that can be
-<span class="lineNum">     101 </span>                :          * used to access Debtags vocabulary data.
-<span class="lineNum">     102 </span>                :          *
-<span class="lineNum">     103 </span>                :          * The system or the user index will be returned according to which one is
-<span class="lineNum">     104 </span>                :          * up to date.
-<span class="lineNum">     105 </span>                :          *
-<span class="lineNum">     106 </span>                :          * The files will be built or rebuilt if they are missing or outdated.
-<span class="lineNum">     107 </span>                :          */
-<span class="lineNum">     108 </span>                :         static bool obtainWorkingVocabulary(std::string&amp; vocfname, std::string&amp; idxfname);
-<span class="lineNum">     109 </span>                : };
-<span class="lineNum">     110 </span>                : 
-<span class="lineNum">     111 </span>                : 
-<span class="lineNum">     112 </span>                : }
-<span class="lineNum">     113 </span>                : }
-<span class="lineNum">     114 </span>                : 
-<span class="lineNum">     115 </span>                : // vim:set ts=4 sw=4:
-<span class="lineNum">     116 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/debtags/maint/vocabularymerger.cc.gcov.html b/rep/ept/debtags/maint/vocabularymerger.cc.gcov.html
deleted file mode 100644
index 71763e0..0000000
--- a/rep/ept/debtags/maint/vocabularymerger.cc.gcov.html
+++ /dev/null
@@ -1,453 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/debtags/maint/vocabularymerger.cc</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">ept/debtags/maint</a> - vocabularymerger.cc</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">181</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">81.2 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">147</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /*
-<span class="lineNum">       2 </span>                :  * Merge different vocabularies together and create the tag and facet indexes
-<span class="lineNum">       3 </span>                :  *
-<span class="lineNum">       4 </span>                :  * Copyright (C) 2003-2006  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">       5 </span>                :  *
-<span class="lineNum">       6 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">       7 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">       8 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">       9 </span>                :  * (at your option) any later version.
-<span class="lineNum">      10 </span>                :  *
-<span class="lineNum">      11 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      12 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      13 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      14 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      15 </span>                :  *
-<span class="lineNum">      16 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      17 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      18 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      19 </span>                :  */
-<span class="lineNum">      20 </span>                : 
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                : #include &lt;ept/debtags/maint/vocabularymerger.h&gt;
-<span class="lineNum">      23 </span>                : #include &lt;ept/debtags/maint/debdbparser.h&gt;
-<span class="lineNum">      24 </span>                : 
-<span class="lineNum">      25 </span>                : #include &lt;cassert&gt;
-<span class="lineNum">      26 </span>                : #include &lt;cstring&gt;
-<span class="lineNum">      27 </span>                : 
-<span class="lineNum">      28 </span>                : using namespace std;
-<span class="lineNum">      29 </span>                : using namespace tagcoll;
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : namespace ept {
-<span class="lineNum">      32 </span>                : namespace debtags {
-<span class="lineNum">      33 </span>                : 
-<span class="lineNum">      34 </span><span class="lineCov">           1432 : static void writeDebStyleField(FILE* out, const string&amp; name, const string&amp; val) throw ()</span>
-<span class="lineNum">      35 </span>                : {
-<span class="lineNum">      36 </span><span class="lineCov">           1432 :         fprintf(out, &quot;%s: &quot;, name.c_str());</span>
-<span class="lineNum">      37 </span>                : 
-<span class="lineNum">      38 </span>                :         // Properly escape newlines
-<span class="lineNum">      39 </span><span class="lineCov">           1432 :         bool was_nl = false;</span>
-<span class="lineNum">      40 </span><span class="lineCov">          56225 :         for (string::const_iterator s = val.begin(); s != val.end(); s++)</span>
-<span class="lineNum">      41 </span><span class="lineCov">          54793 :                 if (was_nl)</span>
-<span class="lineNum">      42 </span>                :                         // \n\n -&gt; \n .\n
-<span class="lineNum">      43 </span><span class="lineCov">            738 :                         if (*s == '\n')</span>
-<span class="lineNum">      44 </span>                :                         {
-<span class="lineNum">      45 </span><span class="lineCov">            120 :                                 fputc(' ', out);</span>
-<span class="lineNum">      46 </span><span class="lineCov">            120 :                                 fputc('.', out);</span>
-<span class="lineNum">      47 </span><span class="lineCov">            120 :                                 fputc(*s, out);</span>
-<span class="lineNum">      48 </span>                :                         }
-<span class="lineNum">      49 </span>                :                         // \n([^ \t]) -&gt; \n \1
-<span class="lineNum">      50 </span><span class="lineCov">            618 :                         else if (*s != ' ' &amp;&amp; *s != '\t')</span>
-<span class="lineNum">      51 </span>                :                         {
-<span class="lineNum">      52 </span><span class="lineCov">            618 :                                 fputc(' ', out);</span>
-<span class="lineNum">      53 </span><span class="lineCov">            618 :                                 fputc(*s, out);</span>
-<span class="lineNum">      54 </span><span class="lineCov">            618 :                                 was_nl = false;</span>
-<span class="lineNum">      55 </span>                :                         }
-<span class="lineNum">      56 </span>                :                         // \n[ \t] goes unchanged
-<span class="lineNum">      57 </span>                :                         else
-<span class="lineNum">      58 </span>                :                         {
-<span class="lineNum">      59 </span><span class="lineNoCov">              0 :                                 fputc(*s, out);</span>
-<span class="lineNum">      60 </span><span class="lineNoCov">              0 :                                 was_nl = false;</span>
-<span class="lineNum">      61 </span>                :                         }
-<span class="lineNum">      62 </span>                :                 else
-<span class="lineNum">      63 </span><span class="lineCov">          54055 :                         if (*s == '\n')</span>
-<span class="lineNum">      64 </span>                :                         {
-<span class="lineNum">      65 </span><span class="lineCov">            618 :                                 fputc(*s, out);</span>
-<span class="lineNum">      66 </span><span class="lineCov">            618 :                                 was_nl = true;</span>
-<span class="lineNum">      67 </span>                :                         }
-<span class="lineNum">      68 </span>                :                         else
-<span class="lineNum">      69 </span><span class="lineCov">          53437 :                                 fputc(*s, out);</span>
-<span class="lineNum">      70 </span>                : 
-<span class="lineNum">      71 </span><span class="lineCov">           1432 :         fputc('\n', out);</span>
-<span class="lineNum">      72 </span><span class="lineCov">           1432 : }</span>
-<span class="lineNum">      73 </span>                : 
-<span class="lineNum">      74 </span><span class="lineCov">           1865 : VocabularyMerger::TagData&amp; VocabularyMerger::FacetData::obtainTag(const std::string&amp; name)</span>
-<span class="lineNum">      75 </span>                : {
-<span class="lineNum">      76 </span><span class="lineCov">           1865 :         std::map&lt;std::string, TagData&gt;::iterator i = tags.find(name);</span>
-<span class="lineNum">      77 </span><span class="lineCov">           1865 :         if (i == tags.end())</span>
-<span class="lineNum">      78 </span>                :         {
-<span class="lineNum">      79 </span>                :                 // Create the tag if it's missing
-<span class="lineNum">      80 </span><span class="lineCov">           1245 :                 pair&lt;std::map&lt;std::string, TagData&gt;::iterator, bool&gt; res = tags.insert(make_pair&lt;std::string, TagData&gt;(name, TagData()));</span>
-<span class="lineNum">      81 </span><span class="lineCov">           1245 :                 i = res.first;</span>
-<span class="lineNum">      82 </span><span class="lineCov">           1245 :                 i-&gt;second.name = name;</span>
-<span class="lineNum">      83 </span>                :         }
-<span class="lineNum">      84 </span><span class="lineCov">           1865 :         return i-&gt;second;</span>
-<span class="lineNum">      85 </span>                : }
-<span class="lineNum">      86 </span>                : 
-<span class="lineNum">      87 </span><span class="lineCov">           1953 : VocabularyMerger::FacetData&amp; VocabularyMerger::obtainFacet(const std::string&amp; name)</span>
-<span class="lineNum">      88 </span>                : {
-<span class="lineNum">      89 </span><span class="lineCov">           1953 :         std::map&lt;std::string, FacetData&gt;::iterator i = facets.find(name);</span>
-<span class="lineNum">      90 </span><span class="lineCov">           1953 :         if (i == facets.end())</span>
-<span class="lineNum">      91 </span>                :         {
-<span class="lineNum">      92 </span>                :                 // Create the facet if it's missing
-<span class="lineNum">      93 </span><span class="lineCov">             62 :                 pair&lt;std::map&lt;std::string, FacetData&gt;::iterator, bool&gt; res = facets.insert(make_pair&lt;std::string, FacetData&gt;(name, FacetData()));</span>
-<span class="lineNum">      94 </span><span class="lineCov">             62 :                 i = res.first;</span>
-<span class="lineNum">      95 </span><span class="lineCov">             62 :                 i-&gt;second.name = name;</span>
-<span class="lineNum">      96 </span>                :         }
-<span class="lineNum">      97 </span><span class="lineCov">           1953 :         return i-&gt;second;</span>
-<span class="lineNum">      98 </span>                : }
-<span class="lineNum">      99 </span>                : 
-<span class="lineNum">     100 </span><span class="lineCov">           1865 : VocabularyMerger::TagData&amp; VocabularyMerger::obtainTag(const std::string&amp; fullname)</span>
-<span class="lineNum">     101 </span>                : {
-<span class="lineNum">     102 </span><span class="lineCov">           1865 :         size_t p = fullname.find(&quot;::&quot;);</span>
-<span class="lineNum">     103 </span><span class="lineCov">           1865 :         if (p == string::npos)</span>
-<span class="lineNum">     104 </span>                :         {
-<span class="lineNum">     105 </span><span class="lineCov">             28 :                 FacetData&amp; facet = obtainFacet(&quot;legacy&quot;);</span>
-<span class="lineNum">     106 </span><span class="lineCov">             28 :                 return facet.obtainTag(fullname);</span>
-<span class="lineNum">     107 </span>                :         } else {
-<span class="lineNum">     108 </span><span class="lineCov">           1837 :                 FacetData&amp; facet = obtainFacet(fullname.substr(0, p));</span>
-<span class="lineNum">     109 </span><span class="lineCov">           3674 :                 return facet.obtainTag(fullname.substr(p + 2));</span>
-<span class="lineNum">     110 </span>                :         }
-<span class="lineNum">     111 </span>                : }
-<span class="lineNum">     112 </span>                : 
-<span class="lineNum">     113 </span>                : 
-<span class="lineNum">     114 </span><span class="lineCov">              7 : void VocabularyMerger::read(tagcoll::input::Input&amp; input)</span>
-<span class="lineNum">     115 </span>                : {
-<span class="lineNum">     116 </span><span class="lineCov">              7 :         DebDBParser parser(input);</span>
-<span class="lineNum">     117 </span><span class="lineCov">              7 :         DebDBParser::Record record;</span>
-<span class="lineNum">     118 </span>                : 
-<span class="lineNum">     119 </span><span class="lineCov">           1967 :         while (parser.nextRecord(record))</span>
-<span class="lineNum">     120 </span>                :         {
-<span class="lineNum">     121 </span><span class="lineCov">           1953 :                 DebDBParser::Record::const_iterator fi = record.find(&quot;Facet&quot;);</span>
-<span class="lineNum">     122 </span><span class="lineCov">           3906 :                 DebDBParser::Record::const_iterator ti = record.find(&quot;Tag&quot;);</span>
-<span class="lineNum">     123 </span><span class="lineCov">           3906 :                 if (fi != record.end())</span>
-<span class="lineNum">     124 </span>                :                 {
-<span class="lineNum">     125 </span>                :                         // Get the facet record
-<span class="lineNum">     126 </span><span class="lineCov">             88 :                         FacetData&amp; facet = obtainFacet(fi-&gt;second);</span>
-<span class="lineNum">     127 </span>                :                         //fprintf(stderr, &quot;Read facet@%d %.*s\n&quot;, parser.lineNumber(), PFSTR(facet.name));
-<span class="lineNum">     128 </span><span class="lineCov">             88 :                         assert(facet.name == fi-&gt;second);</span>
-<span class="lineNum">     129 </span>                : 
-<span class="lineNum">     130 </span>                :                         // Merge the data
-<span class="lineNum">     131 </span><span class="lineCov">            416 :                         for (DebDBParser::Record::const_iterator i = record.begin();</span>
-<span class="lineNum">     132 </span>                :                                         i != record.end(); i++)
-<span class="lineNum">     133 </span><span class="lineCov">            328 :                                 if (i-&gt;first != &quot;Facet&quot;)</span>
-<span class="lineNum">     134 </span><span class="lineCov">            240 :                                         facet[i-&gt;first] = i-&gt;second;</span>
-<span class="lineNum">     135 </span>                :                 }
-<span class="lineNum">     136 </span><span class="lineCov">           1865 :                 else if (ti != record.end())</span>
-<span class="lineNum">     137 </span>                :                 {
-<span class="lineNum">     138 </span>                :                         // Get the tag record
-<span class="lineNum">     139 </span><span class="lineCov">           1865 :                         TagData&amp; tag = obtainTag(ti-&gt;second);</span>
-<span class="lineNum">     140 </span>                :                         //fprintf(stderr, &quot;Read tag@%d %.*s\n&quot;, parser.lineNumber(), PFSTR(tag.name));
-<span class="lineNum">     141 </span>                :                         //assert(tag.name == ti-&gt;second);
-<span class="lineNum">     142 </span>                : 
-<span class="lineNum">     143 </span>                :                         // Merge the data
-<span class="lineNum">     144 </span><span class="lineCov">           5796 :                         for (DebDBParser::Record::const_iterator i = record.begin();</span>
-<span class="lineNum">     145 </span>                :                                         i != record.end(); i++)
-<span class="lineNum">     146 </span><span class="lineCov">           3931 :                                 if (i-&gt;first != &quot;Tag&quot;)</span>
-<span class="lineNum">     147 </span><span class="lineCov">           2066 :                                         tag[i-&gt;first] = i-&gt;second;</span>
-<span class="lineNum">     148 </span>                :                 }
-<span class="lineNum">     149 </span>                :                 else
-<span class="lineNum">     150 </span>                :                 {
-<span class="lineNum">     151 </span>                :                         fprintf(stderr, &quot;%s:%d: Skipping record without Tag or Facet field\n&quot;,
-<span class="lineNum">     152 </span><span class="lineNoCov">              0 :                                         input.fileName().c_str(), input.lineNumber());</span>
-<span class="lineNum">     153 </span>                :                 }
-<span class="lineNum">     154 </span><span class="lineCov">              7 :         }</span>
-<span class="lineNum">     155 </span><span class="lineCov">              7 : }</span>
-<span class="lineNum">     156 </span>                : 
-<span class="lineNum">     157 </span><span class="lineNoCov">              0 : bool VocabularyMerger::hasTag(const std::string&amp; fullname) const</span>
-<span class="lineNum">     158 </span>                : {
-<span class="lineNum">     159 </span><span class="lineNoCov">              0 :         size_t p = fullname.find(&quot;::&quot;);</span>
-<span class="lineNum">     160 </span><span class="lineNoCov">              0 :         std::string facetName;</span>
-<span class="lineNum">     161 </span><span class="lineNoCov">              0 :         std::string tagName;</span>
-<span class="lineNum">     162 </span><span class="lineNoCov">              0 :         if (p == string::npos)</span>
-<span class="lineNum">     163 </span>                :         {
-<span class="lineNum">     164 </span><span class="lineNoCov">              0 :                 facetName = &quot;legacy&quot;;</span>
-<span class="lineNum">     165 </span><span class="lineNoCov">              0 :                 tagName = fullname;</span>
-<span class="lineNum">     166 </span>                :         } else {
-<span class="lineNum">     167 </span><span class="lineNoCov">              0 :                 facetName = fullname.substr(0, p);</span>
-<span class="lineNum">     168 </span><span class="lineNoCov">              0 :                 tagName = fullname.substr(p + 2);</span>
-<span class="lineNum">     169 </span>                :         }
-<span class="lineNum">     170 </span>                : 
-<span class="lineNum">     171 </span><span class="lineNoCov">              0 :         std::map&lt;std::string, FacetData&gt;::const_iterator i = facets.find(facetName);</span>
-<span class="lineNum">     172 </span><span class="lineNoCov">              0 :         if (i == facets.end())</span>
-<span class="lineNum">     173 </span><span class="lineNoCov">              0 :                 return false;</span>
-<span class="lineNum">     174 </span><span class="lineNoCov">              0 :         return i-&gt;second.tags.find(tagName) != i-&gt;second.tags.end();</span>
-<span class="lineNum">     175 </span>                : }
-<span class="lineNum">     176 </span>                : 
-<span class="lineNum">     177 </span><span class="lineNoCov">              0 : int VocabularyMerger::tagID(const std::string&amp; fullname) const</span>
-<span class="lineNum">     178 </span>                : {
-<span class="lineNum">     179 </span><span class="lineNoCov">              0 :         size_t p = fullname.find(&quot;::&quot;);</span>
-<span class="lineNum">     180 </span><span class="lineNoCov">              0 :         std::string facetName;</span>
-<span class="lineNum">     181 </span><span class="lineNoCov">              0 :         std::string tagName;</span>
-<span class="lineNum">     182 </span><span class="lineNoCov">              0 :         if (p == string::npos)</span>
-<span class="lineNum">     183 </span>                :         {
-<span class="lineNum">     184 </span><span class="lineNoCov">              0 :                 facetName = &quot;legacy&quot;;</span>
-<span class="lineNum">     185 </span><span class="lineNoCov">              0 :                 tagName = fullname;</span>
-<span class="lineNum">     186 </span>                :         } else {
-<span class="lineNum">     187 </span><span class="lineNoCov">              0 :                 facetName = fullname.substr(0, p);</span>
-<span class="lineNum">     188 </span><span class="lineNoCov">              0 :                 tagName = fullname.substr(p + 2);</span>
-<span class="lineNum">     189 </span>                :         }
-<span class="lineNum">     190 </span>                : 
-<span class="lineNum">     191 </span><span class="lineNoCov">              0 :         std::map&lt;std::string, FacetData&gt;::const_iterator i = facets.find(facetName);</span>
-<span class="lineNum">     192 </span><span class="lineNoCov">              0 :         if (i == facets.end())</span>
-<span class="lineNum">     193 </span><span class="lineNoCov">              0 :                 return -1;</span>
-<span class="lineNum">     194 </span><span class="lineNoCov">              0 :         std::map&lt;std::string, TagData&gt;::const_iterator j = i-&gt;second.tags.find(tagName);</span>
-<span class="lineNum">     195 </span><span class="lineNoCov">              0 :         if (j == i-&gt;second.tags.end())</span>
-<span class="lineNum">     196 </span><span class="lineNoCov">              0 :                 return -1;</span>
-<span class="lineNum">     197 </span><span class="lineNoCov">              0 :         return j-&gt;second.id;</span>
-<span class="lineNum">     198 </span>                : }
-<span class="lineNum">     199 </span>                : 
-<span class="lineNum">     200 </span><span class="lineCov">              1 : std::set&lt;std::string&gt; VocabularyMerger::tagNames() const</span>
-<span class="lineNum">     201 </span>                : {
-<span class="lineNum">     202 </span><span class="lineCov">              1 :         set&lt;string&gt; res;</span>
-<span class="lineNum">     203 </span><span class="lineCov">             30 :         for (std::map&lt;std::string, FacetData&gt;::const_iterator f = facets.begin(); f != facets.end(); f++)</span>
-<span class="lineNum">     204 </span><span class="lineCov">            649 :                 for (std::map&lt;std::string, TagData&gt;::const_iterator t = f-&gt;second.tags.begin();</span>
-<span class="lineNum">     205 </span>                :                                 t != f-&gt;second.tags.end(); t++)
-<span class="lineNum">     206 </span><span class="lineCov">            620 :                         res.insert(f-&gt;first + &quot;::&quot; + t-&gt;first);</span>
-<span class="lineNum">     207 </span><span class="lineNoCov">              0 :         return res;</span>
-<span class="lineNum">     208 </span>                : }
-<span class="lineNum">     209 </span>                : 
-<span class="lineNum">     210 </span><span class="lineCov">              4 : void VocabularyMerger::write(const std::string&amp; fname)</span>
-<span class="lineNum">     211 </span>                : {
-<span class="lineNum">     212 </span><span class="lineCov">              4 :         FILE* out = fopen(fname.c_str(), &quot;wt&quot;);</span>
-<span class="lineNum">     213 </span><span class="lineCov">              4 :         if (!out)</span>
-<span class="lineNum">     214 </span><span class="lineNoCov">              0 :                 throw wibble::exception::File(fname, &quot;cept_debtags_vocabularymerger:reating file &quot;);</span>
-<span class="lineNum">     215 </span><span class="lineCov">              4 :         write(out);</span>
-<span class="lineNum">     216 </span><span class="lineCov">              4 :         fclose(out);</span>
-<span class="lineNum">     217 </span><span class="lineCov">              4 : }</span>
-<span class="lineNum">     218 </span>                : 
-<span class="lineNum">     219 </span><span class="lineCov">              4 : void VocabularyMerger::write(FILE* out)</span>
-<span class="lineNum">     220 </span>                : {
-<span class="lineNum">     221 </span><span class="lineCov">              4 :         long start_ofs = ftell(out);</span>
-<span class="lineNum">     222 </span><span class="lineCov">              4 :         int facetid = 0;</span>
-<span class="lineNum">     223 </span><span class="lineCov">              4 :         int tagid = 0;</span>
-<span class="lineNum">     224 </span>                : 
-<span class="lineNum">     225 </span>                :         //fprintf(stderr, &quot;Write\n&quot;);
-<span class="lineNum">     226 </span><span class="lineCov">             37 :         for (std::map&lt;std::string, FacetData&gt;::iterator f = facets.begin(); f != facets.end(); f++)</span>
-<span class="lineNum">     227 </span>                :         {
-<span class="lineNum">     228 </span><span class="lineCov">             33 :                 f-&gt;second.id = facetid++;</span>
-<span class="lineNum">     229 </span>                :                 //fprintf(stderr, &quot;Writing facet %.*s\n&quot;, PFSTR(f-&gt;first));
-<span class="lineNum">     230 </span><span class="lineCov">             33 :                 f-&gt;second.ofs = ftell(out) - start_ofs;</span>
-<span class="lineNum">     231 </span><span class="lineCov">             33 :                 writeDebStyleField(out, &quot;Facet&quot;, f-&gt;first);</span>
-<span class="lineNum">     232 </span><span class="lineCov">            115 :                 for (std::map&lt;std::string, std::string&gt;::const_iterator j = f-&gt;second.begin();</span>
-<span class="lineNum">     233 </span>                :                                 j != f-&gt;second.end(); j++)
-<span class="lineNum">     234 </span><span class="lineCov">             82 :                         writeDebStyleField(out, j-&gt;first, j-&gt;second);</span>
-<span class="lineNum">     235 </span><span class="lineCov">             33 :                 fputc('\n', out);</span>
-<span class="lineNum">     236 </span><span class="lineCov">             33 :                 f-&gt;second.len = ftell(out) - f-&gt;second.ofs;</span>
-<span class="lineNum">     237 </span>                : 
-<span class="lineNum">     238 </span><span class="lineCov">            658 :                 for (std::map&lt;std::string, TagData&gt;::iterator t = f-&gt;second.tags.begin();</span>
-<span class="lineNum">     239 </span>                :                                 t != f-&gt;second.tags.end(); t++)
-<span class="lineNum">     240 </span>                :                 {
-<span class="lineNum">     241 </span><span class="lineCov">            625 :                         t-&gt;second.id = tagid++;</span>
-<span class="lineNum">     242 </span>                :                         //fprintf(stderr, &quot;Writing tag %.*s\n&quot;, PFSTR(t-&gt;first));
-<span class="lineNum">     243 </span><span class="lineCov">            625 :                         t-&gt;second.ofs = ftell(out) - start_ofs;</span>
-<span class="lineNum">     244 </span><span class="lineCov">            625 :                         writeDebStyleField(out, &quot;Tag&quot;, f-&gt;first + &quot;::&quot; + t-&gt;first);</span>
-<span class="lineNum">     245 </span><span class="lineCov">           1317 :                         for (std::map&lt;std::string, std::string&gt;::const_iterator j = t-&gt;second.begin();</span>
-<span class="lineNum">     246 </span>                :                                         j != t-&gt;second.end(); j++)
-<span class="lineNum">     247 </span><span class="lineCov">            692 :                                 writeDebStyleField(out, j-&gt;first, j-&gt;second);</span>
-<span class="lineNum">     248 </span><span class="lineCov">            625 :                         fputc('\n', out);</span>
-<span class="lineNum">     249 </span><span class="lineCov">            625 :                         t-&gt;second.len = ftell(out) - t-&gt;second.ofs;</span>
-<span class="lineNum">     250 </span>                :                 }
-<span class="lineNum">     251 </span>                :         }
-<span class="lineNum">     252 </span>                : 
-<span class="lineNum">     253 </span><span class="lineCov">              4 :         tagCount = tagid;</span>
-<span class="lineNum">     254 </span><span class="lineCov">              4 : }</span>
-<span class="lineNum">     255 </span>                : 
-<span class="lineNum">     256 </span>                : 
-<span class="lineNum">     257 </span><span class="lineCov">              4 : int VocabularyMerger::FacetIndexer::encodedSize() const </span>
-<span class="lineNum">     258 </span>                : {
-<span class="lineNum">     259 </span>                :         // First the main offset table
-<span class="lineNum">     260 </span><span class="lineCov">              4 :         int size = vm.facets.size() * sizeof(int);</span>
-<span class="lineNum">     261 </span>                : 
-<span class="lineNum">     262 </span><span class="lineCov">             37 :         for (std::map&lt;std::string, FacetData&gt;::const_iterator f = vm.facets.begin(); f != vm.facets.end(); f++)</span>
-<span class="lineNum">     263 </span>                :         {
-<span class="lineNum">     264 </span>                :                 // offset of record in vocabulary
-<span class="lineNum">     265 </span>                :                 // size of record in vocabulary
-<span class="lineNum">     266 </span>                :                 // id of first tag
-<span class="lineNum">     267 </span>                :                 // id of last tag
-<span class="lineNum">     268 </span>                :                 // name (0-terminated)
-<span class="lineNum">     269 </span><span class="lineCov">             33 :                 size += 4 * sizeof(int) + f-&gt;first.size() + 1;</span>
-<span class="lineNum">     270 </span>                :                 
-<span class="lineNum">     271 </span>                :                 // Align to int boundaries
-<span class="lineNum">     272 </span><span class="lineCov">             33 :                 if ((size % sizeof(int)) != 0)</span>
-<span class="lineNum">     273 </span><span class="lineCov">             25 :                         size = (size + sizeof(int)) / sizeof(int) * sizeof(int);</span>
-<span class="lineNum">     274 </span>                :         }
-<span class="lineNum">     275 </span>                : 
-<span class="lineNum">     276 </span><span class="lineCov">              4 :         return tagcoll::diskindex::MMap::align(size);</span>
-<span class="lineNum">     277 </span>                : }
-<span class="lineNum">     278 </span>                : 
-<span class="lineNum">     279 </span><span class="lineCov">              4 : void VocabularyMerger::FacetIndexer::encode(char* buf) const </span>
-<span class="lineNum">     280 </span>                : {
-<span class="lineNum">     281 </span><span class="lineCov">              4 :         int pos = vm.facets.size() * sizeof(int);</span>
-<span class="lineNum">     282 </span>                : 
-<span class="lineNum">     283 </span><span class="lineCov">             37 :         for (std::map&lt;std::string, FacetData&gt;::const_iterator f = vm.facets.begin(); f != vm.facets.end(); f++)</span>
-<span class="lineNum">     284 </span>                :         {
-<span class="lineNum">     285 </span><span class="lineCov">             33 :                 ((int*)buf)[f-&gt;second.id] = pos;</span>
-<span class="lineNum">     286 </span>                : 
-<span class="lineNum">     287 </span>                :                 // offset of record in vocabulary
-<span class="lineNum">     288 </span><span class="lineCov">             33 :                 *(int*)(buf+pos) = f-&gt;second.ofs;</span>
-<span class="lineNum">     289 </span><span class="lineCov">             33 :                 pos += sizeof(int);</span>
-<span class="lineNum">     290 </span>                : 
-<span class="lineNum">     291 </span>                :                 // size of record in vocabulary
-<span class="lineNum">     292 </span><span class="lineCov">             33 :                 *(int*)(buf+pos) = f-&gt;second.len;</span>
-<span class="lineNum">     293 </span><span class="lineCov">             33 :                 pos += sizeof(int);</span>
-<span class="lineNum">     294 </span>                : 
-<span class="lineNum">     295 </span><span class="lineCov">             33 :                 if (f-&gt;second.tags.empty())</span>
-<span class="lineNum">     296 </span>                :                 {
-<span class="lineNum">     297 </span>                :                         // id of first tag
-<span class="lineNum">     298 </span><span class="lineCov">              1 :                         *(int*)(buf+pos) = -1;</span>
-<span class="lineNum">     299 </span><span class="lineCov">              1 :                         pos += sizeof(int);</span>
-<span class="lineNum">     300 </span>                : 
-<span class="lineNum">     301 </span>                :                         // id of last tag
-<span class="lineNum">     302 </span><span class="lineCov">              1 :                         *(int*)(buf+pos) = -1;</span>
-<span class="lineNum">     303 </span><span class="lineCov">              1 :                         pos += sizeof(int);</span>
-<span class="lineNum">     304 </span>                :                 } else {
-<span class="lineNum">     305 </span>                :                         // id of first tag
-<span class="lineNum">     306 </span><span class="lineCov">             32 :                         *(int*)(buf+pos) = f-&gt;second.tags.begin()-&gt;second.id;</span>
-<span class="lineNum">     307 </span><span class="lineCov">             32 :                         pos += sizeof(int);</span>
-<span class="lineNum">     308 </span>                : 
-<span class="lineNum">     309 </span>                :                         // id of last tag
-<span class="lineNum">     310 </span><span class="lineCov">             32 :                         *(int*)(buf+pos) = f-&gt;second.tags.rbegin()-&gt;second.id;</span>
-<span class="lineNum">     311 </span><span class="lineCov">             32 :                         pos += sizeof(int);</span>
-<span class="lineNum">     312 </span>                :                 }
-<span class="lineNum">     313 </span>                : 
-<span class="lineNum">     314 </span>                :                 // name (0-terminated)
-<span class="lineNum">     315 </span><span class="lineCov">             33 :                 memcpy(buf + pos, f-&gt;first.c_str(), f-&gt;first.size() + 1);</span>
-<span class="lineNum">     316 </span><span class="lineCov">             33 :                 pos += f-&gt;first.size() + 1;</span>
-<span class="lineNum">     317 </span>                :                 
-<span class="lineNum">     318 </span>                :                 // Align to int boundaries
-<span class="lineNum">     319 </span><span class="lineCov">             33 :                 if ((pos % sizeof(int)) != 0)</span>
-<span class="lineNum">     320 </span><span class="lineCov">             25 :                         pos = (pos + sizeof(int)) / sizeof(int) * sizeof(int);</span>
-<span class="lineNum">     321 </span>                :         }
-<span class="lineNum">     322 </span><span class="lineCov">              4 : }</span>
-<span class="lineNum">     323 </span>                : 
-<span class="lineNum">     324 </span><span class="lineCov">              4 : int VocabularyMerger::TagIndexer::encodedSize() const </span>
-<span class="lineNum">     325 </span>                : {
-<span class="lineNum">     326 </span>                :         // First the main offset table
-<span class="lineNum">     327 </span><span class="lineCov">              4 :         int size = vm.tagCount * sizeof(int);</span>
-<span class="lineNum">     328 </span>                : 
-<span class="lineNum">     329 </span><span class="lineCov">             37 :         for (std::map&lt;std::string, FacetData&gt;::const_iterator f = vm.facets.begin(); f != vm.facets.end(); f++)</span>
-<span class="lineNum">     330 </span>                :         {
-<span class="lineNum">     331 </span><span class="lineCov">            658 :                 for (std::map&lt;std::string, TagData&gt;::const_iterator t = f-&gt;second.tags.begin();</span>
-<span class="lineNum">     332 </span>                :                                 t != f-&gt;second.tags.end(); t++)
-<span class="lineNum">     333 </span>                :                 {
-<span class="lineNum">     334 </span>                :                         // offset of record in vocabulary
-<span class="lineNum">     335 </span>                :                         // size of record in vocabulary
-<span class="lineNum">     336 </span>                :                         // id of facet
-<span class="lineNum">     337 </span>                :                         // name (0-terminated)
-<span class="lineNum">     338 </span><span class="lineCov">            625 :                         size += 3 * sizeof(int) + f-&gt;first.size() + t-&gt;first.size() + 3;</span>
-<span class="lineNum">     339 </span>                :                 
-<span class="lineNum">     340 </span>                :                         // Align to int boundaries
-<span class="lineNum">     341 </span><span class="lineCov">            625 :                         if ((size % sizeof(int)) != 0)</span>
-<span class="lineNum">     342 </span><span class="lineCov">            479 :                                 size = (size + sizeof(int)) / sizeof(int) * sizeof(int);</span>
-<span class="lineNum">     343 </span>                :                 }
-<span class="lineNum">     344 </span>                :         }
-<span class="lineNum">     345 </span><span class="lineCov">              4 :         return tagcoll::diskindex::MMap::align(size);</span>
-<span class="lineNum">     346 </span>                : }
-<span class="lineNum">     347 </span>                : 
-<span class="lineNum">     348 </span><span class="lineCov">              4 : void VocabularyMerger::TagIndexer::encode(char* buf) const </span>
-<span class="lineNum">     349 </span>                : {
-<span class="lineNum">     350 </span><span class="lineCov">              4 :         int pos = vm.tagCount * sizeof(int);</span>
-<span class="lineNum">     351 </span>                : 
-<span class="lineNum">     352 </span><span class="lineCov">             37 :         for (std::map&lt;std::string, FacetData&gt;::const_iterator f = vm.facets.begin(); f != vm.facets.end(); f++)</span>
-<span class="lineNum">     353 </span>                :         {
-<span class="lineNum">     354 </span><span class="lineCov">            658 :                 for (std::map&lt;std::string, TagData&gt;::const_iterator t = f-&gt;second.tags.begin();</span>
-<span class="lineNum">     355 </span>                :                                 t != f-&gt;second.tags.end(); t++)
-<span class="lineNum">     356 </span>                :                 {
-<span class="lineNum">     357 </span><span class="lineCov">            625 :                         ((int*)buf)[t-&gt;second.id] = pos;</span>
-<span class="lineNum">     358 </span>                : 
-<span class="lineNum">     359 </span>                :                         // offset of record in vocabulary
-<span class="lineNum">     360 </span><span class="lineCov">            625 :                         *(int*)(buf+pos) = t-&gt;second.ofs;</span>
-<span class="lineNum">     361 </span><span class="lineCov">            625 :                         pos += sizeof(int);</span>
-<span class="lineNum">     362 </span>                : 
-<span class="lineNum">     363 </span>                :                         // size of record in vocabulary
-<span class="lineNum">     364 </span><span class="lineCov">            625 :                         *(int*)(buf+pos) = t-&gt;second.len;</span>
-<span class="lineNum">     365 </span><span class="lineCov">            625 :                         pos += sizeof(int);</span>
-<span class="lineNum">     366 </span>                : 
-<span class="lineNum">     367 </span>                :                         // id of facet
-<span class="lineNum">     368 </span><span class="lineCov">            625 :                         *(int*)(buf+pos) = f-&gt;second.id;</span>
-<span class="lineNum">     369 </span><span class="lineCov">            625 :                         pos += sizeof(int);</span>
-<span class="lineNum">     370 </span>                : 
-<span class="lineNum">     371 </span>                :                         // name (0-terminated)
-<span class="lineNum">     372 </span><span class="lineCov">            625 :                         string name = f-&gt;first + &quot;::&quot; + t-&gt;first;</span>
-<span class="lineNum">     373 </span><span class="lineCov">            625 :                         memcpy(buf + pos, name.c_str(), name.size() + 1);</span>
-<span class="lineNum">     374 </span><span class="lineCov">            625 :                         pos += name.size() + 1;</span>
-<span class="lineNum">     375 </span>                :                         
-<span class="lineNum">     376 </span>                :                         // Align to int boundaries
-<span class="lineNum">     377 </span><span class="lineCov">            625 :                         if ((pos % sizeof(int)) != 0)</span>
-<span class="lineNum">     378 </span><span class="lineCov">            479 :                                 pos = (pos + sizeof(int)) / sizeof(int) * sizeof(int);</span>
-<span class="lineNum">     379 </span>                :                 }
-<span class="lineNum">     380 </span>                :         }
-<span class="lineNum">     381 </span><span class="lineCov">              4 : }</span>
-<span class="lineNum">     382 </span>                : 
-<span class="lineNum">     383 </span>                : }
-<span class="lineNum">     384 </span><span class="lineCov">              6 : }</span>
-<span class="lineNum">     385 </span>                : 
-<span class="lineNum">     386 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/debtags/maint/vocabularymerger.h.gcov.html b/rep/ept/debtags/maint/vocabularymerger.h.gcov.html
deleted file mode 100644
index da02c28..0000000
--- a/rep/ept/debtags/maint/vocabularymerger.h.gcov.html
+++ /dev/null
@@ -1,224 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/debtags/maint/vocabularymerger.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">ept/debtags/maint</a> - vocabularymerger.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">13</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">13</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /*
-<span class="lineNum">       2 </span>                :  * Merge different vocabularies together and create the tag and facet indexes
-<span class="lineNum">       3 </span>                :  *
-<span class="lineNum">       4 </span>                :  * Copyright (C) 2003-2007  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">       5 </span>                :  *
-<span class="lineNum">       6 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">       7 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">       8 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">       9 </span>                :  * (at your option) any later version.
-<span class="lineNum">      10 </span>                :  *
-<span class="lineNum">      11 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      12 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      13 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      14 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      15 </span>                :  *
-<span class="lineNum">      16 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      17 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      18 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      19 </span>                :  */
-<span class="lineNum">      20 </span>                : 
-<span class="lineNum">      21 </span>                : #include &lt;tagcoll/diskindex/mmap.h&gt;
-<span class="lineNum">      22 </span>                : #include &lt;tagcoll/input/base.h&gt;
-<span class="lineNum">      23 </span>                : #include &lt;string&gt;
-<span class="lineNum">      24 </span>                : #include &lt;map&gt;
-<span class="lineNum">      25 </span>                : #include &lt;set&gt;
-<span class="lineNum">      26 </span>                : 
-<span class="lineNum">      27 </span>                : #ifndef EPT_DEBTAGS_VOCABULARYMERGER_H
-<span class="lineNum">      28 </span>                : #define EPT_DEBTAGS_VOCABULARYMERGER_H
-<span class="lineNum">      29 </span>                : 
-<span class="lineNum">      30 </span>                : namespace ept {
-<span class="lineNum">      31 </span>                : namespace debtags {
-<span class="lineNum">      32 </span>                : 
-<span class="lineNum">      33 </span>                : class VocabularyMerger
-<span class="lineNum">      34 </span><span class="lineCov">              7 : {</span>
-<span class="lineNum">      35 </span>                : protected:
-<span class="lineNum">      36 </span>                :         class FacetIndexer : public tagcoll::diskindex::MMapIndexer
-<span class="lineNum">      37 </span>                :         {
-<span class="lineNum">      38 </span>                :         protected:
-<span class="lineNum">      39 </span>                :                 VocabularyMerger&amp; vm;
-<span class="lineNum">      40 </span>                :         public:
-<span class="lineNum">      41 </span><span class="lineCov">              7 :                 FacetIndexer(VocabularyMerger&amp; vm) : vm(vm) {}</span>
-<span class="lineNum">      42 </span><span class="lineCov">              7 :                 virtual ~FacetIndexer() {}</span>
-<span class="lineNum">      43 </span>                :                 virtual int encodedSize() const;
-<span class="lineNum">      44 </span>                :                 virtual void encode(char* buf) const;
-<span class="lineNum">      45 </span>                :         };
-<span class="lineNum">      46 </span>                :         class TagIndexer : public tagcoll::diskindex::MMapIndexer
-<span class="lineNum">      47 </span>                :         {
-<span class="lineNum">      48 </span>                :         protected:
-<span class="lineNum">      49 </span>                :                 VocabularyMerger&amp; vm;
-<span class="lineNum">      50 </span>                :         public:
-<span class="lineNum">      51 </span><span class="lineCov">              7 :                 TagIndexer(VocabularyMerger&amp; vm) : vm(vm) {}</span>
-<span class="lineNum">      52 </span><span class="lineCov">              7 :                 virtual ~TagIndexer() {}</span>
-<span class="lineNum">      53 </span>                :                 virtual int encodedSize() const;
-<span class="lineNum">      54 </span>                :                 virtual void encode(char* buf) const;
-<span class="lineNum">      55 </span>                :         };
-<span class="lineNum">      56 </span>                :         class TagData : public std::map&lt;std::string, std::string&gt;
-<span class="lineNum">      57 </span><span class="lineCov">           8715 :         {</span>
-<span class="lineNum">      58 </span>                :         public:
-<span class="lineNum">      59 </span>                :                 std::string name;
-<span class="lineNum">      60 </span>                :                 // Offset in the last written file (used for indexing)
-<span class="lineNum">      61 </span>                :                 long ofs;
-<span class="lineNum">      62 </span>                :                 int len;
-<span class="lineNum">      63 </span>                :                 int id;
-<span class="lineNum">      64 </span>                : 
-<span class="lineNum">      65 </span><span class="lineCov">           1245 :                 TagData() : ofs(0), len(0) {}</span>
-<span class="lineNum">      66 </span>                :         };
-<span class="lineNum">      67 </span>                :         class FacetData : public std::map&lt;std::string, std::string&gt;
-<span class="lineNum">      68 </span><span class="lineCov">            434 :         {</span>
-<span class="lineNum">      69 </span>                :         public:
-<span class="lineNum">      70 </span>                :                 std::string name;
-<span class="lineNum">      71 </span>                :                 std::map&lt;std::string, TagData&gt; tags;
-<span class="lineNum">      72 </span>                :                 // Offset in the last written file (used for indexing)
-<span class="lineNum">      73 </span>                :                 long ofs;
-<span class="lineNum">      74 </span>                :                 int len;
-<span class="lineNum">      75 </span>                :                 int id;
-<span class="lineNum">      76 </span>                : 
-<span class="lineNum">      77 </span><span class="lineCov">             62 :                 FacetData() : ofs(0), len(0) {}</span>
-<span class="lineNum">      78 </span>                : 
-<span class="lineNum">      79 </span>                :                 TagData&amp; obtainTag(const std::string&amp; fullname);
-<span class="lineNum">      80 </span>                :         };
-<span class="lineNum">      81 </span>                :         std::map&lt;std::string, FacetData&gt; facets;
-<span class="lineNum">      82 </span>                :         int tagCount;
-<span class="lineNum">      83 </span>                :         FacetIndexer findexer;
-<span class="lineNum">      84 </span>                :         TagIndexer tindexer;
-<span class="lineNum">      85 </span>                :         
-<span class="lineNum">      86 </span>                :         FacetData&amp; obtainFacet(const std::string&amp; name);
-<span class="lineNum">      87 </span>                :         TagData&amp; obtainTag(const std::string&amp; fullname);
-<span class="lineNum">      88 </span>                :         
-<span class="lineNum">      89 </span>                : public:
-<span class="lineNum">      90 </span><span class="lineCov">              7 :         VocabularyMerger() : tagCount(0), findexer(*this), tindexer(*this) {}</span>
-<span class="lineNum">      91 </span>                : 
-<span class="lineNum">      92 </span>                :         /**
-<span class="lineNum">      93 </span>                :          * Check if there is any data in the merged vocabulary
-<span class="lineNum">      94 </span>                :          */
-<span class="lineNum">      95 </span><span class="lineCov">              3 :         bool empty() const { return facets.empty(); }</span>
-<span class="lineNum">      96 </span>                : 
-<span class="lineNum">      97 </span>                :         /**
-<span class="lineNum">      98 </span>                :          * Parse and import the vocabulary from `input', merging the data with the
-<span class="lineNum">      99 </span>                :          * previously imported ones
-<span class="lineNum">     100 </span>                :          */
-<span class="lineNum">     101 </span>                :         void read(tagcoll::input::Input&amp; input);
-<span class="lineNum">     102 </span>                : 
-<span class="lineNum">     103 </span>                :         /**
-<span class="lineNum">     104 </span>                :          * Write the vocabulary data to the given file
-<span class="lineNum">     105 </span>                :          */
-<span class="lineNum">     106 </span>                :         void write(const std::string&amp; fname);
-<span class="lineNum">     107 </span>                : 
-<span class="lineNum">     108 </span>                :         /**
-<span class="lineNum">     109 </span>                :          * Write the vocabulary data to the given output stream
-<span class="lineNum">     110 </span>                :          */
-<span class="lineNum">     111 </span>                :         void write(FILE* out);
-<span class="lineNum">     112 </span>                : 
-<span class="lineNum">     113 </span>                :         /**
-<span class="lineNum">     114 </span>                :          * Get the facet indexer.
-<span class="lineNum">     115 </span>                :          *
-<span class="lineNum">     116 </span>                :          * Note: the indexers will only be functional after one of the write
-<span class="lineNum">     117 </span>                :          * methods have been invoked
-<span class="lineNum">     118 </span>                :          */
-<span class="lineNum">     119 </span><span class="lineCov">              7 :         const tagcoll::diskindex::MMapIndexer&amp; facetIndexer() const { return findexer; }</span>
-<span class="lineNum">     120 </span>                : 
-<span class="lineNum">     121 </span>                :         /**
-<span class="lineNum">     122 </span>                :          * Get the tag indexer.
-<span class="lineNum">     123 </span>                :          *
-<span class="lineNum">     124 </span>                :          * Note: the indexers will only be functional after one of the write
-<span class="lineNum">     125 </span>                :          * methods have been invoked
-<span class="lineNum">     126 </span>                :          */
-<span class="lineNum">     127 </span><span class="lineCov">              7 :         const tagcoll::diskindex::MMapIndexer&amp; tagIndexer() const { return tindexer; }</span>
-<span class="lineNum">     128 </span>                : 
-<span class="lineNum">     129 </span>                :         /**
-<span class="lineNum">     130 </span>                :          * Check if the vocabulary contains the facet `name'
-<span class="lineNum">     131 </span>                :          */
-<span class="lineNum">     132 </span>                :         bool hasFacet(const std::string&amp; name) const
-<span class="lineNum">     133 </span>                :         {
-<span class="lineNum">     134 </span>                :                 return facets.find(name) != facets.end();
-<span class="lineNum">     135 </span>                :         }
-<span class="lineNum">     136 </span>                : 
-<span class="lineNum">     137 </span>                :         /**
-<span class="lineNum">     138 </span>                :          * Check if the vocabulary contains the tag `fullname'
-<span class="lineNum">     139 </span>                :          */
-<span class="lineNum">     140 </span>                :         bool hasTag(const std::string&amp; fullname) const;
-<span class="lineNum">     141 </span>                : 
-<span class="lineNum">     142 </span>                :         /**
-<span class="lineNum">     143 </span>                :          * Return the ID for the given tag (or -1 if not found)
-<span class="lineNum">     144 </span>                :          */
-<span class="lineNum">     145 </span>                :         int tagID(const std::string&amp; fullname) const;
-<span class="lineNum">     146 </span>                : 
-<span class="lineNum">     147 </span>                :         /**
-<span class="lineNum">     148 </span>                :          * Return a set with all tag names
-<span class="lineNum">     149 </span>                :          */
-<span class="lineNum">     150 </span>                :         std::set&lt;std::string&gt; tagNames() const;
-<span class="lineNum">     151 </span>                : };
-<span class="lineNum">     152 </span>                : 
-<span class="lineNum">     153 </span>                : }
-<span class="lineNum">     154 </span>                : }
-<span class="lineNum">     155 </span>                : 
-<span class="lineNum">     156 </span>                : // vim:set ts=4 sw=4:
-<span class="lineNum">     157 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/debtags/maint/vocabularymerger.test.h.gcov.html b/rep/ept/debtags/maint/vocabularymerger.test.h.gcov.html
deleted file mode 100644
index c9315e6..0000000
--- a/rep/ept/debtags/maint/vocabularymerger.test.h.gcov.html
+++ /dev/null
@@ -1,211 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/debtags/maint/vocabularymerger.test.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">ept/debtags/maint</a> - vocabularymerger.test.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">52</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">52</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /*
-<span class="lineNum">       2 </span>                :  * Merge different vocabularies together and create the tag and facet indexes
-<span class="lineNum">       3 </span>                :  *
-<span class="lineNum">       4 </span>                :  * Copyright (C) 2003-2007  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">       5 </span>                :  *
-<span class="lineNum">       6 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">       7 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">       8 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">       9 </span>                :  * (at your option) any later version.
-<span class="lineNum">      10 </span>                :  *
-<span class="lineNum">      11 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      12 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      13 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      14 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      15 </span>                :  *
-<span class="lineNum">      16 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      17 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      18 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      19 </span>                :  */
-<span class="lineNum">      20 </span>                : 
-<span class="lineNum">      21 </span>                : #include &lt;wibble/test.h&gt;
-<span class="lineNum">      22 </span>                : #include &lt;ept/debtags/maint/vocabularymerger.h&gt;
-<span class="lineNum">      23 </span>                : #include &lt;tagcoll/input/string.h&gt;
-<span class="lineNum">      24 </span>                : 
-<span class="lineNum">      25 </span>                : using namespace std;
-<span class="lineNum">      26 </span>                : using namespace tagcoll;
-<span class="lineNum">      27 </span>                : 
-<span class="lineNum">      28 </span>                : struct TestVocabularyMerger {
-<span class="lineNum">      29 </span>                : 
-<span class="lineNum">      30 </span><span class="lineCov">             14 :     inline static const char* indexref(const char* index, int id)</span>
-<span class="lineNum">      31 </span>                :     {
-<span class="lineNum">      32 </span><span class="lineCov">             14 :         return index + ((int*)index)[id];</span>
-<span class="lineNum">      33 </span>                :     }
-<span class="lineNum">      34 </span>                : 
-<span class="lineNum">      35 </span>                : 
-<span class="lineNum">      36 </span><span class="lineCov">              1 :     Test _1()</span>
-<span class="lineNum">      37 </span>                : {
-<span class="lineNum">      38 </span>                :         string voc1 =
-<span class="lineNum">      39 </span>                :                 &quot;Facet: taste\n&quot;
-<span class="lineNum">      40 </span>                :                 &quot;Description: Taste\n\n&quot;
-<span class="lineNum">      41 </span>                :                 &quot;Tag: taste::sweet\n&quot;
-<span class="lineNum">      42 </span>                :                 &quot;Description: Sweet\n\n&quot;
-<span class="lineNum">      43 </span>                :                 &quot;Tag: taste::salty\n&quot;
-<span class="lineNum">      44 </span><span class="lineCov">              1 :                 &quot;Description: Salty\n\n&quot;;</span>
-<span class="lineNum">      45 </span>                :         string voc2 =
-<span class="lineNum">      46 </span>                :                 &quot;Facet: smell\n&quot;
-<span class="lineNum">      47 </span>                :                 &quot;Description: Smell\n\n&quot;
-<span class="lineNum">      48 </span>                :                 &quot;Tag: smell::fresh\n&quot;
-<span class="lineNum">      49 </span>                :                 &quot;Description: Fresh\n\n&quot;
-<span class="lineNum">      50 </span>                :                 &quot;Tag: smell::mold\n&quot;
-<span class="lineNum">      51 </span><span class="lineCov">              2 :                 &quot;Description: Mold\n\n&quot;;</span>
-<span class="lineNum">      52 </span><span class="lineCov">              1 :         tagcoll::input::String in1(voc1);</span>
-<span class="lineNum">      53 </span><span class="lineCov">              1 :         tagcoll::input::String in2(voc2);</span>
-<span class="lineNum">      54 </span>                : 
-<span class="lineNum">      55 </span><span class="lineCov">              1 :         ept::debtags::VocabularyMerger vm;</span>
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span>                :         // Read and merge the two vocabulary samples
-<span class="lineNum">      58 </span><span class="lineCov">              1 :         vm.read(in1);</span>
-<span class="lineNum">      59 </span><span class="lineCov">              1 :         vm.read(in2);</span>
-<span class="lineNum">      60 </span>                : 
-<span class="lineNum">      61 </span>                :         // Write the merged vocabulary to /dev/null (but generate offsets and indexes in the meantime)
-<span class="lineNum">      62 </span><span class="lineCov">              1 :         vm.write(&quot;/dev/null&quot;);</span>
-<span class="lineNum">      63 </span>                : 
-<span class="lineNum">      64 </span>                :         // Create the facet index
-<span class="lineNum">      65 </span><span class="lineCov">              2 :         char facetIndex[vm.facetIndexer().encodedSize()];</span>
-<span class="lineNum">      66 </span><span class="lineCov">              1 :         vm.facetIndexer().encode(facetIndex);</span>
-<span class="lineNum">      67 </span>                : 
-<span class="lineNum">      68 </span>                :         // Create the tag index
-<span class="lineNum">      69 </span><span class="lineCov">              1 :         char tagIndex[vm.tagIndexer().encodedSize()];</span>
-<span class="lineNum">      70 </span><span class="lineCov">              1 :         vm.tagIndexer().encode(tagIndex);</span>
-<span class="lineNum">      71 </span>                : 
-<span class="lineNum">      72 </span>                :         // Check that the facet names have been encoded correctly and in order
-<span class="lineNum">      73 </span><span class="lineCov">              1 :         assert_eq(string(indexref(facetIndex, 0) + 4*sizeof(int)), &quot;smell&quot;);</span>
-<span class="lineNum">      74 </span><span class="lineCov">              2 :         assert_eq(string(indexref(facetIndex, 1) + 4*sizeof(int)), &quot;taste&quot;);</span>
-<span class="lineNum">      75 </span>                : 
-<span class="lineNum">      76 </span>                :         // Check the first and last tag indexes for the facets
-<span class="lineNum">      77 </span><span class="lineCov">              2 :         assert_eq(((int*)indexref(facetIndex, 0))[2], 0);</span>
-<span class="lineNum">      78 </span><span class="lineCov">              2 :         assert_eq(((int*)indexref(facetIndex, 0))[3], 1);</span>
-<span class="lineNum">      79 </span><span class="lineCov">              2 :         assert_eq(((int*)indexref(facetIndex, 1))[2], 2);</span>
-<span class="lineNum">      80 </span><span class="lineCov">              2 :         assert_eq(((int*)indexref(facetIndex, 1))[3], 3);</span>
-<span class="lineNum">      81 </span>                : 
-<span class="lineNum">      82 </span>                :         // Check that the tag names have been encoded correctly and in order
-<span class="lineNum">      83 </span><span class="lineCov">              2 :         assert_eq(string(indexref(tagIndex, 0) + 3*sizeof(int)), &quot;smell::fresh&quot;);</span>
-<span class="lineNum">      84 </span><span class="lineCov">              2 :         assert_eq(string(indexref(tagIndex, 1) + 3*sizeof(int)), &quot;smell::mold&quot;);</span>
-<span class="lineNum">      85 </span><span class="lineCov">              2 :         assert_eq(string(indexref(tagIndex, 2) + 3*sizeof(int)), &quot;taste::salty&quot;);</span>
-<span class="lineNum">      86 </span><span class="lineCov">              2 :         assert_eq(string(indexref(tagIndex, 3) + 3*sizeof(int)), &quot;taste::sweet&quot;);</span>
-<span class="lineNum">      87 </span>                : 
-<span class="lineNum">      88 </span>                :         // Check the facet indexes for the tags
-<span class="lineNum">      89 </span><span class="lineCov">              2 :         assert_eq(((int*)indexref(tagIndex, 0))[2], 0);</span>
-<span class="lineNum">      90 </span><span class="lineCov">              2 :         assert_eq(((int*)indexref(tagIndex, 1))[2], 0);</span>
-<span class="lineNum">      91 </span><span class="lineCov">              2 :         assert_eq(((int*)indexref(tagIndex, 2))[2], 1);</span>
-<span class="lineNum">      92 </span><span class="lineCov">              2 :         assert_eq(((int*)indexref(tagIndex, 3))[2], 1);</span>
-<span class="lineNum">      93 </span><span class="lineCov">              1 : }</span>
-<span class="lineNum">      94 </span>                : 
-<span class="lineNum">      95 </span>                : // Test parsing a vocabulary with a tag without a defined facet
-<span class="lineNum">      96 </span><span class="lineCov">              1 :     Test _2()</span>
-<span class="lineNum">      97 </span>                : {
-<span class="lineNum">      98 </span>                :         string voc =
-<span class="lineNum">      99 </span>                :                 &quot;Tag: foo::bar\n&quot;
-<span class="lineNum">     100 </span>                :                 &quot;Description: Tag without facet\n&quot;
-<span class="lineNum">     101 </span><span class="lineCov">              1 :                 &quot; VocabularyMerged should behave fine in this case.\n\n&quot;;</span>
-<span class="lineNum">     102 </span><span class="lineCov">              1 :         tagcoll::input::String in(voc);</span>
-<span class="lineNum">     103 </span>                : 
-<span class="lineNum">     104 </span><span class="lineCov">              1 :         ept::debtags::VocabularyMerger vm;</span>
-<span class="lineNum">     105 </span><span class="lineCov">              1 :         vm.read(in);</span>
-<span class="lineNum">     106 </span>                : 
-<span class="lineNum">     107 </span>                :         // Write the merged vocabulary to /dev/null (but generate offsets and indexes in the meantime)
-<span class="lineNum">     108 </span><span class="lineCov">              1 :         vm.write(&quot;/dev/null&quot;);</span>
-<span class="lineNum">     109 </span>                : 
-<span class="lineNum">     110 </span>                :         // Create the facet index
-<span class="lineNum">     111 </span><span class="lineCov">              2 :         char facetIndex[vm.facetIndexer().encodedSize()];</span>
-<span class="lineNum">     112 </span><span class="lineCov">              1 :         vm.facetIndexer().encode(facetIndex);</span>
-<span class="lineNum">     113 </span>                : 
-<span class="lineNum">     114 </span>                :         // Create the tag index
-<span class="lineNum">     115 </span><span class="lineCov">              1 :         char tagIndex[vm.tagIndexer().encodedSize()];</span>
-<span class="lineNum">     116 </span><span class="lineCov">              1 :         vm.tagIndexer().encode(tagIndex);</span>
-<span class="lineNum">     117 </span><span class="lineCov">              1 : }</span>
-<span class="lineNum">     118 </span>                : 
-<span class="lineNum">     119 </span>                : // Test parsing a vocabulary with a facet without tags
-<span class="lineNum">     120 </span><span class="lineCov">              1 :     Test _3()</span>
-<span class="lineNum">     121 </span>                : {
-<span class="lineNum">     122 </span>                :         string voc =
-<span class="lineNum">     123 </span>                :                 &quot;Facet: empty\n&quot;
-<span class="lineNum">     124 </span>                :                 &quot;Description: Facet without tags\n&quot;
-<span class="lineNum">     125 </span><span class="lineCov">              1 :                 &quot; VocabularyMerged used to segfault in this case.\n\n&quot;;</span>
-<span class="lineNum">     126 </span><span class="lineCov">              1 :         tagcoll::input::String in(voc);</span>
-<span class="lineNum">     127 </span>                : 
-<span class="lineNum">     128 </span><span class="lineCov">              1 :         ept::debtags::VocabularyMerger vm;</span>
-<span class="lineNum">     129 </span><span class="lineCov">              1 :         vm.read(in);</span>
-<span class="lineNum">     130 </span>                : 
-<span class="lineNum">     131 </span>                :         // Write the merged vocabulary to /dev/null (but generate offsets and indexes in the meantime)
-<span class="lineNum">     132 </span><span class="lineCov">              1 :         vm.write(&quot;/dev/null&quot;);</span>
-<span class="lineNum">     133 </span>                : 
-<span class="lineNum">     134 </span>                :         // Create the facet index
-<span class="lineNum">     135 </span><span class="lineCov">              2 :         char facetIndex[vm.facetIndexer().encodedSize()];</span>
-<span class="lineNum">     136 </span><span class="lineCov">              1 :         vm.facetIndexer().encode(facetIndex);</span>
-<span class="lineNum">     137 </span>                : 
-<span class="lineNum">     138 </span>                :         // Create the tag index
-<span class="lineNum">     139 </span><span class="lineCov">              1 :         char tagIndex[vm.tagIndexer().encodedSize()];</span>
-<span class="lineNum">     140 </span><span class="lineCov">              1 :         vm.tagIndexer().encode(tagIndex);</span>
-<span class="lineNum">     141 </span><span class="lineCov">              1 : }</span>
-<span class="lineNum">     142 </span>                : 
-<span class="lineNum">     143 </span>                : };
-<span class="lineNum">     144 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/debtags/tag.cc.gcov.html b/rep/ept/debtags/tag.cc.gcov.html
deleted file mode 100644
index 180196e..0000000
--- a/rep/ept/debtags/tag.cc.gcov.html
+++ /dev/null
@@ -1,205 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/debtags/tag.cc</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/debtags</a> - tag.cc</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">59</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">74.6 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">44</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /* -*- C++ -*-
-<span class="lineNum">       2 </span>                :  * Copyright (C) 2005,2006  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">       3 </span>                :  *
-<span class="lineNum">       4 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">       5 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">       6 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">       7 </span>                :  * (at your option) any later version.
-<span class="lineNum">       8 </span>                :  *
-<span class="lineNum">       9 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      10 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      11 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      12 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      13 </span>                :  *
-<span class="lineNum">      14 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      15 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      16 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      17 </span>                :  */
-<span class="lineNum">      18 </span>                : 
-<span class="lineNum">      19 </span>                : #include &lt;ept/debtags/tag.h&gt;
-<span class="lineNum">      20 </span>                : #include &lt;ept/debtags/vocabulary.h&gt;
-<span class="lineNum">      21 </span>                : #include &lt;stdexcept&gt;
-<span class="lineNum">      22 </span>                : 
-<span class="lineNum">      23 </span>                : namespace ept {
-<span class="lineNum">      24 </span>                : namespace debtags {
-<span class="lineNum">      25 </span>                : 
-<span class="lineNum">      26 </span>                : static inline std::string constget(const std::map&lt;std::string, std::string&gt;&amp; m,
-<span class="lineNum">      27 </span><span class="lineCov">           3898 :                                    const std::string&amp; key)</span>
-<span class="lineNum">      28 </span>                : {
-<span class="lineNum">      29 </span><span class="lineCov">           3898 :         std::map&lt;std::string, std::string&gt;::const_iterator i = m.find(key);</span>
-<span class="lineNum">      30 </span><span class="lineCov">           3898 :         if (i == m.end())</span>
-<span class="lineNum">      31 </span><span class="lineCov">              4 :                 return std::string();</span>
-<span class="lineNum">      32 </span>                :         else
-<span class="lineNum">      33 </span><span class="lineCov">           3894 :                 return i-&gt;second;</span>
-<span class="lineNum">      34 </span>                : }
-<span class="lineNum">      35 </span>                : 
-<span class="lineNum">      36 </span><span class="lineCov">             59 : std::string Facet::name() const</span>
-<span class="lineNum">      37 </span>                : {
-<span class="lineNum">      38 </span><span class="lineCov">             59 :         if (valid())</span>
-<span class="lineNum">      39 </span><span class="lineCov">             59 :                 return m_tags-&gt;facetName(m_id);</span>
-<span class="lineNum">      40 </span><span class="lineNoCov">              0 :         throw std::out_of_range( &quot;No name for this facet&quot; );</span>
-<span class="lineNum">      41 </span>                : }
-<span class="lineNum">      42 </span><span class="lineCov">             29 : std::string Facet::name(const std::string&amp; d) const</span>
-<span class="lineNum">      43 </span>                : {
-<span class="lineNum">      44 </span><span class="lineCov">             29 :         return valid() ? m_tags-&gt;facetName(m_id) : d;</span>
-<span class="lineNum">      45 </span>                : }
-<span class="lineNum">      46 </span>                : 
-<span class="lineNum">      47 </span><span class="lineCov">             59 : std::string Facet::shortDescription() const</span>
-<span class="lineNum">      48 </span>                : {
-<span class="lineNum">      49 </span><span class="lineCov">             59 :         if (valid())</span>
-<span class="lineNum">      50 </span><span class="lineCov">             59 :                 return constget(m_tags-&gt;facetData(m_id), &quot;_SD_&quot;);</span>
-<span class="lineNum">      51 </span><span class="lineNoCov">              0 :         throw std::out_of_range( &quot;No short description for this facet&quot; );</span>
-<span class="lineNum">      52 </span>                : }
-<span class="lineNum">      53 </span><span class="lineCov">             29 : std::string Facet::shortDescription(const std::string&amp; d) const</span>
-<span class="lineNum">      54 </span>                : {
-<span class="lineNum">      55 </span><span class="lineCov">             29 :         return valid() ? constget(m_tags-&gt;facetData(m_id), &quot;_SD_&quot;) : d;</span>
-<span class="lineNum">      56 </span>                : }
-<span class="lineNum">      57 </span>                : 
-<span class="lineNum">      58 </span><span class="lineCov">             59 : std::string Facet::longDescription() const</span>
-<span class="lineNum">      59 </span>                : {
-<span class="lineNum">      60 </span><span class="lineCov">             59 :         if (valid())</span>
-<span class="lineNum">      61 </span><span class="lineCov">             59 :                 return constget(m_tags-&gt;facetData(m_id), &quot;Description&quot;);</span>
-<span class="lineNum">      62 </span><span class="lineNoCov">              0 :         throw std::out_of_range( &quot;No long description for this facet&quot; );</span>
-<span class="lineNum">      63 </span>                : }
-<span class="lineNum">      64 </span><span class="lineCov">             29 : std::string Facet::longDescription(const std::string&amp; d) const</span>
-<span class="lineNum">      65 </span>                : {
-<span class="lineNum">      66 </span><span class="lineCov">             29 :         return valid() ? constget(m_tags-&gt;facetData(m_id), &quot;Description&quot;) : d;</span>
-<span class="lineNum">      67 </span>                : }
-<span class="lineNum">      68 </span>                : 
-<span class="lineNum">      69 </span><span class="lineNoCov">              0 : bool Facet::hasTag(const std::string&amp; name) const</span>
-<span class="lineNum">      70 </span>                : {
-<span class="lineNum">      71 </span><span class="lineNoCov">              0 :         if (!valid())</span>
-<span class="lineNum">      72 </span><span class="lineNoCov">              0 :                 throw std::out_of_range( &quot;hasTag() called on an invalid facet&quot; );</span>
-<span class="lineNum">      73 </span><span class="lineNoCov">              0 :         return m_tags-&gt;hasTag(this-&gt;name() + &quot;::&quot; + name);</span>
-<span class="lineNum">      74 </span>                : }
-<span class="lineNum">      75 </span>                : 
-<span class="lineNum">      76 </span><span class="lineCov">             89 : std::set&lt; Tag &gt; Facet::tags() const</span>
-<span class="lineNum">      77 </span>                : {
-<span class="lineNum">      78 </span><span class="lineCov">             89 :         if (!valid())</span>
-<span class="lineNum">      79 </span><span class="lineCov">              1 :                 throw std::out_of_range( &quot;tags() called on an invalid facet&quot; );</span>
-<span class="lineNum">      80 </span><span class="lineCov">             88 :         return m_tags-&gt;tags(m_id);</span>
-<span class="lineNum">      81 </span>                : }
-<span class="lineNum">      82 </span>                : 
-<span class="lineNum">      83 </span>                : 
-<span class="lineNum">      84 </span><span class="lineNoCov">              0 : Facet Tag::facet() const</span>
-<span class="lineNum">      85 </span>                : {
-<span class="lineNum">      86 </span><span class="lineNoCov">              0 :         if (valid())</span>
-<span class="lineNum">      87 </span><span class="lineNoCov">              0 :                 return m_tags-&gt;facetByTag(m_id);</span>
-<span class="lineNum">      88 </span><span class="lineNoCov">              0 :         throw std::out_of_range( &quot;No facet for this tag&quot; );</span>
-<span class="lineNum">      89 </span>                : }
-<span class="lineNum">      90 </span>                : 
-<span class="lineNum">      91 </span><span class="lineCov">           1243 : std::string Tag::name() const</span>
-<span class="lineNum">      92 </span>                : {
-<span class="lineNum">      93 </span><span class="lineCov">           1243 :         if (valid())</span>
-<span class="lineNum">      94 </span><span class="lineCov">           1243 :                 return m_tags-&gt;tagShortName(m_id);</span>
-<span class="lineNum">      95 </span><span class="lineNoCov">              0 :         throw std::out_of_range( &quot;No name for this tag&quot; );</span>
-<span class="lineNum">      96 </span>                : }
-<span class="lineNum">      97 </span><span class="lineCov">            620 : std::string Tag::name(const std::string&amp; d) const</span>
-<span class="lineNum">      98 </span>                : {
-<span class="lineNum">      99 </span><span class="lineCov">            620 :         return valid() ? m_tags-&gt;tagShortName(m_id) : d;</span>
-<span class="lineNum">     100 </span>                : }
-<span class="lineNum">     101 </span>                : 
-<span class="lineNum">     102 </span><span class="lineCov">           1284 : std::string Tag::fullname() const</span>
-<span class="lineNum">     103 </span>                : {
-<span class="lineNum">     104 </span><span class="lineCov">           1284 :         if (valid())</span>
-<span class="lineNum">     105 </span><span class="lineCov">           1284 :                 return m_tags-&gt;tagName(m_id);</span>
-<span class="lineNum">     106 </span><span class="lineNoCov">              0 :         throw std::out_of_range( &quot;No full name for this tag&quot; );</span>
-<span class="lineNum">     107 </span>                : }
-<span class="lineNum">     108 </span><span class="lineCov">            620 : std::string Tag::fullname(const std::string&amp; d) const</span>
-<span class="lineNum">     109 </span>                : {
-<span class="lineNum">     110 </span><span class="lineCov">            620 :         return valid() ? m_tags-&gt;tagName(m_id) : d;</span>
-<span class="lineNum">     111 </span>                : }
-<span class="lineNum">     112 </span>                : 
-<span class="lineNum">     113 </span><span class="lineCov">           1242 : std::string Tag::shortDescription() const</span>
-<span class="lineNum">     114 </span>                : {
-<span class="lineNum">     115 </span><span class="lineCov">           1242 :         if (valid())</span>
-<span class="lineNum">     116 </span><span class="lineCov">           1242 :                 return constget(m_tags-&gt;tagData(m_id), &quot;_SD_&quot;);</span>
-<span class="lineNum">     117 </span><span class="lineNoCov">              0 :         throw std::out_of_range( &quot;No short description for this tag&quot; );</span>
-<span class="lineNum">     118 </span>                : }
-<span class="lineNum">     119 </span><span class="lineCov">            620 : std::string Tag::shortDescription(const std::string&amp; d) const</span>
-<span class="lineNum">     120 </span>                : {
-<span class="lineNum">     121 </span><span class="lineCov">            620 :         return valid() ? constget(m_tags-&gt;tagData(m_id), &quot;_SD_&quot;) : d;</span>
-<span class="lineNum">     122 </span>                : }
-<span class="lineNum">     123 </span>                : 
-<span class="lineNum">     124 </span><span class="lineCov">           1240 : std::string Tag::longDescription() const</span>
-<span class="lineNum">     125 </span>                : {
-<span class="lineNum">     126 </span><span class="lineCov">           1240 :         if (valid())</span>
-<span class="lineNum">     127 </span><span class="lineCov">           1240 :                 return constget(m_tags-&gt;tagData(m_id), &quot;Description&quot;);</span>
-<span class="lineNum">     128 </span><span class="lineNoCov">              0 :         throw std::out_of_range( &quot;No long description for this tag&quot; );</span>
-<span class="lineNum">     129 </span>                : }
-<span class="lineNum">     130 </span><span class="lineCov">            620 : std::string Tag::longDescription(const std::string&amp; d) const</span>
-<span class="lineNum">     131 </span>                : {
-<span class="lineNum">     132 </span><span class="lineCov">            620 :         return valid() ? constget(m_tags-&gt;tagData(m_id), &quot;Description&quot;) : d;</span>
-<span class="lineNum">     133 </span>                : }
-<span class="lineNum">     134 </span>                : 
-<span class="lineNum">     135 </span>                : }
-<span class="lineNum">     136 </span>                : }
-<span class="lineNum">     137 </span>                : 
-<span class="lineNum">     138 </span>                : // vim:set ts=3 sw=3:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/debtags/tag.h.gcov.html b/rep/ept/debtags/tag.h.gcov.html
deleted file mode 100644
index 0695c3c..0000000
--- a/rep/ept/debtags/tag.h.gcov.html
+++ /dev/null
@@ -1,318 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/debtags/tag.h</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/debtags</a> - tag.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">16</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">93.8 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">15</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- C++ -*-
-<span class="lineNum">       2 </span>                : #ifndef EPT_DEBTAGS_TAG_H
-<span class="lineNum">       3 </span>                : #define EPT_DEBTAGS_TAG_H
-<span class="lineNum">       4 </span>                : 
-<span class="lineNum">       5 </span>                : /** \file
-<span class="lineNum">       6 </span>                :  * Debtags facets and tags
-<span class="lineNum">       7 </span>                :  */
-<span class="lineNum">       8 </span>                : 
-<span class="lineNum">       9 </span>                : /*
-<span class="lineNum">      10 </span>                :  * Copyright (C) 2005,2006,2007  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">      11 </span>                :  *
-<span class="lineNum">      12 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">      13 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">      14 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">      15 </span>                :  * (at your option) any later version.
-<span class="lineNum">      16 </span>                :  *
-<span class="lineNum">      17 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      18 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      19 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      20 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      21 </span>                :  *
-<span class="lineNum">      22 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      23 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      24 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      25 </span>                :  */
-<span class="lineNum">      26 </span>                : 
-<span class="lineNum">      27 </span>                : #include &lt;set&gt;
-<span class="lineNum">      28 </span>                : #include &lt;string&gt;
-<span class="lineNum">      29 </span>                : 
-<span class="lineNum">      30 </span>                : namespace ept {
-<span class="lineNum">      31 </span>                : namespace debtags {
-<span class="lineNum">      32 </span>                : 
-<span class="lineNum">      33 </span>                : class Vocabulary;
-<span class="lineNum">      34 </span>                : 
-<span class="lineNum">      35 </span>                : class Tag;
-<span class="lineNum">      36 </span>                : 
-<span class="lineNum">      37 </span>                : /**
-<span class="lineNum">      38 </span>                :  * Representation of a facet.
-<span class="lineNum">      39 </span>                :  *
-<span class="lineNum">      40 </span>                :  * ept::debtags::Facet represents a Facet with all its informations.
-<span class="lineNum">      41 </span>                :  * It is guaranteed to have fast value-copy semantics, so it can be passed
-<span class="lineNum">      42 </span>                :  * around freely and efficiently without worrying about memory management
-<span class="lineNum">      43 </span>                :  * issues.
-<span class="lineNum">      44 </span>                :  *
-<span class="lineNum">      45 </span>                :  * The class is normally instantiated using a Vocabulary:
-<span class="lineNum">      46 </span>                :  * \code
-<span class="lineNum">      47 </span>                :  *      Facet facet = vocabulary.faceByName(&quot;made-of&quot;);
-<span class="lineNum">      48 </span>                :  * \endcode
-<span class="lineNum">      49 </span>                :  *
-<span class="lineNum">      50 </span>                :  * Facets can contain an &quot;invalid&quot; value, in which case using any of their
-<span class="lineNum">      51 </span>                :  * methods will likely produce segfault.  The &quot;invalid&quot; facets are useful as
-<span class="lineNum">      52 </span>                :  * &quot;none&quot; return values:
-<span class="lineNum">      53 </span>                :  *
-<span class="lineNum">      54 </span>                :  * \code
-<span class="lineNum">      55 </span>                :  *    Facet facet = vocabulary.facetByName(&quot;made-of&quot;);
-<span class="lineNum">      56 </span>                :  *    if (!facet)
-<span class="lineNum">      57 </span>                :  *       throw SomeException(&quot;facet \&quot;made-of\&quot; has not been defined&quot;);
-<span class="lineNum">      58 </span>                :  * \endcode
-<span class="lineNum">      59 </span>                :  */
-<span class="lineNum">      60 </span>                : class Facet
-<span class="lineNum">      61 </span>                : {
-<span class="lineNum">      62 </span>                : protected:
-<span class="lineNum">      63 </span>                :         const Vocabulary* m_tags;
-<span class="lineNum">      64 </span>                :         int m_id;
-<span class="lineNum">      65 </span>                : 
-<span class="lineNum">      66 </span><span class="lineCov">            120 :         Facet(const Vocabulary* tags, int id) : m_tags(tags), m_id(id) {}</span>
-<span class="lineNum">      67 </span>                : 
-<span class="lineNum">      68 </span>                : public:
-<span class="lineNum">      69 </span>                :         Facet() : m_tags(0), m_id(-1) {}
-<span class="lineNum">      70 </span><span class="lineCov">            265 :         ~Facet() {}</span>
-<span class="lineNum">      71 </span>                : 
-<span class="lineNum">      72 </span><span class="lineCov">             29 :         bool operator==(const Facet&amp; f) const { return m_id == f.m_id; }</span>
-<span class="lineNum">      73 </span>                :         bool operator!=(const Facet&amp; f) const { return m_id != f.m_id; }
-<span class="lineNum">      74 </span><span class="lineCov">            600 :         bool operator&lt;(const Facet&amp; f) const { return m_id &lt; f.m_id; }</span>
-<span class="lineNum">      75 </span>                : 
-<span class="lineNum">      76 </span>                :         /**
-<span class="lineNum">      77 </span>                :          * Return true if the facet is valid
-<span class="lineNum">      78 </span>                :          */
-<span class="lineNum">      79 </span><span class="lineNoCov">              0 :         operator bool() const { return m_id != -1; }</span>
-<span class="lineNum">      80 </span><span class="lineCov">            353 :         bool valid() const { return m_id != -1; }</span>
-<span class="lineNum">      81 </span>                : 
-<span class="lineNum">      82 </span>                :         /**
-<span class="lineNum">      83 </span>                :          * Return the name of the facet
-<span class="lineNum">      84 </span>                :          * @throws std::out_of_range if the facet is not valid
-<span class="lineNum">      85 </span>                :          */
-<span class="lineNum">      86 </span>                :         std::string name() const;
-<span class="lineNum">      87 </span>                :         /**
-<span class="lineNum">      88 </span>                :          * Return the name of the facet
-<span class="lineNum">      89 </span>                :          * 
-<span class="lineNum">      90 </span>                :          * Returns d if the facet is not valid.
-<span class="lineNum">      91 </span>                :          */
-<span class="lineNum">      92 </span>                :         std::string name(const std::string&amp; d) const;
-<span class="lineNum">      93 </span>                : 
-<span class="lineNum">      94 </span>                :         /**
-<span class="lineNum">      95 </span>                :          * Return the short description of the facet
-<span class="lineNum">      96 </span>                :          * @throws std::out_of_range if the facet is not valid
-<span class="lineNum">      97 </span>                :          */
-<span class="lineNum">      98 </span>                :         std::string shortDescription() const;
-<span class="lineNum">      99 </span>                :         /**
-<span class="lineNum">     100 </span>                :          * Return the short description of the facet
-<span class="lineNum">     101 </span>                :          *
-<span class="lineNum">     102 </span>                :          * Returns d if the facet is not valid.
-<span class="lineNum">     103 </span>                :          */
-<span class="lineNum">     104 </span>                :         std::string shortDescription(const std::string&amp; d) const;
-<span class="lineNum">     105 </span>                : 
-<span class="lineNum">     106 </span>                :         /**
-<span class="lineNum">     107 </span>                :          * Return the long description of the facet
-<span class="lineNum">     108 </span>                :          * @throws std::out_of_range if the facet is not valid
-<span class="lineNum">     109 </span>                :          */
-<span class="lineNum">     110 </span>                :         std::string longDescription() const;
-<span class="lineNum">     111 </span>                :         /**
-<span class="lineNum">     112 </span>                :          * Return the long description of the facet
-<span class="lineNum">     113 </span>                :          *
-<span class="lineNum">     114 </span>                :          * Returns d if the facet is not valid.
-<span class="lineNum">     115 </span>                :          */
-<span class="lineNum">     116 </span>                :         std::string longDescription(const std::string&amp; d) const;
-<span class="lineNum">     117 </span>                : 
-<span class="lineNum">     118 </span>                :         /**
-<span class="lineNum">     119 </span>                :          * Return true if the facet has a tag with the given name (name, not fullname)
-<span class="lineNum">     120 </span>                :          */
-<span class="lineNum">     121 </span>                :         bool hasTag(const std::string&amp; name) const;
-<span class="lineNum">     122 </span>                : 
-<span class="lineNum">     123 </span>                :         /**
-<span class="lineNum">     124 </span>                :          * Return the list of tags in this facet
-<span class="lineNum">     125 </span>                :          */
-<span class="lineNum">     126 </span>                :         std::set&lt;Tag&gt; tags() const;
-<span class="lineNum">     127 </span>                : 
-<span class="lineNum">     128 </span>                :         /**
-<span class="lineNum">     129 </span>                :          * Return the ID of this facet
-<span class="lineNum">     130 </span>                :          *
-<span class="lineNum">     131 </span>                :          * @warning This method is exported to help in writing tests, but it is not
-<span class="lineNum">     132 </span>                :          * part of the normal API: do not use it, because future implementations may
-<span class="lineNum">     133 </span>                :          * not be based on IDs and therefore not have this method.
-<span class="lineNum">     134 </span>                :          */
-<span class="lineNum">     135 </span><span class="lineCov">             58 :         int id() const { return m_id; }</span>
-<span class="lineNum">     136 </span>                : 
-<span class="lineNum">     137 </span>                :         friend class Vocabulary;
-<span class="lineNum">     138 </span>                : };
-<span class="lineNum">     139 </span>                : 
-<span class="lineNum">     140 </span>                : /**
-<span class="lineNum">     141 </span>                :  * Representation of a tag.
-<span class="lineNum">     142 </span>                :  *
-<span class="lineNum">     143 </span>                :  * ept::debtags::Tag represents a Tag with all its informations.
-<span class="lineNum">     144 </span>                :  * It is guaranteed to have fast value-copy semantics, so it can be passed
-<span class="lineNum">     145 </span>                :  * around freely and efficiently without worrying about memory management
-<span class="lineNum">     146 </span>                :  * issues.
-<span class="lineNum">     147 </span>                :  *
-<span class="lineNum">     148 </span>                :  * The class is normally instantiated using a Vocabulary:
-<span class="lineNum">     149 </span>                :  * \code
-<span class="lineNum">     150 </span>                :  *      Tag tag = vocabulary.tagByName(&quot;made-of::lang:c++&quot;);
-<span class="lineNum">     151 </span>                :  * \endcode
-<span class="lineNum">     152 </span>                :  *
-<span class="lineNum">     153 </span>                :  * Tags can contain an &quot;invalid&quot; value, in which case using any of their
-<span class="lineNum">     154 </span>                :  * methods will likely produce segfault.  The &quot;invalid&quot; facets are useful as
-<span class="lineNum">     155 </span>                :  * &quot;none&quot; return values:
-<span class="lineNum">     156 </span>                :  *
-<span class="lineNum">     157 </span>                :  * \code
-<span class="lineNum">     158 </span>                :  *    Tag tag = vocabulary.tagByName(&quot;made-of&quot;);
-<span class="lineNum">     159 </span>                :  *    if (!tag)
-<span class="lineNum">     160 </span>                :  *       throw SomeException(&quot;tag \&quot;mytag\&quot; has not been defined&quot;);
-<span class="lineNum">     161 </span>                :  * \endcode
-<span class="lineNum">     162 </span>                :  */
-<span class="lineNum">     163 </span>                : class Tag
-<span class="lineNum">     164 </span>                : {
-<span class="lineNum">     165 </span>                : protected:
-<span class="lineNum">     166 </span>                :         const Vocabulary* m_tags;
-<span class="lineNum">     167 </span>                :         int m_id;
-<span class="lineNum">     168 </span>                : 
-<span class="lineNum">     169 </span><span class="lineCov">         745056 :         Tag(const Vocabulary* tags, int id) : m_tags(tags), m_id(id) {}</span>
-<span class="lineNum">     170 </span>                : 
-<span class="lineNum">     171 </span>                : public:
-<span class="lineNum">     172 </span>                :         typedef std::set&lt; Tag &gt; Set;
-<span class="lineNum">     173 </span>                : 
-<span class="lineNum">     174 </span><span class="lineCov">              2 :         Tag() : m_tags(0), m_id(-1) {}</span>
-<span class="lineNum">     175 </span><span class="lineCov">        2229812 :         ~Tag() {}</span>
-<span class="lineNum">     176 </span>                : 
-<span class="lineNum">     177 </span><span class="lineCov">           1228 :         bool operator==(const Tag&amp; f) const { return m_id == f.m_id; }</span>
-<span class="lineNum">     178 </span><span class="lineCov">              5 :         bool operator!=(const Tag&amp; f) const { return m_id != f.m_id; }</span>
-<span class="lineNum">     179 </span><span class="lineCov">        2300524 :         bool operator&lt;(const Tag&amp; f) const { return m_id &lt; f.m_id; }</span>
-<span class="lineNum">     180 </span>                : 
-<span class="lineNum">     181 </span><span class="lineCov">              1 :         operator bool() const { return m_id != -1; }</span>
-<span class="lineNum">     182 </span><span class="lineCov">         324422 :         bool valid() const { return m_id != -1; }</span>
-<span class="lineNum">     183 </span>                : 
-<span class="lineNum">     184 </span>                :         Facet facet() const;
-<span class="lineNum">     185 </span>                : 
-<span class="lineNum">     186 </span>                :         /**
-<span class="lineNum">     187 </span>                :          * Return the name of the tag, without the facet:: prefix
-<span class="lineNum">     188 </span>                :          * @throws std::out_of_range if the tag is not valid
-<span class="lineNum">     189 </span>                :          */
-<span class="lineNum">     190 </span>                :         std::string name() const;
-<span class="lineNum">     191 </span>                :         /**
-<span class="lineNum">     192 </span>                :          * Return the short description of the tag
-<span class="lineNum">     193 </span>                :          *
-<span class="lineNum">     194 </span>                :          * Returns d if the tag is not valid.
-<span class="lineNum">     195 </span>                :          */
-<span class="lineNum">     196 </span>                :         std::string name(const std::string&amp; d) const;
-<span class="lineNum">     197 </span>                : 
-<span class="lineNum">     198 </span>                :         /**
-<span class="lineNum">     199 </span>                :          * Return the name of the tag, with the facet:: prefix
-<span class="lineNum">     200 </span>                :          * @throws std::out_of_range if the tag is not valid
-<span class="lineNum">     201 </span>                :          */
-<span class="lineNum">     202 </span>                :         std::string fullname() const;
-<span class="lineNum">     203 </span>                :         /**
-<span class="lineNum">     204 </span>                :          * Return the short description of the tag
-<span class="lineNum">     205 </span>                :          *
-<span class="lineNum">     206 </span>                :          * Returns d if the tag is not valid.
-<span class="lineNum">     207 </span>                :          */
-<span class="lineNum">     208 </span>                :         std::string fullname(const std::string&amp; d) const;
-<span class="lineNum">     209 </span>                : 
-<span class="lineNum">     210 </span>                :         /**
-<span class="lineNum">     211 </span>                :          * Return the short description of the tag
-<span class="lineNum">     212 </span>                :          * @throws std::out_of_range if the tag is not valid
-<span class="lineNum">     213 </span>                :          */
-<span class="lineNum">     214 </span>                :         std::string shortDescription() const;
-<span class="lineNum">     215 </span>                :         /**
-<span class="lineNum">     216 </span>                :          * Return the short description of the tag
-<span class="lineNum">     217 </span>                :          *
-<span class="lineNum">     218 </span>                :          * Returns d if the tag is not valid.
-<span class="lineNum">     219 </span>                :          */
-<span class="lineNum">     220 </span>                :         std::string shortDescription(const std::string&amp; d) const;
-<span class="lineNum">     221 </span>                : 
-<span class="lineNum">     222 </span>                :         /**
-<span class="lineNum">     223 </span>                :          * Return the long description of the tag
-<span class="lineNum">     224 </span>                :          *
-<span class="lineNum">     225 </span>                :          * @throws std::out_of_range if the tag is not valid
-<span class="lineNum">     226 </span>                :          */
-<span class="lineNum">     227 </span>                :         std::string longDescription() const;
-<span class="lineNum">     228 </span>                :         /**
-<span class="lineNum">     229 </span>                :          * Return the long description of the tag
-<span class="lineNum">     230 </span>                :          *
-<span class="lineNum">     231 </span>                :          * Returns d if the tag is not valid.
-<span class="lineNum">     232 </span>                :          */
-<span class="lineNum">     233 </span>                :         std::string longDescription(const std::string&amp; d) const;
-<span class="lineNum">     234 </span>                : 
-<span class="lineNum">     235 </span>                :         /**
-<span class="lineNum">     236 </span>                :          * Return the ID of this tag
-<span class="lineNum">     237 </span>                :          *
-<span class="lineNum">     238 </span>                :          * @warning This method is exported to help in writing tests, but it is not
-<span class="lineNum">     239 </span>                :          * part of the normal API: do not use it, because future implementations may
-<span class="lineNum">     240 </span>                :          * not be based on IDs and therefore not have this method.
-<span class="lineNum">     241 </span>                :          */
-<span class="lineNum">     242 </span><span class="lineCov">         106853 :         int id() const { return m_id; }</span>
-<span class="lineNum">     243 </span>                : 
-<span class="lineNum">     244 </span>                :         friend class Vocabulary;
-<span class="lineNum">     245 </span>                : };
-<span class="lineNum">     246 </span>                : 
-<span class="lineNum">     247 </span>                : }
-<span class="lineNum">     248 </span>                : }
-<span class="lineNum">     249 </span>                : 
-<span class="lineNum">     250 </span>                : // vim:set ts=3 sw=3:
-<span class="lineNum">     251 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/debtags/vocabulary.cc.gcov.html b/rep/ept/debtags/vocabulary.cc.gcov.html
deleted file mode 100644
index 9ebdb82..0000000
--- a/rep/ept/debtags/vocabulary.cc.gcov.html
+++ /dev/null
@@ -1,297 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/debtags/vocabulary.cc</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/debtags</a> - vocabulary.cc</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">102</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">95.1 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">97</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /* -*- C++ -*-
-<span class="lineNum">       2 </span>                :  * Tag vocabulary access
-<span class="lineNum">       3 </span>                :  *
-<span class="lineNum">       4 </span>                :  * Copyright (C) 2003--2007  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">       5 </span>                :  *
-<span class="lineNum">       6 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">       7 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">       8 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">       9 </span>                :  * (at your option) any later version.
-<span class="lineNum">      10 </span>                :  *
-<span class="lineNum">      11 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      12 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      13 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      14 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      15 </span>                :  *
-<span class="lineNum">      16 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      17 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      18 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      19 </span>                :  */
-<span class="lineNum">      20 </span>                : 
-<span class="lineNum">      21 </span>                : #include &lt;ept/debtags/vocabulary.h&gt;
-<span class="lineNum">      22 </span>                : #include &lt;ept/debtags/maint/vocabularyindexer.h&gt;
-<span class="lineNum">      23 </span>                : #include &lt;ept/debtags/maint/debdbparser.h&gt;
-<span class="lineNum">      24 </span>                : #include &lt;ept/debtags/maint/path.h&gt;
-<span class="lineNum">      25 </span>                : 
-<span class="lineNum">      26 </span>                : #include &lt;tagcoll/input/memory.h&gt;
-<span class="lineNum">      27 </span>                : 
-<span class="lineNum">      28 </span>                : #include &lt;cstring&gt;
-<span class="lineNum">      29 </span>                : #include &lt;sstream&gt;
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : #include &lt;sys/types.h&gt;
-<span class="lineNum">      32 </span>                : #include &lt;sys/stat.h&gt;
-<span class="lineNum">      33 </span>                : #include &lt;fcntl.h&gt;
-<span class="lineNum">      34 </span>                : #include &lt;sys/mman.h&gt;
-<span class="lineNum">      35 </span>                : 
-<span class="lineNum">      36 </span>                : using namespace tagcoll;
-<span class="lineNum">      37 </span>                : 
-<span class="lineNum">      38 </span>                : namespace ept {
-<span class="lineNum">      39 </span>                : namespace debtags {
-<span class="lineNum">      40 </span>                : 
-<span class="lineNum">      41 </span><span class="lineCov">              9 : int Vocabulary::FacetIndex::id(const char* name) const</span>
-<span class="lineNum">      42 </span>                : {
-<span class="lineNum">      43 </span><span class="lineCov">              9 :         if (size() == 0) return -1;</span>
-<span class="lineNum">      44 </span>                :         int begin, end;
-<span class="lineNum">      45 </span>                : 
-<span class="lineNum">      46 </span>                :         /* Binary search */
-<span class="lineNum">      47 </span><span class="lineCov">              9 :         begin = -1, end = size();</span>
-<span class="lineNum">      48 </span><span class="lineCov">             62 :         while (end - begin &gt; 1)</span>
-<span class="lineNum">      49 </span>                :         {
-<span class="lineNum">      50 </span><span class="lineCov">             44 :                 int cur = (end + begin) / 2;</span>
-<span class="lineNum">      51 </span><span class="lineCov">             44 :                 if (strcmp(item(cur)-&gt;name, name) &gt; 0)</span>
-<span class="lineNum">      52 </span><span class="lineCov">             16 :                         end = cur;</span>
-<span class="lineNum">      53 </span>                :                 else
-<span class="lineNum">      54 </span><span class="lineCov">             28 :                         begin = cur;</span>
-<span class="lineNum">      55 </span>                :         }
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span><span class="lineCov">              9 :         if (begin == -1 || strcmp(item(begin)-&gt;name, name) != 0)</span>
-<span class="lineNum">      58 </span>                :                 //throw NotFoundException(string(&quot;looking for the ID of string &quot;) + str);
-<span class="lineNum">      59 </span><span class="lineCov">              3 :                 return -1;</span>
-<span class="lineNum">      60 </span>                :         else
-<span class="lineNum">      61 </span><span class="lineCov">              6 :                 return begin;</span>
-<span class="lineNum">      62 </span>                : }
-<span class="lineNum">      63 </span>                : 
-<span class="lineNum">      64 </span><span class="lineCov">        1105769 : int tagcmp(const char* tag1, const char* tag2)</span>
-<span class="lineNum">      65 </span>                : {
-<span class="lineNum">      66 </span><span class="lineCov">        1105769 :         const char* tsep1 = strstr(tag1, &quot;::&quot;);</span>
-<span class="lineNum">      67 </span><span class="lineCov">        1105769 :         if (tsep1 == NULL) return strcmp(tag1, tag2);</span>
-<span class="lineNum">      68 </span><span class="lineCov">        1105766 :         const char* tsep2 = strstr(tag2, &quot;::&quot;);</span>
-<span class="lineNum">      69 </span><span class="lineCov">        1105766 :         if (tsep2 == NULL) return strcmp(tag1, tag2);</span>
-<span class="lineNum">      70 </span>                : 
-<span class="lineNum">      71 </span>                :         // See what is the length of the shortest facet
-<span class="lineNum">      72 </span><span class="lineCov">        1105766 :         int len1 = tsep1 - tag1;</span>
-<span class="lineNum">      73 </span><span class="lineCov">        1105766 :         int len2 = tsep2 - tag2;</span>
-<span class="lineNum">      74 </span><span class="lineCov">        1105766 :         int minlen = len1 &lt; len2 ? len1 : len2;</span>
-<span class="lineNum">      75 </span>                : 
-<span class="lineNum">      76 </span><span class="lineCov">        1105766 :         int res = strncmp(tag1, tag2, minlen);</span>
-<span class="lineNum">      77 </span><span class="lineCov">        1105766 :         if (res != 0)</span>
-<span class="lineNum">      78 </span>                :                 // Different facets
-<span class="lineNum">      79 </span><span class="lineCov">         454813 :                 return res;</span>
-<span class="lineNum">      80 </span>                : 
-<span class="lineNum">      81 </span><span class="lineCov">         650953 :         if (len1 == len2)</span>
-<span class="lineNum">      82 </span>                :                 // If the facet is the same, compare the tags
-<span class="lineNum">      83 </span><span class="lineCov">         639402 :                 return strcmp(tsep1 + 2, tsep2 + 2);</span>
-<span class="lineNum">      84 </span>                :         else
-<span class="lineNum">      85 </span>                :                 // Two facets with similar prefixes
-<span class="lineNum">      86 </span><span class="lineCov">          11551 :                 return len1 &lt; len2 ? -1 : 1;</span>
-<span class="lineNum">      87 </span>                : }
-<span class="lineNum">      88 </span>                : 
-<span class="lineNum">      89 </span><span class="lineCov">         106377 : int Vocabulary::TagIndex::id(const char* name) const</span>
-<span class="lineNum">      90 </span>                : {
-<span class="lineNum">      91 </span><span class="lineCov">         106377 :         if (size() == 0) return -1;</span>
-<span class="lineNum">      92 </span>                :         int begin, end;
-<span class="lineNum">      93 </span>                : 
-<span class="lineNum">      94 </span>                :         /* Binary search */
-<span class="lineNum">      95 </span><span class="lineCov">         106377 :         begin = -1, end = size();</span>
-<span class="lineNum">      96 </span><span class="lineCov">        1212130 :         while (end - begin &gt; 1)</span>
-<span class="lineNum">      97 </span>                :         {
-<span class="lineNum">      98 </span><span class="lineCov">         999376 :                 int cur = (end + begin) / 2;</span>
-<span class="lineNum">      99 </span><span class="lineCov">         999376 :                 if (tagcmp(item(cur)-&gt;name, name) &gt; 0)</span>
-<span class="lineNum">     100 </span><span class="lineCov">         432389 :                         end = cur;</span>
-<span class="lineNum">     101 </span>                :                 else
-<span class="lineNum">     102 </span><span class="lineCov">         566987 :                         begin = cur;</span>
-<span class="lineNum">     103 </span>                :         }
-<span class="lineNum">     104 </span>                : 
-<span class="lineNum">     105 </span><span class="lineCov">         106377 :         if (begin == -1 || tagcmp(item(begin)-&gt;name, name) != 0)</span>
-<span class="lineNum">     106 </span>                :                 //throw NotFoundException(string(&quot;looking for the ID of string &quot;) + str);
-<span class="lineNum">     107 </span><span class="lineCov">            132 :                 return -1;</span>
-<span class="lineNum">     108 </span>                :         else
-<span class="lineNum">     109 </span><span class="lineCov">         106245 :                 return begin;</span>
-<span class="lineNum">     110 </span>                : }
-<span class="lineNum">     111 </span>                : 
-<span class="lineNum">     112 </span><span class="lineCov">             31 : Vocabulary::Vocabulary()</span>
-<span class="lineNum">     113 </span><span class="lineCov">             31 :         : voc_fd(-1), voc_size(0), voc_buf(0)</span>
-<span class="lineNum">     114 </span>                : {
-<span class="lineNum">     115 </span><span class="lineCov">             31 :         std::string vocfname;</span>
-<span class="lineNum">     116 </span><span class="lineCov">             31 :         std::string idxfname;</span>
-<span class="lineNum">     117 </span>                : 
-<span class="lineNum">     118 </span><span class="lineCov">             31 :         if (!VocabularyIndexer::obtainWorkingVocabulary(vocfname, idxfname))</span>
-<span class="lineNum">     119 </span>                :         {
-<span class="lineNum">     120 </span><span class="lineCov">              2 :                 m_timestamp = 0;</span>
-<span class="lineNum">     121 </span><span class="lineCov">              2 :                 return;</span>
-<span class="lineNum">     122 </span>                :         }
-<span class="lineNum">     123 </span>                : 
-<span class="lineNum">     124 </span><span class="lineCov">             29 :         m_timestamp = Path::timestamp(idxfname);</span>
-<span class="lineNum">     125 </span>                : 
-<span class="lineNum">     126 </span><span class="lineCov">             29 :         mastermmap.init(idxfname);</span>
-<span class="lineNum">     127 </span>                : 
-<span class="lineNum">     128 </span>                :         // Initialize the facet and tag indexes
-<span class="lineNum">     129 </span><span class="lineCov">             29 :         findex.init(mastermmap, 0);</span>
-<span class="lineNum">     130 </span><span class="lineCov">             29 :         tindex.init(mastermmap, 1);</span>
-<span class="lineNum">     131 </span>                : 
-<span class="lineNum">     132 </span>                :         // MMap the vocabulary
-<span class="lineNum">     133 </span>                : 
-<span class="lineNum">     134 </span>                :         // Open the file
-<span class="lineNum">     135 </span><span class="lineCov">             29 :         voc_fname = vocfname;</span>
-<span class="lineNum">     136 </span><span class="lineCov">             29 :         if ((voc_fd = open(voc_fname.c_str(), O_RDONLY)) == -1)</span>
-<span class="lineNum">     137 </span><span class="lineNoCov">              0 :                 throw wibble::exception::File(voc_fname, &quot;opening vocabulary file&quot;);</span>
-<span class="lineNum">     138 </span>                : 
-<span class="lineNum">     139 </span><span class="lineCov">             29 :         off_t size = lseek(voc_fd, 0, SEEK_END);</span>
-<span class="lineNum">     140 </span><span class="lineCov">             29 :         if (size == (off_t)-1)</span>
-<span class="lineNum">     141 </span><span class="lineNoCov">              0 :                 throw wibble::exception::File(voc_fname, &quot;reading the size of vocabulary file&quot;);</span>
-<span class="lineNum">     142 </span><span class="lineCov">             29 :         voc_size = size;</span>
-<span class="lineNum">     143 </span>                : 
-<span class="lineNum">     144 </span>                :         // Map the file into memory
-<span class="lineNum">     145 </span><span class="lineCov">             29 :         if ((voc_buf = (const char*)mmap(0, voc_size, PROT_READ, MAP_PRIVATE, voc_fd, 0)) == MAP_FAILED)</span>
-<span class="lineNum">     146 </span><span class="lineNoCov">              0 :                 throw wibble::exception::File(voc_fname, &quot;mmapping vocabulary file&quot;);</span>
-<span class="lineNum">     147 </span><span class="lineNoCov">              0 : }</span>
-<span class="lineNum">     148 </span>                : 
-<span class="lineNum">     149 </span><span class="lineCov">             31 : Vocabulary::~Vocabulary()</span>
-<span class="lineNum">     150 </span>                : {
-<span class="lineNum">     151 </span>                :         // Unmap and close the file
-<span class="lineNum">     152 </span><span class="lineCov">             31 :         if (voc_buf)</span>
-<span class="lineNum">     153 </span><span class="lineCov">             29 :                 munmap((void*)voc_buf, voc_size);</span>
-<span class="lineNum">     154 </span><span class="lineCov">             31 :         if (voc_fd != -1)</span>
-<span class="lineNum">     155 </span><span class="lineCov">             29 :                 close(voc_fd);</span>
-<span class="lineNum">     156 </span><span class="lineCov">             31 : }</span>
-<span class="lineNum">     157 </span>                : 
-<span class="lineNum">     158 </span><span class="lineCov">            120 : Facet Vocabulary::facetByID(int id) const</span>
-<span class="lineNum">     159 </span>                : {
-<span class="lineNum">     160 </span><span class="lineCov">            120 :         return Facet(this, id);</span>
-<span class="lineNum">     161 </span>                : }
-<span class="lineNum">     162 </span>                : 
-<span class="lineNum">     163 </span><span class="lineCov">         745056 : Tag Vocabulary::tagByID(int id) const</span>
-<span class="lineNum">     164 </span>                : {
-<span class="lineNum">     165 </span><span class="lineCov">         745056 :         return Tag(this, id);</span>
-<span class="lineNum">     166 </span>                : }
-<span class="lineNum">     167 </span>                : 
-<span class="lineNum">     168 </span><span class="lineCov">           1301 : void Vocabulary::parseVocBuf(std::map&lt;std::string, std::string&gt;&amp; res, size_t ofs, size_t len) const</span>
-<span class="lineNum">     169 </span>                : {
-<span class="lineNum">     170 </span>                :         // Access the right part of the mmapped buffer
-<span class="lineNum">     171 </span><span class="lineCov">           1301 :     std::stringstream name;</span>
-<span class="lineNum">     172 </span><span class="lineCov">           1301 :         name &lt;&lt; voc_fname &lt;&lt; '+' &lt;&lt; ofs &lt;&lt; '-' &lt;&lt; len;</span>
-<span class="lineNum">     173 </span><span class="lineCov">           1301 :         input::Memory in(name.str(), voc_buf + ofs, len);</span>
-<span class="lineNum">     174 </span><span class="lineCov">           1301 :         DebDBParser parser(in);</span>
-<span class="lineNum">     175 </span>                :         // Parse the raw string data and store it in the cache vector
-<span class="lineNum">     176 </span><span class="lineCov">           1301 :         parser.nextRecord(res);</span>
-<span class="lineNum">     177 </span>                : 
-<span class="lineNum">     178 </span><span class="lineCov">           1301 :     std::string desc = res[&quot;Description&quot;];</span>
-<span class="lineNum">     179 </span><span class="lineCov">           2602 :         if (!desc.empty())</span>
-<span class="lineNum">     180 </span>                :         {
-<span class="lineNum">     181 </span><span class="lineCov">           1298 :                 size_t pos = desc.find('\n');</span>
-<span class="lineNum">     182 </span><span class="lineCov">           1298 :                 if (pos == std::string::npos)</span>
-<span class="lineNum">     183 </span><span class="lineCov">            849 :                         res[&quot;_SD_&quot;] = desc;</span>
-<span class="lineNum">     184 </span>                :                 else
-<span class="lineNum">     185 </span><span class="lineCov">            449 :                         res[&quot;_SD_&quot;] = desc.substr(0, pos);</span>
-<span class="lineNum">     186 </span><span class="lineCov">           1301 :         }</span>
-<span class="lineNum">     187 </span><span class="lineCov">           1301 : }</span>
-<span class="lineNum">     188 </span>                : 
-<span class="lineNum">     189 </span><span class="lineCov">           1863 : std::string Vocabulary::tagShortName(int id) const</span>
-<span class="lineNum">     190 </span>                : {
-<span class="lineNum">     191 </span><span class="lineCov">           1863 :         const char* fullname = tindex.name(id);</span>
-<span class="lineNum">     192 </span><span class="lineCov">           1863 :         char* sub = strstr(fullname, &quot;::&quot;);</span>
-<span class="lineNum">     193 </span><span class="lineCov">           1863 :         if (sub != NULL)</span>
-<span class="lineNum">     194 </span><span class="lineCov">           1863 :                 return sub + 2;</span>
-<span class="lineNum">     195 </span>                :         else
-<span class="lineNum">     196 </span><span class="lineNoCov">              0 :                 return fullname;</span>
-<span class="lineNum">     197 </span>                : }
-<span class="lineNum">     198 </span>                : 
-<span class="lineNum">     199 </span><span class="lineCov">            176 : const std::map&lt;std::string, std::string&gt;&amp; Vocabulary::facetData(int id) const</span>
-<span class="lineNum">     200 </span>                : {
-<span class="lineNum">     201 </span><span class="lineCov">            176 :         if (id &lt; 0) return emptyData;</span>
-<span class="lineNum">     202 </span>                : 
-<span class="lineNum">     203 </span>                :         // Enlarge the cache vector if needed
-<span class="lineNum">     204 </span><span class="lineCov">            176 :         if ((unsigned)id &gt;= m_facetData.size())</span>
-<span class="lineNum">     205 </span><span class="lineCov">             59 :                 m_facetData.resize(id + 1);</span>
-<span class="lineNum">     206 </span>                : 
-<span class="lineNum">     207 </span><span class="lineCov">            176 :         if (m_facetData[id].empty())</span>
-<span class="lineNum">     208 </span><span class="lineCov">             59 :                 parseVocBuf(m_facetData[id], findex.offset(id), findex.size(id));</span>
-<span class="lineNum">     209 </span>                : 
-<span class="lineNum">     210 </span><span class="lineCov">            176 :         return m_facetData[id];</span>
-<span class="lineNum">     211 </span>                : }
-<span class="lineNum">     212 </span>                : 
-<span class="lineNum">     213 </span><span class="lineCov">           3722 : const std::map&lt;std::string, std::string&gt;&amp; Vocabulary::tagData(int id) const</span>
-<span class="lineNum">     214 </span>                : {
-<span class="lineNum">     215 </span><span class="lineCov">           3722 :         if (id &lt; 0) return emptyData;</span>
-<span class="lineNum">     216 </span>                : 
-<span class="lineNum">     217 </span>                :         // Enlarge the cache vector if needed
-<span class="lineNum">     218 </span><span class="lineCov">           3722 :         if ((unsigned)id &gt;= m_tagData.size())</span>
-<span class="lineNum">     219 </span><span class="lineCov">           1242 :                 m_tagData.resize(id + 1);</span>
-<span class="lineNum">     220 </span>                : 
-<span class="lineNum">     221 </span><span class="lineCov">           3722 :         if (m_tagData[id].empty())</span>
-<span class="lineNum">     222 </span><span class="lineCov">           1242 :                 parseVocBuf(m_tagData[id], tindex.offset(id), tindex.size(id));</span>
-<span class="lineNum">     223 </span>                : 
-<span class="lineNum">     224 </span><span class="lineCov">           3722 :         return m_tagData[id];</span>
-<span class="lineNum">     225 </span>                : }
-<span class="lineNum">     226 </span>                : 
-<span class="lineNum">     227 </span>                : }
-<span class="lineNum">     228 </span><span class="lineCov">              6 : }</span>
-<span class="lineNum">     229 </span>                : 
-<span class="lineNum">     230 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/debtags/vocabulary.h.gcov.html b/rep/ept/debtags/vocabulary.h.gcov.html
deleted file mode 100644
index b110f8c..0000000
--- a/rep/ept/debtags/vocabulary.h.gcov.html
+++ /dev/null
@@ -1,349 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/debtags/vocabulary.h</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/debtags</a> - vocabulary.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">55</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">87.3 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">48</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #ifndef EPT_DEBTAGS_VOCABULARY_H
-<span class="lineNum">       2 </span>                : #define EPT_DEBTAGS_VOCABULARY_H
-<span class="lineNum">       3 </span>                : 
-<span class="lineNum">       4 </span>                : /** @file
-<span class="lineNum">       5 </span>                :  * @author Enrico Zini &lt;enrico@enricozini.org&gt;
-<span class="lineNum">       6 </span>                :  * Debtags vocabulary access
-<span class="lineNum">       7 </span>                :  */
-<span class="lineNum">       8 </span>                : 
-<span class="lineNum">       9 </span>                : /*
-<span class="lineNum">      10 </span>                :  * Copyright (C) 2003,2004,2005,2006,2007  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">      11 </span>                :  *
-<span class="lineNum">      12 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">      13 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">      14 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">      15 </span>                :  * (at your option) any later version.
-<span class="lineNum">      16 </span>                :  *
-<span class="lineNum">      17 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      18 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      19 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      20 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      21 </span>                :  *
-<span class="lineNum">      22 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      23 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      24 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      25 </span>                :  */
-<span class="lineNum">      26 </span>                : 
-<span class="lineNum">      27 </span>                : #include &lt;ept/debtags/tag.h&gt;
-<span class="lineNum">      28 </span>                : #include &lt;tagcoll/diskindex/mmap.h&gt;
-<span class="lineNum">      29 </span>                : 
-<span class="lineNum">      30 </span>                : #include &lt;string&gt;
-<span class="lineNum">      31 </span>                : #include &lt;vector&gt;
-<span class="lineNum">      32 </span>                : #include &lt;map&gt;
-<span class="lineNum">      33 </span>                : 
-<span class="lineNum">      34 </span>                : namespace ept {
-<span class="lineNum">      35 </span>                : namespace debtags {
-<span class="lineNum">      36 </span>                : 
-<span class="lineNum">      37 </span>                : class Vocabulary
-<span class="lineNum">      38 </span>                : {
-<span class="lineNum">      39 </span>                : public:
-<span class="lineNum">      40 </span>                :         class FacetIndex : public tagcoll::diskindex::MMap
-<span class="lineNum">      41 </span>                :         {
-<span class="lineNum">      42 </span>                :         protected:
-<span class="lineNum">      43 </span>                :                 // Layout of the data in the index
-<span class="lineNum">      44 </span>                :                 struct Item {
-<span class="lineNum">      45 </span>                :                         int offset;
-<span class="lineNum">      46 </span>                :                         int size;
-<span class="lineNum">      47 </span>                :                         int firsttag;
-<span class="lineNum">      48 </span>                :                         int lasttag;
-<span class="lineNum">      49 </span>                :                         const char name[];
-<span class="lineNum">      50 </span>                :                 };
-<span class="lineNum">      51 </span><span class="lineCov">           2393 :                 inline Item* item(int id) const</span>
-<span class="lineNum">      52 </span>                :                 {
-<span class="lineNum">      53 </span><span class="lineCov">           2393 :                         if (id &gt;= 0 &amp;&amp; (unsigned)id &lt; size())</span>
-<span class="lineNum">      54 </span><span class="lineCov">           2392 :                                 return (Item*)(m_buf + ((int*)m_buf)[id]);</span>
-<span class="lineNum">      55 </span><span class="lineCov">              1 :                         return NULL;</span>
-<span class="lineNum">      56 </span>                :                 }
-<span class="lineNum">      57 </span>                : 
-<span class="lineNum">      58 </span>                :         public:
-<span class="lineNum">      59 </span><span class="lineCov">             31 :                 FacetIndex() : tagcoll::diskindex::MMap() {}</span>
-<span class="lineNum">      60 </span>                :                 FacetIndex(const tagcoll::diskindex::MasterMMap&amp; master, size_t idx)
-<span class="lineNum">      61 </span>                :                         : tagcoll::diskindex::MMap(master, idx) {}
-<span class="lineNum">      62 </span>                : 
-<span class="lineNum">      63 </span>                :                 /// Get the number of facets in the index
-<span class="lineNum">      64 </span><span class="lineCov">           2501 :                 size_t size() const { return m_size == 0 ? 0 :  *(int*)m_buf / sizeof(int); }</span>
-<span class="lineNum">      65 </span>                :                 /// Get the offset of the facet data in the vocabulary for this facet
-<span class="lineNum">      66 </span><span class="lineCov">             59 :                 size_t offset(int id) const { Item* i = item(id); return i == NULL ? 0 : i-&gt;offset; }</span>
-<span class="lineNum">      67 </span>                :                 /// Get the size of the facet data in the vocabulary for this facet
-<span class="lineNum">      68 </span><span class="lineCov">             59 :                 size_t size(int id) const { Item* i = item(id); return i == NULL ? 0 : i-&gt;size; }</span>
-<span class="lineNum">      69 </span>                :                 /// Get the id of the first tag for this facet
-<span class="lineNum">      70 </span><span class="lineCov">             91 :                 int firsttag(int id) const { Item* i = item(id); return i == NULL ? -1 : i-&gt;firsttag; }</span>
-<span class="lineNum">      71 </span>                :                 /// Get the id of the last tag for this facet
-<span class="lineNum">      72 </span><span class="lineCov">           2043 :                 int lasttag(int id) const { Item* i = item(id); return i == NULL ? -1 : i-&gt;lasttag; }</span>
-<span class="lineNum">      73 </span>                :                 /// Get the name of this facet
-<span class="lineNum">      74 </span><span class="lineCov">             88 :                 const char* name(int id) const { Item* i = item(id); return i == NULL ? &quot;&quot; : i-&gt;name; }</span>
-<span class="lineNum">      75 </span>                :                 /// Get the ID of the facet with this name
-<span class="lineNum">      76 </span>                :                 int id(const char* name) const;
-<span class="lineNum">      77 </span><span class="lineCov">              7 :                 int id(const std::string&amp; name) const { return id(name.c_str()); }</span>
-<span class="lineNum">      78 </span>                :         };
-<span class="lineNum">      79 </span>                :         
-<span class="lineNum">      80 </span>                :         class TagIndex : public tagcoll::diskindex::MMap
-<span class="lineNum">      81 </span>                :         {
-<span class="lineNum">      82 </span>                :         protected:
-<span class="lineNum">      83 </span>                :                 // Layout of the data in the index
-<span class="lineNum">      84 </span>                :                 struct Item {
-<span class="lineNum">      85 </span>                :                         int offset;
-<span class="lineNum">      86 </span>                :                         int size;
-<span class="lineNum">      87 </span>                :                         int facet;
-<span class="lineNum">      88 </span>                :                         const char name[];
-<span class="lineNum">      89 </span>                :                 };
-<span class="lineNum">      90 </span><span class="lineCov">        1112004 :                 inline Item* item(int id) const</span>
-<span class="lineNum">      91 </span>                :                 {
-<span class="lineNum">      92 </span><span class="lineCov">        1112004 :                         if (id &gt;= 0 &amp;&amp; (unsigned)id &lt; size())</span>
-<span class="lineNum">      93 </span><span class="lineCov">        1112004 :                                 return (Item*)(m_buf + ((int*)m_buf)[id]);</span>
-<span class="lineNum">      94 </span><span class="lineNoCov">              0 :                         return NULL;</span>
-<span class="lineNum">      95 </span>                :                 }
-<span class="lineNum">      96 </span>                : 
-<span class="lineNum">      97 </span>                :         public:
-<span class="lineNum">      98 </span><span class="lineCov">             31 :                 TagIndex() : tagcoll::diskindex::MMap() {}</span>
-<span class="lineNum">      99 </span>                :                 TagIndex(const tagcoll::diskindex::MasterMMap&amp; master, size_t idx)
-<span class="lineNum">     100 </span>                :                         : tagcoll::diskindex::MMap(master, idx) {}
-<span class="lineNum">     101 </span>                : 
-<span class="lineNum">     102 </span>                :                 /// Get the number of tags in the index
-<span class="lineNum">     103 </span><span class="lineCov">        1327864 :                 size_t size() const { return m_size == 0 ? 0 : *(int*)m_buf / sizeof(int); }</span>
-<span class="lineNum">     104 </span>                :                 /// Get the offset of the facet data in the vocabulary for this tag
-<span class="lineNum">     105 </span><span class="lineCov">           1242 :                 size_t offset(int id) const { Item* i = item(id); return i == NULL ? 0 : i-&gt;offset; }</span>
-<span class="lineNum">     106 </span>                :                 /// Get the size of the facet data in the vocabulary for this tag
-<span class="lineNum">     107 </span><span class="lineCov">           1242 :                 size_t size(int id) const { Item* i = item(id); return i == NULL ? 0 : i-&gt;size; }</span>
-<span class="lineNum">     108 </span>                :                 /// Get the id of the facet for this tag
-<span class="lineNum">     109 </span><span class="lineNoCov">              0 :                 int facet(int id) const { Item* i = item(id); return i == NULL ? -1 : i-&gt;facet; }</span>
-<span class="lineNum">     110 </span>                :                 /// Get the name of this tag
-<span class="lineNum">     111 </span><span class="lineCov">           3767 :                 const char* name(int id) const { Item* i = item(id); return i == NULL ? &quot;&quot; : i-&gt;name; }</span>
-<span class="lineNum">     112 </span>                :                 /// Get the ID of the tag with this name
-<span class="lineNum">     113 </span>                :                 int id(const char* name) const;
-<span class="lineNum">     114 </span><span class="lineCov">         105755 :                 int id(const std::string&amp; name) const { return id(name.c_str()); }</span>
-<span class="lineNum">     115 </span>                :         };
-<span class="lineNum">     116 </span>                : 
-<span class="lineNum">     117 </span>                : protected:
-<span class="lineNum">     118 </span>                :         // Master MMap index container
-<span class="lineNum">     119 </span>                :         tagcoll::diskindex::MasterMMap mastermmap;
-<span class="lineNum">     120 </span>                : 
-<span class="lineNum">     121 </span>                :         time_t m_timestamp;
-<span class="lineNum">     122 </span>                : 
-<span class="lineNum">     123 </span>                :         // Mmapped vocabulary file
-<span class="lineNum">     124 </span>                :         std::string voc_fname;
-<span class="lineNum">     125 </span>                :         int voc_fd;
-<span class="lineNum">     126 </span>                :         size_t voc_size;
-<span class="lineNum">     127 </span>                :         const char* voc_buf;
-<span class="lineNum">     128 </span>                :         
-<span class="lineNum">     129 </span>                :         // Facet and tag indexes
-<span class="lineNum">     130 </span>                :         FacetIndex findex;
-<span class="lineNum">     131 </span>                :         TagIndex tindex;
-<span class="lineNum">     132 </span>                :         
-<span class="lineNum">     133 </span>                :         // Cached parsed facet and tag records
-<span class="lineNum">     134 </span>                :         mutable std::vector&lt; std::map&lt;std::string, std::string&gt; &gt; m_facetData;
-<span class="lineNum">     135 </span>                :         mutable std::vector&lt; std::map&lt;std::string, std::string&gt; &gt; m_tagData;
-<span class="lineNum">     136 </span>                :         // Empty parsed data to return when data is asked for IDs == -1
-<span class="lineNum">     137 </span>                :         std::map&lt;std::string, std::string&gt; emptyData;
-<span class="lineNum">     138 </span>                : 
-<span class="lineNum">     139 </span>                :         void parseVocBuf(std::map&lt;std::string, std::string&gt;&amp; res, size_t ofs, size_t len) const;
-<span class="lineNum">     140 </span>                : 
-<span class="lineNum">     141 </span>                : public:
-<span class="lineNum">     142 </span>                :         Vocabulary();
-<span class="lineNum">     143 </span>                :         ~Vocabulary();
-<span class="lineNum">     144 </span>                : 
-<span class="lineNum">     145 </span>                :         /// Get the timestamp of when the index was last updated
-<span class="lineNum">     146 </span>                :         time_t timestamp() const { return m_timestamp; }
-<span class="lineNum">     147 </span>                : 
-<span class="lineNum">     148 </span>                :         /// Return true if this data source has data, false if it's empty
-<span class="lineNum">     149 </span><span class="lineCov">              1 :         bool hasData() const { return m_timestamp != 0; }</span>
-<span class="lineNum">     150 </span>                : 
-<span class="lineNum">     151 </span>                :         const FacetIndex&amp; facetIndex() const { return findex; }
-<span class="lineNum">     152 </span>                :         const TagIndex&amp; tagIndex() const { return tindex; }
-<span class="lineNum">     153 </span>                : 
-<span class="lineNum">     154 </span>                :         /**
-<span class="lineNum">     155 </span>                :          * Check if the vocabulary contains the facet `name'
-<span class="lineNum">     156 </span>                :          */
-<span class="lineNum">     157 </span><span class="lineCov">              2 :         bool hasFacet(const std::string&amp; name) const</span>
-<span class="lineNum">     158 </span>                :         {
-<span class="lineNum">     159 </span><span class="lineCov">              2 :                 return findex.id(name.c_str()) != -1;</span>
-<span class="lineNum">     160 </span>                :         }
-<span class="lineNum">     161 </span>                : 
-<span class="lineNum">     162 </span>                :         /**
-<span class="lineNum">     163 </span>                :          * Check if the vocabulary contains the tag `fullname'
-<span class="lineNum">     164 </span>                :          */
-<span class="lineNum">     165 </span><span class="lineCov">            622 :         bool hasTag(const std::string&amp; fullname) const</span>
-<span class="lineNum">     166 </span>                :         {
-<span class="lineNum">     167 </span><span class="lineCov">            622 :                 return tindex.id(fullname.c_str()) != -1;</span>
-<span class="lineNum">     168 </span>                :         }
-<span class="lineNum">     169 </span>                : 
-<span class="lineNum">     170 </span>                :         /**
-<span class="lineNum">     171 </span>                :          * Return the facet with the given name
-<span class="lineNum">     172 </span>                :          */
-<span class="lineNum">     173 </span>                :         Facet facetByID(int id) const;
-<span class="lineNum">     174 </span>                : 
-<span class="lineNum">     175 </span>                :         /**
-<span class="lineNum">     176 </span>                :          * Return the tag with the given full name
-<span class="lineNum">     177 </span>                :          */
-<span class="lineNum">     178 </span>                :         Tag tagByID(int id) const;
-<span class="lineNum">     179 </span>                : 
-<span class="lineNum">     180 </span>                :         template&lt;typename IDS&gt;
-<span class="lineNum">     181 </span><span class="lineCov">          84590 :         std::set&lt;Tag&gt; tagsByID(const IDS&amp; ids) const</span>
-<span class="lineNum">     182 </span>                :         {
-<span class="lineNum">     183 </span><span class="lineCov">          84590 :                 std::set&lt;Tag&gt; res;</span>
-<span class="lineNum">     184 </span><span class="lineCov">         507017 :                 for (typename IDS::const_iterator i = ids.begin();</span>
-<span class="lineNum">     185 </span>                :                                 i != ids.end(); ++i)
-<span class="lineNum">     186 </span><span class="lineCov">         422427 :                         res.insert(tagByID(*i));</span>
-<span class="lineNum">     187 </span><span class="lineNoCov">              0 :                 return res;</span>
-<span class="lineNum">     188 </span>                :         }
-<span class="lineNum">     189 </span>                : 
-<span class="lineNum">     190 </span>                :         /**
-<span class="lineNum">     191 </span>                :          * Return the facet for the tag with the given ID
-<span class="lineNum">     192 </span>                :          */
-<span class="lineNum">     193 </span><span class="lineNoCov">              0 :         Facet facetByTag(int id) const { return facetByID(tindex.facet(id)); }</span>
-<span class="lineNum">     194 </span>                : 
-<span class="lineNum">     195 </span>                :         /**
-<span class="lineNum">     196 </span>                :          * Return the facet with the given name
-<span class="lineNum">     197 </span>                :          */
-<span class="lineNum">     198 </span><span class="lineCov">              4 :         Facet facetByName(const std::string&amp; name) const { return facetByID(findex.id(name)); }</span>
-<span class="lineNum">     199 </span>                : 
-<span class="lineNum">     200 </span>                :         /**
-<span class="lineNum">     201 </span>                :          * Return the tag with the given full name
-<span class="lineNum">     202 </span>                :          */
-<span class="lineNum">     203 </span><span class="lineCov">         105755 :         Tag tagByName(const std::string&amp; fullname) const { return tagByID(tindex.id(fullname)); }</span>
-<span class="lineNum">     204 </span>                : 
-<span class="lineNum">     205 </span>                :         /**
-<span class="lineNum">     206 </span>                :          * Return all the facets in the vocabulary
-<span class="lineNum">     207 </span>                :          */
-<span class="lineNum">     208 </span><span class="lineCov">              4 :         std::set&lt; Facet &gt; facets() const</span>
-<span class="lineNum">     209 </span>                :         {
-<span class="lineNum">     210 </span><span class="lineCov">              4 :                 std::set&lt; Facet &gt; res;</span>
-<span class="lineNum">     211 </span><span class="lineCov">             91 :                 for (size_t i = 0; i &lt; findex.size(); i++)</span>
-<span class="lineNum">     212 </span><span class="lineCov">             87 :                         res.insert(facetByID(i));</span>
-<span class="lineNum">     213 </span><span class="lineNoCov">              0 :                 return res;</span>
-<span class="lineNum">     214 </span>                :         }
-<span class="lineNum">     215 </span>                : 
-<span class="lineNum">     216 </span>                :         /**
-<span class="lineNum">     217 </span>                :          * Return all the tags in the vocabulary
-<span class="lineNum">     218 </span>                :          */
-<span class="lineNum">     219 </span><span class="lineCov">              6 :         std::set&lt; Tag &gt; tags() const</span>
-<span class="lineNum">     220 </span>                :         {
-<span class="lineNum">     221 </span><span class="lineCov">              6 :                 std::set&lt; Tag &gt; res;</span>
-<span class="lineNum">     222 </span><span class="lineCov">           3106 :                 for (size_t i = 0; i &lt; tindex.size(); i++)</span>
-<span class="lineNum">     223 </span><span class="lineCov">           3100 :                         res.insert(tagByID(i));</span>
-<span class="lineNum">     224 </span><span class="lineNoCov">              0 :                 return res;</span>
-<span class="lineNum">     225 </span>                :         }
-<span class="lineNum">     226 </span>                : 
-<span class="lineNum">     227 </span>                :         /**
-<span class="lineNum">     228 </span>                :          * Return the tags in the given facet
-<span class="lineNum">     229 </span>                :          */
-<span class="lineNum">     230 </span><span class="lineCov">             91 :         std::set&lt; Tag &gt; tags(int facet) const</span>
-<span class="lineNum">     231 </span>                :         {
-<span class="lineNum">     232 </span><span class="lineCov">             91 :                 std::set&lt; Tag &gt; res;</span>
-<span class="lineNum">     233 </span><span class="lineCov">           2044 :                 for (int i = findex.firsttag(facet); i != -1 &amp;&amp; i &lt;= findex.lasttag(facet); i++)</span>
-<span class="lineNum">     234 </span><span class="lineCov">           1953 :                         res.insert(tagByID(i));</span>
-<span class="lineNum">     235 </span><span class="lineNoCov">              0 :                 return res;</span>
-<span class="lineNum">     236 </span>                :         }
-<span class="lineNum">     237 </span>                : 
-<span class="lineNum">     238 </span><span class="lineCov">              3 :         std::set&lt; Tag &gt; tags(const std::string&amp; facetName) const</span>
-<span class="lineNum">     239 </span>                :         {
-<span class="lineNum">     240 </span><span class="lineCov">              3 :                 return tags(findex.id(facetName));</span>
-<span class="lineNum">     241 </span>                :         }
-<span class="lineNum">     242 </span>                : 
-<span class="lineNum">     243 </span>                :         std::set&lt; Tag &gt; tags(const Facet&amp; facet) const
-<span class="lineNum">     244 </span>                :         {
-<span class="lineNum">     245 </span>                :                 return tags(facet.id());
-<span class="lineNum">     246 </span>                :         }
-<span class="lineNum">     247 </span>                : 
-<span class="lineNum">     248 </span>                : #if 0
-<span class="lineNum">     249 </span>                :         /// Get the DerivedTagList with the Equates: expressions read from the vocabulary
-<span class="lineNum">     250 </span>                :         const DerivedTagList&amp; getEquations() const throw () { return equations; }
-<span class="lineNum">     251 </span>                :         
-<span class="lineNum">     252 </span>                :         /// Get a set with all the facets present in the vocabulary that are matched by `filter'
-<span class="lineNum">     253 </span>                :         FacetSet facets(const FacetMatcher&amp; filter) const throw () { return getFiltered(filter); }
-<span class="lineNum">     254 </span>                : #endif
-<span class="lineNum">     255 </span>                : 
-<span class="lineNum">     256 </span>                : #if 0
-<span class="lineNum">     257 </span>                :         // These functions are here just to be used by Facet and Tag.  I'm not
-<span class="lineNum">     258 </span>                :         // making them private because I don't want Facet and Tag to access other
-<span class="lineNum">     259 </span>                :         // Vocabulary member, and other classes can't use these anyway as Facet::Data and
-<span class="lineNum">     260 </span>                :         // Tag::Data are protected
-<span class="lineNum">     261 </span>                :         const Facet::Data&amp; facetData(int idx) { return m_facets[idx]; }
-<span class="lineNum">     262 </span>                :         const Tag::Data&amp; tagData(int idx) { return m_tags[idx]; }
-<span class="lineNum">     263 </span>                : #endif
-<span class="lineNum">     264 </span>                : 
-<span class="lineNum">     265 </span>                :         /// Get the facet name given the facet id
-<span class="lineNum">     266 </span><span class="lineCov">             88 :         std::string facetName(int id) const { return findex.name(id); }</span>
-<span class="lineNum">     267 </span>                : 
-<span class="lineNum">     268 </span>                :         /// Get the tag name given the tag id
-<span class="lineNum">     269 </span><span class="lineCov">           1904 :         std::string tagName(int id) const { return tindex.name(id); }</span>
-<span class="lineNum">     270 </span>                : 
-<span class="lineNum">     271 </span>                :         /// Get the tag name given the tag id
-<span class="lineNum">     272 </span>                :         std::string tagShortName(int id) const;
-<span class="lineNum">     273 </span>                : 
-<span class="lineNum">     274 </span>                :         const std::map&lt;std::string, std::string&gt;&amp; facetData(int id) const;
-<span class="lineNum">     275 </span>                :         const std::map&lt;std::string, std::string&gt;&amp; tagData(int id) const;
-<span class="lineNum">     276 </span>                : };
-<span class="lineNum">     277 </span>                : 
-<span class="lineNum">     278 </span>                : }
-<span class="lineNum">     279 </span>                : }
-<span class="lineNum">     280 </span>                : 
-<span class="lineNum">     281 </span>                : // vim:set ts=4 sw=4:
-<span class="lineNum">     282 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/debtags/vocabulary.test.h.gcov.html b/rep/ept/debtags/vocabulary.test.h.gcov.html
deleted file mode 100644
index b5b697a..0000000
--- a/rep/ept/debtags/vocabulary.test.h.gcov.html
+++ /dev/null
@@ -1,385 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/debtags/vocabulary.test.h</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/debtags</a> - vocabulary.test.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">173</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">99.4 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">172</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /*
-<span class="lineNum">       2 </span>                :  * Tag vocabulary access
-<span class="lineNum">       3 </span>                :  *
-<span class="lineNum">       4 </span>                :  * Copyright (C) 2003--2007  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">       5 </span>                :  *
-<span class="lineNum">       6 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">       7 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">       8 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">       9 </span>                :  * (at your option) any later version.
-<span class="lineNum">      10 </span>                :  *
-<span class="lineNum">      11 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      12 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      13 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      14 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      15 </span>                :  *
-<span class="lineNum">      16 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      17 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      18 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      19 </span>                :  */
-<span class="lineNum">      20 </span>                : 
-<span class="lineNum">      21 </span>                : #include &lt;wibble/test.h&gt;
-<span class="lineNum">      22 </span>                : #include &lt;ept/debtags/vocabulary.h&gt;
-<span class="lineNum">      23 </span>                : #include &lt;ept/debtags/maint/vocabularymerger.h&gt;
-<span class="lineNum">      24 </span>                : #include &lt;ept/debtags/maint/path.h&gt;
-<span class="lineNum">      25 </span>                : #include &lt;tagcoll/utils/set.h&gt;
-<span class="lineNum">      26 </span>                : #include &lt;tagcoll/input/stdio.h&gt;
-<span class="lineNum">      27 </span>                : 
-<span class="lineNum">      28 </span>                : #include &quot;debtags.test.h&quot;
-<span class="lineNum">      29 </span>                : 
-<span class="lineNum">      30 </span>                : // This is not exported by default
-<span class="lineNum">      31 </span>                : namespace ept {
-<span class="lineNum">      32 </span>                : namespace debtags {
-<span class="lineNum">      33 </span>                : int tagcmp(const char* tag1, const char* tag2);
-<span class="lineNum">      34 </span>                : }
-<span class="lineNum">      35 </span>                : }
-<span class="lineNum">      36 </span>                : 
-<span class="lineNum">      37 </span>                : using namespace std;
-<span class="lineNum">      38 </span>                : using namespace tagcoll::utils;
-<span class="lineNum">      39 </span>                : using namespace ept::debtags;
-<span class="lineNum">      40 </span>                : 
-<span class="lineNum">      41 </span>                : struct TestVocabulary : DebtagsTestEnvironment
-<span class="lineNum">      42 </span><span class="lineCov">             38 : {</span>
-<span class="lineNum">      43 </span>                :         Vocabulary  m_tags;
-<span class="lineNum">      44 </span><span class="lineCov">           1298 :         Vocabulary&amp; tags() { return m_tags; }</span>
-<span class="lineNum">      45 </span>                : 
-<span class="lineNum">      46 </span><span class="lineCov">              1 :         Test _1()</span>
-<span class="lineNum">      47 </span>                : {
-<span class="lineNum">      48 </span><span class="lineCov">              1 :     tags(); // this will throw if the open above didn't work</span>
-<span class="lineNum">      49 </span><span class="lineCov">              1 : }</span>
-<span class="lineNum">      50 </span>                : 
-<span class="lineNum">      51 </span><span class="lineCov">              1 :         Test _2()</span>
-<span class="lineNum">      52 </span>                : {
-<span class="lineNum">      53 </span><span class="lineCov">              1 :     assert( tags().hasFacet( &quot;works-with&quot; ) );</span>
-<span class="lineNum">      54 </span><span class="lineCov">              2 :     assert( !tags().hasFacet( &quot;blah&quot; ) );</span>
-<span class="lineNum">      55 </span><span class="lineCov">              1 : }</span>
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span><span class="lineCov">              1 :         Test _3()</span>
-<span class="lineNum">      58 </span>                : {
-<span class="lineNum">      59 </span><span class="lineCov">              1 :     assert( tags().hasTag( &quot;works-with::people&quot; ) );</span>
-<span class="lineNum">      60 </span><span class="lineCov">              2 :     assert( !tags().hasTag( &quot;works-with::midgets&quot; ) );</span>
-<span class="lineNum">      61 </span><span class="lineCov">              1 : }</span>
-<span class="lineNum">      62 </span>                : 
-<span class="lineNum">      63 </span><span class="lineCov">              1 :         Test _4()</span>
-<span class="lineNum">      64 </span>                : {
-<span class="lineNum">      65 </span><span class="lineCov">              1 :     Tag people = tags().tagByName( &quot;works-with::people&quot; ),</span>
-<span class="lineNum">      66 </span><span class="lineCov">              2 :                 midgets = tags().tagByName( &quot;works-with::midgets&quot; ),</span>
-<span class="lineNum">      67 </span><span class="lineCov">              2 :                 blahg = tags().tagByName( &quot;works-with::blahg&quot; ),</span>
-<span class="lineNum">      68 </span><span class="lineCov">              2 :                 text = tags().tagByName( &quot;works-with::text&quot; ),</span>
-<span class="lineNum">      69 </span><span class="lineCov">              2 :                 people2 = tags().tagByName( &quot;works-with::people&quot; );</span>
-<span class="lineNum">      70 </span><span class="lineCov">              2 :     assert( people != midgets );</span>
-<span class="lineNum">      71 </span><span class="lineCov">              2 :     assert( people != text );</span>
-<span class="lineNum">      72 </span><span class="lineCov">              2 :     assert( people != blahg );</span>
-<span class="lineNum">      73 </span><span class="lineCov">              2 :     assert( midgets == blahg );</span>
-<span class="lineNum">      74 </span><span class="lineCov">              2 :     assert( midgets == midgets );</span>
-<span class="lineNum">      75 </span><span class="lineCov">              2 :     assert( people == people2 );</span>
-<span class="lineNum">      76 </span><span class="lineCov">              2 :     assert( people == people );</span>
-<span class="lineNum">      77 </span><span class="lineCov">              1 : }</span>
-<span class="lineNum">      78 </span>                : 
-<span class="lineNum">      79 </span><span class="lineCov">              1 :         Test _5()</span>
-<span class="lineNum">      80 </span>                : {
-<span class="lineNum">      81 </span><span class="lineCov">              1 :     Tag a = tags().tagByName( &quot;works-with::people&quot; ),</span>
-<span class="lineNum">      82 </span><span class="lineCov">              2 :                 b = tags().tagByName( &quot;works-with::midgets&quot; );</span>
-<span class="lineNum">      83 </span><span class="lineCov">              2 :         std::set&lt; Tag &gt; s = tags().tags(),</span>
-<span class="lineNum">      84 </span><span class="lineCov">              1 :                          f = tags().tags( &quot;works-with&quot; ),</span>
-<span class="lineNum">      85 </span><span class="lineCov">              2 :                          n = tags().tags( &quot;nonsense&quot; );</span>
-<span class="lineNum">      86 </span><span class="lineCov">              2 :     assert( set_contains(s, a) );</span>
-<span class="lineNum">      87 </span><span class="lineCov">              2 :     assert( set_contains(f, a) );</span>
-<span class="lineNum">      88 </span><span class="lineCov">              2 :     assert( set_contains(s, f) );</span>
-<span class="lineNum">      89 </span><span class="lineCov">              2 :     assert( !set_contains(s, b) );</span>
-<span class="lineNum">      90 </span><span class="lineCov">              2 :     assert( !set_contains(f, b) );</span>
-<span class="lineNum">      91 </span><span class="lineCov">              2 :     assert( n.empty() );</span>
-<span class="lineNum">      92 </span><span class="lineCov">              1 : }</span>
-<span class="lineNum">      93 </span>                : 
-<span class="lineNum">      94 </span><span class="lineCov">              1 :         Test _6()</span>
-<span class="lineNum">      95 </span>                : {
-<span class="lineNum">      96 </span><span class="lineCov">              1 :         Facet f = tags().facetByName( &quot;works-with&quot; );</span>
-<span class="lineNum">      97 </span><span class="lineCov">              2 :     Tag t = tags().tagByName( &quot;works-with::people&quot; );</span>
-<span class="lineNum">      98 </span><span class="lineCov">              2 :         assert_eq(f.name(), &quot;works-with&quot;);</span>
-<span class="lineNum">      99 </span><span class="lineCov">              1 :         assert_eq(t.name(), &quot;people&quot;);</span>
-<span class="lineNum">     100 </span><span class="lineCov">              1 :         assert_eq(t.fullname(), &quot;works-with::people&quot;);</span>
-<span class="lineNum">     101 </span><span class="lineCov">              1 : }</span>
-<span class="lineNum">     102 </span>                : 
-<span class="lineNum">     103 </span><span class="lineCov">              1 :         Test _7()</span>
-<span class="lineNum">     104 </span>                : {
-<span class="lineNum">     105 </span><span class="lineCov">              1 :     Facet f = tags().facetByName( &quot;works-with&quot; );</span>
-<span class="lineNum">     106 </span><span class="lineCov">              2 :         std::set&lt; Tag &gt; x = tags().tags( &quot;works-with&quot; );</span>
-<span class="lineNum">     107 </span><span class="lineCov">              2 :     assert( x == f.tags() );</span>
-<span class="lineNum">     108 </span><span class="lineCov">              1 : }</span>
-<span class="lineNum">     109 </span>                : 
-<span class="lineNum">     110 </span><span class="lineCov">              1 :         Test _8()</span>
-<span class="lineNum">     111 </span>                : {
-<span class="lineNum">     112 </span><span class="lineCov">              1 :     Facet f = tags().facetByName( &quot;does-not-work-with&quot; );</span>
-<span class="lineNum">     113 </span><span class="lineCov">              1 :     int x = 1;</span>
-<span class="lineNum">     114 </span>                :     try {
-<span class="lineNum">     115 </span><span class="lineCov">              1 :         f.tags();</span>
-<span class="lineNum">     116 </span><span class="lineNoCov">              0 :         x = 2;</span>
-<span class="lineNum">     117 </span><span class="lineCov">              2 :     } catch (...) {</span>
-<span class="lineNum">     118 </span><span class="lineCov">              1 :         x = 3;</span>
-<span class="lineNum">     119 </span>                :     }
-<span class="lineNum">     120 </span><span class="lineCov">              1 :     assert_eq( x, 3 );</span>
-<span class="lineNum">     121 </span><span class="lineCov">              1 : }</span>
-<span class="lineNum">     122 </span>                : 
-<span class="lineNum">     123 </span><span class="lineCov">              1 :         Test _9()</span>
-<span class="lineNum">     124 </span>                : {
-<span class="lineNum">     125 </span><span class="lineCov">              1 :     Facet f = tags().facetByName( &quot;legacy&quot; );</span>
-<span class="lineNum">     126 </span><span class="lineCov">              2 :     assert_eq(f.shortDescription(), &quot;&quot;);</span>
-<span class="lineNum">     127 </span><span class="lineCov">              1 :     assert_eq(f.longDescription(), &quot;&quot;);</span>
-<span class="lineNum">     128 </span>                :     //assert_eq(f.shortDescription( &quot;weehee&quot; ), &quot;weehee&quot;);
-<span class="lineNum">     129 </span><span class="lineCov">              1 : }</span>
-<span class="lineNum">     130 </span>                : 
-<span class="lineNum">     131 </span>                :         Test _10()
-<span class="lineNum">     132 </span>                : {
-<span class="lineNum">     133 </span>                :         // assert that one-character tag names are parsed correctly
-<span class="lineNum">     134 </span>                :         assert( tags().hasTag( &quot;implemented-in::c&quot; ) );
-<span class="lineNum">     135 </span>                : }
-<span class="lineNum">     136 </span>                : 
-<span class="lineNum">     137 </span><span class="lineCov">              1 :         Test _11()</span>
-<span class="lineNum">     138 </span>                : {
-<span class="lineNum">     139 </span>                :         // assert that all tags are somehow working
-<span class="lineNum">     140 </span><span class="lineCov">              1 :         std::set&lt;Facet&gt; facets = tags().facets();</span>
-<span class="lineNum">     141 </span>                : 
-<span class="lineNum">     142 </span><span class="lineCov">             30 :         for (std::set&lt;Facet&gt;::const_iterator i = facets.begin();</span>
-<span class="lineNum">     143 </span>                :                         i != facets.end(); i++)
-<span class="lineNum">     144 </span>                :         {
-<span class="lineNum">     145 </span><span class="lineCov">             29 :                 i-&gt;name(string(&quot;foo&quot;));</span>
-<span class="lineNum">     146 </span><span class="lineCov">             58 :                 i-&gt;shortDescription(string(&quot;foo&quot;));</span>
-<span class="lineNum">     147 </span><span class="lineCov">             58 :                 i-&gt;longDescription(string(&quot;foo&quot;));</span>
-<span class="lineNum">     148 </span><span class="lineCov">             58 :                 i-&gt;tags();</span>
-<span class="lineNum">     149 </span><span class="lineCov">              1 :         }</span>
-<span class="lineNum">     150 </span><span class="lineCov">              1 : }</span>
-<span class="lineNum">     151 </span>                : 
-<span class="lineNum">     152 </span><span class="lineCov">              1 :         Test _12()</span>
-<span class="lineNum">     153 </span>                : {
-<span class="lineNum">     154 </span>                :         // assert that all tags are somehow working
-<span class="lineNum">     155 </span><span class="lineCov">              1 :         std::set&lt;Tag&gt; tags = this-&gt;tags().tags();</span>
-<span class="lineNum">     156 </span>                : 
-<span class="lineNum">     157 </span><span class="lineCov">           1242 :         for (std::set&lt;Tag&gt;::const_iterator i = tags.begin();</span>
-<span class="lineNum">     158 </span>                :                         i != tags.end(); i++)
-<span class="lineNum">     159 </span>                :         {
-<span class="lineNum">     160 </span><span class="lineCov">            620 :                 i-&gt;name(string(&quot;foo&quot;));</span>
-<span class="lineNum">     161 </span><span class="lineCov">           1240 :                 i-&gt;fullname(string(&quot;foo&quot;));</span>
-<span class="lineNum">     162 </span><span class="lineCov">           1240 :                 i-&gt;shortDescription(string(&quot;foo&quot;));</span>
-<span class="lineNum">     163 </span><span class="lineCov">           1240 :                 i-&gt;longDescription(string(&quot;foo&quot;));</span>
-<span class="lineNum">     164 </span><span class="lineCov">              1 :         }</span>
-<span class="lineNum">     165 </span><span class="lineCov">              1 : }</span>
-<span class="lineNum">     166 </span>                : 
-<span class="lineNum">     167 </span>                : // Check for correctness of the first and last tag in the vocabulary
-<span class="lineNum">     168 </span><span class="lineCov">              1 :         Test _13()</span>
-<span class="lineNum">     169 </span>                : {
-<span class="lineNum">     170 </span><span class="lineCov">              1 :         Vocabulary&amp; tags = this-&gt;tags();</span>
-<span class="lineNum">     171 </span>                : 
-<span class="lineNum">     172 </span><span class="lineCov">              1 :         Tag first = tags.tagByName(&quot;accessibility::TODO&quot;);</span>
-<span class="lineNum">     173 </span><span class="lineCov">              2 :         assert(first != Tag());</span>
-<span class="lineNum">     174 </span><span class="lineCov">              1 :         assert_eq(first.fullname(), string(&quot;accessibility::TODO&quot;));</span>
-<span class="lineNum">     175 </span><span class="lineCov">              2 :         assert_eq(first.name(), string(&quot;TODO&quot;));</span>
-<span class="lineNum">     176 </span><span class="lineCov">              2 :         assert_eq(first.shortDescription(), string(&quot;Need an extra tag&quot;));</span>
-<span class="lineNum">     177 </span>                : 
-<span class="lineNum">     178 </span><span class="lineCov">              2 :         Tag last = tags.tagByName(&quot;x11::xserver&quot;);</span>
-<span class="lineNum">     179 </span><span class="lineCov">              2 :         assert(last != Tag());</span>
-<span class="lineNum">     180 </span><span class="lineCov">              1 :         assert_eq(last.fullname(), string(&quot;x11::xserver&quot;));</span>
-<span class="lineNum">     181 </span><span class="lineCov">              2 :         assert_eq(last.name(), string(&quot;xserver&quot;));</span>
-<span class="lineNum">     182 </span><span class="lineCov">              2 :         assert_eq(last.shortDescription(), string(&quot;X Server&quot;));</span>
-<span class="lineNum">     183 </span><span class="lineCov">              1 : }</span>
-<span class="lineNum">     184 </span>                : 
-<span class="lineNum">     185 </span><span class="lineCov">              1 :         Test _14()</span>
-<span class="lineNum">     186 </span>                : {
-<span class="lineNum">     187 </span>                :         // assert that it's possible to go from facet to ID and back
-<span class="lineNum">     188 </span><span class="lineCov">              1 :         std::set&lt;Facet&gt; facets = tags().facets();</span>
-<span class="lineNum">     189 </span>                : 
-<span class="lineNum">     190 </span><span class="lineCov">             30 :         for (std::set&lt;Facet&gt;::const_iterator i = facets.begin();</span>
-<span class="lineNum">     191 </span>                :                         i != facets.end(); i++)
-<span class="lineNum">     192 </span>                :         {
-<span class="lineNum">     193 </span><span class="lineCov">             29 :                 Facet f = tags().facetByID(i-&gt;id());</span>
-<span class="lineNum">     194 </span><span class="lineCov">             29 :                 assert_eq(*i, f);</span>
-<span class="lineNum">     195 </span><span class="lineCov">             29 :                 assert_eq(i-&gt;name(), f.name());</span>
-<span class="lineNum">     196 </span><span class="lineCov">             29 :                 assert_eq(i-&gt;shortDescription(), f.shortDescription());</span>
-<span class="lineNum">     197 </span><span class="lineCov">             29 :                 assert_eq(i-&gt;longDescription(), f.longDescription());</span>
-<span class="lineNum">     198 </span><span class="lineCov">             29 :                 assert_eq(i-&gt;tags().size(), f.tags().size());</span>
-<span class="lineNum">     199 </span><span class="lineCov">              1 :         }</span>
-<span class="lineNum">     200 </span><span class="lineCov">              1 : }</span>
-<span class="lineNum">     201 </span>                : 
-<span class="lineNum">     202 </span><span class="lineCov">              1 :         Test _15()</span>
-<span class="lineNum">     203 </span>                : {
-<span class="lineNum">     204 </span>                :         // assert that it's possible to go from tag to ID and back
-<span class="lineNum">     205 </span><span class="lineCov">              1 :         std::set&lt;Tag&gt; tags = this-&gt;tags().tags();</span>
-<span class="lineNum">     206 </span>                : 
-<span class="lineNum">     207 </span><span class="lineCov">            621 :         for (std::set&lt;Tag&gt;::const_iterator i = tags.begin();</span>
-<span class="lineNum">     208 </span>                :                         i != tags.end(); i++)
-<span class="lineNum">     209 </span>                :         {
-<span class="lineNum">     210 </span><span class="lineCov">            620 :                 Tag t = this-&gt;tags().tagByID(i-&gt;id());</span>
-<span class="lineNum">     211 </span><span class="lineCov">            620 :                 assert_eq(*i, t);</span>
-<span class="lineNum">     212 </span><span class="lineCov">            620 :                 assert_eq(i-&gt;name(), t.name());</span>
-<span class="lineNum">     213 </span><span class="lineCov">            620 :                 assert_eq(i-&gt;fullname(), t.fullname());</span>
-<span class="lineNum">     214 </span><span class="lineCov">            620 :                 assert_eq(i-&gt;shortDescription(), t.shortDescription());</span>
-<span class="lineNum">     215 </span><span class="lineCov">            620 :                 assert_eq(i-&gt;longDescription(), t.longDescription());</span>
-<span class="lineNum">     216 </span><span class="lineCov">              1 :         }</span>
-<span class="lineNum">     217 </span><span class="lineCov">              1 : }</span>
-<span class="lineNum">     218 </span>                : 
-<span class="lineNum">     219 </span><span class="lineCov">              1 :         Test _16()</span>
-<span class="lineNum">     220 </span>                : {
-<span class="lineNum">     221 </span>                :         // assert that facet IDs are distinct
-<span class="lineNum">     222 </span><span class="lineCov">              1 :         std::set&lt;Facet&gt; facets = tags().facets();</span>
-<span class="lineNum">     223 </span><span class="lineCov">              1 :         std::set&lt;int&gt; ids;</span>
-<span class="lineNum">     224 </span><span class="lineCov">             30 :         for (std::set&lt;Facet&gt;::const_iterator i = facets.begin();</span>
-<span class="lineNum">     225 </span>                :                         i != facets.end(); i++)
-<span class="lineNum">     226 </span><span class="lineCov">             29 :                 ids.insert(i-&gt;id());</span>
-<span class="lineNum">     227 </span>                : 
-<span class="lineNum">     228 </span><span class="lineCov">              1 :         assert_eq(facets.size(), ids.size());</span>
-<span class="lineNum">     229 </span><span class="lineCov">              1 : }</span>
-<span class="lineNum">     230 </span>                : 
-<span class="lineNum">     231 </span><span class="lineCov">              1 :         Test _17()</span>
-<span class="lineNum">     232 </span>                : {
-<span class="lineNum">     233 </span>                :         // assert that tag IDs are distinct
-<span class="lineNum">     234 </span><span class="lineCov">              1 :         std::set&lt;Tag&gt; tags = this-&gt;tags().tags();</span>
-<span class="lineNum">     235 </span><span class="lineCov">              1 :         std::set&lt;int&gt; ids;</span>
-<span class="lineNum">     236 </span><span class="lineCov">            621 :         for (std::set&lt;Tag&gt;::const_iterator i = tags.begin();</span>
-<span class="lineNum">     237 </span>                :                         i != tags.end(); i++)
-<span class="lineNum">     238 </span><span class="lineCov">            620 :                 ids.insert(i-&gt;id());</span>
-<span class="lineNum">     239 </span>                : 
-<span class="lineNum">     240 </span><span class="lineCov">              1 :         assert_eq(tags.size(), ids.size());</span>
-<span class="lineNum">     241 </span><span class="lineCov">              1 : }</span>
-<span class="lineNum">     242 </span>                : 
-<span class="lineNum">     243 </span><span class="lineCov">              1 :         Test _18()</span>
-<span class="lineNum">     244 </span>                : {
-<span class="lineNum">     245 </span>                :         // assert that all the tags are indexed
-<span class="lineNum">     246 </span><span class="lineCov">              1 :         ept::debtags::VocabularyMerger voc;</span>
-<span class="lineNum">     247 </span><span class="lineCov">              1 :         tagcoll::input::Stdio in(ept::debtags::Path::vocabulary());</span>
-<span class="lineNum">     248 </span><span class="lineCov">              1 :         voc.read(in);</span>
-<span class="lineNum">     249 </span><span class="lineCov">              1 :         std::set&lt;std::string&gt; all = voc.tagNames();</span>
-<span class="lineNum">     250 </span><span class="lineCov">           1242 :         for (std::set&lt;std::string&gt;::const_iterator i = all.begin();</span>
-<span class="lineNum">     251 </span>                :                         i != all.end(); ++i)
-<span class="lineNum">     252 </span><span class="lineCov">            620 :                 assert(this-&gt;tags().hasTag(*i));</span>
-<span class="lineNum">     253 </span>                : 
-<span class="lineNum">     254 </span>                :         // There should be the same amount of tags in both
-<span class="lineNum">     255 </span><span class="lineCov">              1 :         std::set&lt;Tag&gt; allTags = this-&gt;tags().tags();</span>
-<span class="lineNum">     256 </span><span class="lineCov">              1 :         assert_eq(all.size(), allTags.size());</span>
-<span class="lineNum">     257 </span><span class="lineCov">              1 : }</span>
-<span class="lineNum">     258 </span>                : 
-<span class="lineNum">     259 </span><span class="lineCov">              1 :         Test _19()</span>
-<span class="lineNum">     260 </span>                : {
-<span class="lineNum">     261 </span>                :         // test the tagcmp function
-<span class="lineNum">     262 </span>                : 
-<span class="lineNum">     263 </span>                :         // If unfaceted, same as strcmp
-<span class="lineNum">     264 </span><span class="lineCov">              1 :         assert(ept::debtags::tagcmp(&quot;antani&quot;, &quot;blinda&quot;) &lt; 0);</span>
-<span class="lineNum">     265 </span><span class="lineCov">              2 :         assert(ept::debtags::tagcmp(&quot;blinda&quot;, &quot;antani&quot;) &gt; 0);</span>
-<span class="lineNum">     266 </span><span class="lineCov">              2 :         assert_eq(ept::debtags::tagcmp(&quot;antani&quot;, &quot;antani&quot;), 0);</span>
-<span class="lineNum">     267 </span>                : 
-<span class="lineNum">     268 </span>                :         // If the same and faceted, should work
-<span class="lineNum">     269 </span><span class="lineCov">              2 :         assert_eq(ept::debtags::tagcmp(&quot;antani::blinda&quot;, &quot;antani::blinda&quot;), 0);</span>
-<span class="lineNum">     270 </span>                : 
-<span class="lineNum">     271 </span>                :         // With different facet names, work just as strcmp
-<span class="lineNum">     272 </span><span class="lineCov">              2 :         assert(ept::debtags::tagcmp(&quot;antani::blinda&quot;, &quot;blinda::blinda&quot;) &lt; 0);</span>
-<span class="lineNum">     273 </span><span class="lineCov">              2 :         assert(ept::debtags::tagcmp(&quot;blinda::blinda&quot;, &quot;antani::blinda&quot;) &gt; 0);</span>
-<span class="lineNum">     274 </span><span class="lineCov">              2 :         assert(ept::debtags::tagcmp(&quot;anta::blinda&quot;, &quot;antani::blinda&quot;) &lt; 0);</span>
-<span class="lineNum">     275 </span><span class="lineCov">              2 :         assert(ept::debtags::tagcmp(&quot;antani::blinda&quot;, &quot;anta::blinda&quot;) &gt; 0);</span>
-<span class="lineNum">     276 </span><span class="lineCov">              2 :         assert(ept::debtags::tagcmp(&quot;anta::blinda&quot;, &quot;anta-ni::blinda&quot;) &lt; 0);</span>
-<span class="lineNum">     277 </span><span class="lineCov">              2 :         assert(ept::debtags::tagcmp(&quot;anta-ni::blinda&quot;, &quot;anta::blinda&quot;) &gt; 0);</span>
-<span class="lineNum">     278 </span>                : 
-<span class="lineNum">     279 </span>                :         // With same facet names, work just as strcmp on the tags
-<span class="lineNum">     280 </span><span class="lineCov">              2 :         assert(ept::debtags::tagcmp(&quot;a::antani&quot;, &quot;a::blinda&quot;) &lt; 0);</span>
-<span class="lineNum">     281 </span><span class="lineCov">              2 :         assert(ept::debtags::tagcmp(&quot;a::blinda&quot;, &quot;a::antani&quot;) &gt; 0);</span>
-<span class="lineNum">     282 </span><span class="lineCov">              2 :         assert(ept::debtags::tagcmp(&quot;a::anta&quot;, &quot;a::antani&quot;) &lt; 0);</span>
-<span class="lineNum">     283 </span><span class="lineCov">              2 :         assert(ept::debtags::tagcmp(&quot;a::antani&quot;, &quot;a::anta&quot;) &gt; 0);</span>
-<span class="lineNum">     284 </span><span class="lineCov">              2 :         assert(ept::debtags::tagcmp(&quot;a::anta&quot;, &quot;a::anta-ni&quot;) &lt; 0);</span>
-<span class="lineNum">     285 </span><span class="lineCov">              2 :         assert(ept::debtags::tagcmp(&quot;a::anta-ni&quot;, &quot;a::anta&quot;) &gt; 0);</span>
-<span class="lineNum">     286 </span><span class="lineCov">              1 : }</span>
-<span class="lineNum">     287 </span>                : 
-<span class="lineNum">     288 </span>                :         Test _20()
-<span class="lineNum">     289 </span>                : {
-<span class="lineNum">     290 </span>                :         // check that we're seeing all the tags for a facet
-<span class="lineNum">     291 </span>                :         std::set&lt;Tag&gt; t = tags().tags(&quot;accessibility&quot;);
-<span class="lineNum">     292 </span>                :         assert_eq(t.size(), 10u);
-<span class="lineNum">     293 </span>                : 
-<span class="lineNum">     294 </span>                :         t = tags().tags(&quot;works-with-format&quot;);
-<span class="lineNum">     295 </span>                :         assert_eq(t.size(), 33u);
-<span class="lineNum">     296 </span>                : }
-<span class="lineNum">     297 </span>                : 
-<span class="lineNum">     298 </span>                : // If there is no data, Vocabulary should work as an empty vocabulary
-<span class="lineNum">     299 </span><span class="lineCov">              1 :         Test _21()</span>
-<span class="lineNum">     300 </span>                : {
-<span class="lineNum">     301 </span><span class="lineCov">              1 :         Path::OverrideDebtagsSourceDir odsd(&quot;./empty&quot;);</span>
-<span class="lineNum">     302 </span><span class="lineCov">              2 :         Path::OverrideDebtagsIndexDir odid(&quot;./empty&quot;);</span>
-<span class="lineNum">     303 </span><span class="lineCov">              2 :         Path::OverrideDebtagsUserSourceDir odusd(&quot;./empty&quot;);</span>
-<span class="lineNum">     304 </span><span class="lineCov">              2 :         Path::OverrideDebtagsUserIndexDir oduid(&quot;./empty&quot;);</span>
-<span class="lineNum">     305 </span><span class="lineCov">              1 :         Vocabulary empty;</span>
-<span class="lineNum">     306 </span>                : 
-<span class="lineNum">     307 </span><span class="lineCov">              1 :         assert(!empty.hasData());</span>
-<span class="lineNum">     308 </span>                : 
-<span class="lineNum">     309 </span><span class="lineCov">              1 :         set&lt;Facet&gt; facets = empty.facets();</span>
-<span class="lineNum">     310 </span><span class="lineCov">              1 :         assert_eq(facets.size(), 0u);</span>
-<span class="lineNum">     311 </span>                : 
-<span class="lineNum">     312 </span><span class="lineCov">              1 :         set&lt;Tag&gt; tags = empty.tags();</span>
-<span class="lineNum">     313 </span><span class="lineCov">              1 :         assert_eq(tags.size(), 0u);</span>
-<span class="lineNum">     314 </span><span class="lineCov">              1 : }</span>
-<span class="lineNum">     315 </span>                : 
-<span class="lineNum">     316 </span>                : };
-<span class="lineNum">     317 </span>                : 
-<span class="lineNum">     318 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/index.html b/rep/ept/index.html
deleted file mode 100644
index bbf0716..0000000
--- a/rep/ept/index.html
+++ /dev/null
@@ -1,110 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept</title>
-  <link rel="stylesheet" type="text/css" href="../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../index.html">directory</a> - ept</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">38</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">73.7 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">28</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <center>
-  <table width="80%" cellpadding=2 cellspacing=1 border=0>
-
-    <tr>
-      <td width="50%"><br></td>
-      <td width="15%"></td>
-      <td width="15%"></td>
-      <td width="20%"></td>
-    </tr>
-
-    <tr>
-      <td class="tableHead">Filename</td>
-      <td class="tableHead" colspan=3>Coverage</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="progresscallback.cpp.gcov.html">progresscallback.cpp</a></td>
-      <td class="coverBar" align="center">
-                <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../snow.png" width=100 height=10 alt="0.0%"></td></tr></table>
-      </td>
-      <td class="coverPerLo">0.0&nbsp;%</td>
-      <td class="coverNumLo">0&nbsp;/&nbsp;4&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="progresscallback.h.gcov.html">progresscallback.h</a></td>
-      <td class="coverBar" align="center">
-                <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../snow.png" width=100 height=10 alt="0.0%"></td></tr></table>
-      </td>
-      <td class="coverPerLo">0.0&nbsp;%</td>
-      <td class="coverNumLo">0&nbsp;/&nbsp;3&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="test.h.gcov.html">test.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">15&nbsp;/&nbsp;15&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="token.h.gcov.html">token.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../emerald.png" width=81 height=10 alt="81.2%"><img src="../snow.png" width=19 height=10 alt="81.2%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">81.2&nbsp;%</td>
-      <td class="coverNumHi">13&nbsp;/&nbsp;16&nbsp;lines</td>
-    </tr>
-
-  </table>
-  </center>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/popcon/index.html b/rep/ept/popcon/index.html
deleted file mode 100644
index d87cf3d..0000000
--- a/rep/ept/popcon/index.html
+++ /dev/null
@@ -1,128 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/popcon</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - ept/popcon</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">161</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">83.2 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">134</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <center>
-  <table width="80%" cellpadding=2 cellspacing=1 border=0>
-
-    <tr>
-      <td width="50%"><br></td>
-      <td width="15%"></td>
-      <td width="15%"></td>
-      <td width="20%"></td>
-    </tr>
-
-    <tr>
-      <td class="tableHead">Filename</td>
-      <td class="tableHead" colspan=3>Coverage</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="local.cc.gcov.html">local.cc</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=62 height=10 alt="62.1%"><img src="../../snow.png" width=38 height=10 alt="62.1%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">62.1&nbsp;%</td>
-      <td class="coverNumHi">41&nbsp;/&nbsp;66&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="local.h.gcov.html">local.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">1&nbsp;/&nbsp;1&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="local.test.h.gcov.html">local.test.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">8&nbsp;/&nbsp;8&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="popcon.cc.gcov.html">popcon.cc</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=96 height=10 alt="95.7%"><img src="../../snow.png" width=4 height=10 alt="95.7%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">95.7&nbsp;%</td>
-      <td class="coverNumHi">22&nbsp;/&nbsp;23&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="popcon.h.gcov.html">popcon.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=96 height=10 alt="96.0%"><img src="../../snow.png" width=4 height=10 alt="96.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">96.0&nbsp;%</td>
-      <td class="coverNumHi">24&nbsp;/&nbsp;25&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="popcon.test.h.gcov.html">popcon.test.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">38&nbsp;/&nbsp;38&nbsp;lines</td>
-    </tr>
-
-  </table>
-  </center>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/popcon/local.cc.gcov.html b/rep/ept/popcon/local.cc.gcov.html
deleted file mode 100644
index e6b44b8..0000000
--- a/rep/ept/popcon/local.cc.gcov.html
+++ /dev/null
@@ -1,235 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/popcon/local.cc</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/popcon</a> - local.cc</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">66</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">62.1 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">41</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /** @file
-<span class="lineNum">       2 </span>                :  * @author Enrico Zini &lt;enrico@enricozini.org&gt;
-<span class="lineNum">       3 </span>                :  * Correlate popcon data with local popcon information
-<span class="lineNum">       4 </span>                :  */
-<span class="lineNum">       5 </span>                : 
-<span class="lineNum">       6 </span>                : /*
-<span class="lineNum">       7 </span>                :  * Copyright (C) 2007  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">       8 </span>                :  *
-<span class="lineNum">       9 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">      10 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">      11 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">      12 </span>                :  * (at your option) any later version.
-<span class="lineNum">      13 </span>                :  *
-<span class="lineNum">      14 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      15 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      16 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      17 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      18 </span>                :  *
-<span class="lineNum">      19 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      20 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      21 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      22 </span>                :  */
-<span class="lineNum">      23 </span>                : 
-<span class="lineNum">      24 </span>                : #include &lt;ept/popcon/local.h&gt;
-<span class="lineNum">      25 </span>                : #include &lt;ept/popcon/popcon.h&gt;
-<span class="lineNum">      26 </span>                : #include &lt;ept/popcon/maint/path.h&gt;
-<span class="lineNum">      27 </span>                : 
-<span class="lineNum">      28 </span>                : #include &lt;wibble/exception.h&gt;
-<span class="lineNum">      29 </span>                : 
-<span class="lineNum">      30 </span>                : #include &lt;algorithm&gt;
-<span class="lineNum">      31 </span>                : #include &lt;fstream&gt;
-<span class="lineNum">      32 </span>                : #include &lt;cmath&gt;
-<span class="lineNum">      33 </span>                : 
-<span class="lineNum">      34 </span>                : //#include &lt;iostream&gt;
-<span class="lineNum">      35 </span>                : 
-<span class="lineNum">      36 </span>                : using namespace std;
-<span class="lineNum">      37 </span>                : 
-<span class="lineNum">      38 </span>                : namespace ept {
-<span class="lineNum">      39 </span>                : namespace popcon {
-<span class="lineNum">      40 </span>                : 
-<span class="lineNum">      41 </span>                : // Split a string where there are separators
-<span class="lineNum">      42 </span><span class="lineCov">           1903 : static vector&lt;string&gt; split(const std::string&amp; str, char sep = ' ')</span>
-<span class="lineNum">      43 </span>                : {
-<span class="lineNum">      44 </span><span class="lineCov">           1903 :         vector&lt;string&gt; res;</span>
-<span class="lineNum">      45 </span><span class="lineCov">           1903 :         size_t start = 0;</span>
-<span class="lineNum">      46 </span><span class="lineCov">          10435 :         while (start &lt; str.size())</span>
-<span class="lineNum">      47 </span>                :         {
-<span class="lineNum">      48 </span><span class="lineCov">           8531 :                 size_t end = str.find(sep, start);</span>
-<span class="lineNum">      49 </span><span class="lineCov">           8531 :                 if (end == string::npos)</span>
-<span class="lineNum">      50 </span>                :                 {
-<span class="lineNum">      51 </span><span class="lineCov">           1902 :                         res.push_back(str.substr(start));</span>
-<span class="lineNum">      52 </span><span class="lineCov">           1902 :                         break;</span>
-<span class="lineNum">      53 </span>                :                 }
-<span class="lineNum">      54 </span>                :                 else
-<span class="lineNum">      55 </span>                :                 {
-<span class="lineNum">      56 </span><span class="lineCov">           6629 :                         res.push_back(str.substr(start, end-start));</span>
-<span class="lineNum">      57 </span><span class="lineCov">           6629 :                         start = end + 1;</span>
-<span class="lineNum">      58 </span>                :                 }
-<span class="lineNum">      59 </span>                :         }
-<span class="lineNum">      60 </span><span class="lineNoCov">              0 :         return res;</span>
-<span class="lineNum">      61 </span>                : }
-<span class="lineNum">      62 </span>                : 
-<span class="lineNum">      63 </span>                : // Reverse sort pairs by comparing their second element
-<span class="lineNum">      64 </span>                : struct secondsort
-<span class="lineNum">      65 </span>                : {
-<span class="lineNum">      66 </span><span class="lineNoCov">              0 :         bool operator()(const pair&lt;string, float&gt;&amp; a, const pair&lt;string, float&gt;&amp; b) const</span>
-<span class="lineNum">      67 </span>                :         {
-<span class="lineNum">      68 </span><span class="lineNoCov">              0 :                 if (a.second == b.second)</span>
-<span class="lineNum">      69 </span><span class="lineNoCov">              0 :                         return a.first &gt; b.first;</span>
-<span class="lineNum">      70 </span>                :                 else
-<span class="lineNum">      71 </span><span class="lineNoCov">              0 :                         return a.second &gt; b.second;</span>
-<span class="lineNum">      72 </span>                :         }
-<span class="lineNum">      73 </span>                : };
-<span class="lineNum">      74 </span>                : 
-<span class="lineNum">      75 </span><span class="lineCov">              1 : Local::Local(const std::string&amp; file)</span>
-<span class="lineNum">      76 </span>                : {
-<span class="lineNum">      77 </span><span class="lineCov">              1 :         m_timestamp = Path::timestamp(file);</span>
-<span class="lineNum">      78 </span><span class="lineCov">              1 :         if (m_timestamp == 0)</span>
-<span class="lineNum">      79 </span><span class="lineNoCov">              0 :                 return;</span>
-<span class="lineNum">      80 </span>                :         
-<span class="lineNum">      81 </span><span class="lineCov">              1 :         ifstream in;</span>
-<span class="lineNum">      82 </span><span class="lineCov">              1 :         in.open(file.c_str());</span>
-<span class="lineNum">      83 </span><span class="lineCov">              1 :         if (!in.good())</span>
-<span class="lineNum">      84 </span><span class="lineNoCov">              0 :                 throw wibble::exception::File(file, &quot;opening file for reading&quot;);</span>
-<span class="lineNum">      85 </span>                : 
-<span class="lineNum">      86 </span><span class="lineCov">           1907 :         while (!in.eof())</span>
-<span class="lineNum">      87 </span>                :         {
-<span class="lineNum">      88 </span><span class="lineCov">           1905 :                 std::string line;</span>
-<span class="lineNum">      89 </span><span class="lineCov">           1905 :                 getline(in, line);</span>
-<span class="lineNum">      90 </span><span class="lineCov">           1905 :                 if (line.substr(0, 10) == &quot;POPULARITY&quot;)</span>
-<span class="lineNum">      91 </span><span class="lineCov">              3 :                         continue;</span>
-<span class="lineNum">      92 </span><span class="lineCov">           1904 :                 if (line.substr(0, 14) == &quot;END-POPULARITY&quot;)</span>
-<span class="lineNum">      93 </span>                :                         continue;
-<span class="lineNum">      94 </span><span class="lineCov">           1903 :                 vector&lt;string&gt; data = split(line);</span>
-<span class="lineNum">      95 </span><span class="lineCov">           1903 :                 if (data.size() &lt; 4)</span>
-<span class="lineNum">      96 </span>                :                         continue;
-<span class="lineNum">      97 </span><span class="lineCov">           1902 :                 if (data[3] == &quot;&lt;NOFILES&gt;&quot;)</span>
-<span class="lineNum">      98 </span>                :                         // This is an empty / virtual package
-<span class="lineNum">      99 </span><span class="lineCov">            979 :                         m_scores.insert(make_pair(data[2], 0.1));</span>
-<span class="lineNum">     100 </span><span class="lineCov">            923 :                 else if (data.size() == 4)</span>
-<span class="lineNum">     101 </span>                :                         // Package normally in use
-<span class="lineNum">     102 </span><span class="lineNoCov">              0 :                         m_scores.insert(make_pair(data[2], 1.0));</span>
-<span class="lineNum">     103 </span><span class="lineCov">            923 :                 else if (data[4] == &quot;&lt;OLD&gt;&quot;)</span>
-<span class="lineNum">     104 </span>                :                         // Unused packages
-<span class="lineNum">     105 </span><span class="lineCov">            745 :                         m_scores.insert(make_pair(data[2], 0.3));</span>
-<span class="lineNum">     106 </span><span class="lineCov">            178 :                 else if (data[4] == &quot;&lt;RECENT-CTIME&gt;&quot;)</span>
-<span class="lineNum">     107 </span>                :                         // Recently installed packages
-<span class="lineNum">     108 </span><span class="lineCov">            178 :                         m_scores.insert(make_pair(data[2], 0.5));</span>
-<span class="lineNum">     109 </span><span class="lineCov">              1 :         }</span>
-<span class="lineNum">     110 </span><span class="lineNoCov">              0 : }</span>
-<span class="lineNum">     111 </span>                : 
-<span class="lineNum">     112 </span><span class="lineCov">              2 : float Local::score(const std::string&amp; pkg) const</span>
-<span class="lineNum">     113 </span>                : {
-<span class="lineNum">     114 </span><span class="lineCov">              2 :         std::map&lt;std::string, float&gt;::const_iterator i = m_scores.find(pkg);</span>
-<span class="lineNum">     115 </span><span class="lineCov">              2 :         if (i == m_scores.end())</span>
-<span class="lineNum">     116 </span><span class="lineNoCov">              0 :                 return 0;</span>
-<span class="lineNum">     117 </span>                :         else
-<span class="lineNum">     118 </span><span class="lineCov">              2 :                 return i-&gt;second;</span>
-<span class="lineNum">     119 </span>                : }
-<span class="lineNum">     120 </span>                : 
-<span class="lineNum">     121 </span>                : /**
-<span class="lineNum">     122 </span>                :  * Return the TFIDF score of the package computed against the popcon
-<span class="lineNum">     123 </span>                :  * information.
-<span class="lineNum">     124 </span>                :  */
-<span class="lineNum">     125 </span><span class="lineCov">              1 : float Local::tfidf(const Popcon&amp; popcon, const std::string&amp; pkg) const</span>
-<span class="lineNum">     126 </span>                : {
-<span class="lineNum">     127 </span><span class="lineCov">              1 :         float popconScore = popcon.score(pkg);</span>
-<span class="lineNum">     128 </span>                :         //cerr &lt;&lt; pkg &lt;&lt; &quot;: &quot; &lt;&lt; score(pkg) &lt;&lt; &quot; * log(&quot; &lt;&lt; (float)popcon.submissions() &lt;&lt; &quot; / &quot; &lt;&lt; popconScore &lt;&lt; &quot;) = &quot; &lt;&lt; score(pkg) * log((float)popcon.submissions() / popconScore) &lt;&lt; endl;
-<span class="lineNum">     129 </span><span class="lineCov">              1 :         if (popconScore == 0)</span>
-<span class="lineNum">     130 </span><span class="lineNoCov">              0 :                 return 0;</span>
-<span class="lineNum">     131 </span>                :         else
-<span class="lineNum">     132 </span><span class="lineCov">              1 :                 return score(pkg) * log((float)popcon.submissions() / popconScore);</span>
-<span class="lineNum">     133 </span>                :         
-<span class="lineNum">     134 </span>                : }
-<span class="lineNum">     135 </span>                : 
-<span class="lineNum">     136 </span><span class="lineNoCov">              0 : std::vector&lt; std::pair&lt;std::string, float&gt; &gt; Local::scores() const</span>
-<span class="lineNum">     137 </span>                : {
-<span class="lineNum">     138 </span><span class="lineNoCov">              0 :         vector&lt; pair&lt;string, float&gt; &gt; res;</span>
-<span class="lineNum">     139 </span>                :         // Copy the scores in res
-<span class="lineNum">     140 </span><span class="lineNoCov">              0 :         copy(m_scores.begin(), m_scores.end(), back_inserter(res));</span>
-<span class="lineNum">     141 </span>                :         // Sort res by score
-<span class="lineNum">     142 </span><span class="lineNoCov">              0 :         sort(res.begin(), res.end(), secondsort());</span>
-<span class="lineNum">     143 </span><span class="lineNoCov">              0 :         return res;</span>
-<span class="lineNum">     144 </span>                : }
-<span class="lineNum">     145 </span>                : 
-<span class="lineNum">     146 </span><span class="lineNoCov">              0 : std::vector&lt; std::pair&lt;std::string, float&gt; &gt; Local::tfidf(const Popcon&amp; popcon) const</span>
-<span class="lineNum">     147 </span>                : {
-<span class="lineNum">     148 </span><span class="lineNoCov">              0 :         vector&lt; pair&lt;string, float&gt; &gt; res;</span>
-<span class="lineNum">     149 </span>                :         // Compute the tfidf scores and store them into res
-<span class="lineNum">     150 </span><span class="lineNoCov">              0 :         for (std::map&lt;std::string, float&gt;::const_iterator i = m_scores.begin();</span>
-<span class="lineNum">     151 </span>                :                         i != m_scores.end(); ++i)
-<span class="lineNum">     152 </span>                :         {
-<span class="lineNum">     153 </span><span class="lineNoCov">              0 :                 float popconScore = popcon.score(i-&gt;first);</span>
-<span class="lineNum">     154 </span><span class="lineNoCov">              0 :                 if (popconScore == 0)</span>
-<span class="lineNum">     155 </span><span class="lineNoCov">              0 :                         res.push_back(make_pair(i-&gt;first, 0.0f));</span>
-<span class="lineNum">     156 </span>                :                 else
-<span class="lineNum">     157 </span>                :                         res.push_back(make_pair(i-&gt;first,
-<span class="lineNum">     158 </span><span class="lineNoCov">              0 :                                                 i-&gt;second * log((float)popcon.submissions() / popconScore)));</span>
-<span class="lineNum">     159 </span>                :         }
-<span class="lineNum">     160 </span>                :         // Sort res by score
-<span class="lineNum">     161 </span><span class="lineNoCov">              0 :         sort(res.begin(), res.end(), secondsort());</span>
-<span class="lineNum">     162 </span><span class="lineNoCov">              0 :         return res;</span>
-<span class="lineNum">     163 </span>                : }
-<span class="lineNum">     164 </span>                : 
-<span class="lineNum">     165 </span>                : }
-<span class="lineNum">     166 </span><span class="lineCov">              6 : }</span>
-<span class="lineNum">     167 </span>                : 
-<span class="lineNum">     168 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/popcon/local.h.gcov.html b/rep/ept/popcon/local.h.gcov.html
deleted file mode 100644
index a8cb45d..0000000
--- a/rep/ept/popcon/local.h.gcov.html
+++ /dev/null
@@ -1,154 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/popcon/local.h</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/popcon</a> - local.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">1</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">1</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #ifndef EPT_POPCON_LOCAL_H
-<span class="lineNum">       2 </span>                : #define EPT_POPCON_LOCAL_H
-<span class="lineNum">       3 </span>                : 
-<span class="lineNum">       4 </span>                : /** @file
-<span class="lineNum">       5 </span>                :  * @author Enrico Zini &lt;enrico@enricozini.org&gt;
-<span class="lineNum">       6 </span>                :  * Correlate popcon data with local popcon information
-<span class="lineNum">       7 </span>                :  */
-<span class="lineNum">       8 </span>                : 
-<span class="lineNum">       9 </span>                : /*
-<span class="lineNum">      10 </span>                :  * Copyright (C) 2007  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">      11 </span>                :  *
-<span class="lineNum">      12 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">      13 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">      14 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">      15 </span>                :  * (at your option) any later version.
-<span class="lineNum">      16 </span>                :  *
-<span class="lineNum">      17 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      18 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      19 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      20 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      21 </span>                :  *
-<span class="lineNum">      22 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      23 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      24 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      25 </span>                :  */
-<span class="lineNum">      26 </span>                : 
-<span class="lineNum">      27 </span>                : #include &lt;string&gt;
-<span class="lineNum">      28 </span>                : #include &lt;vector&gt;
-<span class="lineNum">      29 </span>                : #include &lt;map&gt;
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : namespace ept {
-<span class="lineNum">      32 </span>                : namespace popcon {
-<span class="lineNum">      33 </span>                : 
-<span class="lineNum">      34 </span>                : class Popcon;
-<span class="lineNum">      35 </span>                : 
-<span class="lineNum">      36 </span>                : /**
-<span class="lineNum">      37 </span>                :  * Access the results of the local daily popcon scan.
-<span class="lineNum">      38 </span>                :  */
-<span class="lineNum">      39 </span>                : class Local
-<span class="lineNum">      40 </span><span class="lineCov">              1 : {</span>
-<span class="lineNum">      41 </span>                : protected:
-<span class="lineNum">      42 </span>                :         std::map&lt;std::string, float&gt; m_scores;
-<span class="lineNum">      43 </span>                :         time_t m_timestamp;
-<span class="lineNum">      44 </span>                : 
-<span class="lineNum">      45 </span>                : public:
-<span class="lineNum">      46 </span>                :         Local(const std::string&amp; file = std::string(&quot;/var/log/popularity-contest&quot;));
-<span class="lineNum">      47 </span>                : 
-<span class="lineNum">      48 </span>                :         /// Get the timestamp of the local popcon information
-<span class="lineNum">      49 </span>                :         time_t timestamp() const { return m_timestamp; }
-<span class="lineNum">      50 </span>                : 
-<span class="lineNum">      51 </span>                :         /// Return true if this data source has data, false if it's empty
-<span class="lineNum">      52 </span>                :         bool hasData() const { return m_timestamp != 0; }
-<span class="lineNum">      53 </span>                : 
-<span class="lineNum">      54 </span>                :         /**
-<span class="lineNum">      55 </span>                :          * Return the local score of the package
-<span class="lineNum">      56 </span>                :          */
-<span class="lineNum">      57 </span>                :         float score(const std::string&amp; pkg) const;
-<span class="lineNum">      58 </span>                : 
-<span class="lineNum">      59 </span>                :         /**
-<span class="lineNum">      60 </span>                :          * Return the TFIDF score of the package computed against the popcon
-<span class="lineNum">      61 </span>                :          * information.
-<span class="lineNum">      62 </span>                :          *
-<span class="lineNum">      63 </span>                :          * The TFIDF score is high when a package is representative of this system,
-<span class="lineNum">      64 </span>                :          * that is, it is used in this system and not much used in other systems.
-<span class="lineNum">      65 </span>                :          */
-<span class="lineNum">      66 </span>                :         float tfidf(const Popcon&amp; popcon, const std::string&amp; pkg) const;
-<span class="lineNum">      67 </span>                : 
-<span class="lineNum">      68 </span>                :         /**
-<span class="lineNum">      69 </span>                :          * Read the local popcon vote and return the list of packages and their
-<span class="lineNum">      70 </span>                :          * local scores, sorted by ascending score.
-<span class="lineNum">      71 </span>                :          */
-<span class="lineNum">      72 </span>                :         std::vector&lt; std::pair&lt;std::string, float&gt; &gt; scores() const;
-<span class="lineNum">      73 </span>                : 
-<span class="lineNum">      74 </span>                :         /**
-<span class="lineNum">      75 </span>                :          * Read the local popcon vote and return the list of packages and their
-<span class="lineNum">      76 </span>                :          * TFIDF scores computed against the popcon information.
-<span class="lineNum">      77 </span>                :          *
-<span class="lineNum">      78 </span>                :          * The packages will be sorted by ascending score.
-<span class="lineNum">      79 </span>                :          */
-<span class="lineNum">      80 </span>                :         std::vector&lt; std::pair&lt;std::string, float&gt; &gt; tfidf(const Popcon&amp; popcon) const;
-<span class="lineNum">      81 </span>                : };
-<span class="lineNum">      82 </span>                : 
-<span class="lineNum">      83 </span>                : }
-<span class="lineNum">      84 </span>                : }
-<span class="lineNum">      85 </span>                : 
-<span class="lineNum">      86 </span>                : // vim:set ts=4 sw=4:
-<span class="lineNum">      87 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/popcon/local.test.h.gcov.html b/rep/ept/popcon/local.test.h.gcov.html
deleted file mode 100644
index 05ce32e..0000000
--- a/rep/ept/popcon/local.test.h.gcov.html
+++ /dev/null
@@ -1,178 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/popcon/local.test.h</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/popcon</a> - local.test.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">8</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">8</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- mode: c++; tab-width: 4; indent-tabs-mode: t -*-
-<span class="lineNum">       2 </span>                : /*
-<span class="lineNum">       3 </span>                :  * popcon/local test
-<span class="lineNum">       4 </span>                :  *
-<span class="lineNum">       5 </span>                :  * Copyright (C) 2007  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">       6 </span>                :  *
-<span class="lineNum">       7 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">       8 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">       9 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">      10 </span>                :  * (at your option) any later version.
-<span class="lineNum">      11 </span>                :  *
-<span class="lineNum">      12 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      13 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      14 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      15 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      16 </span>                :  *
-<span class="lineNum">      17 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      18 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      19 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      20 </span>                :  */
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                : #include &lt;ept/popcon/local.h&gt;
-<span class="lineNum">      23 </span>                : #include &lt;ept/popcon/popcon.h&gt;
-<span class="lineNum">      24 </span>                : #include &lt;ept/popcon/maint/path.h&gt;
-<span class="lineNum">      25 </span>                : 
-<span class="lineNum">      26 </span>                : #include &lt;ept/test.h&gt;
-<span class="lineNum">      27 </span>                : 
-<span class="lineNum">      28 </span>                : using namespace std;
-<span class="lineNum">      29 </span>                : using namespace ept;
-<span class="lineNum">      30 </span>                : using namespace ept::popcon;
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span>                : struct TestPopconLocal
-<span class="lineNum">      33 </span><span class="lineCov">              1 : {</span>
-<span class="lineNum">      34 </span>                :         Path::OverridePopconSourceDir odsd;
-<span class="lineNum">      35 </span>                :         Path::OverridePopconIndexDir odid;
-<span class="lineNum">      36 </span>                :         Path::OverridePopconUserSourceDir odusd;
-<span class="lineNum">      37 </span>                :         Path::OverridePopconUserIndexDir oduid;
-<span class="lineNum">      38 </span>                : 
-<span class="lineNum">      39 </span>                :         Popcon popcon;
-<span class="lineNum">      40 </span>                :         Local local;
-<span class="lineNum">      41 </span>                : 
-<span class="lineNum">      42 </span><span class="lineCov">              1 :         TestPopconLocal()</span>
-<span class="lineNum">      43 </span>                :                 : odsd( TEST_ENV_DIR &quot;popcon&quot; ),
-<span class="lineNum">      44 </span>                :                   odid( TEST_ENV_DIR &quot;popcon&quot; ),
-<span class="lineNum">      45 </span>                :                   odusd( TEST_ENV_DIR &quot;popcon&quot; ),
-<span class="lineNum">      46 </span>                :                   oduid( TEST_ENV_DIR &quot;popcon&quot; ),
-<span class="lineNum">      47 </span><span class="lineCov">              1 :                   local( TEST_ENV_DIR &quot;popcon/popularity-contest&quot; )</span>
-<span class="lineNum">      48 </span><span class="lineCov">              1 :         {}</span>
-<span class="lineNum">      49 </span>                : 
-<span class="lineNum">      50 </span>                :     // Very basic access
-<span class="lineNum">      51 </span><span class="lineCov">              1 :         Test basicAccess()</span>
-<span class="lineNum">      52 </span>                :         {
-<span class="lineNum">      53 </span><span class="lineCov">              1 :                 assert(local.score(&quot;apt&quot;) &gt; 0);</span>
-<span class="lineNum">      54 </span><span class="lineCov">              2 :                 assert(local.tfidf(popcon, &quot;apt&quot;) &gt; 0);</span>
-<span class="lineNum">      55 </span><span class="lineCov">              1 :         }</span>
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span>                : #if 0 // mornfall: apparently left out by enrico, leaving as it is
-<span class="lineNum">      58 </span>                : // Check that every valid index is accessible
-<span class="lineNum">      59 </span>                : template&lt;&gt; template&lt;&gt;
-<span class="lineNum">      60 </span>                : void to::test&lt; 2 &gt;()
-<span class="lineNum">      61 </span>                : {
-<span class="lineNum">      62 </span>                :         for (size_t i = 0; i &lt; popcon.size(); ++i)
-<span class="lineNum">      63 </span>                :         {
-<span class="lineNum">      64 </span>                :                 //cerr &lt;&lt; popcon.name(i) &lt;&lt; &quot; &quot; &lt;&lt; popcon.score(i) &lt;&lt; endl;
-<span class="lineNum">      65 </span>                :                 assert(popcon.score(i) &gt; 0);
-<span class="lineNum">      66 </span>                :         }
-<span class="lineNum">      67 </span>                : }
-<span class="lineNum">      68 </span>                : 
-<span class="lineNum">      69 </span>                : // Check that we can get a score for every package
-<span class="lineNum">      70 </span>                : template&lt;&gt; template&lt;&gt;
-<span class="lineNum">      71 </span>                : void to::test&lt; 3 &gt;()
-<span class="lineNum">      72 </span>                : {
-<span class="lineNum">      73 </span>                :         int has = 0;
-<span class="lineNum">      74 </span>                :         for (Apt::iterator i = apt.begin(); i != apt.end(); ++i)
-<span class="lineNum">      75 </span>                :         {
-<span class="lineNum">      76 </span>                :                 float score = popcon.score(*i);
-<span class="lineNum">      77 </span>                :                 if (score &gt; 0)
-<span class="lineNum">      78 </span>                :                         ++has;
-<span class="lineNum">      79 </span>                :         }
-<span class="lineNum">      80 </span>                :         // At least 1000 packages should have a score
-<span class="lineNum">      81 </span>                :         assert(has &gt; 1000);
-<span class="lineNum">      82 </span>                : }
-<span class="lineNum">      83 </span>                : 
-<span class="lineNum">      84 </span>                : // Check that scores are meaningful
-<span class="lineNum">      85 </span>                : template&lt;&gt; template&lt;&gt;
-<span class="lineNum">      86 </span>                : void to::test&lt; 4 &gt;()
-<span class="lineNum">      87 </span>                : {
-<span class="lineNum">      88 </span>                :         assert(popcon[&quot;apt&quot;] &gt; popcon[&quot;libapt-pkg-dev&quot;]);
-<span class="lineNum">      89 </span>                : }
-<span class="lineNum">      90 </span>                : 
-<span class="lineNum">      91 </span>                : // If there is no data, Popcon should work as if all scores were 0
-<span class="lineNum">      92 </span>                : template&lt;&gt; template&lt;&gt;
-<span class="lineNum">      93 </span>                : void to::test&lt;5&gt;()
-<span class="lineNum">      94 </span>                : {
-<span class="lineNum">      95 </span>                :         Path::OverridePopconSourceDir odsd(&quot;./empty&quot;);
-<span class="lineNum">      96 </span>                :         Path::OverridePopconIndexDir odid(&quot;./empty&quot;);
-<span class="lineNum">      97 </span>                :         Path::OverridePopconUserSourceDir odusd(&quot;./empty&quot;);
-<span class="lineNum">      98 </span>                :         Path::OverridePopconUserIndexDir oduid(&quot;./empty&quot;);
-<span class="lineNum">      99 </span>                :         Popcon empty;
-<span class="lineNum">     100 </span>                : 
-<span class="lineNum">     101 </span>                :         assert_eq(empty.timestamp(), 0);
-<span class="lineNum">     102 </span>                :         assert(!empty.hasData());
-<span class="lineNum">     103 </span>                : 
-<span class="lineNum">     104 </span>                :         assert(empty.size() == 0);
-<span class="lineNum">     105 </span>                :         assert(empty.score(&quot;apt&quot;) == 0.0);
-<span class="lineNum">     106 </span>                : }
-<span class="lineNum">     107 </span>                : #endif
-<span class="lineNum">     108 </span>                : 
-<span class="lineNum">     109 </span>                : };
-<span class="lineNum">     110 </span>                : 
-<span class="lineNum">     111 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/popcon/maint/index.html b/rep/ept/popcon/maint/index.html
deleted file mode 100644
index f507903..0000000
--- a/rep/ept/popcon/maint/index.html
+++ /dev/null
@@ -1,128 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/popcon/maint</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - ept/popcon/maint</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">258</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">88.4 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">228</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <center>
-  <table width="80%" cellpadding=2 cellspacing=1 border=0>
-
-    <tr>
-      <td width="50%"><br></td>
-      <td width="15%"></td>
-      <td width="15%"></td>
-      <td width="20%"></td>
-    </tr>
-
-    <tr>
-      <td class="tableHead">Filename</td>
-      <td class="tableHead" colspan=3>Coverage</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="path.cc.gcov.html">path.cc</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=98 height=10 alt="97.6%"><img src="../../../snow.png" width=2 height=10 alt="97.6%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">97.6&nbsp;%</td>
-      <td class="coverNumHi">41&nbsp;/&nbsp;42&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="path.h.gcov.html">path.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">17&nbsp;/&nbsp;17&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="popconindexer.cc.gcov.html">popconindexer.cc</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=79 height=10 alt="79.3%"><img src="../../../snow.png" width=21 height=10 alt="79.3%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">79.3&nbsp;%</td>
-      <td class="coverNumHi">92&nbsp;/&nbsp;116&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="popconindexer.h.gcov.html">popconindexer.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">5&nbsp;/&nbsp;5&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="sourcedir.cc.gcov.html">sourcedir.cc</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=93 height=10 alt="93.4%"><img src="../../../snow.png" width=7 height=10 alt="93.4%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">93.4&nbsp;%</td>
-      <td class="coverNumHi">71&nbsp;/&nbsp;76&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="sourcedir.h.gcov.html">sourcedir.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">2&nbsp;/&nbsp;2&nbsp;lines</td>
-    </tr>
-
-  </table>
-  </center>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/popcon/maint/path.cc.gcov.html b/rep/ept/popcon/maint/path.cc.gcov.html
deleted file mode 100644
index b332e8d..0000000
--- a/rep/ept/popcon/maint/path.cc.gcov.html
+++ /dev/null
@@ -1,182 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/popcon/maint/path.cc</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">ept/popcon/maint</a> - path.cc</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">42</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">97.6 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">41</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- mode: c++; indent-tabs-mode: t -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : /** \file
-<span class="lineNum">       4 </span>                :  * popcon paths
-<span class="lineNum">       5 </span>                :  */
-<span class="lineNum">       6 </span>                : 
-<span class="lineNum">       7 </span>                : /*
-<span class="lineNum">       8 </span>                :  * Copyright (C) 2005,2006,2007  Enrico Zini &lt;enrico@debian.org&gt;, Peter Rockai &lt;me@mornfall.net&gt;
-<span class="lineNum">       9 </span>                :  *
-<span class="lineNum">      10 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">      11 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">      12 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">      13 </span>                :  * (at your option) any later version.
-<span class="lineNum">      14 </span>                :  *
-<span class="lineNum">      15 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      16 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      17 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      18 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      19 </span>                :  *
-<span class="lineNum">      20 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      21 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      22 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      23 </span>                :  */
-<span class="lineNum">      24 </span>                : 
-<span class="lineNum">      25 </span>                : #include &lt;ept/config.h&gt;
-<span class="lineNum">      26 </span>                : #include &lt;ept/popcon/maint/path.h&gt;
-<span class="lineNum">      27 </span>                : 
-<span class="lineNum">      28 </span>                : #include &lt;wibble/sys/fs.h&gt;
-<span class="lineNum">      29 </span>                : #include &lt;wibble/string.h&gt;
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : #include &lt;sys/types.h&gt;    // getpwuid, stat, mkdir, getuid
-<span class="lineNum">      32 </span>                : #include &lt;sys/stat.h&gt;     // stat, mkdir
-<span class="lineNum">      33 </span>                : #include &lt;pwd.h&gt;          // getpwuid
-<span class="lineNum">      34 </span>                : #include &lt;unistd.h&gt;               // stat, getuid
-<span class="lineNum">      35 </span>                : 
-<span class="lineNum">      36 </span>                : using namespace wibble;
-<span class="lineNum">      37 </span>                : 
-<span class="lineNum">      38 </span>                : namespace ept {
-<span class="lineNum">      39 </span>                : namespace popcon {
-<span class="lineNum">      40 </span>                : 
-<span class="lineNum">      41 </span><span class="lineCov">              2 : static std::string userdir()</span>
-<span class="lineNum">      42 </span>                : {
-<span class="lineNum">      43 </span><span class="lineCov">              2 :         std::string rcdir;</span>
-<span class="lineNum">      44 </span>                : 
-<span class="lineNum">      45 </span><span class="lineCov">              2 :         struct passwd* udata = getpwuid(getuid());</span>
-<span class="lineNum">      46 </span><span class="lineCov">              2 :         rcdir = str::joinpath(udata-&gt;pw_dir, &quot;.popcon&quot;);</span>
-<span class="lineNum">      47 </span>                : 
-<span class="lineNum">      48 </span><span class="lineNoCov">              0 :         return rcdir;</span>
-<span class="lineNum">      49 </span>                : }
-<span class="lineNum">      50 </span>                : 
-<span class="lineNum">      51 </span>                : 
-<span class="lineNum">      52 </span><span class="lineCov">            178 : Path &amp;Path::instance() {</span>
-<span class="lineNum">      53 </span><span class="lineCov">            178 :         if (!s_instance) {</span>
-<span class="lineNum">      54 </span><span class="lineCov">              1 :                 s_instance = new Path;</span>
-<span class="lineNum">      55 </span><span class="lineCov">              1 :                 instance().m_popconSourceDir = POPCON_DB_DIR;</span>
-<span class="lineNum">      56 </span><span class="lineCov">              1 :                 instance().m_popconIndexDir = POPCON_DB_DIR;</span>
-<span class="lineNum">      57 </span><span class="lineCov">              2 :                 instance().m_popconUserSourceDir = userdir();</span>
-<span class="lineNum">      58 </span><span class="lineCov">              2 :                 instance().m_popconUserIndexDir = userdir();</span>
-<span class="lineNum">      59 </span>                :         }
-<span class="lineNum">      60 </span><span class="lineCov">            178 :         return *s_instance;</span>
-<span class="lineNum">      61 </span>                : }
-<span class="lineNum">      62 </span>                : 
-<span class="lineNum">      63 </span><span class="lineCov">              2 : int Path::access( const std::string &amp;s, int m ) {</span>
-<span class="lineNum">      64 </span><span class="lineCov">              2 :         return ::access( s.c_str(), m );</span>
-<span class="lineNum">      65 </span>                : }
-<span class="lineNum">      66 </span>                : 
-<span class="lineNum">      67 </span><span class="lineCov">             49 : time_t Path::timestamp( const std::string&amp; file ) {</span>
-<span class="lineNum">      68 </span><span class="lineCov">             49 :         std::auto_ptr&lt;struct stat&gt; st = wibble::sys::fs::stat(file);</span>
-<span class="lineNum">      69 </span><span class="lineCov">             90 :         return st.get() == NULL ? 0 : st-&gt;st_mtime;</span>
-<span class="lineNum">      70 </span>                : }
-<span class="lineNum">      71 </span>                : 
-<span class="lineNum">      72 </span><span class="lineCov">             14 : void Path::setPopconSourceDir( const std::string &amp;s )</span>
-<span class="lineNum">      73 </span>                : {
-<span class="lineNum">      74 </span><span class="lineCov">             14 :         instance().m_popconSourceDir = s;</span>
-<span class="lineNum">      75 </span><span class="lineCov">             14 : }</span>
-<span class="lineNum">      76 </span><span class="lineCov">             14 : void Path::setPopconIndexDir( const std::string &amp;s )</span>
-<span class="lineNum">      77 </span>                : {
-<span class="lineNum">      78 </span><span class="lineCov">             14 :         instance().m_popconIndexDir = s;</span>
-<span class="lineNum">      79 </span><span class="lineCov">             14 : }</span>
-<span class="lineNum">      80 </span><span class="lineCov">             14 : void Path::setPopconUserSourceDir( const std::string &amp;s )</span>
-<span class="lineNum">      81 </span>                : {
-<span class="lineNum">      82 </span><span class="lineCov">             14 :         instance().m_popconUserSourceDir = s;</span>
-<span class="lineNum">      83 </span><span class="lineCov">             14 : }</span>
-<span class="lineNum">      84 </span><span class="lineCov">             14 : void Path::setPopconUserIndexDir( const std::string &amp;s )</span>
-<span class="lineNum">      85 </span>                : {
-<span class="lineNum">      86 </span><span class="lineCov">             14 :         instance().m_popconUserIndexDir = s;</span>
-<span class="lineNum">      87 </span><span class="lineCov">             14 : }</span>
-<span class="lineNum">      88 </span>                : 
-<span class="lineNum">      89 </span><span class="lineCov">             14 : std::string Path::popconSourceDir() { return instance().m_popconSourceDir; }</span>
-<span class="lineNum">      90 </span><span class="lineCov">             43 : std::string Path::popconIndexDir() { return instance().m_popconIndexDir; }</span>
-<span class="lineNum">      91 </span><span class="lineCov">             14 : std::string Path::popconUserSourceDir() { return instance().m_popconUserSourceDir; }</span>
-<span class="lineNum">      92 </span><span class="lineCov">             47 : std::string Path::popconUserIndexDir() { return instance().m_popconUserIndexDir; }</span>
-<span class="lineNum">      93 </span>                : 
-<span class="lineNum">      94 </span><span class="lineCov">             17 : std::string Path::scores() {</span>
-<span class="lineNum">      95 </span><span class="lineCov">             17 :         return str::joinpath(popconIndexDir(), &quot;scores&quot;);</span>
-<span class="lineNum">      96 </span>                : }
-<span class="lineNum">      97 </span>                : 
-<span class="lineNum">      98 </span><span class="lineCov">             17 : std::string Path::scoresIndex() {</span>
-<span class="lineNum">      99 </span><span class="lineCov">             17 :         return str::joinpath(popconIndexDir(), &quot;scores.idx&quot;);</span>
-<span class="lineNum">     100 </span>                : }
-<span class="lineNum">     101 </span>                : 
-<span class="lineNum">     102 </span><span class="lineCov">             20 : std::string Path::userScores() {</span>
-<span class="lineNum">     103 </span><span class="lineCov">             20 :         return str::joinpath(popconUserIndexDir(), &quot;scores&quot;);</span>
-<span class="lineNum">     104 </span>                : }
-<span class="lineNum">     105 </span>                : 
-<span class="lineNum">     106 </span><span class="lineCov">             20 : std::string Path::userScoresIndex() {</span>
-<span class="lineNum">     107 </span><span class="lineCov">             20 :         return str::joinpath(popconUserIndexDir(), &quot;scores.idx&quot;);</span>
-<span class="lineNum">     108 </span>                : }
-<span class="lineNum">     109 </span>                : 
-<span class="lineNum">     110 </span>                : Path *Path::s_instance = 0;
-<span class="lineNum">     111 </span>                : 
-<span class="lineNum">     112 </span>                : }
-<span class="lineNum">     113 </span>                : }
-<span class="lineNum">     114 </span>                : 
-<span class="lineNum">     115 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/popcon/maint/path.h.gcov.html b/rep/ept/popcon/maint/path.h.gcov.html
deleted file mode 100644
index 557613c..0000000
--- a/rep/ept/popcon/maint/path.h.gcov.html
+++ /dev/null
@@ -1,194 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/popcon/maint/path.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">ept/popcon/maint</a> - path.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">17</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">17</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- mode: c++; indent-tabs-mode: t -*-
-<span class="lineNum">       2 </span>                : /** \file
-<span class="lineNum">       3 </span>                :  * popcon paths
-<span class="lineNum">       4 </span>                :  */
-<span class="lineNum">       5 </span>                : 
-<span class="lineNum">       6 </span>                : /*
-<span class="lineNum">       7 </span>                :  * Copyright (C) 2005,2006,2007  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">       8 </span>                :  *
-<span class="lineNum">       9 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">      10 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">      11 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">      12 </span>                :  * (at your option) any later version.
-<span class="lineNum">      13 </span>                :  *
-<span class="lineNum">      14 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      15 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      16 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      17 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      18 </span>                :  *
-<span class="lineNum">      19 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      20 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      21 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      22 </span>                :  */
-<span class="lineNum">      23 </span>                : 
-<span class="lineNum">      24 </span>                : #ifndef EPT_POPCON_PATH_H
-<span class="lineNum">      25 </span>                : #define EPT_POPCON_PATH_H
-<span class="lineNum">      26 </span>                : 
-<span class="lineNum">      27 </span>                : #include &lt;string&gt;
-<span class="lineNum">      28 </span>                : 
-<span class="lineNum">      29 </span>                : struct stat;
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : namespace ept {
-<span class="lineNum">      32 </span>                : namespace popcon {
-<span class="lineNum">      33 </span>                : 
-<span class="lineNum">      34 </span>                : /**
-<span class="lineNum">      35 </span>                :  * Singleton class to configure and access the various Popcon paths
-<span class="lineNum">      36 </span>                :  */
-<span class="lineNum">      37 </span>                : class Path
-<span class="lineNum">      38 </span><span class="lineCov">              1 : {</span>
-<span class="lineNum">      39 </span>                : public:
-<span class="lineNum">      40 </span>                :         static std::string scores();
-<span class="lineNum">      41 </span>                :         static std::string scoresIndex();
-<span class="lineNum">      42 </span>                :         static std::string userScores();
-<span class="lineNum">      43 </span>                :         static std::string userScoresIndex();
-<span class="lineNum">      44 </span>                : 
-<span class="lineNum">      45 </span>                :         static std::string popconSourceDir();
-<span class="lineNum">      46 </span>                :         static std::string popconIndexDir();
-<span class="lineNum">      47 </span>                :         static std::string popconUserSourceDir();
-<span class="lineNum">      48 </span>                :         static std::string popconUserIndexDir();
-<span class="lineNum">      49 </span>                : 
-<span class="lineNum">      50 </span>                :         // Directory where Popcon source data is found
-<span class="lineNum">      51 </span>                :         static void setPopconSourceDir( const std::string &amp;s );
-<span class="lineNum">      52 </span>                : 
-<span class="lineNum">      53 </span>                :         // Directory where Popcon indexes are kept
-<span class="lineNum">      54 </span>                :         static void setPopconIndexDir( const std::string &amp;s );
-<span class="lineNum">      55 </span>                : 
-<span class="lineNum">      56 </span>                :         // User-specific directory for Popcon source data
-<span class="lineNum">      57 </span>                :         static void setPopconUserSourceDir( const std::string &amp;s );
-<span class="lineNum">      58 </span>                : 
-<span class="lineNum">      59 </span>                :         // User-specific directory for Popcon index data
-<span class="lineNum">      60 </span>                :         static void setPopconUserIndexDir( const std::string &amp;s );
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span>                :         static int access( const std::string &amp;, int );
-<span class="lineNum">      63 </span>                :         static time_t timestamp( const std::string&amp; );
-<span class="lineNum">      64 </span>                : 
-<span class="lineNum">      65 </span>                :         // RAII-style classes to temporarily override directories
-<span class="lineNum">      66 </span>                :         class OverridePopconSourceDir
-<span class="lineNum">      67 </span>                :         {
-<span class="lineNum">      68 </span>                :                 std::string old;
-<span class="lineNum">      69 </span>                :         public:
-<span class="lineNum">      70 </span><span class="lineCov">              7 :                 OverridePopconSourceDir(const std::string&amp; path) : old(Path::popconSourceDir())</span>
-<span class="lineNum">      71 </span>                :                 {
-<span class="lineNum">      72 </span><span class="lineCov">              7 :                         Path::setPopconSourceDir(path);</span>
-<span class="lineNum">      73 </span><span class="lineCov">              7 :                 }</span>
-<span class="lineNum">      74 </span><span class="lineCov">              7 :                 ~OverridePopconSourceDir() { Path::setPopconSourceDir(old); }</span>
-<span class="lineNum">      75 </span>                :         };
-<span class="lineNum">      76 </span>                :         class OverridePopconIndexDir
-<span class="lineNum">      77 </span>                :         {
-<span class="lineNum">      78 </span>                :                 std::string old;
-<span class="lineNum">      79 </span>                :         public:
-<span class="lineNum">      80 </span><span class="lineCov">              7 :                 OverridePopconIndexDir(const std::string&amp; path) : old(Path::popconIndexDir())</span>
-<span class="lineNum">      81 </span>                :                 {
-<span class="lineNum">      82 </span><span class="lineCov">              7 :                         Path::setPopconIndexDir(path);</span>
-<span class="lineNum">      83 </span><span class="lineCov">              7 :                 }</span>
-<span class="lineNum">      84 </span><span class="lineCov">              7 :                 ~OverridePopconIndexDir() { Path::setPopconIndexDir(old); }</span>
-<span class="lineNum">      85 </span>                :         };
-<span class="lineNum">      86 </span>                :         class OverridePopconUserSourceDir
-<span class="lineNum">      87 </span>                :         {
-<span class="lineNum">      88 </span>                :                 std::string old;
-<span class="lineNum">      89 </span>                :         public:
-<span class="lineNum">      90 </span><span class="lineCov">              7 :                 OverridePopconUserSourceDir(const std::string&amp; path) : old(Path::popconUserSourceDir())</span>
-<span class="lineNum">      91 </span>                :                 {
-<span class="lineNum">      92 </span><span class="lineCov">              7 :                         Path::setPopconUserSourceDir(path);</span>
-<span class="lineNum">      93 </span><span class="lineCov">              7 :                 }</span>
-<span class="lineNum">      94 </span><span class="lineCov">              7 :                 ~OverridePopconUserSourceDir() { Path::setPopconUserSourceDir(old); }</span>
-<span class="lineNum">      95 </span>                :         };
-<span class="lineNum">      96 </span>                :         class OverridePopconUserIndexDir
-<span class="lineNum">      97 </span>                :         {
-<span class="lineNum">      98 </span>                :                 std::string old;
-<span class="lineNum">      99 </span>                :         public:
-<span class="lineNum">     100 </span><span class="lineCov">              7 :                 OverridePopconUserIndexDir(const std::string&amp; path) : old(Path::popconUserIndexDir())</span>
-<span class="lineNum">     101 </span>                :                 {
-<span class="lineNum">     102 </span><span class="lineCov">              7 :                         Path::setPopconUserIndexDir(path);</span>
-<span class="lineNum">     103 </span><span class="lineCov">              7 :                 }</span>
-<span class="lineNum">     104 </span><span class="lineCov">              7 :                 ~OverridePopconUserIndexDir() { Path::setPopconUserIndexDir(old); }</span>
-<span class="lineNum">     105 </span>                :         };
-<span class="lineNum">     106 </span>                : protected:
-<span class="lineNum">     107 </span>                :         static Path *s_instance;
-<span class="lineNum">     108 </span>                :         static Path &amp;instance();
-<span class="lineNum">     109 </span>                : 
-<span class="lineNum">     110 </span>                :         // Directory where Popcon source data is found
-<span class="lineNum">     111 </span>                :         std::string m_popconSourceDir;
-<span class="lineNum">     112 </span>                : 
-<span class="lineNum">     113 </span>                :         // Directory where Popcon indexes are kept
-<span class="lineNum">     114 </span>                :         std::string m_popconIndexDir;
-<span class="lineNum">     115 </span>                : 
-<span class="lineNum">     116 </span>                :         // User-specific directory for Popcon source data
-<span class="lineNum">     117 </span>                :         std::string m_popconUserSourceDir;
-<span class="lineNum">     118 </span>                : 
-<span class="lineNum">     119 </span>                :         // User-specific directory for Popcon index data
-<span class="lineNum">     120 </span>                :         std::string m_popconUserIndexDir;
-<span class="lineNum">     121 </span>                : };
-<span class="lineNum">     122 </span>                : 
-<span class="lineNum">     123 </span>                : }
-<span class="lineNum">     124 </span>                : }
-<span class="lineNum">     125 </span>                : 
-<span class="lineNum">     126 </span>                : // vim:set ts=4 sw=4:
-<span class="lineNum">     127 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/popcon/maint/popconindexer.cc.gcov.html b/rep/ept/popcon/maint/popconindexer.cc.gcov.html
deleted file mode 100644
index 28d6298..0000000
--- a/rep/ept/popcon/maint/popconindexer.cc.gcov.html
+++ /dev/null
@@ -1,314 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/popcon/maint/popconindexer.cc</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">ept/popcon/maint</a> - popconindexer.cc</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">116</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">79.3 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">92</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #include &lt;ept/popcon/popcon.h&gt;
-<span class="lineNum">       2 </span>                : #include &lt;ept/popcon/maint/popconindexer.h&gt;
-<span class="lineNum">       3 </span>                : #include &lt;ept/popcon/maint/path.h&gt;
-<span class="lineNum">       4 </span>                : 
-<span class="lineNum">       5 </span>                : #include &lt;wibble/exception.h&gt;
-<span class="lineNum">       6 </span>                : #include &lt;wibble/sys/fs.h&gt;
-<span class="lineNum">       7 </span>                : 
-<span class="lineNum">       8 </span>                : #include &lt;tagcoll/diskindex/mmap.h&gt;
-<span class="lineNum">       9 </span>                : 
-<span class="lineNum">      10 </span>                : #include &lt;set&gt;
-<span class="lineNum">      11 </span>                : #include &lt;string&gt;
-<span class="lineNum">      12 </span>                : #include &lt;cstdio&gt;
-<span class="lineNum">      13 </span>                : #include &lt;cstring&gt;
-<span class="lineNum">      14 </span>                : 
-<span class="lineNum">      15 </span>                : using namespace std;
-<span class="lineNum">      16 </span>                : 
-<span class="lineNum">      17 </span>                : namespace ept {
-<span class="lineNum">      18 </span>                : namespace popcon {
-<span class="lineNum">      19 </span>                : 
-<span class="lineNum">      20 </span>                : template&lt;typename STRUCT&gt;
-<span class="lineNum">      21 </span>                : struct StructIndexer : public tagcoll::diskindex::MMapIndexer
-<span class="lineNum">      22 </span><span class="lineCov">              1 : {</span>
-<span class="lineNum">      23 </span>                :         const STRUCT&amp; data;
-<span class="lineNum">      24 </span><span class="lineCov">              1 :         StructIndexer(const STRUCT&amp; data) : data(data) {}</span>
-<span class="lineNum">      25 </span>                : 
-<span class="lineNum">      26 </span><span class="lineCov">              1 :         int encodedSize() const { return sizeof(STRUCT); }</span>
-<span class="lineNum">      27 </span><span class="lineCov">              1 :         void encode(char* buf) const { *(STRUCT*)buf = data; }</span>
-<span class="lineNum">      28 </span>                : };
-<span class="lineNum">      29 </span>                : 
-<span class="lineNum">      30 </span>                : /// MMapIndexer that indexes the package names
-<span class="lineNum">      31 </span>                : struct PopconGenerator : public tagcoll::diskindex::MMapIndexer
-<span class="lineNum">      32 </span><span class="lineCov">              4 : {</span>
-<span class="lineNum">      33 </span>                :         // Sorted set of all available package names and data
-<span class="lineNum">      34 </span>                :         std::map&lt;std::string, Score&gt; data;
-<span class="lineNum">      35 </span>                : 
-<span class="lineNum">      36 </span><span class="lineCov">              1 :         int encodedSize() const</span>
-<span class="lineNum">      37 </span>                :         {
-<span class="lineNum">      38 </span><span class="lineCov">              1 :                 int size = data.size() * sizeof(Score);</span>
-<span class="lineNum">      39 </span><span class="lineCov">          69911 :                 for (std::map&lt;std::string, Score&gt;::const_iterator i = data.begin();</span>
-<span class="lineNum">      40 </span>                :                                 i != data.end(); ++i)
-<span class="lineNum">      41 </span><span class="lineCov">          69910 :                         size += i-&gt;first.size() + 1;</span>
-<span class="lineNum">      42 </span><span class="lineCov">              1 :                 return tagcoll::diskindex::MMap::align(size);</span>
-<span class="lineNum">      43 </span>                :         }
-<span class="lineNum">      44 </span>                : 
-<span class="lineNum">      45 </span><span class="lineCov">              1 :         void encode(char* buf) const</span>
-<span class="lineNum">      46 </span>                :         {
-<span class="lineNum">      47 </span><span class="lineCov">              1 :                 int pos = data.size() * sizeof(Score);</span>
-<span class="lineNum">      48 </span><span class="lineCov">              1 :                 int idx = 0;</span>
-<span class="lineNum">      49 </span><span class="lineCov">          69911 :                 for (std::map&lt;std::string, Score&gt;::const_iterator i = data.begin();</span>
-<span class="lineNum">      50 </span>                :                                 i != data.end(); ++i)
-<span class="lineNum">      51 </span>                :                 {
-<span class="lineNum">      52 </span><span class="lineCov">          69910 :                         ((Score*)buf)[idx] = i-&gt;second;</span>
-<span class="lineNum">      53 </span><span class="lineCov">          69910 :                         ((Score*)buf)[idx].offset = pos;</span>
-<span class="lineNum">      54 </span><span class="lineCov">          69910 :                         memcpy(buf + pos, i-&gt;first.c_str(), i-&gt;first.size() + 1);</span>
-<span class="lineNum">      55 </span><span class="lineCov">          69910 :                         pos += i-&gt;first.size() + 1;</span>
-<span class="lineNum">      56 </span><span class="lineCov">          69910 :                         ++idx;</span>
-<span class="lineNum">      57 </span>                :                 }
-<span class="lineNum">      58 </span><span class="lineCov">              1 :         }</span>
-<span class="lineNum">      59 </span>                : };
-<span class="lineNum">      60 </span>                : 
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span><span class="lineCov">              7 : PopconIndexer::PopconIndexer()</span>
-<span class="lineNum">      63 </span>                :         : mainSource(Path::popconSourceDir()),
-<span class="lineNum">      64 </span><span class="lineCov">              7 :           userSource(Path::popconUserSourceDir())</span>
-<span class="lineNum">      65 </span>                : {
-<span class="lineNum">      66 </span><span class="lineCov">              7 :         rescan();</span>
-<span class="lineNum">      67 </span><span class="lineCov">              7 : }</span>
-<span class="lineNum">      68 </span>                : 
-<span class="lineNum">      69 </span><span class="lineCov">              7 : void PopconIndexer::rescan()</span>
-<span class="lineNum">      70 </span>                : {
-<span class="lineNum">      71 </span><span class="lineCov">              7 :         ts_main_src = mainSource.timestamp();</span>
-<span class="lineNum">      72 </span><span class="lineCov">              7 :         ts_user_src = userSource.timestamp();</span>
-<span class="lineNum">      73 </span><span class="lineCov">              7 :         ts_main_sco = Path::timestamp(Path::scores());</span>
-<span class="lineNum">      74 </span><span class="lineCov">             14 :         ts_user_sco = Path::timestamp(Path::userScores());</span>
-<span class="lineNum">      75 </span><span class="lineCov">             14 :         ts_main_idx = Path::timestamp(Path::scoresIndex());</span>
-<span class="lineNum">      76 </span><span class="lineCov">             14 :         ts_user_idx = Path::timestamp(Path::userScoresIndex());</span>
-<span class="lineNum">      77 </span><span class="lineCov">              7 : }</span>
-<span class="lineNum">      78 </span>                : 
-<span class="lineNum">      79 </span><span class="lineCov">              7 : bool PopconIndexer::needsRebuild() const</span>
-<span class="lineNum">      80 </span>                : {
-<span class="lineNum">      81 </span>                :         // If there are no indexes of any kind, then we need rebuilding
-<span class="lineNum">      82 </span><span class="lineCov">              7 :         if (ts_user_sco == 0 || ts_main_sco == 0 || ts_user_idx == 0 &amp;&amp; ts_main_idx == 0)</span>
-<span class="lineNum">      83 </span><span class="lineCov">              2 :                 return true;</span>
-<span class="lineNum">      84 </span>                : 
-<span class="lineNum">      85 </span>                :         // If the user index is ok, then we are fine
-<span class="lineNum">      86 </span><span class="lineCov">              5 :         if (ts_user_sco &gt;= sourceTimestamp() &amp;&amp; ts_user_idx &gt;= sourceTimestamp())</span>
-<span class="lineNum">      87 </span><span class="lineCov">              5 :                 return false;</span>
-<span class="lineNum">      88 </span>                : 
-<span class="lineNum">      89 </span>                :         // If there are user sources, then we cannot use the system index
-<span class="lineNum">      90 </span><span class="lineNoCov">              0 :         if (ts_user_src &gt; 0)</span>
-<span class="lineNum">      91 </span><span class="lineNoCov">              0 :                 return true;</span>
-<span class="lineNum">      92 </span>                : 
-<span class="lineNum">      93 </span>                :         // If there are no user sources, then we can fallback on the system
-<span class="lineNum">      94 </span>                :         // indexes in case the user indexes are not up to date
-<span class="lineNum">      95 </span><span class="lineNoCov">              0 :         if (ts_main_sco &gt;= sourceTimestamp() &amp;&amp; ts_main_idx &gt;= sourceTimestamp())</span>
-<span class="lineNum">      96 </span><span class="lineNoCov">              0 :                 return false;</span>
-<span class="lineNum">      97 </span>                : 
-<span class="lineNum">      98 </span><span class="lineNoCov">              0 :         return true;</span>
-<span class="lineNum">      99 </span>                : }
-<span class="lineNum">     100 </span>                : 
-<span class="lineNum">     101 </span><span class="lineCov">              7 : bool PopconIndexer::userIndexIsRedundant() const</span>
-<span class="lineNum">     102 </span>                : {
-<span class="lineNum">     103 </span>                :         // If there is no user index, then it is not redundant
-<span class="lineNum">     104 </span><span class="lineCov">              7 :         if (ts_user_idx == 0)</span>
-<span class="lineNum">     105 </span><span class="lineCov">              1 :                 return false;</span>
-<span class="lineNum">     106 </span>                : 
-<span class="lineNum">     107 </span>                :         // If the system index is not up to date, then the user index is not
-<span class="lineNum">     108 </span>                :         // redundant
-<span class="lineNum">     109 </span><span class="lineCov">              6 :         if (ts_main_idx &lt; sourceTimestamp())</span>
-<span class="lineNum">     110 </span><span class="lineNoCov">              0 :                 return false;</span>
-<span class="lineNum">     111 </span>                : 
-<span class="lineNum">     112 </span><span class="lineCov">              6 :         return true;</span>
-<span class="lineNum">     113 </span>                : }
-<span class="lineNum">     114 </span>                : 
-<span class="lineNum">     115 </span><span class="lineCov">              2 : bool PopconIndexer::rebuild(const std::string&amp; scofname, const std::string&amp; idxfname)</span>
-<span class="lineNum">     116 </span>                : {
-<span class="lineNum">     117 </span><span class="lineCov">              2 :         PopconGenerator gen;</span>
-<span class="lineNum">     118 </span>                :         InfoStruct is;
-<span class="lineNum">     119 </span><span class="lineCov">              2 :         is.submissions = 0;</span>
-<span class="lineNum">     120 </span><span class="lineCov">              2 :         if (!mainSource.readScores(gen.data, is.submissions))</span>
-<span class="lineNum">     121 </span><span class="lineCov">              1 :                 userSource.readScores(gen.data, is.submissions);</span>
-<span class="lineNum">     122 </span><span class="lineCov">              2 :         if (gen.data.empty())</span>
-<span class="lineNum">     123 </span><span class="lineCov">              1 :                 return false;</span>
-<span class="lineNum">     124 </span>                : 
-<span class="lineNum">     125 </span><span class="lineCov">              1 :         StructIndexer&lt;InfoStruct&gt; infoStruct(is);</span>
-<span class="lineNum">     126 </span>                : 
-<span class="lineNum">     127 </span>                :         // Create the index
-<span class="lineNum">     128 </span><span class="lineCov">              1 :         tagcoll::diskindex::MasterMMapIndexer master(idxfname);</span>
-<span class="lineNum">     129 </span><span class="lineCov">              1 :         master.append(gen);</span>
-<span class="lineNum">     130 </span><span class="lineCov">              1 :         master.append(infoStruct);</span>
-<span class="lineNum">     131 </span><span class="lineCov">              1 :         master.commit();</span>
-<span class="lineNum">     132 </span>                : 
-<span class="lineNum">     133 </span>                : //      for (map&lt;string, Score&gt;::const_iterator i = gen.data.begin(); i != gen.data.end(); ++i)
-<span class="lineNum">     134 </span>                : //      {
-<span class="lineNum">     135 </span>                : //              fprintf(stderr, &quot;%s   %d   %f\n&quot;, i-&gt;first.c_str(), i-&gt;second.offset, i-&gt;second.score);
-<span class="lineNum">     136 </span>                : //      }
-<span class="lineNum">     137 </span>                : 
-<span class="lineNum">     138 </span>                :         // Create the score file
-<span class="lineNum">     139 </span><span class="lineCov">              1 :         FILE* out = fopen(scofname.c_str(), &quot;wt&quot;);</span>
-<span class="lineNum">     140 </span><span class="lineCov">              1 :         if (out == NULL)</span>
-<span class="lineNum">     141 </span><span class="lineNoCov">              0 :                 throw wibble::exception::File(scofname, &quot;opening and truncating file for writing&quot;);</span>
-<span class="lineNum">     142 </span><span class="lineCov">          69911 :         for (map&lt;string, Score&gt;::const_iterator i = gen.data.begin();</span>
-<span class="lineNum">     143 </span>                :                         i != gen.data.end(); ++i)
-<span class="lineNum">     144 </span>                :         {
-<span class="lineNum">     145 </span><span class="lineCov">          69910 :                 fprintf(out, &quot;%s %f\n&quot;, i-&gt;first.c_str(), i-&gt;second.score);</span>
-<span class="lineNum">     146 </span>                :         }
-<span class="lineNum">     147 </span><span class="lineCov">              1 :         fclose(out);</span>
-<span class="lineNum">     148 </span><span class="lineCov">              1 :         return true;</span>
-<span class="lineNum">     149 </span>                : }
-<span class="lineNum">     150 </span>                : 
-<span class="lineNum">     151 </span><span class="lineCov">              7 : bool PopconIndexer::rebuildIfNeeded()</span>
-<span class="lineNum">     152 </span>                : {
-<span class="lineNum">     153 </span><span class="lineCov">              7 :         if (needsRebuild())</span>
-<span class="lineNum">     154 </span>                :         {
-<span class="lineNum">     155 </span>                :                 // Decide if we rebuild the user index or the system index
-<span class="lineNum">     156 </span><span class="lineCov">              2 :                 if (Path::access(Path::popconIndexDir(), W_OK) == 0)</span>
-<span class="lineNum">     157 </span>                :                 {
-<span class="lineNum">     158 </span>                :                         // Since we can write on the system index directory, we rebuild
-<span class="lineNum">     159 </span>                :                         // the system index
-<span class="lineNum">     160 </span><span class="lineCov">              2 :                         if (!rebuild(Path::scores(), Path::scoresIndex()))</span>
-<span class="lineNum">     161 </span><span class="lineCov">              1 :                                 return false;</span>
-<span class="lineNum">     162 </span><span class="lineCov">              1 :                         ts_main_sco = Path::timestamp(Path::scores());</span>
-<span class="lineNum">     163 </span><span class="lineCov">              2 :                         ts_main_idx = Path::timestamp(Path::scoresIndex());</span>
-<span class="lineNum">     164 </span><span class="lineCov">              2 :                         if (Path::scores() == Path::userScores())</span>
-<span class="lineNum">     165 </span><span class="lineCov">              1 :                                 ts_user_sco = ts_main_sco;</span>
-<span class="lineNum">     166 </span><span class="lineCov">              1 :                         if (Path::scoresIndex() == Path::userScoresIndex())</span>
-<span class="lineNum">     167 </span><span class="lineCov">              1 :                                 ts_user_idx = ts_main_idx;</span>
-<span class="lineNum">     168 </span>                :                 } else {
-<span class="lineNum">     169 </span><span class="lineNoCov">              0 :                         wibble::sys::fs::mkFilePath(Path::userScores());</span>
-<span class="lineNum">     170 </span><span class="lineNoCov">              0 :                         wibble::sys::fs::mkFilePath(Path::userScoresIndex());</span>
-<span class="lineNum">     171 </span><span class="lineNoCov">              0 :                         if (!rebuild(Path::userScores(), Path::userScoresIndex()))</span>
-<span class="lineNum">     172 </span><span class="lineNoCov">              0 :                                 return false;</span>
-<span class="lineNum">     173 </span><span class="lineNoCov">              0 :                         ts_user_sco = Path::timestamp(Path::userScores());</span>
-<span class="lineNum">     174 </span><span class="lineNoCov">              0 :                         ts_user_idx = Path::timestamp(Path::userScoresIndex());</span>
-<span class="lineNum">     175 </span>                :                 }
-<span class="lineNum">     176 </span><span class="lineCov">              1 :                 return true;</span>
-<span class="lineNum">     177 </span>                :         }
-<span class="lineNum">     178 </span><span class="lineCov">              5 :         return false;</span>
-<span class="lineNum">     179 </span>                : }
-<span class="lineNum">     180 </span>                : 
-<span class="lineNum">     181 </span><span class="lineCov">              7 : bool PopconIndexer::deleteRedundantUserIndex()</span>
-<span class="lineNum">     182 </span>                : {
-<span class="lineNum">     183 </span><span class="lineCov">              7 :         if (userIndexIsRedundant())</span>
-<span class="lineNum">     184 </span>                :         {
-<span class="lineNum">     185 </span>                :                 // Delete the user indexes if they exist
-<span class="lineNum">     186 </span><span class="lineCov">              6 :                 if (Path::scores() != Path::userScores())</span>
-<span class="lineNum">     187 </span>                :                 {
-<span class="lineNum">     188 </span><span class="lineNoCov">              0 :                         unlink(Path::userScores().c_str());</span>
-<span class="lineNum">     189 </span><span class="lineNoCov">              0 :                         ts_user_sco = 0;</span>
-<span class="lineNum">     190 </span>                :                 }
-<span class="lineNum">     191 </span><span class="lineCov">              6 :                 if (Path::scoresIndex() != Path::userScoresIndex())</span>
-<span class="lineNum">     192 </span>                :                 {
-<span class="lineNum">     193 </span><span class="lineNoCov">              0 :                         unlink(Path::userScoresIndex().c_str());</span>
-<span class="lineNum">     194 </span><span class="lineNoCov">              0 :                         ts_user_idx = 0;</span>
-<span class="lineNum">     195 </span>                :                 }
-<span class="lineNum">     196 </span><span class="lineCov">              6 :                 return true;</span>
-<span class="lineNum">     197 </span>                :         }
-<span class="lineNum">     198 </span><span class="lineCov">              1 :         return false;</span>
-<span class="lineNum">     199 </span>                : }
-<span class="lineNum">     200 </span>                : 
-<span class="lineNum">     201 </span><span class="lineCov">              7 : bool PopconIndexer::getUpToDatePopcon(std::string&amp; scofname, std::string&amp; idxfname)</span>
-<span class="lineNum">     202 </span>                : {
-<span class="lineNum">     203 </span>                :         // If there are no indexes of any kind, then we have nothing to return
-<span class="lineNum">     204 </span><span class="lineCov">              7 :         if (ts_user_sco == 0 &amp;&amp; ts_main_sco == 0 &amp;&amp; ts_user_idx == 0 &amp;&amp; ts_main_idx == 0)</span>
-<span class="lineNum">     205 </span><span class="lineCov">              1 :                 return false;</span>
-<span class="lineNum">     206 </span>                : 
-<span class="lineNum">     207 </span>                :         // If the user index is up to date, use it
-<span class="lineNum">     208 </span><span class="lineCov">              6 :         if (ts_user_sco &gt;= sourceTimestamp() &amp;&amp;</span>
-<span class="lineNum">     209 </span>                :             ts_user_idx &gt;= sourceTimestamp())
-<span class="lineNum">     210 </span>                :         {
-<span class="lineNum">     211 </span><span class="lineCov">              6 :                 scofname = Path::userScores();</span>
-<span class="lineNum">     212 </span><span class="lineCov">             12 :                 idxfname = Path::userScoresIndex();</span>
-<span class="lineNum">     213 </span><span class="lineCov">              6 :                 return true;</span>
-<span class="lineNum">     214 </span>                :         }
-<span class="lineNum">     215 </span>                : 
-<span class="lineNum">     216 </span>                :         // If the user index is not up to date and we have user sources, we cannot
-<span class="lineNum">     217 </span>                :         // fall back to the system index
-<span class="lineNum">     218 </span><span class="lineNoCov">              0 :         if (ts_user_src != 0)</span>
-<span class="lineNum">     219 </span><span class="lineNoCov">              0 :                 return false;</span>
-<span class="lineNum">     220 </span>                : 
-<span class="lineNum">     221 </span>                :         // Fallback to the system index
-<span class="lineNum">     222 </span><span class="lineNoCov">              0 :         if (ts_main_sco &gt;= sourceTimestamp() &amp;&amp;</span>
-<span class="lineNum">     223 </span>                :             ts_main_idx &gt;= sourceTimestamp())
-<span class="lineNum">     224 </span>                :         {
-<span class="lineNum">     225 </span><span class="lineNoCov">              0 :                 scofname = Path::scores();</span>
-<span class="lineNum">     226 </span><span class="lineNoCov">              0 :                 idxfname = Path::scoresIndex();</span>
-<span class="lineNum">     227 </span><span class="lineNoCov">              0 :                 return true;</span>
-<span class="lineNum">     228 </span>                :         }
-<span class="lineNum">     229 </span>                : 
-<span class="lineNum">     230 </span><span class="lineNoCov">              0 :         return false;</span>
-<span class="lineNum">     231 </span>                : }
-<span class="lineNum">     232 </span>                : 
-<span class="lineNum">     233 </span>                : 
-<span class="lineNum">     234 </span><span class="lineCov">              7 : bool PopconIndexer::obtainWorkingPopcon(std::string&amp; scofname, std::string&amp; idxfname)</span>
-<span class="lineNum">     235 </span>                : {
-<span class="lineNum">     236 </span><span class="lineCov">              7 :         PopconIndexer indexer;</span>
-<span class="lineNum">     237 </span>                : 
-<span class="lineNum">     238 </span><span class="lineCov">              7 :         indexer.rebuildIfNeeded();</span>
-<span class="lineNum">     239 </span><span class="lineCov">              7 :         indexer.deleteRedundantUserIndex();</span>
-<span class="lineNum">     240 </span><span class="lineCov">              7 :         return indexer.getUpToDatePopcon(scofname, idxfname);</span>
-<span class="lineNum">     241 </span>                : }
-<span class="lineNum">     242 </span>                : 
-<span class="lineNum">     243 </span>                : 
-<span class="lineNum">     244 </span>                : }
-<span class="lineNum">     245 </span><span class="lineCov">              6 : }</span>
-<span class="lineNum">     246 </span>                : 
-<span class="lineNum">     247 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/popcon/maint/popconindexer.h.gcov.html b/rep/ept/popcon/maint/popconindexer.h.gcov.html
deleted file mode 100644
index fe36a9d..0000000
--- a/rep/ept/popcon/maint/popconindexer.h.gcov.html
+++ /dev/null
@@ -1,142 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/popcon/maint/popconindexer.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">ept/popcon/maint</a> - popconindexer.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">5</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">5</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #ifndef EPT_DEBTAGS_PKGIDINDEXER_H
-<span class="lineNum">       2 </span>                : #define EPT_DEBTAGS_PKGIDINDEXER_H
-<span class="lineNum">       3 </span>                : 
-<span class="lineNum">       4 </span>                : /** @file
-<span class="lineNum">       5 </span>                :  * @author Enrico Zini &lt;enrico@enricozini.org&gt;
-<span class="lineNum">       6 </span>                :  * Rebuild and maintain the map from package IDs to package names
-<span class="lineNum">       7 </span>                :  */
-<span class="lineNum">       8 </span>                : 
-<span class="lineNum">       9 </span>                : /*
-<span class="lineNum">      10 </span>                :  * Copyright (C) 2003-2007  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">      11 </span>                :  *
-<span class="lineNum">      12 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">      13 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">      14 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">      15 </span>                :  * (at your option) any later version.
-<span class="lineNum">      16 </span>                :  *
-<span class="lineNum">      17 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      18 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      19 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      20 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      21 </span>                :  *
-<span class="lineNum">      22 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      23 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      24 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      25 </span>                :  */
-<span class="lineNum">      26 </span>                : 
-<span class="lineNum">      27 </span>                : #include &lt;ept/popcon/maint/sourcedir.h&gt;
-<span class="lineNum">      28 </span>                : #include &lt;string&gt;
-<span class="lineNum">      29 </span>                : 
-<span class="lineNum">      30 </span>                : namespace ept {
-<span class="lineNum">      31 </span>                : namespace popcon {
-<span class="lineNum">      32 </span>                : 
-<span class="lineNum">      33 </span>                : struct InfoStruct
-<span class="lineNum">      34 </span>                : {
-<span class="lineNum">      35 </span>                :         size_t submissions;
-<span class="lineNum">      36 </span>                : };
-<span class="lineNum">      37 </span>                : 
-<span class="lineNum">      38 </span>                : struct PopconIndexer
-<span class="lineNum">      39 </span><span class="lineCov">              7 : {</span>
-<span class="lineNum">      40 </span>                :         SourceDir mainSource;
-<span class="lineNum">      41 </span>                :         SourceDir userSource;
-<span class="lineNum">      42 </span>                :         time_t ts_main_src;
-<span class="lineNum">      43 </span>                :         time_t ts_user_src;
-<span class="lineNum">      44 </span>                :         time_t ts_main_sco;
-<span class="lineNum">      45 </span>                :         time_t ts_user_sco;
-<span class="lineNum">      46 </span>                :         time_t ts_main_idx;
-<span class="lineNum">      47 </span>                :         time_t ts_user_idx;
-<span class="lineNum">      48 </span>                : 
-<span class="lineNum">      49 </span><span class="lineCov">             28 :         time_t sourceTimestamp() const</span>
-<span class="lineNum">      50 </span>                :         {
-<span class="lineNum">      51 </span><span class="lineCov">             28 :                 time_t res = ts_main_src;</span>
-<span class="lineNum">      52 </span><span class="lineCov">             28 :                 if (ts_user_src &gt; res) res = ts_user_src;</span>
-<span class="lineNum">      53 </span><span class="lineCov">             28 :                 return res;</span>
-<span class="lineNum">      54 </span>                : 
-<span class="lineNum">      55 </span>                :         }
-<span class="lineNum">      56 </span>                :         bool needsRebuild() const;
-<span class="lineNum">      57 </span>                :         bool rebuild(const std::string&amp; scofname, const std::string&amp; idxfname);
-<span class="lineNum">      58 </span>                :         bool rebuildIfNeeded();
-<span class="lineNum">      59 </span>                :         bool getUpToDatePopcon(std::string&amp; scofname, std::string&amp; idxfname);
-<span class="lineNum">      60 </span>                : 
-<span class="lineNum">      61 </span>                :         bool userIndexIsRedundant() const;
-<span class="lineNum">      62 </span>                :         bool deleteRedundantUserIndex();
-<span class="lineNum">      63 </span>                : 
-<span class="lineNum">      64 </span>                :         void rescan();
-<span class="lineNum">      65 </span>                : 
-<span class="lineNum">      66 </span>                :         PopconIndexer();
-<span class="lineNum">      67 </span>                : 
-<span class="lineNum">      68 </span>                :         static bool obtainWorkingPopcon(std::string&amp; scofname, std::string&amp; idxfname);
-<span class="lineNum">      69 </span>                : };
-<span class="lineNum">      70 </span>                : 
-<span class="lineNum">      71 </span>                : }
-<span class="lineNum">      72 </span>                : }
-<span class="lineNum">      73 </span>                : 
-<span class="lineNum">      74 </span>                : // vim:set ts=4 sw=4:
-<span class="lineNum">      75 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/popcon/maint/sourcedir.cc.gcov.html b/rep/ept/popcon/maint/sourcedir.cc.gcov.html
deleted file mode 100644
index 80a1a4e..0000000
--- a/rep/ept/popcon/maint/sourcedir.cc.gcov.html
+++ /dev/null
@@ -1,210 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/popcon/maint/sourcedir.cc</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">ept/popcon/maint</a> - sourcedir.cc</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">76</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">93.4 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">71</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #include &lt;ept/popcon/maint/sourcedir.h&gt;
-<span class="lineNum">       2 </span>                : #include &lt;ept/popcon/maint/path.h&gt;
-<span class="lineNum">       3 </span>                : 
-<span class="lineNum">       4 </span>                : #include &lt;wibble/string.h&gt;
-<span class="lineNum">       5 </span>                : 
-<span class="lineNum">       6 </span>                : #include &lt;tagcoll/input/zlib.h&gt;
-<span class="lineNum">       7 </span>                : #include &lt;tagcoll/input/stdio.h&gt;
-<span class="lineNum">       8 </span>                : 
-<span class="lineNum">       9 </span>                : #include &lt;cstdlib&gt;
-<span class="lineNum">      10 </span>                : 
-<span class="lineNum">      11 </span>                : using namespace std;
-<span class="lineNum">      12 </span>                : using namespace wibble;
-<span class="lineNum">      13 </span>                : 
-<span class="lineNum">      14 </span>                : namespace ept {
-<span class="lineNum">      15 </span>                : namespace popcon {
-<span class="lineNum">      16 </span>                : 
-<span class="lineNum">      17 </span><span class="lineCov">             93 : SourceDir::FileType SourceDir::fileType(const std::string&amp; name)</span>
-<span class="lineNum">      18 </span>                : {
-<span class="lineNum">      19 </span><span class="lineCov">             93 :         if (name[0] == '.') return SKIP;</span>
-<span class="lineNum">      20 </span>                : 
-<span class="lineNum">      21 </span><span class="lineCov">             59 :         if (name == &quot;all-popcon-results.txt&quot;) return RAW;</span>
-<span class="lineNum">      22 </span><span class="lineCov">             59 :         if (name == &quot;all-popcon-results.txt.gz&quot;) return RAWGZ;</span>
-<span class="lineNum">      23 </span>                : 
-<span class="lineNum">      24 </span><span class="lineCov">             46 :         return SKIP;</span>
-<span class="lineNum">      25 </span>                : }
-<span class="lineNum">      26 </span>                : 
-<span class="lineNum">      27 </span><span class="lineCov">             14 : time_t SourceDir::timestamp()</span>
-<span class="lineNum">      28 </span>                : {
-<span class="lineNum">      29 </span><span class="lineCov">             14 :         if (!valid()) return 0;</span>
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span><span class="lineCov">             14 :         time_t max = 0;</span>
-<span class="lineNum">      32 </span><span class="lineCov">             98 :         for (const_iterator d = begin(); d != end(); ++d)</span>
-<span class="lineNum">      33 </span>                :         {
-<span class="lineNum">      34 </span><span class="lineCov">             84 :                 FileType type = fileType(d-&gt;d_name);</span>
-<span class="lineNum">      35 </span><span class="lineCov">             84 :                 if (type == SKIP) continue;</span>
-<span class="lineNum">      36 </span>                : 
-<span class="lineNum">      37 </span><span class="lineCov">             12 :                 time_t ts = Path::timestamp(str::joinpath(path(), d-&gt;d_name));</span>
-<span class="lineNum">      38 </span><span class="lineCov">             24 :                 if (ts &gt; max) max = ts;</span>
-<span class="lineNum">      39 </span><span class="lineCov">             14 :         }</span>
-<span class="lineNum">      40 </span>                : 
-<span class="lineNum">      41 </span><span class="lineCov">             14 :         return max;</span>
-<span class="lineNum">      42 </span>                : }
-<span class="lineNum">      43 </span>                : 
-<span class="lineNum">      44 </span><span class="lineCov">          70200 : bool readLine(tagcoll::input::Input&amp; in, string&amp; str)</span>
-<span class="lineNum">      45 </span>                : {
-<span class="lineNum">      46 </span><span class="lineCov">          70200 :         str.clear();</span>
-<span class="lineNum">      47 </span>                :         int c;
-<span class="lineNum">      48 </span><span class="lineCov">        4594913 :         while ((c = in.nextChar()) != tagcoll::input::Input::Eof &amp;&amp; c != '\n')</span>
-<span class="lineNum">      49 </span><span class="lineCov">        4454513 :                 str += c;</span>
-<span class="lineNum">      50 </span><span class="lineCov">          70200 :         return c != tagcoll::input::Input::Eof;</span>
-<span class="lineNum">      51 </span>                : }
-<span class="lineNum">      52 </span>                : 
-<span class="lineNum">      53 </span><span class="lineCov">              1 : static void parseScores(tagcoll::input::Input&amp; in, map&lt;std::string, Score&gt;&amp; out, size_t&amp; submissions)</span>
-<span class="lineNum">      54 </span>                : {
-<span class="lineNum">      55 </span><span class="lineCov">              1 :         string line;</span>
-<span class="lineNum">      56 </span><span class="lineCov">         140349 :         while (readLine(in, line))</span>
-<span class="lineNum">      57 </span>                :         {
-<span class="lineNum">      58 </span><span class="lineCov">          70199 :                 if (line.size() &lt; 10)</span>
-<span class="lineNum">      59 </span><span class="lineNoCov">              0 :                         continue;</span>
-<span class="lineNum">      60 </span><span class="lineCov">          70199 :                 if (line.substr(0, 13) == &quot;Submissions: &quot;)</span>
-<span class="lineNum">      61 </span>                :                 {
-<span class="lineNum">      62 </span><span class="lineCov">              1 :                         submissions = strtoul(line.substr(13).c_str(), 0, 10);</span>
-<span class="lineNum">      63 </span><span class="lineCov">              1 :                         continue;</span>
-<span class="lineNum">      64 </span>                :                 }
-<span class="lineNum">      65 </span><span class="lineCov">          70198 :                 if (line.substr(0, 9) != &quot;Package: &quot;)</span>
-<span class="lineNum">      66 </span><span class="lineCov">             50 :                         continue;</span>
-<span class="lineNum">      67 </span><span class="lineCov">          70148 :                 size_t start = 9;</span>
-<span class="lineNum">      68 </span><span class="lineCov">          70148 :                 size_t end = line.find(' ', start);</span>
-<span class="lineNum">      69 </span><span class="lineCov">          70148 :                 if (end == string::npos)</span>
-<span class="lineNum">      70 </span><span class="lineNoCov">              0 :                         continue;</span>
-<span class="lineNum">      71 </span><span class="lineCov">          70148 :                 string name = line.substr(start, end-start);</span>
-<span class="lineNum">      72 </span>                :                 // Skip packages not in the apt index
-<span class="lineNum">      73 </span>                :                 //if (!apt.isValid(name))
-<span class="lineNum">      74 </span>                :                         //continue;
-<span class="lineNum">      75 </span>                : 
-<span class="lineNum">      76 </span><span class="lineCov">          70148 :                 start = line.find_first_not_of(' ', end);</span>
-<span class="lineNum">      77 </span><span class="lineCov">          70148 :                 if (start == string::npos) continue;</span>
-<span class="lineNum">      78 </span><span class="lineCov">          70148 :                 end = line.find(' ', start);</span>
-<span class="lineNum">      79 </span><span class="lineCov">          70148 :                 if (end == string::npos) continue;</span>
-<span class="lineNum">      80 </span><span class="lineCov">          70148 :                 string vote = line.substr(start, end-start);</span>
-<span class="lineNum">      81 </span>                : 
-<span class="lineNum">      82 </span><span class="lineCov">          70148 :                 start = line.find_first_not_of(' ', end);</span>
-<span class="lineNum">      83 </span><span class="lineCov">          70148 :                 if (start == string::npos) continue;</span>
-<span class="lineNum">      84 </span><span class="lineCov">          70148 :                 end = line.find(' ', start);</span>
-<span class="lineNum">      85 </span><span class="lineCov">          70148 :                 if (end == string::npos) continue;</span>
-<span class="lineNum">      86 </span><span class="lineCov">          70148 :                 string old = line.substr(start, end-start);</span>
-<span class="lineNum">      87 </span>                : 
-<span class="lineNum">      88 </span><span class="lineCov">          70148 :                 start = line.find_first_not_of(' ', end);</span>
-<span class="lineNum">      89 </span><span class="lineCov">          70148 :                 if (start == string::npos) continue;</span>
-<span class="lineNum">      90 </span><span class="lineCov">          70148 :                 end = line.find(' ', start);</span>
-<span class="lineNum">      91 </span><span class="lineCov">          70148 :                 if (end == string::npos) continue;</span>
-<span class="lineNum">      92 </span><span class="lineCov">          70148 :                 string recent = line.substr(start, end-start);</span>
-<span class="lineNum">      93 </span>                : 
-<span class="lineNum">      94 </span><span class="lineCov">          70148 :                 start = line.find_first_not_of(' ', end);</span>
-<span class="lineNum">      95 </span><span class="lineCov">          70148 :                 if (start == string::npos) continue;</span>
-<span class="lineNum">      96 </span><span class="lineCov">          70148 :                 end = line.find(' ', start);</span>
-<span class="lineNum">      97 </span><span class="lineCov">          70148 :                 if (end == string::npos) end = line.size();</span>
-<span class="lineNum">      98 </span><span class="lineCov">          70148 :                 string nofiles = line.substr(start, end-start);</span>
-<span class="lineNum">      99 </span>                : 
-<span class="lineNum">     100 </span>                :                 float score = (float)strtoul(vote.c_str(), NULL, 10) 
-<span class="lineNum">     101 </span>                :                                         + (float)strtoul(recent.c_str(), NULL, 10) * 0.5f
-<span class="lineNum">     102 </span>                :                                 + (float)strtoul(old.c_str(), NULL, 10) * 0.3f
-<span class="lineNum">     103 </span><span class="lineCov">          70148 :                                 + (float)strtoul(nofiles.c_str(), NULL, 10) * 0.8f;</span>
-<span class="lineNum">     104 </span>                : 
-<span class="lineNum">     105 </span><span class="lineCov">          70148 :                 if (score &gt; 0)</span>
-<span class="lineNum">     106 </span><span class="lineCov">          69910 :                         out.insert(make_pair(name, Score(score)));</span>
-<span class="lineNum">     107 </span><span class="lineCov">              1 :         }</span>
-<span class="lineNum">     108 </span><span class="lineCov">              1 : }</span>
-<span class="lineNum">     109 </span>                : 
-<span class="lineNum">     110 </span><span class="lineCov">              3 : bool SourceDir::readScores(map&lt;std::string, Score&gt;&amp; out, size_t&amp; submissions)</span>
-<span class="lineNum">     111 </span>                : {
-<span class="lineNum">     112 </span><span class="lineCov">              3 :         if (!valid()) return false;</span>
-<span class="lineNum">     113 </span><span class="lineCov">              3 :         bool done = false;</span>
-<span class="lineNum">     114 </span>                : 
-<span class="lineNum">     115 </span><span class="lineCov">             12 :         for (const_iterator d = begin(); d != end(); ++d)</span>
-<span class="lineNum">     116 </span>                :         {
-<span class="lineNum">     117 </span><span class="lineCov">              9 :                 FileType type = fileType(d-&gt;d_name);</span>
-<span class="lineNum">     118 </span><span class="lineCov">              9 :                 if (type == RAW)</span>
-<span class="lineNum">     119 </span>                :                 {
-<span class="lineNum">     120 </span>                :                         // Read uncompressed data
-<span class="lineNum">     121 </span><span class="lineNoCov">              0 :                         tagcoll::input::Stdio in(str::joinpath(path(), d-&gt;d_name));</span>
-<span class="lineNum">     122 </span>                : 
-<span class="lineNum">     123 </span>                :                         // Read the scores
-<span class="lineNum">     124 </span><span class="lineNoCov">              0 :                         parseScores(in, out, submissions);</span>
-<span class="lineNum">     125 </span><span class="lineNoCov">              0 :                         done = true;</span>
-<span class="lineNum">     126 </span>                :                 }
-<span class="lineNum">     127 </span><span class="lineCov">              9 :                 else if (type == RAWGZ)</span>
-<span class="lineNum">     128 </span>                :                 {
-<span class="lineNum">     129 </span>                :                         // Read compressed data
-<span class="lineNum">     130 </span><span class="lineCov">              1 :                         tagcoll::input::Zlib in(str::joinpath(path(), d-&gt;d_name));</span>
-<span class="lineNum">     131 </span>                : 
-<span class="lineNum">     132 </span>                :                         // Read the scores
-<span class="lineNum">     133 </span><span class="lineCov">              1 :                         parseScores(in, out, submissions);</span>
-<span class="lineNum">     134 </span><span class="lineCov">              1 :                         done = true;</span>
-<span class="lineNum">     135 </span>                :                 }
-<span class="lineNum">     136 </span><span class="lineCov">              3 :         }</span>
-<span class="lineNum">     137 </span><span class="lineCov">              3 :         return done;</span>
-<span class="lineNum">     138 </span>                : }
-<span class="lineNum">     139 </span>                : 
-<span class="lineNum">     140 </span>                : }
-<span class="lineNum">     141 </span><span class="lineCov">              6 : }</span>
-<span class="lineNum">     142 </span>                : 
-<span class="lineNum">     143 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/popcon/maint/sourcedir.h.gcov.html b/rep/ept/popcon/maint/sourcedir.h.gcov.html
deleted file mode 100644
index 56c0640..0000000
--- a/rep/ept/popcon/maint/sourcedir.h.gcov.html
+++ /dev/null
@@ -1,130 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/popcon/maint/sourcedir.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">ept/popcon/maint</a> - sourcedir.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">2</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">2</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #ifndef EPT_POPCON_SOURCEDIR_H
-<span class="lineNum">       2 </span>                : #define EPT_POPCON_SOURCEDIR_H
-<span class="lineNum">       3 </span>                : 
-<span class="lineNum">       4 </span>                : /** @file
-<span class="lineNum">       5 </span>                :  * @author Enrico Zini &lt;enrico@enricozini.org&gt;
-<span class="lineNum">       6 </span>                :  * Popcon data source directory access
-<span class="lineNum">       7 </span>                :  */
-<span class="lineNum">       8 </span>                : 
-<span class="lineNum">       9 </span>                : /*
-<span class="lineNum">      10 </span>                :  * Copyright (C) 2003,2004,2005,2006,2007  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">      11 </span>                :  *
-<span class="lineNum">      12 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">      13 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">      14 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">      15 </span>                :  * (at your option) any later version.
-<span class="lineNum">      16 </span>                :  *
-<span class="lineNum">      17 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      18 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      19 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      20 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      21 </span>                :  *
-<span class="lineNum">      22 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      23 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      24 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      25 </span>                :  */
-<span class="lineNum">      26 </span>                : 
-<span class="lineNum">      27 </span>                : #include &lt;ept/popcon/popcon.h&gt;
-<span class="lineNum">      28 </span>                : #include &lt;wibble/sys/fs.h&gt;
-<span class="lineNum">      29 </span>                : #include &lt;string&gt;
-<span class="lineNum">      30 </span>                : #include &lt;map&gt;
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span>                : namespace ept {
-<span class="lineNum">      33 </span>                : namespace popcon {
-<span class="lineNum">      34 </span>                : 
-<span class="lineNum">      35 </span>                : /**
-<span class="lineNum">      36 </span>                :  * Access a directory containing Debtags data files
-<span class="lineNum">      37 </span>                :  */
-<span class="lineNum">      38 </span>                : class SourceDir : public wibble::sys::fs::Directory
-<span class="lineNum">      39 </span><span class="lineCov">             14 : {</span>
-<span class="lineNum">      40 </span>                : protected:
-<span class="lineNum">      41 </span>                :         enum FileType { SKIP, RAW, RAWGZ };
-<span class="lineNum">      42 </span>                : 
-<span class="lineNum">      43 </span>                :         // Check if a file name is a tag file, a vocabulary file or a file to skip.
-<span class="lineNum">      44 </span>                :         // Please notice that it works on file names, not paths.
-<span class="lineNum">      45 </span>                :         FileType fileType(const std::string&amp; name);
-<span class="lineNum">      46 </span>                : 
-<span class="lineNum">      47 </span>                : public:
-<span class="lineNum">      48 </span><span class="lineCov">             14 :         SourceDir(const std::string&amp; path) : Directory(path) {}</span>
-<span class="lineNum">      49 </span>                : 
-<span class="lineNum">      50 </span>                :         /// Return the time of the newest file in the source directory
-<span class="lineNum">      51 </span>                :         time_t timestamp();
-<span class="lineNum">      52 </span>                : 
-<span class="lineNum">      53 </span>                :         /**
-<span class="lineNum">      54 </span>                :          * Read the tag files in the directory and output their content to the map
-<span class="lineNum">      55 </span>                :          */
-<span class="lineNum">      56 </span>                :         bool readScores(std::map&lt;std::string, Score&gt;&amp; out, size_t&amp; submissions);
-<span class="lineNum">      57 </span>                : };
-<span class="lineNum">      58 </span>                : 
-<span class="lineNum">      59 </span>                : }
-<span class="lineNum">      60 </span>                : }
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span>                : // vim:set ts=4 sw=4:
-<span class="lineNum">      63 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/popcon/popcon.cc.gcov.html b/rep/ept/popcon/popcon.cc.gcov.html
deleted file mode 100644
index f38fb61..0000000
--- a/rep/ept/popcon/popcon.cc.gcov.html
+++ /dev/null
@@ -1,162 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/popcon/popcon.cc</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/popcon</a> - popcon.cc</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">23</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">95.7 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">22</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- mode: c++; tab-width: 4; indent-tabs-mode: t -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : /** @file
-<span class="lineNum">       4 </span>                :  * @author Enrico Zini &lt;enrico@enricozini.org&gt;
-<span class="lineNum">       5 </span>                :  * Quick map from package IDs to package names
-<span class="lineNum">       6 </span>                :  */
-<span class="lineNum">       7 </span>                : 
-<span class="lineNum">       8 </span>                : /*
-<span class="lineNum">       9 </span>                :  * Copyright (C) 2007  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">      10 </span>                :  *
-<span class="lineNum">      11 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">      12 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">      13 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">      14 </span>                :  * (at your option) any later version.
-<span class="lineNum">      15 </span>                :  *
-<span class="lineNum">      16 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      17 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      18 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      19 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      20 </span>                :  *
-<span class="lineNum">      21 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      22 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      23 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      24 </span>                :  */
-<span class="lineNum">      25 </span>                : 
-<span class="lineNum">      26 </span>                : #include &lt;ept/popcon/popcon.h&gt;
-<span class="lineNum">      27 </span>                : #include &lt;ept/popcon/maint/popconindexer.h&gt;
-<span class="lineNum">      28 </span>                : #include &lt;ept/popcon/maint/path.h&gt;
-<span class="lineNum">      29 </span>                : 
-<span class="lineNum">      30 </span>                : //#include &lt;iostream&gt;
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span>                : using namespace std;
-<span class="lineNum">      33 </span>                : 
-<span class="lineNum">      34 </span>                : namespace ept {
-<span class="lineNum">      35 </span>                : namespace popcon {
-<span class="lineNum">      36 </span>                : 
-<span class="lineNum">      37 </span><span class="lineCov">              3 : size_t Popcon::GeneralInfo::submissions() const</span>
-<span class="lineNum">      38 </span>                : {
-<span class="lineNum">      39 </span><span class="lineCov">              3 :         if (!m_buf) return 0;</span>
-<span class="lineNum">      40 </span><span class="lineCov">              2 :         return ((InfoStruct*)m_buf)-&gt;submissions;</span>
-<span class="lineNum">      41 </span>                : }
-<span class="lineNum">      42 </span>                : 
-<span class="lineNum">      43 </span><span class="lineCov">              7 : Popcon::Popcon()</span>
-<span class="lineNum">      44 </span>                : {
-<span class="lineNum">      45 </span><span class="lineCov">              7 :         std::string scofname, idxfname;</span>
-<span class="lineNum">      46 </span>                : 
-<span class="lineNum">      47 </span><span class="lineCov">              7 :         if (!PopconIndexer::obtainWorkingPopcon(scofname, idxfname))</span>
-<span class="lineNum">      48 </span>                :         {
-<span class="lineNum">      49 </span><span class="lineCov">              1 :                 m_timestamp = 0;</span>
-<span class="lineNum">      50 </span><span class="lineCov">              1 :                 return;</span>
-<span class="lineNum">      51 </span>                :         }
-<span class="lineNum">      52 </span>                : 
-<span class="lineNum">      53 </span>                :         //cerr &lt;&lt; &quot;GOT &quot; &lt;&lt; scofname &lt;&lt; &quot; &quot; &lt;&lt; idxfname &lt;&lt; endl;
-<span class="lineNum">      54 </span>                : 
-<span class="lineNum">      55 </span><span class="lineCov">              6 :         m_timestamp = Path::timestamp(idxfname);</span>
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span><span class="lineCov">              6 :         mastermmap.init(idxfname);</span>
-<span class="lineNum">      58 </span><span class="lineCov">              6 :         tagcoll::diskindex::MMap::init(mastermmap, 0);</span>
-<span class="lineNum">      59 </span>                : 
-<span class="lineNum">      60 </span><span class="lineCov">              6 :         m_info.init(mastermmap, 1);</span>
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span>                :         //cerr &lt;&lt; &quot;SIZE &quot; &lt;&lt; size() &lt;&lt; endl;
-<span class="lineNum">      63 </span>                :         //for (size_t i = 0; i &lt; size(); ++i)
-<span class="lineNum">      64 </span>                :         //{
-<span class="lineNum">      65 </span>                :         //      cerr &lt;&lt; &quot;EL &quot; &lt;&lt; i &lt;&lt; &quot;: &quot; &lt;&lt; ((Score*)m_buf)[i].offset &lt;&lt; &quot; &quot; &lt;&lt; ((Score*)m_buf)[i].score &lt;&lt; endl;
-<span class="lineNum">      66 </span>                :         //}
-<span class="lineNum">      67 </span><span class="lineNoCov">              0 : }</span>
-<span class="lineNum">      68 </span>                : 
-<span class="lineNum">      69 </span><span class="lineCov">           1792 : float Popcon::scoreByName(const std::string&amp; name) const</span>
-<span class="lineNum">      70 </span>                : {
-<span class="lineNum">      71 </span>                :         // Binary search the index to find the package ID
-<span class="lineNum">      72 </span>                :         int begin, end;
-<span class="lineNum">      73 </span>                : 
-<span class="lineNum">      74 </span>                :         /* Binary search */
-<span class="lineNum">      75 </span><span class="lineCov">           1792 :         begin = -1, end = size();</span>
-<span class="lineNum">      76 </span><span class="lineCov">          32470 :         while (end - begin &gt; 1)</span>
-<span class="lineNum">      77 </span>                :         {
-<span class="lineNum">      78 </span><span class="lineCov">          28886 :                 int cur = (end + begin) / 2;</span>
-<span class="lineNum">      79 </span><span class="lineCov">          28886 :                 if (this-&gt;name(cur) &gt; name)</span>
-<span class="lineNum">      80 </span><span class="lineCov">          14367 :                         end = cur;</span>
-<span class="lineNum">      81 </span>                :                 else
-<span class="lineNum">      82 </span><span class="lineCov">          14519 :                         begin = cur;</span>
-<span class="lineNum">      83 </span>                :         }
-<span class="lineNum">      84 </span>                : 
-<span class="lineNum">      85 </span><span class="lineCov">           1792 :         if (begin == -1 || this-&gt;name(begin) != name)</span>
-<span class="lineNum">      86 </span>                :                 //throw NotFoundException(string(&quot;looking for the ID of string &quot;) + str);
-<span class="lineNum">      87 </span><span class="lineCov">             31 :                 return 0;</span>
-<span class="lineNum">      88 </span>                :         else
-<span class="lineNum">      89 </span><span class="lineCov">           1761 :                 return score(begin);</span>
-<span class="lineNum">      90 </span>                : }
-<span class="lineNum">      91 </span>                : 
-<span class="lineNum">      92 </span>                : }
-<span class="lineNum">      93 </span>                : }
-<span class="lineNum">      94 </span>                : 
-<span class="lineNum">      95 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/popcon/popcon.h.gcov.html b/rep/ept/popcon/popcon.h.gcov.html
deleted file mode 100644
index 270736f..0000000
--- a/rep/ept/popcon/popcon.h.gcov.html
+++ /dev/null
@@ -1,220 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/popcon/popcon.h</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/popcon</a> - popcon.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">25</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">96.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">24</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- mode: c++; tab-width: 4; indent-tabs-mode: t -*-
-<span class="lineNum">       2 </span>                : #ifndef EPT_POPCON_POPCON_H
-<span class="lineNum">       3 </span>                : #define EPT_POPCON_POPCON_H
-<span class="lineNum">       4 </span>                : 
-<span class="lineNum">       5 </span>                : /** @file
-<span class="lineNum">       6 </span>                :  * @author Enrico Zini &lt;enrico@enricozini.org&gt;
-<span class="lineNum">       7 </span>                :  * Access popcon data
-<span class="lineNum">       8 </span>                :  */
-<span class="lineNum">       9 </span>                : 
-<span class="lineNum">      10 </span>                : /*
-<span class="lineNum">      11 </span>                :  * Copyright (C) 2007  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">      12 </span>                :  *
-<span class="lineNum">      13 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">      14 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">      15 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">      16 </span>                :  * (at your option) any later version.
-<span class="lineNum">      17 </span>                :  *
-<span class="lineNum">      18 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      19 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      20 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      21 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      22 </span>                :  *
-<span class="lineNum">      23 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      24 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      25 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      26 </span>                :  */
-<span class="lineNum">      27 </span>                : 
-<span class="lineNum">      28 </span>                : #include &lt;tagcoll/diskindex/mmap.h&gt;
-<span class="lineNum">      29 </span>                : #include &lt;string&gt;
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : namespace ept {
-<span class="lineNum">      32 </span>                : namespace apt {
-<span class="lineNum">      33 </span>                : class Apt;
-<span class="lineNum">      34 </span>                : }
-<span class="lineNum">      35 </span>                : 
-<span class="lineNum">      36 </span>                : namespace popcon {
-<span class="lineNum">      37 </span>                : 
-<span class="lineNum">      38 </span>                : /**
-<span class="lineNum">      39 </span>                :  * Store the score information in the popcon cache.
-<span class="lineNum">      40 </span>                :  *
-<span class="lineNum">      41 </span>                :  * Currently, this is only one float; more can be added in the future.
-<span class="lineNum">      42 </span>                :  */
-<span class="lineNum">      43 </span>                : class Score
-<span class="lineNum">      44 </span>                : {
-<span class="lineNum">      45 </span>                : protected:
-<span class="lineNum">      46 </span>                :         unsigned offset;
-<span class="lineNum">      47 </span>                : 
-<span class="lineNum">      48 </span>                : public:
-<span class="lineNum">      49 </span>                :         float score;
-<span class="lineNum">      50 </span>                : 
-<span class="lineNum">      51 </span><span class="lineCov">          69910 :         Score(float score) : offset(offset), score(score) {}</span>
-<span class="lineNum">      52 </span>                : 
-<span class="lineNum">      53 </span>                :         friend class Popcon;
-<span class="lineNum">      54 </span>                :         friend class PopconIndexer;
-<span class="lineNum">      55 </span>                :         friend class PopconGenerator;
-<span class="lineNum">      56 </span>                : };
-<span class="lineNum">      57 </span>                : 
-<span class="lineNum">      58 </span>                : /**
-<span class="lineNum">      59 </span>                :  * Maps Packages to IDs and vice-versa.
-<span class="lineNum">      60 </span>                :  *
-<span class="lineNum">      61 </span>                :  * This is used in building the Debtags fast index, which works representing
-<span class="lineNum">      62 </span>                :  * tags and packages as int IDs.
-<span class="lineNum">      63 </span>                :  *
-<span class="lineNum">      64 </span>                :  * Index building works like this:
-<span class="lineNum">      65 </span>                :  *  1. The file all-popcon-results.txt.gz is downloaded from
-<span class="lineNum">      66 </span>                :  *     http://popcon.debian.org/all-popcon-results.txt.gz
-<span class="lineNum">      67 </span>                :  *  2. The file is put in either ~/.popcon/all-popcon-results.txt.gz
-<span class="lineNum">      68 </span>                :  *     or in /var/lib/popcon/all-popcon-results.txt.gz
-<span class="lineNum">      69 </span>                :  *  3. If the file is newer than the index, it will be automatically used to
-<span class="lineNum">      70 </span>                :  *     recompute the scores and rebuild the index.
-<span class="lineNum">      71 </span>                :  */
-<span class="lineNum">      72 </span>                : class Popcon : public tagcoll::diskindex::MMap
-<span class="lineNum">      73 </span><span class="lineCov">              7 : {</span>
-<span class="lineNum">      74 </span>                :         struct GeneralInfo : public tagcoll::diskindex::MMap
-<span class="lineNum">      75 </span><span class="lineCov">              7 :         {</span>
-<span class="lineNum">      76 </span>                :                 size_t submissions() const;
-<span class="lineNum">      77 </span>                :         };
-<span class="lineNum">      78 </span>                : 
-<span class="lineNum">      79 </span>                :         tagcoll::diskindex::MasterMMap mastermmap;
-<span class="lineNum">      80 </span>                :         time_t m_timestamp;
-<span class="lineNum">      81 </span>                : 
-<span class="lineNum">      82 </span>                :         GeneralInfo m_info;
-<span class="lineNum">      83 </span>                : 
-<span class="lineNum">      84 </span>                :         /// Get the score structure by index
-<span class="lineNum">      85 </span><span class="lineCov">         102350 :         const Score* structByIndex(size_t idx) const</span>
-<span class="lineNum">      86 </span>                :         {
-<span class="lineNum">      87 </span><span class="lineCov">         102350 :                 if (idx &gt;= 0 &amp;&amp; idx &lt; size())</span>
-<span class="lineNum">      88 </span><span class="lineCov">         102350 :                         return (Score*)m_buf + idx;</span>
-<span class="lineNum">      89 </span><span class="lineNoCov">              0 :                 return 0;</span>
-<span class="lineNum">      90 </span>                :         }
-<span class="lineNum">      91 </span>                : 
-<span class="lineNum">      92 </span>                : public:
-<span class="lineNum">      93 </span>                :         Popcon();
-<span class="lineNum">      94 </span>                : 
-<span class="lineNum">      95 </span>                :         /// Get the timestamp of when the index was last updated
-<span class="lineNum">      96 </span><span class="lineCov">              1 :         time_t timestamp() const { return m_timestamp; }</span>
-<span class="lineNum">      97 </span>                : 
-<span class="lineNum">      98 </span>                :         /// Return true if this data source has data, false if it's empty
-<span class="lineNum">      99 </span><span class="lineCov">              1 :         bool hasData() const { return m_timestamp != 0; }</span>
-<span class="lineNum">     100 </span>                : 
-<span class="lineNum">     101 </span>                :         /// Return the total number of popcon submissions
-<span class="lineNum">     102 </span><span class="lineCov">              3 :         size_t submissions() const { return m_info.submissions(); }</span>
-<span class="lineNum">     103 </span>                : 
-<span class="lineNum">     104 </span>                :         /// Get the number of packages in the index
-<span class="lineNum">     105 </span><span class="lineCov">         174055 :         size_t size() const</span>
-<span class="lineNum">     106 </span>                :         {
-<span class="lineNum">     107 </span><span class="lineCov">         174055 :                 if (m_buf)</span>
-<span class="lineNum">     108 </span><span class="lineCov">         174053 :                         return ((Score*)m_buf)-&gt;offset / sizeof(Score);</span>
-<span class="lineNum">     109 </span>                :                 else
-<span class="lineNum">     110 </span><span class="lineCov">              2 :                         return 0;</span>
-<span class="lineNum">     111 </span>                :         }
-<span class="lineNum">     112 </span>                : 
-<span class="lineNum">     113 </span>                :         /**
-<span class="lineNum">     114 </span>                :          * Get a package name by index
-<span class="lineNum">     115 </span>                :          *
-<span class="lineNum">     116 </span>                :          * If the index is not valid, returns the empty string.
-<span class="lineNum">     117 </span>                :          */
-<span class="lineNum">     118 </span><span class="lineCov">          30678 :         std::string name(size_t idx) const</span>
-<span class="lineNum">     119 </span>                :         {
-<span class="lineNum">     120 </span><span class="lineCov">          30678 :                 const Score* s = structByIndex(idx);</span>
-<span class="lineNum">     121 </span><span class="lineCov">          30678 :                 if (s == 0) return std::string();</span>
-<span class="lineNum">     122 </span><span class="lineCov">          30678 :                 return std::string(m_buf + s-&gt;offset);</span>
-<span class="lineNum">     123 </span>                :         }
-<span class="lineNum">     124 </span>                : 
-<span class="lineNum">     125 </span>                :         /// Get the score by index
-<span class="lineNum">     126 </span><span class="lineCov">          71672 :         float scoreByIndex(size_t idx) const</span>
-<span class="lineNum">     127 </span>                :         {
-<span class="lineNum">     128 </span><span class="lineCov">          71672 :                 const Score* s = structByIndex(idx);</span>
-<span class="lineNum">     129 </span><span class="lineCov">          71672 :                 if (!s) return 0;</span>
-<span class="lineNum">     130 </span><span class="lineCov">          71672 :                 return s-&gt;score;</span>
-<span class="lineNum">     131 </span>                :         }
-<span class="lineNum">     132 </span>                : 
-<span class="lineNum">     133 </span>                :         /// Get the score structure by package name
-<span class="lineNum">     134 </span>                :         float scoreByName(const std::string&amp; name) const;
-<span class="lineNum">     135 </span>                : 
-<span class="lineNum">     136 </span>                :         /// Get the score by index
-<span class="lineNum">     137 </span><span class="lineCov">          71672 :         float score(size_t idx) const { return scoreByIndex(idx); }</span>
-<span class="lineNum">     138 </span>                : 
-<span class="lineNum">     139 </span>                :         /// Get the score by index
-<span class="lineNum">     140 </span>                :         float operator[](int idx) const { return scoreByIndex(idx); }
-<span class="lineNum">     141 </span>                : 
-<span class="lineNum">     142 </span>                :         /// Get the score by name
-<span class="lineNum">     143 </span><span class="lineCov">           1790 :         float score(const std::string&amp; name) const { return scoreByName(name); }</span>
-<span class="lineNum">     144 </span>                : 
-<span class="lineNum">     145 </span>                :         /// Get the score structure by package name
-<span class="lineNum">     146 </span><span class="lineCov">              2 :         float operator[](const std::string&amp; name) const { return scoreByName(name); }</span>
-<span class="lineNum">     147 </span>                : };
-<span class="lineNum">     148 </span>                : 
-<span class="lineNum">     149 </span>                : }
-<span class="lineNum">     150 </span>                : }
-<span class="lineNum">     151 </span>                : 
-<span class="lineNum">     152 </span>                : // vim:set ts=4 sw=4:
-<span class="lineNum">     153 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/popcon/popcon.test.h.gcov.html b/rep/ept/popcon/popcon.test.h.gcov.html
deleted file mode 100644
index 65387fc..0000000
--- a/rep/ept/popcon/popcon.test.h.gcov.html
+++ /dev/null
@@ -1,175 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/popcon/popcon.test.h</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/popcon</a> - popcon.test.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">38</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">38</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- mode: c++; tab-width: 4; indent-tabs-mode: t -*-
-<span class="lineNum">       2 </span>                : /*
-<span class="lineNum">       3 </span>                :  * popcon test
-<span class="lineNum">       4 </span>                :  *
-<span class="lineNum">       5 </span>                :  * Copyright (C) 2007  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">       6 </span>                :  *
-<span class="lineNum">       7 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">       8 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">       9 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">      10 </span>                :  * (at your option) any later version.
-<span class="lineNum">      11 </span>                :  *
-<span class="lineNum">      12 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      13 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      14 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      15 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      16 </span>                :  *
-<span class="lineNum">      17 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      18 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      19 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      20 </span>                :  */
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                : #include &lt;ept/popcon/popcon.h&gt;
-<span class="lineNum">      23 </span>                : #include &lt;ept/popcon/maint/path.h&gt;
-<span class="lineNum">      24 </span>                : #include &lt;ept/apt/apt.h&gt;
-<span class="lineNum">      25 </span>                : #include &lt;set&gt;
-<span class="lineNum">      26 </span>                : 
-<span class="lineNum">      27 </span>                : #include &lt;ept/test.h&gt;
-<span class="lineNum">      28 </span>                : 
-<span class="lineNum">      29 </span>                : using namespace std;
-<span class="lineNum">      30 </span>                : using namespace ept;
-<span class="lineNum">      31 </span>                : using namespace ept::popcon;
-<span class="lineNum">      32 </span>                : using namespace ept::apt;
-<span class="lineNum">      33 </span>                : 
-<span class="lineNum">      34 </span>                : struct TestPopcon
-<span class="lineNum">      35 </span><span class="lineCov">              5 : {</span>
-<span class="lineNum">      36 </span>                :         popcon::Path::OverridePopconSourceDir odsd;
-<span class="lineNum">      37 </span>                :         popcon::Path::OverridePopconIndexDir odid;
-<span class="lineNum">      38 </span>                :         popcon::Path::OverridePopconUserSourceDir odusd;
-<span class="lineNum">      39 </span>                :         popcon::Path::OverridePopconUserIndexDir oduid;
-<span class="lineNum">      40 </span>                : 
-<span class="lineNum">      41 </span>                :         Apt apt;
-<span class="lineNum">      42 </span>                :         Popcon popcon;
-<span class="lineNum">      43 </span>                : 
-<span class="lineNum">      44 </span><span class="lineCov">              5 :         TestPopcon()</span>
-<span class="lineNum">      45 </span>                :                 : odsd( TEST_ENV_DIR &quot;popcon&quot; ),
-<span class="lineNum">      46 </span>                :                   odid( TEST_ENV_DIR &quot;popcon&quot; ),
-<span class="lineNum">      47 </span>                :                   odusd( TEST_ENV_DIR &quot;popcon&quot; ),
-<span class="lineNum">      48 </span><span class="lineCov">              5 :                   oduid( TEST_ENV_DIR &quot;popcon&quot; )</span>
-<span class="lineNum">      49 </span><span class="lineCov">              5 :         {}</span>
-<span class="lineNum">      50 </span>                : 
-<span class="lineNum">      51 </span><span class="lineCov">              1 :         Test basicAccess()</span>
-<span class="lineNum">      52 </span>                :         {
-<span class="lineNum">      53 </span><span class="lineCov">              1 :                 assert_eq(popcon.submissions(), 52024);</span>
-<span class="lineNum">      54 </span><span class="lineCov">              2 :                 assert(popcon.size() &gt; 0);</span>
-<span class="lineNum">      55 </span><span class="lineCov">              2 :                 assert(popcon.score(0) &gt; 0);</span>
-<span class="lineNum">      56 </span><span class="lineCov">              2 :                 assert(!popcon.name(0).empty());</span>
-<span class="lineNum">      57 </span><span class="lineCov">              1 :         }</span>
-<span class="lineNum">      58 </span>                : 
-<span class="lineNum">      59 </span>                :     // Check that every valid index is accessible
-<span class="lineNum">      60 </span><span class="lineCov">              1 :         Test accessibility()</span>
-<span class="lineNum">      61 </span>                :         {
-<span class="lineNum">      62 </span><span class="lineCov">         139822 :                 for (size_t i = 0; i &lt; popcon.size(); ++i)</span>
-<span class="lineNum">      63 </span>                :                 {
-<span class="lineNum">      64 </span>                :                         //cerr &lt;&lt; popcon.name(i) &lt;&lt; &quot; &quot; &lt;&lt; popcon.score(i) &lt;&lt; endl;
-<span class="lineNum">      65 </span><span class="lineCov">          69910 :                         assert(popcon.score(i) &gt; 0);</span>
-<span class="lineNum">      66 </span>                :                 }
-<span class="lineNum">      67 </span><span class="lineCov">              1 :         }</span>
-<span class="lineNum">      68 </span>                :         
-<span class="lineNum">      69 </span>                :         // Check that we can get a score for every package
-<span class="lineNum">      70 </span><span class="lineCov">              1 :         Test haveScores()</span>
-<span class="lineNum">      71 </span>                :         {
-<span class="lineNum">      72 </span><span class="lineCov">              1 :                 int has = 0;</span>
-<span class="lineNum">      73 </span><span class="lineCov">           1789 :                 for (Apt::iterator i = apt.begin(); i != apt.end(); ++i)</span>
-<span class="lineNum">      74 </span>                :                 {
-<span class="lineNum">      75 </span><span class="lineCov">           1788 :                         float score = popcon.score(*i);</span>
-<span class="lineNum">      76 </span><span class="lineCov">           1788 :                         if (score &gt; 0)</span>
-<span class="lineNum">      77 </span><span class="lineCov">           1758 :                                 ++has;</span>
-<span class="lineNum">      78 </span><span class="lineCov">              1 :                 }</span>
-<span class="lineNum">      79 </span>                :                 // At least 1000 packages should have a score
-<span class="lineNum">      80 </span><span class="lineCov">              2 :                 assert(has &gt; 1000);</span>
-<span class="lineNum">      81 </span><span class="lineCov">              1 :         }</span>
-<span class="lineNum">      82 </span>                : 
-<span class="lineNum">      83 </span>                :     // Check that scores are meaningful
-<span class="lineNum">      84 </span><span class="lineCov">              1 :         Test validScores()</span>
-<span class="lineNum">      85 </span>                :         {
-<span class="lineNum">      86 </span><span class="lineCov">              1 :                 assert(popcon[&quot;apt&quot;] &gt; popcon[&quot;libapt-pkg-dev&quot;]);</span>
-<span class="lineNum">      87 </span><span class="lineCov">              1 :         }</span>
-<span class="lineNum">      88 </span>                : 
-<span class="lineNum">      89 </span>                :     // If there is no data, Popcon should work as if all scores were 0
-<span class="lineNum">      90 </span><span class="lineCov">              1 :         Test fallbackValues()</span>
-<span class="lineNum">      91 </span>                :         {
-<span class="lineNum">      92 </span><span class="lineCov">              1 :                 popcon::Path::OverridePopconSourceDir odsd(&quot;./empty&quot;);</span>
-<span class="lineNum">      93 </span><span class="lineCov">              2 :                 popcon::Path::OverridePopconIndexDir odid(&quot;./empty&quot;);</span>
-<span class="lineNum">      94 </span><span class="lineCov">              2 :                 popcon::Path::OverridePopconUserSourceDir odusd(&quot;./empty&quot;);</span>
-<span class="lineNum">      95 </span><span class="lineCov">              2 :                 popcon::Path::OverridePopconUserIndexDir oduid(&quot;./empty&quot;);</span>
-<span class="lineNum">      96 </span><span class="lineCov">              1 :                 Popcon empty;</span>
-<span class="lineNum">      97 </span>                :                 
-<span class="lineNum">      98 </span><span class="lineCov">              1 :                 assert_eq(empty.timestamp(), 0);</span>
-<span class="lineNum">      99 </span><span class="lineCov">              2 :                 assert(!empty.hasData());</span>
-<span class="lineNum">     100 </span>                : 
-<span class="lineNum">     101 </span><span class="lineCov">              2 :                 assert_eq(empty.submissions(), 0);</span>
-<span class="lineNum">     102 </span><span class="lineCov">              2 :                 assert(empty.size() == 0);</span>
-<span class="lineNum">     103 </span><span class="lineCov">              2 :                 assert(empty.score(&quot;apt&quot;) == 0.0);</span>
-<span class="lineNum">     104 </span><span class="lineCov">              1 :         }</span>
-<span class="lineNum">     105 </span>                : 
-<span class="lineNum">     106 </span>                : };
-<span class="lineNum">     107 </span>                : 
-<span class="lineNum">     108 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/progresscallback.cpp.gcov.html b/rep/ept/progresscallback.cpp.gcov.html
deleted file mode 100644
index 1a46d4e..0000000
--- a/rep/ept/progresscallback.cpp.gcov.html
+++ /dev/null
@@ -1,79 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/progresscallback.cpp</title>
-  <link rel="stylesheet" type="text/css" href="../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../index.html">directory</a> - <a href="index.html">ept</a> - progresscallback.cpp</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">4</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">0.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">0</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #include &lt;ept/progresscallback.h&gt;
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : namespace ept {
-<span class="lineNum">       4 </span>                : 
-<span class="lineNum">       5 </span><span class="lineNoCov">              0 :    bool ProgressCallback::Pulse(pkgAcquire *Owner)</span>
-<span class="lineNum">       6 </span>                :    {
-<span class="lineNum">       7 </span><span class="lineNoCov">              0 :       pkgAcquireStatus::Pulse(Owner);</span>
-<span class="lineNum">       8 </span><span class="lineNoCov">              0 :       UpdatePulse(FetchedBytes, CurrentCPS, CurrentItems);</span>
-<span class="lineNum">       9 </span><span class="lineNoCov">              0 :       return true;</span>
-<span class="lineNum">      10 </span>                :    }
-<span class="lineNum">      11 </span>                : 
-<span class="lineNum">      12 </span>                : }
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/progresscallback.h.gcov.html b/rep/ept/progresscallback.h.gcov.html
deleted file mode 100644
index 9dbb029..0000000
--- a/rep/ept/progresscallback.h.gcov.html
+++ /dev/null
@@ -1,95 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/progresscallback.h</title>
-  <link rel="stylesheet" type="text/css" href="../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../index.html">directory</a> - <a href="index.html">ept</a> - progresscallback.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">3</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">0.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">0</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /** -*- C++ -*-
-<span class="lineNum">       2 </span>                :         @file progresscallback.h
-<span class="lineNum">       3 </span>                :         @author Michael Vogt &lt;mvo@debian.org&gt;
-<span class="lineNum">       4 </span>                : */
-<span class="lineNum">       5 </span>                : 
-<span class="lineNum">       6 </span>                : #ifndef EPT_PROGRESSCALLBACK_H
-<span class="lineNum">       7 </span>                : #define EPT_PROGRESSCALLBACK_H
-<span class="lineNum">       8 </span>                : 
-<span class="lineNum">       9 </span>                : #include &lt;apt-pkg/acquire.h&gt;
-<span class="lineNum">      10 </span>                : 
-<span class="lineNum">      11 </span>                : namespace ept {
-<span class="lineNum">      12 </span>                : 
-<span class="lineNum">      13 </span>                : class ProgressCallback : public pkgAcquireStatus
-<span class="lineNum">      14 </span>                : {
-<span class="lineNum">      15 </span>                : protected:
-<span class="lineNum">      16 </span>                :     virtual bool Pulse(pkgAcquire *Owner);
-<span class="lineNum">      17 </span>                : public:
-<span class="lineNum">      18 </span>                :     ProgressCallback() {};
-<span class="lineNum">      19 </span><span class="lineNoCov">              0 :     virtual ~ProgressCallback() {};</span>
-<span class="lineNum">      20 </span><span class="lineNoCov">              0 :     virtual bool MediaChange( string, string ) { return false; } // bah</span>
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                :     // override this to get periodic updates
-<span class="lineNum">      23 </span><span class="lineNoCov">              0 :     virtual void UpdatePulse( double, double, unsigned long ) {}</span>
-<span class="lineNum">      24 </span>                : };
-<span class="lineNum">      25 </span>                : 
-<span class="lineNum">      26 </span>                : }
-<span class="lineNum">      27 </span>                : 
-<span class="lineNum">      28 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/test.h.gcov.html b/rep/ept/test.h.gcov.html
deleted file mode 100644
index 4004bd7..0000000
--- a/rep/ept/test.h.gcov.html
+++ /dev/null
@@ -1,105 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/test.h</title>
-  <link rel="stylesheet" type="text/css" href="../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../index.html">directory</a> - <a href="index.html">ept</a> - test.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">15</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">15</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #include &lt;ept/core/apt.h&gt;
-<span class="lineNum">       2 </span>                : #include &lt;ept/config.h&gt;
-<span class="lineNum">       3 </span>                : #include &lt;ept/debtags/maint/path.h&gt;
-<span class="lineNum">       4 </span>                : 
-<span class="lineNum">       5 </span>                : #include &lt;wibble/test.h&gt;
-<span class="lineNum">       6 </span>                : 
-<span class="lineNum">       7 </span>                : #ifndef EPT_TEST_H
-<span class="lineNum">       8 </span>                : #define EPT_TEST_H
-<span class="lineNum">       9 </span>                : 
-<span class="lineNum">      10 </span><span class="lineCov">             73 : struct AptTestEnvironment {</span>
-<span class="lineNum">      11 </span>                :     ept::core::AptDatabase db;
-<span class="lineNum">      12 </span><span class="lineCov">             73 :     AptTestEnvironment() {</span>
-<span class="lineNum">      13 </span><span class="lineCov">             73 :         pkgInitConfig (*_config);</span>
-<span class="lineNum">      14 </span><span class="lineCov">             73 :         _config-&gt;Set(&quot;Initialized&quot;, 1);</span>
-<span class="lineNum">      15 </span><span class="lineCov">             73 :         _config-&gt;Set(&quot;Dir&quot;, TEST_ENV_DIR);</span>
-<span class="lineNum">      16 </span><span class="lineCov">            146 :         _config-&gt;Set(&quot;Dir::Cache&quot;, &quot;cache&quot;);</span>
-<span class="lineNum">      17 </span><span class="lineCov">            146 :         _config-&gt;Set(&quot;Dir::State&quot;, &quot;state&quot;);</span>
-<span class="lineNum">      18 </span><span class="lineCov">            146 :         _config-&gt;Set(&quot;Dir::Etc&quot;, &quot;etc&quot;);</span>
-<span class="lineNum">      19 </span><span class="lineCov">            146 :         _config-&gt;Set(&quot;Dir::State::status&quot;, TEST_ENV_DIR &quot;dpkg-status&quot;);</span>
-<span class="lineNum">      20 </span><span class="lineCov">             73 :         pkgInitSystem (*_config, _system);</span>
-<span class="lineNum">      21 </span><span class="lineCov">             73 :     }</span>
-<span class="lineNum">      22 </span>                : };
-<span class="lineNum">      23 </span>                : 
-<span class="lineNum">      24 </span><span class="lineCov">             29 : struct DebtagsTestEnvironment : AptTestEnvironment {</span>
-<span class="lineNum">      25 </span>                :     ept::debtags::Path::OverrideDebtagsSourceDir odsd;
-<span class="lineNum">      26 </span>                :     ept::debtags::Path::OverrideDebtagsIndexDir odid;
-<span class="lineNum">      27 </span>                :     ept::debtags::Path::OverrideDebtagsUserSourceDir odusd;
-<span class="lineNum">      28 </span>                :     ept::debtags::Path::OverrideDebtagsUserIndexDir oduid;
-<span class="lineNum">      29 </span>                : 
-<span class="lineNum">      30 </span><span class="lineCov">             29 :     DebtagsTestEnvironment()</span>
-<span class="lineNum">      31 </span>                :         : odsd( TEST_ENV_DIR &quot;debtags/&quot;),
-<span class="lineNum">      32 </span>                :           odid( TEST_ENV_DIR &quot;debtags/&quot;),
-<span class="lineNum">      33 </span>                :           odusd( TEST_ENV_DIR &quot;debtags/&quot;),
-<span class="lineNum">      34 </span><span class="lineCov">             29 :           oduid( TEST_ENV_DIR &quot;debtags/&quot;)</span>
-<span class="lineNum">      35 </span><span class="lineCov">             29 :     {}</span>
-<span class="lineNum">      36 </span>                : };
-<span class="lineNum">      37 </span>                : 
-<span class="lineNum">      38 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/textsearch/extraindexers.cc.gcov.html b/rep/ept/textsearch/extraindexers.cc.gcov.html
deleted file mode 100644
index 9072fde..0000000
--- a/rep/ept/textsearch/extraindexers.cc.gcov.html
+++ /dev/null
@@ -1,125 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/textsearch/extraindexers.cc</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/textsearch</a> - extraindexers.cc</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">10</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">0.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">0</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : 
-<span class="lineNum">       2 </span>                : /** @file
-<span class="lineNum">       3 </span>                :  * @author Enrico Zini &lt;enrico@enricozini.org&gt;
-<span class="lineNum">       4 </span>                :  * Fast full-text search
-<span class="lineNum">       5 </span>                :  */
-<span class="lineNum">       6 </span>                : 
-<span class="lineNum">       7 </span>                : /*
-<span class="lineNum">       8 </span>                :  * Copyright (C) 2007  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">       9 </span>                :  *
-<span class="lineNum">      10 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">      11 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">      12 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">      13 </span>                :  * (at your option) any later version.
-<span class="lineNum">      14 </span>                :  *
-<span class="lineNum">      15 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      16 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      17 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      18 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      19 </span>                :  *
-<span class="lineNum">      20 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      21 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      22 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      23 </span>                :  */
-<span class="lineNum">      24 </span>                : 
-<span class="lineNum">      25 </span>                : #include &lt;ept/textsearch/extraindexers.h&gt;
-<span class="lineNum">      26 </span>                : #include &lt;ept/apt/packagerecord.h&gt;
-<span class="lineNum">      27 </span>                : #include &lt;ept/debtags/debtags.h&gt;
-<span class="lineNum">      28 </span>                : 
-<span class="lineNum">      29 </span>                : using namespace std;
-<span class="lineNum">      30 </span>                : using namespace ept::debtags;
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span>                : namespace ept {
-<span class="lineNum">      33 </span>                : namespace textsearch {
-<span class="lineNum">      34 </span>                : 
-<span class="lineNum">      35 </span><span class="lineNoCov">              0 : void AptTagsExtraIndexer::operator()(Xapian::Document&amp; doc, const apt::PackageRecord&amp; rec) const</span>
-<span class="lineNum">      36 </span>                : {
-<span class="lineNum">      37 </span>                :         // Index tags as well
-<span class="lineNum">      38 </span><span class="lineNoCov">              0 :         set&lt;string&gt; tags = rec.tag();</span>
-<span class="lineNum">      39 </span><span class="lineNoCov">              0 :         for (set&lt;string&gt;::const_iterator ti = tags.begin();</span>
-<span class="lineNum">      40 </span>                :                         ti != tags.end(); ++ti)
-<span class="lineNum">      41 </span><span class="lineNoCov">              0 :                 doc.add_term(&quot;XT&quot;+*ti);</span>
-<span class="lineNum">      42 </span><span class="lineNoCov">              0 : }</span>
-<span class="lineNum">      43 </span>                : 
-<span class="lineNum">      44 </span><span class="lineNoCov">              0 : void DebtagsExtraIndexer::operator()(Xapian::Document&amp; doc, const apt::PackageRecord&amp; rec) const</span>
-<span class="lineNum">      45 </span>                : {
-<span class="lineNum">      46 </span>                :         // Index tags as well
-<span class="lineNum">      47 </span><span class="lineNoCov">              0 :         set&lt;Tag&gt; tags = debtags.getTagsOfItem(doc.get_data());</span>
-<span class="lineNum">      48 </span><span class="lineNoCov">              0 :         for (set&lt;Tag&gt;::const_iterator ti = tags.begin();</span>
-<span class="lineNum">      49 </span>                :                         ti != tags.end(); ++ti)
-<span class="lineNum">      50 </span><span class="lineNoCov">              0 :                 doc.add_term(&quot;XT&quot;+ti-&gt;fullname());</span>
-<span class="lineNum">      51 </span><span class="lineNoCov">              0 : }</span>
-<span class="lineNum">      52 </span>                : 
-<span class="lineNum">      53 </span>                : }
-<span class="lineNum">      54 </span>                : }
-<span class="lineNum">      55 </span>                : 
-<span class="lineNum">      56 </span>                : #include &lt;ept/debtags/debtags.tcc&gt;
-<span class="lineNum">      57 </span>                : 
-<span class="lineNum">      58 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/textsearch/extraindexers.h.gcov.html b/rep/ept/textsearch/extraindexers.h.gcov.html
deleted file mode 100644
index bb7734f..0000000
--- a/rep/ept/textsearch/extraindexers.h.gcov.html
+++ /dev/null
@@ -1,118 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/textsearch/extraindexers.h</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/textsearch</a> - extraindexers.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">2</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">0.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">0</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #ifndef EPT_TEXTSEARCH_EXTRAINDEXERS_H
-<span class="lineNum">       2 </span>                : #define EPT_TEXTSEARCH_EXTRAINDEXERS_H
-<span class="lineNum">       3 </span>                : 
-<span class="lineNum">       4 </span>                : /** @file
-<span class="lineNum">       5 </span>                :  * @author Enrico Zini &lt;enrico@enricozini.org&gt;
-<span class="lineNum">       6 </span>                :  * Fast full-text search
-<span class="lineNum">       7 </span>                :  */
-<span class="lineNum">       8 </span>                : 
-<span class="lineNum">       9 </span>                : /*
-<span class="lineNum">      10 </span>                :  * Copyright (C) 2007  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">      11 </span>                :  *
-<span class="lineNum">      12 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">      13 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">      14 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">      15 </span>                :  * (at your option) any later version.
-<span class="lineNum">      16 </span>                :  *
-<span class="lineNum">      17 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      18 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      19 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      20 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      21 </span>                :  *
-<span class="lineNum">      22 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      23 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      24 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      25 </span>                :  */
-<span class="lineNum">      26 </span>                : 
-<span class="lineNum">      27 </span>                : #include &lt;ept/textsearch/textsearch.h&gt;
-<span class="lineNum">      28 </span>                : 
-<span class="lineNum">      29 </span>                : namespace ept {
-<span class="lineNum">      30 </span>                : namespace debtags {
-<span class="lineNum">      31 </span>                : class Debtags;
-<span class="lineNum">      32 </span>                : }
-<span class="lineNum">      33 </span>                : namespace textsearch {
-<span class="lineNum">      34 </span>                : 
-<span class="lineNum">      35 </span>                : struct AptTagsExtraIndexer : public TextSearch::ExtraIndexer
-<span class="lineNum">      36 </span><span class="lineNoCov">              0 : {</span>
-<span class="lineNum">      37 </span>                :         virtual void operator()(Xapian::Document&amp; doc, const apt::PackageRecord&amp; rec) const;
-<span class="lineNum">      38 </span>                : };
-<span class="lineNum">      39 </span>                : 
-<span class="lineNum">      40 </span>                : struct DebtagsExtraIndexer : public TextSearch::ExtraIndexer
-<span class="lineNum">      41 </span><span class="lineNoCov">              0 : {</span>
-<span class="lineNum">      42 </span>                :         const debtags::Debtags&amp; debtags;
-<span class="lineNum">      43 </span>                :         DebtagsExtraIndexer(const debtags::Debtags&amp; debtags) : debtags(debtags) {}
-<span class="lineNum">      44 </span>                :         virtual void operator()(Xapian::Document&amp; doc, const apt::PackageRecord&amp; rec) const;
-<span class="lineNum">      45 </span>                : };
-<span class="lineNum">      46 </span>                : 
-<span class="lineNum">      47 </span>                : }
-<span class="lineNum">      48 </span>                : }
-<span class="lineNum">      49 </span>                : 
-<span class="lineNum">      50 </span>                : // vim:set ts=4 sw=4:
-<span class="lineNum">      51 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/textsearch/index.html b/rep/ept/textsearch/index.html
deleted file mode 100644
index 331b9e7..0000000
--- a/rep/ept/textsearch/index.html
+++ /dev/null
@@ -1,119 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/textsearch</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - ept/textsearch</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">216</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">77.3 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">167</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <center>
-  <table width="80%" cellpadding=2 cellspacing=1 border=0>
-
-    <tr>
-      <td width="50%"><br></td>
-      <td width="15%"></td>
-      <td width="15%"></td>
-      <td width="20%"></td>
-    </tr>
-
-    <tr>
-      <td class="tableHead">Filename</td>
-      <td class="tableHead" colspan=3>Coverage</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="extraindexers.cc.gcov.html">extraindexers.cc</a></td>
-      <td class="coverBar" align="center">
-                <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../snow.png" width=100 height=10 alt="0.0%"></td></tr></table>
-      </td>
-      <td class="coverPerLo">0.0&nbsp;%</td>
-      <td class="coverNumLo">0&nbsp;/&nbsp;10&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="extraindexers.h.gcov.html">extraindexers.h</a></td>
-      <td class="coverBar" align="center">
-                <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../snow.png" width=100 height=10 alt="0.0%"></td></tr></table>
-      </td>
-      <td class="coverPerLo">0.0&nbsp;%</td>
-      <td class="coverNumLo">0&nbsp;/&nbsp;2&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="textsearch.cc.gcov.html">textsearch.cc</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=72 height=10 alt="72.2%"><img src="../../snow.png" width=28 height=10 alt="72.2%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">72.2&nbsp;%</td>
-      <td class="coverNumHi">83&nbsp;/&nbsp;115&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="textsearch.h.gcov.html">textsearch.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=87 height=10 alt="86.7%"><img src="../../snow.png" width=13 height=10 alt="86.7%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">86.7&nbsp;%</td>
-      <td class="coverNumHi">13&nbsp;/&nbsp;15&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="textsearch.test.h.gcov.html">textsearch.test.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../emerald.png" width=96 height=10 alt="95.9%"><img src="../../snow.png" width=4 height=10 alt="95.9%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">95.9&nbsp;%</td>
-      <td class="coverNumHi">71&nbsp;/&nbsp;74&nbsp;lines</td>
-    </tr>
-
-  </table>
-  </center>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/textsearch/maint/index.html b/rep/ept/textsearch/maint/index.html
deleted file mode 100644
index 45b6542..0000000
--- a/rep/ept/textsearch/maint/index.html
+++ /dev/null
@@ -1,92 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/textsearch/maint</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - ept/textsearch/maint</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">34</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">85.3 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">29</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <center>
-  <table width="80%" cellpadding=2 cellspacing=1 border=0>
-
-    <tr>
-      <td width="50%"><br></td>
-      <td width="15%"></td>
-      <td width="15%"></td>
-      <td width="20%"></td>
-    </tr>
-
-    <tr>
-      <td class="tableHead">Filename</td>
-      <td class="tableHead" colspan=3>Coverage</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="path.cc.gcov.html">path.cc</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=83 height=10 alt="82.8%"><img src="../../../snow.png" width=17 height=10 alt="82.8%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">82.8&nbsp;%</td>
-      <td class="coverNumHi">24&nbsp;/&nbsp;29&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="path.h.gcov.html">path.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">5&nbsp;/&nbsp;5&nbsp;lines</td>
-    </tr>
-
-  </table>
-  </center>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/textsearch/maint/path.cc.gcov.html b/rep/ept/textsearch/maint/path.cc.gcov.html
deleted file mode 100644
index 6363c97..0000000
--- a/rep/ept/textsearch/maint/path.cc.gcov.html
+++ /dev/null
@@ -1,160 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/textsearch/maint/path.cc</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">ept/textsearch/maint</a> - path.cc</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">29</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">82.8 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">24</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- mode: c++; indent-tabs-mode: t -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : /** \file
-<span class="lineNum">       4 </span>                :  * popcon paths
-<span class="lineNum">       5 </span>                :  */
-<span class="lineNum">       6 </span>                : 
-<span class="lineNum">       7 </span>                : /*
-<span class="lineNum">       8 </span>                :  * Copyright (C) 2005,2006,2007  Enrico Zini &lt;enrico@debian.org&gt;, Peter Rockai &lt;me@mornfall.net&gt;
-<span class="lineNum">       9 </span>                :  *
-<span class="lineNum">      10 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">      11 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">      12 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">      13 </span>                :  * (at your option) any later version.
-<span class="lineNum">      14 </span>                :  *
-<span class="lineNum">      15 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      16 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      17 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      18 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      19 </span>                :  *
-<span class="lineNum">      20 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      21 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      22 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      23 </span>                :  */
-<span class="lineNum">      24 </span>                : 
-<span class="lineNum">      25 </span>                : #include &lt;ept/config.h&gt;
-<span class="lineNum">      26 </span>                : #include &lt;ept/textsearch/maint/path.h&gt;
-<span class="lineNum">      27 </span>                : 
-<span class="lineNum">      28 </span>                : #include &lt;wibble/exception.h&gt;
-<span class="lineNum">      29 </span>                : #include &lt;wibble/sys/fs.h&gt;
-<span class="lineNum">      30 </span>                : #include &lt;wibble/string.h&gt;
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span>                : #include &lt;cstdio&gt;
-<span class="lineNum">      33 </span>                : #include &lt;cerrno&gt;
-<span class="lineNum">      34 </span>                : 
-<span class="lineNum">      35 </span>                : #include &lt;sys/types.h&gt;
-<span class="lineNum">      36 </span>                : #include &lt;sys/stat.h&gt;
-<span class="lineNum">      37 </span>                : #include &lt;unistd.h&gt;
-<span class="lineNum">      38 </span>                : 
-<span class="lineNum">      39 </span>                : using namespace std;
-<span class="lineNum">      40 </span>                : using namespace wibble;
-<span class="lineNum">      41 </span>                : 
-<span class="lineNum">      42 </span>                : namespace ept {
-<span class="lineNum">      43 </span>                : namespace textsearch {
-<span class="lineNum">      44 </span>                : 
-<span class="lineNum">      45 </span><span class="lineCov">            111 : Path &amp;Path::instance() {</span>
-<span class="lineNum">      46 </span><span class="lineCov">            111 :         if (!s_instance) {</span>
-<span class="lineNum">      47 </span><span class="lineCov">              1 :                 s_instance = new Path;</span>
-<span class="lineNum">      48 </span><span class="lineCov">              1 :                 instance().m_indexDir = TEXTSEARCH_DB_DIR;</span>
-<span class="lineNum">      49 </span>                :         }
-<span class="lineNum">      50 </span><span class="lineCov">            111 :         return *s_instance;</span>
-<span class="lineNum">      51 </span>                : }
-<span class="lineNum">      52 </span>                : 
-<span class="lineNum">      53 </span><span class="lineNoCov">              0 : int Path::access( const std::string &amp;s, int m )</span>
-<span class="lineNum">      54 </span>                : {
-<span class="lineNum">      55 </span><span class="lineNoCov">              0 :         return ::access( s.c_str(), m );</span>
-<span class="lineNum">      56 </span>                : }
-<span class="lineNum">      57 </span>                : 
-<span class="lineNum">      58 </span><span class="lineCov">             20 : time_t Path::indexTimestamp()</span>
-<span class="lineNum">      59 </span>                : {
-<span class="lineNum">      60 </span><span class="lineCov">             20 :         string tsfile = str::joinpath(instance().indexDir(), &quot;update-timestamp&quot;);</span>
-<span class="lineNum">      61 </span><span class="lineCov">             40 :         std::auto_ptr&lt;struct stat&gt; st = wibble::sys::fs::stat(tsfile);</span>
-<span class="lineNum">      62 </span><span class="lineCov">             20 :         if (st.get())</span>
-<span class="lineNum">      63 </span><span class="lineCov">             18 :                 return st-&gt;st_mtime;</span>
-<span class="lineNum">      64 </span>                :         else
-<span class="lineNum">      65 </span><span class="lineCov">              2 :                 return 0;</span>
-<span class="lineNum">      66 </span>                : }
-<span class="lineNum">      67 </span>                : 
-<span class="lineNum">      68 </span><span class="lineCov">              6 : void Path::setTimestamp(time_t ts)</span>
-<span class="lineNum">      69 </span>                : {
-<span class="lineNum">      70 </span><span class="lineCov">              6 :         string tsfile = str::joinpath(instance().indexDir(), &quot;/update-timestamp&quot;);</span>
-<span class="lineNum">      71 </span><span class="lineCov">             12 :         FILE* out = fopen(tsfile.c_str(), &quot;wt&quot;);</span>
-<span class="lineNum">      72 </span><span class="lineCov">              6 :         if (!out)</span>
-<span class="lineNum">      73 </span><span class="lineNoCov">              0 :                 throw wibble::exception::File(tsfile, &quot;opening file for truncate/writing&quot;);</span>
-<span class="lineNum">      74 </span><span class="lineCov">              6 :         if (fprintf(out, &quot;%ld\n&quot;, ts) &lt; 0)</span>
-<span class="lineNum">      75 </span><span class="lineNoCov">              0 :                 throw wibble::exception::File(tsfile, &quot;writing the modification time&quot;);</span>
-<span class="lineNum">      76 </span><span class="lineCov">              6 :         if (fclose(out) &lt; 0)</span>
-<span class="lineNum">      77 </span><span class="lineNoCov">              0 :                 throw wibble::exception::File(tsfile, &quot;closing the file&quot;);</span>
-<span class="lineNum">      78 </span><span class="lineCov">              6 : }</span>
-<span class="lineNum">      79 </span>                : 
-<span class="lineNum">      80 </span><span class="lineCov">             22 : void Path::setIndexDir( const std::string &amp;s )</span>
-<span class="lineNum">      81 </span>                : {
-<span class="lineNum">      82 </span><span class="lineCov">             22 :         instance().m_indexDir = s;</span>
-<span class="lineNum">      83 </span><span class="lineCov">             22 : }</span>
-<span class="lineNum">      84 </span>                : 
-<span class="lineNum">      85 </span><span class="lineCov">             37 : std::string Path::indexDir() { return instance().m_indexDir; }</span>
-<span class="lineNum">      86 </span><span class="lineCov">             25 : std::string Path::index() { return str::joinpath(instance().m_indexDir, &quot;/index&quot;); }</span>
-<span class="lineNum">      87 </span>                : 
-<span class="lineNum">      88 </span>                : Path *Path::s_instance = 0;
-<span class="lineNum">      89 </span>                : 
-<span class="lineNum">      90 </span>                : }
-<span class="lineNum">      91 </span><span class="lineCov">              6 : }</span>
-<span class="lineNum">      92 </span>                : 
-<span class="lineNum">      93 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/textsearch/maint/path.h.gcov.html b/rep/ept/textsearch/maint/path.h.gcov.html
deleted file mode 100644
index 5505d7b..0000000
--- a/rep/ept/textsearch/maint/path.h.gcov.html
+++ /dev/null
@@ -1,141 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/textsearch/maint/path.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">ept/textsearch/maint</a> - path.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">5</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">5</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- mode: c++; indent-tabs-mode: t -*-
-<span class="lineNum">       2 </span>                : /** \file
-<span class="lineNum">       3 </span>                :  * popcon paths
-<span class="lineNum">       4 </span>                :  */
-<span class="lineNum">       5 </span>                : 
-<span class="lineNum">       6 </span>                : /*
-<span class="lineNum">       7 </span>                :  * Copyright (C) 2005,2006,2007  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">       8 </span>                :  *
-<span class="lineNum">       9 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">      10 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">      11 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">      12 </span>                :  * (at your option) any later version.
-<span class="lineNum">      13 </span>                :  *
-<span class="lineNum">      14 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      15 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      16 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      17 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      18 </span>                :  *
-<span class="lineNum">      19 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      20 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      21 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      22 </span>                :  */
-<span class="lineNum">      23 </span>                : 
-<span class="lineNum">      24 </span>                : #ifndef EPT_TEXTSEARCH_PATH_H
-<span class="lineNum">      25 </span>                : #define EPT_TEXTSEARCH_PATH_H
-<span class="lineNum">      26 </span>                : 
-<span class="lineNum">      27 </span>                : #include &lt;string&gt;
-<span class="lineNum">      28 </span>                : 
-<span class="lineNum">      29 </span>                : struct stat;
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : namespace ept {
-<span class="lineNum">      32 </span>                : namespace textsearch {
-<span class="lineNum">      33 </span>                : 
-<span class="lineNum">      34 </span>                : /**
-<span class="lineNum">      35 </span>                :  * Singleton class to configure and access the various Popcon paths
-<span class="lineNum">      36 </span>                :  */
-<span class="lineNum">      37 </span>                : class Path
-<span class="lineNum">      38 </span><span class="lineCov">              1 : {</span>
-<span class="lineNum">      39 </span>                : public:
-<span class="lineNum">      40 </span>                :         static std::string indexDir();
-<span class="lineNum">      41 </span>                :         static std::string index();
-<span class="lineNum">      42 </span>                : 
-<span class="lineNum">      43 </span>                :         // Directory where Popcon source data is found
-<span class="lineNum">      44 </span>                :         static void setIndexDir( const std::string &amp;s );
-<span class="lineNum">      45 </span>                : 
-<span class="lineNum">      46 </span>                :         static int access( const std::string &amp;, int );
-<span class="lineNum">      47 </span>                :         static time_t indexTimestamp();
-<span class="lineNum">      48 </span>                :         static void setTimestamp(time_t ts);
-<span class="lineNum">      49 </span>                : 
-<span class="lineNum">      50 </span>                :         // RAII-style classes to temporarily override directories
-<span class="lineNum">      51 </span>                :         class OverrideIndexDir
-<span class="lineNum">      52 </span>                :         {
-<span class="lineNum">      53 </span>                :                 std::string old;
-<span class="lineNum">      54 </span>                :         public:
-<span class="lineNum">      55 </span><span class="lineCov">             11 :                 OverrideIndexDir(const std::string&amp; path) : old(Path::indexDir())</span>
-<span class="lineNum">      56 </span>                :                 {
-<span class="lineNum">      57 </span><span class="lineCov">             11 :                         Path::setIndexDir(path);</span>
-<span class="lineNum">      58 </span><span class="lineCov">             11 :                 }</span>
-<span class="lineNum">      59 </span><span class="lineCov">             11 :                 ~OverrideIndexDir() { Path::setIndexDir(old); }</span>
-<span class="lineNum">      60 </span>                :         };
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span>                : protected:
-<span class="lineNum">      63 </span>                :         static Path *s_instance;
-<span class="lineNum">      64 </span>                :         static Path &amp;instance();
-<span class="lineNum">      65 </span>                : 
-<span class="lineNum">      66 </span>                :         // Directory where Popcon source data is found
-<span class="lineNum">      67 </span>                :         std::string m_indexDir;
-<span class="lineNum">      68 </span>                : };
-<span class="lineNum">      69 </span>                : 
-<span class="lineNum">      70 </span>                : }
-<span class="lineNum">      71 </span>                : }
-<span class="lineNum">      72 </span>                : 
-<span class="lineNum">      73 </span>                : // vim:set ts=4 sw=4:
-<span class="lineNum">      74 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/textsearch/textsearch.cc.gcov.html b/rep/ept/textsearch/textsearch.cc.gcov.html
deleted file mode 100644
index b1cdfba..0000000
--- a/rep/ept/textsearch/textsearch.cc.gcov.html
+++ /dev/null
@@ -1,323 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/textsearch/textsearch.cc</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/textsearch</a> - textsearch.cc</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">115</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">72.2 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">83</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : 
-<span class="lineNum">       2 </span>                : /** @file
-<span class="lineNum">       3 </span>                :  * @author Enrico Zini &lt;enrico@enricozini.org&gt;
-<span class="lineNum">       4 </span>                :  * Fast full-text search
-<span class="lineNum">       5 </span>                :  */
-<span class="lineNum">       6 </span>                : 
-<span class="lineNum">       7 </span>                : /*
-<span class="lineNum">       8 </span>                :  * Copyright (C) 2007  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">       9 </span>                :  *
-<span class="lineNum">      10 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">      11 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">      12 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">      13 </span>                :  * (at your option) any later version.
-<span class="lineNum">      14 </span>                :  *
-<span class="lineNum">      15 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      16 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      17 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      18 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      19 </span>                :  *
-<span class="lineNum">      20 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      21 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      22 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      23 </span>                :  */
-<span class="lineNum">      24 </span>                : 
-<span class="lineNum">      25 </span>                : #include &lt;ept/textsearch/textsearch.h&gt;
-<span class="lineNum">      26 </span>                : #include &lt;ept/textsearch/maint/path.h&gt;
-<span class="lineNum">      27 </span>                : #include &lt;ept/apt/apt.h&gt;
-<span class="lineNum">      28 </span>                : #include &lt;ept/apt/packagerecord.h&gt;
-<span class="lineNum">      29 </span>                : //#include &lt;ept/debtags/debtags.h&gt;
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : #include &lt;wibble/regexp.h&gt;
-<span class="lineNum">      32 </span>                : #include &lt;cctype&gt;
-<span class="lineNum">      33 </span>                : #include &lt;cmath&gt;
-<span class="lineNum">      34 </span>                : 
-<span class="lineNum">      35 </span>                : #include &lt;xapian/queryparser.h&gt;
-<span class="lineNum">      36 </span>                : 
-<span class="lineNum">      37 </span>                : #include &lt;algorithm&gt;
-<span class="lineNum">      38 </span>                : 
-<span class="lineNum">      39 </span>                : #include &lt;iostream&gt;
-<span class="lineNum">      40 </span>                : 
-<span class="lineNum">      41 </span>                : using namespace std;
-<span class="lineNum">      42 </span>                : using namespace ept::apt;
-<span class="lineNum">      43 </span>                : using namespace ept::debtags;
-<span class="lineNum">      44 </span>                : 
-<span class="lineNum">      45 </span>                : namespace ept {
-<span class="lineNum">      46 </span>                : namespace textsearch {
-<span class="lineNum">      47 </span>                : 
-<span class="lineNum">      48 </span>                : size_t max_index = 0;
-<span class="lineNum">      49 </span>                : 
-<span class="lineNum">      50 </span><span class="lineCov">             11 : TextSearch::TextSearch()</span>
-<span class="lineNum">      51 </span><span class="lineCov">             11 :         : m_timestamp(0), m_stem(&quot;en&quot;)</span>
-<span class="lineNum">      52 </span>                : {
-<span class="lineNum">      53 </span><span class="lineCov">             22 :         m_timestamp = Path::indexTimestamp();</span>
-<span class="lineNum">      54 </span><span class="lineCov">             11 :         if (m_timestamp)</span>
-<span class="lineNum">      55 </span><span class="lineCov">              9 :                 m_db.add_database(Xapian::Database(Path::index()));</span>
-<span class="lineNum">      56 </span><span class="lineCov">             11 : }</span>
-<span class="lineNum">      57 </span>                : 
-<span class="lineNum">      58 </span><span class="lineCov">              7 : std::string TextSearch::toLower(const std::string&amp; str)</span>
-<span class="lineNum">      59 </span>                : {
-<span class="lineNum">      60 </span><span class="lineCov">              7 :         std::string res;</span>
-<span class="lineNum">      61 </span><span class="lineCov">              7 :         res.reserve(str.size());</span>
-<span class="lineNum">      62 </span><span class="lineCov">             44 :         for (std::string::const_iterator i = str.begin(); i != str.end(); ++i)</span>
-<span class="lineNum">      63 </span><span class="lineCov">             37 :                 res += tolower(*i);</span>
-<span class="lineNum">      64 </span><span class="lineNoCov">              0 :         return res;</span>
-<span class="lineNum">      65 </span>                : }
-<span class="lineNum">      66 </span>                : 
-<span class="lineNum">      67 </span><span class="lineCov">              3 : bool TextSearch::needsRebuild(apt::Apt&amp; apt)</span>
-<span class="lineNum">      68 </span>                : {
-<span class="lineNum">      69 </span><span class="lineCov">              3 :         return apt.timestamp() &gt; m_timestamp;</span>
-<span class="lineNum">      70 </span>                : }
-<span class="lineNum">      71 </span>                : 
-<span class="lineNum">      72 </span><span class="lineNoCov">              0 : void TextSearch::normalize_and_add(Xapian::Document&amp; doc, const std::string&amp; term, int&amp; pos) const</span>
-<span class="lineNum">      73 </span>                : {
-<span class="lineNum">      74 </span><span class="lineNoCov">              0 :         string t = TextSearch::toLower(term);</span>
-<span class="lineNum">      75 </span><span class="lineNoCov">              0 :         string s = m_stem(t);</span>
-<span class="lineNum">      76 </span><span class="lineNoCov">              0 :         doc.add_term(t);</span>
-<span class="lineNum">      77 </span><span class="lineNoCov">              0 :         if (s != t)</span>
-<span class="lineNum">      78 </span><span class="lineNoCov">              0 :                 doc.add_term(s);</span>
-<span class="lineNum">      79 </span><span class="lineNoCov">              0 : }</span>
-<span class="lineNum">      80 </span>                : 
-<span class="lineNum">      81 </span><span class="lineCov">             10 : bool TextSearch::rebuildIfNeeded(apt::Apt&amp; apt, const std::vector&lt;const TextSearch::ExtraIndexer*&gt;&amp; extraIndexers)</span>
-<span class="lineNum">      82 </span>                : {
-<span class="lineNum">      83 </span>                :         // Check if a rebuild is needed, and keep a copy of the APT timestamp for
-<span class="lineNum">      84 </span>                :         // saving later
-<span class="lineNum">      85 </span><span class="lineCov">             10 :         time_t aptts = apt.timestamp();</span>
-<span class="lineNum">      86 </span><span class="lineCov">             10 :         if (aptts &lt;= m_timestamp)</span>
-<span class="lineNum">      87 </span><span class="lineCov">              4 :                 return false;</span>
-<span class="lineNum">      88 </span>                : 
-<span class="lineNum">      89 </span>                :         // Reindex
-<span class="lineNum">      90 </span><span class="lineCov">              6 :         Xapian::WritableDatabase database(Xapian::Flint::open(Path::index(), Xapian::DB_CREATE_OR_OPEN));</span>
-<span class="lineNum">      91 </span><span class="lineCov">              6 :         Xapian::TermGenerator termgen;</span>
-<span class="lineNum">      92 </span><span class="lineCov">              6 :         termgen.set_stemmer(m_stem);</span>
-<span class="lineNum">      93 </span>                :         //database.begin_transaction();
-<span class="lineNum">      94 </span><span class="lineCov">              6 :         PackageRecord rec;</span>
-<span class="lineNum">      95 </span><span class="lineCov">              6 :         size_t count = 0;</span>
-<span class="lineNum">      96 </span><span class="lineCov">           2610 :         for (Apt::record_iterator i = apt.recordBegin();</span>
-<span class="lineNum">      97 </span>                :                         i != apt.recordEnd(); ++i, ++count)
-<span class="lineNum">      98 </span>                :         {
-<span class="lineNum">      99 </span>                :                 // If we are testing, we can set a limit to how many packages we index,
-<span class="lineNum">     100 </span>                :                 // to avoid it taking too much time
-<span class="lineNum">     101 </span><span class="lineCov">           2604 :                 if (max_index != 0 &amp;&amp; count &gt; max_index)</span>
-<span class="lineNum">     102 </span><span class="lineNoCov">              0 :                         break;</span>
-<span class="lineNum">     103 </span>                : 
-<span class="lineNum">     104 </span><span class="lineCov">           2604 :                 rec.scan(*i);</span>
-<span class="lineNum">     105 </span>                : 
-<span class="lineNum">     106 </span><span class="lineCov">           2604 :                 Xapian::Document doc;</span>
-<span class="lineNum">     107 </span><span class="lineCov">           2604 :                 doc.set_data(rec.package());</span>
-<span class="lineNum">     108 </span>                : 
-<span class="lineNum">     109 </span><span class="lineCov">           2604 :                 string pkgid = &quot;XP&quot; + rec.package();</span>
-<span class="lineNum">     110 </span>                :                 //std::cerr &lt;&lt; &quot;Add &quot; &lt;&lt; pkgid &lt;&lt; &quot;: &quot; &lt;&lt; idx &lt;&lt; std::endl;
-<span class="lineNum">     111 </span><span class="lineCov">           2604 :                 doc.add_term(pkgid);</span>
-<span class="lineNum">     112 </span>                : 
-<span class="lineNum">     113 </span>                :                 // Index tags as well
-<span class="lineNum">     114 </span><span class="lineCov">           2604 :                 set&lt;string&gt; tags = rec.tag();</span>
-<span class="lineNum">     115 </span><span class="lineCov">           2604 :                 for (set&lt;string&gt;::const_iterator ti = tags.begin();</span>
-<span class="lineNum">     116 </span>                :                                 ti != tags.end(); ++ti)
-<span class="lineNum">     117 </span><span class="lineNoCov">              0 :                         doc.add_term(&quot;XT&quot;+*ti);</span>
-<span class="lineNum">     118 </span>                : 
-<span class="lineNum">     119 </span><span class="lineCov">           2604 :                 termgen.set_document(doc);</span>
-<span class="lineNum">     120 </span><span class="lineCov">           2604 :                 termgen.index_text_without_positions(rec.package());</span>
-<span class="lineNum">     121 </span><span class="lineCov">           5208 :                 termgen.index_text_without_positions(rec.description());</span>
-<span class="lineNum">     122 </span>                : 
-<span class="lineNum">     123 </span>                :                 // Add the values
-<span class="lineNum">     124 </span><span class="lineCov">           5208 :                 doc.add_value(VAL_APT_INSTALLED_SIZE, Xapian::sortable_serialise(rec.installedSize()));</span>
-<span class="lineNum">     125 </span><span class="lineCov">           2604 :                 doc.add_value(VAL_APT_PACKAGE_SIZE, Xapian::sortable_serialise(rec.packageSize()));</span>
-<span class="lineNum">     126 </span>                : 
-<span class="lineNum">     127 </span><span class="lineCov">           2604 :                 if (m_timestamp)</span>
-<span class="lineNum">     128 </span><span class="lineCov">           2170 :                         database.replace_document(pkgid, doc);</span>
-<span class="lineNum">     129 </span>                :                 else
-<span class="lineNum">     130 </span><span class="lineCov">            434 :                         database.add_document(doc);</span>
-<span class="lineNum">     131 </span><span class="lineCov">              6 :         }</span>
-<span class="lineNum">     132 </span>                : 
-<span class="lineNum">     133 </span>                :         //database.commit_transaction();
-<span class="lineNum">     134 </span>                : 
-<span class="lineNum">     135 </span><span class="lineCov">              6 :         if (!m_timestamp)</span>
-<span class="lineNum">     136 </span><span class="lineCov">              1 :                 m_db.add_database(Xapian::Database(Path::index()));</span>
-<span class="lineNum">     137 </span>                :         else
-<span class="lineNum">     138 </span><span class="lineCov">              5 :                 m_db.reopen();</span>
-<span class="lineNum">     139 </span>                : 
-<span class="lineNum">     140 </span><span class="lineCov">              6 :         m_timestamp = aptts;</span>
-<span class="lineNum">     141 </span>                : 
-<span class="lineNum">     142 </span><span class="lineCov">              6 :         Path::setTimestamp(aptts);</span>
-<span class="lineNum">     143 </span>                : 
-<span class="lineNum">     144 </span><span class="lineCov">              6 :         return true;</span>
-<span class="lineNum">     145 </span>                : }
-<span class="lineNum">     146 </span>                : 
-<span class="lineNum">     147 </span><span class="lineCov">              2 : Xapian::Query TextSearch::makeORQuery(const std::string&amp; keywords) const</span>
-<span class="lineNum">     148 </span>                : {
-<span class="lineNum">     149 </span><span class="lineCov">              2 :         wibble::Tokenizer tok(keywords, &quot;[A-Za-z0-9_-]+&quot;, REG_EXTENDED);</span>
-<span class="lineNum">     150 </span><span class="lineCov">              4 :         return makeORQuery(tok.begin(), tok.end());</span>
-<span class="lineNum">     151 </span>                : }
-<span class="lineNum">     152 </span>                : 
-<span class="lineNum">     153 </span><span class="lineCov">              1 : Xapian::Query TextSearch::makePartialORQuery(const std::string&amp; keywords) const</span>
-<span class="lineNum">     154 </span>                : {
-<span class="lineNum">     155 </span><span class="lineCov">              1 :         wibble::Tokenizer tok(keywords, &quot;[A-Za-z0-9_-]+&quot;, REG_EXTENDED);</span>
-<span class="lineNum">     156 </span><span class="lineCov">              1 :         vector&lt;string&gt; tokens;</span>
-<span class="lineNum">     157 </span>                :         // FIXME: make the Tokenizer iterators properly iterable
-<span class="lineNum">     158 </span><span class="lineCov">              2 :         for (wibble::Tokenizer::const_iterator i = tok.begin();</span>
-<span class="lineNum">     159 </span>                :                         i != tok.end(); ++i)
-<span class="lineNum">     160 </span><span class="lineCov">              1 :                 tokens.push_back(*i);</span>
-<span class="lineNum">     161 </span>                :         // Add all the terms starting with 'last'
-<span class="lineNum">     162 </span><span class="lineCov">              1 :         if (!tokens.empty())</span>
-<span class="lineNum">     163 </span>                :         {
-<span class="lineNum">     164 </span><span class="lineCov">              1 :                 string&amp; last = *tokens.rbegin();</span>
-<span class="lineNum">     165 </span><span class="lineCov">              1 :                 if (last.size() == 1)</span>
-<span class="lineNum">     166 </span>                :                         // Ignore one-letter partial terms: they make the query uselessly
-<span class="lineNum">     167 </span>                :                         // large and slow, and it's worth just to wait for more characters
-<span class="lineNum">     168 </span>                :                         // to come
-<span class="lineNum">     169 </span><span class="lineNoCov">              0 :                         tokens.resize(tokens.size() - 1);</span>
-<span class="lineNum">     170 </span>                :                 else
-<span class="lineNum">     171 </span><span class="lineCov">              1 :                         copy(m_db.allterms_begin(last), m_db.allterms_end(last), back_inserter(tokens));</span>
-<span class="lineNum">     172 </span>                :                 /*
-<span class="lineNum">     173 </span>                :                 for (Xapian::TermIterator t = m_db.allterms_begin(last);
-<span class="lineNum">     174 </span>                :                                 t != m_db.allterms_end(last); ++t)
-<span class="lineNum">     175 </span>                :                         tokens.push_back(*t);
-<span class="lineNum">     176 </span>                :                 */
-<span class="lineNum">     177 </span>                :         }
-<span class="lineNum">     178 </span><span class="lineCov">              1 :         return makeORQuery(tokens.begin(), tokens.end());</span>
-<span class="lineNum">     179 </span>                : }
-<span class="lineNum">     180 </span>                : 
-<span class="lineNum">     181 </span><span class="lineCov">             10 : Xapian::docid TextSearch::docidByName(const std::string&amp; pkgname) const</span>
-<span class="lineNum">     182 </span>                : {
-<span class="lineNum">     183 </span><span class="lineCov">             10 :         Xapian::PostingIterator i = m_db.postlist_begin(&quot;XP&quot;+pkgname);</span>
-<span class="lineNum">     184 </span><span class="lineCov">             10 :         if (i == m_db.postlist_end(&quot;XP&quot;+pkgname))</span>
-<span class="lineNum">     185 </span><span class="lineCov">              5 :                 return 0;</span>
-<span class="lineNum">     186 </span>                :         else
-<span class="lineNum">     187 </span><span class="lineCov">              5 :                 return *i;</span>
-<span class="lineNum">     188 </span>                : }
-<span class="lineNum">     189 </span>                : 
-<span class="lineNum">     190 </span>                : struct TagFilter : public Xapian::ExpandDecider
-<span class="lineNum">     191 </span><span class="lineCov">              4 : {</span>
-<span class="lineNum">     192 </span><span class="lineNoCov">              0 :         virtual bool operator()(const std::string &amp;term) const { return term[0] == 'T'; }</span>
-<span class="lineNum">     193 </span>                : };
-<span class="lineNum">     194 </span>                : 
-<span class="lineNum">     195 </span><span class="lineCov">              2 : static TagFilter tagFilter;</span>
-<span class="lineNum">     196 </span>                : 
-<span class="lineNum">     197 </span><span class="lineNoCov">              0 : vector&lt;string&gt; TextSearch::expand(Xapian::Enquire&amp; enq) const</span>
-<span class="lineNum">     198 </span>                : {
-<span class="lineNum">     199 </span><span class="lineNoCov">              0 :         Xapian::RSet rset;</span>
-<span class="lineNum">     200 </span>                :         // Get the top 5 results as 'good ones' to compute the search expansion
-<span class="lineNum">     201 </span><span class="lineNoCov">              0 :         Xapian::MSet mset = enq.get_mset(0, 5);</span>
-<span class="lineNum">     202 </span><span class="lineNoCov">              0 :         for (Xapian::MSet::iterator i = mset.begin(); i != mset.end(); ++i)</span>
-<span class="lineNum">     203 </span><span class="lineNoCov">              0 :                 rset.add_document(i);</span>
-<span class="lineNum">     204 </span>                :         // Get the expanded set, only expanding the query with tag names
-<span class="lineNum">     205 </span><span class="lineNoCov">              0 :         Xapian::ESet eset = enq.get_eset(5, rset, &amp;tagFilter);</span>
-<span class="lineNum">     206 </span><span class="lineNoCov">              0 :         vector&lt;string&gt; res;</span>
-<span class="lineNum">     207 </span><span class="lineNoCov">              0 :         for (Xapian::ESetIterator i = eset.begin(); i != eset.end(); ++i)</span>
-<span class="lineNum">     208 </span><span class="lineNoCov">              0 :                 res.push_back(*i);</span>
-<span class="lineNum">     209 </span><span class="lineNoCov">              0 :         return res;</span>
-<span class="lineNum">     210 </span>                : }
-<span class="lineNum">     211 </span>                : 
-<span class="lineNum">     212 </span><span class="lineNoCov">              0 : Xapian::Query TextSearch::makeRelatedQuery(const std::string&amp; pkgname) const</span>
-<span class="lineNum">     213 </span>                : {
-<span class="lineNum">     214 </span><span class="lineNoCov">              0 :         Xapian::Enquire enquire(db());</span>
-<span class="lineNum">     215 </span>                :         
-<span class="lineNum">     216 </span>                :         // Retrieve the document for the given package
-<span class="lineNum">     217 </span><span class="lineNoCov">              0 :         enquire.set_query(Xapian::Query(&quot;XP&quot;+pkgname));</span>
-<span class="lineNum">     218 </span><span class="lineNoCov">              0 :         Xapian::MSet matches = enquire.get_mset(0, 1);</span>
-<span class="lineNum">     219 </span><span class="lineNoCov">              0 :         Xapian::MSetIterator mi = matches.begin();</span>
-<span class="lineNum">     220 </span><span class="lineNoCov">              0 :         if (mi == matches.end()) return Xapian::Query();</span>
-<span class="lineNum">     221 </span><span class="lineNoCov">              0 :         Xapian::Document doc = mi.get_document();</span>
-<span class="lineNum">     222 </span>                : 
-<span class="lineNum">     223 </span>                :         // Return the query to get the list of similar documents
-<span class="lineNum">     224 </span><span class="lineNoCov">              0 :         return Xapian::Query(Xapian::Query::OP_OR, doc.termlist_begin(), doc.termlist_end());</span>
-<span class="lineNum">     225 </span>                : }
-<span class="lineNum">     226 </span>                : 
-<span class="lineNum">     227 </span><span class="lineCov">              4 : double TextSearch::getDoubleValue(const std::string&amp; pkgname, Xapian::valueno val_id) const</span>
-<span class="lineNum">     228 </span>                : {
-<span class="lineNum">     229 </span><span class="lineCov">              4 :         Xapian::docid id = docidByName(pkgname);</span>
-<span class="lineNum">     230 </span><span class="lineCov">              4 :         if (id == 0)</span>
-<span class="lineNum">     231 </span><span class="lineCov">              2 :                 return 0.0;</span>
-<span class="lineNum">     232 </span><span class="lineCov">              2 :         Xapian::Document doc = db().get_document(id);</span>
-<span class="lineNum">     233 </span><span class="lineCov">              2 :         string val = doc.get_value(val_id);</span>
-<span class="lineNum">     234 </span><span class="lineCov">              2 :         if (val.empty())</span>
-<span class="lineNum">     235 </span><span class="lineNoCov">              0 :                 return 0.0;</span>
-<span class="lineNum">     236 </span>                :         else
-<span class="lineNum">     237 </span><span class="lineCov">              2 :                 return Xapian::sortable_unserialise(val);</span>
-<span class="lineNum">     238 </span>                : }
-<span class="lineNum">     239 </span>                : 
-<span class="lineNum">     240 </span><span class="lineCov">              4 : int TextSearch::getIntValue(const std::string&amp; pkgname, Xapian::valueno val_id) const</span>
-<span class="lineNum">     241 </span>                : {
-<span class="lineNum">     242 </span><span class="lineCov">              4 :         Xapian::docid id = docidByName(pkgname);</span>
-<span class="lineNum">     243 </span><span class="lineCov">              4 :         if (id == 0)</span>
-<span class="lineNum">     244 </span><span class="lineCov">              2 :                 return 0;</span>
-<span class="lineNum">     245 </span><span class="lineCov">              2 :         Xapian::Document doc = db().get_document(id);</span>
-<span class="lineNum">     246 </span><span class="lineCov">              2 :         string val = doc.get_value(val_id);</span>
-<span class="lineNum">     247 </span><span class="lineCov">              2 :         if (val.empty())</span>
-<span class="lineNum">     248 </span><span class="lineNoCov">              0 :                 return 0;</span>
-<span class="lineNum">     249 </span>                :         else
-<span class="lineNum">     250 </span><span class="lineCov">              2 :                 return (int)nearbyint(Xapian::sortable_unserialise(val));</span>
-<span class="lineNum">     251 </span>                : }
-<span class="lineNum">     252 </span>                : 
-<span class="lineNum">     253 </span>                : }
-<span class="lineNum">     254 </span><span class="lineCov">              6 : }</span>
-<span class="lineNum">     255 </span>                : 
-<span class="lineNum">     256 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/textsearch/textsearch.h.gcov.html b/rep/ept/textsearch/textsearch.h.gcov.html
deleted file mode 100644
index d46dca8..0000000
--- a/rep/ept/textsearch/textsearch.h.gcov.html
+++ /dev/null
@@ -1,286 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/textsearch/textsearch.h</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/textsearch</a> - textsearch.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">15</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">86.7 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">13</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #ifndef EPT_TEXTSEARCH_TEXTSEARCH_H
-<span class="lineNum">       2 </span>                : #define EPT_TEXTSEARCH_TEXTSEARCH_H
-<span class="lineNum">       3 </span>                : 
-<span class="lineNum">       4 </span>                : /** @file
-<span class="lineNum">       5 </span>                :  * @author Enrico Zini &lt;enrico@enricozini.org&gt;
-<span class="lineNum">       6 </span>                :  * Fast full-text search
-<span class="lineNum">       7 </span>                :  */
-<span class="lineNum">       8 </span>                : 
-<span class="lineNum">       9 </span>                : /*
-<span class="lineNum">      10 </span>                :  * Copyright (C) 2007  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">      11 </span>                :  *
-<span class="lineNum">      12 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">      13 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">      14 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">      15 </span>                :  * (at your option) any later version.
-<span class="lineNum">      16 </span>                :  *
-<span class="lineNum">      17 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      18 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      19 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      20 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      21 </span>                :  *
-<span class="lineNum">      22 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      23 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      24 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      25 </span>                :  */
-<span class="lineNum">      26 </span>                : 
-<span class="lineNum">      27 </span>                : #include &lt;xapian.h&gt;
-<span class="lineNum">      28 </span>                : #include &lt;vector&gt;
-<span class="lineNum">      29 </span>                : #include &lt;string&gt;
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : namespace ept {
-<span class="lineNum">      32 </span>                : namespace apt {
-<span class="lineNum">      33 </span>                : class Apt;
-<span class="lineNum">      34 </span>                : class PackageRecord;
-<span class="lineNum">      35 </span>                : }
-<span class="lineNum">      36 </span>                : namespace debtags {
-<span class="lineNum">      37 </span>                : class Debtags;
-<span class="lineNum">      38 </span>                : }
-<span class="lineNum">      39 </span>                : namespace textsearch {
-<span class="lineNum">      40 </span>                : 
-<span class="lineNum">      41 </span>                : // Allocate value indexes for known values
-<span class="lineNum">      42 </span>                : const Xapian::valueno VAL_APT_INSTALLED_SIZE      =  1;
-<span class="lineNum">      43 </span>                : const Xapian::valueno VAL_APT_PACKAGE_SIZE        =  2;
-<span class="lineNum">      44 </span>                : const Xapian::valueno VAL_POPCON                  = 10;
-<span class="lineNum">      45 </span>                : const Xapian::valueno VAL_ITERATING_RATING        = 20;
-<span class="lineNum">      46 </span>                : const Xapian::valueno VAL_ITERATING_FUNCTIONALITY = 21;
-<span class="lineNum">      47 </span>                : const Xapian::valueno VAL_ITERATING_USABILITY     = 22;
-<span class="lineNum">      48 </span>                : const Xapian::valueno VAL_ITERATING_SECURITY      = 23;
-<span class="lineNum">      49 </span>                : const Xapian::valueno VAL_ITERATING_PERFORMANCE   = 24;
-<span class="lineNum">      50 </span>                : const Xapian::valueno VAL_ITERATING_QUALITY       = 25;
-<span class="lineNum">      51 </span>                : const Xapian::valueno VAL_ITERATING_SUPPORT       = 26;
-<span class="lineNum">      52 </span>                : const Xapian::valueno VAL_ITERATING_ADOPTION      = 27;
-<span class="lineNum">      53 </span>                : // If you need to index a value and cannot edit this file, feel free to use any
-<span class="lineNum">      54 </span>                : // value starting from 1000000
-<span class="lineNum">      55 </span>                : 
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span>                : /*
-<span class="lineNum">      58 </span>                : Fallback on apt scan searches when index is not present
-<span class="lineNum">      59 </span>                : 
-<span class="lineNum">      60 </span>                : Explicitly decide at instantiation (or at any other time) if a rebuild should
-<span class="lineNum">      61 </span>                : be performed.  Just adding a 'rebuildIfNeeded' method would be enough.
-<span class="lineNum">      62 </span>                : 
-<span class="lineNum">      63 </span>                : 17:14 #xapian &lt; enrico&gt; Hello.  I'm finally in a position of writing a library to maintain
-<span class="lineNum">      64 </span>                :                         a xapian index with Debian package descriptions in a Debian system
-<span class="lineNum">      65 </span>                : 17:14 #xapian &lt; enrico&gt; I have a question, though
-<span class="lineNum">      66 </span>                : 17:14 #xapian &lt; enrico&gt; The descriptions change regularly as people run 'apt-get update'
-<span class="lineNum">      67 </span>                : 17:15 #xapian &lt; enrico&gt; I'd need to have a way to update the description index after
-<span class="lineNum">      68 </span>                :                         apt-get update, without rebuilding it from scratch
-<span class="lineNum">      69 </span>                : 17:15 #xapian &lt; enrico&gt; Is there some documentation on how to do that?  I can't exactly
-<span class="lineNum">      70 </span>                :                         tell Xapian &quot;the new description for package foo is this&quot; because
-<span class="lineNum">      71 </span>                :                         I'd need the xapian id
-<span class="lineNum">      72 </span>                : 19:11 #xapian &lt; omega&gt; you can add a unique term with a boolean prefix?
-<span class="lineNum">      73 </span>                : 19:11 #xapian &lt; omega&gt; like Qpackage-name
-<span class="lineNum">      74 </span>                : 19:11 #xapian &lt; omega&gt; then you search for it and replace_document
-<span class="lineNum">      75 </span>                : 19:24 #xapian &lt; richardb&gt; Or indeed, you use the &quot;replace_document()&quot; form which takes a
-<span class="lineNum">      76 </span>                :                           unique_id term.
-<span class="lineNum">      77 </span>                : 19:25 #xapian &lt; richardb&gt;         Xapian::docid replace_document(const std::string &amp;
-<span class="lineNum">      78 </span>                :                           unique_term,
-<span class="lineNum">      79 </span>                : 19:25 #xapian &lt; richardb&gt;                                        const Xapian::Document &amp;
-<span class="lineNum">      80 </span>                :                           document);
-<span class="lineNum">      81 </span>                : 19:43 #xapian &lt; enrico&gt; unique term
-<span class="lineNum">      82 </span>                : 19:43 #xapian &lt; enrico&gt; nice!
-<span class="lineNum">      83 </span>                : 19:44 #xapian &lt; enrico&gt; can I use a non-alpha prefix, like :package-name ?
-<span class="lineNum">      84 </span>                : 19:45 #xapian &lt; enrico&gt; or pkg:package-name
-<span class="lineNum">      85 </span>                : 19:45 #xapian &lt; enrico&gt; I suppose I can
-<span class="lineNum">      86 </span>                : */
-<span class="lineNum">      87 </span>                : 
-<span class="lineNum">      88 </span>                : /**
-<span class="lineNum">      89 </span>                :  * Maintains and accesses a Xapian index of package descriptions.
-<span class="lineNum">      90 </span>                :  *
-<span class="lineNum">      91 </span>                :  * Contrarily to Debtags and Popcon, TextSearch does not attempt to create the
-<span class="lineNum">      92 </span>                :  * index in the home directory if no system index is found and it is not
-<span class="lineNum">      93 </span>                :  * running as root: this is to avoid secretly building large indexes (&gt;50Mb)
-<span class="lineNum">      94 </span>                :  * in the home directory of users.
-<span class="lineNum">      95 </span>                :  *
-<span class="lineNum">      96 </span>                :  * The idea then is to have root keep the index up to date, possibly running a
-<span class="lineNum">      97 </span>                :  * reindexing tool once a day, or after an apt-get update.
-<span class="lineNum">      98 </span>                :  *
-<span class="lineNum">      99 </span>                :  * This works because the full text search index is useful even if it is
-<span class="lineNum">     100 </span>                :  * slightly out of date.
-<span class="lineNum">     101 </span>                :  */
-<span class="lineNum">     102 </span>                : class TextSearch
-<span class="lineNum">     103 </span><span class="lineCov">             11 : {</span>
-<span class="lineNum">     104 </span>                : protected:
-<span class="lineNum">     105 </span>                :         time_t m_timestamp;
-<span class="lineNum">     106 </span>                :         Xapian::Database m_db;
-<span class="lineNum">     107 </span>                :         Xapian::Stem m_stem;
-<span class="lineNum">     108 </span>                : 
-<span class="lineNum">     109 </span>                :         /// Return a lowercased copy of the string
-<span class="lineNum">     110 </span>                :         static std::string toLower(const std::string&amp; str);
-<span class="lineNum">     111 </span>                : 
-<span class="lineNum">     112 </span>                :         /**
-<span class="lineNum">     113 </span>                :          * Add normalised tokens computed from the string to the document doc.
-<span class="lineNum">     114 </span>                :          *
-<span class="lineNum">     115 </span>                :          * pos is used as a sequence generator for entering the token position in
-<span class="lineNum">     116 </span>                :          * the document.
-<span class="lineNum">     117 </span>                :          */
-<span class="lineNum">     118 </span>                :         void normalize_and_add(Xapian::Document&amp; doc, const std::string&amp; term, int&amp; pos) const;
-<span class="lineNum">     119 </span>                : 
-<span class="lineNum">     120 </span>                : public:
-<span class="lineNum">     121 </span>                :         struct ExtraIndexer
-<span class="lineNum">     122 </span>                :         {
-<span class="lineNum">     123 </span><span class="lineNoCov">              0 :                 virtual ~ExtraIndexer() {}</span>
-<span class="lineNum">     124 </span>                :                 virtual void operator()(Xapian::Document&amp; doc, const apt::PackageRecord&amp; rec) const = 0;
-<span class="lineNum">     125 </span>                :         };
-<span class="lineNum">     126 </span>                : 
-<span class="lineNum">     127 </span>                :         TextSearch();
-<span class="lineNum">     128 </span>                : 
-<span class="lineNum">     129 </span>                :         /// Access the Xapian database
-<span class="lineNum">     130 </span><span class="lineCov">              3 :         Xapian::Database&amp; db() { return m_db; }</span>
-<span class="lineNum">     131 </span>                : 
-<span class="lineNum">     132 </span>                :         /// Access the Xapian database
-<span class="lineNum">     133 </span><span class="lineCov">              4 :         const Xapian::Database&amp; db() const { return m_db; }</span>
-<span class="lineNum">     134 </span>                : 
-<span class="lineNum">     135 </span>                :         /// Timestamp of when the Xapian database was last updated
-<span class="lineNum">     136 </span><span class="lineCov">              3 :         time_t timestamp() const { return m_timestamp; }</span>
-<span class="lineNum">     137 </span>                : 
-<span class="lineNum">     138 </span>                :         /// Returns true if the index has data
-<span class="lineNum">     139 </span><span class="lineCov">              3 :         bool hasData() const { return m_timestamp &gt; 0; }</span>
-<span class="lineNum">     140 </span>                : 
-<span class="lineNum">     141 </span>                :         /// Returns true if the index is older than the Apt database information
-<span class="lineNum">     142 </span>                :         bool needsRebuild(apt::Apt&amp; apt);
-<span class="lineNum">     143 </span>                : 
-<span class="lineNum">     144 </span>                :         /**
-<span class="lineNum">     145 </span>                :          * Rebuild the index if needed.
-<span class="lineNum">     146 </span>                :          *
-<span class="lineNum">     147 </span>                :          * Allow to specify functors that contribute to the indexing.
-<span class="lineNum">     148 </span>                :          *
-<span class="lineNum">     149 </span>                :          * @note This requires write access to the index directory.
-<span class="lineNum">     150 </span>                :          * @note This is not the main way to update the index: it is provided here
-<span class="lineNum">     151 </span>                :          *       only as a way to build a draft index for the library tests
-<span class="lineNum">     152 </span>                :          */
-<span class="lineNum">     153 </span>                :         bool rebuildIfNeeded(
-<span class="lineNum">     154 </span>                :                 apt::Apt&amp; apt,
-<span class="lineNum">     155 </span>                :                 const std::vector&lt;const ExtraIndexer*&gt;&amp; extraIndexers = std::vector&lt;const ExtraIndexer*&gt;());
-<span class="lineNum">     156 </span>                : 
-<span class="lineNum">     157 </span>                :         /**
-<span class="lineNum">     158 </span>                :          * Retrieve a Xapian docid by package name
-<span class="lineNum">     159 </span>                :          */
-<span class="lineNum">     160 </span>                :         Xapian::docid docidByName(const std::string&amp; pkgname) const;
-<span class="lineNum">     161 </span>                : 
-<span class="lineNum">     162 </span>                :         /**
-<span class="lineNum">     163 </span>                :          * Tokenize the string and build an OR query with the resulting keywords
-<span class="lineNum">     164 </span>                :          */
-<span class="lineNum">     165 </span>                :         Xapian::Query makeORQuery(const std::string&amp; keywords) const;
-<span class="lineNum">     166 </span>                : 
-<span class="lineNum">     167 </span>                :         /**
-<span class="lineNum">     168 </span>                :          * Tokenize the string and build an OR query with the resulting keywords.
-<span class="lineNum">     169 </span>                :          *
-<span class="lineNum">     170 </span>                :          * The last token in keywords is considered to be typed only partially, to
-<span class="lineNum">     171 </span>                :          * implement proper search-as-you-type.
-<span class="lineNum">     172 </span>                :          */
-<span class="lineNum">     173 </span>                :         Xapian::Query makePartialORQuery(const std::string&amp; keywords) const;
-<span class="lineNum">     174 </span>                : 
-<span class="lineNum">     175 </span>                :         /**
-<span class="lineNum">     176 </span>                :          * Build a query with the given keywords, specified as iterators of strings
-<span class="lineNum">     177 </span>                :          */
-<span class="lineNum">     178 </span>                :         template&lt;typename ITER&gt;
-<span class="lineNum">     179 </span><span class="lineCov">              3 :         Xapian::Query makeORQuery(const ITER&amp; begin, const ITER&amp; end) const</span>
-<span class="lineNum">     180 </span>                :         {
-<span class="lineNum">     181 </span><span class="lineCov">              3 :                 std::vector&lt;std::string&gt; terms;</span>
-<span class="lineNum">     182 </span>                :                 // Insert both the lowercased and the stemmed lowercased query terms
-<span class="lineNum">     183 </span><span class="lineCov">             10 :                 for (ITER i = begin; i != end; ++i)</span>
-<span class="lineNum">     184 </span>                :                 {
-<span class="lineNum">     185 </span><span class="lineCov">              7 :                         std::string t = toLower(*i);</span>
-<span class="lineNum">     186 </span><span class="lineCov">              7 :                         std::string s = m_stem(t);</span>
-<span class="lineNum">     187 </span><span class="lineCov">              7 :                         terms.push_back(t);</span>
-<span class="lineNum">     188 </span><span class="lineCov">              7 :                         if (s != t)</span>
-<span class="lineNum">     189 </span><span class="lineNoCov">              0 :                                 terms.push_back(&quot;Z&quot; + s);</span>
-<span class="lineNum">     190 </span>                :                 }
-<span class="lineNum">     191 </span><span class="lineCov">              3 :                 return Xapian::Query(Xapian::Query::OP_OR, terms.begin(), terms.end());</span>
-<span class="lineNum">     192 </span>                :         }
-<span class="lineNum">     193 </span>                : 
-<span class="lineNum">     194 </span>                :         /// Return a list of tag-based terms that can be used to expand an OR query
-<span class="lineNum">     195 </span>                :         std::vector&lt;std::string&gt; expand(Xapian::Enquire&amp; enq) const;
-<span class="lineNum">     196 </span>                : 
-<span class="lineNum">     197 </span>                : //      std::vector&lt;std::string&gt; similar(const std::string&amp; pkg);
-<span class="lineNum">     198 </span>                : 
-<span class="lineNum">     199 </span>                :         /**
-<span class="lineNum">     200 </span>                :          * Create a query to look for packages similar to the given one
-<span class="lineNum">     201 </span>                :          */
-<span class="lineNum">     202 </span>                :         Xapian::Query makeRelatedQuery(const std::string&amp; pkgname) const;
-<span class="lineNum">     203 </span>                : 
-<span class="lineNum">     204 </span>                :         /**
-<span class="lineNum">     205 </span>                :          * Get the integer value for 
-<span class="lineNum">     206 </span>                :          */
-<span class="lineNum">     207 </span>                :         double getDoubleValue(const std::string&amp; pkgname, Xapian::valueno val_id) const;
-<span class="lineNum">     208 </span>                : 
-<span class="lineNum">     209 </span>                :         /**
-<span class="lineNum">     210 </span>                :          * Get the integer value for 
-<span class="lineNum">     211 </span>                :          */
-<span class="lineNum">     212 </span>                :         int getIntValue(const std::string&amp; pkgname, Xapian::valueno val_id) const;
-<span class="lineNum">     213 </span>                : };
-<span class="lineNum">     214 </span>                : 
-<span class="lineNum">     215 </span>                : }
-<span class="lineNum">     216 </span>                : }
-<span class="lineNum">     217 </span>                : 
-<span class="lineNum">     218 </span>                : // vim:set ts=4 sw=4:
-<span class="lineNum">     219 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/textsearch/textsearch.test.h.gcov.html b/rep/ept/textsearch/textsearch.test.h.gcov.html
deleted file mode 100644
index 230103d..0000000
--- a/rep/ept/textsearch/textsearch.test.h.gcov.html
+++ /dev/null
@@ -1,233 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/textsearch/textsearch.test.h</title>
-  <link rel="stylesheet" type="text/css" href="../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/textsearch</a> - textsearch.test.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">74</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">95.9 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">71</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- mode: c++; tab-width: 4; indent-tabs-mode: t -*-
-<span class="lineNum">       2 </span>                : /*
-<span class="lineNum">       3 </span>                :  * popcon test
-<span class="lineNum">       4 </span>                :  *
-<span class="lineNum">       5 </span>                :  * Copyright (C) 2007  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">       6 </span>                :  *
-<span class="lineNum">       7 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">       8 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">       9 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">      10 </span>                :  * (at your option) any later version.
-<span class="lineNum">      11 </span>                :  *
-<span class="lineNum">      12 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      13 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      14 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      15 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      16 </span>                :  *
-<span class="lineNum">      17 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      18 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      19 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      20 </span>                :  */
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                : #include &lt;ept/test.h&gt;
-<span class="lineNum">      23 </span>                : #include &lt;ept/textsearch/textsearch.h&gt;
-<span class="lineNum">      24 </span>                : #include &lt;ept/textsearch/maint/path.h&gt;
-<span class="lineNum">      25 </span>                : #include &lt;ept/apt/apt.h&gt;
-<span class="lineNum">      26 </span>                : #include &lt;wibble/sys/fs.h&gt;
-<span class="lineNum">      27 </span>                : #include &lt;set&gt;
-<span class="lineNum">      28 </span>                : 
-<span class="lineNum">      29 </span>                : namespace ept {
-<span class="lineNum">      30 </span>                : namespace textsearch {
-<span class="lineNum">      31 </span>                : extern size_t max_index;
-<span class="lineNum">      32 </span>                : }
-<span class="lineNum">      33 </span>                : }
-<span class="lineNum">      34 </span>                : 
-<span class="lineNum">      35 </span>                : using namespace std;
-<span class="lineNum">      36 </span>                : using namespace ept;
-<span class="lineNum">      37 </span>                : using namespace ept::textsearch;
-<span class="lineNum">      38 </span>                : using namespace ept::apt;
-<span class="lineNum">      39 </span>                : 
-<span class="lineNum">      40 </span>                : struct DirMaker
-<span class="lineNum">      41 </span>                : {
-<span class="lineNum">      42 </span><span class="lineCov">              6 :         DirMaker(const std::string&amp; name)</span>
-<span class="lineNum">      43 </span>                :         {
-<span class="lineNum">      44 </span><span class="lineCov">              6 :                 wibble::sys::fs::mkdirIfMissing(name, 0755);</span>
-<span class="lineNum">      45 </span><span class="lineCov">              6 :         }</span>
-<span class="lineNum">      46 </span>                : };
-<span class="lineNum">      47 </span>                : 
-<span class="lineNum">      48 </span>                : struct TestTextsearch : AptTestEnvironment
-<span class="lineNum">      49 </span><span class="lineCov">              6 : {</span>
-<span class="lineNum">      50 </span>                :         DirMaker md;
-<span class="lineNum">      51 </span>                :         Path::OverrideIndexDir oid;
-<span class="lineNum">      52 </span>                :         Apt apt;
-<span class="lineNum">      53 </span>                :         TextSearch textsearch;
-<span class="lineNum">      54 </span>                : 
-<span class="lineNum">      55 </span><span class="lineCov">              6 :         TestTextsearch()</span>
-<span class="lineNum">      56 </span><span class="lineCov">              6 :                 : md( TEST_ENV_DIR &quot;xapian&quot;), oid( TEST_ENV_DIR &quot;xapian&quot;)</span>
-<span class="lineNum">      57 </span>                :         {
-<span class="lineNum">      58 </span>                :                 try {
-<span class="lineNum">      59 </span><span class="lineCov">              6 :                         ept::textsearch::max_index = 1000;</span>
-<span class="lineNum">      60 </span><span class="lineCov">              6 :                         textsearch.rebuildIfNeeded(apt);</span>
-<span class="lineNum">      61 </span><span class="lineNoCov">              0 :                 } catch (Xapian::Error&amp; e) {</span>
-<span class="lineNum">      62 </span><span class="lineNoCov">              0 :                         cerr &lt;&lt; e.get_type() &lt;&lt; &quot; &quot; &lt;&lt; e.get_msg() &lt;&lt; &quot; &quot; &lt;&lt; e.get_context() &lt;&lt; endl;</span>
-<span class="lineNum">      63 </span><span class="lineNoCov">              0 :                         throw;</span>
-<span class="lineNum">      64 </span>                :                 }
-<span class="lineNum">      65 </span><span class="lineCov">              6 :         }</span>
-<span class="lineNum">      66 </span>                : 
-<span class="lineNum">      67 </span>                : // Access an empty index
-<span class="lineNum">      68 </span><span class="lineCov">              1 :         Test empty()</span>
-<span class="lineNum">      69 </span>                :         {
-<span class="lineNum">      70 </span><span class="lineCov">              1 :                 Path::OverrideIndexDir oid(&quot;./empty&quot;);</span>
-<span class="lineNum">      71 </span><span class="lineCov">              1 :                 TextSearch empty;</span>
-<span class="lineNum">      72 </span><span class="lineCov">              1 :                 assert_eq(empty.timestamp(), 0);</span>
-<span class="lineNum">      73 </span><span class="lineCov">              2 :                 assert(!empty.hasData());</span>
-<span class="lineNum">      74 </span><span class="lineCov">              2 :                 assert(empty.needsRebuild(apt));</span>
-<span class="lineNum">      75 </span>                :                 /*
-<span class="lineNum">      76 </span>                :                   Xapian::Enquire enq(empty.db());
-<span class="lineNum">      77 </span>                :                   empty.search(enq, &quot;apt&quot;);
-<span class="lineNum">      78 </span>                :                   Xapian::MSet matches = enq.get_mset(0, 100);
-<span class="lineNum">      79 </span>                :                   assert_eq(matches.size(), 0u);
-<span class="lineNum">      80 </span>                :                 */
-<span class="lineNum">      81 </span><span class="lineCov">              1 :         }</span>
-<span class="lineNum">      82 </span>                : 
-<span class="lineNum">      83 </span>                : // Very basic access
-<span class="lineNum">      84 </span><span class="lineCov">              1 :         Test basicAccess()</span>
-<span class="lineNum">      85 </span>                :         {
-<span class="lineNum">      86 </span><span class="lineCov">              1 :                 assert(textsearch.hasData());</span>
-<span class="lineNum">      87 </span><span class="lineCov">              2 :                 assert(textsearch.timestamp() &gt; 0);</span>
-<span class="lineNum">      88 </span><span class="lineCov">              2 :                 assert(!textsearch.needsRebuild(apt));</span>
-<span class="lineNum">      89 </span>                : 
-<span class="lineNum">      90 </span><span class="lineCov">              1 :                 Xapian::Enquire enq(textsearch.db());</span>
-<span class="lineNum">      91 </span><span class="lineCov">              2 :                 enq.set_query(textsearch.makeORQuery(&quot;sgml&quot;));</span>
-<span class="lineNum">      92 </span><span class="lineCov">              1 :                 Xapian::MSet matches = enq.get_mset(0, 100);</span>
-<span class="lineNum">      93 </span><span class="lineCov">              1 :                 assert(matches.size() &gt; 0);</span>
-<span class="lineNum">      94 </span>                : 
-<span class="lineNum">      95 </span>                :                 // See if the apt package is among the results
-<span class="lineNum">      96 </span><span class="lineCov">              1 :                 set&lt;string&gt; results;</span>
-<span class="lineNum">      97 </span><span class="lineCov">             10 :                 for (Xapian::MSetIterator i = matches.begin(); i != matches.end(); ++i)</span>
-<span class="lineNum">      98 </span><span class="lineCov">             10 :                         results.insert(i.get_document().get_data());</span>
-<span class="lineNum">      99 </span><span class="lineCov">              1 :                 assert(results.find(&quot;sp&quot;) != results.end());</span>
-<span class="lineNum">     100 </span><span class="lineCov">              1 :         }</span>
-<span class="lineNum">     101 </span>                : 
-<span class="lineNum">     102 </span>                : // Alternate access using intermediate Xapian::Query objects
-<span class="lineNum">     103 </span><span class="lineCov">              1 :         Test queryAccess()</span>
-<span class="lineNum">     104 </span>                :         {
-<span class="lineNum">     105 </span><span class="lineCov">              1 :                 Xapian::Enquire enq(textsearch.db());</span>
-<span class="lineNum">     106 </span><span class="lineCov">              1 :                 enq.set_query(textsearch.makeORQuery(&quot;sgml&quot;));</span>
-<span class="lineNum">     107 </span><span class="lineCov">              1 :                 Xapian::MSet matches = enq.get_mset(0, 100);</span>
-<span class="lineNum">     108 </span><span class="lineCov">              1 :                 assert(matches.size() &gt; 0);</span>
-<span class="lineNum">     109 </span>                : 
-<span class="lineNum">     110 </span>                :                 // See if the apt package is among the results
-<span class="lineNum">     111 </span><span class="lineCov">              1 :                 set&lt;string&gt; results;</span>
-<span class="lineNum">     112 </span><span class="lineCov">             10 :                 for (Xapian::MSetIterator i = matches.begin(); i != matches.end(); ++i)</span>
-<span class="lineNum">     113 </span><span class="lineCov">             10 :                         results.insert(i.get_document().get_data());</span>
-<span class="lineNum">     114 </span><span class="lineCov">              1 :                 assert(results.find(&quot;sp&quot;) != results.end());</span>
-<span class="lineNum">     115 </span><span class="lineCov">              1 :         }</span>
-<span class="lineNum">     116 </span>                : 
-<span class="lineNum">     117 </span>                : // Try makePartialORQuery
-<span class="lineNum">     118 </span><span class="lineCov">              1 :         Test partialOrQuery()</span>
-<span class="lineNum">     119 </span>                :         {
-<span class="lineNum">     120 </span><span class="lineCov">              1 :                 Xapian::Enquire enq(textsearch.db());</span>
-<span class="lineNum">     121 </span><span class="lineCov">              1 :                 enq.set_query(textsearch.makePartialORQuery(&quot;sgml&quot;));</span>
-<span class="lineNum">     122 </span><span class="lineCov">              1 :                 Xapian::MSet matches = enq.get_mset(0, 100);</span>
-<span class="lineNum">     123 </span><span class="lineCov">              1 :                 assert(matches.size() &gt; 0);</span>
-<span class="lineNum">     124 </span>                : 
-<span class="lineNum">     125 </span>                :                 // See if the apt package is among the results
-<span class="lineNum">     126 </span><span class="lineCov">              1 :                 set&lt;string&gt; results;</span>
-<span class="lineNum">     127 </span><span class="lineCov">             10 :                 for (Xapian::MSetIterator i = matches.begin(); i != matches.end(); ++i)</span>
-<span class="lineNum">     128 </span><span class="lineCov">             10 :                         results.insert(i.get_document().get_data());</span>
-<span class="lineNum">     129 </span><span class="lineCov">              1 :                 assert(results.find(&quot;sp&quot;) != results.end());</span>
-<span class="lineNum">     130 </span><span class="lineCov">              1 :         }</span>
-<span class="lineNum">     131 </span>                : 
-<span class="lineNum">     132 </span>                : // Try docidByName
-<span class="lineNum">     133 </span><span class="lineCov">              1 :         Test docidByName()</span>
-<span class="lineNum">     134 </span>                :         {
-<span class="lineNum">     135 </span><span class="lineCov">              1 :                 assert(textsearch.docidByName(&quot;sp&quot;) != 0);</span>
-<span class="lineNum">     136 </span><span class="lineCov">              2 :                 assert_eq(textsearch.docidByName(&quot;thereisnopackagewiththisname&quot;), 0u);</span>
-<span class="lineNum">     137 </span><span class="lineCov">              1 :         }</span>
-<span class="lineNum">     138 </span>                : 
-<span class="lineNum">     139 </span>                : // Access values
-<span class="lineNum">     140 </span><span class="lineCov">              1 :         Test values()</span>
-<span class="lineNum">     141 </span>                :         {
-<span class="lineNum">     142 </span><span class="lineCov">              1 :                 assert(textsearch.hasData());</span>
-<span class="lineNum">     143 </span><span class="lineCov">              2 :                 assert(textsearch.timestamp() &gt; 0);</span>
-<span class="lineNum">     144 </span><span class="lineCov">              2 :                 assert(!textsearch.needsRebuild(apt));</span>
-<span class="lineNum">     145 </span>                : 
-<span class="lineNum">     146 </span>                :                 double dval;
-<span class="lineNum">     147 </span><span class="lineCov">              2 :                 dval = textsearch.getDoubleValue(&quot;autoconf&quot;, VAL_APT_INSTALLED_SIZE);</span>
-<span class="lineNum">     148 </span><span class="lineCov">              2 :                 assert(dval == 2408);</span>
-<span class="lineNum">     149 </span><span class="lineCov">              2 :                 dval = textsearch.getDoubleValue(&quot;autoconf&quot;, VAL_APT_PACKAGE_SIZE);</span>
-<span class="lineNum">     150 </span><span class="lineCov">              2 :                 assert(dval == 741486);</span>
-<span class="lineNum">     151 </span><span class="lineCov">              2 :                 assert_eq(textsearch.getDoubleValue(&quot;thereisnopackagewiththisname&quot;, VAL_APT_INSTALLED_SIZE), 0.0);</span>
-<span class="lineNum">     152 </span><span class="lineCov">              2 :                 assert_eq(textsearch.getDoubleValue(&quot;thereisnopackagewiththisname&quot;, VAL_APT_PACKAGE_SIZE), 0.0);</span>
-<span class="lineNum">     153 </span>                : 
-<span class="lineNum">     154 </span>                :                 int val;
-<span class="lineNum">     155 </span><span class="lineCov">              2 :                 val = textsearch.getIntValue(&quot;autoconf&quot;, VAL_APT_INSTALLED_SIZE);</span>
-<span class="lineNum">     156 </span><span class="lineCov">              2 :                 assert(val == 2408);</span>
-<span class="lineNum">     157 </span><span class="lineCov">              2 :                 val = textsearch.getIntValue(&quot;autoconf&quot;, VAL_APT_PACKAGE_SIZE);</span>
-<span class="lineNum">     158 </span><span class="lineCov">              2 :                 assert(val == 741486);</span>
-<span class="lineNum">     159 </span><span class="lineCov">              1 :                 cout &lt;&lt; val;</span>
-<span class="lineNum">     160 </span><span class="lineCov">              2 :                 assert_eq(textsearch.getIntValue(&quot;thereisnopackagewiththisname&quot;, VAL_APT_INSTALLED_SIZE), 0);</span>
-<span class="lineNum">     161 </span><span class="lineCov">              2 :                 assert_eq(textsearch.getIntValue(&quot;thereisnopackagewiththisname&quot;, VAL_APT_PACKAGE_SIZE), 0);</span>
-<span class="lineNum">     162 </span><span class="lineCov">              1 :         }</span>
-<span class="lineNum">     163 </span>                : 
-<span class="lineNum">     164 </span>                : };
-<span class="lineNum">     165 </span>                : 
-<span class="lineNum">     166 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/ept/token.h.gcov.html b/rep/ept/token.h.gcov.html
deleted file mode 100644
index 8a750ee..0000000
--- a/rep/ept/token.h.gcov.html
+++ /dev/null
@@ -1,122 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - ept/token.h</title>
-  <link rel="stylesheet" type="text/css" href="../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../index.html">directory</a> - <a href="index.html">ept</a> - token.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">16</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">81.2 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">13</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- C++ -*-
-<span class="lineNum">       2 </span>                : #include &lt;wibble/mixin.h&gt;
-<span class="lineNum">       3 </span>                : #include &lt;string&gt;
-<span class="lineNum">       4 </span>                : 
-<span class="lineNum">       5 </span>                : #ifndef EPT_TOKEN_H
-<span class="lineNum">       6 </span>                : #define EPT_TOKEN_H
-<span class="lineNum">       7 </span>                : 
-<span class="lineNum">       8 </span>                : namespace ept {
-<span class="lineNum">       9 </span>                : 
-<span class="lineNum">      10 </span><span class="lineCov">           9994 : struct Token : wibble::mixin::Comparable&lt; Token &gt; {</span>
-<span class="lineNum">      11 </span>                :     std::string _id; // formatted as package[_version]
-<span class="lineNum">      12 </span><span class="lineNoCov">              0 :     std::string id() const { return _id; }</span>
-<span class="lineNum">      13 </span>                : 
-<span class="lineNum">      14 </span><span class="lineCov">           9755 :     Token() : _id( &quot;&quot; ) {}</span>
-<span class="lineNum">      15 </span><span class="lineCov">              8 :     Token( std::string s ) : _id( s ) {}</span>
-<span class="lineNum">      16 </span>                : 
-<span class="lineNum">      17 </span><span class="lineCov">           1831 :     std::string version() const {</span>
-<span class="lineNum">      18 </span>                :         return _id.find( '_' ) == std::string::npos ? &quot;&quot; :
-<span class="lineNum">      19 </span><span class="lineCov">           1831 :             std::string( _id, _id.find( '_' ) + 1, _id.size() );</span>
-<span class="lineNum">      20 </span>                :     }
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span><span class="lineCov">           7883 :     std::string package() const {</span>
-<span class="lineNum">      23 </span>                :         return std::string( _id, 0,
-<span class="lineNum">      24 </span>                :                             _id.find( '_' ) == std::string::npos ?
-<span class="lineNum">      25 </span><span class="lineCov">           7883 :                             _id.size() : _id.find( '_' ) );</span>
-<span class="lineNum">      26 </span>                :     }
-<span class="lineNum">      27 </span>                : 
-<span class="lineNum">      28 </span>                :     bool isDesktop() const {
-<span class="lineNum">      29 </span>                :         return std::string( _id, 0, 8 ) == &quot;desktop:&quot;;
-<span class="lineNum">      30 </span>                :     }
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span>                :     std::string desktop() const {
-<span class="lineNum">      33 </span>                :         return isDesktop() ? std::string( _id, 8, _id.size() ) : &quot;&quot;;
-<span class="lineNum">      34 </span>                :     }
-<span class="lineNum">      35 </span>                : 
-<span class="lineNum">      36 </span><span class="lineCov">             17 :     bool hasVersion() const {</span>
-<span class="lineNum">      37 </span><span class="lineCov">             17 :         return version() != &quot;&quot;;</span>
-<span class="lineNum">      38 </span>                :     }
-<span class="lineNum">      39 </span>                : 
-<span class="lineNum">      40 </span><span class="lineCov">              1 :     bool valid() const {</span>
-<span class="lineNum">      41 </span><span class="lineCov">              1 :         return _id != &quot;&quot;;</span>
-<span class="lineNum">      42 </span>                :     }
-<span class="lineNum">      43 </span>                : 
-<span class="lineNum">      44 </span><span class="lineCov">             58 :     bool operator&lt;=( const Token &amp;o ) const {</span>
-<span class="lineNum">      45 </span><span class="lineCov">             58 :         return _id &lt;= o._id;</span>
-<span class="lineNum">      46 </span>                :     }
-<span class="lineNum">      47 </span>                : };
-<span class="lineNum">      48 </span>                : 
-<span class="lineNum">      49 </span>                : }
-<span class="lineNum">      50 </span>                : 
-<span class="lineNum">      51 </span><span class="lineNoCov">              0 : inline std::ostream &amp;operator&lt;&lt;( std::ostream &amp;o, const ept::Token &amp;t ) {</span>
-<span class="lineNum">      52 </span><span class="lineNoCov">              0 :     return o &lt;&lt; t.id();</span>
-<span class="lineNum">      53 </span>                : }
-<span class="lineNum">      54 </span>                : 
-<span class="lineNum">      55 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/gcov.css b/rep/gcov.css
deleted file mode 100644
index 12ad0ca..0000000
--- a/rep/gcov.css
+++ /dev/null
@@ -1,408 +0,0 @@
-/* All views: initial background and text color */
-body
-{
-  color:            #000000;
-  background-color: #FFFFFF;
-}
-
-
-/* All views: standard link format*/
-a:link
-{
-  color:           #284FA8;
-  text-decoration: underline;
-}
-
-
-/* All views: standard link - visited format */
-a:visited
-{
-  color:           #00CB40;
-  text-decoration: underline;
-}
-
-
-/* All views: standard link - activated format */
-a:active
-{
-  color:           #FF0040;
-  text-decoration: underline;
-}
-
-
-/* All views: main title format */
-td.title
-{
-  text-align:     center;
-  padding-bottom: 10px;
-  font-family:    sans-serif;
-  font-size:      20pt;
-  font-style:     italic;
-  font-weight:    bold;
-}
-
-
-/* All views: header item format */
-td.headerItem
-{
-  text-align:    right;
-  padding-right: 6px;
-  font-family:   sans-serif;
-  font-weight:   bold;
-}
-
-
-/* All views: header item value format */
-td.headerValue
-{
-  text-align:  left;
-  color:       #284FA8;
-  font-family: sans-serif;
-  font-weight: bold;
-}
-
-
-/* All views: header legend item format */
-td.legendItem
-{
-  text-align:      right;
-  padding-right:   6px;
-  padding-top:     10px;
-  padding-bottom:  2px;
-  font-family:     sans-serif;
-  font-weight:     bold;
-}
-
-
-/* All views: header legend item value format */
-td.legendValue
-{
-  text-align:      left;
-  padding-top:     10px;
-  padding-bottom:  2px;
-  color:           #000000;
-  font-family:     sans-serif;
-  font-weight:     bold;
-}
-
-
-/* All views: color of horizontal ruler */
-td.ruler
-{
-  background-color: #6688D4;
-}
-
-
-/* All views: version string format */
-td.versionInfo
-{
-  text-align:   center;
-  padding-top:  2px;
-  font-family:  sans-serif;
-  font-style:   italic;
-}
-
-
-/* Directory view/File view (all)/Test case descriptions:
-   table headline format */
-td.tableHead
-{
-  text-align:       center;
-  color:            #FFFFFF;
-  background-color: #6688D4;
-  font-family:      sans-serif;
-  font-size:        120%;
-  font-weight:      bold;
-}
-
-
-/* Directory view/File view (all): filename entry format */
-td.coverFile
-{
-  text-align:       left;
-  padding-left:     10px;
-  padding-right:    20px; 
-  color:            #284FA8;
-  background-color: #DAE7FE;
-  font-family:      monospace;
-}
-
-
-/* Directory view/File view (all): bar-graph entry format*/
-td.coverBar
-{
-  padding-left:     10px;
-  padding-right:    10px;
-  background-color: #DAE7FE;
-}
-
-
-/* Directory view/File view (all): bar-graph outline color */
-td.coverBarOutline
-{
-  background-color: #000000;
-}
-
-
-/* Directory view/File view (all): percentage entry for files with
-   high coverage rate */
-td.coverPerHi
-{
-  text-align:       right;
-  padding-left:     10px;
-  padding-right:    10px;
-  background-color: #A7FC9D;
-  font-weight:      bold;
-}
-
-
-/* Directory view/File view (all): line count entry for files with
-   high coverage rate */
-td.coverNumHi
-{
-  text-align:       right;
-  padding-left:     10px;
-  padding-right:    10px;
-  background-color: #A7FC9D;
-}
-
-
-/* Directory view/File view (all): legend entry for high coverage
-   rate */
-span.coverLegendHi
-{
-  text-align:       center;
-  padding-left:     10px;
-  padding-right:    10px;
-  background-color: #A7FC9D;
-}
-
-
-/* Directory view/File view (all): percentage entry for files with
-   medium coverage rate */
-td.coverPerMed
-{
-  text-align:       right;
-  padding-left:     10px;
-  padding-right:    10px;
-  background-color: #FFEA20;
-  font-weight:      bold;
-}
-
-
-/* Directory view/File view (all): line count entry for files with
-   medium coverage rate */
-td.coverNumMed
-{
-  text-align:       right;
-  padding-left:     10px;
-  padding-right:    10px;
-  background-color: #FFEA20;
-}
-
-
-/* Directory view/File view (all): legend entry for medium coverage
-   rate */
-span.coverLegendMed
-{
-  text-align:       center;
-  padding-left:     10px;
-  padding-right:    10px;
-  margin-top:       5px;
-  margin-bottom:    5px;
-  margin-right:     2px;
-  background-color: #FFEA20;
-}
-
-
-/* Directory view/File view (all): percentage entry for files with
-   low coverage rate */
-td.coverPerLo
-{
-  text-align:       right;
-  padding-left:     10px;
-  padding-right:    10px;
-  background-color: #FF0000;
-  font-weight:      bold;
-}
-
-
-/* Directory view/File view (all): line count entry for files with
-   low coverage rate */
-td.coverNumLo
-{
-  text-align:       right;
-  padding-left:     10px;
-  padding-right:    10px;
-  background-color: #FF0000;
-}
-
-
-/* Directory view/File view (all): legend entry for low coverage
-   rate */
-span.coverLegendLo
-{
-  text-align:       center;
-  padding-left:     10px;
-  padding-right:    10px;
-  margin-right:     2px;
-  background-color: #FF0000;
-}
-
-
-/* File view (all): "show/hide details" link format */
-a.detail:link
-{
-  color: #B8D0FF;
-}
-
-
-/* File view (all): "show/hide details" link - visited format */
-a.detail:visited
-{
-  color: #B8D0FF;
-}
-
-
-/* File view (all): "show/hide details" link - activated format */
-a.detail:active
-{
-  color: #FFFFFF;
-}
-
-
-/* File view (detail): test name table headline format */
-td.testNameHead
-{
-  text-align:       right;
-  padding-right:    10px;
-  background-color: #DAE7FE;
-  font-family:      sans-serif;
-  font-weight:      bold;
-}
-
-
-/* File view (detail): test lines table headline format */
-td.testLinesHead
-{
-  text-align:       center;
-  background-color: #DAE7FE;
-  font-family:      sans-serif;
-  font-weight:      bold;
-}
-
-
-/* File view (detail): test name entry */
-td.testName
-{
-  text-align:       right;
-  padding-right:    10px;
-  background-color: #DAE7FE;
-}
-
-
-/* File view (detail): test percentage entry */
-td.testPer
-{
-  text-align:       right;
-  padding-left:     10px;
-  padding-right:    10px; 
-  background-color: #DAE7FE;
-}
-
-
-/* File view (detail): test lines count entry */
-td.testNum
-{
-  text-align:       right;
-  padding-left:     10px;
-  padding-right:    10px; 
-  background-color: #DAE7FE;
-}
-
-
-/* Test case descriptions: test name format*/
-dt
-{
-  font-family: sans-serif;
-  font-weight: bold;
-}
-
-
-/* Test case descriptions: description table body */
-td.testDescription
-{
-  padding-top:      10px;
-  padding-left:     30px;
-  padding-bottom:   10px;
-  padding-right:    30px;
-  background-color: #DAE7FE;
-}
-
-
-/* Source code view: source code format */
-pre.source
-{
-  font-family: monospace;
-  white-space: pre;
-}
-
-/* Source code view: line number format */
-span.lineNum
-{
-  background-color: #EFE383;
-}
-
-
-/* Source code view: format for lines which were executed */
-span.lineCov
-{
-  background-color: #CAD7FE;
-}
-
-
-/* Source code view: format for Cov legend */
-span.LegendCov
-{
-  text-align:       center;
-  padding-left:     10px;
-  padding-right:    10px;
-  margin-right:     2px;
-  background-color: #CAD7FE;
-}
-
-
-/* Source code view: format for lines which were not executed */
-span.lineNoCov
-{
-  background-color: #FF6230;
-}
-
-
-/* Source code view: format for NoCov legend */
-span.LegendNoCov
-{
-  text-align:       center;
-  padding-left:     10px;
-  padding-right:    10px;
-  margin-right:     2px;
-  background-color: #FF6230;
-}
-
-
-/* Source code view: format for lines which were executed only in a
-   previous version */
-span.lineDiffCov
-{
-  background-color: #B5F7AF;
-}
-
-
-/* Source code view: format for DiffCov legend */
-span.LegendDiffCov
-{
-  text-align:       center;
-  padding-left:     10px;
-  padding-right:    10px;
-  background-color: #B5F7AF;
-}
diff --git a/rep/glass.png b/rep/glass.png
deleted file mode 100644
index e1abc00..0000000
--- a/rep/glass.png
+++ /dev/null
diff --git a/rep/index.html b/rep/index.html
deleted file mode 100644
index a31df91..0000000
--- a/rep/index.html
+++ /dev/null
@@ -1,353 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info</title>
-  <link rel="stylesheet" type="text/css" href="gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4>directory</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">11539</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">80.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">9227</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <center>
-  <table width="80%" cellpadding=2 cellspacing=1 border=0>
-
-    <tr>
-      <td width="50%"><br></td>
-      <td width="15%"></td>
-      <td width="15%"></td>
-      <td width="20%"></td>
-    </tr>
-
-    <tr>
-      <td class="tableHead">Directory&nbsp;name</td>
-      <td class="tableHead" colspan=3>Coverage</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="srv/build/pkg/ept-work/default/ept/index.html">/srv/build/pkg/ept-work/default/ept</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">107&nbsp;/&nbsp;107&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="srv/build/pkg/ept-work/default/wibble/index.html">/srv/build/pkg/ept-work/default/wibble</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">125&nbsp;/&nbsp;125&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="usr/include/apt-pkg/index.html">/usr/include/apt-pkg</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="emerald.png" width=86 height=10 alt="86.2%"><img src="snow.png" width=14 height=10 alt="86.2%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">86.2&nbsp;%</td>
-      <td class="coverNumHi">69&nbsp;/&nbsp;80&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="usr/include/c++/4.3/index.html">/usr/include/c++/4.3</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="ruby.png" width=7 height=10 alt="6.6%"><img src="snow.png" width=93 height=10 alt="6.6%"></td></tr></table>
-      </td>
-      <td class="coverPerLo">6.6&nbsp;%</td>
-      <td class="coverNumLo">12&nbsp;/&nbsp;181&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="usr/include/c++/4.3/backward/index.html">/usr/include/c++/4.3/backward</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">22&nbsp;/&nbsp;22&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="usr/include/c++/4.3/bits/index.html">/usr/include/c++/4.3/bits</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="emerald.png" width=69 height=10 alt="69.1%"><img src="snow.png" width=31 height=10 alt="69.1%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">69.1&nbsp;%</td>
-      <td class="coverNumHi">1418&nbsp;/&nbsp;2051&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="usr/include/c++/4.3/ext/index.html">/usr/include/c++/4.3/ext</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="emerald.png" width=54 height=10 alt="53.6%"><img src="snow.png" width=46 height=10 alt="53.6%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">53.6&nbsp;%</td>
-      <td class="coverNumHi">15&nbsp;/&nbsp;28&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="usr/include/c++/4.3/i486-linux-gnu/bits/index.html">/usr/include/c++/4.3/i486-linux-gnu/bits</a></td>
-      <td class="coverBar" align="center">
-                <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="snow.png" width=100 height=10 alt="0.0%"></td></tr></table>
-      </td>
-      <td class="coverPerLo">0.0&nbsp;%</td>
-      <td class="coverNumLo">0&nbsp;/&nbsp;2&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="usr/include/tagcoll-2.0.11/tagcoll/index.html">/usr/include/tagcoll-2.0.11/tagcoll</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="emerald.png" width=73 height=10 alt="73.4%"><img src="snow.png" width=27 height=10 alt="73.4%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">73.4&nbsp;%</td>
-      <td class="coverNumHi">127&nbsp;/&nbsp;173&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="usr/include/tagcoll-2.0.11/tagcoll/coll/index.html">/usr/include/tagcoll-2.0.11/tagcoll/coll</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="emerald.png" width=80 height=10 alt="79.7%"><img src="snow.png" width=20 height=10 alt="79.7%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">79.7&nbsp;%</td>
-      <td class="coverNumHi">141&nbsp;/&nbsp;177&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="usr/include/tagcoll-2.0.11/tagcoll/diskindex/index.html">/usr/include/tagcoll-2.0.11/tagcoll/diskindex</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="emerald.png" width=93 height=10 alt="93.3%"><img src="snow.png" width=7 height=10 alt="93.3%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">93.3&nbsp;%</td>
-      <td class="coverNumHi">14&nbsp;/&nbsp;15&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="usr/include/tagcoll-2.0.11/tagcoll/input/index.html">/usr/include/tagcoll-2.0.11/tagcoll/input</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="amber.png" width=19 height=10 alt="18.8%"><img src="snow.png" width=81 height=10 alt="18.8%"></td></tr></table>
-      </td>
-      <td class="coverPerMed">18.8&nbsp;%</td>
-      <td class="coverNumMed">3&nbsp;/&nbsp;16&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="usr/include/tagcoll-2.0.11/tagcoll/stream/index.html">/usr/include/tagcoll-2.0.11/tagcoll/stream</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">8&nbsp;/&nbsp;8&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="usr/include/tagcoll-2.0.11/tagcoll/utils/index.html">/usr/include/tagcoll-2.0.11/tagcoll/utils</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="emerald.png" width=83 height=10 alt="83.3%"><img src="snow.png" width=17 height=10 alt="83.3%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">83.3&nbsp;%</td>
-      <td class="coverNumHi">10&nbsp;/&nbsp;12&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="usr/include/xapian/index.html">/usr/include/xapian</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="emerald.png" width=77 height=10 alt="76.6%"><img src="snow.png" width=23 height=10 alt="76.6%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">76.6&nbsp;%</td>
-      <td class="coverNumHi">59&nbsp;/&nbsp;77&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="ept/index.html">ept</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="emerald.png" width=74 height=10 alt="73.7%"><img src="snow.png" width=26 height=10 alt="73.7%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">73.7&nbsp;%</td>
-      <td class="coverNumHi">28&nbsp;/&nbsp;38&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="ept/apt/index.html">ept/apt</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="emerald.png" width=89 height=10 alt="89.2%"><img src="snow.png" width=11 height=10 alt="89.2%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">89.2&nbsp;%</td>
-      <td class="coverNumHi">785&nbsp;/&nbsp;880&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="ept/core/index.html">ept/core</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="emerald.png" width=83 height=10 alt="82.8%"><img src="snow.png" width=17 height=10 alt="82.8%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">82.8&nbsp;%</td>
-      <td class="coverNumHi">570&nbsp;/&nbsp;688&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="ept/core/apt/index.html">ept/core/apt</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="emerald.png" width=92 height=10 alt="91.9%"><img src="snow.png" width=8 height=10 alt="91.9%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">91.9&nbsp;%</td>
-      <td class="coverNumHi">307&nbsp;/&nbsp;334&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="ept/debtags/index.html">ept/debtags</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="emerald.png" width=89 height=10 alt="89.2%"><img src="snow.png" width=11 height=10 alt="89.2%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">89.2&nbsp;%</td>
-      <td class="coverNumHi">626&nbsp;/&nbsp;702&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="ept/debtags/maint/index.html">ept/debtags/maint</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="emerald.png" width=85 height=10 alt="84.9%"><img src="snow.png" width=15 height=10 alt="84.9%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">84.9&nbsp;%</td>
-      <td class="coverNumHi">718&nbsp;/&nbsp;846&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="ept/popcon/index.html">ept/popcon</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="emerald.png" width=83 height=10 alt="83.2%"><img src="snow.png" width=17 height=10 alt="83.2%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">83.2&nbsp;%</td>
-      <td class="coverNumHi">134&nbsp;/&nbsp;161&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="ept/popcon/maint/index.html">ept/popcon/maint</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="emerald.png" width=88 height=10 alt="88.4%"><img src="snow.png" width=12 height=10 alt="88.4%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">88.4&nbsp;%</td>
-      <td class="coverNumHi">228&nbsp;/&nbsp;258&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="ept/textsearch/index.html">ept/textsearch</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="emerald.png" width=77 height=10 alt="77.3%"><img src="snow.png" width=23 height=10 alt="77.3%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">77.3&nbsp;%</td>
-      <td class="coverNumHi">167&nbsp;/&nbsp;216&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="ept/textsearch/maint/index.html">ept/textsearch/maint</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="emerald.png" width=85 height=10 alt="85.3%"><img src="snow.png" width=15 height=10 alt="85.3%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">85.3&nbsp;%</td>
-      <td class="coverNumHi">29&nbsp;/&nbsp;34&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="wibble/index.html">wibble</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="emerald.png" width=90 height=10 alt="89.9%"><img src="snow.png" width=10 height=10 alt="89.9%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">89.9&nbsp;%</td>
-      <td class="coverNumHi">1954&nbsp;/&nbsp;2173&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="wibble/commandline/index.html">wibble/commandline</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="emerald.png" width=84 height=10 alt="83.9%"><img src="snow.png" width=16 height=10 alt="83.9%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">83.9&nbsp;%</td>
-      <td class="coverNumHi">559&nbsp;/&nbsp;666&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="wibble/grcal/index.html">wibble/grcal</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="emerald.png" width=82 height=10 alt="81.9%"><img src="snow.png" width=18 height=10 alt="81.9%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">81.9&nbsp;%</td>
-      <td class="coverNumHi">308&nbsp;/&nbsp;376&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="wibble/log/index.html">wibble/log</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="emerald.png" width=93 height=10 alt="93.0%"><img src="snow.png" width=7 height=10 alt="93.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">93.0&nbsp;%</td>
-      <td class="coverNumHi">53&nbsp;/&nbsp;57&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="wibble/stream/index.html">wibble/stream</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="emerald.png" width=81 height=10 alt="81.0%"><img src="snow.png" width=19 height=10 alt="81.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">81.0&nbsp;%</td>
-      <td class="coverNumHi">34&nbsp;/&nbsp;42&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="wibble/sys/index.html">wibble/sys</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="emerald.png" width=60 height=10 alt="60.1%"><img src="snow.png" width=40 height=10 alt="60.1%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">60.1&nbsp;%</td>
-      <td class="coverNumHi">597&nbsp;/&nbsp;994&nbsp;lines</td>
-    </tr>
-
-  </table>
-  </center>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/lcov.info b/rep/lcov.info
deleted file mode 100644
index fa184b9..0000000
--- a/rep/lcov.info
+++ /dev/null
@@ -1,96554 +0,0 @@
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/log/null.h
-FN:13,_ZN6wibble3log10NullSender4sendENS0_5LevelERKSs
-FN:11,_ZN6wibble3log10NullSenderC1Ev
-FN:12,_ZN6wibble3log10NullSenderD0Ev
-FN:12,_ZN6wibble3log10NullSenderD1Ev
-DA:11,1
-DA:12,1
-DA:13,4
-BA:12,0
-BA:12,0
-BA:12,1
-BA:12,2
-LF:3
-LH:3
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/log/ostream.h
-FN:18,_ZN6wibble3log13OstreamSenderD1Ev
-DA:18,1
-BA:18,1
-BA:18,2
-LF:1
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/log/stream.h
-FN:23,_ZN6wibble3log6SenderC2Ev
-FN:24,_ZN6wibble3log6SenderD2Ev
-FN:24,_ZN6wibble3log6SenderD0Ev
-FN:24,_ZN6wibble3log6SenderD1Ev
-DA:23,4
-DA:24,4
-BA:24,1
-BA:24,2
-BA:24,0
-BA:24,0
-BA:24,0
-BA:24,0
-LF:2
-LH:2
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:52,_ZlsIN6wibble3log5LevelEER12AssertFailedS4_T_
-FN:17,_ZN8LocationC1EPKciSs
-FN:13,_ZN8LocationC1ERKS_
-FN:52,_ZlsISsER12AssertFailedS1_T_
-FN:41,_ZN12AssertFailedD1Ev
-FN:13,_ZN8LocationD1Ev
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:59,_Z9assert_fnIbEv8LocationT_
-FN:52,_ZlsIPKcER12AssertFailedS3_T_
-FN:67,_Z12assert_eq_fnIN6wibble3log5LevelES2_Ev8LocationT_T0_
-FN:52,_ZlsIjER12AssertFailedS1_T_
-FN:67,_Z12assert_eq_fnIjjEv8LocationT_T0_
-FN:67,_Z12assert_eq_fnISsPKcEv8LocationT_T0_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:59,0
-DA:61,0
-DA:62,0
-DA:64,0
-DA:67,3
-DA:69,3
-DA:70,0
-DA:71,0
-DA:75,3
-BA:42,0
-BA:42,0
-BA:61,0
-BA:61,0
-BA:69,1
-BA:69,2
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-LF:26
-LH:3
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/log.test.h
-FN:27,_ZN12_GLOBAL__N_17TestLog7Sender1C1Ev
-FN:31,_ZN12_GLOBAL__N_17TestLog7Sender1D0Ev
-FN:31,_ZN12_GLOBAL__N_17TestLog7Sender1D1Ev
-FN:124,_ZN12_GLOBAL__N_17TestLog13ostreamSenderEv
-FN:81,_ZN12_GLOBAL__N_17TestLog10nullSenderEv
-FN:102,_ZN12_GLOBAL__N_17TestLog10fileSenderEv
-FN:34,_ZN12_GLOBAL__N_17TestLog7Sender14sendEN6wibble3log5LevelERKSs
-FN:47,_ZN12_GLOBAL__N_17TestLog9streambufEv
-DA:27,1
-DA:31,1
-DA:34,3
-DA:36,3
-DA:37,3
-DA:47,1
-DA:50,1
-DA:52,1
-DA:53,1
-DA:56,1
-DA:57,1
-DA:58,2
-DA:59,2
-DA:63,1
-DA:64,1
-DA:65,2
-DA:66,2
-DA:69,1
-DA:70,1
-DA:73,1
-DA:74,2
-DA:75,2
-DA:78,1
-DA:81,1
-DA:84,1
-DA:85,1
-DA:87,1
-DA:88,1
-DA:91,1
-DA:95,1
-DA:98,1
-DA:99,1
-DA:102,1
-DA:106,1
-DA:107,2
-DA:109,1
-DA:110,1
-DA:113,1
-DA:117,1
-DA:120,1
-DA:121,1
-DA:124,1
-DA:127,1
-DA:128,1
-DA:130,1
-DA:131,1
-DA:133,1
-DA:134,1
-DA:137,1
-DA:141,1
-DA:144,1
-DA:145,1
-BA:31,0
-BA:31,0
-BA:31,1
-BA:31,2
-LF:52
-LH:52
-end_of_record
-SF:/srv/build/pkg/ept-work/default/wibble/wibble-test-generated-_home_mornfall_dev_pkg_ept-work_wibble_log.cpp
-FN:6,_Z41__static_initialization_and_destruction_0ii
-FN:6,_GLOBAL__I__Z17run_Log_streambufv
-FN:6,_Z21run_Log_ostreamSenderv
-FN:4,_Z18run_Log_nullSenderv
-FN:5,_Z18run_Log_fileSenderv
-FN:3,_Z17run_Log_streambufv
-DA:3,1
-DA:4,1
-DA:5,1
-DA:6,4
-BA:6,2
-BA:6,1
-BA:6,2
-BA:6,1
-LF:4
-LH:4
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaIcED1Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaISt4pairIN6wibble3log5LevelESsEED2Ev
-FN:98,_ZNSaISt4pairIN6wibble3log5LevelESsEEC2Ev
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,1
-DA:100,0
-DA:101,0
-DA:106,1
-DA:118,0
-DA:119,0
-LF:6
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:195,_ZNKSt9basic_iosIcSt11char_traitsIcEE4failEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:195,0
-DA:196,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2188,_ZSteqIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_EPKS3_
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2188,0
-DA:2189,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-LF:53
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-DA:245,0
-DA:246,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:159,_ZStanSt12_Ios_IostateS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:159,0
-DA:160,0
-DA:163,0
-DA:164,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIPSt4pairIN6wibble3log5LevelESsELb0EE3__bES5_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:268,_ZNSt12__niter_baseIPSt4pairIN6wibble3log5LevelESsELb0EE3__bES5_
-FN:539,_ZNSt20__copy_move_backwardILb0ELb0ESt26random_access_iterator_tagE13__copy_move_bIPSt4pairIN6wibble3log5LevelESsES8_EET0_T_SA_S9_
-FN:579,_ZSt22__copy_move_backward_aILb0EPSt4pairIN6wibble3log5LevelESsES5_ET1_T0_S7_S6_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPSt4pairIN6wibble3log5LevelESsES5_ET1_T0_S7_S6_
-FN:624,_ZSt13copy_backwardIPSt4pairIN6wibble3log5LevelESsES5_ET0_T_S7_S6_
-DA:210,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:268,0
-DA:269,0
-DA:286,0
-DA:287,0
-DA:539,0
-DA:542,0
-DA:543,0
-DA:544,0
-DA:579,0
-DA:587,0
-DA:592,0
-DA:597,0
-DA:602,0
-DA:624,0
-DA:636,0
-BA:215,0
-BA:215,0
-BA:542,0
-BA:542,0
-LF:19
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:87,_ZSt8_DestroyISt4pairIN6wibble3log5LevelESsEEvPT_
-FN:97,_ZSt8_DestroyIPSt4pairIN6wibble3log5LevelESsEEvT_S6_
-FN:126,_ZSt8_DestroyIPSt4pairIN6wibble3log5LevelESsES4_EvT_S6_RSaIT0_E
-DA:87,6
-DA:88,6
-DA:97,4
-DA:101,10
-DA:103,6
-DA:104,4
-DA:126,4
-DA:128,4
-DA:129,4
-BA:101,2
-BA:101,2
-LF:9
-LH:9
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPSt4pairIN6wibble3log5LevelESsESt6vectorIS5_SaIS5_EEE4baseEv
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPSt4pairIN6wibble3log5LevelESsESt6vectorIS5_SaIS5_EEEdeEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPSt4pairIN6wibble3log5LevelESsESt6vectorIS5_SaIS5_EEEC1ERKS6_
-DA:683,3
-DA:695,0
-DA:696,0
-DA:747,6
-DA:748,6
-LF:5
-LH:3
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:166,0
-DA:167,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_pair.h
-FN:88,_ZNSt4pairIN6wibble3log5LevelESsEC1ERKS2_RKSs
-FN:218,_ZSt9make_pairIN6wibble3log5LevelESsESt4pairIT_T0_ES4_S5_
-FN:73,_ZNSt4pairIN6wibble3log5LevelESsEC1ERKS3_
-FN:73,_ZNSt4pairIN6wibble3log5LevelESsEaSERKS3_
-FN:73,_ZNSt4pairIN6wibble3log5LevelESsED1Ev
-DA:73,15
-DA:88,3
-DA:89,3
-DA:218,3
-DA:219,3
-LF:5
-LH:5
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyIPSt4pairIN6wibble3log5LevelESsES7_EET0_T_S9_S8_
-FN:113,_ZSt18uninitialized_copyIPSt4pairIN6wibble3log5LevelESsES5_ET0_T_S7_S6_
-FN:261,_ZSt22__uninitialized_copy_aIPSt4pairIN6wibble3log5LevelESsES5_S4_ET0_T_S7_S6_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPSt4pairIN6wibble3log5LevelESsES5_SaIS4_EET0_T_S8_S7_RT1_
-DA:73,6
-DA:75,6
-DA:78,9
-DA:79,3
-DA:81,6
-DA:83,0
-DA:85,0
-DA:86,0
-DA:113,6
-DA:122,6
-DA:261,6
-DA:262,6
-DA:268,6
-DA:272,6
-BA:78,2
-BA:78,2
-BA:79,2
-BA:79,1
-LF:14
-LH:11
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:484,_ZNKSt6vectorISt4pairIN6wibble3log5LevelESsESaIS4_EE4sizeEv
-FN:562,_ZNSt6vectorISt4pairIN6wibble3log5LevelESsESaIS4_EEixEj
-FN:97,_ZNSt12_Vector_baseISt4pairIN6wibble3log5LevelESsESaIS4_EE19_M_get_Tp_allocatorEv
-FN:395,_ZNSt6vectorISt4pairIN6wibble3log5LevelESsESaIS4_EE3endEv
-FN:79,_ZNSt12_Vector_baseISt4pairIN6wibble3log5LevelESsESaIS4_EE12_Vector_implD1Ev
-FN:101,_ZNKSt12_Vector_baseISt4pairIN6wibble3log5LevelESsESaIS4_EE19_M_get_Tp_allocatorEv
-FN:489,_ZNKSt6vectorISt4pairIN6wibble3log5LevelESsESaIS4_EE8max_sizeEv
-FN:84,_ZNSt12_Vector_baseISt4pairIN6wibble3log5LevelESsESaIS4_EE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseISt4pairIN6wibble3log5LevelESsESaIS4_EEC2Ev
-FN:213,_ZNSt6vectorISt4pairIN6wibble3log5LevelESsESaIS4_EEC1Ev
-FN:147,_ZNSt12_Vector_baseISt4pairIN6wibble3log5LevelESsESaIS4_EE13_M_deallocateEPS4_j
-FN:135,_ZNSt12_Vector_baseISt4pairIN6wibble3log5LevelESsESaIS4_EED2Ev
-FN:299,_ZNSt6vectorISt4pairIN6wibble3log5LevelESsESaIS4_EED1Ev
-FN:1075,_ZNKSt6vectorISt4pairIN6wibble3log5LevelESsESaIS4_EE12_M_check_lenEjPKc
-FN:143,_ZNSt12_Vector_baseISt4pairIN6wibble3log5LevelESsESaIS4_EE11_M_allocateEj
-FN:686,_ZNSt6vectorISt4pairIN6wibble3log5LevelESsESaIS4_EE9push_backERKS4_
-DA:79,1
-DA:84,1
-DA:85,1
-DA:86,1
-DA:97,10
-DA:98,10
-DA:101,6
-DA:102,6
-DA:108,1
-DA:109,1
-DA:135,1
-DA:136,1
-DA:137,1
-DA:143,3
-DA:144,3
-DA:147,4
-DA:149,4
-DA:150,3
-DA:151,4
-DA:213,1
-DA:214,1
-DA:299,1
-DA:300,1
-DA:301,1
-DA:395,3
-DA:396,3
-DA:484,16
-DA:485,16
-DA:489,6
-DA:490,6
-DA:562,6
-DA:563,6
-DA:686,3
-DA:688,3
-DA:690,0
-DA:691,0
-DA:694,3
-DA:695,3
-DA:1075,3
-DA:1077,3
-DA:1078,0
-DA:1080,3
-DA:1081,3
-BA:144,2
-BA:144,1
-BA:149,2
-BA:149,2
-BA:688,1
-BA:688,2
-BA:1077,1
-BA:1077,2
-BA:1081,2
-BA:1081,1
-BA:1081,1
-BA:1081,2
-LF:43
-LH:40
-end_of_record
-SF:/usr/include/c++/4.3/bits/vector.tcc
-FN:283,_ZNSt6vectorISt4pairIN6wibble3log5LevelESsESaIS4_EE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPS4_S6_EERKS4_
-DA:283,3
-DA:286,3
-DA:288,0
-DA:291,0
-DA:293,0
-DA:295,0
-DA:299,0
-DA:307,3
-DA:308,3
-DA:309,3
-DA:316,3
-DA:321,3
-DA:323,3
-DA:324,3
-DA:330,0
-DA:332,0
-DA:333,0
-DA:334,0
-DA:336,3
-DA:338,3
-DA:341,3
-DA:342,3
-DA:343,3
-DA:345,3
-BA:286,1
-BA:286,2
-LF:24
-LH:15
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIN6wibble3log5LevelESsEED2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt4pairIN6wibble3log5LevelESsEE8max_sizeEv
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIN6wibble3log5LevelESsEEC2Ev
-FN:97,_ZN9__gnu_cxx13new_allocatorISt4pairIN6wibble3log5LevelESsEE10deallocateEPS5_j
-FN:107,_ZN9__gnu_cxx13new_allocatorISt4pairIN6wibble3log5LevelESsEE9constructEPS5_RKS5_
-FN:87,_ZN9__gnu_cxx13new_allocatorISt4pairIN6wibble3log5LevelESsEE8allocateEjPKv
-DA:69,1
-DA:71,0
-DA:76,1
-DA:87,3
-DA:89,3
-DA:90,0
-DA:92,3
-DA:97,3
-DA:98,3
-DA:101,9
-DA:102,9
-DA:107,3
-DA:108,3
-BA:89,1
-BA:89,2
-BA:108,2
-BA:108,1
-LF:13
-LH:11
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/fstream
-FN:626,_ZNSt14basic_ofstreamIcSt11char_traitsIcEE4openEPKcSt13_Ios_Openmode
-FN:215,_ZNSt13basic_filebufIcSt11char_traitsIcEED1Ev
-FN:572,_ZNSt14basic_ofstreamIcSt11char_traitsIcEEC1EPKcSt13_Ios_Openmode
-FN:585,_ZNSt14basic_ofstreamIcSt11char_traitsIcEED1Ev
-DA:215,0
-DA:216,0
-DA:572,0
-DA:573,0
-DA:575,0
-DA:576,0
-DA:577,0
-DA:585,0
-DA:586,0
-DA:626,0
-DA:628,0
-DA:629,0
-DA:633,0
-DA:634,0
-BA:216,0
-BA:216,0
-BA:586,0
-BA:586,0
-BA:586,0
-BA:586,0
-BA:586,0
-BA:586,0
-BA:628,0
-BA:628,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:86,_ZNSoC1EPSt15basic_streambufIcSt11char_traitsIcEE
-FN:95,_ZNSoD1Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:195,_ZNSolsEj
-DA:86,0
-DA:87,0
-DA:95,0
-DA:112,0
-DA:117,0
-DA:195,0
-DA:199,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/exception.h
-FN:190,_ZNK6wibble9exception7Generic4typeEv
-FN:137,_ZN6wibble9exception7ContextD2Ev
-FN:187,_ZN6wibble9exception7GenericD2Ev
-FN:395,_ZN6wibble9exception6SystemD1Ev
-FN:193,_ZNK6wibble9exception7Generic4descEv
-FN:213,_ZNK6wibble9exception7Generic4whatEv
-FN:187,_ZN6wibble9exception7GenericD0Ev
-FN:187,_ZN6wibble9exception7GenericD1Ev
-FN:154,_ZNK6wibble9exception7Context13formatContextEv
-FN:205,_ZNK6wibble9exception7Generic8fullInfoEv
-DA:137,0
-DA:154,0
-DA:155,0
-DA:156,0
-DA:157,0
-DA:159,0
-DA:161,0
-DA:162,0
-DA:163,0
-DA:187,0
-DA:190,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:205,0
-DA:206,0
-DA:207,0
-DA:209,0
-DA:210,0
-DA:213,0
-DA:395,0
-BA:156,0
-BA:156,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:207,0
-BA:207,0
-BA:395,0
-BA:395,0
-LF:21
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/sys/childprocess.h
-FN:52,_ZN6wibble3sys12ChildProcessC2Ev
-FN:53,_ZN6wibble3sys12ChildProcessD0Ev
-FN:53,_ZN6wibble3sys12ChildProcessD1Ev
-FN:53,_ZN6wibble3sys12ChildProcessD2Ev
-DA:52,4
-DA:53,4
-BA:53,0
-BA:53,0
-BA:53,0
-BA:53,0
-BA:53,1
-BA:53,2
-LF:2
-LH:2
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/sys/exec.h
-FN:80,_ZN6wibble3sys4ExecC2ERKSs
-FN:43,_ZN6wibble3sys4ExecD2Ev
-FN:97,_ZN6wibble3sys12ShellCommandD0Ev
-FN:97,_ZN6wibble3sys12ShellCommandD1Ev
-FN:99,_ZN6wibble3sys12ShellCommandC1ERKSs
-FN:80,_ZN6wibble3sys4ExecC1ERKSs
-FN:43,_ZN6wibble3sys4ExecD1Ev
-DA:43,2
-DA:80,2
-DA:81,2
-DA:83,2
-DA:84,2
-DA:97,1
-DA:99,1
-DA:101,2
-DA:102,1
-DA:103,1
-DA:104,1
-DA:105,1
-BA:43,1
-BA:43,2
-BA:43,1
-BA:43,2
-BA:97,0
-BA:97,0
-BA:97,1
-BA:97,2
-LF:12
-LH:12
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:13,_ZN8LocationC1ERKS_
-FN:17,_ZN8LocationC1EPKciSs
-FN:52,_ZlsIiER12AssertFailedS1_T_
-FN:52,_ZlsISsER12AssertFailedS1_T_
-FN:52,_ZlsIPKcER12AssertFailedS3_T_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:41,_ZN12AssertFailedD1Ev
-FN:13,_ZN8LocationD1Ev
-FN:59,_Z9assert_fnIbEv8LocationT_
-FN:67,_Z12assert_eq_fnIiiEv8LocationT_T0_
-FN:67,_Z12assert_eq_fnISsPKcEv8LocationT_T0_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:59,0
-DA:61,0
-DA:62,0
-DA:64,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:75,0
-BA:42,0
-BA:42,0
-BA:61,0
-BA:61,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-LF:26
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/sys/childprocess.test.h
-FN:16,_ZN12EndlessChildC1Ev
-FN:27,_ZN9TestChildC1Ev
-FN:27,_ZN9TestChildD0Ev
-FN:27,_ZN9TestChildD1Ev
-FN:16,_ZN12EndlessChildD0Ev
-FN:16,_ZN12EndlessChildD1Ev
-FN:29,_ZN9TestChild4mainEv
-FN:55,_ZN16TestChildprocess4killEv
-FN:36,_Z6suckFdi
-FN:107,_ZN16TestChildprocess12shellCommandEv
-FN:91,_ZN16TestChildprocess8redirectEv
-FN:76,_ZN16TestChildprocess6outputEv
-FN:18,_ZN12EndlessChild4mainEv
-DA:16,2
-DA:18,0
-DA:20,0
-DA:21,0
-DA:27,2
-DA:29,0
-DA:31,0
-DA:32,0
-DA:36,3
-DA:38,3
-DA:40,21
-DA:42,24
-DA:43,24
-DA:44,3
-DA:45,21
-DA:46,0
-DA:47,21
-DA:49,0
-DA:55,1
-DA:56,1
-DA:59,1
-DA:62,1
-DA:65,1
-DA:68,1
-DA:71,1
-DA:72,2
-DA:73,1
-DA:76,1
-DA:77,1
-DA:81,1
-DA:82,1
-DA:85,2
-DA:88,1
-DA:89,1
-DA:91,1
-DA:92,1
-DA:93,2
-DA:97,2
-DA:98,1
-DA:101,2
-DA:104,1
-DA:105,1
-DA:107,1
-DA:108,1
-DA:112,2
-DA:113,1
-DA:116,2
-DA:119,1
-DA:120,1
-BA:16,0
-BA:16,0
-BA:16,1
-BA:16,2
-BA:27,0
-BA:27,0
-BA:27,1
-BA:27,2
-BA:43,2
-BA:43,2
-BA:45,1
-BA:45,2
-LF:49
-LH:41
-end_of_record
-SF:/srv/build/pkg/ept-work/default/wibble/wibble-test-generated-_home_mornfall_dev_pkg_ept-work_wibble_sys_childprocess.cpp
-FN:6,_Z41__static_initialization_and_destruction_0ii
-FN:6,_GLOBAL__I__Z6suckFdi
-FN:3,_Z21run_Childprocess_killv
-FN:6,_Z29run_Childprocess_shellCommandv
-FN:5,_Z25run_Childprocess_redirectv
-FN:4,_Z23run_Childprocess_outputv
-DA:3,1
-DA:4,1
-DA:5,1
-DA:6,4
-BA:6,2
-BA:6,1
-BA:6,2
-BA:6,1
-LF:4
-LH:4
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaIcED1Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaISsED2Ev
-FN:98,_ZNSaISsEC2Ev
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:1534,_ZNKSs5c_strEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:612,_ZNKSs6lengthEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:192,_ZNKSs4_Rep12_M_is_sharedEv
-FN:652,_ZNKSs8capacityEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:501,_ZNSsaSERKSs
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:2188,_ZSteqIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_EPKS3_
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:870,_ZNSs9push_backEc
-FN:791,_ZNSspLEc
-FN:835,_ZNSs6appendEPKc
-FN:2121,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-DA:178,0
-DA:183,0
-DA:184,0
-DA:192,0
-DA:193,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:612,0
-DA:613,0
-DA:652,0
-DA:653,0
-DA:686,0
-DA:687,0
-DA:791,0
-DA:793,0
-DA:794,0
-DA:835,0
-DA:838,0
-DA:870,0
-DA:872,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:877,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2121,0
-DA:2123,0
-DA:2124,0
-DA:2125,0
-DA:2188,0
-DA:2189,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:873,0
-LF:83
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb0EE3__bES7_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb1EE3__bES7_
-FN:268,_ZNSt12__niter_baseISt16ostream_iteratorISscSt11char_traitsIcEELb0EE3__bES3_
-FN:286,_ZNSt12__miter_baseIPSsLb0EE3__bES0_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:268,_ZNSt12__niter_baseIPSsLb0EE3__bES0_
-FN:539,_ZNSt20__copy_move_backwardILb0ELb0ESt26random_access_iterator_tagE13__copy_move_bIPSsS3_EET0_T_S5_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0EPSsS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPSsS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardIPSsS0_ET0_T_S2_S1_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPKSsSt16ostream_iteratorISscSt11char_traitsIcEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPKSsSt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_SD_SC_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET0_T_SD_SC_
-DA:210,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:268,0
-DA:269,0
-DA:276,0
-DA:277,0
-DA:286,0
-DA:287,0
-DA:337,0
-DA:340,0
-DA:342,0
-DA:343,0
-DA:344,0
-DA:346,0
-DA:385,0
-DA:393,0
-DA:396,0
-DA:430,0
-DA:435,0
-DA:456,0
-DA:466,0
-DA:539,0
-DA:542,0
-DA:543,0
-DA:544,0
-DA:579,0
-DA:587,0
-DA:592,0
-DA:597,0
-DA:602,0
-DA:624,0
-DA:636,0
-BA:215,0
-BA:215,0
-BA:340,0
-BA:340,0
-BA:542,0
-BA:542,0
-LF:34
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-DA:87,0
-DA:88,0
-DA:97,0
-DA:101,0
-DA:103,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-BA:101,0
-BA:101,0
-LF:9
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEdeEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEC1ERKS2_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEE4baseEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEC1ERKS1_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-DA:683,0
-DA:695,0
-DA:696,0
-DA:747,0
-DA:748,0
-DA:769,0
-DA:770,0
-LF:7
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,0
-DA:166,0
-DA:167,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyIPSsS2_EET0_T_S4_S3_
-FN:113,_ZSt18uninitialized_copyIPSsS0_ET0_T_S2_S1_
-FN:261,_ZSt22__uninitialized_copy_aIPSsS0_SsET0_T_S2_S1_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPSsS0_SaISsEET0_T_S3_S2_RT1_
-DA:73,0
-DA:75,0
-DA:78,0
-DA:79,0
-DA:81,0
-DA:83,0
-DA:85,0
-DA:86,0
-DA:113,0
-DA:122,0
-DA:261,0
-DA:262,0
-DA:268,0
-DA:272,0
-BA:78,0
-BA:78,0
-BA:79,0
-BA:79,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:404,_ZNKSt6vectorISsSaISsEE3endEv
-FN:386,_ZNKSt6vectorISsSaISsEE5beginEv
-FN:484,_ZNKSt6vectorISsSaISsEE4sizeEv
-FN:101,_ZNKSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:395,_ZNSt6vectorISsSaISsEE3endEv
-FN:526,_ZNKSt6vectorISsSaISsEE5emptyEv
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:84,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseISsSaISsEEC2Ev
-FN:213,_ZNSt6vectorISsSaISsEEC1Ev
-FN:489,_ZNKSt6vectorISsSaISsEE8max_sizeEv
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:1075,_ZNKSt6vectorISsSaISsEE12_M_check_lenEjPKc
-FN:143,_ZNSt12_Vector_baseISsSaISsEE11_M_allocateEj
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-FN:686,_ZNSt6vectorISsSaISsEE9push_backERKSs
-DA:79,0
-DA:84,0
-DA:85,0
-DA:86,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:108,0
-DA:109,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:143,0
-DA:144,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:213,0
-DA:214,0
-DA:299,0
-DA:300,0
-DA:301,0
-DA:386,0
-DA:387,0
-DA:395,0
-DA:396,0
-DA:404,0
-DA:405,0
-DA:484,0
-DA:485,0
-DA:489,0
-DA:490,0
-DA:526,0
-DA:527,0
-DA:686,0
-DA:688,0
-DA:690,0
-DA:691,0
-DA:694,0
-DA:695,0
-DA:1075,0
-DA:1077,0
-DA:1078,0
-DA:1080,0
-DA:1081,0
-BA:144,0
-BA:144,0
-BA:149,0
-BA:149,0
-BA:688,0
-BA:688,0
-BA:1077,0
-BA:1077,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-LF:47
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stream_iterator.h
-FN:181,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERSoPKc
-FN:185,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERKS2_
-FN:202,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEdeEv
-FN:206,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEppEv
-FN:191,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEaSERKSs
-DA:181,0
-DA:182,0
-DA:185,0
-DA:186,0
-DA:191,0
-DA:196,0
-DA:197,0
-DA:198,0
-DA:202,0
-DA:203,0
-DA:206,0
-DA:207,0
-BA:197,0
-BA:197,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/vector.tcc
-FN:283,_ZNSt6vectorISsSaISsEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPSsS1_EERKSs
-DA:283,0
-DA:286,0
-DA:288,0
-DA:291,0
-DA:293,0
-DA:295,0
-DA:299,0
-DA:307,0
-DA:308,0
-DA:309,0
-DA:316,0
-DA:321,0
-DA:323,0
-DA:324,0
-DA:330,0
-DA:332,0
-DA:333,0
-DA:334,0
-DA:336,0
-DA:338,0
-DA:341,0
-DA:342,0
-DA:343,0
-DA:345,0
-BA:286,0
-BA:286,0
-LF:24
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISsE8max_sizeEv
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-FN:107,_ZN9__gnu_cxx13new_allocatorISsE9constructEPSsRKSs
-FN:87,_ZN9__gnu_cxx13new_allocatorISsE8allocateEjPKv
-DA:69,0
-DA:71,0
-DA:76,0
-DA:87,0
-DA:89,0
-DA:90,0
-DA:92,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:107,0
-DA:108,0
-BA:89,0
-BA:89,0
-BA:108,0
-BA:108,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/istream
-FN:585,_ZNSiC2Ev
-FN:105,_ZNSiD2Ev
-FN:804,_ZNSdC2Ev
-FN:801,_ZNSdD2Ev
-DA:105,0
-DA:106,0
-DA:585,0
-DA:586,0
-DA:587,0
-DA:801,0
-DA:804,0
-DA:805,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-DA:95,0
-DA:112,0
-DA:117,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:509,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:536,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-FN:555,_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-DA:509,0
-DA:510,0
-DA:511,0
-DA:536,0
-DA:537,0
-DA:555,0
-DA:556,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-LF:25
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:17,_ZN8LocationC1EPKciSs
-FN:13,_ZN8LocationC1ERKS_
-FN:52,_ZlsIiER12AssertFailedS1_T_
-FN:52,_ZlsISsER12AssertFailedS1_T_
-FN:52,_ZlsIPKcER12AssertFailedS3_T_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:41,_ZN12AssertFailedD1Ev
-FN:13,_ZN8LocationD1Ev
-FN:67,_Z12assert_eq_fnIiiEv8LocationT_T0_
-FN:67,_Z12assert_eq_fnISsPKcEv8LocationT_T0_
-FN:52,_ZlsIxER12AssertFailedS1_T_
-FN:67,_Z12assert_eq_fnIxiEv8LocationT_T0_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:67,5
-DA:69,5
-DA:70,0
-DA:71,0
-DA:75,5
-BA:42,0
-BA:42,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,1
-BA:69,2
-LF:22
-LH:3
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/grcal/grcal.test.h
-FN:31,_ZN12_GLOBAL__N_1L7normalNERiS0_i
-FN:63,_ZN12_GLOBAL__N_113TestGrcalDate4fillEPiiiiiii
-FN:230,_ZN12_GLOBAL__N_113TestGrcalTime4fillEPiiii
-FN:46,_ZN12_GLOBAL__N_115assert_nn_eq_fnE8Locationiiiii
-FN:249,_ZN12_GLOBAL__N_113TestGrcalTime12tostring_secEv
-FN:73,_ZN12_GLOBAL__N_113TestGrcalDate7normalnEv
-FN:237,_ZN12_GLOBAL__N_113TestGrcalTime8tostringEv
-FN:204,_ZN12_GLOBAL__N_113TestGrcalDate8durationEv
-FN:124,_ZN12_GLOBAL__N_113TestGrcalDate8tostringEv
-FN:14,_ZN12_GLOBAL__N_115assert_dt_eq_fnE8LocationPKiiiiiii
-FN:188,_ZN12_GLOBAL__N_113TestGrcalDate10upperboundEv
-FN:153,_ZN12_GLOBAL__N_113TestGrcalDate9normaliseEv
-FN:141,_ZN12_GLOBAL__N_113TestGrcalDate10lowerboundEv
-FN:116,_ZN12_GLOBAL__N_113TestGrcalDate6easterEv
-FN:108,_ZN12_GLOBAL__N_113TestGrcalDate10daysinyearEv
-FN:85,_ZN12_GLOBAL__N_113TestGrcalDate11daysinmonthEv
-DA:14,11
-DA:16,11
-DA:17,11
-DA:18,11
-DA:20,11
-DA:21,0
-DA:24,0
-DA:25,11
-DA:26,11
-DA:31,8
-DA:33,8
-DA:35,3
-DA:36,3
-DA:37,3
-DA:38,3
-DA:40,5
-DA:41,5
-DA:43,8
-DA:46,8
-DA:48,8
-DA:49,8
-DA:50,8
-DA:52,8
-DA:53,8
-DA:55,0
-DA:58,0
-DA:63,22
-DA:65,22
-DA:66,22
-DA:67,22
-DA:68,22
-DA:69,22
-DA:70,22
-DA:71,22
-DA:73,1
-DA:75,1
-DA:76,2
-DA:77,2
-DA:78,2
-DA:79,2
-DA:80,2
-DA:81,2
-DA:82,2
-DA:83,1
-DA:85,1
-DA:88,1
-DA:90,2
-DA:91,2
-DA:92,2
-DA:94,2
-DA:95,2
-DA:96,2
-DA:97,2
-DA:99,2
-DA:100,2
-DA:101,2
-DA:102,2
-DA:103,2
-DA:104,2
-DA:105,2
-DA:106,1
-DA:108,1
-DA:110,1
-DA:111,2
-DA:112,2
-DA:113,2
-DA:114,1
-DA:116,1
-DA:119,1
-DA:120,1
-DA:121,2
-DA:122,1
-DA:124,1
-DA:127,1
-DA:128,1
-DA:129,1
-DA:130,2
-DA:131,1
-DA:132,2
-DA:133,1
-DA:134,2
-DA:135,1
-DA:136,2
-DA:137,1
-DA:138,2
-DA:139,1
-DA:141,1
-DA:145,1
-DA:146,1
-DA:147,1
-DA:149,1
-DA:150,2
-DA:151,1
-DA:153,1
-DA:156,1
-DA:157,1
-DA:158,1
-DA:160,1
-DA:161,1
-DA:162,1
-DA:163,2
-DA:165,1
-DA:166,1
-DA:167,1
-DA:168,2
-DA:170,1
-DA:171,1
-DA:172,1
-DA:173,2
-DA:175,1
-DA:176,1
-DA:177,1
-DA:178,1
-DA:179,2
-DA:181,1
-DA:182,1
-DA:183,1
-DA:184,1
-DA:185,2
-DA:186,1
-DA:188,1
-DA:192,1
-DA:193,1
-DA:194,1
-DA:196,1
-DA:197,2
-DA:199,1
-DA:200,1
-DA:201,2
-DA:202,1
-DA:204,1
-DA:209,1
-DA:210,1
-DA:211,1
-DA:214,1
-DA:215,2
-DA:217,1
-DA:218,2
-DA:220,1
-DA:221,2
-DA:223,1
-DA:224,1
-DA:225,2
-DA:226,1
-DA:230,4
-DA:232,4
-DA:233,4
-DA:234,4
-DA:235,4
-DA:237,1
-DA:240,1
-DA:241,1
-DA:242,1
-DA:243,2
-DA:244,1
-DA:245,2
-DA:246,1
-DA:247,2
-DA:248,1
-DA:249,1
-DA:251,1
-DA:252,2
-DA:253,1
-BA:20,1
-BA:20,2
-BA:33,2
-BA:33,2
-BA:36,2
-BA:36,2
-BA:52,2
-BA:52,1
-BA:52,1
-BA:52,2
-LF:163
-LH:159
-end_of_record
-SF:/srv/build/pkg/ept-work/default/wibble/wibble-test-generated-_home_mornfall_dev_pkg_ept-work_wibble_grcal_grcal.cpp
-FN:13,_Z41__static_initialization_and_destruction_0ii
-FN:13,_GLOBAL__I__Z21run_GrcalDate_normalnv
-FN:13,_Z26run_GrcalTime_tostring_secv
-FN:3,_Z21run_GrcalDate_normalnv
-FN:12,_Z22run_GrcalTime_tostringv
-FN:11,_Z22run_GrcalDate_durationv
-FN:7,_Z22run_GrcalDate_tostringv
-FN:10,_Z24run_GrcalDate_upperboundv
-FN:9,_Z23run_GrcalDate_normalisev
-FN:8,_Z24run_GrcalDate_lowerboundv
-FN:6,_Z20run_GrcalDate_easterv
-FN:5,_Z24run_GrcalDate_daysinyearv
-FN:4,_Z25run_GrcalDate_daysinmonthv
-DA:3,1
-DA:4,1
-DA:5,1
-DA:6,1
-DA:7,1
-DA:8,1
-DA:9,1
-DA:10,1
-DA:11,1
-DA:12,1
-DA:13,4
-BA:13,2
-BA:13,1
-BA:13,2
-BA:13,1
-LF:11
-LH:11
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:2188,_ZSteqIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_EPKS3_
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-FN:2162,_ZSteqIcEN9__gnu_cxx11__enable_ifIXsrSt9__is_charIT_E7__valueEbE6__typeERKSbIS3_St11char_traitsIS3_ESaIS3_EESC_
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2162,0
-DA:2165,0
-DA:2188,0
-DA:2189,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-LF:55
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-DA:245,0
-DA:246,0
-DA:257,0
-DA:258,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:166,0
-DA:167,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-DA:69,0
-DA:71,0
-DA:76,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:204,_ZNSolsEx
-DA:95,0
-DA:112,0
-DA:117,0
-DA:204,0
-DA:205,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/singleton.h
-FN:83,_ZNK6wibble9SingletonIiE4sizeEv
-FN:74,_ZNK6wibble9SingletonIiE8iteratoreqERKS2_
-FN:75,_ZNK6wibble9SingletonIiE8iteratorneERKS2_
-FN:71,_ZN6wibble9SingletonIiE8iteratordeEv
-FN:73,_ZN6wibble9SingletonIiE8iteratorppEv
-FN:80,_ZN6wibble9SingletonIiEC1ERKi
-FN:92,_ZN6wibble9singletonIiEENS_9SingletonIT_EERKS2_
-FN:66,_ZN6wibble9SingletonIiE8iteratorC1EPi
-FN:85,_ZN6wibble9SingletonIiE5beginEv
-FN:69,_ZN6wibble9SingletonIiE8iteratorC1Ev
-FN:86,_ZN6wibble9SingletonIiE3endEv
-DA:66,1
-DA:69,4
-DA:71,1
-DA:73,1
-DA:74,2
-DA:75,2
-DA:80,5
-DA:83,1
-DA:85,1
-DA:86,4
-DA:92,1
-DA:94,1
-LF:12
-LH:12
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:13,_ZN8LocationC1ERKS_
-FN:17,_ZN8LocationC1EPKciSs
-FN:52,_ZlsIiER12AssertFailedS1_T_
-FN:52,_ZlsIPKcER12AssertFailedS3_T_
-FN:52,_ZlsIjER12AssertFailedS1_T_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:41,_ZN12AssertFailedD1Ev
-FN:13,_ZN8LocationD1Ev
-FN:67,_Z12assert_eq_fnIjjEv8LocationT_T0_
-FN:67,_Z12assert_eq_fnIiiEv8LocationT_T0_
-FN:59,_Z9assert_fnIbEv8LocationT_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:59,0
-DA:61,0
-DA:62,0
-DA:64,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:75,0
-BA:42,0
-BA:42,0
-BA:61,0
-BA:61,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-LF:26
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/singleton.test.h
-FN:14,_ZN12_GLOBAL__N_113TestSingleton6simpleEv
-DA:14,1
-DA:15,1
-DA:17,1
-DA:19,1
-DA:20,2
-DA:21,2
-DA:22,2
-DA:24,1
-DA:25,2
-DA:26,2
-DA:27,1
-LF:11
-LH:11
-end_of_record
-SF:/srv/build/pkg/ept-work/default/wibble/wibble-test-generated-_home_mornfall_dev_pkg_ept-work_wibble_singleton.cpp
-FN:3,_Z41__static_initialization_and_destruction_0ii
-FN:3,_GLOBAL__I__Z20run_Singleton_simplev
-FN:3,_Z20run_Singleton_simplev
-DA:3,4
-BA:3,2
-BA:3,1
-BA:3,2
-BA:3,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaIcED1Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-LF:51
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt20forward_iterator_tagivPiRiEC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,5
-DA:166,0
-DA:167,0
-LF:3
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-DA:69,0
-DA:71,0
-DA:76,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:195,_ZNSolsEj
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-DA:95,0
-DA:112,0
-DA:117,0
-DA:195,0
-DA:199,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/exception.h
-FN:190,_ZNK6wibble9exception7Generic4typeEv
-FN:137,_ZN6wibble9exception7ContextD2Ev
-FN:187,_ZN6wibble9exception7GenericD2Ev
-FN:395,_ZN6wibble9exception6SystemD1Ev
-FN:193,_ZNK6wibble9exception7Generic4descEv
-FN:213,_ZNK6wibble9exception7Generic4whatEv
-FN:187,_ZN6wibble9exception7GenericD0Ev
-FN:187,_ZN6wibble9exception7GenericD1Ev
-FN:154,_ZNK6wibble9exception7Context13formatContextEv
-FN:205,_ZNK6wibble9exception7Generic8fullInfoEv
-DA:137,0
-DA:154,0
-DA:155,0
-DA:156,0
-DA:157,0
-DA:159,0
-DA:161,0
-DA:162,0
-DA:163,0
-DA:187,0
-DA:190,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:205,0
-DA:206,0
-DA:207,0
-DA:209,0
-DA:210,0
-DA:213,0
-DA:395,0
-BA:156,0
-BA:156,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:207,0
-BA:207,0
-BA:395,0
-BA:395,0
-LF:21
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/sys/pipe.h
-FN:42,_ZN6wibble3sys4Pipe3eofEv
-FN:32,_ZN6wibble3sys4PipeC1Ev
-FN:19,_ZN6wibble3sys4PipeD1Ev
-FN:25,_ZN6wibble3sys4PipeC1Ei
-FN:19,_ZN6wibble3sys4PipeaSERKS1_
-FN:46,_ZN6wibble3sys4Pipe8readMoreEv
-FN:60,_ZN6wibble3sys4Pipe8nextLineEv
-FN:75,_ZN6wibble3sys4Pipe16nextLineBlockingEv
-DA:19,4
-DA:25,2
-DA:27,2
-DA:28,0
-DA:29,2
-DA:30,0
-DA:31,0
-DA:32,2
-DA:42,1310
-DA:43,1310
-DA:46,953
-DA:48,953
-DA:49,953
-DA:50,0
-DA:51,953
-DA:52,456
-DA:53,497
-DA:54,0
-DA:56,497
-DA:57,497
-DA:60,1007
-DA:62,1007
-DA:63,1504
-DA:65,1007
-DA:66,1007
-DA:67,456
-DA:69,551
-DA:70,551
-DA:71,551
-DA:72,551
-DA:75,551
-DA:77,551
-DA:78,551
-DA:79,1558
-DA:80,1007
-DA:81,1007
-DA:82,551
-DA:83,456
-DA:84,456
-DA:86,0
-BA:27,2
-BA:27,1
-BA:29,1
-BA:29,2
-BA:49,2
-BA:49,2
-BA:49,1
-BA:49,2
-BA:51,2
-BA:51,2
-BA:53,1
-BA:53,2
-BA:63,2
-BA:63,2
-BA:63,2
-BA:63,2
-BA:63,2
-BA:63,2
-BA:66,2
-BA:66,2
-BA:77,2
-BA:77,2
-BA:79,2
-BA:79,1
-BA:81,2
-BA:81,2
-LF:40
-LH:34
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test-main.h
-FN:31,_ZN4MainC1Ev
-FN:9,_ZN4MainD1Ev
-FN:63,_ZN4Main8testDiedEv
-FN:38,_ZN4Main5childEv
-FN:86,_ZN4Main13processStatusESs
-FN:139,_ZN4Main6parentEv
-FN:163,_ZN4Main4mainEiPPc
-FN:188,main
-DA:9,0
-DA:31,1
-DA:32,1
-DA:33,1
-DA:34,1
-DA:35,1
-DA:36,1
-DA:38,1
-DA:39,1
-DA:40,1
-DA:41,1
-DA:42,1
-DA:43,1
-DA:44,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:50,0
-DA:51,0
-DA:52,0
-DA:54,0
-DA:56,1
-DA:57,1
-DA:59,1
-DA:60,1
-DA:63,0
-DA:67,0
-DA:68,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:73,0
-DA:74,0
-DA:75,0
-DA:76,0
-DA:77,0
-DA:78,0
-DA:80,0
-DA:81,0
-DA:82,0
-DA:83,0
-DA:86,303
-DA:87,303
-DA:88,1
-DA:89,1
-DA:90,2
-DA:91,2
-DA:94,1
-DA:95,1
-DA:98,302
-DA:101,124
-DA:102,124
-DA:103,124
-DA:104,124
-DA:107,302
-DA:108,54
-DA:110,27
-DA:111,27
-DA:112,27
-DA:113,27
-DA:114,27
-DA:115,27
-DA:117,54
-DA:118,27
-DA:120,27
-DA:121,27
-DA:125,302
-DA:126,248
-DA:127,124
-DA:128,124
-DA:129,124
-DA:131,248
-DA:132,124
-DA:133,124
-DA:134,124
-DA:137,302
-DA:139,1
-DA:140,1
-DA:141,1
-DA:142,1
-DA:143,1
-DA:144,1
-DA:146,302
-DA:147,303
-DA:148,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:153,0
-DA:154,0
-DA:158,303
-DA:159,303
-DA:160,0
-DA:163,1
-DA:165,1
-DA:166,1
-DA:168,1
-DA:169,1
-DA:171,0
-DA:172,1
-DA:173,0
-DA:174,1
-DA:175,0
-DA:176,1
-DA:177,2
-DA:178,0
-DA:179,2
-DA:180,1
-DA:182,1
-DA:188,1
-DA:189,1
-BA:43,1
-BA:43,2
-BA:45,0
-BA:45,0
-BA:50,0
-BA:50,0
-BA:51,0
-BA:51,0
-BA:56,2
-BA:56,1
-BA:67,0
-BA:67,0
-BA:68,0
-BA:68,0
-BA:70,0
-BA:70,0
-BA:74,0
-BA:74,0
-BA:76,0
-BA:76,0
-BA:87,2
-BA:87,2
-BA:98,2
-BA:98,2
-BA:107,2
-BA:107,2
-BA:108,2
-BA:108,2
-BA:117,2
-BA:117,2
-BA:118,2
-BA:118,1
-BA:125,2
-BA:125,2
-BA:126,2
-BA:126,2
-BA:131,2
-BA:131,2
-BA:147,1
-BA:147,2
-BA:149,0
-BA:149,0
-BA:172,1
-BA:172,2
-BA:174,1
-BA:174,2
-BA:177,1
-BA:177,2
-BA:179,2
-BA:179,2
-LF:111
-LH:75
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test-runner.h
-FN:17,_ZN6RunAllC1Ev
-FN:17,_ZN6RunAllD1Ev
-FN:23,_ZN6RunAll9findSuiteESs
-FN:30,_ZN6RunAll10waitForAckEv
-FN:53,_ZN6RunAll7runTestER8RunSuitei
-FN:35,_ZN6RunAll8runSuiteER8RunSuiteiii
-FN:66,_ZN6RunAll7runFromEii
-DA:17,1
-DA:23,0
-DA:24,0
-DA:25,0
-DA:26,0
-DA:27,0
-DA:30,248
-DA:31,248
-DA:32,248
-DA:33,248
-DA:35,27
-DA:37,27
-DA:38,151
-DA:40,124
-DA:41,124
-DA:42,124
-DA:43,124
-DA:44,124
-DA:45,124
-DA:46,124
-DA:50,27
-DA:51,27
-DA:53,0
-DA:55,0
-DA:56,0
-DA:57,0
-DA:58,0
-DA:59,0
-DA:60,0
-DA:61,0
-DA:62,0
-DA:63,0
-DA:64,0
-DA:66,1
-DA:68,56
-DA:69,27
-DA:70,27
-DA:71,27
-DA:73,1
-BA:24,0
-BA:24,0
-BA:25,0
-BA:25,0
-BA:38,2
-BA:38,2
-BA:68,2
-BA:68,2
-LF:39
-LH:23
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:13,_ZN8LocationD1Ev
-FN:52,_ZlsISsER12AssertFailedS1_T_
-FN:17,_ZN8LocationC1EPKciSs
-FN:13,_ZN8LocationC1ERKS_
-FN:52,_ZlsIPKcER12AssertFailedS3_T_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:52,_ZlsIiER12AssertFailedS1_T_
-FN:41,_ZN12AssertFailedD1Ev
-FN:67,_Z12assert_eq_fnISsSsEv8LocationT_T0_
-FN:59,_Z9assert_fnIbEv8LocationT_
-FN:67,_Z12assert_eq_fnIiiEv8LocationT_T0_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:59,0
-DA:61,0
-DA:62,0
-DA:64,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:75,0
-BA:42,0
-BA:42,0
-BA:61,0
-BA:61,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-LF:26
-LH:0
-end_of_record
-SF:/srv/build/pkg/ept-work/default/wibble/wibble-test-generated-main.cpp
-FN:336,_Z41__static_initialization_and_destruction_0ii
-FN:336,_GLOBAL__I_run_Tests
-DA:336,3
-BA:336,2
-BA:336,1
-BA:336,2
-BA:336,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC2Ev
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaIcED1Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaISsED2Ev
-FN:106,_ZNSaIPcED1Ev
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-FN:104,_ZNSaIPcEC1IcEERKSaIT_E
-DA:98,0
-DA:100,0
-DA:101,0
-DA:104,6
-DA:106,6
-DA:118,0
-DA:119,0
-LF:7
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:1534,_ZNKSs5c_strEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:612,_ZNKSs6lengthEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:188,_ZNKSs4_Rep12_M_is_leakedEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:369,_ZNSs13_S_copy_charsISt15_Deque_iteratorIcRcPcEEEvS2_T_S4_
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:1462,_ZNSs16_S_construct_auxISt15_Deque_iteratorIcRcPcEEES2_T_S4_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructISt15_Deque_iteratorIcRcPcEEES2_T_S4_RKSaIcE
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:376,_ZNSs13_S_copy_charsEPcN9__gnu_cxx17__normal_iteratorIS_SsEES2_
-FN:1462,_ZNSs16_S_construct_auxIN9__gnu_cxx17__normal_iteratorIPcSsEEEES2_T_S4_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIN9__gnu_cxx17__normal_iteratorIPcSsEEEES2_T_S4_RKSaIcE
-FN:835,_ZNSs6appendEPKc
-FN:2121,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-FN:501,_ZNSsaSERKSs
-FN:2176,_ZSteqIcSt11char_traitsIcESaIcEEbPKT_RKSbIS3_T0_T1_E
-FN:2188,_ZSteqIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_EPKS3_
-FN:2162,_ZSteqIcEN9__gnu_cxx11__enable_ifIXsrSt9__is_charIT_E7__valueEbE6__typeERKSbIS3_St11char_traitsIS3_ESaIS3_EESC_
-FN:299,_ZNSs7_M_leakEv
-FN:718,_ZNSsixEj
-FN:551,_ZNSs3endEv
-FN:532,_ZNSs5beginEv
-DA:178,0
-DA:183,0
-DA:184,0
-DA:188,0
-DA:189,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:299,0
-DA:301,0
-DA:302,0
-DA:303,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:369,551
-DA:371,6720
-DA:372,6169
-DA:373,551
-DA:376,0
-DA:377,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:532,0
-DA:534,0
-DA:535,0
-DA:551,0
-DA:553,0
-DA:554,0
-DA:606,0
-DA:607,0
-DA:612,0
-DA:613,0
-DA:686,0
-DA:687,0
-DA:718,0
-DA:724,0
-DA:725,0
-DA:835,0
-DA:838,0
-DA:1462,702
-DA:1465,702
-DA:1478,702
-DA:1481,702
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2121,0
-DA:2123,0
-DA:2124,0
-DA:2125,0
-DA:2162,0
-DA:2165,0
-DA:2176,0
-DA:2177,0
-DA:2188,0
-DA:2189,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:301,0
-BA:301,0
-BA:341,0
-BA:341,0
-BA:371,2
-BA:371,2
-BA:2165,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-LF:94
-LH:8
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructISt15_Deque_iteratorIcRcPcEEES2_T_S4_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1ISt15_Deque_iteratorIcRcPcEEET_S4_RKSaIcE
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-FN:130,_ZNSs12_S_constructIN9__gnu_cxx17__normal_iteratorIPcSsEEEES2_T_S4_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IN9__gnu_cxx17__normal_iteratorIPcSsEEEET_S4_RKSaIcE
-DA:130,702
-DA:133,702
-DA:134,0
-DA:137,702
-DA:139,0
-DA:142,702
-DA:144,702
-DA:146,702
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,702
-DA:153,702
-DA:234,702
-DA:235,702
-DA:236,702
-BA:133,1
-BA:133,2
-BA:133,0
-BA:133,0
-BA:133,1
-BA:133,2
-BA:133,1
-BA:133,2
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,1
-BA:133,2
-BA:133,0
-BA:133,0
-BA:133,1
-BA:133,2
-BA:133,0
-BA:133,0
-BA:133,1
-BA:133,2
-BA:137,1
-BA:137,2
-BA:137,0
-BA:137,0
-BA:137,1
-BA:137,2
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,1
-BA:137,2
-BA:137,0
-BA:137,0
-BA:137,1
-BA:137,2
-LF:16
-LH:11
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-DA:245,6169
-DA:246,6169
-DA:257,0
-DA:258,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:8
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/deque.tcc
-FN:159,_ZNSt5dequeIcSaIcEE5eraseESt15_Deque_iteratorIcRcPcES5_
-FN:766,_ZNSt5dequeIcSaIcEE17_M_reallocate_mapEjb
-FN:716,_ZNSt5dequeIcSaIcEE24_M_new_elements_at_frontEj
-FN:741,_ZNSt5dequeIcSaIcEE23_M_new_elements_at_backEj
-FN:608,_ZNSt5dequeIcSaIcEE13_M_insert_auxISt15_Deque_iteratorIcRKcPS4_EEEvS3_IcRcPcET_SB_j
-FN:435,_ZNSt5dequeIcSaIcEE19_M_range_insert_auxISt15_Deque_iteratorIcRKcPS4_EEEvS3_IcRcPcET_SB_St20forward_iterator_tag
-FN:70,_ZNSt5dequeIcSaIcEEaSERKS1_
-FN:335,_ZNSt5dequeIcSaIcEE16_M_push_back_auxERKc
-DA:70,2
-DA:72,2
-DA:73,2
-DA:75,2
-DA:76,2
-DA:80,0
-DA:81,0
-DA:82,0
-DA:85,2
-DA:159,551
-DA:161,551
-DA:163,497
-DA:164,497
-DA:168,54
-DA:169,54
-DA:170,54
-DA:172,54
-DA:173,0
-DA:174,54
-DA:178,0
-DA:179,0
-DA:180,0
-DA:182,54
-DA:335,2
-DA:338,2
-DA:339,2
-DA:346,2
-DA:348,2
-DA:350,2
-DA:352,0
-DA:354,0
-DA:355,0
-DA:357,2
-DA:435,0
-DA:437,0
-DA:438,0
-DA:440,0
-DA:443,0
-DA:445,0
-DA:447,0
-DA:449,0
-DA:451,0
-DA:454,0
-DA:456,0
-DA:459,0
-DA:462,0
-DA:464,0
-DA:466,0
-DA:468,0
-DA:472,0
-DA:473,0
-DA:608,0
-DA:610,0
-DA:611,0
-DA:612,0
-DA:614,0
-DA:615,0
-DA:616,0
-DA:619,0
-DA:622,0
-DA:623,0
-DA:626,0
-DA:627,0
-DA:628,0
-DA:632,0
-DA:633,0
-DA:634,0
-DA:638,0
-DA:639,0
-DA:642,0
-DA:644,0
-DA:646,0
-DA:651,0
-DA:652,0
-DA:654,0
-DA:655,0
-DA:658,0
-DA:661,0
-DA:662,0
-DA:666,0
-DA:667,0
-DA:668,0
-DA:672,0
-DA:673,0
-DA:674,0
-DA:678,0
-DA:679,0
-DA:682,0
-DA:684,0
-DA:686,0
-DA:689,0
-DA:716,0
-DA:718,0
-DA:719,0
-DA:722,0
-DA:723,0
-DA:727,0
-DA:728,0
-DA:730,0
-DA:732,0
-DA:733,0
-DA:734,0
-DA:736,0
-DA:741,0
-DA:743,0
-DA:744,0
-DA:747,0
-DA:748,0
-DA:752,0
-DA:753,0
-DA:755,0
-DA:757,0
-DA:758,0
-DA:759,0
-DA:761,0
-DA:766,0
-DA:769,0
-DA:770,0
-DA:773,0
-DA:775,0
-DA:778,0
-DA:779,0
-DA:783,0
-DA:791,0
-DA:793,0
-DA:794,0
-DA:796,0
-DA:799,0
-DA:801,0
-DA:802,0
-DA:805,0
-DA:806,0
-DA:807,0
-BA:73,2
-BA:73,1
-BA:75,2
-BA:75,1
-BA:161,2
-BA:161,1
-BA:161,2
-BA:161,2
-BA:161,2
-BA:161,2
-BA:170,2
-BA:170,1
-BA:172,1
-BA:172,2
-BA:178,0
-BA:178,0
-BA:438,0
-BA:438,0
-BA:454,0
-BA:454,0
-BA:612,0
-BA:612,0
-BA:619,0
-BA:619,0
-BA:658,0
-BA:658,0
-BA:718,0
-BA:718,0
-BA:727,0
-BA:727,0
-BA:732,0
-BA:732,0
-BA:743,0
-BA:743,0
-BA:752,0
-BA:752,0
-BA:757,0
-BA:757,0
-BA:773,0
-BA:773,0
-BA:775,0
-BA:775,0
-BA:778,0
-BA:778,0
-BA:794,0
-BA:794,0
-LF:133
-LH:23
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algo.h
-FN:171,_ZSt6__findISt15_Deque_iteratorIcRcPcEcET_S4_S4_RKT0_St26random_access_iterator_tag
-FN:3806,_ZSt4findISt15_Deque_iteratorIcRcPcEcET_S4_S4_RKT0_
-DA:171,2014
-DA:174,2014
-DA:176,3504
-DA:178,1899
-DA:179,20
-DA:180,1879
-DA:182,1879
-DA:183,9
-DA:184,1870
-DA:186,1870
-DA:187,31
-DA:188,1839
-DA:190,1839
-DA:191,349
-DA:192,1490
-DA:195,1605
-DA:198,56
-DA:199,0
-DA:200,56
-DA:202,134
-DA:203,0
-DA:204,134
-DA:206,196
-DA:207,196
-DA:208,0
-DA:211,1409
-DA:3806,2014
-DA:3814,2014
-BA:176,2
-BA:176,2
-BA:178,2
-BA:178,2
-BA:182,2
-BA:182,2
-BA:186,2
-BA:186,2
-BA:190,2
-BA:190,2
-BA:195,2
-BA:195,2
-BA:195,2
-BA:195,2
-BA:198,1
-BA:198,2
-BA:202,1
-BA:202,2
-BA:206,2
-BA:206,1
-LF:28
-LH:25
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb0EE3__bES7_
-FN:286,_ZNSt12__miter_baseIPcLb0EE3__bES0_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb1EE3__bES7_
-FN:268,_ZNSt12__niter_baseISt16ostream_iteratorISscSt11char_traitsIcEELb0EE3__bES3_
-FN:268,_ZNSt12__niter_baseIPcLb0EE3__bES0_
-FN:268,_ZNSt12__niter_baseISt20back_insert_iteratorISt5dequeIcSaIcEEELb0EE3__bES4_
-FN:286,_ZNSt12__miter_baseISt15_Deque_iteratorIcRcPcELb0EE3__bES3_
-FN:286,_ZNSt12__miter_baseISt15_Deque_iteratorIcRKcPS1_ELb0EE3__bES4_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:268,_ZNSt12__niter_baseISt15_Deque_iteratorIcRcPcELb0EE3__bES3_
-FN:268,_ZNSt12__niter_baseISt15_Deque_iteratorIcRKcPS1_ELb0EE3__bES4_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mISt15_Deque_iteratorIcRcPcES6_EET0_T_S8_S7_
-FN:385,_ZSt13__copy_move_aILb0ESt15_Deque_iteratorIcRcPcES3_ET1_T0_S5_S4_
-FN:430,_ZSt14__copy_move_a2ILb0ESt15_Deque_iteratorIcRcPcES3_ET1_T0_S5_S4_
-FN:456,_ZSt4copyISt15_Deque_iteratorIcRcPcES3_ET0_T_S5_S4_
-FN:539,_ZNSt20__copy_move_backwardILb0ELb0ESt26random_access_iterator_tagE13__copy_move_bISt15_Deque_iteratorIcRcPcES6_EET0_T_S8_S7_
-FN:579,_ZSt22__copy_move_backward_aILb0ESt15_Deque_iteratorIcRcPcES3_ET1_T0_S5_S4_
-FN:597,_ZSt23__copy_move_backward_a2ILb0ESt15_Deque_iteratorIcRcPcES3_ET1_T0_S5_S4_
-FN:624,_ZSt13copy_backwardISt15_Deque_iteratorIcRcPcES3_ET0_T_S5_S4_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mISt15_Deque_iteratorIcRKcPS4_ES3_IcRcPcEEET0_T_SC_SB_
-FN:385,_ZSt13__copy_move_aILb0ESt15_Deque_iteratorIcRKcPS1_ES0_IcRcPcEET1_T0_S9_S8_
-FN:430,_ZSt14__copy_move_a2ILb0ESt15_Deque_iteratorIcRKcPS1_ES0_IcRcPcEET1_T0_S9_S8_
-FN:456,_ZSt4copyISt15_Deque_iteratorIcRKcPS1_ES0_IcRcPcEET0_T_S9_S8_
-FN:286,_ZNSt12__miter_baseIPPcLb0EE3__bES1_
-FN:268,_ZNSt12__niter_baseIPPcLb0EE3__bES1_
-FN:569,_ZNSt20__copy_move_backwardILb0ELb1ESt26random_access_iterator_tagE13__copy_move_bIPcEEPT_PKS4_S7_S5_
-FN:579,_ZSt22__copy_move_backward_aILb0EPPcS1_ET1_T0_S3_S2_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPPcS1_ET1_T0_S3_S2_
-FN:624,_ZSt13copy_backwardIPPcS1_ET0_T_S3_S2_
-FN:375,_ZNSt11__copy_moveILb0ELb1ESt26random_access_iterator_tagE8__copy_mIPcEEPT_PKS4_S7_S5_
-FN:385,_ZSt13__copy_move_aILb0EPPcS1_ET1_T0_S3_S2_
-FN:430,_ZSt14__copy_move_a2ILb0EPPcS1_ET1_T0_S3_S2_
-FN:456,_ZSt4copyIPPcS1_ET0_T_S3_S2_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPcSt20back_insert_iteratorISt5dequeIcSaIcEEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPcSt20back_insert_iteratorISt5dequeIcSaIcEEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EPcSt20back_insert_iteratorISt5dequeIcSaIcEEEET1_T0_S7_S6_
-FN:456,_ZSt4copyIPcSt20back_insert_iteratorISt5dequeIcSaIcEEEET0_T_S7_S6_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPKSsSt16ostream_iteratorISscSt11char_traitsIcEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPKSsSt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_SD_SC_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET0_T_SD_SC_
-DA:210,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:268,503
-DA:269,503
-DA:276,0
-DA:277,0
-DA:286,4
-DA:287,4
-DA:337,499
-DA:340,7219
-DA:342,6720
-DA:343,6720
-DA:344,6720
-DA:346,499
-DA:375,0
-DA:377,0
-DA:379,0
-DA:385,499
-DA:393,499
-DA:396,499
-DA:430,499
-DA:435,499
-DA:456,499
-DA:466,499
-DA:539,0
-DA:542,0
-DA:543,0
-DA:544,0
-DA:569,0
-DA:571,0
-DA:572,0
-DA:573,0
-DA:579,0
-DA:587,0
-DA:592,0
-DA:597,0
-DA:602,0
-DA:624,0
-DA:636,0
-BA:215,0
-BA:215,0
-BA:340,0
-BA:340,0
-BA:340,1
-BA:340,2
-BA:340,2
-BA:340,2
-BA:340,0
-BA:340,0
-BA:542,0
-BA:542,0
-LF:41
-LH:17
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:97,_ZSt8_DestroyISt15_Deque_iteratorIcRcPcEEvT_S4_
-FN:126,_ZSt8_DestroyISt15_Deque_iteratorIcRcPcEcEvT_S4_RSaIT0_E
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-DA:87,0
-DA:88,0
-DA:97,0
-DA:101,0
-DA:103,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-BA:101,0
-BA:101,0
-LF:9
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_deque.h
-FN:82,_ZSt16__deque_buf_sizej
-FN:127,_ZNSt15_Deque_iteratorIcRcPcEC1ERKS2_
-FN:868,_ZNSt5dequeIcSaIcEE3endEv
-FN:851,_ZNSt5dequeIcSaIcEE5beginEv
-FN:240,_ZSteqIcRcPcEbRKSt15_Deque_iteratorIT_T0_T1_ES8_
-FN:416,_ZNSt11_Deque_baseIcSaIcEE11_Deque_implD1Ev
-FN:434,_ZNSt11_Deque_baseIcSaIcEE19_M_get_Tp_allocatorEv
-FN:1601,_ZNSt5dequeIcSaIcEE15_M_destroy_dataESt15_Deque_iteratorIcRcPcES5_RKS0_
-FN:253,_ZStneIcRcPcEbRKSt15_Deque_iteratorIT_T0_T1_ES8_
-FN:132,_ZNKSt15_Deque_iteratorIcRcPcEdeEv
-FN:103,_ZNSt15_Deque_iteratorIcRcPcE14_S_buffer_sizeEv
-FN:226,_ZNSt15_Deque_iteratorIcRcPcE11_M_set_nodeEPS1_
-FN:140,_ZNSt15_Deque_iteratorIcRcPcEppEv
-FN:324,_ZStmiIcRcPcENSt15_Deque_iteratorIT_T0_T1_E15difference_typeERKS6_S9_
-FN:956,_ZNKSt5dequeIcSaIcEE4sizeEv
-FN:180,_ZNSt15_Deque_iteratorIcRcPcEpLEi
-FN:199,_ZNKSt15_Deque_iteratorIcRcPcEplEi
-FN:206,_ZNSt15_Deque_iteratorIcRcPcEmIEi
-FN:210,_ZNKSt15_Deque_iteratorIcRcPcEmiEi
-FN:127,_ZNSt15_Deque_iteratorIcRKcPS0_EC1ERKS_IcRcPcE
-FN:859,_ZNKSt5dequeIcSaIcEE5beginEv
-FN:877,_ZNKSt5dequeIcSaIcEE3endEv
-FN:124,_ZNSt15_Deque_iteratorIcRcPcEC1Ev
-FN:422,_ZNSt11_Deque_baseIcSaIcEE11_Deque_implC1Ev
-FN:670,_ZNSt5dequeIcSaIcEE14_S_buffer_sizeEv
-FN:103,_ZNSt15_Deque_iteratorIcRKcPS0_E14_S_buffer_sizeEv
-FN:226,_ZNSt15_Deque_iteratorIcRKcPS0_E11_M_set_nodeEPPc
-FN:180,_ZNSt15_Deque_iteratorIcRKcPS0_EpLEi
-FN:199,_ZNKSt15_Deque_iteratorIcRKcPS0_EplEi
-FN:438,_ZNKSt11_Deque_baseIcSaIcEE19_M_get_Tp_allocatorEv
-FN:442,_ZNKSt11_Deque_baseIcSaIcEE20_M_get_map_allocatorEv
-FN:160,_ZNSt15_Deque_iteratorIcRcPcEmmEv
-FN:324,_ZStmiIcRKcPS0_ENSt15_Deque_iteratorIT_T0_T1_E15difference_typeERKS7_SA_
-FN:132,_ZNKSt15_Deque_iteratorIcRKcPS0_EdeEv
-FN:140,_ZNSt15_Deque_iteratorIcRKcPS0_EppEv
-FN:961,_ZNKSt5dequeIcSaIcEE8max_sizeEv
-FN:458,_ZNSt11_Deque_baseIcSaIcEE15_M_allocate_mapEj
-FN:446,_ZNSt11_Deque_baseIcSaIcEE16_M_allocate_nodeEv
-FN:452,_ZNSt11_Deque_baseIcSaIcEE18_M_deallocate_nodeEPc
-FN:554,_ZNSt11_Deque_baseIcSaIcEE16_M_destroy_nodesEPPcS3_
-FN:536,_ZNSt11_Deque_baseIcSaIcEE15_M_create_nodesEPPcS3_
-FN:1619,_ZNSt5dequeIcSaIcEE15_M_erase_at_endESt15_Deque_iteratorIcRcPcE
-FN:1373,_ZNSt5dequeIcSaIcEE5clearEv
-FN:1609,_ZNSt5dequeIcSaIcEE17_M_erase_at_beginESt15_Deque_iteratorIcRcPcE
-FN:462,_ZNSt11_Deque_baseIcSaIcEE17_M_deallocate_mapEPPcj
-FN:497,_ZNSt11_Deque_baseIcSaIcEE17_M_initialize_mapEj
-FN:377,_ZNSt11_Deque_baseIcSaIcEEC2Ev
-FN:695,_ZNSt5dequeIcSaIcEEC1Ev
-FN:476,_ZNSt11_Deque_baseIcSaIcEED2Ev
-FN:775,_ZNSt5dequeIcSaIcEED1Ev
-FN:1674,_ZNSt5dequeIcSaIcEE23_M_reserve_map_at_frontEj
-FN:1630,_ZNSt5dequeIcSaIcEE28_M_reserve_elements_at_frontEj
-FN:1666,_ZNSt5dequeIcSaIcEE22_M_reserve_map_at_backEj
-FN:1640,_ZNSt5dequeIcSaIcEE27_M_reserve_elements_at_backEj
-FN:1540,_ZNSt5dequeIcSaIcEE18_M_insert_dispatchISt15_Deque_iteratorIcRKcPS4_EEEvS3_IcRcPcET_SB_St12__false_type
-FN:1297,_ZNSt5dequeIcSaIcEE6insertISt15_Deque_iteratorIcRKcPS4_EEEvS3_IcRcPcET_SB_
-FN:1159,_ZNSt5dequeIcSaIcEE9push_backERKc
-DA:82,4652
-DA:83,4652
-DA:103,4465
-DA:104,4465
-DA:124,8
-DA:125,8
-DA:127,25602
-DA:129,25602
-DA:132,14042
-DA:133,14042
-DA:140,13988
-DA:142,13988
-DA:143,13988
-DA:145,6
-DA:146,6
-DA:148,13988
-DA:160,0
-DA:162,0
-DA:164,0
-DA:165,0
-DA:167,0
-DA:168,0
-DA:180,108
-DA:182,108
-DA:183,108
-DA:184,107
-DA:190,1
-DA:191,1
-DA:192,1
-DA:195,108
-DA:199,108
-DA:201,108
-DA:202,108
-DA:206,0
-DA:207,0
-DA:210,0
-DA:212,0
-DA:213,0
-DA:226,17
-DA:228,17
-DA:229,17
-DA:230,17
-DA:231,17
-DA:240,10938
-DA:241,10938
-DA:253,6774
-DA:254,6774
-DA:324,4338
-DA:329,4338
-DA:377,4
-DA:378,4
-DA:379,4
-DA:416,2
-DA:422,4
-DA:424,4
-DA:425,4
-DA:434,555
-DA:435,555
-DA:438,6
-DA:439,6
-DA:442,6
-DA:443,6
-DA:446,6
-DA:448,6
-DA:452,4
-DA:454,4
-DA:455,4
-DA:458,4
-DA:459,4
-DA:462,2
-DA:463,2
-DA:476,2
-DA:478,2
-DA:480,2
-DA:482,2
-DA:484,2
-DA:497,4
-DA:500,4
-DA:502,4
-DA:504,4
-DA:512,4
-DA:513,4
-DA:516,4
-DA:517,0
-DA:519,0
-DA:520,0
-DA:521,0
-DA:522,0
-DA:525,4
-DA:526,4
-DA:527,4
-DA:528,4
-DA:531,4
-DA:536,4
-DA:541,8
-DA:542,4
-DA:544,0
-DA:546,0
-DA:547,0
-DA:549,4
-DA:554,555
-DA:556,559
-DA:557,4
-DA:558,555
-DA:670,0
-DA:671,0
-DA:695,4
-DA:696,4
-DA:775,2
-DA:776,2
-DA:851,4436
-DA:852,4436
-DA:859,2
-DA:860,2
-DA:868,6074
-DA:869,6074
-DA:877,2
-DA:878,2
-DA:956,58
-DA:957,58
-DA:961,0
-DA:962,0
-DA:1159,6720
-DA:1161,6720
-DA:1164,6718
-DA:1165,6718
-DA:1168,2
-DA:1169,6720
-DA:1297,0
-DA:1301,0
-DA:1302,0
-DA:1373,497
-DA:1374,497
-DA:1540,0
-DA:1544,0
-DA:1545,0
-DA:1601,555
-DA:1605,555
-DA:1609,54
-DA:1611,54
-DA:1612,54
-DA:1613,54
-DA:1614,54
-DA:1619,499
-DA:1621,499
-DA:1622,499
-DA:1624,499
-DA:1625,499
-DA:1630,0
-DA:1633,0
-DA:1634,0
-DA:1635,0
-DA:1636,0
-DA:1640,0
-DA:1643,0
-DA:1644,0
-DA:1645,0
-DA:1646,0
-DA:1666,2
-DA:1668,2
-DA:1670,0
-DA:1671,2
-DA:1674,0
-DA:1676,0
-DA:1678,0
-DA:1679,0
-BA:83,2
-BA:83,1
-BA:143,2
-BA:143,2
-BA:143,0
-BA:143,0
-BA:162,0
-BA:162,0
-BA:183,2
-BA:183,1
-BA:183,2
-BA:183,2
-BA:183,2
-BA:183,2
-BA:183,0
-BA:183,0
-BA:183,0
-BA:183,0
-BA:183,0
-BA:183,0
-BA:190,2
-BA:190,1
-BA:190,0
-BA:190,0
-BA:478,2
-BA:478,1
-BA:541,2
-BA:541,2
-BA:556,2
-BA:556,2
-BA:1161,2
-BA:1161,2
-BA:1634,0
-BA:1634,0
-BA:1644,0
-BA:1644,0
-BA:1668,1
-BA:1668,2
-BA:1676,0
-BA:1676,0
-LF:166
-LH:122
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEC1ERKS2_
-FN:398,_ZNSt20back_insert_iteratorISt5dequeIcSaIcEEEC1ERS2_
-FN:456,_ZSt13back_inserterISt5dequeIcSaIcEEESt20back_insert_iteratorIT_ERS4_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPcSsEC1ERKS1_
-FN:735,_ZNK9__gnu_cxx17__normal_iteratorIPcSsEplERKi
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-FN:429,_ZNSt20back_insert_iteratorISt5dequeIcSaIcEEEdeEv
-FN:434,_ZNSt20back_insert_iteratorISt5dequeIcSaIcEEEppEv
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPcSsE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPcSsEEbRKNS_17__normal_iteratorIT_T0_EES7_
-FN:781,_ZN9__gnu_cxxneIPcSsEEbRKNS_17__normal_iteratorIT_T0_EES7_
-FN:846,_ZN9__gnu_cxxmiIPcSsEENS_17__normal_iteratorIT_T0_E15difference_typeERKS5_S8_
-FN:412,_ZNSt20back_insert_iteratorISt5dequeIcSaIcEEEaSERKc
-DA:398,497
-DA:412,6720
-DA:414,6720
-DA:415,6720
-DA:429,6720
-DA:430,6720
-DA:434,6720
-DA:435,6720
-DA:456,497
-DA:457,497
-DA:683,152
-DA:735,152
-DA:736,152
-DA:747,604
-DA:748,604
-DA:769,151
-DA:770,151
-DA:781,0
-DA:782,0
-DA:846,151
-DA:847,151
-LF:21
-LH:19
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceISt15_Deque_iteratorIcRcPcEENSt15iterator_traitsIT_E15difference_typeES5_S5_St26random_access_iterator_tag
-FN:115,_ZSt8distanceISt15_Deque_iteratorIcRcPcEENSt15iterator_traitsIT_E15difference_typeES5_S5_
-FN:93,_ZSt10__distanceISt15_Deque_iteratorIcRKcPS1_EENSt15iterator_traitsIT_E15difference_typeES6_S6_St26random_access_iterator_tag
-FN:115,_ZSt8distanceISt15_Deque_iteratorIcRKcPS1_EENSt15iterator_traitsIT_E15difference_typeES6_S6_
-FN:151,_ZSt9__advanceISt15_Deque_iteratorIcRKcPS1_EiEvRT_T0_St26random_access_iterator_tag
-FN:173,_ZSt7advanceISt15_Deque_iteratorIcRKcPS1_EiEvRT_T0_
-FN:93,_ZSt10__distanceIN9__gnu_cxx17__normal_iteratorIPcSsEEENSt15iterator_traitsIT_E15difference_typeES5_S5_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIN9__gnu_cxx17__normal_iteratorIPcSsEEENSt15iterator_traitsIT_E15difference_typeES5_S5_
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,702
-DA:98,702
-DA:115,702
-DA:119,702
-DA:151,0
-DA:156,0
-DA:157,0
-DA:173,0
-DA:176,0
-DA:177,0
-DA:178,0
-LF:11
-LH:4
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:166,_ZSt19__iterator_categoryISt15_Deque_iteratorIcRcPcEENSt15iterator_traitsIT_E17iterator_categoryERKS5_
-FN:166,_ZSt19__iterator_categoryISt15_Deque_iteratorIcRKcPS1_EENSt15iterator_traitsIT_E17iterator_categoryERKS6_
-FN:166,_ZSt19__iterator_categoryIN9__gnu_cxx17__normal_iteratorIPcSsEEENSt15iterator_traitsIT_E17iterator_categoryERKS5_
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,0
-DA:166,2716
-DA:167,2716
-LF:3
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:97,_ZNSt20__uninitialized_copyILb1EE18uninitialized_copyISt15_Deque_iteratorIcRKcPS3_ES2_IcRcPcEEET0_T_SB_SA_
-FN:113,_ZSt18uninitialized_copyISt15_Deque_iteratorIcRKcPS1_ES0_IcRcPcEET0_T_S9_S8_
-FN:261,_ZSt22__uninitialized_copy_aISt15_Deque_iteratorIcRKcPS1_ES0_IcRcPcEcET0_T_S9_S8_RSaIT1_E
-FN:97,_ZNSt20__uninitialized_copyILb1EE18uninitialized_copyISt15_Deque_iteratorIcRcPcES5_EET0_T_S7_S6_
-FN:113,_ZSt18uninitialized_copyISt15_Deque_iteratorIcRcPcES3_ET0_T_S5_S4_
-FN:261,_ZSt22__uninitialized_copy_aISt15_Deque_iteratorIcRcPcES3_cET0_T_S5_S4_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aISt15_Deque_iteratorIcRcPcES3_SaIcEET0_T_S6_S5_RT1_
-FN:371,_ZSt25__uninitialized_move_copyISt15_Deque_iteratorIcRcPcES0_IcRKcPS4_ES3_SaIcEET1_T_SA_T0_SB_S9_RT2_
-FN:343,_ZSt25__uninitialized_copy_moveISt15_Deque_iteratorIcRKcPS1_ES0_IcRcPcES7_SaIcEET1_T_SA_T0_SB_S9_RT2_
-DA:97,0
-DA:98,0
-DA:113,0
-DA:122,0
-DA:261,0
-DA:262,0
-DA:268,0
-DA:272,0
-DA:343,0
-DA:347,0
-DA:350,0
-DA:352,0
-DA:354,0
-DA:355,0
-DA:371,0
-DA:375,0
-DA:378,0
-DA:380,0
-DA:382,0
-DA:383,0
-LF:20
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:404,_ZNKSt6vectorISsSaISsEE3endEv
-FN:386,_ZNKSt6vectorISsSaISsEE5beginEv
-FN:526,_ZNKSt6vectorISsSaISsEE5emptyEv
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-DA:79,0
-DA:97,0
-DA:98,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:299,0
-DA:300,0
-DA:301,0
-DA:386,0
-DA:387,0
-DA:404,0
-DA:405,0
-DA:526,0
-DA:527,0
-BA:149,0
-BA:149,0
-LF:19
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stream_iterator.h
-FN:181,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERSoPKc
-FN:185,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERKS2_
-FN:202,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEdeEv
-FN:206,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEppEv
-FN:191,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEaSERKSs
-DA:181,0
-DA:182,0
-DA:185,0
-DA:186,0
-DA:191,0
-DA:196,0
-DA:197,0
-DA:198,0
-DA:202,0
-DA:203,0
-DA:206,0
-DA:207,0
-BA:197,0
-BA:197,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIPcED2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorIPcE8max_sizeEv
-FN:69,_ZN9__gnu_cxx13new_allocatorIPcEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorIcE8max_sizeEv
-FN:107,_ZN9__gnu_cxx13new_allocatorIcE9constructEPcRKc
-FN:87,_ZN9__gnu_cxx13new_allocatorIPcE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorIcE8allocateEjPKv
-FN:97,_ZN9__gnu_cxx13new_allocatorIcE10deallocateEPcj
-FN:97,_ZN9__gnu_cxx13new_allocatorIPcE10deallocateEPS1_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-DA:69,6
-DA:71,0
-DA:76,6
-DA:87,4
-DA:89,4
-DA:90,0
-DA:92,4
-DA:97,2
-DA:98,2
-DA:101,4
-DA:102,4
-DA:107,0
-DA:108,0
-BA:89,1
-BA:89,2
-BA:89,0
-BA:89,0
-BA:108,0
-BA:108,0
-LF:13
-LH:9
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:159,_ZN9__gnu_cxx17__is_null_pointerISt15_Deque_iteratorIcRcPcEEEbT_
-FN:159,_ZN9__gnu_cxx17__is_null_pointerINS_17__normal_iteratorIPcSsEEEEbT_
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-DA:159,702
-DA:160,702
-LF:4
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/istream
-FN:585,_ZNSiC2Ev
-FN:105,_ZNSiD2Ev
-FN:804,_ZNSdC2Ev
-FN:801,_ZNSdD2Ev
-DA:105,0
-DA:106,0
-DA:585,0
-DA:586,0
-DA:587,0
-DA:801,0
-DA:804,0
-DA:805,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-DA:105,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-DA:95,0
-DA:112,0
-DA:117,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:509,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:536,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:555,_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-DA:509,0
-DA:510,0
-DA:511,0
-DA:536,0
-DA:537,0
-DA:555,0
-DA:556,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-LF:25
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:17,_ZN8LocationC1EPKciSs
-FN:13,_ZN8LocationC1ERKS_
-FN:52,_ZlsISsER12AssertFailedS1_T_
-FN:52,_ZlsIPKcER12AssertFailedS3_T_
-FN:52,_ZlsIjER12AssertFailedS1_T_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:41,_ZN12AssertFailedD1Ev
-FN:13,_ZN8LocationD1Ev
-FN:67,_Z12assert_eq_fnIjjEv8LocationT_T0_
-FN:67,_Z12assert_eq_fnISsSsEv8LocationT_T0_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:75,0
-BA:42,0
-BA:42,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-LF:22
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/sys/process.test.h
-FN:20,_ZN11TestProcess5umaskEv
-FN:12,_ZN11TestProcess14getcwdAndChdirEv
-DA:12,1
-DA:13,1
-DA:14,1
-DA:15,2
-DA:16,1
-DA:17,1
-DA:18,1
-DA:20,1
-DA:21,1
-DA:22,1
-DA:23,1
-LF:11
-LH:11
-end_of_record
-SF:/srv/build/pkg/ept-work/default/wibble/wibble-test-generated-_home_mornfall_dev_pkg_ept-work_wibble_sys_process.cpp
-FN:4,_Z41__static_initialization_and_destruction_0ii
-FN:4,_GLOBAL__I__Z26run_Process_getcwdAndChdirv
-FN:4,_Z17run_Process_umaskv
-FN:3,_Z26run_Process_getcwdAndChdirv
-DA:3,1
-DA:4,4
-BA:4,2
-BA:4,1
-BA:4,2
-BA:4,1
-LF:2
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaIcED1Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-FN:2162,_ZSteqIcEN9__gnu_cxx11__enable_ifIXsrSt9__is_charIT_E7__valueEbE6__typeERKSbIS3_St11char_traitsIS3_ESaIS3_EESC_
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2162,0
-DA:2165,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-LF:53
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-DA:245,0
-DA:246,0
-DA:257,0
-DA:258,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:166,0
-DA:167,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-DA:69,0
-DA:71,0
-DA:76,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:195,_ZNSolsEj
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-DA:95,0
-DA:112,0
-DA:117,0
-DA:195,0
-DA:199,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/exception.h
-FN:190,_ZNK6wibble9exception7Generic4typeEv
-FN:263,_ZNK6wibble9exception11Consistency4typeEv
-FN:109,_ZN6wibble9exception10AddContext7contextEv
-FN:213,_ZNK6wibble9exception7Generic4whatEv
-FN:193,_ZNK6wibble9exception7Generic4descEv
-FN:265,_ZNK6wibble9exception11Consistency4descEv
-FN:154,_ZNK6wibble9exception7Context13formatContextEv
-FN:205,_ZNK6wibble9exception7Generic8fullInfoEv
-FN:137,_ZN6wibble9exception7ContextD2Ev
-FN:117,_ZN6wibble9exception10AddContext11copyContextISt20back_insert_iteratorISt6vectorISsSaISsEEEEEvT_
-FN:153,_ZN6wibble9exception7Context10addContextERKSs
-FN:147,_ZN6wibble9exception7ContextC2ERKSs
-FN:186,_ZN6wibble9exception7GenericC2ERKSs
-FN:187,_ZN6wibble9exception7GenericD0Ev
-FN:187,_ZN6wibble9exception7GenericD1Ev
-FN:187,_ZN6wibble9exception7GenericD2Ev
-FN:259,_ZN6wibble9exception11ConsistencyC1ERKSsS3_
-FN:261,_ZN6wibble9exception11ConsistencyD0Ev
-FN:261,_ZN6wibble9exception11ConsistencyD1Ev
-DA:109,0
-DA:110,0
-DA:111,0
-DA:112,0
-DA:113,0
-DA:117,0
-DA:118,0
-DA:119,0
-DA:137,0
-DA:147,0
-DA:148,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:153,0
-DA:154,0
-DA:155,0
-DA:156,0
-DA:157,0
-DA:159,0
-DA:161,0
-DA:162,0
-DA:163,0
-DA:186,0
-DA:187,0
-DA:190,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:205,0
-DA:206,0
-DA:207,0
-DA:209,0
-DA:210,0
-DA:213,0
-DA:259,0
-DA:260,0
-DA:261,0
-DA:263,0
-DA:265,0
-DA:266,0
-DA:267,0
-DA:268,0
-DA:269,0
-BA:110,0
-BA:110,0
-BA:156,0
-BA:156,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:207,0
-BA:207,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:267,0
-BA:267,0
-LF:44
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/sys/buffer.h
-FN:51,_ZNK6wibble3sys6Buffer4Data3refEv
-FN:55,_ZNK6wibble3sys6Buffer4Data5unrefEv
-FN:118,_ZN6wibble3sys6BufferC2ERKS1_
-FN:140,_ZN6wibble3sys6Buffer4dataEv
-FN:143,_ZNK6wibble3sys6Buffer4dataEv
-FN:146,_ZNK6wibble3sys6Buffer4sizeEv
-FN:109,_ZN6wibble3sys6BufferC2EPKvj
-FN:129,_ZN6wibble3sys6BufferaSERKS1_
-FN:124,_ZN6wibble3sys6BufferD2Ev
-DA:51,16
-DA:55,16
-DA:109,2
-DA:111,2
-DA:113,2
-DA:114,2
-DA:116,2
-DA:118,4
-DA:120,4
-DA:121,4
-DA:122,4
-DA:123,4
-DA:124,6
-DA:126,6
-DA:127,2
-DA:128,6
-DA:129,5
-DA:131,5
-DA:132,5
-DA:133,5
-DA:134,0
-DA:135,5
-DA:136,5
-DA:140,17
-DA:143,7
-DA:146,30
-BA:111,2
-BA:111,1
-BA:120,2
-BA:120,1
-BA:126,2
-BA:126,1
-BA:126,2
-BA:126,2
-BA:126,2
-BA:126,2
-BA:127,2
-BA:127,1
-BA:131,2
-BA:131,1
-BA:133,2
-BA:133,1
-BA:133,1
-BA:133,2
-BA:133,1
-BA:133,2
-BA:134,0
-BA:134,0
-BA:140,2
-BA:140,2
-BA:143,2
-BA:143,1
-BA:146,2
-BA:146,2
-LF:26
-LH:25
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/sys/netbuffer.h
-FN:53,_ZN6wibble3sys9NetBufferC1ERKS1_
-FN:71,_ZNK6wibble3sys9NetBuffer4dataEj
-FN:74,_ZN6wibble3sys9NetBuffer4dataEj
-FN:77,_ZNK6wibble3sys9NetBuffer4sizeEv
-FN:84,_ZNK6wibble3sys9NetBuffer4fitsIsEEbj
-FN:84,_ZNK6wibble3sys9NetBuffer4fitsIxEEbj
-FN:49,_ZN6wibble3sys9NetBufferC1EPKvj
-FN:63,_ZN6wibble3sys9NetBufferaSERKS1_
-FN:36,_ZN6wibble3sys9NetBufferD1Ev
-FN:152,_ZN6wibble3sys9NetBuffer4skipEj
-FN:133,_ZN6wibble3sys9NetBufferpLEj
-FN:111,_ZNK6wibble3sys9NetBuffer5afterEj
-FN:103,_ZN6wibble3sys9NetBufferplEj
-FN:144,_ZN6wibble3sys9NetBuffer4skipIsEEvv
-FN:123,_ZNK6wibble3sys9NetBuffer5afterIsEEKS1_v
-FN:93,_ZNK6wibble3sys9NetBuffer4castIcEEPKT_j
-DA:36,6
-DA:49,2
-DA:50,2
-DA:53,4
-DA:54,4
-DA:63,5
-DA:65,5
-DA:66,5
-DA:67,5
-DA:71,7
-DA:74,8
-DA:77,23
-DA:84,2
-DA:86,2
-DA:93,7
-DA:95,7
-DA:96,0
-DA:97,7
-DA:103,1
-DA:104,0
-DA:105,1
-DA:111,2
-DA:112,0
-DA:113,2
-DA:114,2
-DA:115,0
-DA:123,1
-DA:125,1
-DA:126,1
-DA:127,0
-DA:133,1
-DA:134,0
-DA:135,1
-DA:136,1
-DA:144,1
-DA:146,1
-DA:147,1
-DA:152,6
-DA:153,0
-DA:154,6
-DA:155,0
-DA:156,6
-DA:157,6
-BA:95,1
-BA:95,2
-BA:154,1
-BA:154,2
-LF:43
-LH:35
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:13,_ZN8LocationC1ERKS_
-FN:17,_ZN8LocationC1EPKciSs
-FN:52,_ZlsIcER12AssertFailedS1_T_
-FN:52,_ZlsIPKcER12AssertFailedS3_T_
-FN:52,_ZlsIjER12AssertFailedS1_T_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:41,_ZN12AssertFailedD1Ev
-FN:13,_ZN8LocationD1Ev
-FN:67,_Z12assert_eq_fnIjjEv8LocationT_T0_
-FN:59,_Z9assert_fnIbEv8LocationT_
-FN:67,_Z12assert_eq_fnIccEv8LocationT_T0_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:59,0
-DA:61,0
-DA:62,0
-DA:64,0
-DA:67,13
-DA:69,13
-DA:70,0
-DA:71,0
-DA:75,13
-BA:42,0
-BA:42,0
-BA:61,0
-BA:61,0
-BA:69,0
-BA:69,0
-BA:69,1
-BA:69,2
-LF:26
-LH:3
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/sys/netbuffer.test.h
-FN:27,_ZN13TestNetBuffer9skipBytesEv
-FN:15,_ZN13TestNetBuffer16startAtBeginningEv
-DA:15,1
-DA:16,1
-DA:18,1
-DA:19,2
-DA:21,2
-DA:22,2
-DA:23,2
-DA:24,1
-DA:27,1
-DA:28,1
-DA:30,1
-DA:32,1
-DA:33,2
-DA:35,1
-DA:36,1
-DA:37,2
-DA:38,2
-DA:40,2
-DA:41,1
-DA:42,2
-DA:43,2
-DA:45,1
-DA:46,1
-DA:47,1
-DA:48,2
-DA:49,2
-DA:51,2
-DA:52,1
-DA:53,2
-DA:54,2
-DA:56,1
-DA:57,1
-DA:58,1
-DA:59,2
-DA:60,2
-DA:62,2
-DA:63,1
-DA:64,2
-DA:65,2
-DA:66,1
-LF:40
-LH:40
-end_of_record
-SF:/srv/build/pkg/ept-work/default/wibble/wibble-test-generated-_home_mornfall_dev_pkg_ept-work_wibble_sys_netbuffer.cpp
-FN:4,_Z41__static_initialization_and_destruction_0ii
-FN:4,_GLOBAL__I__Z30run_NetBuffer_startAtBeginningv
-FN:4,_Z23run_NetBuffer_skipBytesv
-FN:3,_Z30run_NetBuffer_startAtBeginningv
-DA:3,1
-DA:4,4
-BA:4,2
-BA:4,1
-BA:4,2
-BA:4,1
-LF:2
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaIcED1Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaISsED2Ev
-FN:98,_ZNSaISsEC2Ev
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:1534,_ZNKSs5c_strEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:612,_ZNKSs6lengthEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:835,_ZNSs6appendEPKc
-FN:501,_ZNSsaSERKSs
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2121,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:612,0
-DA:613,0
-DA:686,0
-DA:687,0
-DA:835,0
-DA:838,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2121,0
-DA:2123,0
-DA:2124,0
-DA:2125,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-LF:67
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb0EE3__bES7_
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb0EE3__bES6_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb1EE3__bES7_
-FN:268,_ZNSt12__niter_baseISt16ostream_iteratorISscSt11char_traitsIcEELb0EE3__bES3_
-FN:286,_ZNSt12__miter_baseIPSsLb0EE3__bES0_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb1EE3__bES6_
-FN:268,_ZNSt12__niter_baseISt20back_insert_iteratorISt6vectorISsSaISsEEELb0EE3__bES4_
-FN:268,_ZNSt12__niter_baseIPSsLb0EE3__bES0_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPKSsSt16ostream_iteratorISscSt11char_traitsIcEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPKSsSt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_SD_SC_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET0_T_SD_SC_
-FN:539,_ZNSt20__copy_move_backwardILb0ELb0ESt26random_access_iterator_tagE13__copy_move_bIPSsS3_EET0_T_S5_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0EPSsS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPSsS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardIPSsS0_ET0_T_S2_S1_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET1_T0_SA_S9_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET0_T_SA_S9_
-DA:210,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:268,0
-DA:269,0
-DA:276,0
-DA:277,0
-DA:286,0
-DA:287,0
-DA:337,0
-DA:340,0
-DA:342,0
-DA:343,0
-DA:344,0
-DA:346,0
-DA:385,0
-DA:393,0
-DA:396,0
-DA:430,0
-DA:435,0
-DA:456,0
-DA:466,0
-DA:539,0
-DA:542,0
-DA:543,0
-DA:544,0
-DA:579,0
-DA:587,0
-DA:592,0
-DA:597,0
-DA:602,0
-DA:624,0
-DA:636,0
-BA:215,0
-BA:215,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:542,0
-BA:542,0
-LF:34
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-DA:87,0
-DA:88,0
-DA:97,0
-DA:101,0
-DA:103,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-BA:101,0
-BA:101,0
-LF:9
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEdeEv
-FN:398,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEC1ERS2_
-FN:456,_ZSt13back_inserterISt6vectorISsSaISsEEESt20back_insert_iteratorIT_ERS4_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEC1ERKS2_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEE4baseEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEC1ERKS1_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-FN:429,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEdeEv
-FN:434,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEppEv
-FN:412,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEaSERKSs
-DA:398,0
-DA:412,0
-DA:414,0
-DA:415,0
-DA:429,0
-DA:430,0
-DA:434,0
-DA:435,0
-DA:456,0
-DA:457,0
-DA:683,0
-DA:695,0
-DA:696,0
-DA:747,0
-DA:748,0
-DA:769,0
-DA:770,0
-LF:17
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,0
-DA:166,0
-DA:167,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyIPSsS2_EET0_T_S4_S3_
-FN:113,_ZSt18uninitialized_copyIPSsS0_ET0_T_S2_S1_
-FN:261,_ZSt22__uninitialized_copy_aIPSsS0_SsET0_T_S2_S1_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPSsS0_SaISsEET0_T_S3_S2_RT1_
-DA:73,0
-DA:75,0
-DA:78,0
-DA:79,0
-DA:81,0
-DA:83,0
-DA:85,0
-DA:86,0
-DA:113,0
-DA:122,0
-DA:261,0
-DA:262,0
-DA:268,0
-DA:272,0
-BA:78,0
-BA:78,0
-BA:79,0
-BA:79,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:404,_ZNKSt6vectorISsSaISsEE3endEv
-FN:386,_ZNKSt6vectorISsSaISsEE5beginEv
-FN:484,_ZNKSt6vectorISsSaISsEE4sizeEv
-FN:101,_ZNKSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:395,_ZNSt6vectorISsSaISsEE3endEv
-FN:377,_ZNSt6vectorISsSaISsEE5beginEv
-FN:526,_ZNKSt6vectorISsSaISsEE5emptyEv
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:84,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseISsSaISsEEC2Ev
-FN:213,_ZNSt6vectorISsSaISsEEC1Ev
-FN:489,_ZNKSt6vectorISsSaISsEE8max_sizeEv
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:1075,_ZNKSt6vectorISsSaISsEE12_M_check_lenEjPKc
-FN:143,_ZNSt12_Vector_baseISsSaISsEE11_M_allocateEj
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-FN:686,_ZNSt6vectorISsSaISsEE9push_backERKSs
-DA:79,0
-DA:84,0
-DA:85,0
-DA:86,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:108,0
-DA:109,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:143,0
-DA:144,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:213,0
-DA:214,0
-DA:299,0
-DA:300,0
-DA:301,0
-DA:377,0
-DA:378,0
-DA:386,0
-DA:387,0
-DA:395,0
-DA:396,0
-DA:404,0
-DA:405,0
-DA:484,0
-DA:485,0
-DA:489,0
-DA:490,0
-DA:526,0
-DA:527,0
-DA:686,0
-DA:688,0
-DA:690,0
-DA:691,0
-DA:694,0
-DA:695,0
-DA:1075,0
-DA:1077,0
-DA:1078,0
-DA:1080,0
-DA:1081,0
-BA:144,0
-BA:144,0
-BA:149,0
-BA:149,0
-BA:688,0
-BA:688,0
-BA:1077,0
-BA:1077,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-LF:49
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stream_iterator.h
-FN:181,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERSoPKc
-FN:185,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERKS2_
-FN:202,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEdeEv
-FN:206,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEppEv
-FN:191,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEaSERKSs
-DA:181,0
-DA:182,0
-DA:185,0
-DA:186,0
-DA:191,0
-DA:196,0
-DA:197,0
-DA:198,0
-DA:202,0
-DA:203,0
-DA:206,0
-DA:207,0
-BA:197,0
-BA:197,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/vector.tcc
-FN:283,_ZNSt6vectorISsSaISsEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPSsS1_EERKSs
-DA:283,0
-DA:286,0
-DA:288,0
-DA:291,0
-DA:293,0
-DA:295,0
-DA:299,0
-DA:307,0
-DA:308,0
-DA:309,0
-DA:316,0
-DA:321,0
-DA:323,0
-DA:324,0
-DA:330,0
-DA:332,0
-DA:333,0
-DA:334,0
-DA:336,0
-DA:338,0
-DA:341,0
-DA:342,0
-DA:343,0
-DA:345,0
-BA:286,0
-BA:286,0
-LF:24
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/exception
-FN:59,_ZNSt9exceptionC2Ev
-DA:59,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISsE8max_sizeEv
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-FN:107,_ZN9__gnu_cxx13new_allocatorISsE9constructEPSsRKSs
-FN:87,_ZN9__gnu_cxx13new_allocatorISsE8allocateEjPKv
-DA:69,0
-DA:71,0
-DA:76,0
-DA:87,0
-DA:89,0
-DA:90,0
-DA:92,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:107,0
-DA:108,0
-BA:89,0
-BA:89,0
-BA:108,0
-BA:108,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/istream
-FN:585,_ZNSiC2Ev
-FN:105,_ZNSiD2Ev
-FN:804,_ZNSdC2Ev
-FN:801,_ZNSdD2Ev
-DA:105,0
-DA:106,0
-DA:585,0
-DA:586,0
-DA:587,0
-DA:801,0
-DA:804,0
-DA:805,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:464,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_c
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:195,_ZNSolsEj
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-DA:95,0
-DA:112,0
-DA:117,0
-DA:195,0
-DA:199,0
-DA:365,0
-DA:366,0
-DA:464,0
-DA:465,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:509,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:536,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:555,_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-DA:509,0
-DA:510,0
-DA:511,0
-DA:536,0
-DA:537,0
-DA:555,0
-DA:556,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-LF:25
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/exception.h
-FN:190,_ZNK6wibble9exception7Generic4typeEv
-FN:263,_ZNK6wibble9exception11Consistency4typeEv
-FN:137,_ZN6wibble9exception7ContextD2Ev
-FN:187,_ZN6wibble9exception7GenericD2Ev
-FN:395,_ZN6wibble9exception6SystemD1Ev
-FN:193,_ZNK6wibble9exception7Generic4descEv
-FN:213,_ZNK6wibble9exception7Generic4whatEv
-FN:187,_ZN6wibble9exception7GenericD0Ev
-FN:187,_ZN6wibble9exception7GenericD1Ev
-FN:265,_ZNK6wibble9exception11Consistency4descEv
-FN:261,_ZN6wibble9exception11ConsistencyD0Ev
-FN:261,_ZN6wibble9exception11ConsistencyD1Ev
-FN:109,_ZN6wibble9exception10AddContext7contextEv
-FN:117,_ZN6wibble9exception10AddContext11copyContextISt20back_insert_iteratorISt6vectorISsSaISsEEEEEvT_
-FN:153,_ZN6wibble9exception7Context10addContextERKSs
-FN:147,_ZN6wibble9exception7ContextC2ERKSs
-FN:186,_ZN6wibble9exception7GenericC2ERKSs
-FN:259,_ZN6wibble9exception11ConsistencyC1ERKSsS3_
-FN:154,_ZNK6wibble9exception7Context13formatContextEv
-FN:205,_ZNK6wibble9exception7Generic8fullInfoEv
-DA:109,0
-DA:110,0
-DA:111,0
-DA:112,0
-DA:113,0
-DA:117,0
-DA:118,0
-DA:119,0
-DA:137,0
-DA:147,0
-DA:148,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:153,0
-DA:154,0
-DA:155,0
-DA:156,0
-DA:157,0
-DA:159,0
-DA:161,0
-DA:162,0
-DA:163,0
-DA:186,0
-DA:187,0
-DA:190,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:205,0
-DA:206,0
-DA:207,0
-DA:209,0
-DA:210,0
-DA:213,0
-DA:259,0
-DA:260,0
-DA:261,0
-DA:263,0
-DA:265,0
-DA:266,0
-DA:267,0
-DA:268,0
-DA:269,0
-DA:395,0
-BA:110,0
-BA:110,0
-BA:156,0
-BA:156,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:207,0
-BA:207,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:267,0
-BA:267,0
-BA:395,0
-BA:395,0
-LF:45
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/stream/posix.h
-FN:90,_ZN6wibble6stream8PosixBuf8overflowEi
-FN:100,_ZN6wibble6stream8PosixBuf4syncEv
-FN:34,_ZN6wibble6stream8PosixBufD0Ev
-FN:34,_ZN6wibble6stream8PosixBufD1Ev
-FN:53,_ZN6wibble6stream8PosixBuf6attachEij
-FN:30,_ZN6wibble6stream8PosixBufC1Eij
-DA:30,1
-DA:32,1
-DA:33,1
-DA:34,1
-DA:35,1
-DA:36,1
-DA:38,1
-DA:39,1
-DA:41,1
-DA:43,1
-DA:45,1
-DA:53,1
-DA:55,1
-DA:56,1
-DA:57,0
-DA:58,1
-DA:59,1
-DA:60,1
-DA:61,1
-DA:90,0
-DA:92,0
-DA:93,0
-DA:95,0
-DA:96,0
-DA:98,0
-DA:100,2
-DA:102,2
-DA:104,1
-DA:105,1
-DA:106,1
-DA:107,0
-DA:108,1
-DA:110,2
-BA:36,0
-BA:36,0
-BA:36,2
-BA:36,1
-BA:39,0
-BA:39,0
-BA:39,2
-BA:39,1
-BA:41,0
-BA:41,0
-BA:41,2
-BA:41,1
-BA:45,0
-BA:45,0
-BA:45,1
-BA:45,2
-BA:56,1
-BA:56,2
-BA:93,0
-BA:93,0
-BA:102,2
-BA:102,2
-BA:106,1
-BA:106,2
-LF:33
-LH:25
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:17,_ZN8LocationC1EPKciSs
-FN:13,_ZN8LocationC1ERKS_
-FN:41,_ZN12AssertFailedD1Ev
-FN:13,_ZN8LocationD1Ev
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:59,_Z9assert_fnIbEv8LocationT_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:59,0
-DA:61,0
-DA:62,0
-DA:64,0
-BA:42,0
-BA:42,0
-BA:61,0
-BA:61,0
-LF:18
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/stream/posix.test.h
-FN:18,_ZN12_GLOBAL__N_115TestStreamPosix10basicMatchEv
-DA:18,1
-DA:19,1
-DA:20,1
-DA:22,1
-DA:23,1
-DA:25,1
-DA:26,1
-DA:27,1
-DA:28,1
-LF:9
-LH:9
-end_of_record
-SF:/srv/build/pkg/ept-work/default/wibble/wibble-test-generated-_home_mornfall_dev_pkg_ept-work_wibble_stream_posix.cpp
-FN:3,_Z41__static_initialization_and_destruction_0ii
-FN:3,_GLOBAL__I__Z26run_StreamPosix_basicMatchv
-FN:3,_Z26run_StreamPosix_basicMatchv
-DA:3,4
-BA:3,2
-BA:3,1
-BA:3,2
-BA:3,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaIcED1Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaISsED2Ev
-FN:98,_ZNSaISsEC2Ev
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:1534,_ZNKSs5c_strEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:612,_ZNKSs6lengthEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:835,_ZNSs6appendEPKc
-FN:2121,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:612,0
-DA:613,0
-DA:686,0
-DA:687,0
-DA:835,0
-DA:838,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2121,0
-DA:2123,0
-DA:2124,0
-DA:2125,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-LF:67
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:287,_ZNSt11char_traitsIcE11to_int_typeERKc
-FN:291,_ZNSt11char_traitsIcE11eq_int_typeERKiS2_
-FN:295,_ZNSt11char_traitsIcE3eofEv
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-DA:245,0
-DA:246,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-DA:287,0
-DA:288,0
-DA:291,0
-DA:292,0
-DA:295,0
-LF:11
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/postypes.h
-FN:112,_ZNSt4fposI11__mbstate_tEC1Ex
-DA:112,0
-DA:113,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb0EE3__bES7_
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb0EE3__bES6_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb1EE3__bES7_
-FN:268,_ZNSt12__niter_baseISt16ostream_iteratorISscSt11char_traitsIcEELb0EE3__bES3_
-FN:286,_ZNSt12__miter_baseIPSsLb0EE3__bES0_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb1EE3__bES6_
-FN:268,_ZNSt12__niter_baseISt20back_insert_iteratorISt6vectorISsSaISsEEELb0EE3__bES4_
-FN:268,_ZNSt12__niter_baseIPSsLb0EE3__bES0_
-FN:539,_ZNSt20__copy_move_backwardILb0ELb0ESt26random_access_iterator_tagE13__copy_move_bIPSsS3_EET0_T_S5_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0EPSsS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPSsS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardIPSsS0_ET0_T_S2_S1_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET1_T0_SA_S9_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET0_T_SA_S9_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPKSsSt16ostream_iteratorISscSt11char_traitsIcEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPKSsSt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_SD_SC_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET0_T_SD_SC_
-DA:210,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:268,0
-DA:269,0
-DA:276,0
-DA:277,0
-DA:286,0
-DA:287,0
-DA:337,0
-DA:340,0
-DA:342,0
-DA:343,0
-DA:344,0
-DA:346,0
-DA:385,0
-DA:393,0
-DA:396,0
-DA:430,0
-DA:435,0
-DA:456,0
-DA:466,0
-DA:539,0
-DA:542,0
-DA:543,0
-DA:544,0
-DA:579,0
-DA:587,0
-DA:592,0
-DA:597,0
-DA:602,0
-DA:624,0
-DA:636,0
-BA:215,0
-BA:215,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:542,0
-BA:542,0
-LF:34
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-DA:87,0
-DA:88,0
-DA:97,0
-DA:101,0
-DA:103,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-BA:101,0
-BA:101,0
-LF:9
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEdeEv
-FN:398,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEC1ERS2_
-FN:456,_ZSt13back_inserterISt6vectorISsSaISsEEESt20back_insert_iteratorIT_ERS4_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEC1ERKS2_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEE4baseEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEC1ERKS1_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-FN:429,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEdeEv
-FN:434,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEppEv
-FN:412,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEaSERKSs
-DA:398,0
-DA:412,0
-DA:414,0
-DA:415,0
-DA:429,0
-DA:430,0
-DA:434,0
-DA:435,0
-DA:456,0
-DA:457,0
-DA:683,0
-DA:695,0
-DA:696,0
-DA:747,0
-DA:748,0
-DA:769,0
-DA:770,0
-LF:17
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,0
-DA:166,0
-DA:167,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyIPSsS2_EET0_T_S4_S3_
-FN:113,_ZSt18uninitialized_copyIPSsS0_ET0_T_S2_S1_
-FN:261,_ZSt22__uninitialized_copy_aIPSsS0_SsET0_T_S2_S1_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPSsS0_SaISsEET0_T_S3_S2_RT1_
-DA:73,0
-DA:75,0
-DA:78,0
-DA:79,0
-DA:81,0
-DA:83,0
-DA:85,0
-DA:86,0
-DA:113,0
-DA:122,0
-DA:261,0
-DA:262,0
-DA:268,0
-DA:272,0
-BA:78,0
-BA:78,0
-BA:79,0
-BA:79,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:404,_ZNKSt6vectorISsSaISsEE3endEv
-FN:386,_ZNKSt6vectorISsSaISsEE5beginEv
-FN:484,_ZNKSt6vectorISsSaISsEE4sizeEv
-FN:101,_ZNKSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:395,_ZNSt6vectorISsSaISsEE3endEv
-FN:377,_ZNSt6vectorISsSaISsEE5beginEv
-FN:526,_ZNKSt6vectorISsSaISsEE5emptyEv
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:84,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseISsSaISsEEC2Ev
-FN:213,_ZNSt6vectorISsSaISsEEC1Ev
-FN:489,_ZNKSt6vectorISsSaISsEE8max_sizeEv
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-FN:1075,_ZNKSt6vectorISsSaISsEE12_M_check_lenEjPKc
-FN:143,_ZNSt12_Vector_baseISsSaISsEE11_M_allocateEj
-FN:686,_ZNSt6vectorISsSaISsEE9push_backERKSs
-DA:79,0
-DA:84,0
-DA:85,0
-DA:86,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:108,0
-DA:109,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:143,0
-DA:144,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:213,0
-DA:214,0
-DA:299,0
-DA:300,0
-DA:301,0
-DA:377,0
-DA:378,0
-DA:386,0
-DA:387,0
-DA:395,0
-DA:396,0
-DA:404,0
-DA:405,0
-DA:484,0
-DA:485,0
-DA:489,0
-DA:490,0
-DA:526,0
-DA:527,0
-DA:686,0
-DA:688,0
-DA:690,0
-DA:691,0
-DA:694,0
-DA:695,0
-DA:1075,0
-DA:1077,0
-DA:1078,0
-DA:1080,0
-DA:1081,0
-BA:144,0
-BA:144,0
-BA:149,0
-BA:149,0
-BA:688,0
-BA:688,0
-BA:1077,0
-BA:1077,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-LF:49
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stream_iterator.h
-FN:181,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERSoPKc
-FN:185,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERKS2_
-FN:202,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEdeEv
-FN:206,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEppEv
-FN:191,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEaSERKSs
-DA:181,0
-DA:182,0
-DA:185,0
-DA:186,0
-DA:191,0
-DA:196,0
-DA:197,0
-DA:198,0
-DA:202,0
-DA:203,0
-DA:206,0
-DA:207,0
-BA:197,0
-BA:197,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/vector.tcc
-FN:283,_ZNSt6vectorISsSaISsEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPSsS1_EERKSs
-DA:283,0
-DA:286,0
-DA:288,0
-DA:291,0
-DA:293,0
-DA:295,0
-DA:299,0
-DA:307,0
-DA:308,0
-DA:309,0
-DA:316,0
-DA:321,0
-DA:323,0
-DA:324,0
-DA:330,0
-DA:332,0
-DA:333,0
-DA:334,0
-DA:336,0
-DA:338,0
-DA:341,0
-DA:342,0
-DA:343,0
-DA:345,0
-BA:286,0
-BA:286,0
-LF:24
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/exception
-FN:59,_ZNSt9exceptionC2Ev
-DA:59,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISsE8max_sizeEv
-FN:107,_ZN9__gnu_cxx13new_allocatorISsE9constructEPSsRKSs
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-FN:87,_ZN9__gnu_cxx13new_allocatorISsE8allocateEjPKv
-DA:69,0
-DA:71,0
-DA:76,0
-DA:87,0
-DA:89,0
-DA:90,0
-DA:92,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:107,0
-DA:108,0
-BA:89,0
-BA:89,0
-BA:108,0
-BA:108,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/istream
-FN:585,_ZNSiC2Ev
-FN:105,_ZNSiD2Ev
-FN:804,_ZNSdC2Ev
-FN:801,_ZNSdD2Ev
-DA:105,0
-DA:106,0
-DA:585,0
-DA:586,0
-DA:587,0
-DA:801,0
-DA:804,0
-DA:805,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:86,_ZNSoC1EPSt15basic_streambufIcSt11char_traitsIcEE
-FN:95,_ZNSoD1Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-DA:86,0
-DA:87,0
-DA:95,0
-DA:112,0
-DA:117,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:509,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:536,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-FN:555,_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-DA:509,0
-DA:510,0
-DA:511,0
-DA:536,0
-DA:537,0
-DA:555,0
-DA:556,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-LF:25
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:536,_ZNSt15basic_streambufIcSt11char_traitsIcEE4setpEPcS3_
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:526,_ZNSt15basic_streambufIcSt11char_traitsIcEE5pbumpEi
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:557,_ZNSt15basic_streambufIcSt11char_traitsIcEE5imbueERKSt6locale
-FN:572,_ZNSt15basic_streambufIcSt11char_traitsIcEE6setbufEPci
-FN:630,_ZNSt15basic_streambufIcSt11char_traitsIcEE9showmanycEv
-FN:668,_ZNSt15basic_streambufIcSt11char_traitsIcEE9underflowEv
-FN:705,_ZNSt15basic_streambufIcSt11char_traitsIcEE9pbackfailEi
-FN:596,_ZNSt15basic_streambufIcSt11char_traitsIcEE7seekposESt4fposI11__mbstate_tESt13_Ios_Openmode
-FN:584,_ZNSt15basic_streambufIcSt11char_traitsIcEE7seekoffExSt12_Ios_SeekdirSt13_Ios_Openmode
-FN:466,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4gptrEv
-FN:479,_ZNSt15basic_streambufIcSt11char_traitsIcEE5gbumpEi
-FN:681,_ZNSt15basic_streambufIcSt11char_traitsIcEE5uflowEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:466,0
-DA:469,0
-DA:479,0
-DA:510,0
-DA:513,0
-DA:526,0
-DA:536,0
-DA:538,0
-DA:539,0
-DA:540,0
-DA:557,0
-DA:558,0
-DA:572,0
-DA:573,0
-DA:584,0
-DA:585,0
-DA:596,0
-DA:597,0
-DA:630,0
-DA:668,0
-DA:669,0
-DA:681,0
-DA:683,0
-DA:685,0
-DA:686,0
-DA:688,0
-DA:689,0
-DA:691,0
-DA:705,0
-DA:706,0
-BA:198,0
-BA:198,0
-BA:686,0
-BA:686,0
-LF:35
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/list.h
-FN:297,_ZN6wibble4list8SingularIiEC1Ei
-FN:330,_ZN6wibble4list8singularIiEENS0_8SingularIT_EERKS3_
-FN:310,_ZN6wibble4list6AppendINS0_8SingularIiEES3_EC1ES3_S3_
-FN:335,_ZN6wibble4list6appendINS0_8SingularIiEES3_EENS0_6AppendIT_T0_EERKS5_RKS6_
-FN:286,_ZNK6wibble4list5EmptyIiE5emptyEv
-FN:285,_ZNK6wibble4list5EmptyIiE4headEv
-FN:287,_ZNK6wibble4list5EmptyIiE4tailEv
-FN:299,_ZNK6wibble4list8SingularIiE5emptyEv
-FN:298,_ZNK6wibble4list8SingularIiE4headEv
-FN:317,_ZNK6wibble4list6AppendINS0_8SingularIiEES3_E5emptyEv
-FN:311,_ZNK6wibble4list6AppendINS0_8SingularIiEES3_E4headEv
-FN:296,_ZN6wibble4list8SingularIiEC1Ev
-FN:300,_ZNK6wibble4list8SingularIiE4tailEv
-FN:318,_ZNK6wibble4list6AppendINS0_8SingularIiEES3_E4tailEv
-DA:285,0
-DA:286,0
-DA:287,0
-DA:296,0
-DA:297,0
-DA:298,0
-DA:299,0
-DA:300,0
-DA:310,0
-DA:311,0
-DA:312,0
-DA:313,0
-DA:314,0
-DA:317,0
-DA:318,0
-DA:319,0
-DA:320,0
-DA:321,0
-DA:323,0
-DA:330,0
-DA:331,0
-DA:335,0
-DA:336,0
-BA:312,0
-BA:312,0
-BA:317,0
-BA:317,0
-BA:317,0
-BA:317,0
-BA:320,0
-BA:320,0
-LF:23
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/operators.h
-FN:29,_ZN6wibble9operatorsplISt23_Rb_tree_const_iteratorIiEEET_RKS4_NS4_15difference_typeE
-DA:29,0
-DA:30,0
-DA:31,0
-LF:3
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/string.h
-FN:336,_ZNK6wibble3str5Split14const_iteratordeEv
-FN:344,_ZNK6wibble3str5Split14const_iteratoreqERKS2_
-FN:350,_ZNK6wibble3str5Split14const_iteratorneERKS2_
-FN:420,_ZNK6wibble3str10YamlStream14const_iteratorptEv
-FN:424,_ZNK6wibble3str10YamlStream14const_iteratoreqERKS2_
-FN:428,_ZNK6wibble3str10YamlStream14const_iteratorneERKS2_
-FN:298,_ZN6wibble3str5Split14const_iteratorC1ERKSsS4_b
-FN:367,_ZNK6wibble3str5Split3endEv
-FN:287,_ZN6wibble3str5Split14const_iteratorC1ERKS2_
-FN:405,_ZN6wibble3str10YamlStream14const_iteratoraSERKS2_
-FN:434,_ZN6wibble3str10YamlStream5beginERSi
-FN:71,_ZN6wibble3str3fmtIiEESsRKT_
-FN:71,_ZN6wibble3str3fmtIA5_cEESsRKT_
-FN:412,_ZN6wibble3str10YamlStream14const_iteratorC1Ev
-FN:435,_ZN6wibble3str10YamlStream3endEv
-FN:405,_ZN6wibble3str10YamlStream14const_iteratorD1Ev
-FN:361,_ZN6wibble3str5SplitC1ERKSsS3_
-FN:287,_ZN6wibble3str5Split14const_iteratorD1Ev
-FN:280,_ZN6wibble3str5SplitD1Ev
-FN:44,_ZN6wibble3strlsINS_4list5EmptyIiEEEERNS_5TPairISoNT_4TypeEE5FirstERSoS6_
-FN:71,_ZN6wibble3str3fmtINS_4list5EmptyIiEEEESsRKT_
-FN:44,_ZN6wibble3strlsINS_4list8SingularIiEEEERNS_5TPairISoNT_4TypeEE5FirstERSoS6_
-FN:71,_ZN6wibble3str3fmtINS_4list8SingularIiEEEESsRKT_
-FN:44,_ZN6wibble3strlsINS_4list6AppendINS2_8SingularIiEES5_EEEERNS_5TPairISoNT_4TypeEE5FirstERSoS8_
-FN:71,_ZN6wibble3str3fmtINS_4list6AppendINS2_8SingularIiEES5_EEEESsRKT_
-FN:300,_ZN6wibble3str5Split14const_iteratorppEv
-FN:294,_ZN6wibble3str5Split14const_iteratorC1ERKSsS4_
-FN:366,_ZNK6wibble3str5Split5beginEv
-FN:371,_ZN6wibble3str4joinINS0_5Split14const_iteratorEEESsRKT_S6_RKSs
-FN:328,_ZNK6wibble3str5Split14const_iterator9remainderEv
-FN:153,_ZN6wibble3str8endsWithERKSsS2_
-FN:145,_ZN6wibble3str10startsWithERKSsS2_
-FN:166,_ZN6wibble3str4trimIFiiEEESsRKSsRKT_
-FN:184,_ZN6wibble3str4trimERKSs
-FN:236,_ZN6wibble3str8joinpathERKSsS2_
-FN:207,_ZN6wibble3str7toupperERKSs
-FN:217,_ZN6wibble3str7tolowerERKSs
-FN:227,_ZN6wibble3str7ucfirstERKSs
-FN:125,_ZN6wibble3str7dirnameERKSs
-FN:115,_ZN6wibble3str8basenameERKSs
-FN:84,_ZN6wibble3str13fmt_containerISt6vectorIiSaIiEEEESsRKT_cc
-FN:110,_ZN6wibble3str3fmtIiEESsRKSt6vectorIT_SaIS3_EE
-FN:84,_ZN6wibble3str13fmt_containerISt3setIiSt4lessIiESaIiEEEESsRKT_cc
-FN:104,_ZN6wibble3str3fmtIiEESsRKSt3setIT_St4lessIS3_ESaIS3_EE
-FN:71,_ZN6wibble3str3fmtIdEESsRKT_
-DA:44,3
-DA:46,3
-DA:47,1
-DA:49,2
-DA:50,7
-DA:51,3
-DA:52,3
-DA:53,1
-DA:54,3
-DA:56,2
-DA:71,23
-DA:73,23
-DA:74,23
-DA:75,23
-DA:84,8
-DA:86,8
-DA:87,8
-DA:88,8
-DA:89,2
-DA:91,6
-DA:92,18
-DA:93,12
-DA:94,12
-DA:95,6
-DA:97,6
-DA:98,6
-DA:99,6
-DA:104,4
-DA:105,4
-DA:110,4
-DA:111,4
-DA:115,4
-DA:117,4
-DA:118,4
-DA:119,1
-DA:121,3
-DA:125,5
-DA:127,5
-DA:128,5
-DA:129,1
-DA:130,4
-DA:132,1
-DA:134,3
-DA:145,5
-DA:147,5
-DA:148,1
-DA:149,4
-DA:153,5
-DA:155,5
-DA:156,1
-DA:157,4
-DA:166,11
-DA:168,11
-DA:169,0
-DA:171,11
-DA:172,11
-DA:173,40
-DA:174,18
-DA:175,36
-DA:176,14
-DA:178,11
-DA:184,9
-DA:186,9
-DA:207,4
-DA:209,4
-DA:210,4
-DA:211,20
-DA:212,16
-DA:213,0
-DA:217,8
-DA:219,8
-DA:220,8
-DA:221,36
-DA:222,28
-DA:223,0
-DA:227,4
-DA:229,4
-DA:230,4
-DA:231,4
-DA:232,4
-DA:236,12
-DA:238,12
-DA:239,0
-DA:240,12
-DA:241,0
-DA:243,12
-DA:244,4
-DA:245,1
-DA:247,3
-DA:249,8
-DA:250,1
-DA:252,7
-DA:280,18
-DA:287,92
-DA:294,18
-DA:296,18
-DA:297,18
-DA:298,72
-DA:300,78
-DA:302,78
-DA:303,18
-DA:307,60
-DA:308,3
-DA:309,1
-DA:311,2
-DA:313,57
-DA:314,60
-DA:316,10
-DA:317,10
-DA:321,50
-DA:322,50
-DA:325,78
-DA:328,8
-DA:330,8
-DA:331,0
-DA:333,8
-DA:336,112
-DA:338,112
-DA:344,4
-DA:348,4
-DA:350,72
-DA:354,72
-DA:361,18
-DA:366,18
-DA:367,72
-DA:371,1
-DA:373,1
-DA:374,1
-DA:375,5
-DA:377,4
-DA:378,1
-DA:380,3
-DA:381,5
-DA:383,1
-DA:405,23
-DA:412,13
-DA:420,14
-DA:422,14
-DA:424,6
-DA:426,6
-DA:428,7
-DA:430,7
-DA:434,6
-DA:435,13
-BA:46,2
-BA:46,1
-BA:46,1
-BA:46,2
-BA:46,1
-BA:46,2
-BA:50,0
-BA:50,0
-BA:50,2
-BA:50,2
-BA:50,2
-BA:50,2
-BA:52,0
-BA:52,0
-BA:52,1
-BA:52,2
-BA:52,2
-BA:52,2
-BA:88,2
-BA:88,2
-BA:88,2
-BA:88,2
-BA:92,2
-BA:92,2
-BA:92,2
-BA:92,2
-BA:94,2
-BA:94,1
-BA:94,2
-BA:94,2
-BA:94,2
-BA:94,2
-BA:94,2
-BA:94,1
-BA:94,2
-BA:94,2
-BA:94,2
-BA:94,2
-BA:118,2
-BA:118,2
-BA:128,2
-BA:128,2
-BA:130,2
-BA:130,2
-BA:147,2
-BA:147,2
-BA:155,2
-BA:155,2
-BA:168,1
-BA:168,2
-BA:173,2
-BA:173,2
-BA:173,2
-BA:173,2
-BA:173,2
-BA:173,2
-BA:175,2
-BA:175,2
-BA:175,2
-BA:175,2
-BA:175,2
-BA:175,2
-BA:211,2
-BA:211,2
-BA:221,2
-BA:221,2
-BA:229,1
-BA:229,2
-BA:238,1
-BA:238,2
-BA:240,1
-BA:240,2
-BA:243,2
-BA:243,2
-BA:244,2
-BA:244,2
-BA:249,2
-BA:249,2
-BA:302,2
-BA:302,2
-BA:307,2
-BA:307,2
-BA:308,2
-BA:308,2
-BA:314,2
-BA:314,2
-BA:330,1
-BA:330,2
-BA:375,2
-BA:375,2
-BA:377,2
-BA:377,2
-LF:144
-LH:138
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:13,_ZN8LocationC1ERKS_
-FN:17,_ZN8LocationC1EPKciSs
-FN:52,_ZlsISsER12AssertFailedS1_T_
-FN:52,_ZlsIPKcER12AssertFailedS3_T_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:41,_ZN12AssertFailedD1Ev
-FN:13,_ZN8LocationD1Ev
-FN:59,_Z9assert_fnIbEv8LocationT_
-FN:67,_Z12assert_eq_fnISsPKcEv8LocationT_T0_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:59,0
-DA:61,0
-DA:62,0
-DA:64,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:75,0
-BA:42,0
-BA:42,0
-BA:61,0
-BA:61,0
-BA:69,0
-BA:69,0
-LF:26
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/string.test.h
-FN:324,_ZN12_GLOBAL__N_110TestString12yamlCommentsEv
-FN:273,_ZN12_GLOBAL__N_110TestString4yamlEv
-FN:46,_ZN12_GLOBAL__N_110TestString7fmtListEv
-FN:247,_ZN12_GLOBAL__N_110TestString6base64Ev
-FN:230,_ZN12_GLOBAL__N_110TestString8normpathEv
-FN:160,_ZN12_GLOBAL__N_110TestString6split1Ev
-FN:222,_ZN12_GLOBAL__N_110TestString4joinEv
-FN:198,_ZN12_GLOBAL__N_110TestString6split4Ev
-FN:180,_ZN12_GLOBAL__N_110TestString6split3Ev
-FN:168,_ZN12_GLOBAL__N_110TestString6split2Ev
-FN:125,_ZN12_GLOBAL__N_110TestString8endsWithEv
-FN:116,_ZN12_GLOBAL__N_110TestString10startsWithEv
-FN:85,_ZN12_GLOBAL__N_110TestString5trim2Ev
-FN:72,_ZN12_GLOBAL__N_110TestString4trimEv
-FN:142,_ZN12_GLOBAL__N_110TestString9urlencodeEv
-FN:134,_ZN12_GLOBAL__N_110TestString8joinpathEv
-FN:99,_ZN12_GLOBAL__N_110TestString7toupperEv
-FN:107,_ZN12_GLOBAL__N_110TestString7ucfirstEv
-FN:91,_ZN12_GLOBAL__N_110TestString7tolowerEv
-FN:63,_ZN12_GLOBAL__N_110TestString7dirnameEv
-FN:55,_ZN12_GLOBAL__N_110TestString8basenameEv
-FN:34,_ZN12_GLOBAL__N_110TestString6fmtVecEv
-FN:22,_ZN12_GLOBAL__N_110TestString6fmtSetEv
-FN:15,_ZN12_GLOBAL__N_110TestString3fmtEv
-DA:15,1
-DA:17,1
-DA:18,2
-DA:19,2
-DA:20,1
-DA:22,1
-DA:24,1
-DA:25,1
-DA:26,1
-DA:27,1
-DA:28,1
-DA:29,1
-DA:30,1
-DA:31,1
-DA:32,1
-DA:34,1
-DA:36,1
-DA:37,1
-DA:38,1
-DA:39,1
-DA:40,1
-DA:41,1
-DA:42,1
-DA:43,1
-DA:44,1
-DA:46,1
-DA:48,1
-DA:49,2
-DA:52,2
-DA:53,1
-DA:55,1
-DA:57,1
-DA:58,2
-DA:59,2
-DA:60,2
-DA:61,1
-DA:63,1
-DA:65,1
-DA:66,2
-DA:67,2
-DA:68,2
-DA:69,2
-DA:70,1
-DA:72,1
-DA:74,1
-DA:75,2
-DA:76,2
-DA:77,2
-DA:78,2
-DA:79,2
-DA:80,2
-DA:81,2
-DA:82,2
-DA:83,1
-DA:85,1
-DA:87,1
-DA:88,2
-DA:89,1
-DA:91,1
-DA:93,1
-DA:94,2
-DA:95,2
-DA:96,2
-DA:97,1
-DA:99,1
-DA:101,1
-DA:102,2
-DA:103,2
-DA:104,2
-DA:105,1
-DA:107,1
-DA:109,1
-DA:110,2
-DA:111,2
-DA:112,2
-DA:113,1
-DA:116,1
-DA:118,1
-DA:119,2
-DA:120,2
-DA:121,2
-DA:122,2
-DA:123,1
-DA:125,1
-DA:127,1
-DA:128,2
-DA:129,2
-DA:130,2
-DA:131,2
-DA:132,1
-DA:134,1
-DA:136,1
-DA:137,2
-DA:138,2
-DA:139,2
-DA:140,1
-DA:142,1
-DA:144,1
-DA:145,2
-DA:146,2
-DA:147,2
-DA:149,2
-DA:150,2
-DA:151,2
-DA:152,2
-DA:153,2
-DA:154,2
-DA:156,2
-DA:157,2
-DA:158,1
-DA:160,1
-DA:162,1
-DA:163,2
-DA:164,1
-DA:165,1
-DA:166,1
-DA:168,1
-DA:170,1
-DA:171,2
-DA:172,1
-DA:173,1
-DA:174,1
-DA:175,1
-DA:176,1
-DA:177,1
-DA:178,1
-DA:180,1
-DA:182,1
-DA:183,2
-DA:184,1
-DA:185,1
-DA:186,1
-DA:187,1
-DA:188,1
-DA:189,1
-DA:190,1
-DA:191,1
-DA:192,1
-DA:193,1
-DA:194,1
-DA:195,1
-DA:196,1
-DA:198,1
-DA:200,1
-DA:201,2
-DA:202,1
-DA:203,1
-DA:204,1
-DA:205,1
-DA:206,1
-DA:207,1
-DA:208,1
-DA:209,1
-DA:210,1
-DA:211,1
-DA:212,1
-DA:213,1
-DA:214,1
-DA:215,1
-DA:216,1
-DA:217,1
-DA:218,1
-DA:219,1
-DA:220,1
-DA:222,1
-DA:224,1
-DA:225,2
-DA:226,2
-DA:227,2
-DA:228,1
-DA:230,1
-DA:232,1
-DA:233,2
-DA:234,2
-DA:235,2
-DA:236,2
-DA:237,2
-DA:238,2
-DA:239,2
-DA:240,2
-DA:241,2
-DA:242,2
-DA:243,2
-DA:244,2
-DA:245,1
-DA:247,1
-DA:250,1
-DA:251,2
-DA:252,2
-DA:253,2
-DA:254,2
-DA:255,2
-DA:256,2
-DA:257,2
-DA:258,2
-DA:259,2
-DA:261,2
-DA:262,2
-DA:263,2
-DA:264,2
-DA:265,2
-DA:266,2
-DA:267,2
-DA:268,2
-DA:269,2
-DA:270,2
-DA:271,1
-DA:273,1
-DA:285,1
-DA:286,1
-DA:288,1
-DA:289,1
-DA:290,1
-DA:291,1
-DA:293,1
-DA:294,1
-DA:295,1
-DA:299,1
-DA:301,1
-DA:302,1
-DA:303,1
-DA:307,1
-DA:309,1
-DA:310,1
-DA:312,1
-DA:313,1
-DA:314,1
-DA:315,1
-DA:317,1
-DA:318,1
-DA:320,1
-DA:321,1
-DA:322,1
-DA:324,1
-DA:336,1
-DA:337,1
-DA:339,1
-DA:340,1
-DA:341,1
-DA:342,1
-DA:344,1
-DA:345,1
-DA:346,1
-DA:350,1
-DA:352,1
-DA:353,1
-DA:355,1
-DA:356,1
-DA:357,1
-DA:358,1
-DA:360,1
-DA:361,1
-DA:363,1
-DA:364,1
-DA:365,1
-LF:255
-LH:255
-end_of_record
-SF:/srv/build/pkg/ept-work/default/wibble/wibble-test-generated-_home_mornfall_dev_pkg_ept-work_wibble_string.cpp
-FN:26,_Z41__static_initialization_and_destruction_0ii
-FN:26,_GLOBAL__I__Z14run_String_fmtv
-FN:26,_Z23run_String_yamlCommentsv
-FN:25,_Z15run_String_yamlv
-FN:6,_Z18run_String_fmtListv
-FN:24,_Z17run_String_base64v
-FN:23,_Z19run_String_normpathv
-FN:18,_Z17run_String_split1v
-FN:22,_Z15run_String_joinv
-FN:21,_Z17run_String_split4v
-FN:20,_Z17run_String_split3v
-FN:19,_Z17run_String_split2v
-FN:15,_Z19run_String_endsWithv
-FN:14,_Z21run_String_startsWithv
-FN:10,_Z16run_String_trim2v
-FN:9,_Z15run_String_trimv
-FN:17,_Z20run_String_urlencodev
-FN:16,_Z19run_String_joinpathv
-FN:12,_Z18run_String_toupperv
-FN:13,_Z18run_String_ucfirstv
-FN:11,_Z18run_String_tolowerv
-FN:8,_Z18run_String_dirnamev
-FN:7,_Z19run_String_basenamev
-FN:5,_Z17run_String_fmtVecv
-FN:4,_Z17run_String_fmtSetv
-FN:3,_Z14run_String_fmtv
-DA:3,1
-DA:4,1
-DA:5,1
-DA:6,1
-DA:7,1
-DA:8,1
-DA:9,1
-DA:10,1
-DA:11,1
-DA:12,1
-DA:13,1
-DA:14,1
-DA:15,1
-DA:16,1
-DA:17,1
-DA:18,1
-DA:19,1
-DA:20,1
-DA:21,1
-DA:22,1
-DA:23,1
-DA:24,1
-DA:25,1
-DA:26,4
-BA:26,2
-BA:26,1
-BA:26,2
-BA:26,1
-LF:24
-LH:24
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeIiEED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaIiED2Ev
-FN:106,_ZNSaIiED1Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeIiEEC2Ev
-FN:98,_ZNSaIiEC2Ev
-FN:104,_ZNSaIiEC1ISt13_Rb_tree_nodeIiEEERKSaIT_E
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:104,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:7
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:701,_ZNKSsixEj
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:543,_ZNKSs5beginEv
-FN:562,_ZNKSs3endEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:192,_ZNKSs4_Rep12_M_is_sharedEv
-FN:652,_ZNKSs8capacityEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:2188,_ZSteqIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_EPKS3_
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-FN:2162,_ZSteqIcEN9__gnu_cxx11__enable_ifIXsrSt9__is_charIT_E7__valueEbE6__typeERKSbIS3_St11char_traitsIS3_ESaIS3_EESC_
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:1579,_ZNKSs4findERKSsj
-FN:306,_ZNKSs8_M_checkEjPKc
-FN:1923,_ZNKSs6substrEjj
-FN:2136,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S3_
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-FN:773,_ZNSspLERKSs
-FN:870,_ZNSs9push_backEc
-FN:791,_ZNSspLEc
-FN:1651,_ZNKSs5rfindEPKcj
-FN:835,_ZNSs6appendEPKc
-FN:782,_ZNSspLEPKc
-DA:178,0
-DA:183,0
-DA:184,0
-DA:192,0
-DA:193,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:306,0
-DA:308,0
-DA:309,0
-DA:310,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:543,0
-DA:544,0
-DA:562,0
-DA:563,0
-DA:606,0
-DA:607,0
-DA:652,0
-DA:653,0
-DA:686,0
-DA:687,0
-DA:701,0
-DA:704,0
-DA:773,0
-DA:774,0
-DA:782,0
-DA:783,0
-DA:791,0
-DA:793,0
-DA:794,0
-DA:835,0
-DA:838,0
-DA:870,0
-DA:872,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:877,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:1579,0
-DA:1580,0
-DA:1651,0
-DA:1654,0
-DA:1923,0
-DA:1925,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2136,9
-DA:2140,9
-DA:2141,9
-DA:2142,0
-DA:2162,0
-DA:2165,0
-DA:2188,0
-DA:2189,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:308,0
-BA:308,0
-BA:341,0
-BA:341,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-LF:101
-LH:3
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-DA:245,0
-DA:246,0
-DA:257,0
-DA:258,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:121,_ZStanSt13_Ios_OpenmodeS_
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:121,0
-DA:122,0
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIPiLb0EE3__bES0_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:268,_ZNSt12__niter_baseIPiLb0EE3__bES0_
-FN:569,_ZNSt20__copy_move_backwardILb0ELb1ESt26random_access_iterator_tagE13__copy_move_bIiEEPT_PKS3_S6_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0EPiS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPiS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardIPiS0_ET0_T_S2_S1_
-FN:375,_ZNSt11__copy_moveILb0ELb1ESt26random_access_iterator_tagE8__copy_mIiEEPT_PKS3_S6_S4_
-FN:385,_ZSt13__copy_move_aILb0EPiS0_ET1_T0_S2_S1_
-FN:430,_ZSt14__copy_move_a2ILb0EPiS0_ET1_T0_S2_S1_
-FN:456,_ZSt4copyIPiS0_ET0_T_S2_S1_
-DA:210,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:268,0
-DA:269,0
-DA:286,0
-DA:287,0
-DA:375,0
-DA:377,0
-DA:379,0
-DA:385,0
-DA:393,0
-DA:396,0
-DA:430,0
-DA:435,0
-DA:456,0
-DA:466,0
-DA:569,0
-DA:571,0
-DA:572,0
-DA:573,0
-DA:579,0
-DA:587,0
-DA:592,0
-DA:597,0
-DA:602,0
-DA:624,0
-DA:636,0
-BA:215,0
-BA:215,0
-LF:29
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:97,_ZSt8_DestroyIPiEvT_S1_
-FN:126,_ZSt8_DestroyIPiiEvT_S1_RSaIT0_E
-DA:97,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-LF:5
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_function.h
-FN:469,_ZNKSt9_IdentityIiEclERKi
-FN:229,_ZNKSt4lessIiEclERKiS2_
-DA:229,0
-DA:230,0
-DA:469,0
-DA:470,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:703,_ZN9__gnu_cxx17__normal_iteratorIPKcSsEppEv
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPKcSsEdeEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKcSsEC1ERKS2_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKcSsE4baseEv
-FN:781,_ZN9__gnu_cxxneIPKcSsEEbRKNS_17__normal_iteratorIT_T0_EES8_
-FN:703,_ZN9__gnu_cxx17__normal_iteratorIPKiSt6vectorIiSaIiEEEppEv
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPKiSt6vectorIiSaIiEEEdeEv
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEE4baseEv
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEdeEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEC1ERKS1_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKiSt6vectorIiSaIiEEEC1ERKS2_
-FN:735,_ZNK9__gnu_cxx17__normal_iteratorIPKiSt6vectorIiSaIiEEEplERS1_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKiSt6vectorIiSaIiEEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKiSt6vectorIiSaIiEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-FN:781,_ZN9__gnu_cxxneIPKiSt6vectorIiSaIiEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-DA:683,38
-DA:695,918
-DA:696,918
-DA:703,238
-DA:705,238
-DA:706,238
-DA:735,6
-DA:736,6
-DA:747,576
-DA:748,576
-DA:769,4
-DA:770,4
-DA:781,284
-DA:782,284
-LF:14
-LH:14
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-FN:135,_ZSt9__advanceISt23_Rb_tree_const_iteratorIiEiEvRT_T0_St26bidirectional_iterator_tag
-FN:173,_ZSt7advanceISt23_Rb_tree_const_iteratorIiEiEvRT_T0_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-DA:135,0
-DA:140,0
-DA:141,0
-DA:142,0
-DA:144,0
-DA:145,0
-DA:146,0
-DA:173,0
-DA:176,0
-DA:177,0
-DA:178,0
-BA:140,0
-BA:140,0
-BA:141,0
-BA:141,0
-BA:144,0
-BA:144,0
-LF:15
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:166,_ZSt19__iterator_categoryISt23_Rb_tree_const_iteratorIiEENSt15iterator_traitsIT_E17iterator_categoryERKS3_
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:166,0
-DA:167,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_pair.h
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIiEbEC1ERKS1_RKb
-FN:73,_ZNSt4pairISsSsEaSERKS0_
-FN:84,_ZNSt4pairISsSsEC1Ev
-FN:73,_ZNSt4pairISsSsED1Ev
-DA:73,23
-DA:84,19
-DA:85,19
-DA:88,0
-DA:89,0
-LF:5
-LH:3
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_set.h
-FN:261,_ZNKSt3setIiSt4lessIiESaIiEE5beginEv
-FN:331,_ZNKSt3setIiSt4lessIiESaIiEE5emptyEv
-FN:270,_ZNKSt3setIiSt4lessIiESaIiEE3endEv
-FN:141,_ZNSt3setIiSt4lessIiESaIiEEC1Ev
-FN:93,_ZNSt3setIiSt4lessIiESaIiEED1Ev
-FN:405,_ZNSt3setIiSt4lessIiESaIiEE6insertESt23_Rb_tree_const_iteratorIiERKi
-DA:93,0
-DA:141,0
-DA:142,0
-DA:261,0
-DA:262,0
-DA:270,0
-DA:271,0
-DA:331,7
-DA:332,7
-DA:405,0
-DA:406,0
-LF:11
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_tree.h
-FN:452,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_M_beginEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorIiEC1ERKSt17_Rb_tree_iteratorIiE
-FN:398,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_Rb_tree_implIS3_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE7_S_leftEPSt18_Rb_tree_node_base
-FN:289,_ZNKSt23_Rb_tree_const_iteratorIiEneERKS0_
-FN:247,_ZNKSt23_Rb_tree_const_iteratorIiEdeEv
-FN:240,_ZNSt23_Rb_tree_const_iteratorIiEC1EPKSt13_Rb_tree_nodeIiE
-FN:603,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5beginEv
-FN:463,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE6_M_endEv
-FN:444,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE12_M_rightmostEv
-FN:641,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE4sizeEv
-FN:436,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE11_M_leftmostEv
-FN:491,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_S_rightEPKSt18_Rb_tree_node_base
-FN:168,_ZNSt17_Rb_tree_iteratorIiEC1EPSt13_Rb_tree_nodeIiE
-FN:415,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_Rb_tree_implIS3_Lb0EE13_M_initializeEv
-FN:637,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5emptyEv
-FN:614,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE3endEv
-FN:495,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE6_S_keyEPKSt18_Rb_tree_node_base
-FN:596,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorIiEeqERKS0_
-FN:403,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_Rb_tree_implIS3_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEEC1Ev
-FN:347,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE21_M_get_Node_allocatorEv
-FN:471,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_S_valueEPKSt13_Rb_tree_nodeIiE
-FN:475,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE6_S_keyEPKSt13_Rb_tree_nodeIiE
-FN:351,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13get_allocatorEv
-FN:360,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE11_M_put_nodeEPSt13_Rb_tree_nodeIiE
-FN:388,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE15_M_destroy_nodeEPSt13_Rb_tree_nodeIiE
-FN:936,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_M_eraseEPSt13_Rb_tree_nodeIiE
-FN:584,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEED1Ev
-FN:356,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE14_M_create_nodeERKi
-FN:270,_ZNSt23_Rb_tree_const_iteratorIiEmmEv
-FN:255,_ZNSt23_Rb_tree_const_iteratorIiEppEv
-FN:846,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE10_M_insert_EPKSt18_Rb_tree_node_baseS8_RKi
-FN:195,_ZNSt17_Rb_tree_iteratorIiEmmEv
-FN:1133,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE16_M_insert_uniqueERKi
-FN:1178,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE17_M_insert_unique_ESt23_Rb_tree_const_iteratorIiERKi
-DA:168,0
-DA:169,0
-DA:195,0
-DA:197,0
-DA:198,0
-DA:210,0
-DA:211,0
-DA:240,0
-DA:241,0
-DA:243,0
-DA:244,0
-DA:247,0
-DA:248,0
-DA:255,0
-DA:257,0
-DA:258,0
-DA:270,0
-DA:272,0
-DA:273,0
-DA:289,88
-DA:290,88
-DA:347,0
-DA:348,0
-DA:351,0
-DA:352,0
-DA:356,0
-DA:357,0
-DA:360,0
-DA:361,0
-DA:364,0
-DA:366,0
-DA:368,0
-DA:369,0
-DA:371,0
-DA:372,0
-DA:374,0
-DA:388,0
-DA:390,0
-DA:391,0
-DA:392,0
-DA:398,0
-DA:403,0
-DA:405,0
-DA:406,0
-DA:415,0
-DA:417,0
-DA:418,0
-DA:419,0
-DA:420,0
-DA:421,0
-DA:436,0
-DA:437,0
-DA:444,0
-DA:445,0
-DA:452,0
-DA:453,0
-DA:463,0
-DA:464,0
-DA:471,0
-DA:472,0
-DA:475,0
-DA:476,0
-DA:479,0
-DA:480,0
-DA:487,0
-DA:488,0
-DA:491,0
-DA:492,0
-DA:495,0
-DA:496,0
-DA:499,0
-DA:500,0
-DA:562,0
-DA:584,0
-DA:585,0
-DA:596,0
-DA:599,0
-DA:603,0
-DA:606,0
-DA:614,0
-DA:617,0
-DA:637,7
-DA:638,7
-DA:641,0
-DA:642,0
-DA:846,0
-DA:850,0
-DA:852,0
-DA:854,0
-DA:857,0
-DA:858,0
-DA:936,0
-DA:939,0
-DA:941,0
-DA:942,0
-DA:943,0
-DA:944,0
-DA:946,0
-DA:1133,0
-DA:1135,0
-DA:1136,0
-DA:1137,0
-DA:1138,0
-DA:1140,0
-DA:1141,0
-DA:1142,0
-DA:1144,0
-DA:1145,0
-DA:1147,0
-DA:1148,0
-DA:1150,0
-DA:1152,0
-DA:1153,0
-DA:1154,0
-DA:1178,0
-DA:1181,0
-DA:1183,0
-DA:1186,0
-DA:1188,0
-DA:1190,0
-DA:1194,0
-DA:1195,0
-DA:1196,0
-DA:1197,0
-DA:1200,0
-DA:1201,0
-DA:1204,0
-DA:1207,0
-DA:1209,0
-DA:1213,0
-DA:1214,0
-DA:1215,0
-DA:1216,0
-DA:1219,0
-DA:1220,0
-DA:1222,0
-DA:1225,0
-DA:1230,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:939,0
-BA:939,0
-BA:1138,0
-BA:1138,0
-BA:1142,0
-BA:1142,0
-BA:1145,0
-BA:1145,0
-BA:1147,0
-BA:1147,0
-BA:1152,0
-BA:1152,0
-BA:1181,0
-BA:1181,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1190,0
-BA:1190,0
-BA:1195,0
-BA:1195,0
-BA:1197,0
-BA:1197,0
-BA:1200,0
-BA:1200,0
-BA:1209,0
-BA:1209,0
-BA:1214,0
-BA:1214,0
-BA:1216,0
-BA:1216,0
-BA:1219,0
-BA:1219,0
-LF:138
-LH:4
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:97,_ZNSt20__uninitialized_copyILb1EE18uninitialized_copyIPiS2_EET0_T_S4_S3_
-FN:113,_ZSt18uninitialized_copyIPiS0_ET0_T_S2_S1_
-FN:261,_ZSt22__uninitialized_copy_aIPiS0_iET0_T_S2_S1_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPiS0_SaIiEET0_T_S3_S2_RT1_
-DA:97,0
-DA:98,0
-DA:113,0
-DA:122,0
-DA:261,0
-DA:262,0
-DA:268,0
-DA:272,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:97,_ZNSt12_Vector_baseIiSaIiEE19_M_get_Tp_allocatorEv
-FN:395,_ZNSt6vectorIiSaIiEE3endEv
-FN:79,_ZNSt12_Vector_baseIiSaIiEE12_Vector_implD1Ev
-FN:386,_ZNKSt6vectorIiSaIiEE5beginEv
-FN:404,_ZNKSt6vectorIiSaIiEE3endEv
-FN:526,_ZNKSt6vectorIiSaIiEE5emptyEv
-FN:484,_ZNKSt6vectorIiSaIiEE4sizeEv
-FN:84,_ZNSt12_Vector_baseIiSaIiEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseIiSaIiEEC2Ev
-FN:213,_ZNSt6vectorIiSaIiEEC1Ev
-FN:101,_ZNKSt12_Vector_baseIiSaIiEE19_M_get_Tp_allocatorEv
-FN:489,_ZNKSt6vectorIiSaIiEE8max_sizeEv
-FN:147,_ZNSt12_Vector_baseIiSaIiEE13_M_deallocateEPij
-FN:135,_ZNSt12_Vector_baseIiSaIiEED2Ev
-FN:299,_ZNSt6vectorIiSaIiEED1Ev
-FN:1075,_ZNKSt6vectorIiSaIiEE12_M_check_lenEjPKc
-FN:143,_ZNSt12_Vector_baseIiSaIiEE11_M_allocateEj
-FN:686,_ZNSt6vectorIiSaIiEE9push_backERKi
-DA:79,0
-DA:84,0
-DA:85,0
-DA:86,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:108,0
-DA:109,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:143,0
-DA:144,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:213,0
-DA:214,0
-DA:299,0
-DA:300,0
-DA:301,0
-DA:386,7
-DA:387,7
-DA:395,0
-DA:396,0
-DA:404,25
-DA:405,25
-DA:484,0
-DA:485,0
-DA:489,0
-DA:490,0
-DA:526,4
-DA:527,4
-DA:686,0
-DA:688,0
-DA:690,0
-DA:691,0
-DA:694,0
-DA:695,0
-DA:1075,0
-DA:1077,0
-DA:1078,0
-DA:1080,0
-DA:1081,0
-BA:144,0
-BA:144,0
-BA:149,0
-BA:149,0
-BA:688,0
-BA:688,0
-BA:1077,0
-BA:1077,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-LF:47
-LH:6
-end_of_record
-SF:/usr/include/c++/4.3/bits/vector.tcc
-FN:283,_ZNSt6vectorIiSaIiEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPiS1_EERKi
-DA:283,0
-DA:286,0
-DA:288,0
-DA:291,0
-DA:293,0
-DA:295,0
-DA:299,0
-DA:307,0
-DA:308,0
-DA:309,0
-DA:316,0
-DA:321,0
-DA:323,0
-DA:324,0
-DA:330,0
-DA:332,0
-DA:333,0
-DA:334,0
-DA:336,0
-DA:338,0
-DA:341,0
-DA:342,0
-DA:343,0
-DA:345,0
-BA:286,0
-BA:286,0
-LF:24
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:107,_ZN9__gnu_cxx13new_allocatorIiE9constructEPiRKi
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:118,_ZN9__gnu_cxx13new_allocatorIiE7destroyEPi
-FN:76,_ZN9__gnu_cxx13new_allocatorIiED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorIiEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorIiE8max_sizeEv
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEE8max_sizeEv
-FN:97,_ZN9__gnu_cxx13new_allocatorIiE10deallocateEPij
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEE10deallocateEPS2_j
-FN:87,_ZN9__gnu_cxx13new_allocatorIiE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEE8allocateEjPKv
-DA:69,0
-DA:71,0
-DA:76,0
-DA:87,0
-DA:89,0
-DA:90,0
-DA:92,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:107,0
-DA:108,0
-DA:118,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:108,0
-BA:108,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/istream
-FN:585,_ZNSiC2Ev
-FN:105,_ZNSiD2Ev
-FN:804,_ZNSdC2Ev
-FN:801,_ZNSdD2Ev
-DA:105,0
-DA:106,0
-DA:585,0
-DA:586,0
-DA:587,0
-DA:801,0
-DA:804,0
-DA:805,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-DA:105,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:213,_ZNSolsEd
-DA:95,0
-DA:112,0
-DA:117,0
-DA:213,0
-DA:214,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:158,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEE17_M_stringbuf_initESt13_Ios_Openmode
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:110,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ERKSsSt13_Ios_Openmode
-FN:526,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEEC1ERKSsSt13_Ios_Openmode
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:536,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:509,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-FN:555,_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:110,0
-DA:111,0
-DA:112,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:158,0
-DA:160,0
-DA:161,0
-DA:162,0
-DA:163,0
-DA:164,0
-DA:165,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-DA:509,0
-DA:510,0
-DA:511,0
-DA:526,0
-DA:527,0
-DA:528,0
-DA:536,0
-DA:537,0
-DA:555,0
-DA:556,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:162,0
-BA:162,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-LF:38
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/amorph.h
-FN:371,_ZNK6wibble6AmorphINS_5RangeIiEENS_14RangeInterfaceIiEELi0EE14morphInterfaceEv
-FN:345,_ZN6wibble6AmorphINS_5RangeIiEENS_14RangeInterfaceIiEELi0EED2Ev
-FN:332,_ZN6wibble6AmorphINS_5RangeIiEENS_14RangeInterfaceIiEELi0EE24setMorphInterfacePointerEPKNS_14MorphInterfaceIS4_EE
-FN:288,_ZN6wibble6AmorphINS_5RangeIiEENS_14RangeInterfaceIiEELi0EEC2ERKS5_
-FN:371,_ZNK6wibble6AmorphINS_8ConsumerIiEENS_17ConsumerInterfaceIiEELi0EE14morphInterfaceEv
-FN:345,_ZN6wibble6AmorphINS_8ConsumerIiEENS_17ConsumerInterfaceIiEELi0EED2Ev
-FN:332,_ZN6wibble6AmorphINS_8ConsumerIiEENS_17ConsumerInterfaceIiEELi0EE24setMorphInterfacePointerEPKNS_14MorphInterfaceIS4_EE
-FN:288,_ZN6wibble6AmorphINS_8ConsumerIiEENS_17ConsumerInterfaceIiEELi0EEC2ERKS5_
-FN:361,_ZNK6wibble6AmorphINS_5RangeIiEENS_14RangeInterfaceIiEELi0EE14implementationEv
-FN:284,_ZN6wibble6AmorphINS_5RangeIiEENS_14RangeInterfaceIiEELi0EEC2ERKNS_14MorphInterfaceIS4_EE
-FN:293,_ZN6wibble6AmorphINS_5RangeIiEENS_14RangeInterfaceIiEELi0EEC2Ev
-FN:366,_ZN6wibble6AmorphINS_8ConsumerIiEENS_17ConsumerInterfaceIiEELi0EE14implementationEv
-FN:366,_ZN6wibble6AmorphINS_5RangeIiEENS_14RangeInterfaceIiEELi0EE14implementationEv
-FN:371,_ZNK6wibble6AmorphINS_8ConsumerIjEENS_17ConsumerInterfaceIjEELi0EE14morphInterfaceEv
-FN:345,_ZN6wibble6AmorphINS_8ConsumerIjEENS_17ConsumerInterfaceIjEELi0EED2Ev
-FN:332,_ZN6wibble6AmorphINS_8ConsumerIjEENS_17ConsumerInterfaceIjEELi0EE24setMorphInterfacePointerEPKNS_14MorphInterfaceIS4_EE
-FN:366,_ZN6wibble6AmorphINS_8ConsumerIjEENS_17ConsumerInterfaceIjEELi0EE14implementationEv
-FN:371,_ZNK6wibble6AmorphINS_5RangeIjEENS_14RangeInterfaceIjEELi0EE14morphInterfaceEv
-FN:345,_ZN6wibble6AmorphINS_5RangeIjEENS_14RangeInterfaceIjEELi0EED2Ev
-FN:332,_ZN6wibble6AmorphINS_5RangeIjEENS_14RangeInterfaceIjEELi0EE24setMorphInterfacePointerEPKNS_14MorphInterfaceIS4_EE
-FN:288,_ZN6wibble6AmorphINS_5RangeIjEENS_14RangeInterfaceIjEELi0EEC2ERKS5_
-FN:361,_ZNK6wibble6AmorphINS_5RangeIjEENS_14RangeInterfaceIjEELi0EE14implementationEv
-FN:100,_ZN6wibble14MorphAllocatorC2Ev
-FN:284,_ZN6wibble6AmorphINS_5RangeIjEENS_14RangeInterfaceIjEELi0EEC2ERKNS_14MorphInterfaceIS4_EE
-FN:366,_ZN6wibble6AmorphINS_5RangeIjEENS_14RangeInterfaceIjEELi0EE14implementationEv
-FN:303,_ZNK6wibble6AmorphINS_5RangeIiEENS_14RangeInterfaceIiEELi0EE3leqERKS2_
-FN:314,_ZNK6wibble6AmorphINS_5RangeIiEENS_14RangeInterfaceIiEELi0EEleERKS2_
-FN:91,_ZN6wibble14MorphInterfaceINS_14RangeInterfaceIiEEEC2Ev
-FN:115,_ZN6wibble9MorphBaseINS_14GeneratedRangeIiPFvRiEPFbRKiEEENS_14RangeInterfaceIiEEEC2ERKS9_
-FN:147,_ZN6wibble5MorphINS_10RangeMorphIiNS_14GeneratedRangeIiPFvRiEPFbRKiEEEEESA_NS_14RangeInterfaceIiEEEC2ERKSA_
-FN:115,_ZN6wibble9MorphBaseINS_13IteratorRangeISt14_List_iteratorIiEEENS_14RangeInterfaceIiEEEC2ERKS4_
-FN:147,_ZN6wibble5MorphINS_10RangeMorphIiNS_13IteratorRangeISt14_List_iteratorIiEEEEES5_NS_14RangeInterfaceIiEEEC2ERKS5_
-FN:284,_ZN6wibble6AmorphINS_8ConsumerIiEENS_17ConsumerInterfaceIiEELi0EEC2ERKNS_14MorphInterfaceIS4_EE
-FN:284,_ZN6wibble6AmorphINS_8ConsumerIjEENS_17ConsumerInterfaceIjEELi0EEC2ERKNS_14MorphInterfaceIS4_EE
-FN:115,_ZN6wibble9MorphBaseINS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEENS_14RangeInterfaceIiEEEC2ERKS9_
-FN:147,_ZN6wibble5MorphINS_10RangeMorphIiNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEEEESA_NS_14RangeInterfaceIiEEEC2ERKSA_
-FN:91,_ZN6wibble14MorphInterfaceINS_14RangeInterfaceIjEEEC2Ev
-FN:303,_ZNK6wibble6AmorphINS_5RangeIjEENS_14RangeInterfaceIjEELi0EE3leqERKS2_
-FN:314,_ZNK6wibble6AmorphINS_5RangeIjEENS_14RangeInterfaceIjEELi0EEleERKS2_
-FN:91,_ZN6wibble14MorphInterfaceINS_17ConsumerInterfaceIiEEEC2Ev
-FN:115,_ZN6wibble9MorphBaseINS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEENS_17ConsumerInterfaceIiEEEC2ERKS7_
-FN:147,_ZN6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEEES8_NS_17ConsumerInterfaceIiEEEC2ERKS8_
-FN:91,_ZN6wibble14MorphInterfaceINS_17ConsumerInterfaceIjEEEC2Ev
-FN:115,_ZN6wibble9MorphBaseINS_20ConsumerFromIteratorIjSt15insert_iteratorISt6vectorIjSaIjEEEEENS_17ConsumerInterfaceIjEEEC2ERKS7_
-FN:147,_ZN6wibble5MorphINS_13ConsumerMorphIjNS_20ConsumerFromIteratorIjSt15insert_iteratorISt6vectorIjSaIjEEEEEEES8_NS_17ConsumerInterfaceIjEEEC2ERKS8_
-FN:115,_ZN6wibble9MorphBaseINS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEEENS_14RangeInterfaceIjEEEC2ERKS9_
-FN:147,_ZN6wibble5MorphINS_10RangeMorphIjNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEEEEESA_NS_14RangeInterfaceIjEEEC2ERKSA_
-FN:91,_ZN6wibble14MorphInterfaceINS_14RangeInterfaceIiEEEC2ERKS3_
-FN:173,_ZN6wibble5MorphINS_10RangeMorphIiNS_11CastedRangeIijEEEES3_NS_14RangeInterfaceIiEEE7destroyEj
-FN:91,_ZN6wibble14MorphInterfaceINS_14RangeInterfaceIjEEEC2ERKS3_
-FN:114,_ZN6wibble9MorphBaseINS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEEENS_14RangeInterfaceIjEEEC2ERKSC_
-FN:144,_ZN6wibble5MorphINS_10RangeMorphIjNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEEEEESA_NS_14RangeInterfaceIjEEEC2ERKSE_
-FN:173,_ZN6wibble5MorphINS_10RangeMorphIjNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEEEEESA_NS_14RangeInterfaceIjEEE7destroyEj
-FN:91,_ZN6wibble14MorphInterfaceINS_17ConsumerInterfaceIjEEEC2ERKS3_
-FN:114,_ZN6wibble9MorphBaseINS_20ConsumerFromIteratorIjSt15insert_iteratorISt6vectorIjSaIjEEEEENS_17ConsumerInterfaceIjEEEC2ERKSA_
-FN:144,_ZN6wibble5MorphINS_13ConsumerMorphIjNS_20ConsumerFromIteratorIjSt15insert_iteratorISt6vectorIjSaIjEEEEEEES8_NS_17ConsumerInterfaceIjEEEC2ERKSC_
-FN:173,_ZN6wibble5MorphINS_13ConsumerMorphIjNS_20ConsumerFromIteratorIjSt15insert_iteratorISt6vectorIjSaIjEEEEEEES8_NS_17ConsumerInterfaceIjEEE7destroyEj
-FN:91,_ZN6wibble14MorphInterfaceINS_17ConsumerInterfaceIiEEEC2ERKS3_
-FN:114,_ZN6wibble9MorphBaseINS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEENS_17ConsumerInterfaceIiEEEC2ERKSA_
-FN:144,_ZN6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEEES8_NS_17ConsumerInterfaceIiEEEC2ERKSC_
-FN:173,_ZN6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEEES8_NS_17ConsumerInterfaceIiEEE7destroyEj
-FN:173,_ZN6wibble5MorphINS_10RangeMorphIjNS_11CastedRangeIjiEEEES3_NS_14RangeInterfaceIjEEE7destroyEj
-FN:114,_ZN6wibble9MorphBaseINS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEENS_14RangeInterfaceIiEEEC2ERKSC_
-FN:144,_ZN6wibble5MorphINS_10RangeMorphIiNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEEEESA_NS_14RangeInterfaceIiEEEC2ERKSE_
-FN:173,_ZN6wibble5MorphINS_10RangeMorphIiNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEEEESA_NS_14RangeInterfaceIiEEE7destroyEj
-FN:114,_ZN6wibble9MorphBaseINS_13IteratorRangeISt14_List_iteratorIiEEENS_14RangeInterfaceIiEEEC2ERKS7_
-FN:144,_ZN6wibble5MorphINS_10RangeMorphIiNS_13IteratorRangeISt14_List_iteratorIiEEEEES5_NS_14RangeInterfaceIiEEEC2ERKS9_
-FN:173,_ZN6wibble5MorphINS_10RangeMorphIiNS_13IteratorRangeISt14_List_iteratorIiEEEEES5_NS_14RangeInterfaceIiEEE7destroyEj
-FN:114,_ZN6wibble9MorphBaseINS_14GeneratedRangeIiPFvRiEPFbRKiEEENS_14RangeInterfaceIiEEEC2ERKSC_
-FN:144,_ZN6wibble5MorphINS_10RangeMorphIiNS_14GeneratedRangeIiPFvRiEPFbRKiEEEEESA_NS_14RangeInterfaceIiEEEC2ERKSE_
-FN:173,_ZN6wibble5MorphINS_10RangeMorphIiNS_14GeneratedRangeIiPFvRiEPFbRKiEEEEESA_NS_14RangeInterfaceIiEEE7destroyEj
-FN:173,_ZN6wibble5MorphINS_10RangeMorphIiNS_16TransformedRangeISt9binder1stISt4plusIiEEEEEES7_NS_14RangeInterfaceIiEEE7destroyEj
-FN:173,_ZN6wibble5MorphINS_10RangeMorphIiNS_13FilteredRangeINS_5RangeIiEESt9binder1stISt8equal_toIiEEEEEES9_NS_14RangeInterfaceIiEEE7destroyEj
-FN:92,_ZN6wibble14MorphInterfaceINS_14RangeInterfaceIjEEE11virtualBaseEv
-FN:92,_ZN6wibble14MorphInterfaceINS_17ConsumerInterfaceIjEEE11virtualBaseEv
-FN:92,_ZN6wibble14MorphInterfaceINS_17ConsumerInterfaceIiEEE11virtualBaseEv
-FN:92,_ZN6wibble14MorphInterfaceINS_14RangeInterfaceIiEEE11virtualBaseEv
-FN:181,_ZNK6wibble5MorphINS_10RangeMorphIiNS_11CastedRangeIijEEEES3_NS_14RangeInterfaceIiEEE7wrappedEv
-FN:185,_ZN6wibble5MorphINS_10RangeMorphIiNS_11CastedRangeIijEEEES3_NS_14RangeInterfaceIiEEE7wrappedEv
-FN:124,_ZN6wibble9MorphBaseINS_11CastedRangeIijEENS_14RangeInterfaceIiEEE11virtualBaseIS2_EENS_8EnableIfINS_4TNotINS_13IsPolymorphicIT_EEEEPNS_11VirtualBaseEE1TEv
-FN:128,_ZN6wibble9MorphBaseINS_11CastedRangeIijEENS_14RangeInterfaceIiEEE11virtualBaseEv
-FN:149,_ZNK6wibble5MorphINS_10RangeMorphIiNS_11CastedRangeIijEEEES3_NS_14RangeInterfaceIiEEE4selfEv
-FN:181,_ZNK6wibble5MorphINS_10RangeMorphIjNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEEEEESA_NS_14RangeInterfaceIjEEE7wrappedEv
-FN:185,_ZN6wibble5MorphINS_10RangeMorphIjNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEEEEESA_NS_14RangeInterfaceIjEEE7wrappedEv
-FN:124,_ZN6wibble9MorphBaseINS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEEENS_14RangeInterfaceIjEEE11virtualBaseIS9_EENS_8EnableIfINS_4TNotINS_13IsPolymorphicIT_EEEEPNS_11VirtualBaseEE1TEv
-FN:128,_ZN6wibble9MorphBaseINS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEEENS_14RangeInterfaceIjEEE11virtualBaseEv
-FN:149,_ZNK6wibble5MorphINS_10RangeMorphIjNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEEEEESA_NS_14RangeInterfaceIjEEE4selfEv
-FN:185,_ZN6wibble5MorphINS_13ConsumerMorphIjNS_20ConsumerFromIteratorIjSt15insert_iteratorISt6vectorIjSaIjEEEEEEES8_NS_17ConsumerInterfaceIjEEE7wrappedEv
-FN:124,_ZN6wibble9MorphBaseINS_20ConsumerFromIteratorIjSt15insert_iteratorISt6vectorIjSaIjEEEEENS_17ConsumerInterfaceIjEEE11virtualBaseIS7_EENS_8EnableIfINS_4TNotINS_13IsPolymorphicIT_EEEEPNS_11VirtualBaseEE1TEv
-FN:128,_ZN6wibble9MorphBaseINS_20ConsumerFromIteratorIjSt15insert_iteratorISt6vectorIjSaIjEEEEENS_17ConsumerInterfaceIjEEE11virtualBaseEv
-FN:149,_ZNK6wibble5MorphINS_13ConsumerMorphIjNS_20ConsumerFromIteratorIjSt15insert_iteratorISt6vectorIjSaIjEEEEEEES8_NS_17ConsumerInterfaceIjEEE4selfEv
-FN:181,_ZNK6wibble5MorphINS_13ConsumerMorphIjNS_20ConsumerFromIteratorIjSt15insert_iteratorISt6vectorIjSaIjEEEEEEES8_NS_17ConsumerInterfaceIjEEE7wrappedEv
-FN:185,_ZN6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEEES8_NS_17ConsumerInterfaceIiEEE7wrappedEv
-FN:124,_ZN6wibble9MorphBaseINS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEENS_17ConsumerInterfaceIiEEE11virtualBaseIS7_EENS_8EnableIfINS_4TNotINS_13IsPolymorphicIT_EEEEPNS_11VirtualBaseEE1TEv
-FN:128,_ZN6wibble9MorphBaseINS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEENS_17ConsumerInterfaceIiEEE11virtualBaseEv
-FN:149,_ZNK6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEEES8_NS_17ConsumerInterfaceIiEEE4selfEv
-FN:181,_ZNK6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEEES8_NS_17ConsumerInterfaceIiEEE7wrappedEv
-FN:181,_ZNK6wibble5MorphINS_10RangeMorphIjNS_11CastedRangeIjiEEEES3_NS_14RangeInterfaceIjEEE7wrappedEv
-FN:185,_ZN6wibble5MorphINS_10RangeMorphIjNS_11CastedRangeIjiEEEES3_NS_14RangeInterfaceIjEEE7wrappedEv
-FN:124,_ZN6wibble9MorphBaseINS_11CastedRangeIjiEENS_14RangeInterfaceIjEEE11virtualBaseIS2_EENS_8EnableIfINS_4TNotINS_13IsPolymorphicIT_EEEEPNS_11VirtualBaseEE1TEv
-FN:128,_ZN6wibble9MorphBaseINS_11CastedRangeIjiEENS_14RangeInterfaceIjEEE11virtualBaseEv
-FN:149,_ZNK6wibble5MorphINS_10RangeMorphIjNS_11CastedRangeIjiEEEES3_NS_14RangeInterfaceIjEEE4selfEv
-FN:181,_ZNK6wibble5MorphINS_10RangeMorphIiNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEEEESA_NS_14RangeInterfaceIiEEE7wrappedEv
-FN:185,_ZN6wibble5MorphINS_10RangeMorphIiNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEEEESA_NS_14RangeInterfaceIiEEE7wrappedEv
-FN:124,_ZN6wibble9MorphBaseINS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEENS_14RangeInterfaceIiEEE11virtualBaseIS9_EENS_8EnableIfINS_4TNotINS_13IsPolymorphicIT_EEEEPNS_11VirtualBaseEE1TEv
-FN:128,_ZN6wibble9MorphBaseINS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEENS_14RangeInterfaceIiEEE11virtualBaseEv
-FN:149,_ZNK6wibble5MorphINS_10RangeMorphIiNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEEEESA_NS_14RangeInterfaceIiEEE4selfEv
-FN:181,_ZNK6wibble5MorphINS_10RangeMorphIiNS_13IteratorRangeISt14_List_iteratorIiEEEEES5_NS_14RangeInterfaceIiEEE7wrappedEv
-FN:185,_ZN6wibble5MorphINS_10RangeMorphIiNS_13IteratorRangeISt14_List_iteratorIiEEEEES5_NS_14RangeInterfaceIiEEE7wrappedEv
-FN:124,_ZN6wibble9MorphBaseINS_13IteratorRangeISt14_List_iteratorIiEEENS_14RangeInterfaceIiEEE11virtualBaseIS4_EENS_8EnableIfINS_4TNotINS_13IsPolymorphicIT_EEEEPNS_11VirtualBaseEE1TEv
-FN:128,_ZN6wibble9MorphBaseINS_13IteratorRangeISt14_List_iteratorIiEEENS_14RangeInterfaceIiEEE11virtualBaseEv
-FN:149,_ZNK6wibble5MorphINS_10RangeMorphIiNS_13IteratorRangeISt14_List_iteratorIiEEEEES5_NS_14RangeInterfaceIiEEE4selfEv
-FN:181,_ZNK6wibble5MorphINS_10RangeMorphIiNS_14GeneratedRangeIiPFvRiEPFbRKiEEEEESA_NS_14RangeInterfaceIiEEE7wrappedEv
-FN:185,_ZN6wibble5MorphINS_10RangeMorphIiNS_14GeneratedRangeIiPFvRiEPFbRKiEEEEESA_NS_14RangeInterfaceIiEEE7wrappedEv
-FN:124,_ZN6wibble9MorphBaseINS_14GeneratedRangeIiPFvRiEPFbRKiEEENS_14RangeInterfaceIiEEE11virtualBaseIS9_EENS_8EnableIfINS_4TNotINS_13IsPolymorphicIT_EEEEPNS_11VirtualBaseEE1TEv
-FN:128,_ZN6wibble9MorphBaseINS_14GeneratedRangeIiPFvRiEPFbRKiEEENS_14RangeInterfaceIiEEE11virtualBaseEv
-FN:149,_ZNK6wibble5MorphINS_10RangeMorphIiNS_14GeneratedRangeIiPFvRiEPFbRKiEEEEESA_NS_14RangeInterfaceIiEEE4selfEv
-FN:181,_ZNK6wibble5MorphINS_10RangeMorphIiNS_16TransformedRangeISt9binder1stISt4plusIiEEEEEES7_NS_14RangeInterfaceIiEEE7wrappedEv
-FN:185,_ZN6wibble5MorphINS_10RangeMorphIiNS_16TransformedRangeISt9binder1stISt4plusIiEEEEEES7_NS_14RangeInterfaceIiEEE7wrappedEv
-FN:124,_ZN6wibble9MorphBaseINS_16TransformedRangeISt9binder1stISt4plusIiEEEENS_14RangeInterfaceIiEEE11virtualBaseIS6_EENS_8EnableIfINS_4TNotINS_13IsPolymorphicIT_EEEEPNS_11VirtualBaseEE1TEv
-FN:128,_ZN6wibble9MorphBaseINS_16TransformedRangeISt9binder1stISt4plusIiEEEENS_14RangeInterfaceIiEEE11virtualBaseEv
-FN:149,_ZNK6wibble5MorphINS_10RangeMorphIiNS_16TransformedRangeISt9binder1stISt4plusIiEEEEEES7_NS_14RangeInterfaceIiEEE4selfEv
-FN:181,_ZNK6wibble5MorphINS_10RangeMorphIiNS_13FilteredRangeINS_5RangeIiEESt9binder1stISt8equal_toIiEEEEEES9_NS_14RangeInterfaceIiEEE7wrappedEv
-FN:185,_ZN6wibble5MorphINS_10RangeMorphIiNS_13FilteredRangeINS_5RangeIiEESt9binder1stISt8equal_toIiEEEEEES9_NS_14RangeInterfaceIiEEE7wrappedEv
-FN:124,_ZN6wibble9MorphBaseINS_13FilteredRangeINS_5RangeIiEESt9binder1stISt8equal_toIiEEEENS_14RangeInterfaceIiEEE11virtualBaseIS8_EENS_8EnableIfINS_4TNotINS_13IsPolymorphicIT_EEEEPNS_11VirtualBaseEE1TEv
-FN:128,_ZN6wibble9MorphBaseINS_13FilteredRangeINS_5RangeIiEESt9binder1stISt8equal_toIiEEEENS_14RangeInterfaceIiEEE11virtualBaseEv
-FN:149,_ZNK6wibble5MorphINS_10RangeMorphIiNS_13FilteredRangeINS_5RangeIiEESt9binder1stISt8equal_toIiEEEEEES9_NS_14RangeInterfaceIiEEE4selfEv
-FN:156,_ZNK6wibble5MorphINS_10RangeMorphIiNS_14GeneratedRangeIiPFvRiEPFbRKiEEEEESA_NS_14RangeInterfaceIiEEE3leqEPKNS_14MorphInterfaceISD_EE
-FN:156,_ZNK6wibble5MorphINS_10RangeMorphIiNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEEEESA_NS_14RangeInterfaceIiEEE3leqEPKNS_14MorphInterfaceISD_EE
-FN:156,_ZNK6wibble5MorphINS_10RangeMorphIjNS_11CastedRangeIjiEEEES3_NS_14RangeInterfaceIjEEE3leqEPKNS_14MorphInterfaceIS6_EE
-FN:316,_ZN6wibble6AmorphINS_5RangeIjEENS_14RangeInterfaceIjEELi0EE19setInterfacePointerEPKS4_
-FN:340,_ZN6wibble6AmorphINS_5RangeIjEENS_14RangeInterfaceIjEELi0EEaSERKS5_
-FN:316,_ZN6wibble6AmorphINS_5RangeIiEENS_14RangeInterfaceIiEELi0EE19setInterfacePointerEPKS4_
-FN:340,_ZN6wibble6AmorphINS_5RangeIiEENS_14RangeInterfaceIiEELi0EEaSERKS5_
-FN:156,_ZNK6wibble5MorphINS_13ConsumerMorphIjNS_20ConsumerFromIteratorIjSt15insert_iteratorISt6vectorIjSaIjEEEEEEES8_NS_17ConsumerInterfaceIjEEE3leqEPKNS_14MorphInterfaceISB_EE
-FN:156,_ZNK6wibble5MorphINS_10RangeMorphIjNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEEEEESA_NS_14RangeInterfaceIjEEE3leqEPKNS_14MorphInterfaceISD_EE
-FN:156,_ZNK6wibble5MorphINS_10RangeMorphIiNS_11CastedRangeIijEEEES3_NS_14RangeInterfaceIiEEE3leqEPKNS_14MorphInterfaceIS6_EE
-FN:156,_ZNK6wibble5MorphINS_10RangeMorphIiNS_16TransformedRangeISt9binder1stISt4plusIiEEEEEES7_NS_14RangeInterfaceIiEEE3leqEPKNS_14MorphInterfaceISA_EE
-FN:156,_ZNK6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEEES8_NS_17ConsumerInterfaceIiEEE3leqEPKNS_14MorphInterfaceISB_EE
-FN:156,_ZNK6wibble5MorphINS_10RangeMorphIiNS_13IteratorRangeISt14_List_iteratorIiEEEEES5_NS_14RangeInterfaceIiEEE3leqEPKNS_14MorphInterfaceIS8_EE
-FN:156,_ZNK6wibble5MorphINS_10RangeMorphIiNS_13FilteredRangeINS_5RangeIiEESt9binder1stISt8equal_toIiEEEEEES9_NS_14RangeInterfaceIiEEE3leqEPKNS_14MorphInterfaceISC_EE
-FN:101,_ZN6wibble14MorphAllocatornwEjPvj
-FN:168,_ZNK6wibble5MorphINS_10RangeMorphIiNS_14GeneratedRangeIiPFvRiEPFbRKiEEEEESA_NS_14RangeInterfaceIiEEE13constructCopyEPvj
-FN:168,_ZNK6wibble5MorphINS_10RangeMorphIiNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEEEESA_NS_14RangeInterfaceIiEEE13constructCopyEPvj
-FN:168,_ZNK6wibble5MorphINS_13ConsumerMorphIjNS_20ConsumerFromIteratorIjSt15insert_iteratorISt6vectorIjSaIjEEEEEEES8_NS_17ConsumerInterfaceIjEEE13constructCopyEPvj
-FN:168,_ZNK6wibble5MorphINS_10RangeMorphIjNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEEEEESA_NS_14RangeInterfaceIjEEE13constructCopyEPvj
-FN:168,_ZNK6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEEES8_NS_17ConsumerInterfaceIiEEE13constructCopyEPvj
-FN:168,_ZNK6wibble5MorphINS_10RangeMorphIiNS_13IteratorRangeISt14_List_iteratorIiEEEEES5_NS_14RangeInterfaceIiEEE13constructCopyEPvj
-FN:95,_ZN6wibble14MorphInterfaceINS_14RangeInterfaceIiEEED2Ev
-FN:114,_ZN6wibble9MorphBaseINS_11CastedRangeIijEENS_14RangeInterfaceIiEEEC2ERKS5_
-FN:144,_ZN6wibble5MorphINS_10RangeMorphIiNS_11CastedRangeIijEEEES3_NS_14RangeInterfaceIiEEEC2ERKS7_
-FN:168,_ZNK6wibble5MorphINS_10RangeMorphIiNS_11CastedRangeIijEEEES3_NS_14RangeInterfaceIiEEE13constructCopyEPvj
-FN:115,_ZN6wibble9MorphBaseINS_11CastedRangeIijEENS_14RangeInterfaceIiEEEC2ERKS2_
-FN:147,_ZN6wibble5MorphINS_10RangeMorphIiNS_11CastedRangeIijEEEES3_NS_14RangeInterfaceIiEEEC2ERKS3_
-FN:114,_ZN6wibble9MorphBaseINS_16TransformedRangeISt9binder1stISt4plusIiEEEENS_14RangeInterfaceIiEEEC2ERKS9_
-FN:144,_ZN6wibble5MorphINS_10RangeMorphIiNS_16TransformedRangeISt9binder1stISt4plusIiEEEEEES7_NS_14RangeInterfaceIiEEEC2ERKSB_
-FN:168,_ZNK6wibble5MorphINS_10RangeMorphIiNS_16TransformedRangeISt9binder1stISt4plusIiEEEEEES7_NS_14RangeInterfaceIiEEE13constructCopyEPvj
-FN:115,_ZN6wibble9MorphBaseINS_16TransformedRangeISt9binder1stISt4plusIiEEEENS_14RangeInterfaceIiEEEC2ERKS6_
-FN:147,_ZN6wibble5MorphINS_10RangeMorphIiNS_16TransformedRangeISt9binder1stISt4plusIiEEEEEES7_NS_14RangeInterfaceIiEEEC2ERKS7_
-FN:114,_ZN6wibble9MorphBaseINS_13FilteredRangeINS_5RangeIiEESt9binder1stISt8equal_toIiEEEENS_14RangeInterfaceIiEEEC2ERKSB_
-FN:144,_ZN6wibble5MorphINS_10RangeMorphIiNS_13FilteredRangeINS_5RangeIiEESt9binder1stISt8equal_toIiEEEEEES9_NS_14RangeInterfaceIiEEEC2ERKSD_
-FN:168,_ZNK6wibble5MorphINS_10RangeMorphIiNS_13FilteredRangeINS_5RangeIiEESt9binder1stISt8equal_toIiEEEEEES9_NS_14RangeInterfaceIiEEE13constructCopyEPvj
-FN:115,_ZN6wibble9MorphBaseINS_13FilteredRangeINS_5RangeIiEESt9binder1stISt8equal_toIiEEEENS_14RangeInterfaceIiEEEC2ERKS8_
-FN:147,_ZN6wibble5MorphINS_10RangeMorphIiNS_13FilteredRangeINS_5RangeIiEESt9binder1stISt8equal_toIiEEEEEES9_NS_14RangeInterfaceIiEEEC2ERKS9_
-FN:114,_ZN6wibble9MorphBaseINS_14GeneratedRangeIiPFvRiEPFbRKiEEENS_14RangeInterfaceIiEEED2Ev
-FN:189,_ZN6wibble5MorphINS_10RangeMorphIiNS_14GeneratedRangeIiPFvRiEPFbRKiEEEEESA_NS_14RangeInterfaceIiEEED0Ev
-FN:95,_ZN6wibble14MorphInterfaceINS_14RangeInterfaceIiEEED0Ev
-FN:95,_ZN6wibble14MorphInterfaceINS_14RangeInterfaceIiEEED1Ev
-FN:189,_ZN6wibble5MorphINS_10RangeMorphIiNS_14GeneratedRangeIiPFvRiEPFbRKiEEEEESA_NS_14RangeInterfaceIiEEED1Ev
-FN:189,_ZN6wibble5MorphINS_10RangeMorphIiNS_14GeneratedRangeIiPFvRiEPFbRKiEEEEESA_NS_14RangeInterfaceIiEEED2Ev
-FN:114,_ZN6wibble9MorphBaseINS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEENS_14RangeInterfaceIiEEED2Ev
-FN:189,_ZN6wibble5MorphINS_10RangeMorphIiNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEEEESA_NS_14RangeInterfaceIiEEED0Ev
-FN:189,_ZN6wibble5MorphINS_10RangeMorphIiNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEEEESA_NS_14RangeInterfaceIiEEED1Ev
-FN:189,_ZN6wibble5MorphINS_10RangeMorphIiNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEEEESA_NS_14RangeInterfaceIiEEED2Ev
-FN:95,_ZN6wibble14MorphInterfaceINS_14RangeInterfaceIjEEED2Ev
-FN:114,_ZN6wibble9MorphBaseINS_11CastedRangeIjiEENS_14RangeInterfaceIjEEEC2ERKS5_
-FN:144,_ZN6wibble5MorphINS_10RangeMorphIjNS_11CastedRangeIjiEEEES3_NS_14RangeInterfaceIjEEEC2ERKS7_
-FN:168,_ZNK6wibble5MorphINS_10RangeMorphIjNS_11CastedRangeIjiEEEES3_NS_14RangeInterfaceIjEEE13constructCopyEPvj
-FN:115,_ZN6wibble9MorphBaseINS_11CastedRangeIjiEENS_14RangeInterfaceIjEEEC2ERKS2_
-FN:147,_ZN6wibble5MorphINS_10RangeMorphIjNS_11CastedRangeIjiEEEES3_NS_14RangeInterfaceIjEEEC2ERKS3_
-FN:114,_ZN6wibble9MorphBaseINS_11CastedRangeIjiEENS_14RangeInterfaceIjEEED2Ev
-FN:189,_ZN6wibble5MorphINS_10RangeMorphIjNS_11CastedRangeIjiEEEES3_NS_14RangeInterfaceIjEEED0Ev
-FN:95,_ZN6wibble14MorphInterfaceINS_14RangeInterfaceIjEEED0Ev
-FN:95,_ZN6wibble14MorphInterfaceINS_14RangeInterfaceIjEEED1Ev
-FN:189,_ZN6wibble5MorphINS_10RangeMorphIjNS_11CastedRangeIjiEEEES3_NS_14RangeInterfaceIjEEED1Ev
-FN:189,_ZN6wibble5MorphINS_10RangeMorphIjNS_11CastedRangeIjiEEEES3_NS_14RangeInterfaceIjEEED2Ev
-FN:95,_ZN6wibble14MorphInterfaceINS_17ConsumerInterfaceIjEEED2Ev
-FN:114,_ZN6wibble9MorphBaseINS_20ConsumerFromIteratorIjSt15insert_iteratorISt6vectorIjSaIjEEEEENS_17ConsumerInterfaceIjEEED2Ev
-FN:189,_ZN6wibble5MorphINS_13ConsumerMorphIjNS_20ConsumerFromIteratorIjSt15insert_iteratorISt6vectorIjSaIjEEEEEEES8_NS_17ConsumerInterfaceIjEEED0Ev
-FN:95,_ZN6wibble14MorphInterfaceINS_17ConsumerInterfaceIjEEED0Ev
-FN:95,_ZN6wibble14MorphInterfaceINS_17ConsumerInterfaceIjEEED1Ev
-FN:189,_ZN6wibble5MorphINS_13ConsumerMorphIjNS_20ConsumerFromIteratorIjSt15insert_iteratorISt6vectorIjSaIjEEEEEEES8_NS_17ConsumerInterfaceIjEEED1Ev
-FN:189,_ZN6wibble5MorphINS_13ConsumerMorphIjNS_20ConsumerFromIteratorIjSt15insert_iteratorISt6vectorIjSaIjEEEEEEES8_NS_17ConsumerInterfaceIjEEED2Ev
-FN:114,_ZN6wibble9MorphBaseINS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEEENS_14RangeInterfaceIjEEED2Ev
-FN:189,_ZN6wibble5MorphINS_10RangeMorphIjNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEEEEESA_NS_14RangeInterfaceIjEEED0Ev
-FN:189,_ZN6wibble5MorphINS_10RangeMorphIjNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEEEEESA_NS_14RangeInterfaceIjEEED1Ev
-FN:189,_ZN6wibble5MorphINS_10RangeMorphIjNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEEEEESA_NS_14RangeInterfaceIjEEED2Ev
-FN:114,_ZN6wibble9MorphBaseINS_11CastedRangeIijEENS_14RangeInterfaceIiEEED2Ev
-FN:189,_ZN6wibble5MorphINS_10RangeMorphIiNS_11CastedRangeIijEEEES3_NS_14RangeInterfaceIiEEED0Ev
-FN:189,_ZN6wibble5MorphINS_10RangeMorphIiNS_11CastedRangeIijEEEES3_NS_14RangeInterfaceIiEEED1Ev
-FN:189,_ZN6wibble5MorphINS_10RangeMorphIiNS_11CastedRangeIijEEEES3_NS_14RangeInterfaceIiEEED2Ev
-FN:114,_ZN6wibble9MorphBaseINS_16TransformedRangeISt9binder1stISt4plusIiEEEENS_14RangeInterfaceIiEEED2Ev
-FN:189,_ZN6wibble5MorphINS_10RangeMorphIiNS_16TransformedRangeISt9binder1stISt4plusIiEEEEEES7_NS_14RangeInterfaceIiEEED0Ev
-FN:189,_ZN6wibble5MorphINS_10RangeMorphIiNS_16TransformedRangeISt9binder1stISt4plusIiEEEEEES7_NS_14RangeInterfaceIiEEED1Ev
-FN:189,_ZN6wibble5MorphINS_10RangeMorphIiNS_16TransformedRangeISt9binder1stISt4plusIiEEEEEES7_NS_14RangeInterfaceIiEEED2Ev
-FN:95,_ZN6wibble14MorphInterfaceINS_17ConsumerInterfaceIiEEED2Ev
-FN:114,_ZN6wibble9MorphBaseINS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEENS_17ConsumerInterfaceIiEEED2Ev
-FN:189,_ZN6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEEES8_NS_17ConsumerInterfaceIiEEED0Ev
-FN:95,_ZN6wibble14MorphInterfaceINS_17ConsumerInterfaceIiEEED0Ev
-FN:95,_ZN6wibble14MorphInterfaceINS_17ConsumerInterfaceIiEEED1Ev
-FN:189,_ZN6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEEES8_NS_17ConsumerInterfaceIiEEED1Ev
-FN:189,_ZN6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEEES8_NS_17ConsumerInterfaceIiEEED2Ev
-FN:114,_ZN6wibble9MorphBaseINS_13IteratorRangeISt14_List_iteratorIiEEENS_14RangeInterfaceIiEEED2Ev
-FN:189,_ZN6wibble5MorphINS_10RangeMorphIiNS_13IteratorRangeISt14_List_iteratorIiEEEEES5_NS_14RangeInterfaceIiEEED0Ev
-FN:189,_ZN6wibble5MorphINS_10RangeMorphIiNS_13IteratorRangeISt14_List_iteratorIiEEEEES5_NS_14RangeInterfaceIiEEED1Ev
-FN:189,_ZN6wibble5MorphINS_10RangeMorphIiNS_13IteratorRangeISt14_List_iteratorIiEEEEES5_NS_14RangeInterfaceIiEEED2Ev
-FN:114,_ZN6wibble9MorphBaseINS_13FilteredRangeINS_5RangeIiEESt9binder1stISt8equal_toIiEEEENS_14RangeInterfaceIiEEED2Ev
-FN:189,_ZN6wibble5MorphINS_10RangeMorphIiNS_13FilteredRangeINS_5RangeIiEESt9binder1stISt8equal_toIiEEEEEES9_NS_14RangeInterfaceIiEEED0Ev
-FN:189,_ZN6wibble5MorphINS_10RangeMorphIiNS_13FilteredRangeINS_5RangeIiEESt9binder1stISt8equal_toIiEEEEEES9_NS_14RangeInterfaceIiEEED1Ev
-FN:189,_ZN6wibble5MorphINS_10RangeMorphIiNS_13FilteredRangeINS_5RangeIiEESt9binder1stISt8equal_toIiEEEEEES9_NS_14RangeInterfaceIiEEED2Ev
-DA:91,28
-DA:92,0
-DA:95,25
-DA:100,0
-DA:101,0
-DA:102,0
-DA:103,0
-DA:104,0
-DA:106,0
-DA:114,330
-DA:115,15
-DA:124,0
-DA:125,0
-DA:128,0
-DA:129,0
-DA:144,167
-DA:147,15
-DA:149,167
-DA:156,39
-DA:157,39
-DA:158,39
-DA:159,0
-DA:160,0
-DA:162,0
-DA:164,39
-DA:168,167
-DA:170,167
-DA:173,148
-DA:174,148
-DA:175,0
-DA:177,148
-DA:179,148
-DA:181,112
-DA:182,112
-DA:185,63
-DA:186,63
-DA:189,163
-DA:284,3
-DA:285,3
-DA:286,3
-DA:288,19
-DA:289,19
-DA:291,19
-DA:293,3
-DA:303,4
-DA:304,4
-DA:305,4
-DA:306,4
-DA:308,0
-DA:310,0
-DA:314,4
-DA:316,3
-DA:317,3
-DA:318,0
-DA:319,0
-DA:326,3
-DA:332,22
-DA:333,22
-DA:334,0
-DA:335,0
-DA:337,22
-DA:340,3
-DA:341,3
-DA:342,3
-DA:345,22
-DA:346,22
-DA:347,22
-DA:348,22
-DA:361,8
-DA:363,8
-DA:366,9
-DA:368,9
-DA:371,79
-DA:372,79
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,1
-BA:95,2
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,1
-BA:95,2
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:102,0
-BA:102,0
-BA:102,0
-BA:102,0
-BA:114,1
-BA:114,2
-BA:114,0
-BA:114,0
-BA:114,0
-BA:114,0
-BA:114,1
-BA:114,2
-BA:114,0
-BA:114,0
-BA:114,0
-BA:114,0
-BA:114,1
-BA:114,2
-BA:114,0
-BA:114,0
-BA:114,0
-BA:114,0
-BA:114,1
-BA:114,2
-BA:114,0
-BA:114,0
-BA:114,0
-BA:114,0
-BA:114,1
-BA:114,2
-BA:114,0
-BA:114,0
-BA:114,0
-BA:114,0
-BA:114,1
-BA:114,2
-BA:114,0
-BA:114,0
-BA:114,0
-BA:114,0
-BA:114,1
-BA:114,2
-BA:114,0
-BA:114,0
-BA:114,0
-BA:114,0
-BA:114,0
-BA:114,0
-BA:114,0
-BA:114,0
-BA:114,0
-BA:114,0
-BA:114,0
-BA:114,0
-BA:114,0
-BA:114,0
-BA:114,0
-BA:114,0
-BA:114,1
-BA:114,2
-BA:114,0
-BA:114,0
-BA:114,0
-BA:114,0
-BA:157,1
-BA:157,2
-BA:157,1
-BA:157,2
-BA:157,1
-BA:157,2
-BA:157,0
-BA:157,0
-BA:157,1
-BA:157,2
-BA:157,1
-BA:157,2
-BA:157,1
-BA:157,2
-BA:157,0
-BA:157,0
-BA:157,0
-BA:157,0
-BA:157,1
-BA:157,2
-BA:158,1
-BA:158,2
-BA:158,1
-BA:158,2
-BA:158,1
-BA:158,2
-BA:158,0
-BA:158,0
-BA:158,1
-BA:158,2
-BA:158,1
-BA:158,2
-BA:158,1
-BA:158,2
-BA:158,0
-BA:158,0
-BA:158,0
-BA:158,0
-BA:158,1
-BA:158,2
-BA:159,0
-BA:159,0
-BA:159,0
-BA:159,0
-BA:159,0
-BA:159,0
-BA:159,0
-BA:159,0
-BA:159,0
-BA:159,0
-BA:159,0
-BA:159,0
-BA:159,0
-BA:159,0
-BA:159,0
-BA:159,0
-BA:159,0
-BA:159,0
-BA:159,0
-BA:159,0
-BA:174,1
-BA:174,2
-BA:174,1
-BA:174,2
-BA:174,1
-BA:174,2
-BA:174,0
-BA:174,0
-BA:174,1
-BA:174,2
-BA:174,1
-BA:174,2
-BA:174,0
-BA:174,0
-BA:174,1
-BA:174,2
-BA:174,1
-BA:174,2
-BA:174,1
-BA:174,2
-BA:177,2
-BA:177,1
-BA:177,2
-BA:177,1
-BA:177,2
-BA:177,1
-BA:177,0
-BA:177,0
-BA:177,2
-BA:177,1
-BA:177,2
-BA:177,1
-BA:177,0
-BA:177,0
-BA:177,2
-BA:177,1
-BA:177,2
-BA:177,1
-BA:177,2
-BA:177,1
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,1
-BA:189,2
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,1
-BA:189,2
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,1
-BA:189,2
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,1
-BA:189,2
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,1
-BA:189,2
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,1
-BA:189,2
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,1
-BA:189,2
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,1
-BA:189,2
-BA:304,0
-BA:304,0
-BA:304,2
-BA:304,1
-BA:305,0
-BA:305,0
-BA:305,2
-BA:305,1
-BA:317,1
-BA:317,2
-BA:317,0
-BA:317,0
-BA:326,2
-BA:326,1
-BA:326,0
-BA:326,0
-BA:333,0
-BA:333,0
-BA:333,0
-BA:333,0
-BA:333,1
-BA:333,2
-BA:333,1
-BA:333,2
-BA:346,0
-BA:346,0
-BA:346,0
-BA:346,0
-BA:346,2
-BA:346,1
-BA:346,2
-BA:346,1
-LF:74
-LH:53
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/consumer.h
-FN:66,_ZN6wibble8ConsumerIiED1Ev
-FN:66,_ZN6wibble8ConsumerIiEC1ERKS1_
-FN:77,_ZN6wibble8ConsumerIiE7consumeERKi
-FN:66,_ZN6wibble8ConsumerIjED1Ev
-FN:77,_ZN6wibble8ConsumerIjE7consumeERKj
-FN:48,_ZN6wibble13ConsumerMixinIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEEC2Ev
-FN:91,_ZN6wibble20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEC1ES5_
-FN:48,_ZN6wibble13ConsumerMixinIjNS_20ConsumerFromIteratorIjSt15insert_iteratorISt6vectorIjSaIjEEEEEEC2Ev
-FN:91,_ZN6wibble20ConsumerFromIteratorIjSt15insert_iteratorISt6vectorIjSaIjEEEEC1ES5_
-FN:48,_ZN6wibble13ConsumerMixinIiNS_8ConsumerIiEEEC2Ev
-FN:48,_ZN6wibble13ConsumerMixinIjNS_8ConsumerIjEEEC2Ev
-FN:74,_ZN6wibble8ConsumerIiEC1ERKNS_14MorphInterfaceINS_17ConsumerInterfaceIiEEEE
-FN:81,_ZN6wibble8ConsumerIiEaSERKi
-FN:74,_ZN6wibble8ConsumerIjEC1ERKNS_14MorphInterfaceINS_17ConsumerInterfaceIjEEEE
-FN:21,_ZN6wibble17ConsumerInterfaceIiEC2Ev
-FN:32,_ZN6wibble13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEEC1ERKS7_
-FN:49,_ZN6wibble13ConsumerMixinIiNS_8ConsumerIiEEE4selfEv
-FN:56,_ZN6wibble13ConsumerMixinIiNS_8ConsumerIiEEEdeEv
-FN:54,_ZN6wibble13ConsumerMixinIiNS_8ConsumerIiEEEppEv
-FN:21,_ZN6wibble17ConsumerInterfaceIjEC2Ev
-FN:32,_ZN6wibble13ConsumerMorphIjNS_20ConsumerFromIteratorIjSt15insert_iteratorISt6vectorIjSaIjEEEEEEC1ERKS7_
-FN:21,_ZN6wibble17ConsumerInterfaceIjEC2ERKS1_
-FN:30,_ZN6wibble13ConsumerMorphIjNS_20ConsumerFromIteratorIjSt15insert_iteratorISt6vectorIjSaIjEEEEEEC1ERKS8_
-FN:21,_ZN6wibble17ConsumerInterfaceIiEC2ERKS1_
-FN:30,_ZN6wibble13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEEC1ERKS8_
-FN:53,_ZNK6wibble13ConsumerMixinIjNS_20ConsumerFromIteratorIjSt15insert_iteratorISt6vectorIjSaIjEEEEEEleERKS7_
-FN:53,_ZNK6wibble13ConsumerMixinIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEEleERKS7_
-FN:38,_ZN6wibble13ConsumerMorphIjNS_20ConsumerFromIteratorIjSt15insert_iteratorISt6vectorIjSaIjEEEEEE7consumeENS_5RangeIjEE
-FN:38,_ZN6wibble13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEE7consumeENS_5RangeIiEE
-FN:25,_ZN6wibble17ConsumerInterfaceIjED2Ev
-FN:25,_ZN6wibble17ConsumerInterfaceIjED0Ev
-FN:25,_ZN6wibble17ConsumerInterfaceIjED1Ev
-FN:30,_ZN6wibble13ConsumerMorphIjNS_20ConsumerFromIteratorIjSt15insert_iteratorISt6vectorIjSaIjEEEEEED1Ev
-FN:101,_ZN6wibble13consumerMorphINS_20ConsumerFromIteratorIjSt15insert_iteratorISt6vectorIjSaIjEEEEEEENS_8ConsumerINT_12ConsumedTypeEEES9_
-FN:107,_ZN6wibble8consumerISt15insert_iteratorISt6vectorIjSaIjEEEEENS_8ConsumerINT_14container_type10value_typeEEES7_
-FN:114,_ZN6wibble8consumerISt6vectorIjSaIjEEEENS_6IsTypeINS_8ConsumerINT_10value_typeEEENS6_8iteratorEE1TERS6_
-FN:25,_ZN6wibble17ConsumerInterfaceIiED2Ev
-FN:25,_ZN6wibble17ConsumerInterfaceIiED0Ev
-FN:25,_ZN6wibble17ConsumerInterfaceIiED1Ev
-FN:30,_ZN6wibble13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEED1Ev
-FN:101,_ZN6wibble13consumerMorphINS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEEENS_8ConsumerINT_12ConsumedTypeEEES9_
-FN:107,_ZN6wibble8consumerISt15insert_iteratorISt6vectorIiSaIiEEEEENS_8ConsumerINT_14container_type10value_typeEEES7_
-FN:114,_ZN6wibble8consumerISt6vectorIiSaIiEEEENS_6IsTypeINS_8ConsumerINT_10value_typeEEENS6_8iteratorEE1TERS6_
-FN:92,_ZN6wibble20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEE7consumeERKi
-FN:34,_ZN6wibble13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEE7consumeERKi
-FN:92,_ZN6wibble20ConsumerFromIteratorIjSt15insert_iteratorISt6vectorIjSaIjEEEE7consumeERKj
-FN:34,_ZN6wibble13ConsumerMorphIjNS_20ConsumerFromIteratorIjSt15insert_iteratorISt6vectorIjSaIjEEEEEE7consumeERKj
-DA:21,2
-DA:25,2
-DA:30,3
-DA:32,1
-DA:34,2
-DA:35,2
-DA:38,0
-DA:39,0
-DA:40,0
-DA:41,0
-DA:43,0
-DA:48,2
-DA:49,0
-DA:53,0
-DA:54,0
-DA:56,0
-DA:66,1
-DA:74,1
-DA:77,2
-DA:78,2
-DA:81,0
-DA:82,0
-DA:83,0
-DA:91,1
-DA:92,2
-DA:93,2
-DA:94,2
-DA:95,2
-DA:101,1
-DA:102,1
-DA:107,1
-DA:109,1
-DA:114,1
-DA:115,1
-BA:25,1
-BA:25,2
-BA:25,0
-BA:25,0
-BA:25,0
-BA:25,0
-BA:25,0
-BA:25,0
-BA:25,0
-BA:25,0
-BA:25,0
-BA:25,0
-BA:30,2
-BA:30,1
-BA:30,1
-BA:30,2
-BA:30,0
-BA:30,0
-BA:30,0
-BA:30,0
-BA:39,0
-BA:39,0
-BA:39,0
-BA:39,0
-LF:34
-LH:22
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/mixin.h
-FN:13,_ZN6wibble5mixin10ComparableINS_5RangeIiEEEC2Ev
-FN:13,_ZN6wibble5mixin10ComparableINS_13IteratorRangeISt14_List_iteratorIiEEEEC2Ev
-FN:13,_ZN6wibble5mixin10ComparableINS_13RangeIteratorINS_5RangeIiEEEEEC2Ev
-FN:15,_ZNK6wibble5mixin10ComparableINS_13RangeIteratorINS_5RangeIiEEEEE7cmpSelfEv
-FN:13,_ZN6wibble5mixin10ComparableINS_13FilteredRangeINS_5RangeIiEESt9binder1stISt8equal_toIiEEEEEC2Ev
-FN:13,_ZN6wibble5mixin10ComparableINS_16TransformedRangeISt9binder1stISt4plusIiEEEEEC2Ev
-FN:13,_ZN6wibble5mixin10ComparableINS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEEEC2Ev
-FN:13,_ZN6wibble5mixin10ComparableINS_11CastedRangeIjiEEEC2Ev
-FN:13,_ZN6wibble5mixin10ComparableINS_5RangeIjEEEC2Ev
-FN:13,_ZN6wibble5mixin10ComparableINS_14GeneratedRangeIiPFvRiEPFbRKiEEEEC2Ev
-FN:13,_ZN6wibble5mixin10ComparableINS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEEC2Ev
-FN:13,_ZN6wibble5mixin10ComparableINS_5MorphINS_10RangeMorphIiNS_13FilteredRangeINS_5RangeIiEESt9binder1stISt8equal_toIiEEEEEESB_NS_14RangeInterfaceIiEEEEEC2Ev
-FN:13,_ZN6wibble5mixin10ComparableINS_5MorphINS_10RangeMorphIiNS_16TransformedRangeISt9binder1stISt4plusIiEEEEEES9_NS_14RangeInterfaceIiEEEEEC2Ev
-FN:13,_ZN6wibble5mixin10ComparableINS_20ConsumerFromIteratorIjSt15insert_iteratorISt6vectorIjSaIjEEEEEEC2Ev
-FN:13,_ZN6wibble5mixin10ComparableINS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEEEEC2Ev
-FN:13,_ZN6wibble5mixin10ComparableINS_11CastedRangeIijEEEC2Ev
-FN:13,_ZN6wibble5mixin10ComparableINS_13RangeIteratorINS_5RangeIjEEEEEC2Ev
-FN:15,_ZNK6wibble5mixin10ComparableINS_13RangeIteratorINS_5RangeIjEEEEE7cmpSelfEv
-FN:13,_ZN6wibble5mixin10ComparableINS_5MorphINS_10RangeMorphIiNS_14GeneratedRangeIiPFvRiEPFbRKiEEEEESC_NS_14RangeInterfaceIiEEEEEC2Ev
-FN:13,_ZN6wibble5mixin10ComparableINS_5MorphINS_10RangeMorphIiNS_13IteratorRangeISt14_List_iteratorIiEEEEES7_NS_14RangeInterfaceIiEEEEEC2Ev
-FN:23,_ZNK6wibble5mixin10ComparableINS_13RangeIteratorINS_5RangeIiEEEEEeqERKS5_
-FN:13,_ZN6wibble5mixin10ComparableINS_8ConsumerIiEEEC2Ev
-FN:13,_ZN6wibble5mixin10ComparableINS_8ConsumerIjEEEC2Ev
-FN:13,_ZN6wibble5mixin10ComparableINS_5MorphINS_10RangeMorphIiNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEEEESC_NS_14RangeInterfaceIiEEEEEC2Ev
-FN:13,_ZN6wibble5mixin10ComparableINS_5MorphINS_10RangeMorphIjNS_11CastedRangeIjiEEEES5_NS_14RangeInterfaceIjEEEEEC2Ev
-FN:19,_ZNK6wibble5mixin10ComparableINS_13RangeIteratorINS_5RangeIiEEEEEneERKS5_
-FN:13,_ZN6wibble5mixin10ComparableINS_5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEEESA_NS_17ConsumerInterfaceIiEEEEEC2Ev
-FN:13,_ZN6wibble5mixin10ComparableINS_5MorphINS_13ConsumerMorphIjNS_20ConsumerFromIteratorIjSt15insert_iteratorISt6vectorIjSaIjEEEEEEESA_NS_17ConsumerInterfaceIjEEEEEC2Ev
-FN:13,_ZN6wibble5mixin10ComparableINS_5MorphINS_10RangeMorphIjNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEEEEESC_NS_14RangeInterfaceIjEEEEEC2Ev
-FN:13,_ZN6wibble5mixin10ComparableINS_5MorphINS_10RangeMorphIiNS_11CastedRangeIijEEEES5_NS_14RangeInterfaceIiEEEEEC2Ev
-FN:23,_ZNK6wibble5mixin10ComparableINS_13RangeIteratorINS_5RangeIjEEEEEeqERKS5_
-DA:13,35
-DA:15,2
-DA:16,2
-DA:19,0
-DA:20,0
-DA:23,1
-DA:24,1
-BA:24,0
-BA:24,0
-BA:24,0
-BA:24,0
-BA:24,2
-BA:24,1
-BA:24,2
-BA:24,1
-LF:7
-LH:5
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/operators.h
-FN:29,_ZN6wibble9operatorsplINS_13RangeIteratorINS_5RangeIiEEEEEET_RKS6_NS6_15difference_typeE
-DA:29,10
-DA:30,10
-DA:31,10
-DA:32,0
-LF:4
-LH:3
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/range.h
-FN:87,_ZN6wibble10RangeMixinIiNS_5RangeIiEEED2Ev
-FN:87,_ZN6wibble10RangeMixinIiNS_13FilteredRangeINS_5RangeIiEESt9binder1stISt8equal_toIiEEEEED2Ev
-FN:63,_ZN6wibble10RangeMixinIiNS_5RangeIiEEEC2Ev
-FN:87,_ZN6wibble10RangeMixinIiNS_16TransformedRangeISt9binder1stISt4plusIiEEEEED2Ev
-FN:87,_ZN6wibble10RangeMixinIjNS_5RangeIjEEED2Ev
-FN:87,_ZN6wibble10RangeMixinIiNS_14GeneratedRangeIiPFvRiEPFbRKiEEEED2Ev
-FN:459,_ZN6wibble14GeneratedRangeIiPFvRiEPFbRKiEED1Ev
-FN:63,_ZN6wibble10RangeMixinIiNS_13IteratorRangeISt14_List_iteratorIiEEEEC2Ev
-FN:197,_ZN6wibble13IteratorRangeISt14_List_iteratorIiEEC1ES2_S2_
-FN:87,_ZN6wibble10RangeMixinIiNS_13IteratorRangeISt14_List_iteratorIiEEEED2Ev
-FN:193,_ZN6wibble13IteratorRangeISt14_List_iteratorIiEED1Ev
-FN:156,_ZN6wibble5RangeIiED1Ev
-FN:27,_ZN6wibble13RangeIteratorINS_5RangeIiEEED1Ev
-FN:432,_ZN6wibble16TransformedRangeISt9binder1stISt4plusIiEEED1Ev
-FN:156,_ZN6wibble5RangeIiEC1ERKS1_
-FN:27,_ZN6wibble13RangeIteratorINS_5RangeIiEEEC1ERKS3_
-FN:432,_ZN6wibble16TransformedRangeISt9binder1stISt4plusIiEEEC1ERKS5_
-FN:66,_ZNK6wibble10RangeMixinIiNS_5RangeIiEEE4selfEv
-FN:37,_ZN6wibble13RangeIteratorINS_5RangeIiEEEC1ERKS2_
-FN:71,_ZNK6wibble10RangeMixinIiNS_5RangeIiEEE5beginEv
-FN:164,_ZNK6wibble5RangeIiE4headEv
-FN:49,_ZNK6wibble13RangeIteratorINS_5RangeIiEEEdeEv
-FN:63,_ZN6wibble10RangeMixinIiNS_13FilteredRangeINS_5RangeIiEESt9binder1stISt8equal_toIiEEEEEC2Ev
-FN:162,_ZN6wibble5RangeIiEC1Ev
-FN:63,_ZN6wibble10RangeMixinIiNS_16TransformedRangeISt9binder1stISt4plusIiEEEEEC2Ev
-FN:435,_ZN6wibble16TransformedRangeISt9binder1stISt4plusIiEEEC1ENS_5RangeIiEES4_
-FN:166,_ZN6wibble5RangeIiE10setToEmptyEv
-FN:165,_ZN6wibble5RangeIiE11removeFirstEv
-FN:156,_ZN6wibble5RangeIjED1Ev
-FN:27,_ZN6wibble13RangeIteratorINS_5RangeIjEEED1Ev
-FN:63,_ZN6wibble10RangeMixinIiNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEEEC2Ev
-FN:197,_ZN6wibble13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEC1ES7_S7_
-FN:87,_ZN6wibble10RangeMixinIiNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEEED2Ev
-FN:193,_ZN6wibble13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEED1Ev
-FN:63,_ZN6wibble10RangeMixinIjNS_11CastedRangeIjiEEEC2Ev
-FN:87,_ZN6wibble10RangeMixinIjNS_11CastedRangeIjiEEED2Ev
-FN:226,_ZN6wibble11CastedRangeIjiEC1ENS_5RangeIiEE
-FN:224,_ZN6wibble11CastedRangeIjiED1Ev
-FN:63,_ZN6wibble10RangeMixinIjNS_5RangeIjEEEC2Ev
-FN:156,_ZN6wibble5RangeIjEC1ERKS1_
-FN:164,_ZNK6wibble5RangeIjE4headEv
-FN:66,_ZNK6wibble10RangeMixinIjNS_5RangeIjEEE4selfEv
-FN:63,_ZN6wibble10RangeMixinIiNS_14GeneratedRangeIiPFvRiEPFbRKiEEEEC2Ev
-FN:464,_ZN6wibble14GeneratedRangeIiPFvRiEPFbRKiEEC1ES5_RKS3_RKS7_
-FN:495,_ZN6wibble14generatedRangeIiPFvRiEPFbRKiEEENS_14GeneratedRangeIT_T0_T1_EES9_SA_SB_
-FN:63,_ZN6wibble10RangeMixinIjNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEEEEC2Ev
-FN:197,_ZN6wibble13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEEC1ES7_S7_
-FN:87,_ZN6wibble10RangeMixinIjNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEEEED2Ev
-FN:193,_ZN6wibble13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEED1Ev
-FN:63,_ZN6wibble10RangeMixinIiNS_11CastedRangeIijEEEC2Ev
-FN:87,_ZN6wibble10RangeMixinIiNS_11CastedRangeIijEEED2Ev
-FN:226,_ZN6wibble11CastedRangeIijEC1ENS_5RangeIjEE
-FN:224,_ZN6wibble11CastedRangeIijED1Ev
-FN:165,_ZN6wibble5RangeIjE11removeFirstEv
-FN:166,_ZN6wibble5RangeIjE10setToEmptyEv
-FN:37,_ZN6wibble13RangeIteratorINS_5RangeIjEEEC1ERKS2_
-FN:71,_ZNK6wibble10RangeMixinIjNS_5RangeIjEEE5beginEv
-FN:51,_ZN6wibble13RangeIteratorINS_5RangeIiEEEppEv
-FN:53,_ZNK6wibble13RangeIteratorINS_5RangeIiEEEleERKS3_
-FN:94,_ZN6wibble14RangeInterfaceIiEC2Ev
-FN:105,_ZN6wibble10RangeMorphIiNS_14GeneratedRangeIiPFvRiEPFbRKiEEEEC1ERKS9_
-FN:105,_ZN6wibble10RangeMorphIiNS_13IteratorRangeISt14_List_iteratorIiEEEEC1ERKS4_
-FN:105,_ZN6wibble10RangeMorphIiNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEEEC1ERKS9_
-FN:94,_ZN6wibble14RangeInterfaceIjEC2Ev
-FN:224,_ZN6wibble11CastedRangeIjiEC1ERKS1_
-FN:53,_ZNK6wibble13RangeIteratorINS_5RangeIjEEEleERKS3_
-FN:105,_ZN6wibble10RangeMorphIjNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEEEEC1ERKS9_
-FN:224,_ZN6wibble11CastedRangeIijEC1ERKS1_
-FN:94,_ZN6wibble14RangeInterfaceIiEC2ERKS1_
-FN:94,_ZN6wibble14RangeInterfaceIjEC2ERKS1_
-FN:103,_ZN6wibble10RangeMorphIjNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEEEEC1ERKSA_
-FN:103,_ZN6wibble10RangeMorphIiNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEEEC1ERKSA_
-FN:103,_ZN6wibble10RangeMorphIiNS_13IteratorRangeISt14_List_iteratorIiEEEEC1ERKS5_
-FN:103,_ZN6wibble10RangeMorphIiNS_14GeneratedRangeIiPFvRiEPFbRKiEEEEC1ERKSA_
-FN:227,_ZNK6wibble11CastedRangeIijE4headEv
-FN:108,_ZNK6wibble10RangeMorphIiNS_11CastedRangeIijEEE4headEv
-FN:230,_ZN6wibble11CastedRangeIijE11removeFirstEv
-FN:107,_ZN6wibble10RangeMorphIiNS_11CastedRangeIijEEE11removeFirstEv
-FN:236,_ZN6wibble11CastedRangeIijE10setToEmptyEv
-FN:106,_ZN6wibble10RangeMorphIiNS_11CastedRangeIijEEE10setToEmptyEv
-FN:232,_ZNK6wibble11CastedRangeIijEleERKS1_
-FN:207,_ZN6wibble13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEE10setToEmptyEv
-FN:106,_ZN6wibble10RangeMorphIjNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEEEE10setToEmptyEv
-FN:227,_ZNK6wibble11CastedRangeIjiE4headEv
-FN:108,_ZNK6wibble10RangeMorphIjNS_11CastedRangeIjiEEE4headEv
-FN:230,_ZN6wibble11CastedRangeIjiE11removeFirstEv
-FN:107,_ZN6wibble10RangeMorphIjNS_11CastedRangeIjiEEE11removeFirstEv
-FN:236,_ZN6wibble11CastedRangeIjiE10setToEmptyEv
-FN:106,_ZN6wibble10RangeMorphIjNS_11CastedRangeIjiEEE10setToEmptyEv
-FN:232,_ZNK6wibble11CastedRangeIjiEleERKS1_
-FN:200,_ZNK6wibble13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEE4headEv
-FN:108,_ZNK6wibble10RangeMorphIiNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEEE4headEv
-FN:201,_ZN6wibble13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEE11removeFirstEv
-FN:107,_ZN6wibble10RangeMorphIiNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEEE11removeFirstEv
-FN:207,_ZN6wibble13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEE10setToEmptyEv
-FN:106,_ZN6wibble10RangeMorphIiNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEEE10setToEmptyEv
-FN:203,_ZNK6wibble13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEleERKS8_
-FN:207,_ZN6wibble13IteratorRangeISt14_List_iteratorIiEE10setToEmptyEv
-FN:106,_ZN6wibble10RangeMorphIiNS_13IteratorRangeISt14_List_iteratorIiEEEE10setToEmptyEv
-FN:477,_ZNK6wibble14GeneratedRangeIiPFvRiEPFbRKiEE4headEv
-FN:108,_ZNK6wibble10RangeMorphIiNS_14GeneratedRangeIiPFvRiEPFbRKiEEEE4headEv
-FN:469,_ZN6wibble14GeneratedRangeIiPFvRiEPFbRKiEE11removeFirstEv
-FN:107,_ZN6wibble10RangeMorphIiNS_14GeneratedRangeIiPFvRiEPFbRKiEEEE11removeFirstEv
-FN:473,_ZN6wibble14GeneratedRangeIiPFvRiEPFbRKiEE10setToEmptyEv
-FN:106,_ZN6wibble10RangeMorphIiNS_14GeneratedRangeIiPFvRiEPFbRKiEEEE10setToEmptyEv
-FN:443,_ZN6wibble16TransformedRangeISt9binder1stISt4plusIiEEE11removeFirstEv
-FN:107,_ZN6wibble10RangeMorphIiNS_16TransformedRangeISt9binder1stISt4plusIiEEEEE11removeFirstEv
-FN:444,_ZN6wibble16TransformedRangeISt9binder1stISt4plusIiEEE10setToEmptyEv
-FN:106,_ZN6wibble10RangeMorphIiNS_16TransformedRangeISt9binder1stISt4plusIiEEEEE10setToEmptyEv
-FN:438,_ZNK6wibble16TransformedRangeISt9binder1stISt4plusIiEEEleERKS5_
-FN:200,_ZNK6wibble13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEE4headEv
-FN:108,_ZNK6wibble10RangeMorphIjNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEEEE4headEv
-FN:201,_ZN6wibble13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEE11removeFirstEv
-FN:107,_ZN6wibble10RangeMorphIjNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEEEE11removeFirstEv
-FN:200,_ZNK6wibble13IteratorRangeISt14_List_iteratorIiEE4headEv
-FN:108,_ZNK6wibble10RangeMorphIiNS_13IteratorRangeISt14_List_iteratorIiEEEE4headEv
-FN:201,_ZN6wibble13IteratorRangeISt14_List_iteratorIiEE11removeFirstEv
-FN:107,_ZN6wibble10RangeMorphIiNS_13IteratorRangeISt14_List_iteratorIiEEEE11removeFirstEv
-FN:203,_ZNK6wibble13IteratorRangeISt14_List_iteratorIiEEleERKS3_
-FN:479,_ZNK6wibble14GeneratedRangeIiPFvRiEPFbRKiEE5isEndEv
-FN:481,_ZNK6wibble14GeneratedRangeIiPFvRiEPFbRKiEEleERKS8_
-FN:203,_ZNK6wibble13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEEleERKS8_
-FN:442,_ZNK6wibble16TransformedRangeISt9binder1stISt4plusIiEEE4headEv
-FN:108,_ZNK6wibble10RangeMorphIiNS_16TransformedRangeISt9binder1stISt4plusIiEEEEE4headEv
-FN:370,_ZNK6wibble13FilteredRangeINS_5RangeIiEESt9binder1stISt8equal_toIiEEE4predEv
-FN:72,_ZNK6wibble10RangeMixinIiNS_5RangeIiEEE3endEv
-FN:83,_ZNK6wibble10RangeMixinIiNS_5RangeIiEEE5emptyEv
-FN:76,_ZNK6wibble10RangeMixinIjNS_5RangeIjEEE4tailEv
-FN:72,_ZNK6wibble10RangeMixinIjNS_5RangeIjEEE3endEv
-FN:83,_ZNK6wibble10RangeMixinIjNS_5RangeIjEEE5emptyEv
-FN:76,_ZNK6wibble10RangeMixinIiNS_5RangeIiEEE4tailEv
-FN:453,_ZN6wibble16transformedRangeISt9binder1stISt4plusIiEEEENS_16TransformedRangeIT_EENS_5RangeINS6_13argument_typeEEES6_
-FN:79,_ZNK6wibble10RangeMixinIiNS_5RangeIiEEE6outputENS_8ConsumerIiEE
-FN:338,_ZN6wibble13FilteredRangeINS_5RangeIiEESt9binder1stISt8equal_toIiEEEC1ERKS2_S6_
-FN:379,_ZN6wibble13filteredRangeINS_5RangeIiEESt9binder1stISt8equal_toIiEEEENS_13FilteredRangeIT_T0_EES8_S9_
-FN:335,_ZN6wibble13FilteredRangeINS_5RangeIiEESt9binder1stISt8equal_toIiEEEC1ERKS7_
-FN:335,_ZN6wibble13FilteredRangeINS_5RangeIiEESt9binder1stISt8equal_toIiEEED1Ev
-FN:156,_ZN6wibble5RangeIjEaSERKS1_
-FN:156,_ZN6wibble5RangeIiEaSERKS1_
-FN:27,_ZN6wibble13RangeIteratorINS_5RangeIiEEEaSERKS3_
-FN:341,_ZNK6wibble13FilteredRangeINS_5RangeIiEESt9binder1stISt8equal_toIiEEE4findEv
-FN:362,_ZNK6wibble13FilteredRangeINS_5RangeIiEESt9binder1stISt8equal_toIiEEEleERKS7_
-FN:347,_ZN6wibble13FilteredRangeINS_5RangeIiEESt9binder1stISt8equal_toIiEEE11removeFirstEv
-FN:107,_ZN6wibble10RangeMorphIiNS_13FilteredRangeINS_5RangeIiEESt9binder1stISt8equal_toIiEEEEE11removeFirstEv
-FN:353,_ZNK6wibble13FilteredRangeINS_5RangeIiEESt9binder1stISt8equal_toIiEEE4headEv
-FN:108,_ZNK6wibble10RangeMorphIiNS_13FilteredRangeINS_5RangeIiEESt9binder1stISt8equal_toIiEEEEE4headEv
-FN:358,_ZN6wibble13FilteredRangeINS_5RangeIiEESt9binder1stISt8equal_toIiEEE10setToEmptyEv
-FN:106,_ZN6wibble10RangeMorphIiNS_13FilteredRangeINS_5RangeIiEESt9binder1stISt8equal_toIiEEEEE10setToEmptyEv
-FN:98,_ZN6wibble14RangeInterfaceIiED2Ev
-FN:103,_ZN6wibble10RangeMorphIiNS_11CastedRangeIijEEEC1ERKS3_
-FN:105,_ZN6wibble10RangeMorphIiNS_11CastedRangeIijEEEC1ERKS2_
-FN:103,_ZN6wibble10RangeMorphIiNS_16TransformedRangeISt9binder1stISt4plusIiEEEEEC1ERKS7_
-FN:105,_ZN6wibble10RangeMorphIiNS_16TransformedRangeISt9binder1stISt4plusIiEEEEEC1ERKS6_
-FN:103,_ZN6wibble10RangeMorphIiNS_13FilteredRangeINS_5RangeIiEESt9binder1stISt8equal_toIiEEEEEC1ERKS9_
-FN:105,_ZN6wibble10RangeMorphIiNS_13FilteredRangeINS_5RangeIiEESt9binder1stISt8equal_toIiEEEEEC1ERKS8_
-FN:98,_ZN6wibble14RangeInterfaceIiED0Ev
-FN:98,_ZN6wibble14RangeInterfaceIiED1Ev
-FN:103,_ZN6wibble10RangeMorphIiNS_14GeneratedRangeIiPFvRiEPFbRKiEEEED1Ev
-FN:160,_ZN6wibble5RangeIiEC1INS_14GeneratedRangeIiPFvRiEPFbRKiEEEEERKT_NS_6IsTypeIiNSC_19RangeImplementationEE1TE
-FN:103,_ZN6wibble10RangeMorphIiNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEEED1Ev
-FN:160,_ZN6wibble5RangeIiEC1INS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEEEERKT_NS_6IsTypeIiNSC_19RangeImplementationEE1TE
-FN:265,_ZN6wibble5rangeIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEENS_5RangeINT_10value_typeEEES9_S9_
-FN:270,_ZN6wibble5rangeISt6vectorIiSaIiEEEENS_5RangeINT_8iterator10value_typeEEERS5_
-FN:98,_ZN6wibble14RangeInterfaceIjED2Ev
-FN:103,_ZN6wibble10RangeMorphIjNS_11CastedRangeIjiEEEC1ERKS3_
-FN:105,_ZN6wibble10RangeMorphIjNS_11CastedRangeIjiEEEC1ERKS2_
-FN:98,_ZN6wibble14RangeInterfaceIjED0Ev
-FN:98,_ZN6wibble14RangeInterfaceIjED1Ev
-FN:103,_ZN6wibble10RangeMorphIjNS_11CastedRangeIjiEEED1Ev
-FN:160,_ZN6wibble5RangeIjEC1INS_11CastedRangeIjiEEEERKT_NS_6IsTypeIiNS5_19RangeImplementationEE1TE
-FN:247,_ZN6wibble11castedRangeIjNS_5RangeIiEEEENS1_IT_EET0_
-FN:103,_ZN6wibble10RangeMorphIjNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEEEED1Ev
-FN:160,_ZN6wibble5RangeIjEC1INS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEEEEERKT_NS_6IsTypeIiNSC_19RangeImplementationEE1TE
-FN:265,_ZN6wibble5rangeIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEEENS_5RangeINT_10value_typeEEES9_S9_
-FN:270,_ZN6wibble5rangeISt6vectorIjSaIjEEEENS_5RangeINT_8iterator10value_typeEEERS5_
-FN:103,_ZN6wibble10RangeMorphIiNS_11CastedRangeIijEEED1Ev
-FN:160,_ZN6wibble5RangeIiEC1INS_11CastedRangeIijEEEERKT_NS_6IsTypeIiNS5_19RangeImplementationEE1TE
-FN:247,_ZN6wibble11castedRangeIiNS_5RangeIjEEEENS1_IT_EET0_
-FN:259,_ZN6wibble5RangeIjEcvNS0_IT_EEIiEEv
-FN:103,_ZN6wibble10RangeMorphIiNS_16TransformedRangeISt9binder1stISt4plusIiEEEEED1Ev
-FN:160,_ZN6wibble5RangeIiEC1INS_16TransformedRangeISt9binder1stISt4plusIiEEEEEERKT_NS_6IsTypeIiNS9_19RangeImplementationEE1TE
-FN:103,_ZN6wibble10RangeMorphIiNS_13IteratorRangeISt14_List_iteratorIiEEEED1Ev
-FN:160,_ZN6wibble5RangeIiEC1INS_13IteratorRangeISt14_List_iteratorIiEEEEERKT_NS_6IsTypeIiNS7_19RangeImplementationEE1TE
-FN:265,_ZN6wibble5rangeISt14_List_iteratorIiEEENS_5RangeINT_10value_typeEEES4_S4_
-FN:103,_ZN6wibble10RangeMorphIiNS_13FilteredRangeINS_5RangeIiEESt9binder1stISt8equal_toIiEEEEED1Ev
-FN:160,_ZN6wibble5RangeIiEC1INS_13FilteredRangeIS1_St9binder1stISt8equal_toIiEEEEEERKT_NS_6IsTypeIiNS9_19RangeImplementationEE1TE
-DA:27,6
-DA:37,2
-DA:49,0
-DA:51,0
-DA:53,2
-DA:54,2
-DA:63,16
-DA:66,5
-DA:71,1
-DA:72,1
-DA:76,3
-DA:79,2
-DA:80,2
-DA:81,2
-DA:83,1
-DA:84,1
-DA:87,196
-DA:94,26
-DA:98,23
-DA:103,327
-DA:105,14
-DA:106,19
-DA:107,42
-DA:108,34
-DA:156,43
-DA:160,14
-DA:161,14
-DA:162,3
-DA:164,5
-DA:165,5
-DA:166,2
-DA:193,114
-DA:197,8
-DA:198,8
-DA:200,19
-DA:201,17
-DA:203,25
-DA:204,25
-DA:207,12
-DA:208,12
-DA:209,12
-DA:224,41
-DA:226,2
-DA:227,5
-DA:228,5
-DA:230,5
-DA:232,4
-DA:233,4
-DA:236,2
-DA:237,2
-DA:238,2
-DA:247,2
-DA:248,2
-DA:259,1
-DA:260,1
-DA:265,8
-DA:266,8
-DA:270,6
-DA:271,6
-DA:335,14
-DA:338,1
-DA:339,1
-DA:341,6
-DA:342,6
-DA:343,3
-DA:344,6
-DA:345,6
-DA:347,1
-DA:348,1
-DA:349,1
-DA:350,1
-DA:351,1
-DA:353,1
-DA:354,1
-DA:355,1
-DA:358,1
-DA:359,1
-DA:360,1
-DA:362,2
-DA:363,2
-DA:364,2
-DA:365,2
-DA:370,3
-DA:379,1
-DA:380,1
-DA:432,26
-DA:435,2
-DA:436,2
-DA:438,4
-DA:439,4
-DA:442,4
-DA:443,4
-DA:444,2
-DA:453,2
-DA:454,2
-DA:459,20
-DA:464,1
-DA:465,1
-DA:467,1
-DA:469,15
-DA:470,15
-DA:471,15
-DA:473,2
-DA:474,2
-DA:475,2
-DA:477,5
-DA:479,18
-DA:481,4
-DA:482,4
-DA:483,0
-DA:484,4
-DA:495,1
-DA:497,1
-BA:98,0
-BA:98,0
-BA:98,0
-BA:98,0
-BA:98,0
-BA:98,0
-BA:98,1
-BA:98,2
-BA:98,0
-BA:98,0
-BA:98,0
-BA:98,0
-BA:103,2
-BA:103,1
-BA:103,1
-BA:103,2
-BA:103,2
-BA:103,1
-BA:103,1
-BA:103,2
-BA:103,2
-BA:103,1
-BA:103,1
-BA:103,2
-BA:103,2
-BA:103,1
-BA:103,1
-BA:103,2
-BA:103,2
-BA:103,1
-BA:103,1
-BA:103,2
-BA:103,2
-BA:103,1
-BA:103,1
-BA:103,2
-BA:103,0
-BA:103,0
-BA:103,0
-BA:103,0
-BA:103,2
-BA:103,1
-BA:103,1
-BA:103,2
-BA:204,2
-BA:204,2
-BA:204,2
-BA:204,1
-BA:204,0
-BA:204,0
-BA:204,0
-BA:204,0
-BA:204,2
-BA:204,1
-BA:204,2
-BA:204,1
-BA:342,2
-BA:342,2
-BA:479,2
-BA:479,2
-BA:479,2
-BA:479,2
-BA:482,2
-BA:482,2
-BA:482,1
-BA:482,2
-BA:482,1
-BA:482,2
-LF:113
-LH:110
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:13,_ZN8LocationC1ERKS_
-FN:17,_ZN8LocationC1EPKciSs
-FN:52,_ZlsIiER12AssertFailedS1_T_
-FN:52,_ZlsIPKcER12AssertFailedS3_T_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:41,_ZN12AssertFailedD1Ev
-FN:13,_ZN8LocationD1Ev
-FN:67,_Z12assert_eq_fnIiiEv8LocationT_T0_
-FN:59,_Z9assert_fnIbEv8LocationT_
-FN:52,_ZlsIjER12AssertFailedS1_T_
-FN:67,_Z12assert_eq_fnIjjEv8LocationT_T0_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:59,0
-DA:61,0
-DA:62,0
-DA:64,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:75,0
-BA:42,0
-BA:42,0
-BA:61,0
-BA:61,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-LF:26
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/range.test.h
-FN:163,_ZN12_GLOBAL__N_19TestRange11removeFirstERi
-FN:167,_ZN12_GLOBAL__N_19TestRange5isEndERKi
-FN:171,_ZN12_GLOBAL__N_19TestRange15_generatedRangeEv
-FN:116,_ZN12_GLOBAL__N_19TestRange18_transformedRange2Ev
-FN:101,_ZN12_GLOBAL__N_19TestRange17_transformedRangeEv
-FN:131,_ZN12_GLOBAL__N_19TestRange19tailOfIteratorRangeEv
-FN:88,_ZN12_GLOBAL__N_19TestRange10assignmentEv
-FN:146,_ZN12_GLOBAL__N_19TestRange12_castedRangeEv
-FN:57,_ZN12_GLOBAL__N_19TestRange14_filteredRangeEv
-FN:37,_ZN12_GLOBAL__N_19TestRange14copyToConsumerEv
-FN:26,_ZN12_GLOBAL__N_19TestRange4copyEv
-FN:15,_ZN12_GLOBAL__N_19TestRange13iteratorRangeEv
-FN:73,_ZN12_GLOBAL__N_19TestRange4sortEv
-DA:15,1
-DA:16,1
-DA:17,1
-DA:18,1
-DA:19,1
-DA:20,1
-DA:21,1
-DA:22,2
-DA:23,1
-DA:24,1
-DA:26,1
-DA:27,1
-DA:28,1
-DA:29,1
-DA:30,1
-DA:31,1
-DA:32,1
-DA:33,2
-DA:34,1
-DA:35,1
-DA:37,1
-DA:39,1
-DA:40,1
-DA:41,1
-DA:42,1
-DA:43,1
-DA:44,1
-DA:45,1
-DA:46,1
-DA:47,1
-DA:48,1
-DA:49,4
-DA:50,2
-DA:51,4
-DA:52,2
-DA:54,1
-DA:55,1
-DA:57,1
-DA:58,1
-DA:59,1
-DA:60,1
-DA:61,1
-DA:62,1
-DA:63,1
-DA:67,1
-DA:68,1
-DA:69,2
-DA:70,1
-DA:71,1
-DA:73,1
-DA:74,1
-DA:75,1
-DA:76,1
-DA:77,1
-DA:78,1
-DA:79,1
-DA:80,1
-DA:81,1
-DA:82,1
-DA:83,2
-DA:84,2
-DA:85,2
-DA:86,1
-DA:88,1
-DA:89,1
-DA:90,1
-DA:91,1
-DA:92,1
-DA:93,1
-DA:94,1
-DA:95,1
-DA:96,1
-DA:97,1
-DA:98,2
-DA:99,1
-DA:101,1
-DA:102,1
-DA:103,1
-DA:104,1
-DA:105,1
-DA:106,1
-DA:108,1
-DA:109,1
-DA:110,1
-DA:111,1
-DA:112,1
-DA:113,1
-DA:114,1
-DA:116,1
-DA:117,1
-DA:118,1
-DA:119,1
-DA:120,1
-DA:121,1
-DA:123,1
-DA:124,1
-DA:125,1
-DA:126,1
-DA:127,1
-DA:128,1
-DA:129,1
-DA:131,1
-DA:132,1
-DA:133,1
-DA:134,1
-DA:135,1
-DA:136,1
-DA:137,1
-DA:138,2
-DA:139,1
-DA:140,2
-DA:141,1
-DA:142,2
-DA:143,1
-DA:144,1
-DA:146,1
-DA:148,1
-DA:149,1
-DA:150,1
-DA:151,1
-DA:153,1
-DA:154,1
-DA:155,2
-DA:156,1
-DA:157,2
-DA:158,1
-DA:159,2
-DA:160,1
-DA:161,1
-DA:163,15
-DA:164,15
-DA:165,15
-DA:167,9
-DA:168,9
-DA:171,1
-DA:172,1
-DA:173,1
-DA:174,2
-DA:175,1
-DA:176,1
-DA:177,1
-DA:178,1
-DA:179,1
-DA:180,1
-BA:49,2
-BA:49,2
-LF:144
-LH:144
-end_of_record
-SF:/srv/build/pkg/ept-work/default/wibble/wibble-test-generated-_home_mornfall_dev_pkg_ept-work_wibble_range.cpp
-FN:13,_Z41__static_initialization_and_destruction_0ii
-FN:13,_GLOBAL__I__Z23run_Range_iteratorRangev
-FN:13,_ZN6wibble9MorphBaseINS_14GeneratedRangeIiPFvRiEPFbRKiEEENS_14RangeInterfaceIiEEED0Ev
-FN:13,_ZN6wibble9MorphBaseINS_14GeneratedRangeIiPFvRiEPFbRKiEEENS_14RangeInterfaceIiEEED1Ev
-FN:13,_ZN6wibble10RangeMorphIiNS_14GeneratedRangeIiPFvRiEPFbRKiEEEED0Ev
-FN:13,_ZN6wibble9MorphBaseINS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEENS_14RangeInterfaceIiEEED0Ev
-FN:13,_ZN6wibble9MorphBaseINS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEENS_14RangeInterfaceIiEEED1Ev
-FN:13,_ZN6wibble10RangeMorphIiNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEEED0Ev
-FN:13,_ZN6wibble9MorphBaseINS_11CastedRangeIjiEENS_14RangeInterfaceIjEEED0Ev
-FN:13,_ZN6wibble9MorphBaseINS_11CastedRangeIjiEENS_14RangeInterfaceIjEEED1Ev
-FN:13,_ZN6wibble10RangeMorphIjNS_11CastedRangeIjiEEED0Ev
-FN:13,_ZN6wibble9MorphBaseINS_20ConsumerFromIteratorIjSt15insert_iteratorISt6vectorIjSaIjEEEEENS_17ConsumerInterfaceIjEEED0Ev
-FN:13,_ZN6wibble9MorphBaseINS_20ConsumerFromIteratorIjSt15insert_iteratorISt6vectorIjSaIjEEEEENS_17ConsumerInterfaceIjEEED1Ev
-FN:13,_ZN6wibble13ConsumerMorphIjNS_20ConsumerFromIteratorIjSt15insert_iteratorISt6vectorIjSaIjEEEEEED0Ev
-FN:13,_ZN6wibble9MorphBaseINS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEEENS_14RangeInterfaceIjEEED0Ev
-FN:13,_ZN6wibble9MorphBaseINS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEEENS_14RangeInterfaceIjEEED1Ev
-FN:13,_ZN6wibble10RangeMorphIjNS_13IteratorRangeIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEEEED0Ev
-FN:13,_ZN6wibble9MorphBaseINS_11CastedRangeIijEENS_14RangeInterfaceIiEEED0Ev
-FN:13,_ZN6wibble9MorphBaseINS_11CastedRangeIijEENS_14RangeInterfaceIiEEED1Ev
-FN:13,_ZN6wibble10RangeMorphIiNS_11CastedRangeIijEEED0Ev
-FN:13,_ZN6wibble9MorphBaseINS_16TransformedRangeISt9binder1stISt4plusIiEEEENS_14RangeInterfaceIiEEED0Ev
-FN:13,_ZN6wibble9MorphBaseINS_16TransformedRangeISt9binder1stISt4plusIiEEEENS_14RangeInterfaceIiEEED1Ev
-FN:13,_ZN6wibble10RangeMorphIiNS_16TransformedRangeISt9binder1stISt4plusIiEEEEED0Ev
-FN:13,_ZN6wibble9MorphBaseINS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEENS_17ConsumerInterfaceIiEEED0Ev
-FN:13,_ZN6wibble9MorphBaseINS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEENS_17ConsumerInterfaceIiEEED1Ev
-FN:13,_ZN6wibble13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEED0Ev
-FN:13,_ZN6wibble9MorphBaseINS_13IteratorRangeISt14_List_iteratorIiEEENS_14RangeInterfaceIiEEED0Ev
-FN:13,_ZN6wibble9MorphBaseINS_13IteratorRangeISt14_List_iteratorIiEEENS_14RangeInterfaceIiEEED1Ev
-FN:13,_ZN6wibble10RangeMorphIiNS_13IteratorRangeISt14_List_iteratorIiEEEED0Ev
-FN:13,_ZN6wibble9MorphBaseINS_13FilteredRangeINS_5RangeIiEESt9binder1stISt8equal_toIiEEEENS_14RangeInterfaceIiEEED0Ev
-FN:13,_ZN6wibble9MorphBaseINS_13FilteredRangeINS_5RangeIiEESt9binder1stISt8equal_toIiEEEENS_14RangeInterfaceIiEEED1Ev
-FN:13,_ZN6wibble10RangeMorphIiNS_13FilteredRangeINS_5RangeIiEESt9binder1stISt8equal_toIiEEEEED0Ev
-FN:13,_Z25run_Range__generatedRangev
-FN:10,_Z28run_Range__transformedRange2v
-FN:9,_Z27run_Range__transformedRangev
-FN:11,_Z29run_Range_tailOfIteratorRangev
-FN:8,_Z20run_Range_assignmentv
-FN:12,_Z22run_Range__castedRangev
-FN:6,_Z24run_Range__filteredRangev
-FN:5,_Z24run_Range_copyToConsumerv
-FN:4,_Z14run_Range_copyv
-FN:3,_Z23run_Range_iteratorRangev
-FN:7,_Z14run_Range_sortv
-DA:3,1
-DA:4,1
-DA:5,1
-DA:6,1
-DA:7,1
-DA:8,1
-DA:9,1
-DA:10,1
-DA:11,1
-DA:12,1
-DA:13,152
-BA:13,2
-BA:13,1
-BA:13,2
-BA:13,1
-LF:11
-LH:11
-end_of_record
-SF:/usr/include/c++/4.3/backward/binders.h
-FN:110,_ZNSt9binder1stISt8equal_toIiEEC1ERKS1_RKi
-FN:127,_ZSt7bind1stISt8equal_toIiEiESt9binder1stIT_ERKS3_RKT0_
-FN:110,_ZNSt9binder1stISt4plusIiEEC1ERKS1_RKi
-FN:127,_ZSt7bind1stISt4plusIiEiESt9binder1stIT_ERKS3_RKT0_
-FN:114,_ZNKSt9binder1stISt4plusIiEEclERKi
-FN:114,_ZNKSt9binder1stISt8equal_toIiEEclERKi
-DA:110,3
-DA:111,3
-DA:114,6
-DA:115,6
-DA:127,3
-DA:130,3
-LF:6
-LH:6
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaISt10_List_nodeIiEED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaIiED2Ev
-FN:106,_ZNSaIiED1Ev
-FN:106,_ZNSaIjED2Ev
-FN:98,_ZNSaISt10_List_nodeIiEEC2Ev
-FN:98,_ZNSaIiEC2Ev
-FN:104,_ZNSaIiEC1ISt10_List_nodeIiEEERKSaIT_E
-FN:98,_ZNSaIjEC2Ev
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,1
-DA:100,0
-DA:101,0
-DA:104,0
-DA:106,1
-DA:118,0
-DA:119,0
-LF:7
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-LF:51
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/list.tcc
-FN:70,_ZNSt10_List_baseIiSaIiEE8_M_clearEv
-DA:70,0
-DA:73,0
-DA:74,0
-DA:76,0
-DA:77,0
-DA:78,0
-DA:79,0
-DA:81,0
-BA:74,0
-BA:74,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algo.h
-FN:89,_ZSt8__medianIiERKT_S2_S2_S2_
-FN:1714,_ZSt25__unguarded_linear_insertIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEiEvT_T0_
-FN:1793,_ZSt26__unguarded_insertion_sortIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEvT_S7_
-FN:1856,_ZSt21__unguarded_partitionIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEiET_S7_S7_T0_
-FN:1555,_ZSt13__heap_selectIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEvT_S7_S7_
-FN:4622,_ZSt12partial_sortIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEvT_S7_S7_
-FN:1898,_ZSt16__introsort_loopIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEiEvT_S7_T0_
-FN:160,_ZSt9__find_ifIN6wibble13RangeIteratorINS0_5RangeIiEEEESt9binder1stISt8equal_toIiEEET_S9_S9_T0_St18input_iterator_tag
-FN:3829,_ZSt7find_ifIN6wibble13RangeIteratorINS0_5RangeIiEEEESt9binder1stISt8equal_toIiEEET_S9_S9_T0_
-FN:1748,_ZSt16__insertion_sortIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEvT_S7_
-FN:1825,_ZSt22__final_insertion_sortIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEvT_S7_
-FN:1970,_ZSt4__lgi
-FN:4770,_ZSt4sortIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEvT_S7_
-DA:89,0
-DA:93,0
-DA:94,0
-DA:95,0
-DA:96,0
-DA:97,0
-DA:99,0
-DA:100,0
-DA:101,0
-DA:102,0
-DA:103,0
-DA:105,0
-DA:160,3
-DA:162,7
-DA:163,1
-DA:164,3
-DA:1555,0
-DA:1557,0
-DA:1558,0
-DA:1559,0
-DA:1560,0
-DA:1561,0
-DA:1714,0
-DA:1716,0
-DA:1717,0
-DA:1718,0
-DA:1720,0
-DA:1721,0
-DA:1722,0
-DA:1724,0
-DA:1725,0
-DA:1748,0
-DA:1750,0
-DA:1751,0
-DA:1753,0
-DA:1756,0
-DA:1757,0
-DA:1759,0
-DA:1760,0
-DA:1763,0
-DA:1793,0
-DA:1798,0
-DA:1799,0
-DA:1800,0
-DA:1825,0
-DA:1827,0
-DA:1829,0
-DA:1830,0
-DA:1833,0
-DA:1834,0
-DA:1856,0
-DA:1858,0
-DA:1860,0
-DA:1861,0
-DA:1862,0
-DA:1863,0
-DA:1864,0
-DA:1865,0
-DA:1866,0
-DA:1867,0
-DA:1868,0
-DA:1898,0
-DA:1903,0
-DA:1905,0
-DA:1907,0
-DA:1908,0
-DA:1910,0
-DA:1919,0
-DA:1920,0
-DA:1921,0
-DA:1970,0
-DA:1971,0
-DA:3829,3
-DA:3837,3
-DA:4622,0
-DA:4634,0
-DA:4635,0
-DA:4636,0
-DA:4770,0
-DA:4781,0
-DA:4783,0
-DA:4785,0
-DA:4787,0
-BA:93,0
-BA:93,0
-BA:94,0
-BA:94,0
-BA:96,0
-BA:96,0
-BA:100,0
-BA:100,0
-BA:102,0
-BA:102,0
-BA:162,2
-BA:162,2
-BA:162,2
-BA:162,2
-BA:162,2
-BA:162,2
-BA:1558,0
-BA:1558,0
-BA:1559,0
-BA:1559,0
-BA:1718,0
-BA:1718,0
-BA:1750,0
-BA:1750,0
-BA:1753,0
-BA:1753,0
-BA:1757,0
-BA:1757,0
-BA:1798,0
-BA:1798,0
-BA:1827,0
-BA:1827,0
-BA:1860,0
-BA:1860,0
-BA:1863,0
-BA:1863,0
-BA:1865,0
-BA:1865,0
-BA:1903,0
-BA:1903,0
-BA:1905,0
-BA:1905,0
-BA:4781,0
-BA:4781,0
-LF:83
-LH:6
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN6wibble13RangeIteratorINS0_5RangeIiEEEELb0EE3__bES4_
-FN:268,_ZNSt12__niter_baseIN6wibble13RangeIteratorINS0_5RangeIiEEEELb0EE3__bES4_
-FN:268,_ZNSt12__niter_baseISt20back_insert_iteratorISt4listIiSaIiEEELb0EE3__bES4_
-FN:268,_ZNSt12__niter_baseIN6wibble8ConsumerIiEELb0EE3__bES2_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:286,_ZNSt12__miter_baseIPiLb0EE3__bES0_
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEELb0EE3__bES6_
-FN:268,_ZNSt12__niter_baseIPiLb0EE3__bES0_
-FN:309,_ZNSt11__copy_moveILb0ELb0ESt20forward_iterator_tagE8__copy_mIN6wibble13RangeIteratorINS3_5RangeIiEEEENS3_8ConsumerIiEEEET0_T_SB_SA_
-FN:104,_ZNSt11__iter_swapILb1EE9iter_swapIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEES8_EEvT_T0_
-FN:121,_ZSt9iter_swapIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEES6_EvT_T0_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEELb1EE3__bES6_
-FN:286,_ZNSt12__miter_baseIPjLb0EE3__bES0_
-FN:268,_ZNSt12__niter_baseIPjLb0EE3__bES0_
-FN:385,_ZSt13__copy_move_aILb0EN6wibble13RangeIteratorINS0_5RangeIiEEEENS0_8ConsumerIiEEET1_T0_S8_S7_
-FN:430,_ZSt14__copy_move_a2ILb0EN6wibble13RangeIteratorINS0_5RangeIiEEEENS0_8ConsumerIiEEET1_T0_S8_S7_
-FN:456,_ZSt4copyIN6wibble13RangeIteratorINS0_5RangeIiEEEENS0_8ConsumerIiEEET0_T_S8_S7_
-FN:569,_ZNSt20__copy_move_backwardILb0ELb1ESt26random_access_iterator_tagE13__copy_move_bIiEEPT_PKS3_S6_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0EPiS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPiS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardIPiS0_ET0_T_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEES6_ET1_T0_S8_S7_
-FN:624,_ZSt13copy_backwardIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEES6_ET0_T_S8_S7_
-FN:375,_ZNSt11__copy_moveILb0ELb1ESt26random_access_iterator_tagE8__copy_mIiEEPT_PKS3_S6_S4_
-FN:385,_ZSt13__copy_move_aILb0EPiS0_ET1_T0_S2_S1_
-FN:430,_ZSt14__copy_move_a2ILb0EPiS0_ET1_T0_S2_S1_
-FN:456,_ZSt4copyIPiS0_ET0_T_S2_S1_
-FN:569,_ZNSt20__copy_move_backwardILb0ELb1ESt26random_access_iterator_tagE13__copy_move_bIjEEPT_PKS3_S6_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0EPjS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPjS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardIPjS0_ET0_T_S2_S1_
-FN:375,_ZNSt11__copy_moveILb0ELb1ESt26random_access_iterator_tagE8__copy_mIjEEPT_PKS3_S6_S4_
-FN:385,_ZSt13__copy_move_aILb0EPjS0_ET1_T0_S2_S1_
-FN:430,_ZSt14__copy_move_a2ILb0EPjS0_ET1_T0_S2_S1_
-FN:456,_ZSt4copyIPjS0_ET0_T_S2_S1_
-FN:309,_ZNSt11__copy_moveILb0ELb0ESt20forward_iterator_tagE8__copy_mIN6wibble13RangeIteratorINS3_5RangeIiEEEESt20back_insert_iteratorISt4listIiSaIiEEEEET0_T_SE_SD_
-FN:385,_ZSt13__copy_move_aILb0EN6wibble13RangeIteratorINS0_5RangeIiEEEESt20back_insert_iteratorISt4listIiSaIiEEEET1_T0_SB_SA_
-FN:430,_ZSt14__copy_move_a2ILb0EN6wibble13RangeIteratorINS0_5RangeIiEEEESt20back_insert_iteratorISt4listIiSaIiEEEET1_T0_SB_SA_
-FN:456,_ZSt4copyIN6wibble13RangeIteratorINS0_5RangeIiEEEESt20back_insert_iteratorISt4listIiSaIiEEEET0_T_SB_SA_
-DA:104,0
-DA:106,0
-DA:107,0
-DA:121,0
-DA:142,0
-DA:146,0
-DA:210,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:268,13
-DA:269,13
-DA:276,0
-DA:277,0
-DA:286,8
-DA:287,8
-DA:309,1
-DA:311,3
-DA:312,2
-DA:313,1
-DA:375,4
-DA:377,4
-DA:379,4
-DA:385,5
-DA:393,5
-DA:396,5
-DA:430,5
-DA:435,5
-DA:456,5
-DA:466,5
-DA:569,0
-DA:571,0
-DA:572,0
-DA:573,0
-DA:579,0
-DA:587,0
-DA:592,0
-DA:597,0
-DA:602,0
-DA:624,0
-DA:636,0
-BA:215,0
-BA:215,0
-BA:311,0
-BA:311,0
-BA:311,2
-BA:311,2
-LF:41
-LH:18
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:97,_ZSt8_DestroyIPiEvT_S1_
-FN:126,_ZSt8_DestroyIPiiEvT_S1_RSaIT0_E
-FN:97,_ZSt8_DestroyIPjEvT_S1_
-FN:126,_ZSt8_DestroyIPjjEvT_S1_RSaIT0_E
-DA:97,3
-DA:104,3
-DA:126,3
-DA:128,3
-DA:129,3
-LF:5
-LH:5
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_function.h
-FN:104,_ZNSt14unary_functionIibEC2Ev
-FN:104,_ZNSt14unary_functionIiiEC2Ev
-FN:140,_ZNKSt4plusIiEclERKiS2_
-FN:202,_ZNKSt8equal_toIiEclERKiS2_
-DA:104,1
-DA:140,4
-DA:141,4
-DA:202,2
-DA:203,2
-LF:5
-LH:5
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_heap.h
-FN:131,_ZSt11__push_heapIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEiiEvT_T0_S8_T1_
-FN:225,_ZSt13__adjust_heapIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEiiEvT_T0_S8_T1_
-FN:371,_ZSt9make_heapIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEvT_S7_
-FN:251,_ZSt10__pop_heapIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEvT_S7_S7_
-FN:276,_ZSt8pop_heapIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEvT_S7_
-FN:450,_ZSt9sort_heapIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEvT_S7_
-DA:131,0
-DA:133,0
-DA:134,0
-DA:136,0
-DA:137,0
-DA:138,0
-DA:140,0
-DA:141,0
-DA:225,0
-DA:227,0
-DA:228,0
-DA:229,0
-DA:231,0
-DA:232,0
-DA:233,0
-DA:234,0
-DA:235,0
-DA:237,0
-DA:239,0
-DA:240,0
-DA:242,0
-DA:244,0
-DA:246,0
-DA:251,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:263,0
-DA:276,0
-DA:288,0
-DA:289,0
-DA:371,0
-DA:384,0
-DA:385,0
-DA:387,0
-DA:388,0
-DA:389,0
-DA:391,0
-DA:392,0
-DA:393,0
-DA:394,0
-DA:395,0
-DA:450,0
-DA:460,0
-DA:461,0
-DA:462,0
-BA:134,0
-BA:134,0
-BA:134,0
-BA:134,0
-BA:134,0
-BA:134,0
-BA:229,0
-BA:229,0
-BA:232,0
-BA:232,0
-BA:237,0
-BA:237,0
-BA:237,0
-BA:237,0
-BA:384,0
-BA:384,0
-BA:393,0
-BA:393,0
-BA:460,0
-BA:460,0
-LF:46
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEdeEv
-FN:398,_ZNSt20back_insert_iteratorISt4listIiSaIiEEEC1ERS2_
-FN:456,_ZSt13back_inserterISt4listIiSaIiEEESt20back_insert_iteratorIT_ERS4_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEC1ERKS1_
-FN:735,_ZNK9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEplERKi
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEE4baseEv
-FN:846,_ZN9__gnu_cxxmiIPiSt6vectorIiSaIiEEEENS_17__normal_iteratorIT_T0_E15difference_typeERKS8_SB_
-FN:769,_ZN9__gnu_cxxeqIPiSt6vectorIiSaIiEEEEbRKNS_17__normal_iteratorIT_T0_EESA_
-FN:781,_ZN9__gnu_cxxneIPiSt6vectorIiSaIiEEEEbRKNS_17__normal_iteratorIT_T0_EESA_
-FN:572,_ZNSt15insert_iteratorISt6vectorIiSaIiEEEC1ERS2_N9__gnu_cxx17__normal_iteratorIPiS2_EE
-FN:645,_ZSt8inserterISt6vectorIiSaIiEEN9__gnu_cxx17__normal_iteratorIPiS2_EEESt15insert_iteratorIT_ERS8_T0_
-FN:743,_ZNK9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEmiERKi
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEC1ERKS1_
-FN:572,_ZNSt15insert_iteratorISt6vectorIjSaIjEEEC1ERS2_N9__gnu_cxx17__normal_iteratorIPjS2_EE
-FN:645,_ZSt8inserterISt6vectorIjSaIjEEN9__gnu_cxx17__normal_iteratorIPjS2_EEESt15insert_iteratorIT_ERS8_T0_
-FN:703,_ZN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEppEv
-FN:715,_ZN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEmmEv
-FN:794,_ZN9__gnu_cxxltIPiSt6vectorIiSaIiEEEEbRKNS_17__normal_iteratorIT_T0_EESA_
-FN:434,_ZNSt20back_insert_iteratorISt4listIiSaIiEEEppEv
-FN:429,_ZNSt20back_insert_iteratorISt4listIiSaIiEEEdeEv
-FN:722,_ZN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEmmEi
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEdeEv
-FN:703,_ZN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEppEv
-FN:618,_ZNSt15insert_iteratorISt6vectorIjSaIjEEEdeEv
-FN:623,_ZNSt15insert_iteratorISt6vectorIjSaIjEEEppEv
-FN:618,_ZNSt15insert_iteratorISt6vectorIiSaIiEEEdeEv
-FN:623,_ZNSt15insert_iteratorISt6vectorIiSaIiEEEppEv
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPjSt6vectorIjSaIjEEEEbRKNS_17__normal_iteratorIT_T0_EESA_
-FN:846,_ZN9__gnu_cxxmiIPjSt6vectorIjSaIjEEEENS_17__normal_iteratorIT_T0_E15difference_typeERKS8_SB_
-FN:599,_ZNSt15insert_iteratorISt6vectorIiSaIiEEEaSERKi
-FN:599,_ZNSt15insert_iteratorISt6vectorIjSaIjEEEaSERKj
-FN:412,_ZNSt20back_insert_iteratorISt4listIiSaIiEEEaSERKi
-DA:398,0
-DA:412,0
-DA:414,0
-DA:415,0
-DA:429,0
-DA:430,0
-DA:434,0
-DA:435,0
-DA:456,0
-DA:457,0
-DA:572,1
-DA:573,1
-DA:599,2
-DA:601,2
-DA:602,2
-DA:603,2
-DA:618,6
-DA:619,6
-DA:623,2
-DA:624,2
-DA:645,1
-DA:648,1
-DA:683,7
-DA:695,2
-DA:696,2
-DA:703,4
-DA:705,4
-DA:706,4
-DA:715,0
-DA:717,0
-DA:718,0
-DA:722,0
-DA:723,0
-DA:735,0
-DA:736,0
-DA:743,0
-DA:744,0
-DA:747,16
-DA:748,16
-DA:769,4
-DA:770,4
-DA:781,0
-DA:782,0
-DA:794,0
-DA:795,0
-DA:846,2
-DA:847,2
-LF:47
-LH:24
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:124,_ZSt9__advanceIN6wibble13RangeIteratorINS0_5RangeIiEEEEiEvRT_T0_St18input_iterator_tag
-FN:173,_ZSt7advanceIN6wibble13RangeIteratorINS0_5RangeIiEEEEiEvRT_T0_
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-DA:124,10
-DA:128,41
-DA:129,21
-DA:130,10
-DA:173,10
-DA:176,10
-DA:177,10
-DA:178,10
-BA:128,2
-BA:128,2
-LF:12
-LH:8
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:166,_ZSt19__iterator_categoryIN6wibble13RangeIteratorINS0_5RangeIiEEEEENSt15iterator_traitsIT_E17iterator_categoryERKS6_
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,0
-DA:166,13
-DA:167,13
-LF:3
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_list.h
-FN:126,_ZNSt14_List_iteratorIiEC1EPSt15_List_node_base
-FN:666,_ZNSt4listIiSaIiEE3endEv
-FN:648,_ZNSt4listIiSaIiEE5beginEv
-FN:211,_ZNKSt20_List_const_iteratorIiEdeEv
-FN:253,_ZNKSt20_List_const_iteratorIiEneERKS0_
-FN:219,_ZNSt20_List_const_iteratorIiEppEv
-FN:249,_ZNKSt20_List_const_iteratorIiEeqERKS0_
-FN:364,_ZNSt10_List_baseIiSaIiEE7_M_initEv
-FN:298,_ZNSt10_List_baseIiSaIiEE10_List_implD1Ev
-FN:202,_ZNSt20_List_const_iteratorIiEC1EPKSt15_List_node_base
-FN:675,_ZNKSt4listIiSaIiEE3endEv
-FN:657,_ZNKSt4listIiSaIiEE5beginEv
-FN:1386,_ZSteqIiSaIiEEbRKSt4listIT_T0_ES6_
-FN:1422,_ZStneIiSaIiEEbRKSt4listIT_T0_ES6_
-FN:328,_ZNKSt10_List_baseIiSaIiEE21_M_get_Node_allocatorEv
-FN:301,_ZNSt10_List_baseIiSaIiEE10_List_implC1Ev
-FN:339,_ZNSt10_List_baseIiSaIiEEC2Ev
-FN:498,_ZNSt4listIiSaIiEEC1Ev
-FN:332,_ZNKSt10_List_baseIiSaIiEE19_M_get_Tp_allocatorEv
-FN:131,_ZNKSt14_List_iteratorIiEdeEv
-FN:139,_ZNSt14_List_iteratorIiEppEv
-FN:169,_ZNKSt14_List_iteratorIiEeqERKS0_
-FN:317,_ZNSt10_List_baseIiSaIiEE11_M_put_nodeEPSt10_List_nodeIiE
-FN:357,_ZNSt10_List_baseIiSaIiEED2Ev
-FN:417,_ZNSt4listIiSaIiEED1Ev
-FN:313,_ZNSt10_List_baseIiSaIiEE11_M_get_nodeEv
-FN:458,_ZNSt4listIiSaIiEE14_M_create_nodeERKi
-FN:1339,_ZNSt4listIiSaIiEE9_M_insertESt14_List_iteratorIiERKi
-FN:875,_ZNSt4listIiSaIiEE9push_backERKi
-DA:126,0
-DA:127,0
-DA:131,0
-DA:132,0
-DA:139,0
-DA:141,0
-DA:142,0
-DA:169,0
-DA:170,0
-DA:202,0
-DA:203,0
-DA:211,0
-DA:212,0
-DA:219,0
-DA:221,0
-DA:222,0
-DA:249,0
-DA:250,0
-DA:253,0
-DA:254,0
-DA:298,0
-DA:301,0
-DA:302,0
-DA:303,0
-DA:313,0
-DA:314,0
-DA:317,0
-DA:318,0
-DA:328,0
-DA:329,0
-DA:332,0
-DA:333,0
-DA:339,0
-DA:340,0
-DA:341,0
-DA:357,0
-DA:358,0
-DA:364,0
-DA:366,0
-DA:367,0
-DA:368,0
-DA:417,0
-DA:458,0
-DA:460,0
-DA:463,0
-DA:465,0
-DA:467,0
-DA:468,0
-DA:470,0
-DA:498,0
-DA:499,0
-DA:648,0
-DA:649,0
-DA:657,0
-DA:658,0
-DA:666,0
-DA:667,0
-DA:675,0
-DA:676,0
-DA:875,0
-DA:876,0
-DA:1339,0
-DA:1341,0
-DA:1342,0
-DA:1343,0
-DA:1386,0
-DA:1389,0
-DA:1390,0
-DA:1392,0
-DA:1393,0
-DA:1394,0
-DA:1396,0
-DA:1397,0
-DA:1399,0
-DA:1422,0
-DA:1423,0
-BA:1394,0
-BA:1394,0
-BA:1394,0
-BA:1394,0
-BA:1394,0
-BA:1394,0
-BA:1394,0
-BA:1394,0
-BA:1399,0
-BA:1399,0
-BA:1399,0
-BA:1399,0
-LF:76
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_move.h
-FN:80,_ZSt4swapIiEvRT_S1_
-DA:80,0
-DA:85,0
-DA:86,0
-DA:87,0
-DA:88,0
-LF:5
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:97,_ZNSt20__uninitialized_copyILb1EE18uninitialized_copyIPiS2_EET0_T_S4_S3_
-FN:113,_ZSt18uninitialized_copyIPiS0_ET0_T_S2_S1_
-FN:261,_ZSt22__uninitialized_copy_aIPiS0_iET0_T_S2_S1_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPiS0_SaIiEET0_T_S3_S2_RT1_
-FN:97,_ZNSt20__uninitialized_copyILb1EE18uninitialized_copyIPjS2_EET0_T_S4_S3_
-FN:113,_ZSt18uninitialized_copyIPjS0_ET0_T_S2_S1_
-FN:261,_ZSt22__uninitialized_copy_aIPjS0_jET0_T_S2_S1_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPjS0_SaIjEET0_T_S3_S2_RT1_
-DA:97,4
-DA:98,4
-DA:113,4
-DA:122,4
-DA:261,4
-DA:262,4
-DA:268,4
-DA:272,4
-LF:8
-LH:8
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:97,_ZNSt12_Vector_baseIiSaIiEE19_M_get_Tp_allocatorEv
-FN:395,_ZNSt6vectorIiSaIiEE3endEv
-FN:377,_ZNSt6vectorIiSaIiEE5beginEv
-FN:97,_ZNSt12_Vector_baseIjSaIjEE19_M_get_Tp_allocatorEv
-FN:395,_ZNSt6vectorIjSaIjEE3endEv
-FN:377,_ZNSt6vectorIjSaIjEE5beginEv
-FN:79,_ZNSt12_Vector_baseIiSaIiEE12_Vector_implD1Ev
-FN:484,_ZNKSt6vectorIiSaIiEE4sizeEv
-FN:79,_ZNSt12_Vector_baseIjSaIjEE12_Vector_implD1Ev
-FN:84,_ZNSt12_Vector_baseIiSaIiEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseIiSaIiEEC2Ev
-FN:213,_ZNSt6vectorIiSaIiEEC1Ev
-FN:101,_ZNKSt12_Vector_baseIiSaIiEE19_M_get_Tp_allocatorEv
-FN:489,_ZNKSt6vectorIiSaIiEE8max_sizeEv
-FN:84,_ZNSt12_Vector_baseIjSaIjEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseIjSaIjEEC2Ev
-FN:213,_ZNSt6vectorIjSaIjEEC1Ev
-FN:484,_ZNKSt6vectorIjSaIjEE4sizeEv
-FN:101,_ZNKSt12_Vector_baseIjSaIjEE19_M_get_Tp_allocatorEv
-FN:489,_ZNKSt6vectorIjSaIjEE8max_sizeEv
-FN:147,_ZNSt12_Vector_baseIiSaIiEE13_M_deallocateEPij
-FN:135,_ZNSt12_Vector_baseIiSaIiEED2Ev
-FN:299,_ZNSt6vectorIiSaIiEED1Ev
-FN:147,_ZNSt12_Vector_baseIjSaIjEE13_M_deallocateEPjj
-FN:135,_ZNSt12_Vector_baseIjSaIjEED2Ev
-FN:299,_ZNSt6vectorIjSaIjEED1Ev
-FN:1075,_ZNKSt6vectorIiSaIiEE12_M_check_lenEjPKc
-FN:1075,_ZNKSt6vectorIjSaIjEE12_M_check_lenEjPKc
-FN:143,_ZNSt12_Vector_baseIiSaIiEE11_M_allocateEj
-FN:686,_ZNSt6vectorIiSaIiEE9push_backERKi
-FN:143,_ZNSt12_Vector_baseIjSaIjEE11_M_allocateEj
-DA:79,1
-DA:84,1
-DA:85,1
-DA:86,1
-DA:97,7
-DA:98,7
-DA:101,4
-DA:102,4
-DA:108,1
-DA:109,1
-DA:135,1
-DA:136,1
-DA:137,1
-DA:143,2
-DA:144,2
-DA:147,3
-DA:149,3
-DA:150,2
-DA:151,3
-DA:213,1
-DA:214,1
-DA:299,1
-DA:300,1
-DA:301,1
-DA:377,3
-DA:378,3
-DA:395,2
-DA:396,2
-DA:484,8
-DA:485,8
-DA:489,4
-DA:490,4
-DA:686,0
-DA:688,0
-DA:690,0
-DA:691,0
-DA:694,0
-DA:695,0
-DA:1075,2
-DA:1077,2
-DA:1078,0
-DA:1080,2
-DA:1081,2
-BA:144,0
-BA:144,0
-BA:144,2
-BA:144,1
-BA:149,0
-BA:149,0
-BA:149,2
-BA:149,2
-BA:688,0
-BA:688,0
-BA:1077,0
-BA:1077,0
-BA:1077,1
-BA:1077,2
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,2
-BA:1081,1
-BA:1081,1
-BA:1081,2
-LF:43
-LH:36
-end_of_record
-SF:/usr/include/c++/4.3/bits/vector.tcc
-FN:283,_ZNSt6vectorIiSaIiEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPiS1_EERKi
-FN:94,_ZNSt6vectorIiSaIiEE6insertEN9__gnu_cxx17__normal_iteratorIPiS1_EERKi
-FN:283,_ZNSt6vectorIjSaIjEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPjS1_EERKj
-FN:94,_ZNSt6vectorIjSaIjEE6insertEN9__gnu_cxx17__normal_iteratorIPjS1_EERKj
-DA:94,2
-DA:96,2
-DA:97,2
-DA:100,0
-DA:101,0
-DA:113,2
-DA:115,2
-DA:283,2
-DA:286,2
-DA:288,0
-DA:291,0
-DA:293,0
-DA:295,0
-DA:299,0
-DA:307,2
-DA:308,2
-DA:309,2
-DA:316,2
-DA:321,2
-DA:323,2
-DA:324,2
-DA:330,0
-DA:332,0
-DA:333,0
-DA:334,0
-DA:336,2
-DA:338,2
-DA:341,2
-DA:342,2
-DA:343,2
-DA:345,2
-BA:97,0
-BA:97,0
-BA:97,0
-BA:97,0
-BA:97,0
-BA:97,0
-BA:97,1
-BA:97,2
-BA:97,0
-BA:97,0
-BA:97,1
-BA:97,2
-BA:286,0
-BA:286,0
-BA:286,1
-BA:286,2
-LF:31
-LH:20
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:107,_ZN9__gnu_cxx13new_allocatorIiE9constructEPiRKi
-FN:76,_ZN9__gnu_cxx13new_allocatorISt10_List_nodeIiEED2Ev
-FN:118,_ZN9__gnu_cxx13new_allocatorIiE7destroyEPi
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorIiED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIjED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt10_List_nodeIiEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorIiEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorIiE8max_sizeEv
-FN:69,_ZN9__gnu_cxx13new_allocatorIjEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt10_List_nodeIiEE8max_sizeEv
-FN:107,_ZN9__gnu_cxx13new_allocatorIjE9constructEPjRKj
-FN:101,_ZNK9__gnu_cxx13new_allocatorIjE8max_sizeEv
-FN:97,_ZN9__gnu_cxx13new_allocatorIiE10deallocateEPij
-FN:97,_ZN9__gnu_cxx13new_allocatorIjE10deallocateEPjj
-FN:97,_ZN9__gnu_cxx13new_allocatorISt10_List_nodeIiEE10deallocateEPS2_j
-FN:87,_ZN9__gnu_cxx13new_allocatorIiE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorIjE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorISt10_List_nodeIiEE8allocateEjPKv
-DA:69,1
-DA:71,0
-DA:76,1
-DA:87,2
-DA:89,2
-DA:90,0
-DA:92,2
-DA:97,2
-DA:98,2
-DA:101,6
-DA:102,6
-DA:107,2
-DA:108,2
-DA:118,0
-BA:89,0
-BA:89,0
-BA:89,1
-BA:89,2
-BA:89,0
-BA:89,0
-BA:108,0
-BA:108,0
-BA:108,2
-BA:108,1
-LF:14
-LH:11
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-DA:105,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:195,_ZNSolsEj
-DA:95,0
-DA:112,0
-DA:117,0
-DA:195,0
-DA:199,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/typeinfo
-FN:122,_ZNKSt9type_info6beforeERKS_
-DA:122,0
-DA:123,0
-LF:2
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/commandline/core.h
-FN:21,_ZNK6wibble9exception9BadOption4typeEv
-FN:52,_ZN6wibble11commandline7ManagedC2Ev
-FN:22,_ZNK6wibble9exception9BadOption4descEv
-FN:54,_ZN6wibble11commandline7ManagedD2Ev
-FN:54,_ZN6wibble11commandline7ManagedD0Ev
-FN:54,_ZN6wibble11commandline7ManagedD1Ev
-FN:19,_ZN6wibble9exception9BadOptionD0Ev
-FN:17,_ZN6wibble9exception9BadOptionC1ERKSsS3_
-FN:34,_ZN6wibble11commandline7ArgList15eraseAndAdvanceERSt14_List_iteratorISsE
-FN:19,_ZN6wibble9exception9BadOptionD1Ev
-DA:17,0
-DA:18,0
-DA:19,0
-DA:21,0
-DA:22,0
-DA:34,0
-DA:36,0
-DA:37,0
-DA:38,0
-DA:39,0
-DA:40,0
-DA:41,0
-DA:42,0
-DA:52,0
-DA:54,0
-BA:19,0
-BA:19,0
-BA:19,0
-BA:19,0
-BA:36,0
-BA:36,0
-BA:54,0
-BA:54,0
-BA:54,0
-BA:54,0
-BA:54,0
-BA:54,0
-LF:15
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/commandline/options.h
-FN:97,_ZNK6wibble11commandline6Option5isSetEv
-FN:98,_ZNK6wibble11commandline6Option4nameEv
-FN:135,_ZN6wibble11commandline10BoolOption5parseERNS0_7ArgListESt14_List_iteratorISsE
-FN:136,_ZN6wibble11commandline10BoolOption5parseERKSs
-FN:139,_ZNK6wibble11commandline10BoolOption9boolValueEv
-FN:272,_ZNK6wibble11commandline12VectorOptionINS0_4BoolEE6valuesEv
-FN:272,_ZNK6wibble11commandline12VectorOptionINS0_6StringEE6valuesEv
-FN:271,_ZNK6wibble11commandline12VectorOptionINS0_4BoolEE9boolValueEv
-FN:271,_ZNK6wibble11commandline12VectorOptionINS0_6StringEE9boolValueEv
-FN:140,_ZNK6wibble11commandline10BoolOption11stringValueEv
-FN:254,_ZN6wibble11commandline12VectorOptionINS0_6StringEE5parseERNS0_7ArgListESt14_List_iteratorISsE
-FN:263,_ZN6wibble11commandline12VectorOptionINS0_6StringEE5parseERKSs
-FN:95,_ZN6wibble11commandline6OptionD2Ev
-FN:234,_ZN6wibble11commandline12VectorOptionINS0_6StringEED2Ev
-FN:234,_ZN6wibble11commandline12VectorOptionINS0_6StringEED0Ev
-FN:234,_ZN6wibble11commandline12VectorOptionINS0_6StringEED1Ev
-FN:234,_ZN6wibble11commandline12VectorOptionINS0_4BoolEED2Ev
-FN:234,_ZN6wibble11commandline12VectorOptionINS0_4BoolEED0Ev
-FN:234,_ZN6wibble11commandline12VectorOptionINS0_4BoolEED1Ev
-FN:148,_ZN6wibble11commandline12SingleOptionINS0_3IntEED2Ev
-FN:205,_ZN6wibble11commandline9IntOptionD2Ev
-FN:205,_ZN6wibble11commandline9IntOptionD0Ev
-FN:205,_ZN6wibble11commandline9IntOptionD1Ev
-FN:148,_ZN6wibble11commandline12SingleOptionINS0_3IntEED0Ev
-FN:148,_ZN6wibble11commandline12SingleOptionINS0_3IntEED1Ev
-FN:122,_ZN6wibble11commandline10BoolOptionD2Ev
-FN:122,_ZN6wibble11commandline10BoolOptionD0Ev
-FN:122,_ZN6wibble11commandline10BoolOptionD1Ev
-FN:95,_ZN6wibble11commandline6OptionD0Ev
-FN:95,_ZN6wibble11commandline6OptionD1Ev
-FN:59,_ZN6wibble11commandline6OptionC2ERKSs
-FN:238,_ZN6wibble11commandline12VectorOptionINS0_6StringEEC2ERKSs
-FN:238,_ZN6wibble11commandline12VectorOptionINS0_4BoolEEC2ERKSs
-FN:152,_ZN6wibble11commandline12SingleOptionINS0_3IntEEC2ERKSs
-FN:207,_ZN6wibble11commandline9IntOptionC2ERKSs
-FN:126,_ZN6wibble11commandline10BoolOptionC2ERKSs
-FN:168,_ZN6wibble11commandline12SingleOptionINS0_6StringEE5parseERNS0_7ArgListESt14_List_iteratorISsE
-FN:148,_ZN6wibble11commandline12SingleOptionINS0_6StringEED2Ev
-FN:177,_ZN6wibble11commandline12SingleOptionINS0_6StringEE5parseERKSs
-FN:148,_ZN6wibble11commandline12SingleOptionINS0_6StringEED0Ev
-FN:148,_ZN6wibble11commandline12SingleOptionINS0_6StringEED1Ev
-FN:152,_ZN6wibble11commandline12SingleOptionINS0_6StringEEC2ERKSs
-FN:254,_ZN6wibble11commandline12VectorOptionINS0_4BoolEE5parseERNS0_7ArgListESt14_List_iteratorISsE
-FN:263,_ZN6wibble11commandline12VectorOptionINS0_4BoolEE5parseERKSs
-FN:192,_ZNK6wibble11commandline12SingleOptionINS0_6StringEE9boolValueEv
-FN:194,_ZNK6wibble11commandline12SingleOptionINS0_6StringEE11stringValueEv
-FN:168,_ZN6wibble11commandline12SingleOptionINS0_3IntEE5parseERNS0_7ArgListESt14_List_iteratorISsE
-FN:177,_ZN6wibble11commandline12SingleOptionINS0_3IntEE5parseERKSs
-FN:192,_ZNK6wibble11commandline12SingleOptionINS0_3IntEE9boolValueEv
-FN:193,_ZNK6wibble11commandline12SingleOptionINS0_3IntEE8intValueEv
-FN:194,_ZNK6wibble11commandline12SingleOptionINS0_3IntEE11stringValueEv
-DA:59,5
-DA:95,0
-DA:97,12
-DA:98,5
-DA:122,1
-DA:126,1
-DA:127,1
-DA:135,0
-DA:136,0
-DA:139,0
-DA:140,2
-DA:148,1
-DA:152,2
-DA:153,2
-DA:155,2
-DA:156,2
-DA:168,0
-DA:170,0
-DA:171,0
-DA:172,0
-DA:173,0
-DA:175,0
-DA:177,0
-DA:179,0
-DA:180,0
-DA:181,0
-DA:192,2
-DA:193,0
-DA:194,2
-DA:205,1
-DA:207,1
-DA:209,1
-DA:210,1
-DA:234,2
-DA:238,2
-DA:239,2
-DA:241,2
-DA:242,2
-DA:254,0
-DA:256,0
-DA:257,0
-DA:258,0
-DA:259,0
-DA:261,0
-DA:263,4
-DA:265,4
-DA:266,4
-DA:267,4
-DA:271,6
-DA:272,12
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:122,1
-BA:122,2
-BA:122,0
-BA:122,0
-BA:122,0
-BA:122,0
-BA:140,2
-BA:140,2
-BA:148,0
-BA:148,0
-BA:148,0
-BA:148,0
-BA:148,0
-BA:148,0
-BA:148,1
-BA:148,2
-BA:148,0
-BA:148,0
-BA:148,0
-BA:148,0
-BA:170,0
-BA:170,0
-BA:170,0
-BA:170,0
-BA:205,1
-BA:205,2
-BA:205,0
-BA:205,0
-BA:205,0
-BA:205,0
-BA:234,1
-BA:234,2
-BA:234,0
-BA:234,0
-BA:234,0
-BA:234,0
-BA:234,1
-BA:234,2
-BA:234,0
-BA:234,0
-BA:234,0
-BA:234,0
-BA:256,0
-BA:256,0
-BA:256,0
-BA:256,0
-LF:50
-LH:29
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/exception.h
-FN:190,_ZNK6wibble9exception7Generic4typeEv
-FN:263,_ZNK6wibble9exception11Consistency4typeEv
-FN:213,_ZNK6wibble9exception7Generic4whatEv
-FN:265,_ZNK6wibble9exception11Consistency4descEv
-FN:193,_ZNK6wibble9exception7Generic4descEv
-FN:109,_ZN6wibble9exception10AddContext7contextEv
-FN:154,_ZNK6wibble9exception7Context13formatContextEv
-FN:205,_ZNK6wibble9exception7Generic8fullInfoEv
-FN:137,_ZN6wibble9exception7ContextD2Ev
-FN:187,_ZN6wibble9exception7GenericD0Ev
-FN:187,_ZN6wibble9exception7GenericD1Ev
-FN:187,_ZN6wibble9exception7GenericD2Ev
-FN:261,_ZN6wibble9exception11ConsistencyD0Ev
-FN:261,_ZN6wibble9exception11ConsistencyD1Ev
-FN:261,_ZN6wibble9exception11ConsistencyD2Ev
-FN:117,_ZN6wibble9exception10AddContext11copyContextISt20back_insert_iteratorISt6vectorISsSaISsEEEEEvT_
-FN:153,_ZN6wibble9exception7Context10addContextERKSs
-FN:147,_ZN6wibble9exception7ContextC2ERKSs
-FN:186,_ZN6wibble9exception7GenericC2ERKSs
-FN:259,_ZN6wibble9exception11ConsistencyC2ERKSsS3_
-DA:109,0
-DA:110,0
-DA:111,0
-DA:112,0
-DA:113,0
-DA:117,0
-DA:118,0
-DA:119,0
-DA:137,0
-DA:147,0
-DA:148,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:153,0
-DA:154,0
-DA:155,0
-DA:156,0
-DA:157,0
-DA:159,0
-DA:161,0
-DA:162,0
-DA:163,0
-DA:186,0
-DA:187,0
-DA:190,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:205,0
-DA:206,0
-DA:207,0
-DA:209,0
-DA:210,0
-DA:213,0
-DA:259,0
-DA:260,0
-DA:261,0
-DA:263,0
-DA:265,0
-DA:266,0
-DA:267,0
-DA:268,0
-DA:269,0
-BA:110,0
-BA:110,0
-BA:156,0
-BA:156,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:207,0
-BA:207,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:267,0
-BA:267,0
-LF:44
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:13,_ZN8LocationC1ERKS_
-FN:17,_ZN8LocationC1EPKciSs
-FN:52,_ZlsISsER12AssertFailedS1_T_
-FN:52,_ZlsIPKcER12AssertFailedS3_T_
-FN:52,_ZlsIiER12AssertFailedS1_T_
-FN:52,_ZlsIbER12AssertFailedS1_T_
-FN:52,_ZlsIjER12AssertFailedS1_T_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:41,_ZN12AssertFailedD1Ev
-FN:13,_ZN8LocationD1Ev
-FN:67,_Z12assert_eq_fnIbbEv8LocationT_T0_
-FN:67,_Z12assert_eq_fnIjjEv8LocationT_T0_
-FN:67,_Z12assert_eq_fnIiiEv8LocationT_T0_
-FN:67,_Z12assert_eq_fnISsSsEv8LocationT_T0_
-FN:67,_Z12assert_eq_fnISsPKcEv8LocationT_T0_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:75,0
-BA:42,0
-BA:42,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-LF:22
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/commandline/options.test.h
-FN:30,_ZN22TestCommandlineOptions6PublicIN6wibble11commandline10BoolOptionEE5parseERKSs
-FN:27,_ZN22TestCommandlineOptions6PublicIN6wibble11commandline10BoolOptionEE5parseERNS2_7ArgListESt14_List_iteratorISsE
-FN:27,_ZN22TestCommandlineOptions6PublicIN6wibble11commandline12VectorOptionINS2_6StringEEEE5parseERNS2_7ArgListESt14_List_iteratorISsE
-FN:30,_ZN22TestCommandlineOptions6PublicIN6wibble11commandline12VectorOptionINS2_6StringEEEE5parseERKSs
-FN:16,_ZN22TestCommandlineOptions6PublicIN6wibble11commandline12VectorOptionINS2_6StringEEEED0Ev
-FN:16,_ZN22TestCommandlineOptions6PublicIN6wibble11commandline12VectorOptionINS2_6StringEEEED1Ev
-FN:16,_ZN22TestCommandlineOptions6PublicIN6wibble11commandline12VectorOptionINS2_4BoolEEEED0Ev
-FN:16,_ZN22TestCommandlineOptions6PublicIN6wibble11commandline12VectorOptionINS2_4BoolEEEED1Ev
-FN:16,_ZN22TestCommandlineOptions6PublicIN6wibble11commandline9IntOptionEED0Ev
-FN:16,_ZN22TestCommandlineOptions6PublicIN6wibble11commandline9IntOptionEED1Ev
-FN:16,_ZN22TestCommandlineOptions6PublicIN6wibble11commandline10BoolOptionEED0Ev
-FN:16,_ZN22TestCommandlineOptions6PublicIN6wibble11commandline10BoolOptionEED1Ev
-FN:18,_ZN22TestCommandlineOptions6PublicIN6wibble11commandline12VectorOptionINS2_6StringEEEEC1ERKSs
-FN:18,_ZN22TestCommandlineOptions6PublicIN6wibble11commandline12VectorOptionINS2_4BoolEEEEC1ERKSs
-FN:18,_ZN22TestCommandlineOptions6PublicIN6wibble11commandline9IntOptionEEC1ERKSs
-FN:18,_ZN22TestCommandlineOptions6PublicIN6wibble11commandline10BoolOptionEEC1ERKSs
-FN:100,_ZN22TestCommandlineOptions15vectorStringOptEv
-FN:27,_ZN22TestCommandlineOptions6PublicIN6wibble11commandline12SingleOptionINS2_6StringEEEE5parseERNS2_7ArgListESt14_List_iteratorISsE
-FN:16,_ZN22TestCommandlineOptions6PublicIN6wibble11commandline12SingleOptionINS2_6StringEEEED0Ev
-FN:16,_ZN22TestCommandlineOptions6PublicIN6wibble11commandline12SingleOptionINS2_6StringEEEED1Ev
-FN:30,_ZN22TestCommandlineOptions6PublicIN6wibble11commandline12SingleOptionINS2_6StringEEEE5parseERKSs
-FN:18,_ZN22TestCommandlineOptions6PublicIN6wibble11commandline12SingleOptionINS2_6StringEEEEC1ERKSs
-FN:35,_ZN22TestCommandlineOptions7boolOptEv
-FN:27,_ZN22TestCommandlineOptions6PublicIN6wibble11commandline12VectorOptionINS2_4BoolEEEE5parseERNS2_7ArgListESt14_List_iteratorISsE
-FN:30,_ZN22TestCommandlineOptions6PublicIN6wibble11commandline12VectorOptionINS2_4BoolEEEE5parseERKSs
-FN:79,_ZN22TestCommandlineOptions13vectorBoolOptEv
-FN:65,_ZN22TestCommandlineOptions9stringOptEv
-FN:27,_ZN22TestCommandlineOptions6PublicIN6wibble11commandline9IntOptionEE5parseERNS2_7ArgListESt14_List_iteratorISsE
-FN:30,_ZN22TestCommandlineOptions6PublicIN6wibble11commandline9IntOptionEE5parseERKSs
-FN:49,_ZN22TestCommandlineOptions6intOptEv
-DA:16,5
-DA:18,5
-DA:19,5
-DA:27,0
-DA:28,0
-DA:30,7
-DA:31,7
-DA:35,1
-DA:36,1
-DA:38,2
-DA:39,2
-DA:40,2
-DA:41,2
-DA:43,2
-DA:44,1
-DA:45,2
-DA:46,2
-DA:47,1
-DA:49,1
-DA:50,1
-DA:52,2
-DA:53,2
-DA:54,2
-DA:55,2
-DA:56,2
-DA:58,2
-DA:59,2
-DA:60,2
-DA:61,2
-DA:62,2
-DA:63,1
-DA:65,1
-DA:66,1
-DA:68,2
-DA:69,2
-DA:70,2
-DA:71,2
-DA:73,1
-DA:74,2
-DA:75,2
-DA:76,2
-DA:77,1
-DA:79,1
-DA:80,1
-DA:81,2
-DA:82,2
-DA:83,2
-DA:84,2
-DA:86,2
-DA:87,2
-DA:88,2
-DA:89,2
-DA:90,2
-DA:92,2
-DA:93,2
-DA:94,2
-DA:95,2
-DA:96,2
-DA:97,2
-DA:98,1
-DA:100,1
-DA:101,1
-DA:102,2
-DA:103,2
-DA:104,2
-DA:105,2
-DA:107,2
-DA:108,2
-DA:109,2
-DA:110,2
-DA:111,2
-DA:113,1
-DA:114,2
-DA:115,2
-DA:116,2
-DA:117,2
-DA:118,1
-DA:119,1
-BA:16,0
-BA:16,0
-BA:16,1
-BA:16,2
-BA:16,0
-BA:16,0
-BA:16,1
-BA:16,2
-BA:16,0
-BA:16,0
-BA:16,1
-BA:16,2
-BA:16,0
-BA:16,0
-BA:16,1
-BA:16,2
-BA:16,0
-BA:16,0
-BA:16,1
-BA:16,2
-LF:78
-LH:76
-end_of_record
-SF:/srv/build/pkg/ept-work/default/wibble/wibble-test-generated-_home_mornfall_dev_pkg_ept-work_wibble_commandline_options.cpp
-FN:7,_Z41__static_initialization_and_destruction_0ii
-FN:7,_GLOBAL__I__Z30run_CommandlineOptions_boolOptv
-FN:7,_Z38run_CommandlineOptions_vectorStringOptv
-FN:3,_Z30run_CommandlineOptions_boolOptv
-FN:6,_Z36run_CommandlineOptions_vectorBoolOptv
-FN:5,_Z32run_CommandlineOptions_stringOptv
-FN:4,_Z29run_CommandlineOptions_intOptv
-DA:3,1
-DA:4,1
-DA:5,1
-DA:6,1
-DA:7,4
-BA:7,2
-BA:7,1
-BA:7,2
-BA:7,1
-LF:5
-LH:5
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC2Ev
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaIcED1Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaISsED2Ev
-FN:106,_ZNSaISsED1Ev
-FN:106,_ZNSaImED2Ev
-FN:98,_ZNSaISsEC2Ev
-FN:104,_ZNSaISsEC1ISt10_List_nodeISsEEERKSaIT_E
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-FN:98,_ZNSaImEC2Ev
-DA:98,1
-DA:100,0
-DA:101,0
-DA:104,0
-DA:106,1
-DA:118,0
-DA:119,0
-LF:7
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:1534,_ZNKSs5c_strEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:612,_ZNKSs6lengthEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:835,_ZNSs6appendEPKc
-FN:501,_ZNSsaSERKSs
-FN:928,_ZNSs6assignEPKc
-FN:509,_ZNSsaSEPKc
-FN:2162,_ZSteqIcEN9__gnu_cxx11__enable_ifIXsrSt9__is_charIT_E7__valueEbE6__typeERKSbIS3_St11char_traitsIS3_ESaIS3_EESC_
-FN:2188,_ZSteqIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_EPKS3_
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2121,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:509,0
-DA:510,0
-DA:606,0
-DA:607,0
-DA:612,0
-DA:613,0
-DA:686,0
-DA:687,0
-DA:835,0
-DA:838,0
-DA:928,0
-DA:931,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2121,0
-DA:2123,0
-DA:2124,0
-DA:2125,0
-DA:2162,0
-DA:2165,0
-DA:2188,0
-DA:2189,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-LF:75
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-DA:245,0
-DA:246,0
-DA:257,0
-DA:258,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/list.tcc
-FN:109,_ZNSt4listISsSaISsEE5eraseESt14_List_iteratorISsE
-DA:109,0
-DA:111,0
-DA:112,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:268,_ZNSt12__niter_baseIPmLb0EE3__bES0_
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb0EE3__bES7_
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb0EE3__bES6_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb1EE3__bES7_
-FN:268,_ZNSt12__niter_baseISt16ostream_iteratorISscSt11char_traitsIcEELb0EE3__bES3_
-FN:286,_ZNSt12__miter_baseIPSsLb0EE3__bES0_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb1EE3__bES6_
-FN:268,_ZNSt12__niter_baseISt20back_insert_iteratorISt6vectorISsSaISsEEELb0EE3__bES4_
-FN:268,_ZNSt12__niter_baseIPSsLb0EE3__bES0_
-FN:286,_ZNSt12__miter_baseISt13_Bit_iteratorLb0EE3__bES0_
-FN:268,_ZNSt12__niter_baseISt13_Bit_iteratorLb0EE3__bES0_
-FN:286,_ZNSt12__miter_baseIPmLb0EE3__bES0_
-FN:286,_ZNSt12__miter_baseISt19_Bit_const_iteratorLb0EE3__bES0_
-FN:539,_ZNSt20__copy_move_backwardILb0ELb0ESt26random_access_iterator_tagE13__copy_move_bISt13_Bit_iteratorS3_EET0_T_S5_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0ESt13_Bit_iteratorS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0ESt13_Bit_iteratorS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardISt13_Bit_iteratorS0_ET0_T_S2_S1_
-FN:268,_ZNSt12__niter_baseISt19_Bit_const_iteratorLb0EE3__bES0_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mISt13_Bit_iteratorS3_EET0_T_S5_S4_
-FN:385,_ZSt13__copy_move_aILb0ESt13_Bit_iteratorS0_ET1_T0_S2_S1_
-FN:430,_ZSt14__copy_move_a2ILb0ESt13_Bit_iteratorS0_ET1_T0_S2_S1_
-FN:456,_ZSt4copyISt13_Bit_iteratorS0_ET0_T_S2_S1_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mISt19_Bit_const_iteratorSt13_Bit_iteratorEET0_T_S6_S5_
-FN:385,_ZSt13__copy_move_aILb0ESt19_Bit_const_iteratorSt13_Bit_iteratorET1_T0_S3_S2_
-FN:430,_ZSt14__copy_move_a2ILb0ESt19_Bit_const_iteratorSt13_Bit_iteratorET1_T0_S3_S2_
-FN:456,_ZSt4copyISt19_Bit_const_iteratorSt13_Bit_iteratorET0_T_S3_S2_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPKSsSt16ostream_iteratorISscSt11char_traitsIcEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPKSsSt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_SD_SC_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET0_T_SD_SC_
-FN:539,_ZNSt20__copy_move_backwardILb0ELb0ESt26random_access_iterator_tagE13__copy_move_bIPSsS3_EET0_T_S5_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0EPSsS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPSsS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardIPSsS0_ET0_T_S2_S1_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET1_T0_SA_S9_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET0_T_SA_S9_
-FN:375,_ZNSt11__copy_moveILb0ELb1ESt26random_access_iterator_tagE8__copy_mImEEPT_PKS3_S6_S4_
-FN:385,_ZSt13__copy_move_aILb0EPmS0_ET1_T0_S2_S1_
-FN:430,_ZSt14__copy_move_a2ILb0EPmS0_ET1_T0_S2_S1_
-FN:456,_ZSt4copyIPmS0_ET0_T_S2_S1_
-DA:210,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:268,9
-DA:269,9
-DA:276,0
-DA:277,0
-DA:286,6
-DA:287,6
-DA:337,2
-DA:340,2
-DA:342,0
-DA:343,0
-DA:344,0
-DA:346,2
-DA:375,1
-DA:377,1
-DA:379,1
-DA:385,3
-DA:393,3
-DA:396,3
-DA:430,3
-DA:435,3
-DA:456,3
-DA:466,3
-DA:539,0
-DA:542,0
-DA:543,0
-DA:544,0
-DA:579,0
-DA:587,0
-DA:592,0
-DA:597,0
-DA:602,0
-DA:624,0
-DA:636,0
-BA:215,0
-BA:215,0
-BA:340,1
-BA:340,2
-BA:340,1
-BA:340,2
-BA:340,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:542,0
-BA:542,0
-BA:542,0
-BA:542,0
-LF:37
-LH:17
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_bvector.h
-FN:75,_ZNSt14_Bit_referenceC1EPmm
-FN:80,_ZNKSt14_Bit_referencecvbEv
-FN:84,_ZNSt14_Bit_referenceaSEb
-FN:94,_ZNSt14_Bit_referenceaSERKS_
-FN:116,_ZNSt18_Bit_iterator_baseC2EPmj
-FN:120,_ZNSt18_Bit_iterator_base10_M_bump_upEv
-FN:130,_ZNSt18_Bit_iterator_base12_M_bump_downEv
-FN:140,_ZNSt18_Bit_iterator_base7_M_incrEi
-FN:154,_ZNKSt18_Bit_iterator_baseeqERKS_
-FN:182,_ZStmiRKSt18_Bit_iterator_baseS1_
-FN:194,_ZNSt13_Bit_iteratorC1Ev
-FN:196,_ZNSt13_Bit_iteratorC1EPmj
-FN:200,_ZNKSt13_Bit_iteratordeEv
-FN:204,_ZNSt13_Bit_iteratorppEv
-FN:211,_ZNSt13_Bit_iteratorppEi
-FN:219,_ZNSt13_Bit_iteratormmEv
-FN:234,_ZNSt13_Bit_iteratorpLEi
-FN:248,_ZNKSt13_Bit_iteratorplEi
-FN:279,_ZNSt19_Bit_const_iteratorC1EPmj
-FN:282,_ZNSt19_Bit_const_iteratorC1ERKSt13_Bit_iterator
-FN:286,_ZNKSt19_Bit_const_iteratordeEv
-FN:290,_ZNSt19_Bit_const_iteratorppEv
-FN:669,_ZNKSt6vectorIbSaIbEEixEj
-FN:592,_ZNKSt6vectorIbSaIbEE5beginEv
-FN:600,_ZNKSt6vectorIbSaIbEE3endEv
-FN:658,_ZNKSt6vectorIbSaIbEE5emptyEv
-FN:638,_ZNKSt6vectorIbSaIbEE4sizeEv
-FN:384,_ZNSt13_Bvector_baseISaIbEE13_Bvector_implD1Ev
-FN:596,_ZNSt6vectorIbSaIbEE3endEv
-FN:588,_ZNSt6vectorIbSaIbEE5beginEv
-FN:389,_ZNSt13_Bvector_baseISaIbEE13_Bvector_implC1Ev
-FN:413,_ZNSt13_Bvector_baseISaIbEEC2Ev
-FN:505,_ZNSt6vectorIbSaIbEEC1Ev
-FN:406,_ZNKSt13_Bvector_baseISaIbEE20_M_get_Bit_allocatorEv
-FN:642,_ZNKSt6vectorIbSaIbEE8max_sizeEv
-FN:444,_ZNSt13_Bvector_baseISaIbEE13_M_deallocateEv
-FN:432,_ZNSt13_Bvector_baseISaIbEED2Ev
-FN:543,_ZNSt6vectorIbSaIbEED1Ev
-FN:986,_ZNKSt6vectorIbSaIbEE12_M_check_lenEjPKc
-FN:439,_ZNSt13_Bvector_baseISaIbEE11_M_allocateEj
-FN:826,_ZNSt6vectorIbSaIbEE15_M_copy_alignedESt19_Bit_const_iteratorS2_St13_Bit_iterator
-FN:720,_ZNSt6vectorIbSaIbEE9push_backEb
-DA:75,5
-DA:76,5
-DA:80,3
-DA:81,3
-DA:84,2
-DA:86,2
-DA:87,1
-DA:89,1
-DA:90,2
-DA:94,0
-DA:95,0
-DA:116,31
-DA:117,31
-DA:120,2
-DA:122,2
-DA:124,0
-DA:125,0
-DA:127,2
-DA:130,0
-DA:132,0
-DA:134,0
-DA:135,0
-DA:137,0
-DA:140,0
-DA:142,0
-DA:143,0
-DA:144,0
-DA:145,0
-DA:147,0
-DA:148,0
-DA:150,0
-DA:151,0
-DA:154,3
-DA:155,3
-DA:182,9
-DA:185,9
-DA:194,2
-DA:196,3
-DA:197,3
-DA:200,2
-DA:201,2
-DA:204,0
-DA:206,0
-DA:207,0
-DA:211,2
-DA:213,2
-DA:214,2
-DA:219,0
-DA:221,0
-DA:222,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:248,0
-DA:250,0
-DA:251,0
-DA:279,4
-DA:280,4
-DA:282,22
-DA:283,22
-DA:286,3
-DA:287,3
-DA:290,0
-DA:292,0
-DA:293,0
-DA:384,1
-DA:389,1
-DA:390,1
-DA:391,1
-DA:406,2
-DA:407,2
-DA:413,1
-DA:414,1
-DA:432,1
-DA:433,1
-DA:439,1
-DA:441,1
-DA:444,2
-DA:446,2
-DA:447,1
-DA:449,2
-DA:505,1
-DA:506,1
-DA:543,1
-DA:588,1
-DA:589,1
-DA:592,10
-DA:593,10
-DA:596,2
-DA:597,2
-DA:600,10
-DA:601,10
-DA:638,7
-DA:639,7
-DA:642,2
-DA:646,2
-DA:647,2
-DA:649,2
-DA:658,3
-DA:659,3
-DA:669,3
-DA:672,3
-DA:720,2
-DA:722,2
-DA:723,1
-DA:725,1
-DA:726,2
-DA:826,1
-DA:828,1
-DA:830,1
-DA:986,1
-DA:988,1
-DA:989,0
-DA:991,1
-DA:992,1
-BA:86,2
-BA:86,2
-BA:122,1
-BA:122,2
-BA:132,0
-BA:132,0
-BA:145,0
-BA:145,0
-BA:155,2
-BA:155,1
-BA:155,2
-BA:155,2
-BA:446,2
-BA:446,2
-BA:649,1
-BA:649,2
-BA:722,2
-BA:722,2
-BA:988,1
-BA:988,2
-BA:992,2
-BA:992,1
-BA:992,1
-BA:992,2
-LF:115
-LH:81
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:97,_ZSt8_DestroyIPcEvT_S1_
-FN:126,_ZSt8_DestroyIPccEvT_S1_RSaIT0_E
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-DA:87,0
-DA:88,0
-DA:97,0
-DA:101,0
-DA:103,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-BA:101,0
-BA:101,0
-LF:9
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEdeEv
-FN:398,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEC1ERS2_
-FN:456,_ZSt13back_inserterISt6vectorISsSaISsEEESt20back_insert_iteratorIT_ERS4_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEC1ERKS2_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEE4baseEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEC1ERKS1_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-FN:429,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEdeEv
-FN:434,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEppEv
-FN:412,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEaSERKSs
-DA:398,0
-DA:412,0
-DA:414,0
-DA:415,0
-DA:429,0
-DA:430,0
-DA:434,0
-DA:435,0
-DA:456,0
-DA:457,0
-DA:683,0
-DA:695,0
-DA:696,0
-DA:747,0
-DA:748,0
-DA:769,0
-DA:770,0
-LF:17
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt26random_access_iterator_tagbiPbRbEC2Ev
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,31
-DA:166,0
-DA:167,0
-LF:3
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_list.h
-FN:169,_ZNKSt14_List_iteratorISsEeqERKS0_
-FN:139,_ZNSt14_List_iteratorISsEppEv
-FN:126,_ZNSt14_List_iteratorISsEC1EPSt15_List_node_base
-FN:666,_ZNSt4listISsSaISsEE3endEv
-FN:328,_ZNKSt10_List_baseISsSaISsEE21_M_get_Node_allocatorEv
-FN:332,_ZNKSt10_List_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:131,_ZNKSt14_List_iteratorISsEdeEv
-FN:317,_ZNSt10_List_baseISsSaISsEE11_M_put_nodeEPSt10_List_nodeISsE
-FN:1356,_ZNSt4listISsSaISsEE8_M_eraseESt14_List_iteratorISsE
-DA:126,0
-DA:127,0
-DA:131,0
-DA:132,0
-DA:139,0
-DA:141,0
-DA:142,0
-DA:169,0
-DA:170,0
-DA:317,0
-DA:318,0
-DA:328,0
-DA:329,0
-DA:332,0
-DA:333,0
-DA:666,0
-DA:667,0
-DA:1356,0
-DA:1358,0
-DA:1359,0
-DA:1360,0
-DA:1361,0
-DA:1362,0
-LF:23
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyIPSsS2_EET0_T_S4_S3_
-FN:113,_ZSt18uninitialized_copyIPSsS0_ET0_T_S2_S1_
-FN:261,_ZSt22__uninitialized_copy_aIPSsS0_SsET0_T_S2_S1_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPSsS0_SaISsEET0_T_S3_S2_RT1_
-DA:73,0
-DA:75,0
-DA:78,0
-DA:79,0
-DA:81,0
-DA:83,0
-DA:85,0
-DA:86,0
-DA:113,0
-DA:122,0
-DA:261,0
-DA:262,0
-DA:268,0
-DA:272,0
-BA:78,0
-BA:78,0
-BA:79,0
-BA:79,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:484,_ZNKSt6vectorISsSaISsEE4sizeEv
-FN:577,_ZNKSt6vectorISsSaISsEEixEj
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:404,_ZNKSt6vectorISsSaISsEE3endEv
-FN:386,_ZNKSt6vectorISsSaISsEE5beginEv
-FN:79,_ZNSt12_Vector_baseIcSaIcEE12_Vector_implD1Ev
-FN:97,_ZNSt12_Vector_baseIcSaIcEE19_M_get_Tp_allocatorEv
-FN:395,_ZNSt6vectorISsSaISsEE3endEv
-FN:377,_ZNSt6vectorISsSaISsEE5beginEv
-FN:526,_ZNKSt6vectorISsSaISsEE5emptyEv
-FN:84,_ZNSt12_Vector_baseIcSaIcEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseIcSaIcEEC2Ev
-FN:213,_ZNSt6vectorIcSaIcEEC1Ev
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:84,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseISsSaISsEEC2Ev
-FN:213,_ZNSt6vectorISsSaISsEEC1Ev
-FN:101,_ZNKSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:489,_ZNKSt6vectorISsSaISsEE8max_sizeEv
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:147,_ZNSt12_Vector_baseIcSaIcEE13_M_deallocateEPcj
-FN:135,_ZNSt12_Vector_baseIcSaIcEED2Ev
-FN:299,_ZNSt6vectorIcSaIcEED1Ev
-FN:1075,_ZNKSt6vectorISsSaISsEE12_M_check_lenEjPKc
-FN:143,_ZNSt12_Vector_baseISsSaISsEE11_M_allocateEj
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-FN:686,_ZNSt6vectorISsSaISsEE9push_backERKSs
-DA:79,0
-DA:84,0
-DA:85,0
-DA:86,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:108,0
-DA:109,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:143,0
-DA:144,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:213,0
-DA:214,0
-DA:299,0
-DA:300,0
-DA:301,0
-DA:377,0
-DA:378,0
-DA:386,0
-DA:387,0
-DA:395,0
-DA:396,0
-DA:404,0
-DA:405,0
-DA:484,0
-DA:485,0
-DA:489,0
-DA:490,0
-DA:526,0
-DA:527,0
-DA:577,3
-DA:578,3
-DA:686,0
-DA:688,0
-DA:690,0
-DA:691,0
-DA:694,0
-DA:695,0
-DA:1075,0
-DA:1077,0
-DA:1078,0
-DA:1080,0
-DA:1081,0
-BA:144,0
-BA:144,0
-BA:149,0
-BA:149,0
-BA:149,0
-BA:149,0
-BA:688,0
-BA:688,0
-BA:1077,0
-BA:1077,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-LF:51
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/stream_iterator.h
-FN:181,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERSoPKc
-FN:185,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERKS2_
-FN:202,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEdeEv
-FN:206,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEppEv
-FN:191,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEaSERKSs
-DA:181,0
-DA:182,0
-DA:185,0
-DA:186,0
-DA:191,0
-DA:196,0
-DA:197,0
-DA:198,0
-DA:202,0
-DA:203,0
-DA:206,0
-DA:207,0
-BA:197,0
-BA:197,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/vector.tcc
-FN:283,_ZNSt6vectorISsSaISsEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPSsS1_EERKSs
-FN:628,_ZNSt6vectorIbSaIbEE13_M_insert_auxESt13_Bit_iteratorb
-DA:283,0
-DA:286,0
-DA:288,0
-DA:291,0
-DA:293,0
-DA:295,0
-DA:299,0
-DA:307,0
-DA:308,0
-DA:309,0
-DA:316,0
-DA:321,0
-DA:323,0
-DA:324,0
-DA:330,0
-DA:332,0
-DA:333,0
-DA:334,0
-DA:336,0
-DA:338,0
-DA:341,0
-DA:342,0
-DA:343,0
-DA:345,0
-DA:628,1
-DA:630,1
-DA:632,0
-DA:634,0
-DA:635,0
-DA:640,1
-DA:641,1
-DA:643,1
-DA:644,1
-DA:645,1
-DA:646,1
-DA:647,1
-DA:650,1
-DA:652,1
-BA:286,0
-BA:286,0
-BA:630,1
-BA:630,2
-LF:38
-LH:11
-end_of_record
-SF:/usr/include/c++/4.3/exception
-FN:59,_ZNSt9exceptionC2Ev
-DA:59,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorImED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISsE8max_sizeEv
-FN:69,_ZN9__gnu_cxx13new_allocatorImEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorImE8max_sizeEv
-FN:107,_ZN9__gnu_cxx13new_allocatorISsE9constructEPSsRKSs
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-FN:97,_ZN9__gnu_cxx13new_allocatorISt10_List_nodeISsEE10deallocateEPS2_j
-FN:97,_ZN9__gnu_cxx13new_allocatorIcE10deallocateEPcj
-FN:97,_ZN9__gnu_cxx13new_allocatorImE10deallocateEPmj
-FN:87,_ZN9__gnu_cxx13new_allocatorISsE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorImE8allocateEjPKv
-FN:118,_ZN9__gnu_cxx13new_allocatorISsE7destroyEPSs
-DA:69,1
-DA:71,0
-DA:76,1
-DA:87,1
-DA:89,1
-DA:90,0
-DA:92,1
-DA:97,1
-DA:98,1
-DA:101,3
-DA:102,3
-DA:107,0
-DA:108,0
-DA:118,0
-BA:89,0
-BA:89,0
-BA:89,1
-BA:89,2
-BA:108,0
-BA:108,0
-LF:14
-LH:9
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/istream
-FN:585,_ZNSiC2Ev
-FN:105,_ZNSiD2Ev
-FN:804,_ZNSdC2Ev
-FN:801,_ZNSdD2Ev
-DA:105,0
-DA:106,0
-DA:585,0
-DA:586,0
-DA:587,0
-DA:801,0
-DA:804,0
-DA:805,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:177,_ZNSolsEb
-FN:195,_ZNSolsEj
-DA:95,0
-DA:112,0
-DA:117,0
-DA:177,0
-DA:178,0
-DA:195,0
-DA:199,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:509,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:536,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:555,_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-DA:509,0
-DA:510,0
-DA:511,0
-DA:536,0
-DA:537,0
-DA:555,0
-DA:556,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-LF:25
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/regexp.h
-FN:115,_ZNK6wibble9Tokenizer14const_iteratoreqERKS1_
-FN:119,_ZNK6wibble9Tokenizer14const_iteratorneERKS1_
-FN:173,_ZNK6wibble8Splitter14const_iteratordeEv
-FN:177,_ZNK6wibble8Splitter14const_iteratorptEv
-FN:107,_ZN6wibble9Tokenizer14const_iteratorC1ERS0_b
-FN:129,_ZN6wibble9Tokenizer3endEv
-FN:194,_ZN6wibble8SplitterC1ERKSsi
-FN:125,_ZN6wibble9TokenizerC1ERKSsS2_i
-FN:181,_ZNK6wibble8Splitter14const_iteratoreqERKS1_
-FN:168,_ZN6wibble8Splitter14const_iteratorC1ERNS_6RegexpERKSs
-FN:200,_ZN6wibble8Splitter5beginERKSs
-FN:169,_ZN6wibble8Splitter14const_iteratorC1ERNS_6RegexpE
-FN:201,_ZN6wibble8Splitter3endEv
-FN:156,_ZN6wibble8Splitter14const_iteratorD1Ev
-FN:146,_ZN6wibble8SplitterD1Ev
-FN:90,_ZN6wibble9TokenizerD1Ev
-FN:106,_ZN6wibble9Tokenizer14const_iteratorC1ERS0_
-FN:128,_ZN6wibble9Tokenizer5beginEv
-FN:111,_ZNK6wibble9Tokenizer14const_iteratordeEv
-FN:85,_ZN6wibble7ERegexpC1ERKSsii
-FN:83,_ZN6wibble7ERegexpD1Ev
-DA:83,2
-DA:85,2
-DA:86,2
-DA:90,1
-DA:106,1
-DA:107,5
-DA:111,4
-DA:113,4
-DA:115,1
-DA:117,1
-DA:119,4
-DA:121,4
-DA:125,1
-DA:126,1
-DA:128,1
-DA:129,5
-DA:146,2
-DA:156,4
-DA:168,2
-DA:169,2
-DA:173,8
-DA:175,8
-DA:177,8
-DA:179,8
-DA:181,2
-DA:183,2
-DA:194,2
-DA:195,2
-DA:200,2
-DA:201,2
-BA:117,2
-BA:117,1
-BA:117,2
-BA:117,1
-BA:121,1
-BA:121,2
-BA:121,0
-BA:121,0
-BA:183,2
-BA:183,1
-BA:183,2
-BA:183,1
-LF:30
-LH:30
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:13,_ZN8LocationC1ERKS_
-FN:17,_ZN8LocationC1EPKciSs
-FN:52,_ZlsISsER12AssertFailedS1_T_
-FN:52,_ZlsIPKcER12AssertFailedS3_T_
-FN:52,_ZlsIjER12AssertFailedS1_T_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:41,_ZN12AssertFailedD1Ev
-FN:13,_ZN8LocationD1Ev
-FN:67,_Z12assert_eq_fnIjjEv8LocationT_T0_
-FN:59,_Z9assert_fnIbEv8LocationT_
-FN:67,_Z12assert_eq_fnISsPKcEv8LocationT_T0_
-FN:67,_Z12assert_eq_fnISsSsEv8LocationT_T0_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:59,0
-DA:61,0
-DA:62,0
-DA:64,0
-DA:67,452
-DA:69,452
-DA:70,0
-DA:71,0
-DA:75,452
-BA:42,0
-BA:42,0
-BA:61,0
-BA:61,0
-BA:69,0
-BA:69,0
-BA:69,1
-BA:69,2
-BA:69,1
-BA:69,2
-LF:26
-LH:3
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/regexp.test.h
-FN:92,_ZN12_GLOBAL__N_110TestRegexp13emptySplitterEv
-FN:73,_ZN12_GLOBAL__N_110TestRegexp8splitterEv
-FN:53,_ZN12_GLOBAL__N_110TestRegexp8tokenizeEv
-FN:14,_ZN12_GLOBAL__N_110TestRegexp10basicMatchEv
-FN:34,_ZN12_GLOBAL__N_110TestRegexp7captureEv
-FN:24,_ZN12_GLOBAL__N_110TestRegexp13extendedMatchEv
-DA:14,1
-DA:15,1
-DA:16,2
-DA:17,2
-DA:18,2
-DA:19,2
-DA:20,2
-DA:21,2
-DA:22,1
-DA:24,1
-DA:25,1
-DA:26,2
-DA:27,2
-DA:28,2
-DA:29,2
-DA:30,2
-DA:31,2
-DA:32,1
-DA:34,1
-DA:35,1
-DA:36,2
-DA:37,2
-DA:38,2
-DA:39,2
-DA:40,2
-DA:41,2
-DA:42,2
-DA:43,2
-DA:44,2
-DA:45,2
-DA:47,2
-DA:48,2
-DA:49,2
-DA:50,2
-DA:51,1
-DA:53,1
-DA:54,1
-DA:55,2
-DA:56,1
-DA:58,1
-DA:59,2
-DA:60,1
-DA:61,1
-DA:62,2
-DA:63,1
-DA:64,1
-DA:65,2
-DA:66,1
-DA:67,1
-DA:68,2
-DA:69,1
-DA:70,1
-DA:71,1
-DA:73,1
-DA:75,1
-DA:76,2
-DA:77,2
-DA:78,1
-DA:79,1
-DA:80,1
-DA:81,1
-DA:82,1
-DA:83,1
-DA:84,1
-DA:85,1
-DA:86,1
-DA:87,1
-DA:88,1
-DA:89,1
-DA:90,1
-DA:92,1
-DA:94,1
-DA:95,2
-DA:96,2
-DA:97,1
-DA:98,1
-DA:99,1
-DA:100,1
-DA:101,1
-DA:102,1
-DA:103,1
-DA:104,1
-DA:105,1
-DA:106,1
-DA:107,1
-DA:108,1
-DA:109,1
-LF:87
-LH:87
-end_of_record
-SF:/srv/build/pkg/ept-work/default/wibble/wibble-test-generated-_home_mornfall_dev_pkg_ept-work_wibble_regexp.cpp
-FN:8,_Z41__static_initialization_and_destruction_0ii
-FN:8,_GLOBAL__I__Z21run_Regexp_basicMatchv
-FN:8,_Z24run_Regexp_emptySplitterv
-FN:7,_Z19run_Regexp_splitterv
-FN:6,_Z19run_Regexp_tokenizev
-FN:3,_Z21run_Regexp_basicMatchv
-FN:5,_Z18run_Regexp_capturev
-FN:4,_Z24run_Regexp_extendedMatchv
-DA:3,1
-DA:4,1
-DA:5,1
-DA:6,1
-DA:7,1
-DA:8,4
-BA:8,2
-BA:8,1
-BA:8,2
-BA:8,1
-LF:6
-LH:6
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaIcED1Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:2188,_ZSteqIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_EPKS3_
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-FN:2162,_ZSteqIcEN9__gnu_cxx11__enable_ifIXsrSt9__is_charIT_E7__valueEbE6__typeERKSbIS3_St11char_traitsIS3_ESaIS3_EESC_
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:306,_ZNKSs8_M_checkEjPKc
-FN:1923,_ZNKSs6substrEjj
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:306,0
-DA:308,0
-DA:309,0
-DA:310,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:1923,0
-DA:1925,0
-DA:2067,0
-DA:2069,0
-DA:2162,304
-DA:2165,304
-DA:2188,618
-DA:2189,618
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:308,0
-BA:308,0
-BA:341,0
-BA:341,0
-BA:2165,2
-BA:2165,1
-BA:2165,2
-BA:2165,2
-LF:61
-LH:4
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-DA:245,0
-DA:246,0
-DA:257,304
-DA:258,304
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:8
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:166,0
-DA:167,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-DA:69,0
-DA:71,0
-DA:76,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:195,_ZNSolsEj
-DA:95,0
-DA:112,0
-DA:117,0
-DA:195,0
-DA:199,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/amorph.h
-FN:371,_ZNK6wibble6AmorphINS_5RangeIiEENS_14RangeInterfaceIiEELi0EE14morphInterfaceEv
-FN:345,_ZN6wibble6AmorphINS_5RangeIiEENS_14RangeInterfaceIiEELi0EED2Ev
-FN:332,_ZN6wibble6AmorphINS_5RangeIiEENS_14RangeInterfaceIiEELi0EE24setMorphInterfacePointerEPKNS_14MorphInterfaceIS4_EE
-FN:288,_ZN6wibble6AmorphINS_5RangeIiEENS_14RangeInterfaceIiEELi0EEC2ERKS5_
-FN:371,_ZNK6wibble6AmorphINS_8ConsumerIiEENS_17ConsumerInterfaceIiEELi0EE14morphInterfaceEv
-FN:345,_ZN6wibble6AmorphINS_8ConsumerIiEENS_17ConsumerInterfaceIiEELi0EED2Ev
-FN:332,_ZN6wibble6AmorphINS_8ConsumerIiEENS_17ConsumerInterfaceIiEELi0EE24setMorphInterfacePointerEPKNS_14MorphInterfaceIS4_EE
-FN:288,_ZN6wibble6AmorphINS_8ConsumerIiEENS_17ConsumerInterfaceIiEELi0EEC2ERKS5_
-FN:366,_ZN6wibble6AmorphINS_8ConsumerIiEENS_17ConsumerInterfaceIiEELi0EE14implementationEv
-FN:284,_ZN6wibble6AmorphINS_5RangeIiEENS_14RangeInterfaceIiEELi0EEC2ERKNS_14MorphInterfaceIS4_EE
-FN:366,_ZN6wibble6AmorphINS_5RangeIiEENS_14RangeInterfaceIiEELi0EE14implementationEv
-FN:100,_ZN6wibble14MorphAllocatorC2Ev
-FN:284,_ZN6wibble6AmorphINS_8ConsumerIiEENS_17ConsumerInterfaceIiEELi0EEC2ERKNS_14MorphInterfaceIS4_EE
-FN:91,_ZN6wibble14MorphInterfaceINS_14RangeInterfaceIiEEEC2Ev
-FN:115,_ZN6wibble9MorphBaseINS_13IteratorRangeISt14_List_iteratorIiEEENS_14RangeInterfaceIiEEEC2ERKS4_
-FN:147,_ZN6wibble5MorphINS_10RangeMorphIiNS_13IteratorRangeISt14_List_iteratorIiEEEEES5_NS_14RangeInterfaceIiEEEC2ERKS5_
-FN:91,_ZN6wibble14MorphInterfaceINS_17ConsumerInterfaceIiEEEC2Ev
-FN:115,_ZN6wibble9MorphBaseINS_20ConsumerFromIteratorIiSt20back_insert_iteratorISt4listIiSaIiEEEEENS_17ConsumerInterfaceIiEEEC2ERKS7_
-FN:147,_ZN6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt20back_insert_iteratorISt4listIiSaIiEEEEEEES8_NS_17ConsumerInterfaceIiEEEC2ERKS8_
-FN:115,_ZN6wibble9MorphBaseINS_20ConsumerFromIteratorIiSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEENS_17ConsumerInterfaceIiEEEC2ERKS9_
-FN:147,_ZN6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEEEESA_NS_17ConsumerInterfaceIiEEEC2ERKSA_
-FN:115,_ZN6wibble9MorphBaseINS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEENS_17ConsumerInterfaceIiEEEC2ERKS7_
-FN:147,_ZN6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEEES8_NS_17ConsumerInterfaceIiEEEC2ERKS8_
-FN:361,_ZNK6wibble6AmorphINS_5RangeIiEENS_14RangeInterfaceIiEELi0EE14implementationEv
-FN:303,_ZNK6wibble6AmorphINS_5RangeIiEENS_14RangeInterfaceIiEELi0EE3leqERKS2_
-FN:314,_ZNK6wibble6AmorphINS_5RangeIiEENS_14RangeInterfaceIiEELi0EEleERKS2_
-FN:91,_ZN6wibble14MorphInterfaceINS_17ConsumerInterfaceIiEEEC2ERKS3_
-FN:114,_ZN6wibble9MorphBaseINS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEENS_17ConsumerInterfaceIiEEEC2ERKSA_
-FN:144,_ZN6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEEES8_NS_17ConsumerInterfaceIiEEEC2ERKSC_
-FN:173,_ZN6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEEES8_NS_17ConsumerInterfaceIiEEE7destroyEj
-FN:114,_ZN6wibble9MorphBaseINS_20ConsumerFromIteratorIiSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEENS_17ConsumerInterfaceIiEEEC2ERKSC_
-FN:144,_ZN6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEEEESA_NS_17ConsumerInterfaceIiEEEC2ERKSE_
-FN:173,_ZN6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEEEESA_NS_17ConsumerInterfaceIiEEE7destroyEj
-FN:114,_ZN6wibble9MorphBaseINS_20ConsumerFromIteratorIiSt20back_insert_iteratorISt4listIiSaIiEEEEENS_17ConsumerInterfaceIiEEEC2ERKSA_
-FN:144,_ZN6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt20back_insert_iteratorISt4listIiSaIiEEEEEEES8_NS_17ConsumerInterfaceIiEEEC2ERKSC_
-FN:173,_ZN6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt20back_insert_iteratorISt4listIiSaIiEEEEEEES8_NS_17ConsumerInterfaceIiEEE7destroyEj
-FN:91,_ZN6wibble14MorphInterfaceINS_14RangeInterfaceIiEEEC2ERKS3_
-FN:114,_ZN6wibble9MorphBaseINS_13IteratorRangeISt14_List_iteratorIiEEENS_14RangeInterfaceIiEEEC2ERKS7_
-FN:144,_ZN6wibble5MorphINS_10RangeMorphIiNS_13IteratorRangeISt14_List_iteratorIiEEEEES5_NS_14RangeInterfaceIiEEEC2ERKS9_
-FN:173,_ZN6wibble5MorphINS_10RangeMorphIiNS_13IteratorRangeISt14_List_iteratorIiEEEEES5_NS_14RangeInterfaceIiEEE7destroyEj
-FN:92,_ZN6wibble14MorphInterfaceINS_17ConsumerInterfaceIiEEE11virtualBaseEv
-FN:92,_ZN6wibble14MorphInterfaceINS_14RangeInterfaceIiEEE11virtualBaseEv
-FN:185,_ZN6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEEES8_NS_17ConsumerInterfaceIiEEE7wrappedEv
-FN:124,_ZN6wibble9MorphBaseINS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEENS_17ConsumerInterfaceIiEEE11virtualBaseIS7_EENS_8EnableIfINS_4TNotINS_13IsPolymorphicIT_EEEEPNS_11VirtualBaseEE1TEv
-FN:128,_ZN6wibble9MorphBaseINS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEENS_17ConsumerInterfaceIiEEE11virtualBaseEv
-FN:149,_ZNK6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEEES8_NS_17ConsumerInterfaceIiEEE4selfEv
-FN:181,_ZNK6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEEES8_NS_17ConsumerInterfaceIiEEE7wrappedEv
-FN:185,_ZN6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEEEESA_NS_17ConsumerInterfaceIiEEE7wrappedEv
-FN:124,_ZN6wibble9MorphBaseINS_20ConsumerFromIteratorIiSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEENS_17ConsumerInterfaceIiEEE11virtualBaseIS9_EENS_8EnableIfINS_4TNotINS_13IsPolymorphicIT_EEEEPNS_11VirtualBaseEE1TEv
-FN:128,_ZN6wibble9MorphBaseINS_20ConsumerFromIteratorIiSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEENS_17ConsumerInterfaceIiEEE11virtualBaseEv
-FN:149,_ZNK6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEEEESA_NS_17ConsumerInterfaceIiEEE4selfEv
-FN:181,_ZNK6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEEEESA_NS_17ConsumerInterfaceIiEEE7wrappedEv
-FN:185,_ZN6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt20back_insert_iteratorISt4listIiSaIiEEEEEEES8_NS_17ConsumerInterfaceIiEEE7wrappedEv
-FN:124,_ZN6wibble9MorphBaseINS_20ConsumerFromIteratorIiSt20back_insert_iteratorISt4listIiSaIiEEEEENS_17ConsumerInterfaceIiEEE11virtualBaseIS7_EENS_8EnableIfINS_4TNotINS_13IsPolymorphicIT_EEEEPNS_11VirtualBaseEE1TEv
-FN:128,_ZN6wibble9MorphBaseINS_20ConsumerFromIteratorIiSt20back_insert_iteratorISt4listIiSaIiEEEEENS_17ConsumerInterfaceIiEEE11virtualBaseEv
-FN:149,_ZNK6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt20back_insert_iteratorISt4listIiSaIiEEEEEEES8_NS_17ConsumerInterfaceIiEEE4selfEv
-FN:181,_ZNK6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt20back_insert_iteratorISt4listIiSaIiEEEEEEES8_NS_17ConsumerInterfaceIiEEE7wrappedEv
-FN:181,_ZNK6wibble5MorphINS_10RangeMorphIiNS_13IteratorRangeISt14_List_iteratorIiEEEEES5_NS_14RangeInterfaceIiEEE7wrappedEv
-FN:185,_ZN6wibble5MorphINS_10RangeMorphIiNS_13IteratorRangeISt14_List_iteratorIiEEEEES5_NS_14RangeInterfaceIiEEE7wrappedEv
-FN:124,_ZN6wibble9MorphBaseINS_13IteratorRangeISt14_List_iteratorIiEEENS_14RangeInterfaceIiEEE11virtualBaseIS4_EENS_8EnableIfINS_4TNotINS_13IsPolymorphicIT_EEEEPNS_11VirtualBaseEE1TEv
-FN:128,_ZN6wibble9MorphBaseINS_13IteratorRangeISt14_List_iteratorIiEEENS_14RangeInterfaceIiEEE11virtualBaseEv
-FN:149,_ZNK6wibble5MorphINS_10RangeMorphIiNS_13IteratorRangeISt14_List_iteratorIiEEEEES5_NS_14RangeInterfaceIiEEE4selfEv
-FN:156,_ZNK6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEEES8_NS_17ConsumerInterfaceIiEEE3leqEPKNS_14MorphInterfaceISB_EE
-FN:316,_ZN6wibble6AmorphINS_5RangeIiEENS_14RangeInterfaceIiEELi0EE19setInterfacePointerEPKS4_
-FN:340,_ZN6wibble6AmorphINS_5RangeIiEENS_14RangeInterfaceIiEELi0EEaSERKS5_
-FN:156,_ZNK6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEEEESA_NS_17ConsumerInterfaceIiEEE3leqEPKNS_14MorphInterfaceISD_EE
-FN:156,_ZNK6wibble5MorphINS_10RangeMorphIiNS_13IteratorRangeISt14_List_iteratorIiEEEEES5_NS_14RangeInterfaceIiEEE3leqEPKNS_14MorphInterfaceIS8_EE
-FN:156,_ZNK6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt20back_insert_iteratorISt4listIiSaIiEEEEEEES8_NS_17ConsumerInterfaceIiEEE3leqEPKNS_14MorphInterfaceISB_EE
-FN:101,_ZN6wibble14MorphAllocatornwEjPvj
-FN:168,_ZNK6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEEES8_NS_17ConsumerInterfaceIiEEE13constructCopyEPvj
-FN:168,_ZNK6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEEEESA_NS_17ConsumerInterfaceIiEEE13constructCopyEPvj
-FN:168,_ZNK6wibble5MorphINS_10RangeMorphIiNS_13IteratorRangeISt14_List_iteratorIiEEEEES5_NS_14RangeInterfaceIiEEE13constructCopyEPvj
-FN:168,_ZNK6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt20back_insert_iteratorISt4listIiSaIiEEEEEEES8_NS_17ConsumerInterfaceIiEEE13constructCopyEPvj
-FN:95,_ZN6wibble14MorphInterfaceINS_17ConsumerInterfaceIiEEED2Ev
-FN:114,_ZN6wibble9MorphBaseINS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEENS_17ConsumerInterfaceIiEEED2Ev
-FN:189,_ZN6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEEES8_NS_17ConsumerInterfaceIiEEED0Ev
-FN:95,_ZN6wibble14MorphInterfaceINS_17ConsumerInterfaceIiEEED0Ev
-FN:95,_ZN6wibble14MorphInterfaceINS_17ConsumerInterfaceIiEEED1Ev
-FN:189,_ZN6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEEES8_NS_17ConsumerInterfaceIiEEED1Ev
-FN:189,_ZN6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEEES8_NS_17ConsumerInterfaceIiEEED2Ev
-FN:114,_ZN6wibble9MorphBaseINS_20ConsumerFromIteratorIiSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEENS_17ConsumerInterfaceIiEEED2Ev
-FN:189,_ZN6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEEEESA_NS_17ConsumerInterfaceIiEEED0Ev
-FN:189,_ZN6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEEEESA_NS_17ConsumerInterfaceIiEEED1Ev
-FN:189,_ZN6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEEEESA_NS_17ConsumerInterfaceIiEEED2Ev
-FN:95,_ZN6wibble14MorphInterfaceINS_14RangeInterfaceIiEEED2Ev
-FN:114,_ZN6wibble9MorphBaseINS_13IteratorRangeISt14_List_iteratorIiEEENS_14RangeInterfaceIiEEED2Ev
-FN:189,_ZN6wibble5MorphINS_10RangeMorphIiNS_13IteratorRangeISt14_List_iteratorIiEEEEES5_NS_14RangeInterfaceIiEEED0Ev
-FN:95,_ZN6wibble14MorphInterfaceINS_14RangeInterfaceIiEEED0Ev
-FN:95,_ZN6wibble14MorphInterfaceINS_14RangeInterfaceIiEEED1Ev
-FN:189,_ZN6wibble5MorphINS_10RangeMorphIiNS_13IteratorRangeISt14_List_iteratorIiEEEEES5_NS_14RangeInterfaceIiEEED1Ev
-FN:189,_ZN6wibble5MorphINS_10RangeMorphIiNS_13IteratorRangeISt14_List_iteratorIiEEEEES5_NS_14RangeInterfaceIiEEED2Ev
-FN:114,_ZN6wibble9MorphBaseINS_20ConsumerFromIteratorIiSt20back_insert_iteratorISt4listIiSaIiEEEEENS_17ConsumerInterfaceIiEEED2Ev
-FN:189,_ZN6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt20back_insert_iteratorISt4listIiSaIiEEEEEEES8_NS_17ConsumerInterfaceIiEEED0Ev
-FN:189,_ZN6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt20back_insert_iteratorISt4listIiSaIiEEEEEEES8_NS_17ConsumerInterfaceIiEEED1Ev
-FN:189,_ZN6wibble5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt20back_insert_iteratorISt4listIiSaIiEEEEEEES8_NS_17ConsumerInterfaceIiEEED2Ev
-DA:91,286
-DA:92,0
-DA:95,268
-DA:100,31
-DA:101,291
-DA:102,291
-DA:103,291
-DA:104,291
-DA:106,0
-DA:114,249
-DA:115,13
-DA:124,0
-DA:125,0
-DA:128,0
-DA:129,0
-DA:144,119
-DA:147,13
-DA:149,119
-DA:156,27
-DA:157,27
-DA:158,27
-DA:159,0
-DA:160,0
-DA:162,0
-DA:164,27
-DA:168,119
-DA:170,119
-DA:173,117
-DA:174,117
-DA:175,0
-DA:177,117
-DA:179,117
-DA:181,69
-DA:182,69
-DA:185,39
-DA:186,39
-DA:189,130
-DA:284,25
-DA:285,25
-DA:286,25
-DA:288,220
-DA:289,220
-DA:291,220
-DA:303,62
-DA:304,62
-DA:305,62
-DA:306,62
-DA:308,0
-DA:310,0
-DA:314,62
-DA:316,16
-DA:317,16
-DA:318,0
-DA:319,0
-DA:326,16
-DA:332,245
-DA:333,245
-DA:334,0
-DA:335,0
-DA:337,245
-DA:340,16
-DA:341,16
-DA:342,16
-DA:345,243
-DA:346,243
-DA:347,243
-DA:348,243
-DA:361,60
-DA:363,60
-DA:366,93
-DA:368,93
-DA:371,954
-DA:372,954
-BA:95,1
-BA:95,2
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,1
-BA:95,2
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:102,1
-BA:102,2
-BA:102,0
-BA:102,0
-BA:114,1
-BA:114,2
-BA:114,0
-BA:114,0
-BA:114,0
-BA:114,0
-BA:114,1
-BA:114,2
-BA:114,0
-BA:114,0
-BA:114,0
-BA:114,0
-BA:114,1
-BA:114,2
-BA:114,0
-BA:114,0
-BA:114,0
-BA:114,0
-BA:114,1
-BA:114,2
-BA:114,0
-BA:114,0
-BA:114,0
-BA:114,0
-BA:157,0
-BA:157,0
-BA:157,0
-BA:157,0
-BA:157,1
-BA:157,2
-BA:157,0
-BA:157,0
-BA:158,0
-BA:158,0
-BA:158,0
-BA:158,0
-BA:158,1
-BA:158,2
-BA:158,0
-BA:158,0
-BA:159,0
-BA:159,0
-BA:159,0
-BA:159,0
-BA:159,0
-BA:159,0
-BA:159,0
-BA:159,0
-BA:174,1
-BA:174,2
-BA:174,1
-BA:174,2
-BA:174,1
-BA:174,2
-BA:174,1
-BA:174,2
-BA:177,2
-BA:177,1
-BA:177,2
-BA:177,1
-BA:177,2
-BA:177,1
-BA:177,2
-BA:177,1
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,1
-BA:189,2
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,1
-BA:189,2
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,1
-BA:189,2
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,1
-BA:189,2
-BA:304,2
-BA:304,1
-BA:305,2
-BA:305,1
-BA:317,1
-BA:317,2
-BA:326,2
-BA:326,1
-BA:333,1
-BA:333,2
-BA:333,1
-BA:333,2
-BA:346,2
-BA:346,1
-BA:346,2
-BA:346,1
-LF:73
-LH:57
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/consumer.h
-FN:48,_ZN6wibble13ConsumerMixinIiNS_20ConsumerFromIteratorIiSt20back_insert_iteratorISt4listIiSaIiEEEEEEC2Ev
-FN:91,_ZN6wibble20ConsumerFromIteratorIiSt20back_insert_iteratorISt4listIiSaIiEEEEC1ES5_
-FN:66,_ZN6wibble8ConsumerIiED1Ev
-FN:66,_ZN6wibble8ConsumerIiEC1ERKS1_
-FN:77,_ZN6wibble8ConsumerIiE7consumeERKi
-FN:48,_ZN6wibble13ConsumerMixinIiNS_8ConsumerIiEEEC2Ev
-FN:48,_ZN6wibble13ConsumerMixinIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEEEC2Ev
-FN:91,_ZN6wibble20ConsumerFromIteratorIiSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEC1ES7_
-FN:48,_ZN6wibble13ConsumerMixinIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEEC2Ev
-FN:91,_ZN6wibble20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEC1ES5_
-FN:74,_ZN6wibble8ConsumerIiEC1ERKNS_14MorphInterfaceINS_17ConsumerInterfaceIiEEEE
-FN:21,_ZN6wibble17ConsumerInterfaceIiEC2Ev
-FN:32,_ZN6wibble13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt20back_insert_iteratorISt4listIiSaIiEEEEEEC1ERKS7_
-FN:81,_ZN6wibble8ConsumerIiEaSERKi
-FN:49,_ZN6wibble13ConsumerMixinIiNS_8ConsumerIiEEE4selfEv
-FN:56,_ZN6wibble13ConsumerMixinIiNS_8ConsumerIiEEEdeEv
-FN:54,_ZN6wibble13ConsumerMixinIiNS_8ConsumerIiEEEppEv
-FN:32,_ZN6wibble13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEEEC1ERKS9_
-FN:32,_ZN6wibble13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEEC1ERKS7_
-FN:21,_ZN6wibble17ConsumerInterfaceIiEC2ERKS1_
-FN:30,_ZN6wibble13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEEC1ERKS8_
-FN:30,_ZN6wibble13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEEEC1ERKSA_
-FN:30,_ZN6wibble13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt20back_insert_iteratorISt4listIiSaIiEEEEEEC1ERKS8_
-FN:53,_ZNK6wibble13ConsumerMixinIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEEleERKS7_
-FN:53,_ZNK6wibble13ConsumerMixinIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEEEleERKS9_
-FN:53,_ZNK6wibble13ConsumerMixinIiNS_20ConsumerFromIteratorIiSt20back_insert_iteratorISt4listIiSaIiEEEEEEleERKS7_
-FN:38,_ZN6wibble13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEE7consumeENS_5RangeIiEE
-FN:38,_ZN6wibble13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEEE7consumeENS_5RangeIiEE
-FN:38,_ZN6wibble13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt20back_insert_iteratorISt4listIiSaIiEEEEEE7consumeENS_5RangeIiEE
-FN:25,_ZN6wibble17ConsumerInterfaceIiED2Ev
-FN:25,_ZN6wibble17ConsumerInterfaceIiED0Ev
-FN:25,_ZN6wibble17ConsumerInterfaceIiED1Ev
-FN:30,_ZN6wibble13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEED1Ev
-FN:101,_ZN6wibble13consumerMorphINS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEEENS_8ConsumerINT_12ConsumedTypeEEES9_
-FN:107,_ZN6wibble8consumerISt15insert_iteratorISt6vectorIiSaIiEEEEENS_8ConsumerINT_14container_type10value_typeEEES7_
-FN:114,_ZN6wibble8consumerISt6vectorIiSaIiEEEENS_6IsTypeINS_8ConsumerINT_10value_typeEEENS6_8iteratorEE1TERS6_
-FN:30,_ZN6wibble13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEEED1Ev
-FN:101,_ZN6wibble13consumerMorphINS_20ConsumerFromIteratorIiSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEEEENS_8ConsumerINT_12ConsumedTypeEEESB_
-FN:107,_ZN6wibble8consumerISt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEENS_8ConsumerINT_14container_type10value_typeEEES9_
-FN:114,_ZN6wibble8consumerISt3setIiSt4lessIiESaIiEEEENS_6IsTypeINS_8ConsumerINT_10value_typeEEENS8_8iteratorEE1TERS8_
-FN:30,_ZN6wibble13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt20back_insert_iteratorISt4listIiSaIiEEEEEED1Ev
-FN:101,_ZN6wibble13consumerMorphINS_20ConsumerFromIteratorIiSt20back_insert_iteratorISt4listIiSaIiEEEEEEENS_8ConsumerINT_12ConsumedTypeEEES9_
-FN:107,_ZN6wibble8consumerISt20back_insert_iteratorISt4listIiSaIiEEEEENS_8ConsumerINT_14container_type10value_typeEEES7_
-FN:92,_ZN6wibble20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEE7consumeERKi
-FN:34,_ZN6wibble13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEE7consumeERKi
-FN:92,_ZN6wibble20ConsumerFromIteratorIiSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEE7consumeERKi
-FN:34,_ZN6wibble13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEEE7consumeERKi
-FN:92,_ZN6wibble20ConsumerFromIteratorIiSt20back_insert_iteratorISt4listIiSaIiEEEE7consumeERKi
-FN:34,_ZN6wibble13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt20back_insert_iteratorISt4listIiSaIiEEEEEE7consumeERKi
-DA:21,37
-DA:25,37
-DA:30,67
-DA:32,7
-DA:34,14
-DA:35,14
-DA:38,0
-DA:39,0
-DA:40,0
-DA:41,0
-DA:43,0
-DA:48,14
-DA:49,18
-DA:53,0
-DA:54,9
-DA:56,9
-DA:66,53
-DA:74,7
-DA:77,14
-DA:78,14
-DA:81,9
-DA:82,9
-DA:83,9
-DA:91,7
-DA:92,14
-DA:93,14
-DA:94,14
-DA:95,14
-DA:101,7
-DA:102,7
-DA:107,7
-DA:109,7
-DA:114,6
-DA:115,6
-BA:25,1
-BA:25,2
-BA:25,0
-BA:25,0
-BA:25,0
-BA:25,0
-BA:30,2
-BA:30,1
-BA:30,1
-BA:30,2
-BA:30,2
-BA:30,1
-BA:30,1
-BA:30,2
-BA:30,2
-BA:30,1
-BA:30,1
-BA:30,2
-BA:39,0
-BA:39,0
-BA:39,0
-BA:39,0
-BA:39,0
-BA:39,0
-LF:34
-LH:28
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/mixin.h
-FN:13,_ZN6wibble5mixin10ComparableINS_13IteratorRangeISt14_List_iteratorIiEEEEC2Ev
-FN:13,_ZN6wibble5mixin10ComparableINS_5RangeIiEEEC2Ev
-FN:13,_ZN6wibble5mixin10ComparableINS_20ConsumerFromIteratorIiSt20back_insert_iteratorISt4listIiSaIiEEEEEEC2Ev
-FN:13,_ZN6wibble5mixin10ComparableINS_13RangeIteratorINS_5RangeIiEEEEEC2Ev
-FN:13,_ZN6wibble5mixin10ComparableINS_8ConsumerIiEEEC2Ev
-FN:13,_ZN6wibble5mixin10ComparableINS_20ConsumerFromIteratorIiSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEEEC2Ev
-FN:13,_ZN6wibble5mixin10ComparableINS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEEC2Ev
-FN:13,_ZN6wibble5mixin10ComparableINS_5MorphINS_10RangeMorphIiNS_13IteratorRangeISt14_List_iteratorIiEEEEES7_NS_14RangeInterfaceIiEEEEEC2Ev
-FN:13,_ZN6wibble5mixin10ComparableINS_5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt20back_insert_iteratorISt4listIiSaIiEEEEEEESA_NS_17ConsumerInterfaceIiEEEEEC2Ev
-FN:13,_ZN6wibble5mixin10ComparableINS_5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEEEESC_NS_17ConsumerInterfaceIiEEEEEC2Ev
-FN:13,_ZN6wibble5mixin10ComparableINS_5MorphINS_13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEEESA_NS_17ConsumerInterfaceIiEEEEEC2Ev
-FN:15,_ZNK6wibble5mixin10ComparableINS_13RangeIteratorINS_5RangeIiEEEEE7cmpSelfEv
-FN:23,_ZNK6wibble5mixin10ComparableINS_13RangeIteratorINS_5RangeIiEEEEEeqERKS5_
-FN:19,_ZNK6wibble5mixin10ComparableINS_13RangeIteratorINS_5RangeIiEEEEEneERKS5_
-DA:13,104
-DA:15,76
-DA:16,76
-DA:19,20
-DA:20,20
-DA:23,36
-DA:24,36
-BA:24,2
-BA:24,2
-BA:24,2
-BA:24,2
-LF:7
-LH:7
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/operators.h
-FN:29,_ZN6wibble9operatorsplISt23_Rb_tree_const_iteratorIiEEET_RKS4_NS4_15difference_typeE
-DA:29,7
-DA:30,7
-DA:31,7
-LF:3
-LH:3
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/range.h
-FN:87,_ZN6wibble10RangeMixinIiNS_5RangeIiEEED2Ev
-FN:63,_ZN6wibble10RangeMixinIiNS_13IteratorRangeISt14_List_iteratorIiEEEEC2Ev
-FN:197,_ZN6wibble13IteratorRangeISt14_List_iteratorIiEEC1ES2_S2_
-FN:87,_ZN6wibble10RangeMixinIiNS_13IteratorRangeISt14_List_iteratorIiEEEED2Ev
-FN:193,_ZN6wibble13IteratorRangeISt14_List_iteratorIiEED1Ev
-FN:63,_ZN6wibble10RangeMixinIiNS_5RangeIiEEEC2Ev
-FN:156,_ZN6wibble5RangeIiED1Ev
-FN:27,_ZN6wibble13RangeIteratorINS_5RangeIiEEED1Ev
-FN:156,_ZN6wibble5RangeIiEC1ERKS1_
-FN:27,_ZN6wibble13RangeIteratorINS_5RangeIiEEEC1ERKS3_
-FN:66,_ZNK6wibble10RangeMixinIiNS_5RangeIiEEE4selfEv
-FN:37,_ZN6wibble13RangeIteratorINS_5RangeIiEEEC1ERKS2_
-FN:71,_ZNK6wibble10RangeMixinIiNS_5RangeIiEEE5beginEv
-FN:166,_ZN6wibble5RangeIiE10setToEmptyEv
-FN:94,_ZN6wibble14RangeInterfaceIiEC2Ev
-FN:105,_ZN6wibble10RangeMorphIiNS_13IteratorRangeISt14_List_iteratorIiEEEEC1ERKS4_
-FN:165,_ZN6wibble5RangeIiE11removeFirstEv
-FN:51,_ZN6wibble13RangeIteratorINS_5RangeIiEEEppEv
-FN:164,_ZNK6wibble5RangeIiE4headEv
-FN:49,_ZNK6wibble13RangeIteratorINS_5RangeIiEEEdeEv
-FN:53,_ZNK6wibble13RangeIteratorINS_5RangeIiEEEleERKS3_
-FN:94,_ZN6wibble14RangeInterfaceIiEC2ERKS1_
-FN:103,_ZN6wibble10RangeMorphIiNS_13IteratorRangeISt14_List_iteratorIiEEEEC1ERKS5_
-FN:207,_ZN6wibble13IteratorRangeISt14_List_iteratorIiEE10setToEmptyEv
-FN:106,_ZN6wibble10RangeMorphIiNS_13IteratorRangeISt14_List_iteratorIiEEEE10setToEmptyEv
-FN:200,_ZNK6wibble13IteratorRangeISt14_List_iteratorIiEE4headEv
-FN:108,_ZNK6wibble10RangeMorphIiNS_13IteratorRangeISt14_List_iteratorIiEEEE4headEv
-FN:201,_ZN6wibble13IteratorRangeISt14_List_iteratorIiEE11removeFirstEv
-FN:107,_ZN6wibble10RangeMorphIiNS_13IteratorRangeISt14_List_iteratorIiEEEE11removeFirstEv
-FN:203,_ZNK6wibble13IteratorRangeISt14_List_iteratorIiEEleERKS3_
-FN:76,_ZNK6wibble10RangeMixinIiNS_5RangeIiEEE4tailEv
-FN:72,_ZNK6wibble10RangeMixinIiNS_5RangeIiEEE3endEv
-FN:83,_ZNK6wibble10RangeMixinIiNS_5RangeIiEEE5emptyEv
-FN:156,_ZN6wibble5RangeIiEaSERKS1_
-FN:98,_ZN6wibble14RangeInterfaceIiED2Ev
-FN:98,_ZN6wibble14RangeInterfaceIiED0Ev
-FN:98,_ZN6wibble14RangeInterfaceIiED1Ev
-FN:103,_ZN6wibble10RangeMorphIiNS_13IteratorRangeISt14_List_iteratorIiEEEED1Ev
-FN:160,_ZN6wibble5RangeIiEC1INS_13IteratorRangeISt14_List_iteratorIiEEEEERKT_NS_6IsTypeIiNS7_19RangeImplementationEE1TE
-FN:265,_ZN6wibble5rangeISt14_List_iteratorIiEEENS_5RangeINT_10value_typeEEES4_S4_
-DA:27,207
-DA:37,50
-DA:49,23
-DA:51,34
-DA:53,56
-DA:54,56
-DA:63,27
-DA:66,58
-DA:71,27
-DA:72,23
-DA:76,8
-DA:83,11
-DA:84,11
-DA:87,312
-DA:94,249
-DA:98,231
-DA:103,182
-DA:105,6
-DA:106,9
-DA:107,16
-DA:108,15
-DA:156,426
-DA:160,6
-DA:161,6
-DA:164,44
-DA:165,53
-DA:166,26
-DA:193,99
-DA:197,6
-DA:198,6
-DA:200,15
-DA:201,16
-DA:203,27
-DA:204,27
-DA:207,9
-DA:208,9
-DA:209,9
-DA:265,6
-DA:266,6
-BA:98,1
-BA:98,2
-BA:98,0
-BA:98,0
-BA:98,0
-BA:98,0
-BA:103,2
-BA:103,1
-BA:103,1
-BA:103,2
-BA:204,2
-BA:204,2
-BA:204,2
-BA:204,1
-LF:39
-LH:39
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:17,_ZN8LocationC1EPKciSs
-FN:13,_ZN8LocationC1ERKS_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:41,_ZN12AssertFailedD1Ev
-FN:13,_ZN8LocationD1Ev
-FN:59,_Z9assert_fnIbEv8LocationT_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:59,0
-DA:61,0
-DA:62,0
-DA:64,0
-BA:42,0
-BA:42,0
-BA:61,0
-BA:61,0
-LF:18
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/consumer.test.h
-FN:33,_ZN12_GLOBAL__N_112TestConsumer17stlVectorConsumerEv
-FN:25,_ZN12_GLOBAL__N_112TestConsumer14stlSetConsumerEv
-FN:13,_ZN12_GLOBAL__N_112TestConsumer19stlInserterConsumerEv
-DA:13,1
-DA:14,1
-DA:15,1
-DA:16,1
-DA:17,1
-DA:18,1
-DA:19,1
-DA:20,2
-DA:21,1
-DA:22,1
-DA:23,1
-DA:25,1
-DA:26,1
-DA:27,1
-DA:28,1
-DA:29,1
-DA:30,2
-DA:31,1
-DA:33,1
-DA:34,1
-DA:35,1
-DA:36,1
-DA:37,1
-DA:38,1
-DA:39,2
-DA:40,2
-DA:41,1
-LF:27
-LH:27
-end_of_record
-SF:/srv/build/pkg/ept-work/default/wibble/wibble-test-generated-_home_mornfall_dev_pkg_ept-work_wibble_consumer.cpp
-FN:5,_Z41__static_initialization_and_destruction_0ii
-FN:5,_GLOBAL__I__Z32run_Consumer_stlInserterConsumerv
-FN:5,_ZN6wibble9MorphBaseINS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEENS_17ConsumerInterfaceIiEEED0Ev
-FN:5,_ZN6wibble9MorphBaseINS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEENS_17ConsumerInterfaceIiEEED1Ev
-FN:5,_ZN6wibble13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt6vectorIiSaIiEEEEEED0Ev
-FN:5,_ZN6wibble9MorphBaseINS_20ConsumerFromIteratorIiSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEENS_17ConsumerInterfaceIiEEED0Ev
-FN:5,_ZN6wibble9MorphBaseINS_20ConsumerFromIteratorIiSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEENS_17ConsumerInterfaceIiEEED1Ev
-FN:5,_ZN6wibble13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEEED0Ev
-FN:5,_ZN6wibble9MorphBaseINS_13IteratorRangeISt14_List_iteratorIiEEENS_14RangeInterfaceIiEEED0Ev
-FN:5,_ZN6wibble9MorphBaseINS_13IteratorRangeISt14_List_iteratorIiEEENS_14RangeInterfaceIiEEED1Ev
-FN:5,_ZN6wibble10RangeMorphIiNS_13IteratorRangeISt14_List_iteratorIiEEEED0Ev
-FN:5,_ZN6wibble9MorphBaseINS_20ConsumerFromIteratorIiSt20back_insert_iteratorISt4listIiSaIiEEEEENS_17ConsumerInterfaceIiEEED0Ev
-FN:5,_ZN6wibble9MorphBaseINS_20ConsumerFromIteratorIiSt20back_insert_iteratorISt4listIiSaIiEEEEENS_17ConsumerInterfaceIiEEED1Ev
-FN:5,_ZN6wibble13ConsumerMorphIiNS_20ConsumerFromIteratorIiSt20back_insert_iteratorISt4listIiSaIiEEEEEED0Ev
-FN:5,_Z30run_Consumer_stlVectorConsumerv
-FN:4,_Z27run_Consumer_stlSetConsumerv
-FN:3,_Z32run_Consumer_stlInserterConsumerv
-DA:3,1
-DA:4,1
-DA:5,121
-BA:5,2
-BA:5,1
-BA:5,2
-BA:5,1
-LF:3
-LH:3
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaISt10_List_nodeIiEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeIiEED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaIiED2Ev
-FN:106,_ZNSaIiED1Ev
-FN:98,_ZNSaISt10_List_nodeIiEEC2Ev
-FN:98,_ZNSaIiEC2Ev
-FN:104,_ZNSaIiEC1ISt10_List_nodeIiEEERKSaIT_E
-FN:98,_ZNSaISt13_Rb_tree_nodeIiEEC2Ev
-FN:104,_ZNSaIiEC1ISt13_Rb_tree_nodeIiEEERKSaIT_E
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,24
-DA:100,0
-DA:101,0
-DA:104,98
-DA:106,126
-DA:118,0
-DA:119,0
-LF:7
-LH:3
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-LF:51
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/list.tcc
-FN:70,_ZNSt10_List_baseIiSaIiEE8_M_clearEv
-DA:70,8
-DA:73,8
-DA:74,33
-DA:76,17
-DA:77,17
-DA:78,17
-DA:79,17
-DA:81,8
-BA:74,2
-BA:74,2
-LF:8
-LH:8
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN6wibble13RangeIteratorINS0_5RangeIiEEEELb0EE3__bES4_
-FN:268,_ZNSt12__niter_baseIN6wibble13RangeIteratorINS0_5RangeIiEEEELb0EE3__bES4_
-FN:268,_ZNSt12__niter_baseIN6wibble8ConsumerIiEELb0EE3__bES2_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:309,_ZNSt11__copy_moveILb0ELb0ESt20forward_iterator_tagE8__copy_mIN6wibble13RangeIteratorINS3_5RangeIiEEEENS3_8ConsumerIiEEEET0_T_SB_SA_
-FN:286,_ZNSt12__miter_baseIPiLb0EE3__bES0_
-FN:268,_ZNSt12__niter_baseIPiLb0EE3__bES0_
-FN:385,_ZSt13__copy_move_aILb0EN6wibble13RangeIteratorINS0_5RangeIiEEEENS0_8ConsumerIiEEET1_T0_S8_S7_
-FN:430,_ZSt14__copy_move_a2ILb0EN6wibble13RangeIteratorINS0_5RangeIiEEEENS0_8ConsumerIiEEET1_T0_S8_S7_
-FN:456,_ZSt4copyIN6wibble13RangeIteratorINS0_5RangeIiEEEENS0_8ConsumerIiEEET0_T_S8_S7_
-FN:569,_ZNSt20__copy_move_backwardILb0ELb1ESt26random_access_iterator_tagE13__copy_move_bIiEEPT_PKS3_S6_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0EPiS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPiS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardIPiS0_ET0_T_S2_S1_
-FN:375,_ZNSt11__copy_moveILb0ELb1ESt26random_access_iterator_tagE8__copy_mIiEEPT_PKS3_S6_S4_
-FN:385,_ZSt13__copy_move_aILb0EPiS0_ET1_T0_S2_S1_
-FN:430,_ZSt14__copy_move_a2ILb0EPiS0_ET1_T0_S2_S1_
-FN:456,_ZSt4copyIPiS0_ET0_T_S2_S1_
-DA:210,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:268,14
-DA:269,14
-DA:286,10
-DA:287,10
-DA:309,4
-DA:311,13
-DA:312,9
-DA:313,4
-DA:375,0
-DA:377,0
-DA:379,0
-DA:385,4
-DA:393,4
-DA:396,4
-DA:430,4
-DA:435,4
-DA:456,4
-DA:466,4
-DA:569,0
-DA:571,0
-DA:572,0
-DA:573,0
-DA:579,0
-DA:587,0
-DA:592,0
-DA:597,0
-DA:602,0
-DA:624,0
-DA:636,0
-BA:215,0
-BA:215,0
-BA:311,2
-BA:311,2
-LF:33
-LH:15
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:97,_ZSt8_DestroyIPiEvT_S1_
-FN:126,_ZSt8_DestroyIPiiEvT_S1_RSaIT0_E
-DA:97,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-LF:5
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_function.h
-FN:469,_ZNKSt9_IdentityIiEclERKi
-FN:229,_ZNKSt4lessIiEclERKiS2_
-DA:229,80
-DA:230,80
-DA:469,104
-DA:470,104
-LF:4
-LH:4
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEdeEv
-FN:398,_ZNSt20back_insert_iteratorISt4listIiSaIiEEEC1ERS2_
-FN:456,_ZSt13back_inserterISt4listIiSaIiEEESt20back_insert_iteratorIT_ERS4_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEC1ERKS1_
-FN:735,_ZNK9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEplERKi
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPiSt6vectorIiSaIiEEEEbRKNS_17__normal_iteratorIT_T0_EESA_
-FN:572,_ZNSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEC1ERS4_St23_Rb_tree_const_iteratorIiE
-FN:645,_ZSt8inserterISt3setIiSt4lessIiESaIiEESt23_Rb_tree_const_iteratorIiEESt15insert_iteratorIT_ERS8_T0_
-FN:572,_ZNSt15insert_iteratorISt6vectorIiSaIiEEEC1ERS2_N9__gnu_cxx17__normal_iteratorIPiS2_EE
-FN:645,_ZSt8inserterISt6vectorIiSaIiEEN9__gnu_cxx17__normal_iteratorIPiS2_EEESt15insert_iteratorIT_ERS8_T0_
-FN:618,_ZNSt15insert_iteratorISt6vectorIiSaIiEEEdeEv
-FN:623,_ZNSt15insert_iteratorISt6vectorIiSaIiEEEppEv
-FN:618,_ZNSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEdeEv
-FN:623,_ZNSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEppEv
-FN:429,_ZNSt20back_insert_iteratorISt4listIiSaIiEEEdeEv
-FN:434,_ZNSt20back_insert_iteratorISt4listIiSaIiEEEppEv
-FN:703,_ZN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEppEv
-FN:846,_ZN9__gnu_cxxmiIPiSt6vectorIiSaIiEEEENS_17__normal_iteratorIT_T0_E15difference_typeERKS8_SB_
-FN:599,_ZNSt15insert_iteratorISt6vectorIiSaIiEEEaSERKi
-FN:599,_ZNSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEaSERKi
-FN:412,_ZNSt20back_insert_iteratorISt4listIiSaIiEEEaSERKi
-DA:398,2
-DA:412,4
-DA:414,4
-DA:415,4
-DA:429,8
-DA:430,8
-DA:434,4
-DA:435,4
-DA:456,2
-DA:457,2
-DA:572,10
-DA:573,10
-DA:599,17
-DA:601,17
-DA:602,17
-DA:603,17
-DA:618,41
-DA:619,41
-DA:623,17
-DA:624,17
-DA:645,10
-DA:648,10
-DA:683,0
-DA:695,0
-DA:696,0
-DA:703,0
-DA:705,0
-DA:706,0
-DA:735,0
-DA:736,0
-DA:747,0
-DA:748,0
-DA:769,0
-DA:770,0
-DA:846,0
-DA:847,0
-LF:36
-LH:22
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-FN:135,_ZSt9__advanceISt23_Rb_tree_const_iteratorIiEiEvRT_T0_St26bidirectional_iterator_tag
-FN:173,_ZSt7advanceISt23_Rb_tree_const_iteratorIiEiEvRT_T0_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-DA:135,7
-DA:140,7
-DA:141,21
-DA:142,7
-DA:144,0
-DA:145,0
-DA:146,7
-DA:173,7
-DA:176,7
-DA:177,7
-DA:178,7
-BA:140,2
-BA:140,1
-BA:141,2
-BA:141,2
-BA:144,0
-BA:144,0
-LF:15
-LH:9
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:166,_ZSt19__iterator_categoryISt23_Rb_tree_const_iteratorIiEENSt15iterator_traitsIT_E17iterator_categoryERKS3_
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,0
-DA:166,7
-DA:167,7
-LF:3
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_list.h
-FN:126,_ZNSt14_List_iteratorIiEC1EPSt15_List_node_base
-FN:666,_ZNSt4listIiSaIiEE3endEv
-FN:648,_ZNSt4listIiSaIiEE5beginEv
-FN:211,_ZNKSt20_List_const_iteratorIiEdeEv
-FN:253,_ZNKSt20_List_const_iteratorIiEneERKS0_
-FN:219,_ZNSt20_List_const_iteratorIiEppEv
-FN:249,_ZNKSt20_List_const_iteratorIiEeqERKS0_
-FN:364,_ZNSt10_List_baseIiSaIiEE7_M_initEv
-FN:298,_ZNSt10_List_baseIiSaIiEE10_List_implD1Ev
-FN:202,_ZNSt20_List_const_iteratorIiEC1EPKSt15_List_node_base
-FN:675,_ZNKSt4listIiSaIiEE3endEv
-FN:657,_ZNKSt4listIiSaIiEE5beginEv
-FN:1386,_ZSteqIiSaIiEEbRKSt4listIT_T0_ES6_
-FN:1422,_ZStneIiSaIiEEbRKSt4listIT_T0_ES6_
-FN:328,_ZNKSt10_List_baseIiSaIiEE21_M_get_Node_allocatorEv
-FN:301,_ZNSt10_List_baseIiSaIiEE10_List_implC1Ev
-FN:339,_ZNSt10_List_baseIiSaIiEEC2Ev
-FN:498,_ZNSt4listIiSaIiEEC1Ev
-FN:332,_ZNKSt10_List_baseIiSaIiEE19_M_get_Tp_allocatorEv
-FN:131,_ZNKSt14_List_iteratorIiEdeEv
-FN:139,_ZNSt14_List_iteratorIiEppEv
-FN:169,_ZNKSt14_List_iteratorIiEeqERKS0_
-FN:317,_ZNSt10_List_baseIiSaIiEE11_M_put_nodeEPSt10_List_nodeIiE
-FN:357,_ZNSt10_List_baseIiSaIiEED2Ev
-FN:417,_ZNSt4listIiSaIiEED1Ev
-FN:313,_ZNSt10_List_baseIiSaIiEE11_M_get_nodeEv
-FN:458,_ZNSt4listIiSaIiEE14_M_create_nodeERKi
-FN:1339,_ZNSt4listIiSaIiEE9_M_insertESt14_List_iteratorIiERKi
-FN:875,_ZNSt4listIiSaIiEE9push_backERKi
-DA:126,29
-DA:127,29
-DA:131,15
-DA:132,15
-DA:139,16
-DA:141,16
-DA:142,16
-DA:169,41
-DA:170,41
-DA:202,16
-DA:203,16
-DA:211,8
-DA:212,8
-DA:219,8
-DA:221,8
-DA:222,8
-DA:249,6
-DA:250,6
-DA:253,14
-DA:254,14
-DA:298,8
-DA:301,8
-DA:302,8
-DA:303,8
-DA:313,17
-DA:314,17
-DA:317,17
-DA:318,17
-DA:328,34
-DA:329,34
-DA:332,34
-DA:333,34
-DA:339,8
-DA:340,8
-DA:341,8
-DA:357,8
-DA:358,8
-DA:364,8
-DA:366,8
-DA:367,8
-DA:368,8
-DA:417,8
-DA:458,17
-DA:460,17
-DA:463,17
-DA:465,0
-DA:467,0
-DA:468,0
-DA:470,17
-DA:498,8
-DA:499,8
-DA:648,6
-DA:649,6
-DA:657,8
-DA:658,8
-DA:666,23
-DA:667,23
-DA:675,8
-DA:676,8
-DA:875,17
-DA:876,17
-DA:1339,17
-DA:1341,17
-DA:1342,17
-DA:1343,17
-DA:1386,4
-DA:1389,4
-DA:1390,4
-DA:1392,4
-DA:1393,4
-DA:1394,12
-DA:1396,4
-DA:1397,4
-DA:1399,4
-DA:1422,2
-DA:1423,2
-BA:1394,2
-BA:1394,2
-BA:1394,2
-BA:1394,2
-BA:1394,2
-BA:1394,1
-BA:1394,2
-BA:1394,2
-BA:1399,2
-BA:1399,2
-BA:1399,2
-BA:1399,1
-LF:76
-LH:73
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_pair.h
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIiEbEC1ERKS1_RKb
-DA:88,21
-DA:89,21
-LF:2
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_set.h
-FN:270,_ZNKSt3setIiSt4lessIiESaIiEE3endEv
-FN:261,_ZNKSt3setIiSt4lessIiESaIiEE5beginEv
-FN:141,_ZNSt3setIiSt4lessIiESaIiEEC1Ev
-FN:93,_ZNSt3setIiSt4lessIiESaIiEED1Ev
-FN:405,_ZNSt3setIiSt4lessIiESaIiEE6insertESt23_Rb_tree_const_iteratorIiERKi
-DA:93,20
-DA:141,16
-DA:142,16
-DA:261,32
-DA:262,32
-DA:270,86
-DA:271,86
-DA:405,10
-DA:406,10
-LF:9
-LH:9
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_tree.h
-FN:247,_ZNKSt23_Rb_tree_const_iteratorIiEdeEv
-FN:285,_ZNKSt23_Rb_tree_const_iteratorIiEeqERKS0_
-FN:452,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_M_beginEv
-FN:398,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_Rb_tree_implIS3_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE7_S_leftEPSt18_Rb_tree_node_base
-FN:240,_ZNSt23_Rb_tree_const_iteratorIiEC1EPKSt13_Rb_tree_nodeIiE
-FN:614,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE3endEv
-FN:603,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5beginEv
-FN:415,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_Rb_tree_implIS3_Lb0EE13_M_initializeEv
-FN:403,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_Rb_tree_implIS3_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEEC1Ev
-FN:347,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE21_M_get_Node_allocatorEv
-FN:351,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13get_allocatorEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorIiEC1ERKSt17_Rb_tree_iteratorIiE
-FN:463,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE6_M_endEv
-FN:444,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE12_M_rightmostEv
-FN:641,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE4sizeEv
-FN:436,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE11_M_leftmostEv
-FN:491,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_S_rightEPKSt18_Rb_tree_node_base
-FN:168,_ZNSt17_Rb_tree_iteratorIiEC1EPSt13_Rb_tree_nodeIiE
-FN:495,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE6_S_keyEPKSt18_Rb_tree_node_base
-FN:596,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorIiEeqERKS0_
-FN:471,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_S_valueEPKSt13_Rb_tree_nodeIiE
-FN:475,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE6_S_keyEPKSt13_Rb_tree_nodeIiE
-FN:360,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE11_M_put_nodeEPSt13_Rb_tree_nodeIiE
-FN:388,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE15_M_destroy_nodeEPSt13_Rb_tree_nodeIiE
-FN:936,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_M_eraseEPSt13_Rb_tree_nodeIiE
-FN:584,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEED1Ev
-FN:356,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE14_M_create_nodeERKi
-FN:270,_ZNSt23_Rb_tree_const_iteratorIiEmmEv
-FN:846,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE10_M_insert_EPKSt18_Rb_tree_node_baseS8_RKi
-FN:195,_ZNSt17_Rb_tree_iteratorIiEmmEv
-FN:1133,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE16_M_insert_uniqueERKi
-FN:255,_ZNSt23_Rb_tree_const_iteratorIiEppEv
-FN:1178,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE17_M_insert_unique_ESt23_Rb_tree_const_iteratorIiERKi
-DA:168,129
-DA:169,129
-DA:195,0
-DA:197,0
-DA:198,0
-DA:210,46
-DA:211,46
-DA:240,124
-DA:241,124
-DA:243,50
-DA:244,50
-DA:247,66
-DA:248,66
-DA:255,50
-DA:257,50
-DA:258,50
-DA:270,0
-DA:272,0
-DA:273,0
-DA:285,16
-DA:286,16
-DA:347,68
-DA:348,68
-DA:351,64
-DA:352,64
-DA:356,32
-DA:357,32
-DA:360,32
-DA:361,32
-DA:364,32
-DA:366,32
-DA:368,32
-DA:369,0
-DA:371,0
-DA:372,0
-DA:374,32
-DA:388,32
-DA:390,32
-DA:391,32
-DA:392,32
-DA:398,20
-DA:403,16
-DA:405,16
-DA:406,16
-DA:415,20
-DA:417,20
-DA:418,20
-DA:419,20
-DA:420,20
-DA:421,20
-DA:436,22
-DA:437,22
-DA:444,20
-DA:445,20
-DA:452,77
-DA:453,77
-DA:463,105
-DA:464,105
-DA:471,45
-DA:472,45
-DA:475,45
-DA:476,45
-DA:479,58
-DA:480,58
-DA:487,45
-DA:488,45
-DA:491,1
-DA:492,1
-DA:495,35
-DA:496,35
-DA:499,35
-DA:500,35
-DA:562,16
-DA:584,20
-DA:585,20
-DA:596,19
-DA:599,19
-DA:603,36
-DA:606,36
-DA:614,88
-DA:617,88
-DA:641,30
-DA:642,30
-DA:846,24
-DA:850,24
-DA:852,24
-DA:854,24
-DA:857,24
-DA:858,24
-DA:936,58
-DA:939,145
-DA:941,29
-DA:942,29
-DA:943,29
-DA:944,29
-DA:946,58
-DA:1133,21
-DA:1135,21
-DA:1136,21
-DA:1137,21
-DA:1138,50
-DA:1140,8
-DA:1141,8
-DA:1142,8
-DA:1144,21
-DA:1145,21
-DA:1147,17
-DA:1148,17
-DA:1150,0
-DA:1152,4
-DA:1153,3
-DA:1154,1
-DA:1178,10
-DA:1181,10
-DA:1183,7
-DA:1186,1
-DA:1188,6
-DA:1190,3
-DA:1194,2
-DA:1195,2
-DA:1196,2
-DA:1197,0
-DA:1200,0
-DA:1201,0
-DA:1204,0
-DA:1207,0
-DA:1209,1
-DA:1213,1
-DA:1214,1
-DA:1215,1
-DA:1216,0
-DA:1219,0
-DA:1220,0
-DA:1222,0
-DA:1225,0
-DA:1230,0
-BA:850,2
-BA:850,2
-BA:850,2
-BA:850,2
-BA:850,2
-BA:850,2
-BA:939,2
-BA:939,2
-BA:1138,2
-BA:1138,2
-BA:1142,2
-BA:1142,2
-BA:1145,2
-BA:1145,2
-BA:1147,2
-BA:1147,1
-BA:1152,2
-BA:1152,2
-BA:1181,2
-BA:1181,2
-BA:1183,2
-BA:1183,2
-BA:1183,2
-BA:1183,1
-BA:1183,2
-BA:1183,2
-BA:1190,2
-BA:1190,2
-BA:1195,2
-BA:1195,1
-BA:1197,0
-BA:1197,0
-BA:1200,0
-BA:1200,0
-BA:1209,2
-BA:1209,1
-BA:1214,2
-BA:1214,1
-BA:1216,0
-BA:1216,0
-BA:1219,0
-BA:1219,0
-LF:136
-LH:115
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:97,_ZNSt20__uninitialized_copyILb1EE18uninitialized_copyIPiS2_EET0_T_S4_S3_
-FN:113,_ZSt18uninitialized_copyIPiS0_ET0_T_S2_S1_
-FN:261,_ZSt22__uninitialized_copy_aIPiS0_iET0_T_S2_S1_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPiS0_SaIiEET0_T_S3_S2_RT1_
-DA:97,0
-DA:98,0
-DA:113,0
-DA:122,0
-DA:261,0
-DA:262,0
-DA:268,0
-DA:272,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:97,_ZNSt12_Vector_baseIiSaIiEE19_M_get_Tp_allocatorEv
-FN:395,_ZNSt6vectorIiSaIiEE3endEv
-FN:377,_ZNSt6vectorIiSaIiEE5beginEv
-FN:79,_ZNSt12_Vector_baseIiSaIiEE12_Vector_implD1Ev
-FN:84,_ZNSt12_Vector_baseIiSaIiEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseIiSaIiEEC2Ev
-FN:213,_ZNSt6vectorIiSaIiEEC1Ev
-FN:484,_ZNKSt6vectorIiSaIiEE4sizeEv
-FN:101,_ZNKSt12_Vector_baseIiSaIiEE19_M_get_Tp_allocatorEv
-FN:489,_ZNKSt6vectorIiSaIiEE8max_sizeEv
-FN:147,_ZNSt12_Vector_baseIiSaIiEE13_M_deallocateEPij
-FN:135,_ZNSt12_Vector_baseIiSaIiEED2Ev
-FN:299,_ZNSt6vectorIiSaIiEED1Ev
-FN:1075,_ZNKSt6vectorIiSaIiEE12_M_check_lenEjPKc
-FN:143,_ZNSt12_Vector_baseIiSaIiEE11_M_allocateEj
-DA:79,0
-DA:84,0
-DA:85,0
-DA:86,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:108,0
-DA:109,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:143,0
-DA:144,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:213,0
-DA:214,0
-DA:299,0
-DA:300,0
-DA:301,0
-DA:377,0
-DA:378,0
-DA:395,0
-DA:396,0
-DA:484,0
-DA:485,0
-DA:489,0
-DA:490,0
-DA:1075,0
-DA:1077,0
-DA:1078,0
-DA:1080,0
-DA:1081,0
-BA:144,0
-BA:144,0
-BA:149,0
-BA:149,0
-BA:1077,0
-BA:1077,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-LF:37
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/vector.tcc
-FN:283,_ZNSt6vectorIiSaIiEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPiS1_EERKi
-FN:94,_ZNSt6vectorIiSaIiEE6insertEN9__gnu_cxx17__normal_iteratorIPiS1_EERKi
-DA:94,17
-DA:96,17
-DA:97,17
-DA:100,0
-DA:101,0
-DA:113,17
-DA:115,17
-DA:283,0
-DA:286,0
-DA:288,0
-DA:291,0
-DA:293,0
-DA:295,0
-DA:299,0
-DA:307,0
-DA:308,0
-DA:309,0
-DA:316,0
-DA:321,0
-DA:323,0
-DA:324,0
-DA:330,0
-DA:332,0
-DA:333,0
-DA:334,0
-DA:336,0
-DA:338,0
-DA:341,0
-DA:342,0
-DA:343,0
-DA:345,0
-BA:97,1
-BA:97,2
-BA:97,0
-BA:97,0
-BA:97,1
-BA:97,2
-BA:286,0
-BA:286,0
-LF:31
-LH:5
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt10_List_nodeIiEED2Ev
-FN:118,_ZN9__gnu_cxx13new_allocatorIiE7destroyEPi
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorIiED2Ev
-FN:107,_ZN9__gnu_cxx13new_allocatorIiE9constructEPiRKi
-FN:69,_ZN9__gnu_cxx13new_allocatorISt10_List_nodeIiEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorIiEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt10_List_nodeIiEE8max_sizeEv
-FN:101,_ZNK9__gnu_cxx13new_allocatorIiE8max_sizeEv
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEE8max_sizeEv
-FN:97,_ZN9__gnu_cxx13new_allocatorIiE10deallocateEPij
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEE10deallocateEPS2_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISt10_List_nodeIiEE10deallocateEPS2_j
-FN:87,_ZN9__gnu_cxx13new_allocatorIiE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorISt10_List_nodeIiEE8allocateEjPKv
-DA:69,24
-DA:71,0
-DA:76,28
-DA:87,49
-DA:89,49
-DA:90,0
-DA:92,49
-DA:97,49
-DA:98,49
-DA:101,49
-DA:102,49
-DA:107,0
-DA:108,0
-DA:118,49
-BA:89,0
-BA:89,0
-BA:89,1
-BA:89,2
-BA:89,1
-BA:89,2
-BA:108,0
-BA:108,0
-LF:14
-LH:10
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-DA:105,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-DA:95,0
-DA:112,0
-DA:117,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/typeinfo
-FN:122,_ZNKSt9type_info6beforeERKS_
-DA:122,0
-DA:123,0
-LF:2
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:13,_ZN8LocationC1ERKS_
-FN:17,_ZN8LocationC1EPKciSs
-FN:52,_ZlsIiER12AssertFailedS1_T_
-FN:52,_ZlsISsER12AssertFailedS1_T_
-FN:52,_ZlsIcER12AssertFailedS1_T_
-FN:52,_ZlsIPKcER12AssertFailedS3_T_
-FN:52,_ZlsIjER12AssertFailedS1_T_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:41,_ZN12AssertFailedD1Ev
-FN:13,_ZN8LocationD1Ev
-FN:59,_Z9assert_fnIbEv8LocationT_
-FN:67,_Z12assert_eq_fnIccEv8LocationT_T0_
-FN:67,_Z12assert_eq_fnIiiEv8LocationT_T0_
-FN:67,_Z12assert_eq_fnIjjEv8LocationT_T0_
-FN:67,_Z12assert_eq_fnIPKcS1_Ev8LocationT_T0_
-FN:67,_Z12assert_eq_fnISsPKcEv8LocationT_T0_
-FN:67,_Z12assert_eq_fnISsSsEv8LocationT_T0_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:59,0
-DA:61,0
-DA:62,0
-DA:64,0
-DA:67,3
-DA:69,3
-DA:70,0
-DA:71,0
-DA:75,3
-BA:42,0
-BA:42,0
-BA:61,0
-BA:61,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,1
-BA:69,2
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-LF:26
-LH:3
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/sys/mmap.test.h
-FN:29,_ZN8TestMMap6simpleEv
-DA:29,1
-DA:30,1
-DA:31,1
-DA:32,1
-DA:33,2
-DA:34,2
-DA:36,2
-DA:37,2
-DA:38,1
-DA:39,2
-DA:40,2
-DA:41,2
-DA:42,2
-DA:43,2
-DA:45,1
-DA:46,1
-DA:47,1
-DA:48,2
-DA:49,2
-DA:51,2
-DA:52,1
-DA:53,2
-DA:54,2
-DA:55,2
-DA:56,2
-DA:57,2
-DA:59,1
-DA:60,1
-DA:61,1
-DA:62,2
-DA:63,2
-DA:64,1
-LF:32
-LH:32
-end_of_record
-SF:/srv/build/pkg/ept-work/default/wibble/wibble-test-generated-_home_mornfall_dev_pkg_ept-work_wibble_sys_mmap.cpp
-FN:3,_Z41__static_initialization_and_destruction_0ii
-FN:3,_GLOBAL__I__Z15run_MMap_simplev
-FN:3,_Z15run_MMap_simplev
-DA:3,4
-BA:3,2
-BA:3,1
-BA:3,2
-BA:3,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaIcED1Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:2188,_ZSteqIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_EPKS3_
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-FN:2162,_ZSteqIcEN9__gnu_cxx11__enable_ifIXsrSt9__is_charIT_E7__valueEbE6__typeERKSbIS3_St11char_traitsIS3_ESaIS3_EESC_
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2162,0
-DA:2165,0
-DA:2188,0
-DA:2189,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-LF:55
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-DA:245,0
-DA:246,0
-DA:257,0
-DA:258,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:166,0
-DA:167,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-DA:69,0
-DA:71,0
-DA:76,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:464,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_c
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:195,_ZNSolsEj
-DA:95,0
-DA:112,0
-DA:117,0
-DA:195,0
-DA:199,0
-DA:365,0
-DA:366,0
-DA:464,0
-DA:465,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/list.h
-FN:340,_ZN6wibble4list5countIN8TestList2MyEEEjT_
-FN:340,_ZN6wibble4list5countIN8TestList3My2EEEjT_
-FN:286,_ZNK6wibble4list5EmptyIiE5emptyEv
-FN:298,_ZNK6wibble4list8SingularIiE4headEv
-FN:299,_ZNK6wibble4list8SingularIiE5emptyEv
-FN:311,_ZNK6wibble4list6AppendINS0_8SingularIiEES3_E4headEv
-FN:317,_ZNK6wibble4list6AppendINS0_8SingularIiEES3_E5emptyEv
-FN:169,_ZN6wibble4list8FilteredIN8TestList2MyEPFbiEEC1ES3_S5_
-FN:370,_ZN6wibble4list6filterIN8TestList2MyEPFbiEEENS0_8FilteredIT_T0_EES7_S8_
-FN:61,_ZN6wibble4list6SortedIN8TestList2MyEE9SharedVec6_derefEv
-FN:241,_ZN6wibble4list4TakeIN8TestList2MyEEC1ES3_i
-FN:400,_ZN6wibble4list4takeIN8TestList2MyEEENS0_4TakeIT_EEiS5_
-FN:230,_ZNK6wibble4list4TakeIN8TestList2MyEE5emptyEv
-FN:213,_ZN6wibble4list6UniqueIN8TestList3My2EEC1ES3_
-FN:394,_ZN6wibble4list6uniqueIN8TestList3My2EEENS0_6UniqueIT_EES5_
-FN:193,_ZNK6wibble4list6UniqueIN8TestList3My2EE4seekEv
-FN:183,_ZNK6wibble4list6UniqueIN8TestList3My2EE5emptyEv
-FN:205,_ZNK6wibble4list6UniqueIN8TestList3My2EE4tailEv
-FN:340,_ZN6wibble4list5countINS0_6UniqueIN8TestList3My2EEEEEjT_
-FN:188,_ZNK6wibble4list6UniqueIN8TestList3My2EE4headEv
-FN:47,_ZN6wibble4list12ListIteratorIN8TestList2MyEEC1ES3_
-FN:416,_ZN6wibble4list3endIN8TestList2MyEEENS0_12ListIteratorIT_EES5_
-FN:411,_ZN6wibble4list5beginIN8TestList2MyEEENS0_12ListIteratorIT_EES5_
-FN:270,_ZNK6wibble4list3MapIN8TestList2MyESt25pointer_to_unary_functionIiiEE5emptyEv
-FN:297,_ZN6wibble4list8SingularIiEC1Ei
-FN:330,_ZN6wibble4list8singularIiEENS0_8SingularIT_EERKS3_
-FN:296,_ZN6wibble4list8SingularIiEC1Ev
-FN:300,_ZNK6wibble4list8SingularIiE4tailEv
-FN:310,_ZN6wibble4list6AppendINS0_8SingularIiEES3_EC1ES3_S3_
-FN:335,_ZN6wibble4list6appendINS0_8SingularIiEES3_EENS0_6AppendIT_T0_EERKS5_RKS6_
-FN:310,_ZN6wibble4list6AppendIN8TestList2MyENS2_3My2EEC1ES3_S4_
-FN:335,_ZN6wibble4list6appendIN8TestList2MyENS2_3My2EEENS0_6AppendIT_T0_EERKS6_RKS7_
-FN:317,_ZNK6wibble4list6AppendIN8TestList2MyENS2_3My2EE5emptyEv
-FN:318,_ZNK6wibble4list6AppendIN8TestList2MyENS2_3My2EE4tailEv
-FN:340,_ZN6wibble4list5countINS0_6AppendIN8TestList2MyENS3_3My2EEEEEjT_
-FN:155,_ZNK6wibble4list8FilteredIN8TestList2MyEPFbiEE4seekEv
-FN:150,_ZNK6wibble4list8FilteredIN8TestList2MyEPFbiEE4headEv
-FN:161,_ZNK6wibble4list8FilteredIN8TestList2MyEPFbiEE4tailEv
-FN:145,_ZNK6wibble4list8FilteredIN8TestList2MyEPFbiEE5emptyEv
-FN:340,_ZN6wibble4list5countINS0_8FilteredIN8TestList2MyEPFbiEEEEEjT_
-FN:60,_ZN6wibble4list6SortedIN8TestList2MyEE9SharedVec4_refEv
-FN:68,_ZN6wibble4list6SortedIN8TestList2MyEE9SharedPtrC1ERKS5_
-FN:125,_ZN6wibble4list6SortedIN8TestList2MyEEC1ERKS4_
-FN:83,_ZN6wibble4list6SortedIN8TestList2MyEE9SharedPtrptEv
-FN:74,_ZN6wibble4list6SortedIN8TestList2MyEE9SharedPtraSERKS5_
-FN:128,_ZN6wibble4list6SortedIN8TestList2MyEEaSERKS4_
-FN:82,_ZN6wibble4list6SortedIN8TestList2MyEE9SharedPtrdeEv
-FN:242,_ZN6wibble4list4TakeIN8TestList2MyEEC1Ev
-FN:234,_ZNK6wibble4list4TakeIN8TestList2MyEE4tailEv
-FN:340,_ZN6wibble4list5countINS0_4TakeIN8TestList2MyEEEEEjT_
-FN:250,_ZN6wibble4list3MapIN8TestList2MyESt25pointer_to_unary_functionIiiEE1fEv
-FN:275,_ZN6wibble4list3MapIN8TestList2MyESt25pointer_to_unary_functionIiiEEC1ERKS3_RKS5_
-FN:382,_ZN6wibble4list3mapIN8TestList2MyESt25pointer_to_unary_functionIiiEEENS0_3MapIT_T0_EERKS7_RKS8_
-FN:253,_ZNK6wibble4list3MapIN8TestList2MyESt25pointer_to_unary_functionIiiEE1fEv
-FN:259,_ZNK6wibble4list3MapIN8TestList2MyESt25pointer_to_unary_functionIiiEE4headEv
-FN:274,_ZN6wibble4list3MapIN8TestList2MyESt25pointer_to_unary_functionIiiEEC1Ev
-FN:263,_ZNK6wibble4list3MapIN8TestList2MyESt25pointer_to_unary_functionIiiEE4tailEv
-FN:81,_ZN6wibble4list6SortedIN8TestList2MyEE9SharedPtrcvbEv
-FN:59,_ZN6wibble4list6SortedIN8TestList2MyEE9SharedVecC1Ev
-FN:43,_ZNK6wibble4list12ListIteratorIN8TestList2MyEEneERKS4_
-FN:24,_ZN6wibble4list12ListIteratorIN8TestList2MyEEppEv
-FN:35,_ZN6wibble4list12ListIteratorIN8TestList2MyEEdeEv
-FN:56,_ZN6wibble4list6SortedIN8TestList2MyEE9SharedVecD1Ev
-FN:85,_ZN6wibble4list6SortedIN8TestList2MyEE9SharedPtrD1Ev
-FN:54,_ZN6wibble4list6SortedIN8TestList2MyEED1Ev
-FN:318,_ZNK6wibble4list6AppendINS0_8SingularIiEES3_E4tailEv
-FN:66,_ZN6wibble4list6SortedIN8TestList2MyEE9SharedPtrC1Eb
-FN:135,_ZN6wibble4list6SortedIN8TestList2MyEEC1ES3_
-FN:388,_ZN6wibble4list4sortIN8TestList2MyEEENS0_6SortedIT_EES5_
-FN:99,_ZNK6wibble4list6SortedIN8TestList2MyEE4sortEv
-FN:113,_ZNK6wibble4list6SortedIN8TestList2MyEE4tailEv
-FN:120,_ZNK6wibble4list6SortedIN8TestList2MyEE5emptyEv
-FN:340,_ZN6wibble4list5countINS0_6SortedIN8TestList2MyEEEEEjT_
-FN:108,_ZNK6wibble4list6SortedIN8TestList2MyEE4headEv
-DA:24,3170
-DA:25,3170
-DA:26,3170
-DA:35,3170
-DA:36,3170
-DA:43,3174
-DA:44,3174
-DA:47,8
-DA:48,8
-DA:54,2149
-DA:56,0
-DA:59,3
-DA:60,4295
-DA:61,2152
-DA:66,6
-DA:68,2146
-DA:69,2146
-DA:70,2146
-DA:71,2146
-DA:72,2146
-DA:74,2149
-DA:75,2149
-DA:76,2149
-DA:77,2149
-DA:78,2149
-DA:81,6545
-DA:82,2251
-DA:83,2157
-DA:85,2152
-DA:86,2152
-DA:87,2152
-DA:88,2152
-DA:89,0
-DA:91,2152
-DA:99,6545
-DA:100,6545
-DA:101,6542
-DA:102,3
-DA:103,3
-DA:105,3
-DA:108,2248
-DA:109,2248
-DA:110,2248
-DA:113,2146
-DA:114,2146
-DA:115,2146
-DA:116,2146
-DA:120,2151
-DA:121,2151
-DA:122,2151
-DA:125,2146
-DA:126,2146
-DA:128,2146
-DA:129,2146
-DA:130,2146
-DA:131,2146
-DA:132,2146
-DA:135,3
-DA:145,1026
-DA:146,1026
-DA:147,1026
-DA:150,512
-DA:151,512
-DA:152,512
-DA:155,2562
-DA:157,6146
-DA:158,1022
-DA:159,2562
-DA:161,1024
-DA:163,1024
-DA:164,1024
-DA:165,1024
-DA:169,2
-DA:170,2
-DA:172,2
-DA:183,21
-DA:184,21
-DA:185,21
-DA:188,2
-DA:189,2
-DA:190,2
-DA:193,113
-DA:195,113
-DA:196,1
-DA:197,112
-DA:198,2
-DA:199,110
-DA:200,69
-DA:201,69
-DA:205,21
-DA:207,21
-DA:208,21
-DA:209,21
-DA:213,3
-DA:214,3
-DA:216,3
-DA:230,51
-DA:231,51
-DA:234,50
-DA:235,50
-DA:236,50
-DA:237,50
-DA:241,1
-DA:242,50
-DA:250,513
-DA:251,513
-DA:253,1024
-DA:254,1024
-DA:259,512
-DA:260,512
-DA:263,512
-DA:264,512
-DA:265,512
-DA:266,512
-DA:270,513
-DA:271,513
-DA:274,512
-DA:275,1
-DA:276,1
-DA:278,1
-DA:279,1
-DA:286,2
-DA:296,10
-DA:297,11
-DA:298,6
-DA:299,28
-DA:300,10
-DA:310,5
-DA:311,4
-DA:312,4
-DA:313,2
-DA:314,2
-DA:317,28
-DA:318,27
-DA:319,27
-DA:320,27
-DA:321,14
-DA:323,13
-DA:330,11
-DA:331,11
-DA:335,5
-DA:336,5
-DA:340,10
-DA:341,10
-DA:342,5308
-DA:343,5288
-DA:344,5288
-DA:346,10
-DA:370,2
-DA:372,2
-DA:382,1
-DA:384,1
-DA:388,3
-DA:390,3
-DA:394,3
-DA:396,3
-DA:400,1
-DA:402,1
-DA:411,1
-DA:412,1
-DA:416,1
-DA:417,1
-BA:44,2
-BA:44,2
-BA:44,1
-BA:44,2
-BA:66,2
-BA:66,2
-BA:70,2
-BA:70,1
-BA:76,2
-BA:76,1
-BA:86,2
-BA:86,1
-BA:88,1
-BA:88,2
-BA:89,0
-BA:89,0
-BA:100,2
-BA:100,2
-BA:157,2
-BA:157,2
-BA:157,2
-BA:157,2
-BA:157,2
-BA:157,2
-BA:195,2
-BA:195,2
-BA:197,2
-BA:197,2
-BA:199,2
-BA:199,2
-BA:231,2
-BA:231,1
-BA:231,2
-BA:231,2
-BA:312,2
-BA:312,2
-BA:317,2
-BA:317,2
-BA:317,2
-BA:317,2
-BA:317,2
-BA:317,2
-BA:317,2
-BA:317,2
-BA:320,2
-BA:320,2
-BA:320,2
-BA:320,2
-BA:342,2
-BA:342,2
-BA:342,2
-BA:342,2
-BA:342,2
-BA:342,2
-BA:342,2
-BA:342,2
-BA:342,2
-BA:342,2
-BA:342,2
-BA:342,2
-BA:342,2
-BA:342,2
-LF:162
-LH:160
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:110,_Z18beginAssertFailurev
-FN:121,_ZN13ExpectFailureC1Ev
-FN:17,_ZN8LocationC1EPKciSs
-FN:13,_ZN8LocationC1ERKS_
-FN:52,_ZlsIiER12AssertFailedS1_T_
-FN:52,_ZlsIPKcER12AssertFailedS3_T_
-FN:52,_ZlsIjER12AssertFailedS1_T_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:41,_ZN12AssertFailedD1Ev
-FN:13,_ZN8LocationD1Ev
-FN:67,_Z12assert_eq_fnIjiEv8LocationT_T0_
-FN:67,_Z12assert_eq_fnIiiEv8LocationT_T0_
-FN:59,_Z9assert_fnIbEv8LocationT_
-FN:67,_Z12assert_eq_fnIjjEv8LocationT_T0_
-FN:114,_Z16endAssertFailurev
-FN:122,_ZN13ExpectFailureD1Ev
-DA:13,5482
-DA:17,5284
-DA:18,5284
-DA:33,99
-DA:34,99
-DA:36,99
-DA:38,99
-DA:39,99
-DA:41,99
-DA:42,99
-DA:43,99
-DA:45,0
-DA:46,0
-DA:48,99
-DA:52,0
-DA:54,0
-DA:55,0
-DA:59,3533
-DA:61,3533
-DA:62,99
-DA:64,3533
-DA:67,1185
-DA:69,1185
-DA:70,0
-DA:71,0
-DA:75,1185
-DA:110,1
-DA:111,1
-DA:112,1
-DA:114,1
-DA:115,1
-DA:116,1
-DA:117,1
-DA:118,1
-DA:121,1
-DA:122,1
-BA:42,2
-BA:42,1
-BA:61,2
-BA:61,2
-BA:69,1
-BA:69,2
-BA:69,1
-BA:69,2
-BA:69,1
-BA:69,2
-LF:36
-LH:29
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/list.test.h
-FN:12,_ZNK8TestList2My4headEv
-FN:14,_ZNK8TestList2My4tailEv
-FN:23,_ZNK8TestList2My5emptyEv
-FN:25,_ZN8TestList2MyC1Eii
-FN:31,_ZNK8TestList3My24headEv
-FN:33,_ZNK8TestList3My24tailEv
-FN:47,_ZNK8TestList3My25emptyEv
-FN:49,_ZN8TestList3My2C1Eiii
-FN:53,_ZN8TestList3oddEi
-FN:129,_ZN8TestList8mul2add1Ei
-FN:157,_ZN8TestList11appendCountEv
-FN:148,_ZN8TestList6appendEv
-FN:143,_ZN8TestList6singleEv
-FN:139,_ZN8TestList5emptyEv
-FN:58,_ZN8TestList12checkOddListIN6wibble4list3MapINS_2MyESt25pointer_to_unary_functionIiiEEEEEvT_
-FN:133,_ZN8TestList3mapEv
-FN:112,_ZN8TestList6uniqueEv
-FN:106,_ZN8TestList4takeEv
-FN:69,_ZN8TestList15checkListSortedINS_2MyEEEvT_
-FN:58,_ZN8TestList12checkOddListIN6wibble4list8FilteredINS_2MyEPFbiEEEEEvT_
-FN:88,_ZN8TestList8filteredEv
-FN:81,_ZN8TestList5countEv
-FN:120,_ZN8TestList3stlEv
-FN:69,_ZN8TestList15checkListSortedIN6wibble4list6SortedINS_2MyEEEEEvT_
-FN:94,_ZN8TestList6sortedEv
-DA:12,10024
-DA:14,10494
-DA:15,10494
-DA:16,10494
-DA:17,10294
-DA:18,10494
-DA:19,200
-DA:23,13107
-DA:25,576
-DA:31,222
-DA:33,402
-DA:34,402
-DA:35,402
-DA:36,272
-DA:38,130
-DA:39,130
-DA:40,130
-DA:41,130
-DA:42,0
-DA:47,338
-DA:49,2
-DA:50,2
-DA:53,4606
-DA:54,4606
-DA:58,2
-DA:59,2
-DA:60,1028
-DA:61,1024
-DA:62,1024
-DA:63,1024
-DA:65,2
-DA:66,2
-DA:69,4
-DA:71,4
-DA:72,0
-DA:73,4
-DA:74,2254
-DA:75,2246
-DA:76,2246
-DA:77,3369
-DA:81,1
-DA:82,1
-DA:83,1
-DA:84,1
-DA:85,2
-DA:86,1
-DA:88,1
-DA:89,1
-DA:90,1
-DA:91,1
-DA:92,1
-DA:94,1
-DA:95,1
-DA:96,1
-DA:97,1
-DA:98,2
-DA:100,1
-DA:101,2
-DA:103,2
-DA:104,1
-DA:106,1
-DA:107,1
-DA:108,1
-DA:109,2
-DA:110,1
-DA:112,1
-DA:113,1
-DA:114,1
-DA:115,2
-DA:116,2
-DA:117,2
-DA:118,1
-DA:120,1
-DA:121,1
-DA:122,1
-DA:124,1
-DA:125,2050
-DA:126,1025
-DA:127,1
-DA:129,512
-DA:130,512
-DA:133,1
-DA:134,1
-DA:136,1
-DA:137,1
-DA:139,1
-DA:140,1
-DA:141,1
-DA:143,1
-DA:144,1
-DA:145,2
-DA:146,1
-DA:148,1
-DA:150,1
-DA:152,2
-DA:154,2
-DA:155,1
-DA:157,1
-DA:159,1
-DA:160,1
-BA:16,2
-BA:16,2
-BA:18,2
-BA:18,2
-BA:35,2
-BA:35,2
-BA:39,2
-BA:39,1
-BA:41,1
-BA:41,2
-BA:60,2
-BA:60,2
-BA:60,2
-BA:60,2
-BA:71,1
-BA:71,2
-BA:71,1
-BA:71,2
-BA:74,2
-BA:74,2
-BA:74,2
-BA:74,2
-BA:125,2
-BA:125,2
-LF:100
-LH:98
-end_of_record
-SF:/srv/build/pkg/ept-work/default/wibble/wibble-test-generated-_home_mornfall_dev_pkg_ept-work_wibble_list.cpp
-FN:13,_Z41__static_initialization_and_destruction_0ii
-FN:13,_GLOBAL__I__Z14run_List_countv
-FN:13,_Z20run_List_appendCountv
-FN:12,_Z15run_List_appendv
-FN:11,_Z15run_List_singlev
-FN:10,_Z14run_List_emptyv
-FN:9,_Z12run_List_mapv
-FN:7,_Z15run_List_uniquev
-FN:6,_Z13run_List_takev
-FN:4,_Z17run_List_filteredv
-FN:3,_Z14run_List_countv
-FN:8,_Z12run_List_stlv
-FN:5,_Z15run_List_sortedv
-DA:3,1
-DA:4,1
-DA:5,1
-DA:6,1
-DA:7,1
-DA:8,1
-DA:9,1
-DA:10,1
-DA:11,1
-DA:12,1
-DA:13,4
-BA:13,2
-BA:13,1
-BA:13,2
-BA:13,1
-LF:11
-LH:11
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaIcED1Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaIiED2Ev
-FN:98,_ZNSaIiEC2Ev
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,14
-DA:100,0
-DA:101,0
-DA:106,11
-DA:118,0
-DA:119,0
-LF:6
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-LF:51
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algo.h
-FN:89,_ZSt8__medianIiERKT_S2_S2_S2_
-FN:1714,_ZSt25__unguarded_linear_insertIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEiEvT_T0_
-FN:1793,_ZSt26__unguarded_insertion_sortIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEvT_S7_
-FN:1856,_ZSt21__unguarded_partitionIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEiET_S7_S7_T0_
-FN:1555,_ZSt13__heap_selectIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEvT_S7_S7_
-FN:4622,_ZSt12partial_sortIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEvT_S7_S7_
-FN:1898,_ZSt16__introsort_loopIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEiEvT_S7_T0_
-FN:1748,_ZSt16__insertion_sortIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEvT_S7_
-FN:1825,_ZSt22__final_insertion_sortIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEvT_S7_
-FN:1970,_ZSt4__lgi
-FN:4770,_ZSt4sortIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEvT_S7_
-DA:89,133
-DA:93,133
-DA:94,132
-DA:95,132
-DA:96,0
-DA:97,0
-DA:99,0
-DA:100,1
-DA:101,0
-DA:102,1
-DA:103,0
-DA:105,1
-DA:1555,0
-DA:1557,0
-DA:1558,0
-DA:1559,0
-DA:1560,0
-DA:1561,0
-DA:1714,2144
-DA:1716,2144
-DA:1717,2144
-DA:1718,4288
-DA:1720,0
-DA:1721,0
-DA:1722,0
-DA:1724,2144
-DA:1725,2144
-DA:1748,4
-DA:1750,4
-DA:1751,0
-DA:1753,51
-DA:1756,47
-DA:1757,47
-DA:1759,1
-DA:1760,1
-DA:1763,46
-DA:1793,3
-DA:1798,2101
-DA:1799,2098
-DA:1800,3
-DA:1825,4
-DA:1827,4
-DA:1829,3
-DA:1830,3
-DA:1833,1
-DA:1834,4
-DA:1856,183
-DA:1858,50
-DA:1860,6596
-DA:1861,6230
-DA:1862,183
-DA:1863,6480
-DA:1864,6114
-DA:1865,183
-DA:1866,133
-DA:1867,50
-DA:1868,50
-DA:1898,137
-DA:1903,407
-DA:1905,133
-DA:1907,0
-DA:1908,0
-DA:1910,133
-DA:1919,133
-DA:1920,133
-DA:1921,133
-DA:1970,4
-DA:1971,4
-DA:4622,0
-DA:4634,0
-DA:4635,0
-DA:4636,0
-DA:4770,4
-DA:4781,4
-DA:4783,4
-DA:4785,4
-DA:4787,4
-BA:93,2
-BA:93,2
-BA:94,2
-BA:94,1
-BA:96,0
-BA:96,0
-BA:100,1
-BA:100,2
-BA:102,1
-BA:102,2
-BA:1558,0
-BA:1558,0
-BA:1559,0
-BA:1559,0
-BA:1718,1
-BA:1718,2
-BA:1750,1
-BA:1750,2
-BA:1753,2
-BA:1753,2
-BA:1757,2
-BA:1757,2
-BA:1798,2
-BA:1798,2
-BA:1827,2
-BA:1827,2
-BA:1860,2
-BA:1860,2
-BA:1863,2
-BA:1863,2
-BA:1865,2
-BA:1865,2
-BA:1903,2
-BA:1903,2
-BA:1905,1
-BA:1905,2
-BA:4781,2
-BA:4781,1
-LF:77
-LH:56
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN6wibble4list12ListIteratorIN8TestList2MyEEELb0EE3__bES5_
-FN:268,_ZNSt12__niter_baseIN6wibble4list12ListIteratorIN8TestList2MyEEELb0EE3__bES5_
-FN:268,_ZNSt12__niter_baseISt20back_insert_iteratorISt6vectorIiSaIiEEELb0EE3__bES4_
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEELb0EE3__bES6_
-FN:104,_ZNSt11__iter_swapILb1EE9iter_swapIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEES8_EEvT_T0_
-FN:121,_ZSt9iter_swapIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEES6_EvT_T0_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEELb1EE3__bES6_
-FN:286,_ZNSt12__miter_baseIPiLb0EE3__bES0_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:268,_ZNSt12__niter_baseIPiLb0EE3__bES0_
-FN:569,_ZNSt20__copy_move_backwardILb0ELb1ESt26random_access_iterator_tagE13__copy_move_bIiEEPT_PKS3_S6_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0EPiS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPiS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardIPiS0_ET0_T_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEES6_ET1_T0_S8_S7_
-FN:624,_ZSt13copy_backwardIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEES6_ET0_T_S8_S7_
-FN:375,_ZNSt11__copy_moveILb0ELb1ESt26random_access_iterator_tagE8__copy_mIiEEPT_PKS3_S6_S4_
-FN:385,_ZSt13__copy_move_aILb0EPiS0_ET1_T0_S2_S1_
-FN:430,_ZSt14__copy_move_a2ILb0EPiS0_ET1_T0_S2_S1_
-FN:456,_ZSt4copyIPiS0_ET0_T_S2_S1_
-FN:309,_ZNSt11__copy_moveILb0ELb0ESt20forward_iterator_tagE8__copy_mIN6wibble4list12ListIteratorIN8TestList2MyEEESt20back_insert_iteratorISt6vectorIiSaIiEEEEET0_T_SF_SE_
-FN:385,_ZSt13__copy_move_aILb0EN6wibble4list12ListIteratorIN8TestList2MyEEESt20back_insert_iteratorISt6vectorIiSaIiEEEET1_T0_SC_SB_
-FN:430,_ZSt14__copy_move_a2ILb0EN6wibble4list12ListIteratorIN8TestList2MyEEESt20back_insert_iteratorISt6vectorIiSaIiEEEET1_T0_SC_SB_
-FN:456,_ZSt4copyIN6wibble4list12ListIteratorIN8TestList2MyEEESt20back_insert_iteratorISt6vectorIiSaIiEEEET0_T_SC_SB_
-DA:104,50
-DA:106,50
-DA:107,50
-DA:121,50
-DA:142,50
-DA:146,50
-DA:210,230
-DA:215,230
-DA:216,111
-DA:217,119
-DA:268,402
-DA:269,402
-DA:276,5
-DA:277,5
-DA:286,272
-DA:287,272
-DA:309,4
-DA:311,3174
-DA:312,3170
-DA:313,4
-DA:375,130
-DA:377,130
-DA:379,130
-DA:385,134
-DA:393,134
-DA:396,134
-DA:430,134
-DA:435,134
-DA:456,134
-DA:466,134
-DA:569,1
-DA:571,1
-DA:572,1
-DA:573,1
-DA:579,1
-DA:587,1
-DA:592,1
-DA:597,1
-DA:602,1
-DA:624,1
-DA:636,1
-BA:215,2
-BA:215,2
-BA:311,2
-BA:311,2
-LF:41
-LH:41
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:97,_ZSt8_DestroyIPiEvT_S1_
-FN:126,_ZSt8_DestroyIPiiEvT_S1_RSaIT0_E
-DA:97,76
-DA:104,76
-DA:126,76
-DA:128,76
-DA:129,76
-LF:5
-LH:5
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_function.h
-FN:104,_ZNSt14unary_functionIiiEC2Ev
-FN:420,_ZNSt25pointer_to_unary_functionIiiEC1EPFiiE
-FN:431,_ZSt7ptr_funIiiESt25pointer_to_unary_functionIT_T0_EPFS2_S1_E
-FN:424,_ZNKSt25pointer_to_unary_functionIiiEclEi
-DA:104,3
-DA:420,1
-DA:421,1
-DA:424,512
-DA:425,512
-DA:431,1
-DA:432,1
-LF:7
-LH:7
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_heap.h
-FN:131,_ZSt11__push_heapIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEiiEvT_T0_S8_T1_
-FN:225,_ZSt13__adjust_heapIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEiiEvT_T0_S8_T1_
-FN:371,_ZSt9make_heapIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEvT_S7_
-FN:251,_ZSt10__pop_heapIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEvT_S7_S7_
-FN:276,_ZSt8pop_heapIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEvT_S7_
-FN:450,_ZSt9sort_heapIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEEvT_S7_
-DA:131,0
-DA:133,0
-DA:134,0
-DA:136,0
-DA:137,0
-DA:138,0
-DA:140,0
-DA:141,0
-DA:225,0
-DA:227,0
-DA:228,0
-DA:229,0
-DA:231,0
-DA:232,0
-DA:233,0
-DA:234,0
-DA:235,0
-DA:237,0
-DA:239,0
-DA:240,0
-DA:242,0
-DA:244,0
-DA:246,0
-DA:251,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:263,0
-DA:276,0
-DA:288,0
-DA:289,0
-DA:371,0
-DA:384,0
-DA:385,0
-DA:387,0
-DA:388,0
-DA:389,0
-DA:391,0
-DA:392,0
-DA:393,0
-DA:394,0
-DA:395,0
-DA:450,0
-DA:460,0
-DA:461,0
-DA:462,0
-BA:134,0
-BA:134,0
-BA:134,0
-BA:134,0
-BA:134,0
-BA:134,0
-BA:229,0
-BA:229,0
-BA:232,0
-BA:232,0
-BA:237,0
-BA:237,0
-BA:237,0
-BA:237,0
-BA:384,0
-BA:384,0
-BA:393,0
-BA:393,0
-BA:460,0
-BA:460,0
-LF:46
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:398,_ZNSt20back_insert_iteratorISt6vectorIiSaIiEEEC1ERS2_
-FN:456,_ZSt13back_inserterISt6vectorIiSaIiEEESt20back_insert_iteratorIT_ERS4_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEC1ERKS1_
-FN:434,_ZNSt20back_insert_iteratorISt6vectorIiSaIiEEEppEv
-FN:429,_ZNSt20back_insert_iteratorISt6vectorIiSaIiEEEdeEv
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEE4baseEv
-FN:781,_ZN9__gnu_cxxneIPiSt6vectorIiSaIiEEEEbRKNS_17__normal_iteratorIT_T0_EESA_
-FN:846,_ZN9__gnu_cxxmiIPiSt6vectorIiSaIiEEEENS_17__normal_iteratorIT_T0_E15difference_typeERKS8_SB_
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEdeEv
-FN:735,_ZNK9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEplERKi
-FN:743,_ZNK9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEmiERKi
-FN:703,_ZN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEppEv
-FN:715,_ZN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEmmEv
-FN:794,_ZN9__gnu_cxxltIPiSt6vectorIiSaIiEEEEbRKNS_17__normal_iteratorIT_T0_EESA_
-FN:769,_ZN9__gnu_cxxeqIPiSt6vectorIiSaIiEEEEbRKNS_17__normal_iteratorIT_T0_EESA_
-FN:722,_ZN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEmmEi
-FN:412,_ZNSt20back_insert_iteratorISt6vectorIiSaIiEEEaSERKi
-DA:398,4
-DA:412,3170
-DA:414,3170
-DA:415,3170
-DA:429,3170
-DA:430,3170
-DA:434,3170
-DA:435,3170
-DA:456,4
-DA:457,4
-DA:683,409
-DA:695,19712
-DA:696,19712
-DA:703,8451
-DA:705,8451
-DA:706,8451
-DA:715,8441
-DA:717,8441
-DA:718,8441
-DA:722,0
-DA:723,0
-DA:735,149
-DA:736,149
-DA:743,133
-DA:744,133
-DA:747,5767
-DA:748,5767
-DA:769,49
-DA:770,49
-DA:781,2156
-DA:782,2156
-DA:794,183
-DA:795,183
-DA:846,428
-DA:847,428
-LF:35
-LH:33
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,550
-DA:166,0
-DA:167,0
-LF:3
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_move.h
-FN:80,_ZSt4swapIiEvRT_S1_
-DA:80,50
-DA:85,50
-DA:86,50
-DA:87,50
-DA:88,50
-LF:5
-LH:5
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:97,_ZNSt20__uninitialized_copyILb1EE18uninitialized_copyIPiS2_EET0_T_S4_S3_
-FN:113,_ZSt18uninitialized_copyIPiS0_ET0_T_S2_S1_
-FN:261,_ZSt22__uninitialized_copy_aIPiS0_iET0_T_S2_S1_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPiS0_SaIiEET0_T_S3_S2_RT1_
-DA:97,130
-DA:98,130
-DA:113,130
-DA:122,130
-DA:261,130
-DA:262,130
-DA:268,130
-DA:272,130
-LF:8
-LH:8
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:562,_ZNSt6vectorIiSaIiEEixEj
-FN:97,_ZNSt12_Vector_baseIiSaIiEE19_M_get_Tp_allocatorEv
-FN:484,_ZNKSt6vectorIiSaIiEE4sizeEv
-FN:79,_ZNSt12_Vector_baseIiSaIiEE12_Vector_implD1Ev
-FN:395,_ZNSt6vectorIiSaIiEE3endEv
-FN:377,_ZNSt6vectorIiSaIiEE5beginEv
-FN:84,_ZNSt12_Vector_baseIiSaIiEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseIiSaIiEEC2Ev
-FN:213,_ZNSt6vectorIiSaIiEEC1Ev
-FN:101,_ZNKSt12_Vector_baseIiSaIiEE19_M_get_Tp_allocatorEv
-FN:489,_ZNKSt6vectorIiSaIiEE8max_sizeEv
-FN:147,_ZNSt12_Vector_baseIiSaIiEE13_M_deallocateEPij
-FN:135,_ZNSt12_Vector_baseIiSaIiEED2Ev
-FN:299,_ZNSt6vectorIiSaIiEED1Ev
-FN:1075,_ZNKSt6vectorIiSaIiEE12_M_check_lenEjPKc
-FN:143,_ZNSt12_Vector_baseIiSaIiEE11_M_allocateEj
-FN:686,_ZNSt6vectorIiSaIiEE9push_backERKi
-DA:79,11
-DA:84,14
-DA:85,14
-DA:86,14
-DA:97,206
-DA:98,206
-DA:101,130
-DA:102,130
-DA:108,14
-DA:109,14
-DA:135,11
-DA:136,11
-DA:137,11
-DA:143,65
-DA:144,65
-DA:147,76
-DA:149,76
-DA:150,62
-DA:151,76
-DA:213,14
-DA:214,14
-DA:299,11
-DA:300,11
-DA:301,11
-DA:377,42
-DA:378,42
-DA:395,67
-DA:396,67
-DA:484,2411
-DA:485,2411
-DA:489,130
-DA:490,130
-DA:562,3272
-DA:563,3272
-DA:686,3177
-DA:688,3177
-DA:690,3129
-DA:691,3129
-DA:694,48
-DA:695,3177
-DA:1075,65
-DA:1077,65
-DA:1078,0
-DA:1080,65
-DA:1081,65
-BA:144,2
-BA:144,1
-BA:149,2
-BA:149,2
-BA:688,2
-BA:688,2
-BA:1077,1
-BA:1077,2
-BA:1081,2
-BA:1081,1
-BA:1081,1
-BA:1081,2
-LF:45
-LH:44
-end_of_record
-SF:/usr/include/c++/4.3/bits/vector.tcc
-FN:283,_ZNSt6vectorIiSaIiEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPiS1_EERKi
-DA:283,65
-DA:286,65
-DA:288,0
-DA:291,0
-DA:293,0
-DA:295,0
-DA:299,0
-DA:307,65
-DA:308,65
-DA:309,65
-DA:316,65
-DA:321,65
-DA:323,65
-DA:324,65
-DA:330,0
-DA:332,0
-DA:333,0
-DA:334,0
-DA:336,65
-DA:338,65
-DA:341,65
-DA:342,65
-DA:343,65
-DA:345,65
-BA:286,1
-BA:286,2
-LF:24
-LH:15
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorIiED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorIiEC2Ev
-FN:107,_ZN9__gnu_cxx13new_allocatorIiE9constructEPiRKi
-FN:101,_ZNK9__gnu_cxx13new_allocatorIiE8max_sizeEv
-FN:97,_ZN9__gnu_cxx13new_allocatorIiE10deallocateEPij
-FN:87,_ZN9__gnu_cxx13new_allocatorIiE8allocateEjPKv
-DA:69,112
-DA:71,0
-DA:76,109
-DA:87,65
-DA:89,65
-DA:90,0
-DA:92,65
-DA:97,62
-DA:98,62
-DA:101,195
-DA:102,195
-DA:107,3243
-DA:108,3243
-BA:89,1
-BA:89,2
-BA:108,2
-BA:108,1
-LF:13
-LH:11
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-DA:105,10297
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:195,_ZNSolsEj
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-DA:95,0
-DA:112,0
-DA:117,0
-DA:195,0
-DA:199,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/exception.h
-FN:190,_ZNK6wibble9exception7Generic4typeEv
-FN:263,_ZNK6wibble9exception11Consistency4typeEv
-FN:406,_ZNK6wibble9exception6System4codeEv
-FN:428,_ZNK6wibble9exception4File4typeEv
-FN:109,_ZN6wibble9exception10AddContext7contextEv
-FN:193,_ZNK6wibble9exception7Generic4descEv
-FN:213,_ZNK6wibble9exception7Generic4whatEv
-FN:279,_ZNK6wibble9exception7BadCast8typeinfoEv
-FN:265,_ZNK6wibble9exception11Consistency4descEv
-FN:137,_ZN6wibble9exception7ContextD2Ev
-FN:117,_ZN6wibble9exception10AddContext11copyContextISt20back_insert_iteratorISt6vectorISsSaISsEEEEEvT_
-FN:153,_ZN6wibble9exception7Context10addContextERKSs
-FN:147,_ZN6wibble9exception7ContextC2ERKSs
-FN:186,_ZN6wibble9exception7GenericC1ERKSs
-FN:186,_ZN6wibble9exception7GenericC2ERKSs
-FN:123,_ZN6wibble9exception10AddContextC1ESs
-FN:187,_ZN6wibble9exception7GenericD0Ev
-FN:154,_ZNK6wibble9exception7Context13formatContextEv
-FN:205,_ZNK6wibble9exception7Generic8fullInfoEv
-FN:129,_ZN6wibble9exception10AddContextD1Ev
-FN:187,_ZN6wibble9exception7GenericD1Ev
-FN:292,_ZNK6wibble9exception10BadCastExtIiPKcE8typeinfoEv
-FN:280,_ZNK6wibble9exception7BadCast4descEv
-FN:187,_ZN6wibble9exception7GenericD2Ev
-FN:259,_ZN6wibble9exception11ConsistencyC2ERKSsS3_
-FN:395,_ZN6wibble9exception6SystemD2Ev
-FN:395,_ZN6wibble9exception6SystemD1Ev
-FN:261,_ZN6wibble9exception11ConsistencyD2Ev
-FN:278,_ZN6wibble9exception7BadCastD2Ev
-FN:291,_ZN6wibble9exception10BadCastExtIiPKcED0Ev
-FN:291,_ZN6wibble9exception10BadCastExtIiPKcED1Ev
-FN:278,_ZN6wibble9exception7BadCastD0Ev
-FN:278,_ZN6wibble9exception7BadCastD1Ev
-FN:261,_ZN6wibble9exception11ConsistencyD0Ev
-FN:261,_ZN6wibble9exception11ConsistencyD1Ev
-FN:275,_ZN6wibble9exception7BadCastC2ERKSs
-FN:288,_ZN6wibble9exception10BadCastExtIiPKcEC1ERKSs
-FN:426,_ZN6wibble9exception4FileD0Ev
-FN:426,_ZN6wibble9exception4FileD1Ev
-FN:424,_ZN6wibble9exception4FileC1ERKSsS3_
-FN:430,_ZNK6wibble9exception4File4descEv
-DA:109,21
-DA:110,21
-DA:111,20
-DA:112,1
-DA:113,1
-DA:117,6
-DA:118,6
-DA:119,6
-DA:123,3
-DA:124,3
-DA:126,3
-DA:127,3
-DA:129,3
-DA:130,3
-DA:131,3
-DA:132,3
-DA:137,6
-DA:147,6
-DA:148,6
-DA:149,6
-DA:150,6
-DA:151,6
-DA:153,6
-DA:154,5
-DA:155,0
-DA:156,5
-DA:157,0
-DA:159,5
-DA:161,5
-DA:162,5
-DA:163,5
-DA:186,6
-DA:187,6
-DA:190,0
-DA:193,2
-DA:194,0
-DA:195,2
-DA:205,4
-DA:206,0
-DA:207,4
-DA:209,4
-DA:210,4
-DA:213,1
-DA:259,1
-DA:260,1
-DA:261,1
-DA:263,0
-DA:265,0
-DA:266,0
-DA:267,0
-DA:268,0
-DA:269,0
-DA:275,1
-DA:276,1
-DA:277,1
-DA:278,1
-DA:279,0
-DA:280,1
-DA:281,1
-DA:288,1
-DA:289,1
-DA:290,1
-DA:291,1
-DA:292,1
-DA:295,1
-DA:395,2
-DA:406,2
-DA:424,1
-DA:425,1
-DA:426,1
-DA:428,0
-DA:430,1
-BA:110,2
-BA:110,2
-BA:156,1
-BA:156,2
-BA:187,0
-BA:187,0
-BA:187,1
-BA:187,2
-BA:187,1
-BA:187,2
-BA:207,2
-BA:207,1
-BA:261,1
-BA:261,2
-BA:261,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:267,0
-BA:267,0
-BA:278,1
-BA:278,2
-BA:278,0
-BA:278,0
-BA:278,0
-BA:278,0
-BA:291,0
-BA:291,0
-BA:291,1
-BA:291,2
-BA:395,1
-BA:395,2
-BA:395,1
-BA:395,2
-BA:426,0
-BA:426,0
-BA:426,1
-BA:426,2
-LF:72
-LH:59
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:13,_ZN8LocationC1ERKS_
-FN:17,_ZN8LocationC1EPKciSs
-FN:52,_ZlsISsER12AssertFailedS1_T_
-FN:52,_ZlsIPKcER12AssertFailedS3_T_
-FN:52,_ZlsIiER12AssertFailedS1_T_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:41,_ZN12AssertFailedD1Ev
-FN:13,_ZN8LocationD1Ev
-FN:67,_Z12assert_eq_fnIiiEv8LocationT_T0_
-FN:59,_Z9assert_fnIbEv8LocationT_
-FN:67,_Z12assert_eq_fnISsPKcEv8LocationT_T0_
-FN:67,_Z12assert_eq_fnISsSsEv8LocationT_T0_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:59,0
-DA:61,0
-DA:62,0
-DA:64,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:75,0
-BA:42,0
-BA:42,0
-BA:61,0
-BA:61,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-LF:26
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/exception.test.h
-FN:79,_ZN13TestException10addContextEv
-FN:64,_ZN13TestException7badCastEv
-FN:44,_ZN13TestException6systemEv
-FN:29,_ZN13TestException7genericEv
-DA:29,1
-DA:32,1
-DA:33,2
-DA:34,1
-DA:38,2
-DA:39,2
-DA:40,1
-DA:42,1
-DA:44,1
-DA:47,1
-DA:48,2
-DA:49,2
-DA:51,1
-DA:55,2
-DA:56,2
-DA:57,2
-DA:59,1
-DA:60,2
-DA:62,1
-DA:64,1
-DA:66,1
-DA:68,1
-DA:69,1
-DA:71,2
-DA:73,1
-DA:74,1
-DA:76,2
-DA:77,1
-DA:79,1
-DA:80,1
-DA:81,1
-DA:83,2
-DA:84,1
-DA:86,2
-DA:87,2
-DA:88,1
-DA:89,2
-DA:93,1
-DA:94,1
-DA:96,1
-DA:97,1
-LF:41
-LH:41
-end_of_record
-SF:/srv/build/pkg/ept-work/default/wibble/wibble-test-generated-_home_mornfall_dev_pkg_ept-work_wibble_exception.cpp
-FN:6,_Z41__static_initialization_and_destruction_0ii
-FN:6,_GLOBAL__I__Z21run_Exception_genericv
-FN:6,_Z24run_Exception_addContextv
-FN:5,_Z21run_Exception_badCastv
-FN:4,_Z20run_Exception_systemv
-FN:3,_Z21run_Exception_genericv
-DA:3,1
-DA:4,1
-DA:5,1
-DA:6,4
-BA:6,2
-BA:6,1
-BA:6,2
-BA:6,1
-LF:4
-LH:4
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaIcED1Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaISsED2Ev
-FN:98,_ZNSaISsEC2Ev
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,83
-DA:100,0
-DA:101,0
-DA:106,95
-DA:118,0
-DA:119,0
-LF:6
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:1534,_ZNKSs5c_strEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:612,_ZNKSs6lengthEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:501,_ZNSsaSERKSs
-FN:835,_ZNSs6appendEPKc
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:2188,_ZSteqIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_EPKS3_
-FN:2162,_ZSteqIcEN9__gnu_cxx11__enable_ifIXsrSt9__is_charIT_E7__valueEbE6__typeERKSbIS3_St11char_traitsIS3_ESaIS3_EESC_
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2121,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-FN:1593,_ZNKSs4findEPKcj
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:612,0
-DA:613,0
-DA:686,0
-DA:687,0
-DA:835,0
-DA:838,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:1593,0
-DA:1596,0
-DA:2067,0
-DA:2069,0
-DA:2084,22
-DA:2086,22
-DA:2087,22
-DA:2088,0
-DA:2121,9
-DA:2123,9
-DA:2124,9
-DA:2125,0
-DA:2162,0
-DA:2165,0
-DA:2188,0
-DA:2189,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-LF:73
-LH:6
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-DA:245,0
-DA:246,0
-DA:257,0
-DA:258,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,63
-DA:126,63
-DA:163,0
-DA:164,0
-LF:4
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb0EE3__bES7_
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb0EE3__bES6_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb1EE3__bES7_
-FN:268,_ZNSt12__niter_baseISt16ostream_iteratorISscSt11char_traitsIcEELb0EE3__bES3_
-FN:286,_ZNSt12__miter_baseIPSsLb0EE3__bES0_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb1EE3__bES6_
-FN:268,_ZNSt12__niter_baseISt20back_insert_iteratorISt6vectorISsSaISsEEELb0EE3__bES4_
-FN:268,_ZNSt12__niter_baseIPSsLb0EE3__bES0_
-FN:539,_ZNSt20__copy_move_backwardILb0ELb0ESt26random_access_iterator_tagE13__copy_move_bIPSsS3_EET0_T_S5_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0EPSsS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPSsS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardIPSsS0_ET0_T_S2_S1_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPKSsSt16ostream_iteratorISscSt11char_traitsIcEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPKSsSt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_SD_SC_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET0_T_SD_SC_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET1_T0_SA_S9_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET0_T_SA_S9_
-DA:210,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:268,11
-DA:269,11
-DA:276,22
-DA:277,22
-DA:286,22
-DA:287,22
-DA:337,11
-DA:340,22
-DA:342,11
-DA:343,11
-DA:344,11
-DA:346,11
-DA:385,11
-DA:393,11
-DA:396,11
-DA:430,11
-DA:435,11
-DA:456,11
-DA:466,11
-DA:539,0
-DA:542,0
-DA:543,0
-DA:544,0
-DA:579,0
-DA:587,0
-DA:592,0
-DA:597,0
-DA:602,0
-DA:624,0
-DA:636,0
-BA:215,0
-BA:215,0
-BA:340,2
-BA:340,2
-BA:340,2
-BA:340,2
-BA:542,0
-BA:542,0
-LF:34
-LH:19
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-DA:87,75
-DA:88,75
-DA:97,156
-DA:101,231
-DA:103,75
-DA:104,156
-DA:126,156
-DA:128,156
-DA:129,156
-BA:101,2
-BA:101,2
-LF:9
-LH:9
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEdeEv
-FN:398,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEC1ERS2_
-FN:456,_ZSt13back_inserterISt6vectorISsSaISsEEESt20back_insert_iteratorIT_ERS4_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEC1ERKS2_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEE4baseEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEC1ERKS1_
-FN:743,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEmiERKi
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-FN:429,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEdeEv
-FN:434,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEppEv
-FN:412,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEaSERKSs
-DA:398,6
-DA:412,3
-DA:414,3
-DA:415,3
-DA:429,3
-DA:430,3
-DA:434,3
-DA:435,3
-DA:456,6
-DA:457,6
-DA:683,222
-DA:695,3
-DA:696,3
-DA:743,3
-DA:744,3
-DA:747,286
-DA:748,286
-DA:769,8
-DA:770,8
-LF:19
-LH:19
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,0
-DA:166,0
-DA:167,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyIPSsS2_EET0_T_S4_S3_
-FN:113,_ZSt18uninitialized_copyIPSsS0_ET0_T_S2_S1_
-FN:261,_ZSt22__uninitialized_copy_aIPSsS0_SsET0_T_S2_S1_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPSsS0_SaISsEET0_T_S3_S2_RT1_
-DA:73,122
-DA:75,122
-DA:78,138
-DA:79,16
-DA:81,122
-DA:83,0
-DA:85,0
-DA:86,0
-DA:113,122
-DA:122,122
-DA:261,122
-DA:262,122
-DA:268,122
-DA:272,122
-BA:78,2
-BA:78,2
-BA:79,2
-BA:79,1
-LF:14
-LH:11
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:404,_ZNKSt6vectorISsSaISsEE3endEv
-FN:386,_ZNKSt6vectorISsSaISsEE5beginEv
-FN:484,_ZNKSt6vectorISsSaISsEE4sizeEv
-FN:101,_ZNKSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:395,_ZNSt6vectorISsSaISsEE3endEv
-FN:377,_ZNSt6vectorISsSaISsEE5beginEv
-FN:647,_ZNSt6vectorISsSaISsEE4backEv
-FN:526,_ZNKSt6vectorISsSaISsEE5emptyEv
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:84,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseISsSaISsEEC2Ev
-FN:213,_ZNSt6vectorISsSaISsEEC1Ev
-FN:489,_ZNKSt6vectorISsSaISsEE8max_sizeEv
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:1075,_ZNKSt6vectorISsSaISsEE12_M_check_lenEjPKc
-FN:143,_ZNSt12_Vector_baseISsSaISsEE11_M_allocateEj
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-FN:686,_ZNSt6vectorISsSaISsEE9push_backERKSs
-FN:722,_ZNSt6vectorISsSaISsEE8pop_backEv
-DA:79,69
-DA:84,70
-DA:85,70
-DA:86,70
-DA:97,252
-DA:98,252
-DA:101,122
-DA:102,122
-DA:108,70
-DA:109,70
-DA:135,69
-DA:136,69
-DA:137,69
-DA:143,61
-DA:144,61
-DA:147,130
-DA:149,130
-DA:150,60
-DA:151,130
-DA:213,70
-DA:214,70
-DA:299,69
-DA:300,69
-DA:301,69
-DA:377,12
-DA:378,12
-DA:386,36
-DA:387,36
-DA:395,79
-DA:396,79
-DA:404,64
-DA:405,64
-DA:484,247
-DA:485,247
-DA:489,122
-DA:490,122
-DA:526,8
-DA:527,8
-DA:647,3
-DA:648,3
-DA:686,62
-DA:688,62
-DA:690,1
-DA:691,1
-DA:694,61
-DA:695,62
-DA:722,3
-DA:724,3
-DA:725,3
-DA:726,3
-DA:1075,61
-DA:1077,61
-DA:1078,0
-DA:1080,61
-DA:1081,61
-BA:144,2
-BA:144,1
-BA:149,2
-BA:149,2
-BA:688,2
-BA:688,2
-BA:1077,1
-BA:1077,2
-BA:1081,2
-BA:1081,1
-BA:1081,1
-BA:1081,2
-LF:55
-LH:54
-end_of_record
-SF:/usr/include/c++/4.3/bits/stream_iterator.h
-FN:181,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERSoPKc
-FN:185,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERKS2_
-FN:202,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEdeEv
-FN:206,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEppEv
-FN:191,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEaSERKSs
-DA:181,5
-DA:182,5
-DA:185,25
-DA:186,25
-DA:191,8
-DA:196,8
-DA:197,8
-DA:198,8
-DA:202,8
-DA:203,8
-DA:206,8
-DA:207,8
-BA:197,2
-BA:197,1
-LF:12
-LH:12
-end_of_record
-SF:/usr/include/c++/4.3/bits/vector.tcc
-FN:283,_ZNSt6vectorISsSaISsEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPSsS1_EERKSs
-DA:283,61
-DA:286,61
-DA:288,0
-DA:291,0
-DA:293,0
-DA:295,0
-DA:299,0
-DA:307,61
-DA:308,61
-DA:309,61
-DA:316,61
-DA:321,61
-DA:323,61
-DA:324,61
-DA:330,0
-DA:332,0
-DA:333,0
-DA:334,0
-DA:336,61
-DA:338,61
-DA:341,61
-DA:342,61
-DA:343,61
-DA:345,61
-BA:286,1
-BA:286,2
-LF:24
-LH:15
-end_of_record
-SF:/usr/include/c++/4.3/exception
-FN:59,_ZNSt9exceptionC2Ev
-DA:59,6
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISsE8max_sizeEv
-FN:107,_ZN9__gnu_cxx13new_allocatorISsE9constructEPSsRKSs
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-FN:87,_ZN9__gnu_cxx13new_allocatorISsE8allocateEjPKv
-FN:118,_ZN9__gnu_cxx13new_allocatorISsE7destroyEPSs
-DA:69,199
-DA:71,0
-DA:76,211
-DA:87,87
-DA:89,87
-DA:90,0
-DA:92,87
-DA:97,86
-DA:98,86
-DA:101,209
-DA:102,209
-DA:107,144
-DA:108,144
-DA:118,85
-BA:89,1
-BA:89,2
-BA:108,2
-BA:108,1
-LF:14
-LH:12
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/istream
-FN:585,_ZNSiC2Ev
-FN:105,_ZNSiD2Ev
-FN:804,_ZNSdC2Ev
-FN:801,_ZNSdD2Ev
-DA:105,0
-DA:106,0
-DA:585,0
-DA:586,0
-DA:587,0
-DA:801,0
-DA:804,0
-DA:805,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-DA:95,0
-DA:112,0
-DA:117,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:509,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:536,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:555,_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-DA:509,0
-DA:510,0
-DA:511,0
-DA:536,0
-DA:537,0
-DA:555,0
-DA:556,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-LF:25
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/typeinfo
-FN:104,_ZNKSt9type_info4nameEv
-DA:104,2
-DA:105,2
-LF:2
-LH:2
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/mixin.h
-FN:13,_ZN6wibble5mixin10ComparableIN12_GLOBAL__N_17IntegerEEC2Ev
-FN:15,_ZNK6wibble5mixin10ComparableIN12_GLOBAL__N_17IntegerEE7cmpSelfEv
-FN:23,_ZNK6wibble5mixin10ComparableIN12_GLOBAL__N_17IntegerEEeqERKS3_
-FN:19,_ZNK6wibble5mixin10ComparableIN12_GLOBAL__N_17IntegerEEneERKS3_
-FN:27,_ZNK6wibble5mixin10ComparableIN12_GLOBAL__N_17IntegerEEltERKS3_
-FN:31,_ZNK6wibble5mixin10ComparableIN12_GLOBAL__N_17IntegerEEgtERKS3_
-FN:35,_ZNK6wibble5mixin10ComparableIN12_GLOBAL__N_17IntegerEEgeERKS3_
-FN:64,_ZN6wibble5mixin14OutputIteratorIN12_GLOBAL__N_17DiscardEEdeEv
-FN:53,_ZN6wibble5mixin14OutputIteratorIN12_GLOBAL__N_17DiscardEEppEv
-DA:13,3
-DA:15,35
-DA:16,35
-DA:19,6
-DA:20,6
-DA:23,8
-DA:24,8
-DA:27,3
-DA:28,3
-DA:31,3
-DA:32,3
-DA:35,4
-DA:36,4
-DA:53,3
-DA:54,3
-DA:64,3
-DA:65,3
-BA:24,2
-BA:24,2
-BA:24,2
-BA:24,2
-BA:28,2
-BA:28,2
-BA:28,2
-BA:28,2
-BA:32,2
-BA:32,2
-BA:32,2
-BA:32,2
-LF:17
-LH:17
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:17,_ZN8LocationC1EPKciSs
-FN:13,_ZN8LocationC1ERKS_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:41,_ZN12AssertFailedD1Ev
-FN:13,_ZN8LocationD1Ev
-FN:59,_Z9assert_fnIbEv8LocationT_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:59,0
-DA:61,0
-DA:62,0
-DA:64,0
-BA:42,0
-BA:42,0
-BA:61,0
-BA:61,0
-LF:18
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/mixin.test.h
-FN:15,_ZN12_GLOBAL__N_17IntegerC1Ei
-FN:16,_ZNK12_GLOBAL__N_17IntegerleERKS0_
-FN:22,_ZN12_GLOBAL__N_17DiscardaSERKi
-FN:63,_ZN12_GLOBAL__N_19TestMixin6outputEv
-FN:31,_ZN12_GLOBAL__N_19TestMixin10comparableEv
-DA:15,3
-DA:16,29
-DA:22,3
-DA:24,3
-DA:31,1
-DA:32,1
-DA:33,1
-DA:34,1
-DA:37,1
-DA:38,2
-DA:39,2
-DA:40,2
-DA:43,2
-DA:44,2
-DA:46,2
-DA:47,2
-DA:49,2
-DA:50,2
-DA:51,2
-DA:53,2
-DA:54,2
-DA:55,2
-DA:57,2
-DA:58,2
-DA:59,2
-DA:60,2
-DA:61,1
-DA:63,1
-DA:64,1
-DA:65,1
-DA:66,1
-DA:67,1
-DA:69,1
-DA:70,1
-LF:34
-LH:34
-end_of_record
-SF:/srv/build/pkg/ept-work/default/wibble/wibble-test-generated-_home_mornfall_dev_pkg_ept-work_wibble_mixin.cpp
-FN:4,_Z41__static_initialization_and_destruction_0ii
-FN:4,_GLOBAL__I__Z20run_Mixin_comparablev
-FN:4,_Z16run_Mixin_outputv
-FN:3,_Z20run_Mixin_comparablev
-DA:3,1
-DA:4,4
-BA:4,2
-BA:4,1
-BA:4,2
-BA:4,1
-LF:2
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaIcED1Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaIiED2Ev
-FN:98,_ZNSaIiEC2Ev
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-LF:51
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEELb0EE3__bES6_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEELb1EE3__bES6_
-FN:268,_ZNSt12__niter_baseIN12_GLOBAL__N_17DiscardELb0EE3__bES1_
-FN:286,_ZNSt12__miter_baseIPiLb0EE3__bES0_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:268,_ZNSt12__niter_baseIPiLb0EE3__bES0_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPiN12_GLOBAL__N_17DiscardEEET0_T_S7_S6_
-FN:385,_ZSt13__copy_move_aILb0EPiN12_GLOBAL__N_17DiscardEET1_T0_S4_S3_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEN12_GLOBAL__N_17DiscardEET1_T0_SA_S9_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEEN12_GLOBAL__N_17DiscardEET0_T_SA_S9_
-FN:569,_ZNSt20__copy_move_backwardILb0ELb1ESt26random_access_iterator_tagE13__copy_move_bIiEEPT_PKS3_S6_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0EPiS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPiS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardIPiS0_ET0_T_S2_S1_
-FN:375,_ZNSt11__copy_moveILb0ELb1ESt26random_access_iterator_tagE8__copy_mIiEEPT_PKS3_S6_S4_
-FN:385,_ZSt13__copy_move_aILb0EPiS0_ET1_T0_S2_S1_
-FN:430,_ZSt14__copy_move_a2ILb0EPiS0_ET1_T0_S2_S1_
-FN:456,_ZSt4copyIPiS0_ET0_T_S2_S1_
-DA:210,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:268,1
-DA:269,1
-DA:276,0
-DA:277,0
-DA:286,0
-DA:287,0
-DA:337,1
-DA:340,4
-DA:342,3
-DA:343,3
-DA:344,3
-DA:346,1
-DA:375,0
-DA:377,0
-DA:379,0
-DA:385,1
-DA:393,1
-DA:396,1
-DA:430,1
-DA:435,1
-DA:456,1
-DA:466,1
-DA:569,0
-DA:571,0
-DA:572,0
-DA:573,0
-DA:579,0
-DA:587,0
-DA:592,0
-DA:597,0
-DA:602,0
-DA:624,0
-DA:636,0
-BA:215,0
-BA:215,0
-BA:340,2
-BA:340,2
-LF:37
-LH:15
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:97,_ZSt8_DestroyIPiEvT_S1_
-FN:126,_ZSt8_DestroyIPiiEvT_S1_RSaIT0_E
-DA:97,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-LF:5
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEC1ERKS1_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEE4baseEv
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPiSt6vectorIiSaIiEEEdeEv
-DA:683,0
-DA:695,0
-DA:696,0
-DA:747,0
-DA:748,0
-LF:5
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:166,0
-DA:167,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:97,_ZNSt20__uninitialized_copyILb1EE18uninitialized_copyIPiS2_EET0_T_S4_S3_
-FN:113,_ZSt18uninitialized_copyIPiS0_ET0_T_S2_S1_
-FN:261,_ZSt22__uninitialized_copy_aIPiS0_iET0_T_S2_S1_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPiS0_SaIiEET0_T_S3_S2_RT1_
-DA:97,0
-DA:98,0
-DA:113,0
-DA:122,0
-DA:261,0
-DA:262,0
-DA:268,0
-DA:272,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:97,_ZNSt12_Vector_baseIiSaIiEE19_M_get_Tp_allocatorEv
-FN:395,_ZNSt6vectorIiSaIiEE3endEv
-FN:377,_ZNSt6vectorIiSaIiEE5beginEv
-FN:79,_ZNSt12_Vector_baseIiSaIiEE12_Vector_implD1Ev
-FN:484,_ZNKSt6vectorIiSaIiEE4sizeEv
-FN:84,_ZNSt12_Vector_baseIiSaIiEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseIiSaIiEEC2Ev
-FN:213,_ZNSt6vectorIiSaIiEEC1Ev
-FN:101,_ZNKSt12_Vector_baseIiSaIiEE19_M_get_Tp_allocatorEv
-FN:489,_ZNKSt6vectorIiSaIiEE8max_sizeEv
-FN:1075,_ZNKSt6vectorIiSaIiEE12_M_check_lenEjPKc
-FN:143,_ZNSt12_Vector_baseIiSaIiEE11_M_allocateEj
-FN:147,_ZNSt12_Vector_baseIiSaIiEE13_M_deallocateEPij
-FN:686,_ZNSt6vectorIiSaIiEE9push_backERKi
-FN:135,_ZNSt12_Vector_baseIiSaIiEED2Ev
-FN:299,_ZNSt6vectorIiSaIiEED1Ev
-DA:79,0
-DA:84,0
-DA:85,0
-DA:86,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:108,0
-DA:109,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:143,0
-DA:144,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:213,0
-DA:214,0
-DA:299,0
-DA:300,0
-DA:301,0
-DA:377,0
-DA:378,0
-DA:395,0
-DA:396,0
-DA:484,0
-DA:485,0
-DA:489,0
-DA:490,0
-DA:686,0
-DA:688,0
-DA:690,0
-DA:691,0
-DA:694,0
-DA:695,0
-DA:1075,0
-DA:1077,0
-DA:1078,0
-DA:1080,0
-DA:1081,0
-BA:144,0
-BA:144,0
-BA:149,0
-BA:149,0
-BA:688,0
-BA:688,0
-BA:1077,0
-BA:1077,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-LF:43
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/vector.tcc
-FN:283,_ZNSt6vectorIiSaIiEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPiS1_EERKi
-DA:283,0
-DA:286,0
-DA:288,0
-DA:291,0
-DA:293,0
-DA:295,0
-DA:299,0
-DA:307,0
-DA:308,0
-DA:309,0
-DA:316,0
-DA:321,0
-DA:323,0
-DA:324,0
-DA:330,0
-DA:332,0
-DA:333,0
-DA:334,0
-DA:336,0
-DA:338,0
-DA:341,0
-DA:342,0
-DA:343,0
-DA:345,0
-BA:286,0
-BA:286,0
-LF:24
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:107,_ZN9__gnu_cxx13new_allocatorIiE9constructEPiRKi
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorIiED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorIiEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorIiE8max_sizeEv
-FN:87,_ZN9__gnu_cxx13new_allocatorIiE8allocateEjPKv
-FN:97,_ZN9__gnu_cxx13new_allocatorIiE10deallocateEPij
-DA:69,0
-DA:71,0
-DA:76,0
-DA:87,0
-DA:89,0
-DA:90,0
-DA:92,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:107,0
-DA:108,0
-BA:89,0
-BA:89,0
-BA:108,0
-BA:108,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-DA:105,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-DA:95,0
-DA:112,0
-DA:117,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/sys/buffer.h
-FN:51,_ZNK6wibble3sys6Buffer4Data3refEv
-FN:55,_ZNK6wibble3sys6Buffer4Data5unrefEv
-FN:73,_ZN6wibble3sys6BufferC1Ev
-FN:140,_ZN6wibble3sys6Buffer4dataEv
-FN:146,_ZNK6wibble3sys6Buffer4sizeEv
-FN:95,_ZN6wibble3sys6BufferC1EPvjb
-FN:124,_ZN6wibble3sys6BufferD1Ev
-FN:109,_ZN6wibble3sys6BufferC1EPKvj
-FN:149,_ZN6wibble3sys6Buffer6resizeEj
-FN:76,_ZN6wibble3sys6BufferC1Ej
-FN:167,_ZNK6wibble3sys6BuffereqERKS1_
-FN:176,_ZNK6wibble3sys6BufferneERKS1_
-FN:182,_ZNK6wibble3sys6BufferltERKS1_
-DA:51,0
-DA:55,0
-DA:73,3
-DA:76,2
-DA:78,2
-DA:80,2
-DA:81,2
-DA:83,2
-DA:95,1
-DA:97,1
-DA:99,1
-DA:100,1
-DA:102,1
-DA:109,2
-DA:111,2
-DA:113,2
-DA:114,2
-DA:116,2
-DA:124,8
-DA:126,8
-DA:127,5
-DA:128,8
-DA:140,0
-DA:146,0
-DA:149,1
-DA:151,1
-DA:152,0
-DA:153,1
-DA:155,0
-DA:156,0
-DA:157,0
-DA:158,1
-DA:159,1
-DA:161,0
-DA:162,0
-DA:167,10
-DA:169,10
-DA:170,2
-DA:171,8
-DA:172,2
-DA:173,6
-DA:176,3
-DA:178,3
-DA:182,8
-DA:184,8
-DA:185,2
-DA:186,6
-DA:187,1
-DA:188,5
-DA:189,1
-DA:190,4
-BA:78,2
-BA:78,1
-BA:97,2
-BA:97,1
-BA:111,2
-BA:111,1
-BA:126,2
-BA:126,2
-BA:126,2
-BA:126,1
-BA:126,2
-BA:126,2
-BA:127,2
-BA:127,1
-BA:140,0
-BA:140,0
-BA:146,0
-BA:146,0
-BA:151,2
-BA:151,1
-BA:153,1
-BA:153,2
-BA:155,0
-BA:155,0
-BA:155,0
-BA:155,0
-BA:155,0
-BA:155,0
-BA:156,0
-BA:156,0
-BA:158,2
-BA:158,1
-BA:169,2
-BA:169,2
-BA:169,2
-BA:169,1
-BA:171,2
-BA:171,1
-BA:171,2
-BA:171,2
-BA:184,2
-BA:184,2
-BA:184,2
-BA:184,2
-BA:186,2
-BA:186,2
-BA:188,2
-BA:188,2
-LF:51
-LH:41
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:13,_ZN8LocationC1ERKS_
-FN:17,_ZN8LocationC1EPKciSs
-FN:52,_ZlsIPKcER12AssertFailedS3_T_
-FN:52,_ZlsIjER12AssertFailedS1_T_
-FN:52,_ZlsIPvER12AssertFailedS2_T_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:41,_ZN12AssertFailedD1Ev
-FN:13,_ZN8LocationD1Ev
-FN:67,_Z12assert_eq_fnIjjEv8LocationT_T0_
-FN:67,_Z12assert_eq_fnIPvS0_Ev8LocationT_T0_
-FN:59,_Z9assert_fnIbEv8LocationT_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:59,0
-DA:61,0
-DA:62,0
-DA:64,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:75,0
-BA:42,0
-BA:42,0
-BA:61,0
-BA:61,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-LF:26
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/sys/buffer.test.h
-FN:80,_ZN10TestBuffer8takeoverEv
-FN:58,_ZN10TestBuffer4copyEv
-FN:67,_ZN10TestBuffer6resizeEv
-FN:26,_ZN10TestBuffer12nonemptinessEv
-FN:13,_ZN10TestBuffer9emptinessEv
-DA:13,1
-DA:14,1
-DA:15,1
-DA:16,2
-DA:19,1
-DA:20,2
-DA:21,2
-DA:22,2
-DA:23,2
-DA:24,1
-DA:26,1
-DA:28,1
-DA:29,1
-DA:30,1
-DA:31,2
-DA:34,1
-DA:35,1
-DA:36,1
-DA:37,2
-DA:38,2
-DA:39,2
-DA:40,2
-DA:41,2
-DA:43,1
-DA:44,2
-DA:45,2
-DA:46,2
-DA:47,2
-DA:50,1
-DA:51,2
-DA:52,2
-DA:53,2
-DA:54,2
-DA:55,1
-DA:58,1
-DA:59,1
-DA:60,1
-DA:62,1
-DA:63,2
-DA:64,1
-DA:67,1
-DA:68,1
-DA:69,1
-DA:71,1
-DA:72,2
-DA:74,1
-DA:75,1
-DA:76,2
-DA:77,1
-DA:80,1
-DA:81,1
-DA:82,1
-DA:83,1
-DA:85,1
-DA:86,2
-DA:87,1
-LF:56
-LH:56
-end_of_record
-SF:/srv/build/pkg/ept-work/default/wibble/wibble-test-generated-_home_mornfall_dev_pkg_ept-work_wibble_sys_buffer.cpp
-FN:7,_Z41__static_initialization_and_destruction_0ii
-FN:7,_GLOBAL__I__Z20run_Buffer_emptinessv
-FN:7,_Z19run_Buffer_takeoverv
-FN:5,_Z15run_Buffer_copyv
-FN:6,_Z17run_Buffer_resizev
-FN:4,_Z23run_Buffer_nonemptinessv
-FN:3,_Z20run_Buffer_emptinessv
-DA:3,1
-DA:4,1
-DA:5,1
-DA:6,1
-DA:7,4
-BA:7,2
-BA:7,1
-BA:7,2
-BA:7,1
-LF:5
-LH:5
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaIcED1Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-LF:51
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:166,0
-DA:167,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-DA:69,0
-DA:71,0
-DA:76,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:195,_ZNSolsEj
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:229,_ZNSolsEPKv
-DA:95,0
-DA:112,0
-DA:117,0
-DA:195,0
-DA:199,0
-DA:229,0
-DA:230,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/empty.h
-FN:60,_ZNK6wibble5EmptyIiE4sizeEv
-FN:62,_ZN6wibble5EmptyIiE5beginEv
-FN:63,_ZN6wibble5EmptyIiE3endEv
-FN:55,_ZNK6wibble5EmptyIiE8iteratoreqERKS2_
-FN:56,_ZNK6wibble5EmptyIiE8iteratorneERKS2_
-DA:55,1
-DA:56,1
-DA:60,1
-DA:62,1
-DA:63,2
-LF:5
-LH:5
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:13,_ZN8LocationC1ERKS_
-FN:17,_ZN8LocationC1EPKciSs
-FN:52,_ZlsIPKcER12AssertFailedS3_T_
-FN:52,_ZlsIjER12AssertFailedS1_T_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:41,_ZN12AssertFailedD1Ev
-FN:13,_ZN8LocationD1Ev
-FN:67,_Z12assert_eq_fnIjjEv8LocationT_T0_
-FN:59,_Z9assert_fnIbEv8LocationT_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:59,0
-DA:61,0
-DA:62,0
-DA:64,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:75,0
-BA:42,0
-BA:42,0
-BA:61,0
-BA:61,0
-BA:69,0
-BA:69,0
-LF:26
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/empty.test.h
-FN:10,_ZN9TestEmpty5basicEv
-DA:10,1
-DA:13,1
-DA:15,1
-DA:16,2
-DA:17,2
-DA:18,1
-LF:6
-LH:6
-end_of_record
-SF:/srv/build/pkg/ept-work/default/wibble/wibble-test-generated-_home_mornfall_dev_pkg_ept-work_wibble_empty.cpp
-FN:3,_Z41__static_initialization_and_destruction_0ii
-FN:3,_GLOBAL__I__Z15run_Empty_basicv
-FN:3,_Z15run_Empty_basicv
-DA:3,4
-BA:3,2
-BA:3,1
-BA:3,2
-BA:3,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaIcED1Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-LF:51
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:166,0
-DA:167,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-DA:69,0
-DA:71,0
-DA:76,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:195,_ZNSolsEj
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-DA:95,0
-DA:112,0
-DA:117,0
-DA:195,0
-DA:199,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/commandline/core.h
-FN:21,_ZNK6wibble9exception9BadOption4typeEv
-FN:52,_ZN6wibble11commandline7ManagedC2Ev
-FN:30,_ZN6wibble11commandline7ArgListC1Ev
-FN:63,_ZN6wibble11commandline13MemoryManagerC1Ev
-FN:54,_ZN6wibble11commandline7ManagedD0Ev
-FN:54,_ZN6wibble11commandline7ManagedD1Ev
-FN:54,_ZN6wibble11commandline7ManagedD2Ev
-FN:68,_ZN6wibble11commandline13MemoryManagerD1Ev
-FN:22,_ZNK6wibble9exception9BadOption4descEv
-FN:66,_ZN6wibble11commandline13MemoryManager10addManagedEPNS0_7ManagedE
-FN:76,_ZN6wibble11commandline13MemoryManager3addINS0_12SingleOptionINS0_6StringEEEEEPT_S7_
-FN:76,_ZN6wibble11commandline13MemoryManager3addINS0_6EngineEEEPT_S5_
-FN:76,_ZN6wibble11commandline13MemoryManager3addINS0_11OptionGroupEEEPT_S5_
-FN:76,_ZN6wibble11commandline13MemoryManager3addINS0_10BoolOptionEEEPT_S5_
-FN:30,_ZN6wibble11commandline7ArgListD1Ev
-FN:34,_ZN6wibble11commandline7ArgList15eraseAndAdvanceERSt14_List_iteratorISsE
-FN:17,_ZN6wibble9exception9BadOptionC1ERKSsS3_
-FN:19,_ZN6wibble9exception9BadOptionD0Ev
-FN:19,_ZN6wibble9exception9BadOptionD1Ev
-DA:17,0
-DA:18,0
-DA:19,0
-DA:21,0
-DA:22,0
-DA:30,0
-DA:34,0
-DA:36,0
-DA:37,0
-DA:38,0
-DA:39,0
-DA:40,0
-DA:41,0
-DA:42,0
-DA:52,0
-DA:54,0
-DA:63,0
-DA:66,0
-DA:68,0
-DA:70,0
-DA:72,0
-DA:73,0
-DA:76,0
-BA:19,0
-BA:19,0
-BA:19,0
-BA:19,0
-BA:36,0
-BA:36,0
-BA:54,0
-BA:54,0
-BA:54,0
-BA:54,0
-BA:54,0
-BA:54,0
-BA:70,0
-BA:70,0
-BA:72,0
-BA:72,0
-LF:23
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/commandline/doc.h
-FN:21,_ZN6wibble11commandline8DocMakerC2ERKSsS3_
-FN:31,_ZN6wibble11commandline4HelpC1ERKSsS3_
-FN:15,_ZN6wibble11commandline8DocMakerD2Ev
-FN:26,_ZN6wibble11commandline4HelpD1Ev
-DA:15,1
-DA:21,1
-DA:22,1
-DA:26,1
-DA:31,1
-DA:32,1
-LF:6
-LH:6
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/commandline/engine.h
-FN:106,_ZNK6wibble11commandline6Engine4nameEv
-FN:150,_ZN6wibble11commandline6Engine11createGroupERKSs
-FN:160,_ZN6wibble11commandline6Engine8addGroupERKSs
-FN:101,_ZN6wibble11commandline6EngineC2EPNS0_13MemoryManagerERKSsS5_S5_S5_
-FN:39,_ZN6wibble11commandline6EngineD0Ev
-FN:39,_ZN6wibble11commandline6EngineD1Ev
-FN:39,_ZN6wibble11commandline6EngineD2Ev
-FN:101,_ZN6wibble11commandline6EngineC1EPNS0_13MemoryManagerERKSsS5_S5_S5_
-FN:171,_ZN6wibble11commandline6Engine12createEngineERKSsS3_S3_S3_
-FN:184,_ZN6wibble11commandline6Engine9addEngineERKSsS3_S3_S3_
-DA:39,0
-DA:101,0
-DA:103,0
-DA:106,1
-DA:150,0
-DA:152,0
-DA:153,0
-DA:154,0
-DA:160,0
-DA:162,0
-DA:171,0
-DA:173,0
-DA:174,0
-DA:175,0
-DA:184,0
-DA:186,0
-BA:39,0
-BA:39,0
-BA:39,0
-BA:39,0
-BA:39,0
-BA:39,0
-BA:153,0
-BA:153,0
-BA:174,0
-BA:174,0
-LF:16
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/commandline/options.h
-FN:135,_ZN6wibble11commandline10BoolOption5parseERNS0_7ArgListESt14_List_iteratorISsE
-FN:136,_ZN6wibble11commandline10BoolOption5parseERKSs
-FN:287,_ZN6wibble11commandline11OptionGroupC1EPNS0_13MemoryManagerERKSs
-FN:100,_ZN6wibble11commandline6Option8addAliasEc
-FN:291,_ZN6wibble11commandline11OptionGroup3addEPNS0_6OptionE
-FN:177,_ZN6wibble11commandline12SingleOptionINS0_6StringEE5parseERKSs
-FN:168,_ZN6wibble11commandline12SingleOptionINS0_6StringEE5parseERNS0_7ArgListESt14_List_iteratorISsE
-FN:64,_ZN6wibble11commandline6OptionC2ERKSscS3_S3_S3_
-FN:132,_ZN6wibble11commandline10BoolOptionC1ERKSscS3_S3_S3_
-FN:308,_ZN6wibble11commandline11OptionGroup6createINS0_10BoolOptionEEEPT_RKSscS7_S7_S7_
-FN:323,_ZN6wibble11commandline11OptionGroup3addINS0_10BoolOptionEEEPT_RKSscS7_S7_S7_
-FN:95,_ZN6wibble11commandline6OptionD0Ev
-FN:95,_ZN6wibble11commandline6OptionD1Ev
-FN:95,_ZN6wibble11commandline6OptionD2Ev
-FN:122,_ZN6wibble11commandline10BoolOptionD0Ev
-FN:122,_ZN6wibble11commandline10BoolOptionD1Ev
-FN:161,_ZN6wibble11commandline12SingleOptionINS0_6StringEEC1ERKSscS5_S5_S5_
-FN:308,_ZN6wibble11commandline11OptionGroup6createINS0_12SingleOptionINS0_6StringEEEEEPT_RKSscS9_S9_S9_
-FN:323,_ZN6wibble11commandline11OptionGroup3addINS0_12SingleOptionINS0_6StringEEEEEPT_RKSscS9_S9_S9_
-FN:148,_ZN6wibble11commandline12SingleOptionINS0_6StringEED0Ev
-FN:148,_ZN6wibble11commandline12SingleOptionINS0_6StringEED1Ev
-FN:283,_ZN6wibble11commandline11OptionGroupD0Ev
-FN:283,_ZN6wibble11commandline11OptionGroupD1Ev
-DA:64,0
-DA:65,0
-DA:67,0
-DA:68,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:95,0
-DA:100,1
-DA:122,0
-DA:132,0
-DA:133,0
-DA:135,0
-DA:136,0
-DA:148,0
-DA:161,0
-DA:162,0
-DA:164,0
-DA:165,0
-DA:166,0
-DA:168,0
-DA:170,0
-DA:171,0
-DA:172,0
-DA:173,0
-DA:175,0
-DA:177,0
-DA:179,0
-DA:180,0
-DA:181,0
-DA:283,0
-DA:287,0
-DA:288,0
-DA:291,0
-DA:308,0
-DA:310,0
-DA:311,0
-DA:312,0
-DA:323,0
-DA:325,0
-DA:326,0
-DA:327,0
-BA:67,0
-BA:67,0
-BA:69,0
-BA:69,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:122,0
-BA:122,0
-BA:122,0
-BA:122,0
-BA:148,0
-BA:148,0
-BA:148,0
-BA:148,0
-BA:164,0
-BA:164,0
-BA:170,0
-BA:170,0
-BA:283,0
-BA:283,0
-BA:283,0
-BA:283,0
-BA:311,0
-BA:311,0
-BA:311,0
-BA:311,0
-LF:42
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/commandline/parser.h
-FN:24,_ZN6wibble11commandline6ParserC2ERKSsS3_S3_S3_
-FN:14,_ZN6wibble11commandline6ParserD0Ev
-FN:14,_ZN6wibble11commandline6ParserD1Ev
-FN:14,_ZN6wibble11commandline6ParserD2Ev
-FN:58,_ZN6wibble11commandline14StandardParserD0Ev
-FN:58,_ZN6wibble11commandline14StandardParserD1Ev
-FN:63,_ZN6wibble11commandline14StandardParserC2ERKSsS3_
-FN:58,_ZN6wibble11commandline14StandardParserD2Ev
-FN:98,_ZN6wibble11commandline25StandardParserWithManpageC2ERKSsS3_iS3_
-FN:88,_ZN6wibble11commandline25StandardParserWithManpageD0Ev
-FN:88,_ZN6wibble11commandline25StandardParserWithManpageD1Ev
-FN:88,_ZN6wibble11commandline25StandardParserWithManpageD2Ev
-FN:116,_ZN6wibble11commandline34StandardParserWithMandatoryCommandD0Ev
-FN:116,_ZN6wibble11commandline34StandardParserWithMandatoryCommandD1Ev
-FN:122,_ZN6wibble11commandline34StandardParserWithMandatoryCommandC1ERKSsS3_iS3_
-DA:14,1
-DA:24,1
-DA:25,1
-DA:58,1
-DA:63,1
-DA:64,1
-DA:66,1
-DA:68,2
-DA:69,1
-DA:71,1
-DA:72,1
-DA:88,1
-DA:98,1
-DA:100,1
-DA:103,1
-DA:104,1
-DA:116,1
-DA:122,1
-DA:123,1
-DA:128,1
-DA:129,1
-BA:14,0
-BA:14,0
-BA:14,0
-BA:14,0
-BA:14,1
-BA:14,2
-BA:58,0
-BA:58,0
-BA:58,0
-BA:58,0
-BA:58,1
-BA:58,2
-BA:88,0
-BA:88,0
-BA:88,0
-BA:88,0
-BA:88,1
-BA:88,2
-BA:116,0
-BA:116,0
-BA:116,1
-BA:116,2
-LF:21
-LH:21
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/exception.h
-FN:190,_ZNK6wibble9exception7Generic4typeEv
-FN:263,_ZNK6wibble9exception11Consistency4typeEv
-FN:109,_ZN6wibble9exception10AddContext7contextEv
-FN:213,_ZNK6wibble9exception7Generic4whatEv
-FN:265,_ZNK6wibble9exception11Consistency4descEv
-FN:193,_ZNK6wibble9exception7Generic4descEv
-FN:137,_ZN6wibble9exception7ContextD2Ev
-FN:187,_ZN6wibble9exception7GenericD0Ev
-FN:187,_ZN6wibble9exception7GenericD1Ev
-FN:117,_ZN6wibble9exception10AddContext11copyContextISt20back_insert_iteratorISt6vectorISsSaISsEEEEEvT_
-FN:153,_ZN6wibble9exception7Context10addContextERKSs
-FN:147,_ZN6wibble9exception7ContextC2ERKSs
-FN:186,_ZN6wibble9exception7GenericC2ERKSs
-FN:187,_ZN6wibble9exception7GenericD2Ev
-FN:259,_ZN6wibble9exception11ConsistencyC2ERKSsS3_
-FN:261,_ZN6wibble9exception11ConsistencyD0Ev
-FN:261,_ZN6wibble9exception11ConsistencyD1Ev
-FN:261,_ZN6wibble9exception11ConsistencyD2Ev
-FN:154,_ZNK6wibble9exception7Context13formatContextEv
-FN:205,_ZNK6wibble9exception7Generic8fullInfoEv
-DA:109,0
-DA:110,0
-DA:111,0
-DA:112,0
-DA:113,0
-DA:117,0
-DA:118,0
-DA:119,0
-DA:137,0
-DA:147,0
-DA:148,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:153,0
-DA:154,0
-DA:155,0
-DA:156,0
-DA:157,0
-DA:159,0
-DA:161,0
-DA:162,0
-DA:163,0
-DA:186,0
-DA:187,0
-DA:190,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:205,0
-DA:206,0
-DA:207,0
-DA:209,0
-DA:210,0
-DA:213,0
-DA:259,0
-DA:260,0
-DA:261,0
-DA:263,0
-DA:265,0
-DA:266,0
-DA:267,0
-DA:268,0
-DA:269,0
-BA:110,0
-BA:110,0
-BA:156,0
-BA:156,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:207,0
-BA:207,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:267,0
-BA:267,0
-LF:44
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/commandline/doc.test.h
-FN:14,_ZN18TestCommandlineDoc5basicEv
-DA:14,1
-DA:15,1
-DA:21,2
-DA:22,1
-DA:23,2
-DA:25,2
-DA:27,2
-DA:32,1
-LF:8
-LH:8
-end_of_record
-SF:/srv/build/pkg/ept-work/default/wibble/wibble-test-generated-_home_mornfall_dev_pkg_ept-work_wibble_commandline_doc.cpp
-FN:3,_Z41__static_initialization_and_destruction_0ii
-FN:3,_GLOBAL__I__Z24run_CommandlineDoc_basicv
-FN:3,_Z24run_CommandlineDoc_basicv
-DA:3,4
-BA:3,2
-BA:3,1
-BA:3,2
-BA:3,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC2Ev
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeIPN6wibble11commandline7ManagedEEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISt4pairIKcPN6wibble11commandline6OptionEEEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsPN6wibble11commandline6OptionEEEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsPN6wibble11commandline6EngineEEEED2Ev
-FN:106,_ZNSaISt10_List_nodeISsEED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaISsED2Ev
-FN:106,_ZNSaISsED1Ev
-FN:106,_ZNSaIPN6wibble11commandline6OptionEED2Ev
-FN:106,_ZNSaIPN6wibble11commandline11OptionGroupEED2Ev
-FN:106,_ZNSaIPN6wibble11commandline6EngineEED2Ev
-FN:98,_ZNSaISsEC2Ev
-FN:104,_ZNSaISsEC1ISt10_List_nodeISsEEERKSaIT_E
-FN:106,_ZNSaIPN6wibble11commandline7ManagedEED1Ev
-FN:98,_ZNSaIPN6wibble11commandline6OptionEEC2Ev
-FN:98,_ZNSaIPN6wibble11commandline11OptionGroupEEC2Ev
-FN:98,_ZNSaIPN6wibble11commandline6EngineEEC2Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeISt4pairIKcPN6wibble11commandline6OptionEEEEC2Ev
-FN:106,_ZNSaISt4pairIKcPN6wibble11commandline6OptionEEED1Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsPN6wibble11commandline6OptionEEEEC2Ev
-FN:106,_ZNSaISt4pairIKSsPN6wibble11commandline6OptionEEED1Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsPN6wibble11commandline6EngineEEEEC2Ev
-FN:106,_ZNSaISt4pairIKSsPN6wibble11commandline6EngineEEED1Ev
-FN:98,_ZNSaISt10_List_nodeISsEEC2Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeIPN6wibble11commandline7ManagedEEEC2Ev
-FN:104,_ZNSaIPN6wibble11commandline7ManagedEEC1ISt13_Rb_tree_nodeIS2_EEERKSaIT_E
-FN:104,_ZNSaISt4pairIKcPN6wibble11commandline6OptionEEEC1ISt13_Rb_tree_nodeIS5_EEERKSaIT_E
-FN:104,_ZNSaISt4pairIKSsPN6wibble11commandline6OptionEEEC1ISt13_Rb_tree_nodeIS5_EEERKSaIT_E
-FN:104,_ZNSaISt4pairIKSsPN6wibble11commandline6EngineEEEC1ISt13_Rb_tree_nodeIS5_EEERKSaIT_E
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:104,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:7
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:276,0
-BA:276,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:1534,_ZNKSs5c_strEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:612,_ZNKSs6lengthEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:835,_ZNSs6appendEPKc
-FN:501,_ZNSsaSERKSs
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:928,_ZNSs6assignEPKc
-FN:509,_ZNSsaSEPKc
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2121,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:509,0
-DA:510,0
-DA:606,0
-DA:607,0
-DA:612,0
-DA:613,0
-DA:686,0
-DA:687,0
-DA:835,0
-DA:838,0
-DA:928,0
-DA:931,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2121,0
-DA:2123,0
-DA:2124,0
-DA:2125,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-LF:71
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-FN:668,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_EPKS3_RKS6_
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-DA:668,1
-DA:673,1
-DA:674,1
-DA:675,1
-DA:676,1
-DA:677,1
-DA:678,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:23
-LH:6
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:261,1
-DA:262,1
-DA:273,0
-DA:274,0
-LF:6
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/list.tcc
-FN:70,_ZNSt10_List_baseISsSaISsEE8_M_clearEv
-FN:109,_ZNSt4listISsSaISsEE5eraseESt14_List_iteratorISsE
-DA:70,0
-DA:73,0
-DA:74,0
-DA:76,0
-DA:77,0
-DA:78,0
-DA:79,0
-DA:81,0
-DA:109,0
-DA:111,0
-DA:112,0
-BA:74,0
-BA:74,0
-LF:11
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb0EE3__bES7_
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb0EE3__bES6_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb1EE3__bES7_
-FN:268,_ZNSt12__niter_baseISt16ostream_iteratorISscSt11char_traitsIcEELb0EE3__bES3_
-FN:286,_ZNSt12__miter_baseIPSsLb0EE3__bES0_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb1EE3__bES6_
-FN:268,_ZNSt12__niter_baseISt20back_insert_iteratorISt6vectorISsSaISsEEELb0EE3__bES4_
-FN:286,_ZNSt12__miter_baseIPcLb0EE3__bES0_
-FN:286,_ZNSt12__miter_baseIPPN6wibble11commandline6OptionELb0EE3__bES4_
-FN:268,_ZNSt12__niter_baseIPSsLb0EE3__bES0_
-FN:268,_ZNSt12__niter_baseIPcLb0EE3__bES0_
-FN:268,_ZNSt12__niter_baseIPPN6wibble11commandline6OptionELb0EE3__bES4_
-FN:569,_ZNSt20__copy_move_backwardILb0ELb1ESt26random_access_iterator_tagE13__copy_move_bIcEEPT_PKS3_S6_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0EPcS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPcS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardIPcS0_ET0_T_S2_S1_
-FN:375,_ZNSt11__copy_moveILb0ELb1ESt26random_access_iterator_tagE8__copy_mIcEEPT_PKS3_S6_S4_
-FN:385,_ZSt13__copy_move_aILb0EPcS0_ET1_T0_S2_S1_
-FN:430,_ZSt14__copy_move_a2ILb0EPcS0_ET1_T0_S2_S1_
-FN:456,_ZSt4copyIPcS0_ET0_T_S2_S1_
-FN:569,_ZNSt20__copy_move_backwardILb0ELb1ESt26random_access_iterator_tagE13__copy_move_bIPN6wibble11commandline6OptionEEEPT_PKS7_SA_S8_
-FN:579,_ZSt22__copy_move_backward_aILb0EPPN6wibble11commandline6OptionES4_ET1_T0_S6_S5_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPPN6wibble11commandline6OptionES4_ET1_T0_S6_S5_
-FN:624,_ZSt13copy_backwardIPPN6wibble11commandline6OptionES4_ET0_T_S6_S5_
-FN:375,_ZNSt11__copy_moveILb0ELb1ESt26random_access_iterator_tagE8__copy_mIPN6wibble11commandline6OptionEEEPT_PKS7_SA_S8_
-FN:385,_ZSt13__copy_move_aILb0EPPN6wibble11commandline6OptionES4_ET1_T0_S6_S5_
-FN:430,_ZSt14__copy_move_a2ILb0EPPN6wibble11commandline6OptionES4_ET1_T0_S6_S5_
-FN:456,_ZSt4copyIPPN6wibble11commandline6OptionES4_ET0_T_S6_S5_
-FN:539,_ZNSt20__copy_move_backwardILb0ELb0ESt26random_access_iterator_tagE13__copy_move_bIPSsS3_EET0_T_S5_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0EPSsS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPSsS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardIPSsS0_ET0_T_S2_S1_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPKSsSt16ostream_iteratorISscSt11char_traitsIcEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPKSsSt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_SD_SC_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET0_T_SD_SC_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET1_T0_SA_S9_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET0_T_SA_S9_
-DA:210,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:268,0
-DA:269,0
-DA:276,0
-DA:277,0
-DA:286,0
-DA:287,0
-DA:337,0
-DA:340,0
-DA:342,0
-DA:343,0
-DA:344,0
-DA:346,0
-DA:375,0
-DA:377,0
-DA:379,0
-DA:385,0
-DA:393,0
-DA:396,0
-DA:430,0
-DA:435,0
-DA:456,0
-DA:466,0
-DA:539,0
-DA:542,0
-DA:543,0
-DA:544,0
-DA:569,0
-DA:571,0
-DA:572,0
-DA:573,0
-DA:579,0
-DA:587,0
-DA:592,0
-DA:597,0
-DA:602,0
-DA:624,0
-DA:636,0
-BA:215,0
-BA:215,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:542,0
-BA:542,0
-LF:41
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:97,_ZSt8_DestroyIPcEvT_S1_
-FN:126,_ZSt8_DestroyIPccEvT_S1_RSaIT0_E
-FN:97,_ZSt8_DestroyIPPN6wibble11commandline6OptionEEvT_S5_
-FN:126,_ZSt8_DestroyIPPN6wibble11commandline6OptionES3_EvT_S5_RSaIT0_E
-FN:97,_ZSt8_DestroyIPPN6wibble11commandline11OptionGroupEEvT_S5_
-FN:126,_ZSt8_DestroyIPPN6wibble11commandline11OptionGroupES3_EvT_S5_RSaIT0_E
-FN:97,_ZSt8_DestroyIPPN6wibble11commandline6EngineEEvT_S5_
-FN:126,_ZSt8_DestroyIPPN6wibble11commandline6EngineES3_EvT_S5_RSaIT0_E
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-DA:87,0
-DA:88,0
-DA:97,0
-DA:101,0
-DA:103,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-BA:101,0
-BA:101,0
-LF:9
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_function.h
-FN:469,_ZNKSt9_IdentityIPN6wibble11commandline7ManagedEEclERKS3_
-FN:229,_ZNKSt4lessIPN6wibble11commandline7ManagedEEclERKS3_S6_
-DA:229,0
-DA:230,0
-DA:469,0
-DA:470,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEdeEv
-FN:398,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEC1ERS2_
-FN:456,_ZSt13back_inserterISt6vectorISsSaISsEEESt20back_insert_iteratorIT_ERS4_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEC1ERKS2_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEE4baseEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEC1ERKS1_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPcSt6vectorIcSaIcEEE4baseEv
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPcSt6vectorIcSaIcEEEdeEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPcSt6vectorIcSaIcEEEC1ERKS1_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPPN6wibble11commandline6OptionESt6vectorIS4_SaIS4_EEE4baseEv
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPPN6wibble11commandline6OptionESt6vectorIS4_SaIS4_EEEdeEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPPN6wibble11commandline6OptionESt6vectorIS4_SaIS4_EEEC1ERKS5_
-FN:429,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEdeEv
-FN:434,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEppEv
-FN:412,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEaSERKSs
-DA:398,0
-DA:412,0
-DA:414,0
-DA:415,0
-DA:429,0
-DA:430,0
-DA:434,0
-DA:435,0
-DA:456,0
-DA:457,0
-DA:683,0
-DA:695,0
-DA:696,0
-DA:747,0
-DA:748,0
-DA:769,0
-DA:770,0
-LF:17
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,0
-DA:166,0
-DA:167,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_list.h
-FN:169,_ZNKSt14_List_iteratorISsEeqERKS0_
-FN:139,_ZNSt14_List_iteratorISsEppEv
-FN:131,_ZNKSt14_List_iteratorISsEdeEv
-FN:126,_ZNSt14_List_iteratorISsEC1EPSt15_List_node_base
-FN:666,_ZNSt4listISsSaISsEE3endEv
-FN:364,_ZNSt10_List_baseISsSaISsEE7_M_initEv
-FN:298,_ZNSt10_List_baseISsSaISsEE10_List_implD1Ev
-FN:328,_ZNKSt10_List_baseISsSaISsEE21_M_get_Node_allocatorEv
-FN:332,_ZNKSt10_List_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:301,_ZNSt10_List_baseISsSaISsEE10_List_implC1Ev
-FN:339,_ZNSt10_List_baseISsSaISsEEC2Ev
-FN:498,_ZNSt4listISsSaISsEEC2Ev
-FN:317,_ZNSt10_List_baseISsSaISsEE11_M_put_nodeEPSt10_List_nodeISsE
-FN:357,_ZNSt10_List_baseISsSaISsEED2Ev
-FN:417,_ZNSt4listISsSaISsEED2Ev
-FN:1356,_ZNSt4listISsSaISsEE8_M_eraseESt14_List_iteratorISsE
-DA:126,0
-DA:127,0
-DA:131,0
-DA:132,0
-DA:139,0
-DA:141,0
-DA:142,0
-DA:169,0
-DA:170,0
-DA:298,0
-DA:301,0
-DA:302,0
-DA:303,0
-DA:317,0
-DA:318,0
-DA:328,0
-DA:329,0
-DA:332,0
-DA:333,0
-DA:339,0
-DA:340,0
-DA:341,0
-DA:357,0
-DA:358,0
-DA:364,0
-DA:366,0
-DA:367,0
-DA:368,0
-DA:417,0
-DA:498,0
-DA:499,0
-DA:666,0
-DA:667,0
-DA:1356,0
-DA:1358,0
-DA:1359,0
-DA:1360,0
-DA:1361,0
-DA:1362,0
-LF:39
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_map.h
-FN:155,_ZNSt3mapIcPN6wibble11commandline6OptionESt4lessIcESaISt4pairIKcS3_EEEC1Ev
-FN:155,_ZNSt3mapISsPN6wibble11commandline6OptionESt4lessISsESaISt4pairIKSsS3_EEEC1Ev
-FN:155,_ZNSt3mapISsPN6wibble11commandline6EngineESt4lessISsESaISt4pairIKSsS3_EEEC1Ev
-FN:92,_ZNSt3mapIcPN6wibble11commandline6OptionESt4lessIcESaISt4pairIKcS3_EEED1Ev
-FN:92,_ZNSt3mapISsPN6wibble11commandline6EngineESt4lessISsESaISt4pairIKSsS3_EEED1Ev
-FN:92,_ZNSt3mapISsPN6wibble11commandline6OptionESt4lessISsESaISt4pairIKSsS3_EEED1Ev
-DA:92,0
-DA:155,0
-DA:156,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_pair.h
-FN:88,_ZNSt4pairISt23_Rb_tree_const_iteratorIPN6wibble11commandline7ManagedEEbEC1ERKS5_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIPN6wibble11commandline7ManagedEEbEC1ERKS5_RKb
-FN:73,_ZNSt4pairIKcPN6wibble11commandline6OptionEED1Ev
-FN:73,_ZNSt4pairIKSsPN6wibble11commandline6EngineEED1Ev
-FN:73,_ZNSt4pairIKSsPN6wibble11commandline6OptionEED1Ev
-DA:73,0
-DA:88,0
-DA:89,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_set.h
-FN:261,_ZNKSt3setIPN6wibble11commandline7ManagedESt4lessIS3_ESaIS3_EE5beginEv
-FN:270,_ZNKSt3setIPN6wibble11commandline7ManagedESt4lessIS3_ESaIS3_EE3endEv
-FN:141,_ZNSt3setIPN6wibble11commandline7ManagedESt4lessIS3_ESaIS3_EEC1Ev
-FN:93,_ZNSt3setIPN6wibble11commandline7ManagedESt4lessIS3_ESaIS3_EED1Ev
-FN:378,_ZNSt3setIPN6wibble11commandline7ManagedESt4lessIS3_ESaIS3_EE6insertERKS3_
-DA:93,0
-DA:141,0
-DA:142,0
-DA:261,0
-DA:262,0
-DA:270,0
-DA:271,0
-DA:378,0
-DA:381,0
-DA:382,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_tree.h
-FN:289,_ZNKSt23_Rb_tree_const_iteratorIPN6wibble11commandline7ManagedEEneERKS4_
-FN:247,_ZNKSt23_Rb_tree_const_iteratorIPN6wibble11commandline7ManagedEEdeEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorIPN6wibble11commandline7ManagedEEC1ERKSt17_Rb_tree_iteratorIS3_E
-FN:452,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE8_M_beginEv
-FN:452,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE8_M_beginEv
-FN:452,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_M_beginEv
-FN:452,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_M_beginEv
-FN:463,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE6_M_endEv
-FN:487,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:168,_ZNSt17_Rb_tree_iteratorIPN6wibble11commandline7ManagedEEC1EPSt13_Rb_tree_nodeIS3_E
-FN:596,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE5beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorIPN6wibble11commandline7ManagedEEeqERKS4_
-FN:398,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE13_Rb_tree_implIS7_Lb0EED1Ev
-FN:240,_ZNSt23_Rb_tree_const_iteratorIPN6wibble11commandline7ManagedEEC1EPKSt13_Rb_tree_nodeIS3_E
-FN:603,_ZNKSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE5beginEv
-FN:614,_ZNKSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE3endEv
-FN:398,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE13_Rb_tree_implISA_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:398,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13_Rb_tree_implISA_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:398,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13_Rb_tree_implISA_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:471,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE8_S_valueEPKSt13_Rb_tree_nodeIS3_E
-FN:475,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE6_S_keyEPKSt13_Rb_tree_nodeIS3_E
-FN:495,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE6_S_keyEPKSt18_Rb_tree_node_base
-FN:415,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE13_Rb_tree_implISA_Lb0EE13_M_initializeEv
-FN:415,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13_Rb_tree_implISA_Lb0EE13_M_initializeEv
-FN:415,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13_Rb_tree_implISA_Lb0EE13_M_initializeEv
-FN:415,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE13_Rb_tree_implIS7_Lb0EE13_M_initializeEv
-FN:347,_ZNKSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE21_M_get_Node_allocatorEv
-FN:403,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE13_Rb_tree_implISA_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EEC1Ev
-FN:347,_ZNKSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE21_M_get_Node_allocatorEv
-FN:403,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13_Rb_tree_implISA_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EEC1Ev
-FN:347,_ZNKSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE21_M_get_Node_allocatorEv
-FN:403,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13_Rb_tree_implISA_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EEC1Ev
-FN:347,_ZNKSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE21_M_get_Node_allocatorEv
-FN:403,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE13_Rb_tree_implIS7_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EEC1Ev
-FN:351,_ZNKSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE13get_allocatorEv
-FN:351,_ZNKSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE13get_allocatorEv
-FN:351,_ZNKSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13get_allocatorEv
-FN:351,_ZNKSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13get_allocatorEv
-FN:360,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS3_E
-FN:388,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS3_E
-FN:936,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE8_M_eraseEPSt13_Rb_tree_nodeIS3_E
-FN:584,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EED1Ev
-FN:360,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS6_E
-FN:360,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS6_E
-FN:360,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS6_E
-FN:388,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS6_E
-FN:936,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE8_M_eraseEPSt13_Rb_tree_nodeIS6_E
-FN:584,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EED1Ev
-FN:255,_ZNSt23_Rb_tree_const_iteratorIPN6wibble11commandline7ManagedEEppEv
-FN:356,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE14_M_create_nodeERKS3_
-FN:195,_ZNSt17_Rb_tree_iteratorIPN6wibble11commandline7ManagedEEmmEv
-FN:846,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE10_M_insert_EPKSt18_Rb_tree_node_baseSC_RKS3_
-FN:1133,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE16_M_insert_uniqueERKS3_
-FN:388,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS6_E
-FN:936,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_M_eraseEPSt13_Rb_tree_nodeIS6_E
-FN:584,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EED1Ev
-FN:388,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS6_E
-FN:936,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_M_eraseEPSt13_Rb_tree_nodeIS6_E
-FN:584,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EED1Ev
-DA:168,0
-DA:169,0
-DA:195,0
-DA:197,0
-DA:198,0
-DA:210,0
-DA:211,0
-DA:240,0
-DA:241,0
-DA:243,0
-DA:244,0
-DA:247,0
-DA:248,0
-DA:255,0
-DA:257,0
-DA:258,0
-DA:289,0
-DA:290,0
-DA:347,0
-DA:348,0
-DA:351,0
-DA:352,0
-DA:356,0
-DA:357,0
-DA:360,0
-DA:361,0
-DA:364,0
-DA:366,0
-DA:368,0
-DA:369,0
-DA:371,0
-DA:372,0
-DA:374,0
-DA:388,0
-DA:390,0
-DA:391,0
-DA:392,0
-DA:398,0
-DA:403,0
-DA:405,0
-DA:406,0
-DA:415,0
-DA:417,0
-DA:418,0
-DA:419,0
-DA:420,0
-DA:421,0
-DA:452,0
-DA:453,0
-DA:463,0
-DA:464,0
-DA:471,0
-DA:472,0
-DA:475,0
-DA:476,0
-DA:479,0
-DA:480,0
-DA:487,0
-DA:488,0
-DA:495,0
-DA:496,0
-DA:499,0
-DA:500,0
-DA:562,0
-DA:584,0
-DA:585,0
-DA:596,0
-DA:599,0
-DA:603,0
-DA:606,0
-DA:614,0
-DA:617,0
-DA:846,0
-DA:850,0
-DA:852,0
-DA:854,0
-DA:857,0
-DA:858,0
-DA:936,0
-DA:939,0
-DA:941,0
-DA:942,0
-DA:943,0
-DA:944,0
-DA:946,0
-DA:1133,0
-DA:1135,0
-DA:1136,0
-DA:1137,0
-DA:1138,0
-DA:1140,0
-DA:1141,0
-DA:1142,0
-DA:1144,0
-DA:1145,0
-DA:1147,0
-DA:1148,0
-DA:1150,0
-DA:1152,0
-DA:1153,0
-DA:1154,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:1138,0
-BA:1138,0
-BA:1142,0
-BA:1142,0
-BA:1145,0
-BA:1145,0
-BA:1147,0
-BA:1147,0
-BA:1152,0
-BA:1152,0
-LF:101
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:97,_ZNSt20__uninitialized_copyILb1EE18uninitialized_copyIPcS2_EET0_T_S4_S3_
-FN:113,_ZSt18uninitialized_copyIPcS0_ET0_T_S2_S1_
-FN:261,_ZSt22__uninitialized_copy_aIPcS0_cET0_T_S2_S1_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPcS0_SaIcEET0_T_S3_S2_RT1_
-FN:97,_ZNSt20__uninitialized_copyILb1EE18uninitialized_copyIPPN6wibble11commandline6OptionES6_EET0_T_S8_S7_
-FN:113,_ZSt18uninitialized_copyIPPN6wibble11commandline6OptionES4_ET0_T_S6_S5_
-FN:261,_ZSt22__uninitialized_copy_aIPPN6wibble11commandline6OptionES4_S3_ET0_T_S6_S5_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPPN6wibble11commandline6OptionES4_SaIS3_EET0_T_S7_S6_RT1_
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyIPSsS2_EET0_T_S4_S3_
-FN:113,_ZSt18uninitialized_copyIPSsS0_ET0_T_S2_S1_
-FN:261,_ZSt22__uninitialized_copy_aIPSsS0_SsET0_T_S2_S1_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPSsS0_SaISsEET0_T_S3_S2_RT1_
-DA:73,0
-DA:75,0
-DA:78,0
-DA:79,0
-DA:81,0
-DA:83,0
-DA:85,0
-DA:86,0
-DA:97,0
-DA:98,0
-DA:113,0
-DA:122,0
-DA:261,0
-DA:262,0
-DA:268,0
-DA:272,0
-BA:78,0
-BA:78,0
-BA:79,0
-BA:79,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:404,_ZNKSt6vectorISsSaISsEE3endEv
-FN:386,_ZNKSt6vectorISsSaISsEE5beginEv
-FN:79,_ZNSt12_Vector_baseIcSaIcEE12_Vector_implD1Ev
-FN:97,_ZNSt12_Vector_baseIcSaIcEE19_M_get_Tp_allocatorEv
-FN:97,_ZNSt12_Vector_baseIPN6wibble11commandline6OptionESaIS3_EE19_M_get_Tp_allocatorEv
-FN:97,_ZNSt12_Vector_baseIPN6wibble11commandline11OptionGroupESaIS3_EE19_M_get_Tp_allocatorEv
-FN:97,_ZNSt12_Vector_baseIPN6wibble11commandline6EngineESaIS3_EE19_M_get_Tp_allocatorEv
-FN:395,_ZNSt6vectorISsSaISsEE3endEv
-FN:377,_ZNSt6vectorISsSaISsEE5beginEv
-FN:526,_ZNKSt6vectorISsSaISsEE5emptyEv
-FN:84,_ZNSt12_Vector_baseIcSaIcEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseIcSaIcEEC2Ev
-FN:213,_ZNSt6vectorIcSaIcEEC1Ev
-FN:395,_ZNSt6vectorIcSaIcEE3endEv
-FN:395,_ZNSt6vectorIPN6wibble11commandline6OptionESaIS3_EE3endEv
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:484,_ZNKSt6vectorISsSaISsEE4sizeEv
-FN:484,_ZNKSt6vectorIcSaIcEE4sizeEv
-FN:79,_ZNSt12_Vector_baseIPN6wibble11commandline6OptionESaIS3_EE12_Vector_implD1Ev
-FN:484,_ZNKSt6vectorIPN6wibble11commandline6OptionESaIS3_EE4sizeEv
-FN:79,_ZNSt12_Vector_baseIPN6wibble11commandline11OptionGroupESaIS3_EE12_Vector_implD1Ev
-FN:79,_ZNSt12_Vector_baseIPN6wibble11commandline6EngineESaIS3_EE12_Vector_implD1Ev
-FN:84,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseISsSaISsEEC2Ev
-FN:213,_ZNSt6vectorISsSaISsEEC1Ev
-FN:101,_ZNKSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:489,_ZNKSt6vectorISsSaISsEE8max_sizeEv
-FN:101,_ZNKSt12_Vector_baseIcSaIcEE19_M_get_Tp_allocatorEv
-FN:489,_ZNKSt6vectorIcSaIcEE8max_sizeEv
-FN:84,_ZNSt12_Vector_baseIPN6wibble11commandline6OptionESaIS3_EE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseIPN6wibble11commandline6OptionESaIS3_EEC2Ev
-FN:213,_ZNSt6vectorIPN6wibble11commandline6OptionESaIS3_EEC1Ev
-FN:101,_ZNKSt12_Vector_baseIPN6wibble11commandline6OptionESaIS3_EE19_M_get_Tp_allocatorEv
-FN:489,_ZNKSt6vectorIPN6wibble11commandline6OptionESaIS3_EE8max_sizeEv
-FN:84,_ZNSt12_Vector_baseIPN6wibble11commandline11OptionGroupESaIS3_EE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseIPN6wibble11commandline11OptionGroupESaIS3_EEC2Ev
-FN:213,_ZNSt6vectorIPN6wibble11commandline11OptionGroupESaIS3_EEC1Ev
-FN:84,_ZNSt12_Vector_baseIPN6wibble11commandline6EngineESaIS3_EE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseIPN6wibble11commandline6EngineESaIS3_EEC2Ev
-FN:213,_ZNSt6vectorIPN6wibble11commandline6EngineESaIS3_EEC1Ev
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:147,_ZNSt12_Vector_baseIPN6wibble11commandline6EngineESaIS3_EE13_M_deallocateEPS3_j
-FN:135,_ZNSt12_Vector_baseIPN6wibble11commandline6EngineESaIS3_EED2Ev
-FN:299,_ZNSt6vectorIPN6wibble11commandline6EngineESaIS3_EED1Ev
-FN:147,_ZNSt12_Vector_baseIPN6wibble11commandline6OptionESaIS3_EE13_M_deallocateEPS3_j
-FN:135,_ZNSt12_Vector_baseIPN6wibble11commandline6OptionESaIS3_EED2Ev
-FN:299,_ZNSt6vectorIPN6wibble11commandline6OptionESaIS3_EED1Ev
-FN:147,_ZNSt12_Vector_baseIPN6wibble11commandline11OptionGroupESaIS3_EE13_M_deallocateEPS3_j
-FN:135,_ZNSt12_Vector_baseIPN6wibble11commandline11OptionGroupESaIS3_EED2Ev
-FN:299,_ZNSt6vectorIPN6wibble11commandline11OptionGroupESaIS3_EED1Ev
-FN:147,_ZNSt12_Vector_baseIcSaIcEE13_M_deallocateEPcj
-FN:135,_ZNSt12_Vector_baseIcSaIcEED2Ev
-FN:299,_ZNSt6vectorIcSaIcEED1Ev
-FN:1075,_ZNKSt6vectorIcSaIcEE12_M_check_lenEjPKc
-FN:1075,_ZNKSt6vectorISsSaISsEE12_M_check_lenEjPKc
-FN:1075,_ZNKSt6vectorIPN6wibble11commandline6OptionESaIS3_EE12_M_check_lenEjPKc
-FN:143,_ZNSt12_Vector_baseIcSaIcEE11_M_allocateEj
-FN:686,_ZNSt6vectorIcSaIcEE9push_backERKc
-FN:143,_ZNSt12_Vector_baseISsSaISsEE11_M_allocateEj
-FN:143,_ZNSt12_Vector_baseIPN6wibble11commandline6OptionESaIS3_EE11_M_allocateEj
-FN:686,_ZNSt6vectorIPN6wibble11commandline6OptionESaIS3_EE9push_backERKS3_
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-FN:686,_ZNSt6vectorISsSaISsEE9push_backERKSs
-DA:79,0
-DA:84,0
-DA:85,0
-DA:86,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:108,0
-DA:109,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:143,0
-DA:144,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:213,0
-DA:214,0
-DA:299,0
-DA:300,0
-DA:301,0
-DA:377,0
-DA:378,0
-DA:386,0
-DA:387,0
-DA:395,0
-DA:396,0
-DA:404,0
-DA:405,0
-DA:484,0
-DA:485,0
-DA:489,0
-DA:490,0
-DA:526,0
-DA:527,0
-DA:686,0
-DA:688,0
-DA:690,0
-DA:691,0
-DA:694,0
-DA:695,0
-DA:1075,0
-DA:1077,0
-DA:1078,0
-DA:1080,0
-DA:1081,0
-BA:144,0
-BA:144,0
-BA:144,0
-BA:144,0
-BA:144,0
-BA:144,0
-BA:149,0
-BA:149,0
-BA:149,0
-BA:149,0
-BA:149,0
-BA:149,0
-BA:149,0
-BA:149,0
-BA:149,0
-BA:149,0
-BA:688,0
-BA:688,0
-BA:688,0
-BA:688,0
-BA:688,0
-BA:688,0
-BA:1077,0
-BA:1077,0
-BA:1077,0
-BA:1077,0
-BA:1077,0
-BA:1077,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-LF:49
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stream_iterator.h
-FN:181,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERSoPKc
-FN:185,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERKS2_
-FN:202,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEdeEv
-FN:206,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEppEv
-FN:191,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEaSERKSs
-DA:181,0
-DA:182,0
-DA:185,0
-DA:186,0
-DA:191,0
-DA:196,0
-DA:197,0
-DA:198,0
-DA:202,0
-DA:203,0
-DA:206,0
-DA:207,0
-BA:197,0
-BA:197,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/vector.tcc
-FN:283,_ZNSt6vectorIcSaIcEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPcS1_EERKc
-FN:283,_ZNSt6vectorIPN6wibble11commandline6OptionESaIS3_EE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPS3_S5_EERKS3_
-FN:283,_ZNSt6vectorISsSaISsEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPSsS1_EERKSs
-DA:283,0
-DA:286,0
-DA:288,0
-DA:291,0
-DA:293,0
-DA:295,0
-DA:299,0
-DA:307,0
-DA:308,0
-DA:309,0
-DA:316,0
-DA:321,0
-DA:323,0
-DA:324,0
-DA:330,0
-DA:332,0
-DA:333,0
-DA:334,0
-DA:336,0
-DA:338,0
-DA:341,0
-DA:342,0
-DA:343,0
-DA:345,0
-BA:286,0
-BA:286,0
-BA:286,0
-BA:286,0
-BA:286,0
-BA:286,0
-LF:24
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/exception
-FN:59,_ZNSt9exceptionC2Ev
-DA:59,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:107,_ZN9__gnu_cxx13new_allocatorIcE9constructEPcRKc
-FN:107,_ZN9__gnu_cxx13new_allocatorIPN6wibble11commandline6OptionEE9constructEPS4_RKS4_
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIPN6wibble11commandline7ManagedEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKcPN6wibble11commandline6OptionEEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsPN6wibble11commandline6OptionEEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsPN6wibble11commandline6EngineEEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt10_List_nodeISsEED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:118,_ZN9__gnu_cxx13new_allocatorIPN6wibble11commandline7ManagedEE7destroyEPS4_
-FN:76,_ZN9__gnu_cxx13new_allocatorIPN6wibble11commandline6OptionEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIPN6wibble11commandline11OptionGroupEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIPN6wibble11commandline6EngineEED2Ev
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKcPN6wibble11commandline6OptionEEE7destroyEPS7_
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISsE8max_sizeEv
-FN:107,_ZN9__gnu_cxx13new_allocatorIPN6wibble11commandline7ManagedEE9constructEPS4_RKS4_
-FN:76,_ZN9__gnu_cxx13new_allocatorIPN6wibble11commandline7ManagedEED2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorIcE8max_sizeEv
-FN:69,_ZN9__gnu_cxx13new_allocatorIPN6wibble11commandline6OptionEEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorIPN6wibble11commandline6OptionEE8max_sizeEv
-FN:69,_ZN9__gnu_cxx13new_allocatorIPN6wibble11commandline11OptionGroupEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorIPN6wibble11commandline6EngineEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKcPN6wibble11commandline6OptionEEEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKcPN6wibble11commandline6OptionEEED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsPN6wibble11commandline6OptionEEEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsPN6wibble11commandline6OptionEEED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsPN6wibble11commandline6EngineEEEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsPN6wibble11commandline6EngineEEED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt10_List_nodeISsEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIPN6wibble11commandline7ManagedEEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorIPN6wibble11commandline7ManagedEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKcPN6wibble11commandline6OptionEEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsPN6wibble11commandline6OptionEEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsPN6wibble11commandline6EngineEEEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIPN6wibble11commandline7ManagedEEE8max_sizeEv
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIPN6wibble11commandline7ManagedEEE10deallocateEPS6_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsPN6wibble11commandline6EngineEEEE10deallocateEPS9_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsPN6wibble11commandline6OptionEEEE10deallocateEPS9_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKcPN6wibble11commandline6OptionEEEE10deallocateEPS9_j
-FN:97,_ZN9__gnu_cxx13new_allocatorIPN6wibble11commandline6EngineEE10deallocateEPS4_j
-FN:97,_ZN9__gnu_cxx13new_allocatorIPN6wibble11commandline6OptionEE10deallocateEPS4_j
-FN:97,_ZN9__gnu_cxx13new_allocatorIPN6wibble11commandline11OptionGroupEE10deallocateEPS4_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISt10_List_nodeISsEE10deallocateEPS2_j
-FN:97,_ZN9__gnu_cxx13new_allocatorIcE10deallocateEPcj
-FN:107,_ZN9__gnu_cxx13new_allocatorISsE9constructEPSsRKSs
-FN:87,_ZN9__gnu_cxx13new_allocatorIcE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorISsE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIPN6wibble11commandline7ManagedEEE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorIPN6wibble11commandline6OptionEE8allocateEjPKv
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsPN6wibble11commandline6EngineEEE7destroyEPS7_
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsPN6wibble11commandline6OptionEEE7destroyEPS7_
-FN:118,_ZN9__gnu_cxx13new_allocatorISsE7destroyEPSs
-DA:69,0
-DA:71,0
-DA:76,0
-DA:87,0
-DA:89,0
-DA:90,0
-DA:92,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:107,0
-DA:108,0
-DA:118,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:108,0
-BA:108,0
-BA:108,0
-BA:108,0
-BA:108,0
-BA:108,0
-BA:108,0
-BA:108,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/istream
-FN:585,_ZNSiC2Ev
-FN:105,_ZNSiD2Ev
-FN:804,_ZNSdC2Ev
-FN:801,_ZNSdD2Ev
-DA:105,0
-DA:106,0
-DA:585,0
-DA:586,0
-DA:587,0
-DA:801,0
-DA:804,0
-DA:805,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-DA:95,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:555,_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:509,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:536,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEED1Ev
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:509,0
-DA:510,0
-DA:511,0
-DA:536,0
-DA:537,0
-DA:555,0
-DA:556,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/operators.h
-FN:109,_ZN6wibble9operatorsoRIiEERSt3setIT_St4lessIS3_ESaIS3_EES8_RKNS_5EmptyIS3_EE
-FN:177,_ZN6wibble9operatorsmIIiEERSt3setIT_St4lessIS3_ESaIS3_EES8_RKNS_5EmptyIS3_EE
-FN:123,_ZN6wibble9operatorsoRIiNS_9SingletonIiEEEERSt3setIT_St4lessIS5_ESaIS5_EESA_RKT0_
-FN:115,_ZN6wibble9operatorsoRIiEERSt3setIT_St4lessIS3_ESaIS3_EES8_RKS3_
-FN:225,_ZN6wibble9operatorsleIiEEbRKSt3setIT_St4lessIS3_ESaIS3_EES9_
-FN:36,_ZN6wibble9operatorsanIiEESt3setIT_St4lessIS3_ESaIS3_EERKS7_S9_
-FN:74,_ZN6wibble9operatorsorIiEESt3setIT_St4lessIS3_ESaIS3_EERKS7_S9_
-FN:82,_ZN6wibble9operatorsmiIiEESt3setIT_St4lessIS3_ESaIS3_EERKS7_S9_
-FN:133,_ZN6wibble9operatorsoRIiEERSt3setIT_St4lessIS3_ESaIS3_EES8_RKS7_
-FN:62,_ZN6wibble9operatorsorIiEESt3setIT_St4lessIS3_ESaIS3_EERKS7_RKNS_5EmptyIS3_EE
-FN:67,_ZN6wibble9operatorsorIiEESt3setIT_St4lessIS3_ESaIS3_EERKS7_RKNS_9SingletonIS3_EE
-FN:104,_ZN6wibble9operatorsmiIiEESt3setIT_St4lessIS3_ESaIS3_EERKS7_RKNS_5EmptyIS3_EE
-FN:145,_ZN6wibble9operatorsaNIiSt3setIiSt4lessIiESaIiEEEERS2_IT_S3_IS7_ESaIS7_EESB_RKT0_
-FN:198,_ZN6wibble9operatorsmIIiSt3setIiSt4lessIiESaIiEEEERS2_IT_S3_IS7_ESaIS7_EESB_RKT0_
-FN:97,_ZN6wibble9operatorsmiIiEESt3setIT_St4lessIS3_ESaIS3_EERKS7_RKNS_9SingletonIS3_EE
-FN:190,_ZN6wibble9operatorsmIIiEERSt3setIT_St4lessIS3_ESaIS3_EES8_RKNS_9SingletonIS3_EE
-DA:36,2
-DA:37,2
-DA:38,2
-DA:40,0
-DA:62,1
-DA:63,1
-DA:67,1
-DA:68,1
-DA:69,1
-DA:70,0
-DA:74,1
-DA:75,1
-DA:76,1
-DA:78,0
-DA:82,1
-DA:83,1
-DA:84,1
-DA:86,0
-DA:97,1
-DA:98,1
-DA:99,1
-DA:100,0
-DA:104,1
-DA:105,1
-DA:109,1
-DA:111,1
-DA:115,1
-DA:117,1
-DA:118,1
-DA:123,1
-DA:125,2
-DA:127,1
-DA:128,1
-DA:133,1
-DA:134,1
-DA:135,0
-DA:137,3
-DA:139,2
-DA:140,1
-DA:145,2
-DA:147,2
-DA:149,0
-DA:150,0
-DA:153,2
-DA:154,2
-DA:155,9
-DA:157,5
-DA:159,1
-DA:161,4
-DA:163,1
-DA:164,1
-DA:165,1
-DA:169,3
-DA:170,3
-DA:173,2
-DA:177,1
-DA:179,1
-DA:190,1
-DA:192,1
-DA:193,1
-DA:198,1
-DA:200,1
-DA:201,1
-DA:202,5
-DA:204,3
-DA:206,2
-DA:207,2
-DA:208,2
-DA:209,2
-DA:211,1
-DA:212,1
-DA:214,0
-DA:216,1
-DA:225,2
-DA:226,2
-DA:228,2
-DA:229,0
-DA:230,0
-DA:231,0
-DA:232,0
-DA:233,0
-DA:234,0
-DA:236,2
-BA:125,2
-BA:125,2
-BA:134,1
-BA:134,2
-BA:137,2
-BA:137,2
-BA:147,1
-BA:147,2
-BA:155,2
-BA:155,2
-BA:157,2
-BA:157,2
-BA:157,2
-BA:157,2
-BA:157,2
-BA:157,2
-BA:161,2
-BA:161,2
-BA:161,1
-BA:161,2
-BA:161,2
-BA:161,2
-BA:202,2
-BA:202,2
-BA:202,2
-BA:202,1
-BA:202,2
-BA:202,2
-BA:204,2
-BA:204,2
-BA:211,2
-BA:211,1
-BA:228,1
-BA:228,2
-BA:229,0
-BA:229,0
-BA:231,0
-BA:231,0
-BA:233,0
-BA:233,0
-LF:83
-LH:68
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/singleton.h
-FN:80,_ZN6wibble9SingletonIiEC1ERKi
-FN:52,_ZNK6wibble9SingletonIiE14const_iteratordeEv
-FN:56,_ZNK6wibble9SingletonIiE14const_iteratorneERKS2_
-FN:54,_ZN6wibble9SingletonIiE14const_iteratorppEv
-FN:47,_ZN6wibble9SingletonIiE14const_iteratorC1EPKi
-FN:87,_ZNK6wibble9SingletonIiE5beginEv
-FN:50,_ZN6wibble9SingletonIiE14const_iteratorC1Ev
-FN:88,_ZNK6wibble9SingletonIiE3endEv
-DA:47,4
-DA:50,2
-DA:52,4
-DA:54,1
-DA:56,2
-DA:80,0
-DA:87,4
-DA:88,2
-LF:8
-LH:7
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:17,_ZN8LocationC1EPKciSs
-FN:13,_ZN8LocationC1ERKS_
-FN:52,_ZlsIPKcER12AssertFailedS3_T_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:41,_ZN12AssertFailedD1Ev
-FN:13,_ZN8LocationD1Ev
-FN:59,_Z9assert_fnIbEv8LocationT_
-FN:52,_ZlsIjER12AssertFailedS1_T_
-FN:67,_Z12assert_eq_fnIjjEv8LocationT_T0_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:59,0
-DA:61,0
-DA:62,0
-DA:64,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:75,0
-BA:42,0
-BA:42,0
-BA:61,0
-BA:61,0
-BA:69,0
-BA:69,0
-LF:26
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/operators.test.h
-FN:16,_ZN12_GLOBAL__N_1L5mksetEii
-FN:12,_ZN12_GLOBAL__N_1L5mksetEi
-FN:117,_ZN12_GLOBAL__N_113TestOperators23mutatingIntersectionBugEv
-FN:111,_ZN12_GLOBAL__N_113TestOperators17emptySetInclusionEv
-FN:77,_ZN12_GLOBAL__N_113TestOperators26specialContainerOperationsEv
-FN:50,_ZN12_GLOBAL__N_113TestOperators21mutatingSetOperationsEv
-FN:33,_ZN12_GLOBAL__N_113TestOperators19binarySetOperationsEv
-DA:12,4
-DA:14,4
-DA:16,3
-DA:18,3
-DA:33,1
-DA:34,1
-DA:35,1
-DA:36,1
-DA:37,1
-DA:38,2
-DA:39,2
-DA:40,2
-DA:41,1
-DA:42,2
-DA:43,2
-DA:44,2
-DA:45,1
-DA:46,2
-DA:47,2
-DA:48,1
-DA:50,1
-DA:51,1
-DA:52,1
-DA:53,1
-DA:54,1
-DA:55,2
-DA:56,2
-DA:57,2
-DA:58,2
-DA:59,1
-DA:60,1
-DA:61,2
-DA:62,2
-DA:63,2
-DA:64,1
-DA:65,1
-DA:66,2
-DA:67,2
-DA:68,2
-DA:69,2
-DA:70,1
-DA:71,1
-DA:72,2
-DA:73,2
-DA:74,2
-DA:75,1
-DA:77,1
-DA:78,1
-DA:80,1
-DA:81,1
-DA:83,2
-DA:84,1
-DA:85,2
-DA:87,2
-DA:88,1
-DA:89,2
-DA:91,2
-DA:92,1
-DA:93,2
-DA:95,1
-DA:96,2
-DA:98,1
-DA:99,1
-DA:100,2
-DA:102,1
-DA:103,2
-DA:104,2
-DA:106,1
-DA:107,1
-DA:108,2
-DA:109,1
-DA:111,1
-DA:112,1
-DA:113,1
-DA:114,2
-DA:115,1
-DA:117,1
-DA:120,1
-DA:121,1
-DA:122,1
-DA:124,1
-DA:125,1
-DA:127,1
-DA:128,1
-DA:129,1
-DA:130,1
-LF:86
-LH:86
-end_of_record
-SF:/srv/build/pkg/ept-work/default/wibble/wibble-test-generated-_home_mornfall_dev_pkg_ept-work_wibble_operators.cpp
-FN:7,_Z41__static_initialization_and_destruction_0ii
-FN:7,_GLOBAL__I__Z33run_Operators_binarySetOperationsv
-FN:7,_Z37run_Operators_mutatingIntersectionBugv
-FN:6,_Z31run_Operators_emptySetInclusionv
-FN:5,_Z40run_Operators_specialContainerOperationsv
-FN:4,_Z35run_Operators_mutatingSetOperationsv
-FN:3,_Z33run_Operators_binarySetOperationsv
-DA:3,1
-DA:4,1
-DA:5,1
-DA:6,1
-DA:7,4
-BA:7,2
-BA:7,1
-BA:7,2
-BA:7,1
-LF:5
-LH:5
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeIiEED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:98,_ZNSaISt13_Rb_tree_nodeIiEEC2Ev
-FN:106,_ZNSaIiED1Ev
-FN:100,_ZNSaISt13_Rb_tree_nodeIiEEC2ERKS1_
-FN:104,_ZNSaIiEC1ISt13_Rb_tree_nodeIiEEERKSaIT_E
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,4
-DA:101,4
-DA:104,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:7
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-LF:51
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algo.h
-FN:5187,_ZSt16set_intersectionISt23_Rb_tree_const_iteratorIiES1_St15insert_iteratorISt3setIiSt4lessIiESaIiEEEET1_T_SA_T0_SB_S9_
-FN:5055,_ZSt9set_unionISt23_Rb_tree_const_iteratorIiES1_St15insert_iteratorISt3setIiSt4lessIiESaIiEEEET1_T_SA_T0_SB_S9_
-FN:5300,_ZSt14set_differenceISt23_Rb_tree_const_iteratorIiES1_St15insert_iteratorISt3setIiSt4lessIiESaIiEEEET1_T_SA_T0_SB_S9_
-DA:5055,1
-DA:5074,4
-DA:5076,2
-DA:5078,1
-DA:5079,1
-DA:5081,1
-DA:5083,0
-DA:5084,0
-DA:5088,1
-DA:5089,1
-DA:5090,1
-DA:5092,2
-DA:5095,1
-DA:5187,2
-DA:5204,8
-DA:5205,4
-DA:5206,1
-DA:5207,3
-DA:5208,1
-DA:5211,2
-DA:5212,2
-DA:5213,2
-DA:5214,2
-DA:5216,2
-DA:5300,1
-DA:5317,4
-DA:5318,2
-DA:5320,1
-DA:5321,1
-DA:5322,1
-DA:5324,1
-DA:5325,0
-DA:5328,1
-DA:5329,1
-DA:5331,1
-BA:5074,2
-BA:5074,2
-BA:5074,2
-BA:5074,1
-BA:5074,2
-BA:5074,2
-BA:5076,2
-BA:5076,2
-BA:5081,1
-BA:5081,2
-BA:5204,2
-BA:5204,2
-BA:5204,2
-BA:5204,1
-BA:5204,2
-BA:5204,2
-BA:5205,2
-BA:5205,2
-BA:5207,2
-BA:5207,2
-BA:5317,2
-BA:5317,2
-BA:5317,2
-BA:5317,1
-BA:5317,2
-BA:5317,2
-BA:5318,2
-BA:5318,2
-BA:5324,1
-BA:5324,2
-LF:35
-LH:32
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseISt23_Rb_tree_const_iteratorIiELb0EE3__bES1_
-FN:268,_ZNSt12__niter_baseISt23_Rb_tree_const_iteratorIiELb0EE3__bES1_
-FN:268,_ZNSt12__niter_baseISt15insert_iteratorISt3setIiSt4lessIiESaIiEEELb0EE3__bES6_
-FN:792,_ZNSt7__equalILb0EE5equalISt23_Rb_tree_const_iteratorIiES3_EEbT_S4_T0_
-FN:815,_ZSt11__equal_auxISt23_Rb_tree_const_iteratorIiES1_EbT_S2_T0_
-FN:944,_ZSt5equalISt23_Rb_tree_const_iteratorIiES1_EbT_S2_T0_
-FN:309,_ZNSt11__copy_moveILb0ELb0ESt26bidirectional_iterator_tagE8__copy_mISt23_Rb_tree_const_iteratorIiESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEET0_T_SD_SC_
-FN:385,_ZSt13__copy_move_aILb0ESt23_Rb_tree_const_iteratorIiESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEET1_T0_SA_S9_
-FN:430,_ZSt14__copy_move_a2ILb0ESt23_Rb_tree_const_iteratorIiESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEET1_T0_SA_S9_
-FN:456,_ZSt4copyISt23_Rb_tree_const_iteratorIiESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEET0_T_SA_S9_
-DA:268,15
-DA:269,15
-DA:286,6
-DA:287,6
-DA:309,3
-DA:311,3
-DA:312,0
-DA:313,3
-DA:385,3
-DA:393,3
-DA:396,3
-DA:430,3
-DA:435,3
-DA:456,3
-DA:466,3
-DA:792,2
-DA:794,4
-DA:795,2
-DA:796,0
-DA:797,2
-DA:815,2
-DA:822,2
-DA:824,2
-DA:944,2
-DA:956,2
-BA:311,1
-BA:311,2
-BA:794,2
-BA:794,2
-BA:795,1
-BA:795,2
-LF:25
-LH:23
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_function.h
-FN:469,_ZNKSt9_IdentityIiEclERKi
-FN:229,_ZNKSt4lessIiEclERKiS2_
-DA:229,0
-DA:230,0
-DA:469,0
-DA:470,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:572,_ZNSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEC1ERS4_St23_Rb_tree_const_iteratorIiE
-FN:645,_ZSt8inserterISt3setIiSt4lessIiESaIiEESt23_Rb_tree_const_iteratorIiEESt15insert_iteratorIT_ERS8_T0_
-FN:618,_ZNSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEdeEv
-FN:623,_ZNSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEppEv
-FN:599,_ZNSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEaSERKi
-DA:572,0
-DA:573,0
-DA:599,0
-DA:601,0
-DA:602,0
-DA:603,0
-DA:618,0
-DA:619,0
-DA:623,0
-DA:624,0
-DA:645,0
-DA:648,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:111,_ZNSt8iteratorISt20forward_iterator_tagKivPS1_RS1_EC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,6
-DA:166,0
-DA:167,0
-LF:3
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_pair.h
-FN:88,_ZNSt4pairISt23_Rb_tree_const_iteratorIiEbEC1ERKS1_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIiEbEC1ERKS1_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIiES1_EC1ERKS1_S4_
-DA:88,17
-DA:89,17
-LF:2
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_set.h
-FN:336,_ZNKSt3setIiSt4lessIiESaIiEE4sizeEv
-FN:270,_ZNKSt3setIiSt4lessIiESaIiEE3endEv
-FN:261,_ZNKSt3setIiSt4lessIiESaIiEE5beginEv
-FN:331,_ZNKSt3setIiSt4lessIiESaIiEE5emptyEv
-FN:503,_ZNSt3setIiSt4lessIiESaIiEE4findERKi
-FN:141,_ZNSt3setIiSt4lessIiESaIiEEC1Ev
-FN:378,_ZNSt3setIiSt4lessIiESaIiEE6insertERKi
-FN:405,_ZNSt3setIiSt4lessIiESaIiEE6insertESt23_Rb_tree_const_iteratorIiERKi
-FN:596,_ZSteqIiSt4lessIiESaIiEEbRKSt3setIT_T0_T1_ES9_
-FN:471,_ZNSt3setIiSt4lessIiESaIiEE5clearEv
-FN:93,_ZNSt3setIiSt4lessIiESaIiEED1Ev
-FN:216,_ZNSt3setIiSt4lessIiESaIiEEaSERKS3_
-FN:193,_ZNSt3setIiSt4lessIiESaIiEEC1ERKS3_
-FN:431,_ZNSt3setIiSt4lessIiESaIiEE5eraseESt23_Rb_tree_const_iteratorIiE
-FN:446,_ZNSt3setIiSt4lessIiESaIiEE5eraseERKi
-DA:93,0
-DA:141,0
-DA:142,0
-DA:193,4
-DA:194,4
-DA:216,7
-DA:218,7
-DA:219,7
-DA:261,0
-DA:262,0
-DA:270,0
-DA:271,0
-DA:331,0
-DA:332,0
-DA:336,15
-DA:337,15
-DA:378,15
-DA:381,15
-DA:382,15
-DA:405,0
-DA:406,0
-DA:431,3
-DA:432,3
-DA:446,2
-DA:447,2
-DA:471,0
-DA:472,0
-DA:503,25
-DA:504,25
-DA:596,2
-DA:597,2
-LF:31
-LH:18
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_tree.h
-FN:103,_ZNSt18_Rb_tree_node_base10_S_minimumEPS_
-FN:117,_ZNSt18_Rb_tree_node_base10_S_maximumEPS_
-FN:285,_ZNKSt23_Rb_tree_const_iteratorIiEeqERKS0_
-FN:289,_ZNKSt23_Rb_tree_const_iteratorIiEneERKS0_
-FN:452,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_M_beginEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorIiEC1ERKSt17_Rb_tree_iteratorIiE
-FN:641,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE4sizeEv
-FN:247,_ZNKSt23_Rb_tree_const_iteratorIiEdeEv
-FN:398,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_Rb_tree_implIS3_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE7_S_leftEPSt18_Rb_tree_node_base
-FN:463,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE6_M_endEv
-FN:168,_ZNSt17_Rb_tree_iteratorIiEC1EPSt13_Rb_tree_nodeIiE
-FN:596,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorIiEeqERKS0_
-FN:347,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE21_M_get_Node_allocatorEv
-FN:432,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE7_M_rootEv
-FN:456,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_M_beginEv
-FN:428,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE7_M_rootEv
-FN:503,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE10_S_minimumEPSt18_Rb_tree_node_base
-FN:436,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE11_M_leftmostEv
-FN:511,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE10_S_maximumEPSt18_Rb_tree_node_base
-FN:444,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE12_M_rightmostEv
-FN:610,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE3endEv
-FN:240,_ZNSt23_Rb_tree_const_iteratorIiEC1EPKSt13_Rb_tree_nodeIiE
-FN:614,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE3endEv
-FN:603,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5beginEv
-FN:637,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5emptyEv
-FN:491,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_S_rightEPKSt18_Rb_tree_node_base
-FN:415,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_Rb_tree_implIS3_Lb0EE13_M_initializeEv
-FN:471,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_S_valueEPKSt13_Rb_tree_nodeIiE
-FN:475,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE6_S_keyEPKSt13_Rb_tree_nodeIiE
-FN:954,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE14_M_lower_boundEPSt13_Rb_tree_nodeIiES8_RKi
-FN:495,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE6_S_keyEPKSt18_Rb_tree_node_base
-FN:1390,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE4findERKi
-FN:483,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE7_S_leftEPKSt18_Rb_tree_node_base
-FN:403,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_Rb_tree_implIS3_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEEC1Ev
-FN:408,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_Rb_tree_implIS3_Lb0EEC1ERKS3_RKSaISt13_Rb_tree_nodeIiEE
-FN:986,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE14_M_upper_boundEPSt13_Rb_tree_nodeIiES8_RKi
-FN:1019,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE11equal_rangeERKi
-FN:214,_ZNKSt17_Rb_tree_iteratorIiEneERKS0_
-FN:351,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13get_allocatorEv
-FN:270,_ZNSt23_Rb_tree_const_iteratorIiEmmEv
-FN:356,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE14_M_create_nodeERKi
-FN:846,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE10_M_insert_EPKSt18_Rb_tree_node_baseS8_RKi
-FN:378,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_M_clone_nodeEPKSt13_Rb_tree_nodeIiE
-FN:195,_ZNSt17_Rb_tree_iteratorIiEmmEv
-FN:1133,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE16_M_insert_uniqueERKi
-FN:255,_ZNSt23_Rb_tree_const_iteratorIiEppEv
-FN:1178,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE17_M_insert_unique_ESt23_Rb_tree_const_iteratorIiERKi
-FN:745,_ZSteqIiiSt9_IdentityIiESt4lessIiESaIiEEbRKSt8_Rb_treeIT_T0_T1_T2_T3_ESD_
-FN:360,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE11_M_put_nodeEPSt13_Rb_tree_nodeIiE
-FN:388,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE15_M_destroy_nodeEPSt13_Rb_tree_nodeIiE
-FN:936,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_M_eraseEPSt13_Rb_tree_nodeIiE
-FN:695,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5clearEv
-FN:584,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEED1Ev
-FN:900,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE7_M_copyEPKSt13_Rb_tree_nodeIiEPS7_
-FN:824,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEEaSERKS5_
-FN:568,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEEC1ERKS5_
-FN:1327,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5eraseESt23_Rb_tree_const_iteratorIiE
-FN:1313,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5eraseESt17_Rb_tree_iteratorIiE
-FN:187,_ZNSt17_Rb_tree_iteratorIiEppEi
-FN:1353,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5eraseESt17_Rb_tree_iteratorIiES7_
-FN:1341,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5eraseERKi
-DA:103,7
-DA:105,7
-DA:106,7
-DA:117,7
-DA:119,7
-DA:120,7
-DA:168,0
-DA:169,0
-DA:187,0
-DA:189,0
-DA:190,0
-DA:195,0
-DA:197,0
-DA:198,0
-DA:210,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:240,0
-DA:241,0
-DA:243,0
-DA:244,0
-DA:247,0
-DA:248,0
-DA:255,0
-DA:257,0
-DA:258,0
-DA:270,0
-DA:272,0
-DA:273,0
-DA:285,0
-DA:286,0
-DA:289,0
-DA:290,0
-DA:347,0
-DA:348,0
-DA:351,0
-DA:352,0
-DA:356,0
-DA:357,0
-DA:360,0
-DA:361,0
-DA:364,0
-DA:366,0
-DA:368,0
-DA:374,0
-DA:378,8
-DA:380,8
-DA:381,8
-DA:382,8
-DA:383,8
-DA:384,8
-DA:388,0
-DA:390,0
-DA:391,0
-DA:392,0
-DA:398,0
-DA:403,0
-DA:405,0
-DA:406,0
-DA:408,4
-DA:410,4
-DA:411,4
-DA:415,0
-DA:417,0
-DA:418,0
-DA:419,0
-DA:420,0
-DA:421,0
-DA:428,30
-DA:429,30
-DA:432,11
-DA:433,11
-DA:436,0
-DA:437,0
-DA:444,0
-DA:445,0
-DA:452,0
-DA:453,0
-DA:456,7
-DA:459,7
-DA:463,0
-DA:464,0
-DA:471,0
-DA:472,0
-DA:475,0
-DA:476,0
-DA:479,0
-DA:480,0
-DA:483,8
-DA:484,8
-DA:487,0
-DA:488,0
-DA:491,0
-DA:492,0
-DA:495,0
-DA:496,0
-DA:499,0
-DA:500,0
-DA:503,7
-DA:504,7
-DA:511,7
-DA:512,7
-DA:562,0
-DA:568,4
-DA:569,4
-DA:571,4
-DA:573,2
-DA:574,2
-DA:575,2
-DA:576,2
-DA:578,4
-DA:584,0
-DA:585,0
-DA:596,0
-DA:599,0
-DA:603,0
-DA:606,0
-DA:610,36
-DA:611,36
-DA:614,0
-DA:617,0
-DA:637,0
-DA:638,0
-DA:641,0
-DA:642,0
-DA:695,9
-DA:697,9
-DA:698,9
-DA:699,9
-DA:700,9
-DA:701,9
-DA:702,9
-DA:745,2
-DA:748,2
-DA:824,7
-DA:826,7
-DA:829,7
-DA:830,7
-DA:831,7
-DA:833,5
-DA:834,5
-DA:835,5
-DA:836,5
-DA:839,7
-DA:846,0
-DA:850,0
-DA:852,0
-DA:854,0
-DA:857,0
-DA:858,0
-DA:900,8
-DA:903,8
-DA:904,8
-DA:908,8
-DA:909,1
-DA:910,8
-DA:911,8
-DA:913,16
-DA:915,0
-DA:916,0
-DA:917,0
-DA:918,0
-DA:919,0
-DA:920,0
-DA:921,0
-DA:924,0
-DA:926,0
-DA:927,0
-DA:929,8
-DA:936,0
-DA:939,0
-DA:941,0
-DA:942,0
-DA:943,0
-DA:944,0
-DA:946,0
-DA:954,27
-DA:956,87
-DA:957,33
-DA:958,23
-DA:960,10
-DA:961,27
-DA:986,2
-DA:988,4
-DA:989,0
-DA:990,0
-DA:992,0
-DA:993,2
-DA:1019,2
-DA:1021,2
-DA:1022,2
-DA:1023,4
-DA:1025,2
-DA:1026,0
-DA:1027,2
-DA:1028,0
-DA:1031,2
-DA:1032,2
-DA:1033,2
-DA:1036,2
-DA:1040,0
-DA:1133,0
-DA:1135,0
-DA:1136,0
-DA:1137,0
-DA:1138,0
-DA:1140,0
-DA:1141,0
-DA:1142,0
-DA:1144,0
-DA:1145,0
-DA:1147,0
-DA:1148,0
-DA:1150,0
-DA:1152,0
-DA:1153,0
-DA:1154,0
-DA:1178,0
-DA:1181,0
-DA:1183,0
-DA:1186,0
-DA:1188,0
-DA:1190,0
-DA:1194,0
-DA:1195,0
-DA:1196,0
-DA:1197,0
-DA:1200,0
-DA:1201,0
-DA:1204,0
-DA:1207,0
-DA:1209,0
-DA:1213,0
-DA:1214,0
-DA:1215,0
-DA:1216,0
-DA:1219,0
-DA:1220,0
-DA:1222,0
-DA:1225,0
-DA:1230,0
-DA:1313,0
-DA:1318,0
-DA:1319,0
-DA:1320,0
-DA:1321,0
-DA:1327,3
-DA:1332,3
-DA:1333,3
-DA:1334,3
-DA:1335,3
-DA:1341,2
-DA:1343,2
-DA:1344,2
-DA:1345,2
-DA:1346,2
-DA:1353,2
-DA:1355,2
-DA:1356,2
-DA:1358,0
-DA:1359,0
-DA:1360,2
-DA:1390,25
-DA:1392,25
-DA:1395,25
-BA:105,1
-BA:105,2
-BA:119,2
-BA:119,2
-BA:571,2
-BA:571,2
-BA:748,2
-BA:748,1
-BA:748,2
-BA:748,1
-BA:826,2
-BA:826,1
-BA:831,2
-BA:831,2
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:908,2
-BA:908,2
-BA:913,1
-BA:913,2
-BA:918,0
-BA:918,0
-BA:939,0
-BA:939,0
-BA:956,2
-BA:956,2
-BA:957,2
-BA:957,2
-BA:988,1
-BA:988,2
-BA:989,0
-BA:989,0
-BA:1023,2
-BA:1023,1
-BA:1025,1
-BA:1025,2
-BA:1027,1
-BA:1027,2
-BA:1138,0
-BA:1138,0
-BA:1142,0
-BA:1142,0
-BA:1145,0
-BA:1145,0
-BA:1147,0
-BA:1147,0
-BA:1152,0
-BA:1152,0
-BA:1181,0
-BA:1181,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1190,0
-BA:1190,0
-BA:1195,0
-BA:1195,0
-BA:1197,0
-BA:1197,0
-BA:1200,0
-BA:1200,0
-BA:1209,0
-BA:1209,0
-BA:1214,0
-BA:1214,0
-BA:1216,0
-BA:1216,0
-BA:1219,0
-BA:1219,0
-BA:1355,2
-BA:1355,1
-BA:1355,2
-BA:1355,1
-BA:1355,2
-BA:1355,1
-BA:1358,0
-BA:1358,0
-BA:1395,2
-BA:1395,2
-BA:1395,2
-BA:1395,2
-LF:266
-LH:101
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:118,_ZN9__gnu_cxx13new_allocatorIiE7destroyEPi
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIiED2Ev
-FN:107,_ZN9__gnu_cxx13new_allocatorIiE9constructEPiRKi
-FN:71,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEEC2ERKS3_
-FN:69,_ZN9__gnu_cxx13new_allocatorIiEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEE8max_sizeEv
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEE8allocateEjPKv
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEE10deallocateEPS2_j
-DA:69,0
-DA:71,4
-DA:76,0
-DA:87,0
-DA:89,0
-DA:90,0
-DA:92,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:107,0
-DA:108,0
-DA:118,0
-BA:89,0
-BA:89,0
-BA:108,0
-BA:108,0
-LF:14
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-DA:105,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:195,_ZNSolsEj
-DA:95,0
-DA:112,0
-DA:117,0
-DA:195,0
-DA:199,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/exception.h
-FN:190,_ZNK6wibble9exception7Generic4typeEv
-FN:193,_ZNK6wibble9exception7Generic4descEv
-FN:213,_ZNK6wibble9exception7Generic4whatEv
-FN:154,_ZNK6wibble9exception7Context13formatContextEv
-FN:205,_ZNK6wibble9exception7Generic8fullInfoEv
-FN:137,_ZN6wibble9exception7ContextD2Ev
-FN:187,_ZN6wibble9exception7GenericD2Ev
-FN:395,_ZN6wibble9exception6SystemD1Ev
-FN:187,_ZN6wibble9exception7GenericD0Ev
-FN:187,_ZN6wibble9exception7GenericD1Ev
-DA:137,0
-DA:154,0
-DA:155,0
-DA:156,0
-DA:157,0
-DA:159,0
-DA:161,0
-DA:162,0
-DA:163,0
-DA:187,0
-DA:190,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:205,0
-DA:206,0
-DA:207,0
-DA:209,0
-DA:210,0
-DA:213,0
-DA:395,0
-BA:156,0
-BA:156,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:207,0
-BA:207,0
-BA:395,0
-BA:395,0
-LF:21
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/sys/mutex.h
-FN:40,_ZN6wibble3sys5MutexC1Eb
-FN:72,_ZN6wibble3sys5Mutex4lockEv
-FN:105,_ZN6wibble3sys9MutexLockC1ERNS0_5MutexE
-FN:80,_ZN6wibble3sys5Mutex6unlockEv
-FN:106,_ZN6wibble3sys9MutexLockD1Ev
-FN:54,_ZN6wibble3sys5MutexD1Ev
-DA:40,1
-DA:43,1
-DA:44,1
-DA:48,0
-DA:51,1
-DA:52,0
-DA:53,1
-DA:54,1
-DA:56,1
-DA:57,0
-DA:58,1
-DA:72,214954
-DA:74,214954
-DA:75,0
-DA:76,214954
-DA:80,214954
-DA:82,214954
-DA:83,0
-DA:84,214954
-DA:105,214954
-DA:106,214954
-BA:44,1
-BA:44,2
-BA:51,1
-BA:51,2
-BA:56,1
-BA:56,2
-BA:74,1
-BA:74,2
-BA:82,1
-BA:82,2
-LF:21
-LH:16
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/sys/thread.h
-FN:77,_ZN6wibble3sys6Thread9threadTagEv
-FN:69,_ZN6wibble3sys6ThreadC2Ev
-FN:91,_ZN6wibble3sys6ThreadD2Ev
-FN:91,_ZN6wibble3sys6ThreadD0Ev
-FN:91,_ZN6wibble3sys6ThreadD1Ev
-DA:69,2
-DA:77,0
-DA:91,2
-BA:91,1
-BA:91,2
-BA:91,0
-BA:91,0
-BA:91,0
-BA:91,0
-LF:3
-LH:2
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:52,_ZlsIPKcER12AssertFailedS3_T_
-FN:17,_ZN8LocationC1EPKciSs
-FN:13,_ZN8LocationC1ERKS_
-FN:52,_ZlsIiER12AssertFailedS1_T_
-FN:52,_ZlsIPvER12AssertFailedS2_T_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:41,_ZN12AssertFailedD1Ev
-FN:13,_ZN8LocationD1Ev
-FN:67,_Z12assert_eq_fnIPvS0_Ev8LocationT_T0_
-FN:67,_Z12assert_eq_fnIiiEv8LocationT_T0_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:67,4
-DA:69,4
-DA:70,0
-DA:71,0
-DA:75,4
-BA:42,0
-BA:42,0
-BA:69,1
-BA:69,2
-BA:69,0
-BA:69,0
-LF:22
-LH:3
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/sys/thread.test.h
-FN:21,_ZN10TestThread7Thread14mainEv
-FN:27,_ZN10TestThread7Thread1C1ERii
-FN:49,_ZN10TestThread7Thread2C1ERiRN6wibble3sys5MutexE
-FN:51,_ZN10TestThread7Thread24quitEv
-FN:32,_ZN10TestThread7Thread2D0Ev
-FN:32,_ZN10TestThread7Thread2D1Ev
-FN:16,_ZN10TestThread7Thread1D0Ev
-FN:16,_ZN10TestThread7Thread1D1Ev
-FN:38,_ZN10TestThread7Thread24mainEv
-FN:55,_ZN10TestThread9executionEv
-FN:65,_ZN10TestThread12sharedMemoryEv
-DA:16,1
-DA:21,1
-DA:23,1
-DA:24,1
-DA:27,1
-DA:32,1
-DA:38,1
-DA:40,214954
-DA:42,214953
-DA:43,214953
-DA:45,1
-DA:49,1
-DA:50,1
-DA:51,1
-DA:55,1
-DA:56,1
-DA:58,1
-DA:59,1
-DA:60,1
-DA:61,2
-DA:62,1
-DA:65,1
-DA:66,1
-DA:67,1
-DA:69,1
-DA:70,1
-DA:72,1
-DA:73,2
-DA:75,1
-DA:76,1
-DA:77,1
-DA:79,1
-DA:80,1
-DA:81,1
-BA:16,0
-BA:16,0
-BA:16,1
-BA:16,2
-BA:32,0
-BA:32,0
-BA:32,1
-BA:32,2
-BA:40,2
-BA:40,2
-BA:73,2
-BA:73,2
-BA:76,2
-BA:76,1
-LF:34
-LH:34
-end_of_record
-SF:/srv/build/pkg/ept-work/default/wibble/wibble-test-generated-_home_mornfall_dev_pkg_ept-work_wibble_sys_thread.cpp
-FN:4,_Z41__static_initialization_and_destruction_0ii
-FN:4,_GLOBAL__I__Z20run_Thread_executionv
-FN:3,_Z20run_Thread_executionv
-FN:4,_Z23run_Thread_sharedMemoryv
-DA:3,1
-DA:4,4
-BA:4,2
-BA:4,1
-BA:4,2
-BA:4,1
-LF:2
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaIcED1Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaISsED2Ev
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:1534,_ZNKSs5c_strEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:612,_ZNKSs6lengthEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:835,_ZNSs6appendEPKc
-FN:501,_ZNSsaSERKSs
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2121,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:612,0
-DA:613,0
-DA:686,0
-DA:687,0
-DA:835,0
-DA:838,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2121,0
-DA:2123,0
-DA:2124,0
-DA:2125,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-LF:67
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb0EE3__bES7_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb1EE3__bES7_
-FN:268,_ZNSt12__niter_baseISt16ostream_iteratorISscSt11char_traitsIcEELb0EE3__bES3_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPKSsSt16ostream_iteratorISscSt11char_traitsIcEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPKSsSt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_SD_SC_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET0_T_SD_SC_
-DA:268,0
-DA:269,0
-DA:276,0
-DA:277,0
-DA:286,0
-DA:287,0
-DA:337,0
-DA:340,0
-DA:342,0
-DA:343,0
-DA:344,0
-DA:346,0
-DA:385,0
-DA:393,0
-DA:396,0
-DA:430,0
-DA:435,0
-DA:456,0
-DA:466,0
-BA:340,0
-BA:340,0
-LF:19
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-DA:87,0
-DA:88,0
-DA:97,0
-DA:101,0
-DA:103,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-BA:101,0
-BA:101,0
-LF:9
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEC1ERKS2_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-DA:683,0
-DA:747,0
-DA:748,0
-DA:769,0
-DA:770,0
-LF:5
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,0
-DA:166,0
-DA:167,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:404,_ZNKSt6vectorISsSaISsEE3endEv
-FN:386,_ZNKSt6vectorISsSaISsEE5beginEv
-FN:526,_ZNKSt6vectorISsSaISsEE5emptyEv
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-DA:79,0
-DA:97,0
-DA:98,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:299,0
-DA:300,0
-DA:301,0
-DA:386,0
-DA:387,0
-DA:404,0
-DA:405,0
-DA:526,0
-DA:527,0
-BA:149,0
-BA:149,0
-LF:19
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stream_iterator.h
-FN:181,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERSoPKc
-FN:185,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERKS2_
-FN:202,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEdeEv
-FN:206,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEppEv
-FN:191,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEaSERKSs
-DA:181,0
-DA:182,0
-DA:185,0
-DA:186,0
-DA:191,0
-DA:196,0
-DA:197,0
-DA:198,0
-DA:202,0
-DA:203,0
-DA:206,0
-DA:207,0
-BA:197,0
-BA:197,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-DA:69,0
-DA:71,0
-DA:76,0
-DA:97,0
-DA:98,0
-LF:5
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/istream
-FN:585,_ZNSiC2Ev
-FN:105,_ZNSiD2Ev
-FN:804,_ZNSdC2Ev
-FN:801,_ZNSdD2Ev
-DA:105,0
-DA:106,0
-DA:585,0
-DA:586,0
-DA:587,0
-DA:801,0
-DA:804,0
-DA:805,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:229,_ZNSolsEPKv
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-DA:95,0
-DA:112,0
-DA:117,0
-DA:229,0
-DA:230,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:509,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:536,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:555,_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-DA:509,0
-DA:510,0
-DA:511,0
-DA:536,0
-DA:537,0
-DA:555,0
-DA:556,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-LF:25
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/commandline/core.h
-FN:30,_ZN6wibble11commandline7ArgListC1Ev
-FN:34,_ZN6wibble11commandline7ArgList15eraseAndAdvanceERSt14_List_iteratorISsE
-FN:30,_ZN6wibble11commandline7ArgListD1Ev
-DA:30,0
-DA:34,0
-DA:36,0
-DA:37,0
-DA:38,0
-DA:39,0
-DA:40,0
-DA:41,0
-DA:42,0
-BA:36,0
-BA:36,0
-LF:9
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:13,_ZN8LocationC1ERKS_
-FN:17,_ZN8LocationC1EPKciSs
-FN:52,_ZlsIPKcER12AssertFailedS3_T_
-FN:52,_ZlsIjER12AssertFailedS1_T_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:41,_ZN12AssertFailedD1Ev
-FN:13,_ZN8LocationD1Ev
-FN:67,_Z12assert_eq_fnIjjEv8LocationT_T0_
-FN:59,_Z9assert_fnIbEv8LocationT_
-FN:52,_ZlsIbER12AssertFailedS1_T_
-FN:67,_Z12assert_eq_fnIbbEv8LocationT_T0_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:59,0
-DA:61,0
-DA:62,0
-DA:64,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:75,0
-BA:42,0
-BA:42,0
-BA:61,0
-BA:61,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-LF:26
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/commandline/core.test.h
-FN:24,_ZN19TestCommandlineCore15eraseAndAdvanceEv
-FN:12,_ZN19TestCommandlineCore8isSwitchEv
-DA:12,1
-DA:13,1
-DA:14,2
-DA:15,2
-DA:16,2
-DA:17,2
-DA:18,2
-DA:19,2
-DA:20,2
-DA:21,2
-DA:22,1
-DA:24,1
-DA:26,1
-DA:27,1
-DA:28,2
-DA:29,2
-DA:31,1
-DA:32,1
-DA:34,1
-DA:35,1
-DA:36,2
-DA:38,1
-DA:39,1
-DA:40,2
-DA:42,1
-DA:43,1
-DA:44,2
-DA:45,2
-DA:46,1
-LF:29
-LH:29
-end_of_record
-SF:/srv/build/pkg/ept-work/default/wibble/wibble-test-generated-_home_mornfall_dev_pkg_ept-work_wibble_commandline_core.cpp
-FN:4,_Z41__static_initialization_and_destruction_0ii
-FN:4,_GLOBAL__I__Z28run_CommandlineCore_isSwitchv
-FN:4,_Z35run_CommandlineCore_eraseAndAdvancev
-FN:3,_Z28run_CommandlineCore_isSwitchv
-DA:3,1
-DA:4,4
-BA:4,2
-BA:4,1
-BA:4,2
-BA:4,1
-LF:2
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaISt10_List_nodeISsEED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaISsED1Ev
-FN:104,_ZNSaISsEC1ISt10_List_nodeISsEEERKSaIT_E
-FN:98,_ZNSaISt10_List_nodeISsEEC2Ev
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:104,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:7
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-LF:51
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/list.tcc
-FN:109,_ZNSt4listISsSaISsEE5eraseESt14_List_iteratorISsE
-FN:70,_ZNSt10_List_baseISsSaISsEE8_M_clearEv
-DA:70,0
-DA:73,0
-DA:74,0
-DA:76,0
-DA:77,0
-DA:78,0
-DA:79,0
-DA:81,0
-DA:109,0
-DA:111,0
-DA:112,0
-BA:74,0
-BA:74,0
-LF:11
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:76,_ZSt10__distanceISt20_List_const_iteratorISsEENSt15iterator_traitsIT_E15difference_typeES3_S3_St18input_iterator_tag
-FN:115,_ZSt8distanceISt20_List_const_iteratorISsEENSt15iterator_traitsIT_E15difference_typeES3_S3_
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:76,0
-DA:81,0
-DA:82,0
-DA:84,0
-DA:85,0
-DA:87,0
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-BA:82,0
-BA:82,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:166,_ZSt19__iterator_categoryISt20_List_const_iteratorISsEENSt15iterator_traitsIT_E17iterator_categoryERKS3_
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:166,0
-DA:167,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_list.h
-FN:169,_ZNKSt14_List_iteratorISsEeqERKS0_
-FN:139,_ZNSt14_List_iteratorISsEppEv
-FN:126,_ZNSt14_List_iteratorISsEC1EPSt15_List_node_base
-FN:648,_ZNSt4listISsSaISsEE5beginEv
-FN:666,_ZNSt4listISsSaISsEE3endEv
-FN:364,_ZNSt10_List_baseISsSaISsEE7_M_initEv
-FN:298,_ZNSt10_List_baseISsSaISsEE10_List_implD1Ev
-FN:202,_ZNSt20_List_const_iteratorISsEC1EPKSt15_List_node_base
-FN:675,_ZNKSt4listISsSaISsEE3endEv
-FN:657,_ZNKSt4listISsSaISsEE5beginEv
-FN:328,_ZNKSt10_List_baseISsSaISsEE21_M_get_Node_allocatorEv
-FN:253,_ZNKSt20_List_const_iteratorISsEneERKS0_
-FN:219,_ZNSt20_List_const_iteratorISsEppEv
-FN:763,_ZNKSt4listISsSaISsEE4sizeEv
-FN:332,_ZNKSt10_List_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:301,_ZNSt10_List_baseISsSaISsEE10_List_implC1Ev
-FN:339,_ZNSt10_List_baseISsSaISsEEC2Ev
-FN:498,_ZNSt4listISsSaISsEEC2Ev
-FN:313,_ZNSt10_List_baseISsSaISsEE11_M_get_nodeEv
-FN:317,_ZNSt10_List_baseISsSaISsEE11_M_put_nodeEPSt10_List_nodeISsE
-FN:458,_ZNSt4listISsSaISsEE14_M_create_nodeERKSs
-FN:1339,_ZNSt4listISsSaISsEE9_M_insertESt14_List_iteratorISsERKSs
-FN:875,_ZNSt4listISsSaISsEE9push_backERKSs
-FN:1356,_ZNSt4listISsSaISsEE8_M_eraseESt14_List_iteratorISsE
-FN:357,_ZNSt10_List_baseISsSaISsEED2Ev
-FN:417,_ZNSt4listISsSaISsEED2Ev
-DA:126,0
-DA:127,0
-DA:139,0
-DA:141,0
-DA:142,0
-DA:169,0
-DA:170,0
-DA:202,0
-DA:203,0
-DA:219,0
-DA:221,0
-DA:222,0
-DA:253,0
-DA:254,0
-DA:298,0
-DA:301,0
-DA:302,0
-DA:303,0
-DA:313,0
-DA:314,0
-DA:317,0
-DA:318,0
-DA:328,0
-DA:329,0
-DA:332,0
-DA:333,0
-DA:339,0
-DA:340,0
-DA:341,0
-DA:357,0
-DA:358,0
-DA:364,0
-DA:366,0
-DA:367,0
-DA:368,0
-DA:417,0
-DA:458,0
-DA:460,0
-DA:463,0
-DA:465,0
-DA:467,0
-DA:468,0
-DA:470,0
-DA:498,0
-DA:499,0
-DA:648,0
-DA:649,0
-DA:657,0
-DA:658,0
-DA:666,0
-DA:667,0
-DA:675,0
-DA:676,0
-DA:763,0
-DA:764,0
-DA:875,0
-DA:876,0
-DA:1339,0
-DA:1341,0
-DA:1342,0
-DA:1343,0
-DA:1356,0
-DA:1358,0
-DA:1359,0
-DA:1360,0
-DA:1361,0
-DA:1362,0
-LF:67
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt10_List_nodeISsEED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt10_List_nodeISsEEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt10_List_nodeISsEE8max_sizeEv
-FN:87,_ZN9__gnu_cxx13new_allocatorISt10_List_nodeISsEE8allocateEjPKv
-FN:107,_ZN9__gnu_cxx13new_allocatorISsE9constructEPSsRKSs
-FN:97,_ZN9__gnu_cxx13new_allocatorISt10_List_nodeISsEE10deallocateEPS2_j
-FN:118,_ZN9__gnu_cxx13new_allocatorISsE7destroyEPSs
-DA:69,0
-DA:71,0
-DA:76,0
-DA:87,0
-DA:89,0
-DA:90,0
-DA:92,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:107,0
-DA:108,0
-DA:118,0
-BA:89,0
-BA:89,0
-BA:108,0
-BA:108,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:195,_ZNSolsEj
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:177,_ZNSolsEb
-DA:95,0
-DA:112,0
-DA:117,0
-DA:177,0
-DA:178,0
-DA:195,0
-DA:199,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/sys/fs.h
-FN:105,_ZNK6wibble3sys2fs9Directory14const_iteratorneERKS3_
-FN:98,_ZN6wibble3sys2fs9Directory14const_iteratordeEv
-FN:111,_ZN6wibble3sys2fs9DirectoryC1ERKSs
-FN:50,_ZN6wibble3sys2fs9DirectoryD1Ev
-FN:88,_ZN6wibble3sys2fs9Directory14const_iteratorppEv
-FN:65,_ZN6wibble3sys2fs9Directory14const_iteratorD1Ev
-DA:50,3
-DA:65,30
-DA:88,29
-DA:90,29
-DA:92,1
-DA:93,1
-DA:95,29
-DA:98,28
-DA:105,29
-DA:107,29
-DA:111,3
-BA:65,1
-BA:65,2
-BA:90,2
-BA:90,2
-BA:107,2
-BA:107,2
-BA:107,1
-BA:107,2
-LF:11
-LH:11
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:17,_ZN8LocationC1EPKciSs
-FN:13,_ZN8LocationC1ERKS_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:41,_ZN12AssertFailedD1Ev
-FN:13,_ZN8LocationD1Ev
-FN:59,_Z9assert_fnIbEv8LocationT_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:59,0
-DA:61,0
-DA:62,0
-DA:64,0
-BA:42,0
-BA:42,0
-BA:61,0
-BA:61,0
-LF:18
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/sys/fs.test.h
-FN:60,_ZN6TestFs11_mkFilePathEv
-FN:51,_ZN6TestFs8_mkPath2Ev
-FN:40,_ZN6TestFs7_mkPathEv
-FN:32,_ZN6TestFs18invalidDirectoriesEv
-FN:16,_ZN6TestFs16directoryIterateEv
-DA:16,1
-DA:17,1
-DA:19,1
-DA:20,29
-DA:21,29
-DA:23,1
-DA:24,2
-DA:25,2
-DA:26,2
-DA:27,2
-DA:28,2
-DA:29,1
-DA:32,1
-DA:33,1
-DA:34,2
-DA:36,2
-DA:37,2
-DA:38,1
-DA:40,1
-DA:42,1
-DA:45,2
-DA:48,2
-DA:49,1
-DA:51,1
-DA:53,1
-DA:54,1
-DA:55,2
-DA:56,2
-DA:57,1
-DA:58,1
-DA:60,1
-DA:62,1
-DA:63,1
-DA:64,2
-DA:65,2
-DA:66,2
-DA:67,1
-DA:68,1
-BA:20,2
-BA:20,2
-LF:38
-LH:38
-end_of_record
-SF:/srv/build/pkg/ept-work/default/wibble/wibble-test-generated-_home_mornfall_dev_pkg_ept-work_wibble_sys_fs.cpp
-FN:7,_Z41__static_initialization_and_destruction_0ii
-FN:7,_GLOBAL__I__Z23run_Fs_directoryIteratev
-FN:7,_Z18run_Fs__mkFilePathv
-FN:6,_Z15run_Fs__mkPath2v
-FN:5,_Z14run_Fs__mkPathv
-FN:4,_Z25run_Fs_invalidDirectoriesv
-FN:3,_Z23run_Fs_directoryIteratev
-DA:3,1
-DA:4,1
-DA:5,1
-DA:6,1
-DA:7,4
-BA:7,2
-BA:7,1
-BA:7,2
-BA:7,1
-LF:5
-LH:5
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISsEED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:98,_ZNSaISt13_Rb_tree_nodeISsEEC2Ev
-FN:106,_ZNSaISsED1Ev
-FN:104,_ZNSaISsEC1ISt13_Rb_tree_nodeISsEEERKSaIT_E
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,1
-DA:100,0
-DA:101,0
-DA:104,56
-DA:106,1
-DA:118,0
-DA:119,0
-LF:7
-LH:3
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:277,_ZNKSs7_M_dataEv
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:392,_ZNSs10_S_compareEjj
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-FN:1941,_ZNKSs7compareERKSs
-FN:2238,_ZStltIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:392,0
-DA:394,0
-DA:401,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:1941,0
-DA:1943,0
-DA:1944,0
-DA:1945,0
-DA:1947,0
-DA:1948,0
-DA:1949,0
-DA:1950,0
-DA:2067,0
-DA:2069,0
-DA:2238,365
-DA:2239,365
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-BA:1948,0
-BA:1948,0
-LF:64
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-DA:245,0
-DA:246,0
-DA:257,0
-DA:258,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:188,_ZSt3minIjERKT_S2_S2_
-DA:188,0
-DA:193,0
-DA:194,0
-DA:195,0
-BA:193,0
-BA:193,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_function.h
-FN:469,_ZNKSt9_IdentityISsEclERKSs
-FN:229,_ZNKSt4lessISsEclERKSsS2_
-DA:229,365
-DA:230,365
-DA:469,355
-DA:470,355
-LF:4
-LH:4
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:166,0
-DA:167,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_pair.h
-FN:88,_ZNSt4pairISt23_Rb_tree_const_iteratorISsEbEC1ERKS1_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorISsEbEC1ERKS1_RKb
-DA:88,56
-DA:89,56
-LF:2
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_set.h
-FN:336,_ZNKSt3setISsSt4lessISsESaISsEE4sizeEv
-FN:270,_ZNKSt3setISsSt4lessISsESaISsEE3endEv
-FN:141,_ZNSt3setISsSt4lessISsESaISsEEC1Ev
-FN:503,_ZNSt3setISsSt4lessISsESaISsEE4findERKSs
-FN:93,_ZNSt3setISsSt4lessISsESaISsEED1Ev
-FN:378,_ZNSt3setISsSt4lessISsESaISsEE6insertERKSs
-DA:93,1
-DA:141,1
-DA:142,1
-DA:270,5
-DA:271,5
-DA:336,1
-DA:337,1
-DA:378,28
-DA:381,28
-DA:382,28
-DA:503,5
-DA:504,5
-LF:12
-LH:12
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_tree.h
-FN:289,_ZNKSt23_Rb_tree_const_iteratorISsEneERKS0_
-FN:452,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_beginEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorISsEC1ERKSt17_Rb_tree_iteratorISsE
-FN:641,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE4sizeEv
-FN:398,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_S_leftEPSt18_Rb_tree_node_base
-FN:463,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_M_endEv
-FN:168,_ZNSt17_Rb_tree_iteratorISsEC1EPSt13_Rb_tree_nodeISsE
-FN:596,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorISsEeqERKS0_
-FN:610,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE3endEv
-FN:240,_ZNSt23_Rb_tree_const_iteratorISsEC1EPKSt13_Rb_tree_nodeISsE
-FN:614,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE3endEv
-FN:415,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EE13_M_initializeEv
-FN:471,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_valueEPKSt13_Rb_tree_nodeISsE
-FN:475,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_S_keyEPKSt13_Rb_tree_nodeISsE
-FN:495,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_S_keyEPKSt18_Rb_tree_node_base
-FN:403,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEEC1Ev
-FN:347,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE21_M_get_Node_allocatorEv
-FN:351,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13get_allocatorEv
-FN:360,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11_M_put_nodeEPSt13_Rb_tree_nodeISsE
-FN:954,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE14_M_lower_boundEPSt13_Rb_tree_nodeISsES8_RKSs
-FN:1390,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE4findERKSs
-FN:388,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE15_M_destroy_nodeEPSt13_Rb_tree_nodeISsE
-FN:936,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_eraseEPSt13_Rb_tree_nodeISsE
-FN:584,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEED1Ev
-FN:195,_ZNSt17_Rb_tree_iteratorISsEmmEv
-FN:356,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE14_M_create_nodeERKSs
-FN:846,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE10_M_insert_EPKSt18_Rb_tree_node_baseS8_RKSs
-FN:1133,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE16_M_insert_uniqueERKSs
-DA:168,78
-DA:169,78
-DA:195,11
-DA:197,11
-DA:198,11
-DA:210,17
-DA:211,17
-DA:240,5
-DA:241,5
-DA:243,33
-DA:244,33
-DA:289,5
-DA:290,5
-DA:347,56
-DA:348,56
-DA:351,56
-DA:352,56
-DA:356,28
-DA:357,28
-DA:360,28
-DA:361,28
-DA:364,28
-DA:366,28
-DA:368,28
-DA:369,0
-DA:371,0
-DA:372,0
-DA:374,28
-DA:388,28
-DA:390,28
-DA:391,28
-DA:392,28
-DA:398,1
-DA:403,1
-DA:405,1
-DA:406,1
-DA:415,1
-DA:417,1
-DA:418,1
-DA:419,1
-DA:420,1
-DA:421,1
-DA:452,34
-DA:453,34
-DA:463,61
-DA:464,61
-DA:471,132
-DA:472,132
-DA:475,132
-DA:476,132
-DA:479,77
-DA:480,77
-DA:487,111
-DA:488,111
-DA:495,59
-DA:496,59
-DA:499,59
-DA:500,59
-DA:562,1
-DA:584,1
-DA:585,1
-DA:596,12
-DA:599,12
-DA:610,5
-DA:611,5
-DA:614,5
-DA:617,5
-DA:641,1
-DA:642,1
-DA:846,28
-DA:850,28
-DA:852,28
-DA:854,28
-DA:857,28
-DA:858,28
-DA:936,29
-DA:939,86
-DA:941,28
-DA:942,28
-DA:943,28
-DA:944,28
-DA:946,29
-DA:954,5
-DA:956,32
-DA:957,22
-DA:958,10
-DA:960,12
-DA:961,5
-DA:1133,28
-DA:1135,28
-DA:1136,28
-DA:1137,28
-DA:1138,166
-DA:1140,110
-DA:1141,110
-DA:1142,110
-DA:1144,28
-DA:1145,28
-DA:1147,12
-DA:1148,1
-DA:1150,11
-DA:1152,27
-DA:1153,27
-DA:1154,0
-DA:1390,5
-DA:1392,5
-DA:1395,5
-BA:850,2
-BA:850,1
-BA:850,2
-BA:850,2
-BA:850,2
-BA:850,2
-BA:939,2
-BA:939,2
-BA:956,2
-BA:956,2
-BA:957,2
-BA:957,2
-BA:1138,2
-BA:1138,2
-BA:1142,2
-BA:1142,2
-BA:1145,2
-BA:1145,2
-BA:1147,2
-BA:1147,2
-BA:1152,2
-BA:1152,1
-BA:1395,2
-BA:1395,1
-BA:1395,1
-BA:1395,2
-LF:107
-LH:103
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE8max_sizeEv
-FN:107,_ZN9__gnu_cxx13new_allocatorISsE9constructEPSsRKSs
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE10deallocateEPS2_j
-FN:118,_ZN9__gnu_cxx13new_allocatorISsE7destroyEPSs
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE8allocateEjPKv
-DA:69,1
-DA:71,0
-DA:76,1
-DA:87,28
-DA:89,28
-DA:90,0
-DA:92,28
-DA:97,28
-DA:98,28
-DA:101,28
-DA:102,28
-DA:107,0
-DA:108,0
-DA:118,0
-BA:89,1
-BA:89,2
-BA:108,0
-BA:108,0
-LF:14
-LH:9
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-DA:95,0
-DA:112,0
-DA:117,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/amorph.h
-FN:83,_ZN6wibble11VirtualBaseC2Ev
-FN:83,_ZN6wibble11VirtualBaseC2ERKS0_
-FN:366,_ZN6wibble6AmorphIN12_GLOBAL__N_11TENS1_10TInterfaceELi0EE14implementationEv
-FN:91,_ZN6wibble14MorphInterfaceIN12_GLOBAL__N_110TInterfaceEEC2ERKS3_
-FN:114,_ZN6wibble9MorphBaseIN12_GLOBAL__N_12T1ENS1_10TInterfaceEEC2ERKS4_
-FN:144,_ZN6wibble5MorphIN12_GLOBAL__N_16TMorphINS1_2T1EEES3_NS1_10TInterfaceEEC2ERKS6_
-FN:114,_ZN6wibble9MorphBaseIN12_GLOBAL__N_12T2ENS1_10TInterfaceEEC2ERKS4_
-FN:144,_ZN6wibble5MorphIN12_GLOBAL__N_16TMorphINS1_2T2EEES3_NS1_10TInterfaceEEC2ERKS6_
-FN:114,_ZN6wibble9MorphBaseIN12_GLOBAL__N_12T3ENS1_10TInterfaceEEC2ERKS4_
-FN:144,_ZN6wibble5MorphIN12_GLOBAL__N_16TMorphINS1_2T3EEES3_NS1_10TInterfaceEEC2ERKS6_
-FN:332,_ZN6wibble6AmorphIN12_GLOBAL__N_11TENS1_10TInterfaceELi0EE24setMorphInterfacePointerEPKNS_14MorphInterfaceIS3_EE
-FN:284,_ZN6wibble6AmorphIN12_GLOBAL__N_11TENS1_10TInterfaceELi0EEC2ERKNS_14MorphInterfaceIS3_EE
-FN:371,_ZNK6wibble6AmorphIN12_GLOBAL__N_11TENS1_10TInterfaceELi0EE14morphInterfaceEv
-FN:345,_ZN6wibble6AmorphIN12_GLOBAL__N_11TENS1_10TInterfaceELi0EED2Ev
-FN:361,_ZNK6wibble6AmorphIN12_GLOBAL__N_11TENS1_10TInterfaceELi0EE14implementationEv
-FN:100,_ZN6wibble14MorphAllocatorC2Ev
-FN:132,_ZN6wibble9MorphBaseIN12_GLOBAL__N_12T1ENS1_10TInterfaceEE7wrappedEv
-FN:92,_ZN6wibble14MorphInterfaceIN12_GLOBAL__N_110TInterfaceEE11virtualBaseEv
-FN:91,_ZN6wibble14MorphInterfaceIN12_GLOBAL__N_110TInterfaceEEC2Ev
-FN:115,_ZN6wibble9MorphBaseIN12_GLOBAL__N_12T1ENS1_10TInterfaceEEC2ERKS2_
-FN:147,_ZN6wibble5MorphIN12_GLOBAL__N_16TMorphINS1_2T1EEES3_NS1_10TInterfaceEEC2ERKS3_
-FN:115,_ZN6wibble9MorphBaseIN12_GLOBAL__N_12T2ENS1_10TInterfaceEEC2ERKS2_
-FN:147,_ZN6wibble5MorphIN12_GLOBAL__N_16TMorphINS1_2T2EEES3_NS1_10TInterfaceEEC2ERKS3_
-FN:115,_ZN6wibble9MorphBaseIN12_GLOBAL__N_12T3ENS1_10TInterfaceEEC2ERKS2_
-FN:147,_ZN6wibble5MorphIN12_GLOBAL__N_16TMorphINS1_2T3EEES3_NS1_10TInterfaceEEC2ERKS3_
-FN:173,_ZN6wibble5MorphIN12_GLOBAL__N_16TMorphINS1_2T3EEES3_NS1_10TInterfaceEE7destroyEj
-FN:173,_ZN6wibble5MorphIN12_GLOBAL__N_16TMorphINS1_2T2EEES3_NS1_10TInterfaceEE7destroyEj
-FN:173,_ZN6wibble5MorphIN12_GLOBAL__N_16TMorphINS1_2T1EEES3_NS1_10TInterfaceEE7destroyEj
-FN:185,_ZN6wibble5MorphIN12_GLOBAL__N_16TMorphINS1_2T3EEES3_NS1_10TInterfaceEE7wrappedEv
-FN:118,_ZN6wibble9MorphBaseIN12_GLOBAL__N_12T3ENS1_10TInterfaceEE11virtualBaseIS2_EENS_8EnableIfINS_13IsPolymorphicIT_EEPNS_11VirtualBaseEE1TEv
-FN:128,_ZN6wibble9MorphBaseIN12_GLOBAL__N_12T3ENS1_10TInterfaceEE11virtualBaseEv
-FN:149,_ZNK6wibble5MorphIN12_GLOBAL__N_16TMorphINS1_2T3EEES3_NS1_10TInterfaceEE4selfEv
-FN:181,_ZNK6wibble5MorphIN12_GLOBAL__N_16TMorphINS1_2T3EEES3_NS1_10TInterfaceEE7wrappedEv
-FN:185,_ZN6wibble5MorphIN12_GLOBAL__N_16TMorphINS1_2T2EEES3_NS1_10TInterfaceEE7wrappedEv
-FN:118,_ZN6wibble9MorphBaseIN12_GLOBAL__N_12T2ENS1_10TInterfaceEE11virtualBaseIS2_EENS_8EnableIfINS_13IsPolymorphicIT_EEPNS_11VirtualBaseEE1TEv
-FN:128,_ZN6wibble9MorphBaseIN12_GLOBAL__N_12T2ENS1_10TInterfaceEE11virtualBaseEv
-FN:149,_ZNK6wibble5MorphIN12_GLOBAL__N_16TMorphINS1_2T2EEES3_NS1_10TInterfaceEE4selfEv
-FN:181,_ZNK6wibble5MorphIN12_GLOBAL__N_16TMorphINS1_2T2EEES3_NS1_10TInterfaceEE7wrappedEv
-FN:185,_ZN6wibble5MorphIN12_GLOBAL__N_16TMorphINS1_2T1EEES3_NS1_10TInterfaceEE7wrappedEv
-FN:118,_ZN6wibble9MorphBaseIN12_GLOBAL__N_12T1ENS1_10TInterfaceEE11virtualBaseIS2_EENS_8EnableIfINS_13IsPolymorphicIT_EEPNS_11VirtualBaseEE1TEv
-FN:128,_ZN6wibble9MorphBaseIN12_GLOBAL__N_12T1ENS1_10TInterfaceEE11virtualBaseEv
-FN:149,_ZNK6wibble5MorphIN12_GLOBAL__N_16TMorphINS1_2T1EEES3_NS1_10TInterfaceEE4selfEv
-FN:181,_ZNK6wibble5MorphIN12_GLOBAL__N_16TMorphINS1_2T1EEES3_NS1_10TInterfaceEE7wrappedEv
-FN:156,_ZNK6wibble5MorphIN12_GLOBAL__N_16TMorphINS1_2T3EEES3_NS1_10TInterfaceEE3leqEPKNS_14MorphInterfaceIS5_EE
-FN:156,_ZNK6wibble5MorphIN12_GLOBAL__N_16TMorphINS1_2T2EEES3_NS1_10TInterfaceEE3leqEPKNS_14MorphInterfaceIS5_EE
-FN:156,_ZNK6wibble5MorphIN12_GLOBAL__N_16TMorphINS1_2T1EEES3_NS1_10TInterfaceEE3leqEPKNS_14MorphInterfaceIS5_EE
-FN:316,_ZN6wibble6AmorphIN12_GLOBAL__N_11TENS1_10TInterfaceELi0EE19setInterfacePointerEPKS3_
-FN:340,_ZN6wibble6AmorphIN12_GLOBAL__N_11TENS1_10TInterfaceELi0EEaSERKS4_
-FN:392,_ZNK6wibble6AmorphIN12_GLOBAL__N_11TENS1_10TInterfaceELi0EE4implINS1_2T1EEEPT_v
-FN:351,_ZN6wibble6AmorphIN12_GLOBAL__N_11TENS1_10TInterfaceELi0EE6ifTypeINS1_14ExtractT1ValueEEENS_5MaybeINT_11result_typeEEES8_
-FN:84,_ZN6wibble11VirtualBaseD2Ev
-FN:84,_ZN6wibble11VirtualBaseD0Ev
-FN:84,_ZN6wibble11VirtualBaseD1Ev
-FN:95,_ZN6wibble14MorphInterfaceIN12_GLOBAL__N_110TInterfaceEED2Ev
-FN:114,_ZN6wibble9MorphBaseIN12_GLOBAL__N_12T3ENS1_10TInterfaceEED2Ev
-FN:189,_ZN6wibble5MorphIN12_GLOBAL__N_16TMorphINS1_2T3EEES3_NS1_10TInterfaceEED2Ev
-FN:189,_ZN6wibble5MorphIN12_GLOBAL__N_16TMorphINS1_2T3EEES3_NS1_10TInterfaceEED0Ev
-FN:189,_ZN6wibble5MorphIN12_GLOBAL__N_16TMorphINS1_2T3EEES3_NS1_10TInterfaceEED1Ev
-FN:95,_ZN6wibble14MorphInterfaceIN12_GLOBAL__N_110TInterfaceEED0Ev
-FN:95,_ZN6wibble14MorphInterfaceIN12_GLOBAL__N_110TInterfaceEED1Ev
-FN:114,_ZN6wibble9MorphBaseIN12_GLOBAL__N_12T2ENS1_10TInterfaceEED2Ev
-FN:189,_ZN6wibble5MorphIN12_GLOBAL__N_16TMorphINS1_2T2EEES3_NS1_10TInterfaceEED2Ev
-FN:189,_ZN6wibble5MorphIN12_GLOBAL__N_16TMorphINS1_2T2EEES3_NS1_10TInterfaceEED0Ev
-FN:189,_ZN6wibble5MorphIN12_GLOBAL__N_16TMorphINS1_2T2EEES3_NS1_10TInterfaceEED1Ev
-FN:114,_ZN6wibble9MorphBaseIN12_GLOBAL__N_12T1ENS1_10TInterfaceEED2Ev
-FN:189,_ZN6wibble5MorphIN12_GLOBAL__N_16TMorphINS1_2T1EEES3_NS1_10TInterfaceEED2Ev
-FN:189,_ZN6wibble5MorphIN12_GLOBAL__N_16TMorphINS1_2T1EEES3_NS1_10TInterfaceEED0Ev
-FN:189,_ZN6wibble5MorphIN12_GLOBAL__N_16TMorphINS1_2T1EEES3_NS1_10TInterfaceEED1Ev
-FN:101,_ZN6wibble14MorphAllocatornwEjPvj
-FN:168,_ZNK6wibble5MorphIN12_GLOBAL__N_16TMorphINS1_2T3EEES3_NS1_10TInterfaceEE13constructCopyEPvj
-FN:168,_ZNK6wibble5MorphIN12_GLOBAL__N_16TMorphINS1_2T2EEES3_NS1_10TInterfaceEE13constructCopyEPvj
-FN:168,_ZNK6wibble5MorphIN12_GLOBAL__N_16TMorphINS1_2T1EEES3_NS1_10TInterfaceEE13constructCopyEPvj
-DA:83,14
-DA:84,12
-DA:91,8
-DA:92,0
-DA:95,6
-DA:100,0
-DA:101,0
-DA:102,0
-DA:103,0
-DA:104,0
-DA:106,0
-DA:114,11
-DA:115,3
-DA:118,2
-DA:119,2
-DA:128,2
-DA:129,2
-DA:132,1
-DA:133,1
-DA:144,5
-DA:147,3
-DA:149,5
-DA:156,0
-DA:157,0
-DA:158,0
-DA:159,0
-DA:160,0
-DA:162,0
-DA:164,0
-DA:168,5
-DA:170,5
-DA:173,3
-DA:174,3
-DA:175,0
-DA:177,3
-DA:179,3
-DA:181,0
-DA:182,0
-DA:185,3
-DA:186,3
-DA:189,6
-DA:284,3
-DA:285,3
-DA:286,3
-DA:316,2
-DA:317,2
-DA:318,0
-DA:319,0
-DA:326,2
-DA:332,3
-DA:333,3
-DA:334,0
-DA:335,0
-DA:337,3
-DA:340,2
-DA:341,2
-DA:342,2
-DA:345,3
-DA:346,3
-DA:347,3
-DA:348,3
-DA:351,3
-DA:354,3
-DA:355,3
-DA:356,2
-DA:358,1
-DA:361,2
-DA:363,2
-DA:366,3
-DA:368,3
-DA:371,8
-DA:372,8
-DA:392,3
-DA:393,3
-DA:394,3
-DA:395,3
-DA:396,3
-DA:398,3
-DA:399,2
-DA:401,3
-BA:84,1
-BA:84,2
-BA:84,0
-BA:84,0
-BA:84,0
-BA:84,0
-BA:95,1
-BA:95,2
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:102,0
-BA:102,0
-BA:102,0
-BA:102,0
-BA:114,1
-BA:114,2
-BA:114,0
-BA:114,0
-BA:114,0
-BA:114,0
-BA:114,1
-BA:114,2
-BA:114,0
-BA:114,0
-BA:114,0
-BA:114,0
-BA:114,1
-BA:114,2
-BA:114,0
-BA:114,0
-BA:114,0
-BA:114,0
-BA:157,0
-BA:157,0
-BA:157,0
-BA:157,0
-BA:157,0
-BA:157,0
-BA:158,0
-BA:158,0
-BA:158,0
-BA:158,0
-BA:158,0
-BA:158,0
-BA:159,0
-BA:159,0
-BA:159,0
-BA:159,0
-BA:159,0
-BA:159,0
-BA:174,1
-BA:174,2
-BA:174,1
-BA:174,2
-BA:174,0
-BA:174,0
-BA:177,2
-BA:177,1
-BA:177,2
-BA:177,1
-BA:177,0
-BA:177,0
-BA:189,1
-BA:189,2
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,1
-BA:189,2
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,1
-BA:189,2
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,0
-BA:317,1
-BA:317,2
-BA:326,2
-BA:326,1
-BA:333,1
-BA:333,2
-BA:346,2
-BA:346,1
-BA:355,2
-BA:355,2
-BA:393,1
-BA:393,2
-BA:394,2
-BA:394,1
-BA:395,1
-BA:395,2
-BA:396,2
-BA:396,2
-BA:398,2
-BA:398,2
-BA:399,1
-BA:399,2
-LF:80
-LH:59
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/maybe.h
-FN:30,_ZN6wibble5MaybeIiEC1EbRKi
-FN:34,_ZN6wibble5MaybeIiE7NothingERKi
-FN:33,_ZN6wibble5MaybeIiE4JustERKi
-FN:27,_ZNK6wibble5MaybeIiE7nothingEv
-FN:29,_ZNK6wibble5MaybeIiE5valueEv
-FN:38,_ZNK6wibble5MaybeIiEleERKS1_
-FN:36,_ZNK6wibble5MaybeIiEcviEv
-DA:27,10
-DA:29,8
-DA:30,6
-DA:33,4
-DA:34,2
-DA:35,2
-DA:36,0
-DA:38,6
-DA:39,6
-DA:40,2
-DA:41,4
-DA:42,0
-DA:43,4
-BA:39,2
-BA:39,2
-BA:41,1
-BA:41,2
-LF:13
-LH:11
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/mixin.h
-FN:13,_ZN6wibble5mixin10ComparableINS_5MaybeIiEEEC2Ev
-FN:13,_ZN6wibble5mixin10ComparableINS_5MorphIN12_GLOBAL__N_16TMorphINS3_2T1EEES5_NS3_10TInterfaceEEEEC2Ev
-FN:15,_ZNK6wibble5mixin10ComparableINS_5MaybeIiEEE7cmpSelfEv
-FN:13,_ZN6wibble5mixin10ComparableINS_5MorphIN12_GLOBAL__N_16TMorphINS3_2T2EEES5_NS3_10TInterfaceEEEEC2Ev
-FN:13,_ZN6wibble5mixin10ComparableINS_5MorphIN12_GLOBAL__N_16TMorphINS3_2T3EEES5_NS3_10TInterfaceEEEEC2Ev
-FN:23,_ZNK6wibble5mixin10ComparableINS_5MaybeIiEEEeqERKS3_
-DA:13,9
-DA:15,6
-DA:16,6
-DA:23,3
-DA:24,3
-BA:24,2
-BA:24,1
-BA:24,2
-BA:24,1
-LF:5
-LH:5
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:13,_ZN8LocationC1ERKS_
-FN:17,_ZN8LocationC1EPKciSs
-FN:52,_ZlsIiER12AssertFailedS1_T_
-FN:52,_ZlsIN6wibble5MaybeIiEEER12AssertFailedS4_T_
-FN:52,_ZlsIPKcER12AssertFailedS3_T_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:41,_ZN12AssertFailedD1Ev
-FN:13,_ZN8LocationD1Ev
-FN:67,_Z12assert_eq_fnIiiEv8LocationT_T0_
-FN:67,_Z12assert_eq_fnIN6wibble5MaybeIiEES2_Ev8LocationT_T0_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:67,3
-DA:69,3
-DA:70,0
-DA:71,0
-DA:75,3
-BA:42,0
-BA:42,0
-BA:69,0
-BA:69,0
-BA:69,1
-BA:69,2
-LF:22
-LH:3
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/amorph.test.h
-FN:34,_ZNK12_GLOBAL__N_12T15valueEv
-FN:35,_ZNK12_GLOBAL__N_12T1leERKS0_
-FN:42,_ZNK12_GLOBAL__N_12T35valueEv
-FN:46,_ZNK12_GLOBAL__N_12T25valueEv
-FN:47,_ZNK12_GLOBAL__N_12T2leERKS0_
-FN:55,_ZN12_GLOBAL__N_114ExtractT1ValueclERKNS_2T1E
-FN:41,_ZN12_GLOBAL__N_12T1C2Ev
-FN:33,_ZN12_GLOBAL__N_12T1C1Ev
-FN:45,_ZN12_GLOBAL__N_12T2C1Ev
-FN:41,_ZN12_GLOBAL__N_12T3C1Ev
-FN:41,_ZN12_GLOBAL__N_12T1C2ERKS0_
-FN:33,_ZN12_GLOBAL__N_12T1C1ERKS0_
-FN:45,_ZN12_GLOBAL__N_12T2C1ERKS0_
-FN:41,_ZN12_GLOBAL__N_12T3C1ERKS0_
-FN:28,_ZN12_GLOBAL__N_11T5valueEv
-FN:9,_ZN12_GLOBAL__N_110TInterfaceC2ERKS0_
-FN:15,_ZN12_GLOBAL__N_16TMorphINS_2T1EEC1ERKS2_
-FN:15,_ZN12_GLOBAL__N_16TMorphINS_2T2EEC1ERKS2_
-FN:15,_ZN12_GLOBAL__N_16TMorphINS_2T3EEC1ERKS2_
-FN:24,_ZN12_GLOBAL__N_11TC1ERKN6wibble14MorphInterfaceINS_10TInterfaceEEE
-FN:23,_ZN12_GLOBAL__N_11TD1Ev
-FN:9,_ZN12_GLOBAL__N_110TInterfaceC2Ev
-FN:17,_ZN12_GLOBAL__N_16TMorphINS_2T1EEC1ERKS1_
-FN:61,_ZN12_GLOBAL__N_19testMorphINS_2T1EEENS_6TMorphIT_EES3_
-FN:17,_ZN12_GLOBAL__N_16TMorphINS_2T2EEC1ERKS1_
-FN:61,_ZN12_GLOBAL__N_19testMorphINS_2T2EEENS_6TMorphIT_EES3_
-FN:17,_ZN12_GLOBAL__N_16TMorphINS_2T3EEC1ERKS1_
-FN:61,_ZN12_GLOBAL__N_19testMorphINS_2T3EEENS_6TMorphIT_EES3_
-FN:19,_ZN12_GLOBAL__N_16TMorphINS_2T3EE5valueEv
-FN:19,_ZN12_GLOBAL__N_16TMorphINS_2T2EE5valueEv
-FN:19,_ZN12_GLOBAL__N_16TMorphINS_2T1EE5valueEv
-FN:23,_ZN12_GLOBAL__N_11TaSERKS0_
-FN:41,_ZN12_GLOBAL__N_12T1D2Ev
-FN:41,_ZN12_GLOBAL__N_12T3D1Ev
-FN:33,_ZN12_GLOBAL__N_12T1D1Ev
-FN:15,_ZN12_GLOBAL__N_16TMorphINS_2T3EED1Ev
-FN:45,_ZN12_GLOBAL__N_12T2D1Ev
-FN:15,_ZN12_GLOBAL__N_16TMorphINS_2T2EED1Ev
-FN:15,_ZN12_GLOBAL__N_16TMorphINS_2T1EED1Ev
-FN:66,_ZN12_GLOBAL__N_110TestAmorph5basicEv
-DA:9,8
-DA:15,11
-DA:17,3
-DA:19,3
-DA:23,5
-DA:24,3
-DA:25,3
-DA:28,3
-DA:29,3
-DA:33,17
-DA:34,2
-DA:35,0
-DA:36,0
-DA:41,20
-DA:42,2
-DA:45,9
-DA:46,1
-DA:47,0
-DA:48,0
-DA:55,2
-DA:56,2
-DA:61,3
-DA:62,3
-DA:66,1
-DA:68,1
-DA:69,1
-DA:70,1
-DA:71,1
-DA:72,2
-DA:73,2
-DA:74,2
-DA:75,2
-DA:76,2
-DA:77,2
-DA:78,2
-DA:79,2
-DA:80,1
-BA:15,2
-BA:15,1
-BA:15,1
-BA:15,2
-BA:15,2
-BA:15,1
-BA:15,1
-BA:15,2
-BA:15,0
-BA:15,0
-BA:15,1
-BA:15,2
-BA:33,1
-BA:33,2
-BA:33,0
-BA:33,0
-BA:33,1
-BA:33,2
-BA:41,1
-BA:41,2
-BA:41,0
-BA:41,0
-BA:45,1
-BA:45,2
-BA:45,0
-BA:45,0
-LF:37
-LH:33
-end_of_record
-SF:/srv/build/pkg/ept-work/default/wibble/wibble-test-generated-_home_mornfall_dev_pkg_ept-work_wibble_amorph.cpp
-FN:3,_Z41__static_initialization_and_destruction_0ii
-FN:3,_GLOBAL__I__Z16run_Amorph_basicv
-FN:3,_ZN12_GLOBAL__N_12T3D0Ev
-FN:3,_ZN12_GLOBAL__N_12T1D0Ev
-FN:3,_ZN12_GLOBAL__N_16TMorphINS_2T3EED0Ev
-FN:3,_ZN6wibble9MorphBaseIN12_GLOBAL__N_12T3ENS1_10TInterfaceEED0Ev
-FN:3,_ZN6wibble9MorphBaseIN12_GLOBAL__N_12T3ENS1_10TInterfaceEED1Ev
-FN:3,_ZN12_GLOBAL__N_16TMorphINS_2T2EED0Ev
-FN:3,_ZN6wibble9MorphBaseIN12_GLOBAL__N_12T2ENS1_10TInterfaceEED0Ev
-FN:3,_ZN6wibble9MorphBaseIN12_GLOBAL__N_12T2ENS1_10TInterfaceEED1Ev
-FN:3,_ZN12_GLOBAL__N_12T2D0Ev
-FN:3,_ZN12_GLOBAL__N_16TMorphINS_2T1EED0Ev
-FN:3,_ZN6wibble9MorphBaseIN12_GLOBAL__N_12T1ENS1_10TInterfaceEED0Ev
-FN:3,_ZN6wibble9MorphBaseIN12_GLOBAL__N_12T1ENS1_10TInterfaceEED1Ev
-FN:3,_Z16run_Amorph_basicv
-DA:3,7
-BA:3,2
-BA:3,1
-BA:3,2
-BA:3,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaIcED1Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-LF:51
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:166,0
-DA:167,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-DA:69,0
-DA:71,0
-DA:76,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-DA:95,0
-DA:112,0
-DA:117,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/typeinfo
-FN:122,_ZNKSt9type_info6beforeERKS_
-DA:122,0
-DA:123,0
-LF:2
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:13,_ZN8LocationC1ERKS_
-FN:17,_ZN8LocationC1EPKciSs
-FN:52,_ZlsIiER12AssertFailedS1_T_
-FN:52,_ZlsIPKcER12AssertFailedS3_T_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:41,_ZN12AssertFailedD1Ev
-FN:13,_ZN8LocationD1Ev
-FN:59,_Z9assert_fnIbEv8LocationT_
-FN:67,_Z12assert_eq_fnIiiEv8LocationT_T0_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:59,0
-DA:61,0
-DA:62,0
-DA:64,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:75,0
-BA:42,0
-BA:42,0
-BA:61,0
-BA:61,0
-BA:69,0
-BA:69,0
-LF:26
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.test.h
-FN:27,_ZN12_GLOBAL__N_19TestTests10assertionsEv
-DA:27,1
-DA:28,1
-DA:29,2
-DA:30,1
-LF:4
-LH:4
-end_of_record
-SF:/srv/build/pkg/ept-work/default/wibble/wibble-test-generated-_home_mornfall_dev_pkg_ept-work_wibble_test.cpp
-FN:3,_Z41__static_initialization_and_destruction_0ii
-FN:3,_GLOBAL__I__Z20run_Tests_assertionsv
-FN:3,_Z20run_Tests_assertionsv
-DA:3,4
-BA:3,2
-BA:3,1
-BA:3,2
-BA:3,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaIcED1Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-LF:51
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:166,0
-DA:167,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-DA:69,0
-DA:71,0
-DA:76,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-DA:95,0
-DA:112,0
-DA:117,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/commandline/core.h
-FN:21,_ZNK6wibble9exception9BadOption4typeEv
-FN:52,_ZN6wibble11commandline7ManagedC2Ev
-FN:63,_ZN6wibble11commandline13MemoryManagerC1Ev
-FN:30,_ZN6wibble11commandline7ArgListC1Ev
-FN:54,_ZN6wibble11commandline7ManagedD2Ev
-FN:54,_ZN6wibble11commandline7ManagedD0Ev
-FN:54,_ZN6wibble11commandline7ManagedD1Ev
-FN:66,_ZN6wibble11commandline13MemoryManager10addManagedEPNS0_7ManagedE
-FN:76,_ZN6wibble11commandline13MemoryManager3addINS0_11OptionGroupEEEPT_S5_
-FN:76,_ZN6wibble11commandline13MemoryManager3addINS0_10BoolOptionEEEPT_S5_
-FN:76,_ZN6wibble11commandline13MemoryManager3addINS0_9IntOptionEEEPT_S5_
-FN:76,_ZN6wibble11commandline13MemoryManager3addINS0_12SingleOptionINS0_6StringEEEEEPT_S7_
-FN:76,_ZN6wibble11commandline13MemoryManager3addINS0_6EngineEEEPT_S5_
-FN:22,_ZNK6wibble9exception9BadOption4descEv
-FN:17,_ZN6wibble9exception9BadOptionC1ERKSsS3_
-FN:19,_ZN6wibble9exception9BadOptionD0Ev
-FN:34,_ZN6wibble11commandline7ArgList15eraseAndAdvanceERSt14_List_iteratorISsE
-FN:30,_ZN6wibble11commandline7ArgListD1Ev
-FN:19,_ZN6wibble9exception9BadOptionD1Ev
-FN:68,_ZN6wibble11commandline13MemoryManagerD1Ev
-DA:17,0
-DA:18,0
-DA:19,0
-DA:21,0
-DA:22,0
-DA:30,22
-DA:34,23
-DA:36,23
-DA:37,0
-DA:38,23
-DA:39,23
-DA:40,23
-DA:41,23
-DA:42,23
-DA:52,61
-DA:54,61
-DA:63,10
-DA:66,46
-DA:68,10
-DA:70,56
-DA:72,46
-DA:73,10
-DA:76,46
-BA:19,0
-BA:19,0
-BA:19,0
-BA:19,0
-BA:36,1
-BA:36,2
-BA:54,1
-BA:54,2
-BA:54,0
-BA:54,0
-BA:54,0
-BA:54,0
-BA:70,2
-BA:70,2
-BA:72,2
-BA:72,1
-LF:23
-LH:17
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/commandline/engine.h
-FN:214,_ZNK6wibble11commandline6Engine12foundCommandEv
-FN:150,_ZN6wibble11commandline6Engine11createGroupERKSs
-FN:160,_ZN6wibble11commandline6Engine8addGroupERKSs
-FN:89,_ZN6wibble11commandline6Engine9parseListERNS0_7ArgListE
-FN:39,_ZN6wibble11commandline6EngineD2Ev
-FN:39,_ZN6wibble11commandline6EngineD0Ev
-FN:39,_ZN6wibble11commandline6EngineD1Ev
-FN:101,_ZN6wibble11commandline6EngineC2EPNS0_13MemoryManagerERKSsS5_S5_S5_
-FN:125,_ZN6wibble11commandline6Engine6createINS0_10BoolOptionEEEPT_RKSscS7_S7_S7_
-FN:140,_ZN6wibble11commandline6Engine3addINS0_10BoolOptionEEEPT_RKSscS7_S7_S7_
-FN:125,_ZN6wibble11commandline6Engine6createINS0_9IntOptionEEEPT_RKSscS7_S7_S7_
-FN:140,_ZN6wibble11commandline6Engine3addINS0_9IntOptionEEEPT_RKSscS7_S7_S7_
-FN:125,_ZN6wibble11commandline6Engine6createINS0_12SingleOptionINS0_6StringEEEEEPT_RKSscS9_S9_S9_
-FN:140,_ZN6wibble11commandline6Engine3addINS0_12SingleOptionINS0_6StringEEEEEPT_RKSscS9_S9_S9_
-FN:101,_ZN6wibble11commandline6EngineC1EPNS0_13MemoryManagerERKSsS5_S5_S5_
-FN:171,_ZN6wibble11commandline6Engine12createEngineERKSsS3_S3_S3_
-FN:184,_ZN6wibble11commandline6Engine9addEngineERKSsS3_S3_S3_
-DA:39,18
-DA:89,9
-DA:101,18
-DA:103,18
-DA:125,28
-DA:127,28
-DA:128,56
-DA:129,28
-DA:140,28
-DA:142,28
-DA:143,28
-DA:144,28
-DA:150,3
-DA:152,3
-DA:153,6
-DA:154,3
-DA:160,3
-DA:162,3
-DA:171,8
-DA:173,8
-DA:174,16
-DA:175,8
-DA:184,8
-DA:186,8
-DA:214,3
-BA:39,1
-BA:39,2
-BA:39,2
-BA:39,1
-BA:39,0
-BA:39,0
-BA:128,2
-BA:128,1
-BA:128,2
-BA:128,1
-BA:128,2
-BA:128,1
-BA:153,2
-BA:153,1
-BA:174,2
-BA:174,1
-LF:25
-LH:25
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/commandline/options.h
-FN:135,_ZN6wibble11commandline10BoolOption5parseERNS0_7ArgListESt14_List_iteratorISsE
-FN:136,_ZN6wibble11commandline10BoolOption5parseERKSs
-FN:139,_ZNK6wibble11commandline10BoolOption9boolValueEv
-FN:287,_ZN6wibble11commandline11OptionGroupC1EPNS0_13MemoryManagerERKSs
-FN:291,_ZN6wibble11commandline11OptionGroup3addEPNS0_6OptionE
-FN:177,_ZN6wibble11commandline12SingleOptionINS0_3IntEE5parseERKSs
-FN:193,_ZNK6wibble11commandline12SingleOptionINS0_3IntEE8intValueEv
-FN:194,_ZNK6wibble11commandline12SingleOptionINS0_6StringEE11stringValueEv
-FN:283,_ZN6wibble11commandline11OptionGroupD0Ev
-FN:283,_ZN6wibble11commandline11OptionGroupD1Ev
-FN:95,_ZN6wibble11commandline6OptionD2Ev
-FN:122,_ZN6wibble11commandline10BoolOptionD0Ev
-FN:122,_ZN6wibble11commandline10BoolOptionD1Ev
-FN:148,_ZN6wibble11commandline12SingleOptionINS0_3IntEED2Ev
-FN:205,_ZN6wibble11commandline9IntOptionD0Ev
-FN:205,_ZN6wibble11commandline9IntOptionD1Ev
-FN:148,_ZN6wibble11commandline12SingleOptionINS0_3IntEED0Ev
-FN:148,_ZN6wibble11commandline12SingleOptionINS0_3IntEED1Ev
-FN:95,_ZN6wibble11commandline6OptionD0Ev
-FN:95,_ZN6wibble11commandline6OptionD1Ev
-FN:101,_ZN6wibble11commandline6Option8addAliasERKSs
-FN:64,_ZN6wibble11commandline6OptionC2ERKSscS3_S3_S3_
-FN:132,_ZN6wibble11commandline10BoolOptionC1ERKSscS3_S3_S3_
-FN:308,_ZN6wibble11commandline11OptionGroup6createINS0_10BoolOptionEEEPT_RKSscS7_S7_S7_
-FN:323,_ZN6wibble11commandline11OptionGroup3addINS0_10BoolOptionEEEPT_RKSscS7_S7_S7_
-FN:161,_ZN6wibble11commandline12SingleOptionINS0_3IntEEC2ERKSscS5_S5_S5_
-FN:215,_ZN6wibble11commandline9IntOptionC1ERKSscS3_S3_S3_
-FN:308,_ZN6wibble11commandline11OptionGroup6createINS0_9IntOptionEEEPT_RKSscS7_S7_S7_
-FN:323,_ZN6wibble11commandline11OptionGroup3addINS0_9IntOptionEEEPT_RKSscS7_S7_S7_
-FN:168,_ZN6wibble11commandline12SingleOptionINS0_3IntEE5parseERNS0_7ArgListESt14_List_iteratorISsE
-FN:161,_ZN6wibble11commandline12SingleOptionINS0_6StringEEC1ERKSscS5_S5_S5_
-FN:308,_ZN6wibble11commandline11OptionGroup6createINS0_12SingleOptionINS0_6StringEEEEEPT_RKSscS9_S9_S9_
-FN:323,_ZN6wibble11commandline11OptionGroup3addINS0_12SingleOptionINS0_6StringEEEEEPT_RKSscS9_S9_S9_
-FN:177,_ZN6wibble11commandline12SingleOptionINS0_6StringEE5parseERKSs
-FN:168,_ZN6wibble11commandline12SingleOptionINS0_6StringEE5parseERNS0_7ArgListESt14_List_iteratorISsE
-FN:148,_ZN6wibble11commandline12SingleOptionINS0_6StringEED0Ev
-FN:148,_ZN6wibble11commandline12SingleOptionINS0_6StringEED1Ev
-FN:192,_ZNK6wibble11commandline12SingleOptionINS0_6StringEE9boolValueEv
-DA:64,35
-DA:65,35
-DA:67,35
-DA:68,21
-DA:69,35
-DA:70,35
-DA:71,35
-DA:95,40
-DA:101,5
-DA:122,19
-DA:132,19
-DA:133,19
-DA:135,4
-DA:136,7
-DA:139,18
-DA:148,17
-DA:161,16
-DA:162,16
-DA:164,16
-DA:165,11
-DA:166,16
-DA:168,2
-DA:170,2
-DA:171,0
-DA:172,2
-DA:173,2
-DA:175,2
-DA:177,9
-DA:179,9
-DA:180,9
-DA:181,9
-DA:192,4
-DA:193,4
-DA:194,13
-DA:205,2
-DA:215,2
-DA:216,2
-DA:218,2
-DA:219,2
-DA:283,3
-DA:287,3
-DA:288,3
-DA:291,7
-DA:308,7
-DA:310,7
-DA:311,14
-DA:312,7
-DA:323,7
-DA:325,7
-DA:326,7
-DA:327,7
-BA:67,2
-BA:67,2
-BA:69,2
-BA:69,1
-BA:95,1
-BA:95,2
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:122,2
-BA:122,1
-BA:122,0
-BA:122,0
-BA:148,1
-BA:148,2
-BA:148,0
-BA:148,0
-BA:148,0
-BA:148,0
-BA:148,2
-BA:148,1
-BA:148,0
-BA:148,0
-BA:164,1
-BA:164,2
-BA:164,2
-BA:164,2
-BA:170,0
-BA:170,0
-BA:170,1
-BA:170,2
-BA:205,2
-BA:205,1
-BA:205,0
-BA:205,0
-BA:283,2
-BA:283,1
-BA:283,0
-BA:283,0
-BA:311,2
-BA:311,1
-BA:311,2
-BA:311,1
-BA:311,2
-BA:311,1
-LF:51
-LH:50
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/exception.h
-FN:190,_ZNK6wibble9exception7Generic4typeEv
-FN:263,_ZNK6wibble9exception11Consistency4typeEv
-FN:109,_ZN6wibble9exception10AddContext7contextEv
-FN:213,_ZNK6wibble9exception7Generic4whatEv
-FN:265,_ZNK6wibble9exception11Consistency4descEv
-FN:193,_ZNK6wibble9exception7Generic4descEv
-FN:137,_ZN6wibble9exception7ContextD2Ev
-FN:117,_ZN6wibble9exception10AddContext11copyContextISt20back_insert_iteratorISt6vectorISsSaISsEEEEEvT_
-FN:153,_ZN6wibble9exception7Context10addContextERKSs
-FN:147,_ZN6wibble9exception7ContextC2ERKSs
-FN:186,_ZN6wibble9exception7GenericC2ERKSs
-FN:154,_ZNK6wibble9exception7Context13formatContextEv
-FN:205,_ZNK6wibble9exception7Generic8fullInfoEv
-FN:187,_ZN6wibble9exception7GenericD0Ev
-FN:187,_ZN6wibble9exception7GenericD1Ev
-FN:187,_ZN6wibble9exception7GenericD2Ev
-FN:259,_ZN6wibble9exception11ConsistencyC2ERKSsS3_
-FN:261,_ZN6wibble9exception11ConsistencyD0Ev
-FN:261,_ZN6wibble9exception11ConsistencyD1Ev
-FN:261,_ZN6wibble9exception11ConsistencyD2Ev
-DA:109,0
-DA:110,0
-DA:111,0
-DA:112,0
-DA:113,0
-DA:117,0
-DA:118,0
-DA:119,0
-DA:137,0
-DA:147,0
-DA:148,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:153,0
-DA:154,0
-DA:155,0
-DA:156,0
-DA:157,0
-DA:159,0
-DA:161,0
-DA:162,0
-DA:163,0
-DA:186,0
-DA:187,0
-DA:190,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:205,0
-DA:206,0
-DA:207,0
-DA:209,0
-DA:210,0
-DA:213,0
-DA:259,0
-DA:260,0
-DA:261,0
-DA:263,0
-DA:265,0
-DA:266,0
-DA:267,0
-DA:268,0
-DA:269,0
-BA:110,0
-BA:110,0
-BA:156,0
-BA:156,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:207,0
-BA:207,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:267,0
-BA:267,0
-LF:44
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:13,_ZN8LocationC1ERKS_
-FN:17,_ZN8LocationC1EPKciSs
-FN:52,_ZlsISsER12AssertFailedS1_T_
-FN:52,_ZlsIPKcER12AssertFailedS3_T_
-FN:52,_ZlsIiER12AssertFailedS1_T_
-FN:52,_ZlsIjER12AssertFailedS1_T_
-FN:52,_ZlsIbER12AssertFailedS1_T_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:41,_ZN12AssertFailedD1Ev
-FN:13,_ZN8LocationD1Ev
-FN:59,_Z9assert_fnIbEv8LocationT_
-FN:67,_Z12assert_eq_fnIjjEv8LocationT_T0_
-FN:67,_Z12assert_eq_fnIbbEv8LocationT_T0_
-FN:67,_Z12assert_eq_fnIiiEv8LocationT_T0_
-FN:67,_Z12assert_eq_fnISsPKcEv8LocationT_T0_
-FN:67,_Z12assert_eq_fnISsSsEv8LocationT_T0_
-FN:52,_ZlsIPN6wibble11commandline6EngineEER12AssertFailedS5_T_
-FN:67,_Z12assert_eq_fnIPN6wibble11commandline6EngineES3_Ev8LocationT_T0_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:59,0
-DA:61,0
-DA:62,0
-DA:64,0
-DA:67,64
-DA:69,64
-DA:70,0
-DA:71,0
-DA:75,64
-BA:42,0
-BA:42,0
-BA:61,0
-BA:61,0
-BA:69,0
-BA:69,0
-BA:69,1
-BA:69,2
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,1
-BA:69,2
-LF:26
-LH:3
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/commandline/engine.test.h
-FN:22,_ZN6PublicIN6wibble11commandline6EngineEE9parseListERNS1_7ArgListE
-FN:14,_ZN6PublicIN6wibble11commandline6EngineEED0Ev
-FN:14,_ZN6PublicIN6wibble11commandline6EngineEED1Ev
-FN:14,_ZN6PublicIN6wibble11commandline6EngineEED2Ev
-FN:19,_ZN6PublicIN6wibble11commandline6EngineEEC1EPNS1_13MemoryManagerERKSsS7_S7_S7_
-FN:19,_ZN6PublicIN6wibble11commandline6EngineEEC2EPNS1_13MemoryManagerERKSsS7_S7_S7_
-FN:205,_ZN21TestCommandlineEngine17creationShortcutsEv
-FN:47,_ZN7Engine2D0Ev
-FN:47,_ZN7Engine2D1Ev
-FN:34,_ZN7Engine1C1Ev
-FN:30,_ZN7Engine1D0Ev
-FN:30,_ZN7Engine1D1Ev
-FN:134,_ZN21TestCommandlineEngine16longOptsWithArgsEv
-FN:106,_ZN21TestCommandlineEngine18clusteredShortOptsEv
-FN:75,_ZN21TestCommandlineEngine11optsAndArgsEv
-FN:51,_ZN7Engine2C1Ev
-FN:188,_ZN21TestCommandlineEngine22commandsWithoutCommandEv
-FN:168,_ZN21TestCommandlineEngine27commandsWithOverlappingArgsEv
-FN:149,_ZN21TestCommandlineEngine14commandWithArgEv
-FN:119,_ZN21TestCommandlineEngine18longOptsWithDashesEv
-FN:92,_ZN21TestCommandlineEngine8optsOnlyEv
-DA:14,9
-DA:19,9
-DA:20,9
-DA:22,9
-DA:30,5
-DA:34,5
-DA:36,5
-DA:37,5
-DA:39,5
-DA:40,5
-DA:47,3
-DA:51,3
-DA:53,3
-DA:55,3
-DA:56,3
-DA:57,3
-DA:58,3
-DA:60,6
-DA:61,3
-DA:62,3
-DA:63,3
-DA:75,1
-DA:76,1
-DA:77,1
-DA:78,2
-DA:79,2
-DA:80,2
-DA:82,1
-DA:83,1
-DA:84,1
-DA:85,2
-DA:86,2
-DA:87,2
-DA:88,2
-DA:89,2
-DA:90,1
-DA:92,1
-DA:93,1
-DA:94,1
-DA:95,2
-DA:97,1
-DA:98,1
-DA:99,1
-DA:100,2
-DA:101,2
-DA:102,2
-DA:103,2
-DA:104,1
-DA:106,1
-DA:107,1
-DA:108,1
-DA:109,2
-DA:111,1
-DA:112,1
-DA:113,1
-DA:114,2
-DA:115,2
-DA:116,2
-DA:117,1
-DA:119,1
-DA:120,1
-DA:121,1
-DA:122,2
-DA:124,1
-DA:125,1
-DA:126,1
-DA:127,2
-DA:128,2
-DA:129,2
-DA:130,2
-DA:131,1
-DA:134,1
-DA:135,1
-DA:136,1
-DA:137,2
-DA:138,2
-DA:140,1
-DA:141,1
-DA:142,1
-DA:143,2
-DA:144,2
-DA:145,2
-DA:146,2
-DA:147,1
-DA:149,1
-DA:150,1
-DA:151,1
-DA:152,2
-DA:153,2
-DA:155,1
-DA:156,1
-DA:157,1
-DA:158,2
-DA:159,2
-DA:160,2
-DA:161,1
-DA:162,2
-DA:163,1
-DA:164,2
-DA:165,1
-DA:168,1
-DA:169,1
-DA:170,1
-DA:171,2
-DA:172,2
-DA:173,2
-DA:175,1
-DA:176,1
-DA:177,1
-DA:178,2
-DA:179,2
-DA:180,2
-DA:181,1
-DA:182,2
-DA:183,1
-DA:184,2
-DA:185,1
-DA:188,1
-DA:189,1
-DA:190,1
-DA:192,1
-DA:193,1
-DA:194,1
-DA:195,2
-DA:196,2
-DA:197,2
-DA:198,1
-DA:199,2
-DA:200,1
-DA:201,2
-DA:202,1
-DA:205,1
-DA:206,1
-DA:207,1
-DA:208,2
-DA:209,2
-DA:210,2
-DA:211,2
-DA:212,2
-DA:213,2
-DA:214,2
-DA:216,1
-DA:217,1
-DA:218,2
-DA:219,2
-DA:220,2
-DA:221,2
-DA:222,2
-DA:224,1
-DA:225,1
-DA:226,2
-DA:227,2
-DA:228,2
-DA:229,2
-DA:230,1
-DA:231,2
-DA:232,2
-DA:233,1
-BA:14,0
-BA:14,0
-BA:14,1
-BA:14,2
-BA:14,1
-BA:14,2
-BA:30,0
-BA:30,0
-BA:30,1
-BA:30,2
-BA:47,0
-BA:47,0
-BA:47,1
-BA:47,2
-LF:158
-LH:158
-end_of_record
-SF:/srv/build/pkg/ept-work/default/wibble/wibble-test-generated-_home_mornfall_dev_pkg_ept-work_wibble_commandline_engine.cpp
-FN:11,_Z41__static_initialization_and_destruction_0ii
-FN:11,_GLOBAL__I__Z33run_CommandlineEngine_optsAndArgsv
-FN:11,_Z39run_CommandlineEngine_creationShortcutsv
-FN:7,_Z38run_CommandlineEngine_longOptsWithArgsv
-FN:5,_Z40run_CommandlineEngine_clusteredShortOptsv
-FN:3,_Z33run_CommandlineEngine_optsAndArgsv
-FN:10,_Z44run_CommandlineEngine_commandsWithoutCommandv
-FN:9,_Z49run_CommandlineEngine_commandsWithOverlappingArgsv
-FN:8,_Z36run_CommandlineEngine_commandWithArgv
-FN:6,_Z40run_CommandlineEngine_longOptsWithDashesv
-FN:4,_Z30run_CommandlineEngine_optsOnlyv
-DA:3,1
-DA:4,1
-DA:5,1
-DA:6,1
-DA:7,1
-DA:8,1
-DA:9,1
-DA:10,1
-DA:11,4
-BA:11,2
-BA:11,1
-BA:11,2
-BA:11,1
-LF:9
-LH:9
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC2Ev
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeIPN6wibble11commandline7ManagedEEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISt4pairIKcPN6wibble11commandline6OptionEEEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsPN6wibble11commandline6OptionEEEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsPN6wibble11commandline6EngineEEEED2Ev
-FN:106,_ZNSaISt10_List_nodeISsEED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaISsED2Ev
-FN:106,_ZNSaISsED1Ev
-FN:106,_ZNSaIPN6wibble11commandline6OptionEED2Ev
-FN:106,_ZNSaIPN6wibble11commandline11OptionGroupEED2Ev
-FN:106,_ZNSaIPN6wibble11commandline6EngineEED2Ev
-FN:98,_ZNSaISsEC2Ev
-FN:104,_ZNSaISsEC1ISt10_List_nodeISsEEERKSaIT_E
-FN:106,_ZNSaIPN6wibble11commandline7ManagedEED1Ev
-FN:98,_ZNSaIPN6wibble11commandline6OptionEEC2Ev
-FN:98,_ZNSaIPN6wibble11commandline11OptionGroupEEC2Ev
-FN:98,_ZNSaIPN6wibble11commandline6EngineEEC2Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeISt4pairIKcPN6wibble11commandline6OptionEEEEC2Ev
-FN:106,_ZNSaISt4pairIKcPN6wibble11commandline6OptionEEED1Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsPN6wibble11commandline6OptionEEEEC2Ev
-FN:106,_ZNSaISt4pairIKSsPN6wibble11commandline6OptionEEED1Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsPN6wibble11commandline6EngineEEEEC2Ev
-FN:106,_ZNSaISt4pairIKSsPN6wibble11commandline6EngineEEED1Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeIPN6wibble11commandline7ManagedEEEC2Ev
-FN:98,_ZNSaISt10_List_nodeISsEEC2Ev
-FN:104,_ZNSaIPN6wibble11commandline7ManagedEEC1ISt13_Rb_tree_nodeIS2_EEERKSaIT_E
-FN:104,_ZNSaISt4pairIKcPN6wibble11commandline6OptionEEEC1ISt13_Rb_tree_nodeIS5_EEERKSaIT_E
-FN:104,_ZNSaISt4pairIKSsPN6wibble11commandline6OptionEEEC1ISt13_Rb_tree_nodeIS5_EEERKSaIT_E
-FN:104,_ZNSaISt4pairIKSsPN6wibble11commandline6EngineEEEC1ISt13_Rb_tree_nodeIS5_EEERKSaIT_E
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,132
-DA:100,0
-DA:101,0
-DA:104,256
-DA:106,444
-DA:118,0
-DA:119,0
-LF:7
-LH:3
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:1534,_ZNKSs5c_strEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:612,_ZNKSs6lengthEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:501,_ZNSsaSERKSs
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:835,_ZNSs6appendEPKc
-FN:928,_ZNSs6assignEPKc
-FN:509,_ZNSsaSEPKc
-FN:2162,_ZSteqIcEN9__gnu_cxx11__enable_ifIXsrSt9__is_charIT_E7__valueEbE6__typeERKSbIS3_St11char_traitsIS3_ESaIS3_EESC_
-FN:2188,_ZSteqIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_EPKS3_
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2121,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:509,0
-DA:510,0
-DA:606,0
-DA:607,0
-DA:612,0
-DA:613,0
-DA:686,0
-DA:687,0
-DA:835,0
-DA:838,0
-DA:928,0
-DA:931,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2121,0
-DA:2123,0
-DA:2124,0
-DA:2125,0
-DA:2162,0
-DA:2165,0
-DA:2188,0
-DA:2189,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-LF:75
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-DA:245,0
-DA:246,0
-DA:257,0
-DA:258,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/list.tcc
-FN:109,_ZNSt4listISsSaISsEE5eraseESt14_List_iteratorISsE
-FN:70,_ZNSt10_List_baseISsSaISsEE8_M_clearEv
-DA:70,11
-DA:73,11
-DA:74,27
-DA:76,5
-DA:77,5
-DA:78,5
-DA:79,5
-DA:81,11
-DA:109,25
-DA:111,25
-DA:112,25
-BA:74,2
-BA:74,2
-LF:11
-LH:11
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb0EE3__bES7_
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb0EE3__bES6_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb1EE3__bES7_
-FN:268,_ZNSt12__niter_baseISt16ostream_iteratorISscSt11char_traitsIcEELb0EE3__bES3_
-FN:286,_ZNSt12__miter_baseIPSsLb0EE3__bES0_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb1EE3__bES6_
-FN:268,_ZNSt12__niter_baseISt20back_insert_iteratorISt6vectorISsSaISsEEELb0EE3__bES4_
-FN:286,_ZNSt12__miter_baseIPcLb0EE3__bES0_
-FN:286,_ZNSt12__miter_baseIPPN6wibble11commandline6OptionELb0EE3__bES4_
-FN:268,_ZNSt12__niter_baseIPSsLb0EE3__bES0_
-FN:268,_ZNSt12__niter_baseIPcLb0EE3__bES0_
-FN:268,_ZNSt12__niter_baseIPPN6wibble11commandline6OptionELb0EE3__bES4_
-FN:569,_ZNSt20__copy_move_backwardILb0ELb1ESt26random_access_iterator_tagE13__copy_move_bIcEEPT_PKS3_S6_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0EPcS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPcS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardIPcS0_ET0_T_S2_S1_
-FN:375,_ZNSt11__copy_moveILb0ELb1ESt26random_access_iterator_tagE8__copy_mIcEEPT_PKS3_S6_S4_
-FN:385,_ZSt13__copy_move_aILb0EPcS0_ET1_T0_S2_S1_
-FN:430,_ZSt14__copy_move_a2ILb0EPcS0_ET1_T0_S2_S1_
-FN:456,_ZSt4copyIPcS0_ET0_T_S2_S1_
-FN:569,_ZNSt20__copy_move_backwardILb0ELb1ESt26random_access_iterator_tagE13__copy_move_bIPN6wibble11commandline6OptionEEEPT_PKS7_SA_S8_
-FN:579,_ZSt22__copy_move_backward_aILb0EPPN6wibble11commandline6OptionES4_ET1_T0_S6_S5_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPPN6wibble11commandline6OptionES4_ET1_T0_S6_S5_
-FN:624,_ZSt13copy_backwardIPPN6wibble11commandline6OptionES4_ET0_T_S6_S5_
-FN:375,_ZNSt11__copy_moveILb0ELb1ESt26random_access_iterator_tagE8__copy_mIPN6wibble11commandline6OptionEEEPT_PKS7_SA_S8_
-FN:385,_ZSt13__copy_move_aILb0EPPN6wibble11commandline6OptionES4_ET1_T0_S6_S5_
-FN:430,_ZSt14__copy_move_a2ILb0EPPN6wibble11commandline6OptionES4_ET1_T0_S6_S5_
-FN:456,_ZSt4copyIPPN6wibble11commandline6OptionES4_ET0_T_S6_S5_
-FN:539,_ZNSt20__copy_move_backwardILb0ELb0ESt26random_access_iterator_tagE13__copy_move_bIPSsS3_EET0_T_S5_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0EPSsS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPSsS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardIPSsS0_ET0_T_S2_S1_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPKSsSt16ostream_iteratorISscSt11char_traitsIcEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPKSsSt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_SD_SC_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET0_T_SD_SC_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET1_T0_SA_S9_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET0_T_SA_S9_
-DA:210,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:268,1336
-DA:269,1336
-DA:276,0
-DA:277,0
-DA:286,1222
-DA:287,1222
-DA:337,0
-DA:340,0
-DA:342,0
-DA:343,0
-DA:344,0
-DA:346,0
-DA:375,114
-DA:377,114
-DA:379,114
-DA:385,114
-DA:393,114
-DA:396,114
-DA:430,114
-DA:435,114
-DA:456,114
-DA:466,114
-DA:539,0
-DA:542,0
-DA:543,0
-DA:544,0
-DA:569,0
-DA:571,0
-DA:572,0
-DA:573,0
-DA:579,0
-DA:587,0
-DA:592,0
-DA:597,0
-DA:602,0
-DA:624,0
-DA:636,0
-BA:215,0
-BA:215,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:542,0
-BA:542,0
-LF:41
-LH:14
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:97,_ZSt8_DestroyIPcEvT_S1_
-FN:126,_ZSt8_DestroyIPccEvT_S1_RSaIT0_E
-FN:97,_ZSt8_DestroyIPPN6wibble11commandline6OptionEEvT_S5_
-FN:126,_ZSt8_DestroyIPPN6wibble11commandline6OptionES3_EvT_S5_RSaIT0_E
-FN:97,_ZSt8_DestroyIPPN6wibble11commandline11OptionGroupEEvT_S5_
-FN:126,_ZSt8_DestroyIPPN6wibble11commandline11OptionGroupES3_EvT_S5_RSaIT0_E
-FN:97,_ZSt8_DestroyIPPN6wibble11commandline6EngineEEvT_S5_
-FN:126,_ZSt8_DestroyIPPN6wibble11commandline6EngineES3_EvT_S5_RSaIT0_E
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-DA:87,0
-DA:88,0
-DA:97,165
-DA:101,0
-DA:103,0
-DA:104,165
-DA:126,165
-DA:128,165
-DA:129,165
-BA:101,0
-BA:101,0
-LF:9
-LH:5
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_function.h
-FN:469,_ZNKSt9_IdentityIPN6wibble11commandline7ManagedEEclERKS3_
-FN:229,_ZNKSt4lessIPN6wibble11commandline7ManagedEEclERKS3_S6_
-DA:229,133
-DA:230,133
-DA:469,266
-DA:470,266
-LF:4
-LH:4
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEdeEv
-FN:398,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEC1ERS2_
-FN:456,_ZSt13back_inserterISt6vectorISsSaISsEEESt20back_insert_iteratorIT_ERS4_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEC1ERKS2_
-FN:125,_ZNSt16reverse_iteratorISt14_List_iteratorISsEEC1ES1_
-FN:154,_ZNKSt16reverse_iteratorISt14_List_iteratorISsEEdeEv
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEE4baseEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEC1ERKS1_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPcSt6vectorIcSaIcEEE4baseEv
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPcSt6vectorIcSaIcEEEdeEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPcSt6vectorIcSaIcEEEC1ERKS1_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPPN6wibble11commandline6OptionESt6vectorIS4_SaIS4_EEE4baseEv
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPPN6wibble11commandline6OptionESt6vectorIS4_SaIS4_EEEdeEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPPN6wibble11commandline6OptionESt6vectorIS4_SaIS4_EEEC1ERKS5_
-FN:429,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEdeEv
-FN:434,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEppEv
-FN:412,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEaSERKSs
-DA:125,1
-DA:154,1
-DA:156,1
-DA:157,1
-DA:398,0
-DA:412,0
-DA:414,0
-DA:415,0
-DA:429,0
-DA:430,0
-DA:434,0
-DA:435,0
-DA:456,0
-DA:457,0
-DA:683,57
-DA:695,0
-DA:696,0
-DA:747,114
-DA:748,114
-DA:769,0
-DA:770,0
-LF:21
-LH:7
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:76,_ZSt10__distanceISt20_List_const_iteratorISsEENSt15iterator_traitsIT_E15difference_typeES3_S3_St18input_iterator_tag
-FN:115,_ZSt8distanceISt20_List_const_iteratorISsEENSt15iterator_traitsIT_E15difference_typeES3_S3_
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:76,13
-DA:81,13
-DA:82,37
-DA:84,11
-DA:85,11
-DA:87,13
-DA:93,0
-DA:98,0
-DA:115,13
-DA:119,13
-BA:82,2
-BA:82,2
-LF:10
-LH:8
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:111,_ZNSt8iteratorISt26bidirectional_iterator_tagSsiPSsRSsEC2Ev
-FN:166,_ZSt19__iterator_categoryISt20_List_const_iteratorISsEENSt15iterator_traitsIT_E17iterator_categoryERKS3_
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,1
-DA:166,13
-DA:167,13
-LF:3
-LH:3
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_list.h
-FN:169,_ZNKSt14_List_iteratorISsEeqERKS0_
-FN:139,_ZNSt14_List_iteratorISsEppEv
-FN:131,_ZNKSt14_List_iteratorISsEdeEv
-FN:126,_ZNSt14_List_iteratorISsEC1EPSt15_List_node_base
-FN:648,_ZNSt4listISsSaISsEE5beginEv
-FN:666,_ZNSt4listISsSaISsEE3endEv
-FN:684,_ZNSt4listISsSaISsEE6rbeginEv
-FN:154,_ZNSt14_List_iteratorISsEmmEv
-FN:364,_ZNSt10_List_baseISsSaISsEE7_M_initEv
-FN:298,_ZNSt10_List_baseISsSaISsEE10_List_implD1Ev
-FN:202,_ZNSt20_List_const_iteratorISsEC1EPKSt15_List_node_base
-FN:675,_ZNKSt4listISsSaISsEE3endEv
-FN:657,_ZNKSt4listISsSaISsEE5beginEv
-FN:328,_ZNKSt10_List_baseISsSaISsEE21_M_get_Node_allocatorEv
-FN:253,_ZNKSt20_List_const_iteratorISsEneERKS0_
-FN:219,_ZNSt20_List_const_iteratorISsEppEv
-FN:763,_ZNKSt4listISsSaISsEE4sizeEv
-FN:332,_ZNKSt10_List_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:301,_ZNSt10_List_baseISsSaISsEE10_List_implC1Ev
-FN:339,_ZNSt10_List_baseISsSaISsEEC2Ev
-FN:498,_ZNSt4listISsSaISsEEC2Ev
-FN:317,_ZNSt10_List_baseISsSaISsEE11_M_put_nodeEPSt10_List_nodeISsE
-FN:313,_ZNSt10_List_baseISsSaISsEE11_M_get_nodeEv
-FN:458,_ZNSt4listISsSaISsEE14_M_create_nodeERKSs
-FN:1339,_ZNSt4listISsSaISsEE9_M_insertESt14_List_iteratorISsERKSs
-FN:875,_ZNSt4listISsSaISsEE9push_backERKSs
-FN:1356,_ZNSt4listISsSaISsEE8_M_eraseESt14_List_iteratorISsE
-FN:357,_ZNSt10_List_baseISsSaISsEED2Ev
-FN:417,_ZNSt4listISsSaISsEED2Ev
-DA:126,177
-DA:127,177
-DA:131,84
-DA:132,84
-DA:139,47
-DA:141,47
-DA:142,47
-DA:154,1
-DA:156,1
-DA:157,1
-DA:169,67
-DA:170,67
-DA:202,26
-DA:203,26
-DA:219,11
-DA:221,11
-DA:222,11
-DA:253,24
-DA:254,24
-DA:298,11
-DA:301,11
-DA:302,11
-DA:303,11
-DA:313,30
-DA:314,30
-DA:317,30
-DA:318,30
-DA:328,60
-DA:329,60
-DA:332,60
-DA:333,60
-DA:339,11
-DA:340,11
-DA:341,11
-DA:357,11
-DA:358,11
-DA:364,11
-DA:366,11
-DA:367,11
-DA:368,11
-DA:417,11
-DA:458,30
-DA:460,30
-DA:463,30
-DA:465,0
-DA:467,0
-DA:468,0
-DA:470,30
-DA:498,11
-DA:499,11
-DA:648,21
-DA:649,21
-DA:657,13
-DA:658,13
-DA:666,131
-DA:667,131
-DA:675,13
-DA:676,13
-DA:684,1
-DA:685,1
-DA:763,13
-DA:764,13
-DA:875,30
-DA:876,30
-DA:1339,30
-DA:1341,30
-DA:1342,30
-DA:1343,30
-DA:1356,25
-DA:1358,25
-DA:1359,25
-DA:1360,25
-DA:1361,25
-DA:1362,25
-LF:74
-LH:71
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_map.h
-FN:155,_ZNSt3mapIcPN6wibble11commandline6OptionESt4lessIcESaISt4pairIKcS3_EEEC1Ev
-FN:155,_ZNSt3mapISsPN6wibble11commandline6OptionESt4lessISsESaISt4pairIKSsS3_EEEC1Ev
-FN:155,_ZNSt3mapISsPN6wibble11commandline6EngineESt4lessISsESaISt4pairIKSsS3_EEEC1Ev
-FN:92,_ZNSt3mapIcPN6wibble11commandline6OptionESt4lessIcESaISt4pairIKcS3_EEED1Ev
-FN:92,_ZNSt3mapISsPN6wibble11commandline6EngineESt4lessISsESaISt4pairIKSsS3_EEED1Ev
-FN:92,_ZNSt3mapISsPN6wibble11commandline6OptionESt4lessISsESaISt4pairIKSsS3_EEED1Ev
-DA:92,54
-DA:155,54
-DA:156,54
-LF:3
-LH:3
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_pair.h
-FN:88,_ZNSt4pairISt23_Rb_tree_const_iteratorIPN6wibble11commandline7ManagedEEbEC1ERKS5_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIPN6wibble11commandline7ManagedEEbEC1ERKS5_RKb
-FN:73,_ZNSt4pairIKcPN6wibble11commandline6OptionEED1Ev
-FN:73,_ZNSt4pairIKSsPN6wibble11commandline6EngineEED1Ev
-FN:73,_ZNSt4pairIKSsPN6wibble11commandline6OptionEED1Ev
-DA:73,89
-DA:88,92
-DA:89,92
-LF:3
-LH:3
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_set.h
-FN:261,_ZNKSt3setIPN6wibble11commandline7ManagedESt4lessIS3_ESaIS3_EE5beginEv
-FN:270,_ZNKSt3setIPN6wibble11commandline7ManagedESt4lessIS3_ESaIS3_EE3endEv
-FN:141,_ZNSt3setIPN6wibble11commandline7ManagedESt4lessIS3_ESaIS3_EEC1Ev
-FN:93,_ZNSt3setIPN6wibble11commandline7ManagedESt4lessIS3_ESaIS3_EED1Ev
-FN:378,_ZNSt3setIPN6wibble11commandline7ManagedESt4lessIS3_ESaIS3_EE6insertERKS3_
-DA:93,10
-DA:141,10
-DA:142,10
-DA:261,10
-DA:262,10
-DA:270,56
-DA:271,56
-DA:378,46
-DA:381,46
-DA:382,46
-LF:10
-LH:10
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_tree.h
-FN:289,_ZNKSt23_Rb_tree_const_iteratorIPN6wibble11commandline7ManagedEEneERKS4_
-FN:247,_ZNKSt23_Rb_tree_const_iteratorIPN6wibble11commandline7ManagedEEdeEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorIPN6wibble11commandline7ManagedEEC1ERKSt17_Rb_tree_iteratorIS3_E
-FN:452,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE8_M_beginEv
-FN:452,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE8_M_beginEv
-FN:452,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_M_beginEv
-FN:452,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_M_beginEv
-FN:463,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE6_M_endEv
-FN:487,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:168,_ZNSt17_Rb_tree_iteratorIPN6wibble11commandline7ManagedEEC1EPSt13_Rb_tree_nodeIS3_E
-FN:596,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE5beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorIPN6wibble11commandline7ManagedEEeqERKS4_
-FN:398,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE13_Rb_tree_implIS7_Lb0EED1Ev
-FN:240,_ZNSt23_Rb_tree_const_iteratorIPN6wibble11commandline7ManagedEEC1EPKSt13_Rb_tree_nodeIS3_E
-FN:603,_ZNKSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE5beginEv
-FN:614,_ZNKSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE3endEv
-FN:398,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE13_Rb_tree_implISA_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:398,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13_Rb_tree_implISA_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:398,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13_Rb_tree_implISA_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:471,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE8_S_valueEPKSt13_Rb_tree_nodeIS3_E
-FN:475,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE6_S_keyEPKSt13_Rb_tree_nodeIS3_E
-FN:495,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE6_S_keyEPKSt18_Rb_tree_node_base
-FN:415,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE13_Rb_tree_implISA_Lb0EE13_M_initializeEv
-FN:415,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13_Rb_tree_implISA_Lb0EE13_M_initializeEv
-FN:415,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13_Rb_tree_implISA_Lb0EE13_M_initializeEv
-FN:415,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE13_Rb_tree_implIS7_Lb0EE13_M_initializeEv
-FN:347,_ZNKSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE21_M_get_Node_allocatorEv
-FN:403,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE13_Rb_tree_implISA_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EEC1Ev
-FN:347,_ZNKSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE21_M_get_Node_allocatorEv
-FN:403,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13_Rb_tree_implISA_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EEC1Ev
-FN:347,_ZNKSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE21_M_get_Node_allocatorEv
-FN:403,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13_Rb_tree_implISA_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EEC1Ev
-FN:347,_ZNKSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE21_M_get_Node_allocatorEv
-FN:403,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE13_Rb_tree_implIS7_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EEC1Ev
-FN:351,_ZNKSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE13get_allocatorEv
-FN:351,_ZNKSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE13get_allocatorEv
-FN:351,_ZNKSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13get_allocatorEv
-FN:351,_ZNKSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13get_allocatorEv
-FN:360,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS6_E
-FN:360,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS6_E
-FN:360,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS6_E
-FN:388,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS6_E
-FN:936,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE8_M_eraseEPSt13_Rb_tree_nodeIS6_E
-FN:584,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EED1Ev
-FN:360,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS3_E
-FN:388,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS3_E
-FN:936,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE8_M_eraseEPSt13_Rb_tree_nodeIS3_E
-FN:584,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EED1Ev
-FN:195,_ZNSt17_Rb_tree_iteratorIPN6wibble11commandline7ManagedEEmmEv
-FN:356,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE14_M_create_nodeERKS3_
-FN:846,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE10_M_insert_EPKSt18_Rb_tree_node_baseSC_RKS3_
-FN:1133,_ZNSt8_Rb_treeIPN6wibble11commandline7ManagedES3_St9_IdentityIS3_ESt4lessIS3_ESaIS3_EE16_M_insert_uniqueERKS3_
-FN:388,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS6_E
-FN:936,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_M_eraseEPSt13_Rb_tree_nodeIS6_E
-FN:584,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EED1Ev
-FN:388,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS6_E
-FN:936,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_M_eraseEPSt13_Rb_tree_nodeIS6_E
-FN:584,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EED1Ev
-FN:255,_ZNSt23_Rb_tree_const_iteratorIPN6wibble11commandline7ManagedEEppEv
-DA:168,116
-DA:169,116
-DA:195,6
-DA:197,6
-DA:198,6
-DA:210,24
-DA:211,24
-DA:240,66
-DA:241,66
-DA:243,46
-DA:244,46
-DA:247,46
-DA:248,46
-DA:255,46
-DA:257,46
-DA:258,46
-DA:289,56
-DA:290,56
-DA:347,196
-DA:348,196
-DA:351,196
-DA:352,196
-DA:356,46
-DA:357,46
-DA:360,98
-DA:361,98
-DA:364,46
-DA:366,46
-DA:368,46
-DA:369,0
-DA:371,0
-DA:372,0
-DA:374,46
-DA:388,98
-DA:390,98
-DA:391,98
-DA:392,98
-DA:398,64
-DA:403,64
-DA:405,64
-DA:406,64
-DA:415,64
-DA:417,64
-DA:418,64
-DA:419,64
-DA:420,64
-DA:421,64
-DA:452,298
-DA:453,298
-DA:463,92
-DA:464,92
-DA:471,69
-DA:472,69
-DA:475,69
-DA:476,69
-DA:479,185
-DA:480,185
-DA:487,197
-DA:488,197
-DA:495,64
-DA:496,64
-DA:499,64
-DA:500,64
-DA:562,64
-DA:584,64
-DA:585,64
-DA:596,24
-DA:599,24
-DA:603,10
-DA:606,10
-DA:614,56
-DA:617,56
-DA:846,46
-DA:850,46
-DA:852,46
-DA:854,46
-DA:857,46
-DA:858,46
-DA:936,195
-DA:939,488
-DA:941,98
-DA:942,98
-DA:943,98
-DA:944,98
-DA:946,195
-DA:1133,46
-DA:1135,46
-DA:1136,46
-DA:1137,46
-DA:1138,161
-DA:1140,69
-DA:1141,69
-DA:1142,69
-DA:1144,46
-DA:1145,46
-DA:1147,24
-DA:1148,18
-DA:1150,6
-DA:1152,28
-DA:1153,28
-DA:1154,0
-BA:850,2
-BA:850,1
-BA:850,2
-BA:850,2
-BA:850,2
-BA:850,2
-BA:939,2
-BA:939,2
-BA:939,2
-BA:939,2
-BA:939,2
-BA:939,2
-BA:939,2
-BA:939,2
-BA:1138,2
-BA:1138,2
-BA:1142,2
-BA:1142,2
-BA:1145,2
-BA:1145,2
-BA:1147,2
-BA:1147,2
-BA:1152,2
-BA:1152,1
-LF:101
-LH:97
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:97,_ZNSt20__uninitialized_copyILb1EE18uninitialized_copyIPcS2_EET0_T_S4_S3_
-FN:113,_ZSt18uninitialized_copyIPcS0_ET0_T_S2_S1_
-FN:261,_ZSt22__uninitialized_copy_aIPcS0_cET0_T_S2_S1_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPcS0_SaIcEET0_T_S3_S2_RT1_
-FN:97,_ZNSt20__uninitialized_copyILb1EE18uninitialized_copyIPPN6wibble11commandline6OptionES6_EET0_T_S8_S7_
-FN:113,_ZSt18uninitialized_copyIPPN6wibble11commandline6OptionES4_ET0_T_S6_S5_
-FN:261,_ZSt22__uninitialized_copy_aIPPN6wibble11commandline6OptionES4_S3_ET0_T_S6_S5_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPPN6wibble11commandline6OptionES4_SaIS3_EET0_T_S7_S6_RT1_
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyIPSsS2_EET0_T_S4_S3_
-FN:113,_ZSt18uninitialized_copyIPSsS0_ET0_T_S2_S1_
-FN:261,_ZSt22__uninitialized_copy_aIPSsS0_SsET0_T_S2_S1_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPSsS0_SaISsEET0_T_S3_S2_RT1_
-DA:73,0
-DA:75,0
-DA:78,0
-DA:79,0
-DA:81,0
-DA:83,0
-DA:85,0
-DA:86,0
-DA:97,114
-DA:98,114
-DA:113,114
-DA:122,114
-DA:261,114
-DA:262,114
-DA:268,114
-DA:272,114
-BA:78,0
-BA:78,0
-BA:79,0
-BA:79,0
-LF:16
-LH:8
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:404,_ZNKSt6vectorISsSaISsEE3endEv
-FN:386,_ZNKSt6vectorISsSaISsEE5beginEv
-FN:79,_ZNSt12_Vector_baseIcSaIcEE12_Vector_implD1Ev
-FN:97,_ZNSt12_Vector_baseIcSaIcEE19_M_get_Tp_allocatorEv
-FN:97,_ZNSt12_Vector_baseIPN6wibble11commandline6OptionESaIS3_EE19_M_get_Tp_allocatorEv
-FN:97,_ZNSt12_Vector_baseIPN6wibble11commandline11OptionGroupESaIS3_EE19_M_get_Tp_allocatorEv
-FN:97,_ZNSt12_Vector_baseIPN6wibble11commandline6EngineESaIS3_EE19_M_get_Tp_allocatorEv
-FN:395,_ZNSt6vectorISsSaISsEE3endEv
-FN:377,_ZNSt6vectorISsSaISsEE5beginEv
-FN:526,_ZNKSt6vectorISsSaISsEE5emptyEv
-FN:84,_ZNSt12_Vector_baseIcSaIcEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseIcSaIcEEC2Ev
-FN:213,_ZNSt6vectorIcSaIcEEC1Ev
-FN:395,_ZNSt6vectorIcSaIcEE3endEv
-FN:395,_ZNSt6vectorIPN6wibble11commandline6OptionESaIS3_EE3endEv
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:484,_ZNKSt6vectorISsSaISsEE4sizeEv
-FN:484,_ZNKSt6vectorIcSaIcEE4sizeEv
-FN:79,_ZNSt12_Vector_baseIPN6wibble11commandline6OptionESaIS3_EE12_Vector_implD1Ev
-FN:484,_ZNKSt6vectorIPN6wibble11commandline6OptionESaIS3_EE4sizeEv
-FN:79,_ZNSt12_Vector_baseIPN6wibble11commandline11OptionGroupESaIS3_EE12_Vector_implD1Ev
-FN:79,_ZNSt12_Vector_baseIPN6wibble11commandline6EngineESaIS3_EE12_Vector_implD1Ev
-FN:84,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseISsSaISsEEC2Ev
-FN:213,_ZNSt6vectorISsSaISsEEC1Ev
-FN:101,_ZNKSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:489,_ZNKSt6vectorISsSaISsEE8max_sizeEv
-FN:101,_ZNKSt12_Vector_baseIcSaIcEE19_M_get_Tp_allocatorEv
-FN:489,_ZNKSt6vectorIcSaIcEE8max_sizeEv
-FN:84,_ZNSt12_Vector_baseIPN6wibble11commandline6OptionESaIS3_EE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseIPN6wibble11commandline6OptionESaIS3_EEC2Ev
-FN:213,_ZNSt6vectorIPN6wibble11commandline6OptionESaIS3_EEC1Ev
-FN:101,_ZNKSt12_Vector_baseIPN6wibble11commandline6OptionESaIS3_EE19_M_get_Tp_allocatorEv
-FN:489,_ZNKSt6vectorIPN6wibble11commandline6OptionESaIS3_EE8max_sizeEv
-FN:84,_ZNSt12_Vector_baseIPN6wibble11commandline11OptionGroupESaIS3_EE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseIPN6wibble11commandline11OptionGroupESaIS3_EEC2Ev
-FN:213,_ZNSt6vectorIPN6wibble11commandline11OptionGroupESaIS3_EEC1Ev
-FN:84,_ZNSt12_Vector_baseIPN6wibble11commandline6EngineESaIS3_EE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseIPN6wibble11commandline6EngineESaIS3_EEC2Ev
-FN:213,_ZNSt6vectorIPN6wibble11commandline6EngineESaIS3_EEC1Ev
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:147,_ZNSt12_Vector_baseIPN6wibble11commandline6EngineESaIS3_EE13_M_deallocateEPS3_j
-FN:135,_ZNSt12_Vector_baseIPN6wibble11commandline6EngineESaIS3_EED2Ev
-FN:299,_ZNSt6vectorIPN6wibble11commandline6EngineESaIS3_EED1Ev
-FN:147,_ZNSt12_Vector_baseIPN6wibble11commandline6OptionESaIS3_EE13_M_deallocateEPS3_j
-FN:135,_ZNSt12_Vector_baseIPN6wibble11commandline6OptionESaIS3_EED2Ev
-FN:299,_ZNSt6vectorIPN6wibble11commandline6OptionESaIS3_EED1Ev
-FN:147,_ZNSt12_Vector_baseIPN6wibble11commandline11OptionGroupESaIS3_EE13_M_deallocateEPS3_j
-FN:135,_ZNSt12_Vector_baseIPN6wibble11commandline11OptionGroupESaIS3_EED2Ev
-FN:299,_ZNSt6vectorIPN6wibble11commandline11OptionGroupESaIS3_EED1Ev
-FN:147,_ZNSt12_Vector_baseIcSaIcEE13_M_deallocateEPcj
-FN:135,_ZNSt12_Vector_baseIcSaIcEED2Ev
-FN:299,_ZNSt6vectorIcSaIcEED1Ev
-FN:143,_ZNSt12_Vector_baseIcSaIcEE11_M_allocateEj
-FN:143,_ZNSt12_Vector_baseISsSaISsEE11_M_allocateEj
-FN:143,_ZNSt12_Vector_baseIPN6wibble11commandline6OptionESaIS3_EE11_M_allocateEj
-FN:1075,_ZNKSt6vectorIcSaIcEE12_M_check_lenEjPKc
-FN:686,_ZNSt6vectorIcSaIcEE9push_backERKc
-FN:1075,_ZNKSt6vectorISsSaISsEE12_M_check_lenEjPKc
-FN:1075,_ZNKSt6vectorIPN6wibble11commandline6OptionESaIS3_EE12_M_check_lenEjPKc
-FN:686,_ZNSt6vectorIPN6wibble11commandline6OptionESaIS3_EE9push_backERKS3_
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-FN:686,_ZNSt6vectorISsSaISsEE9push_backERKSs
-DA:79,97
-DA:84,97
-DA:85,97
-DA:86,97
-DA:97,301
-DA:98,301
-DA:101,114
-DA:102,114
-DA:108,97
-DA:109,97
-DA:135,97
-DA:136,97
-DA:137,97
-DA:143,57
-DA:144,57
-DA:147,165
-DA:149,165
-DA:150,68
-DA:151,165
-DA:213,97
-DA:214,97
-DA:299,97
-DA:300,97
-DA:301,97
-DA:377,0
-DA:378,0
-DA:386,0
-DA:387,0
-DA:395,57
-DA:396,57
-DA:404,0
-DA:405,0
-DA:484,228
-DA:485,228
-DA:489,114
-DA:490,114
-DA:526,0
-DA:527,0
-DA:686,57
-DA:688,57
-DA:690,0
-DA:691,0
-DA:694,57
-DA:695,57
-DA:1075,57
-DA:1077,57
-DA:1078,0
-DA:1080,57
-DA:1081,57
-BA:144,2
-BA:144,1
-BA:144,0
-BA:144,0
-BA:144,2
-BA:144,1
-BA:149,0
-BA:149,0
-BA:149,2
-BA:149,2
-BA:149,2
-BA:149,2
-BA:149,2
-BA:149,2
-BA:149,2
-BA:149,2
-BA:688,1
-BA:688,2
-BA:688,1
-BA:688,2
-BA:688,0
-BA:688,0
-BA:1077,1
-BA:1077,2
-BA:1077,0
-BA:1077,0
-BA:1077,1
-BA:1077,2
-BA:1081,2
-BA:1081,1
-BA:1081,1
-BA:1081,2
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,2
-BA:1081,1
-BA:1081,1
-BA:1081,2
-LF:49
-LH:38
-end_of_record
-SF:/usr/include/c++/4.3/bits/stream_iterator.h
-FN:181,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERSoPKc
-FN:185,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERKS2_
-FN:202,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEdeEv
-FN:206,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEppEv
-FN:191,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEaSERKSs
-DA:181,0
-DA:182,0
-DA:185,0
-DA:186,0
-DA:191,0
-DA:196,0
-DA:197,0
-DA:198,0
-DA:202,0
-DA:203,0
-DA:206,0
-DA:207,0
-BA:197,0
-BA:197,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/vector.tcc
-FN:283,_ZNSt6vectorIcSaIcEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPcS1_EERKc
-FN:283,_ZNSt6vectorIPN6wibble11commandline6OptionESaIS3_EE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPS3_S5_EERKS3_
-FN:283,_ZNSt6vectorISsSaISsEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPSsS1_EERKSs
-DA:283,57
-DA:286,57
-DA:288,0
-DA:291,0
-DA:293,0
-DA:295,0
-DA:299,0
-DA:307,57
-DA:308,57
-DA:309,57
-DA:316,57
-DA:321,57
-DA:323,57
-DA:324,57
-DA:330,0
-DA:332,0
-DA:333,0
-DA:334,0
-DA:336,57
-DA:338,57
-DA:341,57
-DA:342,57
-DA:343,57
-DA:345,57
-BA:286,1
-BA:286,2
-BA:286,1
-BA:286,2
-BA:286,0
-BA:286,0
-LF:24
-LH:15
-end_of_record
-SF:/usr/include/c++/4.3/exception
-FN:59,_ZNSt9exceptionC2Ev
-DA:59,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:107,_ZN9__gnu_cxx13new_allocatorIcE9constructEPcRKc
-FN:107,_ZN9__gnu_cxx13new_allocatorIPN6wibble11commandline6OptionEE9constructEPS4_RKS4_
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIPN6wibble11commandline7ManagedEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKcPN6wibble11commandline6OptionEEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsPN6wibble11commandline6OptionEEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsPN6wibble11commandline6EngineEEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt10_List_nodeISsEED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:118,_ZN9__gnu_cxx13new_allocatorIPN6wibble11commandline7ManagedEE7destroyEPS4_
-FN:76,_ZN9__gnu_cxx13new_allocatorIPN6wibble11commandline6OptionEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIPN6wibble11commandline11OptionGroupEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIPN6wibble11commandline6EngineEED2Ev
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKcPN6wibble11commandline6OptionEEE7destroyEPS7_
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISsE8max_sizeEv
-FN:107,_ZN9__gnu_cxx13new_allocatorIPN6wibble11commandline7ManagedEE9constructEPS4_RKS4_
-FN:76,_ZN9__gnu_cxx13new_allocatorIPN6wibble11commandline7ManagedEED2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorIcE8max_sizeEv
-FN:69,_ZN9__gnu_cxx13new_allocatorIPN6wibble11commandline6OptionEEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorIPN6wibble11commandline6OptionEE8max_sizeEv
-FN:69,_ZN9__gnu_cxx13new_allocatorIPN6wibble11commandline11OptionGroupEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorIPN6wibble11commandline6EngineEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKcPN6wibble11commandline6OptionEEEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKcPN6wibble11commandline6OptionEEED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsPN6wibble11commandline6OptionEEEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsPN6wibble11commandline6OptionEEED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsPN6wibble11commandline6EngineEEEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsPN6wibble11commandline6EngineEEED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIPN6wibble11commandline7ManagedEEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt10_List_nodeISsEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorIPN6wibble11commandline7ManagedEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKcPN6wibble11commandline6OptionEEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsPN6wibble11commandline6OptionEEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsPN6wibble11commandline6EngineEEEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt10_List_nodeISsEE8max_sizeEv
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIPN6wibble11commandline7ManagedEEE8max_sizeEv
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsPN6wibble11commandline6EngineEEEE10deallocateEPS9_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsPN6wibble11commandline6OptionEEEE10deallocateEPS9_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKcPN6wibble11commandline6OptionEEEE10deallocateEPS9_j
-FN:97,_ZN9__gnu_cxx13new_allocatorIPN6wibble11commandline6EngineEE10deallocateEPS4_j
-FN:97,_ZN9__gnu_cxx13new_allocatorIPN6wibble11commandline6OptionEE10deallocateEPS4_j
-FN:97,_ZN9__gnu_cxx13new_allocatorIPN6wibble11commandline11OptionGroupEE10deallocateEPS4_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIPN6wibble11commandline7ManagedEEE10deallocateEPS6_j
-FN:97,_ZN9__gnu_cxx13new_allocatorIcE10deallocateEPcj
-FN:97,_ZN9__gnu_cxx13new_allocatorISt10_List_nodeISsEE10deallocateEPS2_j
-FN:107,_ZN9__gnu_cxx13new_allocatorISsE9constructEPSsRKSs
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIPN6wibble11commandline7ManagedEEE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorIcE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorISsE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorIPN6wibble11commandline6OptionEE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorISt10_List_nodeISsEE8allocateEjPKv
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsPN6wibble11commandline6EngineEEE7destroyEPS7_
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsPN6wibble11commandline6OptionEEE7destroyEPS7_
-FN:118,_ZN9__gnu_cxx13new_allocatorISsE7destroyEPSs
-DA:69,328
-DA:71,0
-DA:76,328
-DA:87,139
-DA:89,139
-DA:90,0
-DA:92,139
-DA:97,200
-DA:98,200
-DA:101,253
-DA:102,253
-DA:107,6823
-DA:108,6823
-DA:118,98
-BA:89,1
-BA:89,2
-BA:89,1
-BA:89,2
-BA:89,0
-BA:89,0
-BA:89,1
-BA:89,2
-BA:89,1
-BA:89,2
-BA:108,2
-BA:108,1
-BA:108,2
-BA:108,1
-BA:108,2
-BA:108,1
-BA:108,0
-BA:108,0
-LF:14
-LH:12
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/istream
-FN:585,_ZNSiC2Ev
-FN:105,_ZNSiD2Ev
-FN:804,_ZNSdC2Ev
-FN:801,_ZNSdD2Ev
-DA:105,0
-DA:106,0
-DA:585,0
-DA:586,0
-DA:587,0
-DA:801,0
-DA:804,0
-DA:805,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:195,_ZNSolsEj
-FN:177,_ZNSolsEb
-FN:229,_ZNSolsEPKv
-DA:95,0
-DA:112,0
-DA:117,0
-DA:177,0
-DA:178,0
-DA:195,0
-DA:199,0
-DA:229,0
-DA:230,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:20
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:509,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:536,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:555,_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-DA:509,0
-DA:510,0
-DA:511,0
-DA:536,0
-DA:537,0
-DA:555,0
-DA:556,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-LF:25
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/exception.h
-FN:190,_ZNK6wibble9exception7Generic4typeEv
-FN:263,_ZNK6wibble9exception11Consistency4typeEv
-FN:265,_ZNK6wibble9exception11Consistency4descEv
-FN:213,_ZNK6wibble9exception7Generic4whatEv
-FN:193,_ZNK6wibble9exception7Generic4descEv
-FN:109,_ZN6wibble9exception10AddContext7contextEv
-FN:154,_ZNK6wibble9exception7Context13formatContextEv
-FN:205,_ZNK6wibble9exception7Generic8fullInfoEv
-FN:137,_ZN6wibble9exception7ContextD2Ev
-FN:117,_ZN6wibble9exception10AddContext11copyContextISt20back_insert_iteratorISt6vectorISsSaISsEEEEEvT_
-FN:153,_ZN6wibble9exception7Context10addContextERKSs
-FN:147,_ZN6wibble9exception7ContextC2ERKSs
-FN:186,_ZN6wibble9exception7GenericC2ERKSs
-FN:187,_ZN6wibble9exception7GenericD0Ev
-FN:187,_ZN6wibble9exception7GenericD1Ev
-FN:187,_ZN6wibble9exception7GenericD2Ev
-FN:259,_ZN6wibble9exception11ConsistencyC1ERKSsS3_
-FN:261,_ZN6wibble9exception11ConsistencyD0Ev
-FN:261,_ZN6wibble9exception11ConsistencyD1Ev
-DA:109,0
-DA:110,0
-DA:111,0
-DA:112,0
-DA:113,0
-DA:117,0
-DA:118,0
-DA:119,0
-DA:137,0
-DA:147,0
-DA:148,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:153,0
-DA:154,0
-DA:155,0
-DA:156,0
-DA:157,0
-DA:159,0
-DA:161,0
-DA:162,0
-DA:163,0
-DA:186,0
-DA:187,0
-DA:190,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:205,0
-DA:206,0
-DA:207,0
-DA:209,0
-DA:210,0
-DA:213,0
-DA:259,0
-DA:260,0
-DA:261,0
-DA:263,0
-DA:265,0
-DA:266,0
-DA:267,0
-DA:268,0
-DA:269,0
-BA:110,0
-BA:110,0
-BA:156,0
-BA:156,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:207,0
-BA:207,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:267,0
-BA:267,0
-LF:44
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/string.h
-FN:336,_ZNK6wibble3str5Split14const_iteratordeEv
-FN:340,_ZNK6wibble3str5Split14const_iteratorptEv
-FN:350,_ZNK6wibble3str5Split14const_iteratorneERKS2_
-FN:298,_ZN6wibble3str5Split14const_iteratorC1ERKSsS4_b
-FN:367,_ZNK6wibble3str5Split3endEv
-FN:361,_ZN6wibble3str5SplitC1ERKSsS3_
-FN:287,_ZN6wibble3str5Split14const_iteratorD1Ev
-FN:280,_ZN6wibble3str5SplitD1Ev
-FN:300,_ZN6wibble3str5Split14const_iteratorppEv
-FN:294,_ZN6wibble3str5Split14const_iteratorC1ERKSsS4_
-FN:366,_ZNK6wibble3str5Split5beginEv
-FN:236,_ZN6wibble3str8joinpathERKSsS2_
-DA:236,0
-DA:238,0
-DA:239,0
-DA:240,0
-DA:241,0
-DA:243,0
-DA:244,0
-DA:245,0
-DA:247,0
-DA:249,0
-DA:250,0
-DA:252,0
-DA:280,0
-DA:287,0
-DA:294,0
-DA:296,0
-DA:297,0
-DA:298,0
-DA:300,0
-DA:302,0
-DA:303,0
-DA:307,0
-DA:308,0
-DA:309,0
-DA:311,0
-DA:313,0
-DA:314,0
-DA:316,0
-DA:317,0
-DA:321,0
-DA:322,0
-DA:325,0
-DA:336,0
-DA:338,0
-DA:340,35
-DA:342,35
-DA:350,0
-DA:354,0
-DA:361,0
-DA:366,0
-DA:367,0
-BA:238,0
-BA:238,0
-BA:240,0
-BA:240,0
-BA:243,0
-BA:243,0
-BA:244,0
-BA:244,0
-BA:249,0
-BA:249,0
-BA:302,0
-BA:302,0
-BA:307,0
-BA:307,0
-BA:308,0
-BA:308,0
-BA:314,0
-BA:314,0
-LF:41
-LH:2
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/string.cpp
-FN:99,_ZN6wibble3strL9invbase64IcEEKcRKT_
-FN:295,_Z41__static_initialization_and_destruction_0ii
-FN:295,_GLOBAL__I_string.cpp
-FN:107,_ZN6wibble3str12encodeBase64ERKSs
-FN:177,_ZN6wibble3strL16stripYamlCommentERKSs
-FN:211,_ZN6wibble3str10YamlStream14const_iteratorppEv
-FN:192,_ZN6wibble3str10YamlStream14const_iteratorC1ERSi
-FN:192,_ZN6wibble3str10YamlStream14const_iteratorC2ERSi
-FN:140,_ZN6wibble3str12decodeBase64ERKSs
-FN:77,_ZN6wibble3str9urldecodeERKSs
-FN:59,_ZN6wibble3str9urlencodeERKSs
-FN:32,_ZN6wibble3str8normpathERKSs
-DA:32,13
-DA:34,13
-DA:35,13
-DA:36,3
-DA:37,13
-DA:38,74
-DA:40,48
-DA:41,31
-DA:42,10
-DA:43,0
-DA:44,10
-DA:45,5
-DA:47,5
-DA:49,21
-DA:50,13
-DA:51,13
-DA:52,2
-DA:53,11
-DA:54,19
-DA:55,8
-DA:56,11
-DA:59,6
-DA:61,6
-DA:62,74
-DA:64,68
-DA:67,32
-DA:70,36
-DA:71,36
-DA:74,0
-DA:77,8
-DA:79,8
-DA:80,76
-DA:82,70
-DA:85,37
-DA:86,2
-DA:87,35
-DA:88,35
-DA:91,33
-DA:93,6
-DA:99,72
-DA:102,72
-DA:103,72
-DA:104,72
-DA:107,20
-DA:109,20
-DA:111,56
-DA:115,36
-DA:116,18
-DA:119,18
-DA:120,18
-DA:121,12
-DA:122,18
-DA:123,6
-DA:128,180
-DA:129,144
-DA:133,20
-DA:134,30
-DA:135,18
-DA:137,0
-DA:140,10
-DA:142,10
-DA:144,28
-DA:148,18
-DA:153,9
-DA:155,9
-DA:156,9
-DA:157,9
-DA:158,9
-DA:159,9
-DA:160,9
-DA:161,9
-DA:165,18
-DA:166,18
-DA:167,18
-DA:171,19
-DA:172,9
-DA:174,0
-DA:177,10
-DA:179,10
-DA:180,126
-DA:182,120
-DA:183,4
-DA:184,116
-DA:187,31
-DA:188,11
-DA:189,0
-DA:192,6
-DA:193,6
-DA:196,15
-DA:198,7
-DA:199,7
-DA:200,4
-DA:203,6
-DA:205,2
-DA:208,4
-DA:209,6
-DA:211,11
-DA:214,11
-DA:215,11
-DA:219,11
-DA:221,4
-DA:222,4
-DA:225,7
-DA:227,0
-DA:230,7
-DA:231,7
-DA:233,0
-DA:236,7
-DA:239,13
-DA:243,7
-DA:246,7
-DA:247,8
-DA:249,15
-DA:250,15
-DA:251,15
-DA:253,13
-DA:255,11
-DA:257,10
-DA:259,3
-DA:260,3
-DA:267,7
-DA:270,7
-DA:272,3
-DA:275,3
-DA:276,2
-DA:279,7
-DA:282,3
-DA:286,4
-DA:287,7
-DA:290,7
-DA:295,9
-BA:35,2
-BA:35,2
-BA:38,2
-BA:38,2
-BA:40,2
-BA:40,2
-BA:40,2
-BA:40,2
-BA:40,2
-BA:40,2
-BA:41,2
-BA:41,2
-BA:42,1
-BA:42,2
-BA:44,2
-BA:44,2
-BA:51,2
-BA:51,2
-BA:54,2
-BA:54,2
-BA:62,2
-BA:62,2
-BA:64,2
-BA:64,2
-BA:64,2
-BA:64,2
-BA:64,2
-BA:64,2
-BA:64,2
-BA:64,2
-BA:64,2
-BA:64,2
-BA:64,1
-BA:64,2
-BA:64,2
-BA:64,1
-BA:64,2
-BA:64,1
-BA:64,2
-BA:64,2
-BA:64,2
-BA:64,2
-BA:64,2
-BA:64,1
-BA:64,2
-BA:64,2
-BA:64,2
-BA:64,2
-BA:64,2
-BA:64,2
-BA:80,2
-BA:80,2
-BA:82,2
-BA:82,2
-BA:85,2
-BA:85,2
-BA:102,1
-BA:102,2
-BA:103,1
-BA:103,2
-BA:111,2
-BA:111,2
-BA:115,2
-BA:115,2
-BA:120,2
-BA:120,2
-BA:122,2
-BA:122,2
-BA:128,2
-BA:128,2
-BA:133,2
-BA:133,2
-BA:134,2
-BA:134,2
-BA:144,2
-BA:144,2
-BA:148,2
-BA:148,2
-BA:156,2
-BA:156,1
-BA:158,2
-BA:158,1
-BA:160,2
-BA:160,1
-BA:171,2
-BA:171,2
-BA:180,2
-BA:180,2
-BA:182,2
-BA:182,2
-BA:187,2
-BA:187,2
-BA:187,2
-BA:187,2
-BA:187,2
-BA:187,2
-BA:196,2
-BA:196,2
-BA:196,0
-BA:196,0
-BA:199,2
-BA:199,2
-BA:199,0
-BA:199,0
-BA:203,2
-BA:203,2
-BA:203,2
-BA:203,1
-BA:203,2
-BA:203,2
-BA:203,0
-BA:203,0
-BA:203,0
-BA:203,0
-BA:203,0
-BA:203,0
-BA:219,2
-BA:219,2
-BA:225,1
-BA:225,2
-BA:231,1
-BA:231,2
-BA:239,2
-BA:239,2
-BA:239,2
-BA:239,2
-BA:239,2
-BA:239,2
-BA:250,2
-BA:250,1
-BA:251,2
-BA:251,2
-BA:253,2
-BA:253,2
-BA:255,2
-BA:255,2
-BA:257,2
-BA:257,2
-BA:267,2
-BA:267,1
-BA:267,2
-BA:267,2
-BA:267,2
-BA:267,2
-BA:270,2
-BA:270,2
-BA:275,2
-BA:275,2
-BA:279,2
-BA:279,2
-BA:295,2
-BA:295,1
-BA:295,2
-BA:295,1
-LF:131
-LH:124
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaISsED2Ev
-FN:98,_ZNSaISsEC2Ev
-FN:106,_ZNSaIPSsED1Ev
-FN:100,_ZNSaISsEC2ERKS_
-FN:104,_ZNSaIPSsEC1ISsEERKSaIT_E
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,13
-DA:101,13
-DA:104,52
-DA:106,52
-DA:118,0
-DA:119,0
-LF:7
-LH:4
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:184,_ZNKSt9basic_iosIcSt11char_traitsIcEE3eofEv
-FN:195,_ZNKSt9basic_iosIcSt11char_traitsIcEE4failEv
-FN:119,_ZNKSt9basic_iosIcSt11char_traitsIcEEntEv
-FN:115,_ZNKSt9basic_iosIcSt11char_traitsIcEEcvPvEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:115,0
-DA:116,0
-DA:119,0
-DA:120,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:184,0
-DA:185,0
-DA:195,0
-DA:196,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:116,0
-BA:116,0
-BA:276,0
-BA:276,0
-LF:22
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:1534,_ZNKSs5c_strEv
-FN:701,_ZNKSsixEj
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:612,_ZNKSs6lengthEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:543,_ZNKSs5beginEv
-FN:562,_ZNKSs3endEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:192,_ZNKSs4_Rep12_M_is_sharedEv
-FN:652,_ZNKSs8capacityEv
-FN:188,_ZNKSs4_Rep12_M_is_leakedEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:870,_ZNSs9push_backEc
-FN:791,_ZNSspLEc
-FN:773,_ZNSspLERKSs
-FN:835,_ZNSs6appendEPKc
-FN:782,_ZNSspLEPKc
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:679,_ZNSs5clearEv
-FN:2461,_ZSt7getlineIcSt11char_traitsIcESaIcEERSt13basic_istreamIT_T0_ES7_RSbIS4_S5_T1_E
-FN:501,_ZNSsaSERKSs
-FN:299,_ZNSs7_M_leakEv
-FN:718,_ZNSsixEj
-FN:306,_ZNKSs8_M_checkEjPKc
-FN:1923,_ZNKSs6substrEjj
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2121,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-FN:644,_ZNSs6resizeEj
-FN:2188,_ZSteqIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_EPKS3_
-FN:1579,_ZNKSs4findERKSsj
-FN:2136,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S3_
-DA:178,0
-DA:183,0
-DA:184,0
-DA:188,0
-DA:189,0
-DA:192,0
-DA:193,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:299,0
-DA:301,0
-DA:302,0
-DA:303,0
-DA:306,0
-DA:308,0
-DA:309,0
-DA:310,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:543,0
-DA:544,0
-DA:562,0
-DA:563,0
-DA:606,0
-DA:607,0
-DA:612,0
-DA:613,0
-DA:644,0
-DA:645,0
-DA:652,0
-DA:653,0
-DA:679,0
-DA:680,0
-DA:686,0
-DA:687,0
-DA:701,0
-DA:704,0
-DA:718,0
-DA:724,0
-DA:725,0
-DA:773,0
-DA:774,0
-DA:782,0
-DA:783,0
-DA:791,0
-DA:793,0
-DA:794,0
-DA:835,0
-DA:838,0
-DA:870,0
-DA:872,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:877,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:1579,0
-DA:1580,0
-DA:1923,0
-DA:1925,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2121,0
-DA:2123,0
-DA:2124,0
-DA:2125,0
-DA:2136,0
-DA:2140,0
-DA:2141,0
-DA:2142,0
-DA:2188,0
-DA:2189,0
-DA:2421,0
-DA:2425,0
-DA:2461,0
-DA:2462,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:301,0
-BA:301,0
-BA:308,0
-BA:308,0
-BA:341,0
-BA:341,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:873,0
-LF:120
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-FN:668,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_EPKS3_RKS6_
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-DA:668,0
-DA:673,0
-DA:674,0
-DA:675,0
-DA:676,0
-DA:677,0
-DA:678,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:23
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/deque.tcc
-FN:694,_ZNSt5dequeISsSaISsEE19_M_destroy_data_auxESt15_Deque_iteratorISsRSsPSsES5_
-FN:397,_ZNSt5dequeISsSaISsEE15_M_pop_back_auxEv
-FN:766,_ZNSt5dequeISsSaISsEE17_M_reallocate_mapEjb
-FN:335,_ZNSt5dequeISsSaISsEE16_M_push_back_auxERKSs
-DA:335,0
-DA:338,0
-DA:339,0
-DA:346,0
-DA:348,0
-DA:350,0
-DA:352,0
-DA:354,0
-DA:355,0
-DA:357,0
-DA:397,0
-DA:399,0
-DA:400,0
-DA:401,0
-DA:402,0
-DA:403,0
-DA:694,26
-DA:696,26
-DA:698,0
-DA:701,26
-DA:703,0
-DA:705,0
-DA:709,26
-DA:711,26
-DA:766,0
-DA:769,0
-DA:770,0
-DA:773,0
-DA:775,0
-DA:778,0
-DA:779,0
-DA:783,0
-DA:791,0
-DA:793,0
-DA:794,0
-DA:796,0
-DA:799,0
-DA:801,0
-DA:802,0
-DA:805,0
-DA:806,0
-DA:807,0
-BA:696,1
-BA:696,2
-BA:701,1
-BA:701,2
-BA:773,0
-BA:773,0
-BA:775,0
-BA:775,0
-BA:778,0
-BA:778,0
-BA:794,0
-BA:794,0
-LF:42
-LH:5
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:159,_ZStanSt12_Ios_IostateS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:159,0
-DA:160,0
-DA:163,0
-DA:164,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb0EE3__bES7_
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb0EE3__bES6_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb1EE3__bES7_
-FN:268,_ZNSt12__niter_baseISt16ostream_iteratorISscSt11char_traitsIcEELb0EE3__bES3_
-FN:286,_ZNSt12__miter_baseIPSsLb0EE3__bES0_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb1EE3__bES6_
-FN:268,_ZNSt12__niter_baseISt20back_insert_iteratorISt6vectorISsSaISsEEELb0EE3__bES4_
-FN:268,_ZNSt12__niter_baseIPSsLb0EE3__bES0_
-FN:286,_ZNSt12__miter_baseIPPSsLb0EE3__bES1_
-FN:268,_ZNSt12__niter_baseIPPSsLb0EE3__bES1_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPKSsSt16ostream_iteratorISscSt11char_traitsIcEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPKSsSt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_SD_SC_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET0_T_SD_SC_
-FN:539,_ZNSt20__copy_move_backwardILb0ELb0ESt26random_access_iterator_tagE13__copy_move_bIPSsS3_EET0_T_S5_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0EPSsS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPSsS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardIPSsS0_ET0_T_S2_S1_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET1_T0_SA_S9_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET0_T_SA_S9_
-FN:569,_ZNSt20__copy_move_backwardILb0ELb1ESt26random_access_iterator_tagE13__copy_move_bIPSsEEPT_PKS4_S7_S5_
-FN:579,_ZSt22__copy_move_backward_aILb0EPPSsS1_ET1_T0_S3_S2_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPPSsS1_ET1_T0_S3_S2_
-FN:624,_ZSt13copy_backwardIPPSsS1_ET0_T_S3_S2_
-FN:375,_ZNSt11__copy_moveILb0ELb1ESt26random_access_iterator_tagE8__copy_mIPSsEEPT_PKS4_S7_S5_
-FN:385,_ZSt13__copy_move_aILb0EPPSsS1_ET1_T0_S3_S2_
-FN:430,_ZSt14__copy_move_a2ILb0EPPSsS1_ET1_T0_S3_S2_
-FN:456,_ZSt4copyIPPSsS1_ET0_T_S3_S2_
-DA:210,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:268,0
-DA:269,0
-DA:276,0
-DA:277,0
-DA:286,0
-DA:287,0
-DA:337,0
-DA:340,0
-DA:342,0
-DA:343,0
-DA:344,0
-DA:346,0
-DA:375,0
-DA:377,0
-DA:379,0
-DA:385,0
-DA:393,0
-DA:396,0
-DA:430,0
-DA:435,0
-DA:456,0
-DA:466,0
-DA:539,0
-DA:542,0
-DA:543,0
-DA:544,0
-DA:569,0
-DA:571,0
-DA:572,0
-DA:573,0
-DA:579,0
-DA:587,0
-DA:592,0
-DA:597,0
-DA:602,0
-DA:624,0
-DA:636,0
-BA:215,0
-BA:215,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:542,0
-BA:542,0
-LF:41
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-FN:97,_ZSt8_DestroyISt15_Deque_iteratorISsRSsPSsEEvT_S4_
-DA:87,0
-DA:88,0
-DA:97,0
-DA:101,0
-DA:103,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-BA:101,0
-BA:101,0
-BA:101,0
-BA:101,0
-LF:9
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_deque.h
-FN:82,_ZSt16__deque_buf_sizej
-FN:434,_ZNSt11_Deque_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:127,_ZNSt15_Deque_iteratorISsRSsPSsEC1ERKS2_
-FN:868,_ZNSt5dequeISsSaISsEE3endEv
-FN:851,_ZNSt5dequeISsSaISsEE5beginEv
-FN:438,_ZNKSt11_Deque_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:132,_ZNKSt15_Deque_iteratorISsRSsPSsEdeEv
-FN:240,_ZSteqISsRSsPSsEbRKSt15_Deque_iteratorIT_T0_T1_ES8_
-FN:990,_ZNKSt5dequeISsSaISsEE5emptyEv
-FN:416,_ZNSt11_Deque_baseISsSaISsEE11_Deque_implD1Ev
-FN:124,_ZNSt15_Deque_iteratorISsRSsPSsEC1Ev
-FN:670,_ZNSt5dequeISsSaISsEE14_S_buffer_sizeEv
-FN:127,_ZNSt15_Deque_iteratorISsRKSsPS0_EC1ERKS_ISsRSsPSsE
-FN:877,_ZNKSt5dequeISsSaISsEE3endEv
-FN:859,_ZNKSt5dequeISsSaISsEE5beginEv
-FN:422,_ZNSt11_Deque_baseISsSaISsEE11_Deque_implC1Ev
-FN:103,_ZNSt15_Deque_iteratorISsRSsPSsE14_S_buffer_sizeEv
-FN:226,_ZNSt15_Deque_iteratorISsRSsPSsE11_M_set_nodeEPS1_
-FN:160,_ZNSt15_Deque_iteratorISsRSsPSsEmmEv
-FN:1091,_ZNSt5dequeISsSaISsEE4backEv
-FN:324,_ZStmiISsRSsPSsENSt15_Deque_iteratorIT_T0_T1_E15difference_typeERKS6_S9_
-FN:956,_ZNKSt5dequeISsSaISsEE4sizeEv
-FN:427,_ZNSt11_Deque_baseISsSaISsEE11_Deque_implC1ERKS0_
-FN:442,_ZNKSt11_Deque_baseISsSaISsEE20_M_get_map_allocatorEv
-FN:140,_ZNSt15_Deque_iteratorISsRSsPSsEppEv
-FN:132,_ZNKSt15_Deque_iteratorISsRKSsPS0_EdeEv
-FN:240,_ZSteqISsRKSsPS0_EbRKSt15_Deque_iteratorIT_T0_T1_ES9_
-FN:253,_ZStneISsRKSsPS0_EbRKSt15_Deque_iteratorIT_T0_T1_ES9_
-FN:253,_ZStneISsRSsPSsEbRKSt15_Deque_iteratorIT_T0_T1_ES8_
-FN:103,_ZNSt15_Deque_iteratorISsRKSsPS0_E14_S_buffer_sizeEv
-FN:226,_ZNSt15_Deque_iteratorISsRKSsPS0_E11_M_set_nodeEPPSs
-FN:140,_ZNSt15_Deque_iteratorISsRKSsPS0_EppEv
-FN:452,_ZNSt11_Deque_baseISsSaISsEE18_M_deallocate_nodeEPSs
-FN:554,_ZNSt11_Deque_baseISsSaISsEE16_M_destroy_nodesEPPSsS3_
-FN:462,_ZNSt11_Deque_baseISsSaISsEE17_M_deallocate_mapEPPSsj
-FN:476,_ZNSt11_Deque_baseISsSaISsEED2Ev
-FN:446,_ZNSt11_Deque_baseISsSaISsEE16_M_allocate_nodeEv
-FN:536,_ZNSt11_Deque_baseISsSaISsEE15_M_create_nodesEPPSsS3_
-FN:458,_ZNSt11_Deque_baseISsSaISsEE15_M_allocate_mapEj
-FN:497,_ZNSt11_Deque_baseISsSaISsEE17_M_initialize_mapEj
-FN:377,_ZNSt11_Deque_baseISsSaISsEEC2Ev
-FN:695,_ZNSt5dequeISsSaISsEEC1Ev
-FN:381,_ZNSt11_Deque_baseISsSaISsEEC2ERKS0_j
-FN:1601,_ZNSt5dequeISsSaISsEE15_M_destroy_dataESt15_Deque_iteratorISsRSsPSsES5_RKS0_
-FN:775,_ZNSt5dequeISsSaISsEED1Ev
-FN:727,_ZNSt5dequeISsSaISsEEC1ERKS1_
-FN:1217,_ZNSt5dequeISsSaISsEE8pop_backEv
-FN:1666,_ZNSt5dequeISsSaISsEE22_M_reserve_map_at_backEj
-FN:1159,_ZNSt5dequeISsSaISsEE9push_backERKSs
-DA:82,0
-DA:83,0
-DA:103,65
-DA:104,65
-DA:124,52
-DA:125,52
-DA:127,221
-DA:129,221
-DA:132,39
-DA:133,39
-DA:140,0
-DA:142,0
-DA:143,0
-DA:145,0
-DA:146,0
-DA:148,0
-DA:160,39
-DA:162,39
-DA:164,0
-DA:165,0
-DA:167,39
-DA:168,39
-DA:226,52
-DA:228,52
-DA:229,52
-DA:230,52
-DA:231,52
-DA:240,45
-DA:241,45
-DA:253,13
-DA:254,13
-DA:324,13
-DA:329,13
-DA:377,13
-DA:378,13
-DA:379,13
-DA:381,13
-DA:382,13
-DA:383,13
-DA:416,26
-DA:422,13
-DA:424,13
-DA:425,13
-DA:427,13
-DA:429,13
-DA:430,13
-DA:434,65
-DA:435,65
-DA:438,65
-DA:439,65
-DA:442,52
-DA:443,52
-DA:446,26
-DA:448,26
-DA:452,26
-DA:454,26
-DA:455,26
-DA:458,26
-DA:459,26
-DA:462,26
-DA:463,26
-DA:476,26
-DA:478,26
-DA:480,26
-DA:482,26
-DA:484,26
-DA:497,26
-DA:500,26
-DA:502,26
-DA:504,26
-DA:512,26
-DA:513,26
-DA:516,26
-DA:517,0
-DA:519,0
-DA:520,0
-DA:521,0
-DA:522,0
-DA:525,26
-DA:526,26
-DA:527,26
-DA:528,26
-DA:531,26
-DA:536,26
-DA:541,52
-DA:542,26
-DA:544,0
-DA:546,0
-DA:547,0
-DA:549,26
-DA:554,26
-DA:556,52
-DA:557,26
-DA:558,26
-DA:670,0
-DA:671,0
-DA:695,13
-DA:696,13
-DA:727,13
-DA:728,13
-DA:729,13
-DA:731,13
-DA:775,26
-DA:776,26
-DA:851,26
-DA:852,26
-DA:859,13
-DA:860,13
-DA:868,65
-DA:869,65
-DA:877,13
-DA:878,13
-DA:956,13
-DA:957,13
-DA:990,32
-DA:991,32
-DA:1091,39
-DA:1093,39
-DA:1094,39
-DA:1095,39
-DA:1159,24
-DA:1161,24
-DA:1164,24
-DA:1165,24
-DA:1168,0
-DA:1169,24
-DA:1217,24
-DA:1219,24
-DA:1222,24
-DA:1223,24
-DA:1226,0
-DA:1227,24
-DA:1601,26
-DA:1604,26
-DA:1605,26
-DA:1666,0
-DA:1668,0
-DA:1670,0
-DA:1671,0
-BA:83,0
-BA:83,0
-BA:143,0
-BA:143,0
-BA:143,0
-BA:143,0
-BA:162,1
-BA:162,2
-BA:478,2
-BA:478,1
-BA:541,2
-BA:541,2
-BA:556,2
-BA:556,2
-BA:1161,2
-BA:1161,1
-BA:1219,2
-BA:1219,1
-BA:1668,0
-BA:1668,0
-LF:139
-LH:113
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:703,_ZN9__gnu_cxx17__normal_iteratorIPKcSsEppEv
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPKcSsEdeEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKcSsEC1ERKS2_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKcSsE4baseEv
-FN:781,_ZN9__gnu_cxxneIPKcSsEEbRKNS_17__normal_iteratorIT_T0_EES8_
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEdeEv
-FN:398,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEC1ERS2_
-FN:456,_ZSt13back_inserterISt6vectorISsSaISsEEESt20back_insert_iteratorIT_ERS4_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEC1ERKS2_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEE4baseEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEC1ERKS1_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-FN:429,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEdeEv
-FN:434,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEppEv
-FN:412,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEaSERKSs
-DA:398,0
-DA:412,0
-DA:414,0
-DA:415,0
-DA:429,0
-DA:430,0
-DA:434,0
-DA:435,0
-DA:456,0
-DA:457,0
-DA:683,0
-DA:695,0
-DA:696,0
-DA:703,0
-DA:705,0
-DA:706,0
-DA:747,0
-DA:748,0
-DA:769,0
-DA:770,0
-DA:781,0
-DA:782,0
-LF:22
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,0
-DA:166,0
-DA:167,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_pair.h
-FN:84,_ZNSt4pairISsSsEC1Ev
-FN:73,_ZNSt4pairISsSsED1Ev
-DA:73,0
-DA:84,0
-DA:85,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_stack.h
-FN:148,_ZNKSt5stackISsSt5dequeISsSaISsEEE5emptyEv
-FN:161,_ZNSt5stackISsSt5dequeISsSaISsEEE3topEv
-FN:99,_ZNSt5stackISsSt5dequeISsSaISsEEED1Ev
-FN:132,_ZNSt5stackISsSt5dequeISsSaISsEEEC1ERKS2_
-FN:211,_ZNSt5stackISsSt5dequeISsSaISsEEE3popEv
-FN:189,_ZNSt5stackISsSt5dequeISsSaISsEEE4pushERKSs
-DA:99,13
-DA:132,13
-DA:133,13
-DA:148,32
-DA:149,32
-DA:161,39
-DA:164,39
-DA:189,24
-DA:190,24
-DA:211,24
-DA:214,24
-DA:215,24
-LF:12
-LH:12
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyIPSsS2_EET0_T_S4_S3_
-FN:113,_ZSt18uninitialized_copyIPSsS0_ET0_T_S2_S1_
-FN:261,_ZSt22__uninitialized_copy_aIPSsS0_SsET0_T_S2_S1_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPSsS0_SaISsEET0_T_S3_S2_RT1_
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyISt15_Deque_iteratorISsRKSsPS3_ES2_ISsRSsPSsEEET0_T_SB_SA_
-FN:113,_ZSt18uninitialized_copyISt15_Deque_iteratorISsRKSsPS1_ES0_ISsRSsPSsEET0_T_S9_S8_
-FN:261,_ZSt22__uninitialized_copy_aISt15_Deque_iteratorISsRKSsPS1_ES0_ISsRSsPSsESsET0_T_S9_S8_RSaIT1_E
-DA:73,13
-DA:75,13
-DA:78,13
-DA:79,0
-DA:81,0
-DA:83,0
-DA:85,0
-DA:86,0
-DA:113,13
-DA:122,13
-DA:261,13
-DA:262,13
-DA:268,0
-DA:272,0
-BA:78,0
-BA:78,0
-BA:78,1
-BA:78,2
-BA:79,0
-BA:79,0
-BA:79,0
-BA:79,0
-LF:14
-LH:7
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:404,_ZNKSt6vectorISsSaISsEE3endEv
-FN:386,_ZNKSt6vectorISsSaISsEE5beginEv
-FN:484,_ZNKSt6vectorISsSaISsEE4sizeEv
-FN:101,_ZNKSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:395,_ZNSt6vectorISsSaISsEE3endEv
-FN:377,_ZNSt6vectorISsSaISsEE5beginEv
-FN:526,_ZNKSt6vectorISsSaISsEE5emptyEv
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:84,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseISsSaISsEEC2Ev
-FN:213,_ZNSt6vectorISsSaISsEEC1Ev
-FN:489,_ZNKSt6vectorISsSaISsEE8max_sizeEv
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:1075,_ZNKSt6vectorISsSaISsEE12_M_check_lenEjPKc
-FN:143,_ZNSt12_Vector_baseISsSaISsEE11_M_allocateEj
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-FN:686,_ZNSt6vectorISsSaISsEE9push_backERKSs
-DA:79,0
-DA:84,0
-DA:85,0
-DA:86,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:108,0
-DA:109,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:143,0
-DA:144,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:213,0
-DA:214,0
-DA:299,0
-DA:300,0
-DA:301,0
-DA:377,0
-DA:378,0
-DA:386,0
-DA:387,0
-DA:395,0
-DA:396,0
-DA:404,0
-DA:405,0
-DA:484,0
-DA:485,0
-DA:489,0
-DA:490,0
-DA:526,0
-DA:527,0
-DA:686,0
-DA:688,0
-DA:690,0
-DA:691,0
-DA:694,0
-DA:695,0
-DA:1075,0
-DA:1077,0
-DA:1078,0
-DA:1080,0
-DA:1081,0
-BA:144,0
-BA:144,0
-BA:149,0
-BA:149,0
-BA:688,0
-BA:688,0
-BA:1077,0
-BA:1077,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-LF:49
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stream_iterator.h
-FN:181,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERSoPKc
-FN:185,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERKS2_
-FN:202,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEdeEv
-FN:206,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEppEv
-FN:191,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEaSERKSs
-DA:181,0
-DA:182,0
-DA:185,0
-DA:186,0
-DA:191,0
-DA:196,0
-DA:197,0
-DA:198,0
-DA:202,0
-DA:203,0
-DA:206,0
-DA:207,0
-BA:197,0
-BA:197,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/vector.tcc
-FN:283,_ZNSt6vectorISsSaISsEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPSsS1_EERKSs
-DA:283,0
-DA:286,0
-DA:288,0
-DA:291,0
-DA:293,0
-DA:295,0
-DA:299,0
-DA:307,0
-DA:308,0
-DA:309,0
-DA:316,0
-DA:321,0
-DA:323,0
-DA:324,0
-DA:330,0
-DA:332,0
-DA:333,0
-DA:334,0
-DA:336,0
-DA:338,0
-DA:341,0
-DA:342,0
-DA:343,0
-DA:345,0
-BA:286,0
-BA:286,0
-LF:24
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/exception
-FN:59,_ZNSt9exceptionC2Ev
-DA:59,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISsE8max_sizeEv
-FN:76,_ZN9__gnu_cxx13new_allocatorIPSsED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorISsEC2ERKS1_
-FN:101,_ZNK9__gnu_cxx13new_allocatorIPSsE8max_sizeEv
-FN:69,_ZN9__gnu_cxx13new_allocatorIPSsEC2Ev
-FN:107,_ZN9__gnu_cxx13new_allocatorISsE9constructEPSsRKSs
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-FN:97,_ZN9__gnu_cxx13new_allocatorIPSsE10deallocateEPS1_j
-FN:87,_ZN9__gnu_cxx13new_allocatorISsE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorIPSsE8allocateEjPKv
-FN:118,_ZN9__gnu_cxx13new_allocatorISsE7destroyEPSs
-DA:69,52
-DA:71,13
-DA:76,52
-DA:87,26
-DA:89,26
-DA:90,0
-DA:92,26
-DA:97,26
-DA:98,26
-DA:101,26
-DA:102,26
-DA:107,0
-DA:108,0
-DA:118,0
-BA:89,0
-BA:89,0
-BA:89,1
-BA:89,2
-BA:108,0
-BA:108,0
-LF:14
-LH:10
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,3
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/istream
-FN:585,_ZNSiC2Ev
-FN:105,_ZNSiD2Ev
-FN:804,_ZNSdC2Ev
-FN:801,_ZNSdD2Ev
-DA:105,0
-DA:106,0
-DA:585,0
-DA:586,0
-DA:587,0
-DA:801,0
-DA:804,0
-DA:805,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-DA:95,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:509,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:536,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:555,_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:509,0
-DA:510,0
-DA:511,0
-DA:536,0
-DA:537,0
-DA:555,0
-DA:556,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/commandline/core.cpp
-FN:54,_Z41__static_initialization_and_destruction_0ii
-FN:54,_GLOBAL__I_core.cpp
-FN:36,_ZN6wibble11commandline7ArgList8isSwitchEPKc
-FN:19,_ZN6wibble11commandline7ArgList8isSwitchERKSs
-FN:13,_ZN6wibble11commandline7ArgList8isSwitchERKSt14_List_iteratorISsE
-FN:8,_ZN6wibble11commandline7ArgList8isSwitchERKSt20_List_const_iteratorISsE
-DA:8,0
-DA:10,0
-DA:13,45
-DA:15,45
-DA:19,45
-DA:22,45
-DA:23,0
-DA:25,45
-DA:26,18
-DA:28,27
-DA:29,0
-DA:31,27
-DA:32,0
-DA:33,27
-DA:36,9
-DA:39,9
-DA:40,0
-DA:42,9
-DA:43,3
-DA:45,6
-DA:46,1
-DA:48,5
-DA:49,1
-DA:50,4
-DA:54,3
-BA:22,1
-BA:22,2
-BA:25,2
-BA:25,2
-BA:28,1
-BA:28,2
-BA:31,1
-BA:31,2
-BA:39,1
-BA:39,2
-BA:42,2
-BA:42,2
-BA:45,2
-BA:45,2
-BA:48,2
-BA:48,2
-BA:54,2
-BA:54,1
-BA:54,2
-BA:54,1
-LF:25
-LH:19
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:701,_ZNKSsixEj
-FN:2188,_ZSteqIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_EPKS3_
-DA:277,0
-DA:278,0
-DA:701,0
-DA:704,0
-DA:2188,0
-DA:2189,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_list.h
-FN:211,_ZNKSt20_List_const_iteratorISsEdeEv
-FN:131,_ZNKSt14_List_iteratorISsEdeEv
-DA:131,0
-DA:132,0
-DA:211,0
-DA:212,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/commandline/core.h
-FN:21,_ZNK6wibble9exception9BadOption4typeEv
-FN:34,_ZN6wibble11commandline7ArgList15eraseAndAdvanceERSt14_List_iteratorISsE
-FN:22,_ZNK6wibble9exception9BadOption4descEv
-FN:19,_ZN6wibble9exception9BadOptionD0Ev
-FN:19,_ZN6wibble9exception9BadOptionD1Ev
-FN:17,_ZN6wibble9exception9BadOptionC1ERKSsS3_
-DA:17,0
-DA:18,0
-DA:19,0
-DA:21,0
-DA:22,0
-DA:34,0
-DA:36,0
-DA:37,0
-DA:38,0
-DA:39,0
-DA:40,0
-DA:41,0
-DA:42,0
-BA:19,0
-BA:19,0
-BA:19,0
-BA:19,0
-BA:36,0
-BA:36,0
-LF:13
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/commandline/engine.h
-FN:106,_ZNK6wibble11commandline6Engine4nameEv
-DA:106,0
-LF:1
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/commandline/options.h
-FN:98,_ZNK6wibble11commandline6Option4nameEv
-DA:98,0
-LF:1
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/exception.h
-FN:190,_ZNK6wibble9exception7Generic4typeEv
-FN:263,_ZNK6wibble9exception11Consistency4typeEv
-FN:137,_ZN6wibble9exception7ContextD2Ev
-FN:213,_ZNK6wibble9exception7Generic4whatEv
-FN:265,_ZNK6wibble9exception11Consistency4descEv
-FN:193,_ZNK6wibble9exception7Generic4descEv
-FN:154,_ZNK6wibble9exception7Context13formatContextEv
-FN:205,_ZNK6wibble9exception7Generic8fullInfoEv
-FN:187,_ZN6wibble9exception7GenericD0Ev
-FN:187,_ZN6wibble9exception7GenericD1Ev
-FN:187,_ZN6wibble9exception7GenericD2Ev
-FN:261,_ZN6wibble9exception11ConsistencyD0Ev
-FN:261,_ZN6wibble9exception11ConsistencyD1Ev
-FN:261,_ZN6wibble9exception11ConsistencyD2Ev
-FN:109,_ZN6wibble9exception10AddContext7contextEv
-FN:117,_ZN6wibble9exception10AddContext11copyContextISt20back_insert_iteratorISt6vectorISsSaISsEEEEEvT_
-FN:153,_ZN6wibble9exception7Context10addContextERKSs
-FN:147,_ZN6wibble9exception7ContextC2ERKSs
-FN:186,_ZN6wibble9exception7GenericC2ERKSs
-FN:259,_ZN6wibble9exception11ConsistencyC2ERKSsS3_
-FN:259,_ZN6wibble9exception11ConsistencyC1ERKSsS3_
-DA:109,0
-DA:110,0
-DA:111,0
-DA:112,0
-DA:113,0
-DA:117,0
-DA:118,0
-DA:119,0
-DA:137,0
-DA:147,0
-DA:148,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:153,0
-DA:154,0
-DA:155,0
-DA:156,0
-DA:157,0
-DA:159,0
-DA:161,0
-DA:162,0
-DA:163,0
-DA:186,0
-DA:187,0
-DA:190,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:205,0
-DA:206,0
-DA:207,0
-DA:209,0
-DA:210,0
-DA:213,0
-DA:259,0
-DA:260,0
-DA:261,0
-DA:263,0
-DA:265,0
-DA:266,0
-DA:267,0
-DA:268,0
-DA:269,0
-BA:110,0
-BA:110,0
-BA:156,0
-BA:156,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:207,0
-BA:207,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:267,0
-BA:267,0
-LF:44
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/commandline/engine.cpp
-FN:352,_Z41__static_initialization_and_destruction_0ii
-FN:352,_GLOBAL__I_engine.cpp
-FN:173,_ZN6wibble11commandline6Engine3addEPS1_
-FN:167,_ZN6wibble11commandline6Engine3addEPNS0_11OptionGroupE
-FN:161,_ZN6wibble11commandline6Engine3addEPNS0_6OptionE
-FN:74,_ZN6wibble11commandline6Engine17parseFirstIfKnownERNS0_7ArgListESt14_List_iteratorISsE
-FN:124,_ZN6wibble11commandline6Engine18parseKnownSwitchesERNS0_7ArgListESt14_List_iteratorISsE
-FN:39,_ZN6wibble11commandline6Engine3addERKSsPS1_
-FN:9,_ZN6wibble11commandline6Engine13addWithoutAnaEPNS0_6OptionE
-FN:32,_ZN6wibble11commandline6Engine13addWithoutAnaERKSt6vectorIPNS0_6OptionESaIS4_EE
-FN:48,_ZN6wibble11commandline6Engine7rebuildEv
-FN:301,_ZN6wibble11commandline6Engine4dumpERSoRKSs
-FN:240,_ZN6wibble11commandline6Engine5parseERNS0_7ArgListESt14_List_iteratorISsE
-DA:9,23
-DA:11,23
-DA:12,38
-DA:14,15
-DA:15,15
-DA:17,0
-DA:18,15
-DA:21,23
-DA:22,51
-DA:24,28
-DA:25,28
-DA:27,0
-DA:28,28
-DA:30,23
-DA:32,12
-DA:34,35
-DA:36,23
-DA:37,12
-DA:39,9
-DA:41,9
-DA:42,9
-DA:43,0
-DA:44,9
-DA:45,9
-DA:48,11
-DA:51,11
-DA:52,11
-DA:55,12
-DA:57,1
-DA:60,11
-DA:63,11
-DA:64,17
-DA:67,6
-DA:68,9
-DA:70,3
-DA:72,11
-DA:74,25
-DA:76,25
-DA:78,25
-DA:81,8
-DA:83,8
-DA:84,8
-DA:85,2
-DA:87,6
-DA:88,6
-DA:90,6
-DA:93,5
-DA:96,1
-DA:102,17
-DA:103,17
-DA:104,17
-DA:107,4
-DA:109,13
-DA:110,13
-DA:113,17
-DA:114,17
-DA:115,8
-DA:116,13
-DA:119,13
-DA:121,19
-DA:124,27
-DA:127,16
-DA:129,27
-DA:130,5
-DA:131,22
-DA:132,4
-DA:133,18
-DA:134,18
-DA:135,2
-DA:136,16
-DA:140,26
-DA:143,14
-DA:145,7
-DA:146,7
-DA:149,7
-DA:150,7
-DA:152,4
-DA:154,3
-DA:157,6
-DA:161,28
-DA:163,28
-DA:164,28
-DA:167,3
-DA:169,3
-DA:170,3
-DA:173,8
-DA:175,8
-DA:176,8
-DA:240,11
-DA:242,11
-DA:245,11
-DA:247,11
-DA:250,11
-DA:253,3
-DA:254,8
-DA:255,2
-DA:257,3
-DA:260,2
-DA:261,2
-DA:262,0
-DA:265,2
-DA:266,0
-DA:267,2
-DA:270,2
-DA:274,11
-DA:278,14
-DA:280,5
-DA:283,0
-DA:285,0
-DA:286,0
-DA:288,0
-DA:290,5
-DA:291,0
-DA:293,9
-DA:294,9
-DA:297,2
-DA:301,0
-DA:303,0
-DA:305,0
-DA:307,0
-DA:309,0
-DA:310,0
-DA:312,0
-DA:314,0
-DA:316,0
-DA:317,0
-DA:319,0
-DA:321,0
-DA:323,0
-DA:324,0
-DA:326,0
-DA:328,0
-DA:330,0
-DA:331,0
-DA:333,0
-DA:335,0
-DA:337,0
-DA:338,0
-DA:340,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:347,0
-DA:349,0
-DA:352,3
-BA:12,2
-BA:12,2
-BA:15,1
-BA:15,2
-BA:22,2
-BA:22,2
-BA:25,1
-BA:25,2
-BA:34,2
-BA:34,2
-BA:42,1
-BA:42,2
-BA:55,2
-BA:55,2
-BA:64,2
-BA:64,2
-BA:68,2
-BA:68,2
-BA:78,2
-BA:78,2
-BA:84,2
-BA:84,2
-BA:90,2
-BA:90,2
-BA:104,2
-BA:104,2
-BA:114,2
-BA:114,2
-BA:119,2
-BA:119,2
-BA:119,2
-BA:119,2
-BA:129,2
-BA:129,2
-BA:131,2
-BA:131,2
-BA:134,2
-BA:134,2
-BA:140,2
-BA:140,2
-BA:143,2
-BA:143,2
-BA:150,2
-BA:150,2
-BA:250,2
-BA:250,2
-BA:254,2
-BA:254,2
-BA:254,2
-BA:254,2
-BA:254,2
-BA:254,2
-BA:257,2
-BA:257,2
-BA:261,1
-BA:261,2
-BA:265,1
-BA:265,2
-BA:274,2
-BA:274,2
-BA:278,2
-BA:278,2
-BA:280,1
-BA:280,2
-BA:283,0
-BA:283,0
-BA:290,1
-BA:290,2
-BA:307,0
-BA:307,0
-BA:310,0
-BA:310,0
-BA:314,0
-BA:314,0
-BA:317,0
-BA:317,0
-BA:321,0
-BA:321,0
-BA:324,0
-BA:324,0
-BA:328,0
-BA:328,0
-BA:331,0
-BA:331,0
-BA:335,0
-BA:335,0
-BA:338,0
-BA:338,0
-BA:342,0
-BA:342,0
-BA:345,0
-BA:345,0
-BA:352,2
-BA:352,1
-BA:352,2
-BA:352,1
-LF:145
-LH:107
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:100,_ZNSaIcEC1ERKS_
-FN:100,_ZNSaIcEC2ERKS_
-FN:106,_ZNSaISsED1Ev
-FN:106,_ZNSaISsED2Ev
-FN:104,_ZNSaISsEC1ISt10_List_nodeISsEEERKSaIT_E
-FN:98,_ZNSaISsEC2Ev
-FN:106,_ZNSaISt4pairIKcPN6wibble11commandline6OptionEEED1Ev
-FN:106,_ZNSaISt4pairIKSsPN6wibble11commandline6OptionEEED1Ev
-FN:106,_ZNSaISt4pairIKSsPN6wibble11commandline6EngineEEED1Ev
-FN:104,_ZNSaISt4pairIKcPN6wibble11commandline6OptionEEEC1ISt13_Rb_tree_nodeIS5_EEERKSaIT_E
-FN:104,_ZNSaISt4pairIKSsPN6wibble11commandline6OptionEEEC1ISt13_Rb_tree_nodeIS5_EEERKSaIT_E
-FN:104,_ZNSaISt4pairIKSsPN6wibble11commandline6EngineEEEC1ISt13_Rb_tree_nodeIS5_EEERKSaIT_E
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:104,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:7
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:1534,_ZNKSs5c_strEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:612,_ZNKSs6lengthEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:291,_ZNKSs9_M_ibeginEv
-FN:196,_ZNSs4_Rep13_M_set_leakedEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:188,_ZNKSs4_Rep12_M_is_leakedEv
-FN:1551,_ZNKSs13get_allocatorEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:392,_ZNSs10_S_compareEjj
-FN:835,_ZNSs6appendEPKc
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2121,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:1941,_ZNKSs7compareERKSs
-FN:2238,_ZStltIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-FN:2188,_ZSteqIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_EPKS3_
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-FN:299,_ZNSs7_M_leakEv
-FN:718,_ZNSsixEj
-FN:532,_ZNSs5beginEv
-FN:1147,_ZNSs5eraseEN9__gnu_cxx17__normal_iteratorIPcSsEE
-FN:306,_ZNKSs8_M_checkEjPKc
-FN:1923,_ZNKSs6substrEjj
-FN:2136,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S3_
-DA:178,0
-DA:183,0
-DA:184,0
-DA:188,0
-DA:189,0
-DA:196,0
-DA:197,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:291,0
-DA:292,0
-DA:299,0
-DA:301,0
-DA:302,0
-DA:303,0
-DA:306,0
-DA:308,0
-DA:309,0
-DA:310,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:392,0
-DA:394,0
-DA:401,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:532,0
-DA:534,0
-DA:535,0
-DA:606,0
-DA:607,0
-DA:612,0
-DA:613,0
-DA:686,0
-DA:687,0
-DA:718,0
-DA:724,0
-DA:725,0
-DA:835,0
-DA:838,0
-DA:1147,0
-DA:1151,0
-DA:1152,0
-DA:1153,0
-DA:1154,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:1923,0
-DA:1925,0
-DA:1941,0
-DA:1943,0
-DA:1944,0
-DA:1945,0
-DA:1947,0
-DA:1948,0
-DA:1949,0
-DA:1950,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2121,0
-DA:2123,0
-DA:2124,0
-DA:2125,0
-DA:2136,0
-DA:2140,0
-DA:2141,0
-DA:2142,0
-DA:2188,0
-DA:2189,0
-DA:2238,0
-DA:2239,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:301,0
-BA:301,0
-BA:308,0
-BA:308,0
-BA:341,0
-BA:341,0
-BA:1948,0
-BA:1948,0
-LF:113
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:668,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_EPKS3_RKS6_
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-DA:668,0
-DA:673,0
-DA:674,0
-DA:675,0
-DA:676,0
-DA:677,0
-DA:678,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:23
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:257,0
-DA:258,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/list.tcc
-FN:109,_ZNSt4listISsSaISsEE5eraseESt14_List_iteratorISsE
-DA:109,0
-DA:111,0
-DA:112,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb0EE3__bES7_
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb0EE3__bES6_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb1EE3__bES7_
-FN:268,_ZNSt12__niter_baseISt16ostream_iteratorISscSt11char_traitsIcEELb0EE3__bES3_
-FN:286,_ZNSt12__miter_baseIPSsLb0EE3__bES0_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb1EE3__bES6_
-FN:268,_ZNSt12__niter_baseISt20back_insert_iteratorISt6vectorISsSaISsEEELb0EE3__bES4_
-FN:286,_ZNSt12__miter_baseIPPN6wibble11commandline6OptionELb0EE3__bES4_
-FN:286,_ZNSt12__miter_baseIPPN6wibble11commandline11OptionGroupELb0EE3__bES4_
-FN:286,_ZNSt12__miter_baseIPPN6wibble11commandline6EngineELb0EE3__bES4_
-FN:268,_ZNSt12__niter_baseIPSsLb0EE3__bES0_
-FN:268,_ZNSt12__niter_baseIPPN6wibble11commandline6OptionELb0EE3__bES4_
-FN:188,_ZSt3minIjERKT_S2_S2_
-FN:268,_ZNSt12__niter_baseIPPN6wibble11commandline11OptionGroupELb0EE3__bES4_
-FN:268,_ZNSt12__niter_baseIPPN6wibble11commandline6EngineELb0EE3__bES4_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPKSsSt16ostream_iteratorISscSt11char_traitsIcEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPKSsSt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_SD_SC_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET0_T_SD_SC_
-FN:539,_ZNSt20__copy_move_backwardILb0ELb0ESt26random_access_iterator_tagE13__copy_move_bIPSsS3_EET0_T_S5_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0EPSsS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPSsS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardIPSsS0_ET0_T_S2_S1_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET1_T0_SA_S9_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET0_T_SA_S9_
-FN:569,_ZNSt20__copy_move_backwardILb0ELb1ESt26random_access_iterator_tagE13__copy_move_bIPN6wibble11commandline6EngineEEEPT_PKS7_SA_S8_
-FN:579,_ZSt22__copy_move_backward_aILb0EPPN6wibble11commandline6EngineES4_ET1_T0_S6_S5_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPPN6wibble11commandline6EngineES4_ET1_T0_S6_S5_
-FN:624,_ZSt13copy_backwardIPPN6wibble11commandline6EngineES4_ET0_T_S6_S5_
-FN:375,_ZNSt11__copy_moveILb0ELb1ESt26random_access_iterator_tagE8__copy_mIPN6wibble11commandline6EngineEEEPT_PKS7_SA_S8_
-FN:385,_ZSt13__copy_move_aILb0EPPN6wibble11commandline6EngineES4_ET1_T0_S6_S5_
-FN:430,_ZSt14__copy_move_a2ILb0EPPN6wibble11commandline6EngineES4_ET1_T0_S6_S5_
-FN:456,_ZSt4copyIPPN6wibble11commandline6EngineES4_ET0_T_S6_S5_
-FN:569,_ZNSt20__copy_move_backwardILb0ELb1ESt26random_access_iterator_tagE13__copy_move_bIPN6wibble11commandline11OptionGroupEEEPT_PKS7_SA_S8_
-FN:579,_ZSt22__copy_move_backward_aILb0EPPN6wibble11commandline11OptionGroupES4_ET1_T0_S6_S5_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPPN6wibble11commandline11OptionGroupES4_ET1_T0_S6_S5_
-FN:624,_ZSt13copy_backwardIPPN6wibble11commandline11OptionGroupES4_ET0_T_S6_S5_
-FN:375,_ZNSt11__copy_moveILb0ELb1ESt26random_access_iterator_tagE8__copy_mIPN6wibble11commandline11OptionGroupEEEPT_PKS7_SA_S8_
-FN:385,_ZSt13__copy_move_aILb0EPPN6wibble11commandline11OptionGroupES4_ET1_T0_S6_S5_
-FN:430,_ZSt14__copy_move_a2ILb0EPPN6wibble11commandline11OptionGroupES4_ET1_T0_S6_S5_
-FN:456,_ZSt4copyIPPN6wibble11commandline11OptionGroupES4_ET0_T_S6_S5_
-FN:569,_ZNSt20__copy_move_backwardILb0ELb1ESt26random_access_iterator_tagE13__copy_move_bIPN6wibble11commandline6OptionEEEPT_PKS7_SA_S8_
-FN:579,_ZSt22__copy_move_backward_aILb0EPPN6wibble11commandline6OptionES4_ET1_T0_S6_S5_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPPN6wibble11commandline6OptionES4_ET1_T0_S6_S5_
-FN:624,_ZSt13copy_backwardIPPN6wibble11commandline6OptionES4_ET0_T_S6_S5_
-FN:375,_ZNSt11__copy_moveILb0ELb1ESt26random_access_iterator_tagE8__copy_mIPN6wibble11commandline6OptionEEEPT_PKS7_SA_S8_
-FN:385,_ZSt13__copy_move_aILb0EPPN6wibble11commandline6OptionES4_ET1_T0_S6_S5_
-FN:430,_ZSt14__copy_move_a2ILb0EPPN6wibble11commandline6OptionES4_ET1_T0_S6_S5_
-FN:456,_ZSt4copyIPPN6wibble11commandline6OptionES4_ET0_T_S6_S5_
-DA:188,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:210,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:268,66
-DA:269,66
-DA:276,0
-DA:277,0
-DA:286,44
-DA:287,44
-DA:337,0
-DA:340,0
-DA:342,0
-DA:343,0
-DA:344,0
-DA:346,0
-DA:375,22
-DA:377,22
-DA:379,22
-DA:385,22
-DA:393,22
-DA:396,22
-DA:430,22
-DA:435,22
-DA:456,22
-DA:466,22
-DA:539,0
-DA:542,0
-DA:543,0
-DA:544,0
-DA:569,0
-DA:571,0
-DA:572,0
-DA:573,0
-DA:579,0
-DA:587,0
-DA:592,0
-DA:597,0
-DA:602,0
-DA:624,0
-DA:636,0
-BA:193,0
-BA:193,0
-BA:215,0
-BA:215,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:542,0
-BA:542,0
-LF:45
-LH:14
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:97,_ZSt8_DestroyIPPN6wibble11commandline6OptionEEvT_S5_
-FN:126,_ZSt8_DestroyIPPN6wibble11commandline6OptionES3_EvT_S5_RSaIT0_E
-FN:97,_ZSt8_DestroyIPPN6wibble11commandline11OptionGroupEEvT_S5_
-FN:126,_ZSt8_DestroyIPPN6wibble11commandline11OptionGroupES3_EvT_S5_RSaIT0_E
-FN:97,_ZSt8_DestroyIPPN6wibble11commandline6EngineEEvT_S5_
-FN:126,_ZSt8_DestroyIPPN6wibble11commandline6EngineES3_EvT_S5_RSaIT0_E
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-DA:87,0
-DA:88,0
-DA:97,0
-DA:101,0
-DA:103,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-BA:101,0
-BA:101,0
-LF:9
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_function.h
-FN:229,_ZNKSt4lessIcEclERKcS2_
-FN:482,_ZNKSt10_Select1stISt4pairIKSsPN6wibble11commandline6EngineEEEclERKS6_
-FN:482,_ZNKSt10_Select1stISt4pairIKcPN6wibble11commandline6OptionEEEclERKS6_
-FN:482,_ZNKSt10_Select1stISt4pairIKSsPN6wibble11commandline6OptionEEEclERKS6_
-FN:229,_ZNKSt4lessISsEclERKSsS2_
-DA:229,37
-DA:230,37
-DA:482,244
-DA:483,244
-LF:4
-LH:4
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPKcSt6vectorIcSaIcEEEdeEv
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEdeEv
-FN:703,_ZN9__gnu_cxx17__normal_iteratorIPKPN6wibble11commandline6OptionESt6vectorIS4_SaIS4_EEEppEv
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPKPN6wibble11commandline6OptionESt6vectorIS4_SaIS4_EEEdeEv
-FN:703,_ZN9__gnu_cxx17__normal_iteratorIPKPN6wibble11commandline11OptionGroupESt6vectorIS4_SaIS4_EEEppEv
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPKPN6wibble11commandline11OptionGroupESt6vectorIS4_SaIS4_EEEdeEv
-FN:703,_ZN9__gnu_cxx17__normal_iteratorIPKPN6wibble11commandline6EngineESt6vectorIS4_SaIS4_EEEppEv
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPKPN6wibble11commandline6EngineESt6vectorIS4_SaIS4_EEEdeEv
-FN:703,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEppEv
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEdeEv
-FN:398,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEC1ERS2_
-FN:456,_ZSt13back_inserterISt6vectorISsSaISsEEESt20back_insert_iteratorIT_ERS4_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEC1ERKS2_
-FN:710,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEppEi
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKcSt6vectorIcSaIcEEEC1ERKS2_
-FN:710,_ZN9__gnu_cxx17__normal_iteratorIPKcSt6vectorIcSaIcEEEppEi
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKcSt6vectorIcSaIcEEE4baseEv
-FN:781,_ZN9__gnu_cxxneIPKcSt6vectorIcSaIcEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-FN:781,_ZN9__gnu_cxxneIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKPN6wibble11commandline6OptionESt6vectorIS4_SaIS4_EEEC1ERKS6_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKPN6wibble11commandline6OptionESt6vectorIS4_SaIS4_EEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKPN6wibble11commandline6OptionESt6vectorIS4_SaIS4_EEEEbRKNS_17__normal_iteratorIT_T0_EESF_
-FN:781,_ZN9__gnu_cxxneIPKPN6wibble11commandline6OptionESt6vectorIS4_SaIS4_EEEEbRKNS_17__normal_iteratorIT_T0_EESF_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPPN6wibble11commandline11OptionGroupESt6vectorIS4_SaIS4_EEEC1ERKS5_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPPN6wibble11commandline11OptionGroupESt6vectorIS4_SaIS4_EEE4baseEv
-FN:690,_ZN9__gnu_cxx17__normal_iteratorIPKPN6wibble11commandline11OptionGroupESt6vectorIS4_SaIS4_EEEC1IPS4_EERKNS0_IT_NS_11__enable_ifIXsrSt10__are_sameISD_SC_E7__valueES9_E6__typeEEE
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKPN6wibble11commandline11OptionGroupESt6vectorIS4_SaIS4_EEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKPN6wibble11commandline11OptionGroupESt6vectorIS4_SaIS4_EEEEbRKNS_17__normal_iteratorIT_T0_EESF_
-FN:775,_ZN9__gnu_cxxneIPKPN6wibble11commandline11OptionGroupEPS4_St6vectorIS4_SaIS4_EEEEbRKNS_17__normal_iteratorIT_T1_EERKNSB_IT0_SD_EE
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPPN6wibble11commandline6EngineESt6vectorIS4_SaIS4_EEEC1ERKS5_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPPN6wibble11commandline6EngineESt6vectorIS4_SaIS4_EEE4baseEv
-FN:690,_ZN9__gnu_cxx17__normal_iteratorIPKPN6wibble11commandline6EngineESt6vectorIS4_SaIS4_EEEC1IPS4_EERKNS0_IT_NS_11__enable_ifIXsrSt10__are_sameISD_SC_E7__valueES9_E6__typeEEE
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKPN6wibble11commandline6EngineESt6vectorIS4_SaIS4_EEE4baseEv
-FN:775,_ZN9__gnu_cxxneIPKPN6wibble11commandline6EngineEPS4_St6vectorIS4_SaIS4_EEEEbRKNS_17__normal_iteratorIT_T1_EERKNSB_IT0_SD_EE
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEC1ERKS1_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEE4baseEv
-FN:690,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEC1IPSsEERKNS0_IT_NS_11__enable_ifIXsrSt10__are_sameIS9_S8_E7__valueES5_E6__typeEEE
-FN:775,_ZN9__gnu_cxxneIPKSsPSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T1_EERKNS7_IT0_S9_EE
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPcSsEC1ERKS1_
-FN:735,_ZNK9__gnu_cxx17__normal_iteratorIPcSsEplERKi
-FN:769,_ZN9__gnu_cxxeqIPKPN6wibble11commandline6EngineESt6vectorIS4_SaIS4_EEEEbRKNS_17__normal_iteratorIT_T0_EESF_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPPN6wibble11commandline6OptionESt6vectorIS4_SaIS4_EEEC1ERKS5_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPPN6wibble11commandline6OptionESt6vectorIS4_SaIS4_EEE4baseEv
-FN:690,_ZN9__gnu_cxx17__normal_iteratorIPKPN6wibble11commandline6OptionESt6vectorIS4_SaIS4_EEEC1IPS4_EERKNS0_IT_NS_11__enable_ifIXsrSt10__are_sameISD_SC_E7__valueES9_E6__typeEEE
-FN:775,_ZN9__gnu_cxxneIPKPN6wibble11commandline6OptionEPS4_St6vectorIS4_SaIS4_EEEEbRKNS_17__normal_iteratorIT_T1_EERKNSB_IT0_SD_EE
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPPN6wibble11commandline6OptionESt6vectorIS4_SaIS4_EEEdeEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKPN6wibble11commandline11OptionGroupESt6vectorIS4_SaIS4_EEEC1ERKS6_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPcSsE4baseEv
-FN:846,_ZN9__gnu_cxxmiIPcSsEENS_17__normal_iteratorIT_T0_E15difference_typeERKS5_S8_
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPPN6wibble11commandline11OptionGroupESt6vectorIS4_SaIS4_EEEdeEv
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPPN6wibble11commandline6EngineESt6vectorIS4_SaIS4_EEEdeEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKPN6wibble11commandline6EngineESt6vectorIS4_SaIS4_EEEC1ERKS6_
-FN:429,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEdeEv
-FN:434,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEppEv
-FN:412,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEaSERKSs
-DA:398,0
-DA:412,0
-DA:414,0
-DA:415,0
-DA:429,0
-DA:430,0
-DA:434,0
-DA:435,0
-DA:456,0
-DA:457,0
-DA:683,207
-DA:690,28
-DA:691,28
-DA:695,143
-DA:696,143
-DA:703,33
-DA:705,33
-DA:706,33
-DA:710,43
-DA:711,43
-DA:735,0
-DA:736,0
-DA:747,270
-DA:748,270
-DA:769,11
-DA:770,11
-DA:775,38
-DA:776,38
-DA:781,124
-DA:782,124
-DA:846,0
-DA:847,0
-LF:32
-LH:18
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,0
-DA:166,0
-DA:167,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_list.h
-FN:169,_ZNKSt14_List_iteratorISsEeqERKS0_
-FN:139,_ZNSt14_List_iteratorISsEppEv
-FN:131,_ZNKSt14_List_iteratorISsEdeEv
-FN:173,_ZNKSt14_List_iteratorISsEneERKS0_
-FN:146,_ZNSt14_List_iteratorISsEppEi
-FN:126,_ZNSt14_List_iteratorISsEC1EPSt15_List_node_base
-FN:666,_ZNSt4listISsSaISsEE3endEv
-FN:328,_ZNKSt10_List_baseISsSaISsEE21_M_get_Node_allocatorEv
-FN:332,_ZNKSt10_List_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:317,_ZNSt10_List_baseISsSaISsEE11_M_put_nodeEPSt10_List_nodeISsE
-FN:1356,_ZNSt4listISsSaISsEE8_M_eraseESt14_List_iteratorISsE
-DA:126,0
-DA:127,0
-DA:131,0
-DA:132,0
-DA:139,0
-DA:141,0
-DA:142,0
-DA:146,0
-DA:148,0
-DA:149,0
-DA:169,0
-DA:170,0
-DA:173,42
-DA:174,42
-DA:317,0
-DA:318,0
-DA:328,0
-DA:329,0
-DA:332,0
-DA:333,0
-DA:666,0
-DA:667,0
-DA:1356,0
-DA:1358,0
-DA:1359,0
-DA:1360,0
-DA:1361,0
-DA:1362,0
-LF:28
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_map.h
-FN:384,_ZNKSt3mapISsPN6wibble11commandline6EngineESt4lessISsESaISt4pairIKSsS3_EEE5emptyEv
-FN:384,_ZNKSt3mapIcPN6wibble11commandline6OptionESt4lessIcESaISt4pairIKcS3_EEE5emptyEv
-FN:384,_ZNKSt3mapISsPN6wibble11commandline6OptionESt4lessISsESaISt4pairIKSsS3_EEE5emptyEv
-FN:275,_ZNSt3mapIcPN6wibble11commandline6OptionESt4lessIcESaISt4pairIKcS3_EEE5beginEv
-FN:293,_ZNSt3mapIcPN6wibble11commandline6OptionESt4lessIcESaISt4pairIKcS3_EEE3endEv
-FN:590,_ZNKSt3mapIcPN6wibble11commandline6OptionESt4lessIcESaISt4pairIKcS3_EEE8key_compEv
-FN:275,_ZNSt3mapISsPN6wibble11commandline6OptionESt4lessISsESaISt4pairIKSsS3_EEE5beginEv
-FN:293,_ZNSt3mapISsPN6wibble11commandline6OptionESt4lessISsESaISt4pairIKSsS3_EEE3endEv
-FN:590,_ZNKSt3mapISsPN6wibble11commandline6OptionESt4lessISsESaISt4pairIKSsS3_EEE8key_compEv
-FN:275,_ZNSt3mapISsPN6wibble11commandline6EngineESt4lessISsESaISt4pairIKSsS3_EEE5beginEv
-FN:293,_ZNSt3mapISsPN6wibble11commandline6EngineESt4lessISsESaISt4pairIKSsS3_EEE3endEv
-FN:590,_ZNKSt3mapISsPN6wibble11commandline6EngineESt4lessISsESaISt4pairIKSsS3_EEE8key_compEv
-FN:614,_ZNSt3mapIcPN6wibble11commandline6OptionESt4lessIcESaISt4pairIKcS3_EEE4findERS7_
-FN:656,_ZNSt3mapIcPN6wibble11commandline6OptionESt4lessIcESaISt4pairIKcS3_EEE11lower_boundERS7_
-FN:656,_ZNSt3mapISsPN6wibble11commandline6EngineESt4lessISsESaISt4pairIKSsS3_EEE11lower_boundERS7_
-FN:614,_ZNSt3mapISsPN6wibble11commandline6EngineESt4lessISsESaISt4pairIKSsS3_EEE4findERS7_
-FN:656,_ZNSt3mapISsPN6wibble11commandline6OptionESt4lessISsESaISt4pairIKSsS3_EEE11lower_boundERS7_
-FN:614,_ZNSt3mapISsPN6wibble11commandline6OptionESt4lessISsESaISt4pairIKSsS3_EEE4findERS7_
-FN:581,_ZNSt3mapIcPN6wibble11commandline6OptionESt4lessIcESaISt4pairIKcS3_EEE5clearEv
-FN:581,_ZNSt3mapISsPN6wibble11commandline6OptionESt4lessISsESaISt4pairIKSsS3_EEE5clearEv
-FN:581,_ZNSt3mapISsPN6wibble11commandline6EngineESt4lessISsESaISt4pairIKSsS3_EEE5clearEv
-FN:495,_ZNSt3mapISsPN6wibble11commandline6EngineESt4lessISsESaISt4pairIKSsS3_EEE6insertESt17_Rb_tree_iteratorIS8_ERKS8_
-FN:411,_ZNSt3mapISsPN6wibble11commandline6EngineESt4lessISsESaISt4pairIKSsS3_EEEixERS7_
-FN:495,_ZNSt3mapIcPN6wibble11commandline6OptionESt4lessIcESaISt4pairIKcS3_EEE6insertESt17_Rb_tree_iteratorIS8_ERKS8_
-FN:411,_ZNSt3mapIcPN6wibble11commandline6OptionESt4lessIcESaISt4pairIKcS3_EEEixERS7_
-FN:495,_ZNSt3mapISsPN6wibble11commandline6OptionESt4lessISsESaISt4pairIKSsS3_EEE6insertESt17_Rb_tree_iteratorIS8_ERKS8_
-FN:411,_ZNSt3mapISsPN6wibble11commandline6OptionESt4lessISsESaISt4pairIKSsS3_EEEixERS7_
-DA:275,0
-DA:276,0
-DA:293,131
-DA:294,131
-DA:384,0
-DA:385,0
-DA:411,52
-DA:416,52
-DA:418,52
-DA:419,52
-DA:420,52
-DA:495,52
-DA:496,52
-DA:581,33
-DA:582,33
-DA:590,13
-DA:591,13
-DA:614,79
-DA:615,79
-DA:656,52
-DA:657,52
-BA:418,2
-BA:418,2
-BA:418,2
-BA:418,1
-BA:418,2
-BA:418,1
-BA:418,1
-BA:418,2
-BA:418,0
-BA:418,0
-BA:418,2
-BA:418,1
-BA:418,2
-BA:418,2
-BA:418,2
-BA:418,1
-BA:418,2
-BA:418,1
-LF:21
-LH:17
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_pair.h
-FN:88,_ZNSt4pairIKcPN6wibble11commandline6OptionEEC1ERS0_RKS4_
-FN:88,_ZNSt4pairISt14_List_iteratorISsEbEC1ERKS1_RKb
-FN:218,_ZSt9make_pairISt14_List_iteratorISsEbESt4pairIT_T0_ES3_S4_
-FN:73,_ZNSt4pairIKcPN6wibble11commandline6OptionEED1Ev
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIS_IKcPN6wibble11commandline6OptionEEEbEC1ERKS7_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIS_IKSsPN6wibble11commandline6OptionEEEbEC1ERKS7_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIS_IKSsPN6wibble11commandline6EngineEEEbEC1ERKS7_RKb
-FN:88,_ZNSt4pairIKSsPN6wibble11commandline6EngineEEC1ERS0_RKS4_
-FN:73,_ZNSt4pairIKSsPN6wibble11commandline6EngineEEC1ERKS5_
-FN:88,_ZNSt4pairIKSsPN6wibble11commandline6OptionEEC1ERS0_RKS4_
-FN:73,_ZNSt4pairIKSsPN6wibble11commandline6OptionEEC1ERKS5_
-FN:73,_ZNSt4pairIKSsPN6wibble11commandline6OptionEED1Ev
-FN:73,_ZNSt4pairIKSsPN6wibble11commandline6EngineEED1Ev
-DA:73,37
-DA:88,101
-DA:89,101
-DA:218,25
-DA:219,25
-LF:5
-LH:5
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_tree.h
-FN:251,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKSsPN6wibble11commandline6EngineEEEptEv
-FN:214,_ZNKSt17_Rb_tree_iteratorISt4pairIKcPN6wibble11commandline6OptionEEEneERKS7_
-FN:176,_ZNKSt17_Rb_tree_iteratorISt4pairIKcPN6wibble11commandline6OptionEEEptEv
-FN:214,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsPN6wibble11commandline6OptionEEEneERKS7_
-FN:176,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsPN6wibble11commandline6OptionEEEptEv
-FN:214,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsPN6wibble11commandline6EngineEEEneERKS7_
-FN:176,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsPN6wibble11commandline6EngineEEEptEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorISt4pairIKcPN6wibble11commandline6OptionEEEC1ERKSt17_Rb_tree_iteratorIS6_E
-FN:285,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKcPN6wibble11commandline6OptionEEEeqERKS7_
-FN:251,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKcPN6wibble11commandline6OptionEEEptEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsPN6wibble11commandline6OptionEEEC1ERKSt17_Rb_tree_iteratorIS6_E
-FN:285,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKSsPN6wibble11commandline6OptionEEEeqERKS7_
-FN:251,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKSsPN6wibble11commandline6OptionEEEptEv
-FN:210,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsPN6wibble11commandline6EngineEEEeqERKS7_
-FN:243,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsPN6wibble11commandline6EngineEEEC1ERKSt17_Rb_tree_iteratorIS6_E
-FN:289,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKSsPN6wibble11commandline6EngineEEEneERKS7_
-FN:289,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKcPN6wibble11commandline6OptionEEEneERKS7_
-FN:289,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKSsPN6wibble11commandline6OptionEEEneERKS7_
-FN:452,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE8_M_beginEv
-FN:452,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_M_beginEv
-FN:452,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_M_beginEv
-FN:172,_ZNKSt17_Rb_tree_iteratorISt4pairIKcPN6wibble11commandline6OptionEEEdeEv
-FN:210,_ZNKSt17_Rb_tree_iteratorISt4pairIKcPN6wibble11commandline6OptionEEEeqERKS7_
-FN:172,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsPN6wibble11commandline6OptionEEEdeEv
-FN:210,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsPN6wibble11commandline6OptionEEEeqERKS7_
-FN:172,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsPN6wibble11commandline6EngineEEEdeEv
-FN:637,_ZNKSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE5emptyEv
-FN:637,_ZNKSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE5emptyEv
-FN:637,_ZNKSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE5emptyEv
-FN:487,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:487,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:487,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:463,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE6_M_endEv
-FN:168,_ZNSt17_Rb_tree_iteratorISt4pairIKcPN6wibble11commandline6OptionEEEC1EPSt13_Rb_tree_nodeIS6_E
-FN:596,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE5beginEv
-FN:610,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE3endEv
-FN:592,_ZNKSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE8key_compEv
-FN:463,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE6_M_endEv
-FN:168,_ZNSt17_Rb_tree_iteratorISt4pairIKSsPN6wibble11commandline6OptionEEEC1EPSt13_Rb_tree_nodeIS6_E
-FN:596,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE5beginEv
-FN:610,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE3endEv
-FN:592,_ZNKSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8key_compEv
-FN:463,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE6_M_endEv
-FN:168,_ZNSt17_Rb_tree_iteratorISt4pairIKSsPN6wibble11commandline6EngineEEEC1EPSt13_Rb_tree_nodeIS6_E
-FN:596,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE5beginEv
-FN:610,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE3endEv
-FN:592,_ZNKSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8key_compEv
-FN:436,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE11_M_leftmostEv
-FN:428,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE7_M_rootEv
-FN:444,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE12_M_rightmostEv
-FN:436,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE11_M_leftmostEv
-FN:428,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE7_M_rootEv
-FN:444,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE12_M_rightmostEv
-FN:436,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE11_M_leftmostEv
-FN:428,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE7_M_rootEv
-FN:444,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE12_M_rightmostEv
-FN:491,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_S_rightEPKSt18_Rb_tree_node_base
-FN:495,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE6_S_keyEPKSt18_Rb_tree_node_base
-FN:495,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE6_S_keyEPKSt18_Rb_tree_node_base
-FN:641,_ZNKSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE4sizeEv
-FN:491,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE8_S_rightEPKSt18_Rb_tree_node_base
-FN:495,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE6_S_keyEPKSt18_Rb_tree_node_base
-FN:641,_ZNKSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE4sizeEv
-FN:491,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_S_rightEPKSt18_Rb_tree_node_base
-FN:641,_ZNKSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE4sizeEv
-FN:347,_ZNKSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE21_M_get_Node_allocatorEv
-FN:347,_ZNKSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE21_M_get_Node_allocatorEv
-FN:347,_ZNKSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE21_M_get_Node_allocatorEv
-FN:471,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_S_valueEPKSt13_Rb_tree_nodeIS6_E
-FN:475,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE6_S_keyEPKSt13_Rb_tree_nodeIS6_E
-FN:471,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE8_S_valueEPKSt13_Rb_tree_nodeIS6_E
-FN:475,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE6_S_keyEPKSt13_Rb_tree_nodeIS6_E
-FN:954,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE14_M_lower_boundEPSt13_Rb_tree_nodeIS6_ESF_RS1_
-FN:1390,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE4findERS1_
-FN:715,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE11lower_boundERS1_
-FN:471,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_S_valueEPKSt13_Rb_tree_nodeIS6_E
-FN:475,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE6_S_keyEPKSt13_Rb_tree_nodeIS6_E
-FN:351,_ZNKSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE13get_allocatorEv
-FN:351,_ZNKSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13get_allocatorEv
-FN:351,_ZNKSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13get_allocatorEv
-FN:255,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsPN6wibble11commandline6EngineEEEppEv
-FN:255,_ZNSt23_Rb_tree_const_iteratorISt4pairIKcPN6wibble11commandline6OptionEEEppEv
-FN:255,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsPN6wibble11commandline6OptionEEEppEv
-FN:954,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE14_M_lower_boundEPSt13_Rb_tree_nodeIS6_ESF_RS1_
-FN:715,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE11lower_boundERS1_
-FN:1390,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE4findERS1_
-FN:954,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE14_M_lower_boundEPSt13_Rb_tree_nodeIS6_ESF_RS1_
-FN:715,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE11lower_boundERS1_
-FN:1390,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE4findERS1_
-FN:360,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS6_E
-FN:388,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS6_E
-FN:936,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE8_M_eraseEPSt13_Rb_tree_nodeIS6_E
-FN:695,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE5clearEv
-FN:360,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS6_E
-FN:388,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS6_E
-FN:936,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_M_eraseEPSt13_Rb_tree_nodeIS6_E
-FN:695,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE5clearEv
-FN:360,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS6_E
-FN:388,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS6_E
-FN:936,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_M_eraseEPSt13_Rb_tree_nodeIS6_E
-FN:695,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE5clearEv
-FN:356,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE14_M_create_nodeERKS6_
-FN:356,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE14_M_create_nodeERKS6_
-FN:356,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE14_M_create_nodeERKS6_
-FN:270,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsPN6wibble11commandline6EngineEEEmmEv
-FN:270,_ZNSt23_Rb_tree_const_iteratorISt4pairIKcPN6wibble11commandline6OptionEEEmmEv
-FN:270,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsPN6wibble11commandline6OptionEEEmmEv
-FN:846,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE10_M_insert_EPKSt18_Rb_tree_node_baseSF_RKS6_
-FN:846,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE10_M_insert_EPKSt18_Rb_tree_node_baseSF_RKS6_
-FN:846,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE10_M_insert_EPKSt18_Rb_tree_node_baseSF_RKS6_
-FN:195,_ZNSt17_Rb_tree_iteratorISt4pairIKSsPN6wibble11commandline6EngineEEEmmEv
-FN:1133,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE16_M_insert_uniqueERKS6_
-FN:1178,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6EngineEESt10_Select1stIS6_ESt4lessISsESaIS6_EE17_M_insert_unique_ESt23_Rb_tree_const_iteratorIS6_ERKS6_
-FN:195,_ZNSt17_Rb_tree_iteratorISt4pairIKcPN6wibble11commandline6OptionEEEmmEv
-FN:1133,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE16_M_insert_uniqueERKS6_
-FN:1178,_ZNSt8_Rb_treeIcSt4pairIKcPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessIcESaIS6_EE17_M_insert_unique_ESt23_Rb_tree_const_iteratorIS6_ERKS6_
-FN:195,_ZNSt17_Rb_tree_iteratorISt4pairIKSsPN6wibble11commandline6OptionEEEmmEv
-FN:1133,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE16_M_insert_uniqueERKS6_
-FN:1178,_ZNSt8_Rb_treeISsSt4pairIKSsPN6wibble11commandline6OptionEESt10_Select1stIS6_ESt4lessISsESaIS6_EE17_M_insert_unique_ESt23_Rb_tree_const_iteratorIS6_ERKS6_
-DA:168,499
-DA:169,499
-DA:172,65
-DA:173,65
-DA:176,2
-DA:177,2
-DA:195,0
-DA:197,0
-DA:198,0
-DA:210,157
-DA:211,157
-DA:214,52
-DA:215,52
-DA:243,102
-DA:244,102
-DA:251,19
-DA:252,19
-DA:255,0
-DA:257,0
-DA:258,0
-DA:270,2
-DA:272,2
-DA:273,2
-DA:285,25
-DA:286,25
-DA:289,0
-DA:290,0
-DA:347,0
-DA:348,0
-DA:351,0
-DA:352,0
-DA:356,52
-DA:357,52
-DA:360,0
-DA:361,0
-DA:364,52
-DA:366,52
-DA:368,52
-DA:369,0
-DA:371,0
-DA:372,0
-DA:374,52
-DA:388,0
-DA:390,0
-DA:391,0
-DA:392,0
-DA:428,33
-DA:429,33
-DA:436,68
-DA:437,68
-DA:444,63
-DA:445,63
-DA:452,0
-DA:453,0
-DA:463,313
-DA:464,313
-DA:471,117
-DA:472,117
-DA:475,117
-DA:476,117
-DA:479,0
-DA:480,0
-DA:487,0
-DA:488,0
-DA:491,2
-DA:492,2
-DA:495,81
-DA:496,81
-DA:499,81
-DA:500,81
-DA:592,13
-DA:593,13
-DA:596,24
-DA:599,24
-DA:610,268
-DA:611,268
-DA:637,0
-DA:638,0
-DA:641,39
-DA:642,39
-DA:695,33
-DA:697,33
-DA:698,33
-DA:699,33
-DA:700,33
-DA:701,33
-DA:702,33
-DA:715,52
-DA:716,52
-DA:846,52
-DA:850,52
-DA:852,52
-DA:854,52
-DA:857,52
-DA:858,52
-DA:936,0
-DA:939,0
-DA:941,0
-DA:942,0
-DA:943,0
-DA:944,0
-DA:946,0
-DA:954,131
-DA:956,379
-DA:957,117
-DA:958,59
-DA:960,58
-DA:961,131
-DA:1133,24
-DA:1135,24
-DA:1136,24
-DA:1137,24
-DA:1138,48
-DA:1140,0
-DA:1141,0
-DA:1142,0
-DA:1144,24
-DA:1145,24
-DA:1147,24
-DA:1148,24
-DA:1150,0
-DA:1152,0
-DA:1153,0
-DA:1154,0
-DA:1178,52
-DA:1181,52
-DA:1183,39
-DA:1186,15
-DA:1188,24
-DA:1190,13
-DA:1194,13
-DA:1195,13
-DA:1196,11
-DA:1197,2
-DA:1200,2
-DA:1201,1
-DA:1204,1
-DA:1207,0
-DA:1209,0
-DA:1213,0
-DA:1214,0
-DA:1215,0
-DA:1216,0
-DA:1219,0
-DA:1220,0
-DA:1222,0
-DA:1225,0
-DA:1230,0
-DA:1390,79
-DA:1392,79
-DA:1395,79
-BA:850,2
-BA:850,2
-BA:850,1
-BA:850,2
-BA:850,0
-BA:850,0
-BA:850,2
-BA:850,1
-BA:850,2
-BA:850,2
-BA:850,1
-BA:850,2
-BA:850,2
-BA:850,2
-BA:850,2
-BA:850,2
-BA:850,1
-BA:850,2
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:956,2
-BA:956,2
-BA:956,2
-BA:956,2
-BA:956,2
-BA:956,2
-BA:957,2
-BA:957,2
-BA:957,2
-BA:957,2
-BA:957,2
-BA:957,2
-BA:1138,1
-BA:1138,2
-BA:1138,1
-BA:1138,2
-BA:1138,1
-BA:1138,2
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1145,2
-BA:1145,1
-BA:1145,2
-BA:1145,1
-BA:1145,2
-BA:1145,1
-BA:1147,2
-BA:1147,1
-BA:1147,2
-BA:1147,1
-BA:1147,2
-BA:1147,1
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1181,2
-BA:1181,2
-BA:1181,2
-BA:1181,1
-BA:1181,2
-BA:1181,2
-BA:1183,1
-BA:1183,2
-BA:1183,0
-BA:1183,0
-BA:1183,1
-BA:1183,2
-BA:1183,2
-BA:1183,2
-BA:1183,2
-BA:1183,1
-BA:1183,2
-BA:1183,2
-BA:1183,2
-BA:1183,2
-BA:1183,2
-BA:1183,1
-BA:1183,2
-BA:1183,2
-BA:1190,2
-BA:1190,1
-BA:1190,0
-BA:1190,0
-BA:1190,2
-BA:1190,1
-BA:1195,2
-BA:1195,1
-BA:1195,0
-BA:1195,0
-BA:1195,2
-BA:1195,2
-BA:1197,0
-BA:1197,0
-BA:1197,0
-BA:1197,0
-BA:1197,2
-BA:1197,1
-BA:1200,0
-BA:1200,0
-BA:1200,0
-BA:1200,0
-BA:1200,2
-BA:1200,2
-BA:1209,0
-BA:1209,0
-BA:1209,0
-BA:1209,0
-BA:1209,0
-BA:1209,0
-BA:1214,0
-BA:1214,0
-BA:1214,0
-BA:1214,0
-BA:1214,0
-BA:1214,0
-BA:1216,0
-BA:1216,0
-BA:1216,0
-BA:1216,0
-BA:1216,0
-BA:1216,0
-BA:1219,0
-BA:1219,0
-BA:1219,0
-BA:1219,0
-BA:1219,0
-BA:1219,0
-BA:1395,2
-BA:1395,2
-BA:1395,2
-BA:1395,2
-BA:1395,2
-BA:1395,2
-BA:1395,2
-BA:1395,2
-BA:1395,2
-BA:1395,2
-BA:1395,2
-BA:1395,2
-LF:151
-LH:97
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyIPSsS2_EET0_T_S4_S3_
-FN:113,_ZSt18uninitialized_copyIPSsS0_ET0_T_S2_S1_
-FN:261,_ZSt22__uninitialized_copy_aIPSsS0_SsET0_T_S2_S1_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPSsS0_SaISsEET0_T_S3_S2_RT1_
-FN:97,_ZNSt20__uninitialized_copyILb1EE18uninitialized_copyIPPN6wibble11commandline6EngineES6_EET0_T_S8_S7_
-FN:113,_ZSt18uninitialized_copyIPPN6wibble11commandline6EngineES4_ET0_T_S6_S5_
-FN:261,_ZSt22__uninitialized_copy_aIPPN6wibble11commandline6EngineES4_S3_ET0_T_S6_S5_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPPN6wibble11commandline6EngineES4_SaIS3_EET0_T_S7_S6_RT1_
-FN:97,_ZNSt20__uninitialized_copyILb1EE18uninitialized_copyIPPN6wibble11commandline11OptionGroupES6_EET0_T_S8_S7_
-FN:113,_ZSt18uninitialized_copyIPPN6wibble11commandline11OptionGroupES4_ET0_T_S6_S5_
-FN:261,_ZSt22__uninitialized_copy_aIPPN6wibble11commandline11OptionGroupES4_S3_ET0_T_S6_S5_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPPN6wibble11commandline11OptionGroupES4_SaIS3_EET0_T_S7_S6_RT1_
-FN:97,_ZNSt20__uninitialized_copyILb1EE18uninitialized_copyIPPN6wibble11commandline6OptionES6_EET0_T_S8_S7_
-FN:113,_ZSt18uninitialized_copyIPPN6wibble11commandline6OptionES4_ET0_T_S6_S5_
-FN:261,_ZSt22__uninitialized_copy_aIPPN6wibble11commandline6OptionES4_S3_ET0_T_S6_S5_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPPN6wibble11commandline6OptionES4_SaIS3_EET0_T_S7_S6_RT1_
-DA:73,0
-DA:75,0
-DA:78,0
-DA:79,0
-DA:81,0
-DA:83,0
-DA:85,0
-DA:86,0
-DA:97,22
-DA:98,22
-DA:113,22
-DA:122,22
-DA:261,22
-DA:262,22
-DA:268,22
-DA:272,22
-BA:78,0
-BA:78,0
-BA:79,0
-BA:79,0
-LF:16
-LH:8
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:484,_ZNKSt6vectorIPN6wibble11commandline6EngineESaIS3_EE4sizeEv
-FN:484,_ZNKSt6vectorIPN6wibble11commandline11OptionGroupESaIS3_EE4sizeEv
-FN:484,_ZNKSt6vectorIPN6wibble11commandline6OptionESaIS3_EE4sizeEv
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:404,_ZNKSt6vectorISsSaISsEE3endEv
-FN:386,_ZNKSt6vectorISsSaISsEE5beginEv
-FN:97,_ZNSt12_Vector_baseIPN6wibble11commandline6OptionESaIS3_EE19_M_get_Tp_allocatorEv
-FN:97,_ZNSt12_Vector_baseIPN6wibble11commandline11OptionGroupESaIS3_EE19_M_get_Tp_allocatorEv
-FN:97,_ZNSt12_Vector_baseIPN6wibble11commandline6EngineESaIS3_EE19_M_get_Tp_allocatorEv
-FN:386,_ZNKSt6vectorIcSaIcEE5beginEv
-FN:404,_ZNKSt6vectorIcSaIcEE3endEv
-FN:484,_ZNKSt6vectorISsSaISsEE4sizeEv
-FN:101,_ZNKSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:526,_ZNKSt6vectorISsSaISsEE5emptyEv
-FN:404,_ZNKSt6vectorIPN6wibble11commandline6OptionESaIS3_EE3endEv
-FN:386,_ZNKSt6vectorIPN6wibble11commandline6OptionESaIS3_EE5beginEv
-FN:526,_ZNKSt6vectorIPN6wibble11commandline6OptionESaIS3_EE5emptyEv
-FN:377,_ZNSt6vectorIPN6wibble11commandline11OptionGroupESaIS3_EE5beginEv
-FN:395,_ZNSt6vectorIPN6wibble11commandline11OptionGroupESaIS3_EE3endEv
-FN:377,_ZNSt6vectorIPN6wibble11commandline6EngineESaIS3_EE5beginEv
-FN:395,_ZNSt6vectorIPN6wibble11commandline6EngineESaIS3_EE3endEv
-FN:395,_ZNSt6vectorISsSaISsEE3endEv
-FN:377,_ZNSt6vectorISsSaISsEE5beginEv
-FN:377,_ZNSt6vectorIPN6wibble11commandline6OptionESaIS3_EE5beginEv
-FN:395,_ZNSt6vectorIPN6wibble11commandline6OptionESaIS3_EE3endEv
-FN:404,_ZNKSt6vectorIPN6wibble11commandline11OptionGroupESaIS3_EE3endEv
-FN:386,_ZNKSt6vectorIPN6wibble11commandline11OptionGroupESaIS3_EE5beginEv
-FN:526,_ZNKSt6vectorIPN6wibble11commandline11OptionGroupESaIS3_EE5emptyEv
-FN:404,_ZNKSt6vectorIPN6wibble11commandline6EngineESaIS3_EE3endEv
-FN:386,_ZNKSt6vectorIPN6wibble11commandline6EngineESaIS3_EE5beginEv
-FN:526,_ZNKSt6vectorIPN6wibble11commandline6EngineESaIS3_EE5emptyEv
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:84,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseISsSaISsEEC2Ev
-FN:213,_ZNSt6vectorISsSaISsEEC1Ev
-FN:489,_ZNKSt6vectorISsSaISsEE8max_sizeEv
-FN:101,_ZNKSt12_Vector_baseIPN6wibble11commandline6OptionESaIS3_EE19_M_get_Tp_allocatorEv
-FN:489,_ZNKSt6vectorIPN6wibble11commandline6OptionESaIS3_EE8max_sizeEv
-FN:101,_ZNKSt12_Vector_baseIPN6wibble11commandline11OptionGroupESaIS3_EE19_M_get_Tp_allocatorEv
-FN:489,_ZNKSt6vectorIPN6wibble11commandline11OptionGroupESaIS3_EE8max_sizeEv
-FN:101,_ZNKSt12_Vector_baseIPN6wibble11commandline6EngineESaIS3_EE19_M_get_Tp_allocatorEv
-FN:489,_ZNKSt6vectorIPN6wibble11commandline6EngineESaIS3_EE8max_sizeEv
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-FN:147,_ZNSt12_Vector_baseIPN6wibble11commandline6EngineESaIS3_EE13_M_deallocateEPS3_j
-FN:147,_ZNSt12_Vector_baseIPN6wibble11commandline11OptionGroupESaIS3_EE13_M_deallocateEPS3_j
-FN:147,_ZNSt12_Vector_baseIPN6wibble11commandline6OptionESaIS3_EE13_M_deallocateEPS3_j
-FN:1075,_ZNKSt6vectorISsSaISsEE12_M_check_lenEjPKc
-FN:1075,_ZNKSt6vectorIPN6wibble11commandline6EngineESaIS3_EE12_M_check_lenEjPKc
-FN:1075,_ZNKSt6vectorIPN6wibble11commandline11OptionGroupESaIS3_EE12_M_check_lenEjPKc
-FN:1075,_ZNKSt6vectorIPN6wibble11commandline6OptionESaIS3_EE12_M_check_lenEjPKc
-FN:143,_ZNSt12_Vector_baseISsSaISsEE11_M_allocateEj
-FN:686,_ZNSt6vectorISsSaISsEE9push_backERKSs
-FN:143,_ZNSt12_Vector_baseIPN6wibble11commandline6EngineESaIS3_EE11_M_allocateEj
-FN:143,_ZNSt12_Vector_baseIPN6wibble11commandline11OptionGroupESaIS3_EE11_M_allocateEj
-FN:143,_ZNSt12_Vector_baseIPN6wibble11commandline6OptionESaIS3_EE11_M_allocateEj
-FN:686,_ZNSt6vectorIPN6wibble11commandline6EngineESaIS3_EE9push_backERKS3_
-FN:686,_ZNSt6vectorIPN6wibble11commandline11OptionGroupESaIS3_EE9push_backERKS3_
-FN:686,_ZNSt6vectorIPN6wibble11commandline6OptionESaIS3_EE9push_backERKS3_
-DA:79,0
-DA:84,0
-DA:85,0
-DA:86,0
-DA:97,0
-DA:98,0
-DA:101,22
-DA:102,22
-DA:108,0
-DA:109,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:143,11
-DA:144,11
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:213,0
-DA:214,0
-DA:299,0
-DA:300,0
-DA:301,0
-DA:377,22
-DA:378,22
-DA:386,46
-DA:387,46
-DA:395,40
-DA:396,40
-DA:404,84
-DA:405,84
-DA:484,44
-DA:485,44
-DA:489,22
-DA:490,22
-DA:526,11
-DA:527,11
-DA:686,11
-DA:688,11
-DA:690,0
-DA:691,0
-DA:694,11
-DA:695,11
-DA:1075,11
-DA:1077,11
-DA:1078,0
-DA:1080,11
-DA:1081,11
-BA:144,0
-BA:144,0
-BA:144,2
-BA:144,1
-BA:144,2
-BA:144,1
-BA:144,0
-BA:144,0
-BA:149,0
-BA:149,0
-BA:149,0
-BA:149,0
-BA:149,0
-BA:149,0
-BA:149,0
-BA:149,0
-BA:688,0
-BA:688,0
-BA:688,1
-BA:688,2
-BA:688,1
-BA:688,2
-BA:688,0
-BA:688,0
-BA:1077,0
-BA:1077,0
-BA:1077,1
-BA:1077,2
-BA:1077,1
-BA:1077,2
-BA:1077,0
-BA:1077,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,2
-BA:1081,1
-BA:1081,1
-BA:1081,2
-BA:1081,2
-BA:1081,1
-BA:1081,1
-BA:1081,2
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-LF:49
-LH:26
-end_of_record
-SF:/usr/include/c++/4.3/bits/stream_iterator.h
-FN:181,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERSoPKc
-FN:185,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERKS2_
-FN:202,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEdeEv
-FN:206,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEppEv
-FN:191,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEaSERKSs
-DA:181,0
-DA:182,0
-DA:185,0
-DA:186,0
-DA:191,0
-DA:196,0
-DA:197,0
-DA:198,0
-DA:202,0
-DA:203,0
-DA:206,0
-DA:207,0
-BA:197,0
-BA:197,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/vector.tcc
-FN:283,_ZNSt6vectorISsSaISsEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPSsS1_EERKSs
-FN:283,_ZNSt6vectorIPN6wibble11commandline6EngineESaIS3_EE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPS3_S5_EERKS3_
-FN:283,_ZNSt6vectorIPN6wibble11commandline11OptionGroupESaIS3_EE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPS3_S5_EERKS3_
-FN:283,_ZNSt6vectorIPN6wibble11commandline6OptionESaIS3_EE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPS3_S5_EERKS3_
-DA:283,11
-DA:286,11
-DA:288,0
-DA:291,0
-DA:293,0
-DA:295,0
-DA:299,0
-DA:307,11
-DA:308,11
-DA:309,11
-DA:316,11
-DA:321,11
-DA:323,11
-DA:324,11
-DA:330,0
-DA:332,0
-DA:333,0
-DA:334,0
-DA:336,11
-DA:338,11
-DA:341,11
-DA:342,11
-DA:343,11
-DA:345,11
-BA:286,0
-BA:286,0
-BA:286,1
-BA:286,2
-BA:286,1
-BA:286,2
-BA:286,0
-BA:286,0
-LF:24
-LH:15
-end_of_record
-SF:/usr/include/c++/4.3/exception
-FN:59,_ZNSt9exceptionC2Ev
-DA:59,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:107,_ZN9__gnu_cxx13new_allocatorIPN6wibble11commandline6OptionEE9constructEPS4_RKS4_
-FN:107,_ZN9__gnu_cxx13new_allocatorIPN6wibble11commandline11OptionGroupEE9constructEPS4_RKS4_
-FN:107,_ZN9__gnu_cxx13new_allocatorIPN6wibble11commandline6EngineEE9constructEPS4_RKS4_
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKcPN6wibble11commandline6OptionEEE7destroyEPS7_
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISsE8max_sizeEv
-FN:101,_ZNK9__gnu_cxx13new_allocatorIPN6wibble11commandline6OptionEE8max_sizeEv
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKcPN6wibble11commandline6OptionEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsPN6wibble11commandline6OptionEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsPN6wibble11commandline6EngineEEED2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorIPN6wibble11commandline11OptionGroupEE8max_sizeEv
-FN:101,_ZNK9__gnu_cxx13new_allocatorIPN6wibble11commandline6EngineEE8max_sizeEv
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKcPN6wibble11commandline6OptionEEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsPN6wibble11commandline6OptionEEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsPN6wibble11commandline6EngineEEEC2Ev
-FN:107,_ZN9__gnu_cxx13new_allocatorISt4pairIKcPN6wibble11commandline6OptionEEE9constructEPS7_RKS7_
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKcPN6wibble11commandline6OptionEEEE8max_sizeEv
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsPN6wibble11commandline6OptionEEEE8max_sizeEv
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsPN6wibble11commandline6EngineEEEE8max_sizeEv
-FN:107,_ZN9__gnu_cxx13new_allocatorISsE9constructEPSsRKSs
-FN:107,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsPN6wibble11commandline6EngineEEE9constructEPS7_RKS7_
-FN:107,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsPN6wibble11commandline6OptionEEE9constructEPS7_RKS7_
-FN:118,_ZN9__gnu_cxx13new_allocatorISsE7destroyEPSs
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsPN6wibble11commandline6OptionEEE7destroyEPS7_
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsPN6wibble11commandline6EngineEEE7destroyEPS7_
-FN:97,_ZN9__gnu_cxx13new_allocatorISt10_List_nodeISsEE10deallocateEPS2_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-FN:97,_ZN9__gnu_cxx13new_allocatorIPN6wibble11commandline6EngineEE10deallocateEPS4_j
-FN:97,_ZN9__gnu_cxx13new_allocatorIPN6wibble11commandline11OptionGroupEE10deallocateEPS4_j
-FN:97,_ZN9__gnu_cxx13new_allocatorIPN6wibble11commandline6OptionEE10deallocateEPS4_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKcPN6wibble11commandline6OptionEEEE10deallocateEPS9_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsPN6wibble11commandline6OptionEEEE10deallocateEPS9_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsPN6wibble11commandline6EngineEEEE10deallocateEPS9_j
-FN:87,_ZN9__gnu_cxx13new_allocatorISsE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorIPN6wibble11commandline6EngineEE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorIPN6wibble11commandline11OptionGroupEE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorIPN6wibble11commandline6OptionEE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsPN6wibble11commandline6EngineEEEE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKcPN6wibble11commandline6OptionEEEE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsPN6wibble11commandline6OptionEEEE8allocateEjPKv
-DA:69,0
-DA:71,0
-DA:76,0
-DA:87,63
-DA:89,63
-DA:90,0
-DA:92,63
-DA:97,0
-DA:98,0
-DA:101,85
-DA:102,85
-DA:107,63
-DA:108,63
-DA:118,0
-BA:89,0
-BA:89,0
-BA:89,1
-BA:89,2
-BA:89,1
-BA:89,2
-BA:89,0
-BA:89,0
-BA:89,1
-BA:89,2
-BA:89,1
-BA:89,2
-BA:89,1
-BA:89,2
-BA:108,0
-BA:108,0
-BA:108,2
-BA:108,1
-BA:108,2
-BA:108,1
-BA:108,2
-BA:108,1
-BA:108,0
-BA:108,0
-BA:108,2
-BA:108,1
-BA:108,2
-BA:108,1
-LF:14
-LH:7
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/istream
-FN:585,_ZNSiC2Ev
-FN:105,_ZNSiD2Ev
-FN:804,_ZNSdC2Ev
-FN:801,_ZNSdD2Ev
-DA:105,0
-DA:106,0
-DA:585,0
-DA:586,0
-DA:587,0
-DA:801,0
-DA:804,0
-DA:805,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:195,_ZNSolsEj
-FN:464,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_c
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-DA:95,0
-DA:112,0
-DA:117,0
-DA:195,0
-DA:199,0
-DA:365,0
-DA:366,0
-DA:464,0
-DA:465,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:509,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:536,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:555,_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:509,0
-DA:510,0
-DA:511,0
-DA:536,0
-DA:537,0
-DA:555,0
-DA:556,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/commandline/core.h
-FN:21,_ZNK6wibble9exception9BadOption4typeEv
-FN:52,_ZN6wibble11commandline7ManagedC2Ev
-FN:54,_ZN6wibble11commandline7ManagedD0Ev
-FN:54,_ZN6wibble11commandline7ManagedD1Ev
-FN:54,_ZN6wibble11commandline7ManagedD2Ev
-FN:22,_ZNK6wibble9exception9BadOption4descEv
-FN:19,_ZN6wibble9exception9BadOptionD0Ev
-FN:19,_ZN6wibble9exception9BadOptionD1Ev
-FN:17,_ZN6wibble9exception9BadOptionC1ERKSsS3_
-DA:17,0
-DA:18,0
-DA:19,0
-DA:21,0
-DA:22,0
-DA:52,0
-DA:54,0
-BA:19,0
-BA:19,0
-BA:19,0
-BA:19,0
-BA:54,0
-BA:54,0
-BA:54,0
-BA:54,0
-BA:54,0
-BA:54,0
-LF:7
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/commandline/options.h
-FN:95,_ZN6wibble11commandline6OptionD0Ev
-FN:95,_ZN6wibble11commandline6OptionD1Ev
-DA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-LF:1
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/exception.h
-FN:190,_ZNK6wibble9exception7Generic4typeEv
-FN:263,_ZNK6wibble9exception11Consistency4typeEv
-FN:137,_ZN6wibble9exception7ContextD2Ev
-FN:213,_ZNK6wibble9exception7Generic4whatEv
-FN:265,_ZNK6wibble9exception11Consistency4descEv
-FN:193,_ZNK6wibble9exception7Generic4descEv
-FN:154,_ZNK6wibble9exception7Context13formatContextEv
-FN:205,_ZNK6wibble9exception7Generic8fullInfoEv
-FN:187,_ZN6wibble9exception7GenericD0Ev
-FN:187,_ZN6wibble9exception7GenericD1Ev
-FN:187,_ZN6wibble9exception7GenericD2Ev
-FN:261,_ZN6wibble9exception11ConsistencyD0Ev
-FN:261,_ZN6wibble9exception11ConsistencyD1Ev
-FN:261,_ZN6wibble9exception11ConsistencyD2Ev
-FN:109,_ZN6wibble9exception10AddContext7contextEv
-FN:117,_ZN6wibble9exception10AddContext11copyContextISt20back_insert_iteratorISt6vectorISsSaISsEEEEEvT_
-FN:153,_ZN6wibble9exception7Context10addContextERKSs
-FN:147,_ZN6wibble9exception7ContextC2ERKSs
-FN:186,_ZN6wibble9exception7GenericC2ERKSs
-FN:259,_ZN6wibble9exception11ConsistencyC2ERKSsS3_
-DA:109,0
-DA:110,0
-DA:111,0
-DA:112,0
-DA:113,0
-DA:117,0
-DA:118,0
-DA:119,0
-DA:137,0
-DA:147,0
-DA:148,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:153,0
-DA:154,0
-DA:155,0
-DA:156,0
-DA:157,0
-DA:159,0
-DA:161,0
-DA:162,0
-DA:163,0
-DA:186,0
-DA:187,0
-DA:190,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:205,0
-DA:206,0
-DA:207,0
-DA:209,0
-DA:210,0
-DA:213,0
-DA:259,0
-DA:260,0
-DA:261,0
-DA:263,0
-DA:265,0
-DA:266,0
-DA:267,0
-DA:268,0
-DA:269,0
-BA:110,0
-BA:110,0
-BA:156,0
-BA:156,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:207,0
-BA:207,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:267,0
-BA:267,0
-LF:44
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/string.h
-FN:71,_ZN6wibble3str3fmtIiEESsRKT_
-DA:71,0
-DA:73,0
-DA:74,0
-DA:75,0
-LF:4
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/commandline/options.cpp
-FN:24,_ZN6wibble11commandline4Bool6toBoolERKb
-FN:25,_ZN6wibble11commandline4Bool5toIntERKb
-FN:36,_ZN6wibble11commandline3Int6toBoolERKi
-FN:37,_ZN6wibble11commandline3Int5toIntERKi
-FN:44,_ZN6wibble11commandline6String6toBoolERKSs
-FN:135,_Z41__static_initialization_and_destruction_0ii
-FN:135,_GLOBAL__I_options.cpp
-FN:88,_ZN6wibble11commandline6OptionC1Ev
-FN:88,_ZN6wibble11commandline6OptionC2Ev
-FN:26,_ZN6wibble11commandline4Bool8toStringERKb
-FN:80,_ZN6wibble11commandlineL10manfmtlongERKSsS2_
-FN:64,_ZN6wibble11commandlineL7fmtlongERKSsS2_
-FN:54,_ZN6wibble11commandline12ExistingFile8toStringERKSs
-FN:46,_ZN6wibble11commandline6String8toStringERKSs
-FN:40,_ZN6wibble11commandline6String5parseERKSs
-FN:72,_ZN6wibble11commandlineL11manfmtshortEcRKSs
-FN:113,_ZNK6wibble11commandline6Option15fullUsageForManEv
-FN:56,_ZN6wibble11commandlineL8fmtshortEcRKSs
-FN:90,_ZNK6wibble11commandline6Option9fullUsageEv
-FN:48,_ZN6wibble11commandline12ExistingFile5parseERKSs
-FN:45,_ZN6wibble11commandline6String5toIntERKSs
-FN:28,_ZN6wibble11commandline3Int5parseERKSs
-FN:38,_ZN6wibble11commandline3Int8toStringERKi
-FN:16,_ZN6wibble11commandline4Bool5parseERKSs
-DA:16,2
-DA:18,2
-DA:19,1
-DA:20,1
-DA:21,1
-DA:22,0
-DA:24,0
-DA:25,0
-DA:26,0
-DA:28,3
-DA:31,7
-DA:32,4
-DA:33,0
-DA:34,3
-DA:36,2
-DA:37,4
-DA:38,2
-DA:40,10
-DA:42,10
-DA:44,4
-DA:45,0
-DA:46,13
-DA:48,0
-DA:50,0
-DA:51,0
-DA:52,0
-DA:54,0
-DA:56,0
-DA:58,0
-DA:59,0
-DA:61,0
-DA:64,0
-DA:66,0
-DA:67,0
-DA:69,0
-DA:72,0
-DA:74,0
-DA:75,0
-DA:77,0
-DA:80,0
-DA:82,0
-DA:83,0
-DA:85,0
-DA:88,0
-DA:90,0
-DA:92,0
-DA:94,0
-DA:97,0
-DA:98,0
-DA:99,0
-DA:102,0
-DA:105,0
-DA:106,0
-DA:107,0
-DA:110,0
-DA:113,0
-DA:115,0
-DA:117,0
-DA:120,0
-DA:121,0
-DA:124,0
-DA:127,0
-DA:128,0
-DA:131,0
-DA:135,3
-BA:18,2
-BA:18,1
-BA:18,2
-BA:18,1
-BA:18,2
-BA:18,1
-BA:18,2
-BA:18,2
-BA:18,1
-BA:18,2
-BA:18,2
-BA:18,2
-BA:20,2
-BA:20,1
-BA:20,2
-BA:20,1
-BA:20,2
-BA:20,1
-BA:20,1
-BA:20,2
-BA:20,0
-BA:20,0
-BA:20,2
-BA:20,1
-BA:25,0
-BA:25,0
-BA:26,0
-BA:26,0
-BA:31,2
-BA:31,2
-BA:32,1
-BA:32,2
-BA:50,0
-BA:50,0
-BA:58,0
-BA:58,0
-BA:66,0
-BA:66,0
-BA:74,0
-BA:74,0
-BA:82,0
-BA:82,0
-BA:92,0
-BA:92,0
-BA:94,0
-BA:94,0
-BA:97,0
-BA:97,0
-BA:102,0
-BA:102,0
-BA:105,0
-BA:105,0
-BA:117,0
-BA:117,0
-BA:120,0
-BA:120,0
-BA:124,0
-BA:124,0
-BA:127,0
-BA:127,0
-BA:135,2
-BA:135,1
-BA:135,2
-BA:135,1
-LF:65
-LH:17
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:98,_ZNSaIcEC2Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaISsED2Ev
-FN:98,_ZNSaISsEC2Ev
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:276,0
-BA:276,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:1534,_ZNKSs5c_strEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:612,_ZNKSs6lengthEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:543,_ZNKSs5beginEv
-FN:562,_ZNKSs3endEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:835,_ZNSs6appendEPKc
-FN:782,_ZNSspLEPKc
-FN:773,_ZNSspLERKSs
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-FN:2121,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_
-FN:2136,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S3_
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-FN:2188,_ZSteqIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_EPKS3_
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:543,0
-DA:544,0
-DA:562,0
-DA:563,0
-DA:606,0
-DA:607,0
-DA:612,0
-DA:613,0
-DA:686,0
-DA:687,0
-DA:773,0
-DA:774,0
-DA:782,0
-DA:783,0
-DA:835,0
-DA:838,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2121,0
-DA:2123,0
-DA:2124,0
-DA:2125,0
-DA:2136,0
-DA:2140,0
-DA:2141,0
-DA:2142,0
-DA:2188,0
-DA:2189,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-LF:81
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:668,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_EPKS3_RKS6_
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-DA:668,0
-DA:673,0
-DA:674,0
-DA:675,0
-DA:676,0
-DA:677,0
-DA:678,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:23
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb0EE3__bES7_
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb0EE3__bES6_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb1EE3__bES7_
-FN:268,_ZNSt12__niter_baseISt16ostream_iteratorISscSt11char_traitsIcEELb0EE3__bES3_
-FN:286,_ZNSt12__miter_baseIPSsLb0EE3__bES0_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb1EE3__bES6_
-FN:268,_ZNSt12__niter_baseISt20back_insert_iteratorISt6vectorISsSaISsEEELb0EE3__bES4_
-FN:268,_ZNSt12__niter_baseIPSsLb0EE3__bES0_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPKSsSt16ostream_iteratorISscSt11char_traitsIcEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPKSsSt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_SD_SC_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET0_T_SD_SC_
-FN:539,_ZNSt20__copy_move_backwardILb0ELb0ESt26random_access_iterator_tagE13__copy_move_bIPSsS3_EET0_T_S5_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0EPSsS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPSsS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardIPSsS0_ET0_T_S2_S1_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET1_T0_SA_S9_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET0_T_SA_S9_
-DA:210,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:268,0
-DA:269,0
-DA:276,0
-DA:277,0
-DA:286,0
-DA:287,0
-DA:337,0
-DA:340,0
-DA:342,0
-DA:343,0
-DA:344,0
-DA:346,0
-DA:385,0
-DA:393,0
-DA:396,0
-DA:430,0
-DA:435,0
-DA:456,0
-DA:466,0
-DA:539,0
-DA:542,0
-DA:543,0
-DA:544,0
-DA:579,0
-DA:587,0
-DA:592,0
-DA:597,0
-DA:602,0
-DA:624,0
-DA:636,0
-BA:215,0
-BA:215,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:542,0
-BA:542,0
-LF:34
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:97,_ZSt8_DestroyIPcEvT_S1_
-FN:126,_ZSt8_DestroyIPccEvT_S1_RSaIT0_E
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-DA:87,0
-DA:88,0
-DA:97,0
-DA:101,0
-DA:103,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-BA:101,0
-BA:101,0
-LF:9
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:703,_ZN9__gnu_cxx17__normal_iteratorIPKcSsEppEv
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPKcSsEdeEv
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPKcSt6vectorIcSaIcEEEdeEv
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEdeEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKcSsEC1ERKS2_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKcSsE4baseEv
-FN:781,_ZN9__gnu_cxxneIPKcSsEEbRKNS_17__normal_iteratorIT_T0_EES8_
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEdeEv
-FN:398,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEC1ERS2_
-FN:456,_ZSt13back_inserterISt6vectorISsSaISsEEESt20back_insert_iteratorIT_ERS4_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEC1ERKS2_
-FN:710,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEppEi
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKcSt6vectorIcSaIcEEEC1ERKS2_
-FN:710,_ZN9__gnu_cxx17__normal_iteratorIPKcSt6vectorIcSaIcEEEppEi
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKcSt6vectorIcSaIcEEE4baseEv
-FN:781,_ZN9__gnu_cxxneIPKcSt6vectorIcSaIcEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEE4baseEv
-FN:781,_ZN9__gnu_cxxneIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-FN:769,_ZN9__gnu_cxxeqIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEE4baseEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEC1ERKS1_
-FN:429,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEdeEv
-FN:434,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEppEv
-FN:412,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEaSERKSs
-DA:398,0
-DA:412,0
-DA:414,0
-DA:415,0
-DA:429,0
-DA:430,0
-DA:434,0
-DA:435,0
-DA:456,0
-DA:457,0
-DA:683,0
-DA:695,0
-DA:696,0
-DA:703,0
-DA:705,0
-DA:706,0
-DA:710,0
-DA:711,0
-DA:747,0
-DA:748,0
-DA:769,0
-DA:770,0
-DA:781,0
-DA:782,0
-LF:24
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,0
-DA:166,0
-DA:167,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyIPSsS2_EET0_T_S4_S3_
-FN:113,_ZSt18uninitialized_copyIPSsS0_ET0_T_S2_S1_
-FN:261,_ZSt22__uninitialized_copy_aIPSsS0_SsET0_T_S2_S1_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPSsS0_SaISsEET0_T_S3_S2_RT1_
-DA:73,0
-DA:75,0
-DA:78,0
-DA:79,0
-DA:81,0
-DA:83,0
-DA:85,0
-DA:86,0
-DA:113,0
-DA:122,0
-DA:261,0
-DA:262,0
-DA:268,0
-DA:272,0
-BA:78,0
-BA:78,0
-BA:79,0
-BA:79,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:386,_ZNKSt6vectorISsSaISsEE5beginEv
-FN:404,_ZNKSt6vectorISsSaISsEE3endEv
-FN:79,_ZNSt12_Vector_baseIcSaIcEE12_Vector_implD1Ev
-FN:97,_ZNSt12_Vector_baseIcSaIcEE19_M_get_Tp_allocatorEv
-FN:484,_ZNKSt6vectorISsSaISsEE4sizeEv
-FN:101,_ZNKSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:386,_ZNKSt6vectorIcSaIcEE5beginEv
-FN:404,_ZNKSt6vectorIcSaIcEE3endEv
-FN:526,_ZNKSt6vectorISsSaISsEE5emptyEv
-FN:395,_ZNSt6vectorISsSaISsEE3endEv
-FN:377,_ZNSt6vectorISsSaISsEE5beginEv
-FN:84,_ZNSt12_Vector_baseIcSaIcEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseIcSaIcEEC2Ev
-FN:213,_ZNSt6vectorIcSaIcEEC1Ev
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:84,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseISsSaISsEEC2Ev
-FN:213,_ZNSt6vectorISsSaISsEEC1Ev
-FN:489,_ZNKSt6vectorISsSaISsEE8max_sizeEv
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-FN:147,_ZNSt12_Vector_baseIcSaIcEE13_M_deallocateEPcj
-FN:135,_ZNSt12_Vector_baseIcSaIcEED2Ev
-FN:299,_ZNSt6vectorIcSaIcEED1Ev
-FN:1075,_ZNKSt6vectorISsSaISsEE12_M_check_lenEjPKc
-FN:143,_ZNSt12_Vector_baseISsSaISsEE11_M_allocateEj
-FN:686,_ZNSt6vectorISsSaISsEE9push_backERKSs
-DA:79,0
-DA:84,0
-DA:85,0
-DA:86,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:108,0
-DA:109,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:143,0
-DA:144,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:213,0
-DA:214,0
-DA:299,0
-DA:300,0
-DA:301,0
-DA:377,0
-DA:378,0
-DA:386,0
-DA:387,0
-DA:395,0
-DA:396,0
-DA:404,0
-DA:405,0
-DA:484,0
-DA:485,0
-DA:489,0
-DA:490,0
-DA:526,0
-DA:527,0
-DA:686,0
-DA:688,0
-DA:690,0
-DA:691,0
-DA:694,0
-DA:695,0
-DA:1075,0
-DA:1077,0
-DA:1078,0
-DA:1080,0
-DA:1081,0
-BA:144,0
-BA:144,0
-BA:149,0
-BA:149,0
-BA:149,0
-BA:149,0
-BA:688,0
-BA:688,0
-BA:1077,0
-BA:1077,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-LF:49
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stream_iterator.h
-FN:181,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERSoPKc
-FN:185,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERKS2_
-FN:202,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEdeEv
-FN:206,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEppEv
-FN:191,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEaSERKSs
-DA:181,0
-DA:182,0
-DA:185,0
-DA:186,0
-DA:191,0
-DA:196,0
-DA:197,0
-DA:198,0
-DA:202,0
-DA:203,0
-DA:206,0
-DA:207,0
-BA:197,0
-BA:197,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/vector.tcc
-FN:283,_ZNSt6vectorISsSaISsEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPSsS1_EERKSs
-DA:283,0
-DA:286,0
-DA:288,0
-DA:291,0
-DA:293,0
-DA:295,0
-DA:299,0
-DA:307,0
-DA:308,0
-DA:309,0
-DA:316,0
-DA:321,0
-DA:323,0
-DA:324,0
-DA:330,0
-DA:332,0
-DA:333,0
-DA:334,0
-DA:336,0
-DA:338,0
-DA:341,0
-DA:342,0
-DA:343,0
-DA:345,0
-BA:286,0
-BA:286,0
-LF:24
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/exception
-FN:59,_ZNSt9exceptionC2Ev
-DA:59,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISsE8max_sizeEv
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-FN:97,_ZN9__gnu_cxx13new_allocatorIcE10deallocateEPcj
-FN:107,_ZN9__gnu_cxx13new_allocatorISsE9constructEPSsRKSs
-FN:87,_ZN9__gnu_cxx13new_allocatorISsE8allocateEjPKv
-DA:69,0
-DA:71,0
-DA:76,0
-DA:87,0
-DA:89,0
-DA:90,0
-DA:92,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:107,0
-DA:108,0
-BA:89,0
-BA:89,0
-BA:108,0
-BA:108,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/istream
-FN:585,_ZNSiC2Ev
-FN:105,_ZNSiD2Ev
-FN:804,_ZNSdC2Ev
-FN:801,_ZNSdD2Ev
-DA:105,0
-DA:106,0
-DA:585,0
-DA:586,0
-DA:587,0
-DA:801,0
-DA:804,0
-DA:805,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-DA:95,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:509,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:536,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:555,_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:509,0
-DA:510,0
-DA:511,0
-DA:536,0
-DA:537,0
-DA:555,0
-DA:556,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/exception.h
-FN:190,_ZNK6wibble9exception7Generic4typeEv
-FN:263,_ZNK6wibble9exception11Consistency4typeEv
-FN:137,_ZN6wibble9exception7ContextD2Ev
-FN:265,_ZNK6wibble9exception11Consistency4descEv
-FN:213,_ZNK6wibble9exception7Generic4whatEv
-FN:193,_ZNK6wibble9exception7Generic4descEv
-FN:154,_ZNK6wibble9exception7Context13formatContextEv
-FN:205,_ZNK6wibble9exception7Generic8fullInfoEv
-FN:187,_ZN6wibble9exception7GenericD0Ev
-FN:187,_ZN6wibble9exception7GenericD1Ev
-FN:187,_ZN6wibble9exception7GenericD2Ev
-FN:261,_ZN6wibble9exception11ConsistencyD0Ev
-FN:261,_ZN6wibble9exception11ConsistencyD1Ev
-FN:395,_ZN6wibble9exception6SystemD1Ev
-FN:109,_ZN6wibble9exception10AddContext7contextEv
-FN:117,_ZN6wibble9exception10AddContext11copyContextISt20back_insert_iteratorISt6vectorISsSaISsEEEEEvT_
-FN:153,_ZN6wibble9exception7Context10addContextERKSs
-FN:147,_ZN6wibble9exception7ContextC2ERKSs
-FN:186,_ZN6wibble9exception7GenericC2ERKSs
-FN:259,_ZN6wibble9exception11ConsistencyC1ERKSsS3_
-DA:109,0
-DA:110,0
-DA:111,0
-DA:112,0
-DA:113,0
-DA:117,0
-DA:118,0
-DA:119,0
-DA:137,0
-DA:147,0
-DA:148,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:153,0
-DA:154,0
-DA:155,0
-DA:156,0
-DA:157,0
-DA:159,0
-DA:161,0
-DA:162,0
-DA:163,0
-DA:186,0
-DA:187,0
-DA:190,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:205,0
-DA:206,0
-DA:207,0
-DA:209,0
-DA:210,0
-DA:213,0
-DA:259,0
-DA:260,0
-DA:261,0
-DA:263,0
-DA:265,0
-DA:266,0
-DA:267,0
-DA:268,0
-DA:269,0
-DA:395,0
-BA:110,0
-BA:110,0
-BA:156,0
-BA:156,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:207,0
-BA:207,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:267,0
-BA:267,0
-BA:395,0
-BA:395,0
-LF:45
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/sys/childprocess.h
-FN:53,_ZN6wibble3sys12ChildProcessD2Ev
-FN:53,_ZN6wibble3sys12ChildProcessD0Ev
-FN:53,_ZN6wibble3sys12ChildProcessD1Ev
-DA:53,0
-BA:53,0
-BA:53,0
-BA:53,0
-BA:53,0
-BA:53,0
-BA:53,0
-LF:1
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/sys/exec.h
-FN:43,_ZN6wibble3sys4ExecD0Ev
-FN:43,_ZN6wibble3sys4ExecD1Ev
-DA:43,0
-BA:43,0
-BA:43,0
-BA:43,0
-BA:43,0
-LF:1
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/sys/exec.cpp
-FN:81,_Z41__static_initialization_and_destruction_0ii
-FN:81,_GLOBAL__I_exec.cpp
-FN:48,_ZN6wibble3sys4Exec4execEv
-FN:32,_ZN6wibble3sys4Exec4mainEv
-FN:42,_ZN6wibble3sys4Exec9importEnvEv
-DA:32,0
-DA:35,0
-DA:36,0
-DA:37,0
-DA:39,0
-DA:42,0
-DA:44,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:51,0
-DA:52,0
-DA:53,0
-DA:54,0
-DA:56,0
-DA:58,0
-DA:59,0
-DA:60,0
-DA:61,0
-DA:62,0
-DA:65,0
-DA:66,0
-DA:69,0
-DA:70,0
-DA:72,0
-DA:73,0
-DA:77,0
-DA:81,3
-BA:44,0
-BA:44,0
-BA:52,0
-BA:52,0
-BA:56,0
-BA:56,0
-BA:58,0
-BA:58,0
-BA:60,0
-BA:60,0
-BA:61,0
-BA:61,0
-BA:66,0
-BA:66,0
-BA:72,0
-BA:72,0
-BA:81,2
-BA:81,1
-BA:81,2
-BA:81,1
-LF:28
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:100,_ZNSaIcEC1ERKS_
-FN:100,_ZNSaIcEC2ERKS_
-FN:106,_ZNSaISsED2Ev
-FN:98,_ZNSaISsEC2Ev
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:1534,_ZNKSs5c_strEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:612,_ZNKSs6lengthEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:1551,_ZNKSs13get_allocatorEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:835,_ZNSs6appendEPKc
-FN:2121,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:612,0
-DA:613,0
-DA:686,0
-DA:687,0
-DA:835,0
-DA:838,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2121,0
-DA:2123,0
-DA:2124,0
-DA:2125,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-LF:67
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:668,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_EPKS3_RKS6_
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-DA:668,0
-DA:673,0
-DA:674,0
-DA:675,0
-DA:676,0
-DA:677,0
-DA:678,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:23
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb0EE3__bES7_
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb0EE3__bES6_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb1EE3__bES7_
-FN:268,_ZNSt12__niter_baseISt16ostream_iteratorISscSt11char_traitsIcEELb0EE3__bES3_
-FN:286,_ZNSt12__miter_baseIPSsLb0EE3__bES0_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb1EE3__bES6_
-FN:268,_ZNSt12__niter_baseISt20back_insert_iteratorISt6vectorISsSaISsEEELb0EE3__bES4_
-FN:268,_ZNSt12__niter_baseIPSsLb0EE3__bES0_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPKSsSt16ostream_iteratorISscSt11char_traitsIcEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPKSsSt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_SD_SC_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET0_T_SD_SC_
-FN:539,_ZNSt20__copy_move_backwardILb0ELb0ESt26random_access_iterator_tagE13__copy_move_bIPSsS3_EET0_T_S5_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0EPSsS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPSsS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardIPSsS0_ET0_T_S2_S1_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET1_T0_SA_S9_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET0_T_SA_S9_
-DA:210,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:268,0
-DA:269,0
-DA:276,0
-DA:277,0
-DA:286,0
-DA:287,0
-DA:337,0
-DA:340,0
-DA:342,0
-DA:343,0
-DA:344,0
-DA:346,0
-DA:385,0
-DA:393,0
-DA:396,0
-DA:430,0
-DA:435,0
-DA:456,0
-DA:466,0
-DA:539,0
-DA:542,0
-DA:543,0
-DA:544,0
-DA:579,0
-DA:587,0
-DA:592,0
-DA:597,0
-DA:602,0
-DA:624,0
-DA:636,0
-BA:215,0
-BA:215,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:542,0
-BA:542,0
-LF:34
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-DA:87,0
-DA:88,0
-DA:97,0
-DA:101,0
-DA:103,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-BA:101,0
-BA:101,0
-LF:9
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEdeEv
-FN:398,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEC1ERS2_
-FN:456,_ZSt13back_inserterISt6vectorISsSaISsEEESt20back_insert_iteratorIT_ERS4_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEC1ERKS2_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEE4baseEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEC1ERKS1_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-FN:429,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEdeEv
-FN:434,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEppEv
-FN:412,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEaSERKSs
-DA:398,0
-DA:412,0
-DA:414,0
-DA:415,0
-DA:429,0
-DA:430,0
-DA:434,0
-DA:435,0
-DA:456,0
-DA:457,0
-DA:683,0
-DA:695,0
-DA:696,0
-DA:747,0
-DA:748,0
-DA:769,0
-DA:770,0
-LF:17
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,0
-DA:166,0
-DA:167,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyIPSsS2_EET0_T_S4_S3_
-FN:113,_ZSt18uninitialized_copyIPSsS0_ET0_T_S2_S1_
-FN:261,_ZSt22__uninitialized_copy_aIPSsS0_SsET0_T_S2_S1_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPSsS0_SaISsEET0_T_S3_S2_RT1_
-DA:73,0
-DA:75,0
-DA:78,0
-DA:79,0
-DA:81,0
-DA:83,0
-DA:85,0
-DA:86,0
-DA:113,0
-DA:122,0
-DA:261,0
-DA:262,0
-DA:268,0
-DA:272,0
-BA:78,0
-BA:78,0
-BA:79,0
-BA:79,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:484,_ZNKSt6vectorISsSaISsEE4sizeEv
-FN:562,_ZNSt6vectorISsSaISsEEixEj
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:404,_ZNKSt6vectorISsSaISsEE3endEv
-FN:386,_ZNKSt6vectorISsSaISsEE5beginEv
-FN:101,_ZNKSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:395,_ZNSt6vectorISsSaISsEE3endEv
-FN:377,_ZNSt6vectorISsSaISsEE5beginEv
-FN:526,_ZNKSt6vectorISsSaISsEE5emptyEv
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:84,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseISsSaISsEEC2Ev
-FN:213,_ZNSt6vectorISsSaISsEEC1Ev
-FN:489,_ZNKSt6vectorISsSaISsEE8max_sizeEv
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-FN:1075,_ZNKSt6vectorISsSaISsEE12_M_check_lenEjPKc
-FN:143,_ZNSt12_Vector_baseISsSaISsEE11_M_allocateEj
-FN:686,_ZNSt6vectorISsSaISsEE9push_backERKSs
-DA:79,0
-DA:84,0
-DA:85,0
-DA:86,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:108,0
-DA:109,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:143,0
-DA:144,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:213,0
-DA:214,0
-DA:299,0
-DA:300,0
-DA:301,0
-DA:377,0
-DA:378,0
-DA:386,0
-DA:387,0
-DA:395,0
-DA:396,0
-DA:404,0
-DA:405,0
-DA:484,0
-DA:485,0
-DA:489,0
-DA:490,0
-DA:526,0
-DA:527,0
-DA:562,0
-DA:563,0
-DA:686,0
-DA:688,0
-DA:690,0
-DA:691,0
-DA:694,0
-DA:695,0
-DA:1075,0
-DA:1077,0
-DA:1078,0
-DA:1080,0
-DA:1081,0
-BA:144,0
-BA:144,0
-BA:149,0
-BA:149,0
-BA:688,0
-BA:688,0
-BA:1077,0
-BA:1077,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-LF:51
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stream_iterator.h
-FN:181,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERSoPKc
-FN:185,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERKS2_
-FN:202,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEdeEv
-FN:206,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEppEv
-FN:191,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEaSERKSs
-DA:181,0
-DA:182,0
-DA:185,0
-DA:186,0
-DA:191,0
-DA:196,0
-DA:197,0
-DA:198,0
-DA:202,0
-DA:203,0
-DA:206,0
-DA:207,0
-BA:197,0
-BA:197,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/vector.tcc
-FN:283,_ZNSt6vectorISsSaISsEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPSsS1_EERKSs
-DA:283,0
-DA:286,0
-DA:288,0
-DA:291,0
-DA:293,0
-DA:295,0
-DA:299,0
-DA:307,0
-DA:308,0
-DA:309,0
-DA:316,0
-DA:321,0
-DA:323,0
-DA:324,0
-DA:330,0
-DA:332,0
-DA:333,0
-DA:334,0
-DA:336,0
-DA:338,0
-DA:341,0
-DA:342,0
-DA:343,0
-DA:345,0
-BA:286,0
-BA:286,0
-LF:24
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/exception
-FN:59,_ZNSt9exceptionC2Ev
-DA:59,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISsE8max_sizeEv
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-FN:107,_ZN9__gnu_cxx13new_allocatorISsE9constructEPSsRKSs
-FN:87,_ZN9__gnu_cxx13new_allocatorISsE8allocateEjPKv
-DA:69,0
-DA:71,0
-DA:76,0
-DA:87,0
-DA:89,0
-DA:90,0
-DA:92,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:107,0
-DA:108,0
-BA:89,0
-BA:89,0
-BA:108,0
-BA:108,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/istream
-FN:585,_ZNSiC2Ev
-FN:105,_ZNSiD2Ev
-FN:804,_ZNSdC2Ev
-FN:801,_ZNSdD2Ev
-DA:105,0
-DA:106,0
-DA:585,0
-DA:586,0
-DA:587,0
-DA:801,0
-DA:804,0
-DA:805,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-DA:95,0
-DA:112,0
-DA:117,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:509,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:536,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:555,_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:509,0
-DA:510,0
-DA:511,0
-DA:536,0
-DA:537,0
-DA:555,0
-DA:556,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/sys/buffer.cpp
-FN:90,_ZNK6wibble3sys6Buffer4DataltERKS2_
-FN:78,_ZNK6wibble3sys6Buffer4DataeqERKS2_
-FN:53,_ZN6wibble3sys6Buffer4DataD1Ev
-FN:53,_ZN6wibble3sys6Buffer4DataD2Ev
-FN:29,_ZN6wibble3sys6Buffer4DataC1Ej
-FN:29,_ZN6wibble3sys6Buffer4DataC2Ej
-FN:60,_ZN6wibble3sys6Buffer4Data6resizeEj
-FN:46,_ZN6wibble3sys6Buffer4DataC1EPKvj
-FN:46,_ZN6wibble3sys6Buffer4DataC2EPKvj
-FN:34,_ZN6wibble3sys6Buffer4DataC1EPvjb
-FN:34,_ZN6wibble3sys6Buffer4DataC2EPvjb
-DA:29,2
-DA:31,2
-DA:32,2
-DA:34,1
-DA:35,1
-DA:37,1
-DA:38,1
-DA:41,0
-DA:42,0
-DA:44,1
-DA:46,4
-DA:47,4
-DA:49,4
-DA:50,4
-DA:51,4
-DA:53,7
-DA:55,7
-DA:56,7
-DA:57,7
-DA:60,1
-DA:62,1
-DA:64,0
-DA:66,0
-DA:67,0
-DA:69,1
-DA:70,0
-DA:72,1
-DA:74,1
-DA:75,1
-DA:78,6
-DA:80,6
-DA:81,0
-DA:82,6
-DA:83,0
-DA:84,6
-DA:85,0
-DA:86,6
-DA:90,4
-DA:92,4
-DA:93,0
-DA:94,4
-DA:95,0
-DA:96,4
-DA:97,0
-DA:98,4
-DA:99,0
-DA:100,4
-DA:101,0
-DA:102,4
-BA:37,2
-BA:37,1
-BA:37,0
-BA:37,0
-BA:55,2
-BA:55,1
-BA:55,0
-BA:55,0
-BA:62,1
-BA:62,2
-BA:64,0
-BA:64,0
-BA:69,1
-BA:69,2
-BA:80,1
-BA:80,2
-BA:82,1
-BA:82,2
-BA:82,0
-BA:82,0
-BA:84,2
-BA:84,1
-BA:84,1
-BA:84,2
-BA:92,1
-BA:92,2
-BA:94,1
-BA:94,2
-BA:96,1
-BA:96,2
-BA:96,0
-BA:96,0
-BA:98,1
-BA:98,2
-BA:100,1
-BA:100,2
-LF:49
-LH:35
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/exception.h
-FN:190,_ZNK6wibble9exception7Generic4typeEv
-FN:263,_ZNK6wibble9exception11Consistency4typeEv
-FN:406,_ZNK6wibble9exception6System4codeEv
-FN:428,_ZNK6wibble9exception4File4typeEv
-FN:137,_ZN6wibble9exception7ContextD2Ev
-FN:187,_ZN6wibble9exception7GenericD2Ev
-FN:395,_ZN6wibble9exception6SystemD1Ev
-FN:395,_ZN6wibble9exception6SystemD2Ev
-FN:213,_ZNK6wibble9exception7Generic4whatEv
-FN:187,_ZN6wibble9exception7GenericD0Ev
-FN:187,_ZN6wibble9exception7GenericD1Ev
-FN:261,_ZN6wibble9exception11ConsistencyD0Ev
-FN:261,_ZN6wibble9exception11ConsistencyD1Ev
-FN:426,_ZN6wibble9exception4FileD0Ev
-FN:426,_ZN6wibble9exception4FileD1Ev
-FN:193,_ZNK6wibble9exception7Generic4descEv
-FN:265,_ZNK6wibble9exception11Consistency4descEv
-FN:154,_ZNK6wibble9exception7Context13formatContextEv
-FN:205,_ZNK6wibble9exception7Generic8fullInfoEv
-FN:109,_ZN6wibble9exception10AddContext7contextEv
-FN:117,_ZN6wibble9exception10AddContext11copyContextISt20back_insert_iteratorISt6vectorISsSaISsEEEEEvT_
-FN:153,_ZN6wibble9exception7Context10addContextERKSs
-FN:147,_ZN6wibble9exception7ContextC2ERKSs
-FN:186,_ZN6wibble9exception7GenericC2ERKSs
-FN:259,_ZN6wibble9exception11ConsistencyC1ERKSsS3_
-FN:424,_ZN6wibble9exception4FileC1ERKSsS3_
-FN:430,_ZNK6wibble9exception4File4descEv
-DA:109,0
-DA:110,0
-DA:111,0
-DA:112,0
-DA:113,0
-DA:117,0
-DA:118,0
-DA:119,0
-DA:137,0
-DA:147,0
-DA:148,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:153,0
-DA:154,0
-DA:155,0
-DA:156,0
-DA:157,0
-DA:159,0
-DA:161,0
-DA:162,0
-DA:163,0
-DA:186,0
-DA:187,0
-DA:190,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:205,0
-DA:206,0
-DA:207,0
-DA:209,0
-DA:210,0
-DA:213,0
-DA:259,0
-DA:260,0
-DA:261,0
-DA:263,0
-DA:265,0
-DA:266,0
-DA:267,0
-DA:268,0
-DA:269,0
-DA:395,0
-DA:406,0
-DA:424,0
-DA:425,0
-DA:426,0
-DA:428,0
-DA:430,0
-BA:110,0
-BA:110,0
-BA:156,0
-BA:156,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:207,0
-BA:207,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:267,0
-BA:267,0
-BA:395,0
-BA:395,0
-BA:395,0
-BA:395,0
-BA:426,0
-BA:426,0
-BA:426,0
-BA:426,0
-LF:51
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/sys/process.cpp
-FN:310,_Z41__static_initialization_and_destruction_0ii
-FN:310,_GLOBAL__I_process.cpp
-FN:250,_ZN6wibble3sys7processL21describe_rlimit_res_tEi
-FN:284,_ZN6wibble3sys7process8getLimitEiPi
-FN:299,_ZN6wibble3sys7process17getOpenFilesLimitEPi
-FN:298,_ZN6wibble3sys7process16getChildrenLimitEPi
-FN:297,_ZN6wibble3sys7process16getCoreSizeLimitEPi
-FN:296,_ZN6wibble3sys7process18getDataMemoryLimitEPi
-FN:295,_ZN6wibble3sys7process16getFileSizeLimitEPi
-FN:294,_ZN6wibble3sys7process15getCPUTimeLimitEPi
-FN:270,_ZN6wibble3sys7process8setLimitEii
-FN:306,_ZN6wibble3sys7process17setOpenFilesLimitEi
-FN:305,_ZN6wibble3sys7process16setChildrenLimitEi
-FN:304,_ZN6wibble3sys7process16setCoreSizeLimitEi
-FN:303,_ZN6wibble3sys7process18setDataMemoryLimitEi
-FN:302,_ZN6wibble3sys7process16setFileSizeLimitEi
-FN:301,_ZN6wibble3sys7process15setCPUTimeLimitEi
-FN:56,_ZN6wibble3sys7process12formatStatusEi
-FN:122,_ZN6wibble3sys7process10initGroupsERKSsj
-FN:133,_ZN6wibble3sys7processL9set_permsERKSsjS3_j
-FN:228,_ZN6wibble3sys7process8setPermsEjj
-FN:207,_ZN6wibble3sys7process8setPermsEj
-FN:114,_ZN6wibble3sys7process12getGroupInfoERKSs
-FN:106,_ZN6wibble3sys7process11getUserInfoERKSs
-FN:187,_ZN6wibble3sys7process8setPermsERKSsS3_
-FN:166,_ZN6wibble3sys7process8setPermsERKSs
-FN:101,_ZN6wibble3sys7process5umaskEj
-FN:95,_ZN6wibble3sys7process6chrootERKSs
-FN:86,_ZN6wibble3sys7process6getcwdEv
-FN:80,_ZN6wibble3sys7process5chdirERKSs
-FN:45,_ZN6wibble3sys7process13detachFromTTYEv
-DA:45,0
-DA:47,0
-DA:48,0
-DA:49,0
-DA:50,0
-DA:51,0
-DA:52,0
-DA:53,0
-DA:54,0
-DA:56,0
-DA:58,0
-DA:60,0
-DA:61,0
-DA:62,0
-DA:63,0
-DA:64,0
-DA:66,0
-DA:67,0
-DA:68,0
-DA:70,0
-DA:73,0
-DA:74,0
-DA:77,0
-DA:80,2
-DA:82,2
-DA:83,0
-DA:84,2
-DA:86,3
-DA:88,3
-DA:89,3
-DA:90,3
-DA:91,0
-DA:92,3
-DA:95,0
-DA:97,0
-DA:98,0
-DA:99,0
-DA:101,2
-DA:103,2
-DA:106,0
-DA:108,0
-DA:109,0
-DA:111,0
-DA:114,0
-DA:116,0
-DA:117,0
-DA:119,0
-DA:122,0
-DA:124,0
-DA:126,0
-DA:128,0
-DA:129,0
-DA:131,0
-DA:133,0
-DA:135,0
-DA:137,0
-DA:139,0
-DA:140,0
-DA:141,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:148,0
-DA:151,0
-DA:153,0
-DA:154,0
-DA:155,0
-DA:158,0
-DA:160,0
-DA:161,0
-DA:162,0
-DA:164,0
-DA:166,0
-DA:168,0
-DA:169,0
-DA:171,0
-DA:172,0
-DA:173,0
-DA:175,0
-DA:176,0
-DA:178,0
-DA:180,0
-DA:181,0
-DA:184,0
-DA:185,0
-DA:187,0
-DA:189,0
-DA:190,0
-DA:192,0
-DA:193,0
-DA:194,0
-DA:196,0
-DA:197,0
-DA:199,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:205,0
-DA:207,0
-DA:209,0
-DA:210,0
-DA:212,0
-DA:213,0
-DA:214,0
-DA:216,0
-DA:217,0
-DA:219,0
-DA:221,0
-DA:222,0
-DA:225,0
-DA:226,0
-DA:228,0
-DA:231,0
-DA:232,0
-DA:234,0
-DA:235,0
-DA:236,0
-DA:238,0
-DA:239,0
-DA:241,0
-DA:242,0
-DA:243,0
-DA:246,0
-DA:247,0
-DA:250,0
-DA:252,0
-DA:254,0
-DA:255,0
-DA:256,0
-DA:257,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:261,0
-DA:262,0
-DA:266,0
-DA:270,0
-DA:273,0
-DA:274,0
-DA:275,0
-DA:276,0
-DA:278,0
-DA:279,0
-DA:280,0
-DA:282,0
-DA:284,0
-DA:287,0
-DA:288,0
-DA:289,0
-DA:290,0
-DA:291,0
-DA:294,0
-DA:295,0
-DA:296,0
-DA:297,0
-DA:298,0
-DA:299,0
-DA:301,0
-DA:302,0
-DA:303,0
-DA:304,0
-DA:305,0
-DA:306,0
-DA:310,9
-BA:48,0
-BA:48,0
-BA:49,0
-BA:49,0
-BA:50,0
-BA:50,0
-BA:51,0
-BA:51,0
-BA:52,0
-BA:52,0
-BA:61,0
-BA:61,0
-BA:64,0
-BA:64,0
-BA:66,0
-BA:66,0
-BA:67,0
-BA:67,0
-BA:74,0
-BA:74,0
-BA:82,1
-BA:82,2
-BA:90,1
-BA:90,2
-BA:97,0
-BA:97,0
-BA:108,0
-BA:108,0
-BA:116,0
-BA:116,0
-BA:124,0
-BA:124,0
-BA:137,0
-BA:137,0
-BA:144,0
-BA:144,0
-BA:151,0
-BA:151,0
-BA:158,0
-BA:158,0
-BA:169,0
-BA:169,0
-BA:176,0
-BA:176,0
-BA:190,0
-BA:190,0
-BA:197,0
-BA:197,0
-BA:210,0
-BA:210,0
-BA:217,0
-BA:217,0
-BA:232,0
-BA:232,0
-BA:239,0
-BA:239,0
-BA:252,0
-BA:252,0
-BA:252,0
-BA:252,0
-BA:252,0
-BA:252,0
-BA:252,0
-BA:252,0
-BA:252,0
-BA:252,0
-BA:273,0
-BA:273,0
-BA:276,0
-BA:276,0
-BA:287,0
-BA:287,0
-BA:289,0
-BA:289,0
-BA:310,2
-BA:310,1
-BA:310,2
-BA:310,1
-LF:164
-LH:11
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaISsED2Ev
-FN:98,_ZNSaISsEC2Ev
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:276,0
-BA:276,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:1534,_ZNKSs5c_strEv
-FN:701,_ZNKSsixEj
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:612,_ZNKSs6lengthEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:835,_ZNSs6appendEPKc
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2121,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:612,0
-DA:613,0
-DA:686,0
-DA:687,0
-DA:701,0
-DA:704,0
-DA:835,0
-DA:838,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2121,0
-DA:2123,0
-DA:2124,0
-DA:2125,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-LF:69
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:668,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_EPKS3_RKS6_
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-DA:668,0
-DA:673,0
-DA:674,0
-DA:675,0
-DA:676,0
-DA:677,0
-DA:678,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:23
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb0EE3__bES7_
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb0EE3__bES6_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb1EE3__bES7_
-FN:268,_ZNSt12__niter_baseISt16ostream_iteratorISscSt11char_traitsIcEELb0EE3__bES3_
-FN:286,_ZNSt12__miter_baseIPSsLb0EE3__bES0_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb1EE3__bES6_
-FN:268,_ZNSt12__niter_baseISt20back_insert_iteratorISt6vectorISsSaISsEEELb0EE3__bES4_
-FN:268,_ZNSt12__niter_baseIPSsLb0EE3__bES0_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPKSsSt16ostream_iteratorISscSt11char_traitsIcEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPKSsSt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_SD_SC_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET0_T_SD_SC_
-FN:539,_ZNSt20__copy_move_backwardILb0ELb0ESt26random_access_iterator_tagE13__copy_move_bIPSsS3_EET0_T_S5_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0EPSsS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPSsS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardIPSsS0_ET0_T_S2_S1_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET1_T0_SA_S9_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET0_T_SA_S9_
-DA:210,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:268,0
-DA:269,0
-DA:276,0
-DA:277,0
-DA:286,0
-DA:287,0
-DA:337,0
-DA:340,0
-DA:342,0
-DA:343,0
-DA:344,0
-DA:346,0
-DA:385,0
-DA:393,0
-DA:396,0
-DA:430,0
-DA:435,0
-DA:456,0
-DA:466,0
-DA:539,0
-DA:542,0
-DA:543,0
-DA:544,0
-DA:579,0
-DA:587,0
-DA:592,0
-DA:597,0
-DA:602,0
-DA:624,0
-DA:636,0
-BA:215,0
-BA:215,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:542,0
-BA:542,0
-LF:34
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-DA:87,0
-DA:88,0
-DA:97,0
-DA:101,0
-DA:103,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-BA:101,0
-BA:101,0
-LF:9
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEdeEv
-FN:398,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEC1ERS2_
-FN:456,_ZSt13back_inserterISt6vectorISsSaISsEEESt20back_insert_iteratorIT_ERS4_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEC1ERKS2_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEE4baseEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEC1ERKS1_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-FN:429,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEdeEv
-FN:434,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEppEv
-FN:412,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEaSERKSs
-DA:398,0
-DA:412,0
-DA:414,0
-DA:415,0
-DA:429,0
-DA:430,0
-DA:434,0
-DA:435,0
-DA:456,0
-DA:457,0
-DA:683,0
-DA:695,0
-DA:696,0
-DA:747,0
-DA:748,0
-DA:769,0
-DA:770,0
-LF:17
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,0
-DA:166,0
-DA:167,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyIPSsS2_EET0_T_S4_S3_
-FN:113,_ZSt18uninitialized_copyIPSsS0_ET0_T_S2_S1_
-FN:261,_ZSt22__uninitialized_copy_aIPSsS0_SsET0_T_S2_S1_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPSsS0_SaISsEET0_T_S3_S2_RT1_
-DA:73,0
-DA:75,0
-DA:78,0
-DA:79,0
-DA:81,0
-DA:83,0
-DA:85,0
-DA:86,0
-DA:113,0
-DA:122,0
-DA:261,0
-DA:262,0
-DA:268,0
-DA:272,0
-BA:78,0
-BA:78,0
-BA:79,0
-BA:79,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:404,_ZNKSt6vectorISsSaISsEE3endEv
-FN:386,_ZNKSt6vectorISsSaISsEE5beginEv
-FN:484,_ZNKSt6vectorISsSaISsEE4sizeEv
-FN:101,_ZNKSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:395,_ZNSt6vectorISsSaISsEE3endEv
-FN:377,_ZNSt6vectorISsSaISsEE5beginEv
-FN:526,_ZNKSt6vectorISsSaISsEE5emptyEv
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:84,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseISsSaISsEEC2Ev
-FN:213,_ZNSt6vectorISsSaISsEEC1Ev
-FN:489,_ZNKSt6vectorISsSaISsEE8max_sizeEv
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-FN:1075,_ZNKSt6vectorISsSaISsEE12_M_check_lenEjPKc
-FN:143,_ZNSt12_Vector_baseISsSaISsEE11_M_allocateEj
-FN:686,_ZNSt6vectorISsSaISsEE9push_backERKSs
-DA:79,0
-DA:84,0
-DA:85,0
-DA:86,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:108,0
-DA:109,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:143,0
-DA:144,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:213,0
-DA:214,0
-DA:299,0
-DA:300,0
-DA:301,0
-DA:377,0
-DA:378,0
-DA:386,0
-DA:387,0
-DA:395,0
-DA:396,0
-DA:404,0
-DA:405,0
-DA:484,0
-DA:485,0
-DA:489,0
-DA:490,0
-DA:526,0
-DA:527,0
-DA:686,0
-DA:688,0
-DA:690,0
-DA:691,0
-DA:694,0
-DA:695,0
-DA:1075,0
-DA:1077,0
-DA:1078,0
-DA:1080,0
-DA:1081,0
-BA:144,0
-BA:144,0
-BA:149,0
-BA:149,0
-BA:688,0
-BA:688,0
-BA:1077,0
-BA:1077,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-LF:49
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stream_iterator.h
-FN:181,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERSoPKc
-FN:185,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERKS2_
-FN:202,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEdeEv
-FN:206,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEppEv
-FN:191,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEaSERKSs
-DA:181,0
-DA:182,0
-DA:185,0
-DA:186,0
-DA:191,0
-DA:196,0
-DA:197,0
-DA:198,0
-DA:202,0
-DA:203,0
-DA:206,0
-DA:207,0
-BA:197,0
-BA:197,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/vector.tcc
-FN:283,_ZNSt6vectorISsSaISsEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPSsS1_EERKSs
-DA:283,0
-DA:286,0
-DA:288,0
-DA:291,0
-DA:293,0
-DA:295,0
-DA:299,0
-DA:307,0
-DA:308,0
-DA:309,0
-DA:316,0
-DA:321,0
-DA:323,0
-DA:324,0
-DA:330,0
-DA:332,0
-DA:333,0
-DA:334,0
-DA:336,0
-DA:338,0
-DA:341,0
-DA:342,0
-DA:343,0
-DA:345,0
-BA:286,0
-BA:286,0
-LF:24
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/exception
-FN:59,_ZNSt9exceptionC2Ev
-DA:59,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISsE8max_sizeEv
-FN:107,_ZN9__gnu_cxx13new_allocatorISsE9constructEPSsRKSs
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-FN:87,_ZN9__gnu_cxx13new_allocatorISsE8allocateEjPKv
-DA:69,0
-DA:71,0
-DA:76,0
-DA:87,0
-DA:89,0
-DA:90,0
-DA:92,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:107,0
-DA:108,0
-BA:89,0
-BA:89,0
-BA:108,0
-BA:108,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,3
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/istream
-FN:585,_ZNSiC2Ev
-FN:105,_ZNSiD2Ev
-FN:804,_ZNSdC2Ev
-FN:801,_ZNSdD2Ev
-DA:105,0
-DA:106,0
-DA:585,0
-DA:586,0
-DA:587,0
-DA:801,0
-DA:804,0
-DA:805,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:195,_ZNSolsEj
-DA:95,0
-DA:195,0
-DA:199,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:509,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:536,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:555,_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:509,0
-DA:510,0
-DA:511,0
-DA:536,0
-DA:537,0
-DA:555,0
-DA:556,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/exception.h
-FN:190,_ZNK6wibble9exception7Generic4typeEv
-FN:230,_ZNK6wibble9exception11Interrupted4typeEv
-FN:137,_ZN6wibble9exception7ContextD2Ev
-FN:187,_ZN6wibble9exception7GenericD2Ev
-FN:395,_ZN6wibble9exception6SystemD1Ev
-FN:225,_ZN6wibble9exception11InterruptedD0Ev
-FN:225,_ZN6wibble9exception11InterruptedD1Ev
-FN:213,_ZNK6wibble9exception7Generic4whatEv
-FN:187,_ZN6wibble9exception7GenericD0Ev
-FN:187,_ZN6wibble9exception7GenericD1Ev
-FN:193,_ZNK6wibble9exception7Generic4descEv
-FN:154,_ZNK6wibble9exception7Context13formatContextEv
-FN:205,_ZNK6wibble9exception7Generic8fullInfoEv
-FN:109,_ZN6wibble9exception10AddContext7contextEv
-FN:117,_ZN6wibble9exception10AddContext11copyContextISt20back_insert_iteratorISt6vectorISsSaISsEEEEEvT_
-FN:153,_ZN6wibble9exception7Context10addContextERKSs
-FN:147,_ZN6wibble9exception7ContextC2ERKSs
-FN:186,_ZN6wibble9exception7GenericC1ERKSs
-FN:186,_ZN6wibble9exception7GenericC2ERKSs
-FN:228,_ZN6wibble9exception11InterruptedC1ERKSs
-FN:137,_ZN6wibble9exception7ContextC2ERKS1_
-FN:180,_ZN6wibble9exception7GenericC2ERKS1_
-FN:395,_ZN6wibble9exception6SystemC1ERKS1_
-DA:109,0
-DA:110,0
-DA:111,0
-DA:112,0
-DA:113,0
-DA:117,0
-DA:118,0
-DA:119,0
-DA:137,0
-DA:147,0
-DA:148,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:153,0
-DA:154,0
-DA:155,0
-DA:156,0
-DA:157,0
-DA:159,0
-DA:161,0
-DA:162,0
-DA:163,0
-DA:180,0
-DA:186,0
-DA:187,0
-DA:190,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:205,0
-DA:206,0
-DA:207,0
-DA:209,0
-DA:210,0
-DA:213,0
-DA:225,0
-DA:228,0
-DA:230,0
-DA:395,0
-BA:110,0
-BA:110,0
-BA:156,0
-BA:156,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:207,0
-BA:207,0
-BA:225,0
-BA:225,0
-BA:225,0
-BA:225,0
-BA:395,0
-BA:395,0
-LF:40
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/string.h
-FN:59,_ZN6wibble3strL3fmtESsz
-DA:59,0
-DA:62,0
-DA:63,0
-DA:64,0
-DA:65,0
-LF:5
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/sys/childprocess.cpp
-FN:291,_Z41__static_initialization_and_destruction_0ii
-FN:291,_GLOBAL__I_childprocess.cpp
-FN:280,_ZN6wibble3sys12ChildProcess4killEi
-FN:208,_ZN6wibble3sys12ChildProcess9waitErrorEv
-FN:248,_ZN6wibble3sys12ChildProcess4waitEP6rusage
-FN:229,_ZN6wibble3sys12ChildProcess7runningEv
-FN:215,_ZN6wibble3sys12ChildProcess4waitEv
-FN:263,_ZN6wibble3sys12ChildProcess14waitForSuccessEv
-FN:82,_ZN6wibble3sys12ChildProcess15forkAndRedirectEPiS2_S2_
-FN:44,_ZN6wibble3sys12ChildProcess4forkEv
-DA:44,1
-DA:46,1
-DA:47,1
-DA:48,1
-DA:51,1
-DA:62,0
-DA:63,0
-DA:66,0
-DA:67,1
-DA:68,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:73,1
-DA:74,1
-DA:75,1
-DA:78,1
-DA:82,3
-DA:86,3
-DA:88,0
-DA:89,0
-DA:90,0
-DA:92,3
-DA:94,3
-DA:95,0
-DA:96,3
-DA:97,3
-DA:98,0
-DA:101,3
-DA:103,0
-DA:104,0
-DA:105,0
-DA:108,3
-DA:109,3
-DA:110,3
-DA:113,3
-DA:120,0
-DA:123,0
-DA:124,0
-DA:125,0
-DA:126,0
-DA:127,0
-DA:128,0
-DA:131,0
-DA:134,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:138,0
-DA:139,0
-DA:140,0
-DA:141,0
-DA:142,0
-DA:145,0
-DA:148,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:152,0
-DA:153,0
-DA:157,0
-DA:158,0
-DA:161,0
-DA:162,3
-DA:163,0
-DA:164,0
-DA:165,0
-DA:166,0
-DA:168,0
-DA:169,0
-DA:171,0
-DA:173,0
-DA:174,0
-DA:176,0
-DA:178,0
-DA:179,0
-DA:181,0
-DA:183,3
-DA:184,3
-DA:185,3
-DA:188,3
-DA:190,3
-DA:191,0
-DA:192,0
-DA:193,3
-DA:194,3
-DA:195,0
-DA:196,3
-DA:197,0
-DA:198,0
-DA:199,3
-DA:200,0
-DA:202,0
-DA:203,0
-DA:208,0
-DA:209,0
-DA:210,0
-DA:212,0
-DA:215,4
-DA:217,4
-DA:220,0
-DA:223,4
-DA:224,0
-DA:225,4
-DA:226,4
-DA:229,0
-DA:231,0
-DA:232,0
-DA:235,0
-DA:237,0
-DA:238,0
-DA:241,0
-DA:242,0
-DA:245,0
-DA:248,0
-DA:250,0
-DA:253,0
-DA:256,0
-DA:257,0
-DA:259,0
-DA:260,0
-DA:263,0
-DA:264,0
-DA:265,0
-DA:266,0
-DA:269,0
-DA:271,0
-DA:273,0
-DA:276,0
-DA:277,0
-DA:280,1
-DA:282,1
-DA:284,0
-DA:285,0
-DA:286,0
-DA:288,1
-DA:291,3
-BA:51,1
-BA:51,2
-BA:67,1
-BA:67,2
-BA:86,1
-BA:86,2
-BA:88,0
-BA:88,0
-BA:92,2
-BA:92,1
-BA:94,1
-BA:94,2
-BA:97,1
-BA:97,2
-BA:101,1
-BA:101,2
-BA:101,0
-BA:101,0
-BA:103,0
-BA:103,0
-BA:113,1
-BA:113,2
-BA:120,0
-BA:120,0
-BA:123,0
-BA:123,0
-BA:125,0
-BA:125,0
-BA:127,0
-BA:127,0
-BA:131,0
-BA:131,0
-BA:134,0
-BA:134,0
-BA:136,0
-BA:136,0
-BA:138,0
-BA:138,0
-BA:139,0
-BA:139,0
-BA:141,0
-BA:141,0
-BA:145,0
-BA:145,0
-BA:145,0
-BA:145,0
-BA:148,0
-BA:148,0
-BA:150,0
-BA:150,0
-BA:152,0
-BA:152,0
-BA:162,1
-BA:162,2
-BA:166,0
-BA:166,0
-BA:171,0
-BA:171,0
-BA:176,0
-BA:176,0
-BA:176,0
-BA:176,0
-BA:190,1
-BA:190,2
-BA:191,0
-BA:191,0
-BA:193,2
-BA:193,1
-BA:194,1
-BA:194,2
-BA:196,1
-BA:196,2
-BA:196,0
-BA:196,0
-BA:197,0
-BA:197,0
-BA:209,0
-BA:209,0
-BA:217,1
-BA:217,2
-BA:223,1
-BA:223,2
-BA:231,0
-BA:231,0
-BA:237,0
-BA:237,0
-BA:241,0
-BA:241,0
-BA:250,0
-BA:250,0
-BA:256,0
-BA:256,0
-BA:265,0
-BA:265,0
-BA:266,0
-BA:266,0
-BA:273,0
-BA:273,0
-BA:282,1
-BA:282,2
-BA:291,2
-BA:291,1
-BA:291,2
-BA:291,1
-LF:137
-LH:40
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaISsED2Ev
-FN:98,_ZNSaISsEC2Ev
-FN:100,_ZNSaISsEC2ERKS_
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:276,0
-BA:276,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:1534,_ZNKSs5c_strEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:612,_ZNKSs6lengthEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:835,_ZNSs6appendEPKc
-FN:2121,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:612,0
-DA:613,0
-DA:686,0
-DA:687,0
-DA:835,0
-DA:838,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2121,0
-DA:2123,0
-DA:2124,0
-DA:2125,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-LF:67
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb0EE3__bES7_
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb0EE3__bES6_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb1EE3__bES7_
-FN:268,_ZNSt12__niter_baseISt16ostream_iteratorISscSt11char_traitsIcEELb0EE3__bES3_
-FN:286,_ZNSt12__miter_baseIPSsLb0EE3__bES0_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb1EE3__bES6_
-FN:268,_ZNSt12__niter_baseISt20back_insert_iteratorISt6vectorISsSaISsEEELb0EE3__bES4_
-FN:268,_ZNSt12__niter_baseIPSsLb0EE3__bES0_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPKSsSt16ostream_iteratorISscSt11char_traitsIcEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPKSsSt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_SD_SC_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET0_T_SD_SC_
-FN:539,_ZNSt20__copy_move_backwardILb0ELb0ESt26random_access_iterator_tagE13__copy_move_bIPSsS3_EET0_T_S5_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0EPSsS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPSsS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardIPSsS0_ET0_T_S2_S1_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET1_T0_SA_S9_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET0_T_SA_S9_
-DA:210,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:268,0
-DA:269,0
-DA:276,0
-DA:277,0
-DA:286,0
-DA:287,0
-DA:337,0
-DA:340,0
-DA:342,0
-DA:343,0
-DA:344,0
-DA:346,0
-DA:385,0
-DA:393,0
-DA:396,0
-DA:430,0
-DA:435,0
-DA:456,0
-DA:466,0
-DA:539,0
-DA:542,0
-DA:543,0
-DA:544,0
-DA:579,0
-DA:587,0
-DA:592,0
-DA:597,0
-DA:602,0
-DA:624,0
-DA:636,0
-BA:215,0
-BA:215,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:542,0
-BA:542,0
-LF:34
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-DA:87,0
-DA:88,0
-DA:97,0
-DA:101,0
-DA:103,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-BA:101,0
-BA:101,0
-LF:9
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEdeEv
-FN:398,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEC1ERS2_
-FN:456,_ZSt13back_inserterISt6vectorISsSaISsEEESt20back_insert_iteratorIT_ERS4_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEC1ERKS2_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEE4baseEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEC1ERKS1_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-FN:781,_ZN9__gnu_cxxneIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-FN:703,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEppEv
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEdeEv
-FN:429,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEdeEv
-FN:434,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEppEv
-FN:412,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEaSERKSs
-DA:398,0
-DA:412,0
-DA:414,0
-DA:415,0
-DA:429,0
-DA:430,0
-DA:434,0
-DA:435,0
-DA:456,0
-DA:457,0
-DA:683,0
-DA:695,0
-DA:696,0
-DA:703,0
-DA:705,0
-DA:706,0
-DA:747,0
-DA:748,0
-DA:769,0
-DA:770,0
-DA:781,0
-DA:782,0
-LF:22
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,0
-DA:166,0
-DA:167,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyIPSsS2_EET0_T_S4_S3_
-FN:113,_ZSt18uninitialized_copyIPSsS0_ET0_T_S2_S1_
-FN:261,_ZSt22__uninitialized_copy_aIPSsS0_SsET0_T_S2_S1_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPSsS0_SaISsEET0_T_S3_S2_RT1_
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEEPSsEET0_T_SC_SB_
-FN:113,_ZSt18uninitialized_copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEEPSsET0_T_SA_S9_
-FN:261,_ZSt22__uninitialized_copy_aIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEEPSsSsET0_T_SA_S9_RSaIT1_E
-DA:73,0
-DA:75,0
-DA:78,0
-DA:79,0
-DA:81,0
-DA:83,0
-DA:85,0
-DA:86,0
-DA:113,0
-DA:122,0
-DA:261,0
-DA:262,0
-DA:268,0
-DA:272,0
-BA:78,0
-BA:78,0
-BA:78,0
-BA:78,0
-BA:79,0
-BA:79,0
-BA:79,0
-BA:79,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:404,_ZNKSt6vectorISsSaISsEE3endEv
-FN:386,_ZNKSt6vectorISsSaISsEE5beginEv
-FN:484,_ZNKSt6vectorISsSaISsEE4sizeEv
-FN:101,_ZNKSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:395,_ZNSt6vectorISsSaISsEE3endEv
-FN:377,_ZNSt6vectorISsSaISsEE5beginEv
-FN:526,_ZNKSt6vectorISsSaISsEE5emptyEv
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:84,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseISsSaISsEEC2Ev
-FN:213,_ZNSt6vectorISsSaISsEEC1Ev
-FN:489,_ZNKSt6vectorISsSaISsEE8max_sizeEv
-FN:88,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implC1ERKS0_
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-FN:1075,_ZNKSt6vectorISsSaISsEE12_M_check_lenEjPKc
-FN:143,_ZNSt12_Vector_baseISsSaISsEE11_M_allocateEj
-FN:686,_ZNSt6vectorISsSaISsEE9push_backERKSs
-FN:114,_ZNSt12_Vector_baseISsSaISsEEC2EjRKS0_
-FN:247,_ZNSt6vectorISsSaISsEEC1ERKS1_
-DA:79,0
-DA:84,0
-DA:85,0
-DA:86,0
-DA:88,0
-DA:89,0
-DA:90,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:108,0
-DA:109,0
-DA:114,0
-DA:115,0
-DA:117,0
-DA:118,0
-DA:119,0
-DA:120,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:143,0
-DA:144,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:213,0
-DA:214,0
-DA:247,0
-DA:248,0
-DA:249,0
-DA:253,0
-DA:299,0
-DA:300,0
-DA:301,0
-DA:377,0
-DA:378,0
-DA:386,0
-DA:387,0
-DA:395,0
-DA:396,0
-DA:404,0
-DA:405,0
-DA:484,0
-DA:485,0
-DA:489,0
-DA:490,0
-DA:526,0
-DA:527,0
-DA:686,0
-DA:688,0
-DA:690,0
-DA:691,0
-DA:694,0
-DA:695,0
-DA:1075,0
-DA:1077,0
-DA:1078,0
-DA:1080,0
-DA:1081,0
-BA:144,0
-BA:144,0
-BA:149,0
-BA:149,0
-BA:688,0
-BA:688,0
-BA:1077,0
-BA:1077,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-LF:62
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stream_iterator.h
-FN:181,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERSoPKc
-FN:185,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERKS2_
-FN:202,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEdeEv
-FN:206,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEppEv
-FN:191,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEaSERKSs
-DA:181,0
-DA:182,0
-DA:185,0
-DA:186,0
-DA:191,0
-DA:196,0
-DA:197,0
-DA:198,0
-DA:202,0
-DA:203,0
-DA:206,0
-DA:207,0
-BA:197,0
-BA:197,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/vector.tcc
-FN:283,_ZNSt6vectorISsSaISsEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPSsS1_EERKSs
-DA:283,0
-DA:286,0
-DA:288,0
-DA:291,0
-DA:293,0
-DA:295,0
-DA:299,0
-DA:307,0
-DA:308,0
-DA:309,0
-DA:316,0
-DA:321,0
-DA:323,0
-DA:324,0
-DA:330,0
-DA:332,0
-DA:333,0
-DA:334,0
-DA:336,0
-DA:338,0
-DA:341,0
-DA:342,0
-DA:343,0
-DA:345,0
-BA:286,0
-BA:286,0
-LF:24
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/exception
-FN:59,_ZNSt9exceptionC2Ev
-FN:57,_ZNSt9exceptionC2ERKS_
-DA:57,0
-DA:59,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISsE8max_sizeEv
-FN:71,_ZN9__gnu_cxx13new_allocatorISsEC2ERKS1_
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-FN:107,_ZN9__gnu_cxx13new_allocatorISsE9constructEPSsRKSs
-FN:87,_ZN9__gnu_cxx13new_allocatorISsE8allocateEjPKv
-DA:69,0
-DA:71,0
-DA:76,0
-DA:87,0
-DA:89,0
-DA:90,0
-DA:92,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:107,0
-DA:108,0
-BA:89,0
-BA:89,0
-BA:108,0
-BA:108,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/istream
-FN:585,_ZNSiC2Ev
-FN:105,_ZNSiD2Ev
-FN:804,_ZNSdC2Ev
-FN:801,_ZNSdD2Ev
-DA:105,0
-DA:106,0
-DA:585,0
-DA:586,0
-DA:587,0
-DA:801,0
-DA:804,0
-DA:805,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-DA:95,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:509,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:536,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:555,_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:509,0
-DA:510,0
-DA:511,0
-DA:536,0
-DA:537,0
-DA:555,0
-DA:556,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/exception.h
-FN:190,_ZNK6wibble9exception7Generic4typeEv
-FN:137,_ZN6wibble9exception7ContextD2Ev
-FN:187,_ZN6wibble9exception7GenericD2Ev
-FN:395,_ZN6wibble9exception6SystemD1Ev
-FN:213,_ZNK6wibble9exception7Generic4whatEv
-FN:187,_ZN6wibble9exception7GenericD0Ev
-FN:187,_ZN6wibble9exception7GenericD1Ev
-FN:193,_ZNK6wibble9exception7Generic4descEv
-FN:154,_ZNK6wibble9exception7Context13formatContextEv
-FN:205,_ZNK6wibble9exception7Generic8fullInfoEv
-DA:137,0
-DA:154,0
-DA:155,0
-DA:156,0
-DA:157,0
-DA:159,0
-DA:161,0
-DA:162,0
-DA:163,0
-DA:187,0
-DA:190,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:205,0
-DA:206,0
-DA:207,0
-DA:209,0
-DA:210,0
-DA:213,0
-DA:395,0
-BA:156,0
-BA:156,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:207,0
-BA:207,0
-BA:395,0
-BA:395,0
-LF:21
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/sys/thread.cpp
-FN:29,_ZN6wibble3sys6Thread7StarterEPv
-FN:92,_Z41__static_initialization_and_destruction_0ii
-FN:92,_GLOBAL__I_thread.cpp
-FN:80,_ZN6wibble3sys6Thread4killEi
-FN:73,_ZN6wibble3sys6Thread6cancelEv
-FN:66,_ZN6wibble3sys6Thread6detachEv
-FN:57,_ZN6wibble3sys6Thread4joinEv
-FN:39,_ZN6wibble3sys6Thread5startEv
-FN:46,_ZN6wibble3sys6Thread13startDetachedEv
-FN:34,_ZN6wibble3sys6Thread10testcancelEv
-DA:29,2
-DA:31,2
-DA:34,0
-DA:36,0
-DA:37,0
-DA:39,2
-DA:41,2
-DA:42,2
-DA:43,0
-DA:44,2
-DA:46,0
-DA:49,0
-DA:50,0
-DA:51,0
-DA:52,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:57,2
-DA:59,2
-DA:60,2
-DA:61,2
-DA:62,0
-DA:63,2
-DA:66,0
-DA:68,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:73,0
-DA:75,0
-DA:76,0
-DA:77,0
-DA:78,0
-DA:80,0
-DA:82,0
-DA:83,0
-DA:85,0
-DA:86,0
-DA:87,0
-DA:89,0
-DA:92,3
-BA:42,1
-BA:42,2
-BA:53,0
-BA:53,0
-BA:61,1
-BA:61,2
-BA:69,0
-BA:69,0
-BA:76,0
-BA:76,0
-BA:83,0
-BA:83,0
-BA:92,2
-BA:92,1
-BA:92,2
-BA:92,1
-LF:42
-LH:12
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaISsED2Ev
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:276,0
-BA:276,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:1534,_ZNKSs5c_strEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:612,_ZNKSs6lengthEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:835,_ZNSs6appendEPKc
-FN:2121,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:612,0
-DA:613,0
-DA:686,0
-DA:687,0
-DA:835,0
-DA:838,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2121,0
-DA:2123,0
-DA:2124,0
-DA:2125,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-LF:67
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb0EE3__bES7_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb1EE3__bES7_
-FN:268,_ZNSt12__niter_baseISt16ostream_iteratorISscSt11char_traitsIcEELb0EE3__bES3_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPKSsSt16ostream_iteratorISscSt11char_traitsIcEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPKSsSt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_SD_SC_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET0_T_SD_SC_
-DA:268,0
-DA:269,0
-DA:276,0
-DA:277,0
-DA:286,0
-DA:287,0
-DA:337,0
-DA:340,0
-DA:342,0
-DA:343,0
-DA:344,0
-DA:346,0
-DA:385,0
-DA:393,0
-DA:396,0
-DA:430,0
-DA:435,0
-DA:456,0
-DA:466,0
-BA:340,0
-BA:340,0
-LF:19
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-DA:87,0
-DA:88,0
-DA:97,0
-DA:101,0
-DA:103,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-BA:101,0
-BA:101,0
-LF:9
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEC1ERKS2_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-DA:683,0
-DA:747,0
-DA:748,0
-DA:769,0
-DA:770,0
-LF:5
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,0
-DA:166,0
-DA:167,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:404,_ZNKSt6vectorISsSaISsEE3endEv
-FN:386,_ZNKSt6vectorISsSaISsEE5beginEv
-FN:526,_ZNKSt6vectorISsSaISsEE5emptyEv
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-DA:79,0
-DA:97,0
-DA:98,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:299,0
-DA:300,0
-DA:301,0
-DA:386,0
-DA:387,0
-DA:404,0
-DA:405,0
-DA:526,0
-DA:527,0
-BA:149,0
-BA:149,0
-LF:19
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stream_iterator.h
-FN:181,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERSoPKc
-FN:185,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERKS2_
-FN:202,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEdeEv
-FN:206,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEppEv
-FN:191,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEaSERKSs
-DA:181,0
-DA:182,0
-DA:185,0
-DA:186,0
-DA:191,0
-DA:196,0
-DA:197,0
-DA:198,0
-DA:202,0
-DA:203,0
-DA:206,0
-DA:207,0
-BA:197,0
-BA:197,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-DA:69,0
-DA:71,0
-DA:76,0
-DA:97,0
-DA:98,0
-LF:5
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/istream
-FN:585,_ZNSiC2Ev
-FN:105,_ZNSiD2Ev
-FN:804,_ZNSdC2Ev
-FN:801,_ZNSdD2Ev
-DA:105,0
-DA:106,0
-DA:585,0
-DA:586,0
-DA:587,0
-DA:801,0
-DA:804,0
-DA:805,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-DA:95,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:509,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:536,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:555,_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:509,0
-DA:510,0
-DA:511,0
-DA:536,0
-DA:537,0
-DA:555,0
-DA:556,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/exception.h
-FN:190,_ZNK6wibble9exception7Generic4typeEv
-FN:263,_ZNK6wibble9exception11Consistency4typeEv
-FN:265,_ZNK6wibble9exception11Consistency4descEv
-FN:213,_ZNK6wibble9exception7Generic4whatEv
-FN:193,_ZNK6wibble9exception7Generic4descEv
-FN:109,_ZN6wibble9exception10AddContext7contextEv
-FN:154,_ZNK6wibble9exception7Context13formatContextEv
-FN:205,_ZNK6wibble9exception7Generic8fullInfoEv
-FN:137,_ZN6wibble9exception7ContextD2Ev
-FN:117,_ZN6wibble9exception10AddContext11copyContextISt20back_insert_iteratorISt6vectorISsSaISsEEEEEvT_
-FN:153,_ZN6wibble9exception7Context10addContextERKSs
-FN:147,_ZN6wibble9exception7ContextC2ERKSs
-FN:186,_ZN6wibble9exception7GenericC2ERKSs
-FN:187,_ZN6wibble9exception7GenericD0Ev
-FN:187,_ZN6wibble9exception7GenericD1Ev
-FN:187,_ZN6wibble9exception7GenericD2Ev
-FN:259,_ZN6wibble9exception11ConsistencyC1ERKSsS3_
-FN:395,_ZN6wibble9exception6SystemD1Ev
-FN:261,_ZN6wibble9exception11ConsistencyD0Ev
-FN:261,_ZN6wibble9exception11ConsistencyD1Ev
-DA:109,0
-DA:110,0
-DA:111,0
-DA:112,0
-DA:113,0
-DA:117,0
-DA:118,0
-DA:119,0
-DA:137,0
-DA:147,0
-DA:148,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:153,0
-DA:154,0
-DA:155,0
-DA:156,0
-DA:157,0
-DA:159,0
-DA:161,0
-DA:162,0
-DA:163,0
-DA:186,0
-DA:187,0
-DA:190,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:205,0
-DA:206,0
-DA:207,0
-DA:209,0
-DA:210,0
-DA:213,0
-DA:259,0
-DA:260,0
-DA:261,0
-DA:263,0
-DA:265,0
-DA:266,0
-DA:267,0
-DA:268,0
-DA:269,0
-DA:395,0
-BA:110,0
-BA:110,0
-BA:156,0
-BA:156,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:207,0
-BA:207,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:267,0
-BA:267,0
-BA:395,0
-BA:395,0
-LF:45
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/sys/mmap.cpp
-FN:65,_ZN6wibble3sys4MMapaSERKS1_
-FN:39,_ZN6wibble3sys4MMapC1Ev
-FN:39,_ZN6wibble3sys4MMapC2Ev
-FN:137,_Z41__static_initialization_and_destruction_0ii
-FN:137,_GLOBAL__I_mmap.cpp
-FN:118,_ZN6wibble3sys4MMap5unmapEv
-FN:91,_ZN6wibble3sys4MMap3mapERKSs
-FN:86,_ZN6wibble3sys4MMapD1Ev
-FN:86,_ZN6wibble3sys4MMapD2Ev
-FN:54,_ZN6wibble3sys4MMapC1ERKS1_
-FN:54,_ZN6wibble3sys4MMapC2ERKS1_
-FN:41,_ZN6wibble3sys4MMapC1ERKSs
-FN:41,_ZN6wibble3sys4MMapC2ERKSs
-DA:39,1
-DA:41,0
-DA:42,0
-DA:47,0
-DA:48,0
-DA:49,0
-DA:50,0
-DA:52,0
-DA:54,1
-DA:55,1
-DA:58,1
-DA:59,1
-DA:60,1
-DA:61,1
-DA:62,1
-DA:63,1
-DA:65,0
-DA:69,0
-DA:86,2
-DA:88,2
-DA:89,2
-DA:91,1
-DA:93,1
-DA:96,1
-DA:99,1
-DA:100,0
-DA:102,1
-DA:103,1
-DA:104,0
-DA:105,1
-DA:107,0
-DA:110,1
-DA:111,0
-DA:112,0
-DA:113,0
-DA:114,0
-DA:116,1
-DA:118,3
-DA:121,3
-DA:123,1
-DA:124,1
-DA:125,1
-DA:126,1
-DA:128,3
-DA:130,1
-DA:131,1
-DA:133,3
-DA:134,3
-DA:137,3
-BA:93,1
-BA:93,2
-BA:99,1
-BA:99,2
-BA:103,1
-BA:103,2
-BA:105,1
-BA:105,2
-BA:110,1
-BA:110,2
-BA:121,2
-BA:121,2
-BA:123,2
-BA:123,1
-BA:128,2
-BA:128,2
-BA:137,2
-BA:137,1
-BA:137,2
-BA:137,1
-LF:49
-LH:33
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaISsED2Ev
-FN:98,_ZNSaISsEC2Ev
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:276,0
-BA:276,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:1534,_ZNKSs5c_strEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:612,_ZNKSs6lengthEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:679,_ZNSs5clearEv
-FN:501,_ZNSsaSERKSs
-FN:835,_ZNSs6appendEPKc
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2121,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:612,0
-DA:613,0
-DA:679,0
-DA:680,0
-DA:686,0
-DA:687,0
-DA:835,0
-DA:838,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2121,0
-DA:2123,0
-DA:2124,0
-DA:2125,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-LF:69
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-FN:668,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_EPKS3_RKS6_
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-DA:668,0
-DA:673,0
-DA:674,0
-DA:675,0
-DA:676,0
-DA:677,0
-DA:678,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:23
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb0EE3__bES7_
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb0EE3__bES6_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb1EE3__bES7_
-FN:268,_ZNSt12__niter_baseISt16ostream_iteratorISscSt11char_traitsIcEELb0EE3__bES3_
-FN:286,_ZNSt12__miter_baseIPSsLb0EE3__bES0_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb1EE3__bES6_
-FN:268,_ZNSt12__niter_baseISt20back_insert_iteratorISt6vectorISsSaISsEEELb0EE3__bES4_
-FN:268,_ZNSt12__niter_baseIPSsLb0EE3__bES0_
-FN:539,_ZNSt20__copy_move_backwardILb0ELb0ESt26random_access_iterator_tagE13__copy_move_bIPSsS3_EET0_T_S5_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0EPSsS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPSsS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardIPSsS0_ET0_T_S2_S1_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPKSsSt16ostream_iteratorISscSt11char_traitsIcEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPKSsSt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_SD_SC_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET0_T_SD_SC_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET1_T0_SA_S9_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET0_T_SA_S9_
-DA:210,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:268,0
-DA:269,0
-DA:276,0
-DA:277,0
-DA:286,0
-DA:287,0
-DA:337,0
-DA:340,0
-DA:342,0
-DA:343,0
-DA:344,0
-DA:346,0
-DA:385,0
-DA:393,0
-DA:396,0
-DA:430,0
-DA:435,0
-DA:456,0
-DA:466,0
-DA:539,0
-DA:542,0
-DA:543,0
-DA:544,0
-DA:579,0
-DA:587,0
-DA:592,0
-DA:597,0
-DA:602,0
-DA:624,0
-DA:636,0
-BA:215,0
-BA:215,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:542,0
-BA:542,0
-LF:34
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-DA:87,0
-DA:88,0
-DA:97,0
-DA:101,0
-DA:103,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-BA:101,0
-BA:101,0
-LF:9
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEdeEv
-FN:398,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEC1ERS2_
-FN:456,_ZSt13back_inserterISt6vectorISsSaISsEEESt20back_insert_iteratorIT_ERS4_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEC1ERKS2_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEE4baseEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEC1ERKS1_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-FN:429,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEdeEv
-FN:434,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEppEv
-FN:412,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEaSERKSs
-DA:398,0
-DA:412,0
-DA:414,0
-DA:415,0
-DA:429,0
-DA:430,0
-DA:434,0
-DA:435,0
-DA:456,0
-DA:457,0
-DA:683,0
-DA:695,0
-DA:696,0
-DA:747,0
-DA:748,0
-DA:769,0
-DA:770,0
-LF:17
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,0
-DA:166,0
-DA:167,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyIPSsS2_EET0_T_S4_S3_
-FN:113,_ZSt18uninitialized_copyIPSsS0_ET0_T_S2_S1_
-FN:261,_ZSt22__uninitialized_copy_aIPSsS0_SsET0_T_S2_S1_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPSsS0_SaISsEET0_T_S3_S2_RT1_
-DA:73,0
-DA:75,0
-DA:78,0
-DA:79,0
-DA:81,0
-DA:83,0
-DA:85,0
-DA:86,0
-DA:113,0
-DA:122,0
-DA:261,0
-DA:262,0
-DA:268,0
-DA:272,0
-BA:78,0
-BA:78,0
-BA:79,0
-BA:79,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:404,_ZNKSt6vectorISsSaISsEE3endEv
-FN:386,_ZNKSt6vectorISsSaISsEE5beginEv
-FN:484,_ZNKSt6vectorISsSaISsEE4sizeEv
-FN:101,_ZNKSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:395,_ZNSt6vectorISsSaISsEE3endEv
-FN:377,_ZNSt6vectorISsSaISsEE5beginEv
-FN:526,_ZNKSt6vectorISsSaISsEE5emptyEv
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:84,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseISsSaISsEEC2Ev
-FN:213,_ZNSt6vectorISsSaISsEEC1Ev
-FN:489,_ZNKSt6vectorISsSaISsEE8max_sizeEv
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:1075,_ZNKSt6vectorISsSaISsEE12_M_check_lenEjPKc
-FN:143,_ZNSt12_Vector_baseISsSaISsEE11_M_allocateEj
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-FN:686,_ZNSt6vectorISsSaISsEE9push_backERKSs
-DA:79,0
-DA:84,0
-DA:85,0
-DA:86,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:108,0
-DA:109,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:143,0
-DA:144,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:213,0
-DA:214,0
-DA:299,0
-DA:300,0
-DA:301,0
-DA:377,0
-DA:378,0
-DA:386,0
-DA:387,0
-DA:395,0
-DA:396,0
-DA:404,0
-DA:405,0
-DA:484,0
-DA:485,0
-DA:489,0
-DA:490,0
-DA:526,0
-DA:527,0
-DA:686,0
-DA:688,0
-DA:690,0
-DA:691,0
-DA:694,0
-DA:695,0
-DA:1075,0
-DA:1077,0
-DA:1078,0
-DA:1080,0
-DA:1081,0
-BA:144,0
-BA:144,0
-BA:149,0
-BA:149,0
-BA:688,0
-BA:688,0
-BA:1077,0
-BA:1077,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-LF:49
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stream_iterator.h
-FN:181,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERSoPKc
-FN:185,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERKS2_
-FN:202,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEdeEv
-FN:206,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEppEv
-FN:191,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEaSERKSs
-DA:181,0
-DA:182,0
-DA:185,0
-DA:186,0
-DA:191,0
-DA:196,0
-DA:197,0
-DA:198,0
-DA:202,0
-DA:203,0
-DA:206,0
-DA:207,0
-BA:197,0
-BA:197,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/vector.tcc
-FN:283,_ZNSt6vectorISsSaISsEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPSsS1_EERKSs
-DA:283,0
-DA:286,0
-DA:288,0
-DA:291,0
-DA:293,0
-DA:295,0
-DA:299,0
-DA:307,0
-DA:308,0
-DA:309,0
-DA:316,0
-DA:321,0
-DA:323,0
-DA:324,0
-DA:330,0
-DA:332,0
-DA:333,0
-DA:334,0
-DA:336,0
-DA:338,0
-DA:341,0
-DA:342,0
-DA:343,0
-DA:345,0
-BA:286,0
-BA:286,0
-LF:24
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/exception
-FN:59,_ZNSt9exceptionC2Ev
-DA:59,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISsE8max_sizeEv
-FN:107,_ZN9__gnu_cxx13new_allocatorISsE9constructEPSsRKSs
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-FN:87,_ZN9__gnu_cxx13new_allocatorISsE8allocateEjPKv
-DA:69,0
-DA:71,0
-DA:76,0
-DA:87,0
-DA:89,0
-DA:90,0
-DA:92,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:107,0
-DA:108,0
-BA:89,0
-BA:89,0
-BA:108,0
-BA:108,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/istream
-FN:585,_ZNSiC2Ev
-FN:105,_ZNSiD2Ev
-FN:804,_ZNSdC2Ev
-FN:801,_ZNSdD2Ev
-DA:105,0
-DA:106,0
-DA:585,0
-DA:586,0
-DA:587,0
-DA:801,0
-DA:804,0
-DA:805,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-DA:95,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:509,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:536,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:555,_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:509,0
-DA:510,0
-DA:511,0
-DA:536,0
-DA:537,0
-DA:555,0
-DA:556,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/exception.h
-FN:190,_ZNK6wibble9exception7Generic4typeEv
-FN:263,_ZNK6wibble9exception11Consistency4typeEv
-FN:213,_ZNK6wibble9exception7Generic4whatEv
-FN:137,_ZN6wibble9exception7ContextD2Ev
-FN:187,_ZN6wibble9exception7GenericD2Ev
-FN:395,_ZN6wibble9exception6SystemD1Ev
-FN:261,_ZN6wibble9exception11ConsistencyD0Ev
-FN:261,_ZN6wibble9exception11ConsistencyD1Ev
-FN:187,_ZN6wibble9exception7GenericD0Ev
-FN:187,_ZN6wibble9exception7GenericD1Ev
-FN:193,_ZNK6wibble9exception7Generic4descEv
-FN:265,_ZNK6wibble9exception11Consistency4descEv
-FN:154,_ZNK6wibble9exception7Context13formatContextEv
-FN:205,_ZNK6wibble9exception7Generic8fullInfoEv
-FN:109,_ZN6wibble9exception10AddContext7contextEv
-FN:117,_ZN6wibble9exception10AddContext11copyContextISt20back_insert_iteratorISt6vectorISsSaISsEEEEEvT_
-FN:153,_ZN6wibble9exception7Context10addContextERKSs
-FN:147,_ZN6wibble9exception7ContextC2ERKSs
-FN:186,_ZN6wibble9exception7GenericC2ERKSs
-FN:259,_ZN6wibble9exception11ConsistencyC1ERKSsS3_
-DA:109,0
-DA:110,0
-DA:111,0
-DA:112,0
-DA:113,0
-DA:117,0
-DA:118,0
-DA:119,0
-DA:137,0
-DA:147,0
-DA:148,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:153,0
-DA:154,0
-DA:155,0
-DA:156,0
-DA:157,0
-DA:159,0
-DA:161,0
-DA:162,0
-DA:163,0
-DA:186,0
-DA:187,0
-DA:190,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:205,0
-DA:206,0
-DA:207,0
-DA:209,0
-DA:210,0
-DA:213,0
-DA:259,0
-DA:260,0
-DA:261,0
-DA:263,0
-DA:265,0
-DA:266,0
-DA:267,0
-DA:268,0
-DA:269,0
-DA:395,0
-BA:110,0
-BA:110,0
-BA:156,0
-BA:156,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:207,0
-BA:207,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:267,0
-BA:267,0
-BA:395,0
-BA:395,0
-LF:45
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/string.h
-FN:236,_ZN6wibble3str8joinpathERKSsS2_
-DA:236,0
-DA:238,0
-DA:239,0
-DA:240,0
-DA:241,0
-DA:243,0
-DA:244,0
-DA:245,0
-DA:247,0
-DA:249,0
-DA:250,0
-DA:252,0
-BA:238,0
-BA:238,0
-BA:240,0
-BA:240,0
-BA:243,0
-BA:243,0
-BA:244,0
-BA:244,0
-BA:249,0
-BA:249,0
-LF:12
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/sys/fs.h
-FN:61,_ZN6wibble3sys2fs9Directory14const_iteratorC1Ev
-FN:114,_ZNK6wibble3sys2fs9Directory4pathEv
-FN:88,_ZN6wibble3sys2fs9Directory14const_iteratorppEv
-FN:63,_ZN6wibble3sys2fs9Directory14const_iteratorC1EP11__dirstream
-DA:61,1031
-DA:63,108
-DA:88,0
-DA:90,0
-DA:92,0
-DA:93,0
-DA:95,0
-DA:114,2
-BA:90,0
-BA:90,0
-LF:8
-LH:3
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/sys/fs.cpp
-FN:101,_ZNK6wibble3sys2fs9Directory3endEv
-FN:120,_Z41__static_initialization_and_destruction_0ii
-FN:120,_GLOBAL__I_fs.cpp
-FN:93,_ZN6wibble3sys2fs9Directory5beginEv
-FN:85,_ZN6wibble3sys2fs9writeFileERKSsS3_
-FN:68,_ZN6wibble3sys2fs8readFileERKSs
-FN:30,_ZN6wibble3sys2fs7abspathERKSs
-FN:25,_ZN6wibble3sys2fs6accessERKSsi
-FN:13,_ZN6wibble3sys2fs4statERKSs
-FN:106,_ZN6wibble3sys2fs9Directory5validEv
-FN:38,_ZN6wibble3sys2fs14mkdirIfMissingERKSsj
-FN:52,_ZN6wibble3sys2fs6mkpathERKSs
-FN:61,_ZN6wibble3sys2fs10mkFilePathERKSs
-DA:13,628
-DA:15,628
-DA:16,628
-DA:17,38
-DA:18,38
-DA:20,0
-DA:22,590
-DA:25,5
-DA:27,5
-DA:30,0
-DA:32,0
-DA:33,0
-DA:35,0
-DA:38,58
-DA:40,58
-DA:41,58
-DA:44,5
-DA:45,0
-DA:46,53
-DA:48,0
-DA:49,58
-DA:50,58
-DA:52,52
-DA:54,52
-DA:55,52
-DA:57,40
-DA:58,52
-DA:59,52
-DA:61,8
-DA:63,8
-DA:64,8
-DA:65,8
-DA:66,8
-DA:68,0
-DA:70,0
-DA:71,0
-DA:72,0
-DA:73,0
-DA:76,0
-DA:77,0
-DA:78,0
-DA:79,0
-DA:81,0
-DA:82,0
-DA:85,0
-DA:87,0
-DA:88,0
-DA:89,0
-DA:90,0
-DA:91,0
-DA:93,108
-DA:95,108
-DA:96,108
-DA:97,0
-DA:98,108
-DA:101,1031
-DA:103,1031
-DA:106,111
-DA:109,111
-DA:110,111
-DA:111,3
-DA:113,108
-DA:114,1
-DA:115,107
-DA:120,9
-BA:16,2
-BA:16,2
-BA:17,2
-BA:17,1
-BA:32,0
-BA:32,0
-BA:41,2
-BA:41,2
-BA:44,1
-BA:44,2
-BA:46,1
-BA:46,2
-BA:55,2
-BA:55,2
-BA:55,2
-BA:55,2
-BA:64,2
-BA:64,1
-BA:71,0
-BA:71,0
-BA:88,0
-BA:88,0
-BA:96,1
-BA:96,2
-BA:110,2
-BA:110,2
-BA:113,2
-BA:113,2
-BA:120,2
-BA:120,1
-BA:120,2
-BA:120,1
-LF:65
-LH:40
-end_of_record
-SF:/usr/include/c++/4.3/backward/auto_ptr.h
-FN:106,_ZNSt8auto_ptrI4statEC1EPS0_
-FN:214,_ZNKSt8auto_ptrI4statE3getEv
-FN:263,_ZNSt8auto_ptrI4statEC1ESt12auto_ptr_refIS0_E
-FN:197,_ZNKSt8auto_ptrI4statEptEv
-FN:228,_ZNSt8auto_ptrI4statE7releaseEv
-FN:115,_ZNSt8auto_ptrI4statEC1ERS1_
-FN:56,_ZNSt12auto_ptr_refI4statEC1EPS0_
-FN:278,_ZNSt8auto_ptrI4statEcvSt12auto_ptr_refIT_EIS0_EEv
-FN:173,_ZNSt8auto_ptrI4statED1Ev
-DA:56,15
-DA:106,666
-DA:115,590
-DA:173,35
-DA:197,5
-DA:200,5
-DA:214,20
-DA:228,20
-DA:230,20
-DA:231,20
-DA:232,20
-DA:263,15
-DA:264,15
-DA:278,15
-DA:279,15
-LF:15
-LH:15
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaISsED2Ev
-FN:98,_ZNSaISsEC2Ev
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:276,0
-BA:276,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:277,_ZNKSs7_M_dataEv
-FN:1534,_ZNKSs5c_strEv
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:612,_ZNKSs6lengthEv
-FN:701,_ZNKSsixEj
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:835,_ZNSs6appendEPKc
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:2121,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-FN:501,_ZNSsaSERKSs
-FN:306,_ZNKSs8_M_checkEjPKc
-FN:1923,_ZNKSs6substrEjj
-FN:2136,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S3_
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:306,0
-DA:308,0
-DA:309,0
-DA:310,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:612,0
-DA:613,0
-DA:686,0
-DA:687,0
-DA:701,0
-DA:704,0
-DA:835,0
-DA:838,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:1923,0
-DA:1925,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2121,0
-DA:2123,0
-DA:2124,0
-DA:2125,0
-DA:2136,0
-DA:2140,0
-DA:2141,0
-DA:2142,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:308,0
-BA:308,0
-BA:341,0
-BA:341,0
-LF:79
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:668,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_EPKS3_RKS6_
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-DA:668,0
-DA:673,0
-DA:674,0
-DA:675,0
-DA:676,0
-DA:677,0
-DA:678,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:23
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/postypes.h
-FN:116,_ZNKSt4fposI11__mbstate_tEcvxEv
-DA:116,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb0EE3__bES7_
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb0EE3__bES6_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb1EE3__bES7_
-FN:268,_ZNSt12__niter_baseISt16ostream_iteratorISscSt11char_traitsIcEELb0EE3__bES3_
-FN:286,_ZNSt12__miter_baseIPSsLb0EE3__bES0_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb1EE3__bES6_
-FN:268,_ZNSt12__niter_baseISt20back_insert_iteratorISt6vectorISsSaISsEEELb0EE3__bES4_
-FN:268,_ZNSt12__niter_baseIPSsLb0EE3__bES0_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPKSsSt16ostream_iteratorISscSt11char_traitsIcEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPKSsSt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_SD_SC_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET0_T_SD_SC_
-FN:539,_ZNSt20__copy_move_backwardILb0ELb0ESt26random_access_iterator_tagE13__copy_move_bIPSsS3_EET0_T_S5_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0EPSsS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPSsS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardIPSsS0_ET0_T_S2_S1_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET1_T0_SA_S9_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET0_T_SA_S9_
-DA:210,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:268,0
-DA:269,0
-DA:276,0
-DA:277,0
-DA:286,0
-DA:287,0
-DA:337,0
-DA:340,0
-DA:342,0
-DA:343,0
-DA:344,0
-DA:346,0
-DA:385,0
-DA:393,0
-DA:396,0
-DA:430,0
-DA:435,0
-DA:456,0
-DA:466,0
-DA:539,0
-DA:542,0
-DA:543,0
-DA:544,0
-DA:579,0
-DA:587,0
-DA:592,0
-DA:597,0
-DA:602,0
-DA:624,0
-DA:636,0
-BA:215,0
-BA:215,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:542,0
-BA:542,0
-LF:34
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-DA:87,0
-DA:88,0
-DA:97,0
-DA:101,0
-DA:103,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-BA:101,0
-BA:101,0
-LF:9
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEdeEv
-FN:398,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEC1ERS2_
-FN:456,_ZSt13back_inserterISt6vectorISsSaISsEEESt20back_insert_iteratorIT_ERS4_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEC1ERKS2_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEE4baseEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEC1ERKS1_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-FN:429,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEdeEv
-FN:434,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEppEv
-FN:412,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEaSERKSs
-DA:398,0
-DA:412,0
-DA:414,0
-DA:415,0
-DA:429,0
-DA:430,0
-DA:434,0
-DA:435,0
-DA:456,0
-DA:457,0
-DA:683,0
-DA:695,0
-DA:696,0
-DA:747,0
-DA:748,0
-DA:769,0
-DA:770,0
-LF:17
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,0
-DA:166,0
-DA:167,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyIPSsS2_EET0_T_S4_S3_
-FN:113,_ZSt18uninitialized_copyIPSsS0_ET0_T_S2_S1_
-FN:261,_ZSt22__uninitialized_copy_aIPSsS0_SsET0_T_S2_S1_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPSsS0_SaISsEET0_T_S3_S2_RT1_
-DA:73,0
-DA:75,0
-DA:78,0
-DA:79,0
-DA:81,0
-DA:83,0
-DA:85,0
-DA:86,0
-DA:113,0
-DA:122,0
-DA:261,0
-DA:262,0
-DA:268,0
-DA:272,0
-BA:78,0
-BA:78,0
-BA:79,0
-BA:79,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:404,_ZNKSt6vectorISsSaISsEE3endEv
-FN:386,_ZNKSt6vectorISsSaISsEE5beginEv
-FN:484,_ZNKSt6vectorISsSaISsEE4sizeEv
-FN:101,_ZNKSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:395,_ZNSt6vectorISsSaISsEE3endEv
-FN:377,_ZNSt6vectorISsSaISsEE5beginEv
-FN:526,_ZNKSt6vectorISsSaISsEE5emptyEv
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:84,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseISsSaISsEEC2Ev
-FN:213,_ZNSt6vectorISsSaISsEEC1Ev
-FN:489,_ZNKSt6vectorISsSaISsEE8max_sizeEv
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-FN:1075,_ZNKSt6vectorISsSaISsEE12_M_check_lenEjPKc
-FN:143,_ZNSt12_Vector_baseISsSaISsEE11_M_allocateEj
-FN:686,_ZNSt6vectorISsSaISsEE9push_backERKSs
-DA:79,0
-DA:84,0
-DA:85,0
-DA:86,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:108,0
-DA:109,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:143,0
-DA:144,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:213,0
-DA:214,0
-DA:299,0
-DA:300,0
-DA:301,0
-DA:377,0
-DA:378,0
-DA:386,0
-DA:387,0
-DA:395,0
-DA:396,0
-DA:404,0
-DA:405,0
-DA:484,0
-DA:485,0
-DA:489,0
-DA:490,0
-DA:526,0
-DA:527,0
-DA:686,0
-DA:688,0
-DA:690,0
-DA:691,0
-DA:694,0
-DA:695,0
-DA:1075,0
-DA:1077,0
-DA:1078,0
-DA:1080,0
-DA:1081,0
-BA:144,0
-BA:144,0
-BA:149,0
-BA:149,0
-BA:688,0
-BA:688,0
-BA:1077,0
-BA:1077,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-LF:49
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stream_iterator.h
-FN:181,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERSoPKc
-FN:185,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERKS2_
-FN:202,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEdeEv
-FN:206,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEppEv
-FN:191,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEaSERKSs
-DA:181,0
-DA:182,0
-DA:185,0
-DA:186,0
-DA:191,0
-DA:196,0
-DA:197,0
-DA:198,0
-DA:202,0
-DA:203,0
-DA:206,0
-DA:207,0
-BA:197,0
-BA:197,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/vector.tcc
-FN:283,_ZNSt6vectorISsSaISsEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPSsS1_EERKSs
-DA:283,0
-DA:286,0
-DA:288,0
-DA:291,0
-DA:293,0
-DA:295,0
-DA:299,0
-DA:307,0
-DA:308,0
-DA:309,0
-DA:316,0
-DA:321,0
-DA:323,0
-DA:324,0
-DA:330,0
-DA:332,0
-DA:333,0
-DA:334,0
-DA:336,0
-DA:338,0
-DA:341,0
-DA:342,0
-DA:343,0
-DA:345,0
-BA:286,0
-BA:286,0
-LF:24
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/exception
-FN:59,_ZNSt9exceptionC2Ev
-DA:59,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISsE8max_sizeEv
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-FN:107,_ZN9__gnu_cxx13new_allocatorISsE9constructEPSsRKSs
-FN:87,_ZN9__gnu_cxx13new_allocatorISsE8allocateEjPKv
-DA:69,0
-DA:71,0
-DA:76,0
-DA:87,0
-DA:89,0
-DA:90,0
-DA:92,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:107,0
-DA:108,0
-BA:89,0
-BA:89,0
-BA:108,0
-BA:108,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/fstream
-FN:626,_ZNSt14basic_ofstreamIcSt11char_traitsIcEE4openEPKcSt13_Ios_Openmode
-FN:495,_ZNSt14basic_ifstreamIcSt11char_traitsIcEE4openEPKcSt13_Ios_Openmode
-FN:215,_ZNSt13basic_filebufIcSt11char_traitsIcEED1Ev
-FN:572,_ZNSt14basic_ofstreamIcSt11char_traitsIcEEC1EPKcSt13_Ios_Openmode
-FN:585,_ZNSt14basic_ofstreamIcSt11char_traitsIcEED1Ev
-FN:442,_ZNSt14basic_ifstreamIcSt11char_traitsIcEEC1EPKcSt13_Ios_Openmode
-FN:455,_ZNSt14basic_ifstreamIcSt11char_traitsIcEED1Ev
-FN:223,_ZNKSt13basic_filebufIcSt11char_traitsIcEE7is_openEv
-FN:604,_ZNSt14basic_ofstreamIcSt11char_traitsIcEE7is_openEv
-FN:474,_ZNSt14basic_ifstreamIcSt11char_traitsIcEE7is_openEv
-DA:215,0
-DA:216,0
-DA:223,0
-DA:224,0
-DA:442,0
-DA:443,0
-DA:445,0
-DA:446,0
-DA:447,0
-DA:455,0
-DA:456,0
-DA:474,0
-DA:475,0
-DA:495,0
-DA:497,0
-DA:498,0
-DA:502,0
-DA:503,0
-DA:572,0
-DA:573,0
-DA:575,0
-DA:576,0
-DA:577,0
-DA:585,0
-DA:586,0
-DA:604,0
-DA:605,0
-DA:626,0
-DA:628,0
-DA:629,0
-DA:633,0
-DA:634,0
-BA:216,0
-BA:216,0
-BA:456,0
-BA:456,0
-BA:456,0
-BA:456,0
-BA:456,0
-BA:456,0
-BA:497,0
-BA:497,0
-BA:586,0
-BA:586,0
-BA:586,0
-BA:586,0
-BA:586,0
-BA:586,0
-BA:628,0
-BA:628,0
-LF:32
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,3
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/istream
-FN:585,_ZNSiC2Ev
-FN:105,_ZNSiD2Ev
-FN:804,_ZNSdC2Ev
-FN:801,_ZNSdD2Ev
-DA:105,0
-DA:106,0
-DA:585,0
-DA:586,0
-DA:587,0
-DA:801,0
-DA:804,0
-DA:805,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-DA:95,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:509,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:536,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:555,_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:509,0
-DA:510,0
-DA:511,0
-DA:536,0
-DA:537,0
-DA:555,0
-DA:556,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/exception.h
-FN:190,_ZNK6wibble9exception7Generic4typeEv
-FN:263,_ZNK6wibble9exception11Consistency4typeEv
-FN:137,_ZN6wibble9exception7ContextD2Ev
-FN:265,_ZNK6wibble9exception11Consistency4descEv
-FN:213,_ZNK6wibble9exception7Generic4whatEv
-FN:193,_ZNK6wibble9exception7Generic4descEv
-FN:154,_ZNK6wibble9exception7Context13formatContextEv
-FN:205,_ZNK6wibble9exception7Generic8fullInfoEv
-FN:187,_ZN6wibble9exception7GenericD0Ev
-FN:187,_ZN6wibble9exception7GenericD1Ev
-FN:187,_ZN6wibble9exception7GenericD2Ev
-FN:261,_ZN6wibble9exception11ConsistencyD0Ev
-FN:261,_ZN6wibble9exception11ConsistencyD1Ev
-FN:109,_ZN6wibble9exception10AddContext7contextEv
-FN:117,_ZN6wibble9exception10AddContext11copyContextISt20back_insert_iteratorISt6vectorISsSaISsEEEEEvT_
-FN:153,_ZN6wibble9exception7Context10addContextERKSs
-FN:147,_ZN6wibble9exception7ContextC2ERKSs
-FN:186,_ZN6wibble9exception7GenericC2ERKSs
-FN:259,_ZN6wibble9exception11ConsistencyC1ERKSsS3_
-DA:109,0
-DA:110,0
-DA:111,0
-DA:112,0
-DA:113,0
-DA:117,0
-DA:118,0
-DA:119,0
-DA:137,0
-DA:147,0
-DA:148,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:153,0
-DA:154,0
-DA:155,0
-DA:156,0
-DA:157,0
-DA:159,0
-DA:161,0
-DA:162,0
-DA:163,0
-DA:186,0
-DA:187,0
-DA:190,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:205,0
-DA:206,0
-DA:207,0
-DA:209,0
-DA:210,0
-DA:213,0
-DA:259,0
-DA:260,0
-DA:261,0
-DA:263,0
-DA:265,0
-DA:266,0
-DA:267,0
-DA:268,0
-DA:269,0
-BA:110,0
-BA:110,0
-BA:156,0
-BA:156,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:207,0
-BA:207,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:267,0
-BA:267,0
-LF:44
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/grcal/grcal.cpp
-FN:83,_ZN6wibble5grcal4date10daysinyearEi
-FN:90,_ZN6wibble5grcal4date6easterEiPiS2_
-FN:111,_ZN6wibble5grcal4date10lowerboundEPKiPi
-FN:121,_ZN6wibble5grcal4date10lowerboundEPi
-FN:130,_ZN6wibble5grcal4dateL7normalNERiS2_i
-FN:263,_ZN6wibble5grcal4date9mergetimeEPKiS3_Pi
-FN:272,_ZN6wibble5grcal4date9mergetimeEPiPKi
-FN:280,_ZN6wibble5grcal4date4totmEPKiP2tm
-FN:290,_ZN6wibble5grcal4date6fromtmERK2tmPii
-FN:322,_ZN6wibble5grcal5dtime10lowerboundEPKiPi
-FN:328,_ZN6wibble5grcal5dtime10lowerboundEPi
-FN:334,_ZN6wibble5grcal5dtime14lowerbound_secEPKi
-FN:344,_ZN6wibble5grcal5dtime10upperboundEPKiPi
-FN:351,_ZN6wibble5grcal5dtime10upperboundEPi
-FN:358,_ZN6wibble5grcal5dtime14upperbound_secEPKi
-FN:367,_ZN6wibble5grcal5dtime8durationEPKiS3_
-FN:398,_Z41__static_initialization_and_destruction_0ii
-FN:398,_GLOBAL__I_grcal.cpp
-FN:385,_ZN6wibble5grcal5dtime8tostringEi
-FN:372,_ZN6wibble5grcal5dtime8tostringEPKi
-FN:300,_ZN6wibble5grcal4date8tostringEPKi
-FN:56,_ZN6wibble5grcal4date11daysinmonthEii
-FN:228,_ZN6wibble5grcal4date11secondsfromEiPKi
-FN:144,_ZN6wibble5grcal4date9normaliseEPi
-FN:208,_ZN6wibble5grcal4date10upperboundEPi
-FN:190,_ZN6wibble5grcal4date10upperboundEPKiPi
-FN:244,_ZN6wibble5grcal4date8durationEPKiS3_
-DA:56,76
-DA:58,76
-DA:60,7
-DA:62,15
-DA:63,7
-DA:64,8
-DA:65,7
-DA:66,5
-DA:67,5
-DA:68,5
-DA:69,5
-DA:70,5
-DA:71,5
-DA:72,5
-DA:73,5
-DA:74,7
-DA:76,0
-DA:77,0
-DA:78,0
-DA:83,7
-DA:85,7
-DA:86,2
-DA:87,5
-DA:90,1
-DA:94,1
-DA:95,1
-DA:96,1
-DA:97,1
-DA:98,1
-DA:99,1
-DA:100,1
-DA:101,1
-DA:102,1
-DA:103,1
-DA:104,1
-DA:105,1
-DA:106,1
-DA:107,1
-DA:108,1
-DA:111,3
-DA:113,3
-DA:114,3
-DA:115,3
-DA:116,3
-DA:117,3
-DA:118,3
-DA:119,3
-DA:121,1
-DA:123,1
-DA:124,1
-DA:125,1
-DA:126,1
-DA:127,1
-DA:130,61
-DA:132,61
-DA:134,18
-DA:135,18
-DA:136,18
-DA:137,18
-DA:139,43
-DA:140,43
-DA:142,61
-DA:144,11
-DA:147,11
-DA:148,11
-DA:152,11
-DA:156,11
-DA:160,11
-DA:164,26
-DA:166,4
-DA:167,4
-DA:168,4
-DA:171,2
-DA:173,13
-DA:174,13
-DA:175,13
-DA:176,2
-DA:177,2
-DA:182,11
-DA:185,11
-DA:186,11
-DA:188,11
-DA:190,3
-DA:194,21
-DA:195,18
-DA:196,8
-DA:197,17
-DA:198,7
-DA:200,3
-DA:202,3
-DA:205,3
-DA:206,3
-DA:208,2
-DA:211,14
-DA:212,12
-DA:213,9
-DA:214,3
-DA:217,2
-DA:219,2
-DA:221,2
-DA:222,2
-DA:228,7
-DA:230,7
-DA:231,7
-DA:232,7
-DA:233,7
-DA:234,7
-DA:235,7
-DA:236,51
-DA:237,44
-DA:238,10
-DA:239,3
-DA:240,7
-DA:244,2
-DA:250,2
-DA:251,2
-DA:254,14
-DA:255,12
-DA:256,3
-DA:259,2
-DA:260,2
-DA:263,0
-DA:265,0
-DA:266,0
-DA:267,0
-DA:268,0
-DA:269,0
-DA:270,0
-DA:272,0
-DA:274,0
-DA:275,0
-DA:276,0
-DA:277,0
-DA:278,0
-DA:280,0
-DA:282,0
-DA:283,0
-DA:284,0
-DA:285,0
-DA:286,0
-DA:287,0
-DA:288,0
-DA:290,0
-DA:292,0
-DA:293,0
-DA:294,0
-DA:295,0
-DA:296,0
-DA:297,0
-DA:298,0
-DA:300,28
-DA:302,28
-DA:303,28
-DA:304,28
-DA:305,28
-DA:306,27
-DA:307,27
-DA:308,26
-DA:309,26
-DA:310,25
-DA:311,25
-DA:312,24
-DA:313,24
-DA:314,23
-DA:315,23
-DA:322,0
-DA:324,0
-DA:325,0
-DA:326,0
-DA:328,0
-DA:330,0
-DA:331,0
-DA:332,0
-DA:334,0
-DA:336,0
-DA:337,0
-DA:338,0
-DA:339,0
-DA:340,0
-DA:344,0
-DA:346,0
-DA:347,0
-DA:348,0
-DA:349,0
-DA:351,0
-DA:353,0
-DA:354,0
-DA:355,0
-DA:356,0
-DA:358,0
-DA:360,0
-DA:361,0
-DA:362,0
-DA:363,0
-DA:364,0
-DA:367,0
-DA:369,0
-DA:372,4
-DA:374,4
-DA:375,3
-DA:376,3
-DA:377,3
-DA:378,3
-DA:379,2
-DA:380,2
-DA:381,1
-DA:382,1
-DA:385,2
-DA:387,2
-DA:388,2
-DA:391,2
-DA:392,2
-DA:398,3
-BA:58,2
-BA:58,2
-BA:58,2
-BA:58,2
-BA:58,2
-BA:58,2
-BA:58,2
-BA:58,2
-BA:58,2
-BA:58,2
-BA:58,2
-BA:58,2
-BA:58,1
-BA:62,2
-BA:62,2
-BA:62,2
-BA:62,2
-BA:62,2
-BA:62,2
-BA:85,2
-BA:85,2
-BA:85,2
-BA:85,2
-BA:85,2
-BA:85,2
-BA:114,2
-BA:114,2
-BA:115,2
-BA:115,2
-BA:116,2
-BA:116,2
-BA:117,2
-BA:117,2
-BA:118,2
-BA:118,2
-BA:123,2
-BA:123,1
-BA:124,2
-BA:124,1
-BA:125,2
-BA:125,1
-BA:126,2
-BA:126,1
-BA:127,2
-BA:127,1
-BA:132,2
-BA:132,2
-BA:135,2
-BA:135,2
-BA:164,2
-BA:164,2
-BA:175,2
-BA:175,2
-BA:194,2
-BA:194,2
-BA:195,2
-BA:195,2
-BA:196,2
-BA:196,2
-BA:196,2
-BA:196,2
-BA:197,2
-BA:197,2
-BA:197,2
-BA:197,2
-BA:211,2
-BA:211,2
-BA:212,2
-BA:212,2
-BA:213,2
-BA:213,2
-BA:213,2
-BA:213,2
-BA:214,2
-BA:214,1
-BA:214,2
-BA:214,2
-BA:231,2
-BA:231,1
-BA:232,2
-BA:232,1
-BA:233,2
-BA:233,1
-BA:234,2
-BA:234,1
-BA:235,2
-BA:235,1
-BA:236,2
-BA:236,2
-BA:238,2
-BA:238,2
-BA:254,2
-BA:254,2
-BA:255,2
-BA:255,2
-BA:255,2
-BA:255,1
-BA:256,2
-BA:256,1
-BA:256,1
-BA:256,2
-BA:259,2
-BA:259,2
-BA:266,0
-BA:266,0
-BA:267,0
-BA:267,0
-BA:268,0
-BA:268,0
-BA:274,0
-BA:274,0
-BA:275,0
-BA:275,0
-BA:276,0
-BA:276,0
-BA:283,0
-BA:283,0
-BA:284,0
-BA:284,0
-BA:285,0
-BA:285,0
-BA:286,0
-BA:286,0
-BA:287,0
-BA:287,0
-BA:293,0
-BA:293,0
-BA:294,0
-BA:294,0
-BA:295,0
-BA:295,0
-BA:296,0
-BA:296,0
-BA:297,0
-BA:297,0
-BA:305,2
-BA:305,2
-BA:307,2
-BA:307,2
-BA:309,2
-BA:309,2
-BA:311,2
-BA:311,2
-BA:313,2
-BA:313,2
-BA:324,0
-BA:324,0
-BA:325,0
-BA:325,0
-BA:330,0
-BA:330,0
-BA:331,0
-BA:331,0
-BA:337,0
-BA:337,0
-BA:338,0
-BA:338,0
-BA:339,0
-BA:339,0
-BA:346,0
-BA:346,0
-BA:347,0
-BA:347,0
-BA:348,0
-BA:348,0
-BA:353,0
-BA:353,0
-BA:354,0
-BA:354,0
-BA:355,0
-BA:355,0
-BA:361,0
-BA:361,0
-BA:362,0
-BA:362,0
-BA:363,0
-BA:363,0
-BA:374,2
-BA:374,2
-BA:378,2
-BA:378,2
-BA:380,2
-BA:380,2
-BA:398,2
-BA:398,1
-BA:398,2
-BA:398,1
-LF:213
-LH:149
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaISsED2Ev
-FN:98,_ZNSaISsEC2Ev
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-FN:364,_ZNKSt9basic_iosIcSt11char_traitsIcEE4fillEv
-FN:384,_ZNSt9basic_iosIcSt11char_traitsIcEE4fillEc
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:364,0
-DA:366,0
-DA:368,0
-DA:369,0
-DA:371,0
-DA:384,0
-DA:386,0
-DA:387,0
-DA:388,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-BA:366,0
-BA:366,0
-LF:23
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:1534,_ZNKSs5c_strEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:612,_ZNKSs6lengthEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-FN:835,_ZNSs6appendEPKc
-FN:2121,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:612,0
-DA:613,0
-DA:686,0
-DA:687,0
-DA:835,0
-DA:838,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2121,0
-DA:2123,0
-DA:2124,0
-DA:2125,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-LF:67
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:81,_ZStanSt13_Ios_FmtflagsS_
-FN:85,_ZStorSt13_Ios_FmtflagsS_
-FN:93,_ZStoRRSt13_Ios_FmtflagsS_
-FN:97,_ZStaNRSt13_Ios_FmtflagsS_
-FN:105,_ZStcoSt13_Ios_Fmtflags
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-FN:592,_ZNSt8ios_base4setfESt13_Ios_FmtflagsS0_
-FN:650,_ZNSt8ios_base5widthEi
-FN:905,_ZSt8internalRSt8ios_base
-DA:81,66
-DA:82,66
-DA:85,33
-DA:86,33
-DA:93,33
-DA:94,33
-DA:97,33
-DA:98,33
-DA:105,33
-DA:106,33
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-DA:592,33
-DA:594,33
-DA:595,33
-DA:596,33
-DA:597,33
-DA:650,0
-DA:652,0
-DA:653,0
-DA:654,0
-DA:905,33
-DA:907,33
-DA:908,33
-LF:26
-LH:18
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb0EE3__bES7_
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb0EE3__bES6_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb1EE3__bES7_
-FN:268,_ZNSt12__niter_baseISt16ostream_iteratorISscSt11char_traitsIcEELb0EE3__bES3_
-FN:286,_ZNSt12__miter_baseIPSsLb0EE3__bES0_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb1EE3__bES6_
-FN:268,_ZNSt12__niter_baseISt20back_insert_iteratorISt6vectorISsSaISsEEELb0EE3__bES4_
-FN:268,_ZNSt12__niter_baseIPSsLb0EE3__bES0_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPKSsSt16ostream_iteratorISscSt11char_traitsIcEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPKSsSt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_SD_SC_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET0_T_SD_SC_
-FN:539,_ZNSt20__copy_move_backwardILb0ELb0ESt26random_access_iterator_tagE13__copy_move_bIPSsS3_EET0_T_S5_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0EPSsS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPSsS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardIPSsS0_ET0_T_S2_S1_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET1_T0_SA_S9_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET0_T_SA_S9_
-DA:210,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:268,0
-DA:269,0
-DA:276,0
-DA:277,0
-DA:286,0
-DA:287,0
-DA:337,0
-DA:340,0
-DA:342,0
-DA:343,0
-DA:344,0
-DA:346,0
-DA:385,0
-DA:393,0
-DA:396,0
-DA:430,0
-DA:435,0
-DA:456,0
-DA:466,0
-DA:539,0
-DA:542,0
-DA:543,0
-DA:544,0
-DA:579,0
-DA:587,0
-DA:592,0
-DA:597,0
-DA:602,0
-DA:624,0
-DA:636,0
-BA:215,0
-BA:215,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:542,0
-BA:542,0
-LF:34
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-DA:87,0
-DA:88,0
-DA:97,0
-DA:101,0
-DA:103,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-BA:101,0
-BA:101,0
-LF:9
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEdeEv
-FN:398,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEC1ERS2_
-FN:456,_ZSt13back_inserterISt6vectorISsSaISsEEESt20back_insert_iteratorIT_ERS4_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEC1ERKS2_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEE4baseEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEC1ERKS1_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-FN:429,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEdeEv
-FN:434,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEppEv
-FN:412,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEaSERKSs
-DA:398,0
-DA:412,0
-DA:414,0
-DA:415,0
-DA:429,0
-DA:430,0
-DA:434,0
-DA:435,0
-DA:456,0
-DA:457,0
-DA:683,0
-DA:695,0
-DA:696,0
-DA:747,0
-DA:748,0
-DA:769,0
-DA:770,0
-LF:17
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,0
-DA:166,0
-DA:167,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyIPSsS2_EET0_T_S4_S3_
-FN:113,_ZSt18uninitialized_copyIPSsS0_ET0_T_S2_S1_
-FN:261,_ZSt22__uninitialized_copy_aIPSsS0_SsET0_T_S2_S1_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPSsS0_SaISsEET0_T_S3_S2_RT1_
-DA:73,0
-DA:75,0
-DA:78,0
-DA:79,0
-DA:81,0
-DA:83,0
-DA:85,0
-DA:86,0
-DA:113,0
-DA:122,0
-DA:261,0
-DA:262,0
-DA:268,0
-DA:272,0
-BA:78,0
-BA:78,0
-BA:79,0
-BA:79,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:404,_ZNKSt6vectorISsSaISsEE3endEv
-FN:386,_ZNKSt6vectorISsSaISsEE5beginEv
-FN:484,_ZNKSt6vectorISsSaISsEE4sizeEv
-FN:101,_ZNKSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:395,_ZNSt6vectorISsSaISsEE3endEv
-FN:377,_ZNSt6vectorISsSaISsEE5beginEv
-FN:526,_ZNKSt6vectorISsSaISsEE5emptyEv
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:84,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseISsSaISsEEC2Ev
-FN:213,_ZNSt6vectorISsSaISsEEC1Ev
-FN:489,_ZNKSt6vectorISsSaISsEE8max_sizeEv
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-FN:1075,_ZNKSt6vectorISsSaISsEE12_M_check_lenEjPKc
-FN:143,_ZNSt12_Vector_baseISsSaISsEE11_M_allocateEj
-FN:686,_ZNSt6vectorISsSaISsEE9push_backERKSs
-DA:79,0
-DA:84,0
-DA:85,0
-DA:86,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:108,0
-DA:109,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:143,0
-DA:144,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:213,0
-DA:214,0
-DA:299,0
-DA:300,0
-DA:301,0
-DA:377,0
-DA:378,0
-DA:386,0
-DA:387,0
-DA:395,0
-DA:396,0
-DA:404,0
-DA:405,0
-DA:484,0
-DA:485,0
-DA:489,0
-DA:490,0
-DA:526,0
-DA:527,0
-DA:686,0
-DA:688,0
-DA:690,0
-DA:691,0
-DA:694,0
-DA:695,0
-DA:1075,0
-DA:1077,0
-DA:1078,0
-DA:1080,0
-DA:1081,0
-BA:144,0
-BA:144,0
-BA:149,0
-BA:149,0
-BA:688,0
-BA:688,0
-BA:1077,0
-BA:1077,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-LF:49
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stream_iterator.h
-FN:181,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERSoPKc
-FN:185,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERKS2_
-FN:202,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEdeEv
-FN:206,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEppEv
-FN:191,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEaSERKSs
-DA:181,0
-DA:182,0
-DA:185,0
-DA:186,0
-DA:191,0
-DA:196,0
-DA:197,0
-DA:198,0
-DA:202,0
-DA:203,0
-DA:206,0
-DA:207,0
-BA:197,0
-BA:197,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/vector.tcc
-FN:283,_ZNSt6vectorISsSaISsEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPSsS1_EERKSs
-DA:283,0
-DA:286,0
-DA:288,0
-DA:291,0
-DA:293,0
-DA:295,0
-DA:299,0
-DA:307,0
-DA:308,0
-DA:309,0
-DA:316,0
-DA:321,0
-DA:323,0
-DA:324,0
-DA:330,0
-DA:332,0
-DA:333,0
-DA:334,0
-DA:336,0
-DA:338,0
-DA:341,0
-DA:342,0
-DA:343,0
-DA:345,0
-BA:286,0
-BA:286,0
-LF:24
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/exception
-FN:59,_ZNSt9exceptionC2Ev
-DA:59,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISsE8max_sizeEv
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-FN:107,_ZN9__gnu_cxx13new_allocatorISsE9constructEPSsRKSs
-FN:87,_ZN9__gnu_cxx13new_allocatorISsE8allocateEjPKv
-DA:69,0
-DA:71,0
-DA:76,0
-DA:87,0
-DA:89,0
-DA:90,0
-DA:92,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:107,0
-DA:108,0
-BA:89,0
-BA:89,0
-BA:108,0
-BA:108,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iomanip
-FN:243,_ZSt4setwi
-FN:175,_ZSt7setfillIcESt8_SetfillIT_ES1_
-FN:260,_ZStlsIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_St5_Setw
-FN:192,_ZStlsIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_St8_SetfillIS3_E
-DA:175,33
-DA:178,33
-DA:192,0
-DA:194,0
-DA:195,0
-DA:243,165
-DA:246,165
-DA:260,0
-DA:262,0
-DA:263,0
-LF:10
-LH:4
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/istream
-FN:585,_ZNSiC2Ev
-FN:105,_ZNSiD2Ev
-FN:804,_ZNSdC2Ev
-FN:801,_ZNSdD2Ev
-DA:105,0
-DA:106,0
-DA:585,0
-DA:586,0
-DA:587,0
-DA:801,0
-DA:804,0
-DA:805,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:131,_ZNSolsEPFRSt8ios_baseS0_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-DA:95,0
-DA:131,0
-DA:136,0
-DA:137,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:11
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:509,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:536,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:555,_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:509,0
-DA:510,0
-DA:511,0
-DA:536,0
-DA:537,0
-DA:555,0
-DA:556,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/exception.h
-FN:190,_ZNK6wibble9exception7Generic4typeEv
-FN:403,_ZNK6wibble9exception6System4typeEv
-FN:406,_ZNK6wibble9exception6System4codeEv
-FN:213,_ZNK6wibble9exception7Generic4whatEv
-FN:193,_ZNK6wibble9exception7Generic4descEv
-FN:154,_ZNK6wibble9exception7Context13formatContextEv
-FN:205,_ZNK6wibble9exception7Generic8fullInfoEv
-FN:137,_ZN6wibble9exception7ContextD2Ev
-FN:187,_ZN6wibble9exception7GenericD2Ev
-FN:395,_ZN6wibble9exception6SystemD0Ev
-FN:395,_ZN6wibble9exception6SystemD1Ev
-FN:187,_ZN6wibble9exception7GenericD0Ev
-FN:187,_ZN6wibble9exception7GenericD1Ev
-FN:109,_ZN6wibble9exception10AddContext7contextEv
-FN:117,_ZN6wibble9exception10AddContext11copyContextISt20back_insert_iteratorISt6vectorISsSaISsEEEEEvT_
-FN:153,_ZN6wibble9exception7Context10addContextERKSs
-FN:147,_ZN6wibble9exception7ContextC2ERKSs
-FN:186,_ZN6wibble9exception7GenericC2ERKSs
-DA:109,0
-DA:110,0
-DA:111,0
-DA:112,0
-DA:113,0
-DA:117,0
-DA:118,0
-DA:119,0
-DA:137,0
-DA:147,0
-DA:148,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:153,0
-DA:154,0
-DA:155,0
-DA:156,0
-DA:157,0
-DA:159,0
-DA:161,0
-DA:162,0
-DA:163,0
-DA:186,0
-DA:187,0
-DA:190,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:205,0
-DA:206,0
-DA:207,0
-DA:209,0
-DA:210,0
-DA:213,0
-DA:395,0
-DA:403,0
-DA:406,0
-BA:110,0
-BA:110,0
-BA:156,0
-BA:156,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:207,0
-BA:207,0
-BA:395,0
-BA:395,0
-BA:395,0
-BA:395,0
-LF:38
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/exception.cpp
-FN:100,_Z41__static_initialization_and_destruction_0ii
-FN:100,_GLOBAL__I_exception.cpp
-FN:82,_ZNK6wibble9exception6System4descEv
-FN:79,_ZN6wibble9exception6SystemC1EiRKSs
-FN:79,_ZN6wibble9exception6SystemC2EiRKSs
-FN:76,_ZN6wibble9exception6SystemC1ERKSs
-FN:76,_ZN6wibble9exception6SystemC2ERKSs
-FN:69,_ZN6wibble9exception17InstallUnexpectedD1Ev
-FN:69,_ZN6wibble9exception17InstallUnexpectedD2Ev
-FN:64,_ZN6wibble9exception17InstallUnexpectedC1EPFvvE
-FN:64,_ZN6wibble9exception17InstallUnexpectedC2EPFvvE
-FN:39,_ZN6wibble9exception17DefaultUnexpectedEv
-DA:39,0
-DA:42,0
-DA:44,0
-DA:45,0
-DA:47,0
-DA:48,0
-DA:49,0
-DA:50,0
-DA:51,0
-DA:52,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:56,0
-DA:57,0
-DA:58,0
-DA:59,0
-DA:60,0
-DA:64,0
-DA:66,0
-DA:67,0
-DA:69,0
-DA:71,0
-DA:72,0
-DA:76,2
-DA:77,2
-DA:79,0
-DA:80,0
-DA:82,1
-DA:84,1
-DA:95,1
-DA:100,9
-BA:48,0
-BA:48,0
-BA:100,2
-BA:100,1
-BA:100,2
-BA:100,1
-LF:32
-LH:6
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaISsED2Ev
-FN:98,_ZNSaISsEC2Ev
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:1534,_ZNKSs5c_strEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:612,_ZNKSs6lengthEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:835,_ZNSs6appendEPKc
-FN:501,_ZNSsaSERKSs
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2121,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:612,0
-DA:613,0
-DA:686,0
-DA:687,0
-DA:835,0
-DA:838,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2121,0
-DA:2123,0
-DA:2124,0
-DA:2125,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-LF:67
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb0EE3__bES7_
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb0EE3__bES6_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb1EE3__bES7_
-FN:268,_ZNSt12__niter_baseISt16ostream_iteratorISscSt11char_traitsIcEELb0EE3__bES3_
-FN:286,_ZNSt12__miter_baseIPSsLb0EE3__bES0_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb1EE3__bES6_
-FN:268,_ZNSt12__niter_baseISt20back_insert_iteratorISt6vectorISsSaISsEEELb0EE3__bES4_
-FN:268,_ZNSt12__niter_baseIPSsLb0EE3__bES0_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPKSsSt16ostream_iteratorISscSt11char_traitsIcEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPKSsSt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_SD_SC_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET0_T_SD_SC_
-FN:539,_ZNSt20__copy_move_backwardILb0ELb0ESt26random_access_iterator_tagE13__copy_move_bIPSsS3_EET0_T_S5_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0EPSsS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPSsS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardIPSsS0_ET0_T_S2_S1_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET1_T0_SA_S9_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET0_T_SA_S9_
-DA:210,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:268,0
-DA:269,0
-DA:276,0
-DA:277,0
-DA:286,0
-DA:287,0
-DA:337,0
-DA:340,0
-DA:342,0
-DA:343,0
-DA:344,0
-DA:346,0
-DA:385,0
-DA:393,0
-DA:396,0
-DA:430,0
-DA:435,0
-DA:456,0
-DA:466,0
-DA:539,0
-DA:542,0
-DA:543,0
-DA:544,0
-DA:579,0
-DA:587,0
-DA:592,0
-DA:597,0
-DA:602,0
-DA:624,0
-DA:636,0
-BA:215,0
-BA:215,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:542,0
-BA:542,0
-LF:34
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-DA:87,0
-DA:88,0
-DA:97,0
-DA:101,0
-DA:103,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-BA:101,0
-BA:101,0
-LF:9
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEdeEv
-FN:398,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEC1ERS2_
-FN:456,_ZSt13back_inserterISt6vectorISsSaISsEEESt20back_insert_iteratorIT_ERS4_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEC1ERKS2_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEE4baseEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEC1ERKS1_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-FN:429,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEdeEv
-FN:434,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEppEv
-FN:412,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEaSERKSs
-DA:398,0
-DA:412,0
-DA:414,0
-DA:415,0
-DA:429,0
-DA:430,0
-DA:434,0
-DA:435,0
-DA:456,0
-DA:457,0
-DA:683,0
-DA:695,0
-DA:696,0
-DA:747,0
-DA:748,0
-DA:769,0
-DA:770,0
-LF:17
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,0
-DA:166,0
-DA:167,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyIPSsS2_EET0_T_S4_S3_
-FN:113,_ZSt18uninitialized_copyIPSsS0_ET0_T_S2_S1_
-FN:261,_ZSt22__uninitialized_copy_aIPSsS0_SsET0_T_S2_S1_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPSsS0_SaISsEET0_T_S3_S2_RT1_
-DA:73,0
-DA:75,0
-DA:78,0
-DA:79,0
-DA:81,0
-DA:83,0
-DA:85,0
-DA:86,0
-DA:113,0
-DA:122,0
-DA:261,0
-DA:262,0
-DA:268,0
-DA:272,0
-BA:78,0
-BA:78,0
-BA:79,0
-BA:79,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:404,_ZNKSt6vectorISsSaISsEE3endEv
-FN:386,_ZNKSt6vectorISsSaISsEE5beginEv
-FN:395,_ZNSt6vectorISsSaISsEE3endEv
-FN:377,_ZNSt6vectorISsSaISsEE5beginEv
-FN:526,_ZNKSt6vectorISsSaISsEE5emptyEv
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:484,_ZNKSt6vectorISsSaISsEE4sizeEv
-FN:84,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseISsSaISsEEC2Ev
-FN:213,_ZNSt6vectorISsSaISsEEC1Ev
-FN:101,_ZNKSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:489,_ZNKSt6vectorISsSaISsEE8max_sizeEv
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-FN:1075,_ZNKSt6vectorISsSaISsEE12_M_check_lenEjPKc
-FN:143,_ZNSt12_Vector_baseISsSaISsEE11_M_allocateEj
-FN:686,_ZNSt6vectorISsSaISsEE9push_backERKSs
-DA:79,0
-DA:84,0
-DA:85,0
-DA:86,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:108,0
-DA:109,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:143,0
-DA:144,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:213,0
-DA:214,0
-DA:299,0
-DA:300,0
-DA:301,0
-DA:377,0
-DA:378,0
-DA:386,0
-DA:387,0
-DA:395,0
-DA:396,0
-DA:404,0
-DA:405,0
-DA:484,0
-DA:485,0
-DA:489,0
-DA:490,0
-DA:526,0
-DA:527,0
-DA:686,0
-DA:688,0
-DA:690,0
-DA:691,0
-DA:694,0
-DA:695,0
-DA:1075,0
-DA:1077,0
-DA:1078,0
-DA:1080,0
-DA:1081,0
-BA:144,0
-BA:144,0
-BA:149,0
-BA:149,0
-BA:688,0
-BA:688,0
-BA:1077,0
-BA:1077,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-LF:49
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stream_iterator.h
-FN:181,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERSoPKc
-FN:185,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERKS2_
-FN:202,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEdeEv
-FN:206,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEppEv
-FN:191,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEaSERKSs
-DA:181,0
-DA:182,0
-DA:185,0
-DA:186,0
-DA:191,0
-DA:196,0
-DA:197,0
-DA:198,0
-DA:202,0
-DA:203,0
-DA:206,0
-DA:207,0
-BA:197,0
-BA:197,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/vector.tcc
-FN:283,_ZNSt6vectorISsSaISsEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPSsS1_EERKSs
-DA:283,0
-DA:286,0
-DA:288,0
-DA:291,0
-DA:293,0
-DA:295,0
-DA:299,0
-DA:307,0
-DA:308,0
-DA:309,0
-DA:316,0
-DA:321,0
-DA:323,0
-DA:324,0
-DA:330,0
-DA:332,0
-DA:333,0
-DA:334,0
-DA:336,0
-DA:338,0
-DA:341,0
-DA:342,0
-DA:343,0
-DA:345,0
-BA:286,0
-BA:286,0
-LF:24
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/exception
-FN:59,_ZNSt9exceptionC2Ev
-DA:59,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISsE8max_sizeEv
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-FN:107,_ZN9__gnu_cxx13new_allocatorISsE9constructEPSsRKSs
-FN:87,_ZN9__gnu_cxx13new_allocatorISsE8allocateEjPKv
-DA:69,0
-DA:71,0
-DA:76,0
-DA:87,0
-DA:89,0
-DA:90,0
-DA:92,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:107,0
-DA:108,0
-BA:89,0
-BA:89,0
-BA:108,0
-BA:108,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,3
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/istream
-FN:585,_ZNSiC2Ev
-FN:105,_ZNSiD2Ev
-FN:804,_ZNSdC2Ev
-FN:801,_ZNSdD2Ev
-DA:105,0
-DA:106,0
-DA:585,0
-DA:586,0
-DA:587,0
-DA:801,0
-DA:804,0
-DA:805,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:195,_ZNSolsEj
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-DA:95,0
-DA:112,0
-DA:117,0
-DA:195,0
-DA:199,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:509,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:536,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:555,_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:509,0
-DA:510,0
-DA:511,0
-DA:536,0
-DA:537,0
-DA:555,0
-DA:556,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/typeinfo
-FN:104,_ZNKSt9type_info4nameEv
-DA:104,0
-DA:105,0
-LF:2
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/log/stream.cpp
-FN:17,_ZN6wibble3log9Streambuf9setSenderEPNS0_6SenderE
-FN:28,_ZN6wibble3log9Streambuf8setLevelERKNS0_5LevelE
-FN:42,_ZN6wibble3loglsERSoNS0_5LevelE
-FN:19,_ZN6wibble3log9Streambuf4sendEv
-FN:33,_ZN6wibble3log9Streambuf8overflowEi
-FN:11,_ZN6wibble3log9StreambufD0Ev
-FN:11,_ZN6wibble3log9StreambufD1Ev
-FN:11,_ZN6wibble3log9StreambufD2Ev
-FN:9,_ZN6wibble3log9StreambufC1EPNS0_6SenderE
-FN:9,_ZN6wibble3log9StreambufC2EPNS0_6SenderE
-FN:7,_ZN6wibble3log9StreambufC1Ev
-FN:7,_ZN6wibble3log9StreambufC2Ev
-DA:7,0
-DA:9,4
-DA:11,4
-DA:13,4
-DA:14,4
-DA:15,4
-DA:17,0
-DA:19,12
-DA:22,12
-DA:24,12
-DA:25,12
-DA:26,12
-DA:28,4
-DA:30,4
-DA:31,4
-DA:33,136
-DA:35,136
-DA:36,8
-DA:38,128
-DA:39,136
-DA:42,4
-DA:44,4
-DA:46,4
-DA:47,4
-DA:49,0
-BA:13,0
-BA:13,0
-BA:13,2
-BA:13,1
-BA:13,0
-BA:13,0
-BA:15,0
-BA:15,0
-BA:15,1
-BA:15,2
-BA:15,0
-BA:15,0
-BA:35,2
-BA:35,2
-BA:44,1
-BA:44,2
-BA:44,2
-BA:44,1
-LF:25
-LH:22
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:100,_ZNSaIcEC1ERKS_
-FN:100,_ZNSaIcEC2ERKS_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:315,_ZNKSt9basic_iosIcSt11char_traitsIcEE5rdbufEv
-DA:315,0
-DA:316,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:277,_ZNKSs7_M_dataEv
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:192,_ZNKSs4_Rep12_M_is_sharedEv
-FN:652,_ZNKSs8capacityEv
-FN:1551,_ZNKSs13get_allocatorEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:870,_ZNSs9push_backEc
-FN:791,_ZNSspLEc
-FN:679,_ZNSs5clearEv
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-DA:178,0
-DA:183,0
-DA:184,0
-DA:192,0
-DA:193,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:606,0
-DA:607,0
-DA:652,0
-DA:653,0
-DA:679,0
-DA:680,0
-DA:686,0
-DA:687,0
-DA:791,0
-DA:793,0
-DA:794,0
-DA:870,0
-DA:872,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:877,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:873,0
-LF:52
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:287,_ZNSt11char_traitsIcE11to_int_typeERKc
-FN:291,_ZNSt11char_traitsIcE11eq_int_typeERKiS2_
-FN:295,_ZNSt11char_traitsIcE3eofEv
-DA:245,0
-DA:246,0
-DA:287,0
-DA:288,0
-DA:291,0
-DA:292,0
-DA:295,0
-LF:7
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/postypes.h
-FN:112,_ZNSt4fposI11__mbstate_tEC1Ex
-DA:112,0
-DA:113,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-DA:69,0
-DA:71,0
-DA:76,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:557,_ZNSt15basic_streambufIcSt11char_traitsIcEE5imbueERKSt6locale
-FN:572,_ZNSt15basic_streambufIcSt11char_traitsIcEE6setbufEPci
-FN:608,_ZNSt15basic_streambufIcSt11char_traitsIcEE4syncEv
-FN:630,_ZNSt15basic_streambufIcSt11char_traitsIcEE9showmanycEv
-FN:668,_ZNSt15basic_streambufIcSt11char_traitsIcEE9underflowEv
-FN:705,_ZNSt15basic_streambufIcSt11char_traitsIcEE9pbackfailEi
-FN:596,_ZNSt15basic_streambufIcSt11char_traitsIcEE7seekposESt4fposI11__mbstate_tESt13_Ios_Openmode
-FN:584,_ZNSt15basic_streambufIcSt11char_traitsIcEE7seekoffExSt12_Ios_SeekdirSt13_Ios_Openmode
-FN:466,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4gptrEv
-FN:479,_ZNSt15basic_streambufIcSt11char_traitsIcEE5gbumpEi
-FN:681,_ZNSt15basic_streambufIcSt11char_traitsIcEE5uflowEv
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:466,0
-DA:479,0
-DA:557,0
-DA:558,0
-DA:572,0
-DA:573,0
-DA:584,0
-DA:585,0
-DA:596,0
-DA:597,0
-DA:608,0
-DA:630,0
-DA:668,0
-DA:669,0
-DA:681,0
-DA:683,0
-DA:685,0
-DA:686,0
-DA:688,0
-DA:689,0
-DA:691,0
-DA:705,0
-DA:706,0
-BA:198,0
-BA:198,0
-BA:686,0
-BA:686,0
-LF:28
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/exception.h
-FN:190,_ZNK6wibble9exception7Generic4typeEv
-FN:406,_ZNK6wibble9exception6System4codeEv
-FN:428,_ZNK6wibble9exception4File4typeEv
-FN:137,_ZN6wibble9exception7ContextD2Ev
-FN:213,_ZNK6wibble9exception7Generic4whatEv
-FN:193,_ZNK6wibble9exception7Generic4descEv
-FN:154,_ZNK6wibble9exception7Context13formatContextEv
-FN:205,_ZNK6wibble9exception7Generic8fullInfoEv
-FN:430,_ZNK6wibble9exception4File4descEv
-FN:187,_ZN6wibble9exception7GenericD2Ev
-FN:395,_ZN6wibble9exception6SystemD2Ev
-FN:424,_ZN6wibble9exception4FileC1ERKSsS3_
-FN:426,_ZN6wibble9exception4FileD0Ev
-FN:426,_ZN6wibble9exception4FileD1Ev
-FN:187,_ZN6wibble9exception7GenericD0Ev
-FN:187,_ZN6wibble9exception7GenericD1Ev
-DA:137,0
-DA:154,0
-DA:155,0
-DA:156,0
-DA:157,0
-DA:159,0
-DA:161,0
-DA:162,0
-DA:163,0
-DA:187,0
-DA:190,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:205,0
-DA:206,0
-DA:207,0
-DA:209,0
-DA:210,0
-DA:213,0
-DA:395,0
-DA:406,0
-DA:424,0
-DA:425,0
-DA:426,0
-DA:428,0
-DA:430,0
-BA:156,0
-BA:156,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:207,0
-BA:207,0
-BA:395,0
-BA:395,0
-BA:426,0
-BA:426,0
-BA:426,0
-BA:426,0
-LF:27
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/log/stream.h
-FN:23,_ZN6wibble3log6SenderC2Ev
-FN:24,_ZN6wibble3log6SenderD2Ev
-FN:24,_ZN6wibble3log6SenderD0Ev
-FN:24,_ZN6wibble3log6SenderD1Ev
-DA:23,0
-DA:24,0
-BA:24,0
-BA:24,0
-BA:24,0
-BA:24,0
-BA:24,0
-BA:24,0
-LF:2
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/log/file.cpp
-FN:42,_Z41__static_initialization_and_destruction_0ii
-FN:42,_GLOBAL__I_file.cpp
-FN:21,_ZN6wibble3log10FileSender4sendENS0_5LevelERKSs
-FN:16,_ZN6wibble3log10FileSenderD0Ev
-FN:16,_ZN6wibble3log10FileSenderD1Ev
-FN:16,_ZN6wibble3log10FileSenderD2Ev
-FN:9,_ZN6wibble3log10FileSenderC1ERKSs
-FN:9,_ZN6wibble3log10FileSenderC2ERKSs
-DA:9,1
-DA:11,1
-DA:12,1
-DA:13,0
-DA:14,1
-DA:16,1
-DA:18,1
-DA:19,1
-DA:21,4
-DA:23,4
-DA:25,4
-DA:35,4
-DA:36,4
-DA:37,4
-DA:38,1
-DA:39,4
-DA:42,3
-BA:12,1
-BA:12,2
-BA:12,0
-BA:12,0
-BA:18,0
-BA:18,0
-BA:18,2
-BA:18,1
-BA:18,0
-BA:18,0
-BA:19,0
-BA:19,0
-BA:19,1
-BA:19,2
-BA:19,0
-BA:19,0
-BA:37,2
-BA:37,2
-BA:42,2
-BA:42,1
-BA:42,2
-BA:42,1
-LF:17
-LH:16
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:100,_ZNSaIcEC1ERKS_
-FN:100,_ZNSaIcEC2ERKS_
-FN:106,_ZNSaISsED2Ev
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:276,0
-BA:276,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:1534,_ZNKSs5c_strEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:612,_ZNKSs6lengthEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:1551,_ZNKSs13get_allocatorEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:835,_ZNSs6appendEPKc
-FN:2121,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-FN:501,_ZNSsaSERKSs
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:612,0
-DA:613,0
-DA:686,0
-DA:687,0
-DA:835,0
-DA:838,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2121,0
-DA:2123,0
-DA:2124,0
-DA:2125,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-LF:67
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb0EE3__bES7_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb1EE3__bES7_
-FN:268,_ZNSt12__niter_baseISt16ostream_iteratorISscSt11char_traitsIcEELb0EE3__bES3_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPKSsSt16ostream_iteratorISscSt11char_traitsIcEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPKSsSt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_SD_SC_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET0_T_SD_SC_
-DA:268,0
-DA:269,0
-DA:276,0
-DA:277,0
-DA:286,0
-DA:287,0
-DA:337,0
-DA:340,0
-DA:342,0
-DA:343,0
-DA:344,0
-DA:346,0
-DA:385,0
-DA:393,0
-DA:396,0
-DA:430,0
-DA:435,0
-DA:456,0
-DA:466,0
-BA:340,0
-BA:340,0
-LF:19
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-DA:87,0
-DA:88,0
-DA:97,0
-DA:101,0
-DA:103,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-BA:101,0
-BA:101,0
-LF:9
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEC1ERKS2_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-DA:683,0
-DA:747,0
-DA:748,0
-DA:769,0
-DA:770,0
-LF:5
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,0
-DA:166,0
-DA:167,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:404,_ZNKSt6vectorISsSaISsEE3endEv
-FN:386,_ZNKSt6vectorISsSaISsEE5beginEv
-FN:526,_ZNKSt6vectorISsSaISsEE5emptyEv
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-DA:79,0
-DA:97,0
-DA:98,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:299,0
-DA:300,0
-DA:301,0
-DA:386,0
-DA:387,0
-DA:404,0
-DA:405,0
-DA:526,0
-DA:527,0
-BA:149,0
-BA:149,0
-LF:19
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stream_iterator.h
-FN:181,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERSoPKc
-FN:185,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERKS2_
-FN:202,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEdeEv
-FN:206,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEppEv
-FN:191,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEaSERKSs
-DA:181,0
-DA:182,0
-DA:185,0
-DA:186,0
-DA:191,0
-DA:196,0
-DA:197,0
-DA:198,0
-DA:202,0
-DA:203,0
-DA:206,0
-DA:207,0
-BA:197,0
-BA:197,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-DA:69,0
-DA:71,0
-DA:76,0
-DA:97,0
-DA:98,0
-LF:5
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/istream
-FN:585,_ZNSiC2Ev
-FN:105,_ZNSiD2Ev
-FN:804,_ZNSdC2Ev
-FN:801,_ZNSdD2Ev
-DA:105,0
-DA:106,0
-DA:585,0
-DA:586,0
-DA:587,0
-DA:801,0
-DA:804,0
-DA:805,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-DA:95,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:509,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:536,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:555,_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:509,0
-DA:510,0
-DA:511,0
-DA:536,0
-DA:537,0
-DA:555,0
-DA:556,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/log/ostream.h
-FN:18,_ZN6wibble3log13OstreamSenderD0Ev
-FN:18,_ZN6wibble3log13OstreamSenderD1Ev
-DA:18,0
-BA:18,0
-BA:18,0
-BA:18,0
-BA:18,0
-LF:1
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/log/stream.h
-FN:23,_ZN6wibble3log6SenderC2Ev
-FN:24,_ZN6wibble3log6SenderD2Ev
-FN:24,_ZN6wibble3log6SenderD0Ev
-FN:24,_ZN6wibble3log6SenderD1Ev
-DA:23,0
-DA:24,0
-BA:24,0
-BA:24,0
-BA:24,0
-BA:24,0
-BA:24,0
-BA:24,0
-LF:2
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/log/ostream.cpp
-FN:7,_ZN6wibble3log13OstreamSenderC2ERSo
-FN:7,_ZN6wibble3log13OstreamSenderC1ERSo
-FN:9,_ZN6wibble3log13OstreamSender4sendENS0_5LevelERKSs
-DA:7,1
-DA:9,4
-DA:11,4
-DA:13,4
-DA:23,4
-DA:24,4
-DA:25,4
-DA:26,1
-DA:27,4
-BA:25,2
-BA:25,2
-LF:9
-LH:9
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:443,0
-DA:444,0
-BA:53,0
-BA:53,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:1544,_ZNKSs4dataEv
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:606,0
-DA:607,0
-DA:1544,0
-DA:1545,0
-DA:2421,0
-DA:2425,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-DA:261,0
-DA:262,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:163,0
-DA:164,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-DA:112,0
-DA:117,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:514,0
-BA:514,0
-LF:11
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/exception.h
-FN:190,_ZNK6wibble9exception7Generic4typeEv
-FN:263,_ZNK6wibble9exception11Consistency4typeEv
-FN:317,_ZNK6wibble9exception10OutOfRange4typeEv
-FN:368,_ZNK6wibble9exception13ValOutOfRangeIiE4typeEv
-FN:361,_ZNK6wibble9exception13ValOutOfRangeIiE3valEv
-FN:363,_ZNK6wibble9exception13ValOutOfRangeIiE3infEv
-FN:365,_ZNK6wibble9exception13ValOutOfRangeIiE3supEv
-FN:213,_ZNK6wibble9exception7Generic4whatEv
-FN:193,_ZNK6wibble9exception7Generic4descEv
-FN:320,_ZNK6wibble9exception10OutOfRange8var_descEv
-FN:265,_ZNK6wibble9exception11Consistency4descEv
-FN:137,_ZN6wibble9exception7ContextD2Ev
-FN:154,_ZNK6wibble9exception7Context13formatContextEv
-FN:322,_ZNK6wibble9exception10OutOfRange4descEv
-FN:205,_ZNK6wibble9exception7Generic8fullInfoEv
-FN:187,_ZN6wibble9exception7GenericD2Ev
-FN:261,_ZN6wibble9exception11ConsistencyD2Ev
-FN:315,_ZN6wibble9exception10OutOfRangeD2Ev
-FN:343,_ZN6wibble9exception13ValOutOfRangeIiED0Ev
-FN:343,_ZN6wibble9exception13ValOutOfRangeIiED1Ev
-FN:315,_ZN6wibble9exception10OutOfRangeD0Ev
-FN:315,_ZN6wibble9exception10OutOfRangeD1Ev
-FN:261,_ZN6wibble9exception11ConsistencyD0Ev
-FN:261,_ZN6wibble9exception11ConsistencyD1Ev
-FN:187,_ZN6wibble9exception7GenericD0Ev
-FN:187,_ZN6wibble9exception7GenericD1Ev
-FN:109,_ZN6wibble9exception10AddContext7contextEv
-FN:117,_ZN6wibble9exception10AddContext11copyContextISt20back_insert_iteratorISt6vectorISsSaISsEEEEEvT_
-FN:153,_ZN6wibble9exception7Context10addContextERKSs
-FN:147,_ZN6wibble9exception7ContextC2ERKSs
-FN:186,_ZN6wibble9exception7GenericC2ERKSs
-FN:259,_ZN6wibble9exception11ConsistencyC2ERKSsS3_
-FN:313,_ZN6wibble9exception10OutOfRangeC2ERKSsS3_
-FN:354,_ZN6wibble9exception13ValOutOfRangeIiEC1ERKSsiiiS4_
-DA:109,0
-DA:110,0
-DA:111,0
-DA:112,0
-DA:113,0
-DA:117,0
-DA:118,0
-DA:119,0
-DA:137,0
-DA:147,0
-DA:148,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:153,0
-DA:154,0
-DA:155,0
-DA:156,0
-DA:157,0
-DA:159,0
-DA:161,0
-DA:162,0
-DA:163,0
-DA:186,0
-DA:187,0
-DA:190,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:205,0
-DA:206,0
-DA:207,0
-DA:209,0
-DA:210,0
-DA:213,0
-DA:259,0
-DA:260,0
-DA:261,0
-DA:263,0
-DA:265,0
-DA:266,0
-DA:267,0
-DA:268,0
-DA:269,0
-DA:313,0
-DA:314,0
-DA:315,0
-DA:317,0
-DA:320,0
-DA:322,0
-DA:343,0
-DA:354,0
-DA:356,0
-DA:361,0
-DA:363,0
-DA:365,0
-DA:368,0
-DA:370,0
-BA:110,0
-BA:110,0
-BA:156,0
-BA:156,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:207,0
-BA:207,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:267,0
-BA:267,0
-BA:315,0
-BA:315,0
-BA:315,0
-BA:315,0
-BA:315,0
-BA:315,0
-BA:343,0
-BA:343,0
-BA:343,0
-BA:343,0
-LF:58
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/exception.tcc
-FN:29,_ZNK6wibble9exception13ValOutOfRangeIiE4descEv
-DA:29,0
-DA:31,0
-DA:32,0
-DA:34,0
-LF:4
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/regexp.h
-FN:45,_ZNK6wibble9exception6Regexp4codeEv
-FN:47,_ZNK6wibble9exception6Regexp4typeEv
-FN:48,_ZNK6wibble9exception6Regexp4descEv
-FN:42,_ZN6wibble9exception6RegexpD1Ev
-FN:42,_ZN6wibble9exception6RegexpD0Ev
-DA:42,0
-DA:45,0
-DA:47,0
-DA:48,0
-BA:42,0
-BA:42,0
-BA:42,0
-BA:42,0
-LF:4
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/regexp.cpp
-FN:169,_Z41__static_initialization_and_destruction_0ii
-FN:169,_GLOBAL__I_regexp.cpp
-FN:120,_ZN6wibble6Regexp11matchLengthEi
-FN:113,_ZN6wibble6Regexp8matchEndEi
-FN:106,_ZN6wibble6Regexp10matchStartEi
-FN:95,_ZN6wibble6RegexpixEi
-FN:66,_ZN6wibble6RegexpD1Ev
-FN:66,_ZN6wibble6RegexpD2Ev
-FN:32,_ZN6wibble9exception6RegexpC1ERK17re_pattern_bufferiRKSs
-FN:75,_ZN6wibble6Regexp5matchERKSsi
-FN:143,_ZN6wibble8Splitter14const_iteratorppEv
-FN:127,_ZN6wibble9Tokenizer14const_iteratorppEv
-FN:53,_ZN6wibble6RegexpC1ERKSsii
-FN:53,_ZN6wibble6RegexpC2ERKSsii
-FN:32,_ZN6wibble9exception6RegexpC2ERK17re_pattern_bufferiRKSs
-DA:32,0
-DA:33,0
-DA:35,0
-DA:36,0
-DA:37,0
-DA:38,0
-DA:40,0
-DA:41,0
-DA:42,0
-DA:44,0
-DA:45,0
-DA:46,0
-DA:53,14
-DA:55,14
-DA:56,2
-DA:58,14
-DA:59,14
-DA:60,0
-DA:62,14
-DA:63,12
-DA:64,14
-DA:66,14
-DA:68,14
-DA:69,14
-DA:70,12
-DA:71,14
-DA:75,50
-DA:79,50
-DA:81,38
-DA:82,38
-DA:85,12
-DA:87,50
-DA:89,33
-DA:90,17
-DA:91,0
-DA:95,6
-DA:97,6
-DA:98,0
-DA:100,6
-DA:101,0
-DA:103,6
-DA:106,25
-DA:108,25
-DA:109,0
-DA:110,25
-DA:113,2
-DA:115,2
-DA:116,0
-DA:117,2
-DA:120,30
-DA:122,30
-DA:123,0
-DA:124,30
-DA:127,26
-DA:130,26
-DA:132,26
-DA:134,17
-DA:135,17
-DA:138,9
-DA:140,26
-DA:143,10
-DA:145,10
-DA:147,8
-DA:149,3
-DA:150,6
-DA:154,5
-DA:156,4
-DA:157,8
-DA:159,1
-DA:163,2
-DA:164,2
-DA:166,10
-DA:169,9
-BA:38,0
-BA:38,0
-BA:38,0
-BA:38,0
-BA:40,0
-BA:40,0
-BA:40,0
-BA:40,0
-BA:45,0
-BA:45,0
-BA:45,0
-BA:45,0
-BA:55,2
-BA:55,2
-BA:55,2
-BA:55,2
-BA:59,1
-BA:59,2
-BA:59,1
-BA:59,2
-BA:62,2
-BA:62,2
-BA:62,2
-BA:62,2
-BA:69,2
-BA:69,2
-BA:69,2
-BA:69,2
-BA:70,2
-BA:70,1
-BA:70,2
-BA:70,1
-BA:79,2
-BA:79,2
-BA:87,2
-BA:87,2
-BA:87,1
-BA:97,1
-BA:97,2
-BA:100,1
-BA:100,2
-BA:108,1
-BA:108,2
-BA:115,1
-BA:115,2
-BA:122,1
-BA:122,2
-BA:132,2
-BA:132,2
-BA:145,2
-BA:145,2
-BA:147,2
-BA:147,2
-BA:154,2
-BA:154,2
-BA:169,2
-BA:169,1
-BA:169,2
-BA:169,1
-LF:73
-LH:54
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaISsED2Ev
-FN:98,_ZNSaISsEC2Ev
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:276,0
-BA:276,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:1534,_ZNKSs5c_strEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:612,_ZNKSs6lengthEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:306,_ZNKSs8_M_checkEjPKc
-FN:1923,_ZNKSs6substrEjj
-FN:501,_ZNSsaSERKSs
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:835,_ZNSs6appendEPKc
-FN:2121,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-FN:928,_ZNSs6assignEPKc
-FN:509,_ZNSsaSEPKc
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:306,0
-DA:308,0
-DA:309,0
-DA:310,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:509,0
-DA:510,0
-DA:606,0
-DA:607,0
-DA:612,0
-DA:613,0
-DA:686,0
-DA:687,0
-DA:835,0
-DA:838,0
-DA:928,0
-DA:931,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:1923,0
-DA:1925,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2121,0
-DA:2123,0
-DA:2124,0
-DA:2125,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:308,0
-BA:308,0
-BA:341,0
-BA:341,0
-LF:77
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-FN:668,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_EPKS3_RKS6_
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-DA:668,0
-DA:673,0
-DA:674,0
-DA:675,0
-DA:676,0
-DA:677,0
-DA:678,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:23
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb0EE3__bES7_
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb0EE3__bES6_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb1EE3__bES7_
-FN:268,_ZNSt12__niter_baseISt16ostream_iteratorISscSt11char_traitsIcEELb0EE3__bES3_
-FN:286,_ZNSt12__miter_baseIPSsLb0EE3__bES0_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb1EE3__bES6_
-FN:268,_ZNSt12__niter_baseISt20back_insert_iteratorISt6vectorISsSaISsEEELb0EE3__bES4_
-FN:268,_ZNSt12__niter_baseIPSsLb0EE3__bES0_
-FN:539,_ZNSt20__copy_move_backwardILb0ELb0ESt26random_access_iterator_tagE13__copy_move_bIPSsS3_EET0_T_S5_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0EPSsS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPSsS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardIPSsS0_ET0_T_S2_S1_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPKSsSt16ostream_iteratorISscSt11char_traitsIcEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPKSsSt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_SD_SC_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET0_T_SD_SC_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET1_T0_SA_S9_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET0_T_SA_S9_
-DA:210,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:268,0
-DA:269,0
-DA:276,0
-DA:277,0
-DA:286,0
-DA:287,0
-DA:337,0
-DA:340,0
-DA:342,0
-DA:343,0
-DA:344,0
-DA:346,0
-DA:385,0
-DA:393,0
-DA:396,0
-DA:430,0
-DA:435,0
-DA:456,0
-DA:466,0
-DA:539,0
-DA:542,0
-DA:543,0
-DA:544,0
-DA:579,0
-DA:587,0
-DA:592,0
-DA:597,0
-DA:602,0
-DA:624,0
-DA:636,0
-BA:215,0
-BA:215,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:542,0
-BA:542,0
-LF:34
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-DA:87,0
-DA:88,0
-DA:97,0
-DA:101,0
-DA:103,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-BA:101,0
-BA:101,0
-LF:9
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEdeEv
-FN:398,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEC1ERS2_
-FN:456,_ZSt13back_inserterISt6vectorISsSaISsEEESt20back_insert_iteratorIT_ERS4_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEC1ERKS2_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEE4baseEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEC1ERKS1_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-FN:429,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEdeEv
-FN:434,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEppEv
-FN:412,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEaSERKSs
-DA:398,0
-DA:412,0
-DA:414,0
-DA:415,0
-DA:429,0
-DA:430,0
-DA:434,0
-DA:435,0
-DA:456,0
-DA:457,0
-DA:683,0
-DA:695,0
-DA:696,0
-DA:747,0
-DA:748,0
-DA:769,0
-DA:770,0
-LF:17
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,0
-DA:166,0
-DA:167,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyIPSsS2_EET0_T_S4_S3_
-FN:113,_ZSt18uninitialized_copyIPSsS0_ET0_T_S2_S1_
-FN:261,_ZSt22__uninitialized_copy_aIPSsS0_SsET0_T_S2_S1_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPSsS0_SaISsEET0_T_S3_S2_RT1_
-DA:73,0
-DA:75,0
-DA:78,0
-DA:79,0
-DA:81,0
-DA:83,0
-DA:85,0
-DA:86,0
-DA:113,0
-DA:122,0
-DA:261,0
-DA:262,0
-DA:268,0
-DA:272,0
-BA:78,0
-BA:78,0
-BA:79,0
-BA:79,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:404,_ZNKSt6vectorISsSaISsEE3endEv
-FN:386,_ZNKSt6vectorISsSaISsEE5beginEv
-FN:484,_ZNKSt6vectorISsSaISsEE4sizeEv
-FN:101,_ZNKSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:395,_ZNSt6vectorISsSaISsEE3endEv
-FN:377,_ZNSt6vectorISsSaISsEE5beginEv
-FN:526,_ZNKSt6vectorISsSaISsEE5emptyEv
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:84,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseISsSaISsEEC2Ev
-FN:213,_ZNSt6vectorISsSaISsEEC1Ev
-FN:489,_ZNKSt6vectorISsSaISsEE8max_sizeEv
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-FN:1075,_ZNKSt6vectorISsSaISsEE12_M_check_lenEjPKc
-FN:143,_ZNSt12_Vector_baseISsSaISsEE11_M_allocateEj
-FN:686,_ZNSt6vectorISsSaISsEE9push_backERKSs
-DA:79,0
-DA:84,0
-DA:85,0
-DA:86,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:108,0
-DA:109,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:143,0
-DA:144,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:213,0
-DA:214,0
-DA:299,0
-DA:300,0
-DA:301,0
-DA:377,0
-DA:378,0
-DA:386,0
-DA:387,0
-DA:395,0
-DA:396,0
-DA:404,0
-DA:405,0
-DA:484,0
-DA:485,0
-DA:489,0
-DA:490,0
-DA:526,0
-DA:527,0
-DA:686,0
-DA:688,0
-DA:690,0
-DA:691,0
-DA:694,0
-DA:695,0
-DA:1075,0
-DA:1077,0
-DA:1078,0
-DA:1080,0
-DA:1081,0
-BA:144,0
-BA:144,0
-BA:149,0
-BA:149,0
-BA:688,0
-BA:688,0
-BA:1077,0
-BA:1077,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-LF:49
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stream_iterator.h
-FN:181,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERSoPKc
-FN:185,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERKS2_
-FN:202,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEdeEv
-FN:206,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEppEv
-FN:191,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEaSERKSs
-DA:181,0
-DA:182,0
-DA:185,0
-DA:186,0
-DA:191,0
-DA:196,0
-DA:197,0
-DA:198,0
-DA:202,0
-DA:203,0
-DA:206,0
-DA:207,0
-BA:197,0
-BA:197,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/vector.tcc
-FN:283,_ZNSt6vectorISsSaISsEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPSsS1_EERKSs
-DA:283,0
-DA:286,0
-DA:288,0
-DA:291,0
-DA:293,0
-DA:295,0
-DA:299,0
-DA:307,0
-DA:308,0
-DA:309,0
-DA:316,0
-DA:321,0
-DA:323,0
-DA:324,0
-DA:330,0
-DA:332,0
-DA:333,0
-DA:334,0
-DA:336,0
-DA:338,0
-DA:341,0
-DA:342,0
-DA:343,0
-DA:345,0
-BA:286,0
-BA:286,0
-LF:24
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/exception
-FN:59,_ZNSt9exceptionC2Ev
-DA:59,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISsE8max_sizeEv
-FN:107,_ZN9__gnu_cxx13new_allocatorISsE9constructEPSsRKSs
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-FN:87,_ZN9__gnu_cxx13new_allocatorISsE8allocateEjPKv
-DA:69,0
-DA:71,0
-DA:76,0
-DA:87,0
-DA:89,0
-DA:90,0
-DA:92,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:107,0
-DA:108,0
-BA:89,0
-BA:89,0
-BA:108,0
-BA:108,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,3
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/istream
-FN:585,_ZNSiC2Ev
-FN:105,_ZNSiD2Ev
-FN:804,_ZNSdC2Ev
-FN:801,_ZNSdD2Ev
-DA:105,0
-DA:106,0
-DA:585,0
-DA:586,0
-DA:587,0
-DA:801,0
-DA:804,0
-DA:805,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-DA:95,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:509,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:536,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:555,_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:509,0
-DA:510,0
-DA:511,0
-DA:536,0
-DA:537,0
-DA:555,0
-DA:556,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt/action.h
-FN:89,_ZN3ept4core7package10ActionList5emptyEv
-FN:81,_ZN3ept4core7package10ActionListC1Ev
-FN:15,_ZN3ept4core7package6ActionD1Ev
-FN:81,_ZN3ept4core7package10ActionListD1Ev
-FN:76,_ZN3ept4core7package6ActionC1ENS_5TokenENS2_4TypeE
-FN:20,_ZN3ept4core7package6Action5tokenEv
-FN:15,_ZN3ept4core7package6ActionC1ERKS2_
-FN:15,_ZN3ept4core7package6ActionaSERKS2_
-FN:93,_ZN3ept4core7package10ActionList3addENS1_6ActionE
-FN:23,_ZN3ept4core7package6Action5applyERNS1_6SourceE
-FN:111,_ZN3ept4core7package10ActionList6replayERNS1_6SourceE
-DA:15,13
-DA:20,4
-DA:23,4
-DA:25,4
-DA:26,4
-DA:28,4
-DA:29,0
-DA:31,4
-DA:32,0
-DA:33,4
-DA:35,4
-DA:36,8
-DA:37,2
-DA:38,2
-DA:39,2
-DA:40,2
-DA:41,2
-DA:42,0
-DA:43,2
-DA:44,0
-DA:45,0
-DA:46,0
-DA:47,0
-DA:48,2
-DA:49,2
-DA:50,2
-DA:51,2
-DA:53,4
-DA:76,6
-DA:77,6
-DA:78,6
-DA:81,2
-DA:89,1
-DA:90,1
-DA:93,3
-DA:94,3
-DA:95,3
-DA:96,2
-DA:97,2
-DA:98,2
-DA:101,3
-DA:102,2
-DA:104,3
-DA:105,3
-DA:111,1
-DA:112,2
-DA:113,1
-DA:115,1
-BA:28,1
-BA:28,2
-BA:31,2
-BA:31,1
-BA:36,2
-BA:36,2
-BA:36,1
-BA:36,2
-BA:41,1
-BA:41,2
-BA:43,2
-BA:43,1
-BA:43,1
-BA:43,2
-BA:48,2
-BA:48,1
-BA:95,2
-BA:95,2
-BA:96,2
-BA:96,1
-BA:101,2
-BA:101,2
-BA:112,2
-BA:112,2
-LF:48
-LH:41
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt/action.test.h
-FN:10,_ZN13TestAptActionC1Ev
-FN:8,_ZN13TestAptActionD1Ev
-FN:31,_ZN13TestAptAction4keepEv
-FN:12,_ZN13TestAptAction5basicEv
-FN:22,_ZN13TestAptAction6revertEv
-DA:8,3
-DA:10,3
-DA:12,1
-DA:13,1
-DA:14,2
-DA:15,1
-DA:16,1
-DA:17,1
-DA:18,1
-DA:19,1
-DA:20,1
-DA:22,1
-DA:23,1
-DA:24,2
-DA:25,1
-DA:26,1
-DA:27,1
-DA:28,1
-DA:29,1
-DA:31,1
-DA:32,1
-DA:33,1
-DA:34,2
-DA:35,1
-DA:36,2
-DA:37,1
-DA:38,1
-DA:39,1
-DA:40,1
-LF:29
-LH:29
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt/package.h
-FN:92,_ZN3ept4core7package6Source2dbEv
-FN:25,_ZN3ept4core7package6SourceD1Ev
-FN:28,_ZN3ept4core7package6SourceC1ERNS0_11AptDatabaseE
-FN:99,_ZN3ept4core7package6Source11getInternalILNS1_10PropertyIdE3EEENS1_12PropertyTypeIXT_EE1TEN8pkgCache11PkgIteratorE
-FN:34,_ZN3ept4core7package6Source11lookupTokenENS_5TokenE
-FN:44,_ZN3ept4core7package6Source6existsENS_5TokenE
-FN:30,_ZN3ept4core7package6Source12listInternalEv
-FN:61,_ZN3ept4core7package6Source11revertStateINS0_15AptInternalListIN8pkgCache11PkgIteratorEEEEEvT_
-FN:74,_ZN3ept4core7package6Source12revertStatesEv
-DA:25,0
-DA:28,0
-DA:30,0
-DA:31,0
-DA:34,0
-DA:35,0
-DA:44,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:61,1
-DA:62,3779
-DA:63,3777
-DA:64,3777
-DA:65,2
-DA:66,2
-DA:67,2
-DA:68,2
-DA:70,3777
-DA:72,1
-DA:74,1
-DA:75,1
-DA:76,1
-DA:77,1
-DA:92,9
-DA:99,0
-DA:100,0
-BA:45,0
-BA:45,0
-BA:62,2
-BA:62,2
-BA:64,2
-BA:64,2
-BA:64,1
-BA:64,2
-BA:64,2
-BA:64,2
-LF:27
-LH:15
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt/record.h
-DA:86,1
-BA:86,1
-BA:86,2
-LF:1
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt.h
-FN:60,_ZN3ept4core12PackageStatecvjEv
-FN:67,_ZN3ept4core12PackageStateoRERKS1_
-FN:72,_ZN3ept4core12PackageStateC1Ej
-FN:83,_ZNK3ept4core12PackageState7installEv
-FN:88,_ZNK3ept4core12PackageState5purgeEv
-FN:89,_ZNK3ept4core12PackageState4keepEv
-FN:282,_ZN3ept4core11AptDatabase12invalidStateEv
-FN:353,_ZN3ept4core15AptInternalListIN8pkgCache11PkgIteratorEEC1ES3_
-FN:352,_ZNK3ept4core15AptInternalListIN8pkgCache11PkgIteratorEE5emptyEv
-FN:351,_ZN3ept4core15AptInternalListIN8pkgCache11PkgIteratorEE4headEv
-FN:139,_ZN3ept4core11AptDatabaseC1Ev
-FN:209,_ZN3ept4core11AptDatabase10invalidateEv
-FN:331,_ZN3ept4core11AptDatabaseD1Ev
-FN:28,_ZNK3ept4core12AptException4descEv
-FN:32,_ZN3ept4core12AptExceptionC1ERKSs
-FN:164,_ZN3ept4core11AptDatabase9openCacheEv
-FN:113,_ZN3ept4core11AptDatabase5cacheEv
-FN:158,_ZN3ept4core11AptDatabase9openStateEv
-FN:119,_ZN3ept4core11AptDatabase5stateEv
-FN:244,_ZN3ept4core11AptDatabase16installedVersionEN8pkgCache11PkgIteratorE
-FN:125,_ZN3ept4core11AptDatabase6policyEv
-FN:237,_ZN3ept4core11AptDatabase16candidateVersionEN8pkgCache11PkgIteratorE
-FN:286,_ZN3ept4core11AptDatabase12packageStateEN8pkgCache11PkgIteratorE
-FN:27,_ZN3ept4core12AptExceptionD0Ev
-FN:27,_ZN3ept4core12AptExceptionD1Ev
-FN:227,_ZN3ept4core11AptDatabase16candidateVersionENS_5TokenE
-FN:252,_ZN3ept4core11AptDatabase13lookupPackageENS_5TokenE
-FN:256,_ZN3ept4core11AptDatabase13lookupVersionENS_5TokenE
-FN:345,_ZNK3ept4core15AptInternalListIN8pkgCache11PkgIteratorEE4tailEv
-DA:27,0
-DA:28,0
-DA:29,0
-DA:32,0
-DA:33,0
-DA:34,0
-DA:35,0
-DA:36,0
-DA:37,0
-DA:39,0
-DA:60,0
-DA:67,0
-DA:68,0
-DA:69,0
-DA:72,0
-DA:73,0
-DA:74,0
-DA:83,2
-DA:88,3775
-DA:89,3780
-DA:113,0
-DA:114,0
-DA:115,0
-DA:116,0
-DA:119,0
-DA:120,0
-DA:121,0
-DA:122,0
-DA:125,0
-DA:126,0
-DA:127,0
-DA:128,0
-DA:139,0
-DA:140,0
-DA:141,0
-DA:142,0
-DA:143,0
-DA:144,0
-DA:145,0
-DA:146,0
-DA:158,0
-DA:159,0
-DA:160,0
-DA:161,0
-DA:162,0
-DA:164,0
-DA:165,0
-DA:166,0
-DA:167,0
-DA:168,0
-DA:171,0
-DA:173,0
-DA:175,0
-DA:176,0
-DA:177,0
-DA:178,0
-DA:179,0
-DA:180,0
-DA:184,0
-DA:185,0
-DA:186,0
-DA:188,0
-DA:191,0
-DA:192,0
-DA:194,0
-DA:196,0
-DA:199,0
-DA:202,0
-DA:203,0
-DA:204,0
-DA:205,0
-DA:206,0
-DA:207,0
-DA:209,0
-DA:210,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:218,0
-DA:219,0
-DA:220,0
-DA:227,0
-DA:228,0
-DA:229,0
-DA:230,0
-DA:231,0
-DA:233,0
-DA:234,0
-DA:237,0
-DA:238,0
-DA:239,0
-DA:240,0
-DA:241,0
-DA:244,0
-DA:245,0
-DA:247,0
-DA:248,0
-DA:249,0
-DA:252,0
-DA:253,0
-DA:256,0
-DA:257,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:261,0
-DA:262,0
-DA:263,0
-DA:264,0
-DA:265,0
-DA:282,0
-DA:283,0
-DA:286,0
-DA:288,0
-DA:289,0
-DA:290,0
-DA:291,0
-DA:293,0
-DA:294,0
-DA:296,0
-DA:297,0
-DA:298,0
-DA:299,0
-DA:300,0
-DA:302,0
-DA:303,0
-DA:304,0
-DA:305,0
-DA:306,0
-DA:307,0
-DA:308,0
-DA:309,0
-DA:310,0
-DA:311,0
-DA:312,0
-DA:313,0
-DA:314,0
-DA:315,0
-DA:331,0
-DA:332,0
-DA:333,0
-DA:345,0
-DA:346,0
-DA:347,0
-DA:351,3781
-DA:352,0
-DA:353,0
-BA:27,0
-BA:27,0
-BA:27,0
-BA:27,0
-BA:33,0
-BA:33,0
-BA:114,0
-BA:114,0
-BA:120,0
-BA:120,0
-BA:126,0
-BA:126,0
-BA:165,0
-BA:165,0
-BA:173,0
-BA:173,0
-BA:185,0
-BA:185,0
-BA:194,0
-BA:194,0
-BA:204,0
-BA:204,0
-BA:210,0
-BA:210,0
-BA:214,0
-BA:214,0
-BA:216,0
-BA:216,0
-BA:218,0
-BA:218,0
-BA:229,0
-BA:229,0
-BA:231,0
-BA:231,0
-BA:238,0
-BA:238,0
-BA:240,0
-BA:240,0
-BA:245,0
-BA:245,0
-BA:248,0
-BA:248,0
-BA:257,0
-BA:257,0
-BA:260,0
-BA:260,0
-BA:262,0
-BA:262,0
-BA:263,0
-BA:263,0
-BA:289,0
-BA:289,0
-BA:291,0
-BA:291,0
-BA:291,0
-BA:291,0
-BA:291,0
-BA:291,0
-BA:294,0
-BA:294,0
-BA:294,0
-BA:294,0
-BA:294,0
-BA:294,0
-BA:298,0
-BA:298,0
-BA:300,0
-BA:300,0
-BA:303,0
-BA:303,0
-BA:305,0
-BA:305,0
-BA:307,0
-BA:307,0
-BA:309,0
-BA:309,0
-BA:311,0
-BA:311,0
-BA:313,0
-BA:313,0
-LF:149
-LH:4
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/source.h
-FN:20,_ZN3ept4core6SourceINS0_7package6SourceENS2_5SetupENS2_12PropertyTypeEE4selfEv
-FN:13,_ZN3ept4core6SourceINS0_7package6SourceENS2_5SetupENS2_12PropertyTypeEED2Ev
-FN:106,_ZN3ept4core6SourceINS0_7package6SourceENS2_5SetupENS2_12PropertyTypeEEC2Ev
-FN:23,_ZN3ept4core6SourceINS0_7package6SourceENS2_5SetupENS2_12PropertyTypeEE3getILNS2_10PropertyIdE3EEENS5_IXT_EE1TENS_5TokenE
-DA:13,0
-DA:20,0
-DA:23,0
-DA:24,0
-DA:25,0
-DA:26,0
-DA:28,0
-DA:106,0
-DA:107,0
-DA:108,0
-BA:24,0
-BA:24,0
-LF:10
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/test.h
-FN:12,_ZN18AptTestEnvironmentC2Ev
-FN:10,_ZN18AptTestEnvironmentD2Ev
-DA:10,0
-DA:12,0
-DA:13,0
-DA:14,0
-DA:15,0
-DA:16,0
-DA:17,0
-DA:18,0
-DA:19,0
-DA:20,0
-DA:21,0
-LF:11
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/token.h
-FN:10,_ZN3ept5TokenD1Ev
-FN:14,_ZN3ept5TokenC1Ev
-FN:15,_ZN3ept5TokenC1ESs
-FN:10,_ZN3ept5TokenC1ERKS0_
-FN:44,_ZNK3ept5TokenleERKS0_
-FN:10,_ZN3ept5TokenaSERKS0_
-FN:17,_ZNK3ept5Token7versionEv
-FN:22,_ZNK3ept5Token7packageEv
-FN:36,_ZNK3ept5Token10hasVersionEv
-DA:10,0
-DA:14,0
-DA:15,0
-DA:17,0
-DA:19,0
-DA:22,0
-DA:25,0
-DA:36,0
-DA:37,0
-DA:44,0
-DA:45,0
-BA:19,0
-BA:19,0
-BA:19,0
-BA:19,0
-BA:19,0
-BA:19,0
-BA:25,0
-BA:25,0
-LF:11
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/exception.h
-FN:190,_ZNK6wibble9exception7Generic4typeEv
-FN:109,_ZN6wibble9exception10AddContext7contextEv
-FN:137,_ZN6wibble9exception7ContextD2Ev
-FN:117,_ZN6wibble9exception10AddContext11copyContextISt20back_insert_iteratorISt6vectorISsSaISsEEEEEvT_
-FN:213,_ZNK6wibble9exception7Generic4whatEv
-FN:193,_ZNK6wibble9exception7Generic4descEv
-FN:153,_ZN6wibble9exception7Context10addContextERKSs
-FN:147,_ZN6wibble9exception7ContextC2ERKSs
-FN:154,_ZNK6wibble9exception7Context13formatContextEv
-FN:205,_ZNK6wibble9exception7Generic8fullInfoEv
-FN:186,_ZN6wibble9exception7GenericC2ERKSs
-FN:187,_ZN6wibble9exception7GenericD0Ev
-FN:187,_ZN6wibble9exception7GenericD1Ev
-FN:187,_ZN6wibble9exception7GenericD2Ev
-FN:395,_ZN6wibble9exception6SystemD1Ev
-DA:109,0
-DA:110,0
-DA:111,0
-DA:112,0
-DA:113,0
-DA:117,0
-DA:118,0
-DA:119,0
-DA:137,0
-DA:147,0
-DA:148,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:153,0
-DA:154,0
-DA:155,0
-DA:156,0
-DA:157,0
-DA:159,0
-DA:161,0
-DA:162,0
-DA:163,0
-DA:186,0
-DA:187,0
-DA:190,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:205,0
-DA:206,0
-DA:207,0
-DA:209,0
-DA:210,0
-DA:213,0
-DA:395,0
-BA:110,0
-BA:110,0
-BA:156,0
-BA:156,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:207,0
-BA:207,0
-BA:395,0
-BA:395,0
-LF:36
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/mixin.h
-FN:13,_ZN6wibble5mixin10ComparableIN3ept5TokenEEC2Ev
-FN:15,_ZNK6wibble5mixin10ComparableIN3ept5TokenEE7cmpSelfEv
-FN:23,_ZNK6wibble5mixin10ComparableIN3ept5TokenEEeqERKS3_
-FN:19,_ZNK6wibble5mixin10ComparableIN3ept5TokenEEneERKS3_
-DA:13,0
-DA:15,0
-DA:16,0
-DA:19,0
-DA:20,0
-DA:23,0
-DA:24,0
-BA:24,0
-BA:24,0
-BA:24,0
-BA:24,0
-LF:7
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:13,_ZN8LocationD1Ev
-FN:17,_ZN8LocationC1EPKciSs
-FN:13,_ZN8LocationC1ERKS_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:41,_ZN12AssertFailedD1Ev
-FN:59,_Z9assert_fnIbEv8LocationT_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:59,0
-DA:61,0
-DA:62,0
-DA:64,0
-BA:42,0
-BA:42,0
-BA:61,0
-BA:61,0
-LF:18
-LH:0
-end_of_record
-SF:/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_apt_action.cpp
-FN:5,_Z41__static_initialization_and_destruction_0ii
-FN:5,_GLOBAL__I_ept_test_generated__home_mornfall_dev_pkg_ept_work_ept_core_apt_action.cpp
-FN:5,_Z18run_AptAction_keepv
-FN:3,_Z19run_AptAction_basicv
-FN:4,_Z20run_AptAction_revertv
-DA:3,1
-DA:4,1
-DA:5,4
-BA:5,2
-BA:5,1
-BA:5,2
-BA:5,1
-LF:3
-LH:3
-end_of_record
-SF:/usr/include/apt-pkg/algorithms.h
-FN:110,_ZN18pkgProblemResolver7ProtectEN8pkgCache11PkgIteratorE
-FN:111,_ZN18pkgProblemResolver6RemoveEN8pkgCache11PkgIteratorE
-FN:112,_ZN18pkgProblemResolver5ClearEN8pkgCache11PkgIteratorE
-DA:110,4
-DA:111,0
-DA:112,4
-LF:3
-LH:2
-end_of_record
-SF:/usr/include/apt-pkg/cacheiterators.h
-FN:59,_ZNK8pkgCache11PkgIterator3endEv
-FN:66,_ZN8pkgCache11PkgIteratorptEv
-FN:67,_ZNK8pkgCache11PkgIteratorptEv
-FN:91,_ZN8pkgCache11PkgIteratorC1Ev
-FN:105,_ZN8pkgCache11VerIteratorppEi
-FN:106,_ZN8pkgCache11VerIteratorppEv
-FN:107,_ZNK8pkgCache11VerIterator3endEv
-FN:112,_ZNK8pkgCache11VerIteratorneERKS0_
-FN:124,_ZNK8pkgCache11VerIterator6VerStrEv
-FN:141,_ZN8pkgCache11VerIteratorC1Ev
-FN:142,_ZN8pkgCache11VerIteratorC1ERS_PNS_7VersionE
-FN:417,_ZNK8pkgCache11PkgIterator11VersionListEv
-FN:46,_ZN8pkgCache11PkgIteratorC1ERS_
-DA:46,0
-DA:48,0
-DA:49,0
-DA:50,0
-DA:59,0
-DA:66,0
-DA:67,0
-DA:91,0
-DA:105,0
-DA:106,0
-DA:107,0
-DA:112,0
-DA:124,0
-DA:141,0
-DA:142,0
-DA:143,0
-DA:145,0
-DA:146,0
-DA:147,0
-DA:417,0
-DA:418,0
-BA:59,0
-BA:59,0
-BA:59,0
-BA:59,0
-BA:105,0
-BA:105,0
-BA:107,0
-BA:107,0
-BA:107,0
-BA:107,0
-BA:124,0
-BA:124,0
-BA:145,0
-BA:145,0
-LF:21
-LH:0
-end_of_record
-SF:/usr/include/apt-pkg/depcache.h
-FN:242,_ZNK11pkgDepCache10StateCache6DeleteEv
-FN:243,_ZNK11pkgDepCache10StateCache4KeepEv
-FN:248,_ZNK11pkgDepCache10StateCache9NowBrokenEv
-FN:250,_ZNK11pkgDepCache10StateCache10InstBrokenEv
-FN:252,_ZNK11pkgDepCache10StateCache7InstallEv
-FN:342,_ZN11pkgDepCacheixERKN8pkgCache11PkgIteratorE
-DA:242,0
-DA:243,0
-DA:248,0
-DA:250,0
-DA:252,0
-DA:342,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/apt-pkg/error.h
-FN:84,_ZN11GlobalError5emptyEv
-DA:84,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/apt-pkg/pkgcache.h
-FN:326,_ZN8pkgCache8PkgBeginEv
-DA:326,0
-DA:327,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaISsED2Ev
-FN:106,_ZNSaIN3ept4core7package6ActionEED2Ev
-FN:98,_ZNSaISsEC2Ev
-FN:98,_ZNSaIN3ept4core7package6ActionEEC2Ev
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,1
-DA:100,0
-DA:101,0
-DA:106,1
-DA:118,0
-DA:119,0
-LF:6
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:277,_ZNKSs7_M_dataEv
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:612,_ZNKSs6lengthEv
-FN:1544,_ZNKSs4dataEv
-FN:1534,_ZNKSs5c_strEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:392,_ZNSs10_S_compareEjj
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:1941,_ZNKSs7compareERKSs
-FN:2312,_ZStleIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:501,_ZNSsaSERKSs
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:835,_ZNSs6appendEPKc
-FN:2121,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-FN:2188,_ZSteqIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_EPKS3_
-FN:2225,_ZStneIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_EPKS3_
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:392,0
-DA:394,0
-DA:401,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:612,0
-DA:613,0
-DA:686,0
-DA:687,0
-DA:835,0
-DA:838,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:1941,0
-DA:1943,0
-DA:1944,0
-DA:1945,0
-DA:1947,0
-DA:1948,0
-DA:1949,0
-DA:1950,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2121,0
-DA:2123,0
-DA:2124,0
-DA:2125,0
-DA:2188,0
-DA:2189,0
-DA:2225,0
-DA:2226,0
-DA:2312,0
-DA:2313,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-BA:1948,0
-BA:1948,0
-LF:84
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:257,0
-DA:258,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb0EE3__bES7_
-FN:188,_ZSt3minIjERKT_S2_S2_
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb0EE3__bES6_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb1EE3__bES7_
-FN:268,_ZNSt12__niter_baseISt16ostream_iteratorISscSt11char_traitsIcEELb0EE3__bES3_
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPN3ept4core7package6ActionESt6vectorIS5_SaIS5_EEEELb0EE3__bESA_
-FN:286,_ZNSt12__miter_baseIPSsLb0EE3__bES0_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb1EE3__bES6_
-FN:268,_ZNSt12__niter_baseISt20back_insert_iteratorISt6vectorISsSaISsEEELb0EE3__bES4_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPN3ept4core7package6ActionESt6vectorIS5_SaIS5_EEEELb1EE3__bESA_
-FN:286,_ZNSt12__miter_baseIPN3ept4core7package6ActionELb0EE3__bES4_
-FN:268,_ZNSt12__niter_baseIPSsLb0EE3__bES0_
-FN:268,_ZNSt12__niter_baseIPN3ept4core7package6ActionELb0EE3__bES4_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPN3ept4core7package6ActionES7_EET0_T_S9_S8_
-FN:385,_ZSt13__copy_move_aILb0EPN3ept4core7package6ActionES4_ET1_T0_S6_S5_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPN3ept4core7package6ActionESt6vectorIS5_SaIS5_EEEESA_ET1_T0_SC_SB_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPN3ept4core7package6ActionESt6vectorIS5_SaIS5_EEEESA_ET0_T_SC_SB_
-FN:539,_ZNSt20__copy_move_backwardILb0ELb0ESt26random_access_iterator_tagE13__copy_move_bIPN3ept4core7package6ActionES7_EET0_T_S9_S8_
-FN:579,_ZSt22__copy_move_backward_aILb0EPN3ept4core7package6ActionES4_ET1_T0_S6_S5_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPN3ept4core7package6ActionES4_ET1_T0_S6_S5_
-FN:624,_ZSt13copy_backwardIPN3ept4core7package6ActionES4_ET0_T_S6_S5_
-FN:539,_ZNSt20__copy_move_backwardILb0ELb0ESt26random_access_iterator_tagE13__copy_move_bIPSsS3_EET0_T_S5_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0EPSsS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPSsS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardIPSsS0_ET0_T_S2_S1_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET1_T0_SA_S9_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET0_T_SA_S9_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPKSsSt16ostream_iteratorISscSt11char_traitsIcEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPKSsSt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_SD_SC_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET0_T_SD_SC_
-DA:188,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:210,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:268,0
-DA:269,0
-DA:276,0
-DA:277,0
-DA:286,0
-DA:287,0
-DA:337,0
-DA:340,0
-DA:342,0
-DA:343,0
-DA:344,0
-DA:346,0
-DA:385,0
-DA:393,0
-DA:396,0
-DA:430,0
-DA:435,0
-DA:456,0
-DA:466,0
-DA:539,0
-DA:542,0
-DA:543,0
-DA:544,0
-DA:579,0
-DA:587,0
-DA:592,0
-DA:597,0
-DA:602,0
-DA:624,0
-DA:636,0
-BA:193,0
-BA:193,0
-BA:215,0
-BA:215,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:542,0
-BA:542,0
-BA:542,0
-BA:542,0
-LF:38
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:87,_ZSt8_DestroyIN3ept4core7package6ActionEEvPT_
-FN:97,_ZSt8_DestroyIPN3ept4core7package6ActionEEvT_S5_
-FN:126,_ZSt8_DestroyIPN3ept4core7package6ActionES3_EvT_S5_RSaIT0_E
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-DA:87,1
-DA:88,1
-DA:97,2
-DA:101,3
-DA:103,1
-DA:104,2
-DA:126,2
-DA:128,2
-DA:129,2
-BA:101,2
-BA:101,2
-BA:101,0
-BA:101,0
-LF:9
-LH:9
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:680,_ZN9__gnu_cxx17__normal_iteratorIPN3ept4core7package6ActionESt6vectorIS4_SaIS4_EEEC1Ev
-FN:703,_ZN9__gnu_cxx17__normal_iteratorIPN3ept4core7package6ActionESt6vectorIS4_SaIS4_EEEppEv
-FN:699,_ZNK9__gnu_cxx17__normal_iteratorIPN3ept4core7package6ActionESt6vectorIS4_SaIS4_EEEptEv
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPN3ept4core7package6ActionESt6vectorIS4_SaIS4_EEEdeEv
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEdeEv
-FN:398,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEC1ERS2_
-FN:456,_ZSt13back_inserterISt6vectorISsSaISsEEESt20back_insert_iteratorIT_ERS4_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEC1ERKS2_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPN3ept4core7package6ActionESt6vectorIS4_SaIS4_EEEC1ERKS5_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPN3ept4core7package6ActionESt6vectorIS4_SaIS4_EEE4baseEv
-FN:781,_ZN9__gnu_cxxneIPN3ept4core7package6ActionESt6vectorIS4_SaIS4_EEEEbRKNS_17__normal_iteratorIT_T0_EESE_
-FN:735,_ZNK9__gnu_cxx17__normal_iteratorIPN3ept4core7package6ActionESt6vectorIS4_SaIS4_EEEplERKi
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEE4baseEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEC1ERKS1_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKN3ept4core7package6ActionESt6vectorIS4_SaIS4_EEEC1ERKS6_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKN3ept4core7package6ActionESt6vectorIS4_SaIS4_EEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKN3ept4core7package6ActionESt6vectorIS4_SaIS4_EEEEbRKNS_17__normal_iteratorIT_T0_EESF_
-FN:429,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEdeEv
-FN:434,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEppEv
-FN:412,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEaSERKSs
-DA:398,0
-DA:412,0
-DA:414,0
-DA:415,0
-DA:429,0
-DA:430,0
-DA:434,0
-DA:435,0
-DA:456,0
-DA:457,0
-DA:680,3
-DA:683,22
-DA:695,0
-DA:696,0
-DA:699,3
-DA:700,3
-DA:703,1
-DA:705,1
-DA:706,1
-DA:735,2
-DA:736,2
-DA:747,24
-DA:748,24
-DA:769,1
-DA:770,1
-DA:781,10
-DA:782,10
-LF:27
-LH:15
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,0
-DA:166,0
-DA:167,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyIPN3ept4core7package6ActionES6_EET0_T_S8_S7_
-FN:113,_ZSt18uninitialized_copyIPN3ept4core7package6ActionES4_ET0_T_S6_S5_
-FN:261,_ZSt22__uninitialized_copy_aIPN3ept4core7package6ActionES4_S3_ET0_T_S6_S5_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPN3ept4core7package6ActionES4_SaIS3_EET0_T_S7_S6_RT1_
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyIPSsS2_EET0_T_S4_S3_
-FN:113,_ZSt18uninitialized_copyIPSsS0_ET0_T_S2_S1_
-FN:261,_ZSt22__uninitialized_copy_aIPSsS0_SsET0_T_S2_S1_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPSsS0_SaISsEET0_T_S3_S2_RT1_
-DA:73,2
-DA:75,2
-DA:78,2
-DA:79,0
-DA:81,2
-DA:83,0
-DA:85,0
-DA:86,0
-DA:113,2
-DA:122,2
-DA:261,2
-DA:262,2
-DA:268,2
-DA:272,2
-BA:78,1
-BA:78,2
-BA:78,0
-BA:78,0
-BA:79,0
-BA:79,0
-BA:79,0
-BA:79,0
-LF:14
-LH:10
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:404,_ZNKSt6vectorISsSaISsEE3endEv
-FN:386,_ZNKSt6vectorISsSaISsEE5beginEv
-FN:484,_ZNKSt6vectorISsSaISsEE4sizeEv
-FN:101,_ZNKSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:377,_ZNSt6vectorIN3ept4core7package6ActionESaIS3_EE5beginEv
-FN:395,_ZNSt6vectorIN3ept4core7package6ActionESaIS3_EE3endEv
-FN:97,_ZNSt12_Vector_baseIN3ept4core7package6ActionESaIS3_EE19_M_get_Tp_allocatorEv
-FN:395,_ZNSt6vectorISsSaISsEE3endEv
-FN:377,_ZNSt6vectorISsSaISsEE5beginEv
-FN:526,_ZNKSt6vectorISsSaISsEE5emptyEv
-FN:404,_ZNKSt6vectorIN3ept4core7package6ActionESaIS3_EE3endEv
-FN:386,_ZNKSt6vectorIN3ept4core7package6ActionESaIS3_EE5beginEv
-FN:526,_ZNKSt6vectorIN3ept4core7package6ActionESaIS3_EE5emptyEv
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:484,_ZNKSt6vectorIN3ept4core7package6ActionESaIS3_EE4sizeEv
-FN:79,_ZNSt12_Vector_baseIN3ept4core7package6ActionESaIS3_EE12_Vector_implD1Ev
-FN:84,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseISsSaISsEEC2Ev
-FN:213,_ZNSt6vectorISsSaISsEEC1Ev
-FN:489,_ZNKSt6vectorISsSaISsEE8max_sizeEv
-FN:101,_ZNKSt12_Vector_baseIN3ept4core7package6ActionESaIS3_EE19_M_get_Tp_allocatorEv
-FN:489,_ZNKSt6vectorIN3ept4core7package6ActionESaIS3_EE8max_sizeEv
-FN:84,_ZNSt12_Vector_baseIN3ept4core7package6ActionESaIS3_EE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseIN3ept4core7package6ActionESaIS3_EEC2Ev
-FN:213,_ZNSt6vectorIN3ept4core7package6ActionESaIS3_EEC1Ev
-FN:147,_ZNSt12_Vector_baseIN3ept4core7package6ActionESaIS3_EE13_M_deallocateEPS3_j
-FN:135,_ZNSt12_Vector_baseIN3ept4core7package6ActionESaIS3_EED2Ev
-FN:299,_ZNSt6vectorIN3ept4core7package6ActionESaIS3_EED1Ev
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-FN:1075,_ZNKSt6vectorIN3ept4core7package6ActionESaIS3_EE12_M_check_lenEjPKc
-FN:1075,_ZNKSt6vectorISsSaISsEE12_M_check_lenEjPKc
-FN:143,_ZNSt12_Vector_baseIN3ept4core7package6ActionESaIS3_EE11_M_allocateEj
-FN:686,_ZNSt6vectorIN3ept4core7package6ActionESaIS3_EE9push_backERKS3_
-FN:143,_ZNSt12_Vector_baseISsSaISsEE11_M_allocateEj
-FN:686,_ZNSt6vectorISsSaISsEE9push_backERKSs
-DA:79,1
-DA:84,1
-DA:85,1
-DA:86,1
-DA:97,4
-DA:98,4
-DA:101,2
-DA:102,2
-DA:108,1
-DA:109,1
-DA:135,1
-DA:136,1
-DA:137,1
-DA:143,1
-DA:144,1
-DA:147,2
-DA:149,2
-DA:150,1
-DA:151,2
-DA:213,1
-DA:214,1
-DA:299,1
-DA:300,1
-DA:301,1
-DA:377,4
-DA:378,4
-DA:386,1
-DA:387,1
-DA:395,14
-DA:396,14
-DA:404,1
-DA:405,1
-DA:484,4
-DA:485,4
-DA:489,2
-DA:490,2
-DA:526,1
-DA:527,1
-DA:686,3
-DA:688,3
-DA:690,2
-DA:691,2
-DA:694,1
-DA:695,3
-DA:1075,1
-DA:1077,1
-DA:1078,0
-DA:1080,1
-DA:1081,1
-BA:144,2
-BA:144,1
-BA:144,0
-BA:144,0
-BA:149,2
-BA:149,2
-BA:149,0
-BA:149,0
-BA:688,2
-BA:688,2
-BA:688,0
-BA:688,0
-BA:1077,1
-BA:1077,2
-BA:1077,0
-BA:1077,0
-BA:1081,2
-BA:1081,1
-BA:1081,1
-BA:1081,2
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-LF:49
-LH:48
-end_of_record
-SF:/usr/include/c++/4.3/bits/stream_iterator.h
-FN:181,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERSoPKc
-FN:185,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERKS2_
-FN:202,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEdeEv
-FN:206,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEppEv
-FN:191,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEaSERKSs
-DA:181,0
-DA:182,0
-DA:185,0
-DA:186,0
-DA:191,0
-DA:196,0
-DA:197,0
-DA:198,0
-DA:202,0
-DA:203,0
-DA:206,0
-DA:207,0
-BA:197,0
-BA:197,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/vector.tcc
-FN:121,_ZNSt6vectorIN3ept4core7package6ActionESaIS3_EE5eraseEN9__gnu_cxx17__normal_iteratorIPS3_S5_EE
-FN:283,_ZNSt6vectorIN3ept4core7package6ActionESaIS3_EE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPS3_S5_EERKS3_
-FN:283,_ZNSt6vectorISsSaISsEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPSsS1_EERKSs
-DA:121,2
-DA:123,2
-DA:124,0
-DA:125,2
-DA:126,2
-DA:127,2
-DA:283,1
-DA:286,1
-DA:288,0
-DA:291,0
-DA:293,0
-DA:295,0
-DA:299,0
-DA:307,1
-DA:308,1
-DA:309,1
-DA:316,1
-DA:321,1
-DA:323,1
-DA:324,1
-DA:330,0
-DA:332,0
-DA:333,0
-DA:334,0
-DA:336,1
-DA:338,1
-DA:341,1
-DA:342,1
-DA:343,1
-DA:345,1
-BA:123,1
-BA:123,2
-BA:286,1
-BA:286,2
-BA:286,0
-BA:286,0
-LF:30
-LH:20
-end_of_record
-SF:/usr/include/c++/4.3/exception
-FN:59,_ZNSt9exceptionC2Ev
-FN:57,_ZNSt9exceptionC1ERKS_
-DA:57,0
-DA:59,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIN3ept4core7package6ActionEED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISsE8max_sizeEv
-FN:101,_ZNK9__gnu_cxx13new_allocatorIN3ept4core7package6ActionEE8max_sizeEv
-FN:69,_ZN9__gnu_cxx13new_allocatorIN3ept4core7package6ActionEEC2Ev
-FN:118,_ZN9__gnu_cxx13new_allocatorIN3ept4core7package6ActionEE7destroyEPS4_
-FN:97,_ZN9__gnu_cxx13new_allocatorIN3ept4core7package6ActionEE10deallocateEPS4_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-FN:107,_ZN9__gnu_cxx13new_allocatorISsE9constructEPSsRKSs
-FN:107,_ZN9__gnu_cxx13new_allocatorIN3ept4core7package6ActionEE9constructEPS4_RKS4_
-FN:87,_ZN9__gnu_cxx13new_allocatorIN3ept4core7package6ActionEE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorISsE8allocateEjPKv
-DA:69,1
-DA:71,0
-DA:76,1
-DA:87,1
-DA:89,1
-DA:90,0
-DA:92,1
-DA:97,1
-DA:98,1
-DA:101,3
-DA:102,3
-DA:107,3
-DA:108,3
-DA:118,2
-BA:89,1
-BA:89,2
-BA:89,0
-BA:89,0
-BA:108,0
-BA:108,0
-BA:108,2
-BA:108,1
-LF:14
-LH:12
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/istream
-FN:585,_ZNSiC2Ev
-FN:105,_ZNSiD2Ev
-FN:804,_ZNSdC2Ev
-FN:801,_ZNSdD2Ev
-DA:105,0
-DA:106,0
-DA:585,0
-DA:586,0
-DA:587,0
-DA:801,0
-DA:804,0
-DA:805,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-DA:95,0
-DA:112,0
-DA:117,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:509,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:536,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:555,_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-DA:509,0
-DA:510,0
-DA:511,0
-DA:536,0
-DA:537,0
-DA:555,0
-DA:556,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-LF:25
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt/record.h
-DA:86,1
-BA:86,1
-BA:86,2
-LF:1
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt.h
-FN:139,_ZN3ept4core11AptDatabaseC1Ev
-FN:209,_ZN3ept4core11AptDatabase10invalidateEv
-FN:331,_ZN3ept4core11AptDatabaseD1Ev
-DA:139,0
-DA:140,0
-DA:141,0
-DA:142,0
-DA:143,0
-DA:144,0
-DA:145,0
-DA:146,0
-DA:209,0
-DA:210,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:218,0
-DA:219,0
-DA:220,0
-DA:331,0
-DA:332,0
-DA:333,0
-BA:210,0
-BA:210,0
-BA:214,0
-BA:214,0
-BA:216,0
-BA:216,0
-BA:218,0
-BA:218,0
-LF:21
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/expression.test.h
-FN:32,_ZN14TestExpressionC1Ev
-FN:35,_ZN14TestExpression2_1Ev
-FN:32,_ZN14TestExpressionD1Ev
-DA:32,2
-DA:35,1
-DA:37,1
-DA:38,1
-DA:39,2
-DA:40,2
-DA:42,2
-DA:44,2
-DA:45,2
-DA:47,2
-DA:48,2
-DA:50,2
-DA:51,2
-DA:53,2
-DA:54,2
-DA:56,2
-DA:57,2
-DA:59,2
-DA:60,2
-DA:62,2
-DA:63,2
-DA:65,2
-DA:66,2
-DA:68,2
-DA:69,2
-DA:71,2
-DA:72,2
-DA:74,2
-DA:75,2
-DA:77,2
-DA:78,2
-DA:79,1
-LF:32
-LH:32
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/maint/path.h
-FN:76,_ZN3ept7debtags4Path24OverrideDebtagsSourceDirC1ERKSs
-FN:80,_ZN3ept7debtags4Path24OverrideDebtagsSourceDirD1Ev
-FN:86,_ZN3ept7debtags4Path23OverrideDebtagsIndexDirC1ERKSs
-FN:90,_ZN3ept7debtags4Path23OverrideDebtagsIndexDirD1Ev
-FN:96,_ZN3ept7debtags4Path28OverrideDebtagsUserSourceDirC1ERKSs
-FN:100,_ZN3ept7debtags4Path28OverrideDebtagsUserSourceDirD1Ev
-FN:106,_ZN3ept7debtags4Path27OverrideDebtagsUserIndexDirC1ERKSs
-FN:110,_ZN3ept7debtags4Path27OverrideDebtagsUserIndexDirD1Ev
-DA:76,0
-DA:78,0
-DA:79,0
-DA:80,0
-DA:86,0
-DA:88,0
-DA:89,0
-DA:90,0
-DA:96,0
-DA:98,0
-DA:99,0
-DA:100,0
-DA:106,0
-DA:108,0
-DA:109,0
-DA:110,0
-LF:16
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/tag.h
-FN:175,_ZN3ept7debtags3TagD1Ev
-FN:179,_ZNK3ept7debtags3TagltERKS1_
-DA:175,0
-DA:179,0
-LF:2
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/vocabulary.h
-FN:114,_ZNK3ept7debtags10Vocabulary8TagIndex2idERKSs
-FN:203,_ZNK3ept7debtags10Vocabulary9tagByNameERKSs
-DA:114,0
-DA:203,0
-LF:2
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/test.h
-FN:12,_ZN18AptTestEnvironmentC2Ev
-FN:10,_ZN18AptTestEnvironmentD2Ev
-FN:30,_ZN22DebtagsTestEnvironmentC2Ev
-FN:24,_ZN22DebtagsTestEnvironmentD2Ev
-DA:10,0
-DA:12,0
-DA:13,0
-DA:14,0
-DA:15,0
-DA:16,0
-DA:17,0
-DA:18,0
-DA:19,0
-DA:20,0
-DA:21,0
-DA:24,0
-DA:30,0
-DA:34,0
-DA:35,0
-LF:15
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:13,_ZN8LocationD1Ev
-FN:13,_ZN8LocationC1ERKS_
-FN:17,_ZN8LocationC1EPKciSs
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:52,_ZlsIPKcER12AssertFailedS3_T_
-FN:52,_ZlsIjER12AssertFailedS1_T_
-FN:41,_ZN12AssertFailedD1Ev
-FN:67,_Z12assert_eq_fnIjjEv8LocationT_T0_
-FN:59,_Z9assert_fnIbEv8LocationT_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:59,0
-DA:61,0
-DA:62,0
-DA:64,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:75,0
-BA:42,0
-BA:42,0
-BA:61,0
-BA:61,0
-BA:69,0
-BA:69,0
-LF:26
-LH:0
-end_of_record
-SF:/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_expression.cpp
-FN:3,_Z41__static_initialization_and_destruction_0ii
-FN:3,_GLOBAL__I_ept_test_generated__home_mornfall_dev_pkg_ept_work_ept_debtags_expression.cpp
-FN:3,_Z17run_Expression__1v
-DA:3,4
-BA:3,2
-BA:3,1
-BA:3,2
-BA:3,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeIN3ept7debtags3TagEEED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:98,_ZNSaISt13_Rb_tree_nodeIN3ept7debtags3TagEEEC2Ev
-FN:106,_ZNSaIN3ept7debtags3TagEED1Ev
-FN:104,_ZNSaIN3ept7debtags3TagEEC1ISt13_Rb_tree_nodeIS1_EEERKSaIT_E
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:104,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:7
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:1534,_ZNKSs5c_strEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-LF:53
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_function.h
-FN:469,_ZNKSt9_IdentityIN3ept7debtags3TagEEclERKS2_
-FN:229,_ZNKSt4lessIN3ept7debtags3TagEEclERKS2_S5_
-DA:229,0
-DA:230,0
-DA:469,0
-DA:470,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:166,0
-DA:167,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_pair.h
-FN:88,_ZNSt4pairISt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEbEC1ERKS4_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIN3ept7debtags3TagEEbEC1ERKS4_RKb
-DA:88,0
-DA:89,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_set.h
-FN:336,_ZNKSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EE4sizeEv
-FN:141,_ZNSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EEC1Ev
-FN:93,_ZNSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EED1Ev
-FN:378,_ZNSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EE6insertERKS2_
-DA:93,0
-DA:141,0
-DA:142,0
-DA:336,0
-DA:337,0
-DA:378,0
-DA:381,0
-DA:382,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_tree.h
-FN:452,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_M_beginEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEC1ERKSt17_Rb_tree_iteratorIS2_E
-FN:641,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE4sizeEv
-FN:398,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13_Rb_tree_implIS6_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:463,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE6_M_endEv
-FN:168,_ZNSt17_Rb_tree_iteratorIN3ept7debtags3TagEEC1EPSt13_Rb_tree_nodeIS2_E
-FN:596,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE5beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorIN3ept7debtags3TagEEeqERKS3_
-FN:347,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE21_M_get_Node_allocatorEv
-FN:415,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13_Rb_tree_implIS6_Lb0EE13_M_initializeEv
-FN:471,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_S_valueEPKSt13_Rb_tree_nodeIS2_E
-FN:475,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE6_S_keyEPKSt13_Rb_tree_nodeIS2_E
-FN:495,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE6_S_keyEPKSt18_Rb_tree_node_base
-FN:403,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13_Rb_tree_implIS6_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EEC1Ev
-FN:351,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13get_allocatorEv
-FN:360,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS2_E
-FN:388,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS2_E
-FN:936,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_M_eraseEPSt13_Rb_tree_nodeIS2_E
-FN:584,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EED1Ev
-FN:195,_ZNSt17_Rb_tree_iteratorIN3ept7debtags3TagEEmmEv
-FN:356,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE14_M_create_nodeERKS2_
-FN:846,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE10_M_insert_EPKSt18_Rb_tree_node_baseSB_RKS2_
-FN:1133,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE16_M_insert_uniqueERKS2_
-DA:168,0
-DA:169,0
-DA:195,0
-DA:197,0
-DA:198,0
-DA:210,0
-DA:211,0
-DA:243,0
-DA:244,0
-DA:347,0
-DA:348,0
-DA:351,0
-DA:352,0
-DA:356,0
-DA:357,0
-DA:360,0
-DA:361,0
-DA:364,0
-DA:366,0
-DA:368,0
-DA:369,0
-DA:371,0
-DA:372,0
-DA:374,0
-DA:388,0
-DA:390,0
-DA:391,0
-DA:392,0
-DA:398,0
-DA:403,0
-DA:405,0
-DA:406,0
-DA:415,0
-DA:417,0
-DA:418,0
-DA:419,0
-DA:420,0
-DA:421,0
-DA:452,0
-DA:453,0
-DA:463,0
-DA:464,0
-DA:471,0
-DA:472,0
-DA:475,0
-DA:476,0
-DA:479,0
-DA:480,0
-DA:487,0
-DA:488,0
-DA:495,0
-DA:496,0
-DA:499,0
-DA:500,0
-DA:562,0
-DA:584,0
-DA:585,0
-DA:596,0
-DA:599,0
-DA:641,0
-DA:642,0
-DA:846,0
-DA:850,0
-DA:852,0
-DA:854,0
-DA:857,0
-DA:858,0
-DA:936,0
-DA:939,0
-DA:941,0
-DA:942,0
-DA:943,0
-DA:944,0
-DA:946,0
-DA:1133,0
-DA:1135,0
-DA:1136,0
-DA:1137,0
-DA:1138,0
-DA:1140,0
-DA:1141,0
-DA:1142,0
-DA:1144,0
-DA:1145,0
-DA:1147,0
-DA:1148,0
-DA:1150,0
-DA:1152,0
-DA:1153,0
-DA:1154,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:939,0
-BA:939,0
-BA:1138,0
-BA:1138,0
-BA:1142,0
-BA:1142,0
-BA:1145,0
-BA:1145,0
-BA:1147,0
-BA:1147,0
-BA:1152,0
-BA:1152,0
-LF:90
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:118,_ZN9__gnu_cxx13new_allocatorIN3ept7debtags3TagEE7destroyEPS3_
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIN3ept7debtags3TagEED2Ev
-FN:107,_ZN9__gnu_cxx13new_allocatorIN3ept7debtags3TagEE9constructEPS3_RKS3_
-FN:69,_ZN9__gnu_cxx13new_allocatorIN3ept7debtags3TagEEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEE8max_sizeEv
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEE10deallocateEPS5_j
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEE8allocateEjPKv
-DA:69,0
-DA:71,0
-DA:76,0
-DA:87,0
-DA:89,0
-DA:90,0
-DA:92,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:107,0
-DA:108,0
-DA:118,0
-BA:89,0
-BA:89,0
-BA:108,0
-BA:108,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-DA:105,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:195,_ZNSolsEj
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-DA:95,0
-DA:112,0
-DA:117,0
-DA:195,0
-DA:199,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/expression.h
-FN:48,_ZN7tagcoll14ExpressionImpl3refEv
-FN:52,_ZN7tagcoll14ExpressionImpl5unrefEv
-FN:100,_ZN7tagcoll10ExpressionD1Ev
-FN:102,_ZN7tagcoll10ExpressionaSERKS0_
-DA:48,10
-DA:52,22
-DA:100,12
-DA:102,10
-DA:104,10
-DA:105,10
-DA:106,10
-DA:107,10
-DA:108,10
-DA:109,10
-BA:100,2
-BA:100,2
-BA:100,2
-BA:100,1
-BA:104,2
-BA:104,1
-BA:106,2
-BA:106,1
-BA:106,2
-BA:106,1
-BA:106,2
-BA:106,1
-BA:107,2
-BA:107,1
-LF:10
-LH:10
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt/record.h
-DA:86,1
-BA:86,1
-BA:86,2
-LF:1
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt.h
-FN:139,_ZN3ept4core11AptDatabaseC1Ev
-FN:209,_ZN3ept4core11AptDatabase10invalidateEv
-FN:331,_ZN3ept4core11AptDatabaseD1Ev
-DA:139,0
-DA:140,0
-DA:141,0
-DA:142,0
-DA:143,0
-DA:144,0
-DA:145,0
-DA:146,0
-DA:209,0
-DA:210,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:218,0
-DA:219,0
-DA:220,0
-DA:331,0
-DA:332,0
-DA:333,0
-BA:210,0
-BA:210,0
-BA:214,0
-BA:214,0
-BA:216,0
-BA:216,0
-BA:218,0
-BA:218,0
-LF:21
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/maint/path.h
-FN:76,_ZN3ept7debtags4Path24OverrideDebtagsSourceDirC1ERKSs
-FN:80,_ZN3ept7debtags4Path24OverrideDebtagsSourceDirD1Ev
-FN:86,_ZN3ept7debtags4Path23OverrideDebtagsIndexDirC1ERKSs
-FN:90,_ZN3ept7debtags4Path23OverrideDebtagsIndexDirD1Ev
-FN:96,_ZN3ept7debtags4Path28OverrideDebtagsUserSourceDirC1ERKSs
-FN:100,_ZN3ept7debtags4Path28OverrideDebtagsUserSourceDirD1Ev
-FN:106,_ZN3ept7debtags4Path27OverrideDebtagsUserIndexDirC1ERKSs
-FN:110,_ZN3ept7debtags4Path27OverrideDebtagsUserIndexDirD1Ev
-DA:76,31
-DA:78,31
-DA:79,31
-DA:80,31
-DA:86,31
-DA:88,31
-DA:89,31
-DA:90,31
-DA:96,31
-DA:98,31
-DA:99,31
-DA:100,31
-DA:106,31
-DA:108,31
-DA:109,31
-DA:110,31
-LF:16
-LH:16
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/maint/vocabularymerger.h
-FN:41,_ZN3ept7debtags16VocabularyMerger12FacetIndexerC1ERS1_
-FN:51,_ZN3ept7debtags16VocabularyMerger10TagIndexerC1ERS1_
-FN:42,_ZN3ept7debtags16VocabularyMerger12FacetIndexerD1Ev
-FN:57,_ZN3ept7debtags16VocabularyMerger7TagDataD1Ev
-FN:68,_ZN3ept7debtags16VocabularyMerger9FacetDataD1Ev
-FN:90,_ZN3ept7debtags16VocabularyMergerC1Ev
-FN:52,_ZN3ept7debtags16VocabularyMerger10TagIndexerD1Ev
-FN:34,_ZN3ept7debtags16VocabularyMergerD1Ev
-DA:34,7
-DA:41,7
-DA:42,7
-DA:51,7
-DA:52,7
-DA:57,4980
-DA:68,248
-DA:90,7
-BA:42,1
-BA:42,2
-BA:52,1
-BA:52,2
-LF:8
-LH:8
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/tag.h
-FN:70,_ZN3ept7debtags5FacetD1Ev
-FN:72,_ZNK3ept7debtags5FaceteqERKS1_
-FN:74,_ZNK3ept7debtags5FacetltERKS1_
-FN:79,_ZNK3ept7debtags5FacetcvbEv
-FN:135,_ZNK3ept7debtags5Facet2idEv
-FN:174,_ZN3ept7debtags3TagC1Ev
-FN:175,_ZN3ept7debtags3TagD1Ev
-FN:177,_ZNK3ept7debtags3TageqERKS1_
-FN:178,_ZNK3ept7debtags3TagneERKS1_
-FN:179,_ZNK3ept7debtags3TagltERKS1_
-FN:181,_ZNK3ept7debtags3TagcvbEv
-FN:242,_ZNK3ept7debtags3Tag2idEv
-DA:70,265
-DA:72,29
-DA:74,600
-DA:79,0
-DA:135,58
-DA:174,2
-DA:175,2229812
-DA:177,1228
-DA:178,5
-DA:179,2300524
-DA:181,1
-DA:242,106853
-LF:12
-LH:11
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/vocabulary.h
-FN:64,_ZNK3ept7debtags10Vocabulary10FacetIndex4sizeEv
-FN:51,_ZNK3ept7debtags10Vocabulary10FacetIndex4itemEi
-FN:70,_ZNK3ept7debtags10Vocabulary10FacetIndex8firsttagEi
-FN:72,_ZNK3ept7debtags10Vocabulary10FacetIndex7lasttagEi
-FN:103,_ZNK3ept7debtags10Vocabulary8TagIndex4sizeEv
-FN:149,_ZNK3ept7debtags10Vocabulary7hasDataEv
-FN:208,_ZNK3ept7debtags10Vocabulary6facetsEv
-FN:219,_ZNK3ept7debtags10Vocabulary4tagsEv
-FN:230,_ZNK3ept7debtags10Vocabulary4tagsEi
-FN:165,_ZNK3ept7debtags10Vocabulary6hasTagERKSs
-FN:114,_ZNK3ept7debtags10Vocabulary8TagIndex2idERKSs
-FN:203,_ZNK3ept7debtags10Vocabulary9tagByNameERKSs
-FN:77,_ZNK3ept7debtags10Vocabulary10FacetIndex2idERKSs
-FN:198,_ZNK3ept7debtags10Vocabulary11facetByNameERKSs
-FN:238,_ZNK3ept7debtags10Vocabulary4tagsERKSs
-FN:157,_ZNK3ept7debtags10Vocabulary8hasFacetERKSs
-DA:51,2393
-DA:53,2393
-DA:54,2392
-DA:55,1
-DA:64,2501
-DA:70,91
-DA:72,2043
-DA:77,7
-DA:103,1327864
-DA:114,105755
-DA:149,1
-DA:157,2
-DA:159,2
-DA:165,622
-DA:167,622
-DA:198,4
-DA:203,105755
-DA:208,4
-DA:210,4
-DA:211,91
-DA:212,87
-DA:213,0
-DA:219,6
-DA:221,6
-DA:222,3106
-DA:223,3100
-DA:224,0
-DA:230,91
-DA:232,91
-DA:233,2044
-DA:234,1953
-DA:235,0
-DA:238,3
-DA:240,3
-BA:53,2
-BA:53,2
-BA:53,2
-BA:53,1
-BA:53,2
-BA:53,2
-BA:64,2
-BA:64,2
-BA:70,2
-BA:70,2
-BA:72,2
-BA:72,1
-BA:103,2
-BA:103,2
-BA:211,2
-BA:211,2
-BA:222,2
-BA:222,2
-BA:233,2
-BA:233,2
-BA:233,2
-BA:233,2
-BA:233,2
-BA:233,2
-LF:34
-LH:31
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/vocabulary.test.h
-FN:44,_ZN14TestVocabulary4tagsEv
-FN:46,_ZN14TestVocabulary2_1Ev
-FN:42,_ZN14TestVocabularyC1Ev
-FN:42,_ZN14TestVocabularyD1Ev
-FN:299,_ZN14TestVocabulary3_21Ev
-FN:259,_ZN14TestVocabulary3_19Ev
-FN:57,_ZN14TestVocabulary2_3Ev
-FN:63,_ZN14TestVocabulary2_4Ev
-FN:243,_ZN14TestVocabulary3_18Ev
-FN:231,_ZN14TestVocabulary3_17Ev
-FN:219,_ZN14TestVocabulary3_16Ev
-FN:168,_ZN14TestVocabulary3_13Ev
-FN:202,_ZN14TestVocabulary3_15Ev
-FN:185,_ZN14TestVocabulary3_14Ev
-FN:152,_ZN14TestVocabulary3_12Ev
-FN:137,_ZN14TestVocabulary3_11Ev
-FN:110,_ZN14TestVocabulary2_8Ev
-FN:103,_ZN14TestVocabulary2_7Ev
-FN:79,_ZN14TestVocabulary2_5Ev
-FN:51,_ZN14TestVocabulary2_2Ev
-FN:123,_ZN14TestVocabulary2_9Ev
-FN:94,_ZN14TestVocabulary2_6Ev
-DA:42,38
-DA:44,1298
-DA:46,1
-DA:48,1
-DA:49,1
-DA:51,1
-DA:53,1
-DA:54,2
-DA:55,1
-DA:57,1
-DA:59,1
-DA:60,2
-DA:61,1
-DA:63,1
-DA:65,1
-DA:66,2
-DA:67,2
-DA:68,2
-DA:69,2
-DA:70,2
-DA:71,2
-DA:72,2
-DA:73,2
-DA:74,2
-DA:75,2
-DA:76,2
-DA:77,1
-DA:79,1
-DA:81,1
-DA:82,2
-DA:83,2
-DA:84,1
-DA:85,2
-DA:86,2
-DA:87,2
-DA:88,2
-DA:89,2
-DA:90,2
-DA:91,2
-DA:92,1
-DA:94,1
-DA:96,1
-DA:97,2
-DA:98,2
-DA:99,1
-DA:100,1
-DA:101,1
-DA:103,1
-DA:105,1
-DA:106,2
-DA:107,2
-DA:108,1
-DA:110,1
-DA:112,1
-DA:113,1
-DA:115,1
-DA:116,0
-DA:117,2
-DA:118,1
-DA:120,1
-DA:121,1
-DA:123,1
-DA:125,1
-DA:126,2
-DA:127,1
-DA:129,1
-DA:137,1
-DA:140,1
-DA:142,30
-DA:145,29
-DA:146,58
-DA:147,58
-DA:148,58
-DA:149,1
-DA:150,1
-DA:152,1
-DA:155,1
-DA:157,1242
-DA:160,620
-DA:161,1240
-DA:162,1240
-DA:163,1240
-DA:164,1
-DA:165,1
-DA:168,1
-DA:170,1
-DA:172,1
-DA:173,2
-DA:174,1
-DA:175,2
-DA:176,2
-DA:178,2
-DA:179,2
-DA:180,1
-DA:181,2
-DA:182,2
-DA:183,1
-DA:185,1
-DA:188,1
-DA:190,30
-DA:193,29
-DA:194,29
-DA:195,29
-DA:196,29
-DA:197,29
-DA:198,29
-DA:199,1
-DA:200,1
-DA:202,1
-DA:205,1
-DA:207,621
-DA:210,620
-DA:211,620
-DA:212,620
-DA:213,620
-DA:214,620
-DA:215,620
-DA:216,1
-DA:217,1
-DA:219,1
-DA:222,1
-DA:223,1
-DA:224,30
-DA:226,29
-DA:228,1
-DA:229,1
-DA:231,1
-DA:234,1
-DA:235,1
-DA:236,621
-DA:238,620
-DA:240,1
-DA:241,1
-DA:243,1
-DA:246,1
-DA:247,1
-DA:248,1
-DA:249,1
-DA:250,1242
-DA:252,620
-DA:255,1
-DA:256,1
-DA:257,1
-DA:259,1
-DA:264,1
-DA:265,2
-DA:266,2
-DA:269,2
-DA:272,2
-DA:273,2
-DA:274,2
-DA:275,2
-DA:276,2
-DA:277,2
-DA:280,2
-DA:281,2
-DA:282,2
-DA:283,2
-DA:284,2
-DA:285,2
-DA:286,1
-DA:299,1
-DA:301,1
-DA:302,2
-DA:303,2
-DA:304,2
-DA:305,1
-DA:307,1
-DA:309,1
-DA:310,1
-DA:312,1
-DA:313,1
-DA:314,1
-BA:142,2
-BA:142,2
-BA:157,2
-BA:157,2
-BA:190,2
-BA:190,2
-BA:207,2
-BA:207,2
-BA:224,2
-BA:224,2
-BA:236,2
-BA:236,2
-BA:250,2
-BA:250,2
-LF:173
-LH:172
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/test.h
-FN:12,_ZN18AptTestEnvironmentC2Ev
-FN:10,_ZN18AptTestEnvironmentD2Ev
-FN:30,_ZN22DebtagsTestEnvironmentC2Ev
-FN:24,_ZN22DebtagsTestEnvironmentD2Ev
-DA:10,0
-DA:12,0
-DA:13,0
-DA:14,0
-DA:15,0
-DA:16,0
-DA:17,0
-DA:18,0
-DA:19,0
-DA:20,0
-DA:21,0
-DA:24,29
-DA:30,29
-DA:34,29
-DA:35,29
-LF:15
-LH:4
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:13,_ZN8LocationD1Ev
-FN:13,_ZN8LocationC1ERKS_
-FN:17,_ZN8LocationC1EPKciSs
-FN:52,_ZlsIiER12AssertFailedS1_T_
-FN:52,_ZlsISsER12AssertFailedS1_T_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:52,_ZlsIPKcER12AssertFailedS3_T_
-FN:41,_ZN12AssertFailedD1Ev
-FN:59,_Z9assert_fnIbEv8LocationT_
-FN:67,_Z12assert_eq_fnIiiEv8LocationT_T0_
-FN:67,_Z12assert_eq_fnISsSsEv8LocationT_T0_
-FN:52,_ZlsIjER12AssertFailedS1_T_
-FN:67,_Z12assert_eq_fnIjjEv8LocationT_T0_
-FN:52,_ZlsIN3ept7debtags3TagEER12AssertFailedS4_T_
-FN:67,_Z12assert_eq_fnIN3ept7debtags3TagES2_Ev8LocationT_T0_
-FN:52,_ZlsIN3ept7debtags5FacetEER12AssertFailedS4_T_
-FN:67,_Z12assert_eq_fnIN3ept7debtags5FacetES2_Ev8LocationT_T0_
-FN:67,_Z12assert_eq_fnISsPKcEv8LocationT_T0_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:59,0
-DA:61,0
-DA:62,0
-DA:64,0
-DA:67,649
-DA:69,649
-DA:70,0
-DA:71,0
-DA:75,649
-BA:42,0
-BA:42,0
-BA:61,0
-BA:61,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,1
-BA:69,2
-BA:69,1
-BA:69,2
-BA:69,0
-BA:69,0
-LF:26
-LH:3
-end_of_record
-SF:/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_vocabulary.cpp
-FN:21,_Z41__static_initialization_and_destruction_0ii
-FN:21,_GLOBAL__I_ept_test_generated__home_mornfall_dev_pkg_ept_work_ept_debtags_vocabulary.cpp
-FN:3,_Z17run_Vocabulary__1v
-FN:21,_Z18run_Vocabulary__21v
-FN:20,_Z18run_Vocabulary__19v
-FN:5,_Z17run_Vocabulary__3v
-FN:6,_Z17run_Vocabulary__4v
-FN:19,_Z18run_Vocabulary__18v
-FN:18,_Z18run_Vocabulary__17v
-FN:17,_Z18run_Vocabulary__16v
-FN:14,_Z18run_Vocabulary__13v
-FN:16,_Z18run_Vocabulary__15v
-FN:15,_Z18run_Vocabulary__14v
-FN:13,_Z18run_Vocabulary__12v
-FN:12,_Z18run_Vocabulary__11v
-FN:10,_Z17run_Vocabulary__8v
-FN:9,_Z17run_Vocabulary__7v
-FN:7,_Z17run_Vocabulary__5v
-FN:4,_Z17run_Vocabulary__2v
-FN:11,_Z17run_Vocabulary__9v
-FN:8,_Z17run_Vocabulary__6v
-DA:3,1
-DA:4,1
-DA:5,1
-DA:6,1
-DA:7,1
-DA:8,1
-DA:9,1
-DA:10,1
-DA:11,1
-DA:12,1
-DA:13,1
-DA:14,1
-DA:15,1
-DA:16,1
-DA:17,1
-DA:18,1
-DA:19,1
-DA:20,1
-DA:21,4
-BA:21,2
-BA:21,1
-BA:21,2
-BA:21,1
-LF:19
-LH:19
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeIN3ept7debtags5FacetEEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeIN3ept7debtags3TagEEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsSsEEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeIiEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISsEED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaISsED1Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeIN3ept7debtags5FacetEEEC2Ev
-FN:106,_ZNSaIN3ept7debtags5FacetEED1Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeIN3ept7debtags3TagEEEC2Ev
-FN:106,_ZNSaIN3ept7debtags3TagEED1Ev
-FN:106,_ZNSaISt4pairIKSsSsEED1Ev
-FN:106,_ZNSaISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEED1Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEEEC2Ev
-FN:106,_ZNSaISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEED1Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeIiEEC2Ev
-FN:106,_ZNSaIiED1Ev
-FN:104,_ZNSaISsEC1ISt13_Rb_tree_nodeISsEEERKSaIT_E
-FN:104,_ZNSaIN3ept7debtags5FacetEEC1ISt13_Rb_tree_nodeIS1_EEERKSaIT_E
-FN:104,_ZNSaIN3ept7debtags3TagEEC1ISt13_Rb_tree_nodeIS1_EEERKSaIT_E
-FN:104,_ZNSaISt4pairIKSsSsEEC1ISt13_Rb_tree_nodeIS1_EEERKSaIT_E
-FN:104,_ZNSaISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEC1ISt13_Rb_tree_nodeIS5_EEERKSaIT_E
-FN:104,_ZNSaISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEEC1ISt13_Rb_tree_nodeIS5_EEERKSaIT_E
-FN:104,_ZNSaIiEC1ISt13_Rb_tree_nodeIiEEERKSaIT_E
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,190461
-DA:100,0
-DA:101,0
-DA:104,7581586
-DA:106,8410437
-DA:118,0
-DA:119,0
-LF:7
-LH:3
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:1534,_ZNKSs5c_strEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-FN:2162,_ZSteqIcEN9__gnu_cxx11__enable_ifIXsrSt9__is_charIT_E7__valueEbE6__typeERKSbIS3_St11char_traitsIS3_ESaIS3_EESC_
-FN:2188,_ZSteqIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_EPKS3_
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2162,0
-DA:2165,0
-DA:2188,0
-DA:2189,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-LF:57
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-DA:245,0
-DA:246,0
-DA:257,0
-DA:258,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:268,_ZNSt12__niter_baseISt23_Rb_tree_const_iteratorIN3ept7debtags3TagEELb0EE3__bES4_
-FN:792,_ZNSt7__equalILb0EE5equalISt23_Rb_tree_const_iteratorIN3ept7debtags3TagEES6_EEbT_S7_T0_
-FN:815,_ZSt11__equal_auxISt23_Rb_tree_const_iteratorIN3ept7debtags3TagEES4_EbT_S5_T0_
-FN:944,_ZSt5equalISt23_Rb_tree_const_iteratorIN3ept7debtags3TagEES4_EbT_S5_T0_
-DA:268,15
-DA:269,15
-DA:792,1
-DA:794,32
-DA:795,31
-DA:796,0
-DA:797,1
-DA:815,1
-DA:822,1
-DA:824,1
-DA:944,1
-DA:956,1
-BA:794,2
-BA:794,2
-BA:795,1
-BA:795,2
-LF:12
-LH:11
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_function.h
-FN:469,_ZNKSt9_IdentityIN3ept7debtags5FacetEEclERKS2_
-FN:229,_ZNKSt4lessIN3ept7debtags5FacetEEclERKS2_S5_
-FN:469,_ZNKSt9_IdentityIN3ept7debtags3TagEEclERKS2_
-FN:229,_ZNKSt4lessIN3ept7debtags3TagEEclERKS2_S5_
-FN:469,_ZNKSt9_IdentityIiEclERKi
-FN:229,_ZNKSt4lessIiEclERKiS2_
-DA:229,6110053
-DA:230,6110053
-DA:469,12219996
-DA:470,12219996
-LF:4
-LH:4
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:166,0
-DA:167,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_map.h
-FN:155,_ZNSt3mapISsN3ept7debtags16VocabularyMerger9FacetDataESt4lessISsESaISt4pairIKSsS3_EEEC1Ev
-FN:92,_ZNSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEED2Ev
-FN:92,_ZNSt3mapISsN3ept7debtags16VocabularyMerger7TagDataESt4lessISsESaISt4pairIKSsS3_EEED1Ev
-FN:92,_ZNSt3mapISsN3ept7debtags16VocabularyMerger9FacetDataESt4lessISsESaISt4pairIKSsS3_EEED1Ev
-DA:92,5483
-DA:155,7
-DA:156,7
-LF:3
-LH:3
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_pair.h
-FN:88,_ZNSt4pairISt23_Rb_tree_const_iteratorIN3ept7debtags5FacetEEbEC1ERKS4_RKb
-FN:88,_ZNSt4pairISt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEbEC1ERKS4_RKb
-FN:88,_ZNSt4pairISt23_Rb_tree_const_iteratorIiEbEC1ERKS1_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIN3ept7debtags5FacetEEbEC1ERKS4_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIN3ept7debtags3TagEEbEC1ERKS4_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIiEbEC1ERKS1_RKb
-FN:73,_ZNSt4pairIKSsSsED1Ev
-FN:73,_ZNSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEED1Ev
-FN:73,_ZNSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEED1Ev
-DA:73,29075
-DA:88,2102733
-DA:89,2102733
-LF:3
-LH:3
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_set.h
-FN:331,_ZNKSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EE5emptyEv
-FN:336,_ZNKSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EE4sizeEv
-FN:336,_ZNKSt3setIN3ept7debtags5FacetESt4lessIS2_ESaIS2_EE4sizeEv
-FN:336,_ZNKSt3setIiSt4lessIiESaIiEE4sizeEv
-FN:336,_ZNKSt3setISsSt4lessISsESaISsEE4sizeEv
-FN:261,_ZNKSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EE5beginEv
-FN:270,_ZNKSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EE3endEv
-FN:261,_ZNKSt3setIN3ept7debtags5FacetESt4lessIS2_ESaIS2_EE5beginEv
-FN:270,_ZNKSt3setIN3ept7debtags5FacetESt4lessIS2_ESaIS2_EE3endEv
-FN:261,_ZNKSt3setISsSt4lessISsESaISsEE5beginEv
-FN:270,_ZNKSt3setISsSt4lessISsESaISsEE3endEv
-FN:507,_ZNKSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EE4findERKS2_
-FN:141,_ZNSt3setIN3ept7debtags5FacetESt4lessIS2_ESaIS2_EEC1Ev
-FN:141,_ZNSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EEC1Ev
-FN:141,_ZNSt3setIiSt4lessIiESaIiEEC1Ev
-FN:93,_ZNSt3setIN3ept7debtags5FacetESt4lessIS2_ESaIS2_EED1Ev
-FN:93,_ZNSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EED1Ev
-FN:93,_ZNSt3setISsSt4lessISsESaISsEED1Ev
-FN:93,_ZNSt3setIiSt4lessIiESaIiEED1Ev
-FN:378,_ZNSt3setIN3ept7debtags5FacetESt4lessIS2_ESaIS2_EE6insertERKS2_
-FN:378,_ZNSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EE6insertERKS2_
-FN:378,_ZNSt3setIiSt4lessIiESaIiEE6insertERKi
-FN:596,_ZSteqIN3ept7debtags3TagESt4lessIS2_ESaIS2_EEbRKSt3setIT_T0_T1_ESC_
-DA:93,816726
-DA:141,190454
-DA:142,190454
-DA:261,45
-DA:262,45
-DA:270,3195
-DA:271,3195
-DA:331,42304
-DA:332,42304
-DA:336,84615
-DA:337,84615
-DA:378,998521
-DA:381,998521
-DA:382,998521
-DA:507,14
-DA:508,14
-DA:596,1
-DA:597,1
-LF:18
-LH:18
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_tree.h
-FN:289,_ZNKSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEneERKS3_
-FN:251,_ZNKSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEptEv
-FN:247,_ZNKSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEdeEv
-FN:289,_ZNKSt23_Rb_tree_const_iteratorIN3ept7debtags5FacetEEneERKS3_
-FN:251,_ZNKSt23_Rb_tree_const_iteratorIN3ept7debtags5FacetEEptEv
-FN:247,_ZNKSt23_Rb_tree_const_iteratorIN3ept7debtags5FacetEEdeEv
-FN:289,_ZNKSt23_Rb_tree_const_iteratorISsEneERKS0_
-FN:247,_ZNKSt23_Rb_tree_const_iteratorISsEdeEv
-FN:452,_ZNSt8_Rb_treeIN3ept7debtags5FacetES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_M_beginEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorIN3ept7debtags5FacetEEC1ERKSt17_Rb_tree_iteratorIS2_E
-FN:452,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_M_beginEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEC1ERKSt17_Rb_tree_iteratorIS2_E
-FN:452,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_M_beginEv
-FN:452,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_M_beginEv
-FN:452,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_M_beginEv
-FN:452,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_M_beginEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorIiEC1ERKSt17_Rb_tree_iteratorIiE
-FN:452,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_beginEv
-FN:637,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE5emptyEv
-FN:641,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE4sizeEv
-FN:285,_ZNKSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEeqERKS3_
-FN:641,_ZNKSt8_Rb_treeIN3ept7debtags5FacetES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE4sizeEv
-FN:641,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE4sizeEv
-FN:641,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE4sizeEv
-FN:398,_ZNSt8_Rb_treeIN3ept7debtags5FacetES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13_Rb_tree_implIS6_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeIN3ept7debtags5FacetES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeIN3ept7debtags5FacetES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:463,_ZNSt8_Rb_treeIN3ept7debtags5FacetES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE6_M_endEv
-FN:168,_ZNSt17_Rb_tree_iteratorIN3ept7debtags5FacetEEC1EPSt13_Rb_tree_nodeIS2_E
-FN:596,_ZNSt8_Rb_treeIN3ept7debtags5FacetES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE5beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorIN3ept7debtags5FacetEEeqERKS3_
-FN:347,_ZNKSt8_Rb_treeIN3ept7debtags5FacetES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE21_M_get_Node_allocatorEv
-FN:398,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13_Rb_tree_implIS6_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:463,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE6_M_endEv
-FN:168,_ZNSt17_Rb_tree_iteratorIN3ept7debtags3TagEEC1EPSt13_Rb_tree_nodeIS2_E
-FN:596,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE5beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorIN3ept7debtags3TagEEeqERKS3_
-FN:347,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE21_M_get_Node_allocatorEv
-FN:456,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_M_beginEv
-FN:398,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE13_Rb_tree_implIS6_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:398,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13_Rb_tree_implISA_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:398,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13_Rb_tree_implISA_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:398,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_Rb_tree_implIS3_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE7_S_leftEPSt18_Rb_tree_node_base
-FN:347,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE21_M_get_Node_allocatorEv
-FN:463,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE6_M_endEv
-FN:168,_ZNSt17_Rb_tree_iteratorIiEC1EPSt13_Rb_tree_nodeIiE
-FN:596,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorIiEeqERKS0_
-FN:398,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_S_leftEPSt18_Rb_tree_node_base
-FN:347,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE21_M_get_Node_allocatorEv
-FN:240,_ZNSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEC1EPKSt13_Rb_tree_nodeIS2_E
-FN:603,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE5beginEv
-FN:614,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE3endEv
-FN:240,_ZNSt23_Rb_tree_const_iteratorIN3ept7debtags5FacetEEC1EPKSt13_Rb_tree_nodeIS2_E
-FN:603,_ZNKSt8_Rb_treeIN3ept7debtags5FacetES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE5beginEv
-FN:614,_ZNKSt8_Rb_treeIN3ept7debtags5FacetES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE3endEv
-FN:240,_ZNSt23_Rb_tree_const_iteratorISsEC1EPKSt13_Rb_tree_nodeISsE
-FN:603,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5beginEv
-FN:614,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE3endEv
-FN:415,_ZNSt8_Rb_treeIN3ept7debtags5FacetES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13_Rb_tree_implIS6_Lb0EE13_M_initializeEv
-FN:471,_ZNSt8_Rb_treeIN3ept7debtags5FacetES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_S_valueEPKSt13_Rb_tree_nodeIS2_E
-FN:475,_ZNSt8_Rb_treeIN3ept7debtags5FacetES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE6_S_keyEPKSt13_Rb_tree_nodeIS2_E
-FN:495,_ZNSt8_Rb_treeIN3ept7debtags5FacetES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeIN3ept7debtags5FacetES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE6_S_keyEPKSt18_Rb_tree_node_base
-FN:415,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13_Rb_tree_implIS6_Lb0EE13_M_initializeEv
-FN:471,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_S_valueEPKSt13_Rb_tree_nodeIS2_E
-FN:475,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE6_S_keyEPKSt13_Rb_tree_nodeIS2_E
-FN:495,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE6_S_keyEPKSt18_Rb_tree_node_base
-FN:491,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_S_rightEPKSt18_Rb_tree_node_base
-FN:483,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE7_S_leftEPKSt18_Rb_tree_node_base
-FN:415,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13_Rb_tree_implISA_Lb0EE13_M_initializeEv
-FN:415,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_Rb_tree_implIS3_Lb0EE13_M_initializeEv
-FN:471,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_S_valueEPKSt13_Rb_tree_nodeIiE
-FN:475,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE6_S_keyEPKSt13_Rb_tree_nodeIiE
-FN:495,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE6_S_keyEPKSt18_Rb_tree_node_base
-FN:467,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE6_M_endEv
-FN:970,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE14_M_lower_boundEPKSt13_Rb_tree_nodeIS2_ESC_RKS2_
-FN:1403,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE4findERKS2_
-FN:403,_ZNSt8_Rb_treeIN3ept7debtags5FacetES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13_Rb_tree_implIS6_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeIN3ept7debtags5FacetES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EEC1Ev
-FN:403,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13_Rb_tree_implIS6_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EEC1Ev
-FN:347,_ZNKSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE21_M_get_Node_allocatorEv
-FN:347,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE21_M_get_Node_allocatorEv
-FN:403,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13_Rb_tree_implISA_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EEC1Ev
-FN:347,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE21_M_get_Node_allocatorEv
-FN:403,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_Rb_tree_implIS3_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEEC1Ev
-FN:351,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13get_allocatorEv
-FN:351,_ZNKSt8_Rb_treeIN3ept7debtags5FacetES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13get_allocatorEv
-FN:351,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13get_allocatorEv
-FN:351,_ZNKSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE13get_allocatorEv
-FN:351,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13get_allocatorEv
-FN:351,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13get_allocatorEv
-FN:351,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13get_allocatorEv
-FN:360,_ZNSt8_Rb_treeIN3ept7debtags5FacetES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS2_E
-FN:388,_ZNSt8_Rb_treeIN3ept7debtags5FacetES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS2_E
-FN:936,_ZNSt8_Rb_treeIN3ept7debtags5FacetES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_M_eraseEPSt13_Rb_tree_nodeIS2_E
-FN:584,_ZNSt8_Rb_treeIN3ept7debtags5FacetES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EED1Ev
-FN:360,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS2_E
-FN:388,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS2_E
-FN:936,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_M_eraseEPSt13_Rb_tree_nodeIS2_E
-FN:584,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EED1Ev
-FN:360,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS6_E
-FN:360,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS2_E
-FN:388,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS2_E
-FN:936,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_M_eraseEPSt13_Rb_tree_nodeIS2_E
-FN:584,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EED1Ev
-FN:388,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS6_E
-FN:936,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_M_eraseEPSt13_Rb_tree_nodeIS6_E
-FN:584,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EED1Ev
-FN:360,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS6_E
-FN:388,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS6_E
-FN:936,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_M_eraseEPSt13_Rb_tree_nodeIS6_E
-FN:584,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EED1Ev
-FN:360,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11_M_put_nodeEPSt13_Rb_tree_nodeISsE
-FN:388,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE15_M_destroy_nodeEPSt13_Rb_tree_nodeISsE
-FN:936,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_eraseEPSt13_Rb_tree_nodeISsE
-FN:584,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEED1Ev
-FN:360,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE11_M_put_nodeEPSt13_Rb_tree_nodeIiE
-FN:388,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE15_M_destroy_nodeEPSt13_Rb_tree_nodeIiE
-FN:936,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_M_eraseEPSt13_Rb_tree_nodeIiE
-FN:584,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEED1Ev
-FN:195,_ZNSt17_Rb_tree_iteratorIN3ept7debtags5FacetEEmmEv
-FN:195,_ZNSt17_Rb_tree_iteratorIN3ept7debtags3TagEEmmEv
-FN:195,_ZNSt17_Rb_tree_iteratorIiEmmEv
-FN:356,_ZNSt8_Rb_treeIN3ept7debtags5FacetES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeIN3ept7debtags5FacetES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE14_M_create_nodeERKS2_
-FN:846,_ZNSt8_Rb_treeIN3ept7debtags5FacetES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE10_M_insert_EPKSt18_Rb_tree_node_baseSB_RKS2_
-FN:1133,_ZNSt8_Rb_treeIN3ept7debtags5FacetES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE16_M_insert_uniqueERKS2_
-FN:356,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE14_M_create_nodeERKS2_
-FN:846,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE10_M_insert_EPKSt18_Rb_tree_node_baseSB_RKS2_
-FN:1133,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE16_M_insert_uniqueERKS2_
-FN:356,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE14_M_create_nodeERKi
-FN:846,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE10_M_insert_EPKSt18_Rb_tree_node_baseS8_RKi
-FN:1133,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE16_M_insert_uniqueERKi
-FN:255,_ZNSt23_Rb_tree_const_iteratorISsEppEv
-FN:262,_ZNSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEppEi
-FN:262,_ZNSt23_Rb_tree_const_iteratorIN3ept7debtags5FacetEEppEi
-FN:255,_ZNSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEppEv
-FN:745,_ZSteqIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EEbRKSt8_Rb_treeIT_T0_T1_T2_T3_ESG_
-DA:168,2941744
-DA:169,2941744
-DA:195,1434
-DA:197,1434
-DA:198,1434
-DA:210,298046
-DA:211,298046
-DA:240,3274
-DA:241,3274
-DA:243,998550
-DA:244,998550
-DA:247,2946
-DA:248,2946
-DA:251,6541
-DA:252,6541
-DA:255,693
-DA:257,693
-DA:258,693
-DA:262,1978
-DA:264,1978
-DA:265,1978
-DA:285,588
-DA:286,588
-DA:289,2660
-DA:290,2660
-DA:347,8111524
-DA:348,8111524
-DA:351,7581586
-DA:352,7581586
-DA:356,3772960
-DA:357,3772960
-DA:360,3790793
-DA:361,3790793
-DA:364,3772960
-DA:366,3772960
-DA:368,3772960
-DA:369,0
-DA:371,0
-DA:372,0
-DA:374,3772960
-DA:388,3790793
-DA:390,3790793
-DA:391,3790793
-DA:392,3790793
-DA:398,828851
-DA:403,190461
-DA:405,190461
-DA:406,190461
-DA:415,710989
-DA:417,710989
-DA:418,710989
-DA:419,710989
-DA:420,710989
-DA:421,710989
-DA:452,1958668
-DA:453,1958668
-DA:456,169101
-DA:459,169101
-DA:463,3661299
-DA:464,3661299
-DA:467,14
-DA:468,14
-DA:471,3624270
-DA:472,3624270
-DA:475,3624270
-DA:476,3624270
-DA:479,3809086
-DA:480,3809086
-DA:483,844857
-DA:484,844857
-DA:487,7438537
-DA:488,7438537
-DA:491,377041
-DA:492,377041
-DA:495,2485769
-DA:496,2485769
-DA:499,2485769
-DA:500,2485769
-DA:562,190461
-DA:584,828851
-DA:585,828851
-DA:596,298040
-DA:599,298040
-DA:603,47
-DA:606,47
-DA:614,3213
-DA:617,3213
-DA:637,42304
-DA:638,42304
-DA:641,583306
-DA:642,583306
-DA:745,1
-DA:748,1
-DA:846,1539476
-DA:850,1539476
-DA:852,1539476
-DA:854,1539476
-DA:857,1539476
-DA:858,1539476
-DA:936,4622783
-DA:939,13036233
-DA:941,3790667
-DA:942,3790667
-DA:943,3790667
-DA:944,3790667
-DA:946,4622783
-DA:970,14
-DA:972,89
-DA:973,61
-DA:974,33
-DA:976,28
-DA:977,14
-DA:1133,1104212
-DA:1135,1104212
-DA:1136,1104212
-DA:1137,1104212
-DA:1138,5832628
-DA:1140,3624204
-DA:1141,3624204
-DA:1142,3624204
-DA:1144,1104212
-DA:1145,1104212
-DA:1147,298036
-DA:1148,296602
-DA:1150,1434
-DA:1152,807610
-DA:1153,807608
-DA:1154,2
-DA:1403,14
-DA:1405,14
-DA:1408,14
-BA:748,2
-BA:748,1
-BA:748,2
-BA:748,1
-BA:850,2
-BA:850,1
-BA:850,2
-BA:850,2
-BA:850,1
-BA:850,2
-BA:850,2
-BA:850,1
-BA:850,2
-BA:850,2
-BA:850,1
-BA:850,2
-BA:850,2
-BA:850,1
-BA:850,2
-BA:850,2
-BA:850,2
-BA:850,2
-BA:939,2
-BA:939,2
-BA:939,2
-BA:939,2
-BA:939,2
-BA:939,2
-BA:939,2
-BA:939,2
-BA:939,2
-BA:939,2
-BA:939,0
-BA:939,0
-BA:939,2
-BA:939,2
-BA:972,2
-BA:972,2
-BA:973,2
-BA:973,2
-BA:1138,2
-BA:1138,2
-BA:1138,2
-BA:1138,2
-BA:1138,2
-BA:1138,2
-BA:1142,1
-BA:1142,2
-BA:1142,1
-BA:1142,2
-BA:1142,2
-BA:1142,2
-BA:1145,2
-BA:1145,2
-BA:1145,2
-BA:1145,2
-BA:1145,2
-BA:1145,2
-BA:1147,2
-BA:1147,1
-BA:1147,2
-BA:1147,1
-BA:1147,2
-BA:1147,2
-BA:1152,2
-BA:1152,1
-BA:1152,2
-BA:1152,1
-BA:1152,2
-BA:1152,2
-BA:1408,2
-BA:1408,1
-BA:1408,2
-BA:1408,2
-LF:131
-LH:128
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags5FacetEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSsEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:118,_ZN9__gnu_cxx13new_allocatorIN3ept7debtags5FacetEE7destroyEPS3_
-FN:118,_ZN9__gnu_cxx13new_allocatorIN3ept7debtags3TagEE7destroyEPS3_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:118,_ZN9__gnu_cxx13new_allocatorIiE7destroyEPi
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags5FacetEEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIN3ept7debtags5FacetEED2Ev
-FN:107,_ZN9__gnu_cxx13new_allocatorIN3ept7debtags5FacetEE9constructEPS3_RKS3_
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIN3ept7debtags3TagEED2Ev
-FN:107,_ZN9__gnu_cxx13new_allocatorIN3ept7debtags3TagEE9constructEPS3_RKS3_
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsSsEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIiED2Ev
-FN:107,_ZN9__gnu_cxx13new_allocatorIiE9constructEPiRKi
-FN:69,_ZN9__gnu_cxx13new_allocatorIN3ept7debtags5FacetEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorIN3ept7debtags3TagEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsSsEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorIiEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags5FacetEEE8max_sizeEv
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEE8max_sizeEv
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEE8max_sizeEv
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsSsEE7destroyEPS3_
-FN:118,_ZN9__gnu_cxx13new_allocatorISsE7destroyEPSs
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags5FacetEEE10deallocateEPS5_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEE10deallocateEPS5_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEE10deallocateEPS9_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSsEEE10deallocateEPS5_j
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEE7destroyEPS7_
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEE7destroyEPS7_
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEEE10deallocateEPS9_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE10deallocateEPS2_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEE10deallocateEPS2_j
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags5FacetEEE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEE8allocateEjPKv
-DA:69,7772047
-DA:71,0
-DA:76,8410437
-DA:87,3772960
-DA:89,3772960
-DA:90,0
-DA:92,3772960
-DA:97,3790793
-DA:98,3790793
-DA:101,3772960
-DA:102,3772960
-DA:107,3772960
-DA:108,3772960
-DA:118,3790793
-BA:89,1
-BA:89,2
-BA:89,1
-BA:89,2
-BA:89,1
-BA:89,2
-BA:108,2
-BA:108,1
-BA:108,2
-BA:108,1
-BA:108,2
-BA:108,1
-LF:14
-LH:12
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-DA:105,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:195,_ZNSolsEj
-FN:177,_ZNSolsEb
-DA:95,0
-DA:112,0
-DA:117,0
-DA:177,0
-DA:178,0
-DA:195,0
-DA:199,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/diskindex/mmap.h
-FN:89,_ZN7tagcoll9diskindex11MMapIndexerC2Ev
-FN:91,_ZN7tagcoll9diskindex11MMapIndexerD0Ev
-FN:91,_ZN7tagcoll9diskindex11MMapIndexerD1Ev
-FN:91,_ZN7tagcoll9diskindex11MMapIndexerD2Ev
-DA:89,20
-DA:91,20
-BA:91,0
-BA:91,0
-BA:91,0
-BA:91,0
-BA:91,1
-BA:91,2
-LF:2
-LH:2
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/utils/set.h
-FN:79,_ZN7tagcoll5utils12set_containsIN3ept7debtags3TagEEEbRKSt3setIT_St4lessIS6_ESaIS6_EERKS6_
-FN:63,_ZN7tagcoll5utils12set_containsIN3ept7debtags3TagEEEbRKSt3setIT_St4lessIS6_ESaIS6_EESC_
-DA:63,1
-DA:65,1
-DA:67,574
-DA:68,574
-DA:69,1
-DA:70,573
-DA:71,31
-DA:72,542
-DA:73,0
-DA:75,0
-DA:79,4
-DA:81,4
-BA:67,2
-BA:67,1
-BA:68,2
-BA:68,2
-BA:70,2
-BA:70,2
-BA:72,1
-BA:72,2
-LF:12
-LH:10
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/apt/apt.test.h
-FN:28,_ZN7TestAptC1Ev
-FN:180,_ZN7TestApt12checkUpdatesEv
-FN:66,_ZN7TestApt8validityEv
-FN:28,_ZN7TestAptD1Ev
-FN:173,_ZN7TestApt18stlRecordIterationEv
-FN:166,_ZN7TestApt12stlIterationEv
-FN:32,_ZN7TestApt9iteratorsEv
-FN:152,_ZN7TestApt16recordIteration2Ev
-FN:138,_ZN7TestApt15recordIterationEv
-FN:127,_ZN7TestApt5stateEv
-FN:97,_ZN7TestApt15versionValidityEv
-FN:110,_ZN7TestApt9rawRecordEv
-FN:73,_ZN7TestApt8versionsEv
-FN:59,_ZN7TestApt9timestampEv
-FN:45,_ZN7TestApt9aptExistsEv
-DA:28,26
-DA:32,1
-DA:34,1
-DA:35,1
-DA:37,1
-DA:38,1789
-DA:39,1788
-DA:41,1
-DA:42,1
-DA:45,1
-DA:47,1
-DA:49,1
-DA:51,1
-DA:55,2
-DA:56,1
-DA:59,1
-DA:61,1
-DA:62,1
-DA:63,1
-DA:66,1
-DA:68,1
-DA:69,2
-DA:70,1
-DA:73,1
-DA:75,1
-DA:76,1
-DA:77,1
-DA:79,2
-DA:80,1
-DA:82,2
-DA:83,1
-DA:85,2
-DA:86,2
-DA:87,1
-DA:89,2
-DA:90,1
-DA:92,2
-DA:93,1
-DA:94,1
-DA:97,1
-DA:99,1
-DA:100,2
-DA:102,1
-DA:103,2
-DA:105,1
-DA:106,2
-DA:107,1
-DA:110,1
-DA:112,1
-DA:113,1
-DA:114,1
-DA:116,1
-DA:117,1
-DA:118,2
-DA:120,2
-DA:121,2
-DA:123,1
-DA:124,1
-DA:127,1
-DA:129,1
-DA:130,2
-DA:131,2
-DA:133,2
-DA:134,2
-DA:135,1
-DA:138,1
-DA:140,1
-DA:141,435
-DA:144,434
-DA:145,434
-DA:146,434
-DA:147,1
-DA:148,2
-DA:149,1
-DA:152,1
-DA:154,1
-DA:155,435
-DA:158,434
-DA:159,868
-DA:160,434
-DA:161,1
-DA:162,2
-DA:163,1
-DA:166,1
-DA:168,1
-DA:169,1
-DA:170,1
-DA:173,1
-DA:175,1
-DA:176,1
-DA:177,1
-DA:180,1
-DA:182,1
-DA:183,1
-DA:184,2
-DA:185,1
-DA:186,1
-DA:187,2
-DA:188,1
-BA:38,2
-BA:38,2
-BA:141,2
-BA:141,2
-BA:155,2
-BA:155,2
-LF:99
-LH:99
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/apt/version.h
-FN:77,_ZNK3ept3apt7Version7isValidEv
-FN:41,_ZN3ept3apt7VersionD1Ev
-FN:55,_ZN3ept3apt7VersionC1ERKSsS3_
-FN:41,_ZN3ept3apt7VersionaSERKS1_
-FN:82,_ZNK3ept3apt7VersioneqERKS1_
-DA:41,0
-DA:55,0
-DA:56,0
-DA:77,0
-DA:82,0
-BA:77,0
-BA:77,0
-BA:77,0
-BA:77,0
-BA:82,0
-BA:82,0
-BA:82,0
-BA:82,0
-LF:5
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt/record.h
-DA:86,1
-BA:86,1
-BA:86,2
-LF:1
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt.h
-FN:79,_ZNK3ept4core12PackageState7isValidEv
-FN:97,_ZNK3ept4core12PackageState9installedEv
-FN:81,_ZNK3ept4core12PackageState11isInstalledEv
-FN:139,_ZN3ept4core11AptDatabaseC1Ev
-FN:209,_ZN3ept4core11AptDatabase10invalidateEv
-FN:331,_ZN3ept4core11AptDatabaseD1Ev
-DA:79,2
-DA:81,1
-DA:97,1
-DA:139,0
-DA:140,0
-DA:141,0
-DA:142,0
-DA:143,0
-DA:144,0
-DA:145,0
-DA:146,0
-DA:209,0
-DA:210,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:218,0
-DA:219,0
-DA:220,0
-DA:331,0
-DA:332,0
-DA:333,0
-BA:210,0
-BA:210,0
-BA:214,0
-BA:214,0
-BA:216,0
-BA:216,0
-BA:218,0
-BA:218,0
-LF:24
-LH:3
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/test.h
-FN:12,_ZN18AptTestEnvironmentC2Ev
-FN:10,_ZN18AptTestEnvironmentD2Ev
-DA:10,0
-DA:12,0
-DA:13,0
-DA:14,0
-DA:15,0
-DA:16,0
-DA:17,0
-DA:18,0
-DA:19,0
-DA:20,0
-DA:21,0
-LF:11
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:13,_ZN8LocationD1Ev
-FN:17,_ZN8LocationC1EPKciSs
-FN:13,_ZN8LocationC1ERKS_
-FN:52,_ZlsISsER12AssertFailedS1_T_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:52,_ZlsIPKcER12AssertFailedS3_T_
-FN:41,_ZN12AssertFailedD1Ev
-FN:59,_Z9assert_fnIbEv8LocationT_
-FN:67,_Z12assert_eq_fnISsSsEv8LocationT_T0_
-FN:67,_Z12assert_eq_fnISsPKcEv8LocationT_T0_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:59,0
-DA:61,0
-DA:62,0
-DA:64,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:75,0
-BA:42,0
-BA:42,0
-BA:61,0
-BA:61,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-LF:26
-LH:0
-end_of_record
-SF:/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_apt_apt.cpp
-FN:15,_Z41__static_initialization_and_destruction_0ii
-FN:15,_GLOBAL__I_ept_test_generated__home_mornfall_dev_pkg_ept_work_ept_apt_apt.cpp
-FN:15,_Z20run_Apt_checkUpdatesv
-FN:6,_Z16run_Apt_validityv
-FN:14,_Z26run_Apt_stlRecordIterationv
-FN:13,_Z20run_Apt_stlIterationv
-FN:3,_Z17run_Apt_iteratorsv
-FN:12,_Z24run_Apt_recordIteration2v
-FN:11,_Z23run_Apt_recordIterationv
-FN:10,_Z13run_Apt_statev
-FN:8,_Z23run_Apt_versionValidityv
-FN:9,_Z17run_Apt_rawRecordv
-FN:7,_Z16run_Apt_versionsv
-FN:5,_Z17run_Apt_timestampv
-FN:4,_Z17run_Apt_aptExistsv
-DA:3,1
-DA:4,1
-DA:5,1
-DA:6,1
-DA:7,1
-DA:8,1
-DA:9,1
-DA:10,1
-DA:11,1
-DA:12,1
-DA:13,1
-DA:14,1
-DA:15,4
-BA:15,2
-BA:15,1
-BA:15,2
-BA:15,1
-LF:13
-LH:13
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISsEED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaISsED2Ev
-FN:106,_ZNSaISsED1Ev
-FN:98,_ZNSaISsEC2Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeISsEEC2Ev
-FN:104,_ZNSaISsEC1ISt13_Rb_tree_nodeISsEEERKSaIT_E
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:104,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:7
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:392,_ZNSs10_S_compareEjj
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-FN:2162,_ZSteqIcEN9__gnu_cxx11__enable_ifIXsrSt9__is_charIT_E7__valueEbE6__typeERKSbIS3_St11char_traitsIS3_ESaIS3_EESC_
-FN:1941,_ZNKSs7compareERKSs
-FN:2238,_ZStltIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:306,_ZNKSs8_M_checkEjPKc
-FN:1923,_ZNKSs6substrEjj
-FN:2188,_ZSteqIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_EPKS3_
-FN:1593,_ZNKSs4findEPKcj
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:306,0
-DA:308,0
-DA:309,0
-DA:310,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:392,0
-DA:394,0
-DA:401,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:686,0
-DA:687,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:1593,0
-DA:1596,0
-DA:1923,0
-DA:1925,0
-DA:1941,0
-DA:1943,0
-DA:1944,0
-DA:1945,0
-DA:1947,0
-DA:1948,0
-DA:1949,0
-DA:1950,0
-DA:2067,0
-DA:2069,0
-DA:2162,0
-DA:2165,0
-DA:2188,0
-DA:2189,0
-DA:2238,0
-DA:2239,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:308,0
-BA:308,0
-BA:341,0
-BA:341,0
-BA:1948,0
-BA:1948,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-LF:78
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-DA:245,0
-DA:246,0
-DA:257,0
-DA:258,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:188,_ZSt3minIjERKT_S2_S2_
-FN:268,_ZNSt12__niter_baseISt15insert_iteratorISt3setISsSt4lessISsESaISsEEELb0EE3__bES6_
-FN:268,_ZNSt12__niter_baseISt20back_insert_iteratorISt6vectorISsSaISsEEELb0EE3__bES4_
-FN:286,_ZNSt12__miter_baseIPSsLb0EE3__bES0_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:268,_ZNSt12__niter_baseIPSsLb0EE3__bES0_
-FN:539,_ZNSt20__copy_move_backwardILb0ELb0ESt26random_access_iterator_tagE13__copy_move_bIPSsS3_EET0_T_S5_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0EPSsS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPSsS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardIPSsS0_ET0_T_S2_S1_
-FN:286,_ZNSt12__miter_baseIN3ept3apt3Apt14RecordIteratorELb0EE3__bES3_
-FN:268,_ZNSt12__niter_baseIN3ept3apt3Apt14RecordIteratorELb0EE3__bES3_
-FN:309,_ZNSt11__copy_moveILb0ELb0ESt18input_iterator_tagE8__copy_mIN3ept3apt3Apt14RecordIteratorESt20back_insert_iteratorISt6vectorISsSaISsEEEEET0_T_SD_SC_
-FN:385,_ZSt13__copy_move_aILb0EN3ept3apt3Apt14RecordIteratorESt20back_insert_iteratorISt6vectorISsSaISsEEEET1_T0_SA_S9_
-FN:430,_ZSt14__copy_move_a2ILb0EN3ept3apt3Apt14RecordIteratorESt20back_insert_iteratorISt6vectorISsSaISsEEEET1_T0_SA_S9_
-FN:456,_ZSt4copyIN3ept3apt3Apt14RecordIteratorESt20back_insert_iteratorISt6vectorISsSaISsEEEET0_T_SA_S9_
-FN:286,_ZNSt12__miter_baseIN3ept3apt3Apt8IteratorELb0EE3__bES3_
-FN:268,_ZNSt12__niter_baseIN3ept3apt3Apt8IteratorELb0EE3__bES3_
-FN:309,_ZNSt11__copy_moveILb0ELb0ESt18input_iterator_tagE8__copy_mIN3ept3apt3Apt8IteratorESt20back_insert_iteratorISt6vectorISsSaISsEEEEET0_T_SD_SC_
-FN:385,_ZSt13__copy_move_aILb0EN3ept3apt3Apt8IteratorESt20back_insert_iteratorISt6vectorISsSaISsEEEET1_T0_SA_S9_
-FN:430,_ZSt14__copy_move_a2ILb0EN3ept3apt3Apt8IteratorESt20back_insert_iteratorISt6vectorISsSaISsEEEET1_T0_SA_S9_
-FN:456,_ZSt4copyIN3ept3apt3Apt8IteratorESt20back_insert_iteratorISt6vectorISsSaISsEEEET0_T_SA_S9_
-FN:309,_ZNSt11__copy_moveILb0ELb0ESt18input_iterator_tagE8__copy_mIN3ept3apt3Apt8IteratorESt15insert_iteratorISt3setISsSt4lessISsESaISsEEEEET0_T_SF_SE_
-FN:385,_ZSt13__copy_move_aILb0EN3ept3apt3Apt8IteratorESt15insert_iteratorISt3setISsSt4lessISsESaISsEEEET1_T0_SC_SB_
-FN:430,_ZSt14__copy_move_a2ILb0EN3ept3apt3Apt8IteratorESt15insert_iteratorISt3setISsSt4lessISsESaISsEEEET1_T0_SC_SB_
-FN:456,_ZSt4copyIN3ept3apt3Apt8IteratorESt15insert_iteratorISt3setISsSt4lessISsESaISsEEEET0_T_SC_SB_
-DA:188,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:210,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:268,6
-DA:269,6
-DA:286,6
-DA:287,6
-DA:309,3
-DA:311,8026
-DA:312,4010
-DA:313,3
-DA:385,3
-DA:393,3
-DA:396,3
-DA:430,3
-DA:435,3
-DA:456,3
-DA:466,3
-DA:539,0
-DA:542,0
-DA:543,0
-DA:544,0
-DA:579,0
-DA:587,0
-DA:592,0
-DA:597,0
-DA:602,0
-DA:624,0
-DA:636,0
-BA:193,0
-BA:193,0
-BA:215,0
-BA:215,0
-BA:311,2
-BA:311,2
-BA:311,2
-BA:311,2
-BA:311,2
-BA:311,2
-BA:542,0
-BA:542,0
-LF:34
-LH:15
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-DA:87,0
-DA:88,0
-DA:97,0
-DA:101,0
-DA:103,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-BA:101,0
-BA:101,0
-LF:9
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_function.h
-FN:469,_ZNKSt9_IdentityISsEclERKSs
-FN:229,_ZNKSt4lessISsEclERKSsS2_
-DA:229,0
-DA:230,0
-DA:469,0
-DA:470,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEdeEv
-FN:398,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEC1ERS2_
-FN:456,_ZSt13back_inserterISt6vectorISsSaISsEEESt20back_insert_iteratorIT_ERS4_
-FN:572,_ZNSt15insert_iteratorISt3setISsSt4lessISsESaISsEEEC1ERS4_St23_Rb_tree_const_iteratorISsE
-FN:645,_ZSt8inserterISt3setISsSt4lessISsESaISsEESt23_Rb_tree_const_iteratorISsEESt15insert_iteratorIT_ERS8_T0_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEE4baseEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEC1ERKS1_
-FN:623,_ZNSt15insert_iteratorISt3setISsSt4lessISsESaISsEEEppEv
-FN:618,_ZNSt15insert_iteratorISt3setISsSt4lessISsESaISsEEEdeEv
-FN:434,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEppEv
-FN:429,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEdeEv
-FN:412,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEaSERKSs
-FN:599,_ZNSt15insert_iteratorISt3setISsSt4lessISsESaISsEEEaSERKSs
-DA:398,0
-DA:412,0
-DA:414,0
-DA:415,0
-DA:429,0
-DA:430,0
-DA:434,0
-DA:435,0
-DA:456,0
-DA:457,0
-DA:572,0
-DA:573,0
-DA:599,0
-DA:601,0
-DA:602,0
-DA:603,0
-DA:618,0
-DA:619,0
-DA:623,0
-DA:624,0
-DA:645,0
-DA:648,0
-DA:683,0
-DA:695,0
-DA:696,0
-DA:747,0
-DA:748,0
-LF:27
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,0
-DA:166,0
-DA:167,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_pair.h
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorISsEbEC1ERKS1_RKb
-DA:88,0
-DA:89,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_set.h
-FN:261,_ZNKSt3setISsSt4lessISsESaISsEE5beginEv
-FN:270,_ZNKSt3setISsSt4lessISsESaISsEE3endEv
-FN:141,_ZNSt3setISsSt4lessISsESaISsEEC1Ev
-FN:93,_ZNSt3setISsSt4lessISsESaISsEED1Ev
-FN:503,_ZNSt3setISsSt4lessISsESaISsEE4findERKSs
-FN:405,_ZNSt3setISsSt4lessISsESaISsEE6insertESt23_Rb_tree_const_iteratorISsERKSs
-DA:93,0
-DA:141,0
-DA:142,0
-DA:261,0
-DA:262,0
-DA:270,0
-DA:271,0
-DA:405,0
-DA:406,0
-DA:503,0
-DA:504,0
-LF:11
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_tree.h
-FN:289,_ZNKSt23_Rb_tree_const_iteratorISsEneERKS0_
-FN:285,_ZNKSt23_Rb_tree_const_iteratorISsEeqERKS0_
-FN:452,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_beginEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorISsEC1ERKSt17_Rb_tree_iteratorISsE
-FN:398,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_S_leftEPSt18_Rb_tree_node_base
-FN:240,_ZNSt23_Rb_tree_const_iteratorISsEC1EPKSt13_Rb_tree_nodeISsE
-FN:603,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5beginEv
-FN:614,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE3endEv
-FN:463,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_M_endEv
-FN:210,_ZNKSt17_Rb_tree_iteratorISsEeqERKS0_
-FN:415,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EE13_M_initializeEv
-FN:168,_ZNSt17_Rb_tree_iteratorISsEC1EPSt13_Rb_tree_nodeISsE
-FN:610,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE3endEv
-FN:495,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_S_keyEPKSt18_Rb_tree_node_base
-FN:403,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEEC1Ev
-FN:347,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE21_M_get_Node_allocatorEv
-FN:351,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13get_allocatorEv
-FN:471,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_valueEPKSt13_Rb_tree_nodeISsE
-FN:475,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_S_keyEPKSt13_Rb_tree_nodeISsE
-FN:444,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE12_M_rightmostEv
-FN:641,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE4sizeEv
-FN:436,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11_M_leftmostEv
-FN:491,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_rightEPKSt18_Rb_tree_node_base
-FN:596,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5beginEv
-FN:360,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11_M_put_nodeEPSt13_Rb_tree_nodeISsE
-FN:388,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE15_M_destroy_nodeEPSt13_Rb_tree_nodeISsE
-FN:936,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_eraseEPSt13_Rb_tree_nodeISsE
-FN:584,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEED1Ev
-FN:954,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE14_M_lower_boundEPSt13_Rb_tree_nodeISsES8_RKSs
-FN:1390,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE4findERKSs
-FN:356,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE14_M_create_nodeERKSs
-FN:270,_ZNSt23_Rb_tree_const_iteratorISsEmmEv
-FN:846,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE10_M_insert_EPKSt18_Rb_tree_node_baseS8_RKSs
-FN:195,_ZNSt17_Rb_tree_iteratorISsEmmEv
-FN:1133,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE16_M_insert_uniqueERKSs
-FN:255,_ZNSt23_Rb_tree_const_iteratorISsEppEv
-FN:1178,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE17_M_insert_unique_ESt23_Rb_tree_const_iteratorISsERKSs
-DA:168,0
-DA:169,0
-DA:195,0
-DA:197,0
-DA:198,0
-DA:210,0
-DA:211,0
-DA:240,0
-DA:241,0
-DA:243,0
-DA:244,0
-DA:255,0
-DA:257,0
-DA:258,0
-DA:270,0
-DA:272,0
-DA:273,0
-DA:285,0
-DA:286,0
-DA:289,0
-DA:290,0
-DA:347,0
-DA:348,0
-DA:351,0
-DA:352,0
-DA:356,0
-DA:357,0
-DA:360,0
-DA:361,0
-DA:364,0
-DA:366,0
-DA:368,0
-DA:369,0
-DA:371,0
-DA:372,0
-DA:374,0
-DA:388,0
-DA:390,0
-DA:391,0
-DA:392,0
-DA:398,0
-DA:403,0
-DA:405,0
-DA:406,0
-DA:415,0
-DA:417,0
-DA:418,0
-DA:419,0
-DA:420,0
-DA:421,0
-DA:436,0
-DA:437,0
-DA:444,0
-DA:445,0
-DA:452,0
-DA:453,0
-DA:463,0
-DA:464,0
-DA:471,0
-DA:472,0
-DA:475,0
-DA:476,0
-DA:479,0
-DA:480,0
-DA:487,0
-DA:488,0
-DA:491,0
-DA:492,0
-DA:495,0
-DA:496,0
-DA:499,0
-DA:500,0
-DA:562,0
-DA:584,0
-DA:585,0
-DA:596,0
-DA:599,0
-DA:603,0
-DA:606,0
-DA:610,0
-DA:611,0
-DA:614,0
-DA:617,0
-DA:641,0
-DA:642,0
-DA:846,0
-DA:850,0
-DA:852,0
-DA:854,0
-DA:857,0
-DA:858,0
-DA:936,0
-DA:939,0
-DA:941,0
-DA:942,0
-DA:943,0
-DA:944,0
-DA:946,0
-DA:954,0
-DA:956,0
-DA:957,0
-DA:958,0
-DA:960,0
-DA:961,0
-DA:1133,0
-DA:1135,0
-DA:1136,0
-DA:1137,0
-DA:1138,0
-DA:1140,0
-DA:1141,0
-DA:1142,0
-DA:1144,0
-DA:1145,0
-DA:1147,0
-DA:1148,0
-DA:1150,0
-DA:1152,0
-DA:1153,0
-DA:1154,0
-DA:1178,0
-DA:1181,0
-DA:1183,0
-DA:1186,0
-DA:1188,0
-DA:1190,0
-DA:1194,0
-DA:1195,0
-DA:1196,0
-DA:1197,0
-DA:1200,0
-DA:1201,0
-DA:1204,0
-DA:1207,0
-DA:1209,0
-DA:1213,0
-DA:1214,0
-DA:1215,0
-DA:1216,0
-DA:1219,0
-DA:1220,0
-DA:1222,0
-DA:1225,0
-DA:1230,0
-DA:1390,0
-DA:1392,0
-DA:1395,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:939,0
-BA:939,0
-BA:956,0
-BA:956,0
-BA:957,0
-BA:957,0
-BA:1138,0
-BA:1138,0
-BA:1142,0
-BA:1142,0
-BA:1145,0
-BA:1145,0
-BA:1147,0
-BA:1147,0
-BA:1152,0
-BA:1152,0
-BA:1181,0
-BA:1181,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1190,0
-BA:1190,0
-BA:1195,0
-BA:1195,0
-BA:1197,0
-BA:1197,0
-BA:1200,0
-BA:1200,0
-BA:1209,0
-BA:1209,0
-BA:1214,0
-BA:1214,0
-BA:1216,0
-BA:1216,0
-BA:1219,0
-BA:1219,0
-BA:1395,0
-BA:1395,0
-BA:1395,0
-BA:1395,0
-LF:147
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyIPSsS2_EET0_T_S4_S3_
-FN:113,_ZSt18uninitialized_copyIPSsS0_ET0_T_S2_S1_
-FN:261,_ZSt22__uninitialized_copy_aIPSsS0_SsET0_T_S2_S1_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPSsS0_SaISsEET0_T_S3_S2_RT1_
-DA:73,0
-DA:75,0
-DA:78,0
-DA:79,0
-DA:81,0
-DA:83,0
-DA:85,0
-DA:86,0
-DA:113,0
-DA:122,0
-DA:261,0
-DA:262,0
-DA:268,0
-DA:272,0
-BA:78,0
-BA:78,0
-BA:79,0
-BA:79,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:484,_ZNKSt6vectorISsSaISsEE4sizeEv
-FN:101,_ZNKSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:395,_ZNSt6vectorISsSaISsEE3endEv
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:84,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseISsSaISsEEC2Ev
-FN:213,_ZNSt6vectorISsSaISsEEC1Ev
-FN:489,_ZNKSt6vectorISsSaISsEE8max_sizeEv
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-FN:1075,_ZNKSt6vectorISsSaISsEE12_M_check_lenEjPKc
-FN:143,_ZNSt12_Vector_baseISsSaISsEE11_M_allocateEj
-FN:686,_ZNSt6vectorISsSaISsEE9push_backERKSs
-DA:79,0
-DA:84,0
-DA:85,0
-DA:86,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:108,0
-DA:109,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:143,0
-DA:144,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:213,0
-DA:214,0
-DA:299,0
-DA:300,0
-DA:301,0
-DA:395,0
-DA:396,0
-DA:484,0
-DA:485,0
-DA:489,0
-DA:490,0
-DA:686,0
-DA:688,0
-DA:690,0
-DA:691,0
-DA:694,0
-DA:695,0
-DA:1075,0
-DA:1077,0
-DA:1078,0
-DA:1080,0
-DA:1081,0
-BA:144,0
-BA:144,0
-BA:149,0
-BA:149,0
-BA:688,0
-BA:688,0
-BA:1077,0
-BA:1077,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-LF:41
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/vector.tcc
-FN:283,_ZNSt6vectorISsSaISsEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPSsS1_EERKSs
-DA:283,0
-DA:286,0
-DA:288,0
-DA:291,0
-DA:293,0
-DA:295,0
-DA:299,0
-DA:307,0
-DA:308,0
-DA:309,0
-DA:316,0
-DA:321,0
-DA:323,0
-DA:324,0
-DA:330,0
-DA:332,0
-DA:333,0
-DA:334,0
-DA:336,0
-DA:338,0
-DA:341,0
-DA:342,0
-DA:343,0
-DA:345,0
-BA:286,0
-BA:286,0
-LF:24
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISsE8max_sizeEv
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE8max_sizeEv
-FN:118,_ZN9__gnu_cxx13new_allocatorISsE7destroyEPSs
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE10deallocateEPS2_j
-FN:107,_ZN9__gnu_cxx13new_allocatorISsE9constructEPSsRKSs
-FN:87,_ZN9__gnu_cxx13new_allocatorISsE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE8allocateEjPKv
-DA:69,0
-DA:71,0
-DA:76,0
-DA:87,0
-DA:89,0
-DA:90,0
-DA:92,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:107,0
-DA:108,0
-DA:118,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:108,0
-BA:108,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-DA:95,0
-DA:112,0
-DA:117,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/wibble/exception.h
-FN:190,_ZNK6wibble9exception7Generic4typeEv
-FN:137,_ZN6wibble9exception7ContextD2Ev
-FN:187,_ZN6wibble9exception7GenericD2Ev
-FN:395,_ZN6wibble9exception6SystemD1Ev
-FN:193,_ZNK6wibble9exception7Generic4descEv
-FN:213,_ZNK6wibble9exception7Generic4whatEv
-FN:187,_ZN6wibble9exception7GenericD0Ev
-FN:187,_ZN6wibble9exception7GenericD1Ev
-FN:154,_ZNK6wibble9exception7Context13formatContextEv
-FN:205,_ZNK6wibble9exception7Generic8fullInfoEv
-DA:137,0
-DA:154,0
-DA:155,0
-DA:156,0
-DA:157,0
-DA:159,0
-DA:161,0
-DA:162,0
-DA:163,0
-DA:187,0
-DA:190,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:205,0
-DA:206,0
-DA:207,0
-DA:209,0
-DA:210,0
-DA:213,0
-DA:395,0
-BA:156,0
-BA:156,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:207,0
-BA:207,0
-BA:395,0
-BA:395,0
-LF:21
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/sys/pipe.h
-FN:42,_ZN6wibble3sys4Pipe3eofEv
-FN:32,_ZN6wibble3sys4PipeC1Ev
-FN:19,_ZN6wibble3sys4PipeD1Ev
-FN:25,_ZN6wibble3sys4PipeC1Ei
-FN:19,_ZN6wibble3sys4PipeaSERKS1_
-FN:46,_ZN6wibble3sys4Pipe8readMoreEv
-FN:60,_ZN6wibble3sys4Pipe8nextLineEv
-FN:75,_ZN6wibble3sys4Pipe16nextLineBlockingEv
-DA:19,4
-DA:25,2
-DA:27,2
-DA:28,0
-DA:29,2
-DA:30,0
-DA:31,0
-DA:32,2
-DA:42,923
-DA:43,923
-DA:46,638
-DA:48,638
-DA:49,638
-DA:50,0
-DA:51,638
-DA:52,213
-DA:53,425
-DA:54,0
-DA:56,425
-DA:57,425
-DA:60,674
-DA:62,674
-DA:63,1099
-DA:65,674
-DA:66,674
-DA:67,213
-DA:69,461
-DA:70,461
-DA:71,461
-DA:72,461
-DA:75,461
-DA:77,461
-DA:78,461
-DA:79,1135
-DA:80,674
-DA:81,674
-DA:82,461
-DA:83,213
-DA:84,213
-DA:86,0
-BA:27,2
-BA:27,1
-BA:29,1
-BA:29,2
-BA:49,2
-BA:49,2
-BA:49,1
-BA:49,2
-BA:51,2
-BA:51,2
-BA:53,1
-BA:53,2
-BA:63,2
-BA:63,2
-BA:63,2
-BA:63,2
-BA:63,2
-BA:63,2
-BA:66,2
-BA:66,2
-BA:77,2
-BA:77,2
-BA:79,2
-BA:79,1
-BA:81,2
-BA:81,2
-LF:40
-LH:34
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test-main.h
-FN:31,_ZN4MainC1Ev
-FN:9,_ZN4MainD1Ev
-FN:63,_ZN4Main8testDiedEv
-FN:38,_ZN4Main5childEv
-FN:86,_ZN4Main13processStatusESs
-FN:139,_ZN4Main6parentEv
-FN:163,_ZN4Main4mainEiPPc
-FN:188,main
-DA:9,0
-DA:31,1
-DA:32,1
-DA:33,1
-DA:34,1
-DA:35,1
-DA:36,1
-DA:38,1
-DA:39,1
-DA:40,1
-DA:41,1
-DA:42,1
-DA:43,1
-DA:44,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:50,0
-DA:51,0
-DA:52,0
-DA:54,0
-DA:56,1
-DA:57,1
-DA:59,1
-DA:60,1
-DA:63,0
-DA:67,0
-DA:68,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:73,0
-DA:74,0
-DA:75,0
-DA:76,0
-DA:77,0
-DA:78,0
-DA:80,0
-DA:81,0
-DA:82,0
-DA:83,0
-DA:86,249
-DA:87,249
-DA:88,1
-DA:89,1
-DA:90,2
-DA:91,2
-DA:94,1
-DA:95,1
-DA:98,248
-DA:101,106
-DA:102,106
-DA:103,106
-DA:104,106
-DA:107,248
-DA:108,36
-DA:110,18
-DA:111,18
-DA:112,18
-DA:113,18
-DA:114,18
-DA:115,18
-DA:117,36
-DA:118,18
-DA:120,18
-DA:121,18
-DA:125,248
-DA:126,212
-DA:127,106
-DA:128,106
-DA:129,106
-DA:131,212
-DA:132,106
-DA:133,106
-DA:134,106
-DA:137,248
-DA:139,1
-DA:140,1
-DA:141,1
-DA:142,1
-DA:143,1
-DA:144,1
-DA:146,248
-DA:147,249
-DA:148,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:153,0
-DA:154,0
-DA:158,249
-DA:159,249
-DA:160,0
-DA:163,1
-DA:165,1
-DA:166,1
-DA:168,1
-DA:169,1
-DA:171,0
-DA:172,1
-DA:173,0
-DA:174,1
-DA:175,0
-DA:176,1
-DA:177,2
-DA:178,0
-DA:179,2
-DA:180,1
-DA:182,1
-DA:188,1
-DA:189,1
-BA:43,1
-BA:43,2
-BA:45,0
-BA:45,0
-BA:50,0
-BA:50,0
-BA:51,0
-BA:51,0
-BA:56,2
-BA:56,1
-BA:67,0
-BA:67,0
-BA:68,0
-BA:68,0
-BA:70,0
-BA:70,0
-BA:74,0
-BA:74,0
-BA:76,0
-BA:76,0
-BA:87,2
-BA:87,2
-BA:98,2
-BA:98,2
-BA:107,2
-BA:107,2
-BA:108,2
-BA:108,2
-BA:117,2
-BA:117,2
-BA:118,2
-BA:118,1
-BA:125,2
-BA:125,2
-BA:126,2
-BA:126,2
-BA:131,2
-BA:131,2
-BA:147,1
-BA:147,2
-BA:149,0
-BA:149,0
-BA:172,1
-BA:172,2
-BA:174,1
-BA:174,2
-BA:177,1
-BA:177,2
-BA:179,2
-BA:179,2
-LF:111
-LH:75
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test-runner.h
-FN:17,_ZN6RunAllC1Ev
-FN:17,_ZN6RunAllD1Ev
-FN:23,_ZN6RunAll9findSuiteESs
-FN:30,_ZN6RunAll10waitForAckEv
-FN:53,_ZN6RunAll7runTestER8RunSuitei
-FN:35,_ZN6RunAll8runSuiteER8RunSuiteiii
-FN:66,_ZN6RunAll7runFromEii
-DA:17,1
-DA:23,0
-DA:24,0
-DA:25,0
-DA:26,0
-DA:27,0
-DA:30,212
-DA:31,212
-DA:32,212
-DA:33,212
-DA:35,18
-DA:37,18
-DA:38,124
-DA:40,106
-DA:41,106
-DA:42,106
-DA:43,106
-DA:44,106
-DA:45,106
-DA:46,106
-DA:50,18
-DA:51,18
-DA:53,0
-DA:55,0
-DA:56,0
-DA:57,0
-DA:58,0
-DA:59,0
-DA:60,0
-DA:61,0
-DA:62,0
-DA:63,0
-DA:64,0
-DA:66,1
-DA:68,38
-DA:69,18
-DA:70,18
-DA:71,18
-DA:73,1
-BA:24,0
-BA:24,0
-BA:25,0
-BA:25,0
-BA:38,2
-BA:38,2
-BA:68,2
-BA:68,2
-LF:39
-LH:23
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:13,_ZN8LocationD1Ev
-FN:52,_ZlsISsER12AssertFailedS1_T_
-FN:17,_ZN8LocationC1EPKciSs
-FN:13,_ZN8LocationC1ERKS_
-FN:52,_ZlsIPKcER12AssertFailedS3_T_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:52,_ZlsIiER12AssertFailedS1_T_
-FN:41,_ZN12AssertFailedD1Ev
-FN:67,_Z12assert_eq_fnISsSsEv8LocationT_T0_
-FN:59,_Z9assert_fnIbEv8LocationT_
-FN:67,_Z12assert_eq_fnIiiEv8LocationT_T0_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:59,0
-DA:61,0
-DA:62,0
-DA:64,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:75,0
-BA:42,0
-BA:42,0
-BA:61,0
-BA:61,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-LF:26
-LH:0
-end_of_record
-SF:/srv/build/pkg/ept-work/default/ept/ept-test-generated-main.cpp
-FN:273,_Z41__static_initialization_and_destruction_0ii
-FN:273,_GLOBAL__I_ept_test_generated_main.cpp
-DA:273,3
-BA:273,2
-BA:273,1
-BA:273,2
-BA:273,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC2Ev
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaIcED1Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaISsED2Ev
-FN:106,_ZNSaIPcED1Ev
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-FN:104,_ZNSaIPcEC1IcEERKSaIT_E
-DA:98,0
-DA:100,0
-DA:101,0
-DA:104,6
-DA:106,6
-DA:118,0
-DA:119,0
-LF:7
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:1534,_ZNKSs5c_strEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:612,_ZNKSs6lengthEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:188,_ZNKSs4_Rep12_M_is_leakedEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:369,_ZNSs13_S_copy_charsISt15_Deque_iteratorIcRcPcEEEvS2_T_S4_
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:1462,_ZNSs16_S_construct_auxISt15_Deque_iteratorIcRcPcEEES2_T_S4_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructISt15_Deque_iteratorIcRcPcEEES2_T_S4_RKSaIcE
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:376,_ZNSs13_S_copy_charsEPcN9__gnu_cxx17__normal_iteratorIS_SsEES2_
-FN:1462,_ZNSs16_S_construct_auxIN9__gnu_cxx17__normal_iteratorIPcSsEEEES2_T_S4_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIN9__gnu_cxx17__normal_iteratorIPcSsEEEES2_T_S4_RKSaIcE
-FN:835,_ZNSs6appendEPKc
-FN:2121,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-FN:501,_ZNSsaSERKSs
-FN:2176,_ZSteqIcSt11char_traitsIcESaIcEEbPKT_RKSbIS3_T0_T1_E
-FN:2188,_ZSteqIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_EPKS3_
-FN:2162,_ZSteqIcEN9__gnu_cxx11__enable_ifIXsrSt9__is_charIT_E7__valueEbE6__typeERKSbIS3_St11char_traitsIS3_ESaIS3_EESC_
-FN:299,_ZNSs7_M_leakEv
-FN:718,_ZNSsixEj
-FN:551,_ZNSs3endEv
-FN:532,_ZNSs5beginEv
-DA:178,0
-DA:183,0
-DA:184,0
-DA:188,0
-DA:189,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:299,0
-DA:301,0
-DA:302,0
-DA:303,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:369,461
-DA:371,5268
-DA:372,4807
-DA:373,461
-DA:376,0
-DA:377,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:532,0
-DA:534,0
-DA:535,0
-DA:551,0
-DA:553,0
-DA:554,0
-DA:606,0
-DA:607,0
-DA:612,0
-DA:613,0
-DA:686,0
-DA:687,0
-DA:718,0
-DA:724,0
-DA:725,0
-DA:835,0
-DA:838,0
-DA:1462,585
-DA:1465,585
-DA:1478,585
-DA:1481,585
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2121,0
-DA:2123,0
-DA:2124,0
-DA:2125,0
-DA:2162,0
-DA:2165,0
-DA:2176,0
-DA:2177,0
-DA:2188,0
-DA:2189,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:301,0
-BA:301,0
-BA:341,0
-BA:341,0
-BA:371,2
-BA:371,2
-BA:2165,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-LF:94
-LH:8
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructISt15_Deque_iteratorIcRcPcEEES2_T_S4_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1ISt15_Deque_iteratorIcRcPcEEET_S4_RKSaIcE
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-FN:130,_ZNSs12_S_constructIN9__gnu_cxx17__normal_iteratorIPcSsEEEES2_T_S4_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IN9__gnu_cxx17__normal_iteratorIPcSsEEEET_S4_RKSaIcE
-DA:130,585
-DA:133,585
-DA:134,0
-DA:137,585
-DA:139,0
-DA:142,585
-DA:144,585
-DA:146,585
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,585
-DA:153,585
-DA:234,585
-DA:235,585
-DA:236,585
-BA:133,1
-BA:133,2
-BA:133,0
-BA:133,0
-BA:133,1
-BA:133,2
-BA:133,0
-BA:133,0
-BA:133,1
-BA:133,2
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,1
-BA:133,2
-BA:133,0
-BA:133,0
-BA:133,1
-BA:133,2
-BA:133,0
-BA:133,0
-BA:133,1
-BA:133,2
-BA:137,1
-BA:137,2
-BA:137,0
-BA:137,0
-BA:137,1
-BA:137,2
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,1
-BA:137,2
-BA:137,0
-BA:137,0
-BA:137,1
-BA:137,2
-LF:16
-LH:11
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-DA:245,4807
-DA:246,4807
-DA:257,0
-DA:258,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:8
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/deque.tcc
-FN:159,_ZNSt5dequeIcSaIcEE5eraseESt15_Deque_iteratorIcRcPcES5_
-FN:766,_ZNSt5dequeIcSaIcEE17_M_reallocate_mapEjb
-FN:716,_ZNSt5dequeIcSaIcEE24_M_new_elements_at_frontEj
-FN:741,_ZNSt5dequeIcSaIcEE23_M_new_elements_at_backEj
-FN:608,_ZNSt5dequeIcSaIcEE13_M_insert_auxISt15_Deque_iteratorIcRKcPS4_EEEvS3_IcRcPcET_SB_j
-FN:435,_ZNSt5dequeIcSaIcEE19_M_range_insert_auxISt15_Deque_iteratorIcRKcPS4_EEEvS3_IcRcPcET_SB_St20forward_iterator_tag
-FN:70,_ZNSt5dequeIcSaIcEEaSERKS1_
-FN:335,_ZNSt5dequeIcSaIcEE16_M_push_back_auxERKc
-DA:70,2
-DA:72,2
-DA:73,2
-DA:75,2
-DA:76,2
-DA:80,0
-DA:81,0
-DA:82,0
-DA:85,2
-DA:159,461
-DA:161,461
-DA:163,425
-DA:164,425
-DA:168,36
-DA:169,36
-DA:170,36
-DA:172,36
-DA:173,0
-DA:174,36
-DA:178,0
-DA:179,0
-DA:180,0
-DA:182,36
-DA:335,11
-DA:338,11
-DA:339,11
-DA:346,11
-DA:348,11
-DA:350,11
-DA:352,0
-DA:354,0
-DA:355,0
-DA:357,11
-DA:435,0
-DA:437,0
-DA:438,0
-DA:440,0
-DA:443,0
-DA:445,0
-DA:447,0
-DA:449,0
-DA:451,0
-DA:454,0
-DA:456,0
-DA:459,0
-DA:462,0
-DA:464,0
-DA:466,0
-DA:468,0
-DA:472,0
-DA:473,0
-DA:608,0
-DA:610,0
-DA:611,0
-DA:612,0
-DA:614,0
-DA:615,0
-DA:616,0
-DA:619,0
-DA:622,0
-DA:623,0
-DA:626,0
-DA:627,0
-DA:628,0
-DA:632,0
-DA:633,0
-DA:634,0
-DA:638,0
-DA:639,0
-DA:642,0
-DA:644,0
-DA:646,0
-DA:651,0
-DA:652,0
-DA:654,0
-DA:655,0
-DA:658,0
-DA:661,0
-DA:662,0
-DA:666,0
-DA:667,0
-DA:668,0
-DA:672,0
-DA:673,0
-DA:674,0
-DA:678,0
-DA:679,0
-DA:682,0
-DA:684,0
-DA:686,0
-DA:689,0
-DA:716,0
-DA:718,0
-DA:719,0
-DA:722,0
-DA:723,0
-DA:727,0
-DA:728,0
-DA:730,0
-DA:732,0
-DA:733,0
-DA:734,0
-DA:736,0
-DA:741,0
-DA:743,0
-DA:744,0
-DA:747,0
-DA:748,0
-DA:752,0
-DA:753,0
-DA:755,0
-DA:757,0
-DA:758,0
-DA:759,0
-DA:761,0
-DA:766,0
-DA:769,0
-DA:770,0
-DA:773,0
-DA:775,0
-DA:778,0
-DA:779,0
-DA:783,0
-DA:791,0
-DA:793,0
-DA:794,0
-DA:796,0
-DA:799,0
-DA:801,0
-DA:802,0
-DA:805,0
-DA:806,0
-DA:807,0
-BA:73,2
-BA:73,1
-BA:75,2
-BA:75,1
-BA:161,2
-BA:161,1
-BA:161,2
-BA:161,2
-BA:161,2
-BA:161,2
-BA:170,2
-BA:170,1
-BA:172,1
-BA:172,2
-BA:178,0
-BA:178,0
-BA:438,0
-BA:438,0
-BA:454,0
-BA:454,0
-BA:612,0
-BA:612,0
-BA:619,0
-BA:619,0
-BA:658,0
-BA:658,0
-BA:718,0
-BA:718,0
-BA:727,0
-BA:727,0
-BA:732,0
-BA:732,0
-BA:743,0
-BA:743,0
-BA:752,0
-BA:752,0
-BA:757,0
-BA:757,0
-BA:773,0
-BA:773,0
-BA:775,0
-BA:775,0
-BA:778,0
-BA:778,0
-BA:794,0
-BA:794,0
-LF:133
-LH:23
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algo.h
-FN:171,_ZSt6__findISt15_Deque_iteratorIcRcPcEcET_S4_S4_RKT0_St26random_access_iterator_tag
-FN:3806,_ZSt4findISt15_Deque_iteratorIcRcPcEcET_S4_S4_RKT0_
-DA:171,1348
-DA:174,1348
-DA:176,2463
-DA:178,1438
-DA:179,22
-DA:180,1416
-DA:182,1416
-DA:183,7
-DA:184,1409
-DA:186,1409
-DA:187,11
-DA:188,1398
-DA:190,1398
-DA:191,283
-DA:192,1115
-DA:195,1025
-DA:198,51
-DA:199,0
-DA:200,51
-DA:202,109
-DA:203,0
-DA:204,109
-DA:206,174
-DA:207,174
-DA:208,0
-DA:211,851
-DA:3806,1348
-DA:3814,1348
-BA:176,2
-BA:176,2
-BA:178,2
-BA:178,2
-BA:182,2
-BA:182,2
-BA:186,2
-BA:186,2
-BA:190,2
-BA:190,2
-BA:195,2
-BA:195,2
-BA:195,2
-BA:195,2
-BA:198,1
-BA:198,2
-BA:202,1
-BA:202,2
-BA:206,2
-BA:206,1
-LF:28
-LH:25
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb0EE3__bES7_
-FN:286,_ZNSt12__miter_baseIPcLb0EE3__bES0_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb1EE3__bES7_
-FN:268,_ZNSt12__niter_baseISt16ostream_iteratorISscSt11char_traitsIcEELb0EE3__bES3_
-FN:268,_ZNSt12__niter_baseIPcLb0EE3__bES0_
-FN:268,_ZNSt12__niter_baseISt20back_insert_iteratorISt5dequeIcSaIcEEELb0EE3__bES4_
-FN:286,_ZNSt12__miter_baseISt15_Deque_iteratorIcRcPcELb0EE3__bES3_
-FN:286,_ZNSt12__miter_baseISt15_Deque_iteratorIcRKcPS1_ELb0EE3__bES4_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:268,_ZNSt12__niter_baseISt15_Deque_iteratorIcRcPcELb0EE3__bES3_
-FN:268,_ZNSt12__niter_baseISt15_Deque_iteratorIcRKcPS1_ELb0EE3__bES4_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mISt15_Deque_iteratorIcRcPcES6_EET0_T_S8_S7_
-FN:385,_ZSt13__copy_move_aILb0ESt15_Deque_iteratorIcRcPcES3_ET1_T0_S5_S4_
-FN:430,_ZSt14__copy_move_a2ILb0ESt15_Deque_iteratorIcRcPcES3_ET1_T0_S5_S4_
-FN:456,_ZSt4copyISt15_Deque_iteratorIcRcPcES3_ET0_T_S5_S4_
-FN:539,_ZNSt20__copy_move_backwardILb0ELb0ESt26random_access_iterator_tagE13__copy_move_bISt15_Deque_iteratorIcRcPcES6_EET0_T_S8_S7_
-FN:579,_ZSt22__copy_move_backward_aILb0ESt15_Deque_iteratorIcRcPcES3_ET1_T0_S5_S4_
-FN:597,_ZSt23__copy_move_backward_a2ILb0ESt15_Deque_iteratorIcRcPcES3_ET1_T0_S5_S4_
-FN:624,_ZSt13copy_backwardISt15_Deque_iteratorIcRcPcES3_ET0_T_S5_S4_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mISt15_Deque_iteratorIcRKcPS4_ES3_IcRcPcEEET0_T_SC_SB_
-FN:385,_ZSt13__copy_move_aILb0ESt15_Deque_iteratorIcRKcPS1_ES0_IcRcPcEET1_T0_S9_S8_
-FN:430,_ZSt14__copy_move_a2ILb0ESt15_Deque_iteratorIcRKcPS1_ES0_IcRcPcEET1_T0_S9_S8_
-FN:456,_ZSt4copyISt15_Deque_iteratorIcRKcPS1_ES0_IcRcPcEET0_T_S9_S8_
-FN:286,_ZNSt12__miter_baseIPPcLb0EE3__bES1_
-FN:268,_ZNSt12__niter_baseIPPcLb0EE3__bES1_
-FN:569,_ZNSt20__copy_move_backwardILb0ELb1ESt26random_access_iterator_tagE13__copy_move_bIPcEEPT_PKS4_S7_S5_
-FN:579,_ZSt22__copy_move_backward_aILb0EPPcS1_ET1_T0_S3_S2_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPPcS1_ET1_T0_S3_S2_
-FN:624,_ZSt13copy_backwardIPPcS1_ET0_T_S3_S2_
-FN:375,_ZNSt11__copy_moveILb0ELb1ESt26random_access_iterator_tagE8__copy_mIPcEEPT_PKS4_S7_S5_
-FN:385,_ZSt13__copy_move_aILb0EPPcS1_ET1_T0_S3_S2_
-FN:430,_ZSt14__copy_move_a2ILb0EPPcS1_ET1_T0_S3_S2_
-FN:456,_ZSt4copyIPPcS1_ET0_T_S3_S2_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPcSt20back_insert_iteratorISt5dequeIcSaIcEEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPcSt20back_insert_iteratorISt5dequeIcSaIcEEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EPcSt20back_insert_iteratorISt5dequeIcSaIcEEEET1_T0_S7_S6_
-FN:456,_ZSt4copyIPcSt20back_insert_iteratorISt5dequeIcSaIcEEEET0_T_S7_S6_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPKSsSt16ostream_iteratorISscSt11char_traitsIcEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPKSsSt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_SD_SC_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET0_T_SD_SC_
-DA:210,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:268,1281
-DA:269,1281
-DA:276,0
-DA:277,0
-DA:286,854
-DA:287,854
-DA:337,427
-DA:340,5695
-DA:342,5268
-DA:343,5268
-DA:344,5268
-DA:346,427
-DA:375,0
-DA:377,0
-DA:379,0
-DA:385,427
-DA:393,427
-DA:396,427
-DA:430,427
-DA:435,427
-DA:456,427
-DA:466,427
-DA:539,0
-DA:542,0
-DA:543,0
-DA:544,0
-DA:569,0
-DA:571,0
-DA:572,0
-DA:573,0
-DA:579,0
-DA:587,0
-DA:592,0
-DA:597,0
-DA:602,0
-DA:624,0
-DA:636,0
-BA:215,0
-BA:215,0
-BA:340,0
-BA:340,0
-BA:340,1
-BA:340,2
-BA:340,2
-BA:340,2
-BA:340,0
-BA:340,0
-BA:542,0
-BA:542,0
-LF:41
-LH:17
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:97,_ZSt8_DestroyISt15_Deque_iteratorIcRcPcEEvT_S4_
-FN:126,_ZSt8_DestroyISt15_Deque_iteratorIcRcPcEcEvT_S4_RSaIT0_E
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-DA:87,0
-DA:88,0
-DA:97,0
-DA:101,0
-DA:103,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-BA:101,0
-BA:101,0
-LF:9
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_deque.h
-FN:82,_ZSt16__deque_buf_sizej
-FN:127,_ZNSt15_Deque_iteratorIcRcPcEC1ERKS2_
-FN:868,_ZNSt5dequeIcSaIcEE3endEv
-FN:851,_ZNSt5dequeIcSaIcEE5beginEv
-FN:240,_ZSteqIcRcPcEbRKSt15_Deque_iteratorIT_T0_T1_ES8_
-FN:416,_ZNSt11_Deque_baseIcSaIcEE11_Deque_implD1Ev
-FN:434,_ZNSt11_Deque_baseIcSaIcEE19_M_get_Tp_allocatorEv
-FN:1601,_ZNSt5dequeIcSaIcEE15_M_destroy_dataESt15_Deque_iteratorIcRcPcES5_RKS0_
-FN:253,_ZStneIcRcPcEbRKSt15_Deque_iteratorIT_T0_T1_ES8_
-FN:132,_ZNKSt15_Deque_iteratorIcRcPcEdeEv
-FN:103,_ZNSt15_Deque_iteratorIcRcPcE14_S_buffer_sizeEv
-FN:226,_ZNSt15_Deque_iteratorIcRcPcE11_M_set_nodeEPS1_
-FN:140,_ZNSt15_Deque_iteratorIcRcPcEppEv
-FN:324,_ZStmiIcRcPcENSt15_Deque_iteratorIT_T0_T1_E15difference_typeERKS6_S9_
-FN:956,_ZNKSt5dequeIcSaIcEE4sizeEv
-FN:180,_ZNSt15_Deque_iteratorIcRcPcEpLEi
-FN:199,_ZNKSt15_Deque_iteratorIcRcPcEplEi
-FN:206,_ZNSt15_Deque_iteratorIcRcPcEmIEi
-FN:210,_ZNKSt15_Deque_iteratorIcRcPcEmiEi
-FN:127,_ZNSt15_Deque_iteratorIcRKcPS0_EC1ERKS_IcRcPcE
-FN:859,_ZNKSt5dequeIcSaIcEE5beginEv
-FN:877,_ZNKSt5dequeIcSaIcEE3endEv
-FN:124,_ZNSt15_Deque_iteratorIcRcPcEC1Ev
-FN:422,_ZNSt11_Deque_baseIcSaIcEE11_Deque_implC1Ev
-FN:670,_ZNSt5dequeIcSaIcEE14_S_buffer_sizeEv
-FN:103,_ZNSt15_Deque_iteratorIcRKcPS0_E14_S_buffer_sizeEv
-FN:226,_ZNSt15_Deque_iteratorIcRKcPS0_E11_M_set_nodeEPPc
-FN:180,_ZNSt15_Deque_iteratorIcRKcPS0_EpLEi
-FN:199,_ZNKSt15_Deque_iteratorIcRKcPS0_EplEi
-FN:438,_ZNKSt11_Deque_baseIcSaIcEE19_M_get_Tp_allocatorEv
-FN:442,_ZNKSt11_Deque_baseIcSaIcEE20_M_get_map_allocatorEv
-FN:160,_ZNSt15_Deque_iteratorIcRcPcEmmEv
-FN:324,_ZStmiIcRKcPS0_ENSt15_Deque_iteratorIT_T0_T1_E15difference_typeERKS7_SA_
-FN:132,_ZNKSt15_Deque_iteratorIcRKcPS0_EdeEv
-FN:140,_ZNSt15_Deque_iteratorIcRKcPS0_EppEv
-FN:961,_ZNKSt5dequeIcSaIcEE8max_sizeEv
-FN:458,_ZNSt11_Deque_baseIcSaIcEE15_M_allocate_mapEj
-FN:446,_ZNSt11_Deque_baseIcSaIcEE16_M_allocate_nodeEv
-FN:452,_ZNSt11_Deque_baseIcSaIcEE18_M_deallocate_nodeEPc
-FN:554,_ZNSt11_Deque_baseIcSaIcEE16_M_destroy_nodesEPPcS3_
-FN:536,_ZNSt11_Deque_baseIcSaIcEE15_M_create_nodesEPPcS3_
-FN:1619,_ZNSt5dequeIcSaIcEE15_M_erase_at_endESt15_Deque_iteratorIcRcPcE
-FN:1373,_ZNSt5dequeIcSaIcEE5clearEv
-FN:1609,_ZNSt5dequeIcSaIcEE17_M_erase_at_beginESt15_Deque_iteratorIcRcPcE
-FN:462,_ZNSt11_Deque_baseIcSaIcEE17_M_deallocate_mapEPPcj
-FN:497,_ZNSt11_Deque_baseIcSaIcEE17_M_initialize_mapEj
-FN:377,_ZNSt11_Deque_baseIcSaIcEEC2Ev
-FN:695,_ZNSt5dequeIcSaIcEEC1Ev
-FN:476,_ZNSt11_Deque_baseIcSaIcEED2Ev
-FN:775,_ZNSt5dequeIcSaIcEED1Ev
-FN:1674,_ZNSt5dequeIcSaIcEE23_M_reserve_map_at_frontEj
-FN:1630,_ZNSt5dequeIcSaIcEE28_M_reserve_elements_at_frontEj
-FN:1666,_ZNSt5dequeIcSaIcEE22_M_reserve_map_at_backEj
-FN:1640,_ZNSt5dequeIcSaIcEE27_M_reserve_elements_at_backEj
-FN:1540,_ZNSt5dequeIcSaIcEE18_M_insert_dispatchISt15_Deque_iteratorIcRKcPS4_EEEvS3_IcRcPcET_SB_St12__false_type
-FN:1297,_ZNSt5dequeIcSaIcEE6insertISt15_Deque_iteratorIcRKcPS4_EEEvS3_IcRcPcET_SB_
-FN:1159,_ZNSt5dequeIcSaIcEE9push_backERKc
-DA:82,3101
-DA:83,3101
-DA:103,3065
-DA:104,3065
-DA:124,8
-DA:125,8
-DA:127,19356
-DA:129,19356
-DA:132,10802
-DA:133,10802
-DA:140,10766
-DA:142,10766
-DA:143,10766
-DA:145,23
-DA:146,23
-DA:148,10766
-DA:160,0
-DA:162,0
-DA:164,0
-DA:165,0
-DA:167,0
-DA:168,0
-DA:180,72
-DA:182,72
-DA:183,72
-DA:184,71
-DA:190,1
-DA:191,1
-DA:192,1
-DA:195,72
-DA:199,72
-DA:201,72
-DA:202,72
-DA:206,0
-DA:207,0
-DA:210,0
-DA:212,0
-DA:213,0
-DA:226,43
-DA:228,43
-DA:229,43
-DA:230,43
-DA:231,43
-DA:240,8460
-DA:241,8460
-DA:253,5304
-DA:254,5304
-DA:324,2948
-DA:329,2948
-DA:377,4
-DA:378,4
-DA:379,4
-DA:416,2
-DA:422,4
-DA:424,4
-DA:425,4
-DA:434,465
-DA:435,465
-DA:438,6
-DA:439,6
-DA:442,6
-DA:443,6
-DA:446,15
-DA:448,15
-DA:452,13
-DA:454,13
-DA:455,13
-DA:458,4
-DA:459,4
-DA:462,2
-DA:463,2
-DA:476,2
-DA:478,2
-DA:480,2
-DA:482,2
-DA:484,2
-DA:497,4
-DA:500,4
-DA:502,4
-DA:504,4
-DA:512,4
-DA:513,4
-DA:516,4
-DA:517,0
-DA:519,0
-DA:520,0
-DA:521,0
-DA:522,0
-DA:525,4
-DA:526,4
-DA:527,4
-DA:528,4
-DA:531,4
-DA:536,4
-DA:541,8
-DA:542,4
-DA:544,0
-DA:546,0
-DA:547,0
-DA:549,4
-DA:554,465
-DA:556,478
-DA:557,13
-DA:558,465
-DA:670,0
-DA:671,0
-DA:695,4
-DA:696,4
-DA:775,2
-DA:776,2
-DA:851,3338
-DA:852,3338
-DA:859,2
-DA:860,2
-DA:868,4436
-DA:869,4436
-DA:877,2
-DA:878,2
-DA:956,40
-DA:957,40
-DA:961,0
-DA:962,0
-DA:1159,5268
-DA:1161,5268
-DA:1164,5257
-DA:1165,5257
-DA:1168,11
-DA:1169,5268
-DA:1297,0
-DA:1301,0
-DA:1302,0
-DA:1373,425
-DA:1374,425
-DA:1540,0
-DA:1544,0
-DA:1545,0
-DA:1601,465
-DA:1605,465
-DA:1609,36
-DA:1611,36
-DA:1612,36
-DA:1613,36
-DA:1614,36
-DA:1619,427
-DA:1621,427
-DA:1622,427
-DA:1624,427
-DA:1625,427
-DA:1630,0
-DA:1633,0
-DA:1634,0
-DA:1635,0
-DA:1636,0
-DA:1640,0
-DA:1643,0
-DA:1644,0
-DA:1645,0
-DA:1646,0
-DA:1666,11
-DA:1668,11
-DA:1670,0
-DA:1671,11
-DA:1674,0
-DA:1676,0
-DA:1678,0
-DA:1679,0
-BA:83,2
-BA:83,1
-BA:143,2
-BA:143,2
-BA:143,0
-BA:143,0
-BA:162,0
-BA:162,0
-BA:183,2
-BA:183,1
-BA:183,2
-BA:183,2
-BA:183,2
-BA:183,2
-BA:183,0
-BA:183,0
-BA:183,0
-BA:183,0
-BA:183,0
-BA:183,0
-BA:190,2
-BA:190,1
-BA:190,0
-BA:190,0
-BA:478,2
-BA:478,1
-BA:541,2
-BA:541,2
-BA:556,2
-BA:556,2
-BA:1161,2
-BA:1161,2
-BA:1634,0
-BA:1634,0
-BA:1644,0
-BA:1644,0
-BA:1668,1
-BA:1668,2
-BA:1676,0
-BA:1676,0
-LF:166
-LH:122
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEC1ERKS2_
-FN:398,_ZNSt20back_insert_iteratorISt5dequeIcSaIcEEEC1ERS2_
-FN:456,_ZSt13back_inserterISt5dequeIcSaIcEEESt20back_insert_iteratorIT_ERS4_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPcSsEC1ERKS1_
-FN:735,_ZNK9__gnu_cxx17__normal_iteratorIPcSsEplERKi
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-FN:429,_ZNSt20back_insert_iteratorISt5dequeIcSaIcEEEdeEv
-FN:434,_ZNSt20back_insert_iteratorISt5dequeIcSaIcEEEppEv
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPcSsE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPcSsEEbRKNS_17__normal_iteratorIT_T0_EES7_
-FN:781,_ZN9__gnu_cxxneIPcSsEEbRKNS_17__normal_iteratorIT_T0_EES7_
-FN:846,_ZN9__gnu_cxxmiIPcSsEENS_17__normal_iteratorIT_T0_E15difference_typeERKS5_S8_
-FN:412,_ZNSt20back_insert_iteratorISt5dequeIcSaIcEEEaSERKc
-DA:398,425
-DA:412,5268
-DA:414,5268
-DA:415,5268
-DA:429,5268
-DA:430,5268
-DA:434,5268
-DA:435,5268
-DA:456,425
-DA:457,425
-DA:683,124
-DA:735,124
-DA:736,124
-DA:747,496
-DA:748,496
-DA:769,124
-DA:770,124
-DA:781,0
-DA:782,0
-DA:846,124
-DA:847,124
-LF:21
-LH:19
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceISt15_Deque_iteratorIcRcPcEENSt15iterator_traitsIT_E15difference_typeES5_S5_St26random_access_iterator_tag
-FN:115,_ZSt8distanceISt15_Deque_iteratorIcRcPcEENSt15iterator_traitsIT_E15difference_typeES5_S5_
-FN:93,_ZSt10__distanceISt15_Deque_iteratorIcRKcPS1_EENSt15iterator_traitsIT_E15difference_typeES6_S6_St26random_access_iterator_tag
-FN:115,_ZSt8distanceISt15_Deque_iteratorIcRKcPS1_EENSt15iterator_traitsIT_E15difference_typeES6_S6_
-FN:151,_ZSt9__advanceISt15_Deque_iteratorIcRKcPS1_EiEvRT_T0_St26random_access_iterator_tag
-FN:173,_ZSt7advanceISt15_Deque_iteratorIcRKcPS1_EiEvRT_T0_
-FN:93,_ZSt10__distanceIN9__gnu_cxx17__normal_iteratorIPcSsEEENSt15iterator_traitsIT_E15difference_typeES5_S5_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIN9__gnu_cxx17__normal_iteratorIPcSsEEENSt15iterator_traitsIT_E15difference_typeES5_S5_
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,585
-DA:98,585
-DA:115,585
-DA:119,585
-DA:151,0
-DA:156,0
-DA:157,0
-DA:173,0
-DA:176,0
-DA:177,0
-DA:178,0
-LF:11
-LH:4
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:166,_ZSt19__iterator_categoryISt15_Deque_iteratorIcRcPcEENSt15iterator_traitsIT_E17iterator_categoryERKS5_
-FN:166,_ZSt19__iterator_categoryISt15_Deque_iteratorIcRKcPS1_EENSt15iterator_traitsIT_E17iterator_categoryERKS6_
-FN:166,_ZSt19__iterator_categoryIN9__gnu_cxx17__normal_iteratorIPcSsEEENSt15iterator_traitsIT_E17iterator_categoryERKS5_
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,0
-DA:166,1933
-DA:167,1933
-LF:3
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:97,_ZNSt20__uninitialized_copyILb1EE18uninitialized_copyISt15_Deque_iteratorIcRKcPS3_ES2_IcRcPcEEET0_T_SB_SA_
-FN:113,_ZSt18uninitialized_copyISt15_Deque_iteratorIcRKcPS1_ES0_IcRcPcEET0_T_S9_S8_
-FN:261,_ZSt22__uninitialized_copy_aISt15_Deque_iteratorIcRKcPS1_ES0_IcRcPcEcET0_T_S9_S8_RSaIT1_E
-FN:97,_ZNSt20__uninitialized_copyILb1EE18uninitialized_copyISt15_Deque_iteratorIcRcPcES5_EET0_T_S7_S6_
-FN:113,_ZSt18uninitialized_copyISt15_Deque_iteratorIcRcPcES3_ET0_T_S5_S4_
-FN:261,_ZSt22__uninitialized_copy_aISt15_Deque_iteratorIcRcPcES3_cET0_T_S5_S4_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aISt15_Deque_iteratorIcRcPcES3_SaIcEET0_T_S6_S5_RT1_
-FN:371,_ZSt25__uninitialized_move_copyISt15_Deque_iteratorIcRcPcES0_IcRKcPS4_ES3_SaIcEET1_T_SA_T0_SB_S9_RT2_
-FN:343,_ZSt25__uninitialized_copy_moveISt15_Deque_iteratorIcRKcPS1_ES0_IcRcPcES7_SaIcEET1_T_SA_T0_SB_S9_RT2_
-DA:97,0
-DA:98,0
-DA:113,0
-DA:122,0
-DA:261,0
-DA:262,0
-DA:268,0
-DA:272,0
-DA:343,0
-DA:347,0
-DA:350,0
-DA:352,0
-DA:354,0
-DA:355,0
-DA:371,0
-DA:375,0
-DA:378,0
-DA:380,0
-DA:382,0
-DA:383,0
-LF:20
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:404,_ZNKSt6vectorISsSaISsEE3endEv
-FN:386,_ZNKSt6vectorISsSaISsEE5beginEv
-FN:526,_ZNKSt6vectorISsSaISsEE5emptyEv
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-DA:79,0
-DA:97,0
-DA:98,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:299,0
-DA:300,0
-DA:301,0
-DA:386,0
-DA:387,0
-DA:404,0
-DA:405,0
-DA:526,0
-DA:527,0
-BA:149,0
-BA:149,0
-LF:19
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stream_iterator.h
-FN:181,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERSoPKc
-FN:185,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERKS2_
-FN:202,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEdeEv
-FN:206,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEppEv
-FN:191,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEaSERKSs
-DA:181,0
-DA:182,0
-DA:185,0
-DA:186,0
-DA:191,0
-DA:196,0
-DA:197,0
-DA:198,0
-DA:202,0
-DA:203,0
-DA:206,0
-DA:207,0
-BA:197,0
-BA:197,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIPcED2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorIPcE8max_sizeEv
-FN:69,_ZN9__gnu_cxx13new_allocatorIPcEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorIcE8max_sizeEv
-FN:107,_ZN9__gnu_cxx13new_allocatorIcE9constructEPcRKc
-FN:87,_ZN9__gnu_cxx13new_allocatorIPcE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorIcE8allocateEjPKv
-FN:97,_ZN9__gnu_cxx13new_allocatorIcE10deallocateEPcj
-FN:97,_ZN9__gnu_cxx13new_allocatorIPcE10deallocateEPS1_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-DA:69,6
-DA:71,0
-DA:76,6
-DA:87,19
-DA:89,19
-DA:90,0
-DA:92,19
-DA:97,15
-DA:98,15
-DA:101,19
-DA:102,19
-DA:107,5268
-DA:108,5268
-BA:89,1
-BA:89,2
-BA:89,1
-BA:89,2
-BA:108,2
-BA:108,1
-LF:13
-LH:11
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:159,_ZN9__gnu_cxx17__is_null_pointerISt15_Deque_iteratorIcRcPcEEEbT_
-FN:159,_ZN9__gnu_cxx17__is_null_pointerINS_17__normal_iteratorIPcSsEEEEbT_
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-DA:159,585
-DA:160,585
-LF:4
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/istream
-FN:585,_ZNSiC2Ev
-FN:105,_ZNSiD2Ev
-FN:804,_ZNSdC2Ev
-FN:801,_ZNSdD2Ev
-DA:105,0
-DA:106,0
-DA:585,0
-DA:586,0
-DA:587,0
-DA:801,0
-DA:804,0
-DA:805,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-DA:105,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-DA:95,0
-DA:112,0
-DA:117,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:509,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:536,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:555,_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-DA:509,0
-DA:510,0
-DA:511,0
-DA:536,0
-DA:537,0
-DA:555,0
-DA:556,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-LF:25
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt/record.h
-DA:86,1
-BA:86,1
-BA:86,2
-LF:1
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt.h
-FN:139,_ZN3ept4core11AptDatabaseC1Ev
-FN:209,_ZN3ept4core11AptDatabase10invalidateEv
-FN:331,_ZN3ept4core11AptDatabaseD1Ev
-DA:139,0
-DA:140,0
-DA:141,0
-DA:142,0
-DA:143,0
-DA:144,0
-DA:145,0
-DA:146,0
-DA:209,0
-DA:210,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:218,0
-DA:219,0
-DA:220,0
-DA:331,0
-DA:332,0
-DA:333,0
-BA:210,0
-BA:210,0
-BA:214,0
-BA:214,0
-BA:216,0
-BA:216,0
-BA:218,0
-BA:218,0
-LF:21
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/debtags.h
-FN:139,_ZN3ept7debtags7Debtags14const_iteratorC1ERKS1_RKN7tagcoll4coll7PatchedINS6_12IntDiskIndexEE14const_iteratorE
-FN:197,_ZNK3ept7debtags7Debtags9timestampEv
-FN:200,_ZNK3ept7debtags7Debtags7hasDataEv
-FN:280,_ZN3ept7debtags7Debtags10vocabularyEv
-FN:282,_ZNK3ept7debtags7Debtags10vocabularyEv
-FN:171,_ZNK3ept7debtags7Debtags14const_iteratoreqERKS2_
-FN:175,_ZNK3ept7debtags7Debtags14const_iteratorneERKS2_
-FN:97,_ZNK3ept7debtags7Debtags11packageByIDEi
-FN:183,_ZNK3ept7debtags7Debtags3endEv
-FN:182,_ZNK3ept7debtags7Debtags5beginEv
-FN:143,_ZN3ept7debtags7Debtags14const_iteratorD1Ev
-FN:112,_ZNK3ept7debtags7Debtags11idByPackageERKSs
-FN:118,_ZNK3ept7debtags7Debtags13idsByPackagesIN6wibble9SingletonISsEEEESt3setIiSt4lessIiESaIiEERKT_
-FN:103,_ZNK3ept7debtags7Debtags12packagesByIdISt3setIiSt4lessIiESaIiEEEES3_ISsS4_ISsESaISsEERKT_
-FN:161,_ZN3ept7debtags7Debtags14const_iteratorppEv
-FN:244,_ZNK3ept7debtags7Debtags13getTagsOfItemERKSs
-FN:252,_ZNK3ept7debtags7Debtags14getTagsOfItemsIN6wibble9SingletonISsEEEESt3setINS0_3TagESt4lessIS7_ESaIS7_EERKT_
-FN:148,_ZNK3ept7debtags7Debtags14const_iteratordeEv
-FN:155,_ZNK3ept7debtags7Debtags14const_iteratorptEv
-FN:383,_ZN3ept7debtags7Debtags12outputSystemIN7tagcoll4coll8InserterINS4_6SimpleISsNS0_3TagEEEEEEEvRKT_
-FN:400,_ZN3ept7debtags7Debtags13outputPatchedIN7tagcoll4coll8InserterINS4_6SimpleISsNS0_3TagEEEEEEEvRKT_
-FN:383,_ZN3ept7debtags7Debtags12outputSystemIN7tagcoll6stream12CountingSinkIiEEEEvRKT_
-FN:400,_ZN3ept7debtags7Debtags13outputPatchedIN7tagcoll6stream12CountingSinkIiEEEEvRKT_
-FN:274,_ZNK3ept7debtags7Debtags10getAllTagsEv
-FN:194,_ZN3ept7debtags7DebtagsD1Ev
-FN:302,_ZN3ept7debtags7Debtags11applyChangeERKN7tagcoll9PatchListISsNS0_3TagEEE
-FN:262,_ZNK3ept7debtags7Debtags18getItemsHavingTagsISt3setINS0_3TagESt4lessIS4_ESaIS4_EEEES3_ISsS5_ISsESaISsEERKT_
-DA:97,84710
-DA:99,84710
-DA:103,2
-DA:105,2
-DA:106,130
-DA:108,128
-DA:109,0
-DA:112,8
-DA:114,8
-DA:118,1
-DA:120,1
-DA:121,2
-DA:123,1
-DA:124,0
-DA:139,63443
-DA:140,63443
-DA:143,63443
-DA:145,63443
-DA:146,0
-DA:147,63443
-DA:148,84580
-DA:150,84580
-DA:151,0
-DA:153,84580
-DA:155,105725
-DA:157,105725
-DA:158,42290
-DA:159,63435
-DA:161,63435
-DA:163,63435
-DA:164,63435
-DA:166,63435
-DA:167,63435
-DA:169,63435
-DA:171,1
-DA:173,1
-DA:175,63438
-DA:177,63438
-DA:182,4
-DA:183,63439
-DA:194,10
-DA:197,1
-DA:200,1
-DA:244,5
-DA:246,5
-DA:247,5
-DA:248,4
-DA:252,1
-DA:254,1
-DA:262,2
-DA:264,2
-DA:265,11
-DA:267,9
-DA:268,2
-DA:274,1
-DA:276,1
-DA:280,27
-DA:282,84590
-DA:302,2
-DA:305,2
-DA:306,4
-DA:309,2
-DA:310,4
-DA:312,2
-DA:313,2
-DA:315,0
-DA:316,2
-DA:318,2
-DA:319,2
-DA:383,2
-DA:400,2
-BA:106,2
-BA:106,2
-BA:121,2
-BA:121,2
-BA:145,1
-BA:145,2
-BA:146,0
-BA:146,0
-BA:150,1
-BA:150,2
-BA:157,2
-BA:157,2
-BA:164,2
-BA:164,1
-BA:166,2
-BA:166,1
-BA:247,2
-BA:247,2
-BA:265,2
-BA:265,2
-BA:306,2
-BA:306,2
-BA:310,2
-BA:310,2
-BA:313,1
-BA:313,2
-LF:71
-LH:66
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/debtags.tcc
-DA:42,2
-DA:43,2
-DA:63,2
-DA:64,2
-LF:4
-LH:4
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/debtags.test.h
-FN:53,_ZN11TestDebtags3vocEv
-FN:51,_ZN11TestDebtagsC1Ev
-FN:55,_ZN11TestDebtags2_1Ev
-FN:243,_ZN11TestDebtags2_5Ev
-FN:48,_ZN11TestDebtagsD1Ev
-FN:74,_ZN11TestDebtags2_2Ev
-FN:185,_ZN11TestDebtags2_4Ev
-FN:100,_ZN11TestDebtags2_3Ev
-DA:48,5
-DA:51,5
-DA:53,10
-DA:55,1
-DA:56,21146
-DA:58,21145
-DA:59,21145
-DA:60,21145
-DA:61,1
-DA:62,1
-DA:63,1
-DA:65,1
-DA:66,1
-DA:68,2
-DA:69,2
-DA:70,2
-DA:71,2
-DA:72,1
-DA:74,1
-DA:76,1
-DA:77,1
-DA:78,1
-DA:89,2
-DA:90,2
-DA:91,2
-DA:92,2
-DA:93,2
-DA:94,2
-DA:95,2
-DA:96,2
-DA:97,2
-DA:98,1
-DA:100,1
-DA:105,1
-DA:108,1
-DA:109,1
-DA:152,1
-DA:154,1
-DA:162,2
-DA:165,2
-DA:166,1
-DA:173,1
-DA:174,1
-DA:175,1
-DA:178,1
-DA:180,2
-DA:183,1
-DA:185,1
-DA:187,1
-DA:188,1
-DA:190,1
-DA:193,1
-DA:194,1
-DA:197,2
-DA:198,2
-DA:201,1
-DA:202,1
-DA:203,1
-DA:206,1
-DA:207,1
-DA:208,2
-DA:211,2
-DA:212,1
-DA:214,2
-DA:215,2
-DA:218,1
-DA:221,1
-DA:222,1
-DA:224,29
-DA:225,27
-DA:226,1
-DA:228,1
-DA:230,2
-DA:233,1
-DA:236,1
-DA:237,1
-DA:238,2
-DA:239,1
-DA:240,1
-DA:243,1
-DA:245,1
-DA:246,2
-DA:247,2
-DA:248,2
-DA:249,1
-DA:251,1
-DA:252,1
-DA:253,2
-DA:255,1
-DA:256,1
-DA:258,2
-DA:259,2
-DA:260,2
-DA:261,2
-DA:263,2
-DA:264,1
-DA:266,1
-DA:267,1
-DA:268,1
-DA:270,1
-DA:272,1
-DA:273,1
-DA:274,1
-BA:56,2
-BA:56,2
-BA:224,2
-BA:224,2
-LF:103
-LH:103
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/maint/path.h
-FN:76,_ZN3ept7debtags4Path24OverrideDebtagsSourceDirC1ERKSs
-FN:80,_ZN3ept7debtags4Path24OverrideDebtagsSourceDirD1Ev
-FN:86,_ZN3ept7debtags4Path23OverrideDebtagsIndexDirC1ERKSs
-FN:90,_ZN3ept7debtags4Path23OverrideDebtagsIndexDirD1Ev
-FN:96,_ZN3ept7debtags4Path28OverrideDebtagsUserSourceDirC1ERKSs
-FN:100,_ZN3ept7debtags4Path28OverrideDebtagsUserSourceDirD1Ev
-FN:106,_ZN3ept7debtags4Path27OverrideDebtagsUserIndexDirC1ERKSs
-FN:110,_ZN3ept7debtags4Path27OverrideDebtagsUserIndexDirD1Ev
-DA:76,0
-DA:78,0
-DA:79,0
-DA:80,0
-DA:86,0
-DA:88,0
-DA:89,0
-DA:90,0
-DA:96,0
-DA:98,0
-DA:99,0
-DA:100,0
-DA:106,0
-DA:108,0
-DA:109,0
-DA:110,0
-LF:16
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/maint/pkgid.h
-FN:54,_ZNK3ept7debtags5PkgId4sizeEv
-FN:68,_ZNK3ept7debtags5PkgId4byIDEi
-FN:41,_ZN3ept7debtags5PkgIdD1Ev
-DA:41,11
-DA:54,63445
-DA:68,1128365
-DA:70,1128365
-DA:71,1128365
-DA:72,0
-BA:54,2
-BA:54,2
-BA:70,1
-BA:70,2
-BA:70,0
-BA:70,0
-BA:70,2
-BA:70,1
-LF:6
-LH:5
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/maint/serializer.h
-FN:27,_ZN3ept7debtags8IntToPkgIN7tagcoll6stream12CountingSinkIiEEEC1ERNS0_5PkgIdERNS0_10VocabularyERKS5_
-FN:62,_ZN3ept7debtags8intToPkgIN7tagcoll6stream12CountingSinkIiEEEENS0_8IntToPkgIT_EERNS0_5PkgIdERNS0_10VocabularyERKS7_
-FN:27,_ZN3ept7debtags8IntToPkgIN7tagcoll4coll8InserterINS3_6SimpleISsNS0_3TagEEEEEEC1ERNS0_5PkgIdERNS0_10VocabularyERKS8_
-FN:62,_ZN3ept7debtags8intToPkgIN7tagcoll4coll8InserterINS3_6SimpleISsNS0_3TagEEEEEEENS0_8IntToPkgIT_EERNS0_5PkgIdERNS0_10VocabularyERKSA_
-FN:31,_ZN3ept7debtags8IntToPkgIN7tagcoll4coll8InserterINS3_6SimpleISsNS0_3TagEEEEEEaSIN6wibble9SingletonIiEESt3setIiSt4lessIiESaIiEEEERS9_RKSt4pairIT_T0_E
-FN:31,_ZN3ept7debtags8IntToPkgIN7tagcoll6stream12CountingSinkIiEEEaSIN6wibble9SingletonIiEESt3setIiSt4lessIiESaIiEEEERS6_RKSt4pairIT_T0_E
-DA:27,5
-DA:28,5
-DA:31,42291
-DA:33,42291
-DA:34,42291
-DA:36,84582
-DA:39,42291
-DA:40,42291
-DA:41,42291
-DA:44,253489
-DA:47,211198
-DA:48,211198
-DA:49,211198
-DA:52,42291
-DA:54,42267
-DA:55,42267
-DA:57,42291
-DA:62,5
-DA:64,5
-BA:36,2
-BA:36,2
-BA:36,2
-BA:36,2
-BA:40,2
-BA:40,1
-BA:40,2
-BA:40,1
-BA:44,2
-BA:44,2
-BA:44,2
-BA:44,2
-BA:48,2
-BA:48,1
-BA:48,2
-BA:48,1
-BA:52,2
-BA:52,1
-BA:52,2
-BA:52,1
-BA:52,2
-BA:52,1
-BA:52,2
-BA:52,1
-BA:52,2
-BA:52,2
-BA:52,2
-BA:52,2
-LF:19
-LH:19
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/tag.h
-FN:175,_ZN3ept7debtags3TagD1Ev
-FN:177,_ZNK3ept7debtags3TageqERKS1_
-FN:179,_ZNK3ept7debtags3TagltERKS1_
-FN:181,_ZNK3ept7debtags3TagcvbEv
-FN:182,_ZNK3ept7debtags3Tag5validEv
-FN:242,_ZNK3ept7debtags3Tag2idEv
-DA:175,0
-DA:177,0
-DA:179,0
-DA:181,0
-DA:182,324422
-DA:242,0
-LF:6
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/vocabulary.h
-FN:181,_ZNK3ept7debtags10Vocabulary8tagsByIDISt3setIiSt4lessIiESaIiEEEES3_INS0_3TagES4_IS8_ESaIS8_EERKT_
-FN:114,_ZNK3ept7debtags10Vocabulary8TagIndex2idERKSs
-FN:203,_ZNK3ept7debtags10Vocabulary9tagByNameERKSs
-DA:114,0
-DA:181,84590
-DA:183,84590
-DA:184,507017
-DA:186,422427
-DA:187,0
-DA:203,0
-BA:184,2
-BA:184,2
-LF:7
-LH:4
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/test.h
-FN:12,_ZN18AptTestEnvironmentC2Ev
-FN:10,_ZN18AptTestEnvironmentD2Ev
-FN:30,_ZN22DebtagsTestEnvironmentC2Ev
-FN:24,_ZN22DebtagsTestEnvironmentD2Ev
-DA:10,0
-DA:12,0
-DA:13,0
-DA:14,0
-DA:15,0
-DA:16,0
-DA:17,0
-DA:18,0
-DA:19,0
-DA:20,0
-DA:21,0
-DA:24,0
-DA:30,0
-DA:34,0
-DA:35,0
-LF:15
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/empty.h
-FN:64,_ZNK6wibble5EmptyIN3ept7debtags3TagEE5beginEv
-FN:65,_ZNK6wibble5EmptyIN3ept7debtags3TagEE3endEv
-FN:64,_ZNK6wibble5EmptyIiE5beginEv
-FN:65,_ZNK6wibble5EmptyIiE3endEv
-FN:46,_ZNK6wibble5EmptyIN3ept7debtags3TagEE14const_iteratorneERKS5_
-FN:44,_ZN6wibble5EmptyIN3ept7debtags3TagEE14const_iteratorppEv
-FN:42,_ZNK6wibble5EmptyIN3ept7debtags3TagEE14const_iteratordeEv
-FN:46,_ZNK6wibble5EmptyIiE14const_iteratorneERKS2_
-FN:44,_ZN6wibble5EmptyIiE14const_iteratorppEv
-FN:42,_ZNK6wibble5EmptyIiE14const_iteratordeEv
-DA:42,0
-DA:44,0
-DA:46,3
-DA:64,3
-DA:65,3
-LF:5
-LH:3
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/mixin.h
-FN:52,_ZN6wibble5mixin14OutputIteratorIN7tagcoll6stream12CountingSinkIiEEEC2Ev
-FN:52,_ZN6wibble5mixin14OutputIteratorIN7tagcoll4coll8InserterINS3_6SimpleISsN3ept7debtags3TagEEEEEEC2Ev
-FN:52,_ZN6wibble5mixin14OutputIteratorIN3ept7debtags8IntToPkgIN7tagcoll6stream12CountingSinkIiEEEEEC2Ev
-FN:64,_ZN6wibble5mixin14OutputIteratorIN3ept7debtags8IntToPkgIN7tagcoll6stream12CountingSinkIiEEEEEdeEv
-FN:53,_ZN6wibble5mixin14OutputIteratorIN3ept7debtags8IntToPkgIN7tagcoll6stream12CountingSinkIiEEEEEppEv
-FN:52,_ZN6wibble5mixin14OutputIteratorIN3ept7debtags8IntToPkgIN7tagcoll4coll8InserterINS6_6SimpleISsNS3_3TagEEEEEEEEC2Ev
-FN:64,_ZN6wibble5mixin14OutputIteratorIN3ept7debtags8IntToPkgIN7tagcoll4coll8InserterINS6_6SimpleISsNS3_3TagEEEEEEEEdeEv
-FN:53,_ZN6wibble5mixin14OutputIteratorIN3ept7debtags8IntToPkgIN7tagcoll4coll8InserterINS6_6SimpleISsNS3_3TagEEEEEEEEppEv
-FN:64,_ZN6wibble5mixin14OutputIteratorIN7tagcoll6stream12CountingSinkIiEEEdeEv
-FN:53,_ZN6wibble5mixin14OutputIteratorIN7tagcoll6stream12CountingSinkIiEEEppEv
-FN:64,_ZN6wibble5mixin14OutputIteratorIN7tagcoll4coll8InserterINS3_6SimpleISsN3ept7debtags3TagEEEEEEdeEv
-FN:53,_ZN6wibble5mixin14OutputIteratorIN7tagcoll4coll8InserterINS3_6SimpleISsN3ept7debtags3TagEEEEEEppEv
-DA:52,10
-DA:53,84558
-DA:54,84558
-DA:64,84558
-DA:65,84558
-LF:5
-LH:5
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/operators.h
-FN:220,_ZN6wibble9operatorsleIN3ept7debtags3TagEEEbRKT_RKSt3setIS5_St4lessIS5_ESaIS5_EE
-FN:220,_ZN6wibble9operatorsleISsEEbRKT_RKSt3setIS2_St4lessIS2_ESaIS2_EE
-FN:115,_ZN6wibble9operatorsoRIiEERSt3setIT_St4lessIS3_ESaIS3_EES8_RKS3_
-FN:74,_ZN6wibble9operatorsorIiEESt3setIT_St4lessIS3_ESaIS3_EERKS7_S9_
-FN:82,_ZN6wibble9operatorsmiIiEESt3setIT_St4lessIS3_ESaIS3_EERKS7_S9_
-FN:133,_ZN6wibble9operatorsoRIiEERSt3setIT_St4lessIS3_ESaIS3_EES8_RKS7_
-FN:74,_ZN6wibble9operatorsorIN3ept7debtags3TagEEESt3setIT_St4lessIS6_ESaIS6_EERKSA_SC_
-FN:133,_ZN6wibble9operatorsoRIN3ept7debtags3TagEEERSt3setIT_St4lessIS6_ESaIS6_EESB_RKSA_
-FN:183,_ZN6wibble9operatorsmIIiEERSt3setIT_St4lessIS3_ESaIS3_EES8_RKS3_
-FN:198,_ZN6wibble9operatorsmIIN3ept7debtags3TagESt3setIS4_St4lessIS4_ESaIS4_EEEERS5_IT_S6_ISA_ESaISA_EESE_RKT0_
-FN:198,_ZN6wibble9operatorsmIIiSt3setIiSt4lessIiESaIiEEEERS2_IT_S3_IS7_ESaIS7_EESB_RKT0_
-FN:145,_ZN6wibble9operatorsaNIiSt3setIiSt4lessIiESaIiEEEERS2_IT_S3_IS7_ESaIS7_EESB_RKT0_
-DA:74,3
-DA:75,3
-DA:76,3
-DA:78,0
-DA:82,5
-DA:83,5
-DA:84,5
-DA:86,0
-DA:115,4
-DA:117,4
-DA:118,4
-DA:133,7
-DA:134,7
-DA:135,5
-DA:137,4
-DA:139,2
-DA:140,2
-DA:145,7
-DA:147,7
-DA:149,0
-DA:150,0
-DA:153,7
-DA:154,7
-DA:155,2654
-DA:157,2640
-DA:159,2507
-DA:161,133
-DA:163,126
-DA:164,126
-DA:165,126
-DA:169,7
-DA:170,7
-DA:173,7
-DA:183,4
-DA:185,4
-DA:186,4
-DA:198,12
-DA:200,12
-DA:201,12
-DA:202,306
-DA:204,282
-DA:206,0
-DA:207,0
-DA:208,0
-DA:209,0
-DA:211,282
-DA:212,4
-DA:214,278
-DA:216,12
-DA:220,12
-DA:221,12
-BA:134,2
-BA:134,2
-BA:134,2
-BA:134,1
-BA:137,2
-BA:137,2
-BA:137,0
-BA:137,0
-BA:147,1
-BA:147,2
-BA:155,2
-BA:155,2
-BA:157,2
-BA:157,1
-BA:157,2
-BA:157,2
-BA:157,2
-BA:157,2
-BA:161,2
-BA:161,1
-BA:161,2
-BA:161,2
-BA:161,2
-BA:161,2
-BA:202,0
-BA:202,0
-BA:202,0
-BA:202,0
-BA:202,0
-BA:202,0
-BA:202,2
-BA:202,2
-BA:202,2
-BA:202,2
-BA:202,2
-BA:202,2
-BA:204,0
-BA:204,0
-BA:204,1
-BA:204,2
-BA:211,0
-BA:211,0
-BA:211,2
-BA:211,2
-LF:51
-LH:43
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/singleton.h
-FN:35,_ZN6wibble9SingletonIN3ept7debtags3TagEED1Ev
-FN:80,_ZN6wibble9SingletonIN3ept7debtags3TagEEC1ERKS3_
-FN:92,_ZN6wibble9singletonIN3ept7debtags3TagEEENS_9SingletonIT_EERKS5_
-FN:47,_ZN6wibble9SingletonIN3ept7debtags3TagEE14const_iteratorC1EPKS3_
-FN:87,_ZNK6wibble9SingletonIN3ept7debtags3TagEE5beginEv
-FN:50,_ZN6wibble9SingletonIN3ept7debtags3TagEE14const_iteratorC1Ev
-FN:88,_ZNK6wibble9SingletonIN3ept7debtags3TagEE3endEv
-FN:56,_ZNK6wibble9SingletonISsE14const_iteratorneERKS2_
-FN:54,_ZN6wibble9SingletonISsE14const_iteratorppEv
-FN:52,_ZNK6wibble9SingletonISsE14const_iteratordeEv
-FN:80,_ZN6wibble9SingletonIiEC1ERKi
-FN:92,_ZN6wibble9singletonIiEENS_9SingletonIT_EERKS2_
-FN:56,_ZNK6wibble9SingletonIiE14const_iteratorneERKS2_
-FN:54,_ZN6wibble9SingletonIiE14const_iteratorppEv
-FN:52,_ZNK6wibble9SingletonIiE14const_iteratordeEv
-FN:47,_ZN6wibble9SingletonISsE14const_iteratorC1EPKSs
-FN:87,_ZNK6wibble9SingletonISsE5beginEv
-FN:50,_ZN6wibble9SingletonISsE14const_iteratorC1Ev
-FN:88,_ZNK6wibble9SingletonISsE3endEv
-FN:47,_ZN6wibble9SingletonIiE14const_iteratorC1EPKi
-FN:87,_ZNK6wibble9SingletonIiE5beginEv
-FN:50,_ZN6wibble9SingletonIiE14const_iteratorC1Ev
-FN:88,_ZNK6wibble9SingletonIiE3endEv
-FN:56,_ZNK6wibble9SingletonIN3ept7debtags3TagEE14const_iteratorneERKS5_
-FN:54,_ZN6wibble9SingletonIN3ept7debtags3TagEE14const_iteratorppEv
-FN:52,_ZNK6wibble9SingletonIN3ept7debtags3TagEE14const_iteratordeEv
-FN:35,_ZN6wibble9SingletonISsED1Ev
-FN:80,_ZN6wibble9SingletonISsEC1ERKSs
-FN:92,_ZN6wibble9singletonISsEENS_9SingletonIT_EERKS2_
-DA:35,84594
-DA:47,105738
-DA:50,169179
-DA:52,84595
-DA:54,84592
-DA:56,190329
-DA:80,84593
-DA:87,105738
-DA:88,169179
-DA:92,84593
-DA:94,84593
-LF:11
-LH:11
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:13,_ZN8LocationD1Ev
-FN:13,_ZN8LocationC1ERKS_
-FN:17,_ZN8LocationC1EPKciSs
-FN:52,_ZlsIiER12AssertFailedS1_T_
-FN:52,_ZlsISsER12AssertFailedS1_T_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:52,_ZlsIPKcER12AssertFailedS3_T_
-FN:52,_ZlsIlER12AssertFailedS1_T_
-FN:41,_ZN12AssertFailedD1Ev
-FN:67,_Z12assert_eq_fnIliEv8LocationT_T0_
-FN:59,_Z9assert_fnIbEv8LocationT_
-FN:59,_Z9assert_fnIN3ept7debtags3TagEEv8LocationT_
-FN:67,_Z12assert_eq_fnISsSsEv8LocationT_T0_
-FN:52,_ZlsIjER12AssertFailedS1_T_
-FN:67,_Z12assert_eq_fnIjjEv8LocationT_T0_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:59,1
-DA:61,1
-DA:62,0
-DA:64,1
-DA:67,3
-DA:69,3
-DA:70,0
-DA:71,0
-DA:75,3
-BA:42,0
-BA:42,0
-BA:61,0
-BA:61,0
-BA:61,1
-BA:61,2
-BA:69,1
-BA:69,2
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-LF:26
-LH:6
-end_of_record
-SF:/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_debtags.cpp
-FN:7,_Z41__static_initialization_and_destruction_0ii
-FN:7,_GLOBAL__I_ept_test_generated__home_mornfall_dev_pkg_ept_work_ept_debtags_debtags.cpp
-FN:7,_Z14run_Debtags__5v
-FN:3,_Z14run_Debtags__1v
-FN:4,_Z14run_Debtags__2v
-FN:6,_Z14run_Debtags__4v
-FN:5,_Z14run_Debtags__3v
-DA:3,1
-DA:4,1
-DA:5,1
-DA:6,1
-DA:7,4
-BA:7,2
-BA:7,1
-BA:7,2
-BA:7,1
-LF:5
-LH:5
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeIN3ept7debtags3TagEEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeIiEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISt4pairIKiN7tagcoll5PatchIiiEEEEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISsEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEEEED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaISsED1Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeIN3ept7debtags3TagEEEC2Ev
-FN:106,_ZNSaIN3ept7debtags3TagEED1Ev
-FN:100,_ZNSaISt13_Rb_tree_nodeIN3ept7debtags3TagEEEC2ERKS4_
-FN:98,_ZNSaISt13_Rb_tree_nodeIiEEC2Ev
-FN:106,_ZNSaIiED1Ev
-FN:100,_ZNSaISt13_Rb_tree_nodeIiEEC2ERKS1_
-FN:106,_ZNSaISt4pairIKiN7tagcoll5PatchIiiEEEED1Ev
-FN:100,_ZNSaISt13_Rb_tree_nodeISsEEC2ERKS1_
-FN:104,_ZNSaISsEC1ISt13_Rb_tree_nodeISsEEERKSaIT_E
-FN:106,_ZNSaISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEED1Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEEEEC2Ev
-FN:106,_ZNSaISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS4_ESaIS4_EEEED1Ev
-FN:104,_ZNSaIN3ept7debtags3TagEEC1ISt13_Rb_tree_nodeIS1_EEERKSaIT_E
-FN:104,_ZNSaIiEC1ISt13_Rb_tree_nodeIiEEERKSaIT_E
-FN:104,_ZNSaISt4pairIKiN7tagcoll5PatchIiiEEEEC1ISt13_Rb_tree_nodeIS4_EEERKSaIT_E
-FN:98,_ZNSaISt13_Rb_tree_nodeISsEEC2Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeISt4pairIKiN7tagcoll5PatchIiiEEEEEC2Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEEEC2Ev
-FN:104,_ZNSaISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEEC1ISt13_Rb_tree_nodeIS7_EEERKSaIT_E
-FN:104,_ZNSaISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS4_ESaIS4_EEEEC1ISt13_Rb_tree_nodeIS9_EEERKSaIT_E
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,31
-DA:100,520528
-DA:101,520528
-DA:104,28
-DA:106,62
-DA:118,0
-DA:119,0
-LF:7
-LH:5
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:1534,_ZNKSs5c_strEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:192,_ZNKSs4_Rep12_M_is_sharedEv
-FN:652,_ZNKSs8capacityEv
-FN:392,_ZNSs10_S_compareEjj
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-FN:1941,_ZNKSs7compareERKSs
-FN:2238,_ZStltIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:2162,_ZSteqIcEN9__gnu_cxx11__enable_ifIXsrSt9__is_charIT_E7__valueEbE6__typeERKSbIS3_St11char_traitsIS3_ESaIS3_EESC_
-FN:835,_ZNSs6appendEPKc
-FN:2121,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_
-FN:870,_ZNSs9push_backEc
-FN:791,_ZNSspLEc
-DA:178,0
-DA:183,0
-DA:184,0
-DA:192,0
-DA:193,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:392,0
-DA:394,0
-DA:401,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:652,0
-DA:653,0
-DA:686,0
-DA:687,0
-DA:791,0
-DA:793,0
-DA:794,0
-DA:835,0
-DA:838,0
-DA:870,0
-DA:872,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:877,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:1941,0
-DA:1943,0
-DA:1944,0
-DA:1945,0
-DA:1947,0
-DA:1948,0
-DA:1949,0
-DA:1950,0
-DA:2067,0
-DA:2069,0
-DA:2121,0
-DA:2123,0
-DA:2124,0
-DA:2125,0
-DA:2162,0
-DA:2165,0
-DA:2238,0
-DA:2239,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:1948,0
-BA:1948,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-LF:90
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-DA:245,0
-DA:246,0
-DA:257,0
-DA:258,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algo.h
-FN:5055,_ZSt9set_unionISt23_Rb_tree_const_iteratorIiES1_St15insert_iteratorISt3setIiSt4lessIiESaIiEEEET1_T_SA_T0_SB_S9_
-FN:5300,_ZSt14set_differenceISt23_Rb_tree_const_iteratorIiES1_St15insert_iteratorISt3setIiSt4lessIiESaIiEEEET1_T_SA_T0_SB_S9_
-FN:5055,_ZSt9set_unionISt23_Rb_tree_const_iteratorIN3ept7debtags3TagEES4_St15insert_iteratorISt3setIS3_St4lessIS3_ESaIS3_EEEET1_T_SD_T0_SE_SC_
-DA:5055,3
-DA:5074,13
-DA:5076,7
-DA:5078,6
-DA:5079,6
-DA:5081,1
-DA:5083,1
-DA:5084,1
-DA:5088,0
-DA:5089,0
-DA:5090,0
-DA:5092,7
-DA:5095,3
-DA:5300,5
-DA:5317,10
-DA:5318,0
-DA:5320,0
-DA:5321,0
-DA:5322,0
-DA:5324,0
-DA:5325,0
-DA:5328,0
-DA:5329,0
-DA:5331,5
-BA:5074,2
-BA:5074,2
-BA:5074,2
-BA:5074,2
-BA:5074,2
-BA:5074,2
-BA:5074,1
-BA:5074,2
-BA:5074,0
-BA:5074,0
-BA:5074,1
-BA:5074,2
-BA:5076,2
-BA:5076,2
-BA:5076,0
-BA:5076,0
-BA:5081,2
-BA:5081,1
-BA:5081,0
-BA:5081,0
-BA:5317,2
-BA:5317,2
-BA:5317,1
-BA:5317,2
-BA:5317,1
-BA:5317,2
-BA:5318,0
-BA:5318,0
-BA:5324,0
-BA:5324,0
-LF:24
-LH:13
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:188,_ZSt3minIjERKT_S2_S2_
-FN:286,_ZNSt12__miter_baseIN6wibble9SingletonIN3ept7debtags3TagEE14const_iteratorELb0EE3__bES6_
-FN:286,_ZNSt12__miter_baseIN6wibble5EmptyIN3ept7debtags3TagEE14const_iteratorELb0EE3__bES6_
-FN:268,_ZNSt12__niter_baseIN6wibble9SingletonIN3ept7debtags3TagEE14const_iteratorELb0EE3__bES6_
-FN:268,_ZNSt12__niter_baseISt15insert_iteratorISt3setIN3ept7debtags3TagESt4lessIS4_ESaIS4_EEELb0EE3__bES9_
-FN:268,_ZNSt12__niter_baseIN6wibble5EmptyIN3ept7debtags3TagEE14const_iteratorELb0EE3__bES6_
-FN:286,_ZNSt12__miter_baseISt23_Rb_tree_const_iteratorIiELb0EE3__bES1_
-FN:286,_ZNSt12__miter_baseIN6wibble9SingletonIiE14const_iteratorELb0EE3__bES3_
-FN:286,_ZNSt12__miter_baseIN6wibble5EmptyIiE14const_iteratorELb0EE3__bES3_
-FN:268,_ZNSt12__niter_baseISt23_Rb_tree_const_iteratorIiELb0EE3__bES1_
-FN:268,_ZNSt12__niter_baseISt15insert_iteratorISt3setIiSt4lessIiESaIiEEELb0EE3__bES6_
-FN:268,_ZNSt12__niter_baseIN6wibble9SingletonIiE14const_iteratorELb0EE3__bES3_
-FN:268,_ZNSt12__niter_baseIN6wibble5EmptyIiE14const_iteratorELb0EE3__bES3_
-FN:286,_ZNSt12__miter_baseISt23_Rb_tree_const_iteratorIN3ept7debtags3TagEELb0EE3__bES4_
-FN:268,_ZNSt12__niter_baseISt23_Rb_tree_const_iteratorIN3ept7debtags3TagEELb0EE3__bES4_
-FN:309,_ZNSt11__copy_moveILb0ELb0ESt20forward_iterator_tagE8__copy_mIN6wibble9SingletonIiE14const_iteratorESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEET0_T_SF_SE_
-FN:385,_ZSt13__copy_move_aILb0EN6wibble9SingletonIiE14const_iteratorESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEET1_T0_SC_SB_
-FN:430,_ZSt14__copy_move_a2ILb0EN6wibble9SingletonIiE14const_iteratorESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEET1_T0_SC_SB_
-FN:456,_ZSt4copyIN6wibble9SingletonIiE14const_iteratorESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEET0_T_SC_SB_
-FN:309,_ZNSt11__copy_moveILb0ELb0ESt20forward_iterator_tagE8__copy_mIN6wibble5EmptyIiE14const_iteratorESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEET0_T_SF_SE_
-FN:385,_ZSt13__copy_move_aILb0EN6wibble5EmptyIiE14const_iteratorESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEET1_T0_SC_SB_
-FN:430,_ZSt14__copy_move_a2ILb0EN6wibble5EmptyIiE14const_iteratorESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEET1_T0_SC_SB_
-FN:456,_ZSt4copyIN6wibble5EmptyIiE14const_iteratorESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEET0_T_SC_SB_
-FN:309,_ZNSt11__copy_moveILb0ELb0ESt26bidirectional_iterator_tagE8__copy_mISt23_Rb_tree_const_iteratorIiESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEET0_T_SD_SC_
-FN:385,_ZSt13__copy_move_aILb0ESt23_Rb_tree_const_iteratorIiESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEET1_T0_SA_S9_
-FN:430,_ZSt14__copy_move_a2ILb0ESt23_Rb_tree_const_iteratorIiESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEET1_T0_SA_S9_
-FN:456,_ZSt4copyISt23_Rb_tree_const_iteratorIiESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEET0_T_SA_S9_
-FN:309,_ZNSt11__copy_moveILb0ELb0ESt20forward_iterator_tagE8__copy_mIN6wibble9SingletonIN3ept7debtags3TagEE14const_iteratorESt15insert_iteratorISt3setIS7_St4lessIS7_ESaIS7_EEEEET0_T_SI_SH_
-FN:385,_ZSt13__copy_move_aILb0EN6wibble9SingletonIN3ept7debtags3TagEE14const_iteratorESt15insert_iteratorISt3setIS4_St4lessIS4_ESaIS4_EEEET1_T0_SF_SE_
-FN:430,_ZSt14__copy_move_a2ILb0EN6wibble9SingletonIN3ept7debtags3TagEE14const_iteratorESt15insert_iteratorISt3setIS4_St4lessIS4_ESaIS4_EEEET1_T0_SF_SE_
-FN:456,_ZSt4copyIN6wibble9SingletonIN3ept7debtags3TagEE14const_iteratorESt15insert_iteratorISt3setIS4_St4lessIS4_ESaIS4_EEEET0_T_SF_SE_
-FN:309,_ZNSt11__copy_moveILb0ELb0ESt20forward_iterator_tagE8__copy_mIN6wibble5EmptyIN3ept7debtags3TagEE14const_iteratorESt15insert_iteratorISt3setIS7_St4lessIS7_ESaIS7_EEEEET0_T_SI_SH_
-FN:385,_ZSt13__copy_move_aILb0EN6wibble5EmptyIN3ept7debtags3TagEE14const_iteratorESt15insert_iteratorISt3setIS4_St4lessIS4_ESaIS4_EEEET1_T0_SF_SE_
-FN:430,_ZSt14__copy_move_a2ILb0EN6wibble5EmptyIN3ept7debtags3TagEE14const_iteratorESt15insert_iteratorISt3setIS4_St4lessIS4_ESaIS4_EEEET1_T0_SF_SE_
-FN:456,_ZSt4copyIN6wibble5EmptyIN3ept7debtags3TagEE14const_iteratorESt15insert_iteratorISt3setIS4_St4lessIS4_ESaIS4_EEEET0_T_SF_SE_
-FN:309,_ZNSt11__copy_moveILb0ELb0ESt26bidirectional_iterator_tagE8__copy_mISt23_Rb_tree_const_iteratorIN3ept7debtags3TagEESt15insert_iteratorISt3setIS6_St4lessIS6_ESaIS6_EEEEET0_T_SG_SF_
-FN:385,_ZSt13__copy_move_aILb0ESt23_Rb_tree_const_iteratorIN3ept7debtags3TagEESt15insert_iteratorISt3setIS3_St4lessIS3_ESaIS3_EEEET1_T0_SD_SC_
-FN:430,_ZSt14__copy_move_a2ILb0ESt23_Rb_tree_const_iteratorIN3ept7debtags3TagEESt15insert_iteratorISt3setIS3_St4lessIS3_ESaIS3_EEEET1_T0_SD_SC_
-FN:456,_ZSt4copyISt23_Rb_tree_const_iteratorIN3ept7debtags3TagEESt15insert_iteratorISt3setIS3_St4lessIS3_ESaIS3_EEEET0_T_SD_SC_
-DA:188,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:268,51
-DA:269,51
-DA:286,42
-DA:287,42
-DA:309,21
-DA:311,41
-DA:312,20
-DA:313,21
-DA:385,21
-DA:393,21
-DA:396,21
-DA:430,21
-DA:435,21
-DA:456,21
-DA:466,21
-BA:193,0
-BA:193,0
-BA:311,2
-BA:311,2
-BA:311,1
-BA:311,2
-BA:311,2
-BA:311,2
-BA:311,2
-BA:311,2
-BA:311,1
-BA:311,2
-BA:311,2
-BA:311,2
-LF:19
-LH:15
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_function.h
-FN:469,_ZNKSt9_IdentityIN3ept7debtags3TagEEclERKS2_
-FN:229,_ZNKSt4lessIN3ept7debtags3TagEEclERKS2_S5_
-FN:469,_ZNKSt9_IdentityIiEclERKi
-FN:229,_ZNKSt4lessIiEclERKiS2_
-FN:469,_ZNKSt9_IdentityISsEclERKSs
-FN:482,_ZNKSt10_Select1stISt4pairIKiN7tagcoll5PatchIiiEEEEclERKS5_
-FN:482,_ZNKSt10_Select1stISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEEclERKS8_
-FN:482,_ZNKSt10_Select1stISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEEEclERKSA_
-FN:229,_ZNKSt4lessISsEclERKSsS2_
-DA:229,0
-DA:230,0
-DA:469,0
-DA:470,0
-DA:482,16
-DA:483,16
-LF:6
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:572,_ZNSt15insert_iteratorISt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EEEC1ERS7_St23_Rb_tree_const_iteratorIS3_E
-FN:645,_ZSt8inserterISt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EESt23_Rb_tree_const_iteratorIS3_EESt15insert_iteratorIT_ERSB_T0_
-FN:572,_ZNSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEC1ERS4_St23_Rb_tree_const_iteratorIiE
-FN:645,_ZSt8inserterISt3setIiSt4lessIiESaIiEESt23_Rb_tree_const_iteratorIiEESt15insert_iteratorIT_ERS8_T0_
-FN:618,_ZNSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEdeEv
-FN:623,_ZNSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEppEv
-FN:623,_ZNSt15insert_iteratorISt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EEEppEv
-FN:618,_ZNSt15insert_iteratorISt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EEEdeEv
-FN:599,_ZNSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEaSERKi
-FN:599,_ZNSt15insert_iteratorISt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EEEaSERKS3_
-DA:572,18
-DA:573,18
-DA:599,27
-DA:601,27
-DA:602,27
-DA:603,27
-DA:618,27
-DA:619,27
-DA:623,27
-DA:624,27
-DA:645,18
-DA:648,18
-LF:12
-LH:12
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:111,_ZNSt8iteratorISt20forward_iterator_tagKN3ept7debtags3TagEvPS4_RS4_EC2Ev
-FN:111,_ZNSt8iteratorISt20forward_iterator_tagKSsvPS1_RS1_EC2Ev
-FN:111,_ZNSt8iteratorISt20forward_iterator_tagKivPS1_RS1_EC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,274917
-DA:166,0
-DA:167,0
-LF:3
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_map.h
-FN:389,_ZNKSt3mapISsN7tagcoll5PatchISsN3ept7debtags3TagEEESt4lessISsESaISt4pairIKSsS5_EEE4sizeEv
-FN:384,_ZNKSt3mapISsN7tagcoll5PatchISsN3ept7debtags3TagEEESt4lessISsESaISt4pairIKSsS5_EEE5emptyEv
-FN:284,_ZNKSt3mapISsN7tagcoll5PatchISsN3ept7debtags3TagEEESt4lessISsESaISt4pairIKSsS5_EEE5beginEv
-FN:302,_ZNKSt3mapISsN7tagcoll5PatchISsN3ept7debtags3TagEEESt4lessISsESaISt4pairIKSsS5_EEE3endEv
-FN:293,_ZNSt3mapISsN7tagcoll5PatchISsN3ept7debtags3TagEEESt4lessISsESaISt4pairIKSsS5_EEE3endEv
-FN:275,_ZNSt3mapISsN7tagcoll5PatchISsN3ept7debtags3TagEEESt4lessISsESaISt4pairIKSsS5_EEE5beginEv
-FN:389,_ZNKSt3mapISsSt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EES4_ISsESaISt4pairIKSsS7_EEE4sizeEv
-FN:302,_ZNKSt3mapIiN7tagcoll5PatchIiiEESt4lessIiESaISt4pairIKiS2_EEE3endEv
-FN:284,_ZNKSt3mapIiN7tagcoll5PatchIiiEESt4lessIiESaISt4pairIKiS2_EEE5beginEv
-FN:293,_ZNSt3mapIiN7tagcoll5PatchIiiEESt4lessIiESaISt4pairIKiS2_EEE3endEv
-FN:275,_ZNSt3mapIiN7tagcoll5PatchIiiEESt4lessIiESaISt4pairIKiS2_EEE5beginEv
-FN:629,_ZNKSt3mapIiN7tagcoll5PatchIiiEESt4lessIiESaISt4pairIKiS2_EEE4findERS6_
-FN:614,_ZNSt3mapIiN7tagcoll5PatchIiiEESt4lessIiESaISt4pairIKiS2_EEE4findERS6_
-FN:155,_ZNSt3mapISsSt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EES4_ISsESaISt4pairIKSsS7_EEEC1Ev
-FN:155,_ZNSt3mapIiN7tagcoll5PatchIiiEESt4lessIiESaISt4pairIKiS2_EEEC2Ev
-FN:155,_ZNSt3mapISsN7tagcoll5PatchISsN3ept7debtags3TagEEESt4lessISsESaISt4pairIKSsS5_EEEC2Ev
-FN:293,_ZNSt3mapISsSt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EES4_ISsESaISt4pairIKSsS7_EEE3endEv
-FN:581,_ZNSt3mapISsSt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EES4_ISsESaISt4pairIKSsS7_EEE5clearEv
-FN:92,_ZNSt3mapISsSt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EES4_ISsESaISt4pairIKSsS7_EEED1Ev
-FN:92,_ZNSt3mapISsN7tagcoll5PatchISsN3ept7debtags3TagEEESt4lessISsESaISt4pairIKSsS5_EEED2Ev
-FN:92,_ZNSt3mapIiN7tagcoll5PatchIiiEESt4lessIiESaISt4pairIKiS2_EEED2Ev
-FN:614,_ZNSt3mapISsSt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EES4_ISsESaISt4pairIKSsS7_EEE4findERSA_
-FN:614,_ZNSt3mapISsN7tagcoll5PatchISsN3ept7debtags3TagEEESt4lessISsESaISt4pairIKSsS5_EEE4findERS9_
-FN:239,_ZNSt3mapISsN7tagcoll5PatchISsN3ept7debtags3TagEEESt4lessISsESaISt4pairIKSsS5_EEEaSERKSC_
-FN:468,_ZNSt3mapISsSt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EES4_ISsESaISt4pairIKSsS7_EEE6insertERKSB_
-FN:468,_ZNSt3mapISsN7tagcoll5PatchISsN3ept7debtags3TagEEESt4lessISsESaISt4pairIKSsS5_EEE6insertERKSA_
-FN:468,_ZNSt3mapIiN7tagcoll5PatchIiiEESt4lessIiESaISt4pairIKiS2_EEE6insertERKS7_
-DA:92,34
-DA:155,31
-DA:156,31
-DA:239,1
-DA:241,1
-DA:242,1
-DA:275,9
-DA:276,9
-DA:284,15
-DA:285,15
-DA:293,26
-DA:294,26
-DA:302,253777
-DA:303,253777
-DA:384,1
-DA:385,1
-DA:389,6
-DA:390,6
-DA:468,11
-DA:469,11
-DA:581,1
-DA:582,1
-DA:614,17
-DA:615,17
-DA:629,14
-DA:630,14
-LF:26
-LH:26
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_pair.h
-FN:88,_ZNSt4pairISt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEbEC1ERKS4_RKb
-FN:88,_ZNSt4pairISt23_Rb_tree_const_iteratorIiEbEC1ERKS1_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIN3ept7debtags3TagEEbEC1ERKS4_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIiEbEC1ERKS1_RKb
-FN:88,_ZNSt4pairISt23_Rb_tree_const_iteratorISsEbEC1ERKS1_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorISsEbEC1ERKS1_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIS_IKiN7tagcoll5PatchIiiEEEEbEC1ERKS6_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIS_IKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEEbEC1ERKS9_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIiES1_EC1ERKS1_S4_
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIS_IKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEEEbEC1ERKSB_RKb
-FN:73,_ZNSt4pairIiSt3setIiSt4lessIiESaIiEEED1Ev
-FN:73,_ZNSt4pairIN6wibble9SingletonIiEESt3setIiSt4lessIiESaIiEEED1Ev
-FN:73,_ZNSt4pairIKiN7tagcoll5PatchIiiEEED1Ev
-FN:73,_ZNSt4pairIiN7tagcoll5PatchIiiEEED1Ev
-FN:73,_ZNSt4pairISsSt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EEED1Ev
-FN:73,_ZNSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS4_ESaIS4_EEED1Ev
-FN:73,_ZNSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEED1Ev
-FN:73,_ZNSt4pairISsN7tagcoll5PatchISsN3ept7debtags3TagEEEED1Ev
-FN:73,_ZNSt4pairISt3setISsSt4lessISsESaISsEES0_IN3ept7debtags3TagES1_IS7_ESaIS7_EEED1Ev
-FN:88,_ZNSt4pairIiSt3setIiSt4lessIiESaIiEEEC1ERKiRKS4_
-FN:218,_ZSt9make_pairIiSt3setIiSt4lessIiESaIiEEESt4pairIT_T0_ES6_S7_
-FN:88,_ZNSt4pairIN6wibble9SingletonIiEESt3setIiSt4lessIiESaIiEEEC1ERKS2_RKS7_
-FN:218,_ZSt9make_pairIN6wibble9SingletonIiEESt3setIiSt4lessIiESaIiEEESt4pairIT_T0_ES9_SA_
-FN:73,_ZNSt4pairIiSt3setIiSt4lessIiESaIiEEEC1ERKS5_
-FN:88,_ZNSt4pairIiN7tagcoll5PatchIiiEEEC1ERKiRKS2_
-FN:218,_ZSt9make_pairIiN7tagcoll5PatchIiiEEESt4pairIT_T0_ES4_S5_
-FN:104,_ZNSt4pairIKiN7tagcoll5PatchIiiEEEC1IiS3_EERKS_IT_T0_E
-FN:73,_ZNSt4pairIKiN7tagcoll5PatchIiiEEEC1ERKS4_
-FN:88,_ZNSt4pairISsSt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EEEC1ERKSsRKS7_
-FN:218,_ZSt9make_pairISsSt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EEESt4pairIT_T0_ES9_SA_
-FN:104,_ZNSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS4_ESaIS4_EEEC1ISsS8_EERKS_IT_T0_E
-FN:73,_ZNSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS4_ESaIS4_EEEC1ERKS9_
-FN:88,_ZNSt4pairISsN7tagcoll5PatchISsN3ept7debtags3TagEEEEC1ERKSsRKS5_
-FN:218,_ZSt9make_pairISsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt4pairIT_T0_ES7_S8_
-FN:104,_ZNSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEC1ISsS6_EERKS_IT_T0_E
-FN:73,_ZNSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEC1ERKS7_
-FN:73,_ZNSt4pairISsSt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EEEC1ERKS8_
-FN:88,_ZNSt4pairISt3setISsSt4lessISsESaISsEES0_IN3ept7debtags3TagES1_IS7_ESaIS7_EEEC1ERKS4_RKSA_
-FN:218,_ZSt9make_pairISt3setISsSt4lessISsESaISsEES0_IN3ept7debtags3TagES1_IS7_ESaIS7_EEESt4pairIT_T0_ESC_SD_
-DA:73,274914
-DA:88,698640
-DA:89,698640
-DA:104,11
-DA:106,11
-DA:218,274875
-DA:219,274875
-LF:7
-LH:7
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_set.h
-FN:331,_ZNKSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EE5emptyEv
-FN:336,_ZNKSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EE4sizeEv
-FN:331,_ZNKSt3setISsSt4lessISsESaISsEE5emptyEv
-FN:331,_ZNKSt3setIiSt4lessIiESaIiEE5emptyEv
-FN:336,_ZNKSt3setIiSt4lessIiESaIiEE4sizeEv
-FN:270,_ZNKSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EE3endEv
-FN:261,_ZNKSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EE5beginEv
-FN:270,_ZNKSt3setIiSt4lessIiESaIiEE3endEv
-FN:261,_ZNKSt3setIiSt4lessIiESaIiEE5beginEv
-FN:507,_ZNKSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EE4findERKS2_
-FN:270,_ZNKSt3setISsSt4lessISsESaISsEE3endEv
-FN:141,_ZNSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EEC1Ev
-FN:141,_ZNSt3setIiSt4lessIiESaIiEEC1Ev
-FN:141,_ZNSt3setISsSt4lessISsESaISsEEC1Ev
-FN:336,_ZNKSt3setISsSt4lessISsESaISsEE4sizeEv
-FN:261,_ZNKSt3setISsSt4lessISsESaISsEE5beginEv
-FN:93,_ZNSt3setIiSt4lessIiESaIiEED1Ev
-FN:471,_ZNSt3setIiSt4lessIiESaIiEE5clearEv
-FN:93,_ZNSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EED1Ev
-FN:93,_ZNSt3setISsSt4lessISsESaISsEED1Ev
-FN:507,_ZNKSt3setISsSt4lessISsESaISsEE4findERKSs
-FN:193,_ZNSt3setIiSt4lessIiESaIiEEC1ERKS3_
-FN:216,_ZNSt3setIiSt4lessIiESaIiEEaSERKS3_
-FN:216,_ZNSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EEaSERKS6_
-FN:193,_ZNSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EEC1ERKS6_
-FN:193,_ZNSt3setISsSt4lessISsESaISsEEC1ERKS3_
-FN:216,_ZNSt3setISsSt4lessISsESaISsEEaSERKS3_
-FN:378,_ZNSt3setIiSt4lessIiESaIiEE6insertERKi
-FN:378,_ZNSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EE6insertERKS2_
-FN:378,_ZNSt3setISsSt4lessISsESaISsEE6insertERKSs
-FN:405,_ZNSt3setIiSt4lessIiESaIiEE6insertESt23_Rb_tree_const_iteratorIiERKi
-FN:405,_ZNSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EE6insertESt23_Rb_tree_const_iteratorIS2_ERKS2_
-FN:446,_ZNSt3setIiSt4lessIiESaIiEE5eraseERKi
-FN:431,_ZNSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EE5eraseESt23_Rb_tree_const_iteratorIS2_E
-FN:431,_ZNSt3setIiSt4lessIiESaIiEE5eraseESt23_Rb_tree_const_iteratorIiE
-DA:93,0
-DA:141,0
-DA:142,0
-DA:193,520528
-DA:194,520528
-DA:216,8
-DA:218,8
-DA:219,8
-DA:261,169226
-DA:262,169226
-DA:270,935675
-DA:271,935675
-DA:331,63452
-DA:332,63452
-DA:336,0
-DA:337,0
-DA:378,423750
-DA:381,423750
-DA:382,423750
-DA:405,27
-DA:406,27
-DA:431,126
-DA:432,126
-DA:446,4
-DA:447,4
-DA:471,0
-DA:472,0
-DA:507,2
-DA:508,2
-LF:29
-LH:22
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_tree.h
-FN:103,_ZNSt18_Rb_tree_node_base10_S_minimumEPS_
-FN:117,_ZNSt18_Rb_tree_node_base10_S_maximumEPS_
-FN:289,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEEneERKS9_
-FN:251,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEEptEv
-FN:289,_ZNKSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEneERKS3_
-FN:251,_ZNKSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEptEv
-FN:247,_ZNKSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEdeEv
-FN:176,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEEptEv
-FN:452,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_M_beginEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEC1ERKSt17_Rb_tree_iteratorIS2_E
-FN:452,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_M_beginEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorIiEC1ERKSt17_Rb_tree_iteratorIiE
-FN:289,_ZNKSt23_Rb_tree_const_iteratorIiEneERKS0_
-FN:247,_ZNKSt23_Rb_tree_const_iteratorIiEdeEv
-FN:285,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKiN7tagcoll5PatchIiiEEEEeqERKS6_
-FN:251,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKiN7tagcoll5PatchIiiEEEEptEv
-FN:289,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKiN7tagcoll5PatchIiiEEEEneERKS6_
-FN:452,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE8_M_beginEv
-FN:452,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorISt4pairIKiN7tagcoll5PatchIiiEEEEeqERKS6_
-FN:176,_ZNKSt17_Rb_tree_iteratorISt4pairIKiN7tagcoll5PatchIiiEEEEptEv
-FN:637,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE5emptyEv
-FN:641,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE4sizeEv
-FN:637,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5emptyEv
-FN:289,_ZNKSt23_Rb_tree_const_iteratorISsEneERKS0_
-FN:452,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE8_M_beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEEeqERKS9_
-FN:641,_ZNKSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE4sizeEv
-FN:637,_ZNKSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE5emptyEv
-FN:452,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE8_M_beginEv
-FN:398,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13_Rb_tree_implIS6_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:463,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE6_M_endEv
-FN:168,_ZNSt17_Rb_tree_iteratorIN3ept7debtags3TagEEC1EPSt13_Rb_tree_nodeIS2_E
-FN:596,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE5beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorIN3ept7debtags3TagEEeqERKS3_
-FN:347,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE21_M_get_Node_allocatorEv
-FN:432,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE7_M_rootEv
-FN:456,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_M_beginEv
-FN:428,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE7_M_rootEv
-FN:503,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE10_S_minimumEPSt18_Rb_tree_node_base
-FN:436,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE11_M_leftmostEv
-FN:511,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE10_S_maximumEPSt18_Rb_tree_node_base
-FN:444,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE12_M_rightmostEv
-FN:398,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_Rb_tree_implIS3_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE7_S_leftEPSt18_Rb_tree_node_base
-FN:347,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE21_M_get_Node_allocatorEv
-FN:432,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE7_M_rootEv
-FN:456,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_M_beginEv
-FN:463,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE6_M_endEv
-FN:428,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE7_M_rootEv
-FN:503,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE10_S_minimumEPSt18_Rb_tree_node_base
-FN:436,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE11_M_leftmostEv
-FN:511,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE10_S_maximumEPSt18_Rb_tree_node_base
-FN:444,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE12_M_rightmostEv
-FN:168,_ZNSt17_Rb_tree_iteratorIiEC1EPSt13_Rb_tree_nodeIiE
-FN:596,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorIiEeqERKS0_
-FN:398,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE13_Rb_tree_implIS9_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:637,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5emptyEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorISsEC1ERKSt17_Rb_tree_iteratorISsE
-FN:398,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_S_leftEPSt18_Rb_tree_node_base
-FN:347,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE21_M_get_Node_allocatorEv
-FN:432,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_M_rootEv
-FN:456,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_beginEv
-FN:463,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_M_endEv
-FN:428,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_M_rootEv
-FN:503,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE10_S_minimumEPSt18_Rb_tree_node_base
-FN:436,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11_M_leftmostEv
-FN:511,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE10_S_maximumEPSt18_Rb_tree_node_base
-FN:444,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE12_M_rightmostEv
-FN:641,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE4sizeEv
-FN:240,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEEC1EPKSt13_Rb_tree_nodeIS8_E
-FN:603,_ZNKSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE5beginEv
-FN:614,_ZNKSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE3endEv
-FN:240,_ZNSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEC1EPKSt13_Rb_tree_nodeIS2_E
-FN:614,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE3endEv
-FN:603,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE5beginEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorISt4pairIKiN7tagcoll5PatchIiiEEEEC1ERKSt17_Rb_tree_iteratorIS5_E
-FN:398,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE13_Rb_tree_implISC_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:432,_ZNKSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE7_M_rootEv
-FN:456,_ZNKSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE8_M_beginEv
-FN:463,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE6_M_endEv
-FN:428,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE7_M_rootEv
-FN:503,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE10_S_minimumEPSt18_Rb_tree_node_base
-FN:436,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE11_M_leftmostEv
-FN:511,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE10_S_maximumEPSt18_Rb_tree_node_base
-FN:444,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE12_M_rightmostEv
-FN:168,_ZNSt17_Rb_tree_iteratorISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEEC1EPSt13_Rb_tree_nodeIS8_E
-FN:610,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE3endEv
-FN:596,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE5beginEv
-FN:398,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE13_Rb_tree_implISD_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:641,_ZNKSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE4sizeEv
-FN:415,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13_Rb_tree_implIS6_Lb0EE13_M_initializeEv
-FN:471,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_S_valueEPKSt13_Rb_tree_nodeIS2_E
-FN:475,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE6_S_keyEPKSt13_Rb_tree_nodeIS2_E
-FN:495,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE6_S_keyEPKSt18_Rb_tree_node_base
-FN:491,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_S_rightEPKSt18_Rb_tree_node_base
-FN:483,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE7_S_leftEPKSt18_Rb_tree_node_base
-FN:415,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_Rb_tree_implIS3_Lb0EE13_M_initializeEv
-FN:491,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_S_rightEPKSt18_Rb_tree_node_base
-FN:483,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE7_S_leftEPKSt18_Rb_tree_node_base
-FN:471,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_S_valueEPKSt13_Rb_tree_nodeIiE
-FN:475,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE6_S_keyEPKSt13_Rb_tree_nodeIiE
-FN:495,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE6_S_keyEPKSt18_Rb_tree_node_base
-FN:240,_ZNSt23_Rb_tree_const_iteratorIiEC1EPKSt13_Rb_tree_nodeIiE
-FN:614,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE3endEv
-FN:603,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5beginEv
-FN:240,_ZNSt23_Rb_tree_const_iteratorISt4pairIKiN7tagcoll5PatchIiiEEEEC1EPKSt13_Rb_tree_nodeIS5_E
-FN:614,_ZNKSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE3endEv
-FN:603,_ZNKSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE5beginEv
-FN:456,_ZNKSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE8_M_beginEv
-FN:467,_ZNKSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE6_M_endEv
-FN:168,_ZNSt17_Rb_tree_iteratorISsEC1EPSt13_Rb_tree_nodeISsE
-FN:596,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorISsEeqERKS0_
-FN:415,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EE13_M_initializeEv
-FN:491,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_rightEPKSt18_Rb_tree_node_base
-FN:483,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_S_leftEPKSt18_Rb_tree_node_base
-FN:463,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE6_M_endEv
-FN:168,_ZNSt17_Rb_tree_iteratorISt4pairIKiN7tagcoll5PatchIiiEEEEC1EPSt13_Rb_tree_nodeIS5_E
-FN:610,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE3endEv
-FN:596,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE5beginEv
-FN:467,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE6_M_endEv
-FN:970,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE14_M_lower_boundEPKSt13_Rb_tree_nodeIS2_ESC_RKS2_
-FN:285,_ZNKSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEeqERKS3_
-FN:1403,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE4findERKS2_
-FN:285,_ZNKSt23_Rb_tree_const_iteratorIiEeqERKS0_
-FN:240,_ZNSt23_Rb_tree_const_iteratorISsEC1EPKSt13_Rb_tree_nodeISsE
-FN:614,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE3endEv
-FN:467,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_M_endEv
-FN:285,_ZNKSt23_Rb_tree_const_iteratorISsEeqERKS0_
-FN:347,_ZNKSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE21_M_get_Node_allocatorEv
-FN:491,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE8_S_rightEPKSt18_Rb_tree_node_base
-FN:483,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE7_S_leftEPKSt18_Rb_tree_node_base
-FN:415,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE13_Rb_tree_implISD_Lb0EE13_M_initializeEv
-FN:463,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE6_M_endEv
-FN:436,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE11_M_leftmostEv
-FN:428,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE7_M_rootEv
-FN:444,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE12_M_rightmostEv
-FN:403,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13_Rb_tree_implIS6_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EEC1Ev
-FN:408,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13_Rb_tree_implIS6_Lb0EEC1ERKS6_RKSaISt13_Rb_tree_nodeIS2_EE
-FN:403,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_Rb_tree_implIS3_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEEC1Ev
-FN:408,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_Rb_tree_implIS3_Lb0EEC1ERKS3_RKSaISt13_Rb_tree_nodeIiEE
-FN:347,_ZNKSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE21_M_get_Node_allocatorEv
-FN:483,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE7_S_leftEPKSt18_Rb_tree_node_base
-FN:491,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE8_S_rightEPKSt18_Rb_tree_node_base
-FN:495,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE6_S_keyEPKSt18_Rb_tree_node_base
-FN:471,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_valueEPKSt13_Rb_tree_nodeISsE
-FN:475,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_S_keyEPKSt13_Rb_tree_nodeISsE
-FN:495,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_S_keyEPKSt18_Rb_tree_node_base
-FN:408,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EEC1ERKS3_RKSaISt13_Rb_tree_nodeISsEE
-FN:415,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE13_Rb_tree_implIS9_Lb0EE13_M_initializeEv
-FN:471,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE8_S_valueEPKSt13_Rb_tree_nodeIS5_E
-FN:475,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE6_S_keyEPKSt13_Rb_tree_nodeIS5_E
-FN:970,_ZNKSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE14_M_lower_boundEPKSt13_Rb_tree_nodeIS5_ESF_RS1_
-FN:1403,_ZNKSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE4findERS1_
-FN:954,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE14_M_lower_boundEPSt13_Rb_tree_nodeIS5_ESE_RS1_
-FN:1390,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE4findERS1_
-FN:351,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13get_allocatorEv
-FN:415,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE13_Rb_tree_implISC_Lb0EE13_M_initializeEv
-FN:495,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE6_S_keyEPKSt18_Rb_tree_node_base
-FN:471,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE8_S_valueEPKSt13_Rb_tree_nodeIS8_E
-FN:475,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE6_S_keyEPKSt13_Rb_tree_nodeIS8_E
-FN:403,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE13_Rb_tree_implISD_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EEC1Ev
-FN:347,_ZNKSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE21_M_get_Node_allocatorEv
-FN:351,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13get_allocatorEv
-FN:351,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13get_allocatorEv
-FN:351,_ZNKSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE13get_allocatorEv
-FN:403,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEEC1Ev
-FN:954,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE14_M_lower_boundEPSt13_Rb_tree_nodeIiES8_RKi
-FN:986,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE14_M_upper_boundEPSt13_Rb_tree_nodeIiES8_RKi
-FN:1019,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE11equal_rangeERKi
-FN:610,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE3endEv
-FN:214,_ZNKSt17_Rb_tree_iteratorIiEneERKS0_
-FN:403,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE13_Rb_tree_implIS9_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EEC1Ev
-FN:641,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE4sizeEv
-FN:403,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE13_Rb_tree_implISC_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EEC1Ev
-FN:351,_ZNKSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE13get_allocatorEv
-FN:351,_ZNKSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE13get_allocatorEv
-FN:247,_ZNKSt23_Rb_tree_const_iteratorISsEdeEv
-FN:210,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEEEeqERKSB_
-FN:176,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEEEptEv
-FN:603,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5beginEv
-FN:168,_ZNSt17_Rb_tree_iteratorISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEEEC1EPSt13_Rb_tree_nodeISA_E
-FN:610,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE3endEv
-FN:596,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE5beginEv
-FN:495,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE6_S_keyEPKSt18_Rb_tree_node_base
-FN:471,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE8_S_valueEPKSt13_Rb_tree_nodeISA_E
-FN:475,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE6_S_keyEPKSt13_Rb_tree_nodeISA_E
-FN:360,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE11_M_put_nodeEPSt13_Rb_tree_nodeIiE
-FN:388,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE15_M_destroy_nodeEPSt13_Rb_tree_nodeIiE
-FN:936,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_M_eraseEPSt13_Rb_tree_nodeIiE
-FN:584,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEED1Ev
-FN:695,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5clearEv
-FN:360,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS2_E
-FN:388,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS2_E
-FN:936,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_M_eraseEPSt13_Rb_tree_nodeIS2_E
-FN:695,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE5clearEv
-FN:584,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EED1Ev
-FN:360,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11_M_put_nodeEPSt13_Rb_tree_nodeISsE
-FN:388,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE15_M_destroy_nodeEPSt13_Rb_tree_nodeISsE
-FN:936,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_eraseEPSt13_Rb_tree_nodeISsE
-FN:584,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEED1Ev
-FN:695,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5clearEv
-FN:360,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE11_M_put_nodeEPSt13_Rb_tree_nodeISA_E
-FN:388,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeISA_E
-FN:936,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE8_M_eraseEPSt13_Rb_tree_nodeISA_E
-FN:695,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE5clearEv
-FN:584,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EED1Ev
-FN:360,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS8_E
-FN:388,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS8_E
-FN:936,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE8_M_eraseEPSt13_Rb_tree_nodeIS8_E
-FN:584,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EED1Ev
-FN:695,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE5clearEv
-FN:360,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS5_E
-FN:388,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS5_E
-FN:936,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE8_M_eraseEPSt13_Rb_tree_nodeIS5_E
-FN:584,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EED1Ev
-FN:954,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE14_M_lower_boundEPSt13_Rb_tree_nodeISA_ESI_RS1_
-FN:1390,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE4findERS1_
-FN:954,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE14_M_lower_boundEPSt13_Rb_tree_nodeIS8_ESH_RS1_
-FN:1390,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE4findERS1_
-FN:970,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE14_M_lower_boundEPKSt13_Rb_tree_nodeISsES9_RKSs
-FN:1403,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE4findERKSs
-FN:356,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE14_M_create_nodeERKi
-FN:378,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_M_clone_nodeEPKSt13_Rb_tree_nodeIiE
-FN:900,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE7_M_copyEPKSt13_Rb_tree_nodeIiEPS7_
-FN:568,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEEC1ERKS5_
-FN:824,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEEaSERKS5_
-FN:356,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE14_M_create_nodeERKS2_
-FN:378,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13_M_clone_nodeEPKSt13_Rb_tree_nodeIS2_E
-FN:900,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE7_M_copyEPKSt13_Rb_tree_nodeIS2_EPSA_
-FN:824,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EEaSERKS8_
-FN:568,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EEC1ERKS8_
-FN:356,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE14_M_create_nodeERKSs
-FN:378,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_M_clone_nodeEPKSt13_Rb_tree_nodeISsE
-FN:900,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_M_copyEPKSt13_Rb_tree_nodeISsEPS7_
-FN:568,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEEC1ERKS5_
-FN:824,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEEaSERKS5_
-FN:356,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE14_M_create_nodeERKSA_
-FN:356,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE14_M_create_nodeERKS8_
-FN:378,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE13_M_clone_nodeEPKSt13_Rb_tree_nodeIS8_E
-FN:900,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE7_M_copyEPKSt13_Rb_tree_nodeIS8_EPSG_
-FN:824,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EEaSERKSE_
-FN:356,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE14_M_create_nodeERKS5_
-FN:270,_ZNSt23_Rb_tree_const_iteratorIiEmmEv
-FN:270,_ZNSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEmmEv
-FN:846,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE10_M_insert_EPKSt18_Rb_tree_node_baseS8_RKi
-FN:846,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE10_M_insert_EPKSt18_Rb_tree_node_baseSB_RKS2_
-FN:846,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE10_M_insert_EPKSt18_Rb_tree_node_baseS8_RKSs
-FN:846,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE10_M_insert_EPKSt18_Rb_tree_node_baseSI_RKSA_
-FN:846,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE10_M_insert_EPKSt18_Rb_tree_node_baseSH_RKS8_
-FN:846,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE10_M_insert_EPKSt18_Rb_tree_node_baseSE_RKS5_
-FN:195,_ZNSt17_Rb_tree_iteratorIiEmmEv
-FN:1133,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE16_M_insert_uniqueERKi
-FN:195,_ZNSt17_Rb_tree_iteratorIN3ept7debtags3TagEEmmEv
-FN:1133,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE16_M_insert_uniqueERKS2_
-FN:195,_ZNSt17_Rb_tree_iteratorISsEmmEv
-FN:1133,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE16_M_insert_uniqueERKSs
-FN:195,_ZNSt17_Rb_tree_iteratorISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEEEmmEv
-FN:1133,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE16_M_insert_uniqueERKSA_
-FN:195,_ZNSt17_Rb_tree_iteratorISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEEmmEv
-FN:1133,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE16_M_insert_uniqueERKS8_
-FN:195,_ZNSt17_Rb_tree_iteratorISt4pairIKiN7tagcoll5PatchIiiEEEEmmEv
-FN:1133,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE16_M_insert_uniqueERKS5_
-FN:255,_ZNSt23_Rb_tree_const_iteratorIiEppEv
-FN:1178,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE17_M_insert_unique_ESt23_Rb_tree_const_iteratorIiERKi
-FN:262,_ZNSt23_Rb_tree_const_iteratorIiEppEi
-FN:255,_ZNSt23_Rb_tree_const_iteratorISt4pairIKiN7tagcoll5PatchIiiEEEEppEv
-FN:255,_ZNSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEppEv
-FN:1178,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE17_M_insert_unique_ESt23_Rb_tree_const_iteratorIS2_ERKS2_
-FN:255,_ZNSt23_Rb_tree_const_iteratorISsEppEv
-FN:255,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEEppEv
-FN:262,_ZNSt23_Rb_tree_const_iteratorISt4pairIKiN7tagcoll5PatchIiiEEEEppEi
-FN:187,_ZNSt17_Rb_tree_iteratorIiEppEi
-FN:1313,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5eraseESt17_Rb_tree_iteratorIiE
-FN:1353,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5eraseESt17_Rb_tree_iteratorIiES7_
-FN:1341,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5eraseERKi
-FN:1327,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE5eraseESt23_Rb_tree_const_iteratorIS2_E
-FN:1327,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5eraseESt23_Rb_tree_const_iteratorIiE
-DA:103,0
-DA:105,0
-DA:106,0
-DA:117,0
-DA:119,0
-DA:120,0
-DA:168,113
-DA:169,113
-DA:176,10
-DA:177,10
-DA:187,0
-DA:189,0
-DA:190,0
-DA:195,0
-DA:197,0
-DA:198,0
-DA:210,45
-DA:211,45
-DA:214,1
-DA:215,1
-DA:240,1358734
-DA:241,1358734
-DA:243,14
-DA:244,14
-DA:247,1062874
-DA:248,1062874
-DA:251,39
-DA:252,39
-DA:255,763482
-DA:257,763482
-DA:258,763482
-DA:262,3
-DA:264,3
-DA:265,3
-DA:270,0
-DA:272,0
-DA:273,0
-DA:285,169325
-DA:286,169325
-DA:289,935604
-DA:290,935604
-DA:347,31
-DA:348,31
-DA:351,28
-DA:352,28
-DA:356,14
-DA:357,14
-DA:360,14
-DA:361,14
-DA:364,14
-DA:366,14
-DA:368,14
-DA:369,0
-DA:371,0
-DA:372,0
-DA:374,14
-DA:378,2233485
-DA:380,2233485
-DA:381,2233485
-DA:382,2233485
-DA:383,2233485
-DA:384,2233485
-DA:388,14
-DA:390,14
-DA:391,14
-DA:392,14
-DA:398,34
-DA:403,31
-DA:405,31
-DA:406,31
-DA:408,520528
-DA:410,520528
-DA:411,520528
-DA:415,34
-DA:417,34
-DA:418,34
-DA:419,34
-DA:420,34
-DA:421,34
-DA:428,1429894
-DA:429,1429894
-DA:432,520537
-DA:433,520537
-DA:436,476640
-DA:437,476640
-DA:444,1347172
-DA:445,1347172
-DA:452,64
-DA:453,64
-DA:456,307556
-DA:459,307556
-DA:463,46
-DA:464,46
-DA:467,16
-DA:468,16
-DA:471,8
-DA:472,8
-DA:475,8
-DA:476,8
-DA:479,20
-DA:480,20
-DA:483,1388664
-DA:484,1388664
-DA:487,14
-DA:488,14
-DA:491,601300
-DA:492,601300
-DA:495,8
-DA:496,8
-DA:499,8
-DA:500,8
-DA:503,476627
-DA:504,476627
-DA:511,476627
-DA:512,476627
-DA:562,31
-DA:568,520528
-DA:569,520528
-DA:571,520528
-DA:573,476623
-DA:574,476623
-DA:575,476623
-DA:576,476623
-DA:578,520528
-DA:584,34
-DA:585,34
-DA:596,20
-DA:599,20
-DA:603,169241
-DA:606,169241
-DA:610,58
-DA:611,58
-DA:614,1189479
-DA:617,1189479
-DA:637,63453
-DA:638,63453
-DA:641,6
-DA:642,6
-DA:695,13
-DA:697,13
-DA:698,13
-DA:699,13
-DA:700,13
-DA:701,13
-DA:702,13
-DA:824,9
-DA:826,9
-DA:829,9
-DA:830,9
-DA:831,9
-DA:833,4
-DA:834,4
-DA:835,4
-DA:836,4
-DA:839,9
-DA:846,11
-DA:850,11
-DA:852,11
-DA:854,11
-DA:857,11
-DA:858,11
-DA:900,1454940
-DA:903,1454940
-DA:904,1454940
-DA:908,1454940
-DA:909,882727
-DA:910,1454940
-DA:911,1454940
-DA:913,3688425
-DA:915,778545
-DA:916,778545
-DA:917,778545
-DA:918,778545
-DA:919,95586
-DA:920,778545
-DA:921,778545
-DA:924,0
-DA:926,0
-DA:927,0
-DA:929,1454940
-DA:936,50
-DA:939,114
-DA:941,14
-DA:942,14
-DA:943,14
-DA:944,14
-DA:946,50
-DA:954,17
-DA:956,40
-DA:957,6
-DA:958,6
-DA:960,0
-DA:961,17
-DA:970,16
-DA:972,41
-DA:973,9
-DA:974,6
-DA:976,3
-DA:977,16
-DA:986,0
-DA:988,0
-DA:989,0
-DA:990,0
-DA:992,0
-DA:993,0
-DA:1019,4
-DA:1021,4
-DA:1022,4
-DA:1023,9
-DA:1025,1
-DA:1026,0
-DA:1027,1
-DA:1028,1
-DA:1031,0
-DA:1032,0
-DA:1033,0
-DA:1036,0
-DA:1040,4
-DA:1133,11
-DA:1135,11
-DA:1136,11
-DA:1137,11
-DA:1138,22
-DA:1140,0
-DA:1141,0
-DA:1142,0
-DA:1144,11
-DA:1145,11
-DA:1147,11
-DA:1148,11
-DA:1150,0
-DA:1152,0
-DA:1153,0
-DA:1154,0
-DA:1178,540957
-DA:1181,540957
-DA:1183,540957
-DA:1186,435266
-DA:1188,105691
-DA:1190,0
-DA:1194,0
-DA:1195,0
-DA:1196,0
-DA:1197,0
-DA:1200,0
-DA:1201,0
-DA:1204,0
-DA:1207,0
-DA:1209,0
-DA:1213,0
-DA:1214,0
-DA:1215,0
-DA:1216,0
-DA:1219,0
-DA:1220,0
-DA:1222,0
-DA:1225,0
-DA:1230,0
-DA:1313,0
-DA:1318,0
-DA:1319,0
-DA:1320,0
-DA:1321,0
-DA:1327,126
-DA:1332,126
-DA:1333,126
-DA:1334,126
-DA:1335,126
-DA:1341,4
-DA:1343,4
-DA:1344,4
-DA:1345,4
-DA:1346,4
-DA:1353,4
-DA:1355,4
-DA:1356,3
-DA:1358,2
-DA:1359,0
-DA:1360,4
-DA:1390,17
-DA:1392,17
-DA:1395,17
-DA:1403,16
-DA:1405,16
-DA:1408,16
-BA:105,0
-BA:105,0
-BA:119,0
-BA:119,0
-BA:571,2
-BA:571,2
-BA:571,2
-BA:571,2
-BA:571,0
-BA:571,0
-BA:826,2
-BA:826,1
-BA:826,2
-BA:826,1
-BA:826,0
-BA:826,0
-BA:826,2
-BA:826,1
-BA:831,2
-BA:831,2
-BA:831,2
-BA:831,2
-BA:831,0
-BA:831,0
-BA:831,2
-BA:831,1
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,2
-BA:850,1
-BA:850,1
-BA:850,2
-BA:850,0
-BA:850,0
-BA:850,2
-BA:850,1
-BA:850,1
-BA:850,2
-BA:850,0
-BA:850,0
-BA:850,2
-BA:850,1
-BA:850,1
-BA:850,2
-BA:850,0
-BA:850,0
-BA:908,2
-BA:908,2
-BA:908,2
-BA:908,2
-BA:908,0
-BA:908,0
-BA:908,1
-BA:908,2
-BA:913,2
-BA:913,2
-BA:913,2
-BA:913,2
-BA:913,0
-BA:913,0
-BA:913,1
-BA:913,2
-BA:918,2
-BA:918,2
-BA:918,2
-BA:918,2
-BA:918,0
-BA:918,0
-BA:918,0
-BA:918,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,2
-BA:939,2
-BA:939,2
-BA:939,2
-BA:939,2
-BA:939,2
-BA:956,2
-BA:956,2
-BA:956,0
-BA:956,0
-BA:956,1
-BA:956,2
-BA:956,1
-BA:956,2
-BA:957,2
-BA:957,1
-BA:957,0
-BA:957,0
-BA:957,0
-BA:957,0
-BA:957,0
-BA:957,0
-BA:972,0
-BA:972,0
-BA:972,2
-BA:972,2
-BA:972,2
-BA:972,2
-BA:973,0
-BA:973,0
-BA:973,2
-BA:973,1
-BA:973,2
-BA:973,2
-BA:988,0
-BA:988,0
-BA:989,0
-BA:989,0
-BA:1023,2
-BA:1023,2
-BA:1025,1
-BA:1025,2
-BA:1027,2
-BA:1027,1
-BA:1138,0
-BA:1138,0
-BA:1138,0
-BA:1138,0
-BA:1138,0
-BA:1138,0
-BA:1138,1
-BA:1138,2
-BA:1138,1
-BA:1138,2
-BA:1138,1
-BA:1138,2
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1145,0
-BA:1145,0
-BA:1145,0
-BA:1145,0
-BA:1145,0
-BA:1145,0
-BA:1145,2
-BA:1145,1
-BA:1145,2
-BA:1145,1
-BA:1145,2
-BA:1145,1
-BA:1147,0
-BA:1147,0
-BA:1147,0
-BA:1147,0
-BA:1147,0
-BA:1147,0
-BA:1147,2
-BA:1147,1
-BA:1147,2
-BA:1147,1
-BA:1147,2
-BA:1147,1
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1181,2
-BA:1181,1
-BA:1181,2
-BA:1181,1
-BA:1183,2
-BA:1183,2
-BA:1183,2
-BA:1183,1
-BA:1183,2
-BA:1183,2
-BA:1183,2
-BA:1183,2
-BA:1183,2
-BA:1183,1
-BA:1183,2
-BA:1183,2
-BA:1190,0
-BA:1190,0
-BA:1190,0
-BA:1190,0
-BA:1195,0
-BA:1195,0
-BA:1195,0
-BA:1195,0
-BA:1197,0
-BA:1197,0
-BA:1197,0
-BA:1197,0
-BA:1200,0
-BA:1200,0
-BA:1200,0
-BA:1200,0
-BA:1209,0
-BA:1209,0
-BA:1209,0
-BA:1209,0
-BA:1214,0
-BA:1214,0
-BA:1214,0
-BA:1214,0
-BA:1216,0
-BA:1216,0
-BA:1216,0
-BA:1216,0
-BA:1219,0
-BA:1219,0
-BA:1219,0
-BA:1219,0
-BA:1355,2
-BA:1355,1
-BA:1355,2
-BA:1355,2
-BA:1355,2
-BA:1355,2
-BA:1358,1
-BA:1358,2
-BA:1395,2
-BA:1395,2
-BA:1395,1
-BA:1395,2
-BA:1395,1
-BA:1395,2
-BA:1395,0
-BA:1395,0
-BA:1395,1
-BA:1395,2
-BA:1395,0
-BA:1395,0
-BA:1408,0
-BA:1408,0
-BA:1408,0
-BA:1408,0
-BA:1408,2
-BA:1408,2
-BA:1408,1
-BA:1408,2
-BA:1408,2
-BA:1408,1
-BA:1408,1
-BA:1408,2
-LF:285
-LH:220
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKiN7tagcoll5PatchIiiEEEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS7_ESaIS7_EEEEED2Ev
-FN:118,_ZN9__gnu_cxx13new_allocatorIN3ept7debtags3TagEE7destroyEPS3_
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:118,_ZN9__gnu_cxx13new_allocatorIiE7destroyEPi
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIN3ept7debtags3TagEED2Ev
-FN:107,_ZN9__gnu_cxx13new_allocatorIN3ept7debtags3TagEE9constructEPS3_RKS3_
-FN:71,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEEC2ERKS6_
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIiED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEEC2ERKS3_
-FN:107,_ZN9__gnu_cxx13new_allocatorIiE9constructEPiRKi
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKiN7tagcoll5PatchIiiEEEED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEEC2ERKS3_
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS7_ESaIS7_EEEEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS6_ESaIS6_EEEED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorIN3ept7debtags3TagEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorIiEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKiN7tagcoll5PatchIiiEEEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKiN7tagcoll5PatchIiiEEEEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS6_ESaIS6_EEEEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEE8max_sizeEv
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEE8max_sizeEv
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE8max_sizeEv
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKiN7tagcoll5PatchIiiEEEEE8max_sizeEv
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEEE8max_sizeEv
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS7_ESaIS7_EEEEE8max_sizeEv
-FN:118,_ZN9__gnu_cxx13new_allocatorISsE7destroyEPSs
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEE10deallocateEPS2_j
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKiN7tagcoll5PatchIiiEEEE7destroyEPS6_
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEE10deallocateEPS5_j
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS6_ESaIS6_EEEE7destroyEPSB_
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEE7destroyEPS9_
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE10deallocateEPS2_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS7_ESaIS7_EEEEE10deallocateEPSD_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEEE10deallocateEPSB_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKiN7tagcoll5PatchIiiEEEEE10deallocateEPS8_j
-FN:107,_ZN9__gnu_cxx13new_allocatorISsE9constructEPSsRKSs
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEE8allocateEjPKv
-FN:107,_ZN9__gnu_cxx13new_allocatorISt4pairIKiN7tagcoll5PatchIiiEEEE9constructEPS6_RKS6_
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEE8allocateEjPKv
-FN:107,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS6_ESaIS6_EEEE9constructEPSB_RKSB_
-FN:107,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEE9constructEPS9_RKS9_
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS7_ESaIS7_EEEEE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEEE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKiN7tagcoll5PatchIiiEEEEE8allocateEjPKv
-DA:69,59
-DA:71,520528
-DA:76,62
-DA:87,14
-DA:89,14
-DA:90,0
-DA:92,14
-DA:97,14
-DA:98,14
-DA:101,14
-DA:102,14
-DA:107,14
-DA:108,14
-DA:118,14
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,1
-BA:89,2
-BA:89,1
-BA:89,2
-BA:89,1
-BA:89,2
-BA:108,0
-BA:108,0
-BA:108,0
-BA:108,0
-BA:108,0
-BA:108,0
-BA:108,2
-BA:108,1
-BA:108,2
-BA:108,1
-BA:108,2
-BA:108,1
-LF:14
-LH:13
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:169,_ZNSolsEl
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:195,_ZNSolsEj
-DA:95,0
-DA:112,0
-DA:117,0
-DA:169,0
-DA:170,0
-DA:195,0
-DA:199,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/coll/base.h
-FN:48,_ZN7tagcoll4coll18ReadonlyCollectionINS0_6SimpleISsN3ept7debtags3TagEEEEC2Ev
-FN:273,_ZN7tagcoll4coll10CollectionINS0_6SimpleISsN3ept7debtags3TagEEEEC2Ev
-FN:313,_ZN7tagcoll4coll8InserterINS0_6SimpleISsN3ept7debtags3TagEEEEC1ERS6_
-FN:324,_ZN7tagcoll4coll8inserterINS0_6SimpleISsN3ept7debtags3TagEEEEENS0_8InserterIT_EERS8_
-FN:49,_ZNK7tagcoll4coll18ReadonlyCollectionINS0_12IntDiskIndexEE4selfEv
-FN:49,_ZNK7tagcoll4coll18ReadonlyCollectionINS0_7PatchedINS0_12IntDiskIndexEEEE4selfEv
-FN:316,_ZN7tagcoll4coll8InserterINS0_6SimpleISsN3ept7debtags3TagEEEEaSISt3setISsSt4lessISsESaISsEES9_IS5_SA_IS5_ESaIS5_EEEERS7_RKSt4pairIT_T0_E
-FN:145,_ZNK7tagcoll4coll18ReadonlyCollectionINS0_7PatchedINS0_12IntDiskIndexEEEE18getItemsHavingTagsISt3setIiSt4lessIiESaIiEEEESB_RKT_
-DA:48,2
-DA:49,42308
-DA:145,2
-DA:273,2
-DA:313,3
-DA:316,1
-DA:318,1
-DA:319,1
-DA:324,3
-DA:326,3
-LF:10
-LH:10
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/coll/base.tcc
-FN:63,_ZNK7tagcoll4coll18ReadonlyCollectionINS0_7PatchedINS0_12IntDiskIndexEEEE14getTagsOfItemsISt3setIiSt4lessIiESaIiEEEESB_RKT_
-FN:136,_ZNK7tagcoll4coll18ReadonlyCollectionINS0_12IntDiskIndexEE6outputIN3ept7debtags8IntToPkgINS0_8InserterINS0_6SimpleISsNS6_3TagEEEEEEEEEvT_
-FN:136,_ZNK7tagcoll4coll18ReadonlyCollectionINS0_7PatchedINS0_12IntDiskIndexEEEE6outputIN3ept7debtags8IntToPkgINS0_8InserterINS0_6SimpleISsNS8_3TagEEEEEEEEEvT_
-FN:136,_ZNK7tagcoll4coll18ReadonlyCollectionINS0_12IntDiskIndexEE6outputIN3ept7debtags8IntToPkgINS_6stream12CountingSinkIiEEEEEEvT_
-FN:136,_ZNK7tagcoll4coll18ReadonlyCollectionINS0_7PatchedINS0_12IntDiskIndexEEEE6outputIN3ept7debtags8IntToPkgINS_6stream12CountingSinkIiEEEEEEvT_
-DA:63,1
-DA:66,1
-DA:67,2
-DA:69,1
-DA:70,0
-DA:77,2
-DA:78,0
-DA:80,2
-DA:81,2
-DA:83,9
-DA:84,7
-DA:86,2
-DA:136,4
-DA:138,42294
-DA:141,42290
-DA:142,42294
-DA:144,4
-BA:67,2
-BA:67,2
-BA:77,1
-BA:77,2
-BA:83,2
-BA:83,2
-BA:138,1
-BA:138,2
-BA:138,1
-BA:138,2
-BA:138,2
-BA:138,2
-BA:138,2
-BA:138,2
-LF:17
-LH:15
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/coll/intdiskindex.h
-FN:74,_ZN7tagcoll4coll12IntDiskIndex14const_iteratorC1ERKS1_i
-FN:77,_ZN7tagcoll4coll12IntDiskIndex14const_iteratorC1ERKS1_
-FN:98,_ZNK7tagcoll4coll12IntDiskIndex14const_iteratoreqERKS2_
-FN:102,_ZNK7tagcoll4coll12IntDiskIndex14const_iteratorneERKS2_
-FN:107,_ZNK7tagcoll4coll12IntDiskIndex5beginEv
-FN:108,_ZNK7tagcoll4coll12IntDiskIndex3endEv
-FN:157,_ZNK7tagcoll4coll12IntDiskIndex14getCardinalityERKi
-FN:79,_ZN7tagcoll4coll12IntDiskIndex14const_iteratorD1Ev
-FN:92,_ZN7tagcoll4coll12IntDiskIndex14const_iteratorppEv
-FN:81,_ZNK7tagcoll4coll12IntDiskIndex14const_iteratordeEv
-FN:85,_ZNK7tagcoll4coll12IntDiskIndex14const_iteratorptEv
-DA:74,8
-DA:75,8
-DA:77,274893
-DA:78,274893
-DA:79,528661
-DA:81,105725
-DA:83,105725
-DA:85,42290
-DA:87,42290
-DA:88,21145
-DA:89,42290
-DA:92,105725
-DA:94,105725
-DA:95,105725
-DA:96,105725
-DA:98,169161
-DA:100,169161
-DA:102,105732
-DA:104,105732
-DA:107,8
-DA:108,274893
-DA:157,0
-DA:159,0
-BA:79,1
-BA:79,2
-BA:79,0
-BA:79,0
-BA:87,2
-BA:87,2
-BA:95,2
-BA:95,2
-BA:95,2
-BA:95,1
-LF:23
-LH:21
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/coll/patched.h
-FN:153,_ZNK7tagcoll4coll7PatchedINS0_12IntDiskIndexEE14const_iteratoreqERKS4_
-FN:157,_ZNK7tagcoll4coll7PatchedINS0_12IntDiskIndexEE14const_iteratorneERKS4_
-FN:96,_ZN7tagcoll4coll7PatchedINS0_12IntDiskIndexEE14const_iteratorC1ERKS3_RKNS2_14const_iteratorERKSt23_Rb_tree_const_iteratorISt4pairIKiNS_5PatchIiiEEEE
-FN:165,_ZNK7tagcoll4coll7PatchedINS0_12IntDiskIndexEE3endEv
-FN:164,_ZNK7tagcoll4coll7PatchedINS0_12IntDiskIndexEE5beginEv
-FN:100,_ZN7tagcoll4coll7PatchedINS0_12IntDiskIndexEE14const_iteratorD1Ev
-FN:51,_ZN7tagcoll4coll7PatchedINS0_12IntDiskIndexEED1Ev
-FN:205,_ZNK7tagcoll4coll7PatchedINS0_12IntDiskIndexEE13getTagsOfItemERKi
-FN:105,_ZNK7tagcoll4coll7PatchedINS0_12IntDiskIndexEE14const_iteratordeEv
-FN:123,_ZNK7tagcoll4coll7PatchedINS0_12IntDiskIndexEE14const_iteratorptEv
-FN:129,_ZN7tagcoll4coll7PatchedINS0_12IntDiskIndexEE14const_iteratorppEv
-FN:215,_ZNK7tagcoll4coll7PatchedINS0_12IntDiskIndexEE10getAllTagsEv
-FN:201,_ZN7tagcoll4coll7PatchedINS0_12IntDiskIndexEE10addChangesERKNS_9PatchListIiiEE
-FN:221,_ZN7tagcoll4coll7PatchedINS0_12IntDiskIndexEE11applyChangeERKNS_9PatchListIiiEE
-FN:209,_ZNK7tagcoll4coll7PatchedINS0_12IntDiskIndexEE17getItemsHavingTagERKi
-DA:51,10
-DA:96,84592
-DA:97,84592
-DA:100,148035
-DA:102,148035
-DA:103,0
-DA:104,148035
-DA:105,84580
-DA:107,84580
-DA:108,0
-DA:110,84580
-DA:111,0
-DA:112,84580
-DA:113,84580
-DA:114,0
-DA:115,0
-DA:116,0
-DA:117,0
-DA:118,0
-DA:119,0
-DA:121,0
-DA:123,211450
-DA:125,211450
-DA:126,126870
-DA:127,84580
-DA:129,84580
-DA:131,84580
-DA:133,84580
-DA:134,84580
-DA:135,0
-DA:136,0
-DA:137,0
-DA:138,0
-DA:139,0
-DA:140,0
-DA:143,0
-DA:144,0
-DA:146,84580
-DA:148,84580
-DA:149,84580
-DA:151,84580
-DA:153,1
-DA:155,1
-DA:157,84585
-DA:159,84585
-DA:164,6
-DA:165,84586
-DA:201,2
-DA:205,5
-DA:207,5
-DA:209,9
-DA:211,9
-DA:215,1
-DA:221,2
-BA:102,1
-BA:102,2
-BA:103,0
-BA:103,0
-BA:107,1
-BA:107,2
-BA:110,1
-BA:110,2
-BA:110,0
-BA:110,0
-BA:110,2
-BA:110,1
-BA:110,0
-BA:110,0
-BA:110,1
-BA:110,2
-BA:112,2
-BA:112,1
-BA:114,0
-BA:114,0
-BA:116,0
-BA:116,0
-BA:118,0
-BA:118,0
-BA:125,2
-BA:125,2
-BA:131,1
-BA:131,2
-BA:131,0
-BA:131,0
-BA:131,2
-BA:131,1
-BA:131,0
-BA:131,0
-BA:131,2
-BA:131,1
-BA:133,2
-BA:133,1
-BA:135,0
-BA:135,0
-BA:137,0
-BA:137,0
-BA:139,0
-BA:139,0
-BA:146,2
-BA:146,1
-BA:148,2
-BA:148,1
-BA:155,2
-BA:155,1
-BA:155,2
-BA:155,1
-BA:159,2
-BA:159,2
-BA:159,1
-BA:159,2
-LF:54
-LH:36
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/coll/patched.tcc
-DA:78,4
-DA:80,2
-DA:83,2
-DA:85,2
-DA:88,2
-DA:89,2
-DA:90,4
-DA:92,2
-DA:95,2
-DA:97,4
-DA:99,2
-DA:130,1
-DA:131,1
-DA:133,0
-DA:135,0
-DA:136,0
-DA:138,0
-DA:139,0
-BA:78,2
-BA:78,2
-BA:80,2
-BA:80,1
-BA:90,2
-BA:90,2
-BA:92,2
-BA:92,1
-BA:131,1
-BA:131,2
-BA:133,0
-BA:133,0
-BA:136,0
-BA:136,0
-LF:18
-LH:13
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/coll/simple.h
-FN:121,_ZNK7tagcoll4coll6SimpleISsN3ept7debtags3TagEE9itemCountEv
-FN:62,_ZN7tagcoll4coll6SimpleISsN3ept7debtags3TagEEC1Ev
-FN:128,_ZN7tagcoll4coll6SimpleISsN3ept7debtags3TagEE5clearEv
-FN:62,_ZN7tagcoll4coll6SimpleISsN3ept7debtags3TagEED1Ev
-DA:62,4
-DA:121,3
-DA:128,1
-DA:130,1
-DA:131,1
-LF:5
-LH:5
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/coll/simple.tcc
-FN:38,_ZN7tagcoll4coll6SimpleISsN3ept7debtags3TagEE6insertISt3setISsSt4lessISsESaISsEES7_IS4_S8_IS4_ESaIS4_EEEEvRKT_RKT0_
-DA:38,1
-DA:42,1
-DA:43,0
-DA:44,2
-DA:47,1
-DA:48,1
-DA:49,1
-DA:51,0
-DA:186,3
-BA:42,1
-BA:42,2
-BA:44,2
-BA:44,2
-BA:48,2
-BA:48,1
-LF:9
-LH:7
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/diskindex/int.h
-FN:53,_ZNK7tagcoll9diskindex3Int3bufEv
-FN:54,_ZNK7tagcoll9diskindex3Int3ofsEi
-FN:62,_ZNK7tagcoll9diskindex3Int4sizeEv
-FN:61,_ZNK7tagcoll9diskindex3Int4sizeEi
-DA:53,274890
-DA:54,274890
-DA:61,0
-DA:62,274893
-BA:61,0
-BA:61,0
-BA:61,0
-BA:61,0
-BA:62,2
-BA:62,2
-LF:4
-LH:3
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/patch.h
-FN:126,_ZN7tagcoll9PatchListIiiEC1Ev
-FN:126,_ZN7tagcoll9PatchListISsN3ept7debtags3TagEEC1Ev
-FN:49,_ZN7tagcoll5PatchIiiED1Ev
-FN:45,_ZN7tagcoll5PatchIiiEC1ERKi
-FN:49,_ZN7tagcoll5PatchISsN3ept7debtags3TagEED1Ev
-FN:124,_ZN7tagcoll9PatchListISsN3ept7debtags3TagEED1Ev
-FN:124,_ZN7tagcoll9PatchListIiiED1Ev
-FN:44,_ZN7tagcoll5PatchIiiEC1ERKS1_
-FN:44,_ZN7tagcoll5PatchISsN3ept7debtags3TagEEC1ERKS4_
-FN:124,_ZN7tagcoll9PatchListISsN3ept7debtags3TagEEaSERKS4_
-FN:83,_ZNK7tagcoll5PatchIiiE5applyERKSt3setIiSt4lessIiESaIiEE
-FN:172,_ZNK7tagcoll9PatchListIiiE5patchERKiRKSt3setIiSt4lessIiESaIiEE
-FN:48,_ZN7tagcoll5PatchISsN3ept7debtags3TagEEC1IN6wibble9SingletonIS3_EENS6_5EmptyIS3_EEEERKSsRKT_RKT0_
-FN:51,_ZN7tagcoll5PatchIiiE3addERKi
-FN:61,_ZN7tagcoll5PatchIiiE6removeERKi
-FN:56,_ZN7tagcoll5PatchISsN3ept7debtags3TagEE3addERKSt3setIS3_St4lessIS3_ESaIS3_EE
-FN:66,_ZN7tagcoll5PatchISsN3ept7debtags3TagEE6removeERKSt3setIS3_St4lessIS3_ESaIS3_EE
-FN:77,_ZN7tagcoll5PatchISsN3ept7debtags3TagEE9mergeWithERKS4_
-FN:141,_ZN7tagcoll9PatchListISsN3ept7debtags3TagEE8addPatchERKNS_5PatchISsS3_EE
-FN:56,_ZN7tagcoll5PatchIiiE3addERKSt3setIiSt4lessIiESaIiEE
-FN:66,_ZN7tagcoll5PatchIiiE6removeERKSt3setIiSt4lessIiESaIiEE
-FN:77,_ZN7tagcoll5PatchIiiE9mergeWithERKS1_
-FN:141,_ZN7tagcoll9PatchListIiiE8addPatchERKNS_5PatchIiiEE
-FN:152,_ZN7tagcoll9PatchListIiiE16addPatchInvertedERKNS_5PatchIiiEE
-FN:158,_ZN7tagcoll9PatchListIiiE16addPatchInvertedERKS1_
-FN:100,_ZN7tagcoll5PatchIiiE15removeRedundantESt3setIiSt4lessIiESaIiEE
-FN:164,_ZN7tagcoll9PatchListIiiE15removeRedundantERKiRKSt3setIiSt4lessIiESaIiEE
-DA:44,43
-DA:45,3
-DA:48,1
-DA:49,51
-DA:51,3
-DA:54,3
-DA:55,3
-DA:56,2
-DA:59,2
-DA:60,2
-DA:61,1
-DA:64,1
-DA:65,1
-DA:66,2
-DA:69,2
-DA:70,2
-DA:77,2
-DA:79,2
-DA:80,2
-DA:81,2
-DA:83,1
-DA:86,1
-DA:100,4
-DA:104,4
-DA:106,4
-DA:107,4
-DA:124,33
-DA:126,29
-DA:141,12
-DA:152,2
-DA:158,2
-DA:164,4
-DA:172,14
-LF:33
-LH:33
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/patch.tcc
-FN:40,_ZN7tagcoll5PatchIiiEC1IN6wibble9SingletonIiEENS3_5EmptyIiEEEERKiRKT_RKT0_
-FN:40,_ZN7tagcoll5PatchIiiEC1IN6wibble5EmptyIiEENS3_9SingletonIiEEEERKiRKT_RKT0_
-DA:40,2
-DA:41,3
-DA:43,3
-DA:44,3
-DA:45,3
-DA:51,12
-DA:52,0
-DA:54,12
-DA:55,12
-DA:56,10
-DA:58,2
-DA:73,2
-DA:74,0
-DA:76,8
-DA:78,2
-DA:79,4
-DA:81,0
-DA:87,4
-DA:89,2
-DA:90,2
-DA:120,4
-DA:121,4
-DA:122,4
-DA:129,14
-DA:130,14
-DA:132,13
-DA:135,1
-BA:51,1
-BA:51,2
-BA:51,0
-BA:51,0
-BA:51,1
-BA:51,2
-BA:51,1
-BA:51,2
-BA:51,0
-BA:51,0
-BA:51,1
-BA:51,2
-BA:55,2
-BA:55,1
-BA:55,2
-BA:55,2
-BA:73,1
-BA:73,2
-BA:73,0
-BA:73,0
-BA:73,1
-BA:73,2
-BA:76,2
-BA:76,2
-BA:79,1
-BA:79,2
-BA:87,2
-BA:87,2
-BA:121,2
-BA:121,1
-BA:130,2
-BA:130,2
-LF:27
-LH:24
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/stream/sink.h
-FN:58,_ZN7tagcoll6stream12CountingSinkIiEC1ERiS3_
-FN:73,_ZN7tagcoll6stream12countingSinkIiEENS0_12CountingSinkIT_EERS3_S5_
-FN:64,_ZN7tagcoll6stream12CountingSinkIiEaSISt3setISsSt4lessISsESaISsEES4_IN3ept7debtags3TagES5_ISB_ESaISB_EEEERS2_RKSt4pairIT_T0_E
-DA:58,2
-DA:59,2
-DA:64,42266
-DA:66,42266
-DA:67,42266
-DA:68,42266
-DA:73,2
-DA:75,2
-LF:8
-LH:8
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt/package.h
-FN:25,_ZN3ept4core7package6SourceD1Ev
-FN:28,_ZN3ept4core7package6SourceC1ERNS0_11AptDatabaseE
-FN:95,_ZN3ept4core7package6Source11getInternalILNS1_10PropertyIdE0EEENS1_12PropertyTypeIXT_EE1TEN8pkgCache11PkgIteratorE
-FN:38,_ZN3ept4core7package6Source8getTokenEN8pkgCache11PkgIteratorE
-FN:34,_ZN3ept4core7package6Source11lookupTokenENS_5TokenE
-FN:44,_ZN3ept4core7package6Source6existsENS_5TokenE
-FN:99,_ZN3ept4core7package6Source11getInternalILNS1_10PropertyIdE3EEENS1_12PropertyTypeIXT_EE1TEN8pkgCache11PkgIteratorE
-FN:30,_ZN3ept4core7package6Source12listInternalEv
-DA:25,15
-DA:28,15
-DA:30,3
-DA:31,3
-DA:34,17
-DA:35,17
-DA:38,3777
-DA:39,3777
-DA:40,3777
-DA:41,0
-DA:44,8
-DA:45,8
-DA:46,0
-DA:48,8
-DA:95,3778
-DA:96,3778
-DA:99,3783
-DA:100,3783
-BA:45,1
-BA:45,2
-LF:18
-LH:16
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt/record.h
-DA:86,1
-BA:86,1
-BA:86,2
-LF:1
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt/version.h
-FN:22,_ZNK3ept4core7version12InternalList4headEv
-FN:30,_ZNK3ept4core7version12InternalList5emptyEv
-FN:9,_ZN3ept4core7version12InternalListaSERKS2_
-FN:58,_ZN3ept4core7version6SourceD1Ev
-FN:60,_ZN3ept4core7version6SourceC1ERNS0_11AptDatabaseE
-FN:66,_ZN3ept4core7version6Source8getTokenEN8pkgCache11VerIteratorE
-FN:82,_ZN3ept4core7version6Source11getInternalILNS1_10PropertyIdE0EEENS1_12PropertyTypeIXT_EE1TEN8pkgCache11VerIteratorE
-FN:34,_ZN3ept4core7version12InternalList4seekEv
-FN:42,_ZN3ept4core7version12InternalListC1EN8pkgCache11PkgIteratorE
-FN:62,_ZN3ept4core7version6Source12listInternalEv
-FN:15,_ZNK3ept4core7version12InternalList4tailEv
-DA:9,3616
-DA:15,3616
-DA:16,3616
-DA:17,3616
-DA:18,3616
-DA:22,5424
-DA:23,5424
-DA:30,3618
-DA:31,3618
-DA:34,3618
-DA:36,14790
-DA:37,7554
-DA:38,7554
-DA:40,3618
-DA:42,2
-DA:43,2
-DA:45,2
-DA:46,2
-DA:47,2
-DA:58,12
-DA:60,12
-DA:62,2
-DA:63,2
-DA:66,1808
-DA:67,1808
-DA:68,1808
-DA:69,0
-DA:82,3616
-DA:83,3616
-DA:84,3616
-DA:85,7232
-DA:86,0
-BA:36,2
-BA:36,2
-BA:36,2
-BA:36,1
-BA:36,2
-BA:36,2
-LF:32
-LH:30
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt.h
-FN:60,_ZN3ept4core12PackageStatecvjEv
-FN:67,_ZN3ept4core12PackageStateoRERKS1_
-FN:72,_ZN3ept4core12PackageStateC1Ej
-FN:282,_ZN3ept4core11AptDatabase12invalidStateEv
-FN:353,_ZN3ept4core15AptInternalListIN8pkgCache11PkgIteratorEEC1ES3_
-FN:352,_ZNK3ept4core15AptInternalListIN8pkgCache11PkgIteratorEE5emptyEv
-FN:350,_ZNK3ept4core15AptInternalListIN8pkgCache11PkgIteratorEE4headEv
-FN:139,_ZN3ept4core11AptDatabaseC1Ev
-FN:209,_ZN3ept4core11AptDatabase10invalidateEv
-FN:331,_ZN3ept4core11AptDatabaseD1Ev
-FN:28,_ZNK3ept4core12AptException4descEv
-FN:27,_ZN3ept4core12AptExceptionD0Ev
-FN:27,_ZN3ept4core12AptExceptionD1Ev
-FN:32,_ZN3ept4core12AptExceptionC1ERKSs
-FN:164,_ZN3ept4core11AptDatabase9openCacheEv
-FN:113,_ZN3ept4core11AptDatabase5cacheEv
-FN:252,_ZN3ept4core11AptDatabase13lookupPackageENS_5TokenE
-FN:244,_ZN3ept4core11AptDatabase16installedVersionEN8pkgCache11PkgIteratorE
-FN:125,_ZN3ept4core11AptDatabase6policyEv
-FN:237,_ZN3ept4core11AptDatabase16candidateVersionEN8pkgCache11PkgIteratorE
-FN:227,_ZN3ept4core11AptDatabase16candidateVersionENS_5TokenE
-FN:256,_ZN3ept4core11AptDatabase13lookupVersionENS_5TokenE
-FN:325,_ZN3ept4core11AptDatabase8validateENS_5TokenE
-FN:158,_ZN3ept4core11AptDatabase9openStateEv
-FN:119,_ZN3ept4core11AptDatabase5stateEv
-FN:286,_ZN3ept4core11AptDatabase12packageStateEN8pkgCache11PkgIteratorE
-FN:318,_ZN3ept4core11AptDatabase12packageStateENS_5TokenE
-FN:345,_ZNK3ept4core15AptInternalListIN8pkgCache11PkgIteratorEE4tailEv
-DA:27,0
-DA:28,0
-DA:29,0
-DA:32,0
-DA:33,0
-DA:34,0
-DA:35,0
-DA:36,0
-DA:37,0
-DA:39,0
-DA:60,3786
-DA:67,5218
-DA:68,5218
-DA:69,5218
-DA:72,9003
-DA:73,9003
-DA:74,9003
-DA:113,5093
-DA:114,5093
-DA:115,20
-DA:116,5093
-DA:119,3793
-DA:120,3793
-DA:121,5
-DA:122,3793
-DA:125,1436
-DA:126,1436
-DA:127,0
-DA:128,1436
-DA:139,0
-DA:140,0
-DA:141,0
-DA:142,0
-DA:143,0
-DA:144,0
-DA:145,0
-DA:146,0
-DA:158,5
-DA:159,5
-DA:160,5
-DA:161,5
-DA:162,5
-DA:164,20
-DA:165,20
-DA:166,0
-DA:167,0
-DA:168,0
-DA:171,20
-DA:173,20
-DA:175,20
-DA:176,0
-DA:177,0
-DA:178,0
-DA:179,0
-DA:180,0
-DA:184,20
-DA:185,20
-DA:186,0
-DA:188,0
-DA:191,20
-DA:192,20
-DA:194,20
-DA:196,0
-DA:199,0
-DA:202,20
-DA:203,40
-DA:204,40
-DA:205,0
-DA:206,20
-DA:207,20
-DA:209,0
-DA:210,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:218,0
-DA:219,0
-DA:220,0
-DA:227,5
-DA:228,5
-DA:229,6
-DA:230,4
-DA:231,4
-DA:233,4
-DA:234,4
-DA:237,1432
-DA:238,1432
-DA:239,1432
-DA:240,1432
-DA:241,1432
-DA:244,1432
-DA:245,1432
-DA:247,1432
-DA:248,1432
-DA:249,1432
-DA:252,27
-DA:253,27
-DA:256,5
-DA:257,5
-DA:258,5
-DA:259,5
-DA:260,5
-DA:261,1
-DA:262,4
-DA:263,4
-DA:264,4
-DA:265,0
-DA:282,0
-DA:283,0
-DA:286,3784
-DA:288,3784
-DA:289,3784
-DA:290,0
-DA:291,3784
-DA:293,1432
-DA:294,3784
-DA:296,1
-DA:297,3784
-DA:298,3784
-DA:299,3
-DA:300,3784
-DA:302,0
-DA:303,3784
-DA:304,3780
-DA:305,3784
-DA:306,1
-DA:307,3784
-DA:308,0
-DA:309,3784
-DA:310,1
-DA:311,3784
-DA:312,0
-DA:313,3784
-DA:314,0
-DA:315,3784
-DA:318,1
-DA:319,1
-DA:320,1
-DA:321,1
-DA:322,0
-DA:325,4
-DA:326,4
-DA:327,0
-DA:328,4
-DA:331,0
-DA:332,0
-DA:333,0
-DA:345,11331
-DA:346,11331
-DA:347,11331
-DA:350,7554
-DA:352,11334
-DA:353,3
-BA:27,0
-BA:27,0
-BA:27,0
-BA:27,0
-BA:33,0
-BA:33,0
-BA:114,2
-BA:114,2
-BA:120,2
-BA:120,2
-BA:126,1
-BA:126,2
-BA:165,1
-BA:165,2
-BA:173,2
-BA:173,1
-BA:185,1
-BA:185,2
-BA:194,1
-BA:194,2
-BA:204,1
-BA:204,2
-BA:210,0
-BA:210,0
-BA:214,0
-BA:214,0
-BA:216,0
-BA:216,0
-BA:218,0
-BA:218,0
-BA:229,2
-BA:229,2
-BA:231,1
-BA:231,2
-BA:238,1
-BA:238,2
-BA:240,1
-BA:240,2
-BA:245,1
-BA:245,2
-BA:248,1
-BA:248,2
-BA:257,2
-BA:257,1
-BA:260,2
-BA:260,2
-BA:262,2
-BA:262,1
-BA:263,2
-BA:263,1
-BA:289,1
-BA:289,2
-BA:291,2
-BA:291,2
-BA:291,2
-BA:291,2
-BA:291,2
-BA:291,2
-BA:294,2
-BA:294,2
-BA:294,2
-BA:294,2
-BA:294,2
-BA:294,2
-BA:298,2
-BA:298,2
-BA:300,1
-BA:300,2
-BA:303,2
-BA:303,2
-BA:305,2
-BA:305,2
-BA:307,1
-BA:307,2
-BA:309,2
-BA:309,2
-BA:311,1
-BA:311,2
-BA:313,1
-BA:313,2
-BA:320,2
-BA:320,1
-BA:326,1
-BA:326,2
-BA:327,0
-BA:327,0
-BA:328,2
-BA:328,2
-LF:155
-LH:100
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt.test.h
-FN:10,_ZN11TestCoreAptD1Ev
-FN:15,_ZN11TestCoreAptC1Ev
-FN:90,_ZN11TestCoreApt10invalidateEv
-FN:85,_ZN11TestCoreApt6existsEv
-FN:70,_ZN11TestCoreApt8validateEv
-FN:31,_ZN11TestCoreApt11packageNameEv
-FN:24,_ZN11TestCoreApt12tokenVersionEv
-FN:19,_ZN11TestCoreApt5tokenEv
-FN:81,_ZN11TestCoreApt13packageState2Ev
-FN:77,_ZN11TestCoreApt12packageStateEv
-FN:44,_ZN11TestCoreApt23checkVersionPackageListIN3ept4core6SourceINS2_7version6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE0EEEEEvT_
-FN:66,_ZN11TestCoreApt14versionPackageEv
-FN:36,_ZN11TestCoreApt20checkPackageNameListIN3ept4core6SourceINS2_7package6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE0EEEEEvT_
-FN:57,_ZN11TestCoreApt15packageNameListEv
-FN:61,_ZN11TestCoreApt12versionCountEv
-FN:52,_ZN11TestCoreApt12packageCountEv
-DA:10,12
-DA:15,12
-DA:16,12
-DA:17,12
-DA:19,1
-DA:20,1
-DA:21,2
-DA:22,1
-DA:24,1
-DA:25,1
-DA:26,1
-DA:27,1
-DA:28,1
-DA:29,1
-DA:31,1
-DA:32,1
-DA:33,1
-DA:36,1
-DA:37,3779
-DA:38,3777
-DA:39,3777
-DA:41,1
-DA:44,1
-DA:45,1810
-DA:46,1808
-DA:47,3616
-DA:48,1808
-DA:50,1
-DA:52,1
-DA:54,1
-DA:55,1
-DA:57,1
-DA:58,1
-DA:59,1
-DA:61,1
-DA:63,1
-DA:64,1
-DA:66,1
-DA:67,1
-DA:68,1
-DA:70,1
-DA:71,1
-DA:73,2
-DA:74,2
-DA:75,1
-DA:77,1
-DA:78,1
-DA:79,1
-DA:81,1
-DA:82,1
-DA:83,1
-DA:85,1
-DA:86,1
-DA:87,2
-DA:88,1
-DA:90,1
-DA:91,1
-DA:92,1
-DA:93,2
-DA:94,1
-BA:37,2
-BA:37,2
-BA:45,2
-BA:45,2
-LF:60
-LH:60
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/source.h
-FN:38,_ZN3ept4core6SourceINS0_7version6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE0EEaSERKS9_
-FN:20,_ZN3ept4core6SourceINS0_7package6SourceENS2_5SetupENS2_12PropertyTypeEE4selfEv
-FN:75,_ZN3ept4core6SourceINS0_7package6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE0EEC1ERS3_NS0_15AptInternalListIN8pkgCache11PkgIteratorEEE
-FN:51,_ZNK3ept4core6SourceINS0_7package6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE0EE5emptyEv
-FN:20,_ZN3ept4core6SourceINS0_7version6SourceENS2_5SetupENS2_12PropertyTypeEE4selfEv
-FN:75,_ZN3ept4core6SourceINS0_7version6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE0EEC1ERS3_NS2_12InternalListE
-FN:51,_ZNK3ept4core6SourceINS0_7version6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE0EE5emptyEv
-FN:13,_ZN3ept4core6SourceINS0_7version6SourceENS2_5SetupENS2_12PropertyTypeEED2Ev
-FN:13,_ZN3ept4core6SourceINS0_7package6SourceENS2_5SetupENS2_12PropertyTypeEED2Ev
-FN:106,_ZN3ept4core6SourceINS0_7package6SourceENS2_5SetupENS2_12PropertyTypeEEC2Ev
-FN:106,_ZN3ept4core6SourceINS0_7version6SourceENS2_5SetupENS2_12PropertyTypeEEC2Ev
-FN:62,_ZNK3ept4core6SourceINS0_7package6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE0EE8propertyEv
-FN:60,_ZNK3ept4core6SourceINS0_7package6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE0EE5tokenEv
-FN:23,_ZN3ept4core6SourceINS0_7package6SourceENS2_5SetupENS2_12PropertyTypeEE3getILNS2_10PropertyIdE0EEENS5_IXT_EE1TENS_5TokenE
-FN:60,_ZNK3ept4core6SourceINS0_7version6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE0EE5tokenEv
-FN:62,_ZNK3ept4core6SourceINS0_7version6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE0EE8propertyEv
-FN:23,_ZN3ept4core6SourceINS0_7package6SourceENS2_5SetupENS2_12PropertyTypeEE3getILNS2_10PropertyIdE3EEENS5_IXT_EE1TENS_5TokenE
-FN:80,_ZN3ept4core6SourceINS0_7package6SourceENS2_5SetupENS2_12PropertyTypeEE4listILNS2_10PropertyIdE0EEENS6_12ComposedListIXT_EEEv
-FN:80,_ZN3ept4core6SourceINS0_7version6SourceENS2_5SetupENS2_12PropertyTypeEE4listILNS2_10PropertyIdE0EEENS6_12ComposedListIXT_EEEv
-FN:47,_ZNK3ept4core6SourceINS0_7version6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE0EE4tailEv
-FN:47,_ZNK3ept4core6SourceINS0_7package6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE0EE4tailEv
-DA:13,27
-DA:20,20
-DA:23,7
-DA:24,7
-DA:25,5
-DA:26,5
-DA:28,7
-DA:38,3616
-DA:47,11170
-DA:48,11170
-DA:51,11174
-DA:60,5585
-DA:62,7393
-DA:64,7393
-DA:75,11174
-DA:76,11174
-DA:80,4
-DA:82,4
-DA:106,27
-DA:107,27
-DA:108,27
-BA:24,2
-BA:24,1
-BA:24,2
-BA:24,2
-LF:21
-LH:21
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/test.h
-FN:12,_ZN18AptTestEnvironmentC2Ev
-FN:10,_ZN18AptTestEnvironmentD2Ev
-DA:10,0
-DA:12,0
-DA:13,0
-DA:14,0
-DA:15,0
-DA:16,0
-DA:17,0
-DA:18,0
-DA:19,0
-DA:20,0
-DA:21,0
-LF:11
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/token.h
-FN:10,_ZN3ept5TokenD1Ev
-FN:14,_ZN3ept5TokenC1Ev
-FN:10,_ZN3ept5TokenC1ERKS0_
-FN:15,_ZN3ept5TokenC1ESs
-FN:12,_ZNK3ept5Token2idEv
-FN:17,_ZNK3ept5Token7versionEv
-FN:22,_ZNK3ept5Token7packageEv
-FN:36,_ZNK3ept5Token10hasVersionEv
-FN:40,_ZNK3ept5Token5validEv
-FN:51,_ZlsRSoRKN3ept5TokenE
-FN:44,_ZNK3ept5TokenleERKS0_
-FN:10,_ZN3ept5TokenaSERKS0_
-DA:10,124
-DA:12,0
-DA:14,0
-DA:15,8
-DA:17,1831
-DA:19,1831
-DA:22,0
-DA:25,0
-DA:36,17
-DA:37,17
-DA:40,1
-DA:41,1
-DA:44,0
-DA:45,0
-DA:51,0
-DA:52,0
-BA:19,2
-BA:19,2
-BA:19,2
-BA:19,2
-BA:19,0
-BA:19,0
-BA:25,0
-BA:25,0
-LF:16
-LH:8
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/exception.h
-FN:190,_ZNK6wibble9exception7Generic4typeEv
-FN:109,_ZN6wibble9exception10AddContext7contextEv
-FN:137,_ZN6wibble9exception7ContextD2Ev
-FN:213,_ZNK6wibble9exception7Generic4whatEv
-FN:193,_ZNK6wibble9exception7Generic4descEv
-FN:187,_ZN6wibble9exception7GenericD0Ev
-FN:187,_ZN6wibble9exception7GenericD1Ev
-FN:187,_ZN6wibble9exception7GenericD2Ev
-FN:395,_ZN6wibble9exception6SystemD1Ev
-FN:154,_ZNK6wibble9exception7Context13formatContextEv
-FN:205,_ZNK6wibble9exception7Generic8fullInfoEv
-FN:117,_ZN6wibble9exception10AddContext11copyContextISt20back_insert_iteratorISt6vectorISsSaISsEEEEEvT_
-FN:153,_ZN6wibble9exception7Context10addContextERKSs
-FN:147,_ZN6wibble9exception7ContextC2ERKSs
-FN:186,_ZN6wibble9exception7GenericC2ERKSs
-DA:109,0
-DA:110,0
-DA:111,0
-DA:112,0
-DA:113,0
-DA:117,0
-DA:118,0
-DA:119,0
-DA:137,0
-DA:147,0
-DA:148,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:153,0
-DA:154,0
-DA:155,0
-DA:156,0
-DA:157,0
-DA:159,0
-DA:161,0
-DA:162,0
-DA:163,0
-DA:186,0
-DA:187,0
-DA:190,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:205,0
-DA:206,0
-DA:207,0
-DA:209,0
-DA:210,0
-DA:213,0
-DA:395,0
-BA:110,0
-BA:110,0
-BA:156,0
-BA:156,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:207,0
-BA:207,0
-BA:395,0
-BA:395,0
-LF:36
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/list.h
-FN:340,_ZN6wibble4list5countIN3ept4core6SourceINS3_7version6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEEEEjT_
-FN:340,_ZN6wibble4list5countIN3ept4core6SourceINS3_7package6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEEEEjT_
-DA:340,2
-DA:341,2
-DA:342,5589
-DA:343,5585
-DA:344,5585
-DA:346,2
-BA:342,2
-BA:342,2
-BA:342,2
-BA:342,2
-LF:6
-LH:6
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/mixin.h
-FN:13,_ZN6wibble5mixin10ComparableIN3ept5TokenEEC2Ev
-FN:13,_ZN6wibble5mixin10ComparableIN3ept4core6SourceINS3_7package6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEEEC2Ev
-FN:13,_ZN6wibble5mixin10ComparableIN3ept4core6SourceINS3_7version6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEEEC2Ev
-FN:15,_ZNK6wibble5mixin10ComparableIN3ept5TokenEE7cmpSelfEv
-FN:23,_ZNK6wibble5mixin10ComparableIN3ept5TokenEEeqERKS3_
-FN:19,_ZNK6wibble5mixin10ComparableIN3ept5TokenEEneERKS3_
-DA:13,11174
-DA:15,0
-DA:16,0
-DA:19,0
-DA:20,0
-DA:23,0
-DA:24,0
-BA:24,0
-BA:24,0
-BA:24,0
-BA:24,0
-LF:7
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:13,_ZN8LocationD1Ev
-FN:17,_ZN8LocationC1EPKciSs
-FN:13,_ZN8LocationC1ERKS_
-FN:52,_ZlsIN3ept5TokenEER12AssertFailedS3_T_
-FN:52,_ZlsISsER12AssertFailedS1_T_
-FN:52,_ZlsIPKcER12AssertFailedS3_T_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:52,_ZlsIiER12AssertFailedS1_T_
-FN:41,_ZN12AssertFailedD1Ev
-FN:59,_Z9assert_fnIbEv8LocationT_
-FN:59,_Z9assert_fnIjEv8LocationT_
-FN:101,_Z13assert_neq_fnIN3ept5TokenES1_Ev8LocationT_T0_
-FN:67,_Z12assert_eq_fnIN3ept5TokenES1_Ev8LocationT_T0_
-FN:67,_Z12assert_eq_fnISsSsEv8LocationT_T0_
-FN:67,_Z12assert_eq_fnISsPKcEv8LocationT_T0_
-FN:52,_ZlsIjER12AssertFailedS1_T_
-FN:67,_Z12assert_eq_fnIjiEv8LocationT_T0_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:59,2
-DA:61,2
-DA:62,0
-DA:64,2
-DA:67,7
-DA:69,7
-DA:70,0
-DA:71,0
-DA:75,7
-DA:101,1
-DA:103,1
-DA:104,1
-DA:105,0
-DA:106,0
-BA:42,0
-BA:42,0
-BA:61,0
-BA:61,0
-BA:61,1
-BA:61,2
-BA:69,1
-BA:69,2
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,1
-BA:69,2
-BA:103,1
-BA:103,2
-LF:31
-LH:9
-end_of_record
-SF:/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_apt.cpp
-FN:14,_Z41__static_initialization_and_destruction_0ii
-FN:14,_GLOBAL__I_ept_test_generated__home_mornfall_dev_pkg_ept_work_ept_core_apt.cpp
-FN:14,_Z22run_CoreApt_invalidatev
-FN:13,_Z18run_CoreApt_existsv
-FN:10,_Z20run_CoreApt_validatev
-FN:5,_Z23run_CoreApt_packageNamev
-FN:4,_Z24run_CoreApt_tokenVersionv
-FN:3,_Z17run_CoreApt_tokenv
-FN:12,_Z25run_CoreApt_packageState2v
-FN:11,_Z24run_CoreApt_packageStatev
-FN:9,_Z26run_CoreApt_versionPackagev
-FN:7,_Z27run_CoreApt_packageNameListv
-FN:8,_Z24run_CoreApt_versionCountv
-FN:6,_Z24run_CoreApt_packageCountv
-DA:3,1
-DA:4,1
-DA:5,1
-DA:6,1
-DA:7,1
-DA:8,1
-DA:9,1
-DA:10,1
-DA:11,1
-DA:12,1
-DA:13,1
-DA:14,4
-BA:14,2
-BA:14,1
-BA:14,2
-BA:14,1
-LF:12
-LH:12
-end_of_record
-SF:/usr/include/apt-pkg/cacheiterators.h
-FN:59,_ZNK8pkgCache11PkgIterator3endEv
-FN:66,_ZN8pkgCache11PkgIteratorptEv
-FN:67,_ZNK8pkgCache11PkgIteratorptEv
-FN:73,_ZNK8pkgCache11PkgIterator4NameEv
-FN:85,_ZN8pkgCache11PkgIteratorC1ERS_PNS_7PackageE
-FN:91,_ZN8pkgCache11PkgIteratorC1Ev
-FN:105,_ZN8pkgCache11VerIteratorppEi
-FN:106,_ZN8pkgCache11VerIteratorppEv
-FN:107,_ZNK8pkgCache11VerIterator3endEv
-FN:108,_ZN8pkgCache11VerIteratoraSERKS0_
-FN:112,_ZNK8pkgCache11VerIteratorneERKS0_
-FN:124,_ZNK8pkgCache11VerIterator6VerStrEv
-FN:127,_ZNK8pkgCache11VerIterator9ParentPkgEv
-FN:141,_ZN8pkgCache11VerIteratorC1Ev
-FN:142,_ZN8pkgCache11VerIteratorC1ERS_PNS_7VersionE
-FN:417,_ZNK8pkgCache11PkgIterator11VersionListEv
-FN:46,_ZN8pkgCache11PkgIteratorC1ERS_
-DA:46,19
-DA:48,19
-DA:49,19
-DA:50,19
-DA:59,89241
-DA:66,67369
-DA:67,3787
-DA:73,18343
-DA:85,5424
-DA:86,5424
-DA:88,5424
-DA:89,0
-DA:90,5424
-DA:91,29
-DA:105,15767
-DA:106,1808
-DA:107,58053
-DA:108,11172
-DA:112,1433
-DA:124,1830
-DA:127,5424
-DA:141,15
-DA:142,21130
-DA:143,21130
-DA:145,21130
-DA:146,0
-DA:147,21130
-DA:417,19696
-DA:418,19696
-BA:59,2
-BA:59,1
-BA:59,2
-BA:59,2
-BA:73,2
-BA:73,1
-BA:88,1
-BA:88,2
-BA:105,2
-BA:105,1
-BA:107,2
-BA:107,2
-BA:107,2
-BA:107,2
-BA:124,2
-BA:124,1
-BA:145,1
-BA:145,2
-LF:29
-LH:27
-end_of_record
-SF:/usr/include/apt-pkg/depcache.h
-FN:242,_ZNK11pkgDepCache10StateCache6DeleteEv
-FN:243,_ZNK11pkgDepCache10StateCache4KeepEv
-FN:248,_ZNK11pkgDepCache10StateCache9NowBrokenEv
-FN:250,_ZNK11pkgDepCache10StateCache10InstBrokenEv
-FN:252,_ZNK11pkgDepCache10StateCache7InstallEv
-FN:342,_ZN11pkgDepCacheixERKN8pkgCache11PkgIteratorE
-DA:242,3785
-DA:243,3785
-DA:248,3785
-DA:250,3785
-DA:252,3785
-DA:342,3787
-LF:6
-LH:6
-end_of_record
-SF:/usr/include/apt-pkg/error.h
-FN:84,_ZN11GlobalError5emptyEv
-DA:84,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/apt-pkg/pkgcache.h
-FN:326,_ZN8pkgCache8PkgBeginEv
-DA:326,19
-DA:327,19
-LF:2
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaISsED2Ev
-FN:98,_ZNSaISsEC2Ev
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:1534,_ZNKSs5c_strEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:612,_ZNKSs6lengthEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:392,_ZNSs10_S_compareEjj
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:928,_ZNSs6assignEPKc
-FN:509,_ZNSsaSEPKc
-FN:2188,_ZSteqIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_EPKS3_
-FN:2225,_ZStneIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_EPKS3_
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-FN:1941,_ZNKSs7compareERKSs
-FN:2312,_ZStleIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:2162,_ZSteqIcEN9__gnu_cxx11__enable_ifIXsrSt9__is_charIT_E7__valueEbE6__typeERKSbIS3_St11char_traitsIS3_ESaIS3_EESC_
-FN:835,_ZNSs6appendEPKc
-FN:2121,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_
-FN:501,_ZNSsaSERKSs
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:392,0
-DA:394,0
-DA:401,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:509,0
-DA:510,0
-DA:606,0
-DA:607,0
-DA:612,0
-DA:613,0
-DA:686,0
-DA:687,0
-DA:835,0
-DA:838,0
-DA:928,0
-DA:931,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:1941,0
-DA:1943,0
-DA:1944,0
-DA:1945,0
-DA:1947,0
-DA:1948,0
-DA:1949,0
-DA:1950,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2121,0
-DA:2123,0
-DA:2124,0
-DA:2125,0
-DA:2162,0
-DA:2165,0
-DA:2188,0
-DA:2189,0
-DA:2225,74475
-DA:2226,74475
-DA:2312,0
-DA:2313,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-BA:1948,0
-BA:1948,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-LF:90
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-DA:245,0
-DA:246,0
-DA:257,0
-DA:258,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,1301
-DA:126,1301
-DA:163,0
-DA:164,0
-LF:4
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb0EE3__bES7_
-FN:188,_ZSt3minIjERKT_S2_S2_
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb0EE3__bES6_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb1EE3__bES7_
-FN:268,_ZNSt12__niter_baseISt16ostream_iteratorISscSt11char_traitsIcEELb0EE3__bES3_
-FN:286,_ZNSt12__miter_baseIPSsLb0EE3__bES0_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb1EE3__bES6_
-FN:268,_ZNSt12__niter_baseISt20back_insert_iteratorISt6vectorISsSaISsEEELb0EE3__bES4_
-FN:268,_ZNSt12__niter_baseIPSsLb0EE3__bES0_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPKSsSt16ostream_iteratorISscSt11char_traitsIcEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPKSsSt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_SD_SC_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET0_T_SD_SC_
-FN:539,_ZNSt20__copy_move_backwardILb0ELb0ESt26random_access_iterator_tagE13__copy_move_bIPSsS3_EET0_T_S5_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0EPSsS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPSsS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardIPSsS0_ET0_T_S2_S1_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET1_T0_SA_S9_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET0_T_SA_S9_
-DA:188,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:210,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:268,0
-DA:269,0
-DA:276,0
-DA:277,0
-DA:286,0
-DA:287,0
-DA:337,0
-DA:340,0
-DA:342,0
-DA:343,0
-DA:344,0
-DA:346,0
-DA:385,0
-DA:393,0
-DA:396,0
-DA:430,0
-DA:435,0
-DA:456,0
-DA:466,0
-DA:539,0
-DA:542,0
-DA:543,0
-DA:544,0
-DA:579,0
-DA:587,0
-DA:592,0
-DA:597,0
-DA:602,0
-DA:624,0
-DA:636,0
-BA:193,0
-BA:193,0
-BA:215,0
-BA:215,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:542,0
-BA:542,0
-LF:38
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-DA:87,0
-DA:88,0
-DA:97,0
-DA:101,0
-DA:103,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-BA:101,0
-BA:101,0
-LF:9
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEdeEv
-FN:398,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEC1ERS2_
-FN:456,_ZSt13back_inserterISt6vectorISsSaISsEEESt20back_insert_iteratorIT_ERS4_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEC1ERKS2_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEE4baseEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEC1ERKS1_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-FN:429,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEdeEv
-FN:434,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEppEv
-FN:412,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEaSERKSs
-DA:398,0
-DA:412,0
-DA:414,0
-DA:415,0
-DA:429,0
-DA:430,0
-DA:434,0
-DA:435,0
-DA:456,0
-DA:457,0
-DA:683,2
-DA:695,0
-DA:696,0
-DA:747,2
-DA:748,2
-DA:769,1
-DA:770,1
-LF:17
-LH:5
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,0
-DA:166,0
-DA:167,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyIPSsS2_EET0_T_S4_S3_
-FN:113,_ZSt18uninitialized_copyIPSsS0_ET0_T_S2_S1_
-FN:261,_ZSt22__uninitialized_copy_aIPSsS0_SsET0_T_S2_S1_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPSsS0_SaISsEET0_T_S3_S2_RT1_
-DA:73,0
-DA:75,0
-DA:78,0
-DA:79,0
-DA:81,0
-DA:83,0
-DA:85,0
-DA:86,0
-DA:113,0
-DA:122,0
-DA:261,0
-DA:262,0
-DA:268,0
-DA:272,0
-BA:78,0
-BA:78,0
-BA:79,0
-BA:79,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:404,_ZNKSt6vectorISsSaISsEE3endEv
-FN:386,_ZNKSt6vectorISsSaISsEE5beginEv
-FN:484,_ZNKSt6vectorISsSaISsEE4sizeEv
-FN:101,_ZNKSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:395,_ZNSt6vectorISsSaISsEE3endEv
-FN:377,_ZNSt6vectorISsSaISsEE5beginEv
-FN:526,_ZNKSt6vectorISsSaISsEE5emptyEv
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:84,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseISsSaISsEEC2Ev
-FN:213,_ZNSt6vectorISsSaISsEEC1Ev
-FN:489,_ZNKSt6vectorISsSaISsEE8max_sizeEv
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-FN:1075,_ZNKSt6vectorISsSaISsEE12_M_check_lenEjPKc
-FN:143,_ZNSt12_Vector_baseISsSaISsEE11_M_allocateEj
-FN:686,_ZNSt6vectorISsSaISsEE9push_backERKSs
-DA:79,0
-DA:84,0
-DA:85,0
-DA:86,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:108,0
-DA:109,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:143,0
-DA:144,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:213,0
-DA:214,0
-DA:299,0
-DA:300,0
-DA:301,0
-DA:377,0
-DA:378,0
-DA:386,1
-DA:387,1
-DA:395,0
-DA:396,0
-DA:404,1
-DA:405,1
-DA:484,0
-DA:485,0
-DA:489,0
-DA:490,0
-DA:526,1
-DA:527,1
-DA:686,0
-DA:688,0
-DA:690,0
-DA:691,0
-DA:694,0
-DA:695,0
-DA:1075,0
-DA:1077,0
-DA:1078,0
-DA:1080,0
-DA:1081,0
-BA:144,0
-BA:144,0
-BA:149,0
-BA:149,0
-BA:688,0
-BA:688,0
-BA:1077,0
-BA:1077,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-LF:49
-LH:6
-end_of_record
-SF:/usr/include/c++/4.3/bits/stream_iterator.h
-FN:181,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERSoPKc
-FN:185,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERKS2_
-FN:202,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEdeEv
-FN:206,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEppEv
-FN:191,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEaSERKSs
-DA:181,0
-DA:182,0
-DA:185,0
-DA:186,0
-DA:191,0
-DA:196,0
-DA:197,0
-DA:198,0
-DA:202,0
-DA:203,0
-DA:206,0
-DA:207,0
-BA:197,0
-BA:197,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/vector.tcc
-FN:283,_ZNSt6vectorISsSaISsEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPSsS1_EERKSs
-DA:283,0
-DA:286,0
-DA:288,0
-DA:291,0
-DA:293,0
-DA:295,0
-DA:299,0
-DA:307,0
-DA:308,0
-DA:309,0
-DA:316,0
-DA:321,0
-DA:323,0
-DA:324,0
-DA:330,0
-DA:332,0
-DA:333,0
-DA:334,0
-DA:336,0
-DA:338,0
-DA:341,0
-DA:342,0
-DA:343,0
-DA:345,0
-BA:286,0
-BA:286,0
-LF:24
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/exception
-FN:59,_ZNSt9exceptionC2Ev
-FN:57,_ZNSt9exceptionC1ERKS_
-DA:57,0
-DA:59,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISsE8max_sizeEv
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-FN:107,_ZN9__gnu_cxx13new_allocatorISsE9constructEPSsRKSs
-FN:87,_ZN9__gnu_cxx13new_allocatorISsE8allocateEjPKv
-DA:69,0
-DA:71,0
-DA:76,0
-DA:87,0
-DA:89,0
-DA:90,0
-DA:92,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:107,0
-DA:108,0
-BA:89,0
-BA:89,0
-BA:108,0
-BA:108,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/istream
-FN:585,_ZNSiC2Ev
-FN:105,_ZNSiD2Ev
-FN:804,_ZNSdC2Ev
-FN:801,_ZNSdD2Ev
-DA:105,0
-DA:106,0
-DA:585,0
-DA:586,0
-DA:587,0
-DA:801,0
-DA:804,0
-DA:805,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:195,_ZNSolsEj
-DA:95,0
-DA:112,0
-DA:117,0
-DA:195,0
-DA:199,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:509,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:536,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:555,_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-DA:509,0
-DA:510,0
-DA:511,0
-DA:536,0
-DA:537,0
-DA:555,0
-DA:556,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-LF:25
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt/record.h
-FN:22,_ZNK3ept4core6record12InternalList4tailEv
-FN:28,_ZN3ept4core6record12InternalListC1ERNS1_6SourceE
-FN:179,_ZN3ept4core6record6Source12listInternalEv
-FN:189,_ZN3ept4core6record6Source15localityCompareEPKN8pkgCache7VerFileES6_
-FN:44,_ZN3ept4core6record6ParserD1Ev
-FN:177,_ZN3ept4core6record6SourceC1ERNS0_11AptDatabaseE
-FN:136,_ZN3ept4core6record6SourceD1Ev
-FN:120,_ZNK3ept4core6record6Parser5parseISsEET_RKS4_RKSs
-FN:183,_ZN3ept4core6record6Source11lookupTokenENS_5TokenE
-FN:208,_ZN3ept4core6record6Source9getRecordEN8pkgCache15VerFileIteratorE
-FN:61,_ZN3ept4core6record6ParserC1ERKSs
-FN:78,_ZNK3ept4core6record6Parser3getILNS1_10PropertyIdE8EEENS1_12PropertyTypeIXT_EE1TERKS7_
-FN:263,_ZN3ept4core6record6Source11getInternalILNS1_10PropertyIdE8EEENS1_12PropertyTypeIXT_EE1TEN8pkgCache15VerFileIteratorE
-FN:78,_ZNK3ept4core6record6Parser3getILNS1_10PropertyIdE1EEENS1_12PropertyTypeIXT_EE1TERKS7_
-FN:263,_ZN3ept4core6record6Source11getInternalILNS1_10PropertyIdE1EEENS1_12PropertyTypeIXT_EE1TEN8pkgCache15VerFileIteratorE
-FN:256,_ZN3ept4core6record6Source8getTokenEN8pkgCache15VerFileIteratorE
-FN:78,_ZNK3ept4core6record6Parser3getILNS1_10PropertyIdE5EEENS1_12PropertyTypeIXT_EE1TERKS7_
-FN:263,_ZN3ept4core6record6Source11getInternalILNS1_10PropertyIdE5EEENS1_12PropertyTypeIXT_EE1TEN8pkgCache15VerFileIteratorE
-FN:89,_ZNK3ept4core6record6Parser3getILNS1_10PropertyIdE10EEENS1_12PropertyTypeIXT_EE1TERKS7_
-FN:263,_ZN3ept4core6record6Source11getInternalILNS1_10PropertyIdE10EEENS1_12PropertyTypeIXT_EE1TEN8pkgCache15VerFileIteratorE
-FN:269,_ZN3ept4core6record6Source11getInternalILNS1_10PropertyIdE0EEENS1_12PropertyTypeIXT_EE1TEN8pkgCache15VerFileIteratorE
-FN:148,_ZN3ept4core6record6Source6vfListEv
-FN:279,_ZNK3ept4core6record12InternalList5emptyEv
-FN:274,_ZNK3ept4core6record12InternalList4headEv
-FN:128,_ZNK3ept4core6record6Parser5parseIiEET_RKS4_RKSs
-FN:78,_ZNK3ept4core6record6Parser3getILNS1_10PropertyIdE4EEENS1_12PropertyTypeIXT_EE1TERKS7_
-FN:263,_ZN3ept4core6record6Source11getInternalILNS1_10PropertyIdE4EEENS1_12PropertyTypeIXT_EE1TEN8pkgCache15VerFileIteratorE
-DA:22,870
-DA:23,870
-DA:24,870
-DA:28,2
-DA:29,2
-DA:30,2
-DA:44,1310
-DA:61,1310
-DA:78,1308
-DA:81,1308
-DA:86,1
-DA:89,2
-DA:91,2
-DA:92,4
-DA:93,1
-DA:94,1
-DA:95,1
-DA:96,0
-DA:98,1
-DA:120,1307
-DA:122,1307
-DA:123,0
-DA:124,1307
-DA:128,1
-DA:130,1
-DA:131,0
-DA:132,1
-DA:136,6
-DA:148,1742
-DA:149,1742
-DA:150,1741
-DA:152,1
-DA:155,3778
-DA:157,3777
-DA:158,1989
-DA:160,3596
-DA:163,1808
-DA:164,3181
-DA:165,1808
-DA:166,435
-DA:168,1808
-DA:169,435
-DA:173,1
-DA:174,1
-DA:177,6
-DA:179,2
-DA:180,2
-DA:183,5
-DA:184,5
-DA:189,4371
-DA:191,4371
-DA:192,0
-DA:193,4371
-DA:194,0
-DA:195,4371
-DA:196,0
-DA:198,4371
-DA:199,4371
-DA:200,0
-DA:208,1311
-DA:209,1311
-DA:210,1
-DA:212,1310
-DA:216,5
-DA:217,5
-DA:221,0
-DA:222,5
-DA:223,0
-DA:224,5
-DA:226,0
-DA:227,5
-DA:232,1310
-DA:233,1310
-DA:235,871
-DA:236,871
-DA:239,0
-DA:242,1310
-DA:243,1310
-DA:246,0
-DA:248,1310
-DA:251,1310
-DA:253,1310
-DA:256,435
-DA:257,435
-DA:258,435
-DA:259,0
-DA:263,1310
-DA:264,1310
-DA:265,1310
-DA:269,1
-DA:270,1
-DA:271,1
-DA:274,870
-DA:276,870
-DA:279,872
-DA:280,872
-BA:86,1
-BA:86,2
-BA:92,2
-BA:92,2
-BA:95,1
-BA:95,2
-BA:122,1
-BA:122,2
-BA:130,1
-BA:130,2
-BA:149,2
-BA:149,2
-BA:155,2
-BA:155,2
-BA:157,2
-BA:157,2
-BA:160,2
-BA:160,2
-BA:164,2
-BA:164,2
-BA:165,2
-BA:165,2
-BA:168,2
-BA:168,2
-BA:191,1
-BA:191,2
-BA:191,0
-BA:191,0
-BA:193,1
-BA:193,2
-BA:195,1
-BA:195,2
-BA:198,2
-BA:198,1
-BA:209,2
-BA:209,2
-BA:209,1
-BA:209,2
-BA:209,2
-BA:209,2
-BA:212,2
-BA:212,2
-BA:212,1
-BA:212,2
-BA:212,2
-BA:212,2
-BA:217,1
-BA:217,2
-BA:222,1
-BA:222,2
-BA:224,1
-BA:224,2
-BA:233,2
-BA:233,2
-BA:236,1
-BA:236,2
-BA:243,1
-BA:243,2
-LF:96
-LH:83
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt/record.test.h
-FN:9,_ZN13TestAptRecordD1Ev
-FN:13,_ZN13TestAptRecordC1Ev
-FN:52,_ZN13TestAptRecord11nonexistentEv
-FN:32,_ZN13TestAptRecord21checkShortDescriptionEv
-FN:21,_ZN13TestAptRecord16checkLookupValueEv
-FN:17,_ZN13TestAptRecord11checkLookupEv
-FN:38,_ZN13TestAptRecord19checkRecordNameListIN3ept4core6SourceINS2_6record6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE1EEEEEvT_
-FN:45,_ZN13TestAptRecord9checkListEv
-FN:27,_ZN13TestAptRecord18checkLookupNumericEv
-DA:9,6
-DA:13,6
-DA:14,6
-DA:15,6
-DA:17,1
-DA:18,1
-DA:19,1
-DA:21,1
-DA:22,1
-DA:24,2
-DA:25,1
-DA:27,1
-DA:29,1
-DA:30,1
-DA:32,1
-DA:34,1
-DA:35,1
-DA:38,1
-DA:39,437
-DA:40,435
-DA:41,435
-DA:43,1
-DA:45,1
-DA:48,1
-DA:49,1
-DA:50,1
-DA:52,1
-DA:54,1
-DA:55,1
-BA:39,2
-BA:39,2
-LF:29
-LH:29
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt/recordparser.h
-FN:41,_ZN3ept4core6record12RecordParserD2Ev
-FN:53,_ZN3ept4core6record12RecordParserC2ERKSs
-FN:75,_ZNK3ept4core6record12RecordParser6lookupERKSs
-DA:41,1310
-DA:53,1310
-DA:75,1310
-LF:3
-LH:3
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt.h
-FN:269,_ZN3ept4core11AptDatabase17lookupVersionFileEN8pkgCache11VerIteratorE
-FN:139,_ZN3ept4core11AptDatabaseC1Ev
-FN:209,_ZN3ept4core11AptDatabase10invalidateEv
-FN:331,_ZN3ept4core11AptDatabaseD1Ev
-FN:28,_ZNK3ept4core12AptException4descEv
-FN:27,_ZN3ept4core12AptExceptionD0Ev
-FN:27,_ZN3ept4core12AptExceptionD1Ev
-FN:32,_ZN3ept4core12AptExceptionC1ERKSs
-FN:164,_ZN3ept4core11AptDatabase9openCacheEv
-FN:113,_ZN3ept4core11AptDatabase5cacheEv
-FN:125,_ZN3ept4core11AptDatabase6policyEv
-FN:252,_ZN3ept4core11AptDatabase13lookupPackageENS_5TokenE
-FN:227,_ZN3ept4core11AptDatabase16candidateVersionENS_5TokenE
-FN:256,_ZN3ept4core11AptDatabase13lookupVersionENS_5TokenE
-DA:27,0
-DA:28,0
-DA:29,0
-DA:32,0
-DA:33,0
-DA:34,0
-DA:35,0
-DA:36,0
-DA:37,0
-DA:39,0
-DA:113,0
-DA:114,0
-DA:115,0
-DA:116,0
-DA:125,0
-DA:126,0
-DA:127,0
-DA:128,0
-DA:139,0
-DA:140,0
-DA:141,0
-DA:142,0
-DA:143,0
-DA:144,0
-DA:145,0
-DA:146,0
-DA:164,0
-DA:165,0
-DA:166,0
-DA:167,0
-DA:168,0
-DA:171,0
-DA:173,0
-DA:175,0
-DA:176,0
-DA:177,0
-DA:178,0
-DA:179,0
-DA:180,0
-DA:184,0
-DA:185,0
-DA:186,0
-DA:188,0
-DA:191,0
-DA:192,0
-DA:194,0
-DA:196,0
-DA:199,0
-DA:202,0
-DA:203,0
-DA:204,0
-DA:205,0
-DA:206,0
-DA:207,0
-DA:209,0
-DA:210,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:218,0
-DA:219,0
-DA:220,0
-DA:227,0
-DA:228,0
-DA:229,0
-DA:230,0
-DA:231,0
-DA:233,0
-DA:234,0
-DA:252,0
-DA:253,0
-DA:256,0
-DA:257,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:261,0
-DA:262,0
-DA:263,0
-DA:264,0
-DA:265,0
-DA:269,5
-DA:271,5
-DA:272,1
-DA:273,4
-DA:274,4
-DA:275,4
-DA:276,4
-DA:277,4
-DA:278,0
-DA:279,4
-DA:331,0
-DA:332,0
-DA:333,0
-BA:27,0
-BA:27,0
-BA:27,0
-BA:27,0
-BA:33,0
-BA:33,0
-BA:114,0
-BA:114,0
-BA:126,0
-BA:126,0
-BA:165,0
-BA:165,0
-BA:173,0
-BA:173,0
-BA:185,0
-BA:185,0
-BA:194,0
-BA:194,0
-BA:204,0
-BA:204,0
-BA:210,0
-BA:210,0
-BA:214,0
-BA:214,0
-BA:216,0
-BA:216,0
-BA:218,0
-BA:218,0
-BA:229,0
-BA:229,0
-BA:231,0
-BA:231,0
-BA:257,0
-BA:257,0
-BA:260,0
-BA:260,0
-BA:262,0
-BA:262,0
-BA:263,0
-BA:263,0
-BA:271,2
-BA:271,2
-BA:274,2
-BA:274,1
-BA:275,2
-BA:275,1
-BA:277,1
-BA:277,2
-LF:96
-LH:9
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/source.h
-FN:20,_ZN3ept4core6SourceINS0_6record6SourceENS2_5SetupENS2_12PropertyTypeEE4selfEv
-FN:75,_ZN3ept4core6SourceINS0_6record6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE1EEC1ERS3_NS2_12InternalListE
-FN:80,_ZN3ept4core6SourceINS0_6record6SourceENS2_5SetupENS2_12PropertyTypeEE4listILNS2_10PropertyIdE1EEENS6_12ComposedListIXT_EEEv
-FN:47,_ZNK3ept4core6SourceINS0_6record6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE1EE4tailEv
-FN:13,_ZN3ept4core6SourceINS0_6record6SourceENS2_5SetupENS2_12PropertyTypeEED2Ev
-FN:106,_ZN3ept4core6SourceINS0_6record6SourceENS2_5SetupENS2_12PropertyTypeEEC2Ev
-FN:23,_ZN3ept4core6SourceINS0_6record6SourceENS2_5SetupENS2_12PropertyTypeEE3getILNS2_10PropertyIdE1EEENS5_IXT_EE1TENS_5TokenE
-FN:23,_ZN3ept4core6SourceINS0_6record6SourceENS2_5SetupENS2_12PropertyTypeEE3getILNS2_10PropertyIdE5EEENS5_IXT_EE1TENS_5TokenE
-FN:23,_ZN3ept4core6SourceINS0_6record6SourceENS2_5SetupENS2_12PropertyTypeEE3getILNS2_10PropertyIdE10EEENS5_IXT_EE1TENS_5TokenE
-FN:23,_ZN3ept4core6SourceINS0_6record6SourceENS2_5SetupENS2_12PropertyTypeEE3getILNS2_10PropertyIdE0EEENS5_IXT_EE1TENS_5TokenE
-FN:51,_ZNK3ept4core6SourceINS0_6record6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE1EE5emptyEv
-FN:60,_ZNK3ept4core6SourceINS0_6record6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE1EE5tokenEv
-FN:62,_ZNK3ept4core6SourceINS0_6record6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE1EE8propertyEv
-FN:23,_ZN3ept4core6SourceINS0_6record6SourceENS2_5SetupENS2_12PropertyTypeEE3getILNS2_10PropertyIdE4EEENS5_IXT_EE1TENS_5TokenE
-DA:13,6
-DA:20,15
-DA:23,6
-DA:24,6
-DA:25,5
-DA:26,5
-DA:28,6
-DA:47,870
-DA:48,870
-DA:51,872
-DA:60,435
-DA:62,435
-DA:64,435
-DA:75,872
-DA:76,872
-DA:80,2
-DA:82,2
-DA:106,6
-DA:107,6
-DA:108,6
-BA:24,2
-BA:24,1
-BA:24,1
-BA:24,2
-BA:24,2
-BA:24,1
-BA:24,2
-BA:24,1
-BA:24,2
-BA:24,1
-LF:20
-LH:20
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/test.h
-FN:12,_ZN18AptTestEnvironmentC2Ev
-FN:10,_ZN18AptTestEnvironmentD2Ev
-DA:10,0
-DA:12,0
-DA:13,0
-DA:14,0
-DA:15,0
-DA:16,0
-DA:17,0
-DA:18,0
-DA:19,0
-DA:20,0
-DA:21,0
-LF:11
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/token.h
-FN:10,_ZN3ept5TokenD1Ev
-FN:14,_ZN3ept5TokenC1Ev
-FN:15,_ZN3ept5TokenC1ESs
-FN:10,_ZN3ept5TokenC1ERKS0_
-FN:44,_ZNK3ept5TokenleERKS0_
-FN:10,_ZN3ept5TokenaSERKS0_
-FN:22,_ZNK3ept5Token7packageEv
-FN:17,_ZNK3ept5Token7versionEv
-FN:36,_ZNK3ept5Token10hasVersionEv
-DA:10,0
-DA:14,0
-DA:15,0
-DA:17,0
-DA:19,0
-DA:22,0
-DA:25,0
-DA:36,0
-DA:37,0
-DA:44,0
-DA:45,0
-BA:19,0
-BA:19,0
-BA:19,0
-BA:19,0
-BA:19,0
-BA:19,0
-BA:25,0
-BA:25,0
-LF:11
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/exception.h
-FN:190,_ZNK6wibble9exception7Generic4typeEv
-FN:109,_ZN6wibble9exception10AddContext7contextEv
-FN:137,_ZN6wibble9exception7ContextD2Ev
-FN:213,_ZNK6wibble9exception7Generic4whatEv
-FN:193,_ZNK6wibble9exception7Generic4descEv
-FN:154,_ZNK6wibble9exception7Context13formatContextEv
-FN:187,_ZN6wibble9exception7GenericD0Ev
-FN:187,_ZN6wibble9exception7GenericD1Ev
-FN:187,_ZN6wibble9exception7GenericD2Ev
-FN:395,_ZN6wibble9exception6SystemD1Ev
-FN:117,_ZN6wibble9exception10AddContext11copyContextISt20back_insert_iteratorISt6vectorISsSaISsEEEEEvT_
-FN:153,_ZN6wibble9exception7Context10addContextERKSs
-FN:147,_ZN6wibble9exception7ContextC2ERKSs
-FN:186,_ZN6wibble9exception7GenericC2ERKSs
-FN:205,_ZNK6wibble9exception7Generic8fullInfoEv
-DA:109,0
-DA:110,0
-DA:111,0
-DA:112,0
-DA:113,0
-DA:117,0
-DA:118,0
-DA:119,0
-DA:137,0
-DA:147,0
-DA:148,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:153,0
-DA:154,0
-DA:155,0
-DA:156,0
-DA:157,0
-DA:159,0
-DA:161,0
-DA:162,0
-DA:163,0
-DA:186,0
-DA:187,0
-DA:190,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:205,0
-DA:206,0
-DA:207,0
-DA:209,0
-DA:210,0
-DA:213,0
-DA:395,0
-BA:110,0
-BA:110,0
-BA:156,0
-BA:156,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:207,0
-BA:207,0
-BA:395,0
-BA:395,0
-LF:36
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/list.h
-FN:340,_ZN6wibble4list5countIN3ept4core6SourceINS3_6record6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE1EEEEEjT_
-DA:340,1
-DA:341,1
-DA:342,437
-DA:343,435
-DA:344,435
-DA:346,1
-BA:342,2
-BA:342,2
-LF:6
-LH:6
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/mixin.h
-FN:13,_ZN6wibble5mixin10ComparableIN3ept5TokenEEC2Ev
-FN:13,_ZN6wibble5mixin10ComparableIN3ept4core6SourceINS3_6record6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE1EEEEC2Ev
-FN:15,_ZNK6wibble5mixin10ComparableIN3ept5TokenEE7cmpSelfEv
-FN:23,_ZNK6wibble5mixin10ComparableIN3ept5TokenEEeqERKS3_
-FN:19,_ZNK6wibble5mixin10ComparableIN3ept5TokenEEneERKS3_
-DA:13,872
-DA:15,0
-DA:16,0
-DA:19,0
-DA:20,0
-DA:23,0
-DA:24,0
-BA:24,0
-BA:24,0
-BA:24,0
-BA:24,0
-LF:7
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:13,_ZN8LocationD1Ev
-FN:17,_ZN8LocationC1EPKciSs
-FN:13,_ZN8LocationC1ERKS_
-FN:52,_ZlsISsER12AssertFailedS1_T_
-FN:52,_ZlsIPKcER12AssertFailedS3_T_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:52,_ZlsIiER12AssertFailedS1_T_
-FN:41,_ZN12AssertFailedD1Ev
-FN:67,_Z12assert_eq_fnISsPKcEv8LocationT_T0_
-FN:67,_Z12assert_eq_fnISsSsEv8LocationT_T0_
-FN:67,_Z12assert_eq_fnIiiEv8LocationT_T0_
-FN:59,_Z9assert_fnIbEv8LocationT_
-FN:52,_ZlsIjER12AssertFailedS1_T_
-FN:67,_Z12assert_eq_fnIjiEv8LocationT_T0_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:59,0
-DA:61,0
-DA:62,0
-DA:64,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:75,0
-BA:42,0
-BA:42,0
-BA:61,0
-BA:61,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-LF:26
-LH:0
-end_of_record
-SF:/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_apt_record.cpp
-FN:8,_Z41__static_initialization_and_destruction_0ii
-FN:8,_GLOBAL__I_ept_test_generated__home_mornfall_dev_pkg_ept_work_ept_core_apt_record.cpp
-FN:8,_Z25run_AptRecord_nonexistentv
-FN:6,_Z35run_AptRecord_checkShortDescriptionv
-FN:4,_Z30run_AptRecord_checkLookupValuev
-FN:3,_Z25run_AptRecord_checkLookupv
-FN:7,_Z23run_AptRecord_checkListv
-FN:5,_Z32run_AptRecord_checkLookupNumericv
-DA:3,1
-DA:4,1
-DA:5,1
-DA:6,1
-DA:7,1
-DA:8,4
-BA:8,2
-BA:8,1
-BA:8,2
-BA:8,1
-LF:6
-LH:6
-end_of_record
-SF:/usr/include/apt-pkg/cacheiterators.h
-FN:59,_ZNK8pkgCache11PkgIterator3endEv
-FN:66,_ZN8pkgCache11PkgIteratorptEv
-FN:105,_ZN8pkgCache11VerIteratorppEi
-FN:106,_ZN8pkgCache11VerIteratorppEv
-FN:107,_ZNK8pkgCache11VerIterator3endEv
-FN:124,_ZNK8pkgCache11VerIterator6VerStrEv
-FN:141,_ZN8pkgCache11VerIteratorC1Ev
-FN:142,_ZN8pkgCache11VerIteratorC1ERS_PNS_7VersionE
-FN:324,_ZN8pkgCache15PkgFileIteratorptEv
-FN:327,_ZN8pkgCache15PkgFileIteratorcvPNS_11PackageFileEEv
-FN:329,_ZN8pkgCache15PkgFileIterator5CacheEv
-FN:331,_ZNK8pkgCache15PkgFileIterator8FileNameEv
-FN:347,_ZN8pkgCache15PkgFileIteratorC1Ev
-FN:349,_ZN8pkgCache15PkgFileIteratorC1ERS_PNS_11PackageFileE
-FN:361,_ZN8pkgCache15VerFileIteratorppEi
-FN:362,_ZN8pkgCache15VerFileIteratorppEv
-FN:363,_ZNK8pkgCache15VerFileIterator3endEv
-FN:370,_ZN8pkgCache15VerFileIteratorptEv
-FN:373,_ZN8pkgCache15VerFileIteratorcvPNS_7VerFileEEv
-FN:375,_ZN8pkgCache15VerFileIterator5CacheEv
-FN:377,_ZNK8pkgCache15VerFileIterator4FileEv
-FN:380,_ZN8pkgCache15VerFileIteratorC1Ev
-FN:381,_ZN8pkgCache15VerFileIteratorC1ERS_PNS_7VerFileE
-FN:417,_ZNK8pkgCache11PkgIterator11VersionListEv
-FN:431,_ZNK8pkgCache11VerIterator8FileListEv
-FN:46,_ZN8pkgCache11PkgIteratorC1ERS_
-FN:58,_ZN8pkgCache11PkgIteratorppEv
-DA:46,0
-DA:48,0
-DA:49,0
-DA:50,0
-DA:58,52878
-DA:59,0
-DA:66,0
-DA:105,0
-DA:106,0
-DA:107,0
-DA:124,0
-DA:141,0
-DA:142,0
-DA:143,0
-DA:145,0
-DA:146,0
-DA:147,0
-DA:324,26403
-DA:327,5202
-DA:329,5216
-DA:331,26
-DA:347,15
-DA:349,26429
-DA:361,22055
-DA:362,11714
-DA:363,90338
-DA:370,10056
-DA:373,4341
-DA:375,1311
-DA:377,26406
-DA:380,7
-DA:381,27354
-DA:417,0
-DA:418,0
-DA:431,26484
-DA:432,26484
-BA:59,0
-BA:59,0
-BA:59,0
-BA:59,0
-BA:105,0
-BA:105,0
-BA:107,0
-BA:107,0
-BA:107,0
-BA:107,0
-BA:124,0
-BA:124,0
-BA:145,0
-BA:145,0
-BA:327,2
-BA:327,1
-BA:331,2
-BA:331,1
-BA:361,2
-BA:361,1
-BA:373,2
-BA:373,1
-LF:36
-LH:18
-end_of_record
-SF:/usr/include/apt-pkg/error.h
-FN:84,_ZN11GlobalError5emptyEv
-DA:84,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/apt-pkg/fileutl.h
-FN:63,_ZN6FileFd6IsOpenEv
-FN:75,_ZN6FileFdC1Ei
-DA:63,32
-DA:75,15
-LF:2
-LH:2
-end_of_record
-SF:/usr/include/apt-pkg/pkgcache.h
-FN:326,_ZN8pkgCache8PkgBeginEv
-DA:326,0
-DA:327,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaISsED2Ev
-FN:106,_ZNSaIjED2Ev
-FN:106,_ZNSaIPN8pkgCache7VerFileEED2Ev
-FN:98,_ZNSaISsEC2Ev
-FN:98,_ZNSaIjEC2Ev
-FN:98,_ZNSaIPN8pkgCache7VerFileEEC2Ev
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,2664
-DA:100,0
-DA:101,0
-DA:106,2673
-DA:118,0
-DA:119,0
-LF:6
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:1534,_ZNKSs5c_strEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:612,_ZNKSs6lengthEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:392,_ZNSs10_S_compareEjj
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:928,_ZNSs6assignEPKc
-FN:509,_ZNSsaSEPKc
-FN:1941,_ZNKSs7compareERKSs
-FN:2312,_ZStleIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:2162,_ZSteqIcEN9__gnu_cxx11__enable_ifIXsrSt9__is_charIT_E7__valueEbE6__typeERKSbIS3_St11char_traitsIS3_ESaIS3_EESC_
-FN:501,_ZNSsaSERKSs
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-FN:835,_ZNSs6appendEPKc
-FN:2121,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_
-FN:2188,_ZSteqIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_EPKS3_
-FN:2225,_ZStneIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_EPKS3_
-FN:1593,_ZNKSs4findEPKcj
-FN:306,_ZNKSs8_M_checkEjPKc
-FN:1923,_ZNKSs6substrEjj
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:306,0
-DA:308,0
-DA:309,0
-DA:310,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:392,0
-DA:394,0
-DA:401,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:509,0
-DA:510,0
-DA:606,0
-DA:607,0
-DA:612,0
-DA:613,0
-DA:686,0
-DA:687,0
-DA:835,0
-DA:838,0
-DA:928,0
-DA:931,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:1593,0
-DA:1596,0
-DA:1923,0
-DA:1925,0
-DA:1941,0
-DA:1943,0
-DA:1944,0
-DA:1945,0
-DA:1947,0
-DA:1948,0
-DA:1949,0
-DA:1950,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2121,0
-DA:2123,0
-DA:2124,0
-DA:2125,0
-DA:2162,0
-DA:2165,0
-DA:2188,0
-DA:2189,0
-DA:2225,0
-DA:2226,0
-DA:2312,0
-DA:2313,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:308,0
-BA:308,0
-BA:341,0
-BA:341,0
-BA:1948,0
-BA:1948,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-LF:98
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:257,0
-DA:258,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algo.h
-FN:123,_ZSt8__medianIPN8pkgCache7VerFileEPFbPKS1_S4_EERKT_S9_S9_S9_T0_
-FN:1731,_ZSt25__unguarded_linear_insertIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEES4_PFbPKS3_SB_EEvT_T0_T1_
-FN:1806,_ZSt26__unguarded_insertion_sortIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEEPFbPKS3_SB_EEvT_SE_T0_
-FN:1877,_ZSt21__unguarded_partitionIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEES4_PFbPKS3_SB_EET_SE_SE_T0_T1_
-FN:1568,_ZSt13__heap_selectIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEEPFbPKS3_SB_EEvT_SE_SE_T0_
-FN:4661,_ZSt12partial_sortIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEEPFbPKS3_SB_EEvT_SE_SE_T0_
-FN:1930,_ZSt16__introsort_loopIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEEiPFbPKS3_SB_EEvT_SE_T0_T1_
-FN:1771,_ZSt16__insertion_sortIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEEPFbPKS3_SB_EEvT_SE_T0_
-FN:1840,_ZSt22__final_insertion_sortIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEEPFbPKS3_SB_EEvT_SE_T0_
-FN:1970,_ZSt4__lgi
-FN:4806,_ZSt4sortIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEEPFbPKS3_SB_EEvT_SE_T0_
-DA:123,458
-DA:128,458
-DA:129,213
-DA:130,118
-DA:131,95
-DA:132,54
-DA:134,41
-DA:135,245
-DA:136,52
-DA:137,193
-DA:138,96
-DA:140,97
-DA:1568,0
-DA:1570,0
-DA:1571,0
-DA:1572,0
-DA:1573,0
-DA:1574,0
-DA:1731,4321
-DA:1733,4321
-DA:1734,4321
-DA:1735,18873
-DA:1737,10231
-DA:1738,10231
-DA:1739,10231
-DA:1741,4321
-DA:1742,4321
-DA:1771,10
-DA:1773,10
-DA:1775,160
-DA:1778,150
-DA:1779,150
-DA:1781,10
-DA:1782,10
-DA:1785,140
-DA:1806,10
-DA:1811,4191
-DA:1812,4181
-DA:1813,10
-DA:1840,10
-DA:1842,10
-DA:1844,10
-DA:1845,10
-DA:1849,0
-DA:1850,10
-DA:1877,6263
-DA:1879,5805
-DA:1881,21262
-DA:1882,8736
-DA:1883,6263
-DA:1884,19248
-DA:1885,6722
-DA:1886,6263
-DA:1887,458
-DA:1888,5805
-DA:1889,5805
-DA:1930,468
-DA:1935,1394
-DA:1937,458
-DA:1939,0
-DA:1940,0
-DA:1942,458
-DA:1952,458
-DA:1953,458
-DA:1954,458
-DA:1970,0
-DA:1971,0
-DA:4661,0
-DA:4674,0
-DA:4675,0
-DA:4676,0
-DA:4806,10
-DA:4818,10
-DA:4820,10
-DA:4822,10
-DA:4824,10
-BA:128,2
-BA:128,2
-BA:129,2
-BA:129,2
-BA:131,2
-BA:131,2
-BA:135,2
-BA:135,2
-BA:137,2
-BA:137,2
-BA:1571,0
-BA:1571,0
-BA:1572,0
-BA:1572,0
-BA:1735,2
-BA:1735,2
-BA:1773,2
-BA:1773,1
-BA:1775,2
-BA:1775,2
-BA:1779,2
-BA:1779,2
-BA:1811,2
-BA:1811,2
-BA:1842,2
-BA:1842,1
-BA:1881,2
-BA:1881,2
-BA:1884,2
-BA:1884,2
-BA:1886,2
-BA:1886,2
-BA:1935,2
-BA:1935,2
-BA:1937,1
-BA:1937,2
-BA:4818,2
-BA:4818,1
-LF:76
-LH:61
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb0EE3__bES7_
-FN:188,_ZSt3minIjERKT_S2_S2_
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb0EE3__bES6_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb1EE3__bES7_
-FN:268,_ZNSt12__niter_baseISt16ostream_iteratorISscSt11char_traitsIcEELb0EE3__bES3_
-FN:286,_ZNSt12__miter_baseIPSsLb0EE3__bES0_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb1EE3__bES6_
-FN:268,_ZNSt12__niter_baseISt20back_insert_iteratorISt6vectorISsSaISsEEELb0EE3__bES4_
-FN:286,_ZNSt12__miter_baseIPPN8pkgCache7VerFileELb0EE3__bES3_
-FN:268,_ZNSt12__niter_baseIPSsLb0EE3__bES0_
-FN:268,_ZNSt12__niter_baseIPPN8pkgCache7VerFileELb0EE3__bES3_
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEELb0EE3__bES9_
-FN:104,_ZNSt11__iter_swapILb1EE9iter_swapIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS6_SaIS6_EEEESB_EEvT_T0_
-FN:121,_ZSt9iter_swapIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEES9_EvT_T0_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEELb1EE3__bES9_
-FN:539,_ZNSt20__copy_move_backwardILb0ELb0ESt26random_access_iterator_tagE13__copy_move_bIPSsS3_EET0_T_S5_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0EPSsS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPSsS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardIPSsS0_ET0_T_S2_S1_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPKSsSt16ostream_iteratorISscSt11char_traitsIcEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPKSsSt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_SD_SC_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET0_T_SD_SC_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET1_T0_SA_S9_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET0_T_SA_S9_
-FN:375,_ZNSt11__copy_moveILb0ELb1ESt26random_access_iterator_tagE8__copy_mIPN8pkgCache7VerFileEEEPT_PKS6_S9_S7_
-FN:385,_ZSt13__copy_move_aILb0EPPN8pkgCache7VerFileES3_ET1_T0_S5_S4_
-FN:430,_ZSt14__copy_move_a2ILb0EPPN8pkgCache7VerFileES3_ET1_T0_S5_S4_
-FN:456,_ZSt4copyIPPN8pkgCache7VerFileES3_ET0_T_S5_S4_
-FN:569,_ZNSt20__copy_move_backwardILb0ELb1ESt26random_access_iterator_tagE13__copy_move_bIPN8pkgCache7VerFileEEEPT_PKS6_S9_S7_
-FN:579,_ZSt22__copy_move_backward_aILb0EPPN8pkgCache7VerFileES3_ET1_T0_S5_S4_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPPN8pkgCache7VerFileES3_ET1_T0_S5_S4_
-FN:624,_ZSt13copy_backwardIPPN8pkgCache7VerFileES3_ET0_T_S5_S4_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEES9_ET1_T0_SB_SA_
-FN:624,_ZSt13copy_backwardIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEES9_ET0_T_SB_SA_
-DA:104,5805
-DA:106,5805
-DA:107,5805
-DA:121,5805
-DA:142,5805
-DA:146,5805
-DA:188,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:210,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:268,39
-DA:269,39
-DA:276,30
-DA:277,30
-DA:286,40
-DA:287,40
-DA:337,0
-DA:340,0
-DA:342,0
-DA:343,0
-DA:344,0
-DA:346,0
-DA:375,10
-DA:377,10
-DA:379,10
-DA:385,10
-DA:393,10
-DA:396,10
-DA:430,10
-DA:435,10
-DA:456,10
-DA:466,10
-DA:539,0
-DA:542,0
-DA:543,0
-DA:544,0
-DA:569,10
-DA:571,10
-DA:572,10
-DA:573,10
-DA:579,10
-DA:587,10
-DA:592,10
-DA:597,10
-DA:602,10
-DA:624,10
-DA:636,10
-BA:193,0
-BA:193,0
-BA:215,0
-BA:215,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:542,0
-BA:542,0
-LF:51
-LH:33
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:97,_ZSt8_DestroyIPjEvT_S1_
-FN:126,_ZSt8_DestroyIPjjEvT_S1_RSaIT0_E
-FN:97,_ZSt8_DestroyIPPN8pkgCache7VerFileEEvT_S4_
-FN:126,_ZSt8_DestroyIPPN8pkgCache7VerFileES2_EvT_S4_RSaIT0_E
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-DA:87,0
-DA:88,0
-DA:97,23975
-DA:101,0
-DA:103,0
-DA:104,23975
-DA:126,23975
-DA:128,23975
-DA:129,23975
-BA:101,0
-BA:101,0
-LF:9
-LH:5
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_heap.h
-FN:177,_ZSt11__push_heapIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEEiS4_PFbPKS3_SB_EEvT_T0_SF_T1_T2_
-FN:295,_ZSt13__adjust_heapIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEEiS4_PFbPKS3_SB_EEvT_T0_SF_T1_T2_
-FN:412,_ZSt9make_heapIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEEPFbPKS3_SB_EEvT_SE_T0_
-FN:322,_ZSt10__pop_heapIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEEPFbPKS3_SB_EEvT_SE_SE_T0_
-FN:350,_ZSt8pop_heapIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEEPFbPKS3_SB_EEvT_SE_T0_
-FN:477,_ZSt9sort_heapIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEEPFbPKS3_SB_EEvT_SE_T0_
-DA:177,0
-DA:179,0
-DA:180,0
-DA:183,0
-DA:184,0
-DA:185,0
-DA:187,0
-DA:188,0
-DA:295,0
-DA:297,0
-DA:298,0
-DA:299,0
-DA:301,0
-DA:302,0
-DA:304,0
-DA:305,0
-DA:306,0
-DA:308,0
-DA:310,0
-DA:311,0
-DA:313,0
-DA:315,0
-DA:317,0
-DA:322,0
-DA:329,0
-DA:330,0
-DA:331,0
-DA:334,0
-DA:350,0
-DA:358,0
-DA:359,0
-DA:412,0
-DA:424,0
-DA:425,0
-DA:427,0
-DA:428,0
-DA:429,0
-DA:431,0
-DA:432,0
-DA:434,0
-DA:435,0
-DA:436,0
-DA:477,0
-DA:485,0
-DA:486,0
-DA:487,0
-BA:180,0
-BA:180,0
-BA:180,0
-BA:180,0
-BA:180,0
-BA:180,0
-BA:299,0
-BA:299,0
-BA:302,0
-BA:302,0
-BA:308,0
-BA:308,0
-BA:308,0
-BA:308,0
-BA:424,0
-BA:424,0
-BA:434,0
-BA:434,0
-BA:485,0
-BA:485,0
-LF:46
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEdeEv
-FN:398,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEC1ERS2_
-FN:456,_ZSt13back_inserterISt6vectorISsSaISsEEESt20back_insert_iteratorIT_ERS4_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEC1ERKS2_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS3_SaIS3_EEEC1ERKS4_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEE4baseEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEC1ERKS1_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS3_SaIS3_EEE4baseEv
-FN:781,_ZN9__gnu_cxxneIPPN8pkgCache7VerFileESt6vectorIS3_SaIS3_EEEEbRKNS_17__normal_iteratorIT_T0_EESD_
-FN:846,_ZN9__gnu_cxxmiIPPN8pkgCache7VerFileESt6vectorIS3_SaIS3_EEEENS_17__normal_iteratorIT_T0_E15difference_typeERKSB_SE_
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS3_SaIS3_EEEdeEv
-FN:735,_ZNK9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS3_SaIS3_EEEplERKi
-FN:743,_ZNK9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS3_SaIS3_EEEmiERKi
-FN:703,_ZN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS3_SaIS3_EEEppEv
-FN:715,_ZN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS3_SaIS3_EEEmmEv
-FN:794,_ZN9__gnu_cxxltIPPN8pkgCache7VerFileESt6vectorIS3_SaIS3_EEEEbRKNS_17__normal_iteratorIT_T0_EESD_
-FN:769,_ZN9__gnu_cxxeqIPPN8pkgCache7VerFileESt6vectorIS3_SaIS3_EEEEbRKNS_17__normal_iteratorIT_T0_EESD_
-FN:722,_ZN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS3_SaIS3_EEEmmEi
-FN:429,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEdeEv
-FN:434,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEppEv
-FN:412,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEaSERKSs
-DA:398,0
-DA:412,0
-DA:414,0
-DA:415,0
-DA:429,0
-DA:430,0
-DA:434,0
-DA:435,0
-DA:456,0
-DA:457,0
-DA:683,986
-DA:695,84794
-DA:696,84794
-DA:703,18872
-DA:705,18872
-DA:706,18872
-DA:715,27537
-DA:717,27537
-DA:718,27537
-DA:722,0
-DA:723,0
-DA:735,498
-DA:736,498
-DA:743,458
-DA:744,458
-DA:747,24106
-DA:748,24106
-DA:769,10
-DA:770,10
-DA:781,4361
-DA:782,4361
-DA:794,6263
-DA:795,6263
-DA:846,1404
-DA:847,1404
-LF:35
-LH:23
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,0
-DA:166,0
-DA:167,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_move.h
-FN:80,_ZSt4swapIPN8pkgCache7VerFileEEvRT_S4_
-DA:80,5805
-DA:85,5805
-DA:86,5805
-DA:87,5805
-DA:88,5805
-LF:5
-LH:5
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyIPSsS2_EET0_T_S4_S3_
-FN:113,_ZSt18uninitialized_copyIPSsS0_ET0_T_S2_S1_
-FN:261,_ZSt22__uninitialized_copy_aIPSsS0_SsET0_T_S2_S1_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPSsS0_SaISsEET0_T_S3_S2_RT1_
-FN:97,_ZNSt20__uninitialized_copyILb1EE18uninitialized_copyIPPN8pkgCache7VerFileES5_EET0_T_S7_S6_
-FN:113,_ZSt18uninitialized_copyIPPN8pkgCache7VerFileES3_ET0_T_S5_S4_
-FN:261,_ZSt22__uninitialized_copy_aIPPN8pkgCache7VerFileES3_S2_ET0_T_S5_S4_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPPN8pkgCache7VerFileES3_SaIS2_EET0_T_S6_S5_RT1_
-DA:73,0
-DA:75,0
-DA:78,0
-DA:79,0
-DA:81,0
-DA:83,0
-DA:85,0
-DA:86,0
-DA:97,10
-DA:98,10
-DA:113,10
-DA:122,10
-DA:261,10
-DA:262,10
-DA:268,0
-DA:272,0
-BA:78,0
-BA:78,0
-BA:79,0
-BA:79,0
-LF:16
-LH:6
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:484,_ZNKSt6vectorIPN8pkgCache7VerFileESaIS2_EE4sizeEv
-FN:562,_ZNSt6vectorIPN8pkgCache7VerFileESaIS2_EEixEj
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:404,_ZNKSt6vectorISsSaISsEE3endEv
-FN:386,_ZNKSt6vectorISsSaISsEE5beginEv
-FN:484,_ZNKSt6vectorISsSaISsEE4sizeEv
-FN:101,_ZNKSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:97,_ZNSt12_Vector_baseIjSaIjEE19_M_get_Tp_allocatorEv
-FN:517,_ZNKSt6vectorIPN8pkgCache7VerFileESaIS2_EE8capacityEv
-FN:97,_ZNSt12_Vector_baseIPN8pkgCache7VerFileESaIS2_EE19_M_get_Tp_allocatorEv
-FN:395,_ZNSt6vectorIPN8pkgCache7VerFileESaIS2_EE3endEv
-FN:377,_ZNSt6vectorIPN8pkgCache7VerFileESaIS2_EE5beginEv
-FN:395,_ZNSt6vectorISsSaISsEE3endEv
-FN:377,_ZNSt6vectorISsSaISsEE5beginEv
-FN:526,_ZNKSt6vectorISsSaISsEE5emptyEv
-FN:101,_ZNKSt12_Vector_baseIPN8pkgCache7VerFileESaIS2_EE19_M_get_Tp_allocatorEv
-FN:489,_ZNKSt6vectorIPN8pkgCache7VerFileESaIS2_EE8max_sizeEv
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:79,_ZNSt12_Vector_baseIjSaIjEE12_Vector_implD1Ev
-FN:79,_ZNSt12_Vector_baseIPN8pkgCache7VerFileESaIS2_EE12_Vector_implD1Ev
-FN:84,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseISsSaISsEEC2Ev
-FN:213,_ZNSt6vectorISsSaISsEEC1Ev
-FN:489,_ZNKSt6vectorISsSaISsEE8max_sizeEv
-FN:84,_ZNSt12_Vector_baseIjSaIjEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseIjSaIjEEC2Ev
-FN:213,_ZNSt6vectorIjSaIjEEC1Ev
-FN:84,_ZNSt12_Vector_baseIPN8pkgCache7VerFileESaIS2_EE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseIPN8pkgCache7VerFileESaIS2_EEC2Ev
-FN:213,_ZNSt6vectorIPN8pkgCache7VerFileESaIS2_EEC1Ev
-FN:147,_ZNSt12_Vector_baseIPN8pkgCache7VerFileESaIS2_EE13_M_deallocateEPS2_j
-FN:135,_ZNSt12_Vector_baseIPN8pkgCache7VerFileESaIS2_EED2Ev
-FN:299,_ZNSt6vectorIPN8pkgCache7VerFileESaIS2_EED1Ev
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-FN:147,_ZNSt12_Vector_baseIjSaIjEE13_M_deallocateEPjj
-FN:135,_ZNSt12_Vector_baseIjSaIjEED2Ev
-FN:299,_ZNSt6vectorIjSaIjEED1Ev
-FN:1075,_ZNKSt6vectorISsSaISsEE12_M_check_lenEjPKc
-FN:1075,_ZNKSt6vectorIPN8pkgCache7VerFileESaIS2_EE12_M_check_lenEjPKc
-FN:143,_ZNSt12_Vector_baseISsSaISsEE11_M_allocateEj
-FN:686,_ZNSt6vectorISsSaISsEE9push_backERKSs
-FN:143,_ZNSt12_Vector_baseIPN8pkgCache7VerFileESaIS2_EE11_M_allocateEj
-FN:902,_ZNSt6vectorIPN8pkgCache7VerFileESaIS2_EE20_M_allocate_and_copyIPS2_EES6_jT_S7_
-FN:686,_ZNSt6vectorIPN8pkgCache7VerFileESaIS2_EE9push_backERKS2_
-DA:79,2673
-DA:84,2664
-DA:85,2664
-DA:86,2664
-DA:97,50866
-DA:98,50866
-DA:101,10
-DA:102,10
-DA:108,2664
-DA:109,2664
-DA:135,2673
-DA:136,2673
-DA:137,2673
-DA:143,19
-DA:144,19
-DA:147,16119
-DA:149,16119
-DA:150,13446
-DA:151,16119
-DA:213,2664
-DA:214,2664
-DA:299,2673
-DA:300,2673
-DA:301,2673
-DA:377,10
-DA:378,10
-DA:386,0
-DA:387,0
-DA:395,10
-DA:396,10
-DA:404,0
-DA:405,0
-DA:484,6530
-DA:485,6530
-DA:489,10
-DA:490,10
-DA:517,10
-DA:519,10
-DA:526,0
-DA:527,0
-DA:562,28392
-DA:563,28392
-DA:686,4341
-DA:688,4341
-DA:690,4341
-DA:691,4341
-DA:694,0
-DA:695,4341
-DA:902,10
-DA:904,10
-DA:907,10
-DA:909,10
-DA:911,0
-DA:913,0
-DA:914,0
-DA:1075,0
-DA:1077,0
-DA:1078,0
-DA:1080,0
-DA:1081,0
-BA:144,0
-BA:144,0
-BA:144,2
-BA:144,2
-BA:149,2
-BA:149,2
-BA:149,0
-BA:149,0
-BA:149,2
-BA:149,2
-BA:688,0
-BA:688,0
-BA:688,2
-BA:688,1
-BA:1077,0
-BA:1077,0
-BA:1077,0
-BA:1077,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-LF:60
-LH:45
-end_of_record
-SF:/usr/include/c++/4.3/bits/stream_iterator.h
-FN:181,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERSoPKc
-FN:185,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERKS2_
-FN:202,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEdeEv
-FN:206,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEppEv
-FN:191,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEaSERKSs
-DA:181,0
-DA:182,0
-DA:185,0
-DA:186,0
-DA:191,0
-DA:196,0
-DA:197,0
-DA:198,0
-DA:202,0
-DA:203,0
-DA:206,0
-DA:207,0
-BA:197,0
-BA:197,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/vector.tcc
-FN:283,_ZNSt6vectorISsSaISsEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPSsS1_EERKSs
-FN:70,_ZNSt6vectorIPN8pkgCache7VerFileESaIS2_EE7reserveEj
-FN:283,_ZNSt6vectorIPN8pkgCache7VerFileESaIS2_EE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPS2_S4_EERKS2_
-DA:70,10
-DA:72,10
-DA:73,0
-DA:74,10
-DA:76,10
-DA:79,10
-DA:80,10
-DA:82,10
-DA:85,10
-DA:86,10
-DA:87,10
-DA:89,10
-DA:283,0
-DA:286,0
-DA:288,0
-DA:291,0
-DA:293,0
-DA:295,0
-DA:299,0
-DA:307,0
-DA:308,0
-DA:309,0
-DA:316,0
-DA:321,0
-DA:323,0
-DA:324,0
-DA:330,0
-DA:332,0
-DA:333,0
-DA:334,0
-DA:336,0
-DA:338,0
-DA:341,0
-DA:342,0
-DA:343,0
-DA:345,0
-BA:72,1
-BA:72,2
-BA:74,2
-BA:74,1
-BA:286,0
-BA:286,0
-BA:286,0
-BA:286,0
-LF:36
-LH:11
-end_of_record
-SF:/usr/include/c++/4.3/exception
-FN:59,_ZNSt9exceptionC2Ev
-FN:57,_ZNSt9exceptionC1ERKS_
-DA:57,0
-DA:59,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:107,_ZN9__gnu_cxx13new_allocatorIPN8pkgCache7VerFileEE9constructEPS3_RKS3_
-FN:101,_ZNK9__gnu_cxx13new_allocatorIPN8pkgCache7VerFileEE8max_sizeEv
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIjED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIPN8pkgCache7VerFileEED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISsE8max_sizeEv
-FN:69,_ZN9__gnu_cxx13new_allocatorIjEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorIPN8pkgCache7VerFileEEC2Ev
-FN:97,_ZN9__gnu_cxx13new_allocatorIPN8pkgCache7VerFileEE10deallocateEPS3_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-FN:97,_ZN9__gnu_cxx13new_allocatorIjE10deallocateEPjj
-FN:107,_ZN9__gnu_cxx13new_allocatorISsE9constructEPSsRKSs
-FN:87,_ZN9__gnu_cxx13new_allocatorISsE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorIPN8pkgCache7VerFileEE8allocateEjPKv
-DA:69,2673
-DA:71,0
-DA:76,2682
-DA:87,10
-DA:89,10
-DA:90,0
-DA:92,10
-DA:97,13446
-DA:98,13446
-DA:101,20
-DA:102,20
-DA:107,4341
-DA:108,4341
-BA:89,0
-BA:89,0
-BA:89,1
-BA:89,2
-BA:108,2
-BA:108,1
-BA:108,0
-BA:108,0
-LF:13
-LH:11
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/istream
-FN:585,_ZNSiC2Ev
-FN:105,_ZNSiD2Ev
-FN:804,_ZNSdC2Ev
-FN:801,_ZNSdD2Ev
-DA:105,0
-DA:106,0
-DA:585,0
-DA:586,0
-DA:587,0
-DA:801,0
-DA:804,0
-DA:805,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:195,_ZNSolsEj
-DA:95,0
-DA:112,0
-DA:117,0
-DA:195,0
-DA:199,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:509,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:536,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:555,_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-DA:509,0
-DA:510,0
-DA:511,0
-DA:536,0
-DA:537,0
-DA:555,0
-DA:556,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-LF:25
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/maint/vocabularymerger.h
-FN:41,_ZN3ept7debtags16VocabularyMerger12FacetIndexerC1ERS1_
-FN:51,_ZN3ept7debtags16VocabularyMerger10TagIndexerC1ERS1_
-FN:119,_ZNK3ept7debtags16VocabularyMerger12facetIndexerEv
-FN:127,_ZNK3ept7debtags16VocabularyMerger10tagIndexerEv
-FN:42,_ZN3ept7debtags16VocabularyMerger12FacetIndexerD1Ev
-FN:52,_ZN3ept7debtags16VocabularyMerger10TagIndexerD1Ev
-FN:57,_ZN3ept7debtags16VocabularyMerger7TagDataD1Ev
-FN:68,_ZN3ept7debtags16VocabularyMerger9FacetDataD1Ev
-FN:90,_ZN3ept7debtags16VocabularyMergerC1Ev
-FN:34,_ZN3ept7debtags16VocabularyMergerD1Ev
-DA:34,0
-DA:41,0
-DA:42,0
-DA:51,0
-DA:52,0
-DA:57,0
-DA:68,0
-DA:90,0
-DA:119,7
-DA:127,7
-BA:42,0
-BA:42,0
-BA:52,0
-BA:52,0
-LF:10
-LH:2
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/maint/vocabularymerger.test.h
-FN:30,_ZN20TestVocabularyMerger8indexrefEPKci
-FN:120,_ZN20TestVocabularyMerger2_3Ev
-FN:96,_ZN20TestVocabularyMerger2_2Ev
-FN:36,_ZN20TestVocabularyMerger2_1Ev
-DA:30,14
-DA:32,14
-DA:36,1
-DA:44,1
-DA:51,2
-DA:52,1
-DA:53,1
-DA:55,1
-DA:58,1
-DA:59,1
-DA:62,1
-DA:65,2
-DA:66,1
-DA:69,1
-DA:70,1
-DA:73,1
-DA:74,2
-DA:77,2
-DA:78,2
-DA:79,2
-DA:80,2
-DA:83,2
-DA:84,2
-DA:85,2
-DA:86,2
-DA:89,2
-DA:90,2
-DA:91,2
-DA:92,2
-DA:93,1
-DA:96,1
-DA:101,1
-DA:102,1
-DA:104,1
-DA:105,1
-DA:108,1
-DA:111,2
-DA:112,1
-DA:115,1
-DA:116,1
-DA:117,1
-DA:120,1
-DA:125,1
-DA:126,1
-DA:128,1
-DA:129,1
-DA:132,1
-DA:135,2
-DA:136,1
-DA:139,1
-DA:140,1
-DA:141,1
-LF:52
-LH:52
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:13,_ZN8LocationD1Ev
-FN:13,_ZN8LocationC1ERKS_
-FN:17,_ZN8LocationC1EPKciSs
-FN:52,_ZlsIiER12AssertFailedS1_T_
-FN:52,_ZlsISsER12AssertFailedS1_T_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:52,_ZlsIPKcER12AssertFailedS3_T_
-FN:41,_ZN12AssertFailedD1Ev
-FN:67,_Z12assert_eq_fnISsPKcEv8LocationT_T0_
-FN:67,_Z12assert_eq_fnIiiEv8LocationT_T0_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:75,0
-BA:42,0
-BA:42,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-LF:22
-LH:0
-end_of_record
-SF:/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_maint_vocabularymerger.cpp
-FN:5,_Z41__static_initialization_and_destruction_0ii
-FN:5,_GLOBAL__I_ept_test_generated__home_mornfall_dev_pkg_ept_work_ept_debtags_maint_vocabularymerger.cpp
-FN:5,_Z23run_VocabularyMerger__3v
-FN:4,_Z23run_VocabularyMerger__2v
-FN:3,_Z23run_VocabularyMerger__1v
-DA:3,1
-DA:4,1
-DA:5,4
-BA:5,2
-BA:5,1
-BA:5,2
-BA:5,1
-LF:3
-LH:3
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsSsEEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEEED2Ev
-FN:100,_ZNSaIcEC1ERKS_
-FN:100,_ZNSaIcEC2ERKS_
-FN:106,_ZNSaISt4pairIKSsSsEED1Ev
-FN:106,_ZNSaISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEED1Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEEEC2Ev
-FN:106,_ZNSaISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEED1Ev
-FN:104,_ZNSaISt4pairIKSsSsEEC1ISt13_Rb_tree_nodeIS1_EEERKSaIT_E
-FN:104,_ZNSaISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEC1ISt13_Rb_tree_nodeIS5_EEERKSaIT_E
-FN:104,_ZNSaISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEEC1ISt13_Rb_tree_nodeIS5_EEERKSaIT_E
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:104,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:7
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:1551,_ZNKSs13get_allocatorEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2188,_ZSteqIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_EPKS3_
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2188,0
-DA:2189,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-LF:53
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:166,0
-DA:167,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_map.h
-FN:155,_ZNSt3mapISsN3ept7debtags16VocabularyMerger9FacetDataESt4lessISsESaISt4pairIKSsS3_EEEC1Ev
-FN:92,_ZNSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEED2Ev
-FN:92,_ZNSt3mapISsN3ept7debtags16VocabularyMerger7TagDataESt4lessISsESaISt4pairIKSsS3_EEED1Ev
-FN:92,_ZNSt3mapISsN3ept7debtags16VocabularyMerger9FacetDataESt4lessISsESaISt4pairIKSsS3_EEED1Ev
-DA:92,0
-DA:155,0
-DA:156,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_pair.h
-FN:73,_ZNSt4pairIKSsSsED1Ev
-FN:73,_ZNSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEED1Ev
-FN:73,_ZNSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEED1Ev
-DA:73,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_tree.h
-FN:452,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_M_beginEv
-FN:452,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_M_beginEv
-FN:452,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_M_beginEv
-FN:398,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE13_Rb_tree_implIS6_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:398,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13_Rb_tree_implISA_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:398,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13_Rb_tree_implISA_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:415,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13_Rb_tree_implISA_Lb0EE13_M_initializeEv
-FN:347,_ZNKSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE21_M_get_Node_allocatorEv
-FN:347,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE21_M_get_Node_allocatorEv
-FN:403,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13_Rb_tree_implISA_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EEC1Ev
-FN:347,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE21_M_get_Node_allocatorEv
-FN:351,_ZNKSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE13get_allocatorEv
-FN:351,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13get_allocatorEv
-FN:351,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13get_allocatorEv
-FN:360,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS6_E
-FN:360,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS2_E
-FN:360,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS6_E
-FN:388,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS2_E
-FN:936,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_M_eraseEPSt13_Rb_tree_nodeIS2_E
-FN:584,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EED1Ev
-FN:388,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS6_E
-FN:936,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_M_eraseEPSt13_Rb_tree_nodeIS6_E
-FN:584,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EED1Ev
-FN:388,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS6_E
-FN:936,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_M_eraseEPSt13_Rb_tree_nodeIS6_E
-FN:584,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EED1Ev
-DA:347,0
-DA:348,0
-DA:351,0
-DA:352,0
-DA:360,0
-DA:361,0
-DA:388,0
-DA:390,0
-DA:391,0
-DA:392,0
-DA:398,0
-DA:403,0
-DA:405,0
-DA:406,0
-DA:415,0
-DA:417,0
-DA:418,0
-DA:419,0
-DA:420,0
-DA:421,0
-DA:452,0
-DA:453,0
-DA:479,0
-DA:480,0
-DA:487,0
-DA:488,0
-DA:562,0
-DA:584,0
-DA:585,0
-DA:936,0
-DA:939,0
-DA:941,0
-DA:942,0
-DA:943,0
-DA:944,0
-DA:946,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-LF:36
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSsEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEEED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsSsEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsSsEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEEC2Ev
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEE10deallocateEPS9_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSsEEE10deallocateEPS5_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEEE10deallocateEPS9_j
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsSsEE7destroyEPS3_
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEE7destroyEPS7_
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEE7destroyEPS7_
-DA:69,0
-DA:71,0
-DA:76,0
-DA:97,0
-DA:98,0
-DA:118,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-DA:95,0
-DA:112,0
-DA:117,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/diskindex/mmap.h
-FN:89,_ZN7tagcoll9diskindex11MMapIndexerC2Ev
-FN:91,_ZN7tagcoll9diskindex11MMapIndexerD0Ev
-FN:91,_ZN7tagcoll9diskindex11MMapIndexerD1Ev
-FN:91,_ZN7tagcoll9diskindex11MMapIndexerD2Ev
-DA:89,0
-DA:91,0
-BA:91,0
-BA:91,0
-BA:91,0
-BA:91,0
-BA:91,0
-BA:91,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/input/base.h
-FN:104,_ZN7tagcoll5input5InputD2Ev
-FN:104,_ZN7tagcoll5input5InputD0Ev
-FN:104,_ZN7tagcoll5input5InputD1Ev
-DA:104,1305
-BA:104,1
-BA:104,2
-BA:104,0
-BA:104,0
-BA:104,0
-BA:104,0
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/input/string.h
-FN:45,_ZN7tagcoll5input6StringD1Ev
-DA:45,4
-BA:45,1
-BA:45,2
-LF:1
-LH:1
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt/record.h
-DA:86,1
-BA:86,1
-BA:86,2
-LF:1
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt.h
-FN:139,_ZN3ept4core11AptDatabaseC1Ev
-FN:209,_ZN3ept4core11AptDatabase10invalidateEv
-FN:331,_ZN3ept4core11AptDatabaseD1Ev
-DA:139,73
-DA:140,73
-DA:141,73
-DA:142,73
-DA:143,73
-DA:144,73
-DA:145,73
-DA:146,73
-DA:209,74
-DA:210,74
-DA:211,74
-DA:214,74
-DA:215,74
-DA:216,74
-DA:217,74
-DA:218,74
-DA:219,74
-DA:220,74
-DA:331,73
-DA:332,73
-DA:333,73
-BA:210,2
-BA:210,1
-BA:214,2
-BA:214,2
-BA:216,2
-BA:216,2
-BA:218,2
-BA:218,2
-LF:21
-LH:21
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/xapian.h
-FN:81,_ZNK3ept4core6xapian4List3enqEv
-FN:106,_ZN3ept4core6xapian5Query16setQualityCutoffEi
-FN:110,_ZN3ept4core6xapian5Query9setExpandEb
-FN:29,_ZN3ept4core6xapian9TagFilterC1Ev
-FN:30,_ZNK3ept4core6xapian9TagFilterclERKSs
-FN:230,_ZN3ept4core6xapian6SourceD1Ev
-FN:252,_ZN3ept4core6xapian6Source2dbEv
-FN:112,_ZN3ept4core6xapian5QueryC1ERN6Xapian8DatabaseE
-FN:97,_ZN3ept4core6xapian5QueryD1Ev
-FN:117,_ZNK3ept4core6xapian5Query14queryTokenizerESs
-FN:122,_ZNK3ept4core6xapian5Query13tokenizeQueryISt20back_insert_iteratorISt6vectorISsSaISsEEEEEvSsT_
-FN:205,_ZN3ept4core6xapian5Query8addTermsESsbb
-FN:321,_ZN3ept4core6xapian6Source5queryERKSsbi
-FN:97,_ZN3ept4core6xapian5QueryaSERKS2_
-FN:35,_ZN3ept4core6xapian4ListD1Ev
-FN:29,_ZN3ept4core6xapian9TagFilterD0Ev
-FN:29,_ZN3ept4core6xapian9TagFilterD1Ev
-FN:140,_ZNK3ept4core6xapian5Query6expandISt15insert_iteratorISt3setISsSt4lessISsESaISsEEEEEvT_
-FN:154,_ZN3ept4core6xapian5Query13updateEnquireEv
-FN:35,_ZN3ept4core6xapian4ListaSERKS2_
-FN:85,_ZN3ept4core6xapian4ListC1EN6Xapian7EnquireE
-FN:182,_ZN3ept4core6xapian5Query7resultsEv
-FN:49,_ZNK3ept4core6xapian4List5tokenEv
-FN:35,_ZN3ept4core6xapian4ListC1ERKS2_
-FN:59,_ZNK3ept4core6xapian4List4seekEv
-FN:74,_ZNK3ept4core6xapian4List4tailEv
-FN:67,_ZNK3ept4core6xapian4List5emptyEv
-DA:29,8
-DA:30,1760
-DA:31,1760
-DA:35,91
-DA:49,15
-DA:50,15
-DA:51,15
-DA:52,0
-DA:59,58
-DA:60,58
-DA:61,0
-DA:62,0
-DA:63,0
-DA:65,58
-DA:67,30
-DA:68,30
-DA:69,0
-DA:70,30
-DA:71,30
-DA:74,28
-DA:75,28
-DA:76,28
-DA:77,28
-DA:78,0
-DA:81,6
-DA:82,6
-DA:85,3
-DA:86,3
-DA:87,3
-DA:88,3
-DA:89,6
-DA:90,3
-DA:91,3
-DA:92,3
-DA:97,13
-DA:106,5
-DA:107,5
-DA:108,5
-DA:110,5
-DA:112,9
-DA:113,9
-DA:114,9
-DA:115,9
-DA:117,5
-DA:118,5
-DA:122,5
-DA:124,5
-DA:125,15
-DA:127,10
-DA:128,0
-DA:130,10
-DA:131,10
-DA:132,10
-DA:133,10
-DA:134,5
-DA:137,5
-DA:140,4
-DA:142,4
-DA:144,4
-DA:145,24
-DA:146,24
-DA:148,4
-DA:149,4
-DA:150,4
-DA:151,4
-DA:152,4
-DA:154,8
-DA:158,8
-DA:161,8
-DA:162,8
-DA:164,8
-DA:166,8
-DA:167,4
-DA:168,4
-DA:169,4
-DA:170,4
-DA:171,4
-DA:174,4
-DA:175,4
-DA:176,4
-DA:177,4
-DA:178,4
-DA:179,4
-DA:182,3
-DA:183,3
-DA:184,3
-DA:205,5
-DA:206,5
-DA:207,5
-DA:208,5
-DA:209,5
-DA:210,0
-DA:211,0
-DA:216,0
-DA:219,5
-DA:220,5
-DA:230,4
-DA:252,9
-DA:253,9
-DA:254,9
-DA:321,5
-DA:323,5
-DA:324,5
-DA:325,5
-DA:326,5
-DA:327,0
-BA:29,0
-BA:29,0
-BA:29,1
-BA:29,2
-BA:31,2
-BA:31,2
-BA:31,1
-BA:31,2
-BA:60,1
-BA:60,2
-BA:60,0
-BA:60,0
-BA:60,1
-BA:60,2
-BA:60,0
-BA:60,0
-BA:60,1
-BA:60,2
-BA:68,1
-BA:68,2
-BA:71,2
-BA:71,1
-BA:71,2
-BA:71,2
-BA:71,2
-BA:71,1
-BA:71,0
-BA:71,0
-BA:87,2
-BA:87,1
-BA:125,2
-BA:125,2
-BA:127,1
-BA:127,2
-BA:133,1
-BA:133,2
-BA:145,2
-BA:145,2
-BA:150,1
-BA:150,2
-BA:166,2
-BA:166,2
-BA:176,2
-BA:176,1
-BA:179,2
-BA:179,2
-BA:179,2
-BA:179,2
-BA:179,2
-BA:179,2
-BA:206,1
-BA:206,2
-BA:209,1
-BA:209,2
-BA:210,0
-BA:210,0
-LF:106
-LH:95
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/xapian.test.h
-FN:24,_ZN21XapianTestEnvironmentC2Ev
-FN:20,_ZN21XapianTestEnvironmentD2Ev
-FN:32,_ZN10TestXapianD1Ev
-FN:36,_ZN10TestXapianC1Ev
-FN:70,_ZN10TestXapian10checkQueryEv
-FN:55,_ZN10TestXapian15checkXapianListIN3ept4core6xapian4ListEEEvT_N6Xapian4MSetE
-FN:64,_ZN10TestXapian4listEv
-FN:41,_ZN10TestXapian7enquireEv
-FN:48,_ZN10TestXapian9listCountEv
-DA:20,4
-DA:24,4
-DA:25,4
-DA:27,4
-DA:28,4
-DA:29,4
-DA:32,4
-DA:36,4
-DA:38,4
-DA:39,4
-DA:41,1
-DA:42,1
-DA:43,1
-DA:44,1
-DA:45,2
-DA:46,1
-DA:48,1
-DA:49,1
-DA:50,1
-DA:51,1
-DA:52,1
-DA:55,1
-DA:56,1
-DA:57,16
-DA:58,14
-DA:59,14
-DA:60,15
-DA:62,1
-DA:64,1
-DA:65,1
-DA:66,1
-DA:67,1
-DA:68,1
-DA:70,1
-DA:71,1
-DA:72,1
-BA:57,2
-BA:57,2
-LF:36
-LH:36
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/test.h
-FN:12,_ZN18AptTestEnvironmentC2Ev
-FN:10,_ZN18AptTestEnvironmentD2Ev
-DA:10,73
-DA:12,73
-DA:13,73
-DA:14,73
-DA:15,73
-DA:16,146
-DA:17,146
-DA:18,146
-DA:19,146
-DA:20,73
-DA:21,73
-LF:11
-LH:11
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/textsearch/maint/path.h
-FN:55,_ZN3ept10textsearch4Path16OverrideIndexDirC1ERKSs
-FN:59,_ZN3ept10textsearch4Path16OverrideIndexDirD1Ev
-DA:55,11
-DA:57,11
-DA:58,11
-DA:59,11
-LF:4
-LH:4
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/textsearch/textsearch.h
-FN:103,_ZN3ept10textsearch10TextSearchD1Ev
-DA:103,11
-LF:1
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/token.h
-FN:10,_ZN3ept5TokenD1Ev
-FN:14,_ZN3ept5TokenC1Ev
-FN:22,_ZNK3ept5Token7packageEv
-DA:10,0
-DA:14,0
-DA:22,7883
-DA:25,7883
-BA:25,2
-BA:25,2
-LF:4
-LH:2
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/list.h
-FN:340,_ZN6wibble4list5countIN3ept4core6xapian4ListEEEjT_
-DA:340,1
-DA:341,1
-DA:342,16
-DA:343,14
-DA:344,14
-DA:346,1
-BA:342,2
-BA:342,2
-LF:6
-LH:6
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/mixin.h
-FN:13,_ZN6wibble5mixin10ComparableIN3ept5TokenEEC2Ev
-DA:13,0
-LF:1
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/regexp.h
-FN:119,_ZNK6wibble9Tokenizer14const_iteratorneERKS1_
-FN:107,_ZN6wibble9Tokenizer14const_iteratorC1ERS0_b
-FN:129,_ZN6wibble9Tokenizer3endEv
-FN:106,_ZN6wibble9Tokenizer14const_iteratorC1ERS0_
-FN:128,_ZN6wibble9Tokenizer5beginEv
-FN:125,_ZN6wibble9TokenizerC1ERKSsS2_i
-FN:111,_ZNK6wibble9Tokenizer14const_iteratordeEv
-FN:90,_ZN6wibble9TokenizerD1Ev
-DA:90,8
-DA:106,8
-DA:107,19
-DA:111,23
-DA:113,23
-DA:119,21
-DA:121,21
-DA:125,8
-DA:126,8
-DA:128,8
-DA:129,19
-BA:121,2
-BA:121,2
-BA:121,1
-BA:121,2
-LF:11
-LH:11
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/string.h
-FN:217,_ZN6wibble3str7tolowerERKSs
-DA:217,10
-DA:219,10
-DA:220,10
-DA:221,50
-DA:222,40
-DA:223,0
-BA:221,2
-BA:221,2
-LF:6
-LH:5
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:13,_ZN8LocationD1Ev
-FN:13,_ZN8LocationC1ERKS_
-FN:17,_ZN8LocationC1EPKciSs
-FN:52,_ZlsISsER12AssertFailedS1_T_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:52,_ZlsIPKcER12AssertFailedS3_T_
-FN:52,_ZlsIPN6Xapian7EnquireEER12AssertFailedS4_T_
-FN:52,_ZlsIPKN6Xapian7EnquireEER12AssertFailedS5_T_
-FN:41,_ZN12AssertFailedD1Ev
-FN:67,_Z12assert_eq_fnIPN6Xapian7EnquireEPKS1_Ev8LocationT_T0_
-FN:67,_Z12assert_eq_fnISsSsEv8LocationT_T0_
-FN:59,_Z9assert_fnIbEv8LocationT_
-FN:67,_Z12assert_eq_fnISsPKcEv8LocationT_T0_
-FN:52,_ZlsIjER12AssertFailedS1_T_
-FN:67,_Z12assert_eq_fnIjjEv8LocationT_T0_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:59,0
-DA:61,0
-DA:62,0
-DA:64,0
-DA:67,8908
-DA:69,8908
-DA:70,0
-DA:71,0
-DA:75,8908
-BA:42,0
-BA:42,0
-BA:61,0
-BA:61,0
-BA:69,1
-BA:69,2
-BA:69,1
-BA:69,2
-BA:69,0
-BA:69,0
-BA:69,1
-BA:69,2
-LF:26
-LH:3
-end_of_record
-SF:/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_xapian.cpp
-FN:6,_Z41__static_initialization_and_destruction_0ii
-FN:6,_GLOBAL__I_ept_test_generated__home_mornfall_dev_pkg_ept_work_ept_core_xapian.cpp
-FN:6,_Z21run_Xapian_checkQueryv
-FN:5,_Z15run_Xapian_listv
-FN:3,_Z18run_Xapian_enquirev
-FN:4,_Z20run_Xapian_listCountv
-DA:3,1
-DA:4,1
-DA:5,1
-DA:6,4
-BA:6,2
-BA:6,1
-BA:6,2
-BA:6,1
-LF:4
-LH:4
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISsEED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaISsED1Ev
-FN:106,_ZNSaISsED2Ev
-FN:106,_ZNSaIPKN3ept10textsearch10TextSearch12ExtraIndexerEED2Ev
-FN:98,_ZNSaISsEC2Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeISsEEC2Ev
-FN:104,_ZNSaISsEC1ISt13_Rb_tree_nodeISsEEERKSaIT_E
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-FN:98,_ZNSaIPKN3ept10textsearch10TextSearch12ExtraIndexerEEC2Ev
-DA:98,10
-DA:100,0
-DA:101,0
-DA:104,0
-DA:106,10
-DA:118,0
-DA:119,0
-LF:7
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:1544,_ZNKSs4dataEv
-FN:701,_ZNKSsixEj
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:543,_ZNKSs5beginEv
-FN:562,_ZNKSs3endEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:192,_ZNKSs4_Rep12_M_is_sharedEv
-FN:652,_ZNKSs8capacityEv
-FN:392,_ZNSs10_S_compareEjj
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:1593,_ZNKSs4findEPKcj
-FN:306,_ZNKSs8_M_checkEjPKc
-FN:1923,_ZNKSs6substrEjj
-FN:870,_ZNSs9push_backEc
-FN:791,_ZNSspLEc
-FN:2162,_ZSteqIcEN9__gnu_cxx11__enable_ifIXsrSt9__is_charIT_E7__valueEbE6__typeERKSbIS3_St11char_traitsIS3_ESaIS3_EESC_
-FN:2201,_ZStneIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:1941,_ZNKSs7compareERKSs
-FN:2238,_ZStltIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:501,_ZNSsaSERKSs
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:2188,_ZSteqIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_EPKS3_
-DA:178,0
-DA:183,0
-DA:184,0
-DA:192,0
-DA:193,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:306,0
-DA:308,0
-DA:309,0
-DA:310,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:392,0
-DA:394,0
-DA:401,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:543,0
-DA:544,0
-DA:562,0
-DA:563,0
-DA:606,0
-DA:607,0
-DA:652,0
-DA:653,0
-DA:701,0
-DA:704,0
-DA:791,0
-DA:793,0
-DA:794,0
-DA:870,0
-DA:872,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:877,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:1593,0
-DA:1596,0
-DA:1923,0
-DA:1925,0
-DA:1941,0
-DA:1943,0
-DA:1944,0
-DA:1945,0
-DA:1947,0
-DA:1948,0
-DA:1949,0
-DA:1950,0
-DA:2067,0
-DA:2069,0
-DA:2162,0
-DA:2165,0
-DA:2188,0
-DA:2189,0
-DA:2201,0
-DA:2202,0
-DA:2238,0
-DA:2239,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:308,0
-BA:308,0
-BA:341,0
-BA:341,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:1948,0
-BA:1948,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-LF:98
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:668,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_EPKS3_RKS6_
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-DA:668,2632
-DA:673,2632
-DA:674,2632
-DA:675,2632
-DA:676,2632
-DA:677,2632
-DA:678,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:23
-LH:6
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:257,0
-DA:258,0
-DA:261,2632
-DA:262,2632
-DA:273,0
-DA:274,0
-LF:8
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb0EE3__bES6_
-FN:188,_ZSt3minIjERKT_S2_S2_
-FN:268,_ZNSt12__niter_baseISt20back_insert_iteratorISt6vectorISsSaISsEEELb0EE3__bES4_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb1EE3__bES6_
-FN:268,_ZNSt12__niter_baseISt15insert_iteratorISt3setISsSt4lessISsESaISsEEELb0EE3__bES6_
-FN:286,_ZNSt12__miter_baseIPSsLb0EE3__bES0_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:268,_ZNSt12__niter_baseIPSsLb0EE3__bES0_
-FN:539,_ZNSt20__copy_move_backwardILb0ELb0ESt26random_access_iterator_tagE13__copy_move_bIPSsS3_EET0_T_S5_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0EPSsS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPSsS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardIPSsS0_ET0_T_S2_S1_
-FN:286,_ZNSt12__miter_baseIN6Xapian12TermIteratorELb0EE3__bES1_
-FN:268,_ZNSt12__niter_baseIN6Xapian12TermIteratorELb0EE3__bES1_
-FN:309,_ZNSt11__copy_moveILb0ELb0ESt18input_iterator_tagE8__copy_mIN6Xapian12TermIteratorESt20back_insert_iteratorISt6vectorISsSaISsEEEEET0_T_SB_SA_
-FN:385,_ZSt13__copy_move_aILb0EN6Xapian12TermIteratorESt20back_insert_iteratorISt6vectorISsSaISsEEEET1_T0_S8_S7_
-FN:430,_ZSt14__copy_move_a2ILb0EN6Xapian12TermIteratorESt20back_insert_iteratorISt6vectorISsSaISsEEEET1_T0_S8_S7_
-FN:456,_ZSt4copyIN6Xapian12TermIteratorESt20back_insert_iteratorISt6vectorISsSaISsEEEET0_T_S8_S7_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPSsSt15insert_iteratorISt3setISsSt4lessISsESaISsEEEEET0_T_SC_SB_
-FN:385,_ZSt13__copy_move_aILb0EPSsSt15insert_iteratorISt3setISsSt4lessISsESaISsEEEET1_T0_S9_S8_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt15insert_iteratorISt3setISsSt4lessISsES4_EEET1_T0_SE_SD_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt15insert_iteratorISt3setISsSt4lessISsES4_EEET0_T_SE_SD_
-DA:188,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:210,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:268,42302
-DA:269,42302
-DA:276,0
-DA:277,0
-DA:286,2
-DA:287,2
-DA:309,1
-DA:311,10
-DA:312,4
-DA:313,1
-DA:337,5
-DA:340,15
-DA:342,10
-DA:343,10
-DA:344,10
-DA:346,5
-DA:385,6
-DA:393,6
-DA:396,6
-DA:430,6
-DA:435,6
-DA:456,6
-DA:466,6
-DA:539,0
-DA:542,0
-DA:543,0
-DA:544,0
-DA:579,0
-DA:587,0
-DA:592,0
-DA:597,0
-DA:602,0
-DA:624,0
-DA:636,0
-BA:193,0
-BA:193,0
-BA:215,0
-BA:215,0
-BA:311,2
-BA:311,2
-BA:340,2
-BA:340,2
-BA:542,0
-BA:542,0
-LF:42
-LH:21
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:97,_ZSt8_DestroyIPPKN3ept10textsearch10TextSearch12ExtraIndexerEEvT_S7_
-FN:126,_ZSt8_DestroyIPPKN3ept10textsearch10TextSearch12ExtraIndexerES5_EvT_S7_RSaIT0_E
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-DA:87,0
-DA:88,0
-DA:97,10
-DA:101,0
-DA:103,0
-DA:104,10
-DA:126,10
-DA:128,10
-DA:129,10
-BA:101,0
-BA:101,0
-LF:9
-LH:5
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_function.h
-FN:469,_ZNKSt9_IdentityISsEclERKSs
-FN:229,_ZNKSt4lessISsEclERKSsS2_
-DA:229,0
-DA:230,0
-DA:469,0
-DA:470,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:703,_ZN9__gnu_cxx17__normal_iteratorIPKcSsEppEv
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPKcSsEdeEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKcSsEC1ERKS2_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKcSsE4baseEv
-FN:781,_ZN9__gnu_cxxneIPKcSsEEbRKNS_17__normal_iteratorIT_T0_EES8_
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEdeEv
-FN:398,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEC1ERS2_
-FN:456,_ZSt13back_inserterISt6vectorISsSaISsEEESt20back_insert_iteratorIT_ERS4_
-FN:572,_ZNSt15insert_iteratorISt3setISsSt4lessISsESaISsEEEC1ERS4_St23_Rb_tree_const_iteratorISsE
-FN:645,_ZSt8inserterISt3setISsSt4lessISsESaISsEESt23_Rb_tree_const_iteratorISsEESt15insert_iteratorIT_ERS8_T0_
-FN:628,_ZNSt15insert_iteratorISt3setISsSt4lessISsESaISsEEEppEi
-FN:618,_ZNSt15insert_iteratorISt3setISsSt4lessISsESaISsEEEdeEv
-FN:439,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEppEi
-FN:429,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEdeEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEC1ERKS1_
-FN:743,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEmiERKi
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEE4baseEv
-FN:434,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEppEv
-FN:623,_ZNSt15insert_iteratorISt3setISsSt4lessISsESaISsEEEppEv
-FN:412,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEaSERKSs
-FN:599,_ZNSt15insert_iteratorISt3setISsSt4lessISsESaISsEEEaSERKSs
-DA:398,0
-DA:412,0
-DA:414,0
-DA:415,0
-DA:429,0
-DA:430,0
-DA:434,0
-DA:435,0
-DA:439,10
-DA:440,10
-DA:456,0
-DA:457,0
-DA:572,0
-DA:573,0
-DA:599,0
-DA:601,0
-DA:602,0
-DA:603,0
-DA:618,0
-DA:619,0
-DA:623,0
-DA:624,0
-DA:628,0
-DA:629,0
-DA:645,0
-DA:648,0
-DA:683,0
-DA:695,110899
-DA:696,110899
-DA:703,77
-DA:705,77
-DA:706,77
-DA:743,0
-DA:744,0
-DA:747,112638
-DA:748,112638
-DA:781,56319
-DA:782,56319
-LF:38
-LH:11
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,0
-DA:166,0
-DA:167,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_pair.h
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorISsEbEC1ERKS1_RKb
-DA:88,0
-DA:89,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_set.h
-FN:261,_ZNKSt3setISsSt4lessISsESaISsEE5beginEv
-FN:270,_ZNKSt3setISsSt4lessISsESaISsEE3endEv
-FN:141,_ZNSt3setISsSt4lessISsESaISsEEC1Ev
-FN:93,_ZNSt3setISsSt4lessISsESaISsEED1Ev
-FN:216,_ZNSt3setISsSt4lessISsESaISsEEaSERKS3_
-FN:405,_ZNSt3setISsSt4lessISsESaISsEE6insertESt23_Rb_tree_const_iteratorISsERKSs
-DA:93,0
-DA:141,0
-DA:142,0
-DA:216,0
-DA:218,0
-DA:219,0
-DA:261,0
-DA:262,0
-DA:270,0
-DA:271,0
-DA:405,0
-DA:406,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_tree.h
-FN:103,_ZNSt18_Rb_tree_node_base10_S_minimumEPS_
-FN:117,_ZNSt18_Rb_tree_node_base10_S_maximumEPS_
-FN:289,_ZNKSt23_Rb_tree_const_iteratorISsEneERKS0_
-FN:452,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_beginEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorISsEC1ERKSt17_Rb_tree_iteratorISsE
-FN:247,_ZNKSt23_Rb_tree_const_iteratorISsEdeEv
-FN:398,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_S_leftEPSt18_Rb_tree_node_base
-FN:463,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_M_endEv
-FN:168,_ZNSt17_Rb_tree_iteratorISsEC1EPSt13_Rb_tree_nodeISsE
-FN:596,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorISsEeqERKS0_
-FN:456,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_beginEv
-FN:240,_ZNSt23_Rb_tree_const_iteratorISsEC1EPKSt13_Rb_tree_nodeISsE
-FN:603,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5beginEv
-FN:614,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE3endEv
-FN:347,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE21_M_get_Node_allocatorEv
-FN:432,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_M_rootEv
-FN:428,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_M_rootEv
-FN:503,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE10_S_minimumEPSt18_Rb_tree_node_base
-FN:436,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11_M_leftmostEv
-FN:511,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE10_S_maximumEPSt18_Rb_tree_node_base
-FN:444,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE12_M_rightmostEv
-FN:415,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EE13_M_initializeEv
-FN:471,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_valueEPKSt13_Rb_tree_nodeISsE
-FN:475,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_S_keyEPKSt13_Rb_tree_nodeISsE
-FN:495,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_S_keyEPKSt18_Rb_tree_node_base
-FN:483,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_S_leftEPKSt18_Rb_tree_node_base
-FN:491,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_rightEPKSt18_Rb_tree_node_base
-FN:403,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEEC1Ev
-FN:351,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13get_allocatorEv
-FN:641,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE4sizeEv
-FN:360,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11_M_put_nodeEPSt13_Rb_tree_nodeISsE
-FN:388,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE15_M_destroy_nodeEPSt13_Rb_tree_nodeISsE
-FN:936,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_eraseEPSt13_Rb_tree_nodeISsE
-FN:584,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEED1Ev
-FN:695,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5clearEv
-FN:356,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE14_M_create_nodeERKSs
-FN:378,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_M_clone_nodeEPKSt13_Rb_tree_nodeISsE
-FN:900,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_M_copyEPKSt13_Rb_tree_nodeISsEPS7_
-FN:824,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEEaSERKS5_
-FN:270,_ZNSt23_Rb_tree_const_iteratorISsEmmEv
-FN:846,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE10_M_insert_EPKSt18_Rb_tree_node_baseS8_RKSs
-FN:195,_ZNSt17_Rb_tree_iteratorISsEmmEv
-FN:1133,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE16_M_insert_uniqueERKSs
-FN:255,_ZNSt23_Rb_tree_const_iteratorISsEppEv
-FN:1178,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE17_M_insert_unique_ESt23_Rb_tree_const_iteratorISsERKSs
-DA:103,0
-DA:105,0
-DA:106,0
-DA:117,0
-DA:119,0
-DA:120,0
-DA:168,0
-DA:169,0
-DA:195,0
-DA:197,0
-DA:198,0
-DA:210,0
-DA:211,0
-DA:240,0
-DA:241,0
-DA:243,0
-DA:244,0
-DA:247,0
-DA:248,0
-DA:255,0
-DA:257,0
-DA:258,0
-DA:270,0
-DA:272,0
-DA:273,0
-DA:289,0
-DA:290,0
-DA:347,0
-DA:348,0
-DA:351,0
-DA:352,0
-DA:356,0
-DA:357,0
-DA:360,0
-DA:361,0
-DA:364,0
-DA:366,0
-DA:368,0
-DA:369,0
-DA:371,0
-DA:372,0
-DA:374,0
-DA:378,0
-DA:380,0
-DA:381,0
-DA:382,0
-DA:383,0
-DA:384,0
-DA:388,0
-DA:390,0
-DA:391,0
-DA:392,0
-DA:398,0
-DA:403,0
-DA:405,0
-DA:406,0
-DA:415,0
-DA:417,0
-DA:418,0
-DA:419,0
-DA:420,0
-DA:421,0
-DA:428,0
-DA:429,0
-DA:432,0
-DA:433,0
-DA:436,0
-DA:437,0
-DA:444,0
-DA:445,0
-DA:452,0
-DA:453,0
-DA:456,0
-DA:459,0
-DA:463,0
-DA:464,0
-DA:471,0
-DA:472,0
-DA:475,0
-DA:476,0
-DA:479,0
-DA:480,0
-DA:483,0
-DA:484,0
-DA:487,0
-DA:488,0
-DA:491,0
-DA:492,0
-DA:495,0
-DA:496,0
-DA:499,0
-DA:500,0
-DA:503,0
-DA:504,0
-DA:511,0
-DA:512,0
-DA:562,0
-DA:584,0
-DA:585,0
-DA:596,0
-DA:599,0
-DA:603,0
-DA:606,0
-DA:614,0
-DA:617,0
-DA:641,0
-DA:642,0
-DA:695,0
-DA:697,0
-DA:698,0
-DA:699,0
-DA:700,0
-DA:701,0
-DA:702,0
-DA:824,0
-DA:826,0
-DA:829,0
-DA:830,0
-DA:831,0
-DA:833,0
-DA:834,0
-DA:835,0
-DA:836,0
-DA:839,0
-DA:846,0
-DA:850,0
-DA:852,0
-DA:854,0
-DA:857,0
-DA:858,0
-DA:900,0
-DA:903,0
-DA:904,0
-DA:908,0
-DA:909,0
-DA:910,0
-DA:911,0
-DA:913,0
-DA:915,0
-DA:916,0
-DA:917,0
-DA:918,0
-DA:919,0
-DA:920,0
-DA:921,0
-DA:924,0
-DA:926,0
-DA:927,0
-DA:929,0
-DA:936,0
-DA:939,0
-DA:941,0
-DA:942,0
-DA:943,0
-DA:944,0
-DA:946,0
-DA:1133,0
-DA:1135,0
-DA:1136,0
-DA:1137,0
-DA:1138,0
-DA:1140,0
-DA:1141,0
-DA:1142,0
-DA:1144,0
-DA:1145,0
-DA:1147,0
-DA:1148,0
-DA:1150,0
-DA:1152,0
-DA:1153,0
-DA:1154,0
-DA:1178,0
-DA:1181,0
-DA:1183,0
-DA:1186,0
-DA:1188,0
-DA:1190,0
-DA:1194,0
-DA:1195,0
-DA:1196,0
-DA:1197,0
-DA:1200,0
-DA:1201,0
-DA:1204,0
-DA:1207,0
-DA:1209,0
-DA:1213,0
-DA:1214,0
-DA:1215,0
-DA:1216,0
-DA:1219,0
-DA:1220,0
-DA:1222,0
-DA:1225,0
-DA:1230,0
-BA:105,0
-BA:105,0
-BA:119,0
-BA:119,0
-BA:826,0
-BA:826,0
-BA:831,0
-BA:831,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:908,0
-BA:908,0
-BA:913,0
-BA:913,0
-BA:918,0
-BA:918,0
-BA:939,0
-BA:939,0
-BA:1138,0
-BA:1138,0
-BA:1142,0
-BA:1142,0
-BA:1145,0
-BA:1145,0
-BA:1147,0
-BA:1147,0
-BA:1152,0
-BA:1152,0
-BA:1181,0
-BA:1181,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1190,0
-BA:1190,0
-BA:1195,0
-BA:1195,0
-BA:1197,0
-BA:1197,0
-BA:1200,0
-BA:1200,0
-BA:1209,0
-BA:1209,0
-BA:1214,0
-BA:1214,0
-BA:1216,0
-BA:1216,0
-BA:1219,0
-BA:1219,0
-LF:196
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyIPSsS2_EET0_T_S4_S3_
-FN:113,_ZSt18uninitialized_copyIPSsS0_ET0_T_S2_S1_
-FN:261,_ZSt22__uninitialized_copy_aIPSsS0_SsET0_T_S2_S1_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPSsS0_SaISsEET0_T_S3_S2_RT1_
-DA:73,0
-DA:75,0
-DA:78,0
-DA:79,0
-DA:81,0
-DA:83,0
-DA:85,0
-DA:86,0
-DA:113,0
-DA:122,0
-DA:261,0
-DA:262,0
-DA:268,0
-DA:272,0
-BA:78,0
-BA:78,0
-BA:79,0
-BA:79,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:484,_ZNKSt6vectorISsSaISsEE4sizeEv
-FN:101,_ZNKSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:395,_ZNSt6vectorISsSaISsEE3endEv
-FN:647,_ZNSt6vectorISsSaISsEE4backEv
-FN:377,_ZNSt6vectorISsSaISsEE5beginEv
-FN:97,_ZNSt12_Vector_baseIPKN3ept10textsearch10TextSearch12ExtraIndexerESaIS5_EE19_M_get_Tp_allocatorEv
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:79,_ZNSt12_Vector_baseIPKN3ept10textsearch10TextSearch12ExtraIndexerESaIS5_EE12_Vector_implD1Ev
-FN:84,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseISsSaISsEEC2Ev
-FN:213,_ZNSt6vectorISsSaISsEEC1Ev
-FN:489,_ZNKSt6vectorISsSaISsEE8max_sizeEv
-FN:84,_ZNSt12_Vector_baseIPKN3ept10textsearch10TextSearch12ExtraIndexerESaIS5_EE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseIPKN3ept10textsearch10TextSearch12ExtraIndexerESaIS5_EEC2Ev
-FN:213,_ZNSt6vectorIPKN3ept10textsearch10TextSearch12ExtraIndexerESaIS5_EEC1Ev
-FN:722,_ZNSt6vectorISsSaISsEE8pop_backEv
-FN:147,_ZNSt12_Vector_baseIPKN3ept10textsearch10TextSearch12ExtraIndexerESaIS5_EE13_M_deallocateEPS5_j
-FN:135,_ZNSt12_Vector_baseIPKN3ept10textsearch10TextSearch12ExtraIndexerESaIS5_EED2Ev
-FN:299,_ZNSt6vectorIPKN3ept10textsearch10TextSearch12ExtraIndexerESaIS5_EED1Ev
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-FN:1075,_ZNKSt6vectorISsSaISsEE12_M_check_lenEjPKc
-FN:143,_ZNSt12_Vector_baseISsSaISsEE11_M_allocateEj
-FN:686,_ZNSt6vectorISsSaISsEE9push_backERKSs
-DA:79,10
-DA:84,10
-DA:85,10
-DA:86,10
-DA:97,10
-DA:98,10
-DA:101,0
-DA:102,0
-DA:108,10
-DA:109,10
-DA:135,10
-DA:136,10
-DA:137,10
-DA:143,0
-DA:144,0
-DA:147,10
-DA:149,10
-DA:150,0
-DA:151,10
-DA:213,10
-DA:214,10
-DA:299,10
-DA:300,10
-DA:301,10
-DA:377,0
-DA:378,0
-DA:395,0
-DA:396,0
-DA:484,0
-DA:485,0
-DA:489,0
-DA:490,0
-DA:647,0
-DA:648,0
-DA:686,0
-DA:688,0
-DA:690,0
-DA:691,0
-DA:694,0
-DA:695,0
-DA:722,0
-DA:724,0
-DA:725,0
-DA:726,0
-DA:1075,0
-DA:1077,0
-DA:1078,0
-DA:1080,0
-DA:1081,0
-BA:144,0
-BA:144,0
-BA:149,1
-BA:149,2
-BA:149,0
-BA:149,0
-BA:688,0
-BA:688,0
-BA:1077,0
-BA:1077,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-LF:49
-LH:19
-end_of_record
-SF:/usr/include/c++/4.3/bits/vector.tcc
-FN:283,_ZNSt6vectorISsSaISsEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPSsS1_EERKSs
-DA:283,0
-DA:286,0
-DA:288,0
-DA:291,0
-DA:293,0
-DA:295,0
-DA:299,0
-DA:307,0
-DA:308,0
-DA:309,0
-DA:316,0
-DA:321,0
-DA:323,0
-DA:324,0
-DA:330,0
-DA:332,0
-DA:333,0
-DA:334,0
-DA:336,0
-DA:338,0
-DA:341,0
-DA:342,0
-DA:343,0
-DA:345,0
-BA:286,0
-BA:286,0
-LF:24
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIPKN3ept10textsearch10TextSearch12ExtraIndexerEED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISsE8max_sizeEv
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorIPKN3ept10textsearch10TextSearch12ExtraIndexerEEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE8max_sizeEv
-FN:118,_ZN9__gnu_cxx13new_allocatorISsE7destroyEPSs
-FN:97,_ZN9__gnu_cxx13new_allocatorIPKN3ept10textsearch10TextSearch12ExtraIndexerEE10deallocateEPS6_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE10deallocateEPS2_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-FN:107,_ZN9__gnu_cxx13new_allocatorISsE9constructEPSsRKSs
-FN:87,_ZN9__gnu_cxx13new_allocatorISsE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE8allocateEjPKv
-DA:69,10
-DA:71,0
-DA:76,10
-DA:87,0
-DA:89,0
-DA:90,0
-DA:92,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:107,0
-DA:108,0
-DA:118,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:108,0
-BA:108,0
-LF:14
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:229,_ZNSolsEPKv
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:195,_ZNSolsEj
-DA:95,0
-DA:112,0
-DA:117,0
-DA:195,0
-DA:199,0
-DA:229,0
-DA:230,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/xapian/base.h
-FN:164,_ZNK6Xapian8Internal9RefCntPtrINS_12TermIterator8InternalEE3getEv
-FN:94,_ZN6Xapian8Internal9RefCntPtrINS_5Query8InternalEEC1EPS3_
-FN:130,_ZN6Xapian8Internal9RefCntPtrINS_5Query8InternalEED1Ev
-DA:94,19
-DA:96,19
-DA:97,19
-DA:130,0
-DA:132,0
-DA:136,0
-DA:137,0
-DA:138,0
-DA:140,0
-DA:164,10
-DA:166,10
-BA:96,1
-BA:96,2
-BA:132,0
-BA:132,0
-BA:132,0
-BA:132,0
-BA:132,0
-BA:132,0
-BA:138,0
-BA:138,0
-LF:11
-LH:5
-end_of_record
-SF:/usr/include/xapian/database.h
-FN:178,_ZNK6Xapian8Database12allterms_endERKSs
-DA:178,1
-DA:179,1
-LF:2
-LH:2
-end_of_record
-SF:/usr/include/xapian/enquire.h
-FN:273,_ZN6Xapian12MSetIteratorppEv
-FN:374,_ZN6XapianeqERKNS_12MSetIteratorES2_
-FN:379,_ZN6XapianneERKNS_12MSetIteratorES2_
-FN:476,_ZN6Xapian12ESetIteratorppEv
-FN:525,_ZN6XapianneERKNS_12ESetIteratorES2_
-FN:258,_ZN6Xapian12MSetIteratorD1Ev
-FN:461,_ZN6Xapian12ESetIteratorD1Ev
-FN:564,_ZN6Xapian4RSet12add_documentERKNS_12MSetIteratorE
-FN:955,_ZNK6Xapian7Enquire8get_esetEjRKNS_4RSetEPKNS_13ExpandDeciderE
-FN:256,_ZN6Xapian12MSetIteratorC1Ev
-FN:267,_ZN6Xapian12MSetIteratoraSERKS0_
-FN:261,_ZN6Xapian12MSetIteratorC1ERKS0_
-FN:279,_ZN6Xapian12MSetIteratorppEi
-DA:256,3
-DA:258,165
-DA:261,58
-DA:262,58
-DA:263,58
-DA:264,58
-DA:267,31
-DA:268,31
-DA:269,31
-DA:270,31
-DA:273,61
-DA:274,61
-DA:275,61
-DA:279,28
-DA:280,28
-DA:281,28
-DA:374,30
-DA:376,30
-DA:379,58
-DA:381,58
-DA:461,8
-DA:476,0
-DA:477,0
-DA:478,0
-DA:525,4
-DA:527,4
-DA:564,20
-DA:955,4
-DA:956,4
-LF:29
-LH:26
-end_of_record
-SF:/usr/include/xapian/expanddecider.h
-FN:32,_ZN6Xapian13ExpandDeciderC2Ev
-DA:32,5
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/xapian/query.h
-FN:258,_ZN6Xapian5QueryC1ISt23_Rb_tree_const_iteratorISsEEENS0_2opET_S5_j
-DA:258,16
-DA:259,16
-DA:262,16
-DA:265,48
-DA:266,16
-DA:267,16
-DA:270,16
-DA:271,0
-DA:272,0
-DA:273,0
-DA:275,16
-BA:265,2
-BA:265,2
-LF:11
-LH:8
-end_of_record
-SF:/usr/include/xapian/termiterator.h
-FN:136,_ZN6XapianeqERKNS_12TermIteratorES2_
-FN:142,_ZN6XapianneERKNS_12TermIteratorES2_
-DA:136,5
-DA:138,5
-DA:142,5
-DA:144,5
-LF:4
-LH:4
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/apt/version.h
-FN:77,_ZNK3ept3apt7Version7isValidEv
-FN:41,_ZN3ept3apt7VersionD1Ev
-FN:50,_ZN3ept3apt7VersionC1Ev
-FN:55,_ZN3ept3apt7VersionC1ERKSsS3_
-FN:41,_ZN3ept3apt7VersionC1ERKS1_
-FN:61,_ZNK3ept3apt7Version4nameEv
-FN:67,_ZNK3ept3apt7Version7versionEv
-FN:41,_ZN3ept3apt7VersionaSERKS1_
-FN:82,_ZNK3ept3apt7VersioneqERKS1_
-FN:83,_ZNK3ept3apt7VersionneERKS1_
-DA:41,55
-DA:50,7
-DA:55,34
-DA:56,34
-DA:61,81
-DA:67,38
-DA:77,11
-DA:82,9
-DA:83,5
-BA:77,2
-BA:77,2
-BA:77,2
-BA:77,1
-BA:82,2
-BA:82,1
-BA:82,2
-BA:82,1
-BA:83,2
-BA:83,2
-BA:83,2
-BA:83,2
-LF:9
-LH:9
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/apt/version.test.h
-FN:123,_ZN14TestAptVersion16policyComparisonEv
-FN:95,_ZN14TestAptVersion9valueCopyEv
-FN:61,_ZN14TestAptVersion10comparisonEv
-FN:114,_ZN14TestAptVersion15upstreamVersionEv
-FN:42,_ZN14TestAptVersion5basicEv
-FN:28,_ZN14TestAptVersion7invalidEv
-DA:28,1
-DA:30,1
-DA:32,1
-DA:33,1
-DA:34,1
-DA:36,1
-DA:38,1
-DA:39,1
-DA:42,1
-DA:44,1
-DA:46,2
-DA:47,1
-DA:48,1
-DA:50,1
-DA:52,1
-DA:54,1
-DA:55,2
-DA:56,1
-DA:57,1
-DA:58,1
-DA:61,1
-DA:63,1
-DA:64,2
-DA:66,2
-DA:67,2
-DA:68,2
-DA:69,2
-DA:70,2
-DA:71,2
-DA:74,2
-DA:76,2
-DA:77,2
-DA:78,2
-DA:79,2
-DA:80,2
-DA:81,2
-DA:84,2
-DA:86,2
-DA:87,2
-DA:88,2
-DA:89,2
-DA:90,2
-DA:91,2
-DA:92,1
-DA:95,1
-DA:97,1
-DA:98,1
-DA:100,1
-DA:102,1
-DA:103,1
-DA:104,1
-DA:105,2
-DA:107,2
-DA:108,2
-DA:109,2
-DA:110,2
-DA:111,1
-DA:114,1
-DA:116,1
-DA:117,2
-DA:118,2
-DA:119,2
-DA:120,1
-DA:123,1
-DA:125,1
-DA:126,2
-DA:127,2
-DA:128,2
-DA:129,2
-DA:130,2
-DA:132,1
-LF:71
-LH:71
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt/record.h
-DA:86,1
-BA:86,1
-BA:86,2
-LF:1
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:13,_ZN8LocationD1Ev
-FN:17,_ZN8LocationC1EPKciSs
-FN:13,_ZN8LocationC1ERKS_
-FN:52,_ZlsISsER12AssertFailedS1_T_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:52,_ZlsIPKcER12AssertFailedS3_T_
-FN:41,_ZN12AssertFailedD1Ev
-FN:59,_Z9assert_fnIbEv8LocationT_
-FN:67,_Z12assert_eq_fnISsSsEv8LocationT_T0_
-FN:67,_Z12assert_eq_fnISsPKcEv8LocationT_T0_
-FN:52,_ZlsIbER12AssertFailedS1_T_
-FN:67,_Z12assert_eq_fnIbbEv8LocationT_T0_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:59,0
-DA:61,0
-DA:62,0
-DA:64,0
-DA:67,4
-DA:69,4
-DA:70,0
-DA:71,0
-DA:75,4
-BA:42,0
-BA:42,0
-BA:61,0
-BA:61,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,1
-BA:69,2
-LF:26
-LH:3
-end_of_record
-SF:/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_apt_version.cpp
-FN:8,_Z41__static_initialization_and_destruction_0ii
-FN:8,_GLOBAL__I_ept_test_generated__home_mornfall_dev_pkg_ept_work_ept_apt_version.cpp
-FN:8,_Z31run_AptVersion_policyComparisonv
-FN:6,_Z24run_AptVersion_valueCopyv
-FN:5,_Z25run_AptVersion_comparisonv
-FN:7,_Z30run_AptVersion_upstreamVersionv
-FN:4,_Z20run_AptVersion_basicv
-FN:3,_Z22run_AptVersion_invalidv
-DA:3,1
-DA:4,1
-DA:5,1
-DA:6,1
-DA:7,1
-DA:8,4
-BA:8,2
-BA:8,1
-BA:8,2
-BA:8,1
-LF:6
-LH:6
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-FN:2162,_ZSteqIcEN9__gnu_cxx11__enable_ifIXsrSt9__is_charIT_E7__valueEbE6__typeERKSbIS3_St11char_traitsIS3_ESaIS3_EESC_
-FN:2201,_ZStneIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:2188,_ZSteqIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_EPKS3_
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:686,0
-DA:687,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2162,0
-DA:2165,0
-DA:2188,0
-DA:2189,0
-DA:2201,0
-DA:2202,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-LF:59
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-DA:245,0
-DA:246,0
-DA:257,0
-DA:258,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:166,0
-DA:167,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-DA:69,0
-DA:71,0
-DA:76,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:177,_ZNSolsEb
-DA:95,0
-DA:112,0
-DA:117,0
-DA:177,0
-DA:178,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt/record.h
-DA:86,1
-BA:86,1
-BA:86,2
-LF:1
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt.h
-FN:139,_ZN3ept4core11AptDatabaseC1Ev
-FN:209,_ZN3ept4core11AptDatabase10invalidateEv
-FN:331,_ZN3ept4core11AptDatabaseD1Ev
-DA:139,0
-DA:140,0
-DA:141,0
-DA:142,0
-DA:143,0
-DA:144,0
-DA:145,0
-DA:146,0
-DA:209,0
-DA:210,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:218,0
-DA:219,0
-DA:220,0
-DA:331,0
-DA:332,0
-DA:333,0
-BA:210,0
-BA:210,0
-BA:214,0
-BA:214,0
-BA:216,0
-BA:216,0
-BA:218,0
-BA:218,0
-LF:21
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/debtags.h
-FN:280,_ZN3ept7debtags7Debtags10vocabularyEv
-FN:289,_ZN3ept7debtags7Debtags5pkgidEv
-FN:194,_ZN3ept7debtags7DebtagsD1Ev
-DA:194,0
-DA:280,0
-DA:289,4
-LF:3
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/maint/path.h
-FN:76,_ZN3ept7debtags4Path24OverrideDebtagsSourceDirC1ERKSs
-FN:80,_ZN3ept7debtags4Path24OverrideDebtagsSourceDirD1Ev
-FN:86,_ZN3ept7debtags4Path23OverrideDebtagsIndexDirC1ERKSs
-FN:90,_ZN3ept7debtags4Path23OverrideDebtagsIndexDirD1Ev
-FN:96,_ZN3ept7debtags4Path28OverrideDebtagsUserSourceDirC1ERKSs
-FN:100,_ZN3ept7debtags4Path28OverrideDebtagsUserSourceDirD1Ev
-FN:106,_ZN3ept7debtags4Path27OverrideDebtagsUserIndexDirC1ERKSs
-FN:110,_ZN3ept7debtags4Path27OverrideDebtagsUserIndexDirD1Ev
-DA:76,0
-DA:78,0
-DA:79,0
-DA:80,0
-DA:86,0
-DA:88,0
-DA:89,0
-DA:90,0
-DA:96,0
-DA:98,0
-DA:99,0
-DA:100,0
-DA:106,0
-DA:108,0
-DA:109,0
-DA:110,0
-LF:16
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/maint/pkgid.h
-FN:54,_ZNK3ept7debtags5PkgId4sizeEv
-FN:68,_ZNK3ept7debtags5PkgId4byIDEi
-FN:41,_ZN3ept7debtags5PkgIdD1Ev
-DA:41,0
-DA:54,0
-DA:68,0
-DA:70,0
-DA:71,0
-DA:72,0
-BA:54,0
-BA:54,0
-BA:70,0
-BA:70,0
-BA:70,0
-BA:70,0
-BA:70,0
-BA:70,0
-LF:6
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/maint/serializer.h
-FN:75,_ZN3ept7debtags11StringToIntIN7tagcoll4coll8InserterINS3_6SimpleIiiEEEEEC1ERNS0_5PkgIdERNS0_10VocabularyERKS7_
-FN:111,_ZN3ept7debtags11stringToIntIN7tagcoll4coll8InserterINS3_6SimpleIiiEEEEEENS0_11StringToIntIT_EERNS0_5PkgIdERNS0_10VocabularyERKS9_
-FN:27,_ZN3ept7debtags8IntToPkgIN7tagcoll4coll8InserterINS3_6SimpleISsNS0_3TagEEEEEEC1ERNS0_5PkgIdERNS0_10VocabularyERKS8_
-FN:62,_ZN3ept7debtags8intToPkgIN7tagcoll4coll8InserterINS3_6SimpleISsNS0_3TagEEEEEEENS0_8IntToPkgIT_EERNS0_5PkgIdERNS0_10VocabularyERKSA_
-FN:171,_ZN3ept7debtags11PkgToStringIN7tagcoll4coll8InserterINS3_6SimpleISsSsEEEEEC1ERKS7_
-FN:188,_ZN3ept7debtags11pkgToStringIN7tagcoll4coll8InserterINS3_6SimpleISsSsEEEEEENS0_11PkgToStringIT_EERKS9_
-FN:201,_ZN3ept7debtags16PatchStringToIntIN7tagcoll8InserterIiiEEEC1ERNS0_5PkgIdERNS0_10VocabularyERKS4_
-FN:232,_ZN3ept7debtags16patchStringToIntIN7tagcoll8InserterIiiEEEENS0_16PatchStringToIntIT_EERNS0_5PkgIdERNS0_10VocabularyERKS6_
-FN:245,_ZN3ept7debtags16PatchIntToStringIN7tagcoll8InserterISsSsEEEC1ERNS0_5PkgIdERNS0_10VocabularyERKS4_
-FN:276,_ZN3ept7debtags16patchIntToStringIN7tagcoll8InserterISsSsEEEENS0_16PatchIntToStringIT_EERNS0_5PkgIdERNS0_10VocabularyERKS6_
-FN:31,_ZN3ept7debtags8IntToPkgIN7tagcoll4coll8InserterINS3_6SimpleISsNS0_3TagEEEEEEaSIN6wibble9SingletonIiEESt3setIiSt4lessIiESaIiEEEERS9_RKSt4pairIT_T0_E
-FN:204,_ZN3ept7debtags16PatchStringToIntIN7tagcoll8InserterIiiEEEaSERKNS2_5PatchISsSsEE
-FN:79,_ZN3ept7debtags11StringToIntIN7tagcoll4coll8InserterINS3_6SimpleIiiEEEEEaSIN6wibble9SingletonISsEESt3setISsSt4lessISsESaISsEEEERS8_RKSt4pairIT_T0_E
-FN:248,_ZN3ept7debtags16PatchIntToStringIN7tagcoll8InserterISsSsEEEaSERKNS2_5PatchIiiEE
-FN:174,_ZN3ept7debtags11PkgToStringIN7tagcoll4coll8InserterINS3_6SimpleISsSsEEEEEaSIN6wibble9SingletonISsEESt3setINS0_3TagESt4lessISE_ESaISE_EEEERS8_RKSt4pairIT_T0_E
-DA:27,0
-DA:28,0
-DA:31,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:39,0
-DA:40,0
-DA:41,0
-DA:44,0
-DA:47,0
-DA:48,0
-DA:49,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:57,0
-DA:62,0
-DA:64,0
-DA:75,1
-DA:76,1
-DA:79,1
-DA:81,1
-DA:82,1
-DA:84,2
-DA:87,1
-DA:88,1
-DA:89,1
-DA:92,3
-DA:95,2
-DA:96,2
-DA:97,2
-DA:100,1
-DA:102,1
-DA:103,1
-DA:105,1
-DA:111,1
-DA:113,1
-DA:171,1
-DA:174,1
-DA:176,1
-DA:177,3
-DA:179,2
-DA:180,2
-DA:181,1
-DA:182,1
-DA:183,1
-DA:188,1
-DA:190,1
-DA:201,1
-DA:202,1
-DA:204,1
-DA:206,1
-DA:207,1
-DA:208,0
-DA:210,1
-DA:211,2
-DA:214,1
-DA:215,1
-DA:216,1
-DA:218,2
-DA:221,1
-DA:222,1
-DA:223,1
-DA:225,1
-DA:226,1
-DA:227,1
-DA:232,1
-DA:234,1
-DA:245,2
-DA:246,2
-DA:248,2
-DA:250,2
-DA:251,2
-DA:252,0
-DA:254,2
-DA:255,4
-DA:258,2
-DA:259,2
-DA:260,2
-DA:262,3
-DA:265,1
-DA:266,1
-DA:267,1
-DA:269,2
-DA:270,2
-DA:271,2
-DA:276,2
-DA:278,2
-BA:36,0
-BA:36,0
-BA:40,0
-BA:40,0
-BA:44,0
-BA:44,0
-BA:48,0
-BA:48,0
-BA:52,0
-BA:52,0
-BA:52,0
-BA:52,0
-BA:52,0
-BA:52,0
-BA:84,2
-BA:84,2
-BA:88,2
-BA:88,1
-BA:92,2
-BA:92,2
-BA:96,2
-BA:96,1
-BA:100,2
-BA:100,1
-BA:100,2
-BA:100,1
-BA:100,2
-BA:100,1
-BA:177,2
-BA:177,2
-BA:179,2
-BA:179,1
-BA:207,1
-BA:207,2
-BA:211,2
-BA:211,2
-BA:215,2
-BA:215,1
-BA:218,2
-BA:218,2
-BA:222,2
-BA:222,1
-BA:251,1
-BA:251,2
-BA:255,2
-BA:255,2
-BA:259,2
-BA:259,1
-BA:262,2
-BA:262,2
-BA:266,2
-BA:266,1
-LF:89
-LH:68
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/maint/serializer.test.h
-FN:50,_ZN14TestSerializerC1Ev
-FN:45,_ZN14TestSerializerD1Ev
-FN:102,_ZN14TestSerializer2_2Ev
-FN:57,_ZN14TestSerializer2_1Ev
-DA:45,2
-DA:50,2
-DA:51,2
-DA:57,1
-DA:60,1
-DA:61,1
-DA:62,2
-DA:65,1
-DA:66,1
-DA:68,1
-DA:69,2
-DA:72,1
-DA:73,1
-DA:75,1
-DA:76,2
-DA:78,2
-DA:79,2
-DA:81,2
-DA:82,2
-DA:84,2
-DA:85,2
-DA:88,1
-DA:89,1
-DA:91,1
-DA:92,2
-DA:94,2
-DA:95,2
-DA:97,2
-DA:98,2
-DA:99,1
-DA:102,1
-DA:104,1
-DA:107,1
-DA:110,1
-DA:111,1
-DA:112,1
-DA:113,2
-DA:114,2
-DA:117,1
-DA:118,1
-DA:119,1
-DA:120,2
-DA:121,2
-DA:122,2
-DA:123,2
-DA:124,2
-DA:125,2
-DA:126,1
-LF:48
-LH:48
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/tag.h
-FN:175,_ZN3ept7debtags3TagD1Ev
-FN:179,_ZNK3ept7debtags3TagltERKS1_
-FN:182,_ZNK3ept7debtags3Tag5validEv
-FN:242,_ZNK3ept7debtags3Tag2idEv
-DA:175,0
-DA:179,0
-DA:182,0
-DA:242,0
-LF:4
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/vocabulary.h
-FN:114,_ZNK3ept7debtags10Vocabulary8TagIndex2idERKSs
-FN:203,_ZNK3ept7debtags10Vocabulary9tagByNameERKSs
-DA:114,0
-DA:203,0
-LF:2
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/test.h
-FN:12,_ZN18AptTestEnvironmentC2Ev
-FN:10,_ZN18AptTestEnvironmentD2Ev
-FN:30,_ZN22DebtagsTestEnvironmentC2Ev
-FN:24,_ZN22DebtagsTestEnvironmentD2Ev
-DA:10,0
-DA:12,0
-DA:13,0
-DA:14,0
-DA:15,0
-DA:16,0
-DA:17,0
-DA:18,0
-DA:19,0
-DA:20,0
-DA:21,0
-DA:24,0
-DA:30,0
-DA:34,0
-DA:35,0
-LF:15
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/mixin.h
-FN:52,_ZN6wibble5mixin14OutputIteratorIN7tagcoll4coll8InserterINS3_6SimpleIiiEEEEEC2Ev
-FN:52,_ZN6wibble5mixin14OutputIteratorIN3ept7debtags11StringToIntIN7tagcoll4coll8InserterINS6_6SimpleIiiEEEEEEEC2Ev
-FN:64,_ZN6wibble5mixin14OutputIteratorIN3ept7debtags11StringToIntIN7tagcoll4coll8InserterINS6_6SimpleIiiEEEEEEEdeEv
-FN:53,_ZN6wibble5mixin14OutputIteratorIN3ept7debtags11StringToIntIN7tagcoll4coll8InserterINS6_6SimpleIiiEEEEEEEppEv
-FN:52,_ZN6wibble5mixin14OutputIteratorIN7tagcoll4coll8InserterINS3_6SimpleISsN3ept7debtags3TagEEEEEEC2Ev
-FN:52,_ZN6wibble5mixin14OutputIteratorIN3ept7debtags8IntToPkgIN7tagcoll4coll8InserterINS6_6SimpleISsNS3_3TagEEEEEEEEC2Ev
-FN:64,_ZN6wibble5mixin14OutputIteratorIN3ept7debtags8IntToPkgIN7tagcoll4coll8InserterINS6_6SimpleISsNS3_3TagEEEEEEEEdeEv
-FN:53,_ZN6wibble5mixin14OutputIteratorIN3ept7debtags8IntToPkgIN7tagcoll4coll8InserterINS6_6SimpleISsNS3_3TagEEEEEEEEppEv
-FN:52,_ZN6wibble5mixin14OutputIteratorIN7tagcoll4coll8InserterINS3_6SimpleISsSsEEEEEC2Ev
-FN:52,_ZN6wibble5mixin14OutputIteratorIN3ept7debtags11PkgToStringIN7tagcoll4coll8InserterINS6_6SimpleISsSsEEEEEEEC2Ev
-FN:64,_ZN6wibble5mixin14OutputIteratorIN3ept7debtags11PkgToStringIN7tagcoll4coll8InserterINS6_6SimpleISsSsEEEEEEEdeEv
-FN:53,_ZN6wibble5mixin14OutputIteratorIN3ept7debtags11PkgToStringIN7tagcoll4coll8InserterINS6_6SimpleISsSsEEEEEEEppEv
-FN:52,_ZN6wibble5mixin14OutputIteratorIN7tagcoll8InserterIiiEEEC2Ev
-FN:52,_ZN6wibble5mixin14OutputIteratorIN3ept7debtags16PatchStringToIntIN7tagcoll8InserterIiiEEEEEC2Ev
-FN:64,_ZN6wibble5mixin14OutputIteratorIN3ept7debtags16PatchStringToIntIN7tagcoll8InserterIiiEEEEEdeEv
-FN:53,_ZN6wibble5mixin14OutputIteratorIN3ept7debtags16PatchStringToIntIN7tagcoll8InserterIiiEEEEEppEv
-FN:52,_ZN6wibble5mixin14OutputIteratorIN7tagcoll8InserterISsSsEEEC2Ev
-FN:52,_ZN6wibble5mixin14OutputIteratorIN3ept7debtags16PatchIntToStringIN7tagcoll8InserterISsSsEEEEEC2Ev
-FN:64,_ZN6wibble5mixin14OutputIteratorIN3ept7debtags16PatchIntToStringIN7tagcoll8InserterISsSsEEEEEdeEv
-FN:53,_ZN6wibble5mixin14OutputIteratorIN3ept7debtags16PatchIntToStringIN7tagcoll8InserterISsSsEEEEEppEv
-FN:64,_ZN6wibble5mixin14OutputIteratorIN7tagcoll4coll8InserterINS3_6SimpleIiiEEEEEdeEv
-FN:53,_ZN6wibble5mixin14OutputIteratorIN7tagcoll4coll8InserterINS3_6SimpleIiiEEEEEppEv
-FN:64,_ZN6wibble5mixin14OutputIteratorIN7tagcoll4coll8InserterINS3_6SimpleISsN3ept7debtags3TagEEEEEEdeEv
-FN:53,_ZN6wibble5mixin14OutputIteratorIN7tagcoll4coll8InserterINS3_6SimpleISsN3ept7debtags3TagEEEEEEppEv
-FN:64,_ZN6wibble5mixin14OutputIteratorIN7tagcoll4coll8InserterINS3_6SimpleISsSsEEEEEdeEv
-FN:53,_ZN6wibble5mixin14OutputIteratorIN7tagcoll4coll8InserterINS3_6SimpleISsSsEEEEEppEv
-FN:64,_ZN6wibble5mixin14OutputIteratorIN7tagcoll8InserterIiiEEEdeEv
-FN:53,_ZN6wibble5mixin14OutputIteratorIN7tagcoll8InserterIiiEEEppEv
-FN:64,_ZN6wibble5mixin14OutputIteratorIN7tagcoll8InserterISsSsEEEdeEv
-FN:53,_ZN6wibble5mixin14OutputIteratorIN7tagcoll8InserterISsSsEEEppEv
-DA:52,14
-DA:53,42300
-DA:54,42300
-DA:64,42300
-DA:65,42300
-LF:5
-LH:5
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/operators.h
-FN:115,_ZN6wibble9operatorsoRISsEERSt3setIT_St4lessIS3_ESaIS3_EES8_RKS3_
-FN:67,_ZN6wibble9operatorsorISsEESt3setIT_St4lessIS3_ESaIS3_EERKS7_RKNS_9SingletonIS3_EE
-FN:123,_ZN6wibble9operatorsoRISsNS_9SingletonISsEEEERSt3setIT_St4lessIS5_ESaIS5_EESA_RKT0_
-FN:115,_ZN6wibble9operatorsoRIiEERSt3setIT_St4lessIS3_ESaIS3_EES8_RKS3_
-FN:133,_ZN6wibble9operatorsoRISsEERSt3setIT_St4lessIS3_ESaIS3_EES8_RKS7_
-FN:74,_ZN6wibble9operatorsorISsEESt3setIT_St4lessIS3_ESaIS3_EERKS7_S9_
-FN:133,_ZN6wibble9operatorsoRIiEERSt3setIT_St4lessIS3_ESaIS3_EES8_RKS7_
-FN:74,_ZN6wibble9operatorsorIiEESt3setIT_St4lessIS3_ESaIS3_EERKS7_S9_
-FN:74,_ZN6wibble9operatorsorIN3ept7debtags3TagEEESt3setIT_St4lessIS6_ESaIS6_EERKSA_SC_
-FN:133,_ZN6wibble9operatorsoRIN3ept7debtags3TagEEERSt3setIT_St4lessIS6_ESaIS6_EESB_RKSA_
-FN:198,_ZN6wibble9operatorsmIISsSt3setISsSt4lessISsESaISsEEEERS2_IT_S3_IS7_ESaIS7_EESB_RKT0_
-FN:198,_ZN6wibble9operatorsmIIiSt3setIiSt4lessIiESaIiEEEERS2_IT_S3_IS7_ESaIS7_EESB_RKT0_
-FN:183,_ZN6wibble9operatorsmIIiEERSt3setIT_St4lessIS3_ESaIS3_EES8_RKS3_
-FN:183,_ZN6wibble9operatorsmIISsEERSt3setIT_St4lessIS3_ESaIS3_EES8_RKS3_
-DA:67,1
-DA:68,1
-DA:69,1
-DA:70,0
-DA:74,21146
-DA:75,21146
-DA:76,21146
-DA:78,0
-DA:115,253745
-DA:117,253745
-DA:118,253745
-DA:123,1
-DA:125,2
-DA:127,1
-DA:128,1
-DA:133,21146
-DA:134,21146
-DA:135,1
-DA:137,126871
-DA:139,105726
-DA:140,21145
-DA:183,3
-DA:185,3
-DA:186,3
-DA:198,0
-DA:200,0
-DA:201,0
-DA:202,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:209,0
-DA:211,0
-DA:212,0
-DA:214,0
-DA:216,0
-BA:125,2
-BA:125,2
-BA:134,2
-BA:134,2
-BA:134,0
-BA:134,0
-BA:134,0
-BA:134,0
-BA:137,2
-BA:137,2
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:202,0
-BA:202,0
-BA:202,0
-BA:202,0
-BA:202,0
-BA:202,0
-BA:202,0
-BA:202,0
-BA:202,0
-BA:202,0
-BA:202,0
-BA:202,0
-BA:204,0
-BA:204,0
-BA:204,0
-BA:204,0
-BA:211,0
-BA:211,0
-BA:211,0
-BA:211,0
-LF:37
-LH:22
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/singleton.h
-FN:82,_ZNK6wibble9SingletonISsE5emptyEv
-FN:56,_ZNK6wibble9SingletonISsE14const_iteratorneERKS2_
-FN:54,_ZN6wibble9SingletonISsE14const_iteratorppEv
-FN:52,_ZNK6wibble9SingletonISsE14const_iteratordeEv
-FN:47,_ZN6wibble9SingletonISsE14const_iteratorC1EPKSs
-FN:87,_ZNK6wibble9SingletonISsE5beginEv
-FN:50,_ZN6wibble9SingletonISsE14const_iteratorC1Ev
-FN:88,_ZNK6wibble9SingletonISsE3endEv
-FN:80,_ZN6wibble9SingletonIiEC1ERKi
-FN:92,_ZN6wibble9singletonIiEENS_9SingletonIT_EERKS2_
-FN:56,_ZNK6wibble9SingletonIiE14const_iteratorneERKS2_
-FN:54,_ZN6wibble9SingletonIiE14const_iteratorppEv
-FN:52,_ZNK6wibble9SingletonIiE14const_iteratordeEv
-FN:47,_ZN6wibble9SingletonIiE14const_iteratorC1EPKi
-FN:87,_ZNK6wibble9SingletonIiE5beginEv
-FN:50,_ZN6wibble9SingletonIiE14const_iteratorC1Ev
-FN:88,_ZNK6wibble9SingletonIiE3endEv
-FN:35,_ZN6wibble9SingletonISsED1Ev
-FN:80,_ZN6wibble9SingletonISsEC1ERKSs
-FN:92,_ZN6wibble9singletonISsEENS_9SingletonIT_EERKS2_
-FN:35,_ZN6wibble9SingletonISsEC1ERKS1_
-DA:35,42294
-DA:47,0
-DA:50,0
-DA:52,0
-DA:54,0
-DA:56,0
-DA:80,0
-DA:82,2
-DA:87,0
-DA:88,0
-DA:92,0
-DA:94,0
-LF:12
-LH:2
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:13,_ZN8LocationD1Ev
-FN:13,_ZN8LocationC1ERKS_
-FN:17,_ZN8LocationC1EPKciSs
-FN:52,_ZlsISsER12AssertFailedS1_T_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:52,_ZlsIPKcER12AssertFailedS3_T_
-FN:52,_ZlsIjER12AssertFailedS1_T_
-FN:41,_ZN12AssertFailedD1Ev
-FN:67,_Z12assert_eq_fnIjjEv8LocationT_T0_
-FN:67,_Z12assert_eq_fnISsSsEv8LocationT_T0_
-FN:59,_Z9assert_fnIbEv8LocationT_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:59,0
-DA:61,0
-DA:62,0
-DA:64,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:75,0
-BA:42,0
-BA:42,0
-BA:61,0
-BA:61,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-LF:26
-LH:0
-end_of_record
-SF:/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_maint_serializer.cpp
-FN:4,_Z41__static_initialization_and_destruction_0ii
-FN:4,_GLOBAL__I_ept_test_generated__home_mornfall_dev_pkg_ept_work_ept_debtags_maint_serializer.cpp
-FN:4,_Z17run_Serializer__2v
-FN:3,_Z17run_Serializer__1v
-DA:3,1
-DA:4,4
-BA:4,2
-BA:4,1
-BA:4,2
-BA:4,1
-LF:2
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeIN3ept7debtags3TagEEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeIiEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISt4pairIKiN7tagcoll5PatchIiiEEEEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISsEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsSt3setISsSt4lessISsESaISsEEEEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISt4pairIKiSt3setIiSt4lessIiESaIiEEEEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEEEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsN7tagcoll5PatchISsSsEEEEED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaISsED1Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeIN3ept7debtags3TagEEEC2Ev
-FN:106,_ZNSaIN3ept7debtags3TagEED1Ev
-FN:100,_ZNSaISt13_Rb_tree_nodeIN3ept7debtags3TagEEEC2ERKS4_
-FN:98,_ZNSaISt13_Rb_tree_nodeIiEEC2Ev
-FN:106,_ZNSaIiED1Ev
-FN:100,_ZNSaISt13_Rb_tree_nodeIiEEC2ERKS1_
-FN:106,_ZNSaISt4pairIKiN7tagcoll5PatchIiiEEEED1Ev
-FN:100,_ZNSaISt13_Rb_tree_nodeISsEEC2ERKS1_
-FN:104,_ZNSaISsEC1ISt13_Rb_tree_nodeISsEEERKSaIT_E
-FN:98,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsSt3setISsSt4lessISsESaISsEEEEEC2Ev
-FN:106,_ZNSaISt4pairIKSsSt3setISsSt4lessISsESaISsEEEED1Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeISt4pairIKiSt3setIiSt4lessIiESaIiEEEEEC2Ev
-FN:106,_ZNSaISt4pairIKiSt3setIiSt4lessIiESaIiEEEED1Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEEEEC2Ev
-FN:106,_ZNSaISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS4_ESaIS4_EEEED1Ev
-FN:106,_ZNSaISt4pairIKSsN7tagcoll5PatchISsSsEEEED1Ev
-FN:104,_ZNSaIN3ept7debtags3TagEEC1ISt13_Rb_tree_nodeIS1_EEERKSaIT_E
-FN:104,_ZNSaIiEC1ISt13_Rb_tree_nodeIiEEERKSaIT_E
-FN:104,_ZNSaISt4pairIKiN7tagcoll5PatchIiiEEEEC1ISt13_Rb_tree_nodeIS4_EEERKSaIT_E
-FN:98,_ZNSaISt13_Rb_tree_nodeISsEEC2Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeISt4pairIKiN7tagcoll5PatchIiiEEEEEC2Ev
-FN:104,_ZNSaISt4pairIKSsSt3setISsSt4lessISsESaISsEEEEC1ISt13_Rb_tree_nodeIS6_EEERKSaIT_E
-FN:104,_ZNSaISt4pairIKiSt3setIiSt4lessIiESaIiEEEEC1ISt13_Rb_tree_nodeIS6_EEERKSaIT_E
-FN:104,_ZNSaISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS4_ESaIS4_EEEEC1ISt13_Rb_tree_nodeIS9_EEERKSaIT_E
-FN:98,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsN7tagcoll5PatchISsSsEEEEEC2Ev
-FN:104,_ZNSaISt4pairIKSsN7tagcoll5PatchISsSsEEEEC1ISt13_Rb_tree_nodeIS4_EEERKSaIT_E
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,8
-DA:100,0
-DA:101,0
-DA:104,42302
-DA:106,42310
-DA:118,0
-DA:119,0
-LF:7
-LH:3
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:1534,_ZNKSs5c_strEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:392,_ZNSs10_S_compareEjj
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:1941,_ZNKSs7compareERKSs
-FN:2238,_ZStltIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:2162,_ZSteqIcEN9__gnu_cxx11__enable_ifIXsrSt9__is_charIT_E7__valueEbE6__typeERKSbIS3_St11char_traitsIS3_ESaIS3_EESC_
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:392,0
-DA:394,0
-DA:401,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:686,0
-DA:687,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:1941,0
-DA:1943,0
-DA:1944,0
-DA:1945,0
-DA:1947,0
-DA:1948,0
-DA:1949,0
-DA:1950,0
-DA:2067,0
-DA:2069,0
-DA:2162,0
-DA:2165,0
-DA:2238,0
-DA:2239,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-BA:1948,0
-BA:1948,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-LF:70
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:257,0
-DA:258,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algo.h
-FN:5055,_ZSt9set_unionISt23_Rb_tree_const_iteratorISsES1_St15insert_iteratorISt3setISsSt4lessISsESaISsEEEET1_T_SA_T0_SB_S9_
-FN:5055,_ZSt9set_unionISt23_Rb_tree_const_iteratorIiES1_St15insert_iteratorISt3setIiSt4lessIiESaIiEEEET1_T_SA_T0_SB_S9_
-FN:5055,_ZSt9set_unionISt23_Rb_tree_const_iteratorIN3ept7debtags3TagEES4_St15insert_iteratorISt3setIS3_St4lessIS3_ESaIS3_EEEET1_T_SD_T0_SE_SC_
-DA:5055,21146
-DA:5074,42292
-DA:5076,0
-DA:5078,0
-DA:5079,0
-DA:5081,0
-DA:5083,0
-DA:5084,0
-DA:5088,0
-DA:5089,0
-DA:5090,0
-DA:5092,0
-DA:5095,21146
-BA:5074,1
-BA:5074,2
-BA:5074,0
-BA:5074,0
-BA:5074,1
-BA:5074,2
-BA:5074,0
-BA:5074,0
-BA:5074,0
-BA:5074,0
-BA:5074,0
-BA:5074,0
-BA:5074,0
-BA:5074,0
-BA:5074,0
-BA:5074,0
-BA:5074,0
-BA:5074,0
-BA:5076,0
-BA:5076,0
-BA:5076,0
-BA:5076,0
-BA:5076,0
-BA:5076,0
-BA:5081,0
-BA:5081,0
-BA:5081,0
-BA:5081,0
-BA:5081,0
-BA:5081,0
-LF:13
-LH:3
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:188,_ZSt3minIjERKT_S2_S2_
-FN:286,_ZNSt12__miter_baseIN6wibble9SingletonISsE14const_iteratorELb0EE3__bES3_
-FN:268,_ZNSt12__niter_baseIN6wibble9SingletonISsE14const_iteratorELb0EE3__bES3_
-FN:268,_ZNSt12__niter_baseISt15insert_iteratorISt3setISsSt4lessISsESaISsEEELb0EE3__bES6_
-FN:286,_ZNSt12__miter_baseISt23_Rb_tree_const_iteratorIiELb0EE3__bES1_
-FN:268,_ZNSt12__niter_baseISt23_Rb_tree_const_iteratorIiELb0EE3__bES1_
-FN:268,_ZNSt12__niter_baseISt15insert_iteratorISt3setIiSt4lessIiESaIiEEELb0EE3__bES6_
-FN:286,_ZNSt12__miter_baseISt23_Rb_tree_const_iteratorIN3ept7debtags3TagEELb0EE3__bES4_
-FN:286,_ZNSt12__miter_baseISt23_Rb_tree_const_iteratorISsELb0EE3__bES1_
-FN:268,_ZNSt12__niter_baseISt23_Rb_tree_const_iteratorIN3ept7debtags3TagEELb0EE3__bES4_
-FN:268,_ZNSt12__niter_baseISt15insert_iteratorISt3setIN3ept7debtags3TagESt4lessIS4_ESaIS4_EEELb0EE3__bES9_
-FN:268,_ZNSt12__niter_baseISt23_Rb_tree_const_iteratorISsELb0EE3__bES1_
-FN:309,_ZNSt11__copy_moveILb0ELb0ESt20forward_iterator_tagE8__copy_mIN6wibble9SingletonISsE14const_iteratorESt15insert_iteratorISt3setISsSt4lessISsESaISsEEEEET0_T_SF_SE_
-FN:385,_ZSt13__copy_move_aILb0EN6wibble9SingletonISsE14const_iteratorESt15insert_iteratorISt3setISsSt4lessISsESaISsEEEET1_T0_SC_SB_
-FN:430,_ZSt14__copy_move_a2ILb0EN6wibble9SingletonISsE14const_iteratorESt15insert_iteratorISt3setISsSt4lessISsESaISsEEEET1_T0_SC_SB_
-FN:456,_ZSt4copyIN6wibble9SingletonISsE14const_iteratorESt15insert_iteratorISt3setISsSt4lessISsESaISsEEEET0_T_SC_SB_
-FN:309,_ZNSt11__copy_moveILb0ELb0ESt26bidirectional_iterator_tagE8__copy_mISt23_Rb_tree_const_iteratorISsESt15insert_iteratorISt3setISsSt4lessISsESaISsEEEEET0_T_SD_SC_
-FN:385,_ZSt13__copy_move_aILb0ESt23_Rb_tree_const_iteratorISsESt15insert_iteratorISt3setISsSt4lessISsESaISsEEEET1_T0_SA_S9_
-FN:430,_ZSt14__copy_move_a2ILb0ESt23_Rb_tree_const_iteratorISsESt15insert_iteratorISt3setISsSt4lessISsESaISsEEEET1_T0_SA_S9_
-FN:456,_ZSt4copyISt23_Rb_tree_const_iteratorISsESt15insert_iteratorISt3setISsSt4lessISsESaISsEEEET0_T_SA_S9_
-FN:309,_ZNSt11__copy_moveILb0ELb0ESt26bidirectional_iterator_tagE8__copy_mISt23_Rb_tree_const_iteratorIiESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEET0_T_SD_SC_
-FN:385,_ZSt13__copy_move_aILb0ESt23_Rb_tree_const_iteratorIiESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEET1_T0_SA_S9_
-FN:430,_ZSt14__copy_move_a2ILb0ESt23_Rb_tree_const_iteratorIiESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEET1_T0_SA_S9_
-FN:456,_ZSt4copyISt23_Rb_tree_const_iteratorIiESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEET0_T_SA_S9_
-FN:309,_ZNSt11__copy_moveILb0ELb0ESt26bidirectional_iterator_tagE8__copy_mISt23_Rb_tree_const_iteratorIN3ept7debtags3TagEESt15insert_iteratorISt3setIS6_St4lessIS6_ESaIS6_EEEEET0_T_SG_SF_
-FN:385,_ZSt13__copy_move_aILb0ESt23_Rb_tree_const_iteratorIN3ept7debtags3TagEESt15insert_iteratorISt3setIS3_St4lessIS3_ESaIS3_EEEET1_T0_SD_SC_
-FN:430,_ZSt14__copy_move_a2ILb0ESt23_Rb_tree_const_iteratorIN3ept7debtags3TagEESt15insert_iteratorISt3setIS3_St4lessIS3_ESaIS3_EEEET1_T0_SD_SC_
-FN:456,_ZSt4copyISt23_Rb_tree_const_iteratorIN3ept7debtags3TagEESt15insert_iteratorISt3setIS3_St4lessIS3_ESaIS3_EEEET0_T_SD_SC_
-DA:188,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:268,84591
-DA:269,84591
-DA:286,84588
-DA:287,84588
-DA:309,42294
-DA:311,148024
-DA:312,105730
-DA:313,42294
-DA:385,42294
-DA:393,42294
-DA:396,42294
-DA:430,42294
-DA:435,42294
-DA:456,42294
-DA:466,42294
-BA:193,0
-BA:193,0
-BA:311,2
-BA:311,2
-BA:311,2
-BA:311,2
-BA:311,0
-BA:311,0
-BA:311,0
-BA:311,0
-LF:19
-LH:15
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_function.h
-FN:469,_ZNKSt9_IdentityIN3ept7debtags3TagEEclERKS2_
-FN:229,_ZNKSt4lessIN3ept7debtags3TagEEclERKS2_S5_
-FN:469,_ZNKSt9_IdentityIiEclERKi
-FN:229,_ZNKSt4lessIiEclERKiS2_
-FN:469,_ZNKSt9_IdentityISsEclERKSs
-FN:482,_ZNKSt10_Select1stISt4pairIKiN7tagcoll5PatchIiiEEEEclERKS5_
-FN:482,_ZNKSt10_Select1stISt4pairIKSsSt3setISsSt4lessISsESaISsEEEEclERKS7_
-FN:482,_ZNKSt10_Select1stISt4pairIKSsN7tagcoll5PatchISsSsEEEEclERKS5_
-FN:482,_ZNKSt10_Select1stISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEEEclERKSA_
-FN:482,_ZNKSt10_Select1stISt4pairIKiSt3setIiSt4lessIiESaIiEEEEclERKS7_
-FN:229,_ZNKSt4lessISsEclERKSsS2_
-DA:229,0
-DA:230,0
-DA:469,0
-DA:470,0
-DA:482,1894548
-DA:483,1894548
-LF:6
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:572,_ZNSt15insert_iteratorISt3setISsSt4lessISsESaISsEEEC1ERS4_St23_Rb_tree_const_iteratorISsE
-FN:645,_ZSt8inserterISt3setISsSt4lessISsESaISsEESt23_Rb_tree_const_iteratorISsEESt15insert_iteratorIT_ERS8_T0_
-FN:572,_ZNSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEC1ERS4_St23_Rb_tree_const_iteratorIiE
-FN:645,_ZSt8inserterISt3setIiSt4lessIiESaIiEESt23_Rb_tree_const_iteratorIiEESt15insert_iteratorIT_ERS8_T0_
-FN:618,_ZNSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEdeEv
-FN:623,_ZNSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEppEv
-FN:623,_ZNSt15insert_iteratorISt3setISsSt4lessISsESaISsEEEppEv
-FN:618,_ZNSt15insert_iteratorISt3setISsSt4lessISsESaISsEEEdeEv
-FN:572,_ZNSt15insert_iteratorISt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EEEC1ERS7_St23_Rb_tree_const_iteratorIS3_E
-FN:645,_ZSt8inserterISt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EESt23_Rb_tree_const_iteratorIS3_EESt15insert_iteratorIT_ERSB_T0_
-FN:618,_ZNSt15insert_iteratorISt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EEEdeEv
-FN:623,_ZNSt15insert_iteratorISt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EEEppEv
-FN:599,_ZNSt15insert_iteratorISt3setISsSt4lessISsESaISsEEEaSERKSs
-FN:599,_ZNSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEaSERKi
-FN:599,_ZNSt15insert_iteratorISt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EEEaSERKS3_
-DA:572,0
-DA:573,0
-DA:599,0
-DA:601,0
-DA:602,0
-DA:603,0
-DA:618,0
-DA:619,0
-DA:623,0
-DA:624,0
-DA:645,0
-DA:648,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:111,_ZNSt8iteratorISt20forward_iterator_tagKSsvPS1_RS1_EC2Ev
-FN:111,_ZNSt8iteratorISt20forward_iterator_tagKivPS1_RS1_EC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,0
-DA:166,0
-DA:167,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_map.h
-FN:389,_ZNKSt3mapIiN7tagcoll5PatchIiiEESt4lessIiESaISt4pairIKiS2_EEE4sizeEv
-FN:389,_ZNKSt3mapISsN7tagcoll5PatchISsSsEESt4lessISsESaISt4pairIKSsS2_EEE4sizeEv
-FN:389,_ZNKSt3mapIiSt3setIiSt4lessIiESaIiEES2_SaISt4pairIKiS4_EEE4sizeEv
-FN:389,_ZNKSt3mapISsSt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EES4_ISsESaISt4pairIKSsS7_EEE4sizeEv
-FN:389,_ZNKSt3mapISsSt3setISsSt4lessISsESaISsEES2_SaISt4pairIKSsS4_EEE4sizeEv
-FN:293,_ZNSt3mapIiN7tagcoll5PatchIiiEESt4lessIiESaISt4pairIKiS2_EEE3endEv
-FN:275,_ZNSt3mapIiN7tagcoll5PatchIiiEESt4lessIiESaISt4pairIKiS2_EEE5beginEv
-FN:293,_ZNSt3mapISsN7tagcoll5PatchISsSsEESt4lessISsESaISt4pairIKSsS2_EEE3endEv
-FN:275,_ZNSt3mapISsN7tagcoll5PatchISsSsEESt4lessISsESaISt4pairIKSsS2_EEE5beginEv
-FN:284,_ZNKSt3mapIiN7tagcoll5PatchIiiEESt4lessIiESaISt4pairIKiS2_EEE5beginEv
-FN:302,_ZNKSt3mapIiN7tagcoll5PatchIiiEESt4lessIiESaISt4pairIKiS2_EEE3endEv
-FN:293,_ZNSt3mapISsSt3setISsSt4lessISsESaISsEES2_SaISt4pairIKSsS4_EEE3endEv
-FN:284,_ZNKSt3mapISsSt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EES4_ISsESaISt4pairIKSsS7_EEE5beginEv
-FN:302,_ZNKSt3mapISsSt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EES4_ISsESaISt4pairIKSsS7_EEE3endEv
-FN:284,_ZNKSt3mapISsSt3setISsSt4lessISsESaISsEES2_SaISt4pairIKSsS4_EEE5beginEv
-FN:302,_ZNKSt3mapISsSt3setISsSt4lessISsESaISsEES2_SaISt4pairIKSsS4_EEE3endEv
-FN:284,_ZNKSt3mapISsN7tagcoll5PatchISsSsEESt4lessISsESaISt4pairIKSsS2_EEE5beginEv
-FN:302,_ZNKSt3mapISsN7tagcoll5PatchISsSsEESt4lessISsESaISt4pairIKSsS2_EEE3endEv
-FN:614,_ZNSt3mapIiN7tagcoll5PatchIiiEESt4lessIiESaISt4pairIKiS2_EEE4findERS6_
-FN:155,_ZNSt3mapISsSt3setISsSt4lessISsESaISsEES2_SaISt4pairIKSsS4_EEEC1Ev
-FN:155,_ZNSt3mapIiSt3setIiSt4lessIiESaIiEES2_SaISt4pairIKiS4_EEEC1Ev
-FN:284,_ZNKSt3mapIiSt3setIiSt4lessIiESaIiEES2_SaISt4pairIKiS4_EEE5beginEv
-FN:302,_ZNKSt3mapIiSt3setIiSt4lessIiESaIiEES2_SaISt4pairIKiS4_EEE3endEv
-FN:155,_ZNSt3mapISsSt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EES4_ISsESaISt4pairIKSsS7_EEEC1Ev
-FN:155,_ZNSt3mapIiN7tagcoll5PatchIiiEESt4lessIiESaISt4pairIKiS2_EEEC2Ev
-FN:155,_ZNSt3mapISsN7tagcoll5PatchISsSsEESt4lessISsESaISt4pairIKSsS2_EEEC2Ev
-FN:293,_ZNSt3mapIiSt3setIiSt4lessIiESaIiEES2_SaISt4pairIKiS4_EEE3endEv
-FN:293,_ZNSt3mapISsSt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EES4_ISsESaISt4pairIKSsS7_EEE3endEv
-FN:614,_ZNSt3mapIiSt3setIiSt4lessIiESaIiEES2_SaISt4pairIKiS4_EEE4findERS6_
-FN:92,_ZNSt3mapIiN7tagcoll5PatchIiiEESt4lessIiESaISt4pairIKiS2_EEED2Ev
-FN:92,_ZNSt3mapISsN7tagcoll5PatchISsSsEESt4lessISsESaISt4pairIKSsS2_EEED2Ev
-FN:92,_ZNSt3mapISsSt3setISsSt4lessISsESaISsEES2_SaISt4pairIKSsS4_EEED1Ev
-FN:92,_ZNSt3mapIiSt3setIiSt4lessIiESaIiEES2_SaISt4pairIKiS4_EEED1Ev
-FN:92,_ZNSt3mapISsSt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EES4_ISsESaISt4pairIKSsS7_EEED1Ev
-FN:614,_ZNSt3mapISsN7tagcoll5PatchISsSsEESt4lessISsESaISt4pairIKSsS2_EEE4findERS6_
-FN:614,_ZNSt3mapISsSt3setISsSt4lessISsESaISsEES2_SaISt4pairIKSsS4_EEE4findERS6_
-FN:614,_ZNSt3mapISsSt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EES4_ISsESaISt4pairIKSsS7_EEE4findERSA_
-FN:629,_ZNKSt3mapISsSt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EES4_ISsESaISt4pairIKSsS7_EEE4findERSA_
-FN:629,_ZNKSt3mapISsSt3setISsSt4lessISsESaISsEES2_SaISt4pairIKSsS4_EEE4findERS6_
-FN:468,_ZNSt3mapISsN7tagcoll5PatchISsSsEESt4lessISsESaISt4pairIKSsS2_EEE6insertERKS7_
-FN:468,_ZNSt3mapIiN7tagcoll5PatchIiiEESt4lessIiESaISt4pairIKiS2_EEE6insertERKS7_
-FN:468,_ZNSt3mapISsSt3setISsSt4lessISsESaISsEES2_SaISt4pairIKSsS4_EEE6insertERKS7_
-FN:468,_ZNSt3mapIiSt3setIiSt4lessIiESaIiEES2_SaISt4pairIKiS4_EEE6insertERKS7_
-FN:468,_ZNSt3mapISsSt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EES4_ISsESaISt4pairIKSsS7_EEE6insertERKSB_
-DA:92,8
-DA:155,8
-DA:156,8
-DA:275,6
-DA:276,6
-DA:284,9
-DA:285,9
-DA:293,63443
-DA:294,63443
-DA:302,42308
-DA:303,42308
-DA:389,4
-DA:390,4
-DA:468,21151
-DA:469,21151
-DA:614,42297
-DA:615,42297
-DA:629,2
-DA:630,2
-LF:19
-LH:19
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_pair.h
-FN:88,_ZNSt4pairISt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEbEC1ERKS4_RKb
-FN:88,_ZNSt4pairISt23_Rb_tree_const_iteratorIiEbEC1ERKS1_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIN3ept7debtags3TagEEbEC1ERKS4_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIiEbEC1ERKS1_RKb
-FN:88,_ZNSt4pairISt23_Rb_tree_const_iteratorISsEbEC1ERKS1_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorISsEbEC1ERKS1_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIS_IKiN7tagcoll5PatchIiiEEEEbEC1ERKS6_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIS_IKSsSt3setISsSt4lessISsESaISsEEEEbEC1ERKS8_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIS_IKSsN7tagcoll5PatchISsSsEEEEbEC1ERKS6_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIiES1_EC1ERKS1_S4_
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIS_IKiSt3setIiSt4lessIiESaIiEEEEbEC1ERKS8_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIS_IKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEEEbEC1ERKSB_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorISsES1_EC1ERKS1_S4_
-FN:73,_ZNSt4pairIKiN7tagcoll5PatchIiiEEED1Ev
-FN:73,_ZNSt4pairIiN7tagcoll5PatchIiiEEED1Ev
-FN:73,_ZNSt4pairIKiSt3setIiSt4lessIiESaIiEEED1Ev
-FN:73,_ZNSt4pairIiSt3setIiSt4lessIiESaIiEEED1Ev
-FN:73,_ZNSt4pairISt3setIiSt4lessIiESaIiEES4_ED1Ev
-FN:73,_ZNSt4pairIN6wibble9SingletonIiEESt3setIiSt4lessIiESaIiEEED1Ev
-FN:73,_ZNSt4pairIKSsN7tagcoll5PatchISsSsEEED1Ev
-FN:73,_ZNSt4pairISsN7tagcoll5PatchISsSsEEED1Ev
-FN:73,_ZNSt4pairIKSsSt3setISsSt4lessISsESaISsEEED1Ev
-FN:73,_ZNSt4pairISsSt3setISsSt4lessISsESaISsEEED1Ev
-FN:73,_ZNSt4pairIN6wibble9SingletonISsEESt3setISsSt4lessISsESaISsEEED1Ev
-FN:73,_ZNSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS4_ESaIS4_EEED1Ev
-FN:73,_ZNSt4pairISsSt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EEED1Ev
-FN:73,_ZNSt4pairISt3setISsSt4lessISsESaISsEES0_IN3ept7debtags3TagES1_IS7_ESaIS7_EEED1Ev
-FN:73,_ZNSt4pairIN6wibble9SingletonISsEESt3setIN3ept7debtags3TagESt4lessIS6_ESaIS6_EEED1Ev
-FN:88,_ZNSt4pairISsN7tagcoll5PatchISsSsEEEC1ERKSsRKS2_
-FN:218,_ZSt9make_pairISsN7tagcoll5PatchISsSsEEESt4pairIT_T0_ES4_S5_
-FN:104,_ZNSt4pairIKSsN7tagcoll5PatchISsSsEEEC1ISsS3_EERKS_IT_T0_E
-FN:73,_ZNSt4pairIKSsN7tagcoll5PatchISsSsEEEC1ERKS4_
-FN:88,_ZNSt4pairISsSt3setISsSt4lessISsESaISsEEEC1ERKSsRKS4_
-FN:218,_ZSt9make_pairISsSt3setISsSt4lessISsESaISsEEESt4pairIT_T0_ES6_S7_
-FN:104,_ZNSt4pairIKSsSt3setISsSt4lessISsESaISsEEEC1ISsS5_EERKS_IT_T0_E
-FN:73,_ZNSt4pairIKSsSt3setISsSt4lessISsESaISsEEEC1ERKS6_
-FN:88,_ZNSt4pairIN6wibble9SingletonISsEESt3setISsSt4lessISsESaISsEEEC1ERKS2_RKS7_
-FN:218,_ZSt9make_pairIN6wibble9SingletonISsEESt3setISsSt4lessISsESaISsEEESt4pairIT_T0_ES9_SA_
-FN:88,_ZNSt4pairIiN7tagcoll5PatchIiiEEEC1ERKiRKS2_
-FN:218,_ZSt9make_pairIiN7tagcoll5PatchIiiEEESt4pairIT_T0_ES4_S5_
-FN:104,_ZNSt4pairIKiN7tagcoll5PatchIiiEEEC1IiS3_EERKS_IT_T0_E
-FN:73,_ZNSt4pairIKiN7tagcoll5PatchIiiEEEC1ERKS4_
-FN:88,_ZNSt4pairISt3setIiSt4lessIiESaIiEES4_EC1ERKS4_S7_
-FN:218,_ZSt9make_pairISt3setIiSt4lessIiESaIiEES4_ESt4pairIT_T0_ES6_S7_
-FN:88,_ZNSt4pairIiSt3setIiSt4lessIiESaIiEEEC1ERKiRKS4_
-FN:218,_ZSt9make_pairIiSt3setIiSt4lessIiESaIiEEESt4pairIT_T0_ES6_S7_
-FN:104,_ZNSt4pairIKiSt3setIiSt4lessIiESaIiEEEC1IiS5_EERKS_IT_T0_E
-FN:73,_ZNSt4pairIKiSt3setIiSt4lessIiESaIiEEEC1ERKS6_
-FN:88,_ZNSt4pairIN6wibble9SingletonIiEESt3setIiSt4lessIiESaIiEEEC1ERKS2_RKS7_
-FN:218,_ZSt9make_pairIN6wibble9SingletonIiEESt3setIiSt4lessIiESaIiEEESt4pairIT_T0_ES9_SA_
-FN:88,_ZNSt4pairISt3setISsSt4lessISsESaISsEES0_IN3ept7debtags3TagES1_IS7_ESaIS7_EEEC1ERKS4_RKSA_
-FN:218,_ZSt9make_pairISt3setISsSt4lessISsESaISsEES0_IN3ept7debtags3TagES1_IS7_ESaIS7_EEESt4pairIT_T0_ESC_SD_
-FN:88,_ZNSt4pairISsSt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EEEC1ERKSsRKS7_
-FN:218,_ZSt9make_pairISsSt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EEESt4pairIT_T0_ES9_SA_
-FN:104,_ZNSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS4_ESaIS4_EEEC1ISsS8_EERKS_IT_T0_E
-FN:73,_ZNSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS4_ESaIS4_EEEC1ERKS9_
-FN:88,_ZNSt4pairIN6wibble9SingletonISsEESt3setIN3ept7debtags3TagESt4lessIS6_ESaIS6_EEEC1ERKS2_RKSA_
-FN:218,_ZSt9make_pairIN6wibble9SingletonISsEESt3setIN3ept7debtags3TagESt4lessIS6_ESaIS6_EEESt4pairIT_T0_ESC_SD_
-DA:73,148030
-DA:88,105731
-DA:89,105731
-DA:104,21151
-DA:106,21151
-DA:218,84577
-DA:219,84577
-LF:7
-LH:7
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_set.h
-FN:336,_ZNKSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EE4sizeEv
-FN:336,_ZNKSt3setISsSt4lessISsESaISsEE4sizeEv
-FN:336,_ZNKSt3setIiSt4lessIiESaIiEE4sizeEv
-FN:261,_ZNKSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EE5beginEv
-FN:270,_ZNKSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EE3endEv
-FN:331,_ZNKSt3setIiSt4lessIiESaIiEE5emptyEv
-FN:270,_ZNKSt3setISsSt4lessISsESaISsEE3endEv
-FN:261,_ZNKSt3setISsSt4lessISsESaISsEE5beginEv
-FN:331,_ZNKSt3setISsSt4lessISsESaISsEE5emptyEv
-FN:503,_ZNSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EE4findERKS2_
-FN:261,_ZNKSt3setIiSt4lessIiESaIiEE5beginEv
-FN:270,_ZNKSt3setIiSt4lessIiESaIiEE3endEv
-FN:331,_ZNKSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EE5emptyEv
-FN:141,_ZNSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EEC1Ev
-FN:141,_ZNSt3setIiSt4lessIiESaIiEEC1Ev
-FN:141,_ZNSt3setISsSt4lessISsESaISsEEC1Ev
-FN:93,_ZNSt3setIiSt4lessIiESaIiEED1Ev
-FN:93,_ZNSt3setISsSt4lessISsESaISsEED1Ev
-FN:93,_ZNSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EED1Ev
-FN:503,_ZNSt3setISsSt4lessISsESaISsEE4findERKSs
-FN:193,_ZNSt3setISsSt4lessISsESaISsEEC1ERKS3_
-FN:216,_ZNSt3setISsSt4lessISsESaISsEEaSERKS3_
-FN:193,_ZNSt3setIiSt4lessIiESaIiEEC1ERKS3_
-FN:216,_ZNSt3setIiSt4lessIiESaIiEEaSERKS3_
-FN:193,_ZNSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EEC1ERKS6_
-FN:216,_ZNSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EEaSERKS6_
-FN:378,_ZNSt3setISsSt4lessISsESaISsEE6insertERKSs
-FN:378,_ZNSt3setIiSt4lessIiESaIiEE6insertERKi
-FN:378,_ZNSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EE6insertERKS2_
-FN:405,_ZNSt3setISsSt4lessISsESaISsEE6insertESt23_Rb_tree_const_iteratorISsERKSs
-FN:405,_ZNSt3setIiSt4lessIiESaIiEE6insertESt23_Rb_tree_const_iteratorIiERKi
-FN:405,_ZNSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EE6insertESt23_Rb_tree_const_iteratorIS2_ERKS2_
-FN:431,_ZNSt3setISsSt4lessISsESaISsEE5eraseESt23_Rb_tree_const_iteratorISsE
-FN:431,_ZNSt3setIiSt4lessIiESaIiEE5eraseESt23_Rb_tree_const_iteratorIiE
-FN:446,_ZNSt3setIiSt4lessIiESaIiEE5eraseERKi
-FN:446,_ZNSt3setISsSt4lessISsESaISsEE5eraseERKSs
-DA:93,0
-DA:141,0
-DA:142,0
-DA:193,0
-DA:194,0
-DA:216,0
-DA:218,0
-DA:219,0
-DA:261,0
-DA:262,0
-DA:270,0
-DA:271,0
-DA:331,0
-DA:332,0
-DA:336,0
-DA:337,0
-DA:378,0
-DA:381,0
-DA:382,0
-DA:405,0
-DA:406,0
-DA:431,0
-DA:432,0
-DA:446,3
-DA:447,3
-DA:503,9
-DA:504,9
-LF:27
-LH:4
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_tree.h
-FN:103,_ZNSt18_Rb_tree_node_base10_S_minimumEPS_
-FN:117,_ZNSt18_Rb_tree_node_base10_S_maximumEPS_
-FN:289,_ZNKSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEneERKS3_
-FN:251,_ZNKSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEptEv
-FN:289,_ZNKSt23_Rb_tree_const_iteratorISsEneERKS0_
-FN:176,_ZNKSt17_Rb_tree_iteratorISt4pairIKiN7tagcoll5PatchIiiEEEEptEv
-FN:176,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsN7tagcoll5PatchISsSsEEEEptEv
-FN:247,_ZNKSt23_Rb_tree_const_iteratorISsEdeEv
-FN:452,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_M_beginEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEC1ERKSt17_Rb_tree_iteratorIS2_E
-FN:452,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_M_beginEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorIiEC1ERKSt17_Rb_tree_iteratorIiE
-FN:289,_ZNKSt23_Rb_tree_const_iteratorIiEneERKS0_
-FN:247,_ZNKSt23_Rb_tree_const_iteratorIiEdeEv
-FN:251,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKiN7tagcoll5PatchIiiEEEEptEv
-FN:289,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKiN7tagcoll5PatchIiiEEEEneERKS6_
-FN:452,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE8_M_beginEv
-FN:452,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorISt4pairIKiN7tagcoll5PatchIiiEEEEeqERKS6_
-FN:452,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE8_M_beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsSt3setISsSt4lessISsESaISsEEEEeqERKS8_
-FN:176,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsSt3setISsSt4lessISsESaISsEEEEptEv
-FN:452,_ZNSt8_Rb_treeIiSt4pairIKiSt3setIiSt4lessIiESaIiEEESt10_Select1stIS7_ES4_SaIS7_EE8_M_beginEv
-FN:289,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKSsSt3setISsSt4lessISsESaISsEEEEneERKS8_
-FN:251,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKSsSt3setISsSt4lessISsESaISsEEEEptEv
-FN:452,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE8_M_beginEv
-FN:289,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKiSt3setIiSt4lessIiESaIiEEEEneERKS8_
-FN:251,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKiSt3setIiSt4lessIiESaIiEEEEptEv
-FN:285,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEEEeqERKSB_
-FN:251,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEEEptEv
-FN:641,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE4sizeEv
-FN:289,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEEEneERKSB_
-FN:285,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKSsSt3setISsSt4lessISsESaISsEEEEeqERKS8_
-FN:641,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE4sizeEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorISsEC1ERKSt17_Rb_tree_iteratorISsE
-FN:452,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE8_M_beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsN7tagcoll5PatchISsSsEEEEeqERKS6_
-FN:289,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKSsN7tagcoll5PatchISsSsEEEEneERKS6_
-FN:251,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKSsN7tagcoll5PatchISsSsEEEEptEv
-FN:641,_ZNKSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE4sizeEv
-FN:641,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE4sizeEv
-FN:641,_ZNKSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE4sizeEv
-FN:398,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13_Rb_tree_implIS6_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:463,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE6_M_endEv
-FN:168,_ZNSt17_Rb_tree_iteratorIN3ept7debtags3TagEEC1EPSt13_Rb_tree_nodeIS2_E
-FN:596,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE5beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorIN3ept7debtags3TagEEeqERKS3_
-FN:347,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE21_M_get_Node_allocatorEv
-FN:432,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE7_M_rootEv
-FN:456,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_M_beginEv
-FN:428,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE7_M_rootEv
-FN:503,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE10_S_minimumEPSt18_Rb_tree_node_base
-FN:436,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE11_M_leftmostEv
-FN:511,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE10_S_maximumEPSt18_Rb_tree_node_base
-FN:444,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE12_M_rightmostEv
-FN:398,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_Rb_tree_implIS3_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE7_S_leftEPSt18_Rb_tree_node_base
-FN:347,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE21_M_get_Node_allocatorEv
-FN:432,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE7_M_rootEv
-FN:456,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_M_beginEv
-FN:463,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE6_M_endEv
-FN:428,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE7_M_rootEv
-FN:503,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE10_S_minimumEPSt18_Rb_tree_node_base
-FN:436,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE11_M_leftmostEv
-FN:511,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE10_S_maximumEPSt18_Rb_tree_node_base
-FN:444,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE12_M_rightmostEv
-FN:168,_ZNSt17_Rb_tree_iteratorIiEC1EPSt13_Rb_tree_nodeIiE
-FN:596,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorIiEeqERKS0_
-FN:398,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE13_Rb_tree_implIS9_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:398,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_S_leftEPSt18_Rb_tree_node_base
-FN:347,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE21_M_get_Node_allocatorEv
-FN:432,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_M_rootEv
-FN:456,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_beginEv
-FN:463,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_M_endEv
-FN:428,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_M_rootEv
-FN:503,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE10_S_minimumEPSt18_Rb_tree_node_base
-FN:436,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11_M_leftmostEv
-FN:511,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE10_S_maximumEPSt18_Rb_tree_node_base
-FN:444,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE12_M_rightmostEv
-FN:240,_ZNSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEC1EPKSt13_Rb_tree_nodeIS2_E
-FN:603,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE5beginEv
-FN:614,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE3endEv
-FN:637,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5emptyEv
-FN:398,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE13_Rb_tree_implIS4_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:398,_ZNSt8_Rb_treeIiSt4pairIKiSt3setIiSt4lessIiESaIiEEESt10_Select1stIS7_ES4_SaIS7_EE13_Rb_tree_implIS4_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeIiSt4pairIKiSt3setIiSt4lessIiESaIiEEESt10_Select1stIS7_ES4_SaIS7_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeIiSt4pairIKiSt3setIiSt4lessIiESaIiEEESt10_Select1stIS7_ES4_SaIS7_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:641,_ZNKSt8_Rb_treeIiSt4pairIKiSt3setIiSt4lessIiESaIiEEESt10_Select1stIS7_ES4_SaIS7_EE4sizeEv
-FN:398,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE13_Rb_tree_implISD_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:641,_ZNKSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE4sizeEv
-FN:610,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE3endEv
-FN:641,_ZNKSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE4sizeEv
-FN:210,_ZNKSt17_Rb_tree_iteratorISsEeqERKS0_
-FN:240,_ZNSt23_Rb_tree_const_iteratorISsEC1EPKSt13_Rb_tree_nodeISsE
-FN:614,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE3endEv
-FN:603,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5beginEv
-FN:398,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE13_Rb_tree_implIS9_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:637,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5emptyEv
-FN:168,_ZNSt17_Rb_tree_iteratorISt4pairIKiN7tagcoll5PatchIiiEEEEC1EPSt13_Rb_tree_nodeIS5_E
-FN:610,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE3endEv
-FN:596,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE5beginEv
-FN:168,_ZNSt17_Rb_tree_iteratorISt4pairIKSsN7tagcoll5PatchISsSsEEEEC1EPSt13_Rb_tree_nodeIS5_E
-FN:610,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE3endEv
-FN:596,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE5beginEv
-FN:415,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13_Rb_tree_implIS6_Lb0EE13_M_initializeEv
-FN:471,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_S_valueEPKSt13_Rb_tree_nodeIS2_E
-FN:475,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE6_S_keyEPKSt13_Rb_tree_nodeIS2_E
-FN:954,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE14_M_lower_boundEPSt13_Rb_tree_nodeIS2_ESB_RKS2_
-FN:495,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE6_S_keyEPKSt18_Rb_tree_node_base
-FN:1390,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE4findERKS2_
-FN:491,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_S_rightEPKSt18_Rb_tree_node_base
-FN:483,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE7_S_leftEPKSt18_Rb_tree_node_base
-FN:415,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_Rb_tree_implIS3_Lb0EE13_M_initializeEv
-FN:491,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_S_rightEPKSt18_Rb_tree_node_base
-FN:483,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE7_S_leftEPKSt18_Rb_tree_node_base
-FN:471,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_S_valueEPKSt13_Rb_tree_nodeIiE
-FN:475,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE6_S_keyEPKSt13_Rb_tree_nodeIiE
-FN:495,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE6_S_keyEPKSt18_Rb_tree_node_base
-FN:240,_ZNSt23_Rb_tree_const_iteratorIiEC1EPKSt13_Rb_tree_nodeIiE
-FN:603,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5beginEv
-FN:614,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE3endEv
-FN:240,_ZNSt23_Rb_tree_const_iteratorISt4pairIKiN7tagcoll5PatchIiiEEEEC1EPKSt13_Rb_tree_nodeIS5_E
-FN:603,_ZNKSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE5beginEv
-FN:614,_ZNKSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE3endEv
-FN:168,_ZNSt17_Rb_tree_iteratorISsEC1EPSt13_Rb_tree_nodeISsE
-FN:610,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE3endEv
-FN:596,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5beginEv
-FN:415,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EE13_M_initializeEv
-FN:491,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_rightEPKSt18_Rb_tree_node_base
-FN:483,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_S_leftEPKSt18_Rb_tree_node_base
-FN:463,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE6_M_endEv
-FN:415,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE13_Rb_tree_implIS4_Lb0EE13_M_initializeEv
-FN:463,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE6_M_endEv
-FN:168,_ZNSt17_Rb_tree_iteratorISt4pairIKSsSt3setISsSt4lessISsESaISsEEEEC1EPSt13_Rb_tree_nodeIS7_E
-FN:610,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE3endEv
-FN:596,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE5beginEv
-FN:415,_ZNSt8_Rb_treeIiSt4pairIKiSt3setIiSt4lessIiESaIiEEESt10_Select1stIS7_ES4_SaIS7_EE13_Rb_tree_implIS4_Lb0EE13_M_initializeEv
-FN:415,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE13_Rb_tree_implISD_Lb0EE13_M_initializeEv
-FN:637,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE5emptyEv
-FN:247,_ZNKSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEdeEv
-FN:456,_ZNKSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE8_M_beginEv
-FN:467,_ZNKSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE6_M_endEv
-FN:240,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEEEC1EPKSt13_Rb_tree_nodeISA_E
-FN:603,_ZNKSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE5beginEv
-FN:614,_ZNKSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE3endEv
-FN:456,_ZNKSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE8_M_beginEv
-FN:467,_ZNKSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE6_M_endEv
-FN:240,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsSt3setISsSt4lessISsESaISsEEEEC1EPKSt13_Rb_tree_nodeIS7_E
-FN:603,_ZNKSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE5beginEv
-FN:614,_ZNKSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE3endEv
-FN:495,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_S_keyEPKSt18_Rb_tree_node_base
-FN:463,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE6_M_endEv
-FN:240,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsN7tagcoll5PatchISsSsEEEEC1EPKSt13_Rb_tree_nodeIS5_E
-FN:603,_ZNKSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE5beginEv
-FN:614,_ZNKSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE3endEv
-FN:403,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13_Rb_tree_implIS6_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EEC1Ev
-FN:408,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13_Rb_tree_implIS6_Lb0EEC1ERKS6_RKSaISt13_Rb_tree_nodeIS2_EE
-FN:403,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_Rb_tree_implIS3_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEEC1Ev
-FN:408,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_Rb_tree_implIS3_Lb0EEC1ERKS3_RKSaISt13_Rb_tree_nodeIiEE
-FN:347,_ZNKSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE21_M_get_Node_allocatorEv
-FN:471,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_valueEPKSt13_Rb_tree_nodeISsE
-FN:475,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_S_keyEPKSt13_Rb_tree_nodeISsE
-FN:408,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EEC1ERKS3_RKSaISt13_Rb_tree_nodeISsEE
-FN:415,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE13_Rb_tree_implIS9_Lb0EE13_M_initializeEv
-FN:495,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE6_S_keyEPKSt18_Rb_tree_node_base
-FN:471,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE8_S_valueEPKSt13_Rb_tree_nodeIS5_E
-FN:475,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE6_S_keyEPKSt13_Rb_tree_nodeIS5_E
-FN:954,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE14_M_lower_boundEPSt13_Rb_tree_nodeIS5_ESE_RS1_
-FN:1390,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE4findERS1_
-FN:351,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13get_allocatorEv
-FN:403,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE13_Rb_tree_implIS4_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EEC1Ev
-FN:347,_ZNKSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE21_M_get_Node_allocatorEv
-FN:495,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE6_S_keyEPKSt18_Rb_tree_node_base
-FN:471,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE8_S_valueEPKSt13_Rb_tree_nodeIS7_E
-FN:475,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE6_S_keyEPKSt13_Rb_tree_nodeIS7_E
-FN:403,_ZNSt8_Rb_treeIiSt4pairIKiSt3setIiSt4lessIiESaIiEEESt10_Select1stIS7_ES4_SaIS7_EE13_Rb_tree_implIS4_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeIiSt4pairIKiSt3setIiSt4lessIiESaIiEEESt10_Select1stIS7_ES4_SaIS7_EEC1Ev
-FN:347,_ZNKSt8_Rb_treeIiSt4pairIKiSt3setIiSt4lessIiESaIiEEESt10_Select1stIS7_ES4_SaIS7_EE21_M_get_Node_allocatorEv
-FN:210,_ZNKSt17_Rb_tree_iteratorISt4pairIKiSt3setIiSt4lessIiESaIiEEEEeqERKS8_
-FN:176,_ZNKSt17_Rb_tree_iteratorISt4pairIKiSt3setIiSt4lessIiESaIiEEEEptEv
-FN:240,_ZNSt23_Rb_tree_const_iteratorISt4pairIKiSt3setIiSt4lessIiESaIiEEEEC1EPKSt13_Rb_tree_nodeIS7_E
-FN:603,_ZNKSt8_Rb_treeIiSt4pairIKiSt3setIiSt4lessIiESaIiEEESt10_Select1stIS7_ES4_SaIS7_EE5beginEv
-FN:614,_ZNKSt8_Rb_treeIiSt4pairIKiSt3setIiSt4lessIiESaIiEEESt10_Select1stIS7_ES4_SaIS7_EE3endEv
-FN:403,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE13_Rb_tree_implISD_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EEC1Ev
-FN:347,_ZNKSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE21_M_get_Node_allocatorEv
-FN:210,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEEEeqERKSB_
-FN:176,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEEEptEv
-FN:483,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE7_S_leftEPKSt18_Rb_tree_node_base
-FN:491,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE8_S_rightEPKSt18_Rb_tree_node_base
-FN:495,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE6_S_keyEPKSt18_Rb_tree_node_base
-FN:483,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE7_S_leftEPKSt18_Rb_tree_node_base
-FN:491,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE8_S_rightEPKSt18_Rb_tree_node_base
-FN:415,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE13_Rb_tree_implIS9_Lb0EE13_M_initializeEv
-FN:347,_ZNKSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE21_M_get_Node_allocatorEv
-FN:495,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE6_S_keyEPKSt18_Rb_tree_node_base
-FN:471,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE8_S_valueEPKSt13_Rb_tree_nodeIS5_E
-FN:475,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE6_S_keyEPKSt13_Rb_tree_nodeIS5_E
-FN:351,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13get_allocatorEv
-FN:351,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13get_allocatorEv
-FN:351,_ZNKSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE13get_allocatorEv
-FN:403,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEEC1Ev
-FN:403,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE13_Rb_tree_implIS9_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EEC1Ev
-FN:954,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE14_M_lower_boundEPSt13_Rb_tree_nodeIiES8_RKi
-FN:986,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE14_M_upper_boundEPSt13_Rb_tree_nodeIiES8_RKi
-FN:1019,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE11equal_rangeERKi
-FN:610,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE3endEv
-FN:214,_ZNKSt17_Rb_tree_iteratorIiEneERKS0_
-FN:351,_ZNKSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE13get_allocatorEv
-FN:351,_ZNKSt8_Rb_treeIiSt4pairIKiSt3setIiSt4lessIiESaIiEEESt10_Select1stIS7_ES4_SaIS7_EE13get_allocatorEv
-FN:351,_ZNKSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE13get_allocatorEv
-FN:471,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE8_S_valueEPKSt13_Rb_tree_nodeISA_E
-FN:475,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE6_S_keyEPKSt13_Rb_tree_nodeISA_E
-FN:403,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE13_Rb_tree_implIS9_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EEC1Ev
-FN:351,_ZNKSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE13get_allocatorEv
-FN:463,_ZNSt8_Rb_treeIiSt4pairIKiSt3setIiSt4lessIiESaIiEEESt10_Select1stIS7_ES4_SaIS7_EE6_M_endEv
-FN:168,_ZNSt17_Rb_tree_iteratorISt4pairIKiSt3setIiSt4lessIiESaIiEEEEC1EPSt13_Rb_tree_nodeIS7_E
-FN:610,_ZNSt8_Rb_treeIiSt4pairIKiSt3setIiSt4lessIiESaIiEEESt10_Select1stIS7_ES4_SaIS7_EE3endEv
-FN:596,_ZNSt8_Rb_treeIiSt4pairIKiSt3setIiSt4lessIiESaIiEEESt10_Select1stIS7_ES4_SaIS7_EE5beginEv
-FN:463,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE6_M_endEv
-FN:168,_ZNSt17_Rb_tree_iteratorISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEEEC1EPSt13_Rb_tree_nodeISA_E
-FN:610,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE3endEv
-FN:596,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE5beginEv
-FN:495,_ZNSt8_Rb_treeIiSt4pairIKiSt3setIiSt4lessIiESaIiEEESt10_Select1stIS7_ES4_SaIS7_EE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeIiSt4pairIKiSt3setIiSt4lessIiESaIiEEESt10_Select1stIS7_ES4_SaIS7_EE6_S_keyEPKSt18_Rb_tree_node_base
-FN:471,_ZNSt8_Rb_treeIiSt4pairIKiSt3setIiSt4lessIiESaIiEEESt10_Select1stIS7_ES4_SaIS7_EE8_S_valueEPKSt13_Rb_tree_nodeIS7_E
-FN:475,_ZNSt8_Rb_treeIiSt4pairIKiSt3setIiSt4lessIiESaIiEEESt10_Select1stIS7_ES4_SaIS7_EE6_S_keyEPKSt13_Rb_tree_nodeIS7_E
-FN:954,_ZNSt8_Rb_treeIiSt4pairIKiSt3setIiSt4lessIiESaIiEEESt10_Select1stIS7_ES4_SaIS7_EE14_M_lower_boundEPSt13_Rb_tree_nodeIS7_ESE_RS1_
-FN:1390,_ZNSt8_Rb_treeIiSt4pairIKiSt3setIiSt4lessIiESaIiEEESt10_Select1stIS7_ES4_SaIS7_EE4findERS1_
-FN:214,_ZNKSt17_Rb_tree_iteratorISsEneERKS0_
-FN:360,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE11_M_put_nodeEPSt13_Rb_tree_nodeIiE
-FN:388,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE15_M_destroy_nodeEPSt13_Rb_tree_nodeIiE
-FN:936,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_M_eraseEPSt13_Rb_tree_nodeIiE
-FN:584,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEED1Ev
-FN:695,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5clearEv
-FN:360,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS5_E
-FN:388,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS5_E
-FN:936,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE8_M_eraseEPSt13_Rb_tree_nodeIS5_E
-FN:584,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EED1Ev
-FN:360,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11_M_put_nodeEPSt13_Rb_tree_nodeISsE
-FN:388,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE15_M_destroy_nodeEPSt13_Rb_tree_nodeISsE
-FN:936,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_eraseEPSt13_Rb_tree_nodeISsE
-FN:584,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEED1Ev
-FN:695,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5clearEv
-FN:360,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS5_E
-FN:388,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS5_E
-FN:936,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE8_M_eraseEPSt13_Rb_tree_nodeIS5_E
-FN:584,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EED1Ev
-FN:360,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS7_E
-FN:388,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS7_E
-FN:936,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE8_M_eraseEPSt13_Rb_tree_nodeIS7_E
-FN:584,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EED1Ev
-FN:360,_ZNSt8_Rb_treeIiSt4pairIKiSt3setIiSt4lessIiESaIiEEESt10_Select1stIS7_ES4_SaIS7_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS7_E
-FN:388,_ZNSt8_Rb_treeIiSt4pairIKiSt3setIiSt4lessIiESaIiEEESt10_Select1stIS7_ES4_SaIS7_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS7_E
-FN:936,_ZNSt8_Rb_treeIiSt4pairIKiSt3setIiSt4lessIiESaIiEEESt10_Select1stIS7_ES4_SaIS7_EE8_M_eraseEPSt13_Rb_tree_nodeIS7_E
-FN:584,_ZNSt8_Rb_treeIiSt4pairIKiSt3setIiSt4lessIiESaIiEEESt10_Select1stIS7_ES4_SaIS7_EED1Ev
-FN:360,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS2_E
-FN:388,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS2_E
-FN:936,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_M_eraseEPSt13_Rb_tree_nodeIS2_E
-FN:695,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE5clearEv
-FN:584,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EED1Ev
-FN:360,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE11_M_put_nodeEPSt13_Rb_tree_nodeISA_E
-FN:388,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeISA_E
-FN:936,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE8_M_eraseEPSt13_Rb_tree_nodeISA_E
-FN:584,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EED1Ev
-FN:270,_ZNSt23_Rb_tree_const_iteratorISsEmmEv
-FN:270,_ZNSt23_Rb_tree_const_iteratorIiEmmEv
-FN:270,_ZNSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEmmEv
-FN:954,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE14_M_lower_boundEPSt13_Rb_tree_nodeIS5_ESE_RS1_
-FN:1390,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE4findERS1_
-FN:986,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE14_M_upper_boundEPSt13_Rb_tree_nodeISsES8_RKSs
-FN:954,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE14_M_lower_boundEPSt13_Rb_tree_nodeISsES8_RKSs
-FN:1019,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11equal_rangeERKSs
-FN:954,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE14_M_lower_boundEPSt13_Rb_tree_nodeIS7_ESE_RS1_
-FN:1390,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE4findERS1_
-FN:954,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE14_M_lower_boundEPSt13_Rb_tree_nodeISA_ESI_RS1_
-FN:1390,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE4findERS1_
-FN:970,_ZNKSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE14_M_lower_boundEPKSt13_Rb_tree_nodeISA_ESJ_RS1_
-FN:1403,_ZNKSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE4findERS1_
-FN:970,_ZNKSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE14_M_lower_boundEPKSt13_Rb_tree_nodeIS7_ESF_RS1_
-FN:1403,_ZNKSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE4findERS1_
-FN:1390,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE4findERKSs
-FN:356,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE14_M_create_nodeERKSs
-FN:846,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE10_M_insert_EPKSt18_Rb_tree_node_baseS8_RKSs
-FN:378,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_M_clone_nodeEPKSt13_Rb_tree_nodeISsE
-FN:900,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_M_copyEPKSt13_Rb_tree_nodeISsEPS7_
-FN:568,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEEC1ERKS5_
-FN:824,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEEaSERKS5_
-FN:356,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE14_M_create_nodeERKS5_
-FN:846,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE10_M_insert_EPKSt18_Rb_tree_node_baseSE_RKS5_
-FN:356,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE14_M_create_nodeERKi
-FN:846,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE10_M_insert_EPKSt18_Rb_tree_node_baseS8_RKi
-FN:378,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_M_clone_nodeEPKSt13_Rb_tree_nodeIiE
-FN:900,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE7_M_copyEPKSt13_Rb_tree_nodeIiEPS7_
-FN:568,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEEC1ERKS5_
-FN:824,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEEaSERKS5_
-FN:356,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE14_M_create_nodeERKS5_
-FN:846,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE10_M_insert_EPKSt18_Rb_tree_node_baseSE_RKS5_
-FN:356,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE14_M_create_nodeERKS7_
-FN:846,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE10_M_insert_EPKSt18_Rb_tree_node_baseSE_RKS7_
-FN:356,_ZNSt8_Rb_treeIiSt4pairIKiSt3setIiSt4lessIiESaIiEEESt10_Select1stIS7_ES4_SaIS7_EE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeIiSt4pairIKiSt3setIiSt4lessIiESaIiEEESt10_Select1stIS7_ES4_SaIS7_EE14_M_create_nodeERKS7_
-FN:846,_ZNSt8_Rb_treeIiSt4pairIKiSt3setIiSt4lessIiESaIiEEESt10_Select1stIS7_ES4_SaIS7_EE10_M_insert_EPKSt18_Rb_tree_node_baseSE_RKS7_
-FN:356,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE14_M_create_nodeERKS2_
-FN:846,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE10_M_insert_EPKSt18_Rb_tree_node_baseSB_RKS2_
-FN:378,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13_M_clone_nodeEPKSt13_Rb_tree_nodeIS2_E
-FN:900,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE7_M_copyEPKSt13_Rb_tree_nodeIS2_EPSA_
-FN:568,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EEC1ERKS8_
-FN:824,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EEaSERKS8_
-FN:356,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE14_M_create_nodeERKSA_
-FN:846,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE10_M_insert_EPKSt18_Rb_tree_node_baseSI_RKSA_
-FN:195,_ZNSt17_Rb_tree_iteratorISsEmmEv
-FN:1133,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE16_M_insert_uniqueERKSs
-FN:195,_ZNSt17_Rb_tree_iteratorISt4pairIKSsN7tagcoll5PatchISsSsEEEEmmEv
-FN:1133,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE16_M_insert_uniqueERKS5_
-FN:195,_ZNSt17_Rb_tree_iteratorIiEmmEv
-FN:1133,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE16_M_insert_uniqueERKi
-FN:195,_ZNSt17_Rb_tree_iteratorISt4pairIKiN7tagcoll5PatchIiiEEEEmmEv
-FN:1133,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE16_M_insert_uniqueERKS5_
-FN:195,_ZNSt17_Rb_tree_iteratorISt4pairIKSsSt3setISsSt4lessISsESaISsEEEEmmEv
-FN:1133,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE16_M_insert_uniqueERKS7_
-FN:195,_ZNSt17_Rb_tree_iteratorISt4pairIKiSt3setIiSt4lessIiESaIiEEEEmmEv
-FN:1133,_ZNSt8_Rb_treeIiSt4pairIKiSt3setIiSt4lessIiESaIiEEESt10_Select1stIS7_ES4_SaIS7_EE16_M_insert_uniqueERKS7_
-FN:195,_ZNSt17_Rb_tree_iteratorIN3ept7debtags3TagEEmmEv
-FN:1133,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE16_M_insert_uniqueERKS2_
-FN:195,_ZNSt17_Rb_tree_iteratorISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEEEmmEv
-FN:1133,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEESt10_Select1stISA_ES6_ISsESaISA_EE16_M_insert_uniqueERKSA_
-FN:255,_ZNSt23_Rb_tree_const_iteratorISsEppEv
-FN:1178,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE17_M_insert_unique_ESt23_Rb_tree_const_iteratorISsERKSs
-FN:255,_ZNSt23_Rb_tree_const_iteratorIiEppEv
-FN:1178,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE17_M_insert_unique_ESt23_Rb_tree_const_iteratorIiERKi
-FN:255,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsN7tagcoll5PatchISsSsEEEEppEv
-FN:255,_ZNSt23_Rb_tree_const_iteratorISt4pairIKiN7tagcoll5PatchIiiEEEEppEv
-FN:255,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsSt3setISsSt4lessISsESaISsEEEEppEv
-FN:262,_ZNSt23_Rb_tree_const_iteratorISt4pairIKiSt3setIiSt4lessIiESaIiEEEEppEi
-FN:255,_ZNSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEppEv
-FN:1178,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE17_M_insert_unique_ESt23_Rb_tree_const_iteratorIS2_ERKS2_
-FN:255,_ZNSt23_Rb_tree_const_iteratorISt4pairIKiSt3setIiSt4lessIiESaIiEEEEppEv
-FN:262,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEEEppEi
-FN:255,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEEEppEv
-FN:262,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsSt3setISsSt4lessISsESaISsEEEEppEi
-FN:1327,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5eraseESt23_Rb_tree_const_iteratorISsE
-FN:1313,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5eraseESt17_Rb_tree_iteratorIiE
-FN:1327,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5eraseESt23_Rb_tree_const_iteratorIiE
-FN:1313,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5eraseESt17_Rb_tree_iteratorISsE
-FN:187,_ZNSt17_Rb_tree_iteratorIiEppEi
-FN:1353,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5eraseESt17_Rb_tree_iteratorIiES7_
-FN:1341,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5eraseERKi
-FN:187,_ZNSt17_Rb_tree_iteratorISsEppEi
-FN:1353,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5eraseESt17_Rb_tree_iteratorISsES7_
-FN:1341,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5eraseERKSs
-DA:103,0
-DA:105,0
-DA:106,0
-DA:117,0
-DA:119,0
-DA:120,0
-DA:168,211504
-DA:169,211504
-DA:176,21152
-DA:177,21152
-DA:187,0
-DA:189,0
-DA:190,0
-DA:195,0
-DA:197,0
-DA:198,0
-DA:210,84601
-DA:211,84601
-DA:214,1
-DA:215,1
-DA:240,42321
-DA:241,42321
-DA:243,0
-DA:244,0
-DA:247,0
-DA:248,0
-DA:251,105737
-DA:252,105737
-DA:255,63439
-DA:257,63439
-DA:258,63439
-DA:262,3
-DA:264,3
-DA:265,3
-DA:270,0
-DA:272,0
-DA:273,0
-DA:285,4
-DA:286,4
-DA:289,63452
-DA:290,63452
-DA:347,42302
-DA:348,42302
-DA:351,42302
-DA:352,42302
-DA:356,21151
-DA:357,21151
-DA:360,21151
-DA:361,21151
-DA:364,21151
-DA:366,21151
-DA:368,21151
-DA:369,0
-DA:371,0
-DA:372,0
-DA:374,21151
-DA:378,0
-DA:380,0
-DA:381,0
-DA:382,0
-DA:383,0
-DA:384,0
-DA:388,21151
-DA:390,21151
-DA:391,21151
-DA:392,21151
-DA:398,8
-DA:403,8
-DA:405,8
-DA:406,8
-DA:408,0
-DA:410,0
-DA:411,0
-DA:415,8
-DA:417,8
-DA:418,8
-DA:419,8
-DA:420,8
-DA:421,8
-DA:428,0
-DA:429,0
-DA:432,0
-DA:433,0
-DA:436,0
-DA:437,0
-DA:444,0
-DA:445,0
-DA:452,63456
-DA:453,63456
-DA:456,2
-DA:459,2
-DA:463,84599
-DA:464,84599
-DA:467,2
-DA:468,2
-DA:471,1296340
-DA:472,1296340
-DA:475,1296340
-DA:476,1296340
-DA:479,164547
-DA:480,164547
-DA:483,2
-DA:484,2
-DA:487,1174094
-DA:488,1174094
-DA:491,0
-DA:492,0
-DA:495,63435
-DA:496,63435
-DA:499,63435
-DA:500,63435
-DA:503,0
-DA:504,0
-DA:511,0
-DA:512,0
-DA:562,8
-DA:568,0
-DA:569,0
-DA:571,0
-DA:573,0
-DA:574,0
-DA:575,0
-DA:576,0
-DA:578,0
-DA:584,8
-DA:585,8
-DA:596,14
-DA:599,14
-DA:603,9
-DA:606,9
-DA:610,126904
-DA:611,126904
-DA:614,42310
-DA:617,42310
-DA:637,0
-DA:638,0
-DA:641,4
-DA:642,4
-DA:695,0
-DA:697,0
-DA:698,0
-DA:699,0
-DA:700,0
-DA:701,0
-DA:702,0
-DA:824,0
-DA:826,0
-DA:829,0
-DA:830,0
-DA:831,0
-DA:833,0
-DA:834,0
-DA:835,0
-DA:836,0
-DA:839,0
-DA:846,21151
-DA:850,21151
-DA:852,21151
-DA:854,21151
-DA:857,21151
-DA:858,21151
-DA:900,0
-DA:903,0
-DA:904,0
-DA:908,0
-DA:909,0
-DA:910,0
-DA:911,0
-DA:913,0
-DA:915,0
-DA:916,0
-DA:917,0
-DA:918,0
-DA:919,0
-DA:920,0
-DA:921,0
-DA:924,0
-DA:926,0
-DA:927,0
-DA:929,0
-DA:936,21159
-DA:939,63469
-DA:941,21151
-DA:942,21151
-DA:943,21151
-DA:944,21151
-DA:946,21159
-DA:954,42306
-DA:956,888505
-DA:957,803893
-DA:958,143422
-DA:960,660471
-DA:961,42306
-DA:970,2
-DA:972,6
-DA:973,2
-DA:974,2
-DA:976,0
-DA:977,2
-DA:986,0
-DA:988,0
-DA:989,0
-DA:990,0
-DA:992,0
-DA:993,0
-DA:1019,3
-DA:1021,3
-DA:1022,3
-DA:1023,7
-DA:1025,1
-DA:1026,0
-DA:1027,1
-DA:1028,1
-DA:1031,0
-DA:1032,0
-DA:1033,0
-DA:1036,0
-DA:1040,3
-DA:1133,21151
-DA:1135,21151
-DA:1136,21151
-DA:1137,21151
-DA:1138,534787
-DA:1140,492485
-DA:1141,492485
-DA:1142,492485
-DA:1144,21151
-DA:1145,21151
-DA:1147,7
-DA:1148,7
-DA:1150,0
-DA:1152,21144
-DA:1153,21144
-DA:1154,0
-DA:1178,0
-DA:1181,0
-DA:1183,0
-DA:1186,0
-DA:1188,0
-DA:1190,0
-DA:1194,0
-DA:1195,0
-DA:1196,0
-DA:1197,0
-DA:1200,0
-DA:1201,0
-DA:1204,0
-DA:1207,0
-DA:1209,0
-DA:1213,0
-DA:1214,0
-DA:1215,0
-DA:1216,0
-DA:1219,0
-DA:1220,0
-DA:1222,0
-DA:1225,0
-DA:1230,0
-DA:1313,0
-DA:1318,0
-DA:1319,0
-DA:1320,0
-DA:1321,0
-DA:1327,0
-DA:1332,0
-DA:1333,0
-DA:1334,0
-DA:1335,0
-DA:1341,3
-DA:1343,3
-DA:1344,3
-DA:1345,3
-DA:1346,3
-DA:1353,3
-DA:1355,3
-DA:1356,2
-DA:1358,2
-DA:1359,0
-DA:1360,3
-DA:1390,42306
-DA:1392,42306
-DA:1395,42306
-DA:1403,2
-DA:1405,2
-DA:1408,2
-BA:105,0
-BA:105,0
-BA:119,0
-BA:119,0
-BA:571,0
-BA:571,0
-BA:571,0
-BA:571,0
-BA:571,0
-BA:571,0
-BA:826,0
-BA:826,0
-BA:826,0
-BA:826,0
-BA:826,0
-BA:826,0
-BA:831,0
-BA:831,0
-BA:831,0
-BA:831,0
-BA:831,0
-BA:831,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,2
-BA:850,1
-BA:850,1
-BA:850,2
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,2
-BA:850,1
-BA:850,2
-BA:850,2
-BA:850,1
-BA:850,2
-BA:850,2
-BA:850,1
-BA:850,1
-BA:850,2
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:908,0
-BA:908,0
-BA:908,0
-BA:908,0
-BA:908,0
-BA:908,0
-BA:913,0
-BA:913,0
-BA:913,0
-BA:913,0
-BA:913,0
-BA:913,0
-BA:918,0
-BA:918,0
-BA:918,0
-BA:918,0
-BA:918,0
-BA:918,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,2
-BA:939,2
-BA:939,2
-BA:939,2
-BA:939,2
-BA:939,2
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:956,2
-BA:956,2
-BA:956,0
-BA:956,0
-BA:956,0
-BA:956,0
-BA:956,1
-BA:956,2
-BA:956,1
-BA:956,2
-BA:956,2
-BA:956,2
-BA:956,2
-BA:956,2
-BA:956,0
-BA:956,0
-BA:957,2
-BA:957,2
-BA:957,0
-BA:957,0
-BA:957,0
-BA:957,0
-BA:957,0
-BA:957,0
-BA:957,0
-BA:957,0
-BA:957,2
-BA:957,2
-BA:957,2
-BA:957,2
-BA:957,0
-BA:957,0
-BA:972,2
-BA:972,2
-BA:972,2
-BA:972,2
-BA:973,2
-BA:973,1
-BA:973,2
-BA:973,1
-BA:988,0
-BA:988,0
-BA:988,0
-BA:988,0
-BA:989,0
-BA:989,0
-BA:989,0
-BA:989,0
-BA:1023,0
-BA:1023,0
-BA:1023,2
-BA:1023,2
-BA:1025,0
-BA:1025,0
-BA:1025,1
-BA:1025,2
-BA:1027,0
-BA:1027,0
-BA:1027,2
-BA:1027,1
-BA:1138,0
-BA:1138,0
-BA:1138,1
-BA:1138,2
-BA:1138,0
-BA:1138,0
-BA:1138,0
-BA:1138,0
-BA:1138,2
-BA:1138,2
-BA:1138,1
-BA:1138,2
-BA:1138,0
-BA:1138,0
-BA:1138,0
-BA:1138,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1142,1
-BA:1142,2
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1145,0
-BA:1145,0
-BA:1145,2
-BA:1145,1
-BA:1145,0
-BA:1145,0
-BA:1145,0
-BA:1145,0
-BA:1145,2
-BA:1145,2
-BA:1145,2
-BA:1145,1
-BA:1145,0
-BA:1145,0
-BA:1145,0
-BA:1145,0
-BA:1147,0
-BA:1147,0
-BA:1147,2
-BA:1147,1
-BA:1147,0
-BA:1147,0
-BA:1147,0
-BA:1147,0
-BA:1147,2
-BA:1147,1
-BA:1147,2
-BA:1147,1
-BA:1147,0
-BA:1147,0
-BA:1147,0
-BA:1147,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1152,2
-BA:1152,1
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1181,0
-BA:1181,0
-BA:1181,0
-BA:1181,0
-BA:1181,0
-BA:1181,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1190,0
-BA:1190,0
-BA:1190,0
-BA:1190,0
-BA:1190,0
-BA:1190,0
-BA:1195,0
-BA:1195,0
-BA:1195,0
-BA:1195,0
-BA:1195,0
-BA:1195,0
-BA:1197,0
-BA:1197,0
-BA:1197,0
-BA:1197,0
-BA:1197,0
-BA:1197,0
-BA:1200,0
-BA:1200,0
-BA:1200,0
-BA:1200,0
-BA:1200,0
-BA:1200,0
-BA:1209,0
-BA:1209,0
-BA:1209,0
-BA:1209,0
-BA:1209,0
-BA:1209,0
-BA:1214,0
-BA:1214,0
-BA:1214,0
-BA:1214,0
-BA:1214,0
-BA:1214,0
-BA:1216,0
-BA:1216,0
-BA:1216,0
-BA:1216,0
-BA:1216,0
-BA:1216,0
-BA:1219,0
-BA:1219,0
-BA:1219,0
-BA:1219,0
-BA:1219,0
-BA:1219,0
-BA:1355,0
-BA:1355,0
-BA:1355,0
-BA:1355,0
-BA:1355,0
-BA:1355,0
-BA:1355,2
-BA:1355,1
-BA:1355,2
-BA:1355,2
-BA:1355,2
-BA:1355,2
-BA:1358,0
-BA:1358,0
-BA:1358,1
-BA:1358,2
-BA:1395,2
-BA:1395,1
-BA:1395,1
-BA:1395,2
-BA:1395,0
-BA:1395,0
-BA:1395,0
-BA:1395,0
-BA:1395,1
-BA:1395,2
-BA:1395,0
-BA:1395,0
-BA:1395,1
-BA:1395,2
-BA:1395,0
-BA:1395,0
-BA:1395,2
-BA:1395,2
-BA:1395,1
-BA:1395,2
-BA:1395,0
-BA:1395,0
-BA:1395,0
-BA:1395,0
-BA:1395,2
-BA:1395,1
-BA:1395,2
-BA:1395,2
-BA:1408,2
-BA:1408,1
-BA:1408,1
-BA:1408,2
-BA:1408,2
-BA:1408,1
-BA:1408,1
-BA:1408,2
-LF:285
-LH:145
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKiN7tagcoll5PatchIiiEEEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSt3setISsSt4lessISsESaISsEEEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKiSt3setIiSt4lessIiESaIiEEEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS7_ESaIS7_EEEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN7tagcoll5PatchISsSsEEEEED2Ev
-FN:118,_ZN9__gnu_cxx13new_allocatorIN3ept7debtags3TagEE7destroyEPS3_
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:118,_ZN9__gnu_cxx13new_allocatorIiE7destroyEPi
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIN3ept7debtags3TagEED2Ev
-FN:107,_ZN9__gnu_cxx13new_allocatorIN3ept7debtags3TagEE9constructEPS3_RKS3_
-FN:71,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEEC2ERKS6_
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIiED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEEC2ERKS3_
-FN:107,_ZN9__gnu_cxx13new_allocatorIiE9constructEPiRKi
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKiN7tagcoll5PatchIiiEEEED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEEC2ERKS3_
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSt3setISsSt4lessISsESaISsEEEEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsSt3setISsSt4lessISsESaISsEEEED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKiSt3setIiSt4lessIiESaIiEEEEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKiSt3setIiSt4lessIiESaIiEEEED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS7_ESaIS7_EEEEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS6_ESaIS6_EEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN7tagcoll5PatchISsSsEEEED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorIN3ept7debtags3TagEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorIiEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKiN7tagcoll5PatchIiiEEEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKiN7tagcoll5PatchIiiEEEEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsSt3setISsSt4lessISsESaISsEEEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKiSt3setIiSt4lessIiESaIiEEEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS6_ESaIS6_EEEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN7tagcoll5PatchISsSsEEEEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN7tagcoll5PatchISsSsEEEEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEE8max_sizeEv
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEE8max_sizeEv
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE8max_sizeEv
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKiN7tagcoll5PatchIiiEEEEE8max_sizeEv
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSt3setISsSt4lessISsESaISsEEEEE8max_sizeEv
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN7tagcoll5PatchISsSsEEEEE8max_sizeEv
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKiSt3setIiSt4lessIiESaIiEEEEE8max_sizeEv
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS7_ESaIS7_EEEEE8max_sizeEv
-FN:118,_ZN9__gnu_cxx13new_allocatorISsE7destroyEPSs
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEE10deallocateEPS2_j
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKiN7tagcoll5PatchIiiEEEE7destroyEPS6_
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKiSt3setIiSt4lessIiESaIiEEEE7destroyEPS8_
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKiN7tagcoll5PatchIiiEEEEE10deallocateEPS8_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE10deallocateEPS2_j
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN7tagcoll5PatchISsSsEEEE7destroyEPS6_
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsSt3setISsSt4lessISsESaISsEEEE7destroyEPS8_
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN7tagcoll5PatchISsSsEEEEE10deallocateEPS8_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSt3setISsSt4lessISsESaISsEEEEE10deallocateEPSA_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKiSt3setIiSt4lessIiESaIiEEEEE10deallocateEPSA_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEE10deallocateEPS5_j
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS6_ESaIS6_EEEE7destroyEPSB_
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS7_ESaIS7_EEEEE10deallocateEPSD_j
-FN:107,_ZN9__gnu_cxx13new_allocatorISsE9constructEPSsRKSs
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE8allocateEjPKv
-FN:107,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN7tagcoll5PatchISsSsEEEE9constructEPS6_RKS6_
-FN:107,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsSt3setISsSt4lessISsESaISsEEEE9constructEPS8_RKS8_
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN7tagcoll5PatchISsSsEEEEE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEE8allocateEjPKv
-FN:107,_ZN9__gnu_cxx13new_allocatorISt4pairIKiN7tagcoll5PatchIiiEEEE9constructEPS6_RKS6_
-FN:107,_ZN9__gnu_cxx13new_allocatorISt4pairIKiSt3setIiSt4lessIiESaIiEEEE9constructEPS8_RKS8_
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKiN7tagcoll5PatchIiiEEEEE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSt3setISsSt4lessISsESaISsEEEEE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKiSt3setIiSt4lessIiESaIiEEEEE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEE8allocateEjPKv
-FN:107,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS6_ESaIS6_EEEE9constructEPSB_RKSB_
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSt3setIN3ept7debtags3TagESt4lessIS7_ESaIS7_EEEEE8allocateEjPKv
-DA:69,42310
-DA:71,0
-DA:76,42310
-DA:87,21151
-DA:89,21151
-DA:90,0
-DA:92,21151
-DA:97,21151
-DA:98,21151
-DA:101,21151
-DA:102,21151
-DA:107,21151
-DA:108,21151
-DA:118,21151
-BA:89,0
-BA:89,0
-BA:89,1
-BA:89,2
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,1
-BA:89,2
-BA:89,1
-BA:89,2
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:108,0
-BA:108,0
-BA:108,0
-BA:108,0
-BA:108,0
-BA:108,0
-BA:108,2
-BA:108,1
-BA:108,2
-BA:108,1
-BA:108,0
-BA:108,0
-BA:108,2
-BA:108,1
-BA:108,0
-BA:108,0
-LF:14
-LH:12
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:195,_ZNSolsEj
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-DA:95,0
-DA:112,0
-DA:117,0
-DA:195,0
-DA:199,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/coll/base.h
-FN:48,_ZN7tagcoll4coll18ReadonlyCollectionINS0_6SimpleISsSsEEEC2Ev
-FN:273,_ZN7tagcoll4coll10CollectionINS0_6SimpleISsSsEEEC2Ev
-FN:48,_ZN7tagcoll4coll18ReadonlyCollectionINS0_6SimpleIiiEEEC2Ev
-FN:273,_ZN7tagcoll4coll10CollectionINS0_6SimpleIiiEEEC2Ev
-FN:48,_ZN7tagcoll4coll18ReadonlyCollectionINS0_6SimpleISsN3ept7debtags3TagEEEEC2Ev
-FN:273,_ZN7tagcoll4coll10CollectionINS0_6SimpleISsN3ept7debtags3TagEEEEC2Ev
-FN:313,_ZN7tagcoll4coll8InserterINS0_6SimpleIiiEEEC1ERS3_
-FN:324,_ZN7tagcoll4coll8inserterINS0_6SimpleIiiEEEENS0_8InserterIT_EERS5_
-FN:49,_ZNK7tagcoll4coll18ReadonlyCollectionINS0_6SimpleISsSsEEE4selfEv
-FN:313,_ZN7tagcoll4coll8InserterINS0_6SimpleISsN3ept7debtags3TagEEEEC1ERS6_
-FN:324,_ZN7tagcoll4coll8inserterINS0_6SimpleISsN3ept7debtags3TagEEEEENS0_8InserterIT_EERS8_
-FN:49,_ZNK7tagcoll4coll18ReadonlyCollectionINS0_6SimpleIiiEEE4selfEv
-FN:313,_ZN7tagcoll4coll8InserterINS0_6SimpleISsSsEEEC1ERS3_
-FN:324,_ZN7tagcoll4coll8inserterINS0_6SimpleISsSsEEEENS0_8InserterIT_EERS5_
-FN:49,_ZNK7tagcoll4coll18ReadonlyCollectionINS0_6SimpleISsN3ept7debtags3TagEEEE4selfEv
-FN:316,_ZN7tagcoll4coll8InserterINS0_6SimpleISsSsEEEaSIN6wibble9SingletonISsEESt3setISsSt4lessISsESaISsEEEERS4_RKSt4pairIT_T0_E
-FN:316,_ZN7tagcoll4coll8InserterINS0_6SimpleIiiEEEaSISt3setIiSt4lessIiESaIiEESA_EERS4_RKSt4pairIT_T0_E
-FN:316,_ZN7tagcoll4coll8InserterINS0_6SimpleISsN3ept7debtags3TagEEEEaSISt3setISsSt4lessISsESaISsEES9_IS5_SA_IS5_ESaIS5_EEEERS7_RKSt4pairIT_T0_E
-FN:233,_ZNK7tagcoll4coll18ReadonlyCollectionINS0_6SimpleIiiEEE6outputIN3ept7debtags8IntToPkgINS0_8InserterINS2_ISsNS7_3TagEEEEEEEEEvT_
-FN:233,_ZNK7tagcoll4coll18ReadonlyCollectionINS0_6SimpleISsSsEEE6outputIN3ept7debtags11StringToIntINS0_8InserterINS2_IiiEEEEEEEEvT_
-FN:233,_ZNK7tagcoll4coll18ReadonlyCollectionINS0_6SimpleISsN3ept7debtags3TagEEEE6outputINS4_11PkgToStringINS0_8InserterINS2_ISsSsEEEEEEEEvT_
-DA:48,5
-DA:49,42303
-DA:233,3
-DA:273,5
-DA:313,6
-DA:316,2
-DA:318,2
-DA:319,2
-DA:324,6
-DA:326,6
-LF:10
-LH:10
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/coll/base.tcc
-DA:138,12
-DA:141,3
-DA:142,3
-DA:144,3
-BA:138,2
-BA:138,2
-BA:138,2
-BA:138,2
-BA:138,2
-BA:138,2
-LF:4
-LH:4
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/coll/patched.h
-FN:51,_ZN7tagcoll4coll7PatchedINS0_12IntDiskIndexEED1Ev
-DA:51,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/coll/simple.h
-FN:121,_ZNK7tagcoll4coll6SimpleIiiE9itemCountEv
-FN:121,_ZNK7tagcoll4coll6SimpleISsN3ept7debtags3TagEE9itemCountEv
-FN:121,_ZNK7tagcoll4coll6SimpleISsSsE9itemCountEv
-FN:77,_ZNK7tagcoll4coll6SimpleISsN3ept7debtags3TagEE5beginEv
-FN:78,_ZNK7tagcoll4coll6SimpleISsN3ept7debtags3TagEE3endEv
-FN:77,_ZNK7tagcoll4coll6SimpleISsSsE5beginEv
-FN:78,_ZNK7tagcoll4coll6SimpleISsSsE3endEv
-FN:62,_ZN7tagcoll4coll6SimpleISsSsEC1Ev
-FN:62,_ZN7tagcoll4coll6SimpleIiiEC1Ev
-FN:77,_ZNK7tagcoll4coll6SimpleIiiE5beginEv
-FN:78,_ZNK7tagcoll4coll6SimpleIiiE3endEv
-FN:62,_ZN7tagcoll4coll6SimpleISsN3ept7debtags3TagEEC1Ev
-FN:62,_ZN7tagcoll4coll6SimpleISsSsED1Ev
-FN:62,_ZN7tagcoll4coll6SimpleIiiED1Ev
-FN:62,_ZN7tagcoll4coll6SimpleISsN3ept7debtags3TagEED1Ev
-FN:89,_ZNK7tagcoll4coll6SimpleISsSsE13getTagsOfItemERKSs
-FN:89,_ZNK7tagcoll4coll6SimpleISsN3ept7debtags3TagEE13getTagsOfItemERKSs
-FN:85,_ZN7tagcoll4coll6SimpleISsSsE6insertIN6wibble9SingletonISsEES6_EEvRKT_RKT0_
-FN:112,_ZNK7tagcoll4coll6SimpleIiiE10getAllTagsEv
-FN:123,_ZNK7tagcoll4coll6SimpleIiiE8tagCountEv
-FN:112,_ZNK7tagcoll4coll6SimpleISsN3ept7debtags3TagEE10getAllTagsEv
-FN:123,_ZNK7tagcoll4coll6SimpleISsN3ept7debtags3TagEE8tagCountEv
-FN:112,_ZNK7tagcoll4coll6SimpleISsSsE10getAllTagsEv
-FN:123,_ZNK7tagcoll4coll6SimpleISsSsE8tagCountEv
-DA:62,10
-DA:77,5
-DA:78,42298
-DA:85,2
-DA:89,2
-DA:112,3
-DA:121,2
-DA:123,3
-LF:8
-LH:8
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/coll/simple.tcc
-FN:38,_ZN7tagcoll4coll6SimpleISsSsE6insertIN6wibble9SingletonISsEESt3setISsSt4lessISsESaISsEEEEvRKT_RKT0_
-FN:38,_ZN7tagcoll4coll6SimpleIiiE6insertISt3setIiSt4lessIiESaIiEES8_EEvRKT_RKT0_
-FN:38,_ZN7tagcoll4coll6SimpleISsN3ept7debtags3TagEE6insertISt3setISsSt4lessISsESaISsEES7_IS4_S8_IS4_ESaIS4_EEEEvRKT_RKT0_
-DA:38,2
-DA:42,4
-DA:43,0
-DA:44,8
-DA:47,4
-DA:48,4
-DA:49,3
-DA:51,1
-DA:58,2
-DA:60,2
-DA:61,0
-DA:63,2
-DA:145,3
-DA:147,6
-DA:149,3
-DA:151,0
-DA:186,2
-BA:42,1
-BA:42,2
-BA:42,1
-BA:42,2
-BA:42,1
-BA:42,2
-BA:42,0
-BA:42,0
-BA:44,2
-BA:44,2
-BA:44,2
-BA:44,2
-BA:44,2
-BA:44,2
-BA:44,0
-BA:44,0
-BA:48,2
-BA:48,2
-BA:48,2
-BA:48,1
-BA:48,2
-BA:48,1
-BA:48,0
-BA:48,0
-BA:60,1
-BA:60,2
-BA:60,1
-BA:60,2
-BA:147,2
-BA:147,2
-BA:147,2
-BA:147,2
-BA:147,2
-BA:147,2
-LF:17
-LH:14
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/patch.h
-FN:186,_ZN7tagcoll8InserterIiiEC1ERNS_9PatchListIiiEE
-FN:196,_ZN7tagcoll8inserterIiiEENS_8InserterIT_T0_EERNS_9PatchListIS2_S3_EE
-FN:186,_ZN7tagcoll8InserterISsSsEC1ERNS_9PatchListISsSsEE
-FN:196,_ZN7tagcoll8inserterISsSsEENS_8InserterIT_T0_EERNS_9PatchListIS2_S3_EE
-FN:126,_ZN7tagcoll9PatchListIiiEC1Ev
-FN:126,_ZN7tagcoll9PatchListISsSsEC1Ev
-FN:49,_ZN7tagcoll5PatchIiiED1Ev
-FN:45,_ZN7tagcoll5PatchIiiEC1ERKi
-FN:124,_ZN7tagcoll9PatchListIiiED1Ev
-FN:49,_ZN7tagcoll5PatchISsSsED1Ev
-FN:124,_ZN7tagcoll9PatchListISsSsED1Ev
-FN:45,_ZN7tagcoll5PatchISsSsEC1ERKSs
-FN:44,_ZN7tagcoll5PatchISsSsEC1ERKS1_
-FN:44,_ZN7tagcoll5PatchIiiEC1ERKS1_
-FN:48,_ZN7tagcoll5PatchISsSsEC1IN6wibble9SingletonISsEES5_EERKSsRKT_RKT0_
-FN:56,_ZN7tagcoll5PatchISsSsE3addERKSt3setISsSt4lessISsESaISsEE
-FN:66,_ZN7tagcoll5PatchISsSsE6removeERKSt3setISsSt4lessISsESaISsEE
-FN:77,_ZN7tagcoll5PatchISsSsE9mergeWithERKS1_
-FN:141,_ZN7tagcoll9PatchListISsSsE8addPatchERKNS_5PatchISsSsEE
-FN:188,_ZN7tagcoll8InserterISsSsEaSERKNS_5PatchISsSsEE
-FN:56,_ZN7tagcoll5PatchIiiE3addERKSt3setIiSt4lessIiESaIiEE
-FN:66,_ZN7tagcoll5PatchIiiE6removeERKSt3setIiSt4lessIiESaIiEE
-FN:77,_ZN7tagcoll5PatchIiiE9mergeWithERKS1_
-FN:141,_ZN7tagcoll9PatchListIiiE8addPatchERKNS_5PatchIiiEE
-FN:188,_ZN7tagcoll8InserterIiiEaSERKNS_5PatchIiiEE
-FN:51,_ZN7tagcoll5PatchIiiE3addERKi
-FN:61,_ZN7tagcoll5PatchIiiE6removeERKi
-FN:51,_ZN7tagcoll5PatchISsSsE3addERKSs
-FN:61,_ZN7tagcoll5PatchISsSsE6removeERKSs
-FN:176,_ZNK7tagcoll9PatchListISsSsE6outputIN3ept7debtags16PatchStringToIntINS_8InserterIiiEEEEEEvT_
-FN:176,_ZNK7tagcoll9PatchListIiiE6outputIN3ept7debtags16PatchIntToStringINS_8InserterISsSsEEEEEEvT_
-DA:44,12
-DA:45,2
-DA:48,1
-DA:49,15
-DA:51,2
-DA:54,2
-DA:55,2
-DA:56,0
-DA:59,0
-DA:60,0
-DA:61,1
-DA:64,1
-DA:65,1
-DA:66,0
-DA:69,0
-DA:70,0
-DA:77,0
-DA:79,0
-DA:80,0
-DA:81,0
-DA:124,3
-DA:126,3
-DA:141,3
-DA:176,3
-DA:186,3
-DA:188,3
-DA:190,3
-DA:191,3
-DA:196,3
-DA:198,3
-LF:30
-LH:20
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/patch.tcc
-DA:41,1
-DA:43,1
-DA:44,1
-DA:45,1
-DA:51,3
-DA:52,0
-DA:54,3
-DA:55,3
-DA:56,3
-DA:58,0
-DA:151,6
-DA:154,3
-DA:155,3
-DA:157,3
-BA:51,1
-BA:51,2
-BA:51,0
-BA:51,0
-BA:51,1
-BA:51,2
-BA:51,0
-BA:51,0
-BA:51,0
-BA:51,0
-BA:51,0
-BA:51,0
-BA:55,2
-BA:55,1
-BA:55,0
-BA:55,0
-BA:151,2
-BA:151,2
-BA:151,2
-BA:151,2
-LF:14
-LH:12
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt/record.h
-DA:86,1
-BA:86,1
-BA:86,2
-LF:1
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/popcon/local.h
-FN:40,_ZN3ept6popcon5LocalD1Ev
-DA:40,1
-LF:1
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/popcon/local.test.h
-FN:42,_ZN15TestPopconLocalC1Ev
-FN:33,_ZN15TestPopconLocalD1Ev
-FN:51,_ZN15TestPopconLocal11basicAccessEv
-DA:33,1
-DA:42,1
-DA:47,1
-DA:48,1
-DA:51,1
-DA:53,1
-DA:54,2
-DA:55,1
-LF:8
-LH:8
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/popcon/maint/path.h
-FN:70,_ZN3ept6popcon4Path23OverridePopconSourceDirC1ERKSs
-FN:74,_ZN3ept6popcon4Path23OverridePopconSourceDirD1Ev
-FN:80,_ZN3ept6popcon4Path22OverridePopconIndexDirC1ERKSs
-FN:84,_ZN3ept6popcon4Path22OverridePopconIndexDirD1Ev
-FN:90,_ZN3ept6popcon4Path27OverridePopconUserSourceDirC1ERKSs
-FN:94,_ZN3ept6popcon4Path27OverridePopconUserSourceDirD1Ev
-FN:100,_ZN3ept6popcon4Path26OverridePopconUserIndexDirC1ERKSs
-FN:104,_ZN3ept6popcon4Path26OverridePopconUserIndexDirD1Ev
-DA:70,0
-DA:72,0
-DA:73,0
-DA:74,0
-DA:80,0
-DA:82,0
-DA:83,0
-DA:84,0
-DA:90,0
-DA:92,0
-DA:93,0
-DA:94,0
-DA:100,0
-DA:102,0
-DA:103,0
-DA:104,0
-LF:16
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/popcon/popcon.h
-FN:73,_ZN3ept6popcon6PopconD1Ev
-DA:73,0
-LF:1
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:13,_ZN8LocationD1Ev
-FN:17,_ZN8LocationC1EPKciSs
-FN:13,_ZN8LocationC1ERKS_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:41,_ZN12AssertFailedD1Ev
-FN:59,_Z9assert_fnIbEv8LocationT_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:59,0
-DA:61,0
-DA:62,0
-DA:64,0
-BA:42,0
-BA:42,0
-BA:61,0
-BA:61,0
-LF:18
-LH:0
-end_of_record
-SF:/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_popcon_local.cpp
-FN:3,_Z41__static_initialization_and_destruction_0ii
-FN:3,_GLOBAL__I_ept_test_generated__home_mornfall_dev_pkg_ept_work_ept_popcon_local.cpp
-FN:3,_Z27run_PopconLocal_basicAccessv
-DA:3,4
-BA:3,2
-BA:3,1
-BA:3,2
-BA:3,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsfEEED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaISt4pairIKSsfEED1Ev
-FN:104,_ZNSaISt4pairIKSsfEEC1ISt13_Rb_tree_nodeIS1_EEERKSaIT_E
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:104,3804
-DA:106,3805
-DA:118,0
-DA:119,0
-LF:7
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:277,_ZNKSs7_M_dataEv
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-LF:51
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:166,0
-DA:167,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_map.h
-FN:92,_ZNSt3mapISsfSt4lessISsESaISt4pairIKSsfEEED1Ev
-DA:92,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_pair.h
-FN:73,_ZNSt4pairIKSsfED1Ev
-DA:73,3804
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_tree.h
-FN:452,_ZNSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_M_beginEv
-FN:398,_ZNSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EE13_Rb_tree_implIS6_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:347,_ZNKSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EE21_M_get_Node_allocatorEv
-FN:351,_ZNKSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EE13get_allocatorEv
-FN:360,_ZNSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS2_E
-FN:388,_ZNSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS2_E
-FN:936,_ZNSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_M_eraseEPSt13_Rb_tree_nodeIS2_E
-FN:584,_ZNSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EED1Ev
-DA:347,3804
-DA:348,3804
-DA:351,3804
-DA:352,3804
-DA:360,1902
-DA:361,1902
-DA:388,1902
-DA:390,1902
-DA:391,1902
-DA:392,1902
-DA:398,1
-DA:452,1903
-DA:453,1903
-DA:479,11346
-DA:480,11346
-DA:487,11356
-DA:488,11356
-DA:584,1
-DA:585,1
-DA:936,1903
-DA:939,5708
-DA:941,1902
-DA:942,1902
-DA:943,1902
-DA:944,1902
-DA:946,1903
-BA:939,2
-BA:939,2
-LF:26
-LH:26
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsfEEED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsfEED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsfEEC2Ev
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsfEE7destroyEPS3_
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsfEEE10deallocateEPS5_j
-DA:69,3804
-DA:71,0
-DA:76,3805
-DA:97,1902
-DA:98,1902
-DA:118,1902
-LF:6
-LH:5
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-DA:95,0
-DA:112,0
-DA:117,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/apt/recordparser.h
-FN:88,_ZNK3ept3apt12RecordParser4sizeEv
-FN:51,_ZN3ept3apt12RecordParserC1ERKSs
-FN:39,_ZN3ept3apt12RecordParserD1Ev
-FN:85,_ZN3ept3apt12RecordParser6recordEv
-FN:73,_ZNK3ept3apt12RecordParser6lookupERKSs
-FN:79,_ZNK3ept3apt12RecordParserixERKSs
-FN:76,_ZNK3ept3apt12RecordParserixEj
-DA:39,12
-DA:51,12
-DA:73,18273
-DA:76,6
-DA:79,19
-DA:85,1
-DA:88,20972
-LF:7
-LH:7
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/apt/recordparser.test.h
-FN:28,_ZN19TestAptRecordparserD1Ev
-FN:30,_ZN19TestAptRecordparserC1Ev
-FN:43,_ZN19TestAptRecordparser7parsingEv
-FN:213,_ZN19TestAptRecordparser18bufferTermination3Ev
-FN:201,_ZN19TestAptRecordparser18bufferTermination2Ev
-FN:189,_ZN19TestAptRecordparser17bufferTerminationEv
-FN:120,_ZN19TestAptRecordparser6rescanEv
-FN:99,_ZN19TestAptRecordparser8indexingEv
-FN:71,_ZN19TestAptRecordparser11fieldValuesEv
-FN:51,_ZN19TestAptRecordparser11fieldTuplesEv
-FN:150,_ZN19TestAptRecordparser8realLifeEv
-FN:109,_ZN19TestAptRecordparser16missingBehaviourEv
-FN:82,_ZN19TestAptRecordparser10findByNameEv
-FN:61,_ZN19TestAptRecordparser9fieldKeysEv
-DA:28,12
-DA:30,12
-DA:31,12
-DA:39,12
-DA:40,12
-DA:43,1
-DA:45,1
-DA:47,1
-DA:48,1
-DA:49,1
-DA:51,1
-DA:53,1
-DA:54,1
-DA:55,1
-DA:56,1
-DA:57,1
-DA:58,1
-DA:59,1
-DA:61,1
-DA:63,1
-DA:64,1
-DA:65,1
-DA:66,1
-DA:67,1
-DA:68,1
-DA:69,1
-DA:71,1
-DA:73,1
-DA:74,1
-DA:75,1
-DA:76,1
-DA:77,1
-DA:78,1
-DA:79,1
-DA:82,1
-DA:84,1
-DA:86,1
-DA:87,2
-DA:88,2
-DA:89,2
-DA:90,2
-DA:92,2
-DA:93,2
-DA:94,2
-DA:95,2
-DA:96,2
-DA:97,1
-DA:99,1
-DA:101,1
-DA:102,1
-DA:103,2
-DA:104,2
-DA:105,2
-DA:106,2
-DA:107,1
-DA:109,1
-DA:111,1
-DA:113,1
-DA:114,1
-DA:115,1
-DA:116,1
-DA:117,1
-DA:120,1
-DA:125,1
-DA:127,1
-DA:128,1
-DA:129,2
-DA:130,2
-DA:131,2
-DA:135,2
-DA:137,1
-DA:142,1
-DA:143,2
-DA:144,2
-DA:145,2
-DA:146,2
-DA:147,1
-DA:150,1
-DA:177,1
-DA:178,1
-DA:180,1
-DA:182,1
-DA:183,20
-DA:184,19
-DA:185,1
-DA:186,1
-DA:189,1
-DA:193,1
-DA:195,1
-DA:196,1
-DA:197,2
-DA:198,2
-DA:199,1
-DA:201,1
-DA:205,1
-DA:207,1
-DA:208,1
-DA:209,2
-DA:210,2
-DA:211,1
-DA:213,1
-DA:218,1
-DA:220,1
-DA:221,1
-DA:222,2
-DA:223,2
-DA:224,1
-BA:183,2
-BA:183,2
-LF:107
-LH:107
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt/record.h
-DA:86,1
-BA:86,1
-BA:86,2
-LF:1
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:13,_ZN8LocationD1Ev
-FN:13,_ZN8LocationC1ERKS_
-FN:17,_ZN8LocationC1EPKciSs
-FN:52,_ZlsISsER12AssertFailedS1_T_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:52,_ZlsIPKcER12AssertFailedS3_T_
-FN:52,_ZlsIjER12AssertFailedS1_T_
-FN:41,_ZN12AssertFailedD1Ev
-FN:67,_Z12assert_eq_fnIjjEv8LocationT_T0_
-FN:67,_Z12assert_eq_fnISsSsEv8LocationT_T0_
-FN:67,_Z12assert_eq_fnISsPKcEv8LocationT_T0_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:75,0
-BA:42,0
-BA:42,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-LF:22
-LH:0
-end_of_record
-SF:/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_apt_recordparser.cpp
-FN:14,_Z41__static_initialization_and_destruction_0ii
-FN:14,_GLOBAL__I_ept_test_generated__home_mornfall_dev_pkg_ept_work_ept_apt_recordparser.cpp
-FN:3,_Z27run_AptRecordparser_parsingv
-FN:14,_Z38run_AptRecordparser_bufferTermination3v
-FN:13,_Z38run_AptRecordparser_bufferTermination2v
-FN:12,_Z37run_AptRecordparser_bufferTerminationv
-FN:10,_Z26run_AptRecordparser_rescanv
-FN:8,_Z28run_AptRecordparser_indexingv
-FN:6,_Z31run_AptRecordparser_fieldValuesv
-FN:4,_Z31run_AptRecordparser_fieldTuplesv
-FN:11,_Z28run_AptRecordparser_realLifev
-FN:9,_Z36run_AptRecordparser_missingBehaviourv
-FN:7,_Z30run_AptRecordparser_findByNamev
-FN:5,_Z29run_AptRecordparser_fieldKeysv
-DA:3,1
-DA:4,1
-DA:5,1
-DA:6,1
-DA:7,1
-DA:8,1
-DA:9,1
-DA:10,1
-DA:11,1
-DA:12,1
-DA:13,1
-DA:14,4
-BA:14,2
-BA:14,1
-BA:14,2
-BA:14,1
-LF:12
-LH:12
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaIjED2Ev
-FN:98,_ZNSaIjEC2Ev
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:928,_ZNSs6assignEPKc
-FN:509,_ZNSsaSEPKc
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-FN:2162,_ZSteqIcEN9__gnu_cxx11__enable_ifIXsrSt9__is_charIT_E7__valueEbE6__typeERKSbIS3_St11char_traitsIS3_ESaIS3_EESC_
-FN:2188,_ZSteqIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_EPKS3_
-FN:773,_ZNSspLERKSs
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:509,0
-DA:510,0
-DA:606,0
-DA:607,0
-DA:773,0
-DA:774,0
-DA:928,0
-DA:931,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2162,0
-DA:2165,0
-DA:2188,0
-DA:2189,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-LF:61
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-DA:245,0
-DA:246,0
-DA:257,0
-DA:258,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:97,_ZSt8_DestroyIPjEvT_S1_
-FN:126,_ZSt8_DestroyIPjjEvT_S1_RSaIT0_E
-DA:97,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-LF:5
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:166,0
-DA:167,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:484,_ZNKSt6vectorIjSaIjEE4sizeEv
-FN:97,_ZNSt12_Vector_baseIjSaIjEE19_M_get_Tp_allocatorEv
-FN:79,_ZNSt12_Vector_baseIjSaIjEE12_Vector_implD1Ev
-FN:84,_ZNSt12_Vector_baseIjSaIjEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseIjSaIjEEC2Ev
-FN:213,_ZNSt6vectorIjSaIjEEC1Ev
-FN:147,_ZNSt12_Vector_baseIjSaIjEE13_M_deallocateEPjj
-FN:135,_ZNSt12_Vector_baseIjSaIjEED2Ev
-FN:299,_ZNSt6vectorIjSaIjEED1Ev
-DA:79,0
-DA:84,0
-DA:85,0
-DA:86,0
-DA:97,0
-DA:98,0
-DA:108,0
-DA:109,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:213,0
-DA:214,0
-DA:299,0
-DA:300,0
-DA:301,0
-DA:484,728334
-DA:485,728334
-BA:149,0
-BA:149,0
-LF:22
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorIjED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorIjEC2Ev
-FN:97,_ZN9__gnu_cxx13new_allocatorIjE10deallocateEPjj
-DA:69,0
-DA:71,0
-DA:76,0
-DA:97,0
-DA:98,0
-LF:5
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:195,_ZNSolsEj
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-DA:95,0
-DA:112,0
-DA:117,0
-DA:195,0
-DA:199,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt/record.h
-DA:86,1
-BA:86,1
-BA:86,2
-LF:1
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt.h
-FN:139,_ZN3ept4core11AptDatabaseC1Ev
-FN:209,_ZN3ept4core11AptDatabase10invalidateEv
-FN:331,_ZN3ept4core11AptDatabaseD1Ev
-DA:139,0
-DA:140,0
-DA:141,0
-DA:142,0
-DA:143,0
-DA:144,0
-DA:145,0
-DA:146,0
-DA:209,0
-DA:210,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:218,0
-DA:219,0
-DA:220,0
-DA:331,0
-DA:332,0
-DA:333,0
-BA:210,0
-BA:210,0
-BA:214,0
-BA:214,0
-BA:216,0
-BA:216,0
-BA:218,0
-BA:218,0
-LF:21
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/test.h
-FN:12,_ZN18AptTestEnvironmentC2Ev
-FN:10,_ZN18AptTestEnvironmentD2Ev
-DA:10,0
-DA:12,0
-DA:13,0
-DA:14,0
-DA:15,0
-DA:16,0
-DA:17,0
-DA:18,0
-DA:19,0
-DA:20,0
-DA:21,0
-LF:11
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/textsearch/maint/path.h
-FN:55,_ZN3ept10textsearch4Path16OverrideIndexDirC1ERKSs
-FN:59,_ZN3ept10textsearch4Path16OverrideIndexDirD1Ev
-DA:55,0
-DA:57,0
-DA:58,0
-DA:59,0
-LF:4
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/textsearch/textsearch.h
-FN:130,_ZN3ept10textsearch10TextSearch2dbEv
-FN:136,_ZNK3ept10textsearch10TextSearch9timestampEv
-FN:139,_ZNK3ept10textsearch10TextSearch7hasDataEv
-FN:103,_ZN3ept10textsearch10TextSearchD1Ev
-DA:103,0
-DA:130,3
-DA:136,3
-DA:139,3
-LF:4
-LH:3
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/textsearch/textsearch.test.h
-FN:42,_ZN8DirMakerC1ERKSs
-FN:55,_ZN14TestTextsearchC1Ev
-FN:49,_ZN14TestTextsearchD1Ev
-FN:140,_ZN14TestTextsearch6valuesEv
-FN:133,_ZN14TestTextsearch11docidByNameEv
-FN:118,_ZN14TestTextsearch14partialOrQueryEv
-FN:103,_ZN14TestTextsearch11queryAccessEv
-FN:84,_ZN14TestTextsearch11basicAccessEv
-FN:68,_ZN14TestTextsearch5emptyEv
-DA:42,6
-DA:44,6
-DA:45,6
-DA:49,6
-DA:55,6
-DA:56,6
-DA:59,6
-DA:60,6
-DA:61,0
-DA:62,0
-DA:63,0
-DA:65,6
-DA:68,1
-DA:70,1
-DA:71,1
-DA:72,1
-DA:73,2
-DA:74,2
-DA:81,1
-DA:84,1
-DA:86,1
-DA:87,2
-DA:88,2
-DA:90,1
-DA:91,2
-DA:92,1
-DA:93,1
-DA:96,1
-DA:97,10
-DA:98,10
-DA:99,1
-DA:100,1
-DA:103,1
-DA:105,1
-DA:106,1
-DA:107,1
-DA:108,1
-DA:111,1
-DA:112,10
-DA:113,10
-DA:114,1
-DA:115,1
-DA:118,1
-DA:120,1
-DA:121,1
-DA:122,1
-DA:123,1
-DA:126,1
-DA:127,10
-DA:128,10
-DA:129,1
-DA:130,1
-DA:133,1
-DA:135,1
-DA:136,2
-DA:137,1
-DA:140,1
-DA:142,1
-DA:143,2
-DA:144,2
-DA:147,2
-DA:148,2
-DA:149,2
-DA:150,2
-DA:151,2
-DA:152,2
-DA:155,2
-DA:156,2
-DA:157,2
-DA:158,2
-DA:159,1
-DA:160,2
-DA:161,2
-DA:162,1
-BA:97,2
-BA:97,2
-BA:112,2
-BA:112,2
-BA:127,2
-BA:127,2
-LF:74
-LH:71
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:13,_ZN8LocationD1Ev
-FN:52,_ZlsIPKcER12AssertFailedS3_T_
-FN:52,_ZlsIiER12AssertFailedS1_T_
-FN:13,_ZN8LocationC1ERKS_
-FN:17,_ZN8LocationC1EPKciSs
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:52,_ZlsIdER12AssertFailedS1_T_
-FN:41,_ZN12AssertFailedD1Ev
-FN:67,_Z12assert_eq_fnIddEv8LocationT_T0_
-FN:59,_Z9assert_fnIbEv8LocationT_
-FN:67,_Z12assert_eq_fnIiiEv8LocationT_T0_
-FN:52,_ZlsIjER12AssertFailedS1_T_
-FN:67,_Z12assert_eq_fnIjjEv8LocationT_T0_
-FN:52,_ZlsIlER12AssertFailedS1_T_
-FN:67,_Z12assert_eq_fnIliEv8LocationT_T0_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:59,0
-DA:61,0
-DA:62,0
-DA:64,0
-DA:67,2
-DA:69,2
-DA:70,0
-DA:71,0
-DA:75,2
-BA:42,0
-BA:42,0
-BA:61,0
-BA:61,0
-BA:69,1
-BA:69,2
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-LF:26
-LH:3
-end_of_record
-SF:/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_textsearch_textsearch.cpp
-FN:8,_Z41__static_initialization_and_destruction_0ii
-FN:8,_GLOBAL__I_ept_test_generated__home_mornfall_dev_pkg_ept_work_ept_textsearch_textsearch.cpp
-FN:8,_Z21run_Textsearch_valuesv
-FN:7,_Z26run_Textsearch_docidByNamev
-FN:6,_Z29run_Textsearch_partialOrQueryv
-FN:5,_Z26run_Textsearch_queryAccessv
-FN:4,_Z26run_Textsearch_basicAccessv
-FN:3,_Z20run_Textsearch_emptyv
-DA:3,1
-DA:4,1
-DA:5,1
-DA:6,1
-DA:7,1
-DA:8,4
-BA:8,2
-BA:8,1
-BA:8,2
-BA:8,1
-LF:6
-LH:6
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISsEED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaISsED1Ev
-FN:106,_ZNSaIPKN3ept10textsearch10TextSearch12ExtraIndexerEED2Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeISsEEC2Ev
-FN:104,_ZNSaISsEC1ISt13_Rb_tree_nodeISsEEERKSaIT_E
-FN:98,_ZNSaIPKN3ept10textsearch10TextSearch12ExtraIndexerEEC2Ev
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:104,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:7
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:1544,_ZNKSs4dataEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:392,_ZNSs10_S_compareEjj
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:1941,_ZNKSs7compareERKSs
-FN:2238,_ZStltIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:392,0
-DA:394,0
-DA:401,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:1941,0
-DA:1943,0
-DA:1944,0
-DA:1945,0
-DA:1947,0
-DA:1948,0
-DA:1949,0
-DA:1950,0
-DA:2067,0
-DA:2069,0
-DA:2238,0
-DA:2239,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-BA:1948,0
-BA:1948,0
-LF:64
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:257,0
-DA:258,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:188,_ZSt3minIjERKT_S2_S2_
-DA:188,0
-DA:193,0
-DA:194,0
-DA:195,0
-BA:193,0
-BA:193,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:97,_ZSt8_DestroyIPPKN3ept10textsearch10TextSearch12ExtraIndexerEEvT_S7_
-FN:126,_ZSt8_DestroyIPPKN3ept10textsearch10TextSearch12ExtraIndexerES5_EvT_S7_RSaIT0_E
-DA:97,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-LF:5
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_function.h
-FN:469,_ZNKSt9_IdentityISsEclERKSs
-FN:229,_ZNKSt4lessISsEclERKSsS2_
-DA:229,0
-DA:230,0
-DA:469,0
-DA:470,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:166,0
-DA:167,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_pair.h
-FN:88,_ZNSt4pairISt23_Rb_tree_const_iteratorISsEbEC1ERKS1_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorISsEbEC1ERKS1_RKb
-DA:88,0
-DA:89,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_set.h
-FN:270,_ZNKSt3setISsSt4lessISsESaISsEE3endEv
-FN:141,_ZNSt3setISsSt4lessISsESaISsEEC1Ev
-FN:93,_ZNSt3setISsSt4lessISsESaISsEED1Ev
-FN:503,_ZNSt3setISsSt4lessISsESaISsEE4findERKSs
-FN:378,_ZNSt3setISsSt4lessISsESaISsEE6insertERKSs
-DA:93,0
-DA:141,0
-DA:142,0
-DA:270,0
-DA:271,0
-DA:378,0
-DA:381,0
-DA:382,0
-DA:503,0
-DA:504,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_tree.h
-FN:289,_ZNKSt23_Rb_tree_const_iteratorISsEneERKS0_
-FN:452,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_beginEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorISsEC1ERKSt17_Rb_tree_iteratorISsE
-FN:398,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_S_leftEPSt18_Rb_tree_node_base
-FN:463,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_M_endEv
-FN:168,_ZNSt17_Rb_tree_iteratorISsEC1EPSt13_Rb_tree_nodeISsE
-FN:596,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorISsEeqERKS0_
-FN:240,_ZNSt23_Rb_tree_const_iteratorISsEC1EPKSt13_Rb_tree_nodeISsE
-FN:614,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE3endEv
-FN:610,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE3endEv
-FN:415,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EE13_M_initializeEv
-FN:471,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_valueEPKSt13_Rb_tree_nodeISsE
-FN:475,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_S_keyEPKSt13_Rb_tree_nodeISsE
-FN:495,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_S_keyEPKSt18_Rb_tree_node_base
-FN:403,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEEC1Ev
-FN:347,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE21_M_get_Node_allocatorEv
-FN:351,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13get_allocatorEv
-FN:360,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11_M_put_nodeEPSt13_Rb_tree_nodeISsE
-FN:388,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE15_M_destroy_nodeEPSt13_Rb_tree_nodeISsE
-FN:936,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_eraseEPSt13_Rb_tree_nodeISsE
-FN:584,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEED1Ev
-FN:954,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE14_M_lower_boundEPSt13_Rb_tree_nodeISsES8_RKSs
-FN:1390,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE4findERKSs
-FN:195,_ZNSt17_Rb_tree_iteratorISsEmmEv
-FN:356,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE14_M_create_nodeERKSs
-FN:846,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE10_M_insert_EPKSt18_Rb_tree_node_baseS8_RKSs
-FN:1133,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE16_M_insert_uniqueERKSs
-DA:168,0
-DA:169,0
-DA:195,0
-DA:197,0
-DA:198,0
-DA:210,0
-DA:211,0
-DA:240,0
-DA:241,0
-DA:243,0
-DA:244,0
-DA:289,0
-DA:290,0
-DA:347,0
-DA:348,0
-DA:351,0
-DA:352,0
-DA:356,0
-DA:357,0
-DA:360,0
-DA:361,0
-DA:364,0
-DA:366,0
-DA:368,0
-DA:369,0
-DA:371,0
-DA:372,0
-DA:374,0
-DA:388,0
-DA:390,0
-DA:391,0
-DA:392,0
-DA:398,0
-DA:403,0
-DA:405,0
-DA:406,0
-DA:415,0
-DA:417,0
-DA:418,0
-DA:419,0
-DA:420,0
-DA:421,0
-DA:452,0
-DA:453,0
-DA:463,0
-DA:464,0
-DA:471,0
-DA:472,0
-DA:475,0
-DA:476,0
-DA:479,0
-DA:480,0
-DA:487,0
-DA:488,0
-DA:495,0
-DA:496,0
-DA:499,0
-DA:500,0
-DA:562,0
-DA:584,0
-DA:585,0
-DA:596,0
-DA:599,0
-DA:610,0
-DA:611,0
-DA:614,0
-DA:617,0
-DA:846,0
-DA:850,0
-DA:852,0
-DA:854,0
-DA:857,0
-DA:858,0
-DA:936,0
-DA:939,0
-DA:941,0
-DA:942,0
-DA:943,0
-DA:944,0
-DA:946,0
-DA:954,0
-DA:956,0
-DA:957,0
-DA:958,0
-DA:960,0
-DA:961,0
-DA:1133,0
-DA:1135,0
-DA:1136,0
-DA:1137,0
-DA:1138,0
-DA:1140,0
-DA:1141,0
-DA:1142,0
-DA:1144,0
-DA:1145,0
-DA:1147,0
-DA:1148,0
-DA:1150,0
-DA:1152,0
-DA:1153,0
-DA:1154,0
-DA:1390,0
-DA:1392,0
-DA:1395,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:939,0
-BA:939,0
-BA:956,0
-BA:956,0
-BA:957,0
-BA:957,0
-BA:1138,0
-BA:1138,0
-BA:1142,0
-BA:1142,0
-BA:1145,0
-BA:1145,0
-BA:1147,0
-BA:1147,0
-BA:1152,0
-BA:1152,0
-BA:1395,0
-BA:1395,0
-BA:1395,0
-BA:1395,0
-LF:105
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:97,_ZNSt12_Vector_baseIPKN3ept10textsearch10TextSearch12ExtraIndexerESaIS5_EE19_M_get_Tp_allocatorEv
-FN:79,_ZNSt12_Vector_baseIPKN3ept10textsearch10TextSearch12ExtraIndexerESaIS5_EE12_Vector_implD1Ev
-FN:84,_ZNSt12_Vector_baseIPKN3ept10textsearch10TextSearch12ExtraIndexerESaIS5_EE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseIPKN3ept10textsearch10TextSearch12ExtraIndexerESaIS5_EEC2Ev
-FN:213,_ZNSt6vectorIPKN3ept10textsearch10TextSearch12ExtraIndexerESaIS5_EEC1Ev
-FN:147,_ZNSt12_Vector_baseIPKN3ept10textsearch10TextSearch12ExtraIndexerESaIS5_EE13_M_deallocateEPS5_j
-FN:135,_ZNSt12_Vector_baseIPKN3ept10textsearch10TextSearch12ExtraIndexerESaIS5_EED2Ev
-FN:299,_ZNSt6vectorIPKN3ept10textsearch10TextSearch12ExtraIndexerESaIS5_EED1Ev
-DA:79,0
-DA:84,0
-DA:85,0
-DA:86,0
-DA:97,0
-DA:98,0
-DA:108,0
-DA:109,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:213,0
-DA:214,0
-DA:299,0
-DA:300,0
-DA:301,0
-BA:149,0
-BA:149,0
-LF:20
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIPKN3ept10textsearch10TextSearch12ExtraIndexerEED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorIPKN3ept10textsearch10TextSearch12ExtraIndexerEEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE8max_sizeEv
-FN:118,_ZN9__gnu_cxx13new_allocatorISsE7destroyEPSs
-FN:97,_ZN9__gnu_cxx13new_allocatorIPKN3ept10textsearch10TextSearch12ExtraIndexerEE10deallocateEPS6_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE10deallocateEPS2_j
-FN:107,_ZN9__gnu_cxx13new_allocatorISsE9constructEPSsRKSs
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE8allocateEjPKv
-DA:69,0
-DA:71,0
-DA:76,0
-DA:87,0
-DA:89,0
-DA:90,0
-DA:92,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:107,0
-DA:108,0
-DA:118,0
-BA:89,0
-BA:89,0
-BA:108,0
-BA:108,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:213,_ZNSolsEd
-FN:195,_ZNSolsEj
-FN:169,_ZNSolsEl
-DA:95,0
-DA:112,0
-DA:117,0
-DA:169,0
-DA:170,0
-DA:195,0
-DA:199,0
-DA:213,0
-DA:214,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:20
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/xapian/enquire.h
-FN:273,_ZN6Xapian12MSetIteratorppEv
-FN:379,_ZN6XapianneERKNS_12MSetIteratorES2_
-FN:258,_ZN6Xapian12MSetIteratorD1Ev
-DA:258,0
-DA:273,0
-DA:274,0
-DA:275,0
-DA:379,0
-DA:381,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/xapian/error.h
-FN:101,_ZNK6Xapian5Error8get_typeEv
-FN:104,_ZNK6Xapian5Error7get_msgEv
-FN:113,_ZNK6Xapian5Error11get_contextEv
-DA:101,0
-DA:104,0
-DA:113,0
-LF:3
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt/record.h
-DA:86,1
-BA:86,1
-BA:86,2
-LF:1
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/desktop.h
-FN:132,_ZNK3ept4core7desktop12InternalList5emptyEv
-FN:183,_ZN3ept4core7desktop11GroupPolicyC1Ev
-FN:265,_ZN3ept4core7desktop6Source11getInternalILNS1_10PropertyIdE1EEENS1_12PropertyTypeIXT_EE1TENS1_5EntryE
-FN:36,_ZN3ept4core7desktop8CategoryC1Ev
-FN:53,_ZN3ept4core7desktop5EntryC1Ev
-FN:36,_ZN3ept4core7desktop8CategoryD1Ev
-FN:224,_ZN3ept4core7desktop6Source9IsInGroupD1Ev
-FN:119,_ZN3ept4core7desktop12InternalListC1Ev
-FN:38,_ZNK3ept4core7desktop8CategorycvSsEv
-FN:226,_ZN3ept4core7desktop6Source9IsInGroupC1ESs
-FN:224,_ZN3ept4core7desktop6Source9IsInGroupC1ERKS3_
-FN:95,_ZNK3ept4core7desktop5Entry2idEv
-FN:96,_ZNK3ept4core7desktop5Entry4nameEv
-FN:251,_ZN3ept4core7desktop6Source11getInternalILNS1_10PropertyIdE0EEENS1_12PropertyTypeIXT_EE1TENS1_5EntryE
-FN:188,_ZN3ept4core7desktop11GroupPolicyD0Ev
-FN:188,_ZN3ept4core7desktop11GroupPolicyD1Ev
-FN:52,_ZN3ept4core7desktop5EntryD1Ev
-FN:198,_ZN3ept4core7desktop6SourceC1ESs
-FN:192,_ZN3ept4core7desktop6SourceD1Ev
-FN:112,_ZN3ept4core7desktop12InternalListD1Ev
-FN:91,_ZNK3ept4core7desktop5Entry10categoriesEv
-FN:52,_ZN3ept4core7desktop5EntryC1ERKS2_
-FN:112,_ZN3ept4core7desktop12InternalListC1ERKS2_
-FN:184,_ZN3ept4core7desktop11GroupPolicy5groupERKNS1_5EntryE
-FN:52,_ZN3ept4core7desktop5EntryaSERKS2_
-FN:112,_ZN3ept4core7desktop12InternalListaSERKS2_
-FN:205,_ZN3ept4core7desktop6Source8getTokenENS1_5EntryE
-FN:224,_ZN3ept4core7desktop6Source9IsInGroupaSERKS3_
-FN:227,_ZNK3ept4core7desktop6Source9IsInGroupclENS_5TokenESs
-FN:147,_ZN3ept4core7desktop12InternalList8nextFileEv
-FN:136,_ZN3ept4core7desktop12InternalList9firstFileEv
-FN:120,_ZN3ept4core7desktop12InternalListC1ESs
-FN:201,_ZN3ept4core7desktop6Source12listInternalEv
-FN:244,_ZN3ept4core7desktop6Source9groupListEv
-FN:232,_ZN3ept4core7desktop6Source5groupESs
-FN:141,_ZNK3ept4core7desktop12InternalList4tailEv
-FN:41,_ZN3ept4core7desktoprsERSiRNS1_8CategoryE
-FN:81,_ZN3ept4core7desktop5Entry13setCategoriesESs
-FN:62,_ZN3ept4core7desktop5Entry4loadESs
-FN:125,_ZNK3ept4core7desktop12InternalList4headEv
-FN:237,_ZN3ept4core7desktop6Source12projectGroupENS0_6SourceIS2_NS1_5SetupENS1_12PropertyTypeEE12ComposedListILNS1_10PropertyIdE0EEE
-DA:36,64
-DA:38,112
-DA:41,80
-DA:43,80
-DA:44,468
-DA:45,356
-DA:46,356
-DA:47,308
-DA:49,32
-DA:52,567
-DA:53,18
-DA:62,16
-DA:63,16
-DA:64,16
-DA:65,16
-DA:66,0
-DA:67,16
-DA:68,16
-DA:69,16
-DA:70,16
-DA:71,32
-DA:72,32
-DA:73,32
-DA:74,8
-DA:75,16
-DA:77,32
-DA:78,32
-DA:81,16
-DA:82,16
-DA:83,16
-DA:88,16
-DA:89,16
-DA:91,16
-DA:95,34
-DA:96,6
-DA:112,450
-DA:119,9
-DA:120,4
-DA:122,4
-DA:123,4
-DA:125,56
-DA:126,56
-DA:127,16
-DA:128,56
-DA:129,56
-DA:132,33
-DA:133,33
-DA:136,4
-DA:137,4
-DA:138,4
-DA:139,4
-DA:141,16
-DA:142,16
-DA:143,16
-DA:144,0
-DA:147,20
-DA:148,20
-DA:149,20
-DA:150,20
-DA:151,0
-DA:152,0
-DA:153,0
-DA:156,20
-DA:157,16
-DA:159,20
-DA:160,48
-DA:161,24
-DA:162,48
-DA:163,8
-DA:164,16
-DA:166,16
-DA:167,16
-DA:168,16
-DA:169,16
-DA:171,4
-DA:172,4
-DA:183,5
-DA:184,16
-DA:186,16
-DA:188,5
-DA:192,5
-DA:198,5
-DA:199,5
-DA:201,4
-DA:202,4
-DA:205,34
-DA:206,34
-DA:207,34
-DA:208,0
-DA:224,56
-DA:226,2
-DA:227,8
-DA:228,8
-DA:232,1
-DA:234,1
-DA:237,4
-DA:238,4
-DA:244,1
-DA:247,1
-DA:251,6
-DA:252,6
-DA:265,16
-DA:266,16
-BA:44,2
-BA:44,2
-BA:46,2
-BA:46,2
-BA:65,1
-BA:65,2
-BA:73,2
-BA:73,2
-BA:78,1
-BA:78,2
-BA:126,2
-BA:126,2
-BA:150,1
-BA:150,2
-BA:156,2
-BA:156,2
-BA:160,2
-BA:160,2
-BA:160,2
-BA:160,2
-BA:162,2
-BA:162,2
-BA:162,2
-BA:162,2
-BA:162,2
-BA:162,2
-BA:164,1
-BA:164,2
-BA:188,0
-BA:188,0
-BA:188,1
-BA:188,2
-LF:103
-LH:97
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/desktop.test.h
-FN:13,_ZN11TestDesktopC1Ev
-FN:9,_ZN11TestDesktopD1Ev
-FN:64,_ZN11TestDesktop14emptyGroupListEv
-FN:16,_ZN11TestDesktop15checkIteration2ILN3ept4core7desktop10PropertyIdE0EN6wibble4list6SortedINS6_8FilteredINS2_6SourceINS3_6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILS4_1EEENSD_10PropertifyILS4_1ENSA_9IsInGroupEEEEEEEEEviPPKcT0_
-FN:27,_ZN11TestDesktop14checkIterationILN3ept4core7desktop10PropertyIdE0EN6wibble4list8FilteredINS2_6SourceINS3_6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILS4_1EEENSC_10PropertifyILS4_1ENS9_9IsInGroupEEEEEEEviPPKcT0_
-FN:48,_ZN11TestDesktop6groupsEv
-FN:16,_ZN11TestDesktop15checkIteration2ILN3ept4core7desktop10PropertyIdE1EN6wibble4list6SortedINS2_6SourceINS3_6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILS4_0EEEEEEEviPPKcT0_
-FN:27,_ZN11TestDesktop14checkIterationILN3ept4core7desktop10PropertyIdE1ENS2_6SourceINS3_6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILS4_0EEEEEviPPKcT0_
-FN:37,_ZN11TestDesktop13groupPropertyEv
-FN:16,_ZN11TestDesktop15checkIteration2ILN3ept4core7desktop10PropertyIdE0EN6wibble4list6SortedINS2_6SourceINS3_6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILS4_0EEEEEEEviPPKcT0_
-FN:27,_ZN11TestDesktop14checkIterationILN3ept4core7desktop10PropertyIdE0ENS2_6SourceINS3_6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILS4_0EEEEEviPPKcT0_
-FN:31,_ZN11TestDesktop9iterationEv
-FN:54,_ZN11TestDesktop9groupListEv
-DA:9,5
-DA:13,5
-DA:16,3
-DA:17,3
-DA:18,16
-DA:19,10
-DA:20,20
-DA:21,10
-DA:23,3
-DA:24,3
-DA:27,3
-DA:28,3
-DA:29,3
-DA:31,1
-DA:32,1
-DA:34,1
-DA:35,1
-DA:37,1
-DA:43,1
-DA:45,1
-DA:46,1
-DA:48,1
-DA:49,1
-DA:51,1
-DA:52,1
-DA:54,1
-DA:59,1
-DA:61,2
-DA:62,1
-DA:64,1
-DA:65,1
-DA:66,1
-DA:67,1
-BA:18,2
-BA:18,2
-BA:18,2
-BA:18,2
-BA:18,2
-BA:18,2
-BA:59,0
-BA:59,0
-BA:59,0
-BA:59,0
-BA:61,0
-BA:61,0
-BA:61,2
-BA:61,2
-LF:33
-LH:33
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/desktopfile.h
-FN:14,_ZN3ept4core7desktop4FileC1Ev
-FN:21,_ZN3ept4core7desktop4File5GroupC1Ev
-FN:15,_ZN3ept4core7desktop4File5EntryC1Ev
-FN:15,_ZN3ept4core7desktop4File5EntryD1Ev
-FN:15,_ZN3ept4core7desktop4File5EntryC1ERKS3_
-FN:21,_ZN3ept4core7desktop4File5GroupD1Ev
-FN:14,_ZN3ept4core7desktop4FileD1Ev
-FN:21,_ZN3ept4core7desktop4File5GroupC1ERKS3_
-FN:15,_ZN3ept4core7desktop4File5EntryaSERKS3_
-FN:21,_ZN3ept4core7desktop4File5GroupaSERKS3_
-FN:32,_ZN3ept4core7desktoprsERSiRNS1_4File5EntryE
-FN:92,_ZN3ept4core7desktoprsERSiRNS1_4File5GroupE
-FN:24,_ZN3ept4core7desktop4File5Group5entryESs
-FN:124,_ZN3ept4core7desktoprsERSiRNS1_4FileE
-FN:29,_ZN3ept4core7desktop4File5groupESs
-DA:14,32
-DA:15,13540
-DA:21,144
-DA:24,88
-DA:29,16
-DA:32,1228
-DA:34,1228
-DA:36,1228
-DA:38,16056
-DA:39,14820
-DA:40,14820
-DA:41,8
-DA:42,14812
-DA:43,0
-DA:44,0
-DA:46,14812
-DA:47,0
-DA:49,0
-DA:51,14812
-DA:52,14812
-DA:53,1212
-DA:54,13600
-DA:55,13600
-DA:56,13600
-DA:60,1220
-DA:61,1220
-DA:63,37496
-DA:64,36268
-DA:65,36268
-DA:66,1212
-DA:67,0
-DA:68,1212
-DA:70,35056
-DA:71,0
-DA:72,35056
-DA:73,35056
-DA:74,0
-DA:75,0
-DA:76,0
-DA:77,0
-DA:78,0
-DA:79,0
-DA:80,0
-DA:81,0
-DA:83,35056
-DA:84,0
-DA:85,0
-DA:87,35056
-DA:89,8
-DA:92,16
-DA:94,16
-DA:95,16
-DA:96,256
-DA:97,240
-DA:98,240
-DA:99,0
-DA:100,240
-DA:101,0
-DA:103,0
-DA:105,240
-DA:106,16
-DA:107,16
-DA:109,224
-DA:110,16
-DA:112,16
-DA:114,208
-DA:116,1236
-DA:117,1220
-DA:118,1220
-DA:119,1220
-DA:121,16
-DA:124,16
-DA:126,32
-DA:127,16
-DA:128,16
-DA:129,16
-DA:131,16
-BA:38,2
-BA:38,2
-BA:40,2
-BA:40,2
-BA:40,2
-BA:40,2
-BA:42,1
-BA:42,2
-BA:46,2
-BA:46,2
-BA:46,1
-BA:46,2
-BA:47,0
-BA:47,0
-BA:47,0
-BA:47,0
-BA:47,0
-BA:47,0
-BA:52,2
-BA:52,2
-BA:63,2
-BA:63,2
-BA:65,2
-BA:65,2
-BA:66,1
-BA:66,2
-BA:70,2
-BA:70,2
-BA:70,1
-BA:70,2
-BA:73,1
-BA:73,2
-BA:74,0
-BA:74,0
-BA:75,0
-BA:75,0
-BA:76,0
-BA:76,0
-BA:77,0
-BA:77,0
-BA:78,0
-BA:78,0
-BA:83,1
-BA:83,2
-BA:96,2
-BA:96,1
-BA:98,2
-BA:98,2
-BA:98,1
-BA:98,2
-BA:100,2
-BA:100,2
-BA:100,1
-BA:100,2
-BA:101,0
-BA:101,0
-BA:101,0
-BA:101,0
-BA:101,0
-BA:101,0
-BA:105,2
-BA:105,2
-BA:105,2
-BA:105,1
-BA:109,2
-BA:109,1
-BA:109,2
-BA:109,2
-BA:110,2
-BA:110,1
-BA:110,1
-BA:110,2
-BA:110,1
-BA:110,2
-BA:116,2
-BA:116,2
-BA:126,2
-BA:126,2
-LF:77
-LH:58
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/source.h
-FN:20,_ZN3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEE4selfEv
-FN:51,_ZNK3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE0EE5emptyEv
-FN:57,_ZN3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE0EE4headEv
-FN:51,_ZNK3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE1EE5emptyEv
-FN:57,_ZN3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE1EE4headEv
-FN:58,_ZNK3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE0EE4headEv
-FN:86,_ZN3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEE10PropertifyILNS2_10PropertyIdE1ENS3_9IsInGroupEED1Ev
-FN:106,_ZN3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEEC2Ev
-FN:73,_ZN3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE0EEC1Ev
-FN:73,_ZN3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE1EEC1Ev
-FN:88,_ZN3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEE10PropertifyILNS2_10PropertyIdE1ENS3_9IsInGroupEEC1ES9_
-FN:86,_ZN3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEE10PropertifyILNS2_10PropertyIdE1ENS3_9IsInGroupEEC1ERKSA_
-FN:13,_ZN3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEED2Ev
-FN:38,_ZN3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE0EED1Ev
-FN:38,_ZN3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE1EED1Ev
-FN:75,_ZN3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE0EEC1ERS3_NS2_12InternalListE
-FN:38,_ZN3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE0EEC1ERKS9_
-FN:75,_ZN3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE1EEC1ERS3_NS2_12InternalListE
-FN:38,_ZN3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE1EEC1ERKS9_
-FN:38,_ZN3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE0EEaSERKS9_
-FN:38,_ZN3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE1EEaSERKS9_
-FN:86,_ZN3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEE10PropertifyILNS2_10PropertyIdE1ENS3_9IsInGroupEEaSERKSA_
-FN:80,_ZN3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEE4listILNS2_10PropertyIdE0EEENS6_12ComposedListIXT_EEEv
-FN:80,_ZN3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEE4listILNS2_10PropertyIdE1EEENS6_12ComposedListIXT_EEEv
-FN:102,_ZN3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEE14propertyFilterILNS2_10PropertyIdE1ENS3_9IsInGroupEEENS6_14PropertyFilterIXT_ET0_E1TESB_
-FN:47,_ZNK3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE0EE4tailEv
-FN:47,_ZNK3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE1EE4tailEv
-FN:69,_ZNK3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE0EE3getILS8_1EEENS5_IXT_EE1TEv
-FN:62,_ZNK3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE1EE8propertyEv
-FN:60,_ZNK3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE1EE5tokenEv
-FN:89,_ZNK3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEE10PropertifyILNS2_10PropertyIdE1ENS3_9IsInGroupEEclERKNS6_12ComposedListILS8_1EEE
-FN:53,_ZNK3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE1EEltERKS9_
-FN:69,_ZNK3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE1EE3getILS8_0EEENS5_IXT_EE1TEv
-FN:60,_ZNK3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE0EE5tokenEv
-FN:53,_ZNK3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE0EEltERKS9_
-FN:69,_ZNK3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE0EE3getILS8_0EEENS5_IXT_EE1TEv
-DA:13,5
-DA:20,8
-DA:38,393
-DA:47,16
-DA:48,16
-DA:51,32
-DA:53,13
-DA:54,13
-DA:57,18
-DA:58,4
-DA:60,34
-DA:62,8
-DA:64,8
-DA:69,14
-DA:70,14
-DA:73,8
-DA:75,20
-DA:76,20
-DA:80,4
-DA:82,4
-DA:86,50
-DA:88,2
-DA:89,8
-DA:90,8
-DA:102,1
-DA:103,1
-DA:106,5
-DA:107,5
-DA:108,5
-LF:29
-LH:29
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/token.h
-FN:10,_ZN3ept5TokenD1Ev
-FN:14,_ZN3ept5TokenC1Ev
-FN:44,_ZNK3ept5TokenleERKS0_
-DA:10,9870
-DA:14,9755
-DA:44,58
-DA:45,58
-LF:4
-LH:4
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/list.h
-FN:61,_ZN6wibble4list6SortedINS0_3MapIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE0EEESt25pointer_to_unary_functionISD_SsEEEE9SharedVec6_derefEv
-FN:250,_ZN6wibble4list3MapIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEESt25pointer_to_unary_functionISC_SsEE1fEv
-FN:60,_ZN6wibble4list6SortedINS0_3MapIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE0EEESt25pointer_to_unary_functionISD_SsEEEE9SharedVec4_refEv
-FN:68,_ZN6wibble4list6SortedINS0_3MapIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE0EEESt25pointer_to_unary_functionISD_SsEEEE9SharedPtrC1ERKSI_
-FN:61,_ZN6wibble4list6SortedIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEEE9SharedVec6_derefEv
-FN:61,_ZN6wibble4list6SortedINS0_8FilteredIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE1EEENSA_10PropertifyILSC_1ENS7_9IsInGroupEEEEEE9SharedVec6_derefEv
-FN:74,_ZN6wibble4list6SortedINS0_3MapIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE0EEESt25pointer_to_unary_functionISD_SsEEEE9SharedPtraSERKSI_
-FN:60,_ZN6wibble4list6SortedIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEEE9SharedVec4_refEv
-FN:68,_ZN6wibble4list6SortedIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEEE9SharedPtrC1ERKSE_
-FN:83,_ZN6wibble4list6SortedIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEEE9SharedPtrptEv
-FN:82,_ZN6wibble4list6SortedIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEEE9SharedPtrdeEv
-FN:74,_ZN6wibble4list6SortedIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEEE9SharedPtraSERKSE_
-FN:60,_ZN6wibble4list6SortedINS0_8FilteredIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE1EEENSA_10PropertifyILSC_1ENS7_9IsInGroupEEEEEE9SharedVec4_refEv
-FN:68,_ZN6wibble4list6SortedINS0_8FilteredIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE1EEENSA_10PropertifyILSC_1ENS7_9IsInGroupEEEEEE9SharedPtrC1ERKSJ_
-FN:83,_ZN6wibble4list6SortedINS0_8FilteredIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE1EEENSA_10PropertifyILSC_1ENS7_9IsInGroupEEEEEE9SharedPtrptEv
-FN:82,_ZN6wibble4list6SortedINS0_8FilteredIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE1EEENSA_10PropertifyILSC_1ENS7_9IsInGroupEEEEEE9SharedPtrdeEv
-FN:74,_ZN6wibble4list6SortedINS0_8FilteredIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE1EEENSA_10PropertifyILSC_1ENS7_9IsInGroupEEEEEE9SharedPtraSERKSJ_
-FN:83,_ZN6wibble4list6SortedINS0_3MapIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE0EEESt25pointer_to_unary_functionISD_SsEEEE9SharedPtrptEv
-FN:82,_ZN6wibble4list6SortedINS0_3MapIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE0EEESt25pointer_to_unary_functionISD_SsEEEE9SharedPtrdeEv
-FN:59,_ZN6wibble4list6SortedINS0_3MapIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE0EEESt25pointer_to_unary_functionISD_SsEEEE9SharedVecC1Ev
-FN:81,_ZN6wibble4list6SortedIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEEE9SharedPtrcvbEv
-FN:81,_ZN6wibble4list6SortedINS0_8FilteredIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE1EEENSA_10PropertifyILSC_1ENS7_9IsInGroupEEEEEE9SharedPtrcvbEv
-FN:81,_ZN6wibble4list6SortedINS0_3MapIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE0EEESt25pointer_to_unary_functionISD_SsEEEE9SharedPtrcvbEv
-FN:59,_ZN6wibble4list6SortedIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEEE9SharedVecC1Ev
-FN:43,_ZNK6wibble4list12ListIteratorIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEEEneERKSD_
-FN:59,_ZN6wibble4list6SortedINS0_8FilteredIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE1EEENSA_10PropertifyILSC_1ENS7_9IsInGroupEEEEEE9SharedVecC1Ev
-FN:270,_ZNK6wibble4list3MapIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEESt25pointer_to_unary_functionISC_SsEE5emptyEv
-FN:43,_ZNK6wibble4list12ListIteratorINS0_3MapIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE0EEESt25pointer_to_unary_functionISD_SsEEEEneERKSH_
-FN:253,_ZNK6wibble4list3MapIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEESt25pointer_to_unary_functionISC_SsEE1fEv
-FN:274,_ZN6wibble4list3MapIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEESt25pointer_to_unary_functionISC_SsEEC1Ev
-FN:246,_ZN6wibble4list3MapIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEESt25pointer_to_unary_functionISC_SsEED1Ev
-FN:15,_ZN6wibble4list12ListIteratorINS0_3MapIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE0EEESt25pointer_to_unary_functionISD_SsEEEED1Ev
-FN:15,_ZN6wibble4list12ListIteratorIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEEED1Ev
-FN:174,_ZN6wibble4list8FilteredIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE1EEENS9_10PropertifyILSB_1ENS6_9IsInGroupEEEEC1Ev
-FN:140,_ZN6wibble4list8FilteredIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE1EEENS9_10PropertifyILSB_1ENS6_9IsInGroupEEEED1Ev
-FN:15,_ZN6wibble4list12ListIteratorINS0_8FilteredIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE1EEENSA_10PropertifyILSC_1ENS7_9IsInGroupEEEEEED1Ev
-FN:56,_ZN6wibble4list6SortedINS0_3MapIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE0EEESt25pointer_to_unary_functionISD_SsEEEE9SharedVecD1Ev
-FN:85,_ZN6wibble4list6SortedINS0_3MapIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE0EEESt25pointer_to_unary_functionISD_SsEEEE9SharedPtrD1Ev
-FN:54,_ZN6wibble4list6SortedINS0_3MapIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE0EEESt25pointer_to_unary_functionISD_SsEEEED1Ev
-FN:179,_ZN6wibble4list6UniqueINS0_6SortedINS0_3MapIN3ept4core6SourceINS5_7desktop6SourceENS7_5SetupENS7_12PropertyTypeEE12ComposedListILNS7_10PropertyIdE0EEESt25pointer_to_unary_functionISE_SsEEEEEED1Ev
-FN:56,_ZN6wibble4list6SortedINS0_8FilteredIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE1EEENSA_10PropertifyILSC_1ENS7_9IsInGroupEEEEEE9SharedVecD1Ev
-FN:85,_ZN6wibble4list6SortedINS0_8FilteredIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE1EEENSA_10PropertifyILSC_1ENS7_9IsInGroupEEEEEE9SharedPtrD1Ev
-FN:54,_ZN6wibble4list6SortedINS0_8FilteredIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE1EEENSA_10PropertifyILSC_1ENS7_9IsInGroupEEEEEED1Ev
-FN:56,_ZN6wibble4list6SortedIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEEE9SharedVecD1Ev
-FN:85,_ZN6wibble4list6SortedIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEEE9SharedPtrD1Ev
-FN:54,_ZN6wibble4list6SortedIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEEED1Ev
-FN:275,_ZN6wibble4list3MapIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEESt25pointer_to_unary_functionISC_SsEEC1ERKSC_RKSE_
-FN:382,_ZN6wibble4list3mapIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEESt25pointer_to_unary_functionISC_SsEEENS0_3MapIT_T0_EERKSG_RKSH_
-FN:246,_ZN6wibble4list3MapIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEESt25pointer_to_unary_functionISC_SsEEC1ERKSF_
-FN:125,_ZN6wibble4list6SortedINS0_3MapIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE0EEESt25pointer_to_unary_functionISD_SsEEEEC1ERKSH_
-FN:213,_ZN6wibble4list6UniqueINS0_6SortedINS0_3MapIN3ept4core6SourceINS5_7desktop6SourceENS7_5SetupENS7_12PropertyTypeEE12ComposedListILNS7_10PropertyIdE0EEESt25pointer_to_unary_functionISE_SsEEEEEEC1ESI_
-FN:394,_ZN6wibble4list6uniqueINS0_6SortedINS0_3MapIN3ept4core6SourceINS5_7desktop6SourceENS7_5SetupENS7_12PropertyTypeEE12ComposedListILNS7_10PropertyIdE0EEESt25pointer_to_unary_functionISE_SsEEEEEEENS0_6UniqueIT_EESK_
-FN:179,_ZN6wibble4list6UniqueINS0_6SortedINS0_3MapIN3ept4core6SourceINS5_7desktop6SourceENS7_5SetupENS7_12PropertyTypeEE12ComposedListILNS7_10PropertyIdE0EEESt25pointer_to_unary_functionISE_SsEEEEEEC1ERKSJ_
-FN:47,_ZN6wibble4list12ListIteratorINS0_3MapIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE0EEESt25pointer_to_unary_functionISD_SsEEEEC1ESG_
-FN:15,_ZN6wibble4list12ListIteratorINS0_3MapIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE0EEESt25pointer_to_unary_functionISD_SsEEEEC1ERKSH_
-FN:259,_ZNK6wibble4list3MapIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEESt25pointer_to_unary_functionISC_SsEE4headEv
-FN:35,_ZN6wibble4list12ListIteratorINS0_3MapIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE0EEESt25pointer_to_unary_functionISD_SsEEEEdeEv
-FN:47,_ZN6wibble4list12ListIteratorIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEEEC1ESC_
-FN:15,_ZN6wibble4list12ListIteratorIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEEEC1ERKSD_
-FN:35,_ZN6wibble4list12ListIteratorIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEEEdeEv
-FN:125,_ZN6wibble4list6SortedIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEEEC1ERKSD_
-FN:169,_ZN6wibble4list8FilteredIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE1EEENS9_10PropertifyILSB_1ENS6_9IsInGroupEEEEC1ESC_SF_
-FN:370,_ZN6wibble4list6filterIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE1EEENS9_10PropertifyILSB_1ENS6_9IsInGroupEEEEENS0_8FilteredIT_T0_EESH_SI_
-FN:140,_ZN6wibble4list8FilteredIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE1EEENS9_10PropertifyILSB_1ENS6_9IsInGroupEEEEC1ERKSG_
-FN:47,_ZN6wibble4list12ListIteratorINS0_8FilteredIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE1EEENSA_10PropertifyILSC_1ENS7_9IsInGroupEEEEEEC1ESH_
-FN:15,_ZN6wibble4list12ListIteratorINS0_8FilteredIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE1EEENSA_10PropertifyILSC_1ENS7_9IsInGroupEEEEEEC1ERKSI_
-FN:125,_ZN6wibble4list6SortedINS0_8FilteredIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE1EEENSA_10PropertifyILSC_1ENS7_9IsInGroupEEEEEEC1ERKSI_
-FN:66,_ZN6wibble4list6SortedINS0_3MapIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE0EEESt25pointer_to_unary_functionISD_SsEEEE9SharedPtrC1Eb
-FN:135,_ZN6wibble4list6SortedINS0_3MapIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE0EEESt25pointer_to_unary_functionISD_SsEEEEC1ESG_
-FN:388,_ZN6wibble4list4sortINS0_3MapIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE0EEESt25pointer_to_unary_functionISD_SsEEEEENS0_6SortedIT_EESI_
-FN:66,_ZN6wibble4list6SortedINS0_8FilteredIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE1EEENSA_10PropertifyILSC_1ENS7_9IsInGroupEEEEEE9SharedPtrC1Eb
-FN:135,_ZN6wibble4list6SortedINS0_8FilteredIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE1EEENSA_10PropertifyILSC_1ENS7_9IsInGroupEEEEEEC1ESH_
-FN:388,_ZN6wibble4list4sortINS0_8FilteredIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE1EEENSA_10PropertifyILSC_1ENS7_9IsInGroupEEEEEEENS0_6SortedIT_EESJ_
-FN:66,_ZN6wibble4list6SortedIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEEE9SharedPtrC1Eb
-FN:135,_ZN6wibble4list6SortedIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEEEC1ESC_
-FN:388,_ZN6wibble4list4sortIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEEEENS0_6SortedIT_EESE_
-FN:246,_ZN6wibble4list3MapIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEESt25pointer_to_unary_functionISC_SsEEaSERKSF_
-FN:128,_ZN6wibble4list6SortedINS0_3MapIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE0EEESt25pointer_to_unary_functionISD_SsEEEEaSERKSH_
-FN:179,_ZN6wibble4list6UniqueINS0_6SortedINS0_3MapIN3ept4core6SourceINS5_7desktop6SourceENS7_5SetupENS7_12PropertyTypeEE12ComposedListILNS7_10PropertyIdE0EEESt25pointer_to_unary_functionISE_SsEEEEEEaSERKSJ_
-FN:128,_ZN6wibble4list6SortedIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEEEaSERKSD_
-FN:140,_ZN6wibble4list8FilteredIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE1EEENS9_10PropertifyILSB_1ENS6_9IsInGroupEEEEaSERKSG_
-FN:128,_ZN6wibble4list6SortedINS0_8FilteredIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE1EEENSA_10PropertifyILSC_1ENS7_9IsInGroupEEEEEEaSERKSI_
-FN:263,_ZNK6wibble4list3MapIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEESt25pointer_to_unary_functionISC_SsEE4tailEv
-FN:24,_ZN6wibble4list12ListIteratorINS0_3MapIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE0EEESt25pointer_to_unary_functionISD_SsEEEEppEv
-FN:24,_ZN6wibble4list12ListIteratorIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEEEppEv
-FN:155,_ZNK6wibble4list8FilteredIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE1EEENS9_10PropertifyILSB_1ENS6_9IsInGroupEEEE4seekEv
-FN:150,_ZNK6wibble4list8FilteredIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE1EEENS9_10PropertifyILSB_1ENS6_9IsInGroupEEEE4headEv
-FN:35,_ZN6wibble4list12ListIteratorINS0_8FilteredIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE1EEENSA_10PropertifyILSC_1ENS7_9IsInGroupEEEEEEdeEv
-FN:161,_ZNK6wibble4list8FilteredIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE1EEENS9_10PropertifyILSB_1ENS6_9IsInGroupEEEE4tailEv
-FN:24,_ZN6wibble4list12ListIteratorINS0_8FilteredIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE1EEENSA_10PropertifyILSC_1ENS7_9IsInGroupEEEEEEppEv
-FN:145,_ZNK6wibble4list8FilteredIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE1EEENS9_10PropertifyILSB_1ENS6_9IsInGroupEEEE5emptyEv
-FN:43,_ZNK6wibble4list12ListIteratorINS0_8FilteredIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE1EEENSA_10PropertifyILSC_1ENS7_9IsInGroupEEEEEEneERKSI_
-FN:99,_ZNK6wibble4list6SortedINS0_8FilteredIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE1EEENSA_10PropertifyILSC_1ENS7_9IsInGroupEEEEEE4sortEv
-FN:108,_ZNK6wibble4list6SortedINS0_8FilteredIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE1EEENSA_10PropertifyILSC_1ENS7_9IsInGroupEEEEEE4headEv
-FN:113,_ZNK6wibble4list6SortedINS0_8FilteredIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE1EEENSA_10PropertifyILSC_1ENS7_9IsInGroupEEEEEE4tailEv
-FN:120,_ZNK6wibble4list6SortedINS0_8FilteredIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE1EEENSA_10PropertifyILSC_1ENS7_9IsInGroupEEEEEE5emptyEv
-FN:99,_ZNK6wibble4list6SortedIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEEE4sortEv
-FN:108,_ZNK6wibble4list6SortedIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEEE4headEv
-FN:113,_ZNK6wibble4list6SortedIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEEE4tailEv
-FN:120,_ZNK6wibble4list6SortedIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEEE5emptyEv
-FN:99,_ZNK6wibble4list6SortedINS0_3MapIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE0EEESt25pointer_to_unary_functionISD_SsEEEE4sortEv
-FN:120,_ZNK6wibble4list6SortedINS0_3MapIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE0EEESt25pointer_to_unary_functionISD_SsEEEE5emptyEv
-FN:113,_ZNK6wibble4list6SortedINS0_3MapIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE0EEESt25pointer_to_unary_functionISD_SsEEEE4tailEv
-FN:108,_ZNK6wibble4list6SortedINS0_3MapIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE0EEESt25pointer_to_unary_functionISD_SsEEEE4headEv
-FN:193,_ZNK6wibble4list6UniqueINS0_6SortedINS0_3MapIN3ept4core6SourceINS5_7desktop6SourceENS7_5SetupENS7_12PropertyTypeEE12ComposedListILNS7_10PropertyIdE0EEESt25pointer_to_unary_functionISE_SsEEEEEE4seekEv
-FN:205,_ZNK6wibble4list6UniqueINS0_6SortedINS0_3MapIN3ept4core6SourceINS5_7desktop6SourceENS7_5SetupENS7_12PropertyTypeEE12ComposedListILNS7_10PropertyIdE0EEESt25pointer_to_unary_functionISE_SsEEEEEE4tailEv
-FN:183,_ZNK6wibble4list6UniqueINS0_6SortedINS0_3MapIN3ept4core6SourceINS5_7desktop6SourceENS7_5SetupENS7_12PropertyTypeEE12ComposedListILNS7_10PropertyIdE0EEESt25pointer_to_unary_functionISE_SsEEEEEE5emptyEv
-FN:188,_ZNK6wibble4list6UniqueINS0_6SortedINS0_3MapIN3ept4core6SourceINS5_7desktop6SourceENS7_5SetupENS7_12PropertyTypeEE12ComposedListILNS7_10PropertyIdE0EEESt25pointer_to_unary_functionISE_SsEEEEEE4headEv
-DA:15,88
-DA:24,14
-DA:25,14
-DA:26,14
-DA:35,14
-DA:36,14
-DA:43,18
-DA:44,18
-DA:47,8
-DA:48,8
-DA:54,40
-DA:56,0
-DA:59,4
-DA:60,55
-DA:61,42
-DA:66,8
-DA:68,36
-DA:69,36
-DA:70,36
-DA:71,34
-DA:72,36
-DA:74,21
-DA:75,21
-DA:76,21
-DA:77,21
-DA:78,21
-DA:81,96
-DA:82,31
-DA:83,46
-DA:85,44
-DA:86,44
-DA:87,42
-DA:88,42
-DA:89,0
-DA:91,44
-DA:99,96
-DA:100,96
-DA:101,92
-DA:102,4
-DA:103,8
-DA:105,4
-DA:108,27
-DA:109,27
-DA:110,27
-DA:113,31
-DA:114,31
-DA:115,31
-DA:116,31
-DA:120,38
-DA:121,38
-DA:122,38
-DA:125,36
-DA:126,36
-DA:128,17
-DA:129,17
-DA:130,17
-DA:131,17
-DA:132,17
-DA:135,4
-DA:140,46
-DA:145,4
-DA:146,4
-DA:147,4
-DA:150,2
-DA:151,2
-DA:152,2
-DA:155,8
-DA:157,18
-DA:158,2
-DA:159,8
-DA:161,2
-DA:163,2
-DA:164,2
-DA:165,2
-DA:166,0
-DA:169,1
-DA:170,1
-DA:171,0
-DA:172,1
-DA:174,1
-DA:179,10
-DA:183,4
-DA:184,4
-DA:185,4
-DA:188,3
-DA:189,3
-DA:190,3
-DA:193,11
-DA:195,11
-DA:196,1
-DA:197,10
-DA:198,3
-DA:199,7
-DA:200,1
-DA:201,1
-DA:205,3
-DA:207,3
-DA:208,3
-DA:209,3
-DA:210,0
-DA:213,1
-DA:214,1
-DA:216,1
-DA:246,99
-DA:250,5
-DA:251,5
-DA:253,8
-DA:254,8
-DA:259,4
-DA:260,4
-DA:263,4
-DA:264,4
-DA:265,4
-DA:266,4
-DA:267,0
-DA:270,6
-DA:271,6
-DA:274,5
-DA:275,1
-DA:276,1
-DA:278,1
-DA:279,1
-DA:370,1
-DA:372,1
-DA:382,1
-DA:384,1
-DA:388,4
-DA:390,4
-DA:394,1
-DA:396,1
-BA:44,2
-BA:44,2
-BA:44,1
-BA:44,2
-BA:44,2
-BA:44,2
-BA:44,1
-BA:44,2
-BA:44,2
-BA:44,2
-BA:44,1
-BA:44,2
-BA:66,2
-BA:66,2
-BA:66,2
-BA:66,2
-BA:66,2
-BA:66,2
-BA:70,2
-BA:70,2
-BA:70,2
-BA:70,1
-BA:70,2
-BA:70,1
-BA:76,2
-BA:76,1
-BA:76,2
-BA:76,1
-BA:76,2
-BA:76,1
-BA:86,2
-BA:86,2
-BA:86,2
-BA:86,1
-BA:86,2
-BA:86,1
-BA:88,1
-BA:88,2
-BA:88,1
-BA:88,2
-BA:88,1
-BA:88,2
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:100,2
-BA:100,2
-BA:100,2
-BA:100,2
-BA:100,2
-BA:100,2
-BA:157,2
-BA:157,2
-BA:157,2
-BA:157,2
-BA:157,2
-BA:157,2
-BA:195,2
-BA:195,2
-BA:197,2
-BA:197,2
-BA:199,2
-BA:199,2
-LF:130
-LH:124
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/mixin.h
-FN:13,_ZN6wibble5mixin10ComparableIN3ept5TokenEEC2Ev
-FN:13,_ZN6wibble5mixin10ComparableIN3ept4core7desktop5EntryEEC2Ev
-FN:13,_ZN6wibble5mixin10ComparableIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEEEC2Ev
-FN:13,_ZN6wibble5mixin10ComparableIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE1EEEEC2Ev
-FN:15,_ZNK6wibble5mixin10ComparableIN3ept5TokenEE7cmpSelfEv
-FN:23,_ZNK6wibble5mixin10ComparableIN3ept5TokenEEeqERKS3_
-FN:19,_ZNK6wibble5mixin10ComparableIN3ept5TokenEEneERKS3_
-FN:27,_ZNK6wibble5mixin10ComparableIN3ept5TokenEEltERKS3_
-DA:13,9809
-DA:15,82
-DA:16,82
-DA:19,19
-DA:20,19
-DA:23,23
-DA:24,23
-DA:27,13
-DA:28,13
-BA:24,2
-BA:24,2
-BA:24,2
-BA:24,2
-BA:28,2
-BA:28,2
-BA:28,2
-BA:28,1
-LF:9
-LH:9
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/operators.h
-FN:29,_ZN6wibble9operatorsplISt23_Rb_tree_const_iteratorISsEEET_RKS4_NS4_15difference_typeE
-DA:29,48
-DA:30,48
-DA:31,48
-LF:3
-LH:3
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/string.h
-FN:59,_ZN6wibble3strL3fmtESsz
-FN:84,_ZN6wibble3str13fmt_containerISt3setISsSt4lessISsESaISsEEEESsRKT_cc
-FN:104,_ZN6wibble3str3fmtISsEESsRKSt3setIT_St4lessIS3_ESaIS3_EE
-FN:153,_ZN6wibble3str8endsWithERKSsS2_
-DA:59,48
-DA:62,48
-DA:63,48
-DA:64,48
-DA:65,48
-DA:84,16
-DA:86,16
-DA:87,16
-DA:88,16
-DA:89,0
-DA:91,16
-DA:92,64
-DA:93,48
-DA:94,48
-DA:95,32
-DA:97,16
-DA:98,16
-DA:99,16
-DA:104,16
-DA:105,16
-DA:153,16
-DA:155,16
-DA:156,0
-DA:157,16
-BA:88,1
-BA:88,2
-BA:92,2
-BA:92,2
-BA:94,2
-BA:94,1
-BA:94,2
-BA:94,2
-BA:94,2
-BA:94,2
-BA:155,1
-BA:155,2
-LF:24
-LH:22
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:13,_ZN8LocationD1Ev
-FN:17,_ZN8LocationC1EPKciSs
-FN:13,_ZN8LocationC1ERKS_
-FN:52,_ZlsIiER12AssertFailedS1_T_
-FN:52,_ZlsISsER12AssertFailedS1_T_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:52,_ZlsIPKcER12AssertFailedS3_T_
-FN:41,_ZN12AssertFailedD1Ev
-FN:59,_Z9assert_fnIbEv8LocationT_
-FN:67,_Z12assert_eq_fnIiiEv8LocationT_T0_
-FN:67,_Z12assert_eq_fnISsPKcEv8LocationT_T0_
-FN:79,_Z17assert_list_eq_fnIN6wibble4list6UniqueINS1_6SortedINS1_3MapIN3ept4core6SourceINS6_7desktop6SourceENS8_5SetupENS8_12PropertyTypeEE12ComposedListILNS8_10PropertyIdE0EEESt25pointer_to_unary_functionISF_SsEEEEEEEEv8LocationiT_PKNSM_4TypeE
-DA:13,108754
-DA:17,108754
-DA:18,108754
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:59,96375
-DA:61,96375
-DA:62,0
-DA:64,96375
-DA:67,2800
-DA:69,2800
-DA:70,0
-DA:71,0
-DA:75,2800
-DA:79,1
-DA:81,1
-DA:82,5
-DA:83,3
-DA:84,0
-DA:85,0
-DA:90,3
-DA:91,3
-DA:93,1
-DA:94,0
-DA:95,0
-DA:98,1
-BA:42,0
-BA:42,0
-BA:61,1
-BA:61,2
-BA:69,1
-BA:69,2
-BA:69,1
-BA:69,2
-BA:82,2
-BA:82,2
-BA:83,1
-BA:83,2
-BA:93,1
-BA:93,2
-LF:38
-LH:17
-end_of_record
-SF:/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_desktop.cpp
-FN:7,_Z41__static_initialization_and_destruction_0ii
-FN:7,_GLOBAL__I_ept_test_generated__home_mornfall_dev_pkg_ept_work_ept_core_desktop.cpp
-FN:7,_Z26run_Desktop_emptyGroupListv
-FN:5,_Z18run_Desktop_groupsv
-FN:4,_Z25run_Desktop_groupPropertyv
-FN:3,_Z21run_Desktop_iterationv
-FN:6,_Z21run_Desktop_groupListv
-DA:3,1
-DA:4,1
-DA:5,1
-DA:6,1
-DA:7,4
-BA:7,2
-BA:7,1
-BA:7,2
-BA:7,1
-LF:5
-LH:5
-end_of_record
-SF:/usr/include/c++/4.3/backward/binders.h
-FN:103,_ZNSt9binder1stISt8equal_toISsEED1Ev
-FN:110,_ZNSt9binder1stISt8equal_toISsEEC1ERKS1_RKSs
-FN:127,_ZSt7bind1stISt8equal_toISsEA1_cESt9binder1stIT_ERKS4_RKT0_
-FN:114,_ZNKSt9binder1stISt8equal_toISsEEclERKSs
-DA:103,16
-DA:110,16
-DA:111,16
-DA:114,64
-DA:115,64
-DA:127,16
-DA:130,16
-LF:7
-LH:7
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsN3ept4core7desktop4File5EntryEEEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISsEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsN3ept4core7desktop4File5GroupEEEED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaISsED1Ev
-FN:106,_ZNSaISsED2Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsN3ept4core7desktop4File5EntryEEEEC2Ev
-FN:106,_ZNSaISt4pairIKSsN3ept4core7desktop4File5EntryEEED1Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeISsEEC2Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsN3ept4core7desktop4File5GroupEEEEC2Ev
-FN:106,_ZNSaISt4pairIKSsN3ept4core7desktop4File5GroupEEED1Ev
-FN:100,_ZNSaISt13_Rb_tree_nodeISsEEC2ERKS1_
-FN:104,_ZNSaISsEC1ISt13_Rb_tree_nodeISsEEERKSaIT_E
-FN:98,_ZNSaISsEC2Ev
-FN:104,_ZNSaISt4pairIKSsN3ept4core7desktop4File5EntryEEEC1ISt13_Rb_tree_nodeIS6_EEERKSaIT_E
-FN:104,_ZNSaISt4pairIKSsN3ept4core7desktop4File5GroupEEEC1ISt13_Rb_tree_nodeIS6_EEERKSaIT_E
-FN:106,_ZNSaIN3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE0EEEED2Ev
-FN:106,_ZNSaIN3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE1EEEED2Ev
-FN:100,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsN3ept4core7desktop4File5EntryEEEEC2ERKS9_
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-FN:98,_ZNSaIN3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE0EEEEC2Ev
-FN:98,_ZNSaIN3ept4core6SourceINS0_7desktop6SourceENS2_5SetupENS2_12PropertyTypeEE12ComposedListILNS2_10PropertyIdE1EEEEC2Ev
-DA:98,89225
-DA:100,404651
-DA:101,404651
-DA:104,3521490
-DA:106,4015352
-DA:118,0
-DA:119,0
-LF:7
-LH:5
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:195,_ZNKSt9basic_iosIcSt11char_traitsIcEE4failEv
-FN:115,_ZNKSt9basic_iosIcSt11char_traitsIcEEcvPvEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:115,0
-DA:116,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:195,0
-DA:196,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:116,0
-BA:116,0
-BA:276,0
-BA:276,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:1534,_ZNKSs5c_strEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:192,_ZNKSs4_Rep12_M_is_sharedEv
-FN:652,_ZNKSs8capacityEv
-FN:392,_ZNSs10_S_compareEjj
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2136,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S3_
-FN:773,_ZNSspLERKSs
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-FN:835,_ZNSs6appendEPKc
-FN:782,_ZNSspLEPKc
-FN:2121,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_
-FN:870,_ZNSs9push_backEc
-FN:791,_ZNSspLEc
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-FN:2162,_ZSteqIcEN9__gnu_cxx11__enable_ifIXsrSt9__is_charIT_E7__valueEbE6__typeERKSbIS3_St11char_traitsIS3_ESaIS3_EESC_
-FN:2201,_ZStneIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:1941,_ZNKSs7compareERKSs
-FN:2238,_ZStltIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:2312,_ZStleIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:2188,_ZSteqIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_EPKS3_
-FN:306,_ZNKSs8_M_checkEjPKc
-FN:1923,_ZNKSs6substrEjj
-FN:928,_ZNSs6assignEPKc
-FN:509,_ZNSsaSEPKc
-FN:2386,_ZSt4swapIcSt11char_traitsIcESaIcEEvRSbIT_T0_T1_ES7_
-DA:178,0
-DA:183,0
-DA:184,0
-DA:192,0
-DA:193,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:306,0
-DA:308,0
-DA:309,0
-DA:310,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:392,0
-DA:394,0
-DA:401,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:509,0
-DA:510,0
-DA:606,0
-DA:607,0
-DA:652,0
-DA:653,0
-DA:773,0
-DA:774,0
-DA:782,0
-DA:783,0
-DA:791,0
-DA:793,0
-DA:794,0
-DA:835,0
-DA:838,0
-DA:870,0
-DA:872,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:877,0
-DA:928,0
-DA:931,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:1923,0
-DA:1925,0
-DA:1941,0
-DA:1943,0
-DA:1944,0
-DA:1945,0
-DA:1947,0
-DA:1948,0
-DA:1949,0
-DA:1950,0
-DA:2067,0
-DA:2069,0
-DA:2084,715348
-DA:2086,715348
-DA:2087,715348
-DA:2088,0
-DA:2121,5953
-DA:2123,5953
-DA:2124,5953
-DA:2125,0
-DA:2136,131
-DA:2140,131
-DA:2141,131
-DA:2142,0
-DA:2162,134641
-DA:2165,134641
-DA:2188,156334
-DA:2189,156334
-DA:2201,84867
-DA:2202,84867
-DA:2238,4884789
-DA:2239,4884789
-DA:2312,58
-DA:2313,58
-DA:2386,0
-DA:2387,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:308,0
-BA:308,0
-BA:341,0
-BA:341,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:1948,0
-BA:1948,0
-BA:2165,2
-BA:2165,2
-BA:2165,2
-BA:2165,2
-LF:118
-LH:19
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-DA:245,0
-DA:246,0
-DA:257,114992
-DA:258,114992
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:8
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:121,_ZStanSt13_Ios_OpenmodeS_
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:159,_ZStanSt12_Ios_IostateS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:121,0
-DA:122,0
-DA:125,0
-DA:126,0
-DA:159,0
-DA:160,0
-DA:163,0
-DA:164,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algo.h
-FN:1555,_ZSt13__heap_selectIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEEEvT_S7_S7_
-FN:4622,_ZSt12partial_sortIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEEEvT_S7_S7_
-FN:89,_ZSt8__medianISsERKT_S2_S2_S2_
-FN:1714,_ZSt25__unguarded_linear_insertIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESsEvT_T0_
-FN:1793,_ZSt26__unguarded_insertion_sortIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEEEvT_S7_
-FN:1748,_ZSt16__insertion_sortIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEEEvT_S7_
-FN:1825,_ZSt22__final_insertion_sortIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEEEvT_S7_
-FN:724,_ZSt14remove_copy_ifISt16istream_iteratorIN3ept4core7desktop8CategoryEcSt11char_traitsIcEiESt15insert_iteratorISt3setISsSt4lessISsESaISsEEESt9binder1stISt8equal_toISsEEET0_T_SK_SJ_T1_
-FN:1555,_ZSt13__heap_selectIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE1EEESt6vectorISC_SaISC_EEEEEvT_SI_SI_
-FN:4622,_ZSt12partial_sortIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE1EEESt6vectorISC_SaISC_EEEEEvT_SI_SI_
-FN:89,_ZSt8__medianIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE1EEEERKT_SD_SD_SD_
-FN:1856,_ZSt21__unguarded_partitionIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE1EEESt6vectorISC_SaISC_EEEESC_ET_SI_SI_T0_
-FN:1898,_ZSt16__introsort_loopIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE1EEESt6vectorISC_SaISC_EEEEiEvT_SI_T0_
-FN:1714,_ZSt25__unguarded_linear_insertIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE1EEESt6vectorISC_SaISC_EEEESC_EvT_T0_
-FN:1793,_ZSt26__unguarded_insertion_sortIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE1EEESt6vectorISC_SaISC_EEEEEvT_SI_
-FN:1748,_ZSt16__insertion_sortIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE1EEESt6vectorISC_SaISC_EEEEEvT_SI_
-FN:1825,_ZSt22__final_insertion_sortIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE1EEESt6vectorISC_SaISC_EEEEEvT_SI_
-FN:1555,_ZSt13__heap_selectIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEESt6vectorISC_SaISC_EEEEEvT_SI_SI_
-FN:4622,_ZSt12partial_sortIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEESt6vectorISC_SaISC_EEEEEvT_SI_SI_
-FN:89,_ZSt8__medianIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE0EEEERKT_SD_SD_SD_
-FN:1856,_ZSt21__unguarded_partitionIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEESt6vectorISC_SaISC_EEEESC_ET_SI_SI_T0_
-FN:1898,_ZSt16__introsort_loopIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEESt6vectorISC_SaISC_EEEEiEvT_SI_T0_
-FN:1714,_ZSt25__unguarded_linear_insertIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEESt6vectorISC_SaISC_EEEESC_EvT_T0_
-FN:1793,_ZSt26__unguarded_insertion_sortIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEESt6vectorISC_SaISC_EEEEEvT_SI_
-FN:1748,_ZSt16__insertion_sortIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEESt6vectorISC_SaISC_EEEEEvT_SI_
-FN:1825,_ZSt22__final_insertion_sortIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEESt6vectorISC_SaISC_EEEEEvT_SI_
-FN:1970,_ZSt4__lgi
-FN:4770,_ZSt4sortIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE1EEESt6vectorISC_SaISC_EEEEEvT_SI_
-FN:4770,_ZSt4sortIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEESt6vectorISC_SaISC_EEEEEvT_SI_
-FN:1856,_ZSt21__unguarded_partitionIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESsET_S7_S7_T0_
-FN:1898,_ZSt16__introsort_loopIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEEiEvT_S7_T0_
-FN:4770,_ZSt4sortIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEEEvT_S7_
-DA:89,0
-DA:93,0
-DA:94,0
-DA:95,0
-DA:96,0
-DA:97,0
-DA:99,0
-DA:100,0
-DA:101,0
-DA:102,0
-DA:103,0
-DA:105,0
-DA:724,16
-DA:734,80
-DA:735,64
-DA:737,48
-DA:738,48
-DA:740,16
-DA:1555,0
-DA:1557,0
-DA:1558,0
-DA:1559,0
-DA:1560,0
-DA:1561,0
-DA:1714,225
-DA:1716,225
-DA:1717,225
-DA:1718,745
-DA:1720,295
-DA:1721,295
-DA:1722,295
-DA:1724,225
-DA:1725,225
-DA:1748,77
-DA:1750,77
-DA:1751,0
-DA:1753,452
-DA:1756,375
-DA:1757,375
-DA:1759,150
-DA:1760,150
-DA:1763,225
-DA:1793,0
-DA:1798,0
-DA:1799,0
-DA:1800,0
-DA:1825,77
-DA:1827,77
-DA:1829,0
-DA:1830,0
-DA:1833,77
-DA:1834,77
-DA:1856,0
-DA:1858,0
-DA:1860,0
-DA:1861,0
-DA:1862,0
-DA:1863,0
-DA:1864,0
-DA:1865,0
-DA:1866,0
-DA:1867,0
-DA:1868,0
-DA:1898,77
-DA:1903,154
-DA:1905,0
-DA:1907,0
-DA:1908,0
-DA:1910,0
-DA:1919,0
-DA:1920,0
-DA:1921,0
-DA:1970,3942
-DA:1971,3942
-DA:4622,0
-DA:4634,0
-DA:4635,0
-DA:4636,0
-DA:4770,4
-DA:4781,4
-DA:4783,4
-DA:4785,4
-DA:4787,4
-BA:93,0
-BA:93,0
-BA:93,0
-BA:93,0
-BA:93,0
-BA:93,0
-BA:94,0
-BA:94,0
-BA:94,0
-BA:94,0
-BA:94,0
-BA:94,0
-BA:96,0
-BA:96,0
-BA:96,0
-BA:96,0
-BA:96,0
-BA:96,0
-BA:100,0
-BA:100,0
-BA:100,0
-BA:100,0
-BA:100,0
-BA:100,0
-BA:102,0
-BA:102,0
-BA:102,0
-BA:102,0
-BA:102,0
-BA:102,0
-BA:734,2
-BA:734,2
-BA:735,2
-BA:735,2
-BA:1558,0
-BA:1558,0
-BA:1558,0
-BA:1558,0
-BA:1558,0
-BA:1558,0
-BA:1559,0
-BA:1559,0
-BA:1559,0
-BA:1559,0
-BA:1559,0
-BA:1559,0
-BA:1718,2
-BA:1718,2
-BA:1718,0
-BA:1718,0
-BA:1718,2
-BA:1718,2
-BA:1750,1
-BA:1750,2
-BA:1750,1
-BA:1750,2
-BA:1750,1
-BA:1750,2
-BA:1753,2
-BA:1753,2
-BA:1753,2
-BA:1753,2
-BA:1753,2
-BA:1753,2
-BA:1757,2
-BA:1757,2
-BA:1757,2
-BA:1757,1
-BA:1757,2
-BA:1757,2
-BA:1798,0
-BA:1798,0
-BA:1798,0
-BA:1798,0
-BA:1798,0
-BA:1798,0
-BA:1827,1
-BA:1827,2
-BA:1827,1
-BA:1827,2
-BA:1827,1
-BA:1827,2
-BA:1860,0
-BA:1860,0
-BA:1860,0
-BA:1860,0
-BA:1860,0
-BA:1860,0
-BA:1863,0
-BA:1863,0
-BA:1863,0
-BA:1863,0
-BA:1863,0
-BA:1863,0
-BA:1865,0
-BA:1865,0
-BA:1865,0
-BA:1865,0
-BA:1865,0
-BA:1865,0
-BA:1903,1
-BA:1903,2
-BA:1903,1
-BA:1903,2
-BA:1903,1
-BA:1903,2
-BA:1905,0
-BA:1905,0
-BA:1905,0
-BA:1905,0
-BA:1905,0
-BA:1905,0
-BA:4781,2
-BA:4781,1
-BA:4781,2
-BA:4781,1
-BA:4781,2
-BA:4781,1
-LF:83
-LH:36
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:188,_ZSt3minIjERKT_S2_S2_
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb0EE3__bES6_
-FN:286,_ZNSt12__miter_baseIPSsLb0EE3__bES0_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb1EE3__bES6_
-FN:268,_ZNSt12__niter_baseISt20back_insert_iteratorISt6vectorISsSaISsEEELb0EE3__bES4_
-FN:268,_ZNSt12__niter_baseIPSsLb0EE3__bES0_
-FN:268,_ZNSt12__niter_baseISt20back_insert_iteratorISt6vectorIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEESaISC_EEELb0EE3__bESF_
-FN:268,_ZNSt12__niter_baseISt20back_insert_iteratorISt6vectorIN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE1EEESaISC_EEELb0EE3__bESF_
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEESt6vectorISC_SaISC_EEEELb0EE3__bESH_
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE1EEESt6vectorISC_SaISC_EEEELb0EE3__bESH_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEESt6vectorISC_SaISC_EEEELb1EE3__bESH_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE1EEESt6vectorISC_SaISC_EEEELb1EE3__bESH_
-FN:286,_ZNSt12__miter_baseIPN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE0EEELb0EE3__bESB_
-FN:286,_ZNSt12__miter_baseIPN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE1EEELb0EE3__bESB_
-FN:268,_ZNSt12__niter_baseIPN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE0EEELb0EE3__bESB_
-FN:268,_ZNSt12__niter_baseIPN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE1EEELb0EE3__bESB_
-FN:286,_ZNSt12__miter_baseIN6wibble4list12ListIteratorINS1_3MapIN3ept4core6SourceINS5_7desktop6SourceENS7_5SetupENS7_12PropertyTypeEE12ComposedListILNS7_10PropertyIdE0EEESt25pointer_to_unary_functionISE_SsEEEEELb0EE3__bESI_
-FN:268,_ZNSt12__niter_baseIN6wibble4list12ListIteratorINS1_3MapIN3ept4core6SourceINS5_7desktop6SourceENS7_5SetupENS7_12PropertyTypeEE12ComposedListILNS7_10PropertyIdE0EEESt25pointer_to_unary_functionISE_SsEEEEELb0EE3__bESI_
-FN:286,_ZNSt12__miter_baseIN6wibble4list12ListIteratorIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE0EEEEELb0EE3__bESE_
-FN:268,_ZNSt12__niter_baseIN6wibble4list12ListIteratorIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE0EEEEELb0EE3__bESE_
-FN:286,_ZNSt12__miter_baseIN6wibble4list12ListIteratorINS1_8FilteredIN3ept4core6SourceINS5_7desktop6SourceENS7_5SetupENS7_12PropertyTypeEE12ComposedListILNS7_10PropertyIdE1EEENSB_10PropertifyILSD_1ENS8_9IsInGroupEEEEEEELb0EE3__bESJ_
-FN:268,_ZNSt12__niter_baseIN6wibble4list12ListIteratorINS1_8FilteredIN3ept4core6SourceINS5_7desktop6SourceENS7_5SetupENS7_12PropertyTypeEE12ComposedListILNS7_10PropertyIdE1EEENSB_10PropertifyILSD_1ENS8_9IsInGroupEEEEEEELb0EE3__bESJ_
-FN:539,_ZNSt20__copy_move_backwardILb0ELb0ESt26random_access_iterator_tagE13__copy_move_bIPSsS3_EET0_T_S5_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0EPSsS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPSsS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardIPSsS0_ET0_T_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEES6_ET1_T0_S8_S7_
-FN:624,_ZSt13copy_backwardIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEES6_ET0_T_S8_S7_
-FN:539,_ZNSt20__copy_move_backwardILb0ELb0ESt26random_access_iterator_tagE13__copy_move_bIPN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE0EEESE_EET0_T_SG_SF_
-FN:579,_ZSt22__copy_move_backward_aILb0EPN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE0EEESB_ET1_T0_SD_SC_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE0EEESB_ET1_T0_SD_SC_
-FN:624,_ZSt13copy_backwardIPN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE0EEESB_ET0_T_SD_SC_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEESt6vectorISC_SaISC_EEEESH_ET1_T0_SJ_SI_
-FN:624,_ZSt13copy_backwardIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEESt6vectorISC_SaISC_EEEESH_ET0_T_SJ_SI_
-FN:104,_ZNSt11__iter_swapILb1EE9iter_swapIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS5_7desktop6SourceENS7_5SetupENS7_12PropertyTypeEE12ComposedListILNS7_10PropertyIdE0EEESt6vectorISE_SaISE_EEEESJ_EEvT_T0_
-FN:121,_ZSt9iter_swapIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEESt6vectorISC_SaISC_EEEESH_EvT_T0_
-FN:539,_ZNSt20__copy_move_backwardILb0ELb0ESt26random_access_iterator_tagE13__copy_move_bIPN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE1EEESE_EET0_T_SG_SF_
-FN:579,_ZSt22__copy_move_backward_aILb0EPN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE1EEESB_ET1_T0_SD_SC_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE1EEESB_ET1_T0_SD_SC_
-FN:624,_ZSt13copy_backwardIPN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE1EEESB_ET0_T_SD_SC_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE1EEESt6vectorISC_SaISC_EEEESH_ET1_T0_SJ_SI_
-FN:624,_ZSt13copy_backwardIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE1EEESt6vectorISC_SaISC_EEEESH_ET0_T_SJ_SI_
-FN:104,_ZNSt11__iter_swapILb1EE9iter_swapIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS5_7desktop6SourceENS7_5SetupENS7_12PropertyTypeEE12ComposedListILNS7_10PropertyIdE1EEESt6vectorISE_SaISE_EEEESJ_EEvT_T0_
-FN:121,_ZSt9iter_swapIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE1EEESt6vectorISC_SaISC_EEEESH_EvT_T0_
-FN:309,_ZNSt11__copy_moveILb0ELb0ESt20forward_iterator_tagE8__copy_mIN6wibble4list12ListIteratorINS4_3MapIN3ept4core6SourceINS8_7desktop6SourceENSA_5SetupENSA_12PropertyTypeEE12ComposedListILNSA_10PropertyIdE0EEESt25pointer_to_unary_functionISH_SsEEEEESt20back_insert_iteratorISt6vectorISsSaISsEEEEET0_T_SS_SR_
-FN:385,_ZSt13__copy_move_aILb0EN6wibble4list12ListIteratorINS1_3MapIN3ept4core6SourceINS5_7desktop6SourceENS7_5SetupENS7_12PropertyTypeEE12ComposedListILNS7_10PropertyIdE0EEESt25pointer_to_unary_functionISE_SsEEEEESt20back_insert_iteratorISt6vectorISsSaISsEEEET1_T0_SP_SO_
-FN:430,_ZSt14__copy_move_a2ILb0EN6wibble4list12ListIteratorINS1_3MapIN3ept4core6SourceINS5_7desktop6SourceENS7_5SetupENS7_12PropertyTypeEE12ComposedListILNS7_10PropertyIdE0EEESt25pointer_to_unary_functionISE_SsEEEEESt20back_insert_iteratorISt6vectorISsSaISsEEEET1_T0_SP_SO_
-FN:456,_ZSt4copyIN6wibble4list12ListIteratorINS1_3MapIN3ept4core6SourceINS5_7desktop6SourceENS7_5SetupENS7_12PropertyTypeEE12ComposedListILNS7_10PropertyIdE0EEESt25pointer_to_unary_functionISE_SsEEEEESt20back_insert_iteratorISt6vectorISsSaISsEEEET0_T_SP_SO_
-FN:309,_ZNSt11__copy_moveILb0ELb0ESt20forward_iterator_tagE8__copy_mIN6wibble4list12ListIteratorINS4_8FilteredIN3ept4core6SourceINS8_7desktop6SourceENSA_5SetupENSA_12PropertyTypeEE12ComposedListILNSA_10PropertyIdE1EEENSE_10PropertifyILSG_1ENSB_9IsInGroupEEEEEEESt20back_insert_iteratorISt6vectorISH_SaISH_EEEEET0_T_ST_SS_
-FN:385,_ZSt13__copy_move_aILb0EN6wibble4list12ListIteratorINS1_8FilteredIN3ept4core6SourceINS5_7desktop6SourceENS7_5SetupENS7_12PropertyTypeEE12ComposedListILNS7_10PropertyIdE1EEENSB_10PropertifyILSD_1ENS8_9IsInGroupEEEEEEESt20back_insert_iteratorISt6vectorISE_SaISE_EEEET1_T0_SQ_SP_
-FN:430,_ZSt14__copy_move_a2ILb0EN6wibble4list12ListIteratorINS1_8FilteredIN3ept4core6SourceINS5_7desktop6SourceENS7_5SetupENS7_12PropertyTypeEE12ComposedListILNS7_10PropertyIdE1EEENSB_10PropertifyILSD_1ENS8_9IsInGroupEEEEEEESt20back_insert_iteratorISt6vectorISE_SaISE_EEEET1_T0_SQ_SP_
-FN:456,_ZSt4copyIN6wibble4list12ListIteratorINS1_8FilteredIN3ept4core6SourceINS5_7desktop6SourceENS7_5SetupENS7_12PropertyTypeEE12ComposedListILNS7_10PropertyIdE1EEENSB_10PropertifyILSD_1ENS8_9IsInGroupEEEEEEESt20back_insert_iteratorISt6vectorISE_SaISE_EEEET0_T_SQ_SP_
-FN:309,_ZNSt11__copy_moveILb0ELb0ESt20forward_iterator_tagE8__copy_mIN6wibble4list12ListIteratorIN3ept4core6SourceINS7_7desktop6SourceENS9_5SetupENS9_12PropertyTypeEE12ComposedListILNS9_10PropertyIdE0EEEEESt20back_insert_iteratorISt6vectorISG_SaISG_EEEEET0_T_SO_SN_
-FN:385,_ZSt13__copy_move_aILb0EN6wibble4list12ListIteratorIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE0EEEEESt20back_insert_iteratorISt6vectorISD_SaISD_EEEET1_T0_SL_SK_
-FN:430,_ZSt14__copy_move_a2ILb0EN6wibble4list12ListIteratorIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE0EEEEESt20back_insert_iteratorISt6vectorISD_SaISD_EEEET1_T0_SL_SK_
-FN:456,_ZSt4copyIN6wibble4list12ListIteratorIN3ept4core6SourceINS4_7desktop6SourceENS6_5SetupENS6_12PropertyTypeEE12ComposedListILNS6_10PropertyIdE0EEEEESt20back_insert_iteratorISt6vectorISD_SaISD_EEEET0_T_SL_SK_
-FN:104,_ZNSt11__iter_swapILb1EE9iter_swapIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEES8_EEvT_T0_
-FN:121,_ZSt9iter_swapIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEES6_EvT_T0_
-DA:104,0
-DA:106,0
-DA:107,0
-DA:121,0
-DA:142,0
-DA:146,0
-DA:188,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:210,20513
-DA:215,20513
-DA:216,4679
-DA:217,15834
-DA:268,15
-DA:269,15
-DA:276,460
-DA:277,460
-DA:286,318
-DA:287,318
-DA:309,4
-DA:311,36
-DA:312,14
-DA:313,4
-DA:385,4
-DA:393,4
-DA:396,4
-DA:430,4
-DA:435,4
-DA:456,4
-DA:466,4
-DA:539,150
-DA:542,524
-DA:543,374
-DA:544,150
-DA:579,150
-DA:587,150
-DA:592,150
-DA:597,150
-DA:602,150
-DA:624,150
-DA:636,150
-BA:193,0
-BA:193,0
-BA:215,2
-BA:215,2
-BA:311,2
-BA:311,2
-BA:311,2
-BA:311,2
-BA:311,2
-BA:311,2
-BA:542,2
-BA:542,2
-BA:542,2
-BA:542,2
-BA:542,2
-BA:542,2
-LF:42
-LH:32
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-FN:87,_ZSt8_DestroyIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE0EEEEvPT_
-FN:97,_ZSt8_DestroyIPN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE0EEEEvT_SC_
-FN:126,_ZSt8_DestroyIPN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE0EEESA_EvT_SC_RSaIT0_E
-FN:87,_ZSt8_DestroyIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE1EEEEvPT_
-FN:97,_ZSt8_DestroyIPN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE1EEEEvT_SC_
-FN:126,_ZSt8_DestroyIPN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE1EEESA_EvT_SC_RSaIT0_E
-DA:87,23292
-DA:88,23292
-DA:97,8929
-DA:101,32221
-DA:103,23292
-DA:104,8929
-DA:126,8929
-DA:128,8929
-DA:129,8929
-BA:101,2
-BA:101,2
-BA:101,2
-BA:101,2
-BA:101,2
-BA:101,2
-LF:9
-LH:9
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_function.h
-FN:104,_ZNSt14unary_functionISsbEC2Ev
-FN:104,_ZNSt14unary_functionIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE0EEESsEC2Ev
-FN:420,_ZNSt25pointer_to_unary_functionIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE0EEESsEC1EPFSsSA_E
-FN:431,_ZSt7ptr_funIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE0EEESsESt25pointer_to_unary_functionIT_T0_EPFSD_SC_E
-FN:482,_ZNKSt10_Select1stISt4pairIKSsN3ept4core7desktop4File5EntryEEEclERKS7_
-FN:482,_ZNKSt10_Select1stISt4pairIKSsN3ept4core7desktop4File5GroupEEEclERKS7_
-FN:469,_ZNKSt9_IdentityISsEclERKSs
-FN:424,_ZNKSt25pointer_to_unary_functionIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE0EEESsEclESA_
-FN:202,_ZNKSt8equal_toISsEclERKSsS2_
-FN:229,_ZNKSt4lessISsEclERKSsS2_
-DA:104,17
-DA:202,64
-DA:203,64
-DA:229,4616574
-DA:230,4616574
-DA:420,1
-DA:421,1
-DA:424,4
-DA:425,4
-DA:431,1
-DA:432,1
-DA:469,3834775
-DA:470,3834775
-DA:482,13436
-DA:483,13436
-LF:15
-LH:15
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_heap.h
-FN:131,_ZSt11__push_heapIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEEiSsEvT_T0_S8_T1_
-FN:225,_ZSt13__adjust_heapIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEEiSsEvT_T0_S8_T1_
-FN:371,_ZSt9make_heapIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEEEvT_S7_
-FN:251,_ZSt10__pop_heapIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEEEvT_S7_S7_
-FN:276,_ZSt8pop_heapIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEEEvT_S7_
-FN:450,_ZSt9sort_heapIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEEEvT_S7_
-FN:131,_ZSt11__push_heapIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE1EEESt6vectorISC_SaISC_EEEEiSC_EvT_T0_SJ_T1_
-FN:225,_ZSt13__adjust_heapIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE1EEESt6vectorISC_SaISC_EEEEiSC_EvT_T0_SJ_T1_
-FN:371,_ZSt9make_heapIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE1EEESt6vectorISC_SaISC_EEEEEvT_SI_
-FN:251,_ZSt10__pop_heapIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE1EEESt6vectorISC_SaISC_EEEEEvT_SI_SI_
-FN:276,_ZSt8pop_heapIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE1EEESt6vectorISC_SaISC_EEEEEvT_SI_
-FN:450,_ZSt9sort_heapIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE1EEESt6vectorISC_SaISC_EEEEEvT_SI_
-FN:131,_ZSt11__push_heapIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEESt6vectorISC_SaISC_EEEEiSC_EvT_T0_SJ_T1_
-FN:225,_ZSt13__adjust_heapIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEESt6vectorISC_SaISC_EEEEiSC_EvT_T0_SJ_T1_
-FN:371,_ZSt9make_heapIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEESt6vectorISC_SaISC_EEEEEvT_SI_
-FN:251,_ZSt10__pop_heapIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEESt6vectorISC_SaISC_EEEEEvT_SI_SI_
-FN:276,_ZSt8pop_heapIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEESt6vectorISC_SaISC_EEEEEvT_SI_
-FN:450,_ZSt9sort_heapIN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEESt6vectorISC_SaISC_EEEEEvT_SI_
-DA:131,0
-DA:133,0
-DA:134,0
-DA:136,0
-DA:137,0
-DA:138,0
-DA:140,0
-DA:141,0
-DA:225,0
-DA:227,0
-DA:228,0
-DA:229,0
-DA:231,0
-DA:232,0
-DA:233,0
-DA:234,0
-DA:235,0
-DA:237,0
-DA:239,0
-DA:240,0
-DA:242,0
-DA:244,0
-DA:246,0
-DA:251,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:263,0
-DA:276,0
-DA:288,0
-DA:289,0
-DA:371,0
-DA:384,0
-DA:385,0
-DA:387,0
-DA:388,0
-DA:389,0
-DA:391,0
-DA:392,0
-DA:393,0
-DA:394,0
-DA:395,0
-DA:450,0
-DA:460,0
-DA:461,0
-DA:462,0
-BA:134,0
-BA:134,0
-BA:134,0
-BA:134,0
-BA:134,0
-BA:134,0
-BA:134,0
-BA:134,0
-BA:134,0
-BA:134,0
-BA:134,0
-BA:134,0
-BA:134,0
-BA:134,0
-BA:134,0
-BA:134,0
-BA:134,0
-BA:134,0
-BA:229,0
-BA:229,0
-BA:229,0
-BA:229,0
-BA:229,0
-BA:229,0
-BA:232,0
-BA:232,0
-BA:232,0
-BA:232,0
-BA:232,0
-BA:232,0
-BA:237,0
-BA:237,0
-BA:237,0
-BA:237,0
-BA:237,0
-BA:237,0
-BA:237,0
-BA:237,0
-BA:237,0
-BA:237,0
-BA:237,0
-BA:237,0
-BA:384,0
-BA:384,0
-BA:384,0
-BA:384,0
-BA:384,0
-BA:384,0
-BA:389,0
-BA:389,0
-BA:389,0
-BA:389,0
-BA:389,0
-BA:389,0
-BA:393,0
-BA:393,0
-BA:393,0
-BA:393,0
-BA:393,0
-BA:393,0
-BA:460,0
-BA:460,0
-BA:460,0
-BA:460,0
-BA:460,0
-BA:460,0
-LF:46
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:572,_ZNSt15insert_iteratorISt3setISsSt4lessISsESaISsEEEC1ERS4_St23_Rb_tree_const_iteratorISsE
-FN:645,_ZSt8inserterISt3setISsSt4lessISsESaISsEESt23_Rb_tree_const_iteratorISsEESt15insert_iteratorIT_ERS8_T0_
-FN:618,_ZNSt15insert_iteratorISt3setISsSt4lessISsESaISsEEEdeEv
-FN:623,_ZNSt15insert_iteratorISt3setISsSt4lessISsESaISsEEEppEv
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEdeEv
-FN:398,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEC1ERS2_
-FN:456,_ZSt13back_inserterISt6vectorISsSaISsEEESt20back_insert_iteratorIT_ERS4_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEE4baseEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEC1ERKS1_
-FN:743,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEmiERKi
-FN:429,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEdeEv
-FN:434,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEppEv
-FN:398,_ZNSt20back_insert_iteratorISt6vectorIN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE0EEESaISB_EEEC1ERSD_
-FN:456,_ZSt13back_inserterISt6vectorIN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE0EEESaISB_EEESt20back_insert_iteratorIT_ERSF_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE0EEESt6vectorISB_SaISB_EEEC1ERKSC_
-FN:398,_ZNSt20back_insert_iteratorISt6vectorIN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE1EEESaISB_EEEC1ERSD_
-FN:456,_ZSt13back_inserterISt6vectorIN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE1EEESaISB_EEESt20back_insert_iteratorIT_ERSF_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE1EEESt6vectorISB_SaISB_EEEC1ERKSC_
-FN:781,_ZN9__gnu_cxxneIPSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESA_
-FN:846,_ZN9__gnu_cxxmiIPSsSt6vectorISsSaISsEEEENS_17__normal_iteratorIT_T0_E15difference_typeERKS8_SB_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE0EEESt6vectorISB_SaISB_EEE4baseEv
-FN:781,_ZN9__gnu_cxxneIPN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE0EEESt6vectorISB_SaISB_EEEEbRKNS_17__normal_iteratorIT_T0_EESL_
-FN:846,_ZN9__gnu_cxxmiIPN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE0EEESt6vectorISB_SaISB_EEEENS_17__normal_iteratorIT_T0_E15difference_typeERKSJ_SM_
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE0EEESt6vectorISB_SaISB_EEEdeEv
-FN:735,_ZNK9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE0EEESt6vectorISB_SaISB_EEEplERKi
-FN:743,_ZNK9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE0EEESt6vectorISB_SaISB_EEEmiERKi
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE1EEESt6vectorISB_SaISB_EEE4baseEv
-FN:781,_ZN9__gnu_cxxneIPN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE1EEESt6vectorISB_SaISB_EEEEbRKNS_17__normal_iteratorIT_T0_EESL_
-FN:846,_ZN9__gnu_cxxmiIPN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE1EEESt6vectorISB_SaISB_EEEENS_17__normal_iteratorIT_T0_E15difference_typeERKSJ_SM_
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE1EEESt6vectorISB_SaISB_EEEdeEv
-FN:735,_ZNK9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE1EEESt6vectorISB_SaISB_EEEplERKi
-FN:743,_ZNK9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE1EEESt6vectorISB_SaISB_EEEmiERKi
-FN:735,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEplERKi
-FN:703,_ZN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE0EEESt6vectorISB_SaISB_EEEppEv
-FN:715,_ZN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE0EEESt6vectorISB_SaISB_EEEmmEv
-FN:794,_ZN9__gnu_cxxltIPN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE0EEESt6vectorISB_SaISB_EEEEbRKNS_17__normal_iteratorIT_T0_EESL_
-FN:769,_ZN9__gnu_cxxeqIPN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE0EEESt6vectorISB_SaISB_EEEEbRKNS_17__normal_iteratorIT_T0_EESL_
-FN:703,_ZN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE1EEESt6vectorISB_SaISB_EEEppEv
-FN:715,_ZN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE1EEESt6vectorISB_SaISB_EEEmmEv
-FN:794,_ZN9__gnu_cxxltIPN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE1EEESt6vectorISB_SaISB_EEEEbRKNS_17__normal_iteratorIT_T0_EESL_
-FN:769,_ZN9__gnu_cxxeqIPN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE1EEESt6vectorISB_SaISB_EEEEbRKNS_17__normal_iteratorIT_T0_EESL_
-FN:703,_ZN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEppEv
-FN:715,_ZN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEmmEv
-FN:794,_ZN9__gnu_cxxltIPSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESA_
-FN:769,_ZN9__gnu_cxxeqIPSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESA_
-FN:434,_ZNSt20back_insert_iteratorISt6vectorIN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE0EEESaISB_EEEppEv
-FN:429,_ZNSt20back_insert_iteratorISt6vectorIN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE0EEESaISB_EEEdeEv
-FN:722,_ZN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE0EEESt6vectorISB_SaISB_EEEmmEi
-FN:434,_ZNSt20back_insert_iteratorISt6vectorIN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE1EEESaISB_EEEppEv
-FN:429,_ZNSt20back_insert_iteratorISt6vectorIN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE1EEESaISB_EEEdeEv
-FN:722,_ZN9__gnu_cxx17__normal_iteratorIPN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE1EEESt6vectorISB_SaISB_EEEmmEi
-FN:722,_ZN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEmmEi
-FN:599,_ZNSt15insert_iteratorISt3setISsSt4lessISsESaISsEEEaSERKSs
-FN:412,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEaSERKSs
-FN:412,_ZNSt20back_insert_iteratorISt6vectorIN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE1EEESaISB_EEEaSERKSB_
-FN:412,_ZNSt20back_insert_iteratorISt6vectorIN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE0EEESaISB_EEEaSERKSB_
-DA:398,12
-DA:412,2250
-DA:414,2250
-DA:415,2250
-DA:429,2250
-DA:430,2250
-DA:434,2240
-DA:435,2240
-DA:456,12
-DA:457,12
-DA:572,21174
-DA:573,21174
-DA:599,107576
-DA:601,107576
-DA:602,107576
-DA:603,107576
-DA:618,107576
-DA:619,107576
-DA:623,107576
-DA:624,107576
-DA:645,21174
-DA:648,21174
-DA:683,7086
-DA:695,2248
-DA:696,2248
-DA:703,387
-DA:705,387
-DA:706,387
-DA:715,521
-DA:717,521
-DA:718,521
-DA:722,0
-DA:723,0
-DA:735,227
-DA:736,227
-DA:743,0
-DA:744,0
-DA:747,15904
-DA:748,15904
-DA:769,77
-DA:770,77
-DA:781,472
-DA:782,472
-DA:794,0
-DA:795,0
-DA:846,158
-DA:847,158
-LF:47
-LH:41
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-FN:135,_ZSt9__advanceISt23_Rb_tree_const_iteratorISsEiEvRT_T0_St26bidirectional_iterator_tag
-FN:173,_ZSt7advanceISt23_Rb_tree_const_iteratorISsEiEvRT_T0_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-DA:135,48
-DA:140,48
-DA:141,144
-DA:142,48
-DA:144,0
-DA:145,0
-DA:146,48
-DA:173,48
-DA:176,48
-DA:177,48
-DA:178,48
-BA:140,2
-BA:140,1
-BA:141,2
-BA:141,2
-BA:144,0
-BA:144,0
-LF:15
-LH:9
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt18input_iterator_tagN3ept4core7desktop8CategoryEiPKS4_RS5_EC2Ev
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:166,_ZSt19__iterator_categoryISt23_Rb_tree_const_iteratorISsEENSt15iterator_traitsIT_E17iterator_categoryERKS3_
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,21688
-DA:166,48
-DA:167,48
-LF:3
-LH:3
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_map.h
-FN:590,_ZNKSt3mapISsN3ept4core7desktop4File5EntryESt4lessISsESaISt4pairIKSsS4_EEE8key_compEv
-FN:590,_ZNKSt3mapISsN3ept4core7desktop4File5GroupESt4lessISsESaISt4pairIKSsS4_EEE8key_compEv
-FN:293,_ZNSt3mapISsN3ept4core7desktop4File5EntryESt4lessISsESaISt4pairIKSsS4_EEE3endEv
-FN:293,_ZNSt3mapISsN3ept4core7desktop4File5GroupESt4lessISsESaISt4pairIKSsS4_EEE3endEv
-FN:155,_ZNSt3mapISsN3ept4core7desktop4File5EntryESt4lessISsESaISt4pairIKSsS4_EEEC1Ev
-FN:155,_ZNSt3mapISsN3ept4core7desktop4File5GroupESt4lessISsESaISt4pairIKSsS4_EEEC1Ev
-FN:92,_ZNSt3mapISsN3ept4core7desktop4File5EntryESt4lessISsESaISt4pairIKSsS4_EEED1Ev
-FN:92,_ZNSt3mapISsN3ept4core7desktop4File5GroupESt4lessISsESaISt4pairIKSsS4_EEED1Ev
-FN:175,_ZNSt3mapISsN3ept4core7desktop4File5EntryESt4lessISsESaISt4pairIKSsS4_EEEC1ERKSB_
-FN:239,_ZNSt3mapISsN3ept4core7desktop4File5EntryESt4lessISsESaISt4pairIKSsS4_EEEaSERKSB_
-FN:656,_ZNSt3mapISsN3ept4core7desktop4File5EntryESt4lessISsESaISt4pairIKSsS4_EEE11lower_boundERS8_
-FN:656,_ZNSt3mapISsN3ept4core7desktop4File5GroupESt4lessISsESaISt4pairIKSsS4_EEE11lower_boundERS8_
-FN:495,_ZNSt3mapISsN3ept4core7desktop4File5EntryESt4lessISsESaISt4pairIKSsS4_EEE6insertESt17_Rb_tree_iteratorIS9_ERKS9_
-FN:411,_ZNSt3mapISsN3ept4core7desktop4File5EntryESt4lessISsESaISt4pairIKSsS4_EEEixERS8_
-FN:495,_ZNSt3mapISsN3ept4core7desktop4File5GroupESt4lessISsESaISt4pairIKSsS4_EEE6insertESt17_Rb_tree_iteratorIS9_ERKS9_
-FN:411,_ZNSt3mapISsN3ept4core7desktop4File5GroupESt4lessISsESaISt4pairIKSsS4_EEEixERS8_
-DA:92,80
-DA:155,48
-DA:156,48
-DA:175,32
-DA:176,32
-DA:239,16
-DA:241,16
-DA:242,16
-DA:293,1340
-DA:294,1340
-DA:411,1340
-DA:416,1340
-DA:418,1340
-DA:419,1256
-DA:420,1340
-DA:495,1256
-DA:496,1256
-DA:590,1216
-DA:591,1216
-DA:656,1340
-DA:657,1340
-BA:418,2
-BA:418,2
-BA:418,2
-BA:418,2
-BA:418,2
-BA:418,2
-BA:418,2
-BA:418,2
-BA:418,1
-BA:418,2
-BA:418,2
-BA:418,2
-LF:21
-LH:21
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_move.h
-FN:80,_ZSt4swapIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE0EEEEvRT_SC_
-FN:80,_ZSt4swapIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE1EEEEvRT_SC_
-DA:80,0
-DA:85,0
-DA:86,0
-DA:87,0
-DA:88,0
-LF:5
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_pair.h
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIS_IKSsN3ept4core7desktop4File5EntryEEEbEC1ERKS8_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIS_IKSsN3ept4core7desktop4File5GroupEEEbEC1ERKS8_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorISsEbEC1ERKS1_RKb
-FN:73,_ZNSt4pairIKSsN3ept4core7desktop4File5EntryEED1Ev
-FN:88,_ZNSt4pairIKSsN3ept4core7desktop4File5EntryEEC1ERS0_RKS5_
-FN:73,_ZNSt4pairIKSsN3ept4core7desktop4File5EntryEEC1ERKS6_
-FN:73,_ZNSt4pairIKSsN3ept4core7desktop4File5GroupEED1Ev
-FN:88,_ZNSt4pairIKSsN3ept4core7desktop4File5GroupEEC1ERS0_RKS5_
-FN:73,_ZNSt4pairIKSsN3ept4core7desktop4File5GroupEEC1ERKS6_
-DA:73,6208
-DA:88,447986
-DA:89,447986
-LF:3
-LH:3
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_set.h
-FN:261,_ZNKSt3setISsSt4lessISsESaISsEE5beginEv
-FN:270,_ZNKSt3setISsSt4lessISsESaISsEE3endEv
-FN:331,_ZNKSt3setISsSt4lessISsESaISsEE5emptyEv
-FN:141,_ZNSt3setISsSt4lessISsESaISsEEC1Ev
-FN:93,_ZNSt3setISsSt4lessISsESaISsEED1Ev
-FN:471,_ZNSt3setISsSt4lessISsESaISsEE5clearEv
-FN:193,_ZNSt3setISsSt4lessISsESaISsEEC1ERKS3_
-FN:216,_ZNSt3setISsSt4lessISsESaISsEEaSERKS3_
-FN:405,_ZNSt3setISsSt4lessISsESaISsEE6insertESt23_Rb_tree_const_iteratorISsERKSs
-DA:93,491868
-DA:141,87259
-DA:142,87259
-DA:193,404619
-DA:194,404619
-DA:216,65
-DA:218,65
-DA:219,65
-DA:261,298710
-DA:262,298710
-DA:270,637779
-DA:271,637779
-DA:331,232623
-DA:332,232623
-DA:405,107576
-DA:406,107576
-DA:471,84600
-DA:472,84600
-LF:18
-LH:18
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_tree.h
-FN:103,_ZNSt18_Rb_tree_node_base10_S_minimumEPS_
-FN:117,_ZNSt18_Rb_tree_node_base10_S_maximumEPS_
-FN:289,_ZNKSt23_Rb_tree_const_iteratorISsEneERKS0_
-FN:172,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsN3ept4core7desktop4File5EntryEEEdeEv
-FN:210,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsN3ept4core7desktop4File5EntryEEEeqERKS8_
-FN:172,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsN3ept4core7desktop4File5GroupEEEdeEv
-FN:210,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsN3ept4core7desktop4File5GroupEEEeqERKS8_
-FN:452,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE8_M_beginEv
-FN:452,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_beginEv
-FN:452,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5GroupEESt10_Select1stIS7_ESt4lessISsESaIS7_EE8_M_beginEv
-FN:592,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE8key_compEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsN3ept4core7desktop4File5EntryEEEC1ERKSt17_Rb_tree_iteratorIS7_E
-FN:592,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5GroupEESt10_Select1stIS7_ESt4lessISsESaIS7_EE8key_compEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsN3ept4core7desktop4File5GroupEEEC1ERKSt17_Rb_tree_iteratorIS7_E
-FN:398,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE13_Rb_tree_implISB_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:432,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE7_M_rootEv
-FN:456,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE8_M_beginEv
-FN:463,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE6_M_endEv
-FN:428,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE7_M_rootEv
-FN:503,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE10_S_minimumEPSt18_Rb_tree_node_base
-FN:436,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE11_M_leftmostEv
-FN:511,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE10_S_maximumEPSt18_Rb_tree_node_base
-FN:444,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE12_M_rightmostEv
-FN:398,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_S_leftEPSt18_Rb_tree_node_base
-FN:398,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5GroupEESt10_Select1stIS7_ESt4lessISsESaIS7_EE13_Rb_tree_implISB_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5GroupEESt10_Select1stIS7_ESt4lessISsESaIS7_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5GroupEESt10_Select1stIS7_ESt4lessISsESaIS7_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:463,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_M_endEv
-FN:436,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11_M_leftmostEv
-FN:428,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_M_rootEv
-FN:444,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE12_M_rightmostEv
-FN:240,_ZNSt23_Rb_tree_const_iteratorISsEC1EPKSt13_Rb_tree_nodeISsE
-FN:603,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5beginEv
-FN:614,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE3endEv
-FN:347,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE21_M_get_Node_allocatorEv
-FN:432,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_M_rootEv
-FN:456,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_beginEv
-FN:503,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE10_S_minimumEPSt18_Rb_tree_node_base
-FN:511,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE10_S_maximumEPSt18_Rb_tree_node_base
-FN:247,_ZNKSt23_Rb_tree_const_iteratorISsEdeEv
-FN:168,_ZNSt17_Rb_tree_iteratorISt4pairIKSsN3ept4core7desktop4File5EntryEEEC1EPSt13_Rb_tree_nodeIS7_E
-FN:610,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE3endEv
-FN:641,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE4sizeEv
-FN:491,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE8_S_rightEPKSt18_Rb_tree_node_base
-FN:463,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5GroupEESt10_Select1stIS7_ESt4lessISsESaIS7_EE6_M_endEv
-FN:168,_ZNSt17_Rb_tree_iteratorISt4pairIKSsN3ept4core7desktop4File5GroupEEEC1EPSt13_Rb_tree_nodeIS7_E
-FN:610,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5GroupEESt10_Select1stIS7_ESt4lessISsESaIS7_EE3endEv
-FN:444,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5GroupEESt10_Select1stIS7_ESt4lessISsESaIS7_EE12_M_rightmostEv
-FN:641,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5GroupEESt10_Select1stIS7_ESt4lessISsESaIS7_EE4sizeEv
-FN:436,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5GroupEESt10_Select1stIS7_ESt4lessISsESaIS7_EE11_M_leftmostEv
-FN:491,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5GroupEESt10_Select1stIS7_ESt4lessISsESaIS7_EE8_S_rightEPKSt18_Rb_tree_node_base
-FN:415,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE13_Rb_tree_implISB_Lb0EE13_M_initializeEv
-FN:483,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE7_S_leftEPKSt18_Rb_tree_node_base
-FN:415,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EE13_M_initializeEv
-FN:415,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5GroupEESt10_Select1stIS7_ESt4lessISsESaIS7_EE13_Rb_tree_implISB_Lb0EE13_M_initializeEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorISsEC1ERKSt17_Rb_tree_iteratorISsE
-FN:491,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_rightEPKSt18_Rb_tree_node_base
-FN:483,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_S_leftEPKSt18_Rb_tree_node_base
-FN:495,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_S_keyEPKSt18_Rb_tree_node_base
-FN:637,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5emptyEv
-FN:495,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE6_S_keyEPKSt18_Rb_tree_node_base
-FN:596,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE5beginEv
-FN:347,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE21_M_get_Node_allocatorEv
-FN:495,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5GroupEESt10_Select1stIS7_ESt4lessISsESaIS7_EE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5GroupEESt10_Select1stIS7_ESt4lessISsESaIS7_EE6_S_keyEPKSt18_Rb_tree_node_base
-FN:596,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5GroupEESt10_Select1stIS7_ESt4lessISsESaIS7_EE5beginEv
-FN:403,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE13_Rb_tree_implISB_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EEC1Ev
-FN:403,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEEC1Ev
-FN:403,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5GroupEESt10_Select1stIS7_ESt4lessISsESaIS7_EE13_Rb_tree_implISB_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5GroupEESt10_Select1stIS7_ESt4lessISsESaIS7_EEC1Ev
-FN:347,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5GroupEESt10_Select1stIS7_ESt4lessISsESaIS7_EE21_M_get_Node_allocatorEv
-FN:641,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE4sizeEv
-FN:168,_ZNSt17_Rb_tree_iteratorISsEC1EPSt13_Rb_tree_nodeISsE
-FN:408,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EEC1ERKS3_RKSaISt13_Rb_tree_nodeISsEE
-FN:471,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_valueEPKSt13_Rb_tree_nodeISsE
-FN:475,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_S_keyEPKSt13_Rb_tree_nodeISsE
-FN:351,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13get_allocatorEv
-FN:471,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE8_S_valueEPKSt13_Rb_tree_nodeIS7_E
-FN:475,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE6_S_keyEPKSt13_Rb_tree_nodeIS7_E
-FN:471,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5GroupEESt10_Select1stIS7_ESt4lessISsESaIS7_EE8_S_valueEPKSt13_Rb_tree_nodeIS7_E
-FN:475,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5GroupEESt10_Select1stIS7_ESt4lessISsESaIS7_EE6_S_keyEPKSt13_Rb_tree_nodeIS7_E
-FN:351,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE13get_allocatorEv
-FN:351,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5GroupEESt10_Select1stIS7_ESt4lessISsESaIS7_EE13get_allocatorEv
-FN:596,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorISsEeqERKS0_
-FN:408,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE13_Rb_tree_implISB_Lb0EEC1ERKSB_RKSaISt13_Rb_tree_nodeIS7_EE
-FN:360,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11_M_put_nodeEPSt13_Rb_tree_nodeISsE
-FN:388,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE15_M_destroy_nodeEPSt13_Rb_tree_nodeISsE
-FN:936,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_eraseEPSt13_Rb_tree_nodeISsE
-FN:584,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEED1Ev
-FN:695,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5clearEv
-FN:360,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS7_E
-FN:388,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS7_E
-FN:936,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE8_M_eraseEPSt13_Rb_tree_nodeIS7_E
-FN:695,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE5clearEv
-FN:584,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EED1Ev
-FN:360,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5GroupEESt10_Select1stIS7_ESt4lessISsESaIS7_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS7_E
-FN:388,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5GroupEESt10_Select1stIS7_ESt4lessISsESaIS7_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS7_E
-FN:936,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5GroupEESt10_Select1stIS7_ESt4lessISsESaIS7_EE8_M_eraseEPSt13_Rb_tree_nodeIS7_E
-FN:584,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5GroupEESt10_Select1stIS7_ESt4lessISsESaIS7_EED1Ev
-FN:356,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE14_M_create_nodeERKSs
-FN:378,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_M_clone_nodeEPKSt13_Rb_tree_nodeISsE
-FN:900,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_M_copyEPKSt13_Rb_tree_nodeISsEPS7_
-FN:568,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEEC1ERKS5_
-FN:824,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEEaSERKS5_
-FN:356,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE14_M_create_nodeERKS7_
-FN:378,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE13_M_clone_nodeEPKSt13_Rb_tree_nodeIS7_E
-FN:900,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE7_M_copyEPKSt13_Rb_tree_nodeIS7_EPSF_
-FN:568,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EEC1ERKSD_
-FN:824,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EEaSERKSD_
-FN:356,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5GroupEESt10_Select1stIS7_ESt4lessISsESaIS7_EE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5GroupEESt10_Select1stIS7_ESt4lessISsESaIS7_EE14_M_create_nodeERKS7_
-FN:270,_ZNSt23_Rb_tree_const_iteratorISsEmmEv
-FN:270,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsN3ept4core7desktop4File5EntryEEEmmEv
-FN:270,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsN3ept4core7desktop4File5GroupEEEmmEv
-FN:255,_ZNSt23_Rb_tree_const_iteratorISsEppEv
-FN:255,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsN3ept4core7desktop4File5EntryEEEppEv
-FN:255,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsN3ept4core7desktop4File5GroupEEEppEv
-FN:954,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE14_M_lower_boundEPSt13_Rb_tree_nodeIS7_ESG_RS1_
-FN:715,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE11lower_boundERS1_
-FN:954,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5GroupEESt10_Select1stIS7_ESt4lessISsESaIS7_EE14_M_lower_boundEPSt13_Rb_tree_nodeIS7_ESG_RS1_
-FN:715,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5GroupEESt10_Select1stIS7_ESt4lessISsESaIS7_EE11lower_boundERS1_
-FN:846,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE10_M_insert_EPKSt18_Rb_tree_node_baseSG_RKS7_
-FN:846,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5GroupEESt10_Select1stIS7_ESt4lessISsESaIS7_EE10_M_insert_EPKSt18_Rb_tree_node_baseSG_RKS7_
-FN:846,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE10_M_insert_EPKSt18_Rb_tree_node_baseS8_RKSs
-FN:195,_ZNSt17_Rb_tree_iteratorISt4pairIKSsN3ept4core7desktop4File5EntryEEEmmEv
-FN:1133,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE16_M_insert_uniqueERKS7_
-FN:1178,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5EntryEESt10_Select1stIS7_ESt4lessISsESaIS7_EE17_M_insert_unique_ESt23_Rb_tree_const_iteratorIS7_ERKS7_
-FN:195,_ZNSt17_Rb_tree_iteratorISt4pairIKSsN3ept4core7desktop4File5GroupEEEmmEv
-FN:1133,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5GroupEESt10_Select1stIS7_ESt4lessISsESaIS7_EE16_M_insert_uniqueERKS7_
-FN:1178,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept4core7desktop4File5GroupEESt10_Select1stIS7_ESt4lessISsESaIS7_EE17_M_insert_unique_ESt23_Rb_tree_const_iteratorIS7_ERKS7_
-FN:195,_ZNSt17_Rb_tree_iteratorISsEmmEv
-FN:1133,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE16_M_insert_uniqueERKSs
-FN:1178,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE17_M_insert_unique_ESt23_Rb_tree_const_iteratorISsERKSs
-DA:103,880626
-DA:105,880626
-DA:106,880626
-DA:117,880626
-DA:119,880626
-DA:120,880626
-DA:168,1072488
-DA:169,1072488
-DA:172,2556
-DA:173,2556
-DA:195,48057
-DA:197,48057
-DA:198,48057
-DA:210,197540
-DA:211,197540
-DA:240,936496
-DA:241,936496
-DA:243,532589
-DA:244,532589
-DA:247,487061
-DA:248,487061
-DA:255,680151
-DA:257,680151
-DA:258,680151
-DA:270,1966
-DA:272,1966
-DA:273,1966
-DA:289,870409
-DA:290,870409
-DA:347,3926141
-DA:348,3926141
-DA:351,3521490
-DA:352,3521490
-DA:356,1760760
-DA:357,1760760
-DA:360,1760730
-DA:361,1760730
-DA:364,1760760
-DA:366,1760760
-DA:368,1760760
-DA:369,0
-DA:371,0
-DA:372,0
-DA:374,1760760
-DA:378,1333896
-DA:380,1333896
-DA:381,1333896
-DA:382,1333896
-DA:383,1333896
-DA:384,1333896
-DA:388,1760730
-DA:390,1760730
-DA:391,1760730
-DA:392,1760730
-DA:398,491948
-DA:403,87307
-DA:405,87307
-DA:406,87307
-DA:408,404651
-DA:410,404651
-DA:411,404651
-DA:415,491958
-DA:417,491958
-DA:418,491958
-DA:419,491958
-DA:420,491958
-DA:421,491958
-DA:428,1290347
-DA:429,1290347
-DA:432,404732
-DA:433,404732
-DA:436,488705
-DA:437,488705
-DA:444,656880
-DA:445,656880
-DA:452,1024711
-DA:453,1024711
-DA:456,401890
-DA:459,401890
-DA:463,1554440
-DA:464,1554440
-DA:471,1259753
-DA:472,1259753
-DA:475,1259753
-DA:476,1259753
-DA:479,1883703
-DA:480,1883703
-DA:483,1333901
-DA:484,1333901
-DA:487,2897501
-DA:488,2897501
-DA:491,520925
-DA:492,520925
-DA:495,668162
-DA:496,668162
-DA:499,668162
-DA:500,668162
-DA:503,401888
-DA:504,401888
-DA:511,401888
-DA:512,401888
-DA:562,87307
-DA:568,404651
-DA:569,404651
-DA:571,404651
-DA:573,401844
-DA:574,401844
-DA:575,401844
-DA:576,401844
-DA:578,404651
-DA:584,491948
-DA:585,491948
-DA:592,1216
-DA:593,1216
-DA:596,196190
-DA:599,196190
-DA:603,298712
-DA:606,298712
-DA:610,1340
-DA:611,1340
-DA:614,637782
-DA:617,637782
-DA:637,232623
-DA:638,232623
-DA:641,148201
-DA:642,148201
-DA:695,84683
-DA:697,84683
-DA:698,84683
-DA:699,84683
-DA:700,84683
-DA:701,84683
-DA:702,84683
-DA:715,1340
-DA:716,1340
-DA:824,81
-DA:826,81
-DA:829,81
-DA:830,81
-DA:831,81
-DA:833,44
-DA:834,44
-DA:835,44
-DA:836,44
-DA:839,81
-DA:846,426864
-DA:850,426864
-DA:852,426864
-DA:854,426864
-DA:857,426864
-DA:858,426864
-DA:900,921703
-DA:903,921703
-DA:904,921703
-DA:908,921703
-DA:909,470883
-DA:910,921703
-DA:911,921703
-DA:913,2255599
-DA:915,412193
-DA:916,412193
-DA:917,412193
-DA:918,412193
-DA:919,48932
-DA:920,412193
-DA:921,412193
-DA:924,0
-DA:926,0
-DA:927,0
-DA:929,921703
-DA:936,2337388
-DA:939,6435506
-DA:941,1760730
-DA:942,1760730
-DA:943,1760730
-DA:944,1760730
-DA:946,2337388
-DA:954,1340
-DA:956,10244
-DA:957,7564
-DA:958,3596
-DA:960,3968
-DA:961,1340
-DA:1133,446730
-DA:1135,446730
-DA:1136,446730
-DA:1137,446730
-DA:1138,2145603
-DA:1140,1252143
-DA:1141,1252143
-DA:1142,1252143
-DA:1144,446730
-DA:1145,446730
-DA:1147,196187
-DA:1148,148130
-DA:1150,48057
-DA:1152,298600
-DA:1153,192874
-DA:1154,105726
-DA:1178,108840
-DA:1181,108840
-DA:1183,105917
-DA:1186,84685
-DA:1188,21232
-DA:1190,2923
-DA:1194,2022
-DA:1195,2022
-DA:1196,56
-DA:1197,1966
-DA:1200,1099
-DA:1201,561
-DA:1204,538
-DA:1207,867
-DA:1209,901
-DA:1213,901
-DA:1214,901
-DA:1215,12
-DA:1216,889
-DA:1219,8
-DA:1220,4
-DA:1222,4
-DA:1225,881
-DA:1230,0
-BA:105,2
-BA:105,2
-BA:119,2
-BA:119,2
-BA:571,2
-BA:571,2
-BA:571,1
-BA:571,2
-BA:826,2
-BA:826,1
-BA:826,2
-BA:826,1
-BA:831,2
-BA:831,2
-BA:831,2
-BA:831,1
-BA:850,2
-BA:850,2
-BA:850,2
-BA:850,2
-BA:850,1
-BA:850,2
-BA:850,2
-BA:850,1
-BA:850,1
-BA:850,2
-BA:850,0
-BA:850,0
-BA:850,2
-BA:850,2
-BA:850,2
-BA:850,2
-BA:850,2
-BA:850,2
-BA:908,2
-BA:908,2
-BA:908,2
-BA:908,2
-BA:913,2
-BA:913,2
-BA:913,2
-BA:913,2
-BA:918,2
-BA:918,2
-BA:918,2
-BA:918,2
-BA:939,2
-BA:939,2
-BA:939,2
-BA:939,2
-BA:939,2
-BA:939,2
-BA:956,2
-BA:956,2
-BA:956,2
-BA:956,2
-BA:957,2
-BA:957,2
-BA:957,2
-BA:957,1
-BA:1138,1
-BA:1138,2
-BA:1138,1
-BA:1138,2
-BA:1138,2
-BA:1138,2
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1142,2
-BA:1142,2
-BA:1145,2
-BA:1145,1
-BA:1145,2
-BA:1145,1
-BA:1145,2
-BA:1145,2
-BA:1147,2
-BA:1147,1
-BA:1147,2
-BA:1147,1
-BA:1147,2
-BA:1147,2
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1152,2
-BA:1152,2
-BA:1181,2
-BA:1181,2
-BA:1181,2
-BA:1181,1
-BA:1181,2
-BA:1181,2
-BA:1183,2
-BA:1183,2
-BA:1183,2
-BA:1183,1
-BA:1183,2
-BA:1183,2
-BA:1183,1
-BA:1183,2
-BA:1183,0
-BA:1183,0
-BA:1183,1
-BA:1183,2
-BA:1183,2
-BA:1183,2
-BA:1183,2
-BA:1183,2
-BA:1183,2
-BA:1183,2
-BA:1190,2
-BA:1190,1
-BA:1190,0
-BA:1190,0
-BA:1190,2
-BA:1190,2
-BA:1195,2
-BA:1195,2
-BA:1195,0
-BA:1195,0
-BA:1195,1
-BA:1195,2
-BA:1197,2
-BA:1197,1
-BA:1197,0
-BA:1197,0
-BA:1197,2
-BA:1197,2
-BA:1200,2
-BA:1200,2
-BA:1200,0
-BA:1200,0
-BA:1200,2
-BA:1200,2
-BA:1209,0
-BA:1209,0
-BA:1209,0
-BA:1209,0
-BA:1209,2
-BA:1209,1
-BA:1214,0
-BA:1214,0
-BA:1214,0
-BA:1214,0
-BA:1214,2
-BA:1214,2
-BA:1216,0
-BA:1216,0
-BA:1216,0
-BA:1216,0
-BA:1216,2
-BA:1216,2
-BA:1219,0
-BA:1219,0
-BA:1219,0
-BA:1219,0
-BA:1219,2
-BA:1219,2
-LF:223
-LH:216
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyIPSsS2_EET0_T_S4_S3_
-FN:113,_ZSt18uninitialized_copyIPSsS0_ET0_T_S2_S1_
-FN:261,_ZSt22__uninitialized_copy_aIPSsS0_SsET0_T_S2_S1_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPSsS0_SaISsEET0_T_S3_S2_RT1_
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE0EEESD_EET0_T_SF_SE_
-FN:113,_ZSt18uninitialized_copyIPN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE0EEESB_ET0_T_SD_SC_
-FN:261,_ZSt22__uninitialized_copy_aIPN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE0EEESB_SA_ET0_T_SD_SC_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE0EEESB_SaISA_EET0_T_SE_SD_RT1_
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyIPN3ept4core6SourceINS3_7desktop6SourceENS5_5SetupENS5_12PropertyTypeEE12ComposedListILNS5_10PropertyIdE1EEESD_EET0_T_SF_SE_
-FN:113,_ZSt18uninitialized_copyIPN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE1EEESB_ET0_T_SD_SC_
-FN:261,_ZSt22__uninitialized_copy_aIPN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE1EEESB_SA_ET0_T_SD_SC_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE1EEESB_SaISA_EET0_T_SE_SD_RT1_
-DA:73,14030
-DA:75,14030
-DA:78,26547
-DA:79,12517
-DA:81,14030
-DA:83,0
-DA:85,0
-DA:86,0
-DA:113,14030
-DA:122,14030
-DA:261,14030
-DA:262,14030
-DA:268,14030
-DA:272,14030
-BA:78,2
-BA:78,2
-BA:78,2
-BA:78,2
-BA:78,2
-BA:78,2
-BA:79,2
-BA:79,1
-BA:79,2
-BA:79,1
-BA:79,2
-BA:79,1
-LF:14
-LH:11
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:484,_ZNKSt6vectorISsSaISsEE4sizeEv
-FN:101,_ZNKSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:395,_ZNSt6vectorISsSaISsEE3endEv
-FN:377,_ZNSt6vectorISsSaISsEE5beginEv
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:97,_ZNSt12_Vector_baseIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE0EEESaISA_EE19_M_get_Tp_allocatorEv
-FN:484,_ZNKSt6vectorIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE0EEESaISA_EE4sizeEv
-FN:562,_ZNSt6vectorIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE0EEESaISA_EEixEj
-FN:97,_ZNSt12_Vector_baseIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE1EEESaISA_EE19_M_get_Tp_allocatorEv
-FN:484,_ZNKSt6vectorIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE1EEESaISA_EE4sizeEv
-FN:562,_ZNSt6vectorIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE1EEESaISA_EEixEj
-FN:562,_ZNSt6vectorISsSaISsEEixEj
-FN:84,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseISsSaISsEEC2Ev
-FN:213,_ZNSt6vectorISsSaISsEEC1Ev
-FN:489,_ZNKSt6vectorISsSaISsEE8max_sizeEv
-FN:79,_ZNSt12_Vector_baseIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE0EEESaISA_EE12_Vector_implD1Ev
-FN:395,_ZNSt6vectorIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE0EEESaISA_EE3endEv
-FN:377,_ZNSt6vectorIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE0EEESaISA_EE5beginEv
-FN:79,_ZNSt12_Vector_baseIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE1EEESaISA_EE12_Vector_implD1Ev
-FN:395,_ZNSt6vectorIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE1EEESaISA_EE3endEv
-FN:377,_ZNSt6vectorIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE1EEESaISA_EE5beginEv
-FN:84,_ZNSt12_Vector_baseIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE0EEESaISA_EE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE0EEESaISA_EEC2Ev
-FN:213,_ZNSt6vectorIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE0EEESaISA_EEC1Ev
-FN:84,_ZNSt12_Vector_baseIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE1EEESaISA_EE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE1EEESaISA_EEC2Ev
-FN:213,_ZNSt6vectorIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE1EEESaISA_EEC1Ev
-FN:101,_ZNKSt12_Vector_baseIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE0EEESaISA_EE19_M_get_Tp_allocatorEv
-FN:489,_ZNKSt6vectorIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE0EEESaISA_EE8max_sizeEv
-FN:101,_ZNKSt12_Vector_baseIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE1EEESaISA_EE19_M_get_Tp_allocatorEv
-FN:489,_ZNKSt6vectorIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE1EEESaISA_EE8max_sizeEv
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-FN:147,_ZNSt12_Vector_baseIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE1EEESaISA_EE13_M_deallocateEPSA_j
-FN:135,_ZNSt12_Vector_baseIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE1EEESaISA_EED2Ev
-FN:299,_ZNSt6vectorIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE1EEESaISA_EED1Ev
-FN:147,_ZNSt12_Vector_baseIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE0EEESaISA_EE13_M_deallocateEPSA_j
-FN:135,_ZNSt12_Vector_baseIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE0EEESaISA_EED2Ev
-FN:299,_ZNSt6vectorIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE0EEESaISA_EED1Ev
-FN:143,_ZNSt12_Vector_baseISsSaISsEE11_M_allocateEj
-FN:143,_ZNSt12_Vector_baseIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE1EEESaISA_EE11_M_allocateEj
-FN:143,_ZNSt12_Vector_baseIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE0EEESaISA_EE11_M_allocateEj
-FN:1075,_ZNKSt6vectorISsSaISsEE12_M_check_lenEjPKc
-FN:686,_ZNSt6vectorISsSaISsEE9push_backERKSs
-FN:1075,_ZNKSt6vectorIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE1EEESaISA_EE12_M_check_lenEjPKc
-FN:686,_ZNSt6vectorIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE1EEESaISA_EE9push_backERKSA_
-FN:1075,_ZNKSt6vectorIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE0EEESaISA_EE12_M_check_lenEjPKc
-FN:686,_ZNSt6vectorIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE0EEESaISA_EE9push_backERKSA_
-DA:79,1914
-DA:84,1918
-DA:85,1918
-DA:86,1918
-DA:97,22959
-DA:98,22959
-DA:101,14030
-DA:102,14030
-DA:108,1918
-DA:109,1918
-DA:135,1914
-DA:136,1914
-DA:137,1914
-DA:143,7015
-DA:144,7015
-DA:147,8929
-DA:149,8929
-DA:150,6917
-DA:151,8929
-DA:213,1918
-DA:214,1918
-DA:299,1914
-DA:300,1914
-DA:301,1914
-DA:377,13
-DA:378,13
-DA:395,6696
-DA:396,6696
-DA:484,30924
-DA:485,30924
-DA:489,14030
-DA:490,14030
-DA:562,4932
-DA:563,4932
-DA:686,10789
-DA:688,10789
-DA:690,4107
-DA:691,4107
-DA:694,6682
-DA:695,10789
-DA:1075,7015
-DA:1077,7015
-DA:1078,0
-DA:1080,7015
-DA:1081,7015
-BA:144,2
-BA:144,1
-BA:144,2
-BA:144,1
-BA:144,2
-BA:144,1
-BA:149,2
-BA:149,2
-BA:149,2
-BA:149,2
-BA:149,2
-BA:149,2
-BA:688,2
-BA:688,2
-BA:688,1
-BA:688,2
-BA:688,2
-BA:688,2
-BA:1077,1
-BA:1077,2
-BA:1077,1
-BA:1077,2
-BA:1077,1
-BA:1077,2
-BA:1081,2
-BA:1081,1
-BA:1081,1
-BA:1081,2
-BA:1081,2
-BA:1081,1
-BA:1081,1
-BA:1081,2
-BA:1081,2
-BA:1081,1
-BA:1081,1
-BA:1081,2
-LF:45
-LH:44
-end_of_record
-SF:/usr/include/c++/4.3/bits/stream_iterator.h
-FN:76,_ZNKSt16istream_iteratorIN3ept4core7desktop8CategoryEcSt11char_traitsIcEiEdeEv
-FN:109,_ZNKSt16istream_iteratorIN3ept4core7desktop8CategoryEcSt11char_traitsIcEiE8_M_equalERKS6_
-FN:136,_ZStneIN3ept4core7desktop8CategoryEcSt11char_traitsIcEiEbRKSt16istream_iteratorIT_T0_T1_T2_ESD_
-FN:62,_ZNSt16istream_iteratorIN3ept4core7desktop8CategoryEcSt11char_traitsIcEiEC1Ev
-FN:49,_ZNSt16istream_iteratorIN3ept4core7desktop8CategoryEcSt11char_traitsIcEiED1Ev
-FN:114,_ZNSt16istream_iteratorIN3ept4core7desktop8CategoryEcSt11char_traitsIcEiE7_M_readEv
-FN:66,_ZNSt16istream_iteratorIN3ept4core7desktop8CategoryEcSt11char_traitsIcEiEC1ERSi
-FN:88,_ZNSt16istream_iteratorIN3ept4core7desktop8CategoryEcSt11char_traitsIcEiEppEv
-DA:49,32
-DA:62,16
-DA:63,16
-DA:66,16
-DA:67,16
-DA:68,16
-DA:76,112
-DA:81,112
-DA:88,64
-DA:93,64
-DA:94,64
-DA:109,80
-DA:110,80
-DA:114,80
-DA:116,80
-DA:117,80
-DA:119,80
-DA:120,80
-DA:122,80
-DA:136,80
-DA:137,80
-BA:110,2
-BA:110,2
-BA:110,1
-BA:110,2
-BA:110,0
-BA:110,0
-BA:116,2
-BA:116,1
-BA:116,2
-BA:116,1
-BA:117,2
-BA:117,1
-LF:21
-LH:21
-end_of_record
-SF:/usr/include/c++/4.3/bits/vector.tcc
-FN:283,_ZNSt6vectorISsSaISsEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPSsS1_EERKSs
-FN:283,_ZNSt6vectorIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE1EEESaISA_EE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPSA_SC_EERKSA_
-FN:283,_ZNSt6vectorIN3ept4core6SourceINS1_7desktop6SourceENS3_5SetupENS3_12PropertyTypeEE12ComposedListILNS3_10PropertyIdE0EEESaISA_EE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPSA_SC_EERKSA_
-DA:283,7015
-DA:286,7015
-DA:288,0
-DA:291,0
-DA:293,0
-DA:295,0
-DA:299,0
-DA:307,7015
-DA:308,7015
-DA:309,7015
-DA:316,7015
-DA:321,7015
-DA:323,7015
-DA:324,7015
-DA:330,0
-DA:332,0
-DA:333,0
-DA:334,0
-DA:336,7015
-DA:338,7015
-DA:341,7015
-DA:342,7015
-DA:343,7015
-DA:345,7015
-BA:286,1
-BA:286,2
-BA:286,1
-BA:286,2
-BA:286,1
-BA:286,2
-LF:24
-LH:15
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept4core7desktop4File5EntryEEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept4core7desktop4File5GroupEEEED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept4core7desktop4File5EntryEEEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN3ept4core7desktop4File5EntryEEED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept4core7desktop4File5GroupEEEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN3ept4core7desktop4File5GroupEEED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEEC2ERKS3_
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISsE8max_sizeEv
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN3ept4core7desktop4File5EntryEEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN3ept4core7desktop4File5GroupEEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE0EEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE1EEEED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept4core7desktop4File5EntryEEEEC2ERKSB_
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept4core7desktop4File5EntryEEEE8max_sizeEv
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept4core7desktop4File5GroupEEEE8max_sizeEv
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE8max_sizeEv
-FN:69,_ZN9__gnu_cxx13new_allocatorIN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE0EEEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorIN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE1EEEEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorIN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE0EEEE8max_sizeEv
-FN:101,_ZNK9__gnu_cxx13new_allocatorIN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE1EEEE8max_sizeEv
-FN:118,_ZN9__gnu_cxx13new_allocatorISsE7destroyEPSs
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN3ept4core7desktop4File5EntryEEE7destroyEPS8_
-FN:107,_ZN9__gnu_cxx13new_allocatorISsE9constructEPSsRKSs
-FN:107,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN3ept4core7desktop4File5EntryEEE9constructEPS8_RKS8_
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE10deallocateEPS2_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept4core7desktop4File5EntryEEEE10deallocateEPSA_j
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN3ept4core7desktop4File5GroupEEE7destroyEPS8_
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept4core7desktop4File5GroupEEEE10deallocateEPSA_j
-FN:97,_ZN9__gnu_cxx13new_allocatorIN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE1EEEE10deallocateEPSB_j
-FN:97,_ZN9__gnu_cxx13new_allocatorIN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE0EEEE10deallocateEPSB_j
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE8allocateEjPKv
-FN:107,_ZN9__gnu_cxx13new_allocatorIN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE0EEEE9constructEPSB_RKSB_
-FN:107,_ZN9__gnu_cxx13new_allocatorIN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE1EEEE9constructEPSB_RKSB_
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept4core7desktop4File5EntryEEEE8allocateEjPKv
-FN:107,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN3ept4core7desktop4File5GroupEEE9constructEPS8_RKS8_
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept4core7desktop4File5GroupEEEE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorISsE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorIN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE1EEEE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorIN3ept4core6SourceINS2_7desktop6SourceENS4_5SetupENS4_12PropertyTypeEE12ComposedListILNS4_10PropertyIdE0EEEE8allocateEjPKv
-DA:69,3610715
-DA:71,404651
-DA:76,4015352
-DA:87,1767775
-DA:89,1767775
-DA:90,0
-DA:92,1767775
-DA:97,1767647
-DA:98,1767647
-DA:101,1781805
-DA:102,1781805
-DA:107,1771882
-DA:108,1771882
-DA:118,1760730
-BA:89,1
-BA:89,2
-BA:89,1
-BA:89,2
-BA:89,1
-BA:89,2
-BA:89,1
-BA:89,2
-BA:89,1
-BA:89,2
-BA:89,1
-BA:89,2
-BA:108,2
-BA:108,1
-BA:108,2
-BA:108,1
-BA:108,2
-BA:108,1
-BA:108,2
-BA:108,1
-BA:108,2
-BA:108,1
-LF:14
-LH:13
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/fstream
-FN:495,_ZNSt14basic_ifstreamIcSt11char_traitsIcEE4openEPKcSt13_Ios_Openmode
-FN:512,_ZNSt14basic_ifstreamIcSt11char_traitsIcEE5closeEv
-FN:215,_ZNSt13basic_filebufIcSt11char_traitsIcEED1Ev
-FN:442,_ZNSt14basic_ifstreamIcSt11char_traitsIcEEC1EPKcSt13_Ios_Openmode
-FN:455,_ZNSt14basic_ifstreamIcSt11char_traitsIcEED1Ev
-FN:223,_ZNKSt13basic_filebufIcSt11char_traitsIcEE7is_openEv
-FN:474,_ZNSt14basic_ifstreamIcSt11char_traitsIcEE7is_openEv
-DA:215,0
-DA:216,0
-DA:223,0
-DA:224,0
-DA:442,0
-DA:443,0
-DA:445,0
-DA:446,0
-DA:447,0
-DA:455,0
-DA:456,0
-DA:474,0
-DA:475,0
-DA:495,0
-DA:497,0
-DA:498,0
-DA:502,0
-DA:503,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:516,0
-BA:216,0
-BA:216,0
-BA:456,0
-BA:456,0
-BA:456,0
-BA:456,0
-BA:456,0
-BA:456,0
-BA:497,0
-BA:497,0
-BA:514,0
-BA:514,0
-LF:22
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/istream
-FN:585,_ZNSiC2Ev
-FN:105,_ZNSiD2Ev
-DA:105,0
-DA:106,0
-DA:585,0
-DA:586,0
-DA:587,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:106,0
-LF:5
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,5847928
-DA:109,0
-LF:2
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-DA:95,0
-DA:112,0
-DA:117,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:322,_ZNSt19basic_istringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-FN:158,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEE17_M_stringbuf_initESt13_Ios_Openmode
-FN:110,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ERKSsSt13_Ios_Openmode
-FN:312,_ZNSt19basic_istringstreamIcSt11char_traitsIcESaIcEEC1ERKSsSt13_Ios_Openmode
-DA:96,0
-DA:97,0
-DA:98,0
-DA:110,0
-DA:111,0
-DA:112,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:158,0
-DA:160,0
-DA:161,0
-DA:162,0
-DA:163,0
-DA:164,0
-DA:165,0
-DA:312,0
-DA:313,0
-DA:314,0
-DA:322,0
-DA:323,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:162,0
-BA:162,0
-BA:323,0
-BA:323,0
-BA:323,0
-BA:323,0
-BA:323,0
-BA:323,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-LF:33
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt/record.h
-DA:86,1
-BA:86,1
-BA:86,2
-LF:1
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/popcon/maint/path.h
-FN:70,_ZN3ept6popcon4Path23OverridePopconSourceDirC1ERKSs
-FN:74,_ZN3ept6popcon4Path23OverridePopconSourceDirD1Ev
-FN:80,_ZN3ept6popcon4Path22OverridePopconIndexDirC1ERKSs
-FN:84,_ZN3ept6popcon4Path22OverridePopconIndexDirD1Ev
-FN:90,_ZN3ept6popcon4Path27OverridePopconUserSourceDirC1ERKSs
-FN:94,_ZN3ept6popcon4Path27OverridePopconUserSourceDirD1Ev
-FN:100,_ZN3ept6popcon4Path26OverridePopconUserIndexDirC1ERKSs
-FN:104,_ZN3ept6popcon4Path26OverridePopconUserIndexDirD1Ev
-DA:70,7
-DA:72,7
-DA:73,7
-DA:74,7
-DA:80,7
-DA:82,7
-DA:83,7
-DA:84,7
-DA:90,7
-DA:92,7
-DA:93,7
-DA:94,7
-DA:100,7
-DA:102,7
-DA:103,7
-DA:104,7
-LF:16
-LH:16
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/popcon/popcon.h
-FN:96,_ZNK3ept6popcon6Popcon9timestampEv
-FN:99,_ZNK3ept6popcon6Popcon7hasDataEv
-FN:105,_ZNK3ept6popcon6Popcon4sizeEv
-FN:85,_ZNK3ept6popcon6Popcon13structByIndexEj
-FN:126,_ZNK3ept6popcon6Popcon12scoreByIndexEj
-FN:137,_ZNK3ept6popcon6Popcon5scoreEj
-FN:118,_ZNK3ept6popcon6Popcon4nameEj
-FN:102,_ZNK3ept6popcon6Popcon11submissionsEv
-FN:143,_ZNK3ept6popcon6Popcon5scoreERKSs
-FN:146,_ZNK3ept6popcon6PopconixERKSs
-FN:73,_ZN3ept6popcon6PopconD1Ev
-DA:73,7
-DA:85,102350
-DA:87,102350
-DA:88,102350
-DA:89,0
-DA:96,1
-DA:99,1
-DA:102,3
-DA:105,174055
-DA:107,174055
-DA:108,174053
-DA:110,2
-DA:118,30678
-DA:120,30678
-DA:121,30678
-DA:122,30678
-DA:126,71672
-DA:128,71672
-DA:129,71672
-DA:130,71672
-DA:137,71672
-DA:143,1790
-DA:146,2
-BA:87,2
-BA:87,1
-BA:107,2
-BA:107,2
-BA:121,1
-BA:121,2
-BA:129,1
-BA:129,2
-LF:23
-LH:22
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/popcon/popcon.test.h
-FN:44,_ZN10TestPopconC1Ev
-FN:60,_ZN10TestPopcon13accessibilityEv
-FN:51,_ZN10TestPopcon11basicAccessEv
-FN:84,_ZN10TestPopcon11validScoresEv
-FN:90,_ZN10TestPopcon14fallbackValuesEv
-FN:35,_ZN10TestPopconD1Ev
-FN:70,_ZN10TestPopcon10haveScoresEv
-DA:35,5
-DA:44,5
-DA:48,5
-DA:49,5
-DA:51,1
-DA:53,1
-DA:54,2
-DA:55,2
-DA:56,2
-DA:57,1
-DA:60,1
-DA:62,139822
-DA:65,69910
-DA:67,1
-DA:70,1
-DA:72,1
-DA:73,1789
-DA:75,1788
-DA:76,1788
-DA:77,1758
-DA:78,1
-DA:80,2
-DA:81,1
-DA:84,1
-DA:86,1
-DA:87,1
-DA:90,1
-DA:92,1
-DA:93,2
-DA:94,2
-DA:95,2
-DA:96,1
-DA:98,1
-DA:99,2
-DA:101,2
-DA:102,2
-DA:103,2
-DA:104,1
-BA:62,2
-BA:62,2
-BA:73,2
-BA:73,2
-BA:76,2
-BA:76,2
-LF:38
-LH:38
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:13,_ZN8LocationD1Ev
-FN:13,_ZN8LocationC1ERKS_
-FN:17,_ZN8LocationC1EPKciSs
-FN:52,_ZlsIiER12AssertFailedS1_T_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:52,_ZlsIPKcER12AssertFailedS3_T_
-FN:52,_ZlsIlER12AssertFailedS1_T_
-FN:41,_ZN12AssertFailedD1Ev
-FN:67,_Z12assert_eq_fnIliEv8LocationT_T0_
-FN:59,_Z9assert_fnIbEv8LocationT_
-FN:52,_ZlsIjER12AssertFailedS1_T_
-FN:67,_Z12assert_eq_fnIjiEv8LocationT_T0_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:59,0
-DA:61,0
-DA:62,0
-DA:64,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:75,0
-BA:42,0
-BA:42,0
-BA:61,0
-BA:61,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-LF:26
-LH:0
-end_of_record
-SF:/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_popcon_popcon.cpp
-FN:7,_Z41__static_initialization_and_destruction_0ii
-FN:7,_GLOBAL__I_ept_test_generated__home_mornfall_dev_pkg_ept_work_ept_popcon_popcon.cpp
-FN:7,_Z25run_Popcon_fallbackValuesv
-FN:6,_Z22run_Popcon_validScoresv
-FN:4,_Z24run_Popcon_accessibilityv
-FN:3,_Z22run_Popcon_basicAccessv
-FN:5,_Z21run_Popcon_haveScoresv
-DA:3,1
-DA:4,1
-DA:5,1
-DA:6,1
-DA:7,4
-BA:7,2
-BA:7,1
-BA:7,2
-BA:7,1
-LF:5
-LH:5
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:277,_ZNKSs7_M_dataEv
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:686,0
-DA:687,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-LF:53
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:166,0
-DA:167,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-DA:69,0
-DA:71,0
-DA:76,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:169,_ZNSolsEl
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:195,_ZNSolsEj
-DA:95,0
-DA:112,0
-DA:117,0
-DA:169,0
-DA:170,0
-DA:195,0
-DA:199,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt/record.h
-DA:86,1
-BA:86,1
-BA:86,2
-LF:1
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt.h
-FN:139,_ZN3ept4core11AptDatabaseC1Ev
-FN:209,_ZN3ept4core11AptDatabase10invalidateEv
-FN:331,_ZN3ept4core11AptDatabaseD1Ev
-DA:139,0
-DA:140,0
-DA:141,0
-DA:142,0
-DA:143,0
-DA:144,0
-DA:145,0
-DA:146,0
-DA:209,0
-DA:210,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:218,0
-DA:219,0
-DA:220,0
-DA:331,0
-DA:332,0
-DA:333,0
-BA:210,0
-BA:210,0
-BA:214,0
-BA:214,0
-BA:216,0
-BA:216,0
-BA:218,0
-BA:218,0
-LF:21
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/debtags.h
-FN:139,_ZN3ept7debtags7Debtags14const_iteratorC1ERKS1_RKN7tagcoll4coll7PatchedINS6_12IntDiskIndexEE14const_iteratorE
-FN:282,_ZNK3ept7debtags7Debtags10vocabularyEv
-FN:289,_ZN3ept7debtags7Debtags5pkgidEv
-FN:175,_ZNK3ept7debtags7Debtags14const_iteratorneERKS2_
-FN:97,_ZNK3ept7debtags7Debtags11packageByIDEi
-FN:182,_ZNK3ept7debtags7Debtags5beginEv
-FN:183,_ZNK3ept7debtags7Debtags3endEv
-FN:143,_ZN3ept7debtags7Debtags14const_iteratorD1Ev
-FN:194,_ZN3ept7debtags7DebtagsD1Ev
-FN:161,_ZN3ept7debtags7Debtags14const_iteratorppEv
-FN:148,_ZNK3ept7debtags7Debtags14const_iteratordeEv
-FN:155,_ZNK3ept7debtags7Debtags14const_iteratorptEv
-DA:97,0
-DA:99,0
-DA:139,0
-DA:140,0
-DA:143,0
-DA:145,0
-DA:146,0
-DA:147,0
-DA:148,0
-DA:150,0
-DA:151,0
-DA:153,0
-DA:155,0
-DA:157,0
-DA:158,0
-DA:159,0
-DA:161,0
-DA:163,0
-DA:164,0
-DA:166,0
-DA:167,0
-DA:169,0
-DA:175,0
-DA:177,0
-DA:182,0
-DA:183,0
-DA:194,0
-DA:282,0
-DA:289,0
-BA:145,0
-BA:145,0
-BA:146,0
-BA:146,0
-BA:150,0
-BA:150,0
-BA:157,0
-BA:157,0
-BA:164,0
-BA:164,0
-BA:166,0
-BA:166,0
-LF:29
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/maint/path.h
-FN:76,_ZN3ept7debtags4Path24OverrideDebtagsSourceDirC1ERKSs
-FN:80,_ZN3ept7debtags4Path24OverrideDebtagsSourceDirD1Ev
-FN:86,_ZN3ept7debtags4Path23OverrideDebtagsIndexDirC1ERKSs
-FN:90,_ZN3ept7debtags4Path23OverrideDebtagsIndexDirD1Ev
-FN:96,_ZN3ept7debtags4Path28OverrideDebtagsUserSourceDirC1ERKSs
-FN:100,_ZN3ept7debtags4Path28OverrideDebtagsUserSourceDirD1Ev
-FN:106,_ZN3ept7debtags4Path27OverrideDebtagsUserIndexDirC1ERKSs
-FN:110,_ZN3ept7debtags4Path27OverrideDebtagsUserIndexDirD1Ev
-DA:76,0
-DA:78,0
-DA:79,0
-DA:80,0
-DA:86,0
-DA:88,0
-DA:89,0
-DA:90,0
-DA:96,0
-DA:98,0
-DA:99,0
-DA:100,0
-DA:106,0
-DA:108,0
-DA:109,0
-DA:110,0
-LF:16
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/maint/pkgid.h
-FN:54,_ZNK3ept7debtags5PkgId4sizeEv
-FN:68,_ZNK3ept7debtags5PkgId4byIDEi
-FN:41,_ZN3ept7debtags5PkgIdD1Ev
-DA:41,0
-DA:54,0
-DA:68,0
-DA:70,0
-DA:71,0
-DA:72,0
-BA:54,0
-BA:54,0
-BA:70,0
-BA:70,0
-BA:70,0
-BA:70,0
-BA:70,0
-BA:70,0
-LF:6
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/maint/pkgid.test.h
-FN:38,_ZN9TestPkgidC1Ev
-FN:34,_ZN9TestPkgidD1Ev
-FN:62,_ZN9TestPkgid2_2Ev
-FN:44,_ZN9TestPkgid2_1Ev
-DA:34,2
-DA:38,2
-DA:39,2
-DA:41,2
-DA:44,1
-DA:47,21146
-DA:50,21145
-DA:51,21145
-DA:52,21145
-DA:58,1
-DA:59,1
-DA:62,1
-DA:66,1
-DA:67,1
-DA:68,21146
-DA:69,21146
-DA:70,1
-DA:71,1
-BA:47,2
-BA:47,2
-BA:68,2
-BA:68,2
-LF:18
-LH:18
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/tag.h
-FN:175,_ZN3ept7debtags3TagD1Ev
-FN:179,_ZNK3ept7debtags3TagltERKS1_
-DA:175,0
-DA:179,0
-LF:2
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/vocabulary.h
-FN:181,_ZNK3ept7debtags10Vocabulary8tagsByIDISt3setIiSt4lessIiESaIiEEEES3_INS0_3TagES4_IS8_ESaIS8_EERKT_
-DA:181,0
-DA:183,0
-DA:184,0
-DA:186,0
-DA:187,0
-BA:184,0
-BA:184,0
-LF:5
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/test.h
-FN:12,_ZN18AptTestEnvironmentC2Ev
-FN:10,_ZN18AptTestEnvironmentD2Ev
-FN:30,_ZN22DebtagsTestEnvironmentC2Ev
-FN:24,_ZN22DebtagsTestEnvironmentD2Ev
-DA:10,0
-DA:12,0
-DA:13,0
-DA:14,0
-DA:15,0
-DA:16,0
-DA:17,0
-DA:18,0
-DA:19,0
-DA:20,0
-DA:21,0
-DA:24,0
-DA:30,0
-DA:34,0
-DA:35,0
-LF:15
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/operators.h
-FN:74,_ZN6wibble9operatorsorIiEESt3setIT_St4lessIS3_ESaIS3_EERKS7_S9_
-FN:82,_ZN6wibble9operatorsmiIiEESt3setIT_St4lessIS3_ESaIS3_EERKS7_S9_
-DA:74,0
-DA:75,0
-DA:76,0
-DA:78,0
-DA:82,0
-DA:83,0
-DA:84,0
-DA:86,0
-LF:8
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:13,_ZN8LocationD1Ev
-FN:17,_ZN8LocationC1EPKciSs
-FN:13,_ZN8LocationC1ERKS_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:52,_ZlsIPKcER12AssertFailedS3_T_
-FN:52,_ZlsIjER12AssertFailedS1_T_
-FN:41,_ZN12AssertFailedD1Ev
-FN:67,_Z12assert_eq_fnIjjEv8LocationT_T0_
-FN:59,_Z9assert_fnIbEv8LocationT_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:59,0
-DA:61,0
-DA:62,0
-DA:64,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:75,0
-BA:42,0
-BA:42,0
-BA:61,0
-BA:61,0
-BA:69,0
-BA:69,0
-LF:26
-LH:0
-end_of_record
-SF:/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_maint_pkgid.cpp
-FN:4,_Z41__static_initialization_and_destruction_0ii
-FN:4,_GLOBAL__I_ept_test_generated__home_mornfall_dev_pkg_ept_work_ept_debtags_maint_pkgid.cpp
-FN:4,_Z12run_Pkgid__2v
-FN:3,_Z12run_Pkgid__1v
-DA:3,1
-DA:4,4
-BA:4,2
-BA:4,1
-BA:4,2
-BA:4,1
-LF:2
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeIN3ept7debtags3TagEEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeIiEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISt4pairIKiN7tagcoll5PatchIiiEEEEED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:98,_ZNSaISt13_Rb_tree_nodeIN3ept7debtags3TagEEEC2Ev
-FN:106,_ZNSaIN3ept7debtags3TagEED1Ev
-FN:100,_ZNSaISt13_Rb_tree_nodeIN3ept7debtags3TagEEEC2ERKS4_
-FN:98,_ZNSaISt13_Rb_tree_nodeIiEEC2Ev
-FN:106,_ZNSaIiED1Ev
-FN:100,_ZNSaISt13_Rb_tree_nodeIiEEC2ERKS1_
-FN:106,_ZNSaISt4pairIKiN7tagcoll5PatchIiiEEEED1Ev
-FN:104,_ZNSaIN3ept7debtags3TagEEC1ISt13_Rb_tree_nodeIS1_EEERKSaIT_E
-FN:104,_ZNSaIiEC1ISt13_Rb_tree_nodeIiEEERKSaIT_E
-FN:104,_ZNSaISt4pairIKiN7tagcoll5PatchIiiEEEEC1ISt13_Rb_tree_nodeIS4_EEERKSaIT_E
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:104,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:7
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:277,_ZNKSs7_M_dataEv
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-FN:2162,_ZSteqIcEN9__gnu_cxx11__enable_ifIXsrSt9__is_charIT_E7__valueEbE6__typeERKSbIS3_St11char_traitsIS3_ESaIS3_EESC_
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2162,0
-DA:2165,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-LF:53
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-DA:245,0
-DA:246,0
-DA:257,0
-DA:258,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algo.h
-FN:5055,_ZSt9set_unionISt23_Rb_tree_const_iteratorIiES1_St15insert_iteratorISt3setIiSt4lessIiESaIiEEEET1_T_SA_T0_SB_S9_
-FN:5300,_ZSt14set_differenceISt23_Rb_tree_const_iteratorIiES1_St15insert_iteratorISt3setIiSt4lessIiESaIiEEEET1_T_SA_T0_SB_S9_
-DA:5055,0
-DA:5074,0
-DA:5076,0
-DA:5078,0
-DA:5079,0
-DA:5081,0
-DA:5083,0
-DA:5084,0
-DA:5088,0
-DA:5089,0
-DA:5090,0
-DA:5092,0
-DA:5095,0
-DA:5300,0
-DA:5317,0
-DA:5318,0
-DA:5320,0
-DA:5321,0
-DA:5322,0
-DA:5324,0
-DA:5325,0
-DA:5328,0
-DA:5329,0
-DA:5331,0
-BA:5074,0
-BA:5074,0
-BA:5074,0
-BA:5074,0
-BA:5074,0
-BA:5074,0
-BA:5076,0
-BA:5076,0
-BA:5081,0
-BA:5081,0
-BA:5317,0
-BA:5317,0
-BA:5317,0
-BA:5317,0
-BA:5317,0
-BA:5317,0
-BA:5318,0
-BA:5318,0
-BA:5324,0
-BA:5324,0
-LF:24
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseISt23_Rb_tree_const_iteratorIiELb0EE3__bES1_
-FN:268,_ZNSt12__niter_baseISt23_Rb_tree_const_iteratorIiELb0EE3__bES1_
-FN:268,_ZNSt12__niter_baseISt15insert_iteratorISt3setIiSt4lessIiESaIiEEELb0EE3__bES6_
-FN:309,_ZNSt11__copy_moveILb0ELb0ESt26bidirectional_iterator_tagE8__copy_mISt23_Rb_tree_const_iteratorIiESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEET0_T_SD_SC_
-FN:385,_ZSt13__copy_move_aILb0ESt23_Rb_tree_const_iteratorIiESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEET1_T0_SA_S9_
-FN:430,_ZSt14__copy_move_a2ILb0ESt23_Rb_tree_const_iteratorIiESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEET1_T0_SA_S9_
-FN:456,_ZSt4copyISt23_Rb_tree_const_iteratorIiESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEET0_T_SA_S9_
-DA:268,0
-DA:269,0
-DA:286,0
-DA:287,0
-DA:309,0
-DA:311,0
-DA:312,0
-DA:313,0
-DA:385,0
-DA:393,0
-DA:396,0
-DA:430,0
-DA:435,0
-DA:456,0
-DA:466,0
-BA:311,0
-BA:311,0
-LF:15
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_function.h
-FN:469,_ZNKSt9_IdentityIN3ept7debtags3TagEEclERKS2_
-FN:229,_ZNKSt4lessIN3ept7debtags3TagEEclERKS2_S5_
-FN:469,_ZNKSt9_IdentityIiEclERKi
-FN:229,_ZNKSt4lessIiEclERKiS2_
-DA:229,0
-DA:230,0
-DA:469,0
-DA:470,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:572,_ZNSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEC1ERS4_St23_Rb_tree_const_iteratorIiE
-FN:645,_ZSt8inserterISt3setIiSt4lessIiESaIiEESt23_Rb_tree_const_iteratorIiEESt15insert_iteratorIT_ERS8_T0_
-FN:618,_ZNSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEdeEv
-FN:623,_ZNSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEppEv
-FN:599,_ZNSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEaSERKi
-DA:572,0
-DA:573,0
-DA:599,0
-DA:601,0
-DA:602,0
-DA:603,0
-DA:618,0
-DA:619,0
-DA:623,0
-DA:624,0
-DA:645,0
-DA:648,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,0
-DA:166,0
-DA:167,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_map.h
-FN:284,_ZNKSt3mapIiN7tagcoll5PatchIiiEESt4lessIiESaISt4pairIKiS2_EEE5beginEv
-FN:302,_ZNKSt3mapIiN7tagcoll5PatchIiiEESt4lessIiESaISt4pairIKiS2_EEE3endEv
-FN:92,_ZNSt3mapIiN7tagcoll5PatchIiiEESt4lessIiESaISt4pairIKiS2_EEED2Ev
-DA:92,0
-DA:284,0
-DA:285,0
-DA:302,0
-DA:303,0
-LF:5
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_pair.h
-FN:88,_ZNSt4pairISt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEbEC1ERKS4_RKb
-FN:88,_ZNSt4pairISt23_Rb_tree_const_iteratorIiEbEC1ERKS1_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIN3ept7debtags3TagEEbEC1ERKS4_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIiEbEC1ERKS1_RKb
-FN:73,_ZNSt4pairIKiN7tagcoll5PatchIiiEEED1Ev
-FN:73,_ZNSt4pairIiSt3setIiSt4lessIiESaIiEEED1Ev
-FN:73,_ZNSt4pairISsSt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EEED1Ev
-FN:73,_ZNSt4pairISsSt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EEEC1ERKS8_
-FN:88,_ZNSt4pairISsSt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EEEC1ERKSsRKS7_
-FN:218,_ZSt9make_pairISsSt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EEESt4pairIT_T0_ES9_SA_
-FN:73,_ZNSt4pairIiSt3setIiSt4lessIiESaIiEEEC1ERKS5_
-FN:88,_ZNSt4pairIiSt3setIiSt4lessIiESaIiEEEC1ERKiRKS4_
-FN:218,_ZSt9make_pairIiSt3setIiSt4lessIiESaIiEEESt4pairIT_T0_ES6_S7_
-DA:73,0
-DA:88,0
-DA:89,0
-DA:218,0
-DA:219,0
-LF:5
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_set.h
-FN:336,_ZNKSt3setIiSt4lessIiESaIiEE4sizeEv
-FN:261,_ZNKSt3setIiSt4lessIiESaIiEE5beginEv
-FN:270,_ZNKSt3setIiSt4lessIiESaIiEE3endEv
-FN:141,_ZNSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EEC1Ev
-FN:141,_ZNSt3setIiSt4lessIiESaIiEEC1Ev
-FN:93,_ZNSt3setIiSt4lessIiESaIiEED1Ev
-FN:93,_ZNSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EED1Ev
-FN:193,_ZNSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EEC1ERKS6_
-FN:193,_ZNSt3setIiSt4lessIiESaIiEEC1ERKS3_
-FN:378,_ZNSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EE6insertERKS2_
-FN:378,_ZNSt3setIiSt4lessIiESaIiEE6insertERKi
-FN:405,_ZNSt3setIiSt4lessIiESaIiEE6insertESt23_Rb_tree_const_iteratorIiERKi
-DA:93,0
-DA:141,0
-DA:142,0
-DA:193,0
-DA:194,0
-DA:261,0
-DA:262,0
-DA:270,0
-DA:271,0
-DA:336,0
-DA:337,0
-DA:378,0
-DA:381,0
-DA:382,0
-DA:405,0
-DA:406,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_tree.h
-FN:103,_ZNSt18_Rb_tree_node_base10_S_minimumEPS_
-FN:117,_ZNSt18_Rb_tree_node_base10_S_maximumEPS_
-FN:452,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_M_beginEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEC1ERKSt17_Rb_tree_iteratorIS2_E
-FN:452,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_M_beginEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorIiEC1ERKSt17_Rb_tree_iteratorIiE
-FN:289,_ZNKSt23_Rb_tree_const_iteratorIiEneERKS0_
-FN:247,_ZNKSt23_Rb_tree_const_iteratorIiEdeEv
-FN:285,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKiN7tagcoll5PatchIiiEEEEeqERKS6_
-FN:251,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKiN7tagcoll5PatchIiiEEEEptEv
-FN:289,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKiN7tagcoll5PatchIiiEEEEneERKS6_
-FN:452,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE8_M_beginEv
-FN:641,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE4sizeEv
-FN:398,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13_Rb_tree_implIS6_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:463,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE6_M_endEv
-FN:168,_ZNSt17_Rb_tree_iteratorIN3ept7debtags3TagEEC1EPSt13_Rb_tree_nodeIS2_E
-FN:596,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE5beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorIN3ept7debtags3TagEEeqERKS3_
-FN:347,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE21_M_get_Node_allocatorEv
-FN:432,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE7_M_rootEv
-FN:456,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_M_beginEv
-FN:428,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE7_M_rootEv
-FN:503,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE10_S_minimumEPSt18_Rb_tree_node_base
-FN:436,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE11_M_leftmostEv
-FN:511,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE10_S_maximumEPSt18_Rb_tree_node_base
-FN:444,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE12_M_rightmostEv
-FN:398,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_Rb_tree_implIS3_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE7_S_leftEPSt18_Rb_tree_node_base
-FN:347,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE21_M_get_Node_allocatorEv
-FN:432,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE7_M_rootEv
-FN:456,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_M_beginEv
-FN:463,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE6_M_endEv
-FN:428,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE7_M_rootEv
-FN:503,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE10_S_minimumEPSt18_Rb_tree_node_base
-FN:436,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE11_M_leftmostEv
-FN:511,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE10_S_maximumEPSt18_Rb_tree_node_base
-FN:444,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE12_M_rightmostEv
-FN:168,_ZNSt17_Rb_tree_iteratorIiEC1EPSt13_Rb_tree_nodeIiE
-FN:596,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorIiEeqERKS0_
-FN:398,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE13_Rb_tree_implIS9_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:415,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13_Rb_tree_implIS6_Lb0EE13_M_initializeEv
-FN:471,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_S_valueEPKSt13_Rb_tree_nodeIS2_E
-FN:475,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE6_S_keyEPKSt13_Rb_tree_nodeIS2_E
-FN:495,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE6_S_keyEPKSt18_Rb_tree_node_base
-FN:491,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_S_rightEPKSt18_Rb_tree_node_base
-FN:483,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE7_S_leftEPKSt18_Rb_tree_node_base
-FN:415,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_Rb_tree_implIS3_Lb0EE13_M_initializeEv
-FN:491,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_S_rightEPKSt18_Rb_tree_node_base
-FN:483,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE7_S_leftEPKSt18_Rb_tree_node_base
-FN:471,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_S_valueEPKSt13_Rb_tree_nodeIiE
-FN:475,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE6_S_keyEPKSt13_Rb_tree_nodeIiE
-FN:495,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE6_S_keyEPKSt18_Rb_tree_node_base
-FN:240,_ZNSt23_Rb_tree_const_iteratorIiEC1EPKSt13_Rb_tree_nodeIiE
-FN:603,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5beginEv
-FN:614,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE3endEv
-FN:240,_ZNSt23_Rb_tree_const_iteratorISt4pairIKiN7tagcoll5PatchIiiEEEEC1EPKSt13_Rb_tree_nodeIS5_E
-FN:603,_ZNKSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE5beginEv
-FN:614,_ZNKSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE3endEv
-FN:403,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13_Rb_tree_implIS6_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EEC1Ev
-FN:408,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13_Rb_tree_implIS6_Lb0EEC1ERKS6_RKSaISt13_Rb_tree_nodeIS2_EE
-FN:403,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_Rb_tree_implIS3_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEEC1Ev
-FN:408,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_Rb_tree_implIS3_Lb0EEC1ERKS3_RKSaISt13_Rb_tree_nodeIiEE
-FN:347,_ZNKSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE21_M_get_Node_allocatorEv
-FN:351,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13get_allocatorEv
-FN:351,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13get_allocatorEv
-FN:351,_ZNKSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE13get_allocatorEv
-FN:360,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE11_M_put_nodeEPSt13_Rb_tree_nodeIiE
-FN:388,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE15_M_destroy_nodeEPSt13_Rb_tree_nodeIiE
-FN:936,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_M_eraseEPSt13_Rb_tree_nodeIiE
-FN:584,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEED1Ev
-FN:360,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS5_E
-FN:388,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS5_E
-FN:936,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE8_M_eraseEPSt13_Rb_tree_nodeIS5_E
-FN:584,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EED1Ev
-FN:360,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS2_E
-FN:388,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS2_E
-FN:936,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_M_eraseEPSt13_Rb_tree_nodeIS2_E
-FN:584,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EED1Ev
-FN:356,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE14_M_create_nodeERKS2_
-FN:378,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13_M_clone_nodeEPKSt13_Rb_tree_nodeIS2_E
-FN:900,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE7_M_copyEPKSt13_Rb_tree_nodeIS2_EPSA_
-FN:568,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EEC1ERKS8_
-FN:356,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE14_M_create_nodeERKi
-FN:378,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_M_clone_nodeEPKSt13_Rb_tree_nodeIiE
-FN:900,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE7_M_copyEPKSt13_Rb_tree_nodeIiEPS7_
-FN:568,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEEC1ERKS5_
-FN:195,_ZNSt17_Rb_tree_iteratorIN3ept7debtags3TagEEmmEv
-FN:195,_ZNSt17_Rb_tree_iteratorIiEmmEv
-FN:846,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE10_M_insert_EPKSt18_Rb_tree_node_baseSB_RKS2_
-FN:1133,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE16_M_insert_uniqueERKS2_
-FN:846,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE10_M_insert_EPKSt18_Rb_tree_node_baseS8_RKi
-FN:1133,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE16_M_insert_uniqueERKi
-FN:255,_ZNSt23_Rb_tree_const_iteratorIiEppEv
-FN:255,_ZNSt23_Rb_tree_const_iteratorISt4pairIKiN7tagcoll5PatchIiiEEEEppEv
-FN:270,_ZNSt23_Rb_tree_const_iteratorIiEmmEv
-FN:1178,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE17_M_insert_unique_ESt23_Rb_tree_const_iteratorIiERKi
-DA:103,0
-DA:105,0
-DA:106,0
-DA:117,0
-DA:119,0
-DA:120,0
-DA:168,0
-DA:169,0
-DA:195,0
-DA:197,0
-DA:198,0
-DA:210,0
-DA:211,0
-DA:240,0
-DA:241,0
-DA:243,0
-DA:244,0
-DA:247,0
-DA:248,0
-DA:251,0
-DA:252,0
-DA:255,0
-DA:257,0
-DA:258,0
-DA:270,0
-DA:272,0
-DA:273,0
-DA:285,0
-DA:286,0
-DA:289,0
-DA:290,0
-DA:347,0
-DA:348,0
-DA:351,0
-DA:352,0
-DA:356,0
-DA:357,0
-DA:360,0
-DA:361,0
-DA:364,0
-DA:366,0
-DA:368,0
-DA:369,0
-DA:371,0
-DA:372,0
-DA:374,0
-DA:378,0
-DA:380,0
-DA:381,0
-DA:382,0
-DA:383,0
-DA:384,0
-DA:388,0
-DA:390,0
-DA:391,0
-DA:392,0
-DA:398,0
-DA:403,0
-DA:405,0
-DA:406,0
-DA:408,0
-DA:410,0
-DA:411,0
-DA:415,0
-DA:417,0
-DA:418,0
-DA:419,0
-DA:420,0
-DA:421,0
-DA:428,0
-DA:429,0
-DA:432,0
-DA:433,0
-DA:436,0
-DA:437,0
-DA:444,0
-DA:445,0
-DA:452,0
-DA:453,0
-DA:456,0
-DA:459,0
-DA:463,0
-DA:464,0
-DA:471,0
-DA:472,0
-DA:475,0
-DA:476,0
-DA:479,0
-DA:480,0
-DA:483,0
-DA:484,0
-DA:487,0
-DA:488,0
-DA:491,0
-DA:492,0
-DA:495,0
-DA:496,0
-DA:499,0
-DA:500,0
-DA:503,0
-DA:504,0
-DA:511,0
-DA:512,0
-DA:562,0
-DA:568,0
-DA:569,0
-DA:571,0
-DA:573,0
-DA:574,0
-DA:575,0
-DA:576,0
-DA:578,0
-DA:584,0
-DA:585,0
-DA:596,0
-DA:599,0
-DA:603,0
-DA:606,0
-DA:614,0
-DA:617,0
-DA:641,0
-DA:642,0
-DA:846,0
-DA:850,0
-DA:852,0
-DA:854,0
-DA:857,0
-DA:858,0
-DA:900,0
-DA:903,0
-DA:904,0
-DA:908,0
-DA:909,0
-DA:910,0
-DA:911,0
-DA:913,0
-DA:915,0
-DA:916,0
-DA:917,0
-DA:918,0
-DA:919,0
-DA:920,0
-DA:921,0
-DA:924,0
-DA:926,0
-DA:927,0
-DA:929,0
-DA:936,0
-DA:939,0
-DA:941,0
-DA:942,0
-DA:943,0
-DA:944,0
-DA:946,0
-DA:1133,0
-DA:1135,0
-DA:1136,0
-DA:1137,0
-DA:1138,0
-DA:1140,0
-DA:1141,0
-DA:1142,0
-DA:1144,0
-DA:1145,0
-DA:1147,0
-DA:1148,0
-DA:1150,0
-DA:1152,0
-DA:1153,0
-DA:1154,0
-DA:1178,0
-DA:1181,0
-DA:1183,0
-DA:1186,0
-DA:1188,0
-DA:1190,0
-DA:1194,0
-DA:1195,0
-DA:1196,0
-DA:1197,0
-DA:1200,0
-DA:1201,0
-DA:1204,0
-DA:1207,0
-DA:1209,0
-DA:1213,0
-DA:1214,0
-DA:1215,0
-DA:1216,0
-DA:1219,0
-DA:1220,0
-DA:1222,0
-DA:1225,0
-DA:1230,0
-BA:105,0
-BA:105,0
-BA:119,0
-BA:119,0
-BA:571,0
-BA:571,0
-BA:571,0
-BA:571,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:908,0
-BA:908,0
-BA:908,0
-BA:908,0
-BA:913,0
-BA:913,0
-BA:913,0
-BA:913,0
-BA:918,0
-BA:918,0
-BA:918,0
-BA:918,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:1138,0
-BA:1138,0
-BA:1138,0
-BA:1138,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1145,0
-BA:1145,0
-BA:1145,0
-BA:1145,0
-BA:1147,0
-BA:1147,0
-BA:1147,0
-BA:1147,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1181,0
-BA:1181,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1190,0
-BA:1190,0
-BA:1195,0
-BA:1195,0
-BA:1197,0
-BA:1197,0
-BA:1200,0
-BA:1200,0
-BA:1209,0
-BA:1209,0
-BA:1214,0
-BA:1214,0
-BA:1216,0
-BA:1216,0
-BA:1219,0
-BA:1219,0
-LF:194
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKiN7tagcoll5PatchIiiEEEEED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:118,_ZN9__gnu_cxx13new_allocatorIN3ept7debtags3TagEE7destroyEPS3_
-FN:118,_ZN9__gnu_cxx13new_allocatorIiE7destroyEPi
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIN3ept7debtags3TagEED2Ev
-FN:107,_ZN9__gnu_cxx13new_allocatorIN3ept7debtags3TagEE9constructEPS3_RKS3_
-FN:71,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEEC2ERKS6_
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIiED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEEC2ERKS3_
-FN:107,_ZN9__gnu_cxx13new_allocatorIiE9constructEPiRKi
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKiN7tagcoll5PatchIiiEEEED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorIN3ept7debtags3TagEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorIiEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKiN7tagcoll5PatchIiiEEEEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEE8max_sizeEv
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEE8max_sizeEv
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEE10deallocateEPS2_j
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKiN7tagcoll5PatchIiiEEEE7destroyEPS6_
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKiN7tagcoll5PatchIiiEEEEE10deallocateEPS8_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEE10deallocateEPS5_j
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEE8allocateEjPKv
-DA:69,0
-DA:71,0
-DA:76,0
-DA:87,0
-DA:89,0
-DA:90,0
-DA:92,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:107,0
-DA:108,0
-DA:118,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:108,0
-BA:108,0
-BA:108,0
-BA:108,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-DA:105,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:195,_ZNSolsEj
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-DA:95,0
-DA:112,0
-DA:117,0
-DA:195,0
-DA:199,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/coll/intdiskindex.h
-FN:74,_ZN7tagcoll4coll12IntDiskIndex14const_iteratorC1ERKS1_i
-FN:77,_ZN7tagcoll4coll12IntDiskIndex14const_iteratorC1ERKS1_
-FN:98,_ZNK7tagcoll4coll12IntDiskIndex14const_iteratoreqERKS2_
-FN:102,_ZNK7tagcoll4coll12IntDiskIndex14const_iteratorneERKS2_
-FN:107,_ZNK7tagcoll4coll12IntDiskIndex5beginEv
-FN:108,_ZNK7tagcoll4coll12IntDiskIndex3endEv
-FN:79,_ZN7tagcoll4coll12IntDiskIndex14const_iteratorD1Ev
-FN:92,_ZN7tagcoll4coll12IntDiskIndex14const_iteratorppEv
-FN:81,_ZNK7tagcoll4coll12IntDiskIndex14const_iteratordeEv
-FN:85,_ZNK7tagcoll4coll12IntDiskIndex14const_iteratorptEv
-DA:74,0
-DA:75,0
-DA:77,0
-DA:78,0
-DA:79,0
-DA:81,0
-DA:83,0
-DA:85,0
-DA:87,0
-DA:88,0
-DA:89,0
-DA:92,0
-DA:94,0
-DA:95,0
-DA:96,0
-DA:98,0
-DA:100,0
-DA:102,0
-DA:104,0
-DA:107,0
-DA:108,0
-BA:79,0
-BA:79,0
-BA:79,0
-BA:79,0
-BA:87,0
-BA:87,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-LF:21
-LH:0
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/coll/patched.h
-FN:157,_ZNK7tagcoll4coll7PatchedINS0_12IntDiskIndexEE14const_iteratorneERKS4_
-FN:96,_ZN7tagcoll4coll7PatchedINS0_12IntDiskIndexEE14const_iteratorC1ERKS3_RKNS2_14const_iteratorERKSt23_Rb_tree_const_iteratorISt4pairIKiNS_5PatchIiiEEEE
-FN:51,_ZN7tagcoll4coll7PatchedINS0_12IntDiskIndexEED1Ev
-FN:164,_ZNK7tagcoll4coll7PatchedINS0_12IntDiskIndexEE5beginEv
-FN:165,_ZNK7tagcoll4coll7PatchedINS0_12IntDiskIndexEE3endEv
-FN:100,_ZN7tagcoll4coll7PatchedINS0_12IntDiskIndexEE14const_iteratorD1Ev
-FN:129,_ZN7tagcoll4coll7PatchedINS0_12IntDiskIndexEE14const_iteratorppEv
-FN:105,_ZNK7tagcoll4coll7PatchedINS0_12IntDiskIndexEE14const_iteratordeEv
-FN:123,_ZNK7tagcoll4coll7PatchedINS0_12IntDiskIndexEE14const_iteratorptEv
-DA:51,0
-DA:96,0
-DA:97,0
-DA:100,0
-DA:102,0
-DA:103,0
-DA:104,0
-DA:105,0
-DA:107,0
-DA:108,0
-DA:110,0
-DA:111,0
-DA:112,0
-DA:113,0
-DA:114,0
-DA:115,0
-DA:116,0
-DA:117,0
-DA:118,0
-DA:119,0
-DA:121,0
-DA:123,0
-DA:125,0
-DA:126,0
-DA:127,0
-DA:129,0
-DA:131,0
-DA:133,0
-DA:134,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:138,0
-DA:139,0
-DA:140,0
-DA:143,0
-DA:144,0
-DA:146,0
-DA:148,0
-DA:149,0
-DA:151,0
-DA:157,0
-DA:159,0
-DA:164,0
-DA:165,0
-BA:102,0
-BA:102,0
-BA:103,0
-BA:103,0
-BA:107,0
-BA:107,0
-BA:110,0
-BA:110,0
-BA:110,0
-BA:110,0
-BA:110,0
-BA:110,0
-BA:110,0
-BA:110,0
-BA:110,0
-BA:110,0
-BA:112,0
-BA:112,0
-BA:114,0
-BA:114,0
-BA:116,0
-BA:116,0
-BA:118,0
-BA:118,0
-BA:125,0
-BA:125,0
-BA:131,0
-BA:131,0
-BA:131,0
-BA:131,0
-BA:131,0
-BA:131,0
-BA:131,0
-BA:131,0
-BA:131,0
-BA:131,0
-BA:133,0
-BA:133,0
-BA:135,0
-BA:135,0
-BA:137,0
-BA:137,0
-BA:139,0
-BA:139,0
-BA:146,0
-BA:146,0
-BA:148,0
-BA:148,0
-BA:159,0
-BA:159,0
-BA:159,0
-BA:159,0
-LF:45
-LH:0
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/diskindex/int.h
-FN:53,_ZNK7tagcoll9diskindex3Int3bufEv
-FN:54,_ZNK7tagcoll9diskindex3Int3ofsEi
-FN:62,_ZNK7tagcoll9diskindex3Int4sizeEv
-DA:53,0
-DA:54,0
-DA:62,0
-BA:62,0
-BA:62,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/patch.h
-FN:49,_ZN7tagcoll5PatchIiiED1Ev
-FN:124,_ZN7tagcoll9PatchListIiiED1Ev
-FN:83,_ZNK7tagcoll5PatchIiiE5applyERKSt3setIiSt4lessIiESaIiEE
-DA:49,0
-DA:83,0
-DA:86,0
-DA:124,0
-LF:4
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/apt/packagerecord.h
-FN:64,_ZN3ept3apt13PackageRecordC1ERKSs
-FN:37,_ZN3ept3apt13PackageRecordD1Ev
-FN:51,_ZNK3ept3apt13PackageRecord11parseStringERKSsS3_
-FN:66,_ZNK3ept3apt13PackageRecord7packageERKSs
-FN:70,_ZNK3ept3apt13PackageRecord8priorityERKSs
-FN:74,_ZNK3ept3apt13PackageRecord7sectionERKSs
-FN:82,_ZNK3ept3apt13PackageRecord10maintainerERKSs
-FN:86,_ZNK3ept3apt13PackageRecord12architectureERKSs
-FN:90,_ZNK3ept3apt13PackageRecord6sourceERKSs
-FN:94,_ZNK3ept3apt13PackageRecord7versionERKSs
-FN:98,_ZNK3ept3apt13PackageRecord8replacesERKSs
-FN:122,_ZNK3ept3apt13PackageRecord8providesERKSs
-FN:102,_ZNK3ept3apt13PackageRecord7dependsERKSs
-FN:106,_ZNK3ept3apt13PackageRecord10preDependsERKSs
-FN:110,_ZNK3ept3apt13PackageRecord10recommendsERKSs
-FN:114,_ZNK3ept3apt13PackageRecord8suggestsERKSs
-FN:118,_ZNK3ept3apt13PackageRecord8enhancesERKSs
-FN:126,_ZNK3ept3apt13PackageRecord9conflictsERKSs
-FN:130,_ZNK3ept3apt13PackageRecord8filenameERKSs
-FN:138,_ZNK3ept3apt13PackageRecord6md5sumERKSs
-FN:142,_ZNK3ept3apt13PackageRecord4sha1ERKSs
-FN:146,_ZNK3ept3apt13PackageRecord6sha256ERKSs
-FN:150,_ZNK3ept3apt13PackageRecord11descriptionERKSs
-FN:78,_ZNK3ept3apt13PackageRecord13installedSizeEj
-FN:134,_ZNK3ept3apt13PackageRecord11packageSizeEj
-FN:154,_ZNK3ept3apt13PackageRecord16shortDescriptionERKSs
-FN:158,_ZNK3ept3apt13PackageRecord15longDescriptionERKSs
-FN:38,_ZNK3ept3apt13PackageRecord9parseBoolERbRKSs
-FN:162,_ZNK3ept3apt13PackageRecord14buildEssentialEb
-FN:166,_ZNK3ept3apt13PackageRecord3tagERKSt3setISsSt4lessISsESaISsEE
-DA:37,7
-DA:38,1
-DA:41,1
-DA:43,0
-DA:45,1
-DA:47,1
-DA:49,0
-DA:51,10436
-DA:53,10436
-DA:54,0
-DA:55,10436
-DA:64,1
-DA:66,7813
-DA:68,7813
-DA:70,1
-DA:72,1
-DA:74,1
-DA:76,1
-DA:78,2605
-DA:80,2605
-DA:82,1
-DA:84,1
-DA:86,1
-DA:88,1
-DA:90,1
-DA:92,1
-DA:94,1
-DA:96,1
-DA:98,1
-DA:100,1
-DA:102,1
-DA:104,1
-DA:106,1
-DA:108,1
-DA:110,1
-DA:112,1
-DA:114,1
-DA:116,1
-DA:118,1
-DA:120,1
-DA:122,1
-DA:124,1
-DA:126,1
-DA:128,1
-DA:130,1
-DA:132,1
-DA:134,2605
-DA:136,2605
-DA:138,1
-DA:140,1
-DA:142,1
-DA:144,1
-DA:146,1
-DA:148,1
-DA:150,2605
-DA:152,2605
-DA:154,1
-DA:156,1
-DA:158,1
-DA:160,1
-DA:162,1
-DA:164,1
-DA:166,2605
-DA:168,2605
-BA:41,2
-BA:41,1
-BA:41,2
-BA:41,1
-BA:41,2
-BA:41,1
-BA:41,2
-BA:41,1
-BA:41,1
-BA:41,2
-BA:41,1
-BA:41,2
-BA:45,1
-BA:45,2
-BA:45,0
-BA:45,0
-BA:45,0
-BA:45,0
-BA:45,0
-BA:45,0
-BA:45,0
-BA:45,0
-BA:45,2
-BA:45,1
-BA:53,1
-BA:53,2
-LF:64
-LH:61
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/apt/packagerecord.test.h
-FN:23,_ZStlsRSoRKSt3setISsSt4lessISsESaISsEE
-FN:42,_ZN20TestAptPackagerecord15supportedFieldsEv
-DA:23,0
-DA:25,0
-DA:27,0
-DA:28,0
-DA:30,0
-DA:31,0
-DA:42,1
-DA:74,1
-DA:76,1
-DA:78,1
-DA:80,2
-DA:81,1
-DA:82,1
-DA:83,1
-DA:84,2
-DA:85,1
-DA:86,1
-DA:87,1
-DA:88,1
-DA:89,1
-DA:90,1
-DA:91,1
-DA:92,1
-DA:93,1
-DA:94,1
-DA:95,1
-DA:96,1
-DA:97,1
-DA:98,2
-DA:99,1
-DA:100,1
-DA:107,1
-DA:108,1
-DA:115,1
-DA:116,1
-DA:118,1
-DA:119,1
-DA:120,2
-DA:121,2
-DA:122,2
-DA:123,2
-DA:124,2
-DA:125,2
-DA:126,2
-DA:127,2
-DA:128,2
-DA:129,2
-DA:130,2
-DA:131,2
-DA:132,2
-DA:133,2
-DA:134,1
-BA:25,0
-BA:25,0
-BA:27,0
-BA:27,0
-LF:52
-LH:46
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/apt/recordparser.h
-FN:88,_ZNK3ept3apt12RecordParser4sizeEv
-FN:51,_ZN3ept3apt12RecordParserC2ERKSs
-FN:39,_ZN3ept3apt12RecordParserD2Ev
-FN:73,_ZNK3ept3apt12RecordParser6lookupERKSs
-DA:39,7
-DA:51,1
-DA:73,0
-DA:88,0
-LF:4
-LH:2
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt/record.h
-DA:86,1
-BA:86,1
-BA:86,2
-LF:1
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/test.h
-FN:13,_ZN8LocationD1Ev
-FN:13,_ZN8LocationC1ERKS_
-FN:17,_ZN8LocationC1EPKciSs
-FN:52,_ZlsISsER12AssertFailedS1_T_
-FN:33,_ZN12AssertFailedC1E8LocationRSo
-FN:52,_ZlsIPKcER12AssertFailedS3_T_
-FN:52,_ZlsIjER12AssertFailedS1_T_
-FN:41,_ZN12AssertFailedD1Ev
-FN:67,_Z12assert_eq_fnIjjEv8LocationT_T0_
-FN:67,_Z12assert_eq_fnISsPKcEv8LocationT_T0_
-FN:52,_ZlsIbER12AssertFailedS1_T_
-FN:67,_Z12assert_eq_fnIbbEv8LocationT_T0_
-FN:52,_ZlsISt3setISsSt4lessISsESaISsEEER12AssertFailedS6_T_
-FN:67,_Z12assert_eq_fnISt3setISsSt4lessISsESaISsEES4_Ev8LocationT_T0_
-DA:13,0
-DA:17,0
-DA:18,0
-DA:33,0
-DA:34,0
-DA:36,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:43,0
-DA:45,0
-DA:46,0
-DA:48,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:67,1
-DA:69,1
-DA:70,0
-DA:71,0
-DA:75,1
-BA:42,0
-BA:42,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,0
-BA:69,1
-BA:69,2
-LF:22
-LH:3
-end_of_record
-SF:/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_apt_packagerecord.cpp
-FN:3,_Z41__static_initialization_and_destruction_0ii
-FN:3,_GLOBAL__I_ept_test_generated__home_mornfall_dev_pkg_ept_work_ept_apt_packagerecord.cpp
-FN:3,_Z36run_AptPackagerecord_supportedFieldsv
-DA:3,4
-BA:3,2
-BA:3,1
-BA:3,2
-BA:3,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaISsED1Ev
-FN:106,_ZNSaIjED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISsEED2Ev
-FN:98,_ZNSaIjEC2Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeISsEEC2Ev
-FN:100,_ZNSaISt13_Rb_tree_nodeISsEEC2ERKS1_
-FN:104,_ZNSaISsEC1ISt13_Rb_tree_nodeISsEEERKSaIT_E
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:104,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:7
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:392,_ZNSs10_S_compareEjj
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2162,_ZSteqIcEN9__gnu_cxx11__enable_ifIXsrSt9__is_charIT_E7__valueEbE6__typeERKSbIS3_St11char_traitsIS3_ESaIS3_EESC_
-FN:1941,_ZNKSs7compareERKSs
-FN:2238,_ZStltIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-FN:2188,_ZSteqIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_EPKS3_
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:392,0
-DA:394,0
-DA:401,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:1941,0
-DA:1943,0
-DA:1944,0
-DA:1945,0
-DA:1947,0
-DA:1948,0
-DA:1949,0
-DA:1950,0
-DA:2067,0
-DA:2069,0
-DA:2162,0
-DA:2165,0
-DA:2188,0
-DA:2189,0
-DA:2238,0
-DA:2239,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-BA:1948,0
-BA:1948,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-LF:68
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:257,0
-DA:258,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:188,_ZSt3minIjERKT_S2_S2_
-FN:268,_ZNSt12__niter_baseISt23_Rb_tree_const_iteratorISsELb0EE3__bES1_
-FN:792,_ZNSt7__equalILb0EE5equalISt23_Rb_tree_const_iteratorISsES3_EEbT_S4_T0_
-FN:815,_ZSt11__equal_auxISt23_Rb_tree_const_iteratorISsES1_EbT_S2_T0_
-FN:944,_ZSt5equalISt23_Rb_tree_const_iteratorISsES1_EbT_S2_T0_
-DA:188,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:268,0
-DA:269,0
-DA:792,1
-DA:794,15
-DA:795,14
-DA:796,0
-DA:797,1
-DA:815,1
-DA:822,1
-DA:824,1
-DA:944,1
-DA:956,1
-BA:193,0
-BA:193,0
-BA:794,2
-BA:794,2
-BA:795,1
-BA:795,2
-LF:16
-LH:9
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:97,_ZSt8_DestroyIPjEvT_S1_
-FN:126,_ZSt8_DestroyIPjjEvT_S1_RSaIT0_E
-DA:97,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-LF:5
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_function.h
-FN:469,_ZNKSt9_IdentityISsEclERKSs
-FN:229,_ZNKSt4lessISsEclERKSsS2_
-DA:229,0
-DA:230,0
-DA:469,0
-DA:470,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:166,0
-DA:167,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_pair.h
-FN:88,_ZNSt4pairISt23_Rb_tree_const_iteratorISsEbEC1ERKS1_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorISsEbEC1ERKS1_RKb
-DA:88,0
-DA:89,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_set.h
-FN:270,_ZNKSt3setISsSt4lessISsESaISsEE3endEv
-FN:261,_ZNKSt3setISsSt4lessISsESaISsEE5beginEv
-FN:141,_ZNSt3setISsSt4lessISsESaISsEEC1Ev
-FN:93,_ZNSt3setISsSt4lessISsESaISsEED1Ev
-FN:378,_ZNSt3setISsSt4lessISsESaISsEE6insertERKSs
-FN:193,_ZNSt3setISsSt4lessISsESaISsEEC1ERKS3_
-FN:596,_ZSteqISsSt4lessISsESaISsEEbRKSt3setIT_T0_T1_ES9_
-DA:93,0
-DA:141,0
-DA:142,0
-DA:193,0
-DA:194,0
-DA:261,0
-DA:262,0
-DA:270,0
-DA:271,0
-DA:378,0
-DA:381,0
-DA:382,0
-DA:596,1
-DA:597,1
-LF:14
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_tree.h
-FN:103,_ZNSt18_Rb_tree_node_base10_S_minimumEPS_
-FN:117,_ZNSt18_Rb_tree_node_base10_S_maximumEPS_
-FN:289,_ZNKSt23_Rb_tree_const_iteratorISsEneERKS0_
-FN:285,_ZNKSt23_Rb_tree_const_iteratorISsEeqERKS0_
-FN:247,_ZNKSt23_Rb_tree_const_iteratorISsEdeEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorISsEC1ERKSt17_Rb_tree_iteratorISsE
-FN:452,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_beginEv
-FN:347,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE21_M_get_Node_allocatorEv
-FN:432,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_M_rootEv
-FN:456,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_beginEv
-FN:463,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_M_endEv
-FN:428,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_M_rootEv
-FN:503,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE10_S_minimumEPSt18_Rb_tree_node_base
-FN:436,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11_M_leftmostEv
-FN:511,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE10_S_maximumEPSt18_Rb_tree_node_base
-FN:444,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE12_M_rightmostEv
-FN:240,_ZNSt23_Rb_tree_const_iteratorISsEC1EPKSt13_Rb_tree_nodeISsE
-FN:614,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE3endEv
-FN:603,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5beginEv
-FN:487,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_S_leftEPSt18_Rb_tree_node_base
-FN:168,_ZNSt17_Rb_tree_iteratorISsEC1EPSt13_Rb_tree_nodeISsE
-FN:596,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorISsEeqERKS0_
-FN:415,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EE13_M_initializeEv
-FN:398,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EED1Ev
-FN:491,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_rightEPKSt18_Rb_tree_node_base
-FN:483,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_S_leftEPKSt18_Rb_tree_node_base
-FN:471,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_valueEPKSt13_Rb_tree_nodeISsE
-FN:475,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_S_keyEPKSt13_Rb_tree_nodeISsE
-FN:495,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_S_keyEPKSt18_Rb_tree_node_base
-FN:641,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE4sizeEv
-FN:403,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEEC1Ev
-FN:408,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EEC1ERKS3_RKSaISt13_Rb_tree_nodeISsEE
-FN:351,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13get_allocatorEv
-FN:360,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11_M_put_nodeEPSt13_Rb_tree_nodeISsE
-FN:388,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE15_M_destroy_nodeEPSt13_Rb_tree_nodeISsE
-FN:936,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_eraseEPSt13_Rb_tree_nodeISsE
-FN:584,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEED1Ev
-FN:195,_ZNSt17_Rb_tree_iteratorISsEmmEv
-FN:356,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE14_M_create_nodeERKSs
-FN:846,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE10_M_insert_EPKSt18_Rb_tree_node_baseS8_RKSs
-FN:1133,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE16_M_insert_uniqueERKSs
-FN:378,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_M_clone_nodeEPKSt13_Rb_tree_nodeISsE
-FN:900,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_M_copyEPKSt13_Rb_tree_nodeISsEPS7_
-FN:568,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEEC1ERKS5_
-FN:255,_ZNSt23_Rb_tree_const_iteratorISsEppEv
-FN:745,_ZSteqISsSsSt9_IdentityISsESt4lessISsESaISsEEbRKSt8_Rb_treeIT_T0_T1_T2_T3_ESD_
-DA:103,0
-DA:105,0
-DA:106,0
-DA:117,0
-DA:119,0
-DA:120,0
-DA:168,0
-DA:169,0
-DA:195,0
-DA:197,0
-DA:198,0
-DA:210,0
-DA:211,0
-DA:240,0
-DA:241,0
-DA:243,0
-DA:244,0
-DA:247,0
-DA:248,0
-DA:255,0
-DA:257,0
-DA:258,0
-DA:285,0
-DA:286,0
-DA:289,0
-DA:290,0
-DA:347,0
-DA:348,0
-DA:351,0
-DA:352,0
-DA:356,0
-DA:357,0
-DA:360,0
-DA:361,0
-DA:364,0
-DA:366,0
-DA:368,0
-DA:369,0
-DA:371,0
-DA:372,0
-DA:374,0
-DA:378,0
-DA:380,0
-DA:381,0
-DA:382,0
-DA:383,0
-DA:384,0
-DA:388,0
-DA:390,0
-DA:391,0
-DA:392,0
-DA:398,0
-DA:403,0
-DA:405,0
-DA:406,0
-DA:408,0
-DA:410,0
-DA:411,0
-DA:415,0
-DA:417,0
-DA:418,0
-DA:419,0
-DA:420,0
-DA:421,0
-DA:428,0
-DA:429,0
-DA:432,0
-DA:433,0
-DA:436,0
-DA:437,0
-DA:444,0
-DA:445,0
-DA:452,0
-DA:453,0
-DA:456,0
-DA:459,0
-DA:463,0
-DA:464,0
-DA:471,0
-DA:472,0
-DA:475,0
-DA:476,0
-DA:479,0
-DA:480,0
-DA:483,0
-DA:484,0
-DA:487,0
-DA:488,0
-DA:491,0
-DA:492,0
-DA:495,0
-DA:496,0
-DA:499,0
-DA:500,0
-DA:503,0
-DA:504,0
-DA:511,0
-DA:512,0
-DA:562,0
-DA:568,0
-DA:569,0
-DA:571,0
-DA:573,0
-DA:574,0
-DA:575,0
-DA:576,0
-DA:578,0
-DA:584,0
-DA:585,0
-DA:596,0
-DA:599,0
-DA:603,0
-DA:606,0
-DA:614,0
-DA:617,0
-DA:641,0
-DA:642,0
-DA:745,1
-DA:748,1
-DA:846,0
-DA:850,0
-DA:852,0
-DA:854,0
-DA:857,0
-DA:858,0
-DA:900,0
-DA:903,0
-DA:904,0
-DA:908,0
-DA:909,0
-DA:910,0
-DA:911,0
-DA:913,0
-DA:915,0
-DA:916,0
-DA:917,0
-DA:918,0
-DA:919,0
-DA:920,0
-DA:921,0
-DA:924,0
-DA:926,0
-DA:927,0
-DA:929,0
-DA:936,0
-DA:939,0
-DA:941,0
-DA:942,0
-DA:943,0
-DA:944,0
-DA:946,0
-DA:1133,0
-DA:1135,0
-DA:1136,0
-DA:1137,0
-DA:1138,0
-DA:1140,0
-DA:1141,0
-DA:1142,0
-DA:1144,0
-DA:1145,0
-DA:1147,0
-DA:1148,0
-DA:1150,0
-DA:1152,0
-DA:1153,0
-DA:1154,0
-BA:105,0
-BA:105,0
-BA:119,0
-BA:119,0
-BA:571,0
-BA:571,0
-BA:748,2
-BA:748,1
-BA:748,2
-BA:748,1
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:908,0
-BA:908,0
-BA:913,0
-BA:913,0
-BA:918,0
-BA:918,0
-BA:939,0
-BA:939,0
-BA:1138,0
-BA:1138,0
-BA:1142,0
-BA:1142,0
-BA:1145,0
-BA:1145,0
-BA:1147,0
-BA:1147,0
-BA:1152,0
-BA:1152,0
-LF:167
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:484,_ZNKSt6vectorIjSaIjEE4sizeEv
-FN:97,_ZNSt12_Vector_baseIjSaIjEE19_M_get_Tp_allocatorEv
-FN:79,_ZNSt12_Vector_baseIjSaIjEE12_Vector_implD1Ev
-FN:84,_ZNSt12_Vector_baseIjSaIjEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseIjSaIjEEC2Ev
-FN:213,_ZNSt6vectorIjSaIjEEC1Ev
-FN:147,_ZNSt12_Vector_baseIjSaIjEE13_M_deallocateEPjj
-FN:135,_ZNSt12_Vector_baseIjSaIjEED2Ev
-FN:299,_ZNSt6vectorIjSaIjEED1Ev
-DA:79,0
-DA:84,0
-DA:85,0
-DA:86,0
-DA:97,0
-DA:98,0
-DA:108,0
-DA:109,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:213,0
-DA:214,0
-DA:299,0
-DA:300,0
-DA:301,0
-DA:484,0
-DA:485,0
-BA:149,0
-BA:149,0
-LF:22
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIjED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorIjEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEEC2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEEC2ERKS3_
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE8max_sizeEv
-FN:118,_ZN9__gnu_cxx13new_allocatorISsE7destroyEPSs
-FN:97,_ZN9__gnu_cxx13new_allocatorIjE10deallocateEPjj
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE10deallocateEPS2_j
-FN:107,_ZN9__gnu_cxx13new_allocatorISsE9constructEPSsRKSs
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE8allocateEjPKv
-DA:69,0
-DA:71,0
-DA:76,0
-DA:87,0
-DA:89,0
-DA:90,0
-DA:92,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:107,0
-DA:108,0
-DA:118,0
-BA:89,0
-BA:89,0
-BA:108,0
-BA:108,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:195,_ZNSolsEj
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:177,_ZNSolsEb
-DA:95,0
-DA:112,0
-DA:117,0
-DA:177,0
-DA:178,0
-DA:195,0
-DA:199,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:402,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:431,_ZNSt19basic_ostringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:450,_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:402,0
-DA:403,0
-DA:404,0
-DA:431,0
-DA:432,0
-DA:450,0
-DA:451,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-BA:432,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/expression.cc
-FN:30,_ZNK7tagcoll10ExpressionclISt3setIN3ept7debtags3TagESt4lessIS5_ESaIS5_EEEEbRKT_
-DA:30,12
-DA:32,12
-DA:33,48
-DA:35,36
-DA:36,12
-BA:33,2
-BA:33,2
-LF:5
-LH:5
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISsEED2Ev
-FN:100,_ZNSaIcEC1ERKS_
-FN:98,_ZNSaISt13_Rb_tree_nodeISsEEC2Ev
-FN:106,_ZNSaISsED1Ev
-FN:104,_ZNSaISsEC1ISt13_Rb_tree_nodeISsEEERKSaIT_E
-DA:98,0
-DA:100,0
-DA:101,0
-DA:104,0
-DA:106,0
-LF:5
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:277,_ZNKSs7_M_dataEv
-FN:285,_ZNKSs6_M_repEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:1551,_ZNKSs13get_allocatorEv
-FN:606,_ZNKSs4sizeEv
-FN:1544,_ZNKSs4dataEv
-FN:392,_ZNSs10_S_compareEjj
-FN:1941,_ZNKSs7compareERKSs
-FN:2238,_ZStltIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-DA:178,0
-DA:183,0
-DA:184,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:392,0
-DA:394,0
-DA:401,0
-DA:493,0
-DA:494,0
-DA:606,0
-DA:607,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:1941,0
-DA:1943,0
-DA:1944,0
-DA:1945,0
-DA:1947,0
-DA:1948,0
-DA:1949,0
-DA:1950,0
-DA:2238,0
-DA:2239,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:1948,0
-BA:1948,0
-LF:34
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-DA:257,0
-DA:258,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:188,_ZSt3minIjERKT_S2_S2_
-DA:188,0
-DA:193,0
-DA:194,0
-DA:195,0
-BA:193,0
-BA:193,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_function.h
-FN:469,_ZNKSt9_IdentityISsEclERKSs
-FN:229,_ZNKSt4lessISsEclERKSsS2_
-DA:229,0
-DA:230,0
-DA:469,0
-DA:470,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_pair.h
-FN:88,_ZNSt4pairISt23_Rb_tree_const_iteratorISsEbEC1ERKS1_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorISsEbEC1ERKS1_RKb
-DA:88,0
-DA:89,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_set.h
-FN:261,_ZNKSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EE5beginEv
-FN:270,_ZNKSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EE3endEv
-FN:141,_ZNSt3setISsSt4lessISsESaISsEEC1Ev
-FN:378,_ZNSt3setISsSt4lessISsESaISsEE6insertERKSs
-FN:93,_ZNSt3setISsSt4lessISsESaISsEED1Ev
-DA:93,0
-DA:141,0
-DA:142,0
-DA:261,0
-DA:262,0
-DA:270,0
-DA:271,0
-DA:378,0
-DA:381,0
-DA:382,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_tree.h
-FN:289,_ZNKSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEneERKS3_
-FN:251,_ZNKSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEptEv
-FN:452,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_beginEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorISsEC1ERKSt17_Rb_tree_iteratorISsE
-FN:398,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_S_leftEPSt18_Rb_tree_node_base
-FN:240,_ZNSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEC1EPKSt13_Rb_tree_nodeIS2_E
-FN:603,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE5beginEv
-FN:614,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE3endEv
-FN:463,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_M_endEv
-FN:168,_ZNSt17_Rb_tree_iteratorISsEC1EPSt13_Rb_tree_nodeISsE
-FN:596,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorISsEeqERKS0_
-FN:415,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EE13_M_initializeEv
-FN:471,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_valueEPKSt13_Rb_tree_nodeISsE
-FN:475,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_S_keyEPKSt13_Rb_tree_nodeISsE
-FN:495,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_S_keyEPKSt18_Rb_tree_node_base
-FN:403,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEEC1Ev
-FN:347,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE21_M_get_Node_allocatorEv
-FN:351,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13get_allocatorEv
-FN:195,_ZNSt17_Rb_tree_iteratorISsEmmEv
-FN:356,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11_M_get_nodeEv
-FN:360,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11_M_put_nodeEPSt13_Rb_tree_nodeISsE
-FN:364,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE14_M_create_nodeERKSs
-FN:846,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE10_M_insert_EPKSt18_Rb_tree_node_baseS8_RKSs
-FN:1133,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE16_M_insert_uniqueERKSs
-FN:388,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE15_M_destroy_nodeEPSt13_Rb_tree_nodeISsE
-FN:936,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_eraseEPSt13_Rb_tree_nodeISsE
-FN:584,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEED1Ev
-FN:255,_ZNSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEppEv
-DA:168,0
-DA:169,0
-DA:195,0
-DA:197,0
-DA:198,0
-DA:210,0
-DA:211,0
-DA:240,0
-DA:241,0
-DA:243,0
-DA:244,0
-DA:251,0
-DA:252,0
-DA:255,0
-DA:257,0
-DA:258,0
-DA:289,0
-DA:290,0
-DA:347,0
-DA:348,0
-DA:351,0
-DA:352,0
-DA:356,0
-DA:357,0
-DA:360,0
-DA:361,0
-DA:364,0
-DA:366,0
-DA:368,0
-DA:369,0
-DA:371,0
-DA:372,0
-DA:374,0
-DA:388,0
-DA:390,0
-DA:391,0
-DA:392,0
-DA:398,0
-DA:403,0
-DA:405,0
-DA:406,0
-DA:415,0
-DA:417,0
-DA:418,0
-DA:419,0
-DA:420,0
-DA:421,0
-DA:452,0
-DA:453,0
-DA:463,0
-DA:464,0
-DA:471,0
-DA:472,0
-DA:475,0
-DA:476,0
-DA:479,0
-DA:480,0
-DA:487,0
-DA:488,0
-DA:495,0
-DA:496,0
-DA:499,0
-DA:500,0
-DA:562,0
-DA:584,0
-DA:585,0
-DA:596,0
-DA:599,0
-DA:603,0
-DA:606,0
-DA:614,0
-DA:617,0
-DA:846,0
-DA:850,0
-DA:852,0
-DA:854,0
-DA:857,0
-DA:858,0
-DA:936,0
-DA:939,0
-DA:941,0
-DA:942,0
-DA:943,0
-DA:944,0
-DA:946,0
-DA:1133,0
-DA:1135,0
-DA:1136,0
-DA:1137,0
-DA:1138,0
-DA:1140,0
-DA:1141,0
-DA:1142,0
-DA:1144,0
-DA:1145,0
-DA:1147,0
-DA:1148,0
-DA:1150,0
-DA:1152,0
-DA:1153,0
-DA:1154,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:939,0
-BA:939,0
-BA:1138,0
-BA:1138,0
-BA:1142,0
-BA:1142,0
-BA:1145,0
-BA:1145,0
-BA:1147,0
-BA:1147,0
-BA:1152,0
-BA:1152,0
-LF:101
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE8max_sizeEv
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE8allocateEjPKv
-FN:107,_ZN9__gnu_cxx13new_allocatorISsE9constructEPSsRKSs
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE10deallocateEPS2_j
-FN:118,_ZN9__gnu_cxx13new_allocatorISsE7destroyEPSs
-DA:69,0
-DA:71,0
-DA:76,0
-DA:87,0
-DA:89,0
-DA:90,0
-DA:92,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:107,0
-DA:108,0
-DA:118,0
-BA:89,0
-BA:89,0
-BA:108,0
-BA:108,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/debtags.cc
-FN:193,_ZN3ept7debtags7Debtags9sendPatchERKN7tagcoll9PatchListISsSsEE
-FN:186,_ZN3ept7debtags7Debtags9sendPatchERKN7tagcoll9PatchListISsNS0_3TagEEE
-FN:176,_ZN3ept7debtags7Debtags9sendPatchEv
-FN:143,_ZN3ept7debtags7Debtags9savePatchERKN7tagcoll9PatchListISsSsEE
-FN:169,_ZN3ept7debtags7Debtags9savePatchERKN7tagcoll9PatchListISsNS0_3TagEEE
-FN:136,_ZN3ept7debtags7Debtags9savePatchEv
-FN:87,_ZNK3ept7debtags7Debtags7changesEv
-FN:54,_ZN3ept7debtags7DebtagsC1Eb
-FN:54,_ZN3ept7debtags7DebtagsC2Eb
-DA:54,10
-DA:55,10
-DA:57,10
-DA:58,10
-DA:60,10
-DA:62,1
-DA:63,1
-DA:65,9
-DA:67,9
-DA:70,9
-DA:71,9
-DA:75,9
-DA:77,9
-DA:78,18
-DA:80,0
-DA:81,0
-DA:82,0
-DA:83,0
-DA:84,9
-DA:85,0
-DA:87,3
-DA:89,3
-DA:90,3
-DA:92,5
-DA:95,2
-DA:96,2
-DA:97,0
-DA:101,2
-DA:104,3
-DA:136,1
-DA:138,1
-DA:139,1
-DA:140,1
-DA:141,1
-DA:143,1
-DA:145,1
-DA:146,1
-DA:148,1
-DA:150,1
-DA:151,0
-DA:152,0
-DA:155,1
-DA:156,1
-DA:157,0
-DA:159,1
-DA:161,1
-DA:162,0
-DA:163,0
-DA:164,0
-DA:165,0
-DA:166,1
-DA:167,1
-DA:169,0
-DA:171,0
-DA:173,0
-DA:174,0
-DA:176,0
-DA:178,0
-DA:179,0
-DA:180,0
-DA:182,0
-DA:183,0
-DA:184,0
-DA:186,0
-DA:188,0
-DA:190,0
-DA:191,0
-DA:193,0
-DA:196,0
-DA:197,0
-DA:198,0
-DA:200,0
-DA:214,0
-DA:216,0
-DA:218,0
-DA:220,0
-DA:221,0
-DA:223,0
-DA:224,0
-DA:225,0
-DA:227,0
-BA:60,2
-BA:60,2
-BA:60,0
-BA:60,0
-BA:78,1
-BA:78,2
-BA:78,0
-BA:78,0
-BA:84,2
-BA:84,2
-BA:84,2
-BA:84,2
-BA:84,0
-BA:84,0
-BA:84,0
-BA:84,0
-BA:92,1
-BA:92,2
-BA:92,2
-BA:92,2
-BA:96,1
-BA:96,2
-BA:150,1
-BA:150,2
-BA:151,0
-BA:151,0
-BA:156,1
-BA:156,2
-BA:163,0
-BA:163,0
-BA:180,0
-BA:180,0
-BA:197,0
-BA:197,0
-BA:221,0
-BA:221,0
-BA:221,0
-BA:221,0
-LF:81
-LH:39
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/debtags.h
-FN:280,_ZN3ept7debtags7Debtags10vocabularyEv
-FN:282,_ZNK3ept7debtags7Debtags10vocabularyEv
-FN:97,_ZNK3ept7debtags7Debtags11packageByIDEi
-DA:97,0
-DA:99,0
-DA:280,0
-DA:282,0
-LF:4
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/maint/pkgid.h
-FN:54,_ZNK3ept7debtags5PkgId4sizeEv
-FN:68,_ZNK3ept7debtags5PkgId4byIDEi
-FN:41,_ZN3ept7debtags5PkgIdD1Ev
-DA:41,0
-DA:54,0
-DA:68,0
-DA:70,0
-DA:71,0
-DA:72,0
-BA:54,0
-BA:54,0
-BA:70,0
-BA:70,0
-BA:70,0
-BA:70,0
-BA:70,0
-BA:70,0
-LF:6
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/maint/serializer.h
-FN:201,_ZN3ept7debtags16PatchStringToIntIN7tagcoll8InserterIiiEEEC1ERNS0_5PkgIdERNS0_10VocabularyERKS4_
-FN:232,_ZN3ept7debtags16patchStringToIntIN7tagcoll8InserterIiiEEEENS0_16PatchStringToIntIT_EERNS0_5PkgIdERNS0_10VocabularyERKS6_
-FN:245,_ZN3ept7debtags16PatchIntToStringIN7tagcoll8InserterISsSsEEEC1ERNS0_5PkgIdERNS0_10VocabularyERKS4_
-FN:276,_ZN3ept7debtags16patchIntToStringIN7tagcoll8InserterISsSsEEEENS0_16PatchIntToStringIT_EERNS0_5PkgIdERNS0_10VocabularyERKS6_
-FN:248,_ZN3ept7debtags16PatchIntToStringIN7tagcoll8InserterISsSsEEEaSERKNS2_5PatchIiiEE
-FN:204,_ZN3ept7debtags16PatchStringToIntIN7tagcoll8InserterIiiEEEaSERKNS2_5PatchISsSsEE
-DA:201,0
-DA:202,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:210,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:216,0
-DA:218,0
-DA:221,0
-DA:222,0
-DA:223,0
-DA:225,0
-DA:226,0
-DA:227,0
-DA:232,0
-DA:234,0
-DA:245,0
-DA:246,0
-DA:248,0
-DA:250,0
-DA:251,0
-DA:252,0
-DA:254,0
-DA:255,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:262,0
-DA:265,0
-DA:266,0
-DA:267,0
-DA:269,0
-DA:270,0
-DA:271,0
-DA:276,0
-DA:278,0
-BA:207,0
-BA:207,0
-BA:211,0
-BA:211,0
-BA:215,0
-BA:215,0
-BA:218,0
-BA:218,0
-BA:222,0
-BA:222,0
-BA:251,0
-BA:251,0
-BA:255,0
-BA:255,0
-BA:259,0
-BA:259,0
-BA:262,0
-BA:262,0
-BA:266,0
-BA:266,0
-LF:40
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/tag.h
-FN:175,_ZN3ept7debtags3TagD1Ev
-FN:177,_ZNK3ept7debtags3TageqERKS1_
-FN:179,_ZNK3ept7debtags3TagltERKS1_
-FN:182,_ZNK3ept7debtags3Tag5validEv
-FN:242,_ZNK3ept7debtags3Tag2idEv
-DA:175,0
-DA:177,0
-DA:179,0
-DA:182,0
-DA:242,0
-LF:5
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/vocabulary.h
-FN:181,_ZNK3ept7debtags10Vocabulary8tagsByIDISt3setIiSt4lessIiESaIiEEEES3_INS0_3TagES4_IS8_ESaIS8_EERKT_
-FN:114,_ZNK3ept7debtags10Vocabulary8TagIndex2idERKSs
-FN:203,_ZNK3ept7debtags10Vocabulary9tagByNameERKSs
-DA:114,0
-DA:181,0
-DA:183,0
-DA:184,0
-DA:186,0
-DA:187,0
-DA:203,0
-BA:184,0
-BA:184,0
-LF:7
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/empty.h
-FN:64,_ZNK6wibble5EmptyISsE5beginEv
-FN:65,_ZNK6wibble5EmptyISsE3endEv
-FN:46,_ZNK6wibble5EmptyISsE14const_iteratorneERKS2_
-FN:44,_ZN6wibble5EmptyISsE14const_iteratorppEv
-FN:43,_ZNK6wibble5EmptyISsE14const_iteratorptEv
-FN:42,_ZNK6wibble5EmptyISsE14const_iteratordeEv
-FN:64,_ZNK6wibble5EmptyIiE5beginEv
-FN:65,_ZNK6wibble5EmptyIiE3endEv
-FN:46,_ZNK6wibble5EmptyIiE14const_iteratorneERKS2_
-FN:44,_ZN6wibble5EmptyIiE14const_iteratorppEv
-FN:42,_ZNK6wibble5EmptyIiE14const_iteratordeEv
-DA:42,0
-DA:43,0
-DA:44,0
-DA:46,0
-DA:64,0
-DA:65,0
-LF:6
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/exception.h
-FN:190,_ZNK6wibble9exception7Generic4typeEv
-FN:263,_ZNK6wibble9exception11Consistency4typeEv
-FN:137,_ZN6wibble9exception7ContextD2Ev
-FN:187,_ZN6wibble9exception7GenericD2Ev
-FN:395,_ZN6wibble9exception6SystemD1Ev
-FN:193,_ZNK6wibble9exception7Generic4descEv
-FN:213,_ZNK6wibble9exception7Generic4whatEv
-FN:187,_ZN6wibble9exception7GenericD0Ev
-FN:187,_ZN6wibble9exception7GenericD1Ev
-FN:261,_ZN6wibble9exception11ConsistencyD0Ev
-FN:261,_ZN6wibble9exception11ConsistencyD1Ev
-FN:261,_ZN6wibble9exception11ConsistencyD2Ev
-FN:265,_ZNK6wibble9exception11Consistency4descEv
-FN:154,_ZNK6wibble9exception7Context13formatContextEv
-FN:205,_ZNK6wibble9exception7Generic8fullInfoEv
-FN:109,_ZN6wibble9exception10AddContext7contextEv
-FN:117,_ZN6wibble9exception10AddContext11copyContextISt20back_insert_iteratorISt6vectorISsSaISsEEEEEvT_
-FN:153,_ZN6wibble9exception7Context10addContextERKSs
-FN:147,_ZN6wibble9exception7ContextC2ERKSs
-FN:186,_ZN6wibble9exception7GenericC2ERKSs
-FN:259,_ZN6wibble9exception11ConsistencyC1ERKSsS3_
-FN:259,_ZN6wibble9exception11ConsistencyC2ERKSsS3_
-FN:137,_ZN6wibble9exception7ContextC2ERKS1_
-FN:180,_ZN6wibble9exception7GenericC2ERKS1_
-FN:255,_ZN6wibble9exception11ConsistencyC2ERKS1_
-DA:109,0
-DA:110,0
-DA:111,0
-DA:112,0
-DA:113,0
-DA:117,0
-DA:118,0
-DA:119,0
-DA:137,0
-DA:147,0
-DA:148,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:153,0
-DA:154,0
-DA:155,0
-DA:156,0
-DA:157,0
-DA:159,0
-DA:161,0
-DA:162,0
-DA:163,0
-DA:180,0
-DA:186,0
-DA:187,0
-DA:190,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:205,0
-DA:206,0
-DA:207,0
-DA:209,0
-DA:210,0
-DA:213,0
-DA:255,0
-DA:259,0
-DA:260,0
-DA:261,0
-DA:263,0
-DA:265,0
-DA:266,0
-DA:267,0
-DA:268,0
-DA:269,0
-DA:395,0
-BA:110,0
-BA:110,0
-BA:156,0
-BA:156,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:207,0
-BA:207,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:267,0
-BA:267,0
-BA:395,0
-BA:395,0
-LF:47
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/mixin.h
-FN:52,_ZN6wibble5mixin14OutputIteratorIN7tagcoll8InserterIiiEEEC2Ev
-FN:52,_ZN6wibble5mixin14OutputIteratorIN3ept7debtags16PatchStringToIntIN7tagcoll8InserterIiiEEEEEC2Ev
-FN:52,_ZN6wibble5mixin14OutputIteratorIN7tagcoll8InserterISsSsEEEC2Ev
-FN:52,_ZN6wibble5mixin14OutputIteratorIN3ept7debtags16PatchIntToStringIN7tagcoll8InserterISsSsEEEEEC2Ev
-FN:64,_ZN6wibble5mixin14OutputIteratorIN3ept7debtags16PatchIntToStringIN7tagcoll8InserterISsSsEEEEEdeEv
-FN:53,_ZN6wibble5mixin14OutputIteratorIN3ept7debtags16PatchIntToStringIN7tagcoll8InserterISsSsEEEEEppEv
-FN:52,_ZN6wibble5mixin14OutputIteratorIN7tagcoll10textformat14PatchAssemblerIN3ept7debtags16PatchStringToIntINS2_8InserterIiiEEEEEEEC2Ev
-FN:64,_ZN6wibble5mixin14OutputIteratorIN7tagcoll10textformat14PatchAssemblerIN3ept7debtags16PatchStringToIntINS2_8InserterIiiEEEEEEEdeEv
-FN:53,_ZN6wibble5mixin14OutputIteratorIN7tagcoll10textformat14PatchAssemblerIN3ept7debtags16PatchStringToIntINS2_8InserterIiiEEEEEEEppEv
-FN:64,_ZN6wibble5mixin14OutputIteratorIN7tagcoll8InserterISsSsEEEdeEv
-FN:53,_ZN6wibble5mixin14OutputIteratorIN7tagcoll8InserterISsSsEEEppEv
-FN:64,_ZN6wibble5mixin14OutputIteratorIN3ept7debtags16PatchStringToIntIN7tagcoll8InserterIiiEEEEEdeEv
-FN:53,_ZN6wibble5mixin14OutputIteratorIN3ept7debtags16PatchStringToIntIN7tagcoll8InserterIiiEEEEEppEv
-FN:64,_ZN6wibble5mixin14OutputIteratorIN7tagcoll8InserterIiiEEEdeEv
-FN:53,_ZN6wibble5mixin14OutputIteratorIN7tagcoll8InserterIiiEEEppEv
-DA:52,0
-DA:53,0
-DA:54,0
-DA:64,0
-DA:65,0
-LF:5
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/operators.h
-FN:115,_ZN6wibble9operatorsoRISsEERSt3setIT_St4lessIS3_ESaIS3_EES8_RKS3_
-FN:133,_ZN6wibble9operatorsoRISsEERSt3setIT_St4lessIS3_ESaIS3_EES8_RKS7_
-FN:133,_ZN6wibble9operatorsoRIN3ept7debtags3TagEEERSt3setIT_St4lessIS6_ESaIS6_EESB_RKSA_
-FN:115,_ZN6wibble9operatorsoRIiEERSt3setIT_St4lessIS3_ESaIS3_EES8_RKS3_
-FN:133,_ZN6wibble9operatorsoRIiEERSt3setIT_St4lessIS3_ESaIS3_EES8_RKS7_
-FN:183,_ZN6wibble9operatorsmIISsEERSt3setIT_St4lessIS3_ESaIS3_EES8_RKS3_
-FN:198,_ZN6wibble9operatorsmIISsSt3setISsSt4lessISsESaISsEEEERS2_IT_S3_IS7_ESaIS7_EESB_RKT0_
-FN:198,_ZN6wibble9operatorsmIIN3ept7debtags3TagESt3setIS4_St4lessIS4_ESaIS4_EEEERS5_IT_S6_ISA_ESaISA_EESE_RKT0_
-FN:183,_ZN6wibble9operatorsmIIiEERSt3setIT_St4lessIS3_ESaIS3_EES8_RKS3_
-FN:198,_ZN6wibble9operatorsmIIiSt3setIiSt4lessIiESaIiEEEERS2_IT_S3_IS7_ESaIS7_EESB_RKT0_
-FN:82,_ZN6wibble9operatorsmiIN3ept7debtags3TagEEESt3setIT_St4lessIS6_ESaIS6_EERKSA_SC_
-FN:82,_ZN6wibble9operatorsmiISsEESt3setIT_St4lessIS3_ESaIS3_EERKS7_S9_
-FN:82,_ZN6wibble9operatorsmiIiEESt3setIT_St4lessIS3_ESaIS3_EERKS7_S9_
-DA:82,4
-DA:83,4
-DA:84,4
-DA:86,0
-DA:115,0
-DA:117,0
-DA:118,0
-DA:133,0
-DA:134,0
-DA:135,0
-DA:137,0
-DA:139,0
-DA:140,0
-DA:183,0
-DA:185,0
-DA:186,0
-DA:198,0
-DA:200,0
-DA:201,0
-DA:202,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:209,0
-DA:211,0
-DA:212,0
-DA:214,0
-DA:216,0
-BA:134,0
-BA:134,0
-BA:134,0
-BA:134,0
-BA:134,0
-BA:134,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:202,0
-BA:202,0
-BA:202,0
-BA:202,0
-BA:202,0
-BA:202,0
-BA:202,0
-BA:202,0
-BA:202,0
-BA:202,0
-BA:202,0
-BA:202,0
-BA:202,0
-BA:202,0
-BA:202,0
-BA:202,0
-BA:202,0
-BA:202,0
-BA:204,0
-BA:204,0
-BA:204,0
-BA:204,0
-BA:204,0
-BA:204,0
-BA:211,0
-BA:211,0
-BA:211,0
-BA:211,0
-BA:211,0
-BA:211,0
-LF:29
-LH:3
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/singleton.h
-FN:80,_ZN6wibble9SingletonIiEC1ERKi
-FN:92,_ZN6wibble9singletonIiEENS_9SingletonIT_EERKS2_
-FN:47,_ZN6wibble9SingletonIiE14const_iteratorC1EPKi
-FN:87,_ZNK6wibble9SingletonIiE5beginEv
-FN:50,_ZN6wibble9SingletonIiE14const_iteratorC1Ev
-FN:88,_ZNK6wibble9SingletonIiE3endEv
-FN:56,_ZNK6wibble9SingletonIiE14const_iteratorneERKS2_
-FN:54,_ZN6wibble9SingletonIiE14const_iteratorppEv
-FN:52,_ZNK6wibble9SingletonIiE14const_iteratordeEv
-DA:47,0
-DA:50,0
-DA:52,0
-DA:54,0
-DA:56,0
-DA:80,0
-DA:87,0
-DA:88,0
-DA:92,0
-DA:94,0
-LF:10
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/string.h
-FN:236,_ZN6wibble3str8joinpathERKSsS2_
-DA:236,509
-DA:238,509
-DA:239,0
-DA:240,509
-DA:241,0
-DA:243,509
-DA:244,347
-DA:245,0
-DA:247,347
-DA:249,162
-DA:250,31
-DA:252,131
-BA:238,1
-BA:238,2
-BA:240,1
-BA:240,2
-BA:243,2
-BA:243,2
-BA:244,1
-BA:244,2
-BA:249,2
-BA:249,2
-LF:12
-LH:9
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeIN3ept7debtags3TagEEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeIiEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISt4pairIKiN7tagcoll5PatchIiiEEEEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISsEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsN7tagcoll5PatchISsSsEEEEED2Ev
-FN:100,_ZNSaIcEC1ERKS_
-FN:100,_ZNSaIcEC2ERKS_
-FN:106,_ZNSaISsED2Ev
-FN:106,_ZNSaISsED1Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeIN3ept7debtags3TagEEEC2Ev
-FN:106,_ZNSaIN3ept7debtags3TagEED1Ev
-FN:100,_ZNSaISt13_Rb_tree_nodeIN3ept7debtags3TagEEEC2ERKS4_
-FN:98,_ZNSaISt13_Rb_tree_nodeIiEEC2Ev
-FN:106,_ZNSaIiED1Ev
-FN:100,_ZNSaISt13_Rb_tree_nodeIiEEC2ERKS1_
-FN:106,_ZNSaISt4pairIKiN7tagcoll5PatchIiiEEEED1Ev
-FN:100,_ZNSaISt13_Rb_tree_nodeISsEEC2ERKS1_
-FN:98,_ZNSaISsEC2Ev
-FN:104,_ZNSaISsEC1ISt13_Rb_tree_nodeISsEEERKSaIT_E
-FN:106,_ZNSaISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEED1Ev
-FN:106,_ZNSaISt4pairIKSsN7tagcoll5PatchISsSsEEEED1Ev
-FN:100,_ZNSaISsEC2ERKS_
-FN:104,_ZNSaIN3ept7debtags3TagEEC1ISt13_Rb_tree_nodeIS1_EEERKSaIT_E
-FN:104,_ZNSaIiEC1ISt13_Rb_tree_nodeIiEEERKSaIT_E
-FN:104,_ZNSaISt4pairIKiN7tagcoll5PatchIiiEEEEC1ISt13_Rb_tree_nodeIS4_EEERKSaIT_E
-FN:98,_ZNSaISt13_Rb_tree_nodeISsEEC2Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeISt4pairIKiN7tagcoll5PatchIiiEEEEEC2Ev
-FN:100,_ZNSaISt13_Rb_tree_nodeISt4pairIKiN7tagcoll5PatchIiiEEEEEC2ERKS7_
-FN:98,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEEEC2Ev
-FN:104,_ZNSaISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEEC1ISt13_Rb_tree_nodeIS7_EEERKSaIT_E
-FN:98,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsN7tagcoll5PatchISsSsEEEEEC2Ev
-FN:104,_ZNSaISt4pairIKSsN7tagcoll5PatchISsSsEEEEC1ISt13_Rb_tree_nodeIS4_EEERKSaIT_E
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,3
-DA:101,3
-DA:104,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:7
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:1534,_ZNKSs5c_strEv
-FN:1544,_ZNKSs4dataEv
-FN:701,_ZNKSsixEj
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:612,_ZNKSs6lengthEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:1551,_ZNKSs13get_allocatorEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:392,_ZNSs10_S_compareEjj
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:835,_ZNSs6appendEPKc
-FN:2121,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-FN:501,_ZNSsaSERKSs
-FN:1941,_ZNKSs7compareERKSs
-FN:2238,_ZStltIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:2162,_ZSteqIcEN9__gnu_cxx11__enable_ifIXsrSt9__is_charIT_E7__valueEbE6__typeERKSbIS3_St11char_traitsIS3_ESaIS3_EESC_
-FN:306,_ZNKSs8_M_checkEjPKc
-FN:1923,_ZNKSs6substrEjj
-FN:2136,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S3_
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:306,0
-DA:308,0
-DA:309,0
-DA:310,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:392,0
-DA:394,0
-DA:401,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:612,0
-DA:613,0
-DA:686,0
-DA:687,0
-DA:701,0
-DA:704,0
-DA:835,0
-DA:838,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:1923,0
-DA:1925,0
-DA:1941,0
-DA:1943,0
-DA:1944,0
-DA:1945,0
-DA:1947,0
-DA:1948,0
-DA:1949,0
-DA:1950,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2121,0
-DA:2123,0
-DA:2124,0
-DA:2125,0
-DA:2136,0
-DA:2140,0
-DA:2141,0
-DA:2142,0
-DA:2162,0
-DA:2165,0
-DA:2238,0
-DA:2239,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:308,0
-BA:308,0
-BA:341,0
-BA:341,0
-BA:1948,0
-BA:1948,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-LF:94
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-FN:668,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_EPKS3_RKS6_
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-DA:668,0
-DA:673,0
-DA:674,0
-DA:675,0
-DA:676,0
-DA:677,0
-DA:678,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:23
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-DA:245,0
-DA:246,0
-DA:257,0
-DA:258,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algo.h
-FN:5300,_ZSt14set_differenceISt23_Rb_tree_const_iteratorIN3ept7debtags3TagEES4_St15insert_iteratorISt3setIS3_St4lessIS3_ESaIS3_EEEET1_T_SD_T0_SE_SC_
-FN:5300,_ZSt14set_differenceISt23_Rb_tree_const_iteratorISsES1_St15insert_iteratorISt3setISsSt4lessISsESaISsEEEET1_T_SA_T0_SB_S9_
-FN:5300,_ZSt14set_differenceISt23_Rb_tree_const_iteratorIiES1_St15insert_iteratorISt3setIiSt4lessIiESaIiEEEET1_T_SA_T0_SB_S9_
-DA:5300,4
-DA:5317,8
-DA:5318,0
-DA:5320,0
-DA:5321,0
-DA:5322,0
-DA:5324,0
-DA:5325,0
-DA:5328,0
-DA:5329,0
-DA:5331,4
-BA:5317,2
-BA:5317,2
-BA:5317,1
-BA:5317,2
-BA:5317,1
-BA:5317,2
-BA:5317,0
-BA:5317,0
-BA:5317,0
-BA:5317,0
-BA:5317,0
-BA:5317,0
-BA:5317,0
-BA:5317,0
-BA:5317,0
-BA:5317,0
-BA:5317,0
-BA:5317,0
-BA:5318,0
-BA:5318,0
-BA:5318,0
-BA:5318,0
-BA:5318,0
-BA:5318,0
-BA:5324,0
-BA:5324,0
-BA:5324,0
-BA:5324,0
-BA:5324,0
-BA:5324,0
-LF:11
-LH:3
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb0EE3__bES7_
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb0EE3__bES6_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb1EE3__bES7_
-FN:268,_ZNSt12__niter_baseISt16ostream_iteratorISscSt11char_traitsIcEELb0EE3__bES3_
-FN:286,_ZNSt12__miter_baseIPSsLb0EE3__bES0_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb1EE3__bES6_
-FN:268,_ZNSt12__niter_baseISt20back_insert_iteratorISt6vectorISsSaISsEEELb0EE3__bES4_
-FN:268,_ZNSt12__niter_baseIPSsLb0EE3__bES0_
-FN:286,_ZNSt12__miter_baseISt23_Rb_tree_const_iteratorIN3ept7debtags3TagEELb0EE3__bES4_
-FN:268,_ZNSt12__niter_baseISt23_Rb_tree_const_iteratorIN3ept7debtags3TagEELb0EE3__bES4_
-FN:268,_ZNSt12__niter_baseISt15insert_iteratorISt3setIN3ept7debtags3TagESt4lessIS4_ESaIS4_EEELb0EE3__bES9_
-FN:286,_ZNSt12__miter_baseISt23_Rb_tree_const_iteratorIiELb0EE3__bES1_
-FN:188,_ZSt3minIjERKT_S2_S2_
-FN:286,_ZNSt12__miter_baseIN6wibble9SingletonIiE14const_iteratorELb0EE3__bES3_
-FN:286,_ZNSt12__miter_baseIN6wibble5EmptyIiE14const_iteratorELb0EE3__bES3_
-FN:268,_ZNSt12__niter_baseISt23_Rb_tree_const_iteratorIiELb0EE3__bES1_
-FN:268,_ZNSt12__niter_baseISt15insert_iteratorISt3setIiSt4lessIiESaIiEEELb0EE3__bES6_
-FN:268,_ZNSt12__niter_baseIN6wibble9SingletonIiE14const_iteratorELb0EE3__bES3_
-FN:268,_ZNSt12__niter_baseIN6wibble5EmptyIiE14const_iteratorELb0EE3__bES3_
-FN:286,_ZNSt12__miter_baseISt23_Rb_tree_const_iteratorISsELb0EE3__bES1_
-FN:268,_ZNSt12__niter_baseISt23_Rb_tree_const_iteratorISsELb0EE3__bES1_
-FN:268,_ZNSt12__niter_baseISt15insert_iteratorISt3setISsSt4lessISsESaISsEEELb0EE3__bES6_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPKSsSt16ostream_iteratorISscSt11char_traitsIcEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPKSsSt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_SD_SC_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET0_T_SD_SC_
-FN:539,_ZNSt20__copy_move_backwardILb0ELb0ESt26random_access_iterator_tagE13__copy_move_bIPSsS3_EET0_T_S5_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0EPSsS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPSsS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardIPSsS0_ET0_T_S2_S1_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET1_T0_SA_S9_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET0_T_SA_S9_
-FN:309,_ZNSt11__copy_moveILb0ELb0ESt26bidirectional_iterator_tagE8__copy_mISt23_Rb_tree_const_iteratorIN3ept7debtags3TagEESt15insert_iteratorISt3setIS6_St4lessIS6_ESaIS6_EEEEET0_T_SG_SF_
-FN:385,_ZSt13__copy_move_aILb0ESt23_Rb_tree_const_iteratorIN3ept7debtags3TagEESt15insert_iteratorISt3setIS3_St4lessIS3_ESaIS3_EEEET1_T0_SD_SC_
-FN:430,_ZSt14__copy_move_a2ILb0ESt23_Rb_tree_const_iteratorIN3ept7debtags3TagEESt15insert_iteratorISt3setIS3_St4lessIS3_ESaIS3_EEEET1_T0_SD_SC_
-FN:456,_ZSt4copyISt23_Rb_tree_const_iteratorIN3ept7debtags3TagEESt15insert_iteratorISt3setIS3_St4lessIS3_ESaIS3_EEEET0_T_SD_SC_
-FN:309,_ZNSt11__copy_moveILb0ELb0ESt26bidirectional_iterator_tagE8__copy_mISt23_Rb_tree_const_iteratorISsESt15insert_iteratorISt3setISsSt4lessISsESaISsEEEEET0_T_SD_SC_
-FN:385,_ZSt13__copy_move_aILb0ESt23_Rb_tree_const_iteratorISsESt15insert_iteratorISt3setISsSt4lessISsESaISsEEEET1_T0_SA_S9_
-FN:430,_ZSt14__copy_move_a2ILb0ESt23_Rb_tree_const_iteratorISsESt15insert_iteratorISt3setISsSt4lessISsESaISsEEEET1_T0_SA_S9_
-FN:456,_ZSt4copyISt23_Rb_tree_const_iteratorISsESt15insert_iteratorISt3setISsSt4lessISsESaISsEEEET0_T_SA_S9_
-FN:309,_ZNSt11__copy_moveILb0ELb0ESt20forward_iterator_tagE8__copy_mIN6wibble9SingletonIiE14const_iteratorESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEET0_T_SF_SE_
-FN:385,_ZSt13__copy_move_aILb0EN6wibble9SingletonIiE14const_iteratorESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEET1_T0_SC_SB_
-FN:430,_ZSt14__copy_move_a2ILb0EN6wibble9SingletonIiE14const_iteratorESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEET1_T0_SC_SB_
-FN:456,_ZSt4copyIN6wibble9SingletonIiE14const_iteratorESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEET0_T_SC_SB_
-FN:309,_ZNSt11__copy_moveILb0ELb0ESt20forward_iterator_tagE8__copy_mIN6wibble5EmptyIiE14const_iteratorESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEET0_T_SF_SE_
-FN:385,_ZSt13__copy_move_aILb0EN6wibble5EmptyIiE14const_iteratorESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEET1_T0_SC_SB_
-FN:430,_ZSt14__copy_move_a2ILb0EN6wibble5EmptyIiE14const_iteratorESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEET1_T0_SC_SB_
-FN:456,_ZSt4copyIN6wibble5EmptyIiE14const_iteratorESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEET0_T_SC_SB_
-FN:309,_ZNSt11__copy_moveILb0ELb0ESt26bidirectional_iterator_tagE8__copy_mISt23_Rb_tree_const_iteratorIiESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEET0_T_SD_SC_
-FN:385,_ZSt13__copy_move_aILb0ESt23_Rb_tree_const_iteratorIiESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEET1_T0_SA_S9_
-FN:430,_ZSt14__copy_move_a2ILb0ESt23_Rb_tree_const_iteratorIiESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEET1_T0_SA_S9_
-FN:456,_ZSt4copyISt23_Rb_tree_const_iteratorIiESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEET0_T_SA_S9_
-DA:188,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:210,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:268,0
-DA:269,0
-DA:276,0
-DA:277,0
-DA:286,0
-DA:287,0
-DA:309,0
-DA:311,0
-DA:312,0
-DA:313,0
-DA:337,0
-DA:340,0
-DA:342,0
-DA:343,0
-DA:344,0
-DA:346,0
-DA:385,0
-DA:393,0
-DA:396,0
-DA:430,0
-DA:435,0
-DA:456,0
-DA:466,0
-DA:539,0
-DA:542,0
-DA:543,0
-DA:544,0
-DA:579,0
-DA:587,0
-DA:592,0
-DA:597,0
-DA:602,0
-DA:624,0
-DA:636,0
-BA:193,0
-BA:193,0
-BA:215,0
-BA:215,0
-BA:311,0
-BA:311,0
-BA:311,0
-BA:311,0
-BA:311,0
-BA:311,0
-BA:311,0
-BA:311,0
-BA:311,0
-BA:311,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:542,0
-BA:542,0
-LF:42
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-DA:87,0
-DA:88,0
-DA:97,0
-DA:101,0
-DA:103,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-BA:101,0
-BA:101,0
-LF:9
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_function.h
-FN:469,_ZNKSt9_IdentityIN3ept7debtags3TagEEclERKS2_
-FN:229,_ZNKSt4lessIN3ept7debtags3TagEEclERKS2_S5_
-FN:469,_ZNKSt9_IdentityIiEclERKi
-FN:229,_ZNKSt4lessIiEclERKiS2_
-FN:469,_ZNKSt9_IdentityISsEclERKSs
-FN:482,_ZNKSt10_Select1stISt4pairIKiN7tagcoll5PatchIiiEEEEclERKS5_
-FN:482,_ZNKSt10_Select1stISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEEclERKS8_
-FN:482,_ZNKSt10_Select1stISt4pairIKSsN7tagcoll5PatchISsSsEEEEclERKS5_
-FN:229,_ZNKSt4lessISsEclERKSsS2_
-DA:229,0
-DA:230,0
-DA:469,0
-DA:470,0
-DA:482,0
-DA:483,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEdeEv
-FN:398,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEC1ERS2_
-FN:456,_ZSt13back_inserterISt6vectorISsSaISsEEESt20back_insert_iteratorIT_ERS4_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEC1ERKS2_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEE4baseEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEC1ERKS1_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-FN:572,_ZNSt15insert_iteratorISt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EEEC1ERS7_St23_Rb_tree_const_iteratorIS3_E
-FN:645,_ZSt8inserterISt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EESt23_Rb_tree_const_iteratorIS3_EESt15insert_iteratorIT_ERSB_T0_
-FN:618,_ZNSt15insert_iteratorISt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EEEdeEv
-FN:623,_ZNSt15insert_iteratorISt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EEEppEv
-FN:781,_ZN9__gnu_cxxneIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-FN:703,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEppEv
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEdeEv
-FN:572,_ZNSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEC1ERS4_St23_Rb_tree_const_iteratorIiE
-FN:645,_ZSt8inserterISt3setIiSt4lessIiESaIiEESt23_Rb_tree_const_iteratorIiEESt15insert_iteratorIT_ERS8_T0_
-FN:618,_ZNSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEdeEv
-FN:623,_ZNSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEppEv
-FN:429,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEdeEv
-FN:434,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEppEv
-FN:572,_ZNSt15insert_iteratorISt3setISsSt4lessISsESaISsEEEC1ERS4_St23_Rb_tree_const_iteratorISsE
-FN:645,_ZSt8inserterISt3setISsSt4lessISsESaISsEESt23_Rb_tree_const_iteratorISsEESt15insert_iteratorIT_ERS8_T0_
-FN:618,_ZNSt15insert_iteratorISt3setISsSt4lessISsESaISsEEEdeEv
-FN:623,_ZNSt15insert_iteratorISt3setISsSt4lessISsESaISsEEEppEv
-FN:412,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEaSERKSs
-FN:599,_ZNSt15insert_iteratorISt3setIN3ept7debtags3TagESt4lessIS3_ESaIS3_EEEaSERKS3_
-FN:599,_ZNSt15insert_iteratorISt3setISsSt4lessISsESaISsEEEaSERKSs
-FN:599,_ZNSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEaSERKi
-DA:398,0
-DA:412,0
-DA:414,0
-DA:415,0
-DA:429,0
-DA:430,0
-DA:434,0
-DA:435,0
-DA:456,0
-DA:457,0
-DA:572,0
-DA:573,0
-DA:599,0
-DA:601,0
-DA:602,0
-DA:603,0
-DA:618,0
-DA:619,0
-DA:623,0
-DA:624,0
-DA:645,0
-DA:648,0
-DA:683,0
-DA:695,0
-DA:696,0
-DA:703,0
-DA:705,0
-DA:706,0
-DA:747,0
-DA:748,0
-DA:769,0
-DA:770,0
-DA:781,0
-DA:782,0
-LF:34
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:111,_ZNSt8iteratorISt20forward_iterator_tagKivPS1_RS1_EC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,0
-DA:166,0
-DA:167,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_map.h
-FN:384,_ZNKSt3mapISsN7tagcoll5PatchISsSsEESt4lessISsESaISt4pairIKSsS2_EEE5emptyEv
-FN:275,_ZNSt3mapIiN7tagcoll5PatchIiiEESt4lessIiESaISt4pairIKiS2_EEE5beginEv
-FN:293,_ZNSt3mapIiN7tagcoll5PatchIiiEESt4lessIiESaISt4pairIKiS2_EEE3endEv
-FN:284,_ZNKSt3mapIiN7tagcoll5PatchIiiEESt4lessIiESaISt4pairIKiS2_EEE5beginEv
-FN:302,_ZNKSt3mapIiN7tagcoll5PatchIiiEESt4lessIiESaISt4pairIKiS2_EEE3endEv
-FN:293,_ZNSt3mapISsN7tagcoll5PatchISsN3ept7debtags3TagEEESt4lessISsESaISt4pairIKSsS5_EEE3endEv
-FN:614,_ZNSt3mapIiN7tagcoll5PatchIiiEESt4lessIiESaISt4pairIKiS2_EEE4findERS6_
-FN:155,_ZNSt3mapIiN7tagcoll5PatchIiiEESt4lessIiESaISt4pairIKiS2_EEEC2Ev
-FN:155,_ZNSt3mapISsN7tagcoll5PatchISsN3ept7debtags3TagEEESt4lessISsESaISt4pairIKSsS5_EEEC2Ev
-FN:155,_ZNSt3mapISsN7tagcoll5PatchISsSsEESt4lessISsESaISt4pairIKSsS2_EEEC2Ev
-FN:293,_ZNSt3mapISsN7tagcoll5PatchISsSsEESt4lessISsESaISt4pairIKSsS2_EEE3endEv
-FN:92,_ZNSt3mapISsN7tagcoll5PatchISsSsEESt4lessISsESaISt4pairIKSsS2_EEED2Ev
-FN:92,_ZNSt3mapIiN7tagcoll5PatchIiiEESt4lessIiESaISt4pairIKiS2_EEED2Ev
-FN:581,_ZNSt3mapIiN7tagcoll5PatchIiiEESt4lessIiESaISt4pairIKiS2_EEE5clearEv
-FN:92,_ZNSt3mapISsN7tagcoll5PatchISsN3ept7debtags3TagEEESt4lessISsESaISt4pairIKSsS5_EEED2Ev
-FN:175,_ZNSt3mapIiN7tagcoll5PatchIiiEESt4lessIiESaISt4pairIKiS2_EEEC2ERKS9_
-FN:614,_ZNSt3mapISsN7tagcoll5PatchISsSsEESt4lessISsESaISt4pairIKSsS2_EEE4findERS6_
-FN:614,_ZNSt3mapISsN7tagcoll5PatchISsN3ept7debtags3TagEEESt4lessISsESaISt4pairIKSsS5_EEE4findERS9_
-FN:468,_ZNSt3mapISsN7tagcoll5PatchISsSsEESt4lessISsESaISt4pairIKSsS2_EEE6insertERKS7_
-FN:468,_ZNSt3mapISsN7tagcoll5PatchISsN3ept7debtags3TagEEESt4lessISsESaISt4pairIKSsS5_EEE6insertERKSA_
-FN:468,_ZNSt3mapIiN7tagcoll5PatchIiiEESt4lessIiESaISt4pairIKiS2_EEE6insertERKS7_
-DA:92,0
-DA:155,0
-DA:156,0
-DA:175,3
-DA:176,3
-DA:275,0
-DA:276,0
-DA:284,0
-DA:285,0
-DA:293,0
-DA:294,0
-DA:302,0
-DA:303,0
-DA:384,0
-DA:385,0
-DA:468,0
-DA:469,0
-DA:581,0
-DA:582,0
-DA:614,0
-DA:615,0
-LF:21
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_pair.h
-FN:88,_ZNSt4pairISt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEbEC1ERKS4_RKb
-FN:88,_ZNSt4pairISt23_Rb_tree_const_iteratorIiEbEC1ERKS1_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIN3ept7debtags3TagEEbEC1ERKS4_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIiEbEC1ERKS1_RKb
-FN:88,_ZNSt4pairISt23_Rb_tree_const_iteratorISsEbEC1ERKS1_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorISsEbEC1ERKS1_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIS_IKiN7tagcoll5PatchIiiEEEEbEC1ERKS6_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIS_IKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEEbEC1ERKS9_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIiES1_EC1ERKS1_S4_
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIS_IKSsN7tagcoll5PatchISsSsEEEEbEC1ERKS6_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorISsES1_EC1ERKS1_S4_
-FN:73,_ZNSt4pairIKSsN7tagcoll5PatchISsSsEEED1Ev
-FN:73,_ZNSt4pairISsN7tagcoll5PatchISsSsEEED1Ev
-FN:73,_ZNSt4pairISt3setISsSt4lessISsESaISsEEN6wibble5EmptyISsEEED1Ev
-FN:73,_ZNSt4pairISt3setISsSt4lessISsESaISsEES4_ED1Ev
-FN:73,_ZNSt4pairIKiN7tagcoll5PatchIiiEEED1Ev
-FN:73,_ZNSt4pairIiN7tagcoll5PatchIiiEEED1Ev
-FN:73,_ZNSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEED1Ev
-FN:73,_ZNSt4pairISsN7tagcoll5PatchISsN3ept7debtags3TagEEEED1Ev
-FN:88,_ZNSt4pairISsN7tagcoll5PatchISsSsEEEC1ERKSsRKS2_
-FN:218,_ZSt9make_pairISsN7tagcoll5PatchISsSsEEESt4pairIT_T0_ES4_S5_
-FN:104,_ZNSt4pairIKSsN7tagcoll5PatchISsSsEEEC1ISsS3_EERKS_IT_T0_E
-FN:73,_ZNSt4pairIKSsN7tagcoll5PatchISsSsEEEC1ERKS4_
-FN:88,_ZNSt4pairISt3setISsSt4lessISsESaISsEEN6wibble5EmptyISsEEEC1ERKS4_RKS7_
-FN:218,_ZSt9make_pairISt3setISsSt4lessISsESaISsEEN6wibble5EmptyISsEEESt4pairIT_T0_ES9_SA_
-FN:88,_ZNSt4pairISt3setISsSt4lessISsESaISsEES4_EC1ERKS4_S7_
-FN:218,_ZSt9make_pairISt3setISsSt4lessISsESaISsEES4_ESt4pairIT_T0_ES6_S7_
-FN:73,_ZNSt4pairIKiN7tagcoll5PatchIiiEEEC1ERKS4_
-FN:88,_ZNSt4pairIiN7tagcoll5PatchIiiEEEC1ERKiRKS2_
-FN:218,_ZSt9make_pairIiN7tagcoll5PatchIiiEEESt4pairIT_T0_ES4_S5_
-FN:104,_ZNSt4pairIKiN7tagcoll5PatchIiiEEEC1IiS3_EERKS_IT_T0_E
-FN:88,_ZNSt4pairISsN7tagcoll5PatchISsN3ept7debtags3TagEEEEC1ERKSsRKS5_
-FN:218,_ZSt9make_pairISsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt4pairIT_T0_ES7_S8_
-FN:104,_ZNSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEC1ISsS6_EERKS_IT_T0_E
-FN:73,_ZNSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEC1ERKS7_
-DA:73,42290
-DA:88,42290
-DA:89,42290
-DA:104,0
-DA:106,0
-DA:218,42290
-DA:219,42290
-LF:7
-LH:5
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_set.h
-FN:331,_ZNKSt3setIiSt4lessIiESaIiEE5emptyEv
-FN:270,_ZNKSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EE3endEv
-FN:261,_ZNKSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EE5beginEv
-FN:331,_ZNKSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EE5emptyEv
-FN:261,_ZNKSt3setISsSt4lessISsESaISsEE5beginEv
-FN:270,_ZNKSt3setISsSt4lessISsESaISsEE3endEv
-FN:261,_ZNKSt3setIiSt4lessIiESaIiEE5beginEv
-FN:270,_ZNKSt3setIiSt4lessIiESaIiEE3endEv
-FN:331,_ZNKSt3setISsSt4lessISsESaISsEE5emptyEv
-FN:141,_ZNSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EEC1Ev
-FN:141,_ZNSt3setIiSt4lessIiESaIiEEC1Ev
-FN:141,_ZNSt3setISsSt4lessISsESaISsEEC1Ev
-FN:93,_ZNSt3setISsSt4lessISsESaISsEED1Ev
-FN:471,_ZNSt3setISsSt4lessISsESaISsEE5clearEv
-FN:93,_ZNSt3setIiSt4lessIiESaIiEED1Ev
-FN:93,_ZNSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EED1Ev
-FN:193,_ZNSt3setISsSt4lessISsESaISsEEC1ERKS3_
-FN:216,_ZNSt3setISsSt4lessISsESaISsEEaSERKS3_
-FN:193,_ZNSt3setIiSt4lessIiESaIiEEC1ERKS3_
-FN:216,_ZNSt3setIiSt4lessIiESaIiEEaSERKS3_
-FN:193,_ZNSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EEC1ERKS6_
-FN:216,_ZNSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EEaSERKS6_
-FN:378,_ZNSt3setISsSt4lessISsESaISsEE6insertERKSs
-FN:378,_ZNSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EE6insertERKS2_
-FN:378,_ZNSt3setIiSt4lessIiESaIiEE6insertERKi
-FN:446,_ZNSt3setISsSt4lessISsESaISsEE5eraseERKSs
-FN:431,_ZNSt3setISsSt4lessISsESaISsEE5eraseESt23_Rb_tree_const_iteratorISsE
-FN:431,_ZNSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EE5eraseESt23_Rb_tree_const_iteratorIS2_E
-FN:446,_ZNSt3setIiSt4lessIiESaIiEE5eraseERKi
-FN:431,_ZNSt3setIiSt4lessIiESaIiEE5eraseESt23_Rb_tree_const_iteratorIiE
-FN:405,_ZNSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EE6insertESt23_Rb_tree_const_iteratorIS2_ERKS2_
-FN:405,_ZNSt3setISsSt4lessISsESaISsEE6insertESt23_Rb_tree_const_iteratorISsERKSs
-FN:405,_ZNSt3setIiSt4lessIiESaIiEE6insertESt23_Rb_tree_const_iteratorIiERKi
-DA:93,0
-DA:141,0
-DA:142,0
-DA:193,0
-DA:194,0
-DA:216,0
-DA:218,0
-DA:219,0
-DA:261,0
-DA:262,0
-DA:270,0
-DA:271,0
-DA:331,0
-DA:332,0
-DA:378,0
-DA:381,0
-DA:382,0
-DA:405,0
-DA:406,0
-DA:431,0
-DA:432,0
-DA:446,0
-DA:447,0
-DA:471,0
-DA:472,0
-LF:25
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_tree.h
-FN:103,_ZNSt18_Rb_tree_node_base10_S_minimumEPS_
-FN:117,_ZNSt18_Rb_tree_node_base10_S_maximumEPS_
-FN:289,_ZNKSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEneERKS3_
-FN:243,_ZNSt23_Rb_tree_const_iteratorISt4pairIKiN7tagcoll5PatchIiiEEEEC1ERKSt17_Rb_tree_iteratorIS5_E
-FN:289,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKiN7tagcoll5PatchIiiEEEEneERKS6_
-FN:251,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKiN7tagcoll5PatchIiiEEEEptEv
-FN:289,_ZNKSt23_Rb_tree_const_iteratorISsEneERKS0_
-FN:285,_ZNKSt23_Rb_tree_const_iteratorISsEeqERKS0_
-FN:251,_ZNKSt23_Rb_tree_const_iteratorISsEptEv
-FN:452,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_M_beginEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEC1ERKSt17_Rb_tree_iteratorIS2_E
-FN:452,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_M_beginEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorIiEC1ERKSt17_Rb_tree_iteratorIiE
-FN:289,_ZNKSt23_Rb_tree_const_iteratorIiEneERKS0_
-FN:247,_ZNKSt23_Rb_tree_const_iteratorIiEdeEv
-FN:452,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE8_M_beginEv
-FN:452,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorISt4pairIKiN7tagcoll5PatchIiiEEEEeqERKS6_
-FN:176,_ZNKSt17_Rb_tree_iteratorISt4pairIKiN7tagcoll5PatchIiiEEEEptEv
-FN:452,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE8_M_beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEEeqERKS9_
-FN:176,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEEptEv
-FN:452,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE8_M_beginEv
-FN:637,_ZNKSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE5emptyEv
-FN:398,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13_Rb_tree_implIS6_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:463,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE6_M_endEv
-FN:168,_ZNSt17_Rb_tree_iteratorIN3ept7debtags3TagEEC1EPSt13_Rb_tree_nodeIS2_E
-FN:596,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE5beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorIN3ept7debtags3TagEEeqERKS3_
-FN:347,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE21_M_get_Node_allocatorEv
-FN:432,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE7_M_rootEv
-FN:456,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_M_beginEv
-FN:428,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE7_M_rootEv
-FN:503,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE10_S_minimumEPSt18_Rb_tree_node_base
-FN:436,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE11_M_leftmostEv
-FN:511,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE10_S_maximumEPSt18_Rb_tree_node_base
-FN:444,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE12_M_rightmostEv
-FN:398,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_Rb_tree_implIS3_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE7_S_leftEPSt18_Rb_tree_node_base
-FN:347,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE21_M_get_Node_allocatorEv
-FN:432,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE7_M_rootEv
-FN:456,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_M_beginEv
-FN:463,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE6_M_endEv
-FN:428,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE7_M_rootEv
-FN:503,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE10_S_minimumEPSt18_Rb_tree_node_base
-FN:436,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE11_M_leftmostEv
-FN:511,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE10_S_maximumEPSt18_Rb_tree_node_base
-FN:444,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE12_M_rightmostEv
-FN:168,_ZNSt17_Rb_tree_iteratorIiEC1EPSt13_Rb_tree_nodeIiE
-FN:596,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorIiEeqERKS0_
-FN:398,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE13_Rb_tree_implIS9_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:637,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5emptyEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorISsEC1ERKSt17_Rb_tree_iteratorISsE
-FN:398,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_S_leftEPSt18_Rb_tree_node_base
-FN:347,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE21_M_get_Node_allocatorEv
-FN:432,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_M_rootEv
-FN:456,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_beginEv
-FN:463,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_M_endEv
-FN:428,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_M_rootEv
-FN:503,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE10_S_minimumEPSt18_Rb_tree_node_base
-FN:436,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11_M_leftmostEv
-FN:511,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE10_S_maximumEPSt18_Rb_tree_node_base
-FN:444,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE12_M_rightmostEv
-FN:641,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE4sizeEv
-FN:240,_ZNSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEC1EPKSt13_Rb_tree_nodeIS2_E
-FN:614,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE3endEv
-FN:603,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE5beginEv
-FN:398,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE13_Rb_tree_implISC_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:168,_ZNSt17_Rb_tree_iteratorISt4pairIKiN7tagcoll5PatchIiiEEEEC1EPSt13_Rb_tree_nodeIS5_E
-FN:596,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE5beginEv
-FN:610,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE3endEv
-FN:637,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE5emptyEv
-FN:398,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE13_Rb_tree_implIS9_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:240,_ZNSt23_Rb_tree_const_iteratorISsEC1EPKSt13_Rb_tree_nodeISsE
-FN:603,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5beginEv
-FN:614,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE3endEv
-FN:415,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13_Rb_tree_implIS6_Lb0EE13_M_initializeEv
-FN:471,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_S_valueEPKSt13_Rb_tree_nodeIS2_E
-FN:475,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE6_S_keyEPKSt13_Rb_tree_nodeIS2_E
-FN:495,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE6_S_keyEPKSt18_Rb_tree_node_base
-FN:491,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_S_rightEPKSt18_Rb_tree_node_base
-FN:483,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE7_S_leftEPKSt18_Rb_tree_node_base
-FN:415,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_Rb_tree_implIS3_Lb0EE13_M_initializeEv
-FN:491,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_S_rightEPKSt18_Rb_tree_node_base
-FN:483,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE7_S_leftEPKSt18_Rb_tree_node_base
-FN:471,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_S_valueEPKSt13_Rb_tree_nodeIiE
-FN:475,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE6_S_keyEPKSt13_Rb_tree_nodeIiE
-FN:495,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE6_S_keyEPKSt18_Rb_tree_node_base
-FN:240,_ZNSt23_Rb_tree_const_iteratorIiEC1EPKSt13_Rb_tree_nodeIiE
-FN:603,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5beginEv
-FN:614,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE3endEv
-FN:240,_ZNSt23_Rb_tree_const_iteratorISt4pairIKiN7tagcoll5PatchIiiEEEEC1EPKSt13_Rb_tree_nodeIS5_E
-FN:603,_ZNKSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE5beginEv
-FN:614,_ZNKSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE3endEv
-FN:456,_ZNKSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE8_M_beginEv
-FN:168,_ZNSt17_Rb_tree_iteratorISsEC1EPSt13_Rb_tree_nodeISsE
-FN:596,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorISsEeqERKS0_
-FN:415,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EE13_M_initializeEv
-FN:491,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_rightEPKSt18_Rb_tree_node_base
-FN:483,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_S_leftEPKSt18_Rb_tree_node_base
-FN:463,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE6_M_endEv
-FN:637,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5emptyEv
-FN:247,_ZNKSt23_Rb_tree_const_iteratorISsEdeEv
-FN:436,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE11_M_leftmostEv
-FN:428,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE7_M_rootEv
-FN:444,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE12_M_rightmostEv
-FN:347,_ZNKSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE21_M_get_Node_allocatorEv
-FN:432,_ZNKSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE7_M_rootEv
-FN:503,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE10_S_minimumEPSt18_Rb_tree_node_base
-FN:511,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE10_S_maximumEPSt18_Rb_tree_node_base
-FN:247,_ZNKSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEdeEv
-FN:463,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE6_M_endEv
-FN:168,_ZNSt17_Rb_tree_iteratorISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEEC1EPSt13_Rb_tree_nodeIS8_E
-FN:610,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE3endEv
-FN:596,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE5beginEv
-FN:347,_ZNKSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE21_M_get_Node_allocatorEv
-FN:403,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13_Rb_tree_implIS6_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EEC1Ev
-FN:408,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13_Rb_tree_implIS6_Lb0EEC1ERKS6_RKSaISt13_Rb_tree_nodeIS2_EE
-FN:403,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_Rb_tree_implIS3_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEEC1Ev
-FN:408,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_Rb_tree_implIS3_Lb0EEC1ERKS3_RKSaISt13_Rb_tree_nodeIiEE
-FN:483,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE7_S_leftEPKSt18_Rb_tree_node_base
-FN:491,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE8_S_rightEPKSt18_Rb_tree_node_base
-FN:495,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE6_S_keyEPKSt18_Rb_tree_node_base
-FN:471,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_valueEPKSt13_Rb_tree_nodeISsE
-FN:475,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_S_keyEPKSt13_Rb_tree_nodeISsE
-FN:495,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_S_keyEPKSt18_Rb_tree_node_base
-FN:408,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EEC1ERKS3_RKSaISt13_Rb_tree_nodeISsEE
-FN:415,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE13_Rb_tree_implIS9_Lb0EE13_M_initializeEv
-FN:471,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE8_S_valueEPKSt13_Rb_tree_nodeIS5_E
-FN:475,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE6_S_keyEPKSt13_Rb_tree_nodeIS5_E
-FN:954,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE14_M_lower_boundEPSt13_Rb_tree_nodeIS5_ESE_RS1_
-FN:1390,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE4findERS1_
-FN:351,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13get_allocatorEv
-FN:415,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE13_Rb_tree_implISC_Lb0EE13_M_initializeEv
-FN:495,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE6_S_keyEPKSt18_Rb_tree_node_base
-FN:471,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE8_S_valueEPKSt13_Rb_tree_nodeIS8_E
-FN:475,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE6_S_keyEPKSt13_Rb_tree_nodeIS8_E
-FN:415,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE13_Rb_tree_implIS9_Lb0EE13_M_initializeEv
-FN:347,_ZNKSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE21_M_get_Node_allocatorEv
-FN:210,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsN7tagcoll5PatchISsSsEEEEeqERKS6_
-FN:176,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsN7tagcoll5PatchISsSsEEEEptEv
-FN:351,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13get_allocatorEv
-FN:351,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13get_allocatorEv
-FN:351,_ZNKSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE13get_allocatorEv
-FN:403,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEEC1Ev
-FN:954,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE14_M_lower_boundEPSt13_Rb_tree_nodeIiES8_RKi
-FN:986,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE14_M_upper_boundEPSt13_Rb_tree_nodeIiES8_RKi
-FN:1019,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE11equal_rangeERKi
-FN:610,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE3endEv
-FN:214,_ZNKSt17_Rb_tree_iteratorIiEneERKS0_
-FN:403,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE13_Rb_tree_implIS9_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EEC1Ev
-FN:408,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE13_Rb_tree_implIS9_Lb0EEC1ERKS9_RKSaISt13_Rb_tree_nodeIS5_EE
-FN:403,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE13_Rb_tree_implISC_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EEC1Ev
-FN:351,_ZNKSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE13get_allocatorEv
-FN:403,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE13_Rb_tree_implIS9_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EEC1Ev
-FN:351,_ZNKSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE13get_allocatorEv
-FN:641,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE4sizeEv
-FN:641,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE4sizeEv
-FN:463,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE6_M_endEv
-FN:168,_ZNSt17_Rb_tree_iteratorISt4pairIKSsN7tagcoll5PatchISsSsEEEEC1EPSt13_Rb_tree_nodeIS5_E
-FN:610,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE3endEv
-FN:596,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE5beginEv
-FN:610,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE3endEv
-FN:214,_ZNKSt17_Rb_tree_iteratorISsEneERKS0_
-FN:495,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE6_S_keyEPKSt18_Rb_tree_node_base
-FN:471,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE8_S_valueEPKSt13_Rb_tree_nodeIS5_E
-FN:475,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE6_S_keyEPKSt13_Rb_tree_nodeIS5_E
-FN:262,_ZNSt23_Rb_tree_const_iteratorISsEppEi
-FN:255,_ZNSt23_Rb_tree_const_iteratorIiEppEv
-FN:255,_ZNSt23_Rb_tree_const_iteratorISsEppEv
-FN:255,_ZNSt23_Rb_tree_const_iteratorISt4pairIKiN7tagcoll5PatchIiiEEEEppEv
-FN:255,_ZNSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEppEv
-FN:262,_ZNSt23_Rb_tree_const_iteratorISt4pairIKiN7tagcoll5PatchIiiEEEEppEi
-FN:360,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11_M_put_nodeEPSt13_Rb_tree_nodeISsE
-FN:388,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE15_M_destroy_nodeEPSt13_Rb_tree_nodeISsE
-FN:936,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_eraseEPSt13_Rb_tree_nodeISsE
-FN:584,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEED1Ev
-FN:695,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5clearEv
-FN:360,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS5_E
-FN:388,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS5_E
-FN:936,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE8_M_eraseEPSt13_Rb_tree_nodeIS5_E
-FN:584,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EED1Ev
-FN:360,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE11_M_put_nodeEPSt13_Rb_tree_nodeIiE
-FN:388,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE15_M_destroy_nodeEPSt13_Rb_tree_nodeIiE
-FN:936,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_M_eraseEPSt13_Rb_tree_nodeIiE
-FN:584,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEED1Ev
-FN:695,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5clearEv
-FN:360,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS5_E
-FN:388,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS5_E
-FN:936,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE8_M_eraseEPSt13_Rb_tree_nodeIS5_E
-FN:584,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EED1Ev
-FN:695,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE5clearEv
-FN:360,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS2_E
-FN:388,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS2_E
-FN:936,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_M_eraseEPSt13_Rb_tree_nodeIS2_E
-FN:695,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE5clearEv
-FN:584,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EED1Ev
-FN:360,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS8_E
-FN:388,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS8_E
-FN:936,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE8_M_eraseEPSt13_Rb_tree_nodeIS8_E
-FN:584,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EED1Ev
-FN:356,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE14_M_create_nodeERKSs
-FN:378,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_M_clone_nodeEPKSt13_Rb_tree_nodeISsE
-FN:900,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_M_copyEPKSt13_Rb_tree_nodeISsEPS7_
-FN:568,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEEC1ERKS5_
-FN:824,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEEaSERKS5_
-FN:356,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE14_M_create_nodeERKS5_
-FN:356,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE11_M_get_nodeEv
-FN:356,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE14_M_create_nodeERKi
-FN:378,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_M_clone_nodeEPKSt13_Rb_tree_nodeIiE
-FN:900,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE7_M_copyEPKSt13_Rb_tree_nodeIiEPS7_
-FN:568,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEEC1ERKS5_
-FN:364,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE14_M_create_nodeERKS5_
-FN:378,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE13_M_clone_nodeEPKSt13_Rb_tree_nodeIS5_E
-FN:900,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE7_M_copyEPKSt13_Rb_tree_nodeIS5_EPSD_
-FN:568,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EEC1ERKSB_
-FN:824,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEEaSERKS5_
-FN:356,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE14_M_create_nodeERKS2_
-FN:378,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13_M_clone_nodeEPKSt13_Rb_tree_nodeIS2_E
-FN:900,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE7_M_copyEPKSt13_Rb_tree_nodeIS2_EPSA_
-FN:568,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EEC1ERKS8_
-FN:824,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EEaSERKS8_
-FN:356,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE14_M_create_nodeERKS8_
-FN:195,_ZNSt17_Rb_tree_iteratorISsEmmEv
-FN:195,_ZNSt17_Rb_tree_iteratorISt4pairIKSsN7tagcoll5PatchISsSsEEEEmmEv
-FN:195,_ZNSt17_Rb_tree_iteratorIN3ept7debtags3TagEEmmEv
-FN:195,_ZNSt17_Rb_tree_iteratorISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEEmmEv
-FN:195,_ZNSt17_Rb_tree_iteratorIiEmmEv
-FN:195,_ZNSt17_Rb_tree_iteratorISt4pairIKiN7tagcoll5PatchIiiEEEEmmEv
-FN:986,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE14_M_upper_boundEPSt13_Rb_tree_nodeISsES8_RKSs
-FN:954,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE14_M_lower_boundEPSt13_Rb_tree_nodeISsES8_RKSs
-FN:1019,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11equal_rangeERKSs
-FN:954,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE14_M_lower_boundEPSt13_Rb_tree_nodeIS5_ESE_RS1_
-FN:1390,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE4findERS1_
-FN:954,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE14_M_lower_boundEPSt13_Rb_tree_nodeIS8_ESH_RS1_
-FN:1390,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE4findERS1_
-FN:846,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE10_M_insert_EPKSt18_Rb_tree_node_baseS8_RKSs
-FN:1133,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE16_M_insert_uniqueERKSs
-FN:846,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE10_M_insert_EPKSt18_Rb_tree_node_baseSE_RKS5_
-FN:1133,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsSsEEESt10_Select1stIS5_ESt4lessISsESaIS5_EE16_M_insert_uniqueERKS5_
-FN:846,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE10_M_insert_EPKSt18_Rb_tree_node_baseSB_RKS2_
-FN:1133,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE16_M_insert_uniqueERKS2_
-FN:846,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE10_M_insert_EPKSt18_Rb_tree_node_baseSH_RKS8_
-FN:1133,_ZNSt8_Rb_treeISsSt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEESt10_Select1stIS8_ESt4lessISsESaIS8_EE16_M_insert_uniqueERKS8_
-FN:846,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE10_M_insert_EPKSt18_Rb_tree_node_baseS8_RKi
-FN:1133,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE16_M_insert_uniqueERKi
-FN:846,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE10_M_insert_EPKSt18_Rb_tree_node_baseSE_RKS5_
-FN:1133,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE16_M_insert_uniqueERKS5_
-FN:187,_ZNSt17_Rb_tree_iteratorISsEppEi
-FN:187,_ZNSt17_Rb_tree_iteratorIiEppEi
-FN:1313,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5eraseESt17_Rb_tree_iteratorISsE
-FN:1353,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5eraseESt17_Rb_tree_iteratorISsES7_
-FN:1341,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5eraseERKSs
-FN:1327,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5eraseESt23_Rb_tree_const_iteratorISsE
-FN:1327,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE5eraseESt23_Rb_tree_const_iteratorIS2_E
-FN:1313,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5eraseESt17_Rb_tree_iteratorIiE
-FN:1353,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5eraseESt17_Rb_tree_iteratorIiES7_
-FN:1341,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5eraseERKi
-FN:1327,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5eraseESt23_Rb_tree_const_iteratorIiE
-FN:270,_ZNSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEmmEv
-FN:1178,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE17_M_insert_unique_ESt23_Rb_tree_const_iteratorIS2_ERKS2_
-FN:270,_ZNSt23_Rb_tree_const_iteratorISsEmmEv
-FN:1178,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE17_M_insert_unique_ESt23_Rb_tree_const_iteratorISsERKSs
-FN:270,_ZNSt23_Rb_tree_const_iteratorIiEmmEv
-FN:1178,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE17_M_insert_unique_ESt23_Rb_tree_const_iteratorIiERKi
-DA:103,0
-DA:105,0
-DA:106,0
-DA:117,0
-DA:119,0
-DA:120,0
-DA:168,0
-DA:169,0
-DA:176,0
-DA:177,0
-DA:187,0
-DA:189,0
-DA:190,0
-DA:195,0
-DA:197,0
-DA:198,0
-DA:210,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:240,0
-DA:241,0
-DA:243,0
-DA:244,0
-DA:247,0
-DA:248,0
-DA:251,190305
-DA:252,190305
-DA:255,0
-DA:257,0
-DA:258,0
-DA:262,0
-DA:264,0
-DA:265,0
-DA:270,0
-DA:272,0
-DA:273,0
-DA:285,0
-DA:286,0
-DA:289,0
-DA:290,0
-DA:347,0
-DA:348,0
-DA:351,0
-DA:352,0
-DA:356,0
-DA:357,0
-DA:360,0
-DA:361,0
-DA:364,0
-DA:366,0
-DA:368,0
-DA:369,0
-DA:371,0
-DA:372,0
-DA:374,0
-DA:378,2
-DA:380,2
-DA:381,2
-DA:382,2
-DA:383,2
-DA:384,2
-DA:388,0
-DA:390,0
-DA:391,0
-DA:392,0
-DA:398,0
-DA:403,0
-DA:405,0
-DA:406,0
-DA:408,3
-DA:410,3
-DA:411,3
-DA:415,0
-DA:417,0
-DA:418,0
-DA:419,0
-DA:420,0
-DA:421,0
-DA:428,6
-DA:429,6
-DA:432,3
-DA:433,3
-DA:436,2
-DA:437,2
-DA:444,2
-DA:445,2
-DA:452,0
-DA:453,0
-DA:456,0
-DA:459,0
-DA:463,0
-DA:464,0
-DA:471,0
-DA:472,0
-DA:475,0
-DA:476,0
-DA:479,0
-DA:480,0
-DA:483,0
-DA:484,0
-DA:487,0
-DA:488,0
-DA:491,0
-DA:492,0
-DA:495,0
-DA:496,0
-DA:499,0
-DA:500,0
-DA:503,2
-DA:504,2
-DA:511,2
-DA:512,2
-DA:562,0
-DA:568,3
-DA:569,3
-DA:571,3
-DA:573,2
-DA:574,2
-DA:575,2
-DA:576,2
-DA:578,3
-DA:584,0
-DA:585,0
-DA:596,0
-DA:599,0
-DA:603,0
-DA:606,0
-DA:610,0
-DA:611,0
-DA:614,0
-DA:617,0
-DA:637,0
-DA:638,0
-DA:641,0
-DA:642,0
-DA:695,0
-DA:697,0
-DA:698,0
-DA:699,0
-DA:700,0
-DA:701,0
-DA:702,0
-DA:824,0
-DA:826,0
-DA:829,0
-DA:830,0
-DA:831,0
-DA:833,0
-DA:834,0
-DA:835,0
-DA:836,0
-DA:839,0
-DA:846,0
-DA:850,0
-DA:852,0
-DA:854,0
-DA:857,0
-DA:858,0
-DA:900,2
-DA:903,2
-DA:904,2
-DA:908,2
-DA:909,0
-DA:910,2
-DA:911,2
-DA:913,4
-DA:915,0
-DA:916,0
-DA:917,0
-DA:918,0
-DA:919,0
-DA:920,0
-DA:921,0
-DA:924,0
-DA:926,0
-DA:927,0
-DA:929,2
-DA:936,0
-DA:939,0
-DA:941,0
-DA:942,0
-DA:943,0
-DA:944,0
-DA:946,0
-DA:954,0
-DA:956,0
-DA:957,0
-DA:958,0
-DA:960,0
-DA:961,0
-DA:986,0
-DA:988,0
-DA:989,0
-DA:990,0
-DA:992,0
-DA:993,0
-DA:1019,0
-DA:1021,0
-DA:1022,0
-DA:1023,0
-DA:1025,0
-DA:1026,0
-DA:1027,0
-DA:1028,0
-DA:1031,0
-DA:1032,0
-DA:1033,0
-DA:1036,0
-DA:1040,0
-DA:1133,0
-DA:1135,0
-DA:1136,0
-DA:1137,0
-DA:1138,0
-DA:1140,0
-DA:1141,0
-DA:1142,0
-DA:1144,0
-DA:1145,0
-DA:1147,0
-DA:1148,0
-DA:1150,0
-DA:1152,0
-DA:1153,0
-DA:1154,0
-DA:1178,0
-DA:1181,0
-DA:1183,0
-DA:1186,0
-DA:1188,0
-DA:1190,0
-DA:1194,0
-DA:1195,0
-DA:1196,0
-DA:1197,0
-DA:1200,0
-DA:1201,0
-DA:1204,0
-DA:1207,0
-DA:1209,0
-DA:1213,0
-DA:1214,0
-DA:1215,0
-DA:1216,0
-DA:1219,0
-DA:1220,0
-DA:1222,0
-DA:1225,0
-DA:1230,0
-DA:1313,0
-DA:1318,0
-DA:1319,0
-DA:1320,0
-DA:1321,0
-DA:1327,0
-DA:1332,0
-DA:1333,0
-DA:1334,0
-DA:1335,0
-DA:1341,0
-DA:1343,0
-DA:1344,0
-DA:1345,0
-DA:1346,0
-DA:1353,0
-DA:1355,0
-DA:1356,0
-DA:1358,0
-DA:1359,0
-DA:1360,0
-DA:1390,0
-DA:1392,0
-DA:1395,0
-BA:105,0
-BA:105,0
-BA:119,0
-BA:119,0
-BA:571,0
-BA:571,0
-BA:571,0
-BA:571,0
-BA:571,2
-BA:571,2
-BA:571,0
-BA:571,0
-BA:826,0
-BA:826,0
-BA:826,0
-BA:826,0
-BA:826,0
-BA:826,0
-BA:831,0
-BA:831,0
-BA:831,0
-BA:831,0
-BA:831,0
-BA:831,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:908,0
-BA:908,0
-BA:908,0
-BA:908,0
-BA:908,1
-BA:908,2
-BA:908,0
-BA:908,0
-BA:913,0
-BA:913,0
-BA:913,0
-BA:913,0
-BA:913,1
-BA:913,2
-BA:913,0
-BA:913,0
-BA:918,0
-BA:918,0
-BA:918,0
-BA:918,0
-BA:918,0
-BA:918,0
-BA:918,0
-BA:918,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:956,0
-BA:956,0
-BA:956,0
-BA:956,0
-BA:956,0
-BA:956,0
-BA:956,0
-BA:956,0
-BA:956,0
-BA:956,0
-BA:957,0
-BA:957,0
-BA:957,0
-BA:957,0
-BA:957,0
-BA:957,0
-BA:957,0
-BA:957,0
-BA:957,0
-BA:957,0
-BA:988,0
-BA:988,0
-BA:988,0
-BA:988,0
-BA:989,0
-BA:989,0
-BA:989,0
-BA:989,0
-BA:1023,0
-BA:1023,0
-BA:1023,0
-BA:1023,0
-BA:1025,0
-BA:1025,0
-BA:1025,0
-BA:1025,0
-BA:1027,0
-BA:1027,0
-BA:1027,0
-BA:1027,0
-BA:1138,0
-BA:1138,0
-BA:1138,0
-BA:1138,0
-BA:1138,0
-BA:1138,0
-BA:1138,0
-BA:1138,0
-BA:1138,0
-BA:1138,0
-BA:1138,0
-BA:1138,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1145,0
-BA:1145,0
-BA:1145,0
-BA:1145,0
-BA:1145,0
-BA:1145,0
-BA:1145,0
-BA:1145,0
-BA:1145,0
-BA:1145,0
-BA:1145,0
-BA:1145,0
-BA:1147,0
-BA:1147,0
-BA:1147,0
-BA:1147,0
-BA:1147,0
-BA:1147,0
-BA:1147,0
-BA:1147,0
-BA:1147,0
-BA:1147,0
-BA:1147,0
-BA:1147,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1181,0
-BA:1181,0
-BA:1181,0
-BA:1181,0
-BA:1181,0
-BA:1181,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1190,0
-BA:1190,0
-BA:1190,0
-BA:1190,0
-BA:1190,0
-BA:1190,0
-BA:1195,0
-BA:1195,0
-BA:1195,0
-BA:1195,0
-BA:1195,0
-BA:1195,0
-BA:1197,0
-BA:1197,0
-BA:1197,0
-BA:1197,0
-BA:1197,0
-BA:1197,0
-BA:1200,0
-BA:1200,0
-BA:1200,0
-BA:1200,0
-BA:1200,0
-BA:1200,0
-BA:1209,0
-BA:1209,0
-BA:1209,0
-BA:1209,0
-BA:1209,0
-BA:1209,0
-BA:1214,0
-BA:1214,0
-BA:1214,0
-BA:1214,0
-BA:1214,0
-BA:1214,0
-BA:1216,0
-BA:1216,0
-BA:1216,0
-BA:1216,0
-BA:1216,0
-BA:1216,0
-BA:1219,0
-BA:1219,0
-BA:1219,0
-BA:1219,0
-BA:1219,0
-BA:1219,0
-BA:1355,0
-BA:1355,0
-BA:1355,0
-BA:1355,0
-BA:1355,0
-BA:1355,0
-BA:1355,0
-BA:1355,0
-BA:1355,0
-BA:1355,0
-BA:1355,0
-BA:1355,0
-BA:1358,0
-BA:1358,0
-BA:1358,0
-BA:1358,0
-BA:1395,0
-BA:1395,0
-BA:1395,0
-BA:1395,0
-BA:1395,0
-BA:1395,0
-BA:1395,0
-BA:1395,0
-BA:1395,0
-BA:1395,0
-BA:1395,0
-BA:1395,0
-LF:274
-LH:39
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyIPSsS2_EET0_T_S4_S3_
-FN:113,_ZSt18uninitialized_copyIPSsS0_ET0_T_S2_S1_
-FN:261,_ZSt22__uninitialized_copy_aIPSsS0_SsET0_T_S2_S1_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPSsS0_SaISsEET0_T_S3_S2_RT1_
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEEPSsEET0_T_SC_SB_
-FN:113,_ZSt18uninitialized_copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEEPSsET0_T_SA_S9_
-FN:261,_ZSt22__uninitialized_copy_aIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEEPSsSsET0_T_SA_S9_RSaIT1_E
-DA:73,0
-DA:75,0
-DA:78,0
-DA:79,0
-DA:81,0
-DA:83,0
-DA:85,0
-DA:86,0
-DA:113,0
-DA:122,0
-DA:261,0
-DA:262,0
-DA:268,0
-DA:272,0
-BA:78,0
-BA:78,0
-BA:78,0
-BA:78,0
-BA:79,0
-BA:79,0
-BA:79,0
-BA:79,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:404,_ZNKSt6vectorISsSaISsEE3endEv
-FN:386,_ZNKSt6vectorISsSaISsEE5beginEv
-FN:484,_ZNKSt6vectorISsSaISsEE4sizeEv
-FN:101,_ZNKSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:395,_ZNSt6vectorISsSaISsEE3endEv
-FN:377,_ZNSt6vectorISsSaISsEE5beginEv
-FN:526,_ZNKSt6vectorISsSaISsEE5emptyEv
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:84,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseISsSaISsEEC2Ev
-FN:213,_ZNSt6vectorISsSaISsEEC1Ev
-FN:489,_ZNKSt6vectorISsSaISsEE8max_sizeEv
-FN:88,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implC1ERKS0_
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-FN:1075,_ZNKSt6vectorISsSaISsEE12_M_check_lenEjPKc
-FN:143,_ZNSt12_Vector_baseISsSaISsEE11_M_allocateEj
-FN:686,_ZNSt6vectorISsSaISsEE9push_backERKSs
-FN:114,_ZNSt12_Vector_baseISsSaISsEEC2EjRKS0_
-FN:247,_ZNSt6vectorISsSaISsEEC1ERKS1_
-DA:79,0
-DA:84,0
-DA:85,0
-DA:86,0
-DA:88,0
-DA:89,0
-DA:90,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:108,0
-DA:109,0
-DA:114,0
-DA:115,0
-DA:117,0
-DA:118,0
-DA:119,0
-DA:120,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:143,0
-DA:144,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:213,0
-DA:214,0
-DA:247,0
-DA:248,0
-DA:249,0
-DA:253,0
-DA:299,0
-DA:300,0
-DA:301,0
-DA:377,0
-DA:378,0
-DA:386,0
-DA:387,0
-DA:395,0
-DA:396,0
-DA:404,0
-DA:405,0
-DA:484,0
-DA:485,0
-DA:489,0
-DA:490,0
-DA:526,0
-DA:527,0
-DA:686,0
-DA:688,0
-DA:690,0
-DA:691,0
-DA:694,0
-DA:695,0
-DA:1075,0
-DA:1077,0
-DA:1078,0
-DA:1080,0
-DA:1081,0
-BA:144,0
-BA:144,0
-BA:149,0
-BA:149,0
-BA:688,0
-BA:688,0
-BA:1077,0
-BA:1077,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-LF:62
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stream_iterator.h
-FN:181,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERSoPKc
-FN:185,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERKS2_
-FN:202,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEdeEv
-FN:206,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEppEv
-FN:191,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEaSERKSs
-DA:181,0
-DA:182,0
-DA:185,0
-DA:186,0
-DA:191,0
-DA:196,0
-DA:197,0
-DA:198,0
-DA:202,0
-DA:203,0
-DA:206,0
-DA:207,0
-BA:197,0
-BA:197,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/vector.tcc
-FN:283,_ZNSt6vectorISsSaISsEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPSsS1_EERKSs
-DA:283,0
-DA:286,0
-DA:288,0
-DA:291,0
-DA:293,0
-DA:295,0
-DA:299,0
-DA:307,0
-DA:308,0
-DA:309,0
-DA:316,0
-DA:321,0
-DA:323,0
-DA:324,0
-DA:330,0
-DA:332,0
-DA:333,0
-DA:334,0
-DA:336,0
-DA:338,0
-DA:341,0
-DA:342,0
-DA:343,0
-DA:345,0
-BA:286,0
-BA:286,0
-LF:24
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/exception
-FN:59,_ZNSt9exceptionC2Ev
-FN:57,_ZNSt9exceptionC2ERKS_
-DA:57,0
-DA:59,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKiN7tagcoll5PatchIiiEEEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN7tagcoll5PatchISsSsEEEEED2Ev
-FN:118,_ZN9__gnu_cxx13new_allocatorIN3ept7debtags3TagEE7destroyEPS3_
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:118,_ZN9__gnu_cxx13new_allocatorIiE7destroyEPi
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIN3ept7debtags3TagEED2Ev
-FN:107,_ZN9__gnu_cxx13new_allocatorIN3ept7debtags3TagEE9constructEPS3_RKS3_
-FN:71,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEEC2ERKS6_
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIiED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEEC2ERKS3_
-FN:107,_ZN9__gnu_cxx13new_allocatorIiE9constructEPiRKi
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKiN7tagcoll5PatchIiiEEEED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEEC2ERKS3_
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISsE8max_sizeEv
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN7tagcoll5PatchISsSsEEEED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorISsEC2ERKS1_
-FN:69,_ZN9__gnu_cxx13new_allocatorIN3ept7debtags3TagEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorIiEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKiN7tagcoll5PatchIiiEEEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKiN7tagcoll5PatchIiiEEEEEC2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKiN7tagcoll5PatchIiiEEEEEC2ERKS9_
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN7tagcoll5PatchISsSsEEEEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN7tagcoll5PatchISsSsEEEEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEE8max_sizeEv
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEE8max_sizeEv
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE8max_sizeEv
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKiN7tagcoll5PatchIiiEEEEE8max_sizeEv
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEEE8max_sizeEv
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN7tagcoll5PatchISsSsEEEEE8max_sizeEv
-FN:118,_ZN9__gnu_cxx13new_allocatorISsE7destroyEPSs
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE10deallocateEPS2_j
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN7tagcoll5PatchISsSsEEEE7destroyEPS6_
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN7tagcoll5PatchISsSsEEEEE10deallocateEPS8_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEE10deallocateEPS2_j
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKiN7tagcoll5PatchIiiEEEE7destroyEPS6_
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKiN7tagcoll5PatchIiiEEEEE10deallocateEPS8_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEE10deallocateEPS5_j
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEE7destroyEPS9_
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEEE10deallocateEPSB_j
-FN:107,_ZN9__gnu_cxx13new_allocatorISsE9constructEPSsRKSs
-FN:87,_ZN9__gnu_cxx13new_allocatorISsE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE8allocateEjPKv
-FN:107,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN7tagcoll5PatchISsSsEEEE9constructEPS6_RKS6_
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN7tagcoll5PatchISsSsEEEEE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKiN7tagcoll5PatchIiiEEEEE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEE8allocateEjPKv
-FN:107,_ZN9__gnu_cxx13new_allocatorISt4pairIKiN7tagcoll5PatchIiiEEEE9constructEPS6_RKS6_
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEE8allocateEjPKv
-FN:107,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEE9constructEPS9_RKS9_
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN7tagcoll5PatchISsN3ept7debtags3TagEEEEEE8allocateEjPKv
-DA:69,0
-DA:71,3
-DA:76,0
-DA:87,0
-DA:89,0
-DA:90,0
-DA:92,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:107,0
-DA:108,0
-DA:118,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:108,0
-BA:108,0
-BA:108,0
-BA:108,0
-BA:108,0
-BA:108,0
-BA:108,0
-BA:108,0
-BA:108,0
-BA:108,0
-BA:108,0
-BA:108,0
-LF:14
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,2
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/istream
-FN:585,_ZNSiC2Ev
-FN:105,_ZNSiD2Ev
-FN:804,_ZNSdC2Ev
-FN:801,_ZNSdD2Ev
-DA:105,0
-DA:106,0
-DA:585,0
-DA:586,0
-DA:587,0
-DA:801,0
-DA:804,0
-DA:805,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:112,_ZNSolsEPFRSoS_E
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-FN:566,_ZSt5flushIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-FN:545,_ZSt4endlIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_
-DA:95,0
-DA:112,0
-DA:117,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-DA:545,0
-DA:546,0
-DA:566,0
-DA:567,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:509,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:536,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:555,_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:509,0
-DA:510,0
-DA:511,0
-DA:536,0
-DA:537,0
-DA:555,0
-DA:556,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/coll/base.h
-FN:48,_ZN7tagcoll4coll18ReadonlyCollectionINS0_12IntDiskIndexEEC2Ev
-FN:48,_ZN7tagcoll4coll18ReadonlyCollectionIN3ept7debtags7DebtagsEEC2Ev
-FN:273,_ZN7tagcoll4coll10CollectionIN3ept7debtags7DebtagsEEC2Ev
-FN:48,_ZN7tagcoll4coll18ReadonlyCollectionINS0_7PatchedINS0_12IntDiskIndexEEEEC2Ev
-FN:273,_ZN7tagcoll4coll10CollectionINS0_7PatchedINS0_12IntDiskIndexEEEEC2Ev
-DA:48,30
-DA:273,20
-LF:2
-LH:2
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/coll/intdiskindex.h
-FN:133,_ZN7tagcoll4coll12IntDiskIndex4initERKNS_9diskindex10MasterMMapEii
-FN:127,_ZN7tagcoll4coll12IntDiskIndexC1Ev
-DA:127,10
-DA:133,9
-DA:135,9
-DA:136,9
-DA:137,9
-LF:5
-LH:5
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/coll/patched.h
-FN:186,_ZNK7tagcoll4coll7PatchedINS0_12IntDiskIndexEE7changesEv
-FN:167,_ZN7tagcoll4coll7PatchedINS0_12IntDiskIndexEEC1ERKS2_
-FN:51,_ZN7tagcoll4coll7PatchedINS0_12IntDiskIndexEED1Ev
-FN:201,_ZN7tagcoll4coll7PatchedINS0_12IntDiskIndexEE10addChangesERKNS_9PatchListIiiEE
-FN:196,_ZN7tagcoll4coll7PatchedINS0_12IntDiskIndexEE10setChangesERKNS_9PatchListIiiEE
-DA:51,0
-DA:167,10
-DA:186,4
-DA:196,0
-DA:201,0
-LF:5
-LH:2
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/coll/patched.tcc
-DA:68,0
-DA:69,0
-DA:71,0
-DA:72,0
-DA:78,0
-DA:80,0
-DA:83,0
-DA:85,0
-DA:88,0
-DA:89,0
-DA:90,0
-DA:92,0
-DA:95,0
-DA:97,0
-DA:99,0
-BA:78,0
-BA:78,0
-BA:80,0
-BA:80,0
-BA:90,0
-BA:90,0
-BA:92,0
-BA:92,0
-LF:15
-LH:0
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/diskindex/int.h
-FN:57,_ZN7tagcoll9diskindex3IntC1Ev
-DA:57,20
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/input/base.h
-FN:62,_ZN7tagcoll9exception5Input4lineEi
-FN:68,_ZNK7tagcoll9exception5Input4typeEv
-FN:81,_ZNK7tagcoll9exception6Parser4typeEv
-FN:59,_ZN7tagcoll9exception5InputD2Ev
-FN:79,_ZN7tagcoll9exception6ParserD0Ev
-FN:79,_ZN7tagcoll9exception6ParserD1Ev
-FN:59,_ZN7tagcoll9exception5InputD0Ev
-FN:59,_ZN7tagcoll9exception5InputD1Ev
-FN:41,_ZN7tagcoll9exception5InputC2ERKS1_
-FN:75,_ZN7tagcoll9exception6ParserC1ERKS1_
-FN:53,_ZN7tagcoll9exception5InputC1EiRKSs
-DA:41,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:59,0
-DA:62,0
-DA:68,0
-DA:75,0
-DA:79,0
-DA:81,0
-DA:83,0
-BA:59,0
-BA:59,0
-BA:59,0
-BA:59,0
-BA:59,0
-BA:59,0
-BA:79,0
-BA:79,0
-BA:79,0
-BA:79,0
-LF:11
-LH:0
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/patch.h
-FN:186,_ZN7tagcoll8InserterIiiEC1ERNS_9PatchListIiiEE
-FN:196,_ZN7tagcoll8inserterIiiEENS_8InserterIT_T0_EERNS_9PatchListIS2_S3_EE
-FN:186,_ZN7tagcoll8InserterISsSsEC1ERNS_9PatchListISsSsEE
-FN:196,_ZN7tagcoll8inserterISsSsEENS_8InserterIT_T0_EERNS_9PatchListIS2_S3_EE
-FN:126,_ZN7tagcoll9PatchListIiiEC1Ev
-FN:126,_ZN7tagcoll9PatchListISsN3ept7debtags3TagEEC1Ev
-FN:126,_ZN7tagcoll9PatchListISsSsEC1Ev
-FN:49,_ZN7tagcoll5PatchISsSsED1Ev
-FN:124,_ZN7tagcoll9PatchListISsSsED1Ev
-FN:49,_ZN7tagcoll5PatchIiiED1Ev
-FN:45,_ZN7tagcoll5PatchIiiEC1ERKi
-FN:124,_ZN7tagcoll9PatchListIiiED1Ev
-FN:49,_ZN7tagcoll5PatchISsN3ept7debtags3TagEED1Ev
-FN:124,_ZN7tagcoll9PatchListISsN3ept7debtags3TagEED1Ev
-FN:45,_ZN7tagcoll5PatchISsSsEC1ERKSs
-FN:44,_ZN7tagcoll5PatchISsSsEC1ERKS1_
-FN:44,_ZN7tagcoll5PatchIiiEC1ERKS1_
-FN:127,_ZN7tagcoll9PatchListIiiEC1ERKS1_
-FN:44,_ZN7tagcoll5PatchISsN3ept7debtags3TagEEC1ERKS4_
-FN:51,_ZN7tagcoll5PatchISsSsE3addERKSs
-FN:61,_ZN7tagcoll5PatchISsSsE6removeERKSs
-FN:56,_ZN7tagcoll5PatchISsSsE3addERKSt3setISsSt4lessISsESaISsEE
-FN:66,_ZN7tagcoll5PatchISsSsE6removeERKSt3setISsSt4lessISsESaISsEE
-FN:77,_ZN7tagcoll5PatchISsSsE9mergeWithERKS1_
-FN:141,_ZN7tagcoll9PatchListISsSsE8addPatchERKNS_5PatchISsSsEE
-FN:188,_ZN7tagcoll8InserterISsSsEaSERKNS_5PatchISsSsEE
-FN:176,_ZNK7tagcoll9PatchListIiiE6outputIN3ept7debtags16PatchIntToStringINS_8InserterISsSsEEEEEEvT_
-FN:56,_ZN7tagcoll5PatchISsN3ept7debtags3TagEE3addERKSt3setIS3_St4lessIS3_ESaIS3_EE
-FN:66,_ZN7tagcoll5PatchISsN3ept7debtags3TagEE6removeERKSt3setIS3_St4lessIS3_ESaIS3_EE
-FN:77,_ZN7tagcoll5PatchISsN3ept7debtags3TagEE9mergeWithERKS4_
-FN:141,_ZN7tagcoll9PatchListISsN3ept7debtags3TagEE8addPatchERKNS_5PatchISsS3_EE
-FN:51,_ZN7tagcoll5PatchIiiE3addERKi
-FN:61,_ZN7tagcoll5PatchIiiE6removeERKi
-FN:56,_ZN7tagcoll5PatchIiiE3addERKSt3setIiSt4lessIiESaIiEE
-FN:66,_ZN7tagcoll5PatchIiiE6removeERKSt3setIiSt4lessIiESaIiEE
-FN:77,_ZN7tagcoll5PatchIiiE9mergeWithERKS1_
-FN:141,_ZN7tagcoll9PatchListIiiE8addPatchERKNS_5PatchIiiEE
-FN:188,_ZN7tagcoll8InserterIiiEaSERKNS_5PatchIiiEE
-FN:46,_ZN7tagcoll5PatchISsN3ept7debtags3TagEEC1ERKSsRKSt3setIS3_St4lessIS3_ESaIS3_EESD_
-FN:46,_ZN7tagcoll5PatchISsSsEC1ERKSsRKSt3setISsSt4lessISsESaISsEESA_
-FN:152,_ZN7tagcoll9PatchListIiiE16addPatchInvertedERKNS_5PatchIiiEE
-FN:158,_ZN7tagcoll9PatchListIiiE16addPatchInvertedERKS1_
-FN:100,_ZN7tagcoll5PatchIiiE15removeRedundantESt3setIiSt4lessIiESaIiEE
-FN:164,_ZN7tagcoll9PatchListIiiE15removeRedundantERKiRKSt3setIiSt4lessIiESaIiEE
-DA:44,0
-DA:45,0
-DA:46,2
-DA:49,0
-DA:51,0
-DA:54,0
-DA:55,0
-DA:56,0
-DA:59,0
-DA:60,0
-DA:61,0
-DA:64,0
-DA:65,0
-DA:66,0
-DA:69,0
-DA:70,0
-DA:77,0
-DA:79,0
-DA:80,0
-DA:81,0
-DA:100,0
-DA:104,0
-DA:106,0
-DA:107,0
-DA:124,0
-DA:126,0
-DA:127,3
-DA:141,0
-DA:152,0
-DA:158,0
-DA:164,0
-DA:176,0
-DA:186,0
-DA:188,0
-DA:190,0
-DA:191,0
-DA:196,0
-DA:198,0
-LF:38
-LH:2
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/patch.tcc
-FN:40,_ZN7tagcoll5PatchIiiEC1IN6wibble9SingletonIiEENS3_5EmptyIiEEEERKiRKT_RKT0_
-FN:40,_ZN7tagcoll5PatchIiiEC1IN6wibble5EmptyIiEENS3_9SingletonIiEEEERKiRKT_RKT0_
-DA:35,2
-DA:36,0
-DA:37,2
-DA:40,0
-DA:41,0
-DA:43,0
-DA:44,0
-DA:45,0
-DA:51,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:56,0
-DA:58,0
-DA:73,0
-DA:74,0
-DA:76,0
-DA:78,0
-DA:79,0
-DA:81,0
-DA:87,0
-DA:89,0
-DA:90,0
-DA:120,0
-DA:121,0
-DA:122,0
-DA:151,0
-DA:154,0
-DA:155,0
-DA:157,0
-BA:51,0
-BA:51,0
-BA:51,0
-BA:51,0
-BA:51,0
-BA:51,0
-BA:51,0
-BA:51,0
-BA:51,0
-BA:51,0
-BA:51,0
-BA:51,0
-BA:51,0
-BA:51,0
-BA:51,0
-BA:51,0
-BA:51,0
-BA:51,0
-BA:55,0
-BA:55,0
-BA:55,0
-BA:55,0
-BA:55,0
-BA:55,0
-BA:73,0
-BA:73,0
-BA:73,0
-BA:73,0
-BA:73,0
-BA:73,0
-BA:76,0
-BA:76,0
-BA:79,0
-BA:79,0
-BA:87,0
-BA:87,0
-BA:121,0
-BA:121,0
-BA:151,0
-BA:151,0
-LF:30
-LH:2
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/TextFormat.h
-FN:129,_ZN7tagcoll10textformat14PatchAssemblerIN3ept7debtags16PatchStringToIntINS_8InserterIiiEEEEEC1ERKS7_
-FN:136,_ZN7tagcoll10textformat14patchAssemblerIN3ept7debtags16PatchStringToIntINS_8InserterIiiEEEEEENS0_14PatchAssemblerIT_EERKS9_
-FN:142,_ZN7tagcoll10textformat10parsePatchIN3ept7debtags16PatchStringToIntINS_8InserterIiiEEEEEEvRNS_5input5InputET_
-DA:129,0
-DA:136,0
-DA:138,0
-DA:142,0
-DA:144,0
-DA:145,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/TextFormat.tcc
-FN:284,_Z41__static_initialization_and_destruction_0ii
-FN:284,_GLOBAL__I_debtags.cc
-FN:37,_ZL11printTagsetRKSt3setISsSt4lessISsESaISsEEP8_IO_FILE
-FN:180,_ZN7tagcoll10textformat14PatchAssemblerIN3ept7debtags16PatchStringToIntINS_8InserterIiiEEEEEaSISt3setISsSt4lessISsESaISsEEN6wibble5EmptyISsEEEERS8_RKSt4pairIT_T0_E
-FN:180,_ZN7tagcoll10textformat14PatchAssemblerIN3ept7debtags16PatchStringToIntINS_8InserterIiiEEEEEaSISt3setISsSt4lessISsESaISsEESE_EERS8_RKSt4pairIT_T0_E
-FN:122,_ZN7tagcoll10textformat5parseINS0_14PatchAssemblerIN3ept7debtags16PatchStringToIntINS_8InserterIiiEEEEEEEEvRNS_5input5InputET_
-DA:37,0
-DA:39,0
-DA:41,0
-DA:43,0
-DA:44,0
-DA:48,0
-DA:49,0
-DA:51,0
-DA:122,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:129,0
-DA:130,0
-DA:131,0
-DA:134,0
-DA:135,0
-DA:137,0
-DA:138,0
-DA:141,0
-DA:143,0
-DA:144,0
-DA:146,0
-DA:149,0
-DA:152,0
-DA:154,0
-DA:156,0
-DA:157,0
-DA:158,0
-DA:159,0
-DA:161,0
-DA:162,0
-DA:164,0
-DA:165,0
-DA:166,0
-DA:167,0
-DA:169,0
-DA:170,0
-DA:171,0
-DA:174,0
-DA:177,0
-DA:180,0
-DA:182,0
-DA:183,0
-DA:185,0
-DA:188,0
-DA:189,0
-DA:191,0
-DA:192,0
-DA:193,0
-DA:194,0
-DA:198,0
-DA:201,0
-DA:202,0
-DA:204,0
-DA:205,0
-DA:208,0
-DA:284,6
-BA:39,0
-BA:39,0
-BA:41,0
-BA:41,0
-BA:43,0
-BA:43,0
-BA:48,0
-BA:48,0
-BA:131,0
-BA:131,0
-BA:141,0
-BA:141,0
-BA:143,0
-BA:143,0
-BA:149,0
-BA:149,0
-BA:149,0
-BA:149,0
-BA:154,0
-BA:154,0
-BA:154,0
-BA:154,0
-BA:154,0
-BA:154,0
-BA:156,0
-BA:156,0
-BA:158,0
-BA:158,0
-BA:169,0
-BA:169,0
-BA:185,0
-BA:185,0
-BA:185,0
-BA:185,0
-BA:189,0
-BA:189,0
-BA:189,0
-BA:189,0
-BA:191,0
-BA:191,0
-BA:191,0
-BA:191,0
-BA:193,0
-BA:193,0
-BA:193,0
-BA:193,0
-BA:198,0
-BA:198,0
-BA:198,0
-BA:198,0
-BA:202,0
-BA:202,0
-BA:202,0
-BA:202,0
-BA:284,2
-BA:284,1
-BA:284,2
-BA:284,1
-LF:58
-LH:1
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/tag.cc
-FN:108,_ZNK3ept7debtags3Tag8fullnameERKSs
-FN:42,_ZNK3ept7debtags5Facet4nameERKSs
-FN:27,_ZN3ept7debtagsL8constgetERKSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEERS5_
-FN:130,_ZNK3ept7debtags3Tag15longDescriptionERKSs
-FN:119,_ZNK3ept7debtags3Tag16shortDescriptionERKSs
-FN:124,_ZNK3ept7debtags3Tag15longDescriptionEv
-FN:113,_ZNK3ept7debtags3Tag16shortDescriptionEv
-FN:102,_ZNK3ept7debtags3Tag8fullnameEv
-FN:36,_ZNK3ept7debtags5Facet4nameEv
-FN:97,_ZNK3ept7debtags3Tag4nameERKSs
-FN:91,_ZNK3ept7debtags3Tag4nameEv
-FN:84,_ZNK3ept7debtags3Tag5facetEv
-FN:76,_ZNK3ept7debtags5Facet4tagsEv
-FN:69,_ZNK3ept7debtags5Facet6hasTagERKSs
-FN:64,_ZNK3ept7debtags5Facet15longDescriptionERKSs
-FN:58,_ZNK3ept7debtags5Facet15longDescriptionEv
-FN:53,_ZNK3ept7debtags5Facet16shortDescriptionERKSs
-FN:47,_ZNK3ept7debtags5Facet16shortDescriptionEv
-DA:27,3898
-DA:29,3898
-DA:30,3898
-DA:31,4
-DA:33,3894
-DA:36,59
-DA:38,59
-DA:39,59
-DA:40,0
-DA:42,29
-DA:44,29
-DA:47,59
-DA:49,59
-DA:50,59
-DA:51,0
-DA:53,29
-DA:55,29
-DA:58,59
-DA:60,59
-DA:61,59
-DA:62,0
-DA:64,29
-DA:66,29
-DA:69,0
-DA:71,0
-DA:72,0
-DA:73,0
-DA:76,89
-DA:78,89
-DA:79,1
-DA:80,88
-DA:84,0
-DA:86,0
-DA:87,0
-DA:88,0
-DA:91,1243
-DA:93,1243
-DA:94,1243
-DA:95,0
-DA:97,620
-DA:99,620
-DA:102,1284
-DA:104,1284
-DA:105,1284
-DA:106,0
-DA:108,620
-DA:110,620
-DA:113,1242
-DA:115,1242
-DA:116,1242
-DA:117,0
-DA:119,620
-DA:121,620
-DA:124,1240
-DA:126,1240
-DA:127,1240
-DA:128,0
-DA:130,620
-DA:132,620
-BA:30,2
-BA:30,2
-BA:38,2
-BA:38,1
-BA:44,2
-BA:44,1
-BA:49,2
-BA:49,1
-BA:55,2
-BA:55,1
-BA:55,2
-BA:55,1
-BA:55,0
-BA:55,0
-BA:55,2
-BA:55,1
-BA:55,0
-BA:55,0
-BA:60,2
-BA:60,1
-BA:66,2
-BA:66,1
-BA:66,2
-BA:66,1
-BA:66,0
-BA:66,0
-BA:66,2
-BA:66,1
-BA:66,0
-BA:66,0
-BA:71,0
-BA:71,0
-BA:78,2
-BA:78,2
-BA:86,0
-BA:86,0
-BA:93,2
-BA:93,1
-BA:99,2
-BA:99,1
-BA:104,2
-BA:104,1
-BA:110,2
-BA:110,1
-BA:115,2
-BA:115,1
-BA:121,2
-BA:121,1
-BA:121,2
-BA:121,1
-BA:121,0
-BA:121,0
-BA:121,2
-BA:121,1
-BA:121,0
-BA:121,0
-BA:126,2
-BA:126,1
-BA:132,2
-BA:132,1
-BA:132,2
-BA:132,1
-BA:132,0
-BA:132,0
-BA:132,2
-BA:132,1
-BA:132,0
-BA:132,0
-LF:59
-LH:44
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/tag.h
-FN:80,_ZNK3ept7debtags5Facet5validEv
-FN:175,_ZN3ept7debtags3TagD1Ev
-FN:179,_ZNK3ept7debtags3TagltERKS1_
-FN:182,_ZNK3ept7debtags3Tag5validEv
-DA:80,353
-DA:175,0
-DA:179,0
-DA:182,0
-LF:4
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/vocabulary.h
-FN:64,_ZNK3ept7debtags10Vocabulary10FacetIndex4sizeEv
-FN:51,_ZNK3ept7debtags10Vocabulary10FacetIndex4itemEi
-FN:70,_ZNK3ept7debtags10Vocabulary10FacetIndex8firsttagEi
-FN:72,_ZNK3ept7debtags10Vocabulary10FacetIndex7lasttagEi
-FN:74,_ZNK3ept7debtags10Vocabulary10FacetIndex4nameEi
-FN:103,_ZNK3ept7debtags10Vocabulary8TagIndex4sizeEv
-FN:90,_ZNK3ept7debtags10Vocabulary8TagIndex4itemEi
-FN:109,_ZNK3ept7debtags10Vocabulary8TagIndex5facetEi
-FN:111,_ZNK3ept7debtags10Vocabulary8TagIndex4nameEi
-FN:269,_ZNK3ept7debtags10Vocabulary7tagNameEi
-FN:266,_ZNK3ept7debtags10Vocabulary9facetNameEi
-FN:193,_ZNK3ept7debtags10Vocabulary10facetByTagEi
-FN:230,_ZNK3ept7debtags10Vocabulary4tagsEi
-FN:165,_ZNK3ept7debtags10Vocabulary6hasTagERKSs
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:64,0
-DA:70,0
-DA:72,0
-DA:74,88
-DA:90,0
-DA:92,0
-DA:93,0
-DA:94,0
-DA:103,0
-DA:109,0
-DA:111,0
-DA:165,0
-DA:167,0
-DA:193,0
-DA:230,0
-DA:232,0
-DA:233,0
-DA:234,0
-DA:235,0
-DA:266,88
-DA:269,1904
-BA:53,0
-BA:53,0
-BA:53,0
-BA:53,0
-BA:53,0
-BA:53,0
-BA:64,0
-BA:64,0
-BA:70,0
-BA:70,0
-BA:72,0
-BA:72,0
-BA:74,2
-BA:74,1
-BA:92,0
-BA:92,0
-BA:92,0
-BA:92,0
-BA:92,0
-BA:92,0
-BA:103,0
-BA:103,0
-BA:109,0
-BA:109,0
-BA:111,0
-BA:111,0
-BA:233,0
-BA:233,0
-BA:233,0
-BA:233,0
-BA:233,0
-BA:233,0
-LF:25
-LH:3
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeIN3ept7debtags3TagEEED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:98,_ZNSaISt13_Rb_tree_nodeIN3ept7debtags3TagEEEC2Ev
-FN:106,_ZNSaIN3ept7debtags3TagEED1Ev
-FN:104,_ZNSaIN3ept7debtags3TagEEC1ISt13_Rb_tree_nodeIS1_EEERKSaIT_E
-DA:98,0
-DA:100,0
-DA:101,0
-DA:104,0
-DA:106,0
-LF:5
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:1534,_ZNKSs5c_strEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:606,_ZNKSs4sizeEv
-FN:1544,_ZNKSs4dataEv
-FN:392,_ZNSs10_S_compareEjj
-FN:1941,_ZNKSs7compareERKSs
-FN:2238,_ZStltIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:835,_ZNSs6appendEPKc
-FN:2121,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-DA:178,0
-DA:183,0
-DA:184,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:392,0
-DA:394,0
-DA:401,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:606,0
-DA:607,0
-DA:835,0
-DA:838,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:1941,0
-DA:1943,0
-DA:1944,0
-DA:1945,0
-DA:1947,0
-DA:1948,0
-DA:1949,0
-DA:1950,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2121,0
-DA:2123,0
-DA:2124,0
-DA:2125,0
-DA:2238,0
-DA:2239,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:1948,0
-BA:1948,0
-LF:54
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-DA:257,0
-DA:258,0
-DA:261,0
-DA:262,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:188,_ZSt3minIjERKT_S2_S2_
-DA:188,0
-DA:193,0
-DA:194,0
-DA:195,0
-BA:193,0
-BA:193,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_function.h
-FN:469,_ZNKSt9_IdentityIN3ept7debtags3TagEEclERKS2_
-FN:229,_ZNKSt4lessIN3ept7debtags3TagEEclERKS2_S5_
-FN:482,_ZNKSt10_Select1stISt4pairIKSsSsEEclERKS2_
-FN:229,_ZNKSt4lessISsEclERKSsS2_
-DA:229,0
-DA:230,0
-DA:469,0
-DA:470,0
-DA:482,0
-DA:483,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_map.h
-FN:302,_ZNKSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEE3endEv
-FN:629,_ZNKSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEE4findERS3_
-DA:302,3898
-DA:303,3898
-DA:629,3898
-DA:630,3898
-LF:4
-LH:4
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_pair.h
-FN:88,_ZNSt4pairISt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEbEC1ERKS4_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIN3ept7debtags3TagEEbEC1ERKS4_RKb
-DA:88,0
-DA:89,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_set.h
-FN:141,_ZNSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EEC1Ev
-FN:93,_ZNSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EED1Ev
-FN:378,_ZNSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EE6insertERKS2_
-DA:93,0
-DA:141,0
-DA:142,0
-DA:378,0
-DA:381,0
-DA:382,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_tree.h
-FN:285,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKSsSsEEeqERKS3_
-FN:251,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKSsSsEEptEv
-FN:452,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_M_beginEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEC1ERKSt17_Rb_tree_iteratorIS2_E
-FN:398,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13_Rb_tree_implIS6_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:463,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE6_M_endEv
-FN:168,_ZNSt17_Rb_tree_iteratorIN3ept7debtags3TagEEC1EPSt13_Rb_tree_nodeIS2_E
-FN:596,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE5beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorIN3ept7debtags3TagEEeqERKS3_
-FN:347,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE21_M_get_Node_allocatorEv
-FN:456,_ZNKSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_M_beginEv
-FN:467,_ZNKSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE6_M_endEv
-FN:240,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsSsEEC1EPKSt13_Rb_tree_nodeIS2_E
-FN:614,_ZNKSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE3endEv
-FN:415,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13_Rb_tree_implIS6_Lb0EE13_M_initializeEv
-FN:471,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_S_valueEPKSt13_Rb_tree_nodeIS2_E
-FN:475,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE6_S_keyEPKSt13_Rb_tree_nodeIS2_E
-FN:495,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE6_S_keyEPKSt18_Rb_tree_node_base
-FN:483,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE7_S_leftEPKSt18_Rb_tree_node_base
-FN:491,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_S_rightEPKSt18_Rb_tree_node_base
-FN:495,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE6_S_keyEPKSt18_Rb_tree_node_base
-FN:403,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13_Rb_tree_implIS6_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EEC1Ev
-FN:471,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_S_valueEPKSt13_Rb_tree_nodeIS2_E
-FN:475,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE6_S_keyEPKSt13_Rb_tree_nodeIS2_E
-FN:351,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13get_allocatorEv
-FN:970,_ZNKSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE14_M_lower_boundEPKSt13_Rb_tree_nodeIS2_ESC_RS1_
-FN:1403,_ZNKSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE4findERS1_
-FN:360,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS2_E
-FN:388,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS2_E
-FN:936,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_M_eraseEPSt13_Rb_tree_nodeIS2_E
-FN:584,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EED1Ev
-FN:195,_ZNSt17_Rb_tree_iteratorIN3ept7debtags3TagEEmmEv
-FN:356,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE14_M_create_nodeERKS2_
-FN:846,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE10_M_insert_EPKSt18_Rb_tree_node_baseSB_RKS2_
-FN:1133,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE16_M_insert_uniqueERKS2_
-DA:168,0
-DA:169,0
-DA:195,0
-DA:197,0
-DA:198,0
-DA:210,0
-DA:211,0
-DA:240,11698
-DA:241,11698
-DA:243,0
-DA:244,0
-DA:251,16354
-DA:252,16354
-DA:285,7796
-DA:286,7796
-DA:347,0
-DA:348,0
-DA:351,0
-DA:352,0
-DA:356,0
-DA:357,0
-DA:360,0
-DA:361,0
-DA:364,0
-DA:366,0
-DA:368,0
-DA:369,0
-DA:371,0
-DA:372,0
-DA:374,0
-DA:388,0
-DA:390,0
-DA:391,0
-DA:392,0
-DA:398,0
-DA:403,0
-DA:405,0
-DA:406,0
-DA:415,0
-DA:417,0
-DA:418,0
-DA:419,0
-DA:420,0
-DA:421,0
-DA:452,0
-DA:453,0
-DA:456,0
-DA:459,0
-DA:463,0
-DA:464,0
-DA:467,3898
-DA:468,3898
-DA:471,0
-DA:472,0
-DA:475,0
-DA:476,0
-DA:479,0
-DA:480,0
-DA:483,0
-DA:484,0
-DA:487,0
-DA:488,0
-DA:491,0
-DA:492,0
-DA:495,0
-DA:496,0
-DA:499,0
-DA:500,0
-DA:562,0
-DA:584,0
-DA:585,0
-DA:596,0
-DA:599,0
-DA:614,7800
-DA:617,7800
-DA:846,0
-DA:850,0
-DA:852,0
-DA:854,0
-DA:857,0
-DA:858,0
-DA:936,0
-DA:939,0
-DA:941,0
-DA:942,0
-DA:943,0
-DA:944,0
-DA:946,0
-DA:970,3898
-DA:972,15867
-DA:973,8071
-DA:974,5830
-DA:976,2241
-DA:977,3898
-DA:1133,0
-DA:1135,0
-DA:1136,0
-DA:1137,0
-DA:1138,0
-DA:1140,0
-DA:1141,0
-DA:1142,0
-DA:1144,0
-DA:1145,0
-DA:1147,0
-DA:1148,0
-DA:1150,0
-DA:1152,0
-DA:1153,0
-DA:1154,0
-DA:1403,3898
-DA:1405,3898
-DA:1408,3898
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:939,0
-BA:939,0
-BA:972,2
-BA:972,2
-BA:973,2
-BA:973,2
-BA:1138,0
-BA:1138,0
-BA:1142,0
-BA:1142,0
-BA:1145,0
-BA:1145,0
-BA:1147,0
-BA:1147,0
-BA:1152,0
-BA:1152,0
-BA:1408,2
-BA:1408,2
-BA:1408,1
-BA:1408,2
-LF:113
-LH:19
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEED2Ev
-FN:118,_ZN9__gnu_cxx13new_allocatorIN3ept7debtags3TagEE7destroyEPS3_
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIN3ept7debtags3TagEED2Ev
-FN:107,_ZN9__gnu_cxx13new_allocatorIN3ept7debtags3TagEE9constructEPS3_RKS3_
-FN:69,_ZN9__gnu_cxx13new_allocatorIN3ept7debtags3TagEEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEE8max_sizeEv
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEE10deallocateEPS5_j
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEE8allocateEjPKv
-DA:69,0
-DA:71,0
-DA:76,0
-DA:87,0
-DA:89,0
-DA:90,0
-DA:92,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:107,0
-DA:108,0
-DA:118,0
-BA:89,0
-BA:89,0
-BA:108,0
-BA:108,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-DA:105,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/stdexcept
-FN:97,_ZNSt12out_of_rangeD1Ev
-FN:97,_ZNSt12out_of_rangeD0Ev
-DA:97,1
-BA:97,1
-BA:97,2
-BA:97,0
-BA:97,0
-LF:1
-LH:1
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/tag.h
-FN:66,_ZN3ept7debtags5FacetC1EPKNS0_10VocabularyEi
-FN:169,_ZN3ept7debtags3TagC1EPKNS0_10VocabularyEi
-DA:66,120
-DA:169,745056
-LF:2
-LH:2
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/vocabulary.cc
-FN:158,_ZNK3ept7debtags10Vocabulary9facetByIDEi
-FN:163,_ZNK3ept7debtags10Vocabulary7tagByIDEi
-FN:228,_Z41__static_initialization_and_destruction_0ii
-FN:228,_GLOBAL__I_vocabulary.cc
-FN:189,_ZNK3ept7debtags10Vocabulary12tagShortNameEi
-FN:168,_ZNK3ept7debtags10Vocabulary11parseVocBufERSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEEjj
-FN:213,_ZNK3ept7debtags10Vocabulary7tagDataEi
-FN:199,_ZNK3ept7debtags10Vocabulary9facetDataEi
-FN:149,_ZN3ept7debtags10VocabularyD1Ev
-FN:149,_ZN3ept7debtags10VocabularyD2Ev
-FN:112,_ZN3ept7debtags10VocabularyC1Ev
-FN:112,_ZN3ept7debtags10VocabularyC2Ev
-FN:41,_ZNK3ept7debtags10Vocabulary10FacetIndex2idEPKc
-FN:64,_ZN3ept7debtags6tagcmpEPKcS2_
-FN:89,_ZNK3ept7debtags10Vocabulary8TagIndex2idEPKc
-DA:41,9
-DA:43,9
-DA:47,9
-DA:48,62
-DA:50,44
-DA:51,44
-DA:52,16
-DA:54,28
-DA:57,9
-DA:59,3
-DA:61,6
-DA:64,1105769
-DA:66,1105769
-DA:67,1105769
-DA:68,1105766
-DA:69,1105766
-DA:72,1105766
-DA:73,1105766
-DA:74,1105766
-DA:76,1105766
-DA:77,1105766
-DA:79,454813
-DA:81,650953
-DA:83,639402
-DA:86,11551
-DA:89,106377
-DA:91,106377
-DA:95,106377
-DA:96,1212130
-DA:98,999376
-DA:99,999376
-DA:100,432389
-DA:102,566987
-DA:105,106377
-DA:107,132
-DA:109,106245
-DA:112,31
-DA:113,31
-DA:115,31
-DA:116,31
-DA:118,31
-DA:120,2
-DA:121,2
-DA:124,29
-DA:126,29
-DA:129,29
-DA:130,29
-DA:135,29
-DA:136,29
-DA:137,0
-DA:139,29
-DA:140,29
-DA:141,0
-DA:142,29
-DA:145,29
-DA:146,0
-DA:147,0
-DA:149,31
-DA:152,31
-DA:153,29
-DA:154,31
-DA:155,29
-DA:156,31
-DA:158,120
-DA:160,120
-DA:163,745056
-DA:165,745056
-DA:168,1301
-DA:171,1301
-DA:172,1301
-DA:173,1301
-DA:174,1301
-DA:176,1301
-DA:178,1301
-DA:179,2602
-DA:181,1298
-DA:182,1298
-DA:183,849
-DA:185,449
-DA:186,1301
-DA:187,1301
-DA:189,1863
-DA:191,1863
-DA:192,1863
-DA:193,1863
-DA:194,1863
-DA:196,0
-DA:199,176
-DA:201,176
-DA:204,176
-DA:205,59
-DA:207,176
-DA:208,59
-DA:210,176
-DA:213,3722
-DA:215,3722
-DA:218,3722
-DA:219,1242
-DA:221,3722
-DA:222,1242
-DA:224,3722
-DA:228,6
-BA:43,1
-BA:43,2
-BA:48,2
-BA:48,2
-BA:51,2
-BA:51,2
-BA:57,2
-BA:57,1
-BA:57,2
-BA:57,2
-BA:57,2
-BA:57,2
-BA:67,2
-BA:67,2
-BA:69,1
-BA:69,2
-BA:74,2
-BA:74,2
-BA:77,2
-BA:77,2
-BA:81,2
-BA:81,2
-BA:86,2
-BA:86,2
-BA:91,1
-BA:91,2
-BA:96,2
-BA:96,2
-BA:99,2
-BA:99,2
-BA:105,2
-BA:105,1
-BA:105,2
-BA:105,2
-BA:105,2
-BA:105,2
-BA:118,2
-BA:118,2
-BA:118,0
-BA:118,0
-BA:136,1
-BA:136,2
-BA:136,0
-BA:136,0
-BA:140,1
-BA:140,2
-BA:140,0
-BA:140,0
-BA:145,1
-BA:145,2
-BA:145,0
-BA:145,0
-BA:146,2
-BA:146,2
-BA:146,2
-BA:146,2
-BA:146,0
-BA:146,0
-BA:146,0
-BA:146,0
-BA:152,2
-BA:152,2
-BA:152,0
-BA:152,0
-BA:154,2
-BA:154,2
-BA:154,0
-BA:154,0
-BA:179,2
-BA:179,2
-BA:182,2
-BA:182,2
-BA:193,2
-BA:193,1
-BA:201,1
-BA:201,2
-BA:204,2
-BA:204,2
-BA:207,2
-BA:207,2
-BA:215,1
-BA:215,2
-BA:218,2
-BA:218,2
-BA:221,2
-BA:221,2
-BA:228,2
-BA:228,1
-BA:228,2
-BA:228,1
-LF:102
-LH:97
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/vocabulary.h
-FN:64,_ZNK3ept7debtags10Vocabulary10FacetIndex4sizeEv
-FN:51,_ZNK3ept7debtags10Vocabulary10FacetIndex4itemEi
-FN:66,_ZNK3ept7debtags10Vocabulary10FacetIndex6offsetEi
-FN:68,_ZNK3ept7debtags10Vocabulary10FacetIndex4sizeEi
-FN:103,_ZNK3ept7debtags10Vocabulary8TagIndex4sizeEv
-FN:90,_ZNK3ept7debtags10Vocabulary8TagIndex4itemEi
-FN:105,_ZNK3ept7debtags10Vocabulary8TagIndex6offsetEi
-FN:107,_ZNK3ept7debtags10Vocabulary8TagIndex4sizeEi
-FN:111,_ZNK3ept7debtags10Vocabulary8TagIndex4nameEi
-FN:59,_ZN3ept7debtags10Vocabulary10FacetIndexC1Ev
-FN:98,_ZN3ept7debtags10Vocabulary8TagIndexC1Ev
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:59,31
-DA:64,0
-DA:66,59
-DA:68,59
-DA:90,1112004
-DA:92,1112004
-DA:93,1112004
-DA:94,0
-DA:98,31
-DA:103,0
-DA:105,1242
-DA:107,1242
-DA:111,3767
-BA:53,0
-BA:53,0
-BA:53,0
-BA:53,0
-BA:53,0
-BA:53,0
-BA:64,0
-BA:64,0
-BA:66,2
-BA:66,1
-BA:68,2
-BA:68,1
-BA:92,2
-BA:92,1
-BA:92,2
-BA:92,1
-BA:92,2
-BA:92,1
-BA:103,0
-BA:103,0
-BA:105,2
-BA:105,1
-BA:107,2
-BA:107,1
-BA:111,2
-BA:111,1
-LF:17
-LH:10
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/exception.h
-FN:190,_ZNK6wibble9exception7Generic4typeEv
-FN:406,_ZNK6wibble9exception6System4codeEv
-FN:428,_ZNK6wibble9exception4File4typeEv
-FN:137,_ZN6wibble9exception7ContextD2Ev
-FN:213,_ZNK6wibble9exception7Generic4whatEv
-FN:193,_ZNK6wibble9exception7Generic4descEv
-FN:154,_ZNK6wibble9exception7Context13formatContextEv
-FN:205,_ZNK6wibble9exception7Generic8fullInfoEv
-FN:430,_ZNK6wibble9exception4File4descEv
-FN:187,_ZN6wibble9exception7GenericD2Ev
-FN:395,_ZN6wibble9exception6SystemD2Ev
-FN:424,_ZN6wibble9exception4FileC1ERKSsS3_
-FN:426,_ZN6wibble9exception4FileD0Ev
-FN:426,_ZN6wibble9exception4FileD1Ev
-FN:187,_ZN6wibble9exception7GenericD0Ev
-FN:187,_ZN6wibble9exception7GenericD1Ev
-DA:137,0
-DA:154,0
-DA:155,0
-DA:156,0
-DA:157,0
-DA:159,0
-DA:161,0
-DA:162,0
-DA:163,0
-DA:187,0
-DA:190,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:205,0
-DA:206,0
-DA:207,0
-DA:209,0
-DA:210,0
-DA:213,0
-DA:395,0
-DA:406,0
-DA:424,0
-DA:425,0
-DA:426,0
-DA:428,0
-DA:430,0
-BA:156,0
-BA:156,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:207,0
-BA:207,0
-BA:395,0
-BA:395,0
-BA:426,0
-BA:426,0
-BA:426,0
-BA:426,0
-LF:27
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsSsEEED2Ev
-FN:100,_ZNSaIcEC1ERKS_
-FN:100,_ZNSaIcEC2ERKS_
-FN:106,_ZNSaISsED2Ev
-FN:106,_ZNSaISt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEEED2Ev
-FN:98,_ZNSaISt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEEEC2Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsSsEEEC2Ev
-FN:106,_ZNSaISt4pairIKSsSsEED1Ev
-FN:100,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsSsEEEC2ERKS4_
-FN:104,_ZNSaISt4pairIKSsSsEEC1ISt13_Rb_tree_nodeIS1_EEERKSaIT_E
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,2708
-DA:100,9224
-DA:101,9224
-DA:104,0
-DA:106,62
-DA:118,0
-DA:119,0
-LF:7
-LH:4
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:276,0
-BA:276,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:1534,_ZNKSs5c_strEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:612,_ZNKSs6lengthEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:1551,_ZNKSs13get_allocatorEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:392,_ZNSs10_S_compareEjj
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:306,_ZNKSs8_M_checkEjPKc
-FN:1923,_ZNKSs6substrEjj
-FN:1941,_ZNKSs7compareERKSs
-FN:2238,_ZStltIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:501,_ZNSsaSERKSs
-FN:835,_ZNSs6appendEPKc
-FN:2121,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:306,0
-DA:308,0
-DA:309,0
-DA:310,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:392,0
-DA:394,0
-DA:401,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:612,0
-DA:613,0
-DA:686,0
-DA:687,0
-DA:835,0
-DA:838,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:1923,0
-DA:1925,0
-DA:1941,0
-DA:1943,0
-DA:1944,0
-DA:1945,0
-DA:1947,0
-DA:1948,0
-DA:1949,0
-DA:1950,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2121,0
-DA:2123,0
-DA:2124,0
-DA:2125,0
-DA:2238,0
-DA:2239,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:308,0
-BA:308,0
-BA:341,0
-BA:341,0
-BA:1948,0
-BA:1948,0
-LF:86
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-DA:245,0
-DA:246,0
-DA:257,0
-DA:258,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb0EE3__bES7_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb1EE3__bES7_
-FN:268,_ZNSt12__niter_baseISt16ostream_iteratorISscSt11char_traitsIcEELb0EE3__bES3_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:188,_ZSt3minIjERKT_S2_S2_
-FN:286,_ZNSt12__miter_baseIPSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEELb0EE3__bES8_
-FN:268,_ZNSt12__niter_baseIPSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEELb0EE3__bES8_
-FN:539,_ZNSt20__copy_move_backwardILb0ELb0ESt26random_access_iterator_tagE13__copy_move_bIPSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEESB_EET0_T_SD_SC_
-FN:579,_ZSt22__copy_move_backward_aILb0EPSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEES8_ET1_T0_SA_S9_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEES8_ET1_T0_SA_S9_
-FN:624,_ZSt13copy_backwardIPSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEES8_ET0_T_SA_S9_
-FN:683,_ZSt8__fill_aIPSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEES7_EN9__gnu_cxx11__enable_ifIXntsrSt11__is_scalarIT0_E7__valueEvE6__typeET_SG_RKSC_
-FN:724,_ZSt4fillIPSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEES7_EvT_S9_RKT0_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPKSsSt16ostream_iteratorISscSt11char_traitsIcEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPKSsSt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_SD_SC_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET0_T_SD_SC_
-DA:188,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:210,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:268,2528
-DA:269,2528
-DA:276,0
-DA:277,0
-DA:286,0
-DA:287,0
-DA:337,0
-DA:340,0
-DA:342,0
-DA:343,0
-DA:344,0
-DA:346,0
-DA:385,0
-DA:393,0
-DA:396,0
-DA:430,0
-DA:435,0
-DA:456,0
-DA:466,0
-DA:539,0
-DA:542,0
-DA:543,0
-DA:544,0
-DA:579,0
-DA:587,0
-DA:592,0
-DA:597,0
-DA:602,0
-DA:624,0
-DA:636,0
-DA:683,1264
-DA:685,1264
-DA:686,0
-DA:687,1264
-DA:724,1264
-DA:731,1264
-DA:733,1264
-BA:193,0
-BA:193,0
-BA:215,0
-BA:215,0
-BA:340,0
-BA:340,0
-BA:542,0
-BA:542,0
-BA:685,1
-BA:685,2
-LF:45
-LH:8
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-FN:75,_ZSt10_ConstructISt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEES7_EvPT_RKT0_
-FN:87,_ZSt8_DestroyISt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEEEvPT_
-FN:97,_ZSt8_DestroyIPSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEEEvT_S9_
-FN:126,_ZSt8_DestroyIPSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEES7_EvT_S9_RSaIT0_E
-DA:75,1930
-DA:79,1930
-DA:80,1930
-DA:87,4039
-DA:88,4039
-DA:97,99
-DA:101,4138
-DA:103,4039
-DA:104,99
-DA:126,99
-DA:128,99
-DA:129,99
-BA:79,2
-BA:79,1
-BA:101,0
-BA:101,0
-BA:101,2
-BA:101,2
-LF:12
-LH:12
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_function.h
-FN:482,_ZNKSt10_Select1stISt4pairIKSsSsEEclERKS2_
-FN:229,_ZNKSt4lessISsEclERKSsS2_
-DA:229,0
-DA:230,0
-DA:482,52476
-DA:483,52476
-LF:4
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEC1ERKS2_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEESt6vectorIS8_SaIS8_EEEC1ERKS9_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEESt6vectorIS8_SaIS8_EEE4baseEv
-FN:846,_ZN9__gnu_cxxmiIPSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEESt6vectorIS8_SaIS8_EEEENS_17__normal_iteratorIT_T0_E15difference_typeERKSG_SJ_
-DA:683,2565
-DA:747,5130
-DA:748,5130
-DA:769,0
-DA:770,0
-DA:846,1264
-DA:847,1264
-LF:7
-LH:5
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,0
-DA:166,0
-DA:167,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_map.h
-FN:384,_ZNKSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEE5emptyEv
-FN:590,_ZNKSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEE8key_compEv
-FN:293,_ZNSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEE3endEv
-FN:155,_ZNSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEEC1Ev
-FN:175,_ZNSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEEC1ERKS6_
-FN:239,_ZNSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEEaSERKS6_
-FN:92,_ZNSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEED1Ev
-FN:656,_ZNSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEE11lower_boundERS3_
-FN:495,_ZNSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEE6insertESt17_Rb_tree_iteratorIS4_ERKS4_
-FN:411,_ZNSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEEixERS3_
-DA:92,6642
-DA:155,1339
-DA:156,1339
-DA:175,5303
-DA:176,5303
-DA:239,0
-DA:241,0
-DA:242,0
-DA:293,16367
-DA:294,16367
-DA:384,3898
-DA:385,3898
-DA:411,4905
-DA:416,4905
-DA:418,4905
-DA:419,2841
-DA:420,4905
-DA:495,2841
-DA:496,2841
-DA:590,2067
-DA:591,2067
-DA:656,4905
-DA:657,4905
-BA:418,2
-BA:418,2
-BA:418,2
-BA:418,2
-BA:418,2
-BA:418,2
-LF:23
-LH:20
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_pair.h
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIS_IKSsSsEEbEC1ERKS3_RKb
-FN:73,_ZNSt4pairIKSsSsEC1ERKS1_
-FN:73,_ZNSt4pairIKSsSsED1Ev
-FN:88,_ZNSt4pairIKSsSsEC1ERS0_S2_
-DA:73,16526
-DA:88,11239
-DA:89,11239
-LF:3
-LH:3
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_tree.h
-FN:103,_ZNSt18_Rb_tree_node_base10_S_minimumEPS_
-FN:117,_ZNSt18_Rb_tree_node_base10_S_maximumEPS_
-FN:452,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_M_beginEv
-FN:172,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsSsEEdeEv
-FN:210,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsSsEEeqERKS3_
-FN:637,_ZNKSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE5emptyEv
-FN:398,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE13_Rb_tree_implIS6_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:592,_ZNKSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE8key_compEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsSsEEC1ERKSt17_Rb_tree_iteratorIS2_E
-FN:347,_ZNKSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE21_M_get_Node_allocatorEv
-FN:432,_ZNKSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE7_M_rootEv
-FN:456,_ZNKSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_M_beginEv
-FN:463,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE6_M_endEv
-FN:428,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE7_M_rootEv
-FN:503,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE10_S_minimumEPSt18_Rb_tree_node_base
-FN:436,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE11_M_leftmostEv
-FN:511,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE10_S_maximumEPSt18_Rb_tree_node_base
-FN:444,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE12_M_rightmostEv
-FN:415,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE13_Rb_tree_implIS6_Lb0EE13_M_initializeEv
-FN:168,_ZNSt17_Rb_tree_iteratorISt4pairIKSsSsEEC1EPSt13_Rb_tree_nodeIS2_E
-FN:610,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE3endEv
-FN:641,_ZNKSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE4sizeEv
-FN:491,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_S_rightEPKSt18_Rb_tree_node_base
-FN:483,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE7_S_leftEPKSt18_Rb_tree_node_base
-FN:403,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE13_Rb_tree_implIS6_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EEC1Ev
-FN:495,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE6_S_keyEPKSt18_Rb_tree_node_base
-FN:596,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE5beginEv
-FN:408,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE13_Rb_tree_implIS6_Lb0EEC1ERKS6_RKSaISt13_Rb_tree_nodeIS2_EE
-FN:351,_ZNKSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE13get_allocatorEv
-FN:471,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_S_valueEPKSt13_Rb_tree_nodeIS2_E
-FN:475,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE6_S_keyEPKSt13_Rb_tree_nodeIS2_E
-FN:356,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE11_M_get_nodeEv
-FN:360,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS2_E
-FN:364,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE14_M_create_nodeERKS2_
-FN:378,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE13_M_clone_nodeEPKSt13_Rb_tree_nodeIS2_E
-FN:388,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS2_E
-FN:936,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_M_eraseEPSt13_Rb_tree_nodeIS2_E
-FN:900,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE7_M_copyEPKSt13_Rb_tree_nodeIS2_EPSA_
-FN:568,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EEC1ERKS8_
-FN:695,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE5clearEv
-FN:824,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EEaSERKS8_
-FN:584,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EED1Ev
-FN:954,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE14_M_lower_boundEPSt13_Rb_tree_nodeIS2_ESB_RS1_
-FN:715,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE11lower_boundERS1_
-FN:270,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsSsEEmmEv
-FN:255,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsSsEEppEv
-FN:846,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE10_M_insert_EPKSt18_Rb_tree_node_baseSB_RKS2_
-FN:195,_ZNSt17_Rb_tree_iteratorISt4pairIKSsSsEEmmEv
-FN:1133,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE16_M_insert_uniqueERKS2_
-FN:1178,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE17_M_insert_unique_ESt23_Rb_tree_const_iteratorIS2_ERKS2_
-DA:103,0
-DA:105,0
-DA:106,0
-DA:117,0
-DA:119,0
-DA:120,0
-DA:168,59969
-DA:169,59969
-DA:172,6972
-DA:173,6972
-DA:195,54
-DA:197,54
-DA:198,54
-DA:210,16799
-DA:211,16799
-DA:243,20820
-DA:244,20820
-DA:255,0
-DA:257,0
-DA:258,0
-DA:270,0
-DA:272,0
-DA:273,0
-DA:347,0
-DA:348,0
-DA:351,0
-DA:352,0
-DA:356,16526
-DA:357,16526
-DA:360,0
-DA:361,0
-DA:364,16526
-DA:366,16526
-DA:368,16526
-DA:369,0
-DA:371,0
-DA:372,0
-DA:374,16526
-DA:378,6591
-DA:380,6591
-DA:381,6591
-DA:382,6591
-DA:383,6591
-DA:384,6591
-DA:388,0
-DA:390,0
-DA:391,0
-DA:392,0
-DA:398,0
-DA:403,2646
-DA:405,2646
-DA:406,2646
-DA:408,9224
-DA:410,9224
-DA:411,9224
-DA:415,11870
-DA:417,11870
-DA:418,11870
-DA:419,11870
-DA:420,11870
-DA:421,11870
-DA:428,9581
-DA:429,9581
-DA:432,9224
-DA:433,9224
-DA:436,5372
-DA:437,5372
-DA:444,8431
-DA:445,8431
-DA:452,0
-DA:453,0
-DA:456,6007
-DA:459,6007
-DA:463,38599
-DA:464,38599
-DA:471,25644
-DA:472,25644
-DA:475,25644
-DA:476,25644
-DA:479,0
-DA:480,0
-DA:483,12421
-DA:484,12421
-DA:487,0
-DA:488,0
-DA:491,4554
-DA:492,4554
-DA:495,15087
-DA:496,15087
-DA:499,15087
-DA:500,15087
-DA:503,2109
-DA:504,2109
-DA:511,2109
-DA:512,2109
-DA:562,2646
-DA:568,9224
-DA:569,9224
-DA:571,9224
-DA:573,2109
-DA:574,2109
-DA:575,2109
-DA:576,2109
-DA:578,9224
-DA:584,0
-DA:585,0
-DA:592,2067
-DA:593,2067
-DA:596,10599
-DA:599,10599
-DA:610,22226
-DA:611,22226
-DA:637,3898
-DA:638,3898
-DA:641,2838
-DA:642,2838
-DA:695,3254
-DA:697,3254
-DA:698,3254
-DA:699,3254
-DA:700,3254
-DA:701,3254
-DA:702,3254
-DA:715,4905
-DA:716,4905
-DA:824,0
-DA:826,0
-DA:829,0
-DA:830,0
-DA:831,0
-DA:833,0
-DA:834,0
-DA:835,0
-DA:836,0
-DA:839,0
-DA:846,9935
-DA:850,9935
-DA:852,9935
-DA:854,9935
-DA:857,9935
-DA:858,9935
-DA:900,4422
-DA:903,4422
-DA:904,4422
-DA:908,4422
-DA:909,2313
-DA:910,4422
-DA:911,4422
-DA:913,11013
-DA:915,2169
-DA:916,2169
-DA:917,2169
-DA:918,2169
-DA:919,0
-DA:920,2169
-DA:921,2169
-DA:924,0
-DA:926,0
-DA:927,0
-DA:929,4422
-DA:936,0
-DA:939,0
-DA:941,0
-DA:942,0
-DA:943,0
-DA:944,0
-DA:946,0
-DA:954,8811
-DA:956,30825
-DA:957,13203
-DA:958,7251
-DA:960,5952
-DA:961,8811
-DA:1133,8398
-DA:1135,8398
-DA:1136,8398
-DA:1137,8398
-DA:1138,21166
-DA:1140,4370
-DA:1141,4370
-DA:1142,4370
-DA:1144,8398
-DA:1145,8398
-DA:1147,7988
-DA:1148,7934
-DA:1150,54
-DA:1152,464
-DA:1153,464
-DA:1154,0
-DA:1178,2841
-DA:1181,2841
-DA:1183,2838
-DA:1186,1534
-DA:1188,1304
-DA:1190,3
-DA:1194,3
-DA:1195,3
-DA:1196,3
-DA:1197,0
-DA:1200,0
-DA:1201,0
-DA:1204,0
-DA:1207,0
-DA:1209,0
-DA:1213,0
-DA:1214,0
-DA:1215,0
-DA:1216,0
-DA:1219,0
-DA:1220,0
-DA:1222,0
-DA:1225,0
-DA:1230,0
-BA:105,0
-BA:105,0
-BA:119,0
-BA:119,0
-BA:571,2
-BA:571,2
-BA:826,0
-BA:826,0
-BA:831,0
-BA:831,0
-BA:850,2
-BA:850,2
-BA:850,2
-BA:850,2
-BA:850,2
-BA:850,2
-BA:908,2
-BA:908,2
-BA:913,2
-BA:913,2
-BA:918,1
-BA:918,2
-BA:939,0
-BA:939,0
-BA:956,2
-BA:956,2
-BA:957,2
-BA:957,2
-BA:1138,2
-BA:1138,2
-BA:1142,2
-BA:1142,2
-BA:1145,2
-BA:1145,2
-BA:1147,2
-BA:1147,2
-BA:1152,2
-BA:1152,1
-BA:1181,2
-BA:1181,2
-BA:1183,2
-BA:1183,2
-BA:1183,2
-BA:1183,1
-BA:1183,2
-BA:1183,2
-BA:1190,2
-BA:1190,1
-BA:1195,2
-BA:1195,1
-BA:1197,0
-BA:1197,0
-BA:1200,0
-BA:1200,0
-BA:1209,0
-BA:1209,0
-BA:1214,0
-BA:1214,0
-BA:1216,0
-BA:1216,0
-BA:1219,0
-BA:1219,0
-LF:213
-LH:142
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:186,_ZNSt22__uninitialized_fill_nILb0EE20uninitialized_fill_nIPSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEEjS9_EEvT_T0_RKT1_
-FN:223,_ZSt20uninitialized_fill_nIPSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEEjS7_EvT_T0_RKT1_
-FN:322,_ZSt24__uninitialized_fill_n_aIPSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEEjS7_S7_EvT_T0_RKT1_RSaIT2_E
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyIPSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEESA_EET0_T_SC_SB_
-FN:113,_ZSt18uninitialized_copyIPSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEES8_ET0_T_SA_S9_
-FN:261,_ZSt22__uninitialized_copy_aIPSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEES8_S7_ET0_T_SA_S9_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEES8_SaIS7_EET0_T_SB_SA_RT1_
-DA:73,1338
-DA:75,1338
-DA:78,3447
-DA:79,2109
-DA:81,1338
-DA:83,0
-DA:85,0
-DA:86,0
-DA:113,1338
-DA:122,1338
-DA:186,1301
-DA:188,1301
-DA:191,3231
-DA:192,1930
-DA:194,0
-DA:196,0
-DA:197,0
-DA:199,1301
-DA:223,1301
-DA:228,1301
-DA:230,1301
-DA:261,1338
-DA:262,1338
-DA:268,1338
-DA:272,1338
-DA:322,1301
-DA:323,1301
-BA:78,2
-BA:78,2
-BA:79,2
-BA:79,1
-BA:191,2
-BA:191,2
-LF:27
-LH:21
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:484,_ZNKSt6vectorISt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEESaIS7_EE4sizeEv
-FN:562,_ZNSt6vectorISt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEESaIS7_EEixEj
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:404,_ZNKSt6vectorISsSaISsEE3endEv
-FN:386,_ZNKSt6vectorISsSaISsEE5beginEv
-FN:97,_ZNSt12_Vector_baseISt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEESaIS7_EE19_M_get_Tp_allocatorEv
-FN:526,_ZNKSt6vectorISsSaISsEE5emptyEv
-FN:395,_ZNSt6vectorISt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEESaIS7_EE3endEv
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:79,_ZNSt12_Vector_baseISt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEESaIS7_EE12_Vector_implD1Ev
-FN:84,_ZNSt12_Vector_baseISt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEESaIS7_EE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseISt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEESaIS7_EEC2Ev
-FN:213,_ZNSt6vectorISt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEESaIS7_EEC1Ev
-FN:101,_ZNKSt12_Vector_baseISt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEESaIS7_EE19_M_get_Tp_allocatorEv
-FN:489,_ZNKSt6vectorISt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEESaIS7_EE8max_sizeEv
-FN:143,_ZNSt12_Vector_baseISt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEESaIS7_EE11_M_allocateEj
-FN:1089,_ZNSt6vectorISt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEESaIS7_EE15_M_erase_at_endEPS7_
-FN:147,_ZNSt12_Vector_baseISt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEESaIS7_EE13_M_deallocateEPS7_j
-FN:135,_ZNSt12_Vector_baseISt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEESaIS7_EED2Ev
-FN:299,_ZNSt6vectorISt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEESaIS7_EED1Ev
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-FN:1075,_ZNKSt6vectorISt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEESaIS7_EE12_M_check_lenEjPKc
-FN:791,_ZNSt6vectorISt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEESaIS7_EE6insertEN9__gnu_cxx17__normal_iteratorIPS7_S9_EEjRKS7_
-FN:504,_ZNSt6vectorISt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEESaIS7_EE6resizeEjS7_
-DA:79,62
-DA:84,62
-DA:85,62
-DA:86,62
-DA:97,2738
-DA:98,2738
-DA:101,74
-DA:102,74
-DA:108,62
-DA:109,62
-DA:135,62
-DA:136,62
-DA:137,62
-DA:143,37
-DA:144,37
-DA:147,99
-DA:149,99
-DA:150,37
-DA:151,99
-DA:213,62
-DA:214,62
-DA:299,62
-DA:300,62
-DA:301,62
-DA:386,0
-DA:387,0
-DA:395,2565
-DA:396,2565
-DA:404,0
-DA:405,0
-DA:484,6648
-DA:485,6648
-DA:489,74
-DA:490,74
-DA:504,1301
-DA:506,1301
-DA:507,0
-DA:509,1301
-DA:510,1301
-DA:526,0
-DA:527,0
-DA:562,9097
-DA:563,9097
-DA:791,1301
-DA:792,1301
-DA:1075,37
-DA:1077,37
-DA:1078,0
-DA:1080,37
-DA:1081,37
-DA:1089,0
-DA:1091,0
-DA:1092,0
-DA:1093,0
-BA:144,2
-BA:144,1
-BA:149,2
-BA:149,2
-BA:149,0
-BA:149,0
-BA:506,1
-BA:506,2
-BA:1077,1
-BA:1077,2
-BA:1081,2
-BA:1081,1
-BA:1081,1
-BA:1081,2
-LF:54
-LH:42
-end_of_record
-SF:/usr/include/c++/4.3/bits/stream_iterator.h
-FN:181,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERSoPKc
-FN:185,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERKS2_
-FN:202,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEdeEv
-FN:206,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEppEv
-FN:191,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEaSERKSs
-DA:181,0
-DA:182,0
-DA:185,0
-DA:186,0
-DA:191,0
-DA:196,0
-DA:197,0
-DA:198,0
-DA:202,0
-DA:203,0
-DA:206,0
-DA:207,0
-BA:197,0
-BA:197,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/vector.tcc
-FN:350,_ZNSt6vectorISt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEESaIS7_EE14_M_fill_insertEN9__gnu_cxx17__normal_iteratorIPS7_S9_EEjRKS7_
-DA:350,1301
-DA:352,1301
-DA:357,1301
-DA:361,1264
-DA:363,1264
-DA:364,1264
-DA:365,1264
-DA:367,0
-DA:371,0
-DA:372,0
-DA:374,0
-DA:379,1264
-DA:383,1264
-DA:384,1264
-DA:387,1264
-DA:388,1264
-DA:394,37
-DA:395,37
-DA:396,37
-DA:399,37
-DA:407,37
-DA:410,37
-DA:411,37
-DA:417,0
-DA:419,0
-DA:421,0
-DA:422,0
-DA:424,37
-DA:426,37
-DA:429,37
-DA:430,37
-DA:431,37
-DA:434,1301
-BA:352,2
-BA:352,1
-BA:357,2
-BA:357,2
-BA:365,1
-BA:365,2
-LF:33
-LH:25
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSsEEED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEEED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSsEEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsSsEED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSsEEEC2ERKS6_
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsSsEEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEEE8max_sizeEv
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSsEEE8max_sizeEv
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSsEEE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorISt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEEE8allocateEjPKv
-FN:107,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsSsEE9constructEPS3_RKS3_
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsSsEE7destroyEPS3_
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSsEEE10deallocateEPS5_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEEE10deallocateEPS8_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-DA:69,2708
-DA:71,9224
-DA:76,62
-DA:87,16563
-DA:89,16563
-DA:90,0
-DA:92,16563
-DA:97,37
-DA:98,37
-DA:101,16637
-DA:102,16637
-DA:107,16526
-DA:108,16526
-DA:118,0
-BA:89,1
-BA:89,2
-BA:89,1
-BA:89,2
-BA:108,2
-BA:108,1
-LF:14
-LH:12
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,2
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/istream
-FN:585,_ZNSiC2Ev
-FN:105,_ZNSiD2Ev
-FN:804,_ZNSdC2Ev
-FN:801,_ZNSdD2Ev
-DA:105,0
-DA:106,0
-DA:585,0
-DA:586,0
-DA:587,0
-DA:801,0
-DA:804,0
-DA:805,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:464,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_c
-FN:195,_ZNSolsEj
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-DA:95,0
-DA:195,0
-DA:199,0
-DA:365,0
-DA:366,0
-DA:464,0
-DA:465,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:509,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:536,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:555,_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:509,0
-DA:510,0
-DA:511,0
-DA:536,0
-DA:537,0
-DA:555,0
-DA:556,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/input/base.h
-FN:104,_ZN7tagcoll5input5InputD2Ev
-FN:104,_ZN7tagcoll5input5InputD0Ev
-FN:104,_ZN7tagcoll5input5InputD1Ev
-DA:104,0
-BA:104,0
-BA:104,0
-BA:104,0
-BA:104,0
-BA:104,0
-BA:104,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/input/memory.h
-FN:47,_ZN7tagcoll5input6MemoryD1Ev
-DA:47,1301
-BA:47,1
-BA:47,2
-LF:1
-LH:1
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/maint/pkgid.cc
-FN:40,_ZNK3ept7debtags5PkgId6byNameERKSs
-FN:37,_ZN3ept7debtags5PkgIdC1ERKN7tagcoll9diskindex10MasterMMapEj
-FN:37,_ZN3ept7debtags5PkgIdC2ERKN7tagcoll9diskindex10MasterMMapEj
-FN:34,_ZN3ept7debtags5PkgIdC1EPKci
-FN:34,_ZN3ept7debtags5PkgIdC2EPKci
-FN:32,_ZN3ept7debtags5PkgIdC1Ev
-FN:32,_ZN3ept7debtags5PkgIdC2Ev
-DA:32,10
-DA:34,1
-DA:35,1
-DA:37,0
-DA:38,0
-DA:40,63445
-DA:46,63445
-DA:47,1043664
-DA:49,916774
-DA:50,916774
-DA:51,443057
-DA:53,473717
-DA:56,63445
-DA:58,2
-DA:60,63443
-BA:47,2
-BA:47,2
-BA:50,2
-BA:50,2
-BA:56,2
-BA:56,2
-BA:56,1
-BA:56,2
-BA:56,2
-BA:56,2
-BA:56,0
-BA:56,0
-BA:56,2
-BA:56,2
-LF:15
-LH:13
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/maint/pkgid.h
-FN:54,_ZNK3ept7debtags5PkgId4sizeEv
-FN:68,_ZNK3ept7debtags5PkgId4byIDEi
-DA:54,0
-DA:68,0
-DA:70,0
-DA:71,0
-DA:72,0
-BA:54,0
-BA:54,0
-BA:70,0
-BA:70,0
-BA:70,0
-BA:70,0
-BA:70,0
-BA:70,0
-LF:5
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:277,_ZNKSs7_M_dataEv
-FN:285,_ZNKSs6_M_repEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:606,_ZNKSs4sizeEv
-FN:1544,_ZNKSs4dataEv
-FN:392,_ZNSs10_S_compareEjj
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:1941,_ZNKSs7compareERKSs
-FN:2275,_ZStgtIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:2162,_ZSteqIcEN9__gnu_cxx11__enable_ifIXsrSt9__is_charIT_E7__valueEbE6__typeERKSbIS3_St11char_traitsIS3_ESaIS3_EESC_
-FN:2201,_ZStneIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-DA:178,0
-DA:183,0
-DA:184,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:392,0
-DA:394,0
-DA:401,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:606,0
-DA:607,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:1941,0
-DA:1943,0
-DA:1944,0
-DA:1945,0
-DA:1947,0
-DA:1948,0
-DA:1949,0
-DA:1950,0
-DA:2067,0
-DA:2069,0
-DA:2162,0
-DA:2165,0
-DA:2201,0
-DA:2202,0
-DA:2275,0
-DA:2276,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:1948,0
-BA:1948,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-LF:46
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-DA:257,0
-DA:258,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:188,_ZSt3minIjERKT_S2_S2_
-DA:188,0
-DA:193,0
-DA:194,0
-DA:195,0
-BA:193,0
-BA:193,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-DA:69,0
-DA:71,0
-DA:76,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/maint/debdbparser.cc
-FN:186,_Z41__static_initialization_and_destruction_0ii
-FN:186,_GLOBAL__I_debdbparser.cc
-FN:36,_ZN3ept7debtags11DebDBParser22eatSpacesAndEmptyLinesEv
-FN:129,_ZN3ept7debtags11DebDBParserC1ERN7tagcoll5input5InputE
-FN:129,_ZN3ept7debtags11DebDBParserC2ERN7tagcoll5input5InputE
-FN:102,_ZN3ept7debtags11DebDBParser15appendFieldBodyERSs
-FN:82,_ZN3ept7debtags11DebDBParser11eatFieldSepEv
-FN:58,_ZN3ept7debtags11DebDBParser12getFieldNameEv
-FN:139,_ZN3ept7debtags11DebDBParser10nextRecordERSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEE
-DA:36,12089
-DA:38,12089
-DA:40,31183
-DA:41,7005
-DA:43,3314
-DA:45,3314
-DA:47,3691
-DA:49,12089
-DA:50,1308
-DA:52,10781
-DA:54,12089
-DA:58,7094
-DA:60,7094
-DA:61,0
-DA:63,7094
-DA:66,63954
-DA:67,49766
-DA:69,7094
-DA:71,0
-DA:72,0
-DA:73,0
-DA:75,7094
-DA:77,0
-DA:82,7094
-DA:86,7094
-DA:89,7094
-DA:91,0
-DA:93,0
-DA:94,0
-DA:96,0
-DA:99,7094
-DA:102,17875
-DA:107,17875
-DA:111,280757
-DA:112,269976
-DA:115,10781
-DA:116,10781
-DA:117,10781
-DA:119,10781
-DA:120,0
-DA:124,10781
-DA:126,10781
-DA:129,1308
-DA:130,1308
-DA:133,1308
-DA:134,1308
-DA:139,3261
-DA:141,3261
-DA:142,7
-DA:144,3254
-DA:147,12880
-DA:149,7094
-DA:150,7094
-DA:155,7094
-DA:158,7094
-DA:162,17875
-DA:164,3687
-DA:166,3687
-DA:168,3687
-DA:171,3687
-DA:172,601
-DA:179,7094
-DA:182,3254
-DA:186,6
-BA:40,2
-BA:40,2
-BA:40,2
-BA:40,2
-BA:40,2
-BA:40,2
-BA:40,2
-BA:40,2
-BA:41,2
-BA:41,2
-BA:49,2
-BA:49,2
-BA:60,1
-BA:60,2
-BA:66,2
-BA:66,1
-BA:66,2
-BA:66,2
-BA:66,1
-BA:66,2
-BA:66,2
-BA:66,2
-BA:69,1
-BA:69,2
-BA:72,0
-BA:72,0
-BA:86,2
-BA:86,1
-BA:86,1
-BA:86,2
-BA:86,1
-BA:86,2
-BA:89,1
-BA:89,2
-BA:91,0
-BA:91,0
-BA:107,2
-BA:107,1
-BA:107,2
-BA:107,2
-BA:107,2
-BA:107,2
-BA:111,2
-BA:111,1
-BA:111,2
-BA:111,2
-BA:116,2
-BA:116,1
-BA:119,1
-BA:119,2
-BA:141,2
-BA:141,2
-BA:147,2
-BA:147,2
-BA:147,2
-BA:147,2
-BA:162,2
-BA:162,2
-BA:162,2
-BA:162,2
-BA:162,2
-BA:162,2
-BA:171,2
-BA:171,2
-BA:171,2
-BA:171,1
-BA:171,2
-BA:171,2
-BA:186,2
-BA:186,1
-BA:186,2
-BA:186,1
-LF:64
-LH:54
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/exception.h
-FN:190,_ZNK6wibble9exception7Generic4typeEv
-FN:263,_ZNK6wibble9exception11Consistency4typeEv
-FN:137,_ZN6wibble9exception7ContextD2Ev
-FN:265,_ZNK6wibble9exception11Consistency4descEv
-FN:213,_ZNK6wibble9exception7Generic4whatEv
-FN:193,_ZNK6wibble9exception7Generic4descEv
-FN:154,_ZNK6wibble9exception7Context13formatContextEv
-FN:205,_ZNK6wibble9exception7Generic8fullInfoEv
-FN:187,_ZN6wibble9exception7GenericD2Ev
-FN:261,_ZN6wibble9exception11ConsistencyD2Ev
-FN:261,_ZN6wibble9exception11ConsistencyD0Ev
-FN:261,_ZN6wibble9exception11ConsistencyD1Ev
-FN:187,_ZN6wibble9exception7GenericD0Ev
-FN:187,_ZN6wibble9exception7GenericD1Ev
-DA:137,0
-DA:154,0
-DA:155,0
-DA:156,0
-DA:157,0
-DA:159,0
-DA:161,0
-DA:162,0
-DA:163,0
-DA:187,0
-DA:190,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:205,0
-DA:206,0
-DA:207,0
-DA:209,0
-DA:210,0
-DA:213,0
-DA:261,0
-DA:263,0
-DA:265,0
-DA:266,0
-DA:267,0
-DA:268,0
-DA:269,0
-BA:156,0
-BA:156,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:207,0
-BA:207,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:267,0
-BA:267,0
-LF:27
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaISsED2Ev
-FN:106,_ZNSaISt4pairIKSsSsEED1Ev
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-FN:104,_ZNSaISt4pairIKSsSsEEC1ISt13_Rb_tree_nodeIS1_EEERKSaIT_E
-DA:98,0
-DA:100,0
-DA:101,0
-DA:104,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:7
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:276,0
-BA:276,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:1534,_ZNKSs5c_strEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:612,_ZNKSs6lengthEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:192,_ZNKSs4_Rep12_M_is_sharedEv
-FN:652,_ZNKSs8capacityEv
-FN:188,_ZNKSs4_Rep12_M_is_leakedEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:392,_ZNSs10_S_compareEjj
-FN:870,_ZNSs9push_backEc
-FN:791,_ZNSspLEc
-FN:299,_ZNSs7_M_leakEv
-FN:718,_ZNSsixEj
-FN:644,_ZNSs6resizeEj
-FN:1941,_ZNKSs7compareERKSs
-FN:2238,_ZStltIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:1891,_ZNKSs16find_last_not_ofEPKcj
-FN:2136,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S3_
-FN:835,_ZNSs6appendEPKc
-FN:2121,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-FN:501,_ZNSsaSERKSs
-DA:178,0
-DA:183,0
-DA:184,0
-DA:188,0
-DA:189,0
-DA:192,0
-DA:193,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:299,0
-DA:301,0
-DA:302,0
-DA:303,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:392,0
-DA:394,0
-DA:401,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:612,0
-DA:613,0
-DA:644,0
-DA:645,0
-DA:652,0
-DA:653,0
-DA:686,0
-DA:687,0
-DA:718,0
-DA:724,0
-DA:725,0
-DA:791,0
-DA:793,0
-DA:794,0
-DA:835,0
-DA:838,0
-DA:870,0
-DA:872,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:877,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:1891,0
-DA:1894,0
-DA:1941,0
-DA:1943,0
-DA:1944,0
-DA:1945,0
-DA:1947,0
-DA:1948,0
-DA:1949,0
-DA:1950,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2121,0
-DA:2123,0
-DA:2124,0
-DA:2125,0
-DA:2136,0
-DA:2140,0
-DA:2141,0
-DA:2142,0
-DA:2238,0
-DA:2239,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:301,0
-BA:301,0
-BA:341,0
-BA:341,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:1948,0
-BA:1948,0
-LF:111
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-FN:668,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_EPKS3_RKS6_
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-DA:668,0
-DA:673,0
-DA:674,0
-DA:675,0
-DA:676,0
-DA:677,0
-DA:678,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:23
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:257,0
-DA:258,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb0EE3__bES7_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb1EE3__bES7_
-FN:268,_ZNSt12__niter_baseISt16ostream_iteratorISscSt11char_traitsIcEELb0EE3__bES3_
-FN:188,_ZSt3minIjERKT_S2_S2_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPKSsSt16ostream_iteratorISscSt11char_traitsIcEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPKSsSt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_SD_SC_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET0_T_SD_SC_
-DA:188,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:268,0
-DA:269,0
-DA:276,0
-DA:277,0
-DA:286,0
-DA:287,0
-DA:337,0
-DA:340,0
-DA:342,0
-DA:343,0
-DA:344,0
-DA:346,0
-DA:385,0
-DA:393,0
-DA:396,0
-DA:430,0
-DA:435,0
-DA:456,0
-DA:466,0
-BA:193,0
-BA:193,0
-BA:340,0
-BA:340,0
-LF:23
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-DA:87,0
-DA:88,0
-DA:97,0
-DA:101,0
-DA:103,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-BA:101,0
-BA:101,0
-LF:9
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_function.h
-FN:482,_ZNKSt10_Select1stISt4pairIKSsSsEEclERKS2_
-FN:229,_ZNKSt4lessISsEclERKSsS2_
-DA:229,0
-DA:230,0
-DA:482,0
-DA:483,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEC1ERKS2_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-DA:683,0
-DA:747,0
-DA:748,0
-DA:769,0
-DA:770,0
-LF:5
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,0
-DA:166,0
-DA:167,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_map.h
-FN:468,_ZNSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEE6insertERKS4_
-FN:581,_ZNSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEE5clearEv
-DA:468,7094
-DA:469,7094
-DA:581,3254
-DA:582,3254
-LF:4
-LH:4
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_pair.h
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIS_IKSsSsEEbEC1ERKS3_RKb
-FN:88,_ZNSt4pairISsSsEC1ERKSsS2_
-FN:104,_ZNSt4pairIKSsSsEC1ISsSsEERKS_IT_T0_E
-FN:73,_ZNSt4pairIKSsSsEC1ERKS1_
-FN:73,_ZNSt4pairIKSsSsED1Ev
-FN:73,_ZNSt4pairISsSsED1Ev
-DA:73,7094
-DA:88,7094
-DA:89,7094
-DA:104,7094
-DA:106,7094
-LF:5
-LH:5
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_tree.h
-FN:452,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_M_beginEv
-FN:463,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE6_M_endEv
-FN:436,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE11_M_leftmostEv
-FN:428,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE7_M_rootEv
-FN:444,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE12_M_rightmostEv
-FN:487,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:168,_ZNSt17_Rb_tree_iteratorISt4pairIKSsSsEEC1EPSt13_Rb_tree_nodeIS2_E
-FN:596,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE5beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsSsEEeqERKS3_
-FN:471,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_S_valueEPKSt13_Rb_tree_nodeIS2_E
-FN:475,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE6_S_keyEPKSt13_Rb_tree_nodeIS2_E
-FN:495,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE6_S_keyEPKSt18_Rb_tree_node_base
-FN:347,_ZNKSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE21_M_get_Node_allocatorEv
-FN:351,_ZNKSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE13get_allocatorEv
-FN:360,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS2_E
-FN:195,_ZNSt17_Rb_tree_iteratorISt4pairIKSsSsEEmmEv
-FN:356,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE14_M_create_nodeERKS2_
-FN:846,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE10_M_insert_EPKSt18_Rb_tree_node_baseSB_RKS2_
-FN:1133,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE16_M_insert_uniqueERKS2_
-FN:388,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS2_E
-FN:936,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_M_eraseEPSt13_Rb_tree_nodeIS2_E
-FN:695,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE5clearEv
-DA:168,0
-DA:169,0
-DA:195,0
-DA:197,0
-DA:198,0
-DA:210,0
-DA:211,0
-DA:347,0
-DA:348,0
-DA:351,0
-DA:352,0
-DA:356,0
-DA:357,0
-DA:360,0
-DA:361,0
-DA:364,0
-DA:366,0
-DA:368,0
-DA:369,0
-DA:371,0
-DA:372,0
-DA:374,0
-DA:388,0
-DA:390,0
-DA:391,0
-DA:392,0
-DA:428,0
-DA:429,0
-DA:436,0
-DA:437,0
-DA:444,0
-DA:445,0
-DA:452,0
-DA:453,0
-DA:463,0
-DA:464,0
-DA:471,0
-DA:472,0
-DA:475,0
-DA:476,0
-DA:479,0
-DA:480,0
-DA:487,0
-DA:488,0
-DA:495,0
-DA:496,0
-DA:499,0
-DA:500,0
-DA:596,0
-DA:599,0
-DA:695,0
-DA:697,0
-DA:698,0
-DA:699,0
-DA:700,0
-DA:701,0
-DA:702,0
-DA:846,0
-DA:850,0
-DA:852,0
-DA:854,0
-DA:857,0
-DA:858,0
-DA:936,0
-DA:939,0
-DA:941,0
-DA:942,0
-DA:943,0
-DA:944,0
-DA:946,0
-DA:1133,0
-DA:1135,0
-DA:1136,0
-DA:1137,0
-DA:1138,0
-DA:1140,0
-DA:1141,0
-DA:1142,0
-DA:1144,0
-DA:1145,0
-DA:1147,0
-DA:1148,0
-DA:1150,0
-DA:1152,0
-DA:1153,0
-DA:1154,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:939,0
-BA:939,0
-BA:1138,0
-BA:1138,0
-BA:1142,0
-BA:1142,0
-BA:1145,0
-BA:1145,0
-BA:1147,0
-BA:1147,0
-BA:1152,0
-BA:1152,0
-LF:86
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:404,_ZNKSt6vectorISsSaISsEE3endEv
-FN:386,_ZNKSt6vectorISsSaISsEE5beginEv
-FN:526,_ZNKSt6vectorISsSaISsEE5emptyEv
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-DA:79,0
-DA:97,0
-DA:98,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:299,0
-DA:300,0
-DA:301,0
-DA:386,0
-DA:387,0
-DA:404,0
-DA:405,0
-DA:526,0
-DA:527,0
-BA:149,0
-BA:149,0
-LF:19
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stream_iterator.h
-FN:181,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERSoPKc
-FN:185,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERKS2_
-FN:202,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEdeEv
-FN:206,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEppEv
-FN:191,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEaSERKSs
-DA:181,0
-DA:182,0
-DA:185,0
-DA:186,0
-DA:191,0
-DA:196,0
-DA:197,0
-DA:198,0
-DA:202,0
-DA:203,0
-DA:206,0
-DA:207,0
-BA:197,0
-BA:197,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsSsEED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsSsEEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSsEEE8max_sizeEv
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSsEEE10deallocateEPS5_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSsEEE8allocateEjPKv
-FN:107,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsSsEE9constructEPS3_RKS3_
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsSsEE7destroyEPS3_
-DA:69,0
-DA:71,0
-DA:76,0
-DA:87,0
-DA:89,0
-DA:90,0
-DA:92,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:107,0
-DA:108,0
-DA:118,0
-BA:89,0
-BA:89,0
-BA:108,0
-BA:108,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,2
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/istream
-FN:585,_ZNSiC2Ev
-FN:105,_ZNSiD2Ev
-FN:804,_ZNSdC2Ev
-FN:801,_ZNSdD2Ev
-DA:105,0
-DA:106,0
-DA:585,0
-DA:586,0
-DA:587,0
-DA:801,0
-DA:804,0
-DA:805,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-DA:95,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:509,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:536,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:555,_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:509,0
-DA:510,0
-DA:511,0
-DA:536,0
-DA:537,0
-DA:555,0
-DA:556,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/input/base.h
-FN:68,_ZNK7tagcoll9exception5Input4typeEv
-FN:81,_ZNK7tagcoll9exception6Parser4typeEv
-FN:77,_ZN7tagcoll9exception6ParserC1ERKNS_5input5InputERKSs
-FN:59,_ZN7tagcoll9exception5InputD2Ev
-FN:79,_ZN7tagcoll9exception6ParserD0Ev
-FN:79,_ZN7tagcoll9exception6ParserD1Ev
-FN:59,_ZN7tagcoll9exception5InputD0Ev
-FN:59,_ZN7tagcoll9exception5InputD1Ev
-DA:59,0
-DA:68,0
-DA:77,0
-DA:78,0
-DA:79,0
-DA:81,0
-DA:83,0
-BA:59,0
-BA:59,0
-BA:59,0
-BA:59,0
-BA:59,0
-BA:59,0
-BA:79,0
-BA:79,0
-BA:79,0
-BA:79,0
-LF:7
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/maint/vocabularymerger.cc
-FN:384,_Z41__static_initialization_and_destruction_0ii
-FN:384,_GLOBAL__I_vocabularymerger.cc
-FN:324,_ZNK3ept7debtags16VocabularyMerger10TagIndexer11encodedSizeEv
-FN:257,_ZNK3ept7debtags16VocabularyMerger12FacetIndexer11encodedSizeEv
-FN:348,_ZNK3ept7debtags16VocabularyMerger10TagIndexer6encodeEPc
-FN:279,_ZNK3ept7debtags16VocabularyMerger12FacetIndexer6encodeEPc
-FN:200,_ZNK3ept7debtags16VocabularyMerger8tagNamesEv
-FN:74,_ZN3ept7debtags16VocabularyMerger9FacetData9obtainTagERKSs
-FN:87,_ZN3ept7debtags16VocabularyMerger11obtainFacetERKSs
-FN:177,_ZNK3ept7debtags16VocabularyMerger5tagIDERKSs
-FN:157,_ZNK3ept7debtags16VocabularyMerger6hasTagERKSs
-FN:100,_ZN3ept7debtags16VocabularyMerger9obtainTagERKSs
-FN:34,_ZN3ept7debtagsL18writeDebStyleFieldEP8_IO_FILERKSsS4_
-FN:219,_ZN3ept7debtags16VocabularyMerger5writeEP8_IO_FILE
-FN:210,_ZN3ept7debtags16VocabularyMerger5writeERKSs
-FN:114,_ZN3ept7debtags16VocabularyMerger4readERN7tagcoll5input5InputE
-DA:34,1432
-DA:36,1432
-DA:39,1432
-DA:40,56225
-DA:41,54793
-DA:43,738
-DA:45,120
-DA:46,120
-DA:47,120
-DA:50,618
-DA:52,618
-DA:53,618
-DA:54,618
-DA:59,0
-DA:60,0
-DA:63,54055
-DA:65,618
-DA:66,618
-DA:69,53437
-DA:71,1432
-DA:72,1432
-DA:74,1865
-DA:76,1865
-DA:77,1865
-DA:80,1245
-DA:81,1245
-DA:82,1245
-DA:84,1865
-DA:87,1953
-DA:89,1953
-DA:90,1953
-DA:93,62
-DA:94,62
-DA:95,62
-DA:97,1953
-DA:100,1865
-DA:102,1865
-DA:103,1865
-DA:105,28
-DA:106,28
-DA:108,1837
-DA:109,3674
-DA:114,7
-DA:116,7
-DA:117,7
-DA:119,1967
-DA:121,1953
-DA:122,3906
-DA:123,3906
-DA:126,88
-DA:128,88
-DA:131,416
-DA:133,328
-DA:134,240
-DA:136,1865
-DA:139,1865
-DA:144,5796
-DA:146,3931
-DA:147,2066
-DA:152,0
-DA:154,7
-DA:155,7
-DA:157,0
-DA:159,0
-DA:160,0
-DA:161,0
-DA:162,0
-DA:164,0
-DA:165,0
-DA:167,0
-DA:168,0
-DA:171,0
-DA:172,0
-DA:173,0
-DA:174,0
-DA:177,0
-DA:179,0
-DA:180,0
-DA:181,0
-DA:182,0
-DA:184,0
-DA:185,0
-DA:187,0
-DA:188,0
-DA:191,0
-DA:192,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:196,0
-DA:197,0
-DA:200,1
-DA:202,1
-DA:203,30
-DA:204,649
-DA:206,620
-DA:207,0
-DA:210,4
-DA:212,4
-DA:213,4
-DA:214,0
-DA:215,4
-DA:216,4
-DA:217,4
-DA:219,4
-DA:221,4
-DA:222,4
-DA:223,4
-DA:226,37
-DA:228,33
-DA:230,33
-DA:231,33
-DA:232,115
-DA:234,82
-DA:235,33
-DA:236,33
-DA:238,658
-DA:241,625
-DA:243,625
-DA:244,625
-DA:245,1317
-DA:247,692
-DA:248,625
-DA:249,625
-DA:253,4
-DA:254,4
-DA:257,4
-DA:260,4
-DA:262,37
-DA:269,33
-DA:272,33
-DA:273,25
-DA:276,4
-DA:279,4
-DA:281,4
-DA:283,37
-DA:285,33
-DA:288,33
-DA:289,33
-DA:292,33
-DA:293,33
-DA:295,33
-DA:298,1
-DA:299,1
-DA:302,1
-DA:303,1
-DA:306,32
-DA:307,32
-DA:310,32
-DA:311,32
-DA:315,33
-DA:316,33
-DA:319,33
-DA:320,25
-DA:322,4
-DA:324,4
-DA:327,4
-DA:329,37
-DA:331,658
-DA:338,625
-DA:341,625
-DA:342,479
-DA:345,4
-DA:348,4
-DA:350,4
-DA:352,37
-DA:354,658
-DA:357,625
-DA:360,625
-DA:361,625
-DA:364,625
-DA:365,625
-DA:368,625
-DA:369,625
-DA:372,625
-DA:373,625
-DA:374,625
-DA:377,625
-DA:378,479
-DA:381,4
-DA:384,6
-BA:40,2
-BA:40,2
-BA:41,2
-BA:41,2
-BA:43,2
-BA:43,2
-BA:50,2
-BA:50,1
-BA:50,2
-BA:50,1
-BA:50,2
-BA:50,1
-BA:63,2
-BA:63,2
-BA:77,2
-BA:77,2
-BA:90,2
-BA:90,2
-BA:103,2
-BA:103,2
-BA:119,2
-BA:119,2
-BA:123,2
-BA:123,2
-BA:128,1
-BA:128,2
-BA:131,2
-BA:131,2
-BA:133,2
-BA:133,2
-BA:136,2
-BA:136,1
-BA:144,2
-BA:144,2
-BA:146,2
-BA:146,2
-BA:162,0
-BA:162,0
-BA:172,0
-BA:172,0
-BA:182,0
-BA:182,0
-BA:192,0
-BA:192,0
-BA:195,0
-BA:195,0
-BA:203,2
-BA:203,2
-BA:204,2
-BA:204,2
-BA:213,1
-BA:213,2
-BA:226,2
-BA:226,2
-BA:232,2
-BA:232,2
-BA:238,2
-BA:238,2
-BA:245,2
-BA:245,2
-BA:262,2
-BA:262,2
-BA:272,2
-BA:272,2
-BA:283,2
-BA:283,2
-BA:295,2
-BA:295,2
-BA:319,2
-BA:319,2
-BA:329,2
-BA:329,2
-BA:331,2
-BA:331,2
-BA:341,2
-BA:341,2
-BA:352,2
-BA:352,2
-BA:354,2
-BA:354,2
-BA:377,2
-BA:377,2
-BA:384,2
-BA:384,1
-BA:384,2
-BA:384,1
-LF:181
-LH:147
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/maint/vocabularymerger.h
-FN:42,_ZN3ept7debtags16VocabularyMerger12FacetIndexerD0Ev
-FN:42,_ZN3ept7debtags16VocabularyMerger12FacetIndexerD1Ev
-FN:52,_ZN3ept7debtags16VocabularyMerger10TagIndexerD0Ev
-FN:52,_ZN3ept7debtags16VocabularyMerger10TagIndexerD1Ev
-FN:65,_ZN3ept7debtags16VocabularyMerger7TagDataC1Ev
-FN:77,_ZN3ept7debtags16VocabularyMerger9FacetDataC1Ev
-FN:57,_ZN3ept7debtags16VocabularyMerger7TagDataD1Ev
-FN:68,_ZN3ept7debtags16VocabularyMerger9FacetDataD1Ev
-FN:57,_ZN3ept7debtags16VocabularyMerger7TagDataC1ERKS2_
-FN:68,_ZN3ept7debtags16VocabularyMerger9FacetDataC1ERKS2_
-DA:42,0
-DA:52,0
-DA:57,3735
-DA:65,1245
-DA:68,186
-DA:77,62
-BA:42,0
-BA:42,0
-BA:42,0
-BA:42,0
-BA:52,0
-BA:52,0
-BA:52,0
-BA:52,0
-LF:6
-LH:4
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/exception.h
-FN:190,_ZNK6wibble9exception7Generic4typeEv
-FN:406,_ZNK6wibble9exception6System4codeEv
-FN:428,_ZNK6wibble9exception4File4typeEv
-FN:137,_ZN6wibble9exception7ContextD2Ev
-FN:213,_ZNK6wibble9exception7Generic4whatEv
-FN:193,_ZNK6wibble9exception7Generic4descEv
-FN:154,_ZNK6wibble9exception7Context13formatContextEv
-FN:205,_ZNK6wibble9exception7Generic8fullInfoEv
-FN:430,_ZNK6wibble9exception4File4descEv
-FN:187,_ZN6wibble9exception7GenericD2Ev
-FN:395,_ZN6wibble9exception6SystemD2Ev
-FN:424,_ZN6wibble9exception4FileC1ERKSsS3_
-FN:426,_ZN6wibble9exception4FileD0Ev
-FN:426,_ZN6wibble9exception4FileD1Ev
-FN:187,_ZN6wibble9exception7GenericD0Ev
-FN:187,_ZN6wibble9exception7GenericD1Ev
-DA:137,0
-DA:154,0
-DA:155,0
-DA:156,0
-DA:157,0
-DA:159,0
-DA:161,0
-DA:162,0
-DA:163,0
-DA:187,0
-DA:190,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:205,0
-DA:206,0
-DA:207,0
-DA:209,0
-DA:210,0
-DA:213,0
-DA:395,0
-DA:406,0
-DA:424,0
-DA:425,0
-DA:426,0
-DA:428,0
-DA:430,0
-BA:156,0
-BA:156,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:207,0
-BA:207,0
-BA:395,0
-BA:395,0
-BA:426,0
-BA:426,0
-BA:426,0
-BA:426,0
-LF:27
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsSsEEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISsEED2Ev
-FN:100,_ZNSaIcEC1ERKS_
-FN:100,_ZNSaIcEC2ERKS_
-FN:106,_ZNSaISsED2Ev
-FN:106,_ZNSaISsED1Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsSsEEEC2Ev
-FN:106,_ZNSaISt4pairIKSsSsEED1Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEEC2Ev
-FN:106,_ZNSaISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEED1Ev
-FN:106,_ZNSaISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEED1Ev
-FN:100,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsSsEEEC2ERKS4_
-FN:100,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEEC2ERKS8_
-FN:98,_ZNSaISt13_Rb_tree_nodeISsEEC2Ev
-FN:104,_ZNSaISsEC1ISt13_Rb_tree_nodeISsEEERKSaIT_E
-FN:104,_ZNSaISt4pairIKSsSsEEC1ISt13_Rb_tree_nodeIS1_EEERKSaIT_E
-FN:104,_ZNSaISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEC1ISt13_Rb_tree_nodeIS5_EEERKSaIT_E
-FN:104,_ZNSaISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEEC1ISt13_Rb_tree_nodeIS5_EEERKSaIT_E
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,62
-DA:100,186
-DA:101,186
-DA:104,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:7
-LH:3
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:276,0
-BA:276,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:1534,_ZNKSs5c_strEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:612,_ZNKSs6lengthEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:543,_ZNKSs5beginEv
-FN:562,_ZNKSs3endEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:1551,_ZNKSs13get_allocatorEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:392,_ZNSs10_S_compareEjj
-FN:835,_ZNSs6appendEPKc
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2121,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:501,_ZNSsaSERKSs
-FN:1941,_ZNKSs7compareERKSs
-FN:2238,_ZStltIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:2162,_ZSteqIcEN9__gnu_cxx11__enable_ifIXsrSt9__is_charIT_E7__valueEbE6__typeERKSbIS3_St11char_traitsIS3_ESaIS3_EESC_
-FN:1593,_ZNKSs4findEPKcj
-FN:928,_ZNSs6assignEPKc
-FN:509,_ZNSsaSEPKc
-FN:306,_ZNKSs8_M_checkEjPKc
-FN:1923,_ZNKSs6substrEjj
-FN:2188,_ZSteqIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_EPKS3_
-FN:2225,_ZStneIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_EPKS3_
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:306,0
-DA:308,0
-DA:309,0
-DA:310,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:392,0
-DA:394,0
-DA:401,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:509,0
-DA:510,0
-DA:543,0
-DA:544,0
-DA:562,0
-DA:563,0
-DA:606,0
-DA:607,0
-DA:612,0
-DA:613,0
-DA:686,0
-DA:687,0
-DA:835,0
-DA:838,0
-DA:928,0
-DA:931,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:1593,0
-DA:1596,0
-DA:1923,0
-DA:1925,0
-DA:1941,0
-DA:1943,0
-DA:1944,0
-DA:1945,0
-DA:1947,0
-DA:1948,0
-DA:1949,0
-DA:1950,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2121,0
-DA:2123,0
-DA:2124,0
-DA:2125,0
-DA:2162,0
-DA:2165,0
-DA:2188,0
-DA:2189,0
-DA:2225,0
-DA:2226,0
-DA:2238,0
-DA:2239,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:308,0
-BA:308,0
-BA:341,0
-BA:341,0
-BA:1948,0
-BA:1948,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-LF:102
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-DA:245,0
-DA:246,0
-DA:257,0
-DA:258,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb0EE3__bES7_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb1EE3__bES7_
-FN:268,_ZNSt12__niter_baseISt16ostream_iteratorISscSt11char_traitsIcEELb0EE3__bES3_
-FN:188,_ZSt3minIjERKT_S2_S2_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPKSsSt16ostream_iteratorISscSt11char_traitsIcEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPKSsSt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_SD_SC_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET0_T_SD_SC_
-DA:188,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:268,0
-DA:269,0
-DA:276,0
-DA:277,0
-DA:286,0
-DA:287,0
-DA:337,0
-DA:340,0
-DA:342,0
-DA:343,0
-DA:344,0
-DA:346,0
-DA:385,0
-DA:393,0
-DA:396,0
-DA:430,0
-DA:435,0
-DA:456,0
-DA:466,0
-BA:193,0
-BA:193,0
-BA:340,0
-BA:340,0
-LF:23
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-DA:87,0
-DA:88,0
-DA:97,0
-DA:101,0
-DA:103,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-BA:101,0
-BA:101,0
-LF:9
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_function.h
-FN:482,_ZNKSt10_Select1stISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEclERKS6_
-FN:482,_ZNKSt10_Select1stISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEEclERKS6_
-FN:469,_ZNKSt9_IdentityISsEclERKSs
-FN:482,_ZNKSt10_Select1stISt4pairIKSsSsEEclERKS2_
-FN:229,_ZNKSt4lessISsEclERKSsS2_
-DA:229,0
-DA:230,0
-DA:469,0
-DA:470,0
-DA:482,38107
-DA:483,38107
-LF:6
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPKcSsEdeEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKcSsEC1ERKS2_
-FN:710,_ZN9__gnu_cxx17__normal_iteratorIPKcSsEppEi
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKcSsE4baseEv
-FN:781,_ZN9__gnu_cxxneIPKcSsEEbRKNS_17__normal_iteratorIT_T0_EES8_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEC1ERKS2_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-FN:125,_ZNSt16reverse_iteratorISt23_Rb_tree_const_iteratorISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEEC1ES8_
-FN:154,_ZNKSt16reverse_iteratorISt23_Rb_tree_const_iteratorISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEEdeEv
-FN:166,_ZNKSt16reverse_iteratorISt23_Rb_tree_const_iteratorISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEEptEv
-DA:125,32
-DA:154,32
-DA:156,32
-DA:157,32
-DA:166,32
-DA:167,32
-DA:683,54793
-DA:695,0
-DA:696,0
-DA:710,54793
-DA:711,54793
-DA:747,0
-DA:748,0
-DA:769,0
-DA:770,0
-DA:781,0
-DA:782,0
-LF:17
-LH:9
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:111,_ZNSt8iteratorISt26bidirectional_iterator_tagSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEiPKS7_RS8_EC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,32
-DA:166,0
-DA:167,0
-LF:3
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_map.h
-FN:389,_ZNKSt3mapISsN3ept7debtags16VocabularyMerger9FacetDataESt4lessISsESaISt4pairIKSsS3_EEE4sizeEv
-FN:384,_ZNKSt3mapISsN3ept7debtags16VocabularyMerger7TagDataESt4lessISsESaISt4pairIKSsS3_EEE5emptyEv
-FN:284,_ZNKSt3mapISsN3ept7debtags16VocabularyMerger9FacetDataESt4lessISsESaISt4pairIKSsS3_EEE5beginEv
-FN:302,_ZNKSt3mapISsN3ept7debtags16VocabularyMerger9FacetDataESt4lessISsESaISt4pairIKSsS3_EEE3endEv
-FN:275,_ZNSt3mapISsN3ept7debtags16VocabularyMerger7TagDataESt4lessISsESaISt4pairIKSsS3_EEE5beginEv
-FN:293,_ZNSt3mapISsN3ept7debtags16VocabularyMerger7TagDataESt4lessISsESaISt4pairIKSsS3_EEE3endEv
-FN:275,_ZNSt3mapISsN3ept7debtags16VocabularyMerger9FacetDataESt4lessISsESaISt4pairIKSsS3_EEE5beginEv
-FN:293,_ZNSt3mapISsN3ept7debtags16VocabularyMerger9FacetDataESt4lessISsESaISt4pairIKSsS3_EEE3endEv
-FN:275,_ZNSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEE5beginEv
-FN:293,_ZNSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEE3endEv
-FN:590,_ZNKSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEE8key_compEv
-FN:284,_ZNKSt3mapISsN3ept7debtags16VocabularyMerger7TagDataESt4lessISsESaISt4pairIKSsS3_EEE5beginEv
-FN:302,_ZNKSt3mapISsN3ept7debtags16VocabularyMerger7TagDataESt4lessISsESaISt4pairIKSsS3_EEE3endEv
-FN:320,_ZNKSt3mapISsN3ept7debtags16VocabularyMerger7TagDataESt4lessISsESaISt4pairIKSsS3_EEE6rbeginEv
-FN:155,_ZNSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEEC1Ev
-FN:155,_ZNSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEEC2Ev
-FN:155,_ZNSt3mapISsN3ept7debtags16VocabularyMerger7TagDataESt4lessISsESaISt4pairIKSsS3_EEEC1Ev
-FN:92,_ZNSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEED1Ev
-FN:92,_ZNSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEED2Ev
-FN:92,_ZNSt3mapISsN3ept7debtags16VocabularyMerger7TagDataESt4lessISsESaISt4pairIKSsS3_EEED1Ev
-FN:629,_ZNKSt3mapISsN3ept7debtags16VocabularyMerger9FacetDataESt4lessISsESaISt4pairIKSsS3_EEE4findERS7_
-FN:629,_ZNKSt3mapISsN3ept7debtags16VocabularyMerger7TagDataESt4lessISsESaISt4pairIKSsS3_EEE4findERS7_
-FN:656,_ZNSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEE11lower_boundERS3_
-FN:614,_ZNSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEE4findERS3_
-FN:614,_ZNSt3mapISsN3ept7debtags16VocabularyMerger9FacetDataESt4lessISsESaISt4pairIKSsS3_EEE4findERS7_
-FN:614,_ZNSt3mapISsN3ept7debtags16VocabularyMerger7TagDataESt4lessISsESaISt4pairIKSsS3_EEE4findERS7_
-FN:495,_ZNSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEE6insertESt17_Rb_tree_iteratorIS4_ERKS4_
-FN:411,_ZNSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEEixERS3_
-FN:175,_ZNSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEEC2ERKS6_
-FN:175,_ZNSt3mapISsN3ept7debtags16VocabularyMerger7TagDataESt4lessISsESaISt4pairIKSsS3_EEEC1ERKSA_
-FN:468,_ZNSt3mapISsN3ept7debtags16VocabularyMerger7TagDataESt4lessISsESaISt4pairIKSsS3_EEE6insertERKS8_
-FN:468,_ZNSt3mapISsN3ept7debtags16VocabularyMerger9FacetDataESt4lessISsESaISt4pairIKSsS3_EEE6insertERKS8_
-DA:92,0
-DA:155,1369
-DA:156,1369
-DA:175,4107
-DA:176,4107
-DA:275,2664
-DA:276,2664
-DA:284,128
-DA:285,128
-DA:293,4661
-DA:294,4661
-DA:302,1995
-DA:303,1995
-DA:320,32
-DA:321,32
-DA:384,33
-DA:385,33
-DA:389,8
-DA:390,8
-DA:411,0
-DA:416,0
-DA:418,0
-DA:419,0
-DA:420,0
-DA:468,1307
-DA:469,1307
-DA:495,0
-DA:496,0
-DA:590,0
-DA:591,0
-DA:614,7724
-DA:615,7724
-DA:629,0
-DA:630,0
-DA:656,0
-DA:657,0
-BA:418,0
-BA:418,0
-BA:418,0
-BA:418,0
-BA:418,0
-BA:418,0
-LF:36
-LH:22
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_pair.h
-FN:88,_ZNSt4pairISt23_Rb_tree_const_iteratorISsEbEC1ERKS1_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIS_IKSsN3ept7debtags16VocabularyMerger7TagDataEEEbEC1ERKS7_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIS_IKSsN3ept7debtags16VocabularyMerger9FacetDataEEEbEC1ERKS7_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorISsEbEC1ERKS1_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIS_IKSsSsEEbEC1ERKS3_RKb
-FN:88,_ZNSt4pairIKSsSsEC1ERS0_S2_
-FN:73,_ZNSt4pairIKSsSsEC1ERKS1_
-FN:73,_ZNSt4pairIKSsSsED1Ev
-FN:73,_ZNSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEED1Ev
-FN:73,_ZNSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEED1Ev
-FN:73,_ZNSt4pairISsN3ept7debtags16VocabularyMerger9FacetDataEED1Ev
-FN:73,_ZNSt4pairISsN3ept7debtags16VocabularyMerger7TagDataEED1Ev
-FN:73,_ZNSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEC1ERKS5_
-FN:88,_ZNSt4pairISsN3ept7debtags16VocabularyMerger7TagDataEEC1ERKSsRKS3_
-FN:218,_ZSt9make_pairISsN3ept7debtags16VocabularyMerger7TagDataEESt4pairIT_T0_ES5_S6_
-FN:104,_ZNSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEC1ISsS4_EERKS_IT_T0_E
-FN:88,_ZNSt4pairISsN3ept7debtags16VocabularyMerger9FacetDataEEC1ERKSsRKS3_
-FN:218,_ZSt9make_pairISsN3ept7debtags16VocabularyMerger9FacetDataEESt4pairIT_T0_ES5_S6_
-FN:104,_ZNSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEC1ISsS4_EERKS_IT_T0_E
-FN:73,_ZNSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEC1ERKS5_
-DA:73,2614
-DA:88,2614
-DA:89,2614
-DA:104,1307
-DA:106,1307
-DA:218,1307
-DA:219,1307
-LF:7
-LH:7
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_set.h
-FN:141,_ZNSt3setISsSt4lessISsESaISsEEC1Ev
-FN:93,_ZNSt3setISsSt4lessISsESaISsEED1Ev
-FN:378,_ZNSt3setISsSt4lessISsESaISsEE6insertERKSs
-DA:93,0
-DA:141,0
-DA:142,0
-DA:378,0
-DA:381,0
-DA:382,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_tree.h
-FN:103,_ZNSt18_Rb_tree_node_base10_S_minimumEPS_
-FN:117,_ZNSt18_Rb_tree_node_base10_S_maximumEPS_
-FN:289,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEEneERKS7_
-FN:210,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEeqERKS7_
-FN:176,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEptEv
-FN:210,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEEeqERKS7_
-FN:176,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEEptEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsSsEEC1ERKSt17_Rb_tree_iteratorIS2_E
-FN:289,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKSsSsEEneERKS3_
-FN:251,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKSsSsEEptEv
-FN:285,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEEeqERKS7_
-FN:251,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEEptEv
-FN:289,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEneERKS7_
-FN:285,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEeqERKS7_
-FN:251,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEptEv
-FN:214,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEEneERKS7_
-FN:214,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEneERKS7_
-FN:243,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEEC1ERKSt17_Rb_tree_iteratorIS6_E
-FN:452,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_M_beginEv
-FN:452,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_M_beginEv
-FN:452,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_M_beginEv
-FN:172,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsSsEEdeEv
-FN:210,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsSsEEeqERKS3_
-FN:452,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_beginEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorISsEC1ERKSt17_Rb_tree_iteratorISsE
-FN:641,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE4sizeEv
-FN:637,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE5emptyEv
-FN:398,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE13_Rb_tree_implIS6_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:398,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13_Rb_tree_implISA_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:487,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:456,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_M_beginEv
-FN:467,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE6_M_endEv
-FN:240,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEEC1EPKSt13_Rb_tree_nodeIS6_E
-FN:603,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE5beginEv
-FN:614,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE3endEv
-FN:463,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE6_M_endEv
-FN:168,_ZNSt17_Rb_tree_iteratorISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEC1EPSt13_Rb_tree_nodeIS6_E
-FN:596,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE5beginEv
-FN:610,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE3endEv
-FN:347,_ZNKSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE21_M_get_Node_allocatorEv
-FN:432,_ZNKSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE7_M_rootEv
-FN:456,_ZNKSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_M_beginEv
-FN:463,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE6_M_endEv
-FN:428,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE7_M_rootEv
-FN:503,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE10_S_minimumEPSt18_Rb_tree_node_base
-FN:436,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE11_M_leftmostEv
-FN:511,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE10_S_maximumEPSt18_Rb_tree_node_base
-FN:444,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE12_M_rightmostEv
-FN:463,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE6_M_endEv
-FN:168,_ZNSt17_Rb_tree_iteratorISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEEC1EPSt13_Rb_tree_nodeIS6_E
-FN:596,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE5beginEv
-FN:610,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE3endEv
-FN:347,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE21_M_get_Node_allocatorEv
-FN:432,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE7_M_rootEv
-FN:456,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_M_beginEv
-FN:428,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE7_M_rootEv
-FN:503,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE10_S_minimumEPSt18_Rb_tree_node_base
-FN:436,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE11_M_leftmostEv
-FN:511,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE10_S_maximumEPSt18_Rb_tree_node_base
-FN:444,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE12_M_rightmostEv
-FN:168,_ZNSt17_Rb_tree_iteratorISt4pairIKSsSsEEC1EPSt13_Rb_tree_nodeIS2_E
-FN:596,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE5beginEv
-FN:610,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE3endEv
-FN:592,_ZNKSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE8key_compEv
-FN:467,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE6_M_endEv
-FN:240,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEC1EPKSt13_Rb_tree_nodeIS6_E
-FN:603,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE5beginEv
-FN:614,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE3endEv
-FN:398,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_S_leftEPSt18_Rb_tree_node_base
-FN:463,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_M_endEv
-FN:168,_ZNSt17_Rb_tree_iteratorISsEC1EPSt13_Rb_tree_nodeISsE
-FN:596,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorISsEeqERKS0_
-FN:347,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE21_M_get_Node_allocatorEv
-FN:625,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE6rbeginEv
-FN:247,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEdeEv
-FN:415,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE13_Rb_tree_implIS6_Lb0EE13_M_initializeEv
-FN:415,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13_Rb_tree_implISA_Lb0EE13_M_initializeEv
-FN:483,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE7_S_leftEPKSt18_Rb_tree_node_base
-FN:491,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_S_rightEPKSt18_Rb_tree_node_base
-FN:495,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE6_S_keyEPKSt18_Rb_tree_node_base
-FN:495,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE6_S_keyEPKSt18_Rb_tree_node_base
-FN:491,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_S_rightEPKSt18_Rb_tree_node_base
-FN:483,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE7_S_leftEPKSt18_Rb_tree_node_base
-FN:471,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_S_valueEPKSt13_Rb_tree_nodeIS6_E
-FN:475,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE6_S_keyEPKSt13_Rb_tree_nodeIS6_E
-FN:491,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_S_rightEPKSt18_Rb_tree_node_base
-FN:483,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE7_S_leftEPKSt18_Rb_tree_node_base
-FN:471,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_S_valueEPKSt13_Rb_tree_nodeIS6_E
-FN:475,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE6_S_keyEPKSt13_Rb_tree_nodeIS6_E
-FN:495,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE6_S_keyEPKSt18_Rb_tree_node_base
-FN:641,_ZNKSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE4sizeEv
-FN:415,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EE13_M_initializeEv
-FN:471,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_valueEPKSt13_Rb_tree_nodeISsE
-FN:475,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_S_keyEPKSt13_Rb_tree_nodeISsE
-FN:495,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_S_keyEPKSt18_Rb_tree_node_base
-FN:403,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE13_Rb_tree_implIS6_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EEC1Ev
-FN:403,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13_Rb_tree_implISA_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EEC1Ev
-FN:347,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE21_M_get_Node_allocatorEv
-FN:408,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE13_Rb_tree_implIS6_Lb0EEC1ERKS6_RKSaISt13_Rb_tree_nodeIS2_EE
-FN:408,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13_Rb_tree_implISA_Lb0EEC1ERKSA_RKSaISt13_Rb_tree_nodeIS6_EE
-FN:471,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_S_valueEPKSt13_Rb_tree_nodeIS2_E
-FN:475,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE6_S_keyEPKSt13_Rb_tree_nodeIS2_E
-FN:403,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEEC1Ev
-FN:351,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13get_allocatorEv
-FN:351,_ZNKSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE13get_allocatorEv
-FN:351,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13get_allocatorEv
-FN:351,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13get_allocatorEv
-FN:360,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11_M_put_nodeEPSt13_Rb_tree_nodeISsE
-FN:360,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS2_E
-FN:360,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS6_E
-FN:360,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS6_E
-FN:262,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEppEi
-FN:262,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEEppEi
-FN:262,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsSsEEppEi
-FN:255,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsSsEEppEv
-FN:388,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE15_M_destroy_nodeEPSt13_Rb_tree_nodeISsE
-FN:936,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_eraseEPSt13_Rb_tree_nodeISsE
-FN:584,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEED1Ev
-FN:388,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS2_E
-FN:936,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_M_eraseEPSt13_Rb_tree_nodeIS2_E
-FN:584,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EED1Ev
-FN:388,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS6_E
-FN:936,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_M_eraseEPSt13_Rb_tree_nodeIS6_E
-FN:584,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EED1Ev
-FN:270,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEmmEv
-FN:270,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsSsEEmmEv
-FN:187,_ZNSt17_Rb_tree_iteratorISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEppEi
-FN:187,_ZNSt17_Rb_tree_iteratorISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEEppEi
-FN:195,_ZNSt17_Rb_tree_iteratorISsEmmEv
-FN:195,_ZNSt17_Rb_tree_iteratorISt4pairIKSsSsEEmmEv
-FN:195,_ZNSt17_Rb_tree_iteratorISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEEmmEv
-FN:195,_ZNSt17_Rb_tree_iteratorISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEmmEv
-FN:970,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE14_M_lower_boundEPKSt13_Rb_tree_nodeIS6_ESG_RS1_
-FN:1403,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE4findERS1_
-FN:970,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE14_M_lower_boundEPKSt13_Rb_tree_nodeIS6_ESG_RS1_
-FN:1403,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE4findERS1_
-FN:954,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE14_M_lower_boundEPSt13_Rb_tree_nodeIS2_ESB_RS1_
-FN:715,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE11lower_boundERS1_
-FN:1390,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE4findERS1_
-FN:954,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE14_M_lower_boundEPSt13_Rb_tree_nodeIS6_ESF_RS1_
-FN:1390,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE4findERS1_
-FN:954,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE14_M_lower_boundEPSt13_Rb_tree_nodeIS6_ESF_RS1_
-FN:1390,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE4findERS1_
-FN:356,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE14_M_create_nodeERKSs
-FN:846,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE10_M_insert_EPKSt18_Rb_tree_node_baseS8_RKSs
-FN:1133,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE16_M_insert_uniqueERKSs
-FN:356,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE14_M_create_nodeERKS2_
-FN:846,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE10_M_insert_EPKSt18_Rb_tree_node_baseSB_RKS2_
-FN:1133,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE16_M_insert_uniqueERKS2_
-FN:1178,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE17_M_insert_unique_ESt23_Rb_tree_const_iteratorIS2_ERKS2_
-FN:378,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE13_M_clone_nodeEPKSt13_Rb_tree_nodeIS2_E
-FN:900,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE7_M_copyEPKSt13_Rb_tree_nodeIS2_EPSA_
-FN:568,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EEC1ERKS8_
-FN:356,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE14_M_create_nodeERKS6_
-FN:378,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13_M_clone_nodeEPKSt13_Rb_tree_nodeIS6_E
-FN:900,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE7_M_copyEPKSt13_Rb_tree_nodeIS6_EPSE_
-FN:568,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EEC1ERKSC_
-FN:846,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE10_M_insert_EPKSt18_Rb_tree_node_baseSF_RKS6_
-FN:1133,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE16_M_insert_uniqueERKS6_
-FN:356,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE14_M_create_nodeERKS6_
-FN:846,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE10_M_insert_EPKSt18_Rb_tree_node_baseSF_RKS6_
-FN:1133,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE16_M_insert_uniqueERKS6_
-DA:103,0
-DA:105,0
-DA:106,0
-DA:117,0
-DA:119,0
-DA:120,0
-DA:168,16478
-DA:169,16478
-DA:172,0
-DA:173,0
-DA:176,11821
-DA:177,11821
-DA:187,658
-DA:189,658
-DA:190,658
-DA:195,107
-DA:197,107
-DA:198,107
-DA:210,7843
-DA:211,7843
-DA:214,695
-DA:215,695
-DA:240,2155
-DA:241,2155
-DA:243,164
-DA:244,164
-DA:247,32
-DA:248,32
-DA:251,8660
-DA:252,8660
-DA:255,0
-DA:257,0
-DA:258,0
-DA:262,7064
-DA:264,7064
-DA:265,7064
-DA:270,32
-DA:272,32
-DA:273,32
-DA:285,0
-DA:286,0
-DA:289,13605
-DA:290,13605
-DA:347,0
-DA:348,0
-DA:351,0
-DA:352,0
-DA:356,1307
-DA:357,1307
-DA:360,0
-DA:361,0
-DA:364,1307
-DA:366,1307
-DA:368,1307
-DA:369,0
-DA:371,0
-DA:372,0
-DA:374,1307
-DA:378,0
-DA:380,0
-DA:381,0
-DA:382,0
-DA:383,0
-DA:384,0
-DA:388,0
-DA:390,0
-DA:391,0
-DA:392,0
-DA:398,0
-DA:403,62
-DA:405,62
-DA:406,62
-DA:408,186
-DA:410,186
-DA:411,186
-DA:415,248
-DA:417,248
-DA:418,248
-DA:419,248
-DA:420,248
-DA:421,248
-DA:428,0
-DA:429,0
-DA:432,186
-DA:433,186
-DA:436,0
-DA:437,0
-DA:444,0
-DA:445,0
-DA:452,0
-DA:453,0
-DA:456,0
-DA:459,0
-DA:463,6432
-DA:464,6432
-DA:467,0
-DA:468,0
-DA:471,24508
-DA:472,24508
-DA:475,24508
-DA:476,24508
-DA:479,0
-DA:480,0
-DA:483,0
-DA:484,0
-DA:487,0
-DA:488,0
-DA:491,0
-DA:492,0
-DA:495,5178
-DA:496,5178
-DA:499,5178
-DA:500,5178
-DA:503,0
-DA:504,0
-DA:511,0
-DA:512,0
-DA:562,62
-DA:568,186
-DA:569,186
-DA:571,186
-DA:573,0
-DA:574,0
-DA:575,0
-DA:576,0
-DA:578,186
-DA:584,0
-DA:585,0
-DA:592,0
-DA:593,0
-DA:596,260
-DA:599,260
-DA:603,128
-DA:606,128
-DA:610,9786
-DA:611,9786
-DA:614,2027
-DA:617,2027
-DA:625,32
-DA:626,32
-DA:637,33
-DA:638,33
-DA:641,8
-DA:642,8
-DA:715,0
-DA:716,0
-DA:846,1307
-DA:850,1307
-DA:852,1307
-DA:854,1307
-DA:857,1307
-DA:858,1307
-DA:900,0
-DA:903,0
-DA:904,0
-DA:908,0
-DA:909,0
-DA:910,0
-DA:911,0
-DA:913,0
-DA:915,0
-DA:916,0
-DA:917,0
-DA:918,0
-DA:919,0
-DA:920,0
-DA:921,0
-DA:924,0
-DA:926,0
-DA:927,0
-DA:929,0
-DA:936,0
-DA:939,0
-DA:941,0
-DA:942,0
-DA:943,0
-DA:944,0
-DA:946,0
-DA:954,3818
-DA:956,26171
-DA:957,18535
-DA:958,4869
-DA:960,13666
-DA:961,3818
-DA:970,0
-DA:972,0
-DA:973,0
-DA:974,0
-DA:976,0
-DA:977,0
-DA:1133,1307
-DA:1135,1307
-DA:1136,1307
-DA:1137,1307
-DA:1138,8587
-DA:1140,5973
-DA:1141,5973
-DA:1142,5973
-DA:1144,1307
-DA:1145,1307
-DA:1147,207
-DA:1148,100
-DA:1150,107
-DA:1152,1207
-DA:1153,1207
-DA:1154,0
-DA:1178,0
-DA:1181,0
-DA:1183,0
-DA:1186,0
-DA:1188,0
-DA:1190,0
-DA:1194,0
-DA:1195,0
-DA:1196,0
-DA:1197,0
-DA:1200,0
-DA:1201,0
-DA:1204,0
-DA:1207,0
-DA:1209,0
-DA:1213,0
-DA:1214,0
-DA:1215,0
-DA:1216,0
-DA:1219,0
-DA:1220,0
-DA:1222,0
-DA:1225,0
-DA:1230,0
-DA:1390,7724
-DA:1392,7724
-DA:1395,7724
-DA:1403,0
-DA:1405,0
-DA:1408,0
-BA:105,0
-BA:105,0
-BA:119,0
-BA:119,0
-BA:571,0
-BA:571,0
-BA:571,1
-BA:571,2
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,2
-BA:850,1
-BA:850,2
-BA:850,2
-BA:850,2
-BA:850,2
-BA:850,2
-BA:850,1
-BA:850,2
-BA:850,2
-BA:850,2
-BA:850,2
-BA:908,0
-BA:908,0
-BA:908,0
-BA:908,0
-BA:913,0
-BA:913,0
-BA:913,0
-BA:913,0
-BA:918,0
-BA:918,0
-BA:918,0
-BA:918,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:956,0
-BA:956,0
-BA:956,2
-BA:956,2
-BA:956,2
-BA:956,2
-BA:957,0
-BA:957,0
-BA:957,2
-BA:957,2
-BA:957,2
-BA:957,2
-BA:972,0
-BA:972,0
-BA:972,0
-BA:972,0
-BA:973,0
-BA:973,0
-BA:973,0
-BA:973,0
-BA:1138,0
-BA:1138,0
-BA:1138,0
-BA:1138,0
-BA:1138,2
-BA:1138,2
-BA:1138,2
-BA:1138,2
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1142,2
-BA:1142,2
-BA:1142,2
-BA:1142,2
-BA:1145,0
-BA:1145,0
-BA:1145,0
-BA:1145,0
-BA:1145,2
-BA:1145,2
-BA:1145,2
-BA:1145,2
-BA:1147,0
-BA:1147,0
-BA:1147,0
-BA:1147,0
-BA:1147,2
-BA:1147,2
-BA:1147,2
-BA:1147,2
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1152,2
-BA:1152,1
-BA:1152,2
-BA:1152,1
-BA:1181,0
-BA:1181,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1190,0
-BA:1190,0
-BA:1195,0
-BA:1195,0
-BA:1197,0
-BA:1197,0
-BA:1200,0
-BA:1200,0
-BA:1209,0
-BA:1209,0
-BA:1214,0
-BA:1214,0
-BA:1216,0
-BA:1216,0
-BA:1219,0
-BA:1219,0
-BA:1395,2
-BA:1395,2
-BA:1395,2
-BA:1395,2
-BA:1395,2
-BA:1395,2
-BA:1395,2
-BA:1395,2
-BA:1395,2
-BA:1395,2
-BA:1395,2
-BA:1395,2
-BA:1408,0
-BA:1408,0
-BA:1408,0
-BA:1408,0
-BA:1408,0
-BA:1408,0
-BA:1408,0
-BA:1408,0
-LF:236
-LH:109
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:404,_ZNKSt6vectorISsSaISsEE3endEv
-FN:386,_ZNKSt6vectorISsSaISsEE5beginEv
-FN:526,_ZNKSt6vectorISsSaISsEE5emptyEv
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-DA:79,0
-DA:97,0
-DA:98,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:299,0
-DA:300,0
-DA:301,0
-DA:386,0
-DA:387,0
-DA:404,0
-DA:405,0
-DA:526,0
-DA:527,0
-BA:149,0
-BA:149,0
-LF:19
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stream_iterator.h
-FN:181,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERSoPKc
-FN:185,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERKS2_
-FN:202,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEdeEv
-FN:206,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEppEv
-FN:191,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEaSERKSs
-DA:181,0
-DA:182,0
-DA:185,0
-DA:186,0
-DA:191,0
-DA:196,0
-DA:197,0
-DA:198,0
-DA:202,0
-DA:203,0
-DA:206,0
-DA:207,0
-BA:197,0
-BA:197,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSsEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSsEEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsSsEED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSsEEEC2ERKS6_
-FN:71,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEEC2ERKSA_
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsSsEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEE8max_sizeEv
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEEE8max_sizeEv
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE8max_sizeEv
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSsEEE8max_sizeEv
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE10deallocateEPS2_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSsEEE10deallocateEPS5_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEE10deallocateEPS9_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEEE10deallocateEPS9_j
-FN:107,_ZN9__gnu_cxx13new_allocatorISsE9constructEPSsRKSs
-FN:118,_ZN9__gnu_cxx13new_allocatorISsE7destroyEPSs
-FN:107,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsSsEE9constructEPS3_RKS3_
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsSsEE7destroyEPS3_
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEE7destroyEPS7_
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSsEEE8allocateEjPKv
-FN:107,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEE9constructEPS7_RKS7_
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEE8allocateEjPKv
-FN:107,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEE9constructEPS7_RKS7_
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEEE8allocateEjPKv
-DA:69,62
-DA:71,186
-DA:76,0
-DA:87,1307
-DA:89,1307
-DA:90,0
-DA:92,1307
-DA:97,0
-DA:98,0
-DA:101,1307
-DA:102,1307
-DA:107,1307
-DA:108,1307
-DA:118,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,1
-BA:89,2
-BA:89,1
-BA:89,2
-BA:108,0
-BA:108,0
-BA:108,0
-BA:108,0
-BA:108,2
-BA:108,1
-BA:108,2
-BA:108,1
-LF:14
-LH:9
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,2
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/istream
-FN:585,_ZNSiC2Ev
-FN:105,_ZNSiD2Ev
-FN:804,_ZNSdC2Ev
-FN:801,_ZNSdD2Ev
-DA:105,0
-DA:106,0
-DA:585,0
-DA:586,0
-DA:587,0
-DA:801,0
-DA:804,0
-DA:805,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-DA:95,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:509,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:536,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:555,_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:509,0
-DA:510,0
-DA:511,0
-DA:536,0
-DA:537,0
-DA:555,0
-DA:556,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/diskindex/mmap.h
-FN:79,_ZN7tagcoll9diskindex4MMap5alignIiEET_S3_
-FN:91,_ZN7tagcoll9diskindex11MMapIndexerD2Ev
-FN:91,_ZN7tagcoll9diskindex11MMapIndexerD0Ev
-FN:91,_ZN7tagcoll9diskindex11MMapIndexerD1Ev
-DA:79,12
-DA:81,12
-DA:91,0
-BA:91,0
-BA:91,0
-BA:91,0
-BA:91,0
-BA:91,0
-BA:91,0
-LF:3
-LH:2
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/maint/sourcedir.cc
-FN:121,_Z41__static_initialization_and_destruction_0ii
-FN:121,_GLOBAL__I_sourcedir.cc
-FN:15,_ZN3ept7debtags9SourceDir8fileTypeERKSs
-FN:94,_ZN3ept7debtags9SourceDir16readVocabulariesERNS0_16VocabularyMergerE
-FN:77,_ZN3ept7debtags9SourceDir12tagTimestampEv
-FN:60,_ZN3ept7debtags9SourceDir12vocTimestampEv
-FN:43,_ZN3ept7debtags9SourceDir9timestampEv
-DA:15,802
-DA:17,802
-DA:21,622
-DA:24,542
-DA:25,542
-DA:26,80
-DA:27,462
-DA:28,80
-DA:32,382
-DA:34,302
-DA:35,302
-DA:36,0
-DA:37,302
-DA:38,0
-DA:40,302
-DA:43,20
-DA:45,20
-DA:47,20
-DA:48,200
-DA:50,180
-DA:51,180
-DA:53,36
-DA:54,54
-DA:55,20
-DA:57,20
-DA:60,62
-DA:62,62
-DA:64,60
-DA:65,632
-DA:67,572
-DA:68,1086
-DA:70,58
-DA:71,116
-DA:72,60
-DA:74,60
-DA:77,0
-DA:79,0
-DA:81,0
-DA:82,0
-DA:84,0
-DA:85,0
-DA:87,0
-DA:88,0
-DA:89,0
-DA:91,0
-DA:94,6
-DA:96,6
-DA:98,32
-DA:100,26
-DA:101,26
-DA:104,2
-DA:107,4
-DA:109,24
-DA:112,0
-DA:115,0
-DA:117,6
-DA:121,6
-BA:17,2
-BA:17,2
-BA:21,2
-BA:21,2
-BA:25,2
-BA:25,2
-BA:27,2
-BA:27,2
-BA:32,2
-BA:32,2
-BA:35,1
-BA:35,2
-BA:37,1
-BA:37,2
-BA:45,1
-BA:45,2
-BA:48,2
-BA:48,2
-BA:51,2
-BA:51,2
-BA:54,2
-BA:54,2
-BA:62,2
-BA:62,2
-BA:65,2
-BA:65,2
-BA:68,2
-BA:68,2
-BA:68,1
-BA:68,2
-BA:71,2
-BA:71,1
-BA:79,0
-BA:79,0
-BA:82,0
-BA:82,0
-BA:85,0
-BA:85,0
-BA:85,0
-BA:85,0
-BA:88,0
-BA:88,0
-BA:96,2
-BA:96,1
-BA:98,2
-BA:98,2
-BA:101,2
-BA:101,2
-BA:109,1
-BA:109,2
-BA:121,2
-BA:121,1
-BA:121,2
-BA:121,1
-LF:57
-LH:43
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/string.h
-FN:236,_ZN6wibble3str8joinpathERKSsS2_
-DA:236,0
-DA:238,0
-DA:239,0
-DA:240,0
-DA:241,0
-DA:243,0
-DA:244,0
-DA:245,0
-DA:247,0
-DA:249,0
-DA:250,0
-DA:252,0
-BA:238,0
-BA:238,0
-BA:240,0
-BA:240,0
-BA:243,0
-BA:243,0
-BA:244,0
-BA:244,0
-BA:249,0
-BA:249,0
-LF:12
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/sys/fs.h
-FN:99,_ZN6wibble3sys2fs9Directory14const_iteratorptEv
-FN:105,_ZNK6wibble3sys2fs9Directory14const_iteratorneERKS3_
-FN:114,_ZNK6wibble3sys2fs9Directory4pathEv
-FN:88,_ZN6wibble3sys2fs9Directory14const_iteratorppEv
-FN:65,_ZN6wibble3sys2fs9Directory14const_iteratorD1Ev
-DA:65,1109
-DA:88,1002
-DA:90,1002
-DA:92,107
-DA:93,107
-DA:95,1002
-DA:99,1006
-DA:105,1002
-DA:107,1002
-DA:114,220
-BA:65,1
-BA:65,2
-BA:90,2
-BA:90,2
-BA:107,2
-BA:107,2
-BA:107,1
-BA:107,2
-LF:10
-LH:10
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaIcED1Ev
-FN:100,_ZNSaIcEC1ERKS_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:277,_ZNKSs7_M_dataEv
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:701,_ZNKSsixEj
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:1551,_ZNKSs13get_allocatorEv
-FN:306,_ZNKSs8_M_checkEjPKc
-FN:1923,_ZNKSs6substrEjj
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2136,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S3_
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-FN:501,_ZNSsaSERKSs
-FN:2188,_ZSteqIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_EPKS3_
-DA:178,0
-DA:183,0
-DA:184,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:306,0
-DA:308,0
-DA:309,0
-DA:310,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:686,0
-DA:687,0
-DA:701,0
-DA:704,0
-DA:1551,0
-DA:1552,0
-DA:1923,0
-DA:1925,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2136,0
-DA:2140,0
-DA:2141,0
-DA:2142,0
-DA:2188,0
-DA:2189,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:308,0
-BA:308,0
-LF:41
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-DA:69,0
-DA:71,0
-DA:76,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,2
-LF:1
-LH:1
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/maint/path.cc
-FN:67,_ZN3ept7debtags4Path9timestampERKSs
-FN:63,_ZN3ept7debtags4Path6accessERKSsi
-FN:41,_ZN3ept7debtagsL7userdirEv
-FN:52,_ZN3ept7debtags4Path8instanceEv
-FN:92,_ZN3ept7debtags4Path19debtagsUserIndexDirEv
-FN:130,_ZN3ept7debtags4Path10userPkgidxEv
-FN:122,_ZN3ept7debtags4Path14userTagdbIndexEv
-FN:118,_ZN3ept7debtags4Path9userTagdbEv
-FN:106,_ZN3ept7debtags4Path19userVocabularyIndexEv
-FN:102,_ZN3ept7debtags4Path14userVocabularyEv
-FN:91,_ZN3ept7debtags4Path20debtagsUserSourceDirEv
-FN:90,_ZN3ept7debtags4Path15debtagsIndexDirEv
-FN:126,_ZN3ept7debtags4Path6pkgidxEv
-FN:114,_ZN3ept7debtags4Path10tagdbIndexEv
-FN:110,_ZN3ept7debtags4Path5tagdbEv
-FN:98,_ZN3ept7debtags4Path15vocabularyIndexEv
-FN:94,_ZN3ept7debtags4Path10vocabularyEv
-FN:89,_ZN3ept7debtags4Path16debtagsSourceDirEv
-FN:84,_ZN3ept7debtags4Path22setDebtagsUserIndexDirERKSs
-FN:80,_ZN3ept7debtags4Path23setDebtagsUserSourceDirERKSs
-FN:76,_ZN3ept7debtags4Path18setDebtagsIndexDirERKSs
-FN:72,_ZN3ept7debtags4Path19setDebtagsSourceDirERKSs
-DA:41,2
-DA:43,2
-DA:45,2
-DA:46,2
-DA:48,0
-DA:52,732
-DA:53,732
-DA:54,1
-DA:55,1
-DA:56,1
-DA:57,2
-DA:58,2
-DA:60,732
-DA:63,12
-DA:64,12
-DA:67,300
-DA:68,300
-DA:69,580
-DA:72,62
-DA:74,62
-DA:75,62
-DA:76,62
-DA:78,62
-DA:79,62
-DA:80,62
-DA:82,62
-DA:83,62
-DA:84,62
-DA:86,62
-DA:87,62
-DA:89,72
-DA:90,121
-DA:91,82
-DA:92,205
-DA:94,33
-DA:95,33
-DA:98,32
-DA:99,32
-DA:102,65
-DA:103,65
-DA:106,65
-DA:107,65
-DA:110,11
-DA:111,11
-DA:114,11
-DA:115,11
-DA:118,22
-DA:119,22
-DA:122,22
-DA:123,22
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-BA:53,2
-BA:53,2
-BA:69,2
-BA:69,2
-LF:54
-LH:49
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/maint/path.h
-FN:38,_ZN3ept7debtags4PathC1Ev
-DA:38,1
-LF:1
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/string.h
-FN:236,_ZN6wibble3str8joinpathERKSsS2_
-DA:236,0
-DA:238,0
-DA:239,0
-DA:240,0
-DA:241,0
-DA:243,0
-DA:244,0
-DA:245,0
-DA:247,0
-DA:249,0
-DA:250,0
-DA:252,0
-BA:238,0
-BA:238,0
-BA:240,0
-BA:240,0
-BA:243,0
-BA:243,0
-BA:244,0
-BA:244,0
-BA:249,0
-BA:249,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/backward/auto_ptr.h
-FN:263,_ZNSt8auto_ptrI4statEC1ESt12auto_ptr_refIS0_E
-FN:214,_ZNKSt8auto_ptrI4statE3getEv
-FN:197,_ZNKSt8auto_ptrI4statEptEv
-FN:228,_ZNSt8auto_ptrI4statE7releaseEv
-FN:56,_ZNSt12auto_ptr_refI4statEC1EPS0_
-FN:278,_ZNSt8auto_ptrI4statEcvSt12auto_ptr_refIT_EIS0_EEv
-FN:173,_ZNSt8auto_ptrI4statED1Ev
-DA:56,651
-DA:173,1887
-DA:197,585
-DA:200,585
-DA:214,1236
-DA:228,1236
-DA:230,1236
-DA:231,1236
-DA:232,1236
-DA:263,651
-DA:264,651
-DA:278,651
-DA:279,651
-LF:13
-LH:13
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaIcED1Ev
-FN:100,_ZNSaIcEC1ERKS_
-FN:100,_ZNSaIcEC2ERKS_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:277,_ZNKSs7_M_dataEv
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:701,_ZNKSsixEj
-FN:1534,_ZNKSs5c_strEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:1551,_ZNKSs13get_allocatorEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:306,_ZNKSs8_M_checkEjPKc
-FN:1923,_ZNKSs6substrEjj
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2136,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S3_
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-FN:501,_ZNSsaSERKSs
-FN:928,_ZNSs6assignEPKc
-FN:509,_ZNSsaSEPKc
-DA:178,0
-DA:183,0
-DA:184,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:306,0
-DA:308,0
-DA:309,0
-DA:310,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:509,0
-DA:510,0
-DA:606,0
-DA:607,0
-DA:686,0
-DA:687,0
-DA:701,0
-DA:704,0
-DA:928,0
-DA:931,0
-DA:1534,0
-DA:1535,0
-DA:1551,0
-DA:1552,0
-DA:1923,0
-DA:1925,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2136,0
-DA:2140,0
-DA:2141,0
-DA:2142,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:308,0
-BA:308,0
-LF:53
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-DA:261,0
-DA:262,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-DA:69,0
-DA:71,0
-DA:76,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/maint/sourcedir.h
-FN:39,_ZN3ept7debtags9SourceDirD1Ev
-FN:48,_ZN3ept7debtags9SourceDirC1ERKSs
-DA:39,82
-DA:48,82
-LF:2
-LH:2
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/maint/vocabularyindexer.cc
-FN:25,_ZNK3ept7debtags17VocabularyIndexer12needsRebuildEv
-FN:47,_ZNK3ept7debtags17VocabularyIndexer20userIndexIsRedundantEv
-FN:193,_Z41__static_initialization_and_destruction_0ii
-FN:193,_GLOBAL__I_vocabularyindexer.cc
-FN:150,_ZN3ept7debtags17VocabularyIndexer21getUpToDateVocabularyERSsS2_
-FN:130,_ZN3ept7debtags17VocabularyIndexer24deleteRedundantUserIndexEv
-FN:65,_ZN3ept7debtags17VocabularyIndexer7rebuildERKSsS3_
-FN:99,_ZN3ept7debtags17VocabularyIndexer15rebuildIfNeededEv
-FN:15,_ZN3ept7debtags17VocabularyIndexer6rescanEv
-FN:9,_ZN3ept7debtags17VocabularyIndexerC1Ev
-FN:183,_ZN3ept7debtags17VocabularyIndexer23obtainWorkingVocabularyERSsS2_
-FN:9,_ZN3ept7debtags17VocabularyIndexerC2Ev
-DA:9,31
-DA:10,31
-DA:12,31
-DA:13,31
-DA:15,31
-DA:17,31
-DA:18,31
-DA:19,31
-DA:20,62
-DA:21,62
-DA:22,62
-DA:23,31
-DA:25,31
-DA:28,31
-DA:29,3
-DA:32,28
-DA:33,28
-DA:36,0
-DA:37,0
-DA:41,0
-DA:42,0
-DA:44,0
-DA:47,31
-DA:50,31
-DA:51,2
-DA:54,29
-DA:55,29
-DA:59,0
-DA:60,0
-DA:62,0
-DA:65,3
-DA:70,3
-DA:73,3
-DA:74,3
-DA:75,3
-DA:77,3
-DA:78,2
-DA:83,1
-DA:84,1
-DA:88,1
-DA:90,1
-DA:92,1
-DA:93,0
-DA:95,1
-DA:96,1
-DA:99,31
-DA:101,31
-DA:105,3
-DA:109,1
-DA:110,1
-DA:111,0
-DA:112,0
-DA:113,0
-DA:114,0
-DA:115,0
-DA:116,0
-DA:118,2
-DA:119,4
-DA:120,4
-DA:121,1
-DA:122,1
-DA:123,2
-DA:125,1
-DA:127,28
-DA:130,31
-DA:132,31
-DA:135,0
-DA:137,0
-DA:138,0
-DA:140,0
-DA:142,0
-DA:143,0
-DA:145,0
-DA:147,31
-DA:150,31
-DA:153,31
-DA:154,2
-DA:157,29
-DA:160,29
-DA:161,58
-DA:162,29
-DA:167,0
-DA:168,0
-DA:171,0
-DA:174,0
-DA:175,0
-DA:176,0
-DA:179,0
-DA:183,31
-DA:185,31
-DA:187,31
-DA:188,31
-DA:189,31
-DA:193,6
-BA:28,2
-BA:28,2
-BA:28,2
-BA:28,1
-BA:28,2
-BA:28,1
-BA:28,2
-BA:28,1
-BA:32,2
-BA:32,1
-BA:32,2
-BA:32,1
-BA:32,2
-BA:32,1
-BA:36,0
-BA:36,0
-BA:41,0
-BA:41,0
-BA:41,0
-BA:41,0
-BA:41,0
-BA:41,0
-BA:50,2
-BA:50,2
-BA:50,2
-BA:50,1
-BA:54,2
-BA:54,1
-BA:59,0
-BA:59,0
-BA:59,0
-BA:59,0
-BA:59,0
-BA:59,0
-BA:77,2
-BA:77,2
-BA:92,1
-BA:92,2
-BA:101,2
-BA:101,2
-BA:105,2
-BA:105,2
-BA:105,2
-BA:105,2
-BA:105,2
-BA:105,2
-BA:105,0
-BA:105,0
-BA:105,2
-BA:105,2
-BA:109,2
-BA:109,1
-BA:113,0
-BA:113,0
-BA:115,0
-BA:115,0
-BA:120,2
-BA:120,2
-BA:132,1
-BA:132,2
-BA:135,0
-BA:135,0
-BA:140,0
-BA:140,0
-BA:153,2
-BA:153,2
-BA:153,2
-BA:153,1
-BA:153,2
-BA:153,1
-BA:153,2
-BA:153,1
-BA:157,2
-BA:157,1
-BA:157,2
-BA:157,1
-BA:157,2
-BA:157,1
-BA:167,0
-BA:167,0
-BA:171,0
-BA:171,0
-BA:171,0
-BA:171,0
-BA:171,0
-BA:171,0
-BA:193,2
-BA:193,1
-BA:193,2
-BA:193,1
-LF:94
-LH:65
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/maint/vocabularyindexer.h
-FN:50,_ZNK3ept7debtags17VocabularyIndexer15sourceTimestampEv
-FN:37,_ZN3ept7debtags17VocabularyIndexerD1Ev
-DA:37,31
-DA:50,114
-BA:50,1
-BA:50,2
-LF:2
-LH:2
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/maint/vocabularymerger.h
-FN:41,_ZN3ept7debtags16VocabularyMerger12FacetIndexerC1ERS1_
-FN:51,_ZN3ept7debtags16VocabularyMerger10TagIndexerC1ERS1_
-FN:119,_ZNK3ept7debtags16VocabularyMerger12facetIndexerEv
-FN:127,_ZNK3ept7debtags16VocabularyMerger10tagIndexerEv
-FN:95,_ZNK3ept7debtags16VocabularyMerger5emptyEv
-FN:42,_ZN3ept7debtags16VocabularyMerger12FacetIndexerD1Ev
-FN:57,_ZN3ept7debtags16VocabularyMerger7TagDataD1Ev
-FN:68,_ZN3ept7debtags16VocabularyMerger9FacetDataD1Ev
-FN:90,_ZN3ept7debtags16VocabularyMergerC1Ev
-FN:52,_ZN3ept7debtags16VocabularyMerger10TagIndexerD1Ev
-FN:34,_ZN3ept7debtags16VocabularyMergerD1Ev
-DA:34,0
-DA:41,0
-DA:42,0
-DA:51,0
-DA:52,0
-DA:57,0
-DA:68,0
-DA:90,0
-DA:95,3
-DA:119,0
-DA:127,0
-BA:42,0
-BA:42,0
-BA:52,0
-BA:52,0
-LF:11
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/exception.h
-FN:190,_ZNK6wibble9exception7Generic4typeEv
-FN:137,_ZN6wibble9exception7ContextD2Ev
-FN:187,_ZN6wibble9exception7GenericD2Ev
-FN:395,_ZN6wibble9exception6SystemD1Ev
-FN:213,_ZNK6wibble9exception7Generic4whatEv
-FN:187,_ZN6wibble9exception7GenericD0Ev
-FN:187,_ZN6wibble9exception7GenericD1Ev
-FN:193,_ZNK6wibble9exception7Generic4descEv
-FN:154,_ZNK6wibble9exception7Context13formatContextEv
-FN:205,_ZNK6wibble9exception7Generic8fullInfoEv
-DA:137,0
-DA:154,0
-DA:155,0
-DA:156,0
-DA:157,0
-DA:159,0
-DA:161,0
-DA:162,0
-DA:163,0
-DA:187,0
-DA:190,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:205,0
-DA:206,0
-DA:207,0
-DA:209,0
-DA:210,0
-DA:213,0
-DA:395,0
-BA:156,0
-BA:156,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:207,0
-BA:207,0
-BA:395,0
-BA:395,0
-LF:21
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/sys/fs.h
-FN:50,_ZN6wibble3sys2fs9DirectoryD2Ev
-FN:111,_ZN6wibble3sys2fs9DirectoryC2ERKSs
-DA:50,96
-DA:111,96
-LF:2
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsSsEEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEEED2Ev
-FN:100,_ZNSaIcEC1ERKS_
-FN:100,_ZNSaIcEC2ERKS_
-FN:106,_ZNSaISsED2Ev
-FN:106,_ZNSaISt4pairIKSsSsEED1Ev
-FN:106,_ZNSaISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEED1Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEEEC2Ev
-FN:106,_ZNSaISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEED1Ev
-FN:104,_ZNSaISt4pairIKSsSsEEC1ISt13_Rb_tree_nodeIS1_EEERKSaIT_E
-FN:104,_ZNSaISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEC1ISt13_Rb_tree_nodeIS5_EEERKSaIT_E
-FN:104,_ZNSaISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEEC1ISt13_Rb_tree_nodeIS5_EEERKSaIT_E
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:104,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:7
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:276,0
-BA:276,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:277,_ZNKSs7_M_dataEv
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:612,_ZNKSs6lengthEv
-FN:1534,_ZNKSs5c_strEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:1551,_ZNKSs13get_allocatorEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:501,_ZNSsaSERKSs
-FN:2162,_ZSteqIcEN9__gnu_cxx11__enable_ifIXsrSt9__is_charIT_E7__valueEbE6__typeERKSbIS3_St11char_traitsIS3_ESaIS3_EESC_
-FN:2201,_ZStneIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:835,_ZNSs6appendEPKc
-FN:2121,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:612,0
-DA:613,0
-DA:686,0
-DA:687,0
-DA:835,0
-DA:838,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2121,0
-DA:2123,0
-DA:2124,0
-DA:2125,0
-DA:2162,0
-DA:2165,0
-DA:2201,0
-DA:2202,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-LF:71
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:668,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_EPKS3_RKS6_
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-DA:668,0
-DA:673,0
-DA:674,0
-DA:675,0
-DA:676,0
-DA:677,0
-DA:678,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:23
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:257,0
-DA:258,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb0EE3__bES7_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb1EE3__bES7_
-FN:268,_ZNSt12__niter_baseISt16ostream_iteratorISscSt11char_traitsIcEELb0EE3__bES3_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPKSsSt16ostream_iteratorISscSt11char_traitsIcEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPKSsSt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_SD_SC_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET0_T_SD_SC_
-DA:268,0
-DA:269,0
-DA:276,0
-DA:277,0
-DA:286,0
-DA:287,0
-DA:337,0
-DA:340,0
-DA:342,0
-DA:343,0
-DA:344,0
-DA:346,0
-DA:385,0
-DA:393,0
-DA:396,0
-DA:430,0
-DA:435,0
-DA:456,0
-DA:466,0
-BA:340,0
-BA:340,0
-LF:19
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-DA:87,0
-DA:88,0
-DA:97,0
-DA:101,0
-DA:103,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-BA:101,0
-BA:101,0
-LF:9
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEC1ERKS2_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-DA:683,0
-DA:747,0
-DA:748,0
-DA:769,0
-DA:770,0
-LF:5
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,0
-DA:166,0
-DA:167,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_map.h
-FN:384,_ZNKSt3mapISsN3ept7debtags16VocabularyMerger9FacetDataESt4lessISsESaISt4pairIKSsS3_EEE5emptyEv
-FN:155,_ZNSt3mapISsN3ept7debtags16VocabularyMerger9FacetDataESt4lessISsESaISt4pairIKSsS3_EEEC1Ev
-FN:92,_ZNSt3mapISsSsSt4lessISsESaISt4pairIKSsSsEEED2Ev
-FN:92,_ZNSt3mapISsN3ept7debtags16VocabularyMerger7TagDataESt4lessISsESaISt4pairIKSsS3_EEED1Ev
-FN:92,_ZNSt3mapISsN3ept7debtags16VocabularyMerger9FacetDataESt4lessISsESaISt4pairIKSsS3_EEED1Ev
-DA:92,0
-DA:155,0
-DA:156,0
-DA:384,3
-DA:385,3
-LF:5
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_pair.h
-FN:73,_ZNSt4pairIKSsSsED1Ev
-FN:73,_ZNSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEED1Ev
-FN:73,_ZNSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEED1Ev
-DA:73,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_tree.h
-FN:452,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_M_beginEv
-FN:452,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_M_beginEv
-FN:452,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_M_beginEv
-FN:637,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE5emptyEv
-FN:398,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE13_Rb_tree_implIS6_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:398,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13_Rb_tree_implISA_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:398,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13_Rb_tree_implISA_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:415,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13_Rb_tree_implISA_Lb0EE13_M_initializeEv
-FN:347,_ZNKSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE21_M_get_Node_allocatorEv
-FN:347,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE21_M_get_Node_allocatorEv
-FN:403,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13_Rb_tree_implISA_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EEC1Ev
-FN:347,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE21_M_get_Node_allocatorEv
-FN:351,_ZNKSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE13get_allocatorEv
-FN:351,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13get_allocatorEv
-FN:351,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE13get_allocatorEv
-FN:360,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS6_E
-FN:360,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS2_E
-FN:388,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS2_E
-FN:936,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_M_eraseEPSt13_Rb_tree_nodeIS2_E
-FN:584,_ZNSt8_Rb_treeISsSt4pairIKSsSsESt10_Select1stIS2_ESt4lessISsESaIS2_EED1Ev
-FN:388,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS6_E
-FN:936,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_M_eraseEPSt13_Rb_tree_nodeIS6_E
-FN:584,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EED1Ev
-FN:360,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS6_E
-FN:388,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS6_E
-FN:936,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EE8_M_eraseEPSt13_Rb_tree_nodeIS6_E
-FN:584,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEESt10_Select1stIS6_ESt4lessISsESaIS6_EED1Ev
-DA:347,0
-DA:348,0
-DA:351,0
-DA:352,0
-DA:360,0
-DA:361,0
-DA:388,0
-DA:390,0
-DA:391,0
-DA:392,0
-DA:398,0
-DA:403,0
-DA:405,0
-DA:406,0
-DA:415,0
-DA:417,0
-DA:418,0
-DA:419,0
-DA:420,0
-DA:421,0
-DA:452,0
-DA:453,0
-DA:479,0
-DA:480,0
-DA:487,0
-DA:488,0
-DA:562,0
-DA:584,0
-DA:585,0
-DA:637,3
-DA:638,3
-DA:936,0
-DA:939,0
-DA:941,0
-DA:942,0
-DA:943,0
-DA:944,0
-DA:946,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-LF:38
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:404,_ZNKSt6vectorISsSaISsEE3endEv
-FN:386,_ZNKSt6vectorISsSaISsEE5beginEv
-FN:526,_ZNKSt6vectorISsSaISsEE5emptyEv
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-DA:79,0
-DA:97,0
-DA:98,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:299,0
-DA:300,0
-DA:301,0
-DA:386,0
-DA:387,0
-DA:404,0
-DA:405,0
-DA:526,0
-DA:527,0
-BA:149,0
-BA:149,0
-LF:19
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stream_iterator.h
-FN:181,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERSoPKc
-FN:185,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERKS2_
-FN:202,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEdeEv
-FN:206,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEppEv
-FN:191,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEaSERKSs
-DA:181,0
-DA:182,0
-DA:185,0
-DA:186,0
-DA:191,0
-DA:196,0
-DA:197,0
-DA:198,0
-DA:202,0
-DA:203,0
-DA:206,0
-DA:207,0
-BA:197,0
-BA:197,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSsEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEEED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsSsEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsSsEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEEC2Ev
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsSsEE7destroyEPS3_
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEEE10deallocateEPS9_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSsEEE10deallocateEPS5_j
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN3ept7debtags16VocabularyMerger7TagDataEEE7destroyEPS7_
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEE7destroyEPS7_
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept7debtags16VocabularyMerger9FacetDataEEEE10deallocateEPS9_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-DA:69,0
-DA:71,0
-DA:76,0
-DA:97,0
-DA:98,0
-DA:118,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,2
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/istream
-FN:585,_ZNSiC2Ev
-FN:105,_ZNSiD2Ev
-FN:804,_ZNSdC2Ev
-FN:801,_ZNSdD2Ev
-DA:105,0
-DA:106,0
-DA:585,0
-DA:586,0
-DA:587,0
-DA:801,0
-DA:804,0
-DA:805,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-DA:95,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:509,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:536,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:555,_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:509,0
-DA:510,0
-DA:511,0
-DA:536,0
-DA:537,0
-DA:555,0
-DA:556,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/diskindex/mmap.h
-FN:89,_ZN7tagcoll9diskindex11MMapIndexerC2Ev
-FN:91,_ZN7tagcoll9diskindex11MMapIndexerD0Ev
-FN:91,_ZN7tagcoll9diskindex11MMapIndexerD1Ev
-FN:91,_ZN7tagcoll9diskindex11MMapIndexerD2Ev
-DA:89,0
-DA:91,0
-BA:91,0
-BA:91,0
-BA:91,0
-BA:91,0
-BA:91,0
-BA:91,0
-LF:2
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/maint/debtagsindexer.cc
-FN:69,_ZNK3ept7debtags14DebtagsIndexer12needsRebuildEv
-FN:91,_ZNK3ept7debtags14DebtagsIndexer20userIndexIsRedundantEv
-FN:27,_ZNK3ept7debtags14PkgIdGenerator11encodedSizeEv
-FN:23,_ZN3ept7debtags14PkgIdGeneratorC1Ev
-FN:23,_ZN3ept7debtags14PkgIdGeneratorD0Ev
-FN:23,_ZN3ept7debtags14PkgIdGeneratorD1Ev
-FN:215,_ZN3ept7debtags14DebtagsIndexer16getUpToDateTagdbERSsS2_
-FN:195,_ZN3ept7debtags14DebtagsIndexer24deleteRedundantUserIndexEv
-FN:36,_ZNK3ept7debtags14PkgIdGenerator6encodeEPc
-FN:109,_ZN3ept7debtags14DebtagsIndexer7rebuildERKSsS3_
-FN:164,_ZN3ept7debtags14DebtagsIndexer15rebuildIfNeededEv
-FN:59,_ZN3ept7debtags14DebtagsIndexer6rescanEv
-FN:51,_ZN3ept7debtags14DebtagsIndexerC1ERNS0_10VocabularyE
-FN:249,_ZN3ept7debtags14DebtagsIndexer20obtainWorkingDebtagsERNS0_10VocabularyERSsS4_
-FN:51,_ZN3ept7debtags14DebtagsIndexerC2ERNS0_10VocabularyE
-DA:23,2
-DA:27,3
-DA:29,3
-DA:30,63438
-DA:32,63435
-DA:33,3
-DA:36,2
-DA:38,2
-DA:39,2
-DA:40,42292
-DA:43,42290
-DA:44,42290
-DA:45,42290
-DA:47,2
-DA:51,10
-DA:54,10
-DA:56,10
-DA:57,10
-DA:59,10
-DA:61,10
-DA:62,10
-DA:63,10
-DA:64,20
-DA:65,20
-DA:66,20
-DA:67,10
-DA:69,10
-DA:72,10
-DA:73,2
-DA:76,8
-DA:77,8
-DA:80,0
-DA:81,0
-DA:85,0
-DA:86,0
-DA:88,0
-DA:91,10
-DA:94,10
-DA:95,1
-DA:98,9
-DA:99,9
-DA:103,0
-DA:104,0
-DA:106,0
-DA:109,2
-DA:113,2
-DA:116,2
-DA:117,2
-DA:118,2
-DA:120,2
-DA:122,1
-DA:125,1
-DA:126,21146
-DA:128,21145
-DA:132,1
-DA:133,1
-DA:134,1
-DA:137,1
-DA:138,1
-DA:141,1
-DA:143,1
-DA:145,1
-DA:148,1
-DA:149,1
-DA:150,1
-DA:151,1
-DA:152,1
-DA:157,1
-DA:158,0
-DA:160,1
-DA:161,1
-DA:164,10
-DA:166,10
-DA:170,2
-DA:174,1
-DA:175,1
-DA:176,0
-DA:177,0
-DA:178,0
-DA:179,0
-DA:180,0
-DA:181,0
-DA:183,1
-DA:184,2
-DA:185,2
-DA:186,0
-DA:187,1
-DA:188,2
-DA:190,1
-DA:192,8
-DA:195,10
-DA:197,10
-DA:200,0
-DA:202,0
-DA:203,0
-DA:205,0
-DA:207,0
-DA:208,0
-DA:210,0
-DA:212,10
-DA:215,10
-DA:218,10
-DA:219,1
-DA:222,9
-DA:225,9
-DA:226,18
-DA:227,9
-DA:232,0
-DA:233,0
-DA:236,0
-DA:239,0
-DA:240,0
-DA:241,0
-DA:244,0
-DA:249,10
-DA:251,10
-DA:253,10
-DA:254,10
-DA:255,10
-BA:23,0
-BA:23,0
-BA:23,1
-BA:23,2
-BA:30,2
-BA:30,2
-BA:40,2
-BA:40,2
-BA:72,2
-BA:72,2
-BA:72,2
-BA:72,1
-BA:72,2
-BA:72,1
-BA:72,2
-BA:72,1
-BA:76,2
-BA:76,1
-BA:76,2
-BA:76,1
-BA:76,2
-BA:76,1
-BA:80,0
-BA:80,0
-BA:85,0
-BA:85,0
-BA:85,0
-BA:85,0
-BA:85,0
-BA:85,0
-BA:94,2
-BA:94,2
-BA:94,2
-BA:94,1
-BA:98,2
-BA:98,1
-BA:103,0
-BA:103,0
-BA:103,0
-BA:103,0
-BA:103,0
-BA:103,0
-BA:120,2
-BA:120,2
-BA:126,2
-BA:126,2
-BA:150,1
-BA:150,2
-BA:157,1
-BA:157,2
-BA:166,2
-BA:166,2
-BA:170,2
-BA:170,2
-BA:170,2
-BA:170,1
-BA:170,2
-BA:170,2
-BA:170,0
-BA:170,0
-BA:170,2
-BA:170,2
-BA:174,2
-BA:174,1
-BA:178,0
-BA:178,0
-BA:180,0
-BA:180,0
-BA:185,1
-BA:185,2
-BA:197,1
-BA:197,2
-BA:200,0
-BA:200,0
-BA:205,0
-BA:205,0
-BA:218,2
-BA:218,2
-BA:218,2
-BA:218,1
-BA:218,2
-BA:218,1
-BA:218,2
-BA:218,1
-BA:222,2
-BA:222,1
-BA:222,2
-BA:222,1
-BA:222,2
-BA:222,1
-BA:232,0
-BA:232,0
-BA:236,0
-BA:236,0
-BA:236,0
-BA:236,0
-BA:236,0
-BA:236,0
-LF:119
-LH:89
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/maint/debtagsindexer.h
-FN:25,_ZNK3ept7debtags14DebtagsIndexer15sourceTimestampEv
-FN:13,_ZN3ept7debtags14DebtagsIndexerD1Ev
-DA:13,10
-DA:25,34
-DA:27,34
-DA:28,34
-DA:29,34
-BA:28,1
-BA:28,2
-LF:5
-LH:5
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/maint/pkgid.h
-FN:41,_ZN3ept7debtags5PkgIdD1Ev
-DA:41,0
-LF:1
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/maint/serializer.h
-FN:75,_ZN3ept7debtags11StringToIntIN7tagcoll4coll8InserterINS3_14IntDiskIndexerEEEEC1ERNS0_5PkgIdERNS0_10VocabularyERKS6_
-FN:111,_ZN3ept7debtags11stringToIntIN7tagcoll4coll8InserterINS3_14IntDiskIndexerEEEEENS0_11StringToIntIT_EERNS0_5PkgIdERNS0_10VocabularyERKS8_
-FN:79,_ZN3ept7debtags11StringToIntIN7tagcoll4coll8InserterINS3_14IntDiskIndexerEEEEaSIN6wibble9SingletonISsEESt3setISsSt4lessISsESaISsEEEERS7_RKSt4pairIT_T0_E
-DA:75,1
-DA:76,1
-DA:79,21145
-DA:81,21145
-DA:82,21145
-DA:84,42290
-DA:87,21145
-DA:88,21145
-DA:89,21145
-DA:92,126871
-DA:95,105726
-DA:96,105726
-DA:97,105598
-DA:100,21145
-DA:102,21133
-DA:103,21133
-DA:105,21145
-DA:111,1
-DA:113,1
-BA:84,2
-BA:84,2
-BA:88,2
-BA:88,1
-BA:92,2
-BA:92,2
-BA:96,2
-BA:96,2
-BA:100,2
-BA:100,1
-BA:100,2
-BA:100,2
-BA:100,2
-BA:100,2
-LF:19
-LH:19
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/maint/sourcedir.h
-FN:39,_ZN3ept7debtags9SourceDirD1Ev
-FN:48,_ZN3ept7debtags9SourceDirC1ERKSs
-FN:61,_ZN3ept7debtags9SourceDir8readTagsIN7tagcoll4coll8InserterINS4_6SimpleISsSsEEEEEEvT_
-DA:39,0
-DA:48,0
-DA:61,4
-LF:3
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/maint/sourcedir.tcc
-DA:19,4
-DA:21,28
-DA:23,24
-DA:24,24
-DA:27,2
-DA:30,2
-DA:32,22
-DA:35,0
-DA:38,4
-BA:19,2
-BA:19,1
-BA:21,2
-BA:21,2
-BA:24,2
-BA:24,2
-BA:32,1
-BA:32,2
-LF:9
-LH:8
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/tag.h
-FN:175,_ZN3ept7debtags3TagD1Ev
-FN:182,_ZNK3ept7debtags3Tag5validEv
-FN:242,_ZNK3ept7debtags3Tag2idEv
-DA:175,0
-DA:182,0
-DA:242,0
-LF:3
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/vocabulary.h
-FN:114,_ZNK3ept7debtags10Vocabulary8TagIndex2idERKSs
-FN:203,_ZNK3ept7debtags10Vocabulary9tagByNameERKSs
-DA:114,0
-DA:203,0
-LF:2
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/empty.h
-FN:59,_ZNK6wibble5EmptyISsE5emptyEv
-DA:59,0
-LF:1
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/exception.h
-FN:190,_ZNK6wibble9exception7Generic4typeEv
-FN:263,_ZNK6wibble9exception11Consistency4typeEv
-FN:406,_ZNK6wibble9exception6System4codeEv
-FN:428,_ZNK6wibble9exception4File4typeEv
-FN:137,_ZN6wibble9exception7ContextD2Ev
-FN:187,_ZN6wibble9exception7GenericD2Ev
-FN:395,_ZN6wibble9exception6SystemD1Ev
-FN:395,_ZN6wibble9exception6SystemD2Ev
-FN:193,_ZNK6wibble9exception7Generic4descEv
-FN:213,_ZNK6wibble9exception7Generic4whatEv
-FN:187,_ZN6wibble9exception7GenericD0Ev
-FN:187,_ZN6wibble9exception7GenericD1Ev
-FN:261,_ZN6wibble9exception11ConsistencyD2Ev
-FN:261,_ZN6wibble9exception11ConsistencyD0Ev
-FN:261,_ZN6wibble9exception11ConsistencyD1Ev
-FN:426,_ZN6wibble9exception4FileD0Ev
-FN:426,_ZN6wibble9exception4FileD1Ev
-FN:265,_ZNK6wibble9exception11Consistency4descEv
-FN:154,_ZNK6wibble9exception7Context13formatContextEv
-FN:205,_ZNK6wibble9exception7Generic8fullInfoEv
-FN:137,_ZN6wibble9exception7ContextC2ERKS1_
-FN:180,_ZN6wibble9exception7GenericC2ERKS1_
-FN:255,_ZN6wibble9exception11ConsistencyC2ERKS1_
-FN:109,_ZN6wibble9exception10AddContext7contextEv
-FN:117,_ZN6wibble9exception10AddContext11copyContextISt20back_insert_iteratorISt6vectorISsSaISsEEEEEvT_
-FN:153,_ZN6wibble9exception7Context10addContextERKSs
-FN:147,_ZN6wibble9exception7ContextC2ERKSs
-FN:186,_ZN6wibble9exception7GenericC2ERKSs
-FN:259,_ZN6wibble9exception11ConsistencyC2ERKSsS3_
-FN:424,_ZN6wibble9exception4FileC1ERKSsS3_
-FN:430,_ZNK6wibble9exception4File4descEv
-DA:109,0
-DA:110,0
-DA:111,0
-DA:112,0
-DA:113,0
-DA:117,0
-DA:118,0
-DA:119,0
-DA:137,0
-DA:147,0
-DA:148,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:153,0
-DA:154,0
-DA:155,0
-DA:156,0
-DA:157,0
-DA:159,0
-DA:161,0
-DA:162,0
-DA:163,0
-DA:180,0
-DA:186,0
-DA:187,0
-DA:190,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:205,0
-DA:206,0
-DA:207,0
-DA:209,0
-DA:210,0
-DA:213,0
-DA:255,0
-DA:259,0
-DA:260,0
-DA:261,0
-DA:263,0
-DA:265,0
-DA:266,0
-DA:267,0
-DA:268,0
-DA:269,0
-DA:395,0
-DA:406,0
-DA:424,0
-DA:425,0
-DA:426,0
-DA:428,0
-DA:430,0
-BA:110,0
-BA:110,0
-BA:156,0
-BA:156,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:207,0
-BA:207,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:261,0
-BA:267,0
-BA:267,0
-BA:395,0
-BA:395,0
-BA:395,0
-BA:395,0
-BA:426,0
-BA:426,0
-BA:426,0
-BA:426,0
-LF:53
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/mixin.h
-FN:52,_ZN6wibble5mixin14OutputIteratorIN7tagcoll10textformat11StdioWriterEEC2Ev
-FN:52,_ZN6wibble5mixin14OutputIteratorIN7tagcoll4coll8InserterINS3_6SimpleISsSsEEEEEC2Ev
-FN:52,_ZN6wibble5mixin14OutputIteratorIN7tagcoll4coll8InserterINS3_14IntDiskIndexerEEEEC2Ev
-FN:52,_ZN6wibble5mixin14OutputIteratorIN3ept7debtags11StringToIntIN7tagcoll4coll8InserterINS6_14IntDiskIndexerEEEEEEC2Ev
-FN:64,_ZN6wibble5mixin14OutputIteratorIN3ept7debtags11StringToIntIN7tagcoll4coll8InserterINS6_14IntDiskIndexerEEEEEEdeEv
-FN:53,_ZN6wibble5mixin14OutputIteratorIN3ept7debtags11StringToIntIN7tagcoll4coll8InserterINS6_14IntDiskIndexerEEEEEEppEv
-FN:64,_ZN6wibble5mixin14OutputIteratorIN7tagcoll10textformat11StdioWriterEEdeEv
-FN:53,_ZN6wibble5mixin14OutputIteratorIN7tagcoll10textformat11StdioWriterEEppEv
-FN:64,_ZN6wibble5mixin14OutputIteratorIN7tagcoll4coll8InserterINS3_6SimpleISsSsEEEEEdeEv
-FN:53,_ZN6wibble5mixin14OutputIteratorIN7tagcoll4coll8InserterINS3_6SimpleISsSsEEEEEppEv
-FN:64,_ZN6wibble5mixin14OutputIteratorIN7tagcoll4coll8InserterINS3_14IntDiskIndexerEEEEdeEv
-FN:53,_ZN6wibble5mixin14OutputIteratorIN7tagcoll4coll8InserterINS3_14IntDiskIndexerEEEEppEv
-DA:52,3
-DA:53,63423
-DA:54,63423
-DA:64,63423
-DA:65,63423
-LF:5
-LH:5
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/operators.h
-FN:109,_ZN6wibble9operatorsoRISsEERSt3setIT_St4lessIS3_ESaIS3_EES8_RKNS_5EmptyIS3_EE
-FN:62,_ZN6wibble9operatorsorISsEESt3setIT_St4lessIS3_ESaIS3_EERKS7_RKNS_5EmptyIS3_EE
-FN:115,_ZN6wibble9operatorsoRISsEERSt3setIT_St4lessIS3_ESaIS3_EES8_RKS3_
-FN:133,_ZN6wibble9operatorsoRISsEERSt3setIT_St4lessIS3_ESaIS3_EES8_RKS7_
-FN:74,_ZN6wibble9operatorsorISsEESt3setIT_St4lessIS3_ESaIS3_EERKS7_S9_
-DA:62,0
-DA:63,0
-DA:74,0
-DA:75,0
-DA:76,0
-DA:78,0
-DA:109,0
-DA:111,0
-DA:115,0
-DA:117,0
-DA:118,0
-DA:133,0
-DA:134,0
-DA:135,0
-DA:137,0
-DA:139,0
-DA:140,0
-BA:134,0
-BA:134,0
-BA:137,0
-BA:137,0
-LF:17
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/singleton.h
-FN:56,_ZNK6wibble9SingletonISsE14const_iteratorneERKS2_
-FN:54,_ZN6wibble9SingletonISsE14const_iteratorppEv
-FN:52,_ZNK6wibble9SingletonISsE14const_iteratordeEv
-FN:47,_ZN6wibble9SingletonISsE14const_iteratorC1EPKSs
-FN:87,_ZNK6wibble9SingletonISsE5beginEv
-FN:50,_ZN6wibble9SingletonISsE14const_iteratorC1Ev
-FN:88,_ZNK6wibble9SingletonISsE3endEv
-FN:35,_ZN6wibble9SingletonISsED1Ev
-FN:80,_ZN6wibble9SingletonISsEC1ERKSs
-FN:92,_ZN6wibble9singletonISsEENS_9SingletonIT_EERKS2_
-FN:35,_ZN6wibble9SingletonISsEC1ERKS1_
-DA:35,0
-DA:47,0
-DA:50,0
-DA:52,0
-DA:54,0
-DA:56,0
-DA:80,0
-DA:87,0
-DA:88,0
-DA:92,0
-DA:94,0
-LF:11
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/sys/fs.h
-FN:99,_ZN6wibble3sys2fs9Directory14const_iteratorptEv
-FN:105,_ZNK6wibble3sys2fs9Directory14const_iteratorneERKS3_
-FN:114,_ZNK6wibble3sys2fs9Directory4pathEv
-FN:50,_ZN6wibble3sys2fs9DirectoryD2Ev
-FN:111,_ZN6wibble3sys2fs9DirectoryC2ERKSs
-FN:88,_ZN6wibble3sys2fs9Directory14const_iteratorppEv
-FN:65,_ZN6wibble3sys2fs9Directory14const_iteratorD1Ev
-DA:50,0
-DA:65,0
-DA:88,0
-DA:90,0
-DA:92,0
-DA:93,0
-DA:95,0
-DA:99,0
-DA:105,0
-DA:107,0
-DA:111,0
-DA:114,0
-BA:65,0
-BA:65,0
-BA:90,0
-BA:90,0
-BA:107,0
-BA:107,0
-BA:107,0
-BA:107,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeIiEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsSt3setISsSt4lessISsESaISsEEEEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISsEED2Ev
-FN:100,_ZNSaIcEC1ERKS_
-FN:100,_ZNSaIcEC2ERKS_
-FN:106,_ZNSaISsED2Ev
-FN:106,_ZNSaISsED1Ev
-FN:106,_ZNSaISt3setIiSt4lessIiESaIiEEED2Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeIiEEC2Ev
-FN:106,_ZNSaIiED1Ev
-FN:100,_ZNSaISt13_Rb_tree_nodeIiEEC2ERKS1_
-FN:98,_ZNSaISsEC2Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsSt3setISsSt4lessISsESaISsEEEEEC2Ev
-FN:106,_ZNSaISt4pairIKSsSt3setISsSt4lessISsESaISsEEEED1Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeISsEEC2Ev
-FN:104,_ZNSaISsEC1ISt13_Rb_tree_nodeISsEEERKSaIT_E
-FN:98,_ZNSaISt3setIiSt4lessIiESaIiEEEC2Ev
-FN:100,_ZNSaISsEC2ERKS_
-FN:104,_ZNSaIiEC1ISt13_Rb_tree_nodeIiEEERKSaIT_E
-FN:104,_ZNSaISt4pairIKSsSt3setISsSt4lessISsESaISsEEEEC1ISt13_Rb_tree_nodeIS6_EEERKSaIT_E
-FN:100,_ZNSaISt13_Rb_tree_nodeISsEEC2ERKS1_
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,2
-DA:100,0
-DA:101,0
-DA:104,0
-DA:106,2
-DA:118,0
-DA:119,0
-LF:7
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:276,0
-BA:276,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:277,_ZNKSs7_M_dataEv
-FN:1534,_ZNKSs5c_strEv
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:612,_ZNKSs6lengthEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:1551,_ZNKSs13get_allocatorEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:392,_ZNSs10_S_compareEjj
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:835,_ZNSs6appendEPKc
-FN:2121,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-FN:501,_ZNSsaSERKSs
-FN:2162,_ZSteqIcEN9__gnu_cxx11__enable_ifIXsrSt9__is_charIT_E7__valueEbE6__typeERKSbIS3_St11char_traitsIS3_ESaIS3_EESC_
-FN:2201,_ZStneIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:1941,_ZNKSs7compareERKSs
-FN:2238,_ZStltIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:392,0
-DA:394,0
-DA:401,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:612,0
-DA:613,0
-DA:686,0
-DA:687,0
-DA:835,0
-DA:838,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:1941,0
-DA:1943,0
-DA:1944,0
-DA:1945,0
-DA:1947,0
-DA:1948,0
-DA:1949,0
-DA:1950,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2121,0
-DA:2123,0
-DA:2124,0
-DA:2125,0
-DA:2162,0
-DA:2165,0
-DA:2201,0
-DA:2202,0
-DA:2238,0
-DA:2239,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-BA:1948,0
-BA:1948,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-LF:84
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-FN:668,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_EPKS3_RKS6_
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-DA:668,0
-DA:673,0
-DA:674,0
-DA:675,0
-DA:676,0
-DA:677,0
-DA:678,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:23
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-DA:245,0
-DA:246,0
-DA:257,0
-DA:258,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algo.h
-FN:5055,_ZSt9set_unionISt23_Rb_tree_const_iteratorISsES1_St15insert_iteratorISt3setISsSt4lessISsESaISsEEEET1_T_SA_T0_SB_S9_
-DA:5055,0
-DA:5074,0
-DA:5076,0
-DA:5078,0
-DA:5079,0
-DA:5081,0
-DA:5083,0
-DA:5084,0
-DA:5088,0
-DA:5089,0
-DA:5090,0
-DA:5092,0
-DA:5095,0
-BA:5074,0
-BA:5074,0
-BA:5074,0
-BA:5074,0
-BA:5074,0
-BA:5074,0
-BA:5076,0
-BA:5076,0
-BA:5081,0
-BA:5081,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb0EE3__bES7_
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb0EE3__bES6_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb1EE3__bES7_
-FN:268,_ZNSt12__niter_baseISt16ostream_iteratorISscSt11char_traitsIcEELb0EE3__bES3_
-FN:286,_ZNSt12__miter_baseIPSsLb0EE3__bES0_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb1EE3__bES6_
-FN:268,_ZNSt12__niter_baseISt20back_insert_iteratorISt6vectorISsSaISsEEELb0EE3__bES4_
-FN:286,_ZNSt12__miter_baseIPSt3setIiSt4lessIiESaIiEELb0EE3__bES5_
-FN:268,_ZNSt12__niter_baseIPSt3setIiSt4lessIiESaIiEELb0EE3__bES5_
-FN:268,_ZNSt12__niter_baseIPSsLb0EE3__bES0_
-FN:188,_ZSt3minIjERKT_S2_S2_
-FN:286,_ZNSt12__miter_baseISt23_Rb_tree_const_iteratorISsELb0EE3__bES1_
-FN:268,_ZNSt12__niter_baseISt23_Rb_tree_const_iteratorISsELb0EE3__bES1_
-FN:268,_ZNSt12__niter_baseISt15insert_iteratorISt3setISsSt4lessISsESaISsEEELb0EE3__bES6_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPKSsSt16ostream_iteratorISscSt11char_traitsIcEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPKSsSt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_SD_SC_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET0_T_SD_SC_
-FN:539,_ZNSt20__copy_move_backwardILb0ELb0ESt26random_access_iterator_tagE13__copy_move_bIPSsS3_EET0_T_S5_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0EPSsS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPSsS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardIPSsS0_ET0_T_S2_S1_
-FN:539,_ZNSt20__copy_move_backwardILb0ELb0ESt26random_access_iterator_tagE13__copy_move_bIPSt3setIiSt4lessIiESaIiEES8_EET0_T_SA_S9_
-FN:579,_ZSt22__copy_move_backward_aILb0EPSt3setIiSt4lessIiESaIiEES5_ET1_T0_S7_S6_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPSt3setIiSt4lessIiESaIiEES5_ET1_T0_S7_S6_
-FN:624,_ZSt13copy_backwardIPSt3setIiSt4lessIiESaIiEES5_ET0_T_S7_S6_
-FN:683,_ZSt8__fill_aIPSt3setIiSt4lessIiESaIiEES4_EN9__gnu_cxx11__enable_ifIXntsrSt11__is_scalarIT0_E7__valueEvE6__typeET_SD_RKS9_
-FN:724,_ZSt4fillIPSt3setIiSt4lessIiESaIiEES4_EvT_S6_RKT0_
-FN:309,_ZNSt11__copy_moveILb0ELb0ESt26bidirectional_iterator_tagE8__copy_mISt23_Rb_tree_const_iteratorISsESt15insert_iteratorISt3setISsSt4lessISsESaISsEEEEET0_T_SD_SC_
-FN:385,_ZSt13__copy_move_aILb0ESt23_Rb_tree_const_iteratorISsESt15insert_iteratorISt3setISsSt4lessISsESaISsEEEET1_T0_SA_S9_
-FN:430,_ZSt14__copy_move_a2ILb0ESt23_Rb_tree_const_iteratorISsESt15insert_iteratorISt3setISsSt4lessISsESaISsEEEET1_T0_SA_S9_
-FN:456,_ZSt4copyISt23_Rb_tree_const_iteratorISsESt15insert_iteratorISt3setISsSt4lessISsESaISsEEEET0_T_SA_S9_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET1_T0_SA_S9_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET0_T_SA_S9_
-DA:188,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:210,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:268,42244
-DA:269,42244
-DA:276,0
-DA:277,0
-DA:286,0
-DA:287,0
-DA:309,0
-DA:311,0
-DA:312,0
-DA:313,0
-DA:337,0
-DA:340,0
-DA:342,0
-DA:343,0
-DA:344,0
-DA:346,0
-DA:385,0
-DA:393,0
-DA:396,0
-DA:430,0
-DA:435,0
-DA:456,0
-DA:466,0
-DA:539,0
-DA:542,0
-DA:543,0
-DA:544,0
-DA:579,0
-DA:587,0
-DA:592,0
-DA:597,0
-DA:602,0
-DA:624,0
-DA:636,0
-DA:683,21122
-DA:685,21122
-DA:686,0
-DA:687,21122
-DA:724,21122
-DA:731,21122
-DA:733,21122
-BA:193,0
-BA:193,0
-BA:215,0
-BA:215,0
-BA:311,0
-BA:311,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:542,0
-BA:542,0
-BA:542,0
-BA:542,0
-BA:685,1
-BA:685,2
-LF:49
-LH:8
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-FN:87,_ZSt8_DestroyISt3setIiSt4lessIiESaIiEEEvPT_
-FN:97,_ZSt8_DestroyIPSt3setIiSt4lessIiESaIiEEEvT_S6_
-FN:126,_ZSt8_DestroyIPSt3setIiSt4lessIiESaIiEES4_EvT_S6_RSaIT0_E
-FN:75,_ZSt10_ConstructISt3setIiSt4lessIiESaIiEES4_EvPT_RKT0_
-DA:75,21765
-DA:79,21765
-DA:80,21765
-DA:87,55335
-DA:88,55335
-DA:97,22
-DA:101,55357
-DA:103,55335
-DA:104,22
-DA:126,22
-DA:128,22
-DA:129,22
-BA:79,2
-BA:79,1
-BA:101,0
-BA:101,0
-BA:101,2
-BA:101,2
-LF:12
-LH:12
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_function.h
-FN:469,_ZNKSt9_IdentityIiEclERKi
-FN:229,_ZNKSt4lessIiEclERKiS2_
-FN:469,_ZNKSt9_IdentityISsEclERKSs
-FN:482,_ZNKSt10_Select1stISt4pairIKSsSt3setISsSt4lessISsESaISsEEEEclERKS7_
-FN:229,_ZNKSt4lessISsEclERKSsS2_
-DA:229,0
-DA:230,0
-DA:469,0
-DA:470,0
-DA:482,0
-DA:483,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEdeEv
-FN:398,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEC1ERS2_
-FN:456,_ZSt13back_inserterISt6vectorISsSaISsEEESt20back_insert_iteratorIT_ERS4_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEC1ERKS2_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPSt3setIiSt4lessIiESaIiEESt6vectorIS5_SaIS5_EEEC1ERKS6_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEE4baseEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEC1ERKS1_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPSt3setIiSt4lessIiESaIiEESt6vectorIS5_SaIS5_EEE4baseEv
-FN:846,_ZN9__gnu_cxxmiIPSt3setIiSt4lessIiESaIiEESt6vectorIS5_SaIS5_EEEENS_17__normal_iteratorIT_T0_E15difference_typeERKSD_SG_
-FN:781,_ZN9__gnu_cxxneIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-FN:703,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEppEv
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEdeEv
-FN:429,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEdeEv
-FN:434,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEppEv
-FN:572,_ZNSt15insert_iteratorISt3setISsSt4lessISsESaISsEEEC1ERS4_St23_Rb_tree_const_iteratorISsE
-FN:645,_ZSt8inserterISt3setISsSt4lessISsESaISsEESt23_Rb_tree_const_iteratorISsEESt15insert_iteratorIT_ERS8_T0_
-FN:618,_ZNSt15insert_iteratorISt3setISsSt4lessISsESaISsEEEdeEv
-FN:623,_ZNSt15insert_iteratorISt3setISsSt4lessISsESaISsEEEppEv
-FN:599,_ZNSt15insert_iteratorISt3setISsSt4lessISsESaISsEEEaSERKSs
-FN:412,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEaSERKSs
-DA:398,0
-DA:412,0
-DA:414,0
-DA:415,0
-DA:429,0
-DA:430,0
-DA:434,0
-DA:435,0
-DA:456,0
-DA:457,0
-DA:572,0
-DA:573,0
-DA:599,0
-DA:601,0
-DA:602,0
-DA:603,0
-DA:618,0
-DA:619,0
-DA:623,0
-DA:624,0
-DA:645,0
-DA:648,0
-DA:683,42264
-DA:695,0
-DA:696,0
-DA:703,0
-DA:705,0
-DA:706,0
-DA:747,84528
-DA:748,84528
-DA:769,0
-DA:770,0
-DA:781,0
-DA:782,0
-DA:846,21122
-DA:847,21122
-LF:36
-LH:5
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:111,_ZNSt8iteratorISt20forward_iterator_tagKSsvPS1_RS1_EC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,0
-DA:166,0
-DA:167,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_map.h
-FN:384,_ZNKSt3mapISsSt3setISsSt4lessISsESaISsEES2_SaISt4pairIKSsS4_EEE5emptyEv
-FN:293,_ZNSt3mapISsSt3setISsSt4lessISsESaISsEES2_SaISt4pairIKSsS4_EEE3endEv
-FN:275,_ZNSt3mapISsSt3setISsSt4lessISsESaISsEES2_SaISt4pairIKSsS4_EEE5beginEv
-FN:155,_ZNSt3mapISsSt3setISsSt4lessISsESaISsEES2_SaISt4pairIKSsS4_EEEC1Ev
-FN:284,_ZNKSt3mapISsSt3setISsSt4lessISsESaISsEES2_SaISt4pairIKSsS4_EEE5beginEv
-FN:302,_ZNKSt3mapISsSt3setISsSt4lessISsESaISsEES2_SaISt4pairIKSsS4_EEE3endEv
-FN:92,_ZNSt3mapISsSt3setISsSt4lessISsESaISsEES2_SaISt4pairIKSsS4_EEED1Ev
-FN:614,_ZNSt3mapISsSt3setISsSt4lessISsESaISsEES2_SaISt4pairIKSsS4_EEE4findERS6_
-FN:468,_ZNSt3mapISsSt3setISsSt4lessISsESaISsEES2_SaISt4pairIKSsS4_EEE6insertERKS7_
-DA:92,0
-DA:155,0
-DA:156,0
-DA:275,1
-DA:276,1
-DA:284,0
-DA:285,0
-DA:293,0
-DA:294,0
-DA:302,0
-DA:303,0
-DA:384,2
-DA:385,2
-DA:468,0
-DA:469,0
-DA:614,0
-DA:615,0
-LF:17
-LH:4
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_pair.h
-FN:88,_ZNSt4pairISt23_Rb_tree_const_iteratorIiEbEC1ERKS1_RKb
-FN:88,_ZNSt4pairISt23_Rb_tree_const_iteratorISsEbEC1ERKS1_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIiEbEC1ERKS1_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorISsEbEC1ERKS1_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIS_IKSsSt3setISsSt4lessISsESaISsEEEEbEC1ERKS8_RKb
-FN:73,_ZNSt4pairIKSsSt3setISsSt4lessISsESaISsEEED1Ev
-FN:73,_ZNSt4pairISsSt3setISsSt4lessISsESaISsEEED1Ev
-FN:73,_ZNSt4pairISt3setISsSt4lessISsESaISsEEN6wibble5EmptyISsEEED1Ev
-FN:73,_ZNSt4pairISt3setISsSt4lessISsESaISsEES4_ED1Ev
-FN:73,_ZNSt4pairIN6wibble9SingletonISsEESt3setISsSt4lessISsESaISsEEED1Ev
-FN:73,_ZNSt4pairISt3setIiSt4lessIiESaIiEES4_ED1Ev
-FN:88,_ZNSt4pairISt3setISsSt4lessISsESaISsEEN6wibble5EmptyISsEEEC1ERKS4_RKS7_
-FN:218,_ZSt9make_pairISt3setISsSt4lessISsESaISsEEN6wibble5EmptyISsEEESt4pairIT_T0_ES9_SA_
-FN:88,_ZNSt4pairISsSt3setISsSt4lessISsESaISsEEEC1ERKSsRKS4_
-FN:218,_ZSt9make_pairISsSt3setISsSt4lessISsESaISsEEESt4pairIT_T0_ES6_S7_
-FN:104,_ZNSt4pairIKSsSt3setISsSt4lessISsESaISsEEEC1ISsS5_EERKS_IT_T0_E
-FN:73,_ZNSt4pairIKSsSt3setISsSt4lessISsESaISsEEEC1ERKS6_
-FN:88,_ZNSt4pairISt3setISsSt4lessISsESaISsEES4_EC1ERKS4_S7_
-FN:218,_ZSt9make_pairISt3setISsSt4lessISsESaISsEES4_ESt4pairIT_T0_ES6_S7_
-FN:88,_ZNSt4pairIN6wibble9SingletonISsEESt3setISsSt4lessISsESaISsEEEC1ERKS2_RKS7_
-FN:218,_ZSt9make_pairIN6wibble9SingletonISsEESt3setISsSt4lessISsESaISsEEESt4pairIT_T0_ES9_SA_
-FN:88,_ZNSt4pairISt3setIiSt4lessIiESaIiEES4_EC1ERKS4_S7_
-FN:218,_ZSt9make_pairISt3setIiSt4lessIiESaIiEES4_ESt4pairIT_T0_ES6_S7_
-DA:73,0
-DA:88,0
-DA:89,0
-DA:104,0
-DA:106,0
-DA:218,0
-DA:219,0
-LF:7
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_set.h
-FN:336,_ZNKSt3setISsSt4lessISsESaISsEE4sizeEv
-FN:261,_ZNKSt3setISsSt4lessISsESaISsEE5beginEv
-FN:270,_ZNKSt3setISsSt4lessISsESaISsEE3endEv
-FN:331,_ZNKSt3setISsSt4lessISsESaISsEE5emptyEv
-FN:331,_ZNKSt3setIiSt4lessIiESaIiEE5emptyEv
-FN:141,_ZNSt3setIiSt4lessIiESaIiEEC1Ev
-FN:141,_ZNSt3setISsSt4lessISsESaISsEEC1Ev
-FN:261,_ZNKSt3setIiSt4lessIiESaIiEE5beginEv
-FN:270,_ZNKSt3setIiSt4lessIiESaIiEE3endEv
-FN:471,_ZNSt3setISsSt4lessISsESaISsEE5clearEv
-FN:93,_ZNSt3setISsSt4lessISsESaISsEED1Ev
-FN:93,_ZNSt3setIiSt4lessIiESaIiEED1Ev
-FN:193,_ZNSt3setISsSt4lessISsESaISsEEC1ERKS3_
-FN:216,_ZNSt3setISsSt4lessISsESaISsEEaSERKS3_
-FN:193,_ZNSt3setIiSt4lessIiESaIiEEC1ERKS3_
-FN:216,_ZNSt3setIiSt4lessIiESaIiEEaSERKS3_
-FN:378,_ZNSt3setISsSt4lessISsESaISsEE6insertERKSs
-FN:378,_ZNSt3setIiSt4lessIiESaIiEE6insertERKi
-FN:405,_ZNSt3setISsSt4lessISsESaISsEE6insertESt23_Rb_tree_const_iteratorISsERKSs
-DA:93,0
-DA:141,0
-DA:142,0
-DA:193,0
-DA:194,0
-DA:216,0
-DA:218,0
-DA:219,0
-DA:261,0
-DA:262,0
-DA:270,0
-DA:271,0
-DA:331,0
-DA:332,0
-DA:336,0
-DA:337,0
-DA:378,0
-DA:381,0
-DA:382,0
-DA:405,0
-DA:406,0
-DA:471,0
-DA:472,0
-LF:23
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_tree.h
-FN:103,_ZNSt18_Rb_tree_node_base10_S_minimumEPS_
-FN:117,_ZNSt18_Rb_tree_node_base10_S_maximumEPS_
-FN:289,_ZNKSt23_Rb_tree_const_iteratorISsEneERKS0_
-FN:251,_ZNKSt23_Rb_tree_const_iteratorISsEptEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsSt3setISsSt4lessISsESaISsEEEEC1ERKSt17_Rb_tree_iteratorIS7_E
-FN:289,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKSsSt3setISsSt4lessISsESaISsEEEEneERKS8_
-FN:251,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKSsSt3setISsSt4lessISsESaISsEEEEptEv
-FN:285,_ZNKSt23_Rb_tree_const_iteratorISsEeqERKS0_
-FN:452,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_M_beginEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorIiEC1ERKSt17_Rb_tree_iteratorIiE
-FN:641,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE4sizeEv
-FN:452,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE8_M_beginEv
-FN:452,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_beginEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorISsEC1ERKSt17_Rb_tree_iteratorISsE
-FN:398,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_Rb_tree_implIS3_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE7_S_leftEPSt18_Rb_tree_node_base
-FN:347,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE21_M_get_Node_allocatorEv
-FN:432,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE7_M_rootEv
-FN:456,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_M_beginEv
-FN:463,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE6_M_endEv
-FN:428,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE7_M_rootEv
-FN:503,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE10_S_minimumEPSt18_Rb_tree_node_base
-FN:436,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE11_M_leftmostEv
-FN:511,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE10_S_maximumEPSt18_Rb_tree_node_base
-FN:444,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE12_M_rightmostEv
-FN:168,_ZNSt17_Rb_tree_iteratorIiEC1EPSt13_Rb_tree_nodeIiE
-FN:596,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorIiEeqERKS0_
-FN:240,_ZNSt23_Rb_tree_const_iteratorISsEC1EPKSt13_Rb_tree_nodeISsE
-FN:603,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5beginEv
-FN:614,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE3endEv
-FN:398,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE13_Rb_tree_implIS4_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:637,_ZNKSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE5emptyEv
-FN:398,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_S_leftEPSt18_Rb_tree_node_base
-FN:463,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_M_endEv
-FN:168,_ZNSt17_Rb_tree_iteratorISsEC1EPSt13_Rb_tree_nodeISsE
-FN:596,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorISsEeqERKS0_
-FN:247,_ZNKSt23_Rb_tree_const_iteratorISsEdeEv
-FN:415,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_Rb_tree_implIS3_Lb0EE13_M_initializeEv
-FN:491,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_S_rightEPKSt18_Rb_tree_node_base
-FN:483,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE7_S_leftEPKSt18_Rb_tree_node_base
-FN:471,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_S_valueEPKSt13_Rb_tree_nodeIiE
-FN:475,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE6_S_keyEPKSt13_Rb_tree_nodeIiE
-FN:495,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE6_S_keyEPKSt18_Rb_tree_node_base
-FN:415,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE13_Rb_tree_implIS4_Lb0EE13_M_initializeEv
-FN:637,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5emptyEv
-FN:415,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EE13_M_initializeEv
-FN:168,_ZNSt17_Rb_tree_iteratorISt4pairIKSsSt3setISsSt4lessISsESaISsEEEEC1EPSt13_Rb_tree_nodeIS7_E
-FN:610,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE3endEv
-FN:596,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE5beginEv
-FN:471,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_valueEPKSt13_Rb_tree_nodeISsE
-FN:475,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_S_keyEPKSt13_Rb_tree_nodeISsE
-FN:495,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_S_keyEPKSt18_Rb_tree_node_base
-FN:347,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE21_M_get_Node_allocatorEv
-FN:432,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_M_rootEv
-FN:456,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_beginEv
-FN:428,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_M_rootEv
-FN:503,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE10_S_minimumEPSt18_Rb_tree_node_base
-FN:436,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11_M_leftmostEv
-FN:511,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE10_S_maximumEPSt18_Rb_tree_node_base
-FN:444,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE12_M_rightmostEv
-FN:637,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5emptyEv
-FN:403,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_Rb_tree_implIS3_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEEC1Ev
-FN:408,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_Rb_tree_implIS3_Lb0EEC1ERKS3_RKSaISt13_Rb_tree_nodeIiEE
-FN:403,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE13_Rb_tree_implIS4_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EEC1Ev
-FN:347,_ZNKSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE21_M_get_Node_allocatorEv
-FN:210,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsSt3setISsSt4lessISsESaISsEEEEeqERKS8_
-FN:176,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsSt3setISsSt4lessISsESaISsEEEEptEv
-FN:403,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEEC1Ev
-FN:351,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13get_allocatorEv
-FN:240,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsSt3setISsSt4lessISsESaISsEEEEC1EPKSt13_Rb_tree_nodeIS7_E
-FN:603,_ZNKSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE5beginEv
-FN:614,_ZNKSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE3endEv
-FN:491,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_rightEPKSt18_Rb_tree_node_base
-FN:483,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_S_leftEPKSt18_Rb_tree_node_base
-FN:289,_ZNKSt23_Rb_tree_const_iteratorIiEneERKS0_
-FN:247,_ZNKSt23_Rb_tree_const_iteratorIiEdeEv
-FN:351,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13get_allocatorEv
-FN:351,_ZNKSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE13get_allocatorEv
-FN:408,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EEC1ERKS3_RKSaISt13_Rb_tree_nodeISsEE
-FN:463,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE6_M_endEv
-FN:240,_ZNSt23_Rb_tree_const_iteratorIiEC1EPKSt13_Rb_tree_nodeIiE
-FN:603,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5beginEv
-FN:614,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE3endEv
-FN:495,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE6_S_keyEPKSt18_Rb_tree_node_base
-FN:471,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE8_S_valueEPKSt13_Rb_tree_nodeIS7_E
-FN:475,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE6_S_keyEPKSt13_Rb_tree_nodeIS7_E
-FN:262,_ZNSt23_Rb_tree_const_iteratorISsEppEi
-FN:255,_ZNSt23_Rb_tree_const_iteratorISsEppEv
-FN:255,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsSt3setISsSt4lessISsESaISsEEEEppEv
-FN:255,_ZNSt23_Rb_tree_const_iteratorIiEppEv
-FN:360,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS7_E
-FN:360,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11_M_put_nodeEPSt13_Rb_tree_nodeISsE
-FN:388,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE15_M_destroy_nodeEPSt13_Rb_tree_nodeISsE
-FN:936,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_eraseEPSt13_Rb_tree_nodeISsE
-FN:695,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5clearEv
-FN:584,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEED1Ev
-FN:388,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS7_E
-FN:936,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE8_M_eraseEPSt13_Rb_tree_nodeIS7_E
-FN:584,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EED1Ev
-FN:360,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE11_M_put_nodeEPSt13_Rb_tree_nodeIiE
-FN:388,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE15_M_destroy_nodeEPSt13_Rb_tree_nodeIiE
-FN:936,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_M_eraseEPSt13_Rb_tree_nodeIiE
-FN:584,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEED1Ev
-FN:695,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5clearEv
-FN:954,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE14_M_lower_boundEPSt13_Rb_tree_nodeIS7_ESE_RS1_
-FN:1390,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE4findERS1_
-FN:356,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE11_M_get_nodeEv
-FN:356,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE14_M_create_nodeERKSs
-FN:378,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_M_clone_nodeEPKSt13_Rb_tree_nodeISsE
-FN:900,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_M_copyEPKSt13_Rb_tree_nodeISsEPS7_
-FN:568,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEEC1ERKS5_
-FN:364,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE14_M_create_nodeERKS7_
-FN:824,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEEaSERKS5_
-FN:356,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE14_M_create_nodeERKi
-FN:378,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_M_clone_nodeEPKSt13_Rb_tree_nodeIiE
-FN:900,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE7_M_copyEPKSt13_Rb_tree_nodeIiEPS7_
-FN:568,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEEC1ERKS5_
-FN:824,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEEaSERKS5_
-FN:195,_ZNSt17_Rb_tree_iteratorISt4pairIKSsSt3setISsSt4lessISsESaISsEEEEmmEv
-FN:195,_ZNSt17_Rb_tree_iteratorISsEmmEv
-FN:195,_ZNSt17_Rb_tree_iteratorIiEmmEv
-FN:846,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE10_M_insert_EPKSt18_Rb_tree_node_baseSE_RKS7_
-FN:1133,_ZNSt8_Rb_treeISsSt4pairIKSsSt3setISsSt4lessISsESaISsEEESt10_Select1stIS7_ES4_SaIS7_EE16_M_insert_uniqueERKS7_
-FN:846,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE10_M_insert_EPKSt18_Rb_tree_node_baseS8_RKSs
-FN:1133,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE16_M_insert_uniqueERKSs
-FN:846,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE10_M_insert_EPKSt18_Rb_tree_node_baseS8_RKi
-FN:1133,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE16_M_insert_uniqueERKi
-FN:270,_ZNSt23_Rb_tree_const_iteratorISsEmmEv
-FN:1178,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE17_M_insert_unique_ESt23_Rb_tree_const_iteratorISsERKSs
-DA:103,0
-DA:105,0
-DA:106,0
-DA:117,0
-DA:119,0
-DA:120,0
-DA:168,0
-DA:169,0
-DA:176,0
-DA:177,0
-DA:195,0
-DA:197,0
-DA:198,0
-DA:210,0
-DA:211,0
-DA:240,0
-DA:241,0
-DA:243,21147
-DA:244,21147
-DA:247,0
-DA:248,0
-DA:251,0
-DA:252,0
-DA:255,0
-DA:257,0
-DA:258,0
-DA:262,0
-DA:264,0
-DA:265,0
-DA:270,0
-DA:272,0
-DA:273,0
-DA:285,0
-DA:286,0
-DA:289,0
-DA:290,0
-DA:347,0
-DA:348,0
-DA:351,0
-DA:352,0
-DA:356,0
-DA:357,0
-DA:360,0
-DA:361,0
-DA:364,0
-DA:366,0
-DA:368,0
-DA:369,0
-DA:371,0
-DA:372,0
-DA:374,0
-DA:378,0
-DA:380,0
-DA:381,0
-DA:382,0
-DA:383,0
-DA:384,0
-DA:388,0
-DA:390,0
-DA:391,0
-DA:392,0
-DA:398,0
-DA:403,0
-DA:405,0
-DA:406,0
-DA:408,0
-DA:410,0
-DA:411,0
-DA:415,0
-DA:417,0
-DA:418,0
-DA:419,0
-DA:420,0
-DA:421,0
-DA:428,0
-DA:429,0
-DA:432,0
-DA:433,0
-DA:436,0
-DA:437,0
-DA:444,0
-DA:445,0
-DA:452,0
-DA:453,0
-DA:456,0
-DA:459,0
-DA:463,0
-DA:464,0
-DA:471,0
-DA:472,0
-DA:475,0
-DA:476,0
-DA:479,0
-DA:480,0
-DA:483,0
-DA:484,0
-DA:487,0
-DA:488,0
-DA:491,0
-DA:492,0
-DA:495,0
-DA:496,0
-DA:499,0
-DA:500,0
-DA:503,0
-DA:504,0
-DA:511,0
-DA:512,0
-DA:562,0
-DA:568,0
-DA:569,0
-DA:571,0
-DA:573,0
-DA:574,0
-DA:575,0
-DA:576,0
-DA:578,0
-DA:584,0
-DA:585,0
-DA:596,0
-DA:599,0
-DA:603,0
-DA:606,0
-DA:610,0
-DA:611,0
-DA:614,0
-DA:617,0
-DA:637,2
-DA:638,2
-DA:641,0
-DA:642,0
-DA:695,0
-DA:697,0
-DA:698,0
-DA:699,0
-DA:700,0
-DA:701,0
-DA:702,0
-DA:824,0
-DA:826,0
-DA:829,0
-DA:830,0
-DA:831,0
-DA:833,0
-DA:834,0
-DA:835,0
-DA:836,0
-DA:839,0
-DA:846,0
-DA:850,0
-DA:852,0
-DA:854,0
-DA:857,0
-DA:858,0
-DA:900,0
-DA:903,0
-DA:904,0
-DA:908,0
-DA:909,0
-DA:910,0
-DA:911,0
-DA:913,0
-DA:915,0
-DA:916,0
-DA:917,0
-DA:918,0
-DA:919,0
-DA:920,0
-DA:921,0
-DA:924,0
-DA:926,0
-DA:927,0
-DA:929,0
-DA:936,0
-DA:939,0
-DA:941,0
-DA:942,0
-DA:943,0
-DA:944,0
-DA:946,0
-DA:954,0
-DA:956,0
-DA:957,0
-DA:958,0
-DA:960,0
-DA:961,0
-DA:1133,0
-DA:1135,0
-DA:1136,0
-DA:1137,0
-DA:1138,0
-DA:1140,0
-DA:1141,0
-DA:1142,0
-DA:1144,0
-DA:1145,0
-DA:1147,0
-DA:1148,0
-DA:1150,0
-DA:1152,0
-DA:1153,0
-DA:1154,0
-DA:1178,0
-DA:1181,0
-DA:1183,0
-DA:1186,0
-DA:1188,0
-DA:1190,0
-DA:1194,0
-DA:1195,0
-DA:1196,0
-DA:1197,0
-DA:1200,0
-DA:1201,0
-DA:1204,0
-DA:1207,0
-DA:1209,0
-DA:1213,0
-DA:1214,0
-DA:1215,0
-DA:1216,0
-DA:1219,0
-DA:1220,0
-DA:1222,0
-DA:1225,0
-DA:1230,0
-DA:1390,0
-DA:1392,0
-DA:1395,0
-BA:105,0
-BA:105,0
-BA:119,0
-BA:119,0
-BA:571,0
-BA:571,0
-BA:571,0
-BA:571,0
-BA:826,0
-BA:826,0
-BA:826,0
-BA:826,0
-BA:831,0
-BA:831,0
-BA:831,0
-BA:831,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:908,0
-BA:908,0
-BA:908,0
-BA:908,0
-BA:913,0
-BA:913,0
-BA:913,0
-BA:913,0
-BA:918,0
-BA:918,0
-BA:918,0
-BA:918,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:956,0
-BA:956,0
-BA:957,0
-BA:957,0
-BA:1138,0
-BA:1138,0
-BA:1138,0
-BA:1138,0
-BA:1138,0
-BA:1138,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1145,0
-BA:1145,0
-BA:1145,0
-BA:1145,0
-BA:1145,0
-BA:1145,0
-BA:1147,0
-BA:1147,0
-BA:1147,0
-BA:1147,0
-BA:1147,0
-BA:1147,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1181,0
-BA:1181,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1190,0
-BA:1190,0
-BA:1195,0
-BA:1195,0
-BA:1197,0
-BA:1197,0
-BA:1200,0
-BA:1200,0
-BA:1209,0
-BA:1209,0
-BA:1214,0
-BA:1214,0
-BA:1216,0
-BA:1216,0
-BA:1219,0
-BA:1219,0
-BA:1395,0
-BA:1395,0
-BA:1395,0
-BA:1395,0
-LF:229
-LH:4
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEEPSsEET0_T_SC_SB_
-FN:113,_ZSt18uninitialized_copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEEPSsET0_T_SA_S9_
-FN:261,_ZSt22__uninitialized_copy_aIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEEPSsSsET0_T_SA_S9_RSaIT1_E
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyIPSsS2_EET0_T_S4_S3_
-FN:113,_ZSt18uninitialized_copyIPSsS0_ET0_T_S2_S1_
-FN:261,_ZSt22__uninitialized_copy_aIPSsS0_SsET0_T_S2_S1_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPSsS0_SaISsEET0_T_S3_S2_RT1_
-FN:186,_ZNSt22__uninitialized_fill_nILb0EE20uninitialized_fill_nIPSt3setIiSt4lessIiESaIiEEjS6_EEvT_T0_RKT1_
-FN:223,_ZSt20uninitialized_fill_nIPSt3setIiSt4lessIiESaIiEEjS4_EvT_T0_RKT1_
-FN:322,_ZSt24__uninitialized_fill_n_aIPSt3setIiSt4lessIiESaIiEEjS4_S4_EvT_T0_RKT1_RSaIT2_E
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyIPSt3setIiSt4lessIiESaIiEES7_EET0_T_S9_S8_
-FN:113,_ZSt18uninitialized_copyIPSt3setIiSt4lessIiESaIiEES5_ET0_T_S7_S6_
-FN:261,_ZSt22__uninitialized_copy_aIPSt3setIiSt4lessIiESaIiEES5_S4_ET0_T_S7_S6_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPSt3setIiSt4lessIiESaIiEES5_SaIS4_EET0_T_S8_S7_RT1_
-DA:73,21162
-DA:75,21162
-DA:78,54732
-DA:79,33570
-DA:81,21162
-DA:83,0
-DA:85,0
-DA:86,0
-DA:113,21162
-DA:122,21162
-DA:186,21142
-DA:188,21142
-DA:191,42907
-DA:192,21765
-DA:194,0
-DA:196,0
-DA:197,0
-DA:199,21142
-DA:223,21142
-DA:228,21142
-DA:230,21142
-DA:261,21162
-DA:262,21162
-DA:268,21162
-DA:272,21162
-DA:322,21142
-DA:323,21142
-BA:78,0
-BA:78,0
-BA:78,0
-BA:78,0
-BA:78,2
-BA:78,2
-BA:79,0
-BA:79,0
-BA:79,0
-BA:79,0
-BA:79,2
-BA:79,1
-BA:191,2
-BA:191,2
-LF:27
-LH:21
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:484,_ZNKSt6vectorISt3setIiSt4lessIiESaIiEESaIS4_EE4sizeEv
-FN:562,_ZNSt6vectorISt3setIiSt4lessIiESaIiEESaIS4_EEixEj
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:404,_ZNKSt6vectorISsSaISsEE3endEv
-FN:386,_ZNKSt6vectorISsSaISsEE5beginEv
-FN:97,_ZNSt12_Vector_baseISt3setIiSt4lessIiESaIiEESaIS4_EE19_M_get_Tp_allocatorEv
-FN:484,_ZNKSt6vectorISsSaISsEE4sizeEv
-FN:101,_ZNKSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:395,_ZNSt6vectorISt3setIiSt4lessIiESaIiEESaIS4_EE3endEv
-FN:395,_ZNSt6vectorISsSaISsEE3endEv
-FN:377,_ZNSt6vectorISsSaISsEE5beginEv
-FN:526,_ZNKSt6vectorISsSaISsEE5emptyEv
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:79,_ZNSt12_Vector_baseISt3setIiSt4lessIiESaIiEESaIS4_EE12_Vector_implD1Ev
-FN:84,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseISsSaISsEEC2Ev
-FN:213,_ZNSt6vectorISsSaISsEEC1Ev
-FN:489,_ZNKSt6vectorISsSaISsEE8max_sizeEv
-FN:84,_ZNSt12_Vector_baseISt3setIiSt4lessIiESaIiEESaIS4_EE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseISt3setIiSt4lessIiESaIiEESaIS4_EEC2Ev
-FN:213,_ZNSt6vectorISt3setIiSt4lessIiESaIiEESaIS4_EEC2Ev
-FN:88,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implC1ERKS0_
-FN:101,_ZNKSt12_Vector_baseISt3setIiSt4lessIiESaIiEESaIS4_EE19_M_get_Tp_allocatorEv
-FN:489,_ZNKSt6vectorISt3setIiSt4lessIiESaIiEESaIS4_EE8max_sizeEv
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-FN:1089,_ZNSt6vectorISt3setIiSt4lessIiESaIiEESaIS4_EE15_M_erase_at_endEPS4_
-FN:147,_ZNSt12_Vector_baseISt3setIiSt4lessIiESaIiEESaIS4_EE13_M_deallocateEPS4_j
-FN:135,_ZNSt12_Vector_baseISt3setIiSt4lessIiESaIiEESaIS4_EED2Ev
-FN:299,_ZNSt6vectorISt3setIiSt4lessIiESaIiEESaIS4_EED2Ev
-FN:143,_ZNSt12_Vector_baseISsSaISsEE11_M_allocateEj
-FN:114,_ZNSt12_Vector_baseISsSaISsEEC2EjRKS0_
-FN:247,_ZNSt6vectorISsSaISsEEC1ERKS1_
-FN:143,_ZNSt12_Vector_baseISt3setIiSt4lessIiESaIiEESaIS4_EE11_M_allocateEj
-FN:1075,_ZNKSt6vectorISsSaISsEE12_M_check_lenEjPKc
-FN:686,_ZNSt6vectorISsSaISsEE9push_backERKSs
-FN:1075,_ZNKSt6vectorISt3setIiSt4lessIiESaIiEESaIS4_EE12_M_check_lenEjPKc
-FN:791,_ZNSt6vectorISt3setIiSt4lessIiESaIiEESaIS4_EE6insertEN9__gnu_cxx17__normal_iteratorIPS4_S6_EEjRKS4_
-FN:504,_ZNSt6vectorISt3setIiSt4lessIiESaIiEESaIS4_EE6resizeEjS4_
-DA:79,2
-DA:84,2
-DA:85,2
-DA:86,2
-DA:88,0
-DA:89,0
-DA:90,0
-DA:97,42326
-DA:98,42326
-DA:101,40
-DA:102,40
-DA:108,2
-DA:109,2
-DA:114,0
-DA:115,0
-DA:117,0
-DA:118,0
-DA:119,0
-DA:120,0
-DA:135,2
-DA:136,2
-DA:137,2
-DA:143,20
-DA:144,20
-DA:147,22
-DA:149,22
-DA:150,20
-DA:151,22
-DA:213,2
-DA:214,2
-DA:247,0
-DA:248,0
-DA:249,0
-DA:253,0
-DA:299,2
-DA:300,2
-DA:301,2
-DA:377,0
-DA:378,0
-DA:386,0
-DA:387,0
-DA:395,42264
-DA:396,42264
-DA:404,0
-DA:405,0
-DA:484,253560
-DA:485,253560
-DA:489,40
-DA:490,40
-DA:504,21142
-DA:506,21142
-DA:507,0
-DA:509,21142
-DA:510,21142
-DA:526,0
-DA:527,0
-DA:562,211196
-DA:563,211196
-DA:686,0
-DA:688,0
-DA:690,0
-DA:691,0
-DA:694,0
-DA:695,0
-DA:791,21142
-DA:792,21142
-DA:1075,20
-DA:1077,20
-DA:1078,0
-DA:1080,20
-DA:1081,20
-DA:1089,0
-DA:1091,0
-DA:1092,0
-DA:1093,0
-BA:144,0
-BA:144,0
-BA:144,2
-BA:144,1
-BA:149,0
-BA:149,0
-BA:149,2
-BA:149,2
-BA:506,1
-BA:506,2
-BA:688,0
-BA:688,0
-BA:1077,0
-BA:1077,0
-BA:1077,1
-BA:1077,2
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,2
-BA:1081,1
-BA:1081,1
-BA:1081,2
-LF:75
-LH:42
-end_of_record
-SF:/usr/include/c++/4.3/bits/stream_iterator.h
-FN:181,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERSoPKc
-FN:185,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERKS2_
-FN:202,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEdeEv
-FN:206,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEppEv
-FN:191,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEaSERKSs
-DA:181,0
-DA:182,0
-DA:185,0
-DA:186,0
-DA:191,0
-DA:196,0
-DA:197,0
-DA:198,0
-DA:202,0
-DA:203,0
-DA:206,0
-DA:207,0
-BA:197,0
-BA:197,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/vector.tcc
-FN:283,_ZNSt6vectorISsSaISsEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPSsS1_EERKSs
-FN:350,_ZNSt6vectorISt3setIiSt4lessIiESaIiEESaIS4_EE14_M_fill_insertEN9__gnu_cxx17__normal_iteratorIPS4_S6_EEjRKS4_
-DA:283,0
-DA:286,0
-DA:288,0
-DA:291,0
-DA:293,0
-DA:295,0
-DA:299,0
-DA:307,0
-DA:308,0
-DA:309,0
-DA:316,0
-DA:321,0
-DA:323,0
-DA:324,0
-DA:330,0
-DA:332,0
-DA:333,0
-DA:334,0
-DA:336,0
-DA:338,0
-DA:341,0
-DA:342,0
-DA:343,0
-DA:345,0
-DA:350,21142
-DA:352,21142
-DA:357,21142
-DA:361,21122
-DA:363,21122
-DA:364,21122
-DA:365,21122
-DA:367,0
-DA:371,0
-DA:372,0
-DA:374,0
-DA:379,21122
-DA:383,21122
-DA:384,21122
-DA:387,21122
-DA:388,21122
-DA:394,20
-DA:395,20
-DA:396,20
-DA:399,20
-DA:407,20
-DA:410,20
-DA:411,20
-DA:417,0
-DA:419,0
-DA:421,0
-DA:422,0
-DA:424,20
-DA:426,20
-DA:429,20
-DA:430,20
-DA:431,20
-DA:434,21142
-BA:286,0
-BA:286,0
-BA:352,2
-BA:352,1
-BA:357,2
-BA:357,2
-BA:365,1
-BA:365,2
-LF:57
-LH:25
-end_of_record
-SF:/usr/include/c++/4.3/exception
-FN:59,_ZNSt9exceptionC2Ev
-FN:57,_ZNSt9exceptionC2ERKS_
-DA:57,0
-DA:59,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSt3setISsSt4lessISsESaISsEEEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:118,_ZN9__gnu_cxx13new_allocatorIiE7destroyEPi
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt3setIiSt4lessIiESaIiEEED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIiED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEEC2ERKS3_
-FN:107,_ZN9__gnu_cxx13new_allocatorIiE9constructEPiRKi
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISsE8max_sizeEv
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSt3setISsSt4lessISsESaISsEEEEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsSt3setISsSt4lessISsESaISsEEEED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt3setIiSt4lessIiESaIiEEEC2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorISsEC2ERKS1_
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt3setIiSt4lessIiESaIiEEE8max_sizeEv
-FN:69,_ZN9__gnu_cxx13new_allocatorIiEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsSt3setISsSt4lessISsESaISsEEEEC2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEEC2ERKS3_
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEE8max_sizeEv
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE8max_sizeEv
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSt3setISsSt4lessISsESaISsEEEEE8max_sizeEv
-FN:118,_ZN9__gnu_cxx13new_allocatorISsE7destroyEPSs
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSt3setISsSt4lessISsESaISsEEEEE10deallocateEPSA_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE10deallocateEPS2_j
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsSt3setISsSt4lessISsESaISsEEEE7destroyEPS8_
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEE10deallocateEPS2_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISt3setIiSt4lessIiESaIiEEE10deallocateEPS5_j
-FN:107,_ZN9__gnu_cxx13new_allocatorISsE9constructEPSsRKSs
-FN:87,_ZN9__gnu_cxx13new_allocatorISsE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsSt3setISsSt4lessISsESaISsEEEEE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE8allocateEjPKv
-FN:107,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsSt3setISsSt4lessISsESaISsEEEE9constructEPS8_RKS8_
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorISt3setIiSt4lessIiESaIiEEE8allocateEjPKv
-DA:69,2
-DA:71,0
-DA:76,2
-DA:87,20
-DA:89,20
-DA:90,0
-DA:92,20
-DA:97,20
-DA:98,20
-DA:101,60
-DA:102,60
-DA:107,0
-DA:108,0
-DA:118,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,1
-BA:89,2
-BA:108,0
-BA:108,0
-BA:108,0
-BA:108,0
-BA:108,0
-BA:108,0
-LF:14
-LH:9
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,2
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/istream
-FN:585,_ZNSiC2Ev
-FN:105,_ZNSiD2Ev
-FN:804,_ZNSdC2Ev
-FN:801,_ZNSdD2Ev
-DA:105,0
-DA:106,0
-DA:585,0
-DA:586,0
-DA:587,0
-DA:801,0
-DA:804,0
-DA:805,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-DA:95,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:509,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:536,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:555,_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:509,0
-DA:510,0
-DA:511,0
-DA:536,0
-DA:537,0
-DA:555,0
-DA:556,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/coll/base.h
-FN:48,_ZN7tagcoll4coll18ReadonlyCollectionINS0_6SimpleISsSsEEEC2Ev
-FN:273,_ZN7tagcoll4coll10CollectionINS0_6SimpleISsSsEEEC2Ev
-FN:313,_ZN7tagcoll4coll8InserterINS0_6SimpleISsSsEEEC1ERS3_
-FN:324,_ZN7tagcoll4coll8inserterINS0_6SimpleISsSsEEEENS0_8InserterIT_EERS5_
-FN:313,_ZN7tagcoll4coll8InserterINS0_14IntDiskIndexerEEC1ERS2_
-FN:324,_ZN7tagcoll4coll8inserterINS0_14IntDiskIndexerEEENS0_8InserterIT_EERS4_
-FN:49,_ZNK7tagcoll4coll18ReadonlyCollectionINS0_6SimpleISsSsEEE4selfEv
-FN:316,_ZN7tagcoll4coll8InserterINS0_6SimpleISsSsEEEaSISt3setISsSt4lessISsESaISsEEN6wibble5EmptyISsEEEERS4_RKSt4pairIT_T0_E
-FN:316,_ZN7tagcoll4coll8InserterINS0_6SimpleISsSsEEEaSISt3setISsSt4lessISsESaISsEESA_EERS4_RKSt4pairIT_T0_E
-FN:316,_ZN7tagcoll4coll8InserterINS0_14IntDiskIndexerEEaSISt3setIiSt4lessIiESaIiEES9_EERS3_RKSt4pairIT_T0_E
-FN:233,_ZNK7tagcoll4coll18ReadonlyCollectionINS0_6SimpleISsSsEEE6outputIN3ept7debtags11StringToIntINS0_8InserterINS0_14IntDiskIndexerEEEEEEEvT_
-FN:233,_ZNK7tagcoll4coll18ReadonlyCollectionINS0_6SimpleISsSsEEE6outputINS_10textformat11StdioWriterEEEvT_
-DA:48,0
-DA:49,0
-DA:233,2
-DA:273,0
-DA:313,1
-DA:316,63423
-DA:318,63423
-DA:319,63423
-DA:324,1
-DA:326,1
-LF:10
-LH:7
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/coll/base.tcc
-FN:188,_Z41__static_initialization_and_destruction_0ii
-FN:188,_GLOBAL__I_debtagsindexer.cc
-DA:138,84584
-DA:141,42290
-DA:142,42290
-DA:144,2
-DA:188,6
-BA:138,2
-BA:138,2
-BA:138,2
-BA:138,2
-BA:188,2
-BA:188,1
-BA:188,2
-BA:188,1
-LF:5
-LH:5
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/coll/intdiskindex.h
-FN:174,_ZNK7tagcoll4coll14IntDiskIndexer10pkgIndexerEv
-FN:175,_ZNK7tagcoll4coll14IntDiskIndexer10tagIndexerEv
-FN:168,_ZN7tagcoll4coll14IntDiskIndexerC1Ev
-FN:168,_ZN7tagcoll4coll14IntDiskIndexerD1Ev
-FN:178,_ZN7tagcoll4coll14IntDiskIndexer6insertISt3setIiSt4lessIiESaIiEES7_EEvRKT_RKT0_
-DA:168,2
-DA:174,1
-DA:175,1
-DA:178,21133
-DA:180,21133
-DA:181,0
-DA:182,42266
-DA:184,126731
-DA:187,105598
-DA:188,105598
-BA:180,1
-BA:180,2
-BA:182,2
-BA:182,2
-BA:184,2
-BA:184,2
-LF:10
-LH:9
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/coll/simple.h
-FN:82,_ZNK7tagcoll4coll6SimpleISsSsE5emptyEv
-FN:80,_ZN7tagcoll4coll6SimpleISsSsE3endEv
-FN:79,_ZN7tagcoll4coll6SimpleISsSsE5beginEv
-FN:62,_ZN7tagcoll4coll6SimpleISsSsEC1Ev
-FN:77,_ZNK7tagcoll4coll6SimpleISsSsE5beginEv
-FN:78,_ZNK7tagcoll4coll6SimpleISsSsE3endEv
-FN:62,_ZN7tagcoll4coll6SimpleISsSsED1Ev
-DA:62,0
-DA:77,0
-DA:78,0
-DA:79,1
-DA:80,21146
-DA:82,2
-LF:6
-LH:3
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/coll/simple.tcc
-FN:38,_ZN7tagcoll4coll6SimpleISsSsE6insertISt3setISsSt4lessISsESaISsEEN6wibble5EmptyISsEEEEvRKT_RKT0_
-FN:38,_ZN7tagcoll4coll6SimpleISsSsE6insertISt3setISsSt4lessISsESaISsEES8_EEvRKT_RKT0_
-DA:38,42290
-DA:42,42290
-DA:43,0
-DA:44,84580
-DA:47,42290
-DA:48,42290
-DA:49,21145
-DA:51,21145
-BA:42,0
-BA:42,0
-BA:42,1
-BA:42,2
-BA:44,0
-BA:44,0
-BA:44,2
-BA:44,2
-BA:48,0
-BA:48,0
-BA:48,2
-BA:48,2
-LF:8
-LH:7
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/diskindex/int.h
-FN:69,_ZN7tagcoll9diskindex10IntIndexerC1Ev
-FN:69,_ZN7tagcoll9diskindex10IntIndexerD1Ev
-FN:72,_ZN7tagcoll9diskindex10IntIndexer3mapEji
-DA:69,4
-DA:72,211196
-DA:74,211196
-DA:75,21142
-DA:76,211196
-DA:77,211196
-BA:69,1
-BA:69,2
-BA:74,2
-BA:74,2
-LF:6
-LH:6
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/diskindex/mmap.h
-FN:89,_ZN7tagcoll9diskindex11MMapIndexerC2Ev
-FN:79,_ZN7tagcoll9diskindex4MMap5alignIiEET_S3_
-FN:91,_ZN7tagcoll9diskindex11MMapIndexerD0Ev
-FN:91,_ZN7tagcoll9diskindex11MMapIndexerD1Ev
-FN:91,_ZN7tagcoll9diskindex11MMapIndexerD2Ev
-DA:79,0
-DA:81,0
-DA:89,0
-DA:91,0
-BA:91,0
-BA:91,0
-BA:91,0
-BA:91,0
-BA:91,0
-BA:91,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/input/base.h
-FN:62,_ZN7tagcoll9exception5Input4lineEi
-FN:68,_ZNK7tagcoll9exception5Input4typeEv
-FN:81,_ZNK7tagcoll9exception6Parser4typeEv
-FN:59,_ZN7tagcoll9exception5InputD2Ev
-FN:79,_ZN7tagcoll9exception6ParserD0Ev
-FN:79,_ZN7tagcoll9exception6ParserD1Ev
-FN:59,_ZN7tagcoll9exception5InputD0Ev
-FN:59,_ZN7tagcoll9exception5InputD1Ev
-FN:41,_ZN7tagcoll9exception5InputC2ERKS1_
-FN:75,_ZN7tagcoll9exception6ParserC1ERKS1_
-FN:53,_ZN7tagcoll9exception5InputC1EiRKSs
-DA:41,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:59,0
-DA:62,0
-DA:68,0
-DA:75,0
-DA:79,0
-DA:81,0
-DA:83,0
-BA:59,0
-BA:59,0
-BA:59,0
-BA:59,0
-BA:59,0
-BA:59,0
-BA:79,0
-BA:79,0
-BA:79,0
-BA:79,0
-LF:11
-LH:0
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/TextFormat.h
-FN:64,_ZN7tagcoll10textformat11StdioWriterC1EP8_IO_FILE
-DA:64,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/TextFormat.tcc
-FN:37,_ZL11printTagsetRKSt3setISsSt4lessISsESaISsEEP8_IO_FILE
-FN:122,_ZN7tagcoll10textformat5parseINS_4coll8InserterINS2_6SimpleISsSsEEEEEEvRNS_5input5InputET_
-FN:56,_ZN7tagcoll10textformatL9outStringERKSsP8_IO_FILEPKc
-FN:63,_ZN7tagcoll10textformat11StdioWriteraSIN6wibble9SingletonISsEESt3setISsSt4lessISsESaISsEEEERS1_RKSt4pairIT_T0_E
-DA:37,0
-DA:39,0
-DA:41,0
-DA:43,0
-DA:44,0
-DA:48,0
-DA:49,0
-DA:51,0
-DA:56,126871
-DA:58,126871
-DA:59,0
-DA:60,126871
-DA:63,21145
-DA:65,42290
-DA:68,21145
-DA:69,0
-DA:70,0
-DA:71,21145
-DA:73,21145
-DA:75,21145
-DA:76,0
-DA:77,126871
-DA:80,105726
-DA:81,84581
-DA:82,0
-DA:83,105726
-DA:86,21145
-DA:87,0
-DA:88,21145
-DA:122,2
-DA:124,2
-DA:126,2
-DA:127,2
-DA:129,2
-DA:130,2
-DA:131,253744
-DA:134,253744
-DA:135,0
-DA:137,0
-DA:138,0
-DA:141,507488
-DA:143,253742
-DA:144,42290
-DA:146,211452
-DA:149,253744
-DA:152,42290
-DA:154,42292
-DA:156,42290
-DA:157,0
-DA:158,42290
-DA:159,0
-DA:161,42290
-DA:162,42290
-DA:164,42292
-DA:165,42292
-DA:166,42292
-DA:167,42292
-DA:169,42290
-DA:170,0
-DA:171,42290
-DA:174,2
-DA:177,2
-BA:39,0
-BA:39,0
-BA:41,0
-BA:41,0
-BA:43,0
-BA:43,0
-BA:48,0
-BA:48,0
-BA:58,1
-BA:58,2
-BA:65,2
-BA:65,2
-BA:68,1
-BA:68,2
-BA:69,0
-BA:69,0
-BA:73,2
-BA:73,1
-BA:75,1
-BA:75,2
-BA:77,2
-BA:77,2
-BA:80,2
-BA:80,2
-BA:81,1
-BA:81,2
-BA:86,1
-BA:86,2
-BA:131,2
-BA:131,2
-BA:141,2
-BA:141,2
-BA:143,2
-BA:143,2
-BA:149,2
-BA:149,2
-BA:149,2
-BA:149,2
-BA:154,2
-BA:154,2
-BA:154,1
-BA:154,2
-BA:154,2
-BA:154,2
-BA:156,1
-BA:156,2
-BA:158,1
-BA:158,2
-BA:169,1
-BA:169,2
-LF:62
-LH:42
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/apt/packagerecord.h
-FN:63,_ZN3ept3apt13PackageRecordC1Ev
-FN:37,_ZN3ept3apt13PackageRecordD1Ev
-FN:51,_ZNK3ept3apt13PackageRecord11parseStringERKSsS3_
-FN:166,_ZNK3ept3apt13PackageRecord3tagERKSt3setISsSt4lessISsESaISsEE
-FN:66,_ZNK3ept3apt13PackageRecord7packageERKSs
-FN:150,_ZNK3ept3apt13PackageRecord11descriptionERKSs
-FN:78,_ZNK3ept3apt13PackageRecord13installedSizeEj
-FN:134,_ZNK3ept3apt13PackageRecord11packageSizeEj
-DA:37,0
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:63,6
-DA:66,0
-DA:68,0
-DA:78,0
-DA:80,0
-DA:134,0
-DA:136,0
-DA:150,0
-DA:152,0
-DA:166,0
-DA:168,0
-BA:53,0
-BA:53,0
-LF:16
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/apt/recordparser.h
-FN:50,_ZN3ept3apt12RecordParserC2Ev
-FN:39,_ZN3ept3apt12RecordParserD2Ev
-FN:73,_ZNK3ept3apt12RecordParser6lookupERKSs
-DA:39,0
-DA:50,6
-DA:73,0
-LF:3
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt/record.h
-DA:86,2
-BA:86,1
-BA:86,2
-LF:1
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/textsearch/textsearch.cc
-FN:192,_ZNK3ept10textsearch9TagFilterclERKSs
-FN:191,_ZN3ept10textsearch9TagFilterC1Ev
-FN:254,_Z41__static_initialization_and_destruction_0ii
-FN:254,_GLOBAL__I_textsearch.cc
-FN:254,_ZN3ept10textsearch9TagFilterD0Ev
-FN:191,_ZN3ept10textsearch9TagFilterD1Ev
-FN:212,_ZNK3ept10textsearch10TextSearch16makeRelatedQueryERKSs
-FN:197,_ZNK3ept10textsearch10TextSearch6expandERN6Xapian7EnquireE
-FN:181,_ZNK3ept10textsearch10TextSearch11docidByNameERKSs
-FN:240,_ZNK3ept10textsearch10TextSearch11getIntValueERKSsj
-FN:227,_ZNK3ept10textsearch10TextSearch14getDoubleValueERKSsj
-FN:67,_ZN3ept10textsearch10TextSearch12needsRebuildERNS_3apt3AptE
-FN:81,_ZN3ept10textsearch10TextSearch15rebuildIfNeededERNS_3apt3AptERKSt6vectorIPKNS1_12ExtraIndexerESaIS8_EE
-FN:58,_ZN3ept10textsearch10TextSearch7toLowerERKSs
-FN:153,_ZNK3ept10textsearch10TextSearch18makePartialORQueryERKSs
-FN:147,_ZNK3ept10textsearch10TextSearch11makeORQueryERKSs
-FN:72,_ZNK3ept10textsearch10TextSearch17normalize_and_addERN6Xapian8DocumentERKSsRi
-FN:50,_ZN3ept10textsearch10TextSearchC1Ev
-FN:50,_ZN3ept10textsearch10TextSearchC2Ev
-DA:50,11
-DA:51,11
-DA:53,22
-DA:54,11
-DA:55,9
-DA:56,11
-DA:58,7
-DA:60,7
-DA:61,7
-DA:62,44
-DA:63,37
-DA:64,0
-DA:67,3
-DA:69,3
-DA:72,0
-DA:74,0
-DA:75,0
-DA:76,0
-DA:77,0
-DA:78,0
-DA:79,0
-DA:81,10
-DA:85,10
-DA:86,10
-DA:87,4
-DA:90,6
-DA:91,6
-DA:92,6
-DA:94,6
-DA:95,6
-DA:96,2610
-DA:101,2604
-DA:102,0
-DA:104,2604
-DA:106,2604
-DA:107,2604
-DA:109,2604
-DA:111,2604
-DA:114,2604
-DA:115,2604
-DA:117,0
-DA:119,2604
-DA:120,2604
-DA:121,5208
-DA:124,5208
-DA:125,2604
-DA:127,2604
-DA:128,2170
-DA:130,434
-DA:131,6
-DA:135,6
-DA:136,1
-DA:138,5
-DA:140,6
-DA:142,6
-DA:144,6
-DA:147,2
-DA:149,2
-DA:150,4
-DA:153,1
-DA:155,1
-DA:156,1
-DA:158,2
-DA:160,1
-DA:162,1
-DA:164,1
-DA:165,1
-DA:169,0
-DA:171,1
-DA:178,1
-DA:181,10
-DA:183,10
-DA:184,10
-DA:185,5
-DA:187,5
-DA:191,4
-DA:192,0
-DA:195,2
-DA:197,0
-DA:199,0
-DA:201,0
-DA:202,0
-DA:203,0
-DA:205,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:209,0
-DA:212,0
-DA:214,0
-DA:217,0
-DA:218,0
-DA:219,0
-DA:220,0
-DA:221,0
-DA:224,0
-DA:227,4
-DA:229,4
-DA:230,4
-DA:231,2
-DA:232,2
-DA:233,2
-DA:234,2
-DA:235,0
-DA:237,2
-DA:240,4
-DA:242,4
-DA:243,4
-DA:244,2
-DA:245,2
-DA:246,2
-DA:247,2
-DA:248,0
-DA:250,2
-DA:254,6
-BA:54,2
-BA:54,2
-BA:54,0
-BA:54,0
-BA:62,2
-BA:62,2
-BA:77,0
-BA:77,0
-BA:86,2
-BA:86,2
-BA:96,2
-BA:96,2
-BA:101,2
-BA:101,1
-BA:101,1
-BA:101,2
-BA:115,1
-BA:115,2
-BA:127,2
-BA:127,2
-BA:135,2
-BA:135,2
-BA:158,2
-BA:158,2
-BA:162,2
-BA:162,1
-BA:165,1
-BA:165,2
-BA:184,2
-BA:184,2
-BA:191,0
-BA:191,0
-BA:191,1
-BA:191,2
-BA:202,0
-BA:202,0
-BA:207,0
-BA:207,0
-BA:220,0
-BA:220,0
-BA:230,2
-BA:230,2
-BA:234,1
-BA:234,2
-BA:243,2
-BA:243,2
-BA:247,1
-BA:247,2
-BA:254,2
-BA:254,1
-BA:254,2
-BA:254,1
-LF:115
-LH:83
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/textsearch/textsearch.h
-FN:133,_ZNK3ept10textsearch10TextSearch2dbEv
-FN:179,_ZNK3ept10textsearch10TextSearch11makeORQueryIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEEEEN6Xapian5QueryERKT_SE_
-FN:179,_ZNK3ept10textsearch10TextSearch11makeORQueryIN6wibble9Tokenizer14const_iteratorEEEN6Xapian5QueryERKT_SA_
-DA:133,4
-DA:179,3
-DA:181,3
-DA:183,10
-DA:185,7
-DA:186,7
-DA:187,7
-DA:188,7
-DA:189,0
-DA:191,3
-BA:183,2
-BA:183,2
-BA:183,2
-BA:183,2
-BA:188,1
-BA:188,2
-BA:188,1
-BA:188,2
-LF:10
-LH:9
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/regexp.h
-FN:119,_ZNK6wibble9Tokenizer14const_iteratorneERKS1_
-FN:107,_ZN6wibble9Tokenizer14const_iteratorC1ERS0_b
-FN:129,_ZN6wibble9Tokenizer3endEv
-FN:106,_ZN6wibble9Tokenizer14const_iteratorC1ERS0_
-FN:128,_ZN6wibble9Tokenizer5beginEv
-FN:125,_ZN6wibble9TokenizerC1ERKSsS2_i
-FN:111,_ZNK6wibble9Tokenizer14const_iteratordeEv
-FN:90,_ZN6wibble9TokenizerD1Ev
-DA:90,0
-DA:106,0
-DA:107,0
-DA:111,0
-DA:113,0
-DA:119,0
-DA:121,0
-DA:125,0
-DA:126,0
-DA:128,0
-DA:129,0
-BA:121,0
-BA:121,0
-BA:121,0
-BA:121,0
-LF:11
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISsEED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaISsED2Ev
-FN:106,_ZNSaISsED1Ev
-FN:106,_ZNSaIjED2Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeISsEEC2Ev
-FN:98,_ZNSaISsEC2Ev
-FN:104,_ZNSaISsEC1ISt13_Rb_tree_nodeISsEEERKSaIT_E
-FN:98,_ZNSaIjEC2Ev
-DA:98,0
-DA:100,0
-DA:101,0
-DA:104,0
-DA:106,0
-LF:5
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:277,_ZNKSs7_M_dataEv
-FN:701,_ZNKSsixEj
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:1544,_ZNKSs4dataEv
-FN:543,_ZNKSs5beginEv
-FN:562,_ZNKSs3endEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:192,_ZNKSs4_Rep12_M_is_sharedEv
-FN:652,_ZNKSs8capacityEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:870,_ZNSs9push_backEc
-FN:791,_ZNSspLEc
-FN:501,_ZNSsaSERKSs
-FN:306,_ZNKSs8_M_checkEjPKc
-FN:1923,_ZNKSs6substrEjj
-FN:2162,_ZSteqIcEN9__gnu_cxx11__enable_ifIXsrSt9__is_charIT_E7__valueEbE6__typeERKSbIS3_St11char_traitsIS3_ESaIS3_EESC_
-FN:2201,_ZStneIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-DA:178,0
-DA:183,0
-DA:184,0
-DA:192,0
-DA:193,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:306,0
-DA:308,0
-DA:309,0
-DA:310,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:543,0
-DA:544,0
-DA:562,0
-DA:563,0
-DA:606,0
-DA:607,0
-DA:652,0
-DA:653,0
-DA:686,0
-DA:687,0
-DA:701,0
-DA:704,0
-DA:791,0
-DA:793,0
-DA:794,0
-DA:870,0
-DA:872,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:877,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:1923,0
-DA:1925,0
-DA:2067,0
-DA:2069,0
-DA:2162,0
-DA:2165,0
-DA:2201,0
-DA:2202,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:308,0
-BA:308,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-LF:70
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:668,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_EPKS3_RKS6_
-DA:668,0
-DA:673,0
-DA:674,0
-DA:675,0
-DA:676,0
-DA:677,0
-DA:678,0
-LF:7
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-DA:245,0
-DA:246,0
-DA:257,0
-DA:258,0
-DA:261,0
-DA:262,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:268,_ZNSt12__niter_baseISt20back_insert_iteratorISt6vectorISsSaISsEEELb0EE3__bES4_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:286,_ZNSt12__miter_baseIPSsLb0EE3__bES0_
-FN:268,_ZNSt12__niter_baseIPSsLb0EE3__bES0_
-FN:539,_ZNSt20__copy_move_backwardILb0ELb0ESt26random_access_iterator_tagE13__copy_move_bIPSsS3_EET0_T_S5_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0EPSsS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPSsS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardIPSsS0_ET0_T_S2_S1_
-FN:683,_ZSt8__fill_aIPSsSsEN9__gnu_cxx11__enable_ifIXntsrSt11__is_scalarIT0_E7__valueEvE6__typeET_S8_RKS4_
-FN:724,_ZSt4fillIPSsSsEvT_S1_RKT0_
-FN:309,_ZNSt11__copy_moveILb0ELb0ESt18input_iterator_tagE8__copy_mIN6Xapian12TermIteratorESt20back_insert_iteratorISt6vectorISsSaISsEEEEET0_T_SB_SA_
-FN:286,_ZNSt12__miter_baseIN6Xapian12TermIteratorELb0EE3__bES1_
-FN:268,_ZNSt12__niter_baseIN6Xapian12TermIteratorELb0EE3__bES1_
-FN:385,_ZSt13__copy_move_aILb0EN6Xapian12TermIteratorESt20back_insert_iteratorISt6vectorISsSaISsEEEET1_T0_S8_S7_
-FN:430,_ZSt14__copy_move_a2ILb0EN6Xapian12TermIteratorESt20back_insert_iteratorISt6vectorISsSaISsEEEET1_T0_S8_S7_
-FN:456,_ZSt4copyIN6Xapian12TermIteratorESt20back_insert_iteratorISt6vectorISsSaISsEEEET0_T_S8_S7_
-DA:210,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:268,0
-DA:269,0
-DA:286,0
-DA:287,0
-DA:309,0
-DA:311,0
-DA:312,0
-DA:313,0
-DA:385,0
-DA:393,0
-DA:396,0
-DA:430,0
-DA:435,0
-DA:456,0
-DA:466,0
-DA:539,0
-DA:542,0
-DA:543,0
-DA:544,0
-DA:579,0
-DA:587,0
-DA:592,0
-DA:597,0
-DA:602,0
-DA:624,0
-DA:636,0
-DA:683,0
-DA:685,0
-DA:686,0
-DA:687,0
-DA:724,0
-DA:731,0
-DA:733,0
-BA:215,0
-BA:215,0
-BA:311,0
-BA:311,0
-BA:542,0
-BA:542,0
-BA:685,0
-BA:685,0
-LF:37
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:97,_ZSt8_DestroyIPjEvT_S1_
-FN:126,_ZSt8_DestroyIPjjEvT_S1_RSaIT0_E
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-FN:75,_ZSt10_ConstructISsSsEvPT_RKT0_
-DA:75,0
-DA:79,0
-DA:80,0
-DA:87,0
-DA:88,0
-DA:97,0
-DA:101,0
-DA:103,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-BA:79,0
-BA:79,0
-BA:101,0
-BA:101,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:703,_ZN9__gnu_cxx17__normal_iteratorIPKcSsEppEv
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPKcSsEdeEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKcSsEC1ERKS2_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKcSsE4baseEv
-FN:781,_ZN9__gnu_cxxneIPKcSsEEbRKNS_17__normal_iteratorIT_T0_EES8_
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEdeEv
-FN:398,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEC1ERS2_
-FN:456,_ZSt13back_inserterISt6vectorISsSaISsEEESt20back_insert_iteratorIT_ERS4_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEC1ERKS2_
-FN:125,_ZNSt16reverse_iteratorIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEEEC1ES6_
-FN:715,_ZN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEmmEv
-FN:154,_ZNKSt16reverse_iteratorIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEEEdeEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEC1ERKS1_
-FN:703,_ZN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEppEv
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEE4baseEv
-FN:781,_ZN9__gnu_cxxneIPSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESA_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-FN:846,_ZN9__gnu_cxxmiIPSsSt6vectorISsSaISsEEEENS_17__normal_iteratorIT_T0_E15difference_typeERKS8_SB_
-FN:434,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEppEv
-FN:429,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEdeEv
-FN:412,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEaSERKSs
-DA:125,1
-DA:154,1
-DA:156,1
-DA:157,1
-DA:398,0
-DA:412,0
-DA:414,0
-DA:415,0
-DA:429,0
-DA:430,0
-DA:434,0
-DA:435,0
-DA:456,0
-DA:457,0
-DA:683,0
-DA:695,0
-DA:696,0
-DA:703,0
-DA:705,0
-DA:706,0
-DA:715,0
-DA:717,0
-DA:718,0
-DA:747,0
-DA:748,0
-DA:769,0
-DA:770,0
-DA:781,0
-DA:782,0
-DA:846,0
-DA:847,0
-LF:31
-LH:4
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:111,_ZNSt8iteratorISt26random_access_iterator_tagSsiPSsRSsEC2Ev
-DA:111,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_set.h
-FN:261,_ZNKSt3setISsSt4lessISsESaISsEE5beginEv
-FN:270,_ZNKSt3setISsSt4lessISsESaISsEE3endEv
-FN:141,_ZNSt3setISsSt4lessISsESaISsEEC1Ev
-FN:93,_ZNSt3setISsSt4lessISsESaISsEED1Ev
-DA:93,0
-DA:141,0
-DA:142,0
-DA:261,0
-DA:262,0
-DA:270,0
-DA:271,0
-LF:7
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_tree.h
-FN:289,_ZNKSt23_Rb_tree_const_iteratorISsEneERKS0_
-FN:247,_ZNKSt23_Rb_tree_const_iteratorISsEdeEv
-FN:452,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_beginEv
-FN:398,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_S_leftEPSt18_Rb_tree_node_base
-FN:240,_ZNSt23_Rb_tree_const_iteratorISsEC1EPKSt13_Rb_tree_nodeISsE
-FN:603,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5beginEv
-FN:614,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE3endEv
-FN:347,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE21_M_get_Node_allocatorEv
-FN:415,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EE13_M_initializeEv
-FN:403,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEEC1Ev
-FN:351,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13get_allocatorEv
-FN:360,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11_M_put_nodeEPSt13_Rb_tree_nodeISsE
-FN:388,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE15_M_destroy_nodeEPSt13_Rb_tree_nodeISsE
-FN:936,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_eraseEPSt13_Rb_tree_nodeISsE
-FN:584,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEED1Ev
-FN:255,_ZNSt23_Rb_tree_const_iteratorISsEppEv
-DA:240,0
-DA:241,0
-DA:247,0
-DA:248,0
-DA:255,0
-DA:257,0
-DA:258,0
-DA:289,0
-DA:290,0
-DA:347,0
-DA:348,0
-DA:351,0
-DA:352,0
-DA:360,0
-DA:361,0
-DA:388,0
-DA:390,0
-DA:391,0
-DA:392,0
-DA:398,0
-DA:403,0
-DA:405,0
-DA:406,0
-DA:415,0
-DA:417,0
-DA:418,0
-DA:419,0
-DA:420,0
-DA:421,0
-DA:452,0
-DA:453,0
-DA:479,0
-DA:480,0
-DA:487,0
-DA:488,0
-DA:562,0
-DA:584,0
-DA:585,0
-DA:603,0
-DA:606,0
-DA:614,0
-DA:617,0
-DA:936,0
-DA:939,0
-DA:941,0
-DA:942,0
-DA:943,0
-DA:944,0
-DA:946,0
-BA:939,0
-BA:939,0
-LF:49
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyIPSsS2_EET0_T_S4_S3_
-FN:113,_ZSt18uninitialized_copyIPSsS0_ET0_T_S2_S1_
-FN:261,_ZSt22__uninitialized_copy_aIPSsS0_SsET0_T_S2_S1_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPSsS0_SaISsEET0_T_S3_S2_RT1_
-FN:186,_ZNSt22__uninitialized_fill_nILb0EE20uninitialized_fill_nIPSsjSsEEvT_T0_RKT1_
-FN:223,_ZSt20uninitialized_fill_nIPSsjSsEvT_T0_RKT1_
-FN:322,_ZSt24__uninitialized_fill_n_aIPSsjSsSsEvT_T0_RKT1_RSaIT2_E
-DA:73,0
-DA:75,0
-DA:78,0
-DA:79,0
-DA:81,0
-DA:83,0
-DA:85,0
-DA:86,0
-DA:113,0
-DA:122,0
-DA:186,0
-DA:188,0
-DA:191,0
-DA:192,0
-DA:194,0
-DA:196,0
-DA:197,0
-DA:199,0
-DA:223,0
-DA:228,0
-DA:230,0
-DA:261,0
-DA:262,0
-DA:268,0
-DA:272,0
-DA:322,0
-DA:323,0
-BA:78,0
-BA:78,0
-BA:79,0
-BA:79,0
-BA:191,0
-BA:191,0
-LF:27
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:484,_ZNKSt6vectorISsSaISsEE4sizeEv
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:404,_ZNKSt6vectorISsSaISsEE3endEv
-FN:386,_ZNKSt6vectorISsSaISsEE5beginEv
-FN:101,_ZNKSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:97,_ZNSt12_Vector_baseIjSaIjEE19_M_get_Tp_allocatorEv
-FN:395,_ZNSt6vectorISsSaISsEE3endEv
-FN:413,_ZNSt6vectorISsSaISsEE6rbeginEv
-FN:377,_ZNSt6vectorISsSaISsEE5beginEv
-FN:526,_ZNKSt6vectorISsSaISsEE5emptyEv
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:79,_ZNSt12_Vector_baseIjSaIjEE12_Vector_implD1Ev
-FN:84,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseISsSaISsEEC2Ev
-FN:213,_ZNSt6vectorISsSaISsEEC1Ev
-FN:489,_ZNKSt6vectorISsSaISsEE8max_sizeEv
-FN:84,_ZNSt12_Vector_baseIjSaIjEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseIjSaIjEEC2Ev
-FN:213,_ZNSt6vectorIjSaIjEEC1Ev
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:147,_ZNSt12_Vector_baseIjSaIjEE13_M_deallocateEPjj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:135,_ZNSt12_Vector_baseIjSaIjEED2Ev
-FN:299,_ZNSt6vectorIjSaIjEED1Ev
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-FN:1089,_ZNSt6vectorISsSaISsEE15_M_erase_at_endEPSs
-FN:1075,_ZNKSt6vectorISsSaISsEE12_M_check_lenEjPKc
-FN:143,_ZNSt12_Vector_baseISsSaISsEE11_M_allocateEj
-FN:686,_ZNSt6vectorISsSaISsEE9push_backERKSs
-FN:791,_ZNSt6vectorISsSaISsEE6insertEN9__gnu_cxx17__normal_iteratorIPSsS1_EEjRKSs
-FN:504,_ZNSt6vectorISsSaISsEE6resizeEjSs
-DA:79,0
-DA:84,0
-DA:85,0
-DA:86,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:108,0
-DA:109,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:143,0
-DA:144,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:213,0
-DA:214,0
-DA:299,0
-DA:300,0
-DA:301,0
-DA:377,0
-DA:378,0
-DA:386,0
-DA:387,0
-DA:395,0
-DA:396,0
-DA:404,0
-DA:405,0
-DA:413,1
-DA:414,1
-DA:484,0
-DA:485,0
-DA:489,0
-DA:490,0
-DA:504,0
-DA:506,0
-DA:507,0
-DA:509,0
-DA:510,0
-DA:526,0
-DA:527,0
-DA:686,0
-DA:688,0
-DA:690,0
-DA:691,0
-DA:694,0
-DA:695,0
-DA:791,0
-DA:792,0
-DA:1075,0
-DA:1077,0
-DA:1078,0
-DA:1080,0
-DA:1081,0
-DA:1089,0
-DA:1091,0
-DA:1092,0
-DA:1093,0
-BA:144,0
-BA:144,0
-BA:149,0
-BA:149,0
-BA:149,0
-BA:149,0
-BA:506,0
-BA:506,0
-BA:688,0
-BA:688,0
-BA:1077,0
-BA:1077,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-LF:62
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/vector.tcc
-FN:283,_ZNSt6vectorISsSaISsEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPSsS1_EERKSs
-FN:350,_ZNSt6vectorISsSaISsEE14_M_fill_insertEN9__gnu_cxx17__normal_iteratorIPSsS1_EEjRKSs
-DA:283,0
-DA:286,0
-DA:288,0
-DA:291,0
-DA:293,0
-DA:295,0
-DA:299,0
-DA:307,0
-DA:308,0
-DA:309,0
-DA:316,0
-DA:321,0
-DA:323,0
-DA:324,0
-DA:330,0
-DA:332,0
-DA:333,0
-DA:334,0
-DA:336,0
-DA:338,0
-DA:341,0
-DA:342,0
-DA:343,0
-DA:345,0
-DA:350,0
-DA:352,0
-DA:357,0
-DA:361,0
-DA:363,0
-DA:364,0
-DA:365,0
-DA:367,0
-DA:371,0
-DA:372,0
-DA:374,0
-DA:379,0
-DA:383,0
-DA:384,0
-DA:387,0
-DA:388,0
-DA:394,0
-DA:395,0
-DA:396,0
-DA:399,0
-DA:407,0
-DA:410,0
-DA:411,0
-DA:417,0
-DA:419,0
-DA:421,0
-DA:422,0
-DA:424,0
-DA:426,0
-DA:429,0
-DA:430,0
-DA:431,0
-DA:434,0
-BA:286,0
-BA:286,0
-BA:352,0
-BA:352,0
-BA:357,0
-BA:357,0
-BA:365,0
-BA:365,0
-LF:57
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIjED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISsE8max_sizeEv
-FN:69,_ZN9__gnu_cxx13new_allocatorIjEC2Ev
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-FN:97,_ZN9__gnu_cxx13new_allocatorIjE10deallocateEPjj
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE10deallocateEPS2_j
-FN:118,_ZN9__gnu_cxx13new_allocatorISsE7destroyEPSs
-FN:107,_ZN9__gnu_cxx13new_allocatorISsE9constructEPSsRKSs
-FN:87,_ZN9__gnu_cxx13new_allocatorISsE8allocateEjPKv
-DA:69,0
-DA:71,0
-DA:76,0
-DA:87,0
-DA:89,0
-DA:90,0
-DA:92,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:107,0
-DA:108,0
-DA:118,0
-BA:89,0
-BA:89,0
-BA:108,0
-BA:108,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,2
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/xapian/base.h
-FN:164,_ZNK6Xapian8Internal9RefCntPtrINS_15PostingIterator8InternalEE3getEv
-FN:164,_ZNK6Xapian8Internal9RefCntPtrINS_12TermIterator8InternalEE3getEv
-FN:94,_ZN6Xapian8Internal9RefCntPtrINS_5Query8InternalEEC1EPS3_
-FN:130,_ZN6Xapian8Internal9RefCntPtrINS_5Query8InternalEED1Ev
-DA:94,0
-DA:96,0
-DA:97,0
-DA:130,0
-DA:132,0
-DA:136,0
-DA:137,0
-DA:138,0
-DA:140,0
-DA:164,0
-DA:166,0
-BA:96,0
-BA:96,0
-BA:132,0
-BA:132,0
-BA:132,0
-BA:132,0
-BA:132,0
-BA:132,0
-BA:138,0
-BA:138,0
-LF:11
-LH:0
-end_of_record
-SF:/usr/include/xapian/database.h
-FN:178,_ZNK6Xapian8Database12allterms_endERKSs
-FN:124,_ZNK6Xapian8Database12postlist_endERKSs
-DA:124,0
-DA:125,0
-DA:178,0
-DA:179,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/xapian/document.h
-FN:170,_ZNK6Xapian8Document12termlist_endEv
-DA:170,0
-DA:171,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/xapian/enquire.h
-FN:273,_ZN6Xapian12MSetIteratorppEv
-FN:374,_ZN6XapianeqERKNS_12MSetIteratorES2_
-FN:379,_ZN6XapianneERKNS_12MSetIteratorES2_
-FN:476,_ZN6Xapian12ESetIteratorppEv
-FN:525,_ZN6XapianneERKNS_12ESetIteratorES2_
-FN:258,_ZN6Xapian12MSetIteratorD1Ev
-FN:461,_ZN6Xapian12ESetIteratorD1Ev
-FN:564,_ZN6Xapian4RSet12add_documentERKNS_12MSetIteratorE
-FN:955,_ZNK6Xapian7Enquire8get_esetEjRKNS_4RSetEPKNS_13ExpandDeciderE
-DA:258,0
-DA:273,0
-DA:274,0
-DA:275,0
-DA:374,0
-DA:376,0
-DA:379,0
-DA:381,0
-DA:461,0
-DA:476,0
-DA:477,0
-DA:478,0
-DA:525,0
-DA:527,0
-DA:564,0
-DA:955,0
-DA:956,0
-LF:17
-LH:0
-end_of_record
-SF:/usr/include/xapian/expanddecider.h
-FN:32,_ZN6Xapian13ExpandDeciderC2Ev
-DA:32,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/xapian/postingiterator.h
-FN:150,_ZN6XapianeqERKNS_15PostingIteratorES2_
-DA:150,0
-DA:152,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/xapian/query.h
-FN:258,_ZN6Xapian5QueryC1INS_12TermIteratorEEENS0_2opET_S4_j
-FN:258,_ZN6Xapian5QueryC1IN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEEEENS0_2opET_SA_j
-DA:258,3
-DA:259,3
-DA:262,3
-DA:265,13
-DA:266,7
-DA:267,7
-DA:270,3
-DA:271,0
-DA:272,0
-DA:273,0
-DA:275,3
-BA:265,0
-BA:265,0
-BA:265,2
-BA:265,2
-LF:11
-LH:8
-end_of_record
-SF:/usr/include/xapian/termgenerator.h
-FN:136,_ZN6Xapian13TermGenerator28index_text_without_positionsERKSsjS2_
-DA:136,5208
-DA:137,5208
-LF:2
-LH:2
-end_of_record
-SF:/usr/include/xapian/termiterator.h
-FN:136,_ZN6XapianeqERKNS_12TermIteratorES2_
-FN:142,_ZN6XapianneERKNS_12TermIteratorES2_
-DA:136,0
-DA:138,0
-DA:142,0
-DA:144,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/xapian/unicode.h
-FN:65,_ZN6Xapian12Utf8Iterator6assignEPKcj
-FN:118,_ZN6Xapian12Utf8IteratorC1ERKSs
-DA:65,5208
-DA:66,5208
-DA:67,5208
-DA:68,5208
-DA:69,5208
-DA:71,0
-DA:73,5208
-DA:118,5208
-BA:66,2
-BA:66,1
-LF:8
-LH:7
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/apt/packagerecord.h
-FN:166,_ZNK3ept3apt13PackageRecord3tagERKSt3setISsSt4lessISsESaISsEE
-DA:166,0
-DA:168,0
-LF:2
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/apt/recordparser.h
-FN:73,_ZNK3ept3apt12RecordParser6lookupERKSs
-DA:73,0
-LF:1
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/debtags.h
-FN:282,_ZNK3ept7debtags7Debtags10vocabularyEv
-FN:112,_ZNK3ept7debtags7Debtags11idByPackageERKSs
-FN:244,_ZNK3ept7debtags7Debtags13getTagsOfItemERKSs
-DA:112,0
-DA:114,0
-DA:244,0
-DA:246,0
-DA:247,0
-DA:248,0
-DA:282,0
-BA:247,0
-BA:247,0
-LF:7
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/tag.h
-FN:175,_ZN3ept7debtags3TagD1Ev
-FN:179,_ZNK3ept7debtags3TagltERKS1_
-DA:175,0
-DA:179,0
-LF:2
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/debtags/vocabulary.h
-FN:181,_ZNK3ept7debtags10Vocabulary8tagsByIDISt3setIiSt4lessIiESaIiEEEES3_INS0_3TagES4_IS8_ESaIS8_EERKT_
-DA:181,0
-DA:183,0
-DA:184,0
-DA:186,0
-DA:187,0
-BA:184,0
-BA:184,0
-LF:5
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/textsearch/extraindexers.cc
-FN:44,_ZNK3ept10textsearch19DebtagsExtraIndexerclERN6Xapian8DocumentERKNS_3apt13PackageRecordE
-FN:35,_ZNK3ept10textsearch19AptTagsExtraIndexerclERN6Xapian8DocumentERKNS_3apt13PackageRecordE
-DA:35,0
-DA:38,0
-DA:39,0
-DA:41,0
-DA:42,0
-DA:44,0
-DA:47,0
-DA:48,0
-DA:50,0
-DA:51,0
-BA:39,0
-BA:39,0
-BA:48,0
-BA:48,0
-LF:10
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/textsearch/extraindexers.h
-FN:36,_ZN3ept10textsearch19AptTagsExtraIndexerD0Ev
-FN:36,_ZN3ept10textsearch19AptTagsExtraIndexerD1Ev
-FN:41,_ZN3ept10textsearch19DebtagsExtraIndexerD0Ev
-FN:41,_ZN3ept10textsearch19DebtagsExtraIndexerD1Ev
-DA:36,0
-DA:41,0
-BA:36,0
-BA:36,0
-BA:36,0
-BA:36,0
-BA:41,0
-BA:41,0
-BA:41,0
-BA:41,0
-LF:2
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/textsearch/textsearch.h
-FN:123,_ZN3ept10textsearch10TextSearch12ExtraIndexerD2Ev
-FN:123,_ZN3ept10textsearch10TextSearch12ExtraIndexerD0Ev
-FN:123,_ZN3ept10textsearch10TextSearch12ExtraIndexerD1Ev
-DA:123,0
-BA:123,0
-BA:123,0
-BA:123,0
-BA:123,0
-BA:123,0
-BA:123,0
-LF:1
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/operators.h
-FN:74,_ZN6wibble9operatorsorIiEESt3setIT_St4lessIS3_ESaIS3_EERKS7_S9_
-FN:82,_ZN6wibble9operatorsmiIiEESt3setIT_St4lessIS3_ESaIS3_EERKS7_S9_
-DA:74,0
-DA:75,0
-DA:76,0
-DA:78,0
-DA:82,0
-DA:83,0
-DA:84,0
-DA:86,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISsEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeIN3ept7debtags3TagEEED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeIiEED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaISsED1Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeISsEEC2Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeIN3ept7debtags3TagEEEC2Ev
-FN:106,_ZNSaIN3ept7debtags3TagEED1Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeIiEEC2Ev
-FN:106,_ZNSaIiED1Ev
-FN:100,_ZNSaISt13_Rb_tree_nodeIiEEC2ERKS1_
-FN:104,_ZNSaISsEC1ISt13_Rb_tree_nodeISsEEERKSaIT_E
-FN:104,_ZNSaIN3ept7debtags3TagEEC1ISt13_Rb_tree_nodeIS1_EEERKSaIT_E
-FN:104,_ZNSaIiEC1ISt13_Rb_tree_nodeIiEEERKSaIT_E
-DA:98,0
-DA:100,0
-DA:101,0
-DA:104,0
-DA:106,0
-LF:5
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:277,_ZNKSs7_M_dataEv
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-DA:178,0
-DA:183,0
-DA:184,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:606,0
-DA:607,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-LF:27
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:668,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_EPKS3_RKS6_
-DA:668,0
-DA:673,0
-DA:674,0
-DA:675,0
-DA:676,0
-DA:677,0
-DA:678,0
-LF:7
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-DA:261,0
-DA:262,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algo.h
-FN:5055,_ZSt9set_unionISt23_Rb_tree_const_iteratorIiES1_St15insert_iteratorISt3setIiSt4lessIiESaIiEEEET1_T_SA_T0_SB_S9_
-FN:5300,_ZSt14set_differenceISt23_Rb_tree_const_iteratorIiES1_St15insert_iteratorISt3setIiSt4lessIiESaIiEEEET1_T_SA_T0_SB_S9_
-DA:5055,0
-DA:5074,0
-DA:5076,0
-DA:5078,0
-DA:5079,0
-DA:5081,0
-DA:5083,0
-DA:5084,0
-DA:5088,0
-DA:5089,0
-DA:5090,0
-DA:5092,0
-DA:5095,0
-DA:5300,0
-DA:5317,0
-DA:5318,0
-DA:5320,0
-DA:5321,0
-DA:5322,0
-DA:5324,0
-DA:5325,0
-DA:5328,0
-DA:5329,0
-DA:5331,0
-BA:5074,0
-BA:5074,0
-BA:5074,0
-BA:5074,0
-BA:5074,0
-BA:5074,0
-BA:5076,0
-BA:5076,0
-BA:5081,0
-BA:5081,0
-BA:5317,0
-BA:5317,0
-BA:5317,0
-BA:5317,0
-BA:5317,0
-BA:5317,0
-BA:5318,0
-BA:5318,0
-BA:5324,0
-BA:5324,0
-LF:24
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseISt23_Rb_tree_const_iteratorIiELb0EE3__bES1_
-FN:268,_ZNSt12__niter_baseISt23_Rb_tree_const_iteratorIiELb0EE3__bES1_
-FN:268,_ZNSt12__niter_baseISt15insert_iteratorISt3setIiSt4lessIiESaIiEEELb0EE3__bES6_
-FN:309,_ZNSt11__copy_moveILb0ELb0ESt26bidirectional_iterator_tagE8__copy_mISt23_Rb_tree_const_iteratorIiESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEEET0_T_SD_SC_
-FN:385,_ZSt13__copy_move_aILb0ESt23_Rb_tree_const_iteratorIiESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEET1_T0_SA_S9_
-FN:430,_ZSt14__copy_move_a2ILb0ESt23_Rb_tree_const_iteratorIiESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEET1_T0_SA_S9_
-FN:456,_ZSt4copyISt23_Rb_tree_const_iteratorIiESt15insert_iteratorISt3setIiSt4lessIiESaIiEEEET0_T_SA_S9_
-DA:268,0
-DA:269,0
-DA:286,0
-DA:287,0
-DA:309,0
-DA:311,0
-DA:312,0
-DA:313,0
-DA:385,0
-DA:393,0
-DA:396,0
-DA:430,0
-DA:435,0
-DA:456,0
-DA:466,0
-BA:311,0
-BA:311,0
-LF:15
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_function.h
-FN:469,_ZNKSt9_IdentityIN3ept7debtags3TagEEclERKS2_
-FN:229,_ZNKSt4lessIN3ept7debtags3TagEEclERKS2_S5_
-FN:469,_ZNKSt9_IdentityIiEclERKi
-FN:229,_ZNKSt4lessIiEclERKiS2_
-FN:482,_ZNKSt10_Select1stISt4pairIKiN7tagcoll5PatchIiiEEEEclERKS5_
-DA:229,0
-DA:230,0
-DA:469,0
-DA:470,0
-DA:482,0
-DA:483,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:572,_ZNSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEC1ERS4_St23_Rb_tree_const_iteratorIiE
-FN:645,_ZSt8inserterISt3setIiSt4lessIiESaIiEESt23_Rb_tree_const_iteratorIiEESt15insert_iteratorIT_ERS8_T0_
-FN:618,_ZNSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEdeEv
-FN:623,_ZNSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEppEv
-FN:599,_ZNSt15insert_iteratorISt3setIiSt4lessIiESaIiEEEaSERKi
-DA:572,0
-DA:573,0
-DA:599,0
-DA:601,0
-DA:602,0
-DA:603,0
-DA:618,0
-DA:619,0
-DA:623,0
-DA:624,0
-DA:645,0
-DA:648,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-DA:111,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_map.h
-FN:302,_ZNKSt3mapIiN7tagcoll5PatchIiiEESt4lessIiESaISt4pairIKiS2_EEE3endEv
-FN:629,_ZNKSt3mapIiN7tagcoll5PatchIiiEESt4lessIiESaISt4pairIKiS2_EEE4findERS6_
-DA:302,0
-DA:303,0
-DA:629,0
-DA:630,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_pair.h
-FN:88,_ZNSt4pairISt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEbEC1ERKS4_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIN3ept7debtags3TagEEbEC1ERKS4_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIiEbEC1ERKS1_RKb
-DA:88,0
-DA:89,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_set.h
-FN:261,_ZNKSt3setISsSt4lessISsESaISsEE5beginEv
-FN:270,_ZNKSt3setISsSt4lessISsESaISsEE3endEv
-FN:261,_ZNKSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EE5beginEv
-FN:270,_ZNKSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EE3endEv
-FN:270,_ZNKSt3setIiSt4lessIiESaIiEE3endEv
-FN:261,_ZNKSt3setIiSt4lessIiESaIiEE5beginEv
-FN:141,_ZNSt3setISsSt4lessISsESaISsEEC1Ev
-FN:141,_ZNSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EEC1Ev
-FN:141,_ZNSt3setIiSt4lessIiESaIiEEC1Ev
-FN:93,_ZNSt3setIiSt4lessIiESaIiEED1Ev
-FN:93,_ZNSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EED1Ev
-FN:193,_ZNSt3setIiSt4lessIiESaIiEEC1ERKS3_
-FN:378,_ZNSt3setIN3ept7debtags3TagESt4lessIS2_ESaIS2_EE6insertERKS2_
-FN:405,_ZNSt3setIiSt4lessIiESaIiEE6insertESt23_Rb_tree_const_iteratorIiERKi
-FN:93,_ZNSt3setISsSt4lessISsESaISsEED1Ev
-DA:93,0
-DA:141,0
-DA:142,0
-DA:193,0
-DA:194,0
-DA:261,0
-DA:262,0
-DA:270,0
-DA:271,0
-DA:378,0
-DA:381,0
-DA:382,0
-DA:405,0
-DA:406,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_tree.h
-FN:103,_ZNSt18_Rb_tree_node_base10_S_minimumEPS_
-FN:117,_ZNSt18_Rb_tree_node_base10_S_maximumEPS_
-FN:289,_ZNKSt23_Rb_tree_const_iteratorISsEneERKS0_
-FN:289,_ZNKSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEneERKS3_
-FN:251,_ZNKSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEptEv
-FN:247,_ZNKSt23_Rb_tree_const_iteratorISsEdeEv
-FN:452,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_beginEv
-FN:452,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_M_beginEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEC1ERKSt17_Rb_tree_iteratorIS2_E
-FN:452,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_M_beginEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorIiEC1ERKSt17_Rb_tree_iteratorIiE
-FN:289,_ZNKSt23_Rb_tree_const_iteratorIiEneERKS0_
-FN:247,_ZNKSt23_Rb_tree_const_iteratorIiEdeEv
-FN:285,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKiN7tagcoll5PatchIiiEEEEeqERKS6_
-FN:251,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKiN7tagcoll5PatchIiiEEEEptEv
-FN:398,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_S_leftEPSt18_Rb_tree_node_base
-FN:240,_ZNSt23_Rb_tree_const_iteratorISsEC1EPKSt13_Rb_tree_nodeISsE
-FN:603,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5beginEv
-FN:614,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE3endEv
-FN:347,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE21_M_get_Node_allocatorEv
-FN:398,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13_Rb_tree_implIS6_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:463,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE6_M_endEv
-FN:168,_ZNSt17_Rb_tree_iteratorIN3ept7debtags3TagEEC1EPSt13_Rb_tree_nodeIS2_E
-FN:596,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE5beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorIN3ept7debtags3TagEEeqERKS3_
-FN:347,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE21_M_get_Node_allocatorEv
-FN:398,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_Rb_tree_implIS3_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE7_S_leftEPSt18_Rb_tree_node_base
-FN:347,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE21_M_get_Node_allocatorEv
-FN:432,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE7_M_rootEv
-FN:456,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_M_beginEv
-FN:463,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE6_M_endEv
-FN:428,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE7_M_rootEv
-FN:503,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE10_S_minimumEPSt18_Rb_tree_node_base
-FN:436,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE11_M_leftmostEv
-FN:511,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE10_S_maximumEPSt18_Rb_tree_node_base
-FN:444,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE12_M_rightmostEv
-FN:168,_ZNSt17_Rb_tree_iteratorIiEC1EPSt13_Rb_tree_nodeIiE
-FN:596,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorIiEeqERKS0_
-FN:641,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE4sizeEv
-FN:240,_ZNSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEC1EPKSt13_Rb_tree_nodeIS2_E
-FN:603,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE5beginEv
-FN:614,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE3endEv
-FN:415,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EE13_M_initializeEv
-FN:415,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13_Rb_tree_implIS6_Lb0EE13_M_initializeEv
-FN:471,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_S_valueEPKSt13_Rb_tree_nodeIS2_E
-FN:475,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE6_S_keyEPKSt13_Rb_tree_nodeIS2_E
-FN:495,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE6_S_keyEPKSt18_Rb_tree_node_base
-FN:415,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_Rb_tree_implIS3_Lb0EE13_M_initializeEv
-FN:491,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_S_rightEPKSt18_Rb_tree_node_base
-FN:483,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE7_S_leftEPKSt18_Rb_tree_node_base
-FN:471,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_S_valueEPKSt13_Rb_tree_nodeIiE
-FN:475,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE6_S_keyEPKSt13_Rb_tree_nodeIiE
-FN:495,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE6_S_keyEPKSt18_Rb_tree_node_base
-FN:240,_ZNSt23_Rb_tree_const_iteratorIiEC1EPKSt13_Rb_tree_nodeIiE
-FN:614,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE3endEv
-FN:603,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE5beginEv
-FN:240,_ZNSt23_Rb_tree_const_iteratorISt4pairIKiN7tagcoll5PatchIiiEEEEC1EPKSt13_Rb_tree_nodeIS5_E
-FN:614,_ZNKSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE3endEv
-FN:456,_ZNKSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE8_M_beginEv
-FN:467,_ZNKSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE6_M_endEv
-FN:403,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEEC1Ev
-FN:403,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13_Rb_tree_implIS6_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EEC1Ev
-FN:403,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_Rb_tree_implIS3_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEEC1Ev
-FN:408,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_Rb_tree_implIS3_Lb0EEC1ERKS3_RKSaISt13_Rb_tree_nodeIiEE
-FN:483,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE7_S_leftEPKSt18_Rb_tree_node_base
-FN:491,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE8_S_rightEPKSt18_Rb_tree_node_base
-FN:495,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE6_S_keyEPKSt18_Rb_tree_node_base
-FN:471,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE8_S_valueEPKSt13_Rb_tree_nodeIS5_E
-FN:475,_ZNSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE6_S_keyEPKSt13_Rb_tree_nodeIS5_E
-FN:970,_ZNKSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE14_M_lower_boundEPKSt13_Rb_tree_nodeIS5_ESF_RS1_
-FN:1403,_ZNKSt8_Rb_treeIiSt4pairIKiN7tagcoll5PatchIiiEEESt10_Select1stIS5_ESt4lessIiESaIS5_EE4findERS1_
-FN:351,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13get_allocatorEv
-FN:351,_ZNKSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE13get_allocatorEv
-FN:351,_ZNKSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13get_allocatorEv
-FN:360,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE11_M_put_nodeEPSt13_Rb_tree_nodeIiE
-FN:388,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE15_M_destroy_nodeEPSt13_Rb_tree_nodeIiE
-FN:936,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE8_M_eraseEPSt13_Rb_tree_nodeIiE
-FN:360,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS2_E
-FN:388,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS2_E
-FN:936,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE8_M_eraseEPSt13_Rb_tree_nodeIS2_E
-FN:360,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11_M_put_nodeEPSt13_Rb_tree_nodeISsE
-FN:584,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEED1Ev
-FN:584,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EED1Ev
-FN:356,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE14_M_create_nodeERKi
-FN:378,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE13_M_clone_nodeEPKSt13_Rb_tree_nodeIiE
-FN:900,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE7_M_copyEPKSt13_Rb_tree_nodeIiEPS7_
-FN:568,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEEC1ERKS5_
-FN:356,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE11_M_get_nodeEv
-FN:364,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE14_M_create_nodeERKS2_
-FN:270,_ZNSt23_Rb_tree_const_iteratorIiEmmEv
-FN:846,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE10_M_insert_EPKSt18_Rb_tree_node_baseS8_RKi
-FN:846,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE10_M_insert_EPKSt18_Rb_tree_node_baseSB_RKS2_
-FN:195,_ZNSt17_Rb_tree_iteratorIiEmmEv
-FN:1133,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE16_M_insert_uniqueERKi
-FN:195,_ZNSt17_Rb_tree_iteratorIN3ept7debtags3TagEEmmEv
-FN:1133,_ZNSt8_Rb_treeIN3ept7debtags3TagES2_St9_IdentityIS2_ESt4lessIS2_ESaIS2_EE16_M_insert_uniqueERKS2_
-FN:255,_ZNSt23_Rb_tree_const_iteratorIiEppEv
-FN:1178,_ZNSt8_Rb_treeIiiSt9_IdentityIiESt4lessIiESaIiEE17_M_insert_unique_ESt23_Rb_tree_const_iteratorIiERKi
-FN:255,_ZNSt23_Rb_tree_const_iteratorIN3ept7debtags3TagEEppEv
-FN:255,_ZNSt23_Rb_tree_const_iteratorISsEppEv
-FN:388,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE15_M_destroy_nodeEPSt13_Rb_tree_nodeISsE
-FN:936,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_eraseEPSt13_Rb_tree_nodeISsE
-FN:584,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEED1Ev
-DA:103,0
-DA:105,0
-DA:106,0
-DA:117,0
-DA:119,0
-DA:120,0
-DA:168,0
-DA:169,0
-DA:195,0
-DA:197,0
-DA:198,0
-DA:210,0
-DA:211,0
-DA:240,0
-DA:241,0
-DA:243,0
-DA:244,0
-DA:247,0
-DA:248,0
-DA:251,0
-DA:252,0
-DA:255,0
-DA:257,0
-DA:258,0
-DA:270,0
-DA:272,0
-DA:273,0
-DA:285,0
-DA:286,0
-DA:289,0
-DA:290,0
-DA:347,0
-DA:348,0
-DA:351,0
-DA:352,0
-DA:356,0
-DA:357,0
-DA:360,0
-DA:361,0
-DA:364,0
-DA:366,0
-DA:368,0
-DA:369,0
-DA:371,0
-DA:372,0
-DA:374,0
-DA:378,0
-DA:380,0
-DA:381,0
-DA:382,0
-DA:383,0
-DA:384,0
-DA:388,0
-DA:390,0
-DA:391,0
-DA:392,0
-DA:398,0
-DA:403,0
-DA:405,0
-DA:406,0
-DA:408,0
-DA:410,0
-DA:411,0
-DA:415,0
-DA:417,0
-DA:418,0
-DA:419,0
-DA:420,0
-DA:421,0
-DA:428,0
-DA:429,0
-DA:432,0
-DA:433,0
-DA:436,0
-DA:437,0
-DA:444,0
-DA:445,0
-DA:452,0
-DA:453,0
-DA:456,0
-DA:459,0
-DA:463,0
-DA:464,0
-DA:467,0
-DA:468,0
-DA:471,0
-DA:472,0
-DA:475,0
-DA:476,0
-DA:479,0
-DA:480,0
-DA:483,0
-DA:484,0
-DA:487,0
-DA:488,0
-DA:491,0
-DA:492,0
-DA:495,0
-DA:496,0
-DA:499,0
-DA:500,0
-DA:503,0
-DA:504,0
-DA:511,0
-DA:512,0
-DA:562,0
-DA:568,0
-DA:569,0
-DA:571,0
-DA:573,0
-DA:574,0
-DA:575,0
-DA:576,0
-DA:578,0
-DA:584,0
-DA:585,0
-DA:596,0
-DA:599,0
-DA:603,0
-DA:606,0
-DA:614,0
-DA:617,0
-DA:641,0
-DA:642,0
-DA:846,0
-DA:850,0
-DA:852,0
-DA:854,0
-DA:857,0
-DA:858,0
-DA:900,0
-DA:903,0
-DA:904,0
-DA:908,0
-DA:909,0
-DA:910,0
-DA:911,0
-DA:913,0
-DA:915,0
-DA:916,0
-DA:917,0
-DA:918,0
-DA:919,0
-DA:920,0
-DA:921,0
-DA:924,0
-DA:926,0
-DA:927,0
-DA:929,0
-DA:936,0
-DA:939,0
-DA:941,0
-DA:942,0
-DA:943,0
-DA:944,0
-DA:946,0
-DA:970,0
-DA:972,0
-DA:973,0
-DA:974,0
-DA:976,0
-DA:977,0
-DA:1133,0
-DA:1135,0
-DA:1136,0
-DA:1137,0
-DA:1138,0
-DA:1140,0
-DA:1141,0
-DA:1142,0
-DA:1144,0
-DA:1145,0
-DA:1147,0
-DA:1148,0
-DA:1150,0
-DA:1152,0
-DA:1153,0
-DA:1154,0
-DA:1178,0
-DA:1181,0
-DA:1183,0
-DA:1186,0
-DA:1188,0
-DA:1190,0
-DA:1194,0
-DA:1195,0
-DA:1196,0
-DA:1197,0
-DA:1200,0
-DA:1201,0
-DA:1204,0
-DA:1207,0
-DA:1209,0
-DA:1213,0
-DA:1214,0
-DA:1215,0
-DA:1216,0
-DA:1219,0
-DA:1220,0
-DA:1222,0
-DA:1225,0
-DA:1230,0
-DA:1403,0
-DA:1405,0
-DA:1408,0
-BA:105,0
-BA:105,0
-BA:119,0
-BA:119,0
-BA:571,0
-BA:571,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:908,0
-BA:908,0
-BA:913,0
-BA:913,0
-BA:918,0
-BA:918,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:939,0
-BA:972,0
-BA:972,0
-BA:973,0
-BA:973,0
-BA:1138,0
-BA:1138,0
-BA:1138,0
-BA:1138,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1142,0
-BA:1145,0
-BA:1145,0
-BA:1145,0
-BA:1145,0
-BA:1147,0
-BA:1147,0
-BA:1147,0
-BA:1147,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1152,0
-BA:1181,0
-BA:1181,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1183,0
-BA:1190,0
-BA:1190,0
-BA:1195,0
-BA:1195,0
-BA:1197,0
-BA:1197,0
-BA:1200,0
-BA:1200,0
-BA:1209,0
-BA:1209,0
-BA:1214,0
-BA:1214,0
-BA:1216,0
-BA:1216,0
-BA:1219,0
-BA:1219,0
-BA:1408,0
-BA:1408,0
-BA:1408,0
-BA:1408,0
-LF:205
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:118,_ZN9__gnu_cxx13new_allocatorIN3ept7debtags3TagEE7destroyEPS3_
-FN:118,_ZN9__gnu_cxx13new_allocatorIiE7destroyEPi
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIN3ept7debtags3TagEED2Ev
-FN:107,_ZN9__gnu_cxx13new_allocatorIN3ept7debtags3TagEE9constructEPS3_RKS3_
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIiED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEEC2ERKS3_
-FN:107,_ZN9__gnu_cxx13new_allocatorIiE9constructEPiRKi
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorIN3ept7debtags3TagEEC2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorIiEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEE8max_sizeEv
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEE8max_sizeEv
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEE10deallocateEPS2_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEE10deallocateEPS5_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE10deallocateEPS2_j
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIiEE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeIN3ept7debtags3TagEEE8allocateEjPKv
-FN:118,_ZN9__gnu_cxx13new_allocatorISsE7destroyEPSs
-DA:69,0
-DA:71,0
-DA:76,0
-DA:87,0
-DA:89,0
-DA:90,0
-DA:92,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:107,0
-DA:108,0
-DA:118,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:108,0
-BA:108,0
-BA:108,0
-BA:108,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,2
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-DA:105,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/coll/patched.h
-FN:205,_ZNK7tagcoll4coll7PatchedINS0_12IntDiskIndexEE13getTagsOfItemERKi
-DA:205,0
-DA:207,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/patch.h
-FN:83,_ZNK7tagcoll5PatchIiiE5applyERKSt3setIiSt4lessIiESaIiEE
-FN:172,_ZNK7tagcoll9PatchListIiiE5patchERKiRKSt3setIiSt4lessIiESaIiEE
-DA:83,0
-DA:86,0
-DA:172,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/patch.tcc
-FN:160,_Z41__static_initialization_and_destruction_0ii
-FN:160,_GLOBAL__I_extraindexers.cc
-DA:129,0
-DA:130,0
-DA:132,0
-DA:135,0
-DA:160,6
-BA:130,0
-BA:130,0
-BA:160,2
-BA:160,1
-BA:160,2
-BA:160,1
-LF:5
-LH:1
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/textsearch/maint/path.cc
-FN:91,_Z41__static_initialization_and_destruction_0ii
-FN:91,_GLOBAL__I_path.cc
-FN:53,_ZN3ept10textsearch4Path6accessERKSsi
-FN:45,_ZN3ept10textsearch4Path8instanceEv
-FN:86,_ZN3ept10textsearch4Path5indexEv
-FN:85,_ZN3ept10textsearch4Path8indexDirEv
-FN:80,_ZN3ept10textsearch4Path11setIndexDirERKSs
-FN:68,_ZN3ept10textsearch4Path12setTimestampEl
-FN:58,_ZN3ept10textsearch4Path14indexTimestampEv
-DA:45,111
-DA:46,111
-DA:47,1
-DA:48,1
-DA:50,111
-DA:53,0
-DA:55,0
-DA:58,20
-DA:60,20
-DA:61,40
-DA:62,20
-DA:63,18
-DA:65,2
-DA:68,6
-DA:70,6
-DA:71,12
-DA:72,6
-DA:73,0
-DA:74,6
-DA:75,0
-DA:76,6
-DA:77,0
-DA:78,6
-DA:80,22
-DA:82,22
-DA:83,22
-DA:85,37
-DA:86,25
-DA:91,6
-BA:46,2
-BA:46,2
-BA:62,2
-BA:62,2
-BA:72,1
-BA:72,2
-BA:74,1
-BA:74,2
-BA:76,1
-BA:76,2
-BA:91,2
-BA:91,1
-BA:91,2
-BA:91,1
-LF:29
-LH:24
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/textsearch/maint/path.h
-FN:38,_ZN3ept10textsearch4PathC1Ev
-DA:38,1
-LF:1
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/exception.h
-FN:190,_ZNK6wibble9exception7Generic4typeEv
-FN:406,_ZNK6wibble9exception6System4codeEv
-FN:428,_ZNK6wibble9exception4File4typeEv
-FN:213,_ZNK6wibble9exception7Generic4whatEv
-FN:193,_ZNK6wibble9exception7Generic4descEv
-FN:137,_ZN6wibble9exception7ContextD2Ev
-FN:154,_ZNK6wibble9exception7Context13formatContextEv
-FN:205,_ZNK6wibble9exception7Generic8fullInfoEv
-FN:430,_ZNK6wibble9exception4File4descEv
-FN:187,_ZN6wibble9exception7GenericD2Ev
-FN:395,_ZN6wibble9exception6SystemD2Ev
-FN:424,_ZN6wibble9exception4FileC1ERKSsS3_
-FN:426,_ZN6wibble9exception4FileD0Ev
-FN:426,_ZN6wibble9exception4FileD1Ev
-FN:187,_ZN6wibble9exception7GenericD0Ev
-FN:187,_ZN6wibble9exception7GenericD1Ev
-DA:137,0
-DA:154,0
-DA:155,0
-DA:156,0
-DA:157,0
-DA:159,0
-DA:161,0
-DA:162,0
-DA:163,0
-DA:187,0
-DA:190,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:205,0
-DA:206,0
-DA:207,0
-DA:209,0
-DA:210,0
-DA:213,0
-DA:395,0
-DA:406,0
-DA:424,0
-DA:425,0
-DA:426,0
-DA:428,0
-DA:430,0
-BA:156,0
-BA:156,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:207,0
-BA:207,0
-BA:395,0
-BA:395,0
-BA:426,0
-BA:426,0
-BA:426,0
-BA:426,0
-LF:27
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/string.h
-FN:236,_ZN6wibble3str8joinpathERKSsS2_
-DA:236,0
-DA:238,0
-DA:239,0
-DA:240,0
-DA:241,0
-DA:243,0
-DA:244,0
-DA:245,0
-DA:247,0
-DA:249,0
-DA:250,0
-DA:252,0
-BA:238,0
-BA:238,0
-BA:240,0
-BA:240,0
-BA:243,0
-BA:243,0
-BA:244,0
-BA:244,0
-BA:249,0
-BA:249,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/backward/auto_ptr.h
-FN:263,_ZNSt8auto_ptrI4statEC1ESt12auto_ptr_refIS0_E
-FN:214,_ZNKSt8auto_ptrI4statE3getEv
-FN:197,_ZNKSt8auto_ptrI4statEptEv
-FN:228,_ZNSt8auto_ptrI4statE7releaseEv
-FN:56,_ZNSt12auto_ptr_refI4statEC1EPS0_
-FN:278,_ZNSt8auto_ptrI4statEcvSt12auto_ptr_refIT_EIS0_EEv
-FN:173,_ZNSt8auto_ptrI4statED1Ev
-DA:56,0
-DA:173,0
-DA:197,0
-DA:200,0
-DA:214,0
-DA:228,0
-DA:230,0
-DA:231,0
-DA:232,0
-DA:263,0
-DA:264,0
-DA:278,0
-DA:279,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaIcED1Ev
-FN:100,_ZNSaIcEC1ERKS_
-FN:100,_ZNSaIcEC2ERKS_
-FN:106,_ZNSaISsED2Ev
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:276,0
-BA:276,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:612,_ZNKSs6lengthEv
-FN:701,_ZNKSsixEj
-FN:1534,_ZNKSs5c_strEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:1551,_ZNKSs13get_allocatorEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:306,_ZNKSs8_M_checkEjPKc
-FN:1923,_ZNKSs6substrEjj
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2136,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S3_
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-FN:501,_ZNSsaSERKSs
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:835,_ZNSs6appendEPKc
-FN:2121,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_
-FN:928,_ZNSs6assignEPKc
-FN:509,_ZNSsaSEPKc
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:306,0
-DA:308,0
-DA:309,0
-DA:310,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:509,0
-DA:510,0
-DA:606,0
-DA:607,0
-DA:612,0
-DA:613,0
-DA:686,0
-DA:687,0
-DA:701,0
-DA:704,0
-DA:835,0
-DA:838,0
-DA:928,0
-DA:931,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:1923,0
-DA:1925,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2121,0
-DA:2123,0
-DA:2124,0
-DA:2125,0
-DA:2136,0
-DA:2140,0
-DA:2141,0
-DA:2142,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:308,0
-BA:308,0
-BA:341,0
-BA:341,0
-LF:83
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb0EE3__bES7_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb1EE3__bES7_
-FN:268,_ZNSt12__niter_baseISt16ostream_iteratorISscSt11char_traitsIcEELb0EE3__bES3_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPKSsSt16ostream_iteratorISscSt11char_traitsIcEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPKSsSt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_SD_SC_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET0_T_SD_SC_
-DA:268,0
-DA:269,0
-DA:276,0
-DA:277,0
-DA:286,0
-DA:287,0
-DA:337,0
-DA:340,0
-DA:342,0
-DA:343,0
-DA:344,0
-DA:346,0
-DA:385,0
-DA:393,0
-DA:396,0
-DA:430,0
-DA:435,0
-DA:456,0
-DA:466,0
-BA:340,0
-BA:340,0
-LF:19
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-DA:87,0
-DA:88,0
-DA:97,0
-DA:101,0
-DA:103,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-BA:101,0
-BA:101,0
-LF:9
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEC1ERKS2_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-DA:683,0
-DA:747,0
-DA:748,0
-DA:769,0
-DA:770,0
-LF:5
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,0
-DA:166,0
-DA:167,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:404,_ZNKSt6vectorISsSaISsEE3endEv
-FN:386,_ZNKSt6vectorISsSaISsEE5beginEv
-FN:526,_ZNKSt6vectorISsSaISsEE5emptyEv
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-DA:79,0
-DA:97,0
-DA:98,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:299,0
-DA:300,0
-DA:301,0
-DA:386,0
-DA:387,0
-DA:404,0
-DA:405,0
-DA:526,0
-DA:527,0
-BA:149,0
-BA:149,0
-LF:19
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stream_iterator.h
-FN:181,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERSoPKc
-FN:185,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERKS2_
-FN:202,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEdeEv
-FN:206,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEppEv
-FN:191,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEaSERKSs
-DA:181,0
-DA:182,0
-DA:185,0
-DA:186,0
-DA:191,0
-DA:196,0
-DA:197,0
-DA:198,0
-DA:202,0
-DA:203,0
-DA:206,0
-DA:207,0
-BA:197,0
-BA:197,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-DA:69,0
-DA:71,0
-DA:76,0
-DA:97,0
-DA:98,0
-LF:5
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,2
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/istream
-FN:585,_ZNSiC2Ev
-FN:105,_ZNSiD2Ev
-FN:804,_ZNSdC2Ev
-FN:801,_ZNSdD2Ev
-DA:105,0
-DA:106,0
-DA:585,0
-DA:586,0
-DA:587,0
-DA:801,0
-DA:804,0
-DA:805,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-DA:95,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:509,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:536,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:555,_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:509,0
-DA:510,0
-DA:511,0
-DA:536,0
-DA:537,0
-DA:555,0
-DA:556,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/progresscallback.cpp
-FN:5,_ZN3ept16ProgressCallback5PulseEP10pkgAcquire
-DA:5,0
-DA:7,0
-DA:8,0
-DA:9,0
-LF:4
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/progresscallback.h
-FN:20,_ZN3ept16ProgressCallback11MediaChangeESsSs
-FN:23,_ZN3ept16ProgressCallback11UpdatePulseEddm
-FN:19,_ZN3ept16ProgressCallbackD0Ev
-FN:19,_ZN3ept16ProgressCallbackD1Ev
-DA:19,0
-DA:20,0
-DA:23,0
-BA:19,0
-BA:19,0
-BA:19,0
-BA:19,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/apt-pkg/acquire.h
-FN:730,_ZN16pkgAcquireStatus6IMSHitERN10pkgAcquire8ItemDescE
-FN:733,_ZN16pkgAcquireStatus5FetchERN10pkgAcquire8ItemDescE
-FN:736,_ZN16pkgAcquireStatus4DoneERN10pkgAcquire8ItemDescE
-FN:741,_ZN16pkgAcquireStatus4FailERN10pkgAcquire8ItemDescE
-FN:763,_ZN16pkgAcquireStatusD2Ev
-DA:730,0
-DA:733,0
-DA:736,0
-DA:741,0
-DA:763,0
-BA:763,0
-BA:763,0
-LF:5
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/popcon/popcon.cc
-FN:37,_ZNK3ept6popcon6Popcon11GeneralInfo11submissionsEv
-FN:69,_ZNK3ept6popcon6Popcon11scoreByNameERKSs
-FN:43,_ZN3ept6popcon6PopconC1Ev
-FN:43,_ZN3ept6popcon6PopconC2Ev
-DA:37,3
-DA:39,3
-DA:40,2
-DA:43,7
-DA:45,7
-DA:47,7
-DA:49,1
-DA:50,1
-DA:55,6
-DA:57,6
-DA:58,6
-DA:60,6
-DA:67,0
-DA:69,1792
-DA:75,1792
-DA:76,32470
-DA:78,28886
-DA:79,28886
-DA:80,14367
-DA:82,14519
-DA:85,1792
-DA:87,31
-DA:89,1761
-BA:39,2
-BA:39,2
-BA:47,2
-BA:47,2
-BA:47,0
-BA:47,0
-BA:60,2
-BA:60,2
-BA:60,2
-BA:60,2
-BA:60,0
-BA:60,0
-BA:60,0
-BA:60,0
-BA:76,2
-BA:76,2
-BA:79,2
-BA:79,2
-BA:85,2
-BA:85,2
-BA:85,2
-BA:85,2
-BA:85,2
-BA:85,2
-BA:85,0
-BA:85,0
-BA:85,2
-BA:85,2
-LF:23
-LH:22
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/popcon/popcon.h
-FN:105,_ZNK3ept6popcon6Popcon4sizeEv
-FN:85,_ZNK3ept6popcon6Popcon13structByIndexEj
-FN:126,_ZNK3ept6popcon6Popcon12scoreByIndexEj
-FN:137,_ZNK3ept6popcon6Popcon5scoreEj
-FN:118,_ZNK3ept6popcon6Popcon4nameEj
-FN:75,_ZN3ept6popcon6Popcon11GeneralInfoC1Ev
-DA:75,7
-DA:85,0
-DA:87,0
-DA:88,0
-DA:89,0
-DA:105,0
-DA:107,0
-DA:108,0
-DA:110,0
-DA:118,0
-DA:120,0
-DA:121,0
-DA:122,0
-DA:126,0
-DA:128,0
-DA:129,0
-DA:130,0
-DA:137,0
-BA:87,0
-BA:87,0
-BA:107,0
-BA:107,0
-BA:121,0
-BA:121,0
-BA:129,0
-BA:129,0
-LF:18
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:277,_ZNKSs7_M_dataEv
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:1544,_ZNKSs4dataEv
-FN:392,_ZNSs10_S_compareEjj
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:1941,_ZNKSs7compareERKSs
-FN:2275,_ZStgtIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:2162,_ZSteqIcEN9__gnu_cxx11__enable_ifIXsrSt9__is_charIT_E7__valueEbE6__typeERKSbIS3_St11char_traitsIS3_ESaIS3_EESC_
-FN:2201,_ZStneIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-DA:178,0
-DA:183,0
-DA:184,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:392,0
-DA:394,0
-DA:401,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:606,0
-DA:607,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:1941,0
-DA:1943,0
-DA:1944,0
-DA:1945,0
-DA:1947,0
-DA:1948,0
-DA:1949,0
-DA:1950,0
-DA:2067,0
-DA:2069,0
-DA:2162,0
-DA:2165,0
-DA:2201,0
-DA:2202,0
-DA:2275,0
-DA:2276,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:1948,0
-BA:1948,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-LF:46
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-DA:257,0
-DA:258,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:188,_ZSt3minIjERKT_S2_S2_
-DA:188,0
-DA:193,0
-DA:194,0
-DA:195,0
-BA:193,0
-BA:193,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-DA:69,0
-DA:71,0
-DA:76,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/popcon/local.cc
-FN:166,_Z41__static_initialization_and_destruction_0ii
-FN:166,_GLOBAL__I_local.cc
-FN:66,_ZNK3ept6popcon10secondsortclERKSt4pairISsfES5_
-FN:146,_ZNK3ept6popcon5Local5tfidfERKNS0_6PopconE
-FN:136,_ZNK3ept6popcon5Local6scoresEv
-FN:112,_ZNK3ept6popcon5Local5scoreERKSs
-FN:125,_ZNK3ept6popcon5Local5tfidfERKNS0_6PopconERKSs
-FN:42,_ZN3ept6popconL5splitERKSsc
-FN:75,_ZN3ept6popcon5LocalC1ERKSs
-FN:75,_ZN3ept6popcon5LocalC2ERKSs
-DA:42,1903
-DA:44,1903
-DA:45,1903
-DA:46,10435
-DA:48,8531
-DA:49,8531
-DA:51,1902
-DA:52,1902
-DA:56,6629
-DA:57,6629
-DA:60,0
-DA:66,0
-DA:68,0
-DA:69,0
-DA:71,0
-DA:75,1
-DA:77,1
-DA:78,1
-DA:79,0
-DA:81,1
-DA:82,1
-DA:83,1
-DA:84,0
-DA:86,1907
-DA:88,1905
-DA:89,1905
-DA:90,1905
-DA:91,3
-DA:92,1904
-DA:94,1903
-DA:95,1903
-DA:97,1902
-DA:99,979
-DA:100,923
-DA:102,0
-DA:103,923
-DA:105,745
-DA:106,178
-DA:108,178
-DA:109,1
-DA:110,0
-DA:112,2
-DA:114,2
-DA:115,2
-DA:116,0
-DA:118,2
-DA:125,1
-DA:127,1
-DA:129,1
-DA:130,0
-DA:132,1
-DA:136,0
-DA:138,0
-DA:140,0
-DA:142,0
-DA:143,0
-DA:146,0
-DA:148,0
-DA:150,0
-DA:153,0
-DA:154,0
-DA:155,0
-DA:158,0
-DA:161,0
-DA:162,0
-DA:166,6
-BA:46,2
-BA:46,2
-BA:49,2
-BA:49,2
-BA:68,0
-BA:68,0
-BA:78,2
-BA:78,1
-BA:78,0
-BA:78,0
-BA:83,1
-BA:83,2
-BA:83,0
-BA:83,0
-BA:86,2
-BA:86,2
-BA:86,2
-BA:86,2
-BA:86,2
-BA:86,2
-BA:86,0
-BA:86,0
-BA:86,0
-BA:86,0
-BA:86,0
-BA:86,0
-BA:90,2
-BA:90,2
-BA:90,0
-BA:90,0
-BA:92,2
-BA:92,2
-BA:92,0
-BA:92,0
-BA:95,2
-BA:95,2
-BA:95,0
-BA:95,0
-BA:97,2
-BA:97,2
-BA:97,0
-BA:97,0
-BA:100,1
-BA:100,2
-BA:100,0
-BA:100,0
-BA:103,2
-BA:103,2
-BA:103,0
-BA:103,0
-BA:106,2
-BA:106,1
-BA:106,0
-BA:106,0
-BA:115,1
-BA:115,2
-BA:129,1
-BA:129,2
-BA:150,0
-BA:150,0
-BA:154,0
-BA:154,0
-BA:166,2
-BA:166,1
-BA:166,2
-BA:166,1
-LF:66
-LH:41
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/popcon/popcon.h
-FN:143,_ZNK3ept6popcon6Popcon5scoreERKSs
-FN:102,_ZNK3ept6popcon6Popcon11submissionsEv
-DA:102,0
-DA:143,0
-LF:2
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/exception.h
-FN:190,_ZNK6wibble9exception7Generic4typeEv
-FN:406,_ZNK6wibble9exception6System4codeEv
-FN:428,_ZNK6wibble9exception4File4typeEv
-FN:137,_ZN6wibble9exception7ContextD2Ev
-FN:213,_ZNK6wibble9exception7Generic4whatEv
-FN:193,_ZNK6wibble9exception7Generic4descEv
-FN:154,_ZNK6wibble9exception7Context13formatContextEv
-FN:205,_ZNK6wibble9exception7Generic8fullInfoEv
-FN:430,_ZNK6wibble9exception4File4descEv
-FN:187,_ZN6wibble9exception7GenericD2Ev
-FN:395,_ZN6wibble9exception6SystemD2Ev
-FN:424,_ZN6wibble9exception4FileC1ERKSsS3_
-FN:426,_ZN6wibble9exception4FileD0Ev
-FN:426,_ZN6wibble9exception4FileD1Ev
-FN:187,_ZN6wibble9exception7GenericD0Ev
-FN:187,_ZN6wibble9exception7GenericD1Ev
-DA:137,0
-DA:154,0
-DA:155,0
-DA:156,0
-DA:157,0
-DA:159,0
-DA:161,0
-DA:162,0
-DA:163,0
-DA:187,0
-DA:190,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:205,0
-DA:206,0
-DA:207,0
-DA:209,0
-DA:210,0
-DA:213,0
-DA:395,0
-DA:406,0
-DA:424,0
-DA:425,0
-DA:426,0
-DA:428,0
-DA:430,0
-BA:156,0
-BA:156,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:207,0
-BA:207,0
-BA:395,0
-BA:395,0
-BA:426,0
-BA:426,0
-BA:426,0
-BA:426,0
-LF:27
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsfEEED2Ev
-FN:100,_ZNSaIcEC1ERKS_
-FN:100,_ZNSaIcEC2ERKS_
-FN:106,_ZNSaISsED2Ev
-FN:106,_ZNSaISt4pairISsfEED2Ev
-FN:98,_ZNSaISsEC2Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsfEEEC2Ev
-FN:106,_ZNSaISt4pairIKSsfEED1Ev
-FN:98,_ZNSaISt4pairISsfEEC2Ev
-FN:104,_ZNSaISt4pairIKSsfEEC1ISt13_Rb_tree_nodeIS1_EEERKSaIT_E
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,1
-DA:100,0
-DA:101,0
-DA:104,0
-DA:106,0
-DA:118,0
-DA:119,0
-LF:7
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:174,_ZNKSt9basic_iosIcSt11char_traitsIcEE4goodEv
-FN:184,_ZNKSt9basic_iosIcSt11char_traitsIcEE3eofEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-FN:51,_ZSt13__check_facetISt5ctypeIcEERKT_PS3_
-FN:443,_ZNKSt9basic_iosIcSt11char_traitsIcEE5widenEc
-DA:51,0
-DA:53,0
-DA:54,0
-DA:55,0
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:174,0
-DA:175,0
-DA:184,0
-DA:185,0
-DA:276,0
-DA:443,0
-DA:444,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:53,0
-BA:53,0
-BA:276,0
-BA:276,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:277,_ZNKSs7_M_dataEv
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:612,_ZNKSs6lengthEv
-FN:1534,_ZNKSs5c_strEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:392,_ZNSs10_S_compareEjj
-FN:1551,_ZNKSs13get_allocatorEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:501,_ZNSsaSERKSs
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:1941,_ZNKSs7compareERKSs
-FN:2275,_ZStgtIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:2238,_ZStltIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:835,_ZNSs6appendEPKc
-FN:2121,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-FN:2461,_ZSt7getlineIcSt11char_traitsIcESaIcEERSt13basic_istreamIT_T0_ES7_RSbIS4_S5_T1_E
-FN:306,_ZNKSs8_M_checkEjPKc
-FN:1923,_ZNKSs6substrEjj
-FN:2188,_ZSteqIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_EPKS3_
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:306,0
-DA:308,0
-DA:309,0
-DA:310,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:392,0
-DA:394,0
-DA:401,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:612,0
-DA:613,0
-DA:686,0
-DA:687,0
-DA:835,0
-DA:838,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:1923,0
-DA:1925,0
-DA:1941,0
-DA:1943,0
-DA:1944,0
-DA:1945,0
-DA:1947,0
-DA:1948,0
-DA:1949,0
-DA:1950,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2121,0
-DA:2123,0
-DA:2124,0
-DA:2125,0
-DA:2188,0
-DA:2189,0
-DA:2238,0
-DA:2239,0
-DA:2275,0
-DA:2276,0
-DA:2421,0
-DA:2425,0
-DA:2461,0
-DA:2462,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:308,0
-BA:308,0
-BA:341,0
-BA:341,0
-BA:1948,0
-BA:1948,0
-LF:92
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:257,0
-DA:258,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:159,_ZStanSt12_Ios_IostateS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:159,0
-DA:160,0
-DA:163,0
-DA:164,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/locale_facets.h
-FN:1165,_ZNKSt5ctypeIcE13_M_widen_initEv
-FN:871,_ZNKSt5ctypeIcE5widenEc
-DA:871,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:1165,0
-DA:1168,0
-DA:1169,0
-DA:1170,0
-DA:1172,0
-DA:1174,0
-DA:1175,0
-DA:1176,0
-BA:873,0
-BA:873,0
-BA:1168,0
-BA:1168,0
-BA:1174,0
-BA:1174,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algo.h
-FN:1970,_ZSt4__lgi
-FN:1568,_ZSt13__heap_selectIN9__gnu_cxx17__normal_iteratorIPSt4pairISsfESt6vectorIS3_SaIS3_EEEEN3ept6popcon10secondsortEEvT_SC_SC_T0_
-FN:4661,_ZSt12partial_sortIN9__gnu_cxx17__normal_iteratorIPSt4pairISsfESt6vectorIS3_SaIS3_EEEEN3ept6popcon10secondsortEEvT_SC_SC_T0_
-FN:123,_ZSt8__medianISt4pairISsfEN3ept6popcon10secondsortEERKT_S7_S7_S7_T0_
-FN:1877,_ZSt21__unguarded_partitionIN9__gnu_cxx17__normal_iteratorIPSt4pairISsfESt6vectorIS3_SaIS3_EEEES3_N3ept6popcon10secondsortEET_SC_SC_T0_T1_
-FN:1930,_ZSt16__introsort_loopIN9__gnu_cxx17__normal_iteratorIPSt4pairISsfESt6vectorIS3_SaIS3_EEEEiN3ept6popcon10secondsortEEvT_SC_T0_T1_
-FN:1731,_ZSt25__unguarded_linear_insertIN9__gnu_cxx17__normal_iteratorIPSt4pairISsfESt6vectorIS3_SaIS3_EEEES3_N3ept6popcon10secondsortEEvT_T0_T1_
-FN:1806,_ZSt26__unguarded_insertion_sortIN9__gnu_cxx17__normal_iteratorIPSt4pairISsfESt6vectorIS3_SaIS3_EEEEN3ept6popcon10secondsortEEvT_SC_T0_
-FN:1771,_ZSt16__insertion_sortIN9__gnu_cxx17__normal_iteratorIPSt4pairISsfESt6vectorIS3_SaIS3_EEEEN3ept6popcon10secondsortEEvT_SC_T0_
-FN:1840,_ZSt22__final_insertion_sortIN9__gnu_cxx17__normal_iteratorIPSt4pairISsfESt6vectorIS3_SaIS3_EEEEN3ept6popcon10secondsortEEvT_SC_T0_
-FN:4806,_ZSt4sortIN9__gnu_cxx17__normal_iteratorIPSt4pairISsfESt6vectorIS3_SaIS3_EEEEN3ept6popcon10secondsortEEvT_SC_T0_
-DA:123,0
-DA:128,0
-DA:129,0
-DA:130,0
-DA:131,0
-DA:132,0
-DA:134,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:138,0
-DA:140,0
-DA:1568,0
-DA:1570,0
-DA:1571,0
-DA:1572,0
-DA:1573,0
-DA:1574,0
-DA:1731,0
-DA:1733,0
-DA:1734,0
-DA:1735,0
-DA:1737,0
-DA:1738,0
-DA:1739,0
-DA:1741,0
-DA:1742,0
-DA:1771,0
-DA:1773,0
-DA:1775,0
-DA:1778,0
-DA:1779,0
-DA:1781,0
-DA:1782,0
-DA:1785,0
-DA:1806,0
-DA:1811,0
-DA:1812,0
-DA:1813,0
-DA:1840,0
-DA:1842,0
-DA:1844,0
-DA:1845,0
-DA:1849,0
-DA:1850,0
-DA:1877,0
-DA:1879,0
-DA:1881,0
-DA:1882,0
-DA:1883,0
-DA:1884,0
-DA:1885,0
-DA:1886,0
-DA:1887,0
-DA:1888,0
-DA:1889,0
-DA:1930,0
-DA:1935,0
-DA:1937,0
-DA:1939,0
-DA:1940,0
-DA:1942,0
-DA:1952,0
-DA:1953,0
-DA:1954,0
-DA:1970,0
-DA:1971,0
-DA:4661,0
-DA:4674,0
-DA:4675,0
-DA:4676,0
-DA:4806,0
-DA:4818,0
-DA:4820,0
-DA:4822,0
-DA:4824,0
-BA:128,0
-BA:128,0
-BA:129,0
-BA:129,0
-BA:131,0
-BA:131,0
-BA:135,0
-BA:135,0
-BA:137,0
-BA:137,0
-BA:1571,0
-BA:1571,0
-BA:1572,0
-BA:1572,0
-BA:1735,0
-BA:1735,0
-BA:1773,0
-BA:1773,0
-BA:1775,0
-BA:1775,0
-BA:1779,0
-BA:1779,0
-BA:1811,0
-BA:1811,0
-BA:1842,0
-BA:1842,0
-BA:1881,0
-BA:1881,0
-BA:1884,0
-BA:1884,0
-BA:1886,0
-BA:1886,0
-BA:1935,0
-BA:1935,0
-BA:1937,0
-BA:1937,0
-BA:4818,0
-BA:4818,0
-LF:76
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb0EE3__bES7_
-FN:286,_ZNSt12__miter_baseISt23_Rb_tree_const_iteratorISt4pairIKSsfEELb0EE3__bES4_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb1EE3__bES7_
-FN:268,_ZNSt12__niter_baseISt16ostream_iteratorISscSt11char_traitsIcEELb0EE3__bES3_
-FN:188,_ZSt3minIjERKT_S2_S2_
-FN:268,_ZNSt12__niter_baseISt23_Rb_tree_const_iteratorISt4pairIKSsfEELb0EE3__bES4_
-FN:268,_ZNSt12__niter_baseISt20back_insert_iteratorISt6vectorISt4pairISsfESaIS3_EEELb0EE3__bES6_
-FN:286,_ZNSt12__miter_baseIPSsLb0EE3__bES0_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:286,_ZNSt12__miter_baseIPSt4pairISsfELb0EE3__bES2_
-FN:268,_ZNSt12__niter_baseIPSsLb0EE3__bES0_
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPSt4pairISsfESt6vectorIS3_SaIS3_EEEELb0EE3__bES8_
-FN:268,_ZNSt12__niter_baseIPSt4pairISsfELb0EE3__bES2_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPSt4pairISsfESt6vectorIS3_SaIS3_EEEELb1EE3__bES8_
-FN:539,_ZNSt20__copy_move_backwardILb0ELb0ESt26random_access_iterator_tagE13__copy_move_bIPSt4pairISsfES5_EET0_T_S7_S6_
-FN:579,_ZSt22__copy_move_backward_aILb0EPSt4pairISsfES2_ET1_T0_S4_S3_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPSt4pairISsfES2_ET1_T0_S4_S3_
-FN:624,_ZSt13copy_backwardIPSt4pairISsfES2_ET0_T_S4_S3_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EN9__gnu_cxx17__normal_iteratorIPSt4pairISsfESt6vectorIS3_SaIS3_EEEES8_ET1_T0_SA_S9_
-FN:624,_ZSt13copy_backwardIN9__gnu_cxx17__normal_iteratorIPSt4pairISsfESt6vectorIS3_SaIS3_EEEES8_ET0_T_SA_S9_
-FN:539,_ZNSt20__copy_move_backwardILb0ELb0ESt26random_access_iterator_tagE13__copy_move_bIPSsS3_EET0_T_S5_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0EPSsS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPSsS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardIPSsS0_ET0_T_S2_S1_
-FN:104,_ZNSt11__iter_swapILb1EE9iter_swapIN9__gnu_cxx17__normal_iteratorIPSt4pairISsfESt6vectorIS5_SaIS5_EEEESA_EEvT_T0_
-FN:121,_ZSt9iter_swapIN9__gnu_cxx17__normal_iteratorIPSt4pairISsfESt6vectorIS3_SaIS3_EEEES8_EvT_T0_
-FN:309,_ZNSt11__copy_moveILb0ELb0ESt26bidirectional_iterator_tagE8__copy_mISt23_Rb_tree_const_iteratorISt4pairIKSsfEESt20back_insert_iteratorISt6vectorIS4_ISsfESaISA_EEEEET0_T_SF_SE_
-FN:385,_ZSt13__copy_move_aILb0ESt23_Rb_tree_const_iteratorISt4pairIKSsfEESt20back_insert_iteratorISt6vectorIS1_ISsfESaIS7_EEEET1_T0_SC_SB_
-FN:430,_ZSt14__copy_move_a2ILb0ESt23_Rb_tree_const_iteratorISt4pairIKSsfEESt20back_insert_iteratorISt6vectorIS1_ISsfESaIS7_EEEET1_T0_SC_SB_
-FN:456,_ZSt4copyISt23_Rb_tree_const_iteratorISt4pairIKSsfEESt20back_insert_iteratorISt6vectorIS1_ISsfESaIS7_EEEET0_T_SC_SB_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPKSsSt16ostream_iteratorISscSt11char_traitsIcEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPKSsSt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_SD_SC_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET0_T_SD_SC_
-DA:104,0
-DA:106,0
-DA:107,0
-DA:121,0
-DA:142,0
-DA:146,0
-DA:188,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:210,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:268,0
-DA:269,0
-DA:276,0
-DA:277,0
-DA:286,0
-DA:287,0
-DA:309,0
-DA:311,0
-DA:312,0
-DA:313,0
-DA:337,0
-DA:340,0
-DA:342,0
-DA:343,0
-DA:344,0
-DA:346,0
-DA:385,0
-DA:393,0
-DA:396,0
-DA:430,0
-DA:435,0
-DA:456,0
-DA:466,0
-DA:539,0
-DA:542,0
-DA:543,0
-DA:544,0
-DA:579,0
-DA:587,0
-DA:592,0
-DA:597,0
-DA:602,0
-DA:624,0
-DA:636,0
-BA:193,0
-BA:193,0
-BA:215,0
-BA:215,0
-BA:311,0
-BA:311,0
-BA:340,0
-BA:340,0
-BA:542,0
-BA:542,0
-BA:542,0
-BA:542,0
-LF:48
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:87,_ZSt8_DestroyISt4pairISsfEEvPT_
-FN:97,_ZSt8_DestroyIPSt4pairISsfEEvT_S3_
-FN:126,_ZSt8_DestroyIPSt4pairISsfES1_EvT_S3_RSaIT0_E
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-DA:87,0
-DA:88,0
-DA:97,0
-DA:101,0
-DA:103,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-BA:101,0
-BA:101,0
-BA:101,0
-BA:101,0
-LF:9
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_function.h
-FN:482,_ZNKSt10_Select1stISt4pairIKSsfEEclERKS2_
-FN:229,_ZNKSt4lessISsEclERKSsS2_
-DA:229,0
-DA:230,0
-DA:482,45416
-DA:483,45416
-LF:4
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_heap.h
-FN:177,_ZSt11__push_heapIN9__gnu_cxx17__normal_iteratorIPSt4pairISsfESt6vectorIS3_SaIS3_EEEEiS3_N3ept6popcon10secondsortEEvT_T0_SD_T1_T2_
-FN:295,_ZSt13__adjust_heapIN9__gnu_cxx17__normal_iteratorIPSt4pairISsfESt6vectorIS3_SaIS3_EEEEiS3_N3ept6popcon10secondsortEEvT_T0_SD_T1_T2_
-FN:412,_ZSt9make_heapIN9__gnu_cxx17__normal_iteratorIPSt4pairISsfESt6vectorIS3_SaIS3_EEEEN3ept6popcon10secondsortEEvT_SC_T0_
-FN:322,_ZSt10__pop_heapIN9__gnu_cxx17__normal_iteratorIPSt4pairISsfESt6vectorIS3_SaIS3_EEEEN3ept6popcon10secondsortEEvT_SC_SC_T0_
-FN:350,_ZSt8pop_heapIN9__gnu_cxx17__normal_iteratorIPSt4pairISsfESt6vectorIS3_SaIS3_EEEEN3ept6popcon10secondsortEEvT_SC_T0_
-FN:477,_ZSt9sort_heapIN9__gnu_cxx17__normal_iteratorIPSt4pairISsfESt6vectorIS3_SaIS3_EEEEN3ept6popcon10secondsortEEvT_SC_T0_
-DA:177,0
-DA:179,0
-DA:180,0
-DA:183,0
-DA:184,0
-DA:185,0
-DA:187,0
-DA:188,0
-DA:295,0
-DA:297,0
-DA:298,0
-DA:299,0
-DA:301,0
-DA:302,0
-DA:304,0
-DA:305,0
-DA:306,0
-DA:308,0
-DA:310,0
-DA:311,0
-DA:313,0
-DA:315,0
-DA:317,0
-DA:322,0
-DA:329,0
-DA:330,0
-DA:331,0
-DA:334,0
-DA:350,0
-DA:358,0
-DA:359,0
-DA:412,0
-DA:424,0
-DA:425,0
-DA:427,0
-DA:428,0
-DA:429,0
-DA:431,0
-DA:432,0
-DA:434,0
-DA:435,0
-DA:436,0
-DA:477,0
-DA:485,0
-DA:486,0
-DA:487,0
-BA:180,0
-BA:180,0
-BA:180,0
-BA:180,0
-BA:180,0
-BA:180,0
-BA:299,0
-BA:299,0
-BA:302,0
-BA:302,0
-BA:308,0
-BA:308,0
-BA:308,0
-BA:308,0
-BA:424,0
-BA:424,0
-BA:429,0
-BA:429,0
-BA:434,0
-BA:434,0
-BA:485,0
-BA:485,0
-LF:46
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEdeEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEC1ERKS2_
-FN:398,_ZNSt20back_insert_iteratorISt6vectorISt4pairISsfESaIS2_EEEC1ERS4_
-FN:456,_ZSt13back_inserterISt6vectorISt4pairISsfESaIS2_EEESt20back_insert_iteratorIT_ERS6_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPSt4pairISsfESt6vectorIS2_SaIS2_EEEC1ERKS3_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEE4baseEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEC1ERKS1_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPSt4pairISsfESt6vectorIS2_SaIS2_EEE4baseEv
-FN:781,_ZN9__gnu_cxxneIPSt4pairISsfESt6vectorIS2_SaIS2_EEEEbRKNS_17__normal_iteratorIT_T0_EESC_
-FN:846,_ZN9__gnu_cxxmiIPSt4pairISsfESt6vectorIS2_SaIS2_EEEENS_17__normal_iteratorIT_T0_E15difference_typeERKSA_SD_
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPSt4pairISsfESt6vectorIS2_SaIS2_EEEdeEv
-FN:735,_ZNK9__gnu_cxx17__normal_iteratorIPSt4pairISsfESt6vectorIS2_SaIS2_EEEplERKi
-FN:743,_ZNK9__gnu_cxx17__normal_iteratorIPSt4pairISsfESt6vectorIS2_SaIS2_EEEmiERKi
-FN:703,_ZN9__gnu_cxx17__normal_iteratorIPSt4pairISsfESt6vectorIS2_SaIS2_EEEppEv
-FN:715,_ZN9__gnu_cxx17__normal_iteratorIPSt4pairISsfESt6vectorIS2_SaIS2_EEEmmEv
-FN:794,_ZN9__gnu_cxxltIPSt4pairISsfESt6vectorIS2_SaIS2_EEEEbRKNS_17__normal_iteratorIT_T0_EESC_
-FN:769,_ZN9__gnu_cxxeqIPSt4pairISsfESt6vectorIS2_SaIS2_EEEEbRKNS_17__normal_iteratorIT_T0_EESC_
-FN:434,_ZNSt20back_insert_iteratorISt6vectorISt4pairISsfESaIS2_EEEppEv
-FN:429,_ZNSt20back_insert_iteratorISt6vectorISt4pairISsfESaIS2_EEEdeEv
-FN:722,_ZN9__gnu_cxx17__normal_iteratorIPSt4pairISsfESt6vectorIS2_SaIS2_EEEmmEi
-FN:412,_ZNSt20back_insert_iteratorISt6vectorISt4pairISsfESaIS2_EEEaSERKS2_
-DA:398,0
-DA:412,0
-DA:414,0
-DA:415,0
-DA:429,0
-DA:430,0
-DA:434,0
-DA:435,0
-DA:456,0
-DA:457,0
-DA:683,0
-DA:695,0
-DA:696,0
-DA:703,0
-DA:705,0
-DA:706,0
-DA:715,0
-DA:717,0
-DA:718,0
-DA:722,0
-DA:723,0
-DA:735,0
-DA:736,0
-DA:743,0
-DA:744,0
-DA:747,0
-DA:748,0
-DA:769,0
-DA:770,0
-DA:781,0
-DA:782,0
-DA:794,0
-DA:795,0
-DA:846,0
-DA:847,0
-LF:35
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,0
-DA:166,0
-DA:167,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_map.h
-FN:284,_ZNKSt3mapISsfSt4lessISsESaISt4pairIKSsfEEE5beginEv
-FN:302,_ZNKSt3mapISsfSt4lessISsESaISt4pairIKSsfEEE3endEv
-FN:155,_ZNSt3mapISsfSt4lessISsESaISt4pairIKSsfEEEC1Ev
-FN:92,_ZNSt3mapISsfSt4lessISsESaISt4pairIKSsfEEED1Ev
-FN:629,_ZNKSt3mapISsfSt4lessISsESaISt4pairIKSsfEEE4findERS3_
-FN:468,_ZNSt3mapISsfSt4lessISsESaISt4pairIKSsfEEE6insertERKS4_
-DA:92,0
-DA:155,1
-DA:156,1
-DA:284,0
-DA:285,0
-DA:302,2
-DA:303,2
-DA:468,1902
-DA:469,1902
-DA:629,2
-DA:630,2
-LF:11
-LH:8
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_move.h
-FN:80,_ZSt4swapISt4pairISsfEEvRT_S3_
-DA:80,0
-DA:85,0
-DA:86,0
-DA:87,0
-DA:88,0
-LF:5
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_pair.h
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIS_IKSsfEEbEC1ERKS3_RKb
-FN:88,_ZNSt4pairISsfEC1ERKSsRKf
-FN:218,_ZSt9make_pairISsfESt4pairIT_T0_ES1_S2_
-FN:73,_ZNSt4pairISsfEC1ERKS0_
-FN:104,_ZNSt4pairISsfEC1IKSsfEERKS_IT_T0_E
-FN:88,_ZNSt4pairISsdEC1ERKSsRKd
-FN:218,_ZSt9make_pairISsdESt4pairIT_T0_ES1_S2_
-FN:104,_ZNSt4pairIKSsfEC1ISsdEERKS_IT_T0_E
-FN:73,_ZNSt4pairIKSsfEC1ERKS1_
-FN:73,_ZNSt4pairISsfEaSERKS0_
-FN:73,_ZNSt4pairISsfED1Ev
-FN:73,_ZNSt4pairIKSsfED1Ev
-FN:73,_ZNSt4pairISsdED1Ev
-DA:73,3804
-DA:88,3804
-DA:89,3804
-DA:104,1902
-DA:106,1902
-DA:218,1902
-DA:219,1902
-LF:7
-LH:7
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_tree.h
-FN:285,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKSsfEEeqERKS3_
-FN:251,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKSsfEEptEv
-FN:289,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKSsfEEneERKS3_
-FN:452,_ZNSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_M_beginEv
-FN:398,_ZNSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EE13_Rb_tree_implIS6_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:463,_ZNSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EE6_M_endEv
-FN:168,_ZNSt17_Rb_tree_iteratorISt4pairIKSsfEEC1EPSt13_Rb_tree_nodeIS2_E
-FN:596,_ZNSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EE5beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsfEEeqERKS3_
-FN:456,_ZNKSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_M_beginEv
-FN:467,_ZNKSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EE6_M_endEv
-FN:240,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsfEEC1EPKSt13_Rb_tree_nodeIS2_E
-FN:603,_ZNKSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EE5beginEv
-FN:614,_ZNKSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EE3endEv
-FN:415,_ZNSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EE13_Rb_tree_implIS6_Lb0EE13_M_initializeEv
-FN:471,_ZNSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_S_valueEPKSt13_Rb_tree_nodeIS2_E
-FN:475,_ZNSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EE6_S_keyEPKSt13_Rb_tree_nodeIS2_E
-FN:495,_ZNSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EE6_S_keyEPKSt18_Rb_tree_node_base
-FN:483,_ZNSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EE7_S_leftEPKSt18_Rb_tree_node_base
-FN:491,_ZNSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_S_rightEPKSt18_Rb_tree_node_base
-FN:403,_ZNSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EE13_Rb_tree_implIS6_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EEC1Ev
-FN:347,_ZNKSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EE21_M_get_Node_allocatorEv
-FN:247,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKSsfEEdeEv
-FN:351,_ZNKSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EE13get_allocatorEv
-FN:356,_ZNSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EE11_M_get_nodeEv
-FN:360,_ZNSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS2_E
-FN:364,_ZNSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EE14_M_create_nodeERKS2_
-FN:388,_ZNSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS2_E
-FN:936,_ZNSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EE8_M_eraseEPSt13_Rb_tree_nodeIS2_E
-FN:584,_ZNSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EED1Ev
-FN:255,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsfEEppEv
-FN:970,_ZNKSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EE14_M_lower_boundEPKSt13_Rb_tree_nodeIS2_ESC_RS1_
-FN:1403,_ZNKSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EE4findERS1_
-FN:195,_ZNSt17_Rb_tree_iteratorISt4pairIKSsfEEmmEv
-FN:846,_ZNSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EE10_M_insert_EPKSt18_Rb_tree_node_baseSB_RKS2_
-FN:1133,_ZNSt8_Rb_treeISsSt4pairIKSsfESt10_Select1stIS2_ESt4lessISsESaIS2_EE16_M_insert_uniqueERKS2_
-DA:168,4757
-DA:169,4757
-DA:195,948
-DA:197,948
-DA:198,948
-DA:210,953
-DA:211,953
-DA:240,6
-DA:241,6
-DA:247,0
-DA:248,0
-DA:251,2
-DA:252,2
-DA:255,0
-DA:257,0
-DA:258,0
-DA:285,4
-DA:286,4
-DA:289,0
-DA:290,0
-DA:347,0
-DA:348,0
-DA:351,0
-DA:352,0
-DA:356,1902
-DA:357,1902
-DA:360,0
-DA:361,0
-DA:364,1902
-DA:366,1902
-DA:368,1902
-DA:369,0
-DA:371,0
-DA:372,0
-DA:374,1902
-DA:388,0
-DA:390,0
-DA:391,0
-DA:392,0
-DA:398,0
-DA:403,1
-DA:405,1
-DA:406,1
-DA:415,1
-DA:417,1
-DA:418,1
-DA:419,1
-DA:420,1
-DA:421,1
-DA:452,0
-DA:453,0
-DA:456,2
-DA:459,2
-DA:463,3804
-DA:464,3804
-DA:467,2
-DA:468,2
-DA:471,18920
-DA:472,18920
-DA:475,18920
-DA:476,18920
-DA:479,0
-DA:480,0
-DA:483,14
-DA:484,14
-DA:487,0
-DA:488,0
-DA:491,8
-DA:492,8
-DA:495,3800
-DA:496,3800
-DA:499,3800
-DA:500,3800
-DA:562,1
-DA:584,0
-DA:585,0
-DA:596,953
-DA:599,953
-DA:603,0
-DA:606,0
-DA:614,4
-DA:617,4
-DA:846,1902
-DA:850,1902
-DA:852,1902
-DA:854,1902
-DA:857,1902
-DA:858,1902
-DA:936,0
-DA:939,0
-DA:941,0
-DA:942,0
-DA:943,0
-DA:944,0
-DA:946,0
-DA:970,2
-DA:972,26
-DA:973,22
-DA:974,14
-DA:976,8
-DA:977,2
-DA:1133,1902
-DA:1135,1902
-DA:1136,1902
-DA:1137,1902
-DA:1138,22702
-DA:1140,18898
-DA:1141,18898
-DA:1142,18898
-DA:1144,1902
-DA:1145,1902
-DA:1147,953
-DA:1148,5
-DA:1150,948
-DA:1152,1897
-DA:1153,1897
-DA:1154,0
-DA:1403,2
-DA:1405,2
-DA:1408,2
-BA:850,2
-BA:850,1
-BA:850,2
-BA:850,2
-BA:850,2
-BA:850,2
-BA:939,0
-BA:939,0
-BA:972,2
-BA:972,2
-BA:973,2
-BA:973,2
-BA:1138,2
-BA:1138,2
-BA:1142,2
-BA:1142,2
-BA:1145,2
-BA:1145,2
-BA:1147,2
-BA:1147,2
-BA:1152,2
-BA:1152,1
-BA:1408,2
-BA:1408,1
-BA:1408,1
-BA:1408,2
-LF:120
-LH:81
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyIPSt4pairISsfES4_EET0_T_S6_S5_
-FN:113,_ZSt18uninitialized_copyIPSt4pairISsfES2_ET0_T_S4_S3_
-FN:261,_ZSt22__uninitialized_copy_aIPSt4pairISsfES2_S1_ET0_T_S4_S3_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPSt4pairISsfES2_SaIS1_EET0_T_S5_S4_RT1_
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyIPSsS2_EET0_T_S4_S3_
-FN:113,_ZSt18uninitialized_copyIPSsS0_ET0_T_S2_S1_
-FN:261,_ZSt22__uninitialized_copy_aIPSsS0_SsET0_T_S2_S1_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPSsS0_SaISsEET0_T_S3_S2_RT1_
-DA:73,0
-DA:75,0
-DA:78,0
-DA:79,0
-DA:81,0
-DA:83,0
-DA:85,0
-DA:86,0
-DA:113,0
-DA:122,0
-DA:261,0
-DA:262,0
-DA:268,0
-DA:272,0
-BA:78,0
-BA:78,0
-BA:78,0
-BA:78,0
-BA:79,0
-BA:79,0
-BA:79,0
-BA:79,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:484,_ZNKSt6vectorISsSaISsEE4sizeEv
-FN:562,_ZNSt6vectorISsSaISsEEixEj
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:404,_ZNKSt6vectorISsSaISsEE3endEv
-FN:386,_ZNKSt6vectorISsSaISsEE5beginEv
-FN:101,_ZNKSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:97,_ZNSt12_Vector_baseISt4pairISsfESaIS1_EE19_M_get_Tp_allocatorEv
-FN:395,_ZNSt6vectorISt4pairISsfESaIS1_EE3endEv
-FN:377,_ZNSt6vectorISt4pairISsfESaIS1_EE5beginEv
-FN:484,_ZNKSt6vectorISt4pairISsfESaIS1_EE4sizeEv
-FN:101,_ZNKSt12_Vector_baseISt4pairISsfESaIS1_EE19_M_get_Tp_allocatorEv
-FN:395,_ZNSt6vectorISsSaISsEE3endEv
-FN:526,_ZNKSt6vectorISsSaISsEE5emptyEv
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:79,_ZNSt12_Vector_baseISt4pairISsfESaIS1_EE12_Vector_implD1Ev
-FN:84,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseISsSaISsEEC2Ev
-FN:213,_ZNSt6vectorISsSaISsEEC1Ev
-FN:489,_ZNKSt6vectorISsSaISsEE8max_sizeEv
-FN:84,_ZNSt12_Vector_baseISt4pairISsfESaIS1_EE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseISt4pairISsfESaIS1_EEC2Ev
-FN:213,_ZNSt6vectorISt4pairISsfESaIS1_EEC1Ev
-FN:489,_ZNKSt6vectorISt4pairISsfESaIS1_EE8max_sizeEv
-FN:1075,_ZNKSt6vectorISt4pairISsfESaIS1_EE12_M_check_lenEjPKc
-FN:1075,_ZNKSt6vectorISsSaISsEE12_M_check_lenEjPKc
-FN:143,_ZNSt12_Vector_baseISt4pairISsfESaIS1_EE11_M_allocateEj
-FN:143,_ZNSt12_Vector_baseISsSaISsEE11_M_allocateEj
-FN:147,_ZNSt12_Vector_baseISt4pairISsfESaIS1_EE13_M_deallocateEPS1_j
-FN:135,_ZNSt12_Vector_baseISt4pairISsfESaIS1_EED2Ev
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:299,_ZNSt6vectorISt4pairISsfESaIS1_EED1Ev
-FN:686,_ZNSt6vectorISt4pairISsfESaIS1_EE9push_backERKS1_
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-FN:686,_ZNSt6vectorISsSaISsEE9push_backERKSs
-DA:79,0
-DA:84,0
-DA:85,0
-DA:86,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:108,0
-DA:109,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:143,0
-DA:144,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:213,0
-DA:214,0
-DA:299,0
-DA:300,0
-DA:301,0
-DA:377,0
-DA:378,0
-DA:386,0
-DA:387,0
-DA:395,0
-DA:396,0
-DA:404,0
-DA:405,0
-DA:484,0
-DA:485,0
-DA:489,0
-DA:490,0
-DA:526,0
-DA:527,0
-DA:562,0
-DA:563,0
-DA:686,0
-DA:688,0
-DA:690,0
-DA:691,0
-DA:694,0
-DA:695,0
-DA:1075,0
-DA:1077,0
-DA:1078,0
-DA:1080,0
-DA:1081,0
-BA:144,0
-BA:144,0
-BA:144,0
-BA:144,0
-BA:149,0
-BA:149,0
-BA:149,0
-BA:149,0
-BA:688,0
-BA:688,0
-BA:688,0
-BA:688,0
-BA:1077,0
-BA:1077,0
-BA:1077,0
-BA:1077,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-LF:51
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stream_iterator.h
-FN:181,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERSoPKc
-FN:185,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERKS2_
-FN:202,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEdeEv
-FN:206,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEppEv
-FN:191,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEaSERKSs
-DA:181,0
-DA:182,0
-DA:185,0
-DA:186,0
-DA:191,0
-DA:196,0
-DA:197,0
-DA:198,0
-DA:202,0
-DA:203,0
-DA:206,0
-DA:207,0
-BA:197,0
-BA:197,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/vector.tcc
-FN:283,_ZNSt6vectorISt4pairISsfESaIS1_EE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPS1_S3_EERKS1_
-FN:283,_ZNSt6vectorISsSaISsEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPSsS1_EERKSs
-DA:283,0
-DA:286,0
-DA:288,0
-DA:291,0
-DA:293,0
-DA:295,0
-DA:299,0
-DA:307,0
-DA:308,0
-DA:309,0
-DA:316,0
-DA:321,0
-DA:323,0
-DA:324,0
-DA:330,0
-DA:332,0
-DA:333,0
-DA:334,0
-DA:336,0
-DA:338,0
-DA:341,0
-DA:342,0
-DA:343,0
-DA:345,0
-BA:286,0
-BA:286,0
-BA:286,0
-BA:286,0
-LF:24
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/cmath
-FN:321,_ZSt3logf
-DA:321,1
-DA:322,1
-LF:2
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsfEEED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairISsfEED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISsE8max_sizeEv
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsfEEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsfEED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairISsfEEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt4pairISsfEE8max_sizeEv
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsfEEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsfEEE8max_sizeEv
-FN:107,_ZN9__gnu_cxx13new_allocatorISt4pairISsfEE9constructEPS2_RKS2_
-FN:107,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsfEE9constructEPS3_RKS3_
-FN:107,_ZN9__gnu_cxx13new_allocatorISsE9constructEPSsRKSs
-FN:87,_ZN9__gnu_cxx13new_allocatorISt4pairISsfEE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsfEEE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorISsE8allocateEjPKv
-FN:97,_ZN9__gnu_cxx13new_allocatorISt4pairISsfEE10deallocateEPS2_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsfEEE10deallocateEPS5_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsfEE7destroyEPS3_
-DA:69,1
-DA:71,0
-DA:76,0
-DA:87,1902
-DA:89,1902
-DA:90,0
-DA:92,1902
-DA:97,0
-DA:98,0
-DA:101,1902
-DA:102,1902
-DA:107,1902
-DA:108,1902
-DA:118,0
-BA:89,0
-BA:89,0
-BA:89,1
-BA:89,2
-BA:89,0
-BA:89,0
-BA:108,0
-BA:108,0
-BA:108,2
-BA:108,1
-BA:108,0
-BA:108,0
-LF:14
-LH:8
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/fstream
-FN:215,_ZNSt13basic_filebufIcSt11char_traitsIcEED1Ev
-FN:428,_ZNSt14basic_ifstreamIcSt11char_traitsIcEEC1Ev
-FN:455,_ZNSt14basic_ifstreamIcSt11char_traitsIcEED1Ev
-FN:495,_ZNSt14basic_ifstreamIcSt11char_traitsIcEE4openEPKcSt13_Ios_Openmode
-DA:215,0
-DA:216,0
-DA:428,0
-DA:429,0
-DA:455,0
-DA:456,0
-DA:495,0
-DA:497,0
-DA:498,0
-DA:502,0
-DA:503,0
-BA:216,0
-BA:216,0
-BA:456,0
-BA:456,0
-BA:456,0
-BA:456,0
-BA:456,0
-BA:456,0
-BA:497,0
-BA:497,0
-LF:11
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,2
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/istream
-FN:585,_ZNSiC2Ev
-FN:105,_ZNSiD2Ev
-FN:804,_ZNSdC2Ev
-FN:801,_ZNSdD2Ev
-DA:105,0
-DA:106,0
-DA:585,0
-DA:586,0
-DA:587,0
-DA:801,0
-DA:804,0
-DA:805,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-DA:95,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:536,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:509,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:555,_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:509,0
-DA:510,0
-DA:511,0
-DA:536,0
-DA:537,0
-DA:555,0
-DA:556,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/popcon/maint/sourcedir.cc
-FN:141,_Z41__static_initialization_and_destruction_0ii
-FN:141,_GLOBAL__I_sourcedir.cc
-FN:17,_ZN3ept6popcon9SourceDir8fileTypeERKSs
-FN:44,_ZN3ept6popcon8readLineERN7tagcoll5input5InputERSs
-FN:53,_ZN3ept6popconL11parseScoresERN7tagcoll5input5InputERSt3mapISsNS0_5ScoreESt4lessISsESaISt4pairIKSsS6_EEERj
-FN:110,_ZN3ept6popcon9SourceDir10readScoresERSt3mapISsNS0_5ScoreESt4lessISsESaISt4pairIKSsS3_EEERj
-FN:27,_ZN3ept6popcon9SourceDir9timestampEv
-DA:17,93
-DA:19,93
-DA:21,59
-DA:22,59
-DA:24,46
-DA:27,14
-DA:29,14
-DA:31,14
-DA:32,98
-DA:34,84
-DA:35,84
-DA:37,12
-DA:38,24
-DA:39,14
-DA:41,14
-DA:44,70200
-DA:46,70200
-DA:48,4594913
-DA:49,4454513
-DA:50,70200
-DA:53,1
-DA:55,1
-DA:56,140349
-DA:58,70199
-DA:59,0
-DA:60,70199
-DA:62,1
-DA:63,1
-DA:65,70198
-DA:66,50
-DA:67,70148
-DA:68,70148
-DA:69,70148
-DA:70,0
-DA:71,70148
-DA:76,70148
-DA:77,70148
-DA:78,70148
-DA:79,70148
-DA:80,70148
-DA:82,70148
-DA:83,70148
-DA:84,70148
-DA:85,70148
-DA:86,70148
-DA:88,70148
-DA:89,70148
-DA:90,70148
-DA:91,70148
-DA:92,70148
-DA:94,70148
-DA:95,70148
-DA:96,70148
-DA:97,70148
-DA:98,70148
-DA:103,70148
-DA:105,70148
-DA:106,69910
-DA:107,1
-DA:108,1
-DA:110,3
-DA:112,3
-DA:113,3
-DA:115,12
-DA:117,9
-DA:118,9
-DA:121,0
-DA:124,0
-DA:125,0
-DA:127,9
-DA:130,1
-DA:133,1
-DA:134,1
-DA:136,3
-DA:137,3
-DA:141,6
-BA:19,2
-BA:19,2
-BA:21,1
-BA:21,2
-BA:22,2
-BA:22,2
-BA:29,1
-BA:29,2
-BA:32,2
-BA:32,2
-BA:35,2
-BA:35,2
-BA:38,2
-BA:38,1
-BA:48,2
-BA:48,2
-BA:48,2
-BA:48,2
-BA:48,2
-BA:48,2
-BA:56,1
-BA:56,2
-BA:56,1
-BA:56,2
-BA:56,1
-BA:56,2
-BA:56,1
-BA:56,2
-BA:56,2
-BA:56,2
-BA:58,1
-BA:58,2
-BA:60,2
-BA:60,2
-BA:65,2
-BA:65,2
-BA:69,1
-BA:69,2
-BA:77,1
-BA:77,2
-BA:79,1
-BA:79,2
-BA:83,1
-BA:83,2
-BA:85,1
-BA:85,2
-BA:89,1
-BA:89,2
-BA:91,1
-BA:91,2
-BA:95,1
-BA:95,2
-BA:97,2
-BA:97,1
-BA:105,2
-BA:105,2
-BA:112,1
-BA:112,2
-BA:115,2
-BA:115,2
-BA:118,1
-BA:118,2
-BA:127,2
-BA:127,2
-BA:141,2
-BA:141,1
-BA:141,2
-BA:141,1
-LF:76
-LH:71
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/popcon/popcon.h
-FN:51,_ZN3ept6popcon5ScoreC1Ef
-DA:51,69910
-LF:1
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/string.h
-FN:236,_ZN6wibble3str8joinpathERKSsS2_
-DA:236,0
-DA:238,0
-DA:239,0
-DA:240,0
-DA:241,0
-DA:243,0
-DA:244,0
-DA:245,0
-DA:247,0
-DA:249,0
-DA:250,0
-DA:252,0
-BA:238,0
-BA:238,0
-BA:240,0
-BA:240,0
-BA:243,0
-BA:243,0
-BA:244,0
-BA:244,0
-BA:249,0
-BA:249,0
-LF:12
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/sys/fs.h
-FN:99,_ZN6wibble3sys2fs9Directory14const_iteratorptEv
-FN:105,_ZNK6wibble3sys2fs9Directory14const_iteratorneERKS3_
-FN:114,_ZNK6wibble3sys2fs9Directory4pathEv
-FN:88,_ZN6wibble3sys2fs9Directory14const_iteratorppEv
-FN:65,_ZN6wibble3sys2fs9Directory14const_iteratorD1Ev
-DA:65,0
-DA:88,0
-DA:90,0
-DA:92,0
-DA:93,0
-DA:95,0
-DA:99,0
-DA:105,0
-DA:107,0
-DA:114,0
-BA:65,0
-BA:65,0
-BA:90,0
-BA:90,0
-BA:107,0
-BA:107,0
-BA:107,0
-BA:107,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaIcED1Ev
-FN:100,_ZNSaIcEC1ERKS_
-FN:100,_ZNSaIcEC2ERKS_
-FN:106,_ZNSaISt4pairIKSsN3ept6popcon5ScoreEEED1Ev
-FN:104,_ZNSaISt4pairIKSsN3ept6popcon5ScoreEEEC1ISt13_Rb_tree_nodeIS4_EEERKSaIT_E
-DA:98,0
-DA:100,0
-DA:101,0
-DA:104,139820
-DA:106,139820
-LF:5
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:277,_ZNKSs7_M_dataEv
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:701,_ZNKSsixEj
-FN:1534,_ZNKSs5c_strEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:192,_ZNKSs4_Rep12_M_is_sharedEv
-FN:652,_ZNKSs8capacityEv
-FN:1551,_ZNKSs13get_allocatorEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:392,_ZNSs10_S_compareEjj
-FN:306,_ZNKSs8_M_checkEjPKc
-FN:1923,_ZNKSs6substrEjj
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2136,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S3_
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-FN:2188,_ZSteqIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_EPKS3_
-FN:2225,_ZStneIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_EPKS3_
-FN:1941,_ZNKSs7compareERKSs
-FN:2238,_ZStltIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:679,_ZNSs5clearEv
-FN:870,_ZNSs9push_backEc
-FN:791,_ZNSspLEc
-DA:178,0
-DA:183,0
-DA:184,0
-DA:192,0
-DA:193,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:306,0
-DA:308,0
-DA:309,0
-DA:310,0
-DA:392,0
-DA:394,0
-DA:401,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:606,0
-DA:607,0
-DA:652,0
-DA:653,0
-DA:679,0
-DA:680,0
-DA:686,0
-DA:687,0
-DA:701,0
-DA:704,0
-DA:791,0
-DA:793,0
-DA:794,0
-DA:870,0
-DA:872,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:877,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:1923,0
-DA:1925,0
-DA:1941,0
-DA:1943,0
-DA:1944,0
-DA:1945,0
-DA:1947,0
-DA:1948,0
-DA:1949,0
-DA:1950,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2136,0
-DA:2140,0
-DA:2141,0
-DA:2142,0
-DA:2188,0
-DA:2189,0
-DA:2225,0
-DA:2226,0
-DA:2238,0
-DA:2239,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:308,0
-BA:308,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:1948,0
-BA:1948,0
-LF:89
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-DA:245,0
-DA:246,0
-DA:257,0
-DA:258,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:188,_ZSt3minIjERKT_S2_S2_
-DA:188,0
-DA:193,0
-DA:194,0
-DA:195,0
-BA:193,0
-BA:193,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_function.h
-FN:482,_ZNKSt10_Select1stISt4pairIKSsN3ept6popcon5ScoreEEEclERKS5_
-FN:229,_ZNKSt4lessISsEclERKSsS2_
-DA:229,0
-DA:230,0
-DA:482,2464924
-DA:483,2464924
-LF:4
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_map.h
-FN:468,_ZNSt3mapISsN3ept6popcon5ScoreESt4lessISsESaISt4pairIKSsS2_EEE6insertERKS7_
-DA:468,69910
-DA:469,69910
-LF:2
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_pair.h
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorIS_IKSsN3ept6popcon5ScoreEEEbEC1ERKS6_RKb
-FN:88,_ZNSt4pairISsN3ept6popcon5ScoreEEC1ERKSsRKS2_
-FN:218,_ZSt9make_pairISsN3ept6popcon5ScoreEESt4pairIT_T0_ES4_S5_
-FN:104,_ZNSt4pairIKSsN3ept6popcon5ScoreEEC1ISsS3_EERKS_IT_T0_E
-FN:73,_ZNSt4pairIKSsN3ept6popcon5ScoreEEC1ERKS4_
-FN:73,_ZNSt4pairIKSsN3ept6popcon5ScoreEED1Ev
-FN:73,_ZNSt4pairISsN3ept6popcon5ScoreEED1Ev
-DA:73,279640
-DA:88,139820
-DA:89,139820
-DA:104,69910
-DA:106,69910
-DA:218,69910
-DA:219,69910
-LF:7
-LH:7
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_tree.h
-FN:452,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept6popcon5ScoreEESt10_Select1stIS5_ESt4lessISsESaIS5_EE8_M_beginEv
-FN:463,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept6popcon5ScoreEESt10_Select1stIS5_ESt4lessISsESaIS5_EE6_M_endEv
-FN:487,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept6popcon5ScoreEESt10_Select1stIS5_ESt4lessISsESaIS5_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept6popcon5ScoreEESt10_Select1stIS5_ESt4lessISsESaIS5_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:168,_ZNSt17_Rb_tree_iteratorISt4pairIKSsN3ept6popcon5ScoreEEEC1EPSt13_Rb_tree_nodeIS5_E
-FN:596,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept6popcon5ScoreEESt10_Select1stIS5_ESt4lessISsESaIS5_EE5beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorISt4pairIKSsN3ept6popcon5ScoreEEEeqERKS6_
-FN:471,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept6popcon5ScoreEESt10_Select1stIS5_ESt4lessISsESaIS5_EE8_S_valueEPKSt13_Rb_tree_nodeIS5_E
-FN:475,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept6popcon5ScoreEESt10_Select1stIS5_ESt4lessISsESaIS5_EE6_S_keyEPKSt13_Rb_tree_nodeIS5_E
-FN:495,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept6popcon5ScoreEESt10_Select1stIS5_ESt4lessISsESaIS5_EE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept6popcon5ScoreEESt10_Select1stIS5_ESt4lessISsESaIS5_EE6_S_keyEPKSt18_Rb_tree_node_base
-FN:347,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept6popcon5ScoreEESt10_Select1stIS5_ESt4lessISsESaIS5_EE21_M_get_Node_allocatorEv
-FN:351,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept6popcon5ScoreEESt10_Select1stIS5_ESt4lessISsESaIS5_EE13get_allocatorEv
-FN:195,_ZNSt17_Rb_tree_iteratorISt4pairIKSsN3ept6popcon5ScoreEEEmmEv
-FN:356,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept6popcon5ScoreEESt10_Select1stIS5_ESt4lessISsESaIS5_EE11_M_get_nodeEv
-FN:360,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept6popcon5ScoreEESt10_Select1stIS5_ESt4lessISsESaIS5_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS5_E
-FN:364,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept6popcon5ScoreEESt10_Select1stIS5_ESt4lessISsESaIS5_EE14_M_create_nodeERKS5_
-FN:846,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept6popcon5ScoreEESt10_Select1stIS5_ESt4lessISsESaIS5_EE10_M_insert_EPKSt18_Rb_tree_node_baseSE_RKS5_
-FN:1133,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept6popcon5ScoreEESt10_Select1stIS5_ESt4lessISsESaIS5_EE16_M_insert_uniqueERKS5_
-DA:168,242454
-DA:169,242454
-DA:195,32716
-DA:197,32716
-DA:198,32716
-DA:210,32722
-DA:211,32722
-DA:347,139820
-DA:348,139820
-DA:351,139820
-DA:352,139820
-DA:356,69910
-DA:357,69910
-DA:360,69910
-DA:361,69910
-DA:364,69910
-DA:366,69910
-DA:368,69910
-DA:369,0
-DA:371,0
-DA:372,0
-DA:374,69910
-DA:452,69912
-DA:453,69912
-DA:463,139820
-DA:464,139820
-DA:471,1092649
-DA:472,1092649
-DA:475,1092649
-DA:476,1092649
-DA:479,599268
-DA:480,599268
-DA:487,633201
-DA:488,633201
-DA:495,139813
-DA:496,139813
-DA:499,139813
-DA:500,139813
-DA:596,32723
-DA:599,32723
-DA:846,69910
-DA:850,69910
-DA:852,69910
-DA:854,69910
-DA:857,69910
-DA:858,69910
-DA:1133,69910
-DA:1135,69910
-DA:1136,69910
-DA:1137,69910
-DA:1138,1232469
-DA:1140,1092649
-DA:1141,1092649
-DA:1142,1092649
-DA:1144,69910
-DA:1145,69910
-DA:1147,32722
-DA:1148,6
-DA:1150,32716
-DA:1152,69904
-DA:1153,69904
-DA:1154,0
-BA:850,2
-BA:850,1
-BA:850,2
-BA:850,2
-BA:850,2
-BA:850,2
-BA:1138,2
-BA:1138,2
-BA:1142,2
-BA:1142,2
-BA:1145,2
-BA:1145,2
-BA:1147,2
-BA:1147,2
-BA:1152,2
-BA:1152,1
-LF:62
-LH:58
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN3ept6popcon5ScoreEEED2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept6popcon5ScoreEEEE8max_sizeEv
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN3ept6popcon5ScoreEEEC2Ev
-FN:107,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN3ept6popcon5ScoreEEE9constructEPS6_RKS6_
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept6popcon5ScoreEEEE8allocateEjPKv
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept6popcon5ScoreEEEE10deallocateEPS8_j
-DA:69,139820
-DA:71,0
-DA:76,139820
-DA:87,69910
-DA:89,69910
-DA:90,0
-DA:92,69910
-DA:97,69910
-DA:98,69910
-DA:101,69910
-DA:102,69910
-DA:107,69910
-DA:108,69910
-BA:89,1
-BA:89,2
-BA:108,2
-BA:108,1
-LF:13
-LH:11
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,2
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/popcon/maint/path.cc
-FN:67,_ZN3ept6popcon4Path9timestampERKSs
-FN:63,_ZN3ept6popcon4Path6accessERKSsi
-FN:41,_ZN3ept6popconL7userdirEv
-FN:52,_ZN3ept6popcon4Path8instanceEv
-FN:92,_ZN3ept6popcon4Path18popconUserIndexDirEv
-FN:106,_ZN3ept6popcon4Path15userScoresIndexEv
-FN:102,_ZN3ept6popcon4Path10userScoresEv
-FN:91,_ZN3ept6popcon4Path19popconUserSourceDirEv
-FN:90,_ZN3ept6popcon4Path14popconIndexDirEv
-FN:98,_ZN3ept6popcon4Path11scoresIndexEv
-FN:94,_ZN3ept6popcon4Path6scoresEv
-FN:89,_ZN3ept6popcon4Path15popconSourceDirEv
-FN:84,_ZN3ept6popcon4Path21setPopconUserIndexDirERKSs
-FN:80,_ZN3ept6popcon4Path22setPopconUserSourceDirERKSs
-FN:76,_ZN3ept6popcon4Path17setPopconIndexDirERKSs
-FN:72,_ZN3ept6popcon4Path18setPopconSourceDirERKSs
-DA:41,2
-DA:43,2
-DA:45,2
-DA:46,2
-DA:48,0
-DA:52,178
-DA:53,178
-DA:54,1
-DA:55,1
-DA:56,1
-DA:57,2
-DA:58,2
-DA:60,178
-DA:63,2
-DA:64,2
-DA:67,49
-DA:68,49
-DA:69,90
-DA:72,14
-DA:74,14
-DA:75,14
-DA:76,14
-DA:78,14
-DA:79,14
-DA:80,14
-DA:82,14
-DA:83,14
-DA:84,14
-DA:86,14
-DA:87,14
-DA:89,14
-DA:90,43
-DA:91,14
-DA:92,47
-DA:94,17
-DA:95,17
-DA:98,17
-DA:99,17
-DA:102,20
-DA:103,20
-DA:106,20
-DA:107,20
-BA:53,2
-BA:53,2
-BA:69,2
-BA:69,2
-LF:42
-LH:41
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/popcon/maint/path.h
-FN:38,_ZN3ept6popcon4PathC1Ev
-DA:38,1
-LF:1
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/string.h
-FN:236,_ZN6wibble3str8joinpathERKSsS2_
-DA:236,0
-DA:238,0
-DA:239,0
-DA:240,0
-DA:241,0
-DA:243,0
-DA:244,0
-DA:245,0
-DA:247,0
-DA:249,0
-DA:250,0
-DA:252,0
-BA:238,0
-BA:238,0
-BA:240,0
-BA:240,0
-BA:243,0
-BA:243,0
-BA:244,0
-BA:244,0
-BA:249,0
-BA:249,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/backward/auto_ptr.h
-FN:263,_ZNSt8auto_ptrI4statEC1ESt12auto_ptr_refIS0_E
-FN:214,_ZNKSt8auto_ptrI4statE3getEv
-FN:197,_ZNKSt8auto_ptrI4statEptEv
-FN:228,_ZNSt8auto_ptrI4statE7releaseEv
-FN:56,_ZNSt12auto_ptr_refI4statEC1EPS0_
-FN:278,_ZNSt8auto_ptrI4statEcvSt12auto_ptr_refIT_EIS0_EEv
-FN:173,_ZNSt8auto_ptrI4statED1Ev
-DA:56,0
-DA:173,0
-DA:197,0
-DA:200,0
-DA:214,0
-DA:228,0
-DA:230,0
-DA:231,0
-DA:232,0
-DA:263,0
-DA:264,0
-DA:278,0
-DA:279,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaIcED1Ev
-FN:100,_ZNSaIcEC1ERKS_
-FN:100,_ZNSaIcEC2ERKS_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:277,_ZNKSs7_M_dataEv
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:701,_ZNKSsixEj
-FN:1534,_ZNKSs5c_strEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:1551,_ZNKSs13get_allocatorEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:306,_ZNKSs8_M_checkEjPKc
-FN:1923,_ZNKSs6substrEjj
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2136,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S3_
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-FN:501,_ZNSsaSERKSs
-FN:928,_ZNSs6assignEPKc
-FN:509,_ZNSsaSEPKc
-DA:178,0
-DA:183,0
-DA:184,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:306,0
-DA:308,0
-DA:309,0
-DA:310,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:509,0
-DA:510,0
-DA:606,0
-DA:607,0
-DA:686,0
-DA:687,0
-DA:701,0
-DA:704,0
-DA:928,0
-DA:931,0
-DA:1534,0
-DA:1535,0
-DA:1551,0
-DA:1552,0
-DA:1923,0
-DA:1925,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2136,0
-DA:2140,0
-DA:2141,0
-DA:2142,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:308,0
-BA:308,0
-LF:53
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-DA:261,0
-DA:262,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-DA:69,0
-DA:71,0
-DA:76,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/popcon/maint/popconindexer.cc
-FN:79,_ZNK3ept6popcon13PopconIndexer12needsRebuildEv
-FN:101,_ZNK3ept6popcon13PopconIndexer20userIndexIsRedundantEv
-FN:24,_ZN3ept6popcon13StructIndexerINS0_10InfoStructEEC1ERKS2_
-FN:26,_ZNK3ept6popcon13StructIndexerINS0_10InfoStructEE11encodedSizeEv
-FN:27,_ZNK3ept6popcon13StructIndexerINS0_10InfoStructEE6encodeEPc
-FN:245,_Z41__static_initialization_and_destruction_0ii
-FN:245,_GLOBAL__I_popconindexer.cc
-FN:201,_ZN3ept6popcon13PopconIndexer17getUpToDatePopconERSsS2_
-FN:181,_ZN3ept6popcon13PopconIndexer24deleteRedundantUserIndexEv
-FN:32,_ZN3ept6popcon15PopconGeneratorC1Ev
-FN:32,_ZN3ept6popcon15PopconGeneratorD0Ev
-FN:22,_ZN3ept6popcon13StructIndexerINS0_10InfoStructEED0Ev
-FN:22,_ZN3ept6popcon13StructIndexerINS0_10InfoStructEED1Ev
-FN:32,_ZN3ept6popcon15PopconGeneratorD1Ev
-FN:115,_ZN3ept6popcon13PopconIndexer7rebuildERKSsS3_
-FN:151,_ZN3ept6popcon13PopconIndexer15rebuildIfNeededEv
-FN:45,_ZNK3ept6popcon15PopconGenerator6encodeEPc
-FN:36,_ZNK3ept6popcon15PopconGenerator11encodedSizeEv
-FN:69,_ZN3ept6popcon13PopconIndexer6rescanEv
-FN:62,_ZN3ept6popcon13PopconIndexerC1Ev
-FN:234,_ZN3ept6popcon13PopconIndexer19obtainWorkingPopconERSsS2_
-FN:62,_ZN3ept6popcon13PopconIndexerC2Ev
-DA:22,1
-DA:24,1
-DA:26,1
-DA:27,1
-DA:32,4
-DA:36,1
-DA:38,1
-DA:39,69911
-DA:41,69910
-DA:42,1
-DA:45,1
-DA:47,1
-DA:48,1
-DA:49,69911
-DA:52,69910
-DA:53,69910
-DA:54,69910
-DA:55,69910
-DA:56,69910
-DA:58,1
-DA:62,7
-DA:64,7
-DA:66,7
-DA:67,7
-DA:69,7
-DA:71,7
-DA:72,7
-DA:73,7
-DA:74,14
-DA:75,14
-DA:76,14
-DA:77,7
-DA:79,7
-DA:82,7
-DA:83,2
-DA:86,5
-DA:87,5
-DA:90,0
-DA:91,0
-DA:95,0
-DA:96,0
-DA:98,0
-DA:101,7
-DA:104,7
-DA:105,1
-DA:109,6
-DA:110,0
-DA:112,6
-DA:115,2
-DA:117,2
-DA:119,2
-DA:120,2
-DA:121,1
-DA:122,2
-DA:123,1
-DA:125,1
-DA:128,1
-DA:129,1
-DA:130,1
-DA:131,1
-DA:139,1
-DA:140,1
-DA:141,0
-DA:142,69911
-DA:145,69910
-DA:147,1
-DA:148,1
-DA:151,7
-DA:153,7
-DA:156,2
-DA:160,2
-DA:161,1
-DA:162,1
-DA:163,2
-DA:164,2
-DA:165,1
-DA:166,1
-DA:167,1
-DA:169,0
-DA:170,0
-DA:171,0
-DA:172,0
-DA:173,0
-DA:174,0
-DA:176,1
-DA:178,5
-DA:181,7
-DA:183,7
-DA:186,6
-DA:188,0
-DA:189,0
-DA:191,6
-DA:193,0
-DA:194,0
-DA:196,6
-DA:198,1
-DA:201,7
-DA:204,7
-DA:205,1
-DA:208,6
-DA:211,6
-DA:212,12
-DA:213,6
-DA:218,0
-DA:219,0
-DA:222,0
-DA:225,0
-DA:226,0
-DA:227,0
-DA:230,0
-DA:234,7
-DA:236,7
-DA:238,7
-DA:239,7
-DA:240,7
-DA:245,6
-BA:22,0
-BA:22,0
-BA:22,1
-BA:22,2
-BA:32,0
-BA:32,0
-BA:32,1
-BA:32,2
-BA:39,2
-BA:39,2
-BA:49,2
-BA:49,2
-BA:82,2
-BA:82,2
-BA:82,2
-BA:82,1
-BA:82,1
-BA:82,2
-BA:82,0
-BA:82,0
-BA:86,2
-BA:86,1
-BA:86,2
-BA:86,1
-BA:86,2
-BA:86,1
-BA:90,0
-BA:90,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:104,2
-BA:104,2
-BA:109,1
-BA:109,2
-BA:120,2
-BA:120,2
-BA:122,2
-BA:122,2
-BA:140,1
-BA:140,2
-BA:142,2
-BA:142,2
-BA:153,2
-BA:153,2
-BA:156,2
-BA:156,1
-BA:160,2
-BA:160,2
-BA:164,2
-BA:164,1
-BA:166,2
-BA:166,1
-BA:171,0
-BA:171,0
-BA:183,2
-BA:183,2
-BA:186,1
-BA:186,2
-BA:191,1
-BA:191,2
-BA:204,2
-BA:204,2
-BA:204,2
-BA:204,1
-BA:204,2
-BA:204,1
-BA:204,2
-BA:204,1
-BA:208,2
-BA:208,1
-BA:208,2
-BA:208,1
-BA:208,2
-BA:208,1
-BA:218,0
-BA:218,0
-BA:222,0
-BA:222,0
-BA:222,0
-BA:222,0
-BA:222,0
-BA:222,0
-BA:245,2
-BA:245,1
-BA:245,2
-BA:245,1
-LF:116
-LH:92
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/popcon/maint/popconindexer.h
-FN:49,_ZNK3ept6popcon13PopconIndexer15sourceTimestampEv
-FN:39,_ZN3ept6popcon13PopconIndexerD1Ev
-DA:39,7
-DA:49,28
-DA:51,28
-DA:52,28
-DA:53,28
-BA:52,1
-BA:52,2
-LF:5
-LH:5
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/popcon/maint/sourcedir.h
-FN:39,_ZN3ept6popcon9SourceDirD1Ev
-FN:48,_ZN3ept6popcon9SourceDirC1ERKSs
-DA:39,14
-DA:48,14
-LF:2
-LH:2
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/exception.h
-FN:190,_ZNK6wibble9exception7Generic4typeEv
-FN:406,_ZNK6wibble9exception6System4codeEv
-FN:428,_ZNK6wibble9exception4File4typeEv
-FN:137,_ZN6wibble9exception7ContextD2Ev
-FN:213,_ZNK6wibble9exception7Generic4whatEv
-FN:193,_ZNK6wibble9exception7Generic4descEv
-FN:154,_ZNK6wibble9exception7Context13formatContextEv
-FN:205,_ZNK6wibble9exception7Generic8fullInfoEv
-FN:430,_ZNK6wibble9exception4File4descEv
-FN:187,_ZN6wibble9exception7GenericD2Ev
-FN:395,_ZN6wibble9exception6SystemD2Ev
-FN:424,_ZN6wibble9exception4FileC1ERKSsS3_
-FN:426,_ZN6wibble9exception4FileD0Ev
-FN:426,_ZN6wibble9exception4FileD1Ev
-FN:187,_ZN6wibble9exception7GenericD0Ev
-FN:187,_ZN6wibble9exception7GenericD1Ev
-DA:137,0
-DA:154,0
-DA:155,0
-DA:156,0
-DA:157,0
-DA:159,0
-DA:161,0
-DA:162,0
-DA:163,0
-DA:187,0
-DA:190,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:205,0
-DA:206,0
-DA:207,0
-DA:209,0
-DA:210,0
-DA:213,0
-DA:395,0
-DA:406,0
-DA:424,0
-DA:425,0
-DA:426,0
-DA:428,0
-DA:430,0
-BA:156,0
-BA:156,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:207,0
-BA:207,0
-BA:395,0
-BA:395,0
-BA:426,0
-BA:426,0
-BA:426,0
-BA:426,0
-LF:27
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/sys/fs.h
-FN:50,_ZN6wibble3sys2fs9DirectoryD2Ev
-FN:111,_ZN6wibble3sys2fs9DirectoryC2ERKSs
-DA:50,0
-DA:111,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:106,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsN3ept6popcon5ScoreEEEED2Ev
-FN:100,_ZNSaIcEC1ERKS_
-FN:100,_ZNSaIcEC2ERKS_
-FN:106,_ZNSaISsED2Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeISt4pairIKSsN3ept6popcon5ScoreEEEEC2Ev
-FN:106,_ZNSaISt4pairIKSsN3ept6popcon5ScoreEEED1Ev
-FN:104,_ZNSaISt4pairIKSsN3ept6popcon5ScoreEEEC1ISt13_Rb_tree_nodeIS4_EEERKSaIT_E
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,2
-DA:100,0
-DA:101,0
-DA:104,0
-DA:106,2
-DA:118,0
-DA:119,0
-LF:7
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:276,0
-BA:276,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:277,_ZNKSs7_M_dataEv
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:612,_ZNKSs6lengthEv
-FN:1534,_ZNKSs5c_strEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:1551,_ZNKSs13get_allocatorEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:501,_ZNSsaSERKSs
-FN:2162,_ZSteqIcEN9__gnu_cxx11__enable_ifIXsrSt9__is_charIT_E7__valueEbE6__typeERKSbIS3_St11char_traitsIS3_ESaIS3_EESC_
-FN:2201,_ZStneIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:835,_ZNSs6appendEPKc
-FN:2121,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:612,0
-DA:613,0
-DA:686,0
-DA:687,0
-DA:835,0
-DA:838,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2121,0
-DA:2123,0
-DA:2124,0
-DA:2125,0
-DA:2162,0
-DA:2165,0
-DA:2201,0
-DA:2202,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-LF:71
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:16
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:257,0
-DA:258,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb0EE3__bES7_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb1EE3__bES7_
-FN:268,_ZNSt12__niter_baseISt16ostream_iteratorISscSt11char_traitsIcEELb0EE3__bES3_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPKSsSt16ostream_iteratorISscSt11char_traitsIcEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPKSsSt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_SD_SC_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET0_T_SD_SC_
-DA:268,0
-DA:269,0
-DA:276,0
-DA:277,0
-DA:286,0
-DA:287,0
-DA:337,0
-DA:340,0
-DA:342,0
-DA:343,0
-DA:344,0
-DA:346,0
-DA:385,0
-DA:393,0
-DA:396,0
-DA:430,0
-DA:435,0
-DA:456,0
-DA:466,0
-BA:340,0
-BA:340,0
-LF:19
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-DA:87,0
-DA:88,0
-DA:97,0
-DA:101,0
-DA:103,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-BA:101,0
-BA:101,0
-LF:9
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEC1ERKS2_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-DA:683,0
-DA:747,0
-DA:748,0
-DA:769,0
-DA:770,0
-LF:5
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,0
-DA:166,0
-DA:167,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_map.h
-FN:389,_ZNKSt3mapISsN3ept6popcon5ScoreESt4lessISsESaISt4pairIKSsS2_EEE4sizeEv
-FN:384,_ZNKSt3mapISsN3ept6popcon5ScoreESt4lessISsESaISt4pairIKSsS2_EEE5emptyEv
-FN:284,_ZNKSt3mapISsN3ept6popcon5ScoreESt4lessISsESaISt4pairIKSsS2_EEE5beginEv
-FN:302,_ZNKSt3mapISsN3ept6popcon5ScoreESt4lessISsESaISt4pairIKSsS2_EEE3endEv
-FN:275,_ZNSt3mapISsN3ept6popcon5ScoreESt4lessISsESaISt4pairIKSsS2_EEE5beginEv
-FN:293,_ZNSt3mapISsN3ept6popcon5ScoreESt4lessISsESaISt4pairIKSsS2_EEE3endEv
-FN:155,_ZNSt3mapISsN3ept6popcon5ScoreESt4lessISsESaISt4pairIKSsS2_EEEC1Ev
-FN:92,_ZNSt3mapISsN3ept6popcon5ScoreESt4lessISsESaISt4pairIKSsS2_EEED1Ev
-DA:92,2
-DA:155,2
-DA:156,2
-DA:275,1
-DA:276,1
-DA:284,2
-DA:285,2
-DA:293,69911
-DA:294,69911
-DA:302,139822
-DA:303,139822
-DA:384,2
-DA:385,2
-DA:389,2
-DA:390,2
-LF:15
-LH:15
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_pair.h
-FN:73,_ZNSt4pairIKSsN3ept6popcon5ScoreEED1Ev
-DA:73,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_tree.h
-FN:289,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKSsN3ept6popcon5ScoreEEEneERKS6_
-FN:251,_ZNKSt23_Rb_tree_const_iteratorISt4pairIKSsN3ept6popcon5ScoreEEEptEv
-FN:243,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsN3ept6popcon5ScoreEEEC1ERKSt17_Rb_tree_iteratorIS5_E
-FN:641,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept6popcon5ScoreEESt10_Select1stIS5_ESt4lessISsESaIS5_EE4sizeEv
-FN:452,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept6popcon5ScoreEESt10_Select1stIS5_ESt4lessISsESaIS5_EE8_M_beginEv
-FN:637,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept6popcon5ScoreEESt10_Select1stIS5_ESt4lessISsESaIS5_EE5emptyEv
-FN:240,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsN3ept6popcon5ScoreEEEC1EPKSt13_Rb_tree_nodeIS5_E
-FN:603,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept6popcon5ScoreEESt10_Select1stIS5_ESt4lessISsESaIS5_EE5beginEv
-FN:614,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept6popcon5ScoreEESt10_Select1stIS5_ESt4lessISsESaIS5_EE3endEv
-FN:398,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept6popcon5ScoreEESt10_Select1stIS5_ESt4lessISsESaIS5_EE13_Rb_tree_implIS9_Lb0EED1Ev
-FN:487,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept6popcon5ScoreEESt10_Select1stIS5_ESt4lessISsESaIS5_EE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept6popcon5ScoreEESt10_Select1stIS5_ESt4lessISsESaIS5_EE7_S_leftEPSt18_Rb_tree_node_base
-FN:168,_ZNSt17_Rb_tree_iteratorISt4pairIKSsN3ept6popcon5ScoreEEEC1EPSt13_Rb_tree_nodeIS5_E
-FN:596,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept6popcon5ScoreEESt10_Select1stIS5_ESt4lessISsESaIS5_EE5beginEv
-FN:610,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept6popcon5ScoreEESt10_Select1stIS5_ESt4lessISsESaIS5_EE3endEv
-FN:415,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept6popcon5ScoreEESt10_Select1stIS5_ESt4lessISsESaIS5_EE13_Rb_tree_implIS9_Lb0EE13_M_initializeEv
-FN:403,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept6popcon5ScoreEESt10_Select1stIS5_ESt4lessISsESaIS5_EE13_Rb_tree_implIS9_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept6popcon5ScoreEESt10_Select1stIS5_ESt4lessISsESaIS5_EEC1Ev
-FN:347,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept6popcon5ScoreEESt10_Select1stIS5_ESt4lessISsESaIS5_EE21_M_get_Node_allocatorEv
-FN:351,_ZNKSt8_Rb_treeISsSt4pairIKSsN3ept6popcon5ScoreEESt10_Select1stIS5_ESt4lessISsESaIS5_EE13get_allocatorEv
-FN:360,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept6popcon5ScoreEESt10_Select1stIS5_ESt4lessISsESaIS5_EE11_M_put_nodeEPSt13_Rb_tree_nodeIS5_E
-FN:388,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept6popcon5ScoreEESt10_Select1stIS5_ESt4lessISsESaIS5_EE15_M_destroy_nodeEPSt13_Rb_tree_nodeIS5_E
-FN:936,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept6popcon5ScoreEESt10_Select1stIS5_ESt4lessISsESaIS5_EE8_M_eraseEPSt13_Rb_tree_nodeIS5_E
-FN:584,_ZNSt8_Rb_treeISsSt4pairIKSsN3ept6popcon5ScoreEESt10_Select1stIS5_ESt4lessISsESaIS5_EED1Ev
-FN:255,_ZNSt23_Rb_tree_const_iteratorISt4pairIKSsN3ept6popcon5ScoreEEEppEv
-DA:168,0
-DA:169,0
-DA:240,139824
-DA:241,139824
-DA:243,69912
-DA:244,69912
-DA:251,489370
-DA:252,489370
-DA:255,209730
-DA:257,209730
-DA:258,209730
-DA:289,209733
-DA:290,209733
-DA:347,0
-DA:348,0
-DA:351,0
-DA:352,0
-DA:360,0
-DA:361,0
-DA:388,69910
-DA:390,69910
-DA:391,69910
-DA:392,69910
-DA:398,2
-DA:403,2
-DA:405,2
-DA:406,2
-DA:415,2
-DA:417,2
-DA:418,2
-DA:419,2
-DA:420,2
-DA:421,2
-DA:452,0
-DA:453,0
-DA:479,0
-DA:480,0
-DA:487,0
-DA:488,0
-DA:562,2
-DA:584,2
-DA:585,2
-DA:596,0
-DA:599,0
-DA:603,2
-DA:606,2
-DA:610,69911
-DA:611,69911
-DA:614,139822
-DA:617,139822
-DA:637,2
-DA:638,2
-DA:641,2
-DA:642,2
-DA:936,69912
-DA:939,209734
-DA:941,69910
-DA:942,69910
-DA:943,69910
-DA:944,69910
-DA:946,69912
-BA:939,2
-BA:939,2
-LF:61
-LH:45
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:404,_ZNKSt6vectorISsSaISsEE3endEv
-FN:386,_ZNKSt6vectorISsSaISsEE5beginEv
-FN:526,_ZNKSt6vectorISsSaISsEE5emptyEv
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-DA:79,0
-DA:97,0
-DA:98,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:299,0
-DA:300,0
-DA:301,0
-DA:386,0
-DA:387,0
-DA:404,0
-DA:405,0
-DA:526,0
-DA:527,0
-BA:149,0
-BA:149,0
-LF:19
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stream_iterator.h
-FN:181,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERSoPKc
-FN:185,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERKS2_
-FN:202,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEdeEv
-FN:206,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEppEv
-FN:191,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEaSERKSs
-DA:181,0
-DA:182,0
-DA:185,0
-DA:186,0
-DA:191,0
-DA:196,0
-DA:197,0
-DA:198,0
-DA:202,0
-DA:203,0
-DA:206,0
-DA:207,0
-BA:197,0
-BA:197,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept6popcon5ScoreEEEED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept6popcon5ScoreEEEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN3ept6popcon5ScoreEEED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN3ept6popcon5ScoreEEEC2Ev
-FN:118,_ZN9__gnu_cxx13new_allocatorISt4pairIKSsN3ept6popcon5ScoreEEE7destroyEPS6_
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISt4pairIKSsN3ept6popcon5ScoreEEEE10deallocateEPS8_j
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-DA:69,2
-DA:71,0
-DA:76,2
-DA:97,0
-DA:98,0
-DA:118,69910
-LF:6
-LH:3
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,2
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/istream
-FN:585,_ZNSiC2Ev
-FN:105,_ZNSiD2Ev
-FN:804,_ZNSdC2Ev
-FN:801,_ZNSdD2Ev
-DA:105,0
-DA:106,0
-DA:585,0
-DA:586,0
-DA:587,0
-DA:801,0
-DA:804,0
-DA:805,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-DA:95,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:509,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:536,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:555,_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:509,0
-DA:510,0
-DA:511,0
-DA:536,0
-DA:537,0
-DA:555,0
-DA:556,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/tagcoll-2.0.11/tagcoll/diskindex/mmap.h
-FN:89,_ZN7tagcoll9diskindex11MMapIndexerC2Ev
-FN:79,_ZN7tagcoll9diskindex4MMap5alignIiEET_S3_
-FN:91,_ZN7tagcoll9diskindex11MMapIndexerD0Ev
-FN:91,_ZN7tagcoll9diskindex11MMapIndexerD1Ev
-FN:91,_ZN7tagcoll9diskindex11MMapIndexerD2Ev
-DA:79,0
-DA:81,0
-DA:89,0
-DA:91,0
-BA:91,0
-BA:91,0
-BA:91,0
-BA:91,0
-BA:91,0
-BA:91,0
-LF:4
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/apt/packagerecord.cc
-FN:69,_ZNK3ept3apt13PackageRecord9parseTagsERKSt3setISsSt4lessISsESaISsEERKSs
-FN:42,_ZNK3ept3apt13PackageRecord21parseShortDescriptionERKSsS3_
-FN:53,_ZNK3ept3apt13PackageRecord20parseLongDescriptionERKSsS3_
-FN:35,_ZNK3ept3apt13PackageRecord9parseSizeEjRKSs
-DA:35,5210
-DA:37,5210
-DA:38,54
-DA:39,5156
-DA:42,1
-DA:44,1
-DA:45,0
-DA:46,1
-DA:47,1
-DA:48,0
-DA:50,1
-DA:53,1
-DA:55,1
-DA:56,0
-DA:57,1
-DA:58,1
-DA:59,0
-DA:63,1
-DA:65,1
-DA:69,2605
-DA:71,2605
-DA:72,2604
-DA:74,1
-DA:76,1
-DA:77,13
-DA:79,12
-DA:80,12
-DA:81,12
-DA:82,1
-DA:84,11
-DA:87,12
-DA:89,1
-DA:90,1
-DA:92,1
-DA:93,1
-DA:95,4
-DA:97,2
-DA:98,2
-DA:100,1
-DA:103,11
-DA:106,12
-DA:107,1
-DA:109,11
-DA:112,1
-BA:37,2
-BA:37,2
-BA:44,1
-BA:44,2
-BA:47,1
-BA:47,2
-BA:55,1
-BA:55,2
-BA:58,1
-BA:58,2
-BA:63,2
-BA:63,1
-BA:63,2
-BA:63,2
-BA:63,2
-BA:63,2
-BA:71,2
-BA:71,2
-BA:77,2
-BA:77,2
-BA:77,2
-BA:77,1
-BA:81,2
-BA:81,2
-BA:87,2
-BA:87,2
-BA:90,2
-BA:90,1
-BA:95,2
-BA:95,2
-BA:106,2
-BA:106,2
-LF:44
-LH:40
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaISt13_Rb_tree_nodeISsEED2Ev
-FN:98,_ZNSaISt13_Rb_tree_nodeISsEEC2Ev
-FN:100,_ZNSaISt13_Rb_tree_nodeISsEEC2ERKS1_
-FN:106,_ZNSaISsED1Ev
-FN:104,_ZNSaISsEC1ISt13_Rb_tree_nodeISsEEERKSaIT_E
-DA:98,0
-DA:100,0
-DA:101,0
-DA:104,0
-DA:106,0
-LF:5
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:277,_ZNKSs7_M_dataEv
-FN:1544,_ZNKSs4dataEv
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:701,_ZNKSsixEj
-FN:1534,_ZNKSs5c_strEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:188,_ZNKSs4_Rep12_M_is_leakedEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:392,_ZNSs10_S_compareEjj
-FN:2162,_ZSteqIcEN9__gnu_cxx11__enable_ifIXsrSt9__is_charIT_E7__valueEbE6__typeERKSbIS3_St11char_traitsIS3_ESaIS3_EESC_
-FN:1941,_ZNKSs7compareERKSs
-FN:2238,_ZStltIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:1593,_ZNKSs4findEPKcj
-FN:501,_ZNSsaSERKSs
-FN:299,_ZNSs7_M_leakEv
-FN:718,_ZNSsixEj
-FN:306,_ZNKSs8_M_checkEjPKc
-FN:1923,_ZNKSs6substrEjj
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-DA:178,0
-DA:183,0
-DA:184,0
-DA:188,0
-DA:189,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:299,0
-DA:301,0
-DA:302,0
-DA:303,0
-DA:306,0
-DA:308,0
-DA:309,0
-DA:310,0
-DA:392,0
-DA:394,0
-DA:401,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:701,0
-DA:704,0
-DA:718,0
-DA:724,0
-DA:725,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:1593,0
-DA:1596,0
-DA:1923,0
-DA:1925,0
-DA:1941,0
-DA:1943,0
-DA:1944,0
-DA:1945,0
-DA:1947,0
-DA:1948,0
-DA:1949,0
-DA:1950,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2162,0
-DA:2165,0
-DA:2238,0
-DA:2239,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:301,0
-BA:301,0
-BA:308,0
-BA:308,0
-BA:1948,0
-BA:1948,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-LF:71
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-DA:257,0
-DA:258,0
-DA:261,0
-DA:262,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:188,_ZSt3minIjERKT_S2_S2_
-DA:188,0
-DA:193,0
-DA:194,0
-DA:195,0
-BA:193,0
-BA:193,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_function.h
-FN:469,_ZNKSt9_IdentityISsEclERKSs
-FN:229,_ZNKSt4lessISsEclERKSsS2_
-DA:229,0
-DA:230,0
-DA:469,0
-DA:470,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_pair.h
-FN:88,_ZNSt4pairISt23_Rb_tree_const_iteratorISsEbEC1ERKS1_RKb
-FN:88,_ZNSt4pairISt17_Rb_tree_iteratorISsEbEC1ERKS1_RKb
-DA:88,0
-DA:89,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_set.h
-FN:141,_ZNSt3setISsSt4lessISsESaISsEEC1Ev
-FN:378,_ZNSt3setISsSt4lessISsESaISsEE6insertERKSs
-FN:193,_ZNSt3setISsSt4lessISsESaISsEEC1ERKS3_
-FN:93,_ZNSt3setISsSt4lessISsESaISsEED1Ev
-DA:93,0
-DA:141,0
-DA:142,0
-DA:193,0
-DA:194,0
-DA:378,0
-DA:381,0
-DA:382,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_tree.h
-FN:103,_ZNSt18_Rb_tree_node_base10_S_minimumEPS_
-FN:117,_ZNSt18_Rb_tree_node_base10_S_maximumEPS_
-FN:243,_ZNSt23_Rb_tree_const_iteratorISsEC1ERKSt17_Rb_tree_iteratorISsE
-FN:452,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_beginEv
-FN:347,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE21_M_get_Node_allocatorEv
-FN:432,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_M_rootEv
-FN:456,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_beginEv
-FN:463,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_M_endEv
-FN:428,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_M_rootEv
-FN:503,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE10_S_minimumEPSt18_Rb_tree_node_base
-FN:436,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11_M_leftmostEv
-FN:511,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE10_S_maximumEPSt18_Rb_tree_node_base
-FN:444,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE12_M_rightmostEv
-FN:487,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_rightEPSt18_Rb_tree_node_base
-FN:479,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_S_leftEPSt18_Rb_tree_node_base
-FN:168,_ZNSt17_Rb_tree_iteratorISsEC1EPSt13_Rb_tree_nodeISsE
-FN:596,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE5beginEv
-FN:210,_ZNKSt17_Rb_tree_iteratorISsEeqERKS0_
-FN:415,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EE13_M_initializeEv
-FN:398,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EED1Ev
-FN:491,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_rightEPKSt18_Rb_tree_node_base
-FN:483,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_S_leftEPKSt18_Rb_tree_node_base
-FN:471,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_valueEPKSt13_Rb_tree_nodeISsE
-FN:475,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_S_keyEPKSt13_Rb_tree_nodeISsE
-FN:495,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_S_valueEPKSt18_Rb_tree_node_base
-FN:499,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE6_S_keyEPKSt18_Rb_tree_node_base
-FN:403,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EEC1Ev
-FN:562,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEEC1Ev
-FN:408,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_Rb_tree_implIS3_Lb0EEC1ERKS3_RKSaISt13_Rb_tree_nodeISsEE
-FN:351,_ZNKSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13get_allocatorEv
-FN:195,_ZNSt17_Rb_tree_iteratorISsEmmEv
-FN:356,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11_M_get_nodeEv
-FN:360,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE11_M_put_nodeEPSt13_Rb_tree_nodeISsE
-FN:364,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE14_M_create_nodeERKSs
-FN:846,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE10_M_insert_EPKSt18_Rb_tree_node_baseS8_RKSs
-FN:1133,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE16_M_insert_uniqueERKSs
-FN:378,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE13_M_clone_nodeEPKSt13_Rb_tree_nodeISsE
-FN:388,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE15_M_destroy_nodeEPSt13_Rb_tree_nodeISsE
-FN:936,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE8_M_eraseEPSt13_Rb_tree_nodeISsE
-FN:900,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEE7_M_copyEPKSt13_Rb_tree_nodeISsEPS7_
-FN:568,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEEC1ERKS5_
-FN:584,_ZNSt8_Rb_treeISsSsSt9_IdentityISsESt4lessISsESaISsEED1Ev
-DA:103,0
-DA:105,0
-DA:106,0
-DA:117,0
-DA:119,0
-DA:120,0
-DA:168,0
-DA:169,0
-DA:195,0
-DA:197,0
-DA:198,0
-DA:210,0
-DA:211,0
-DA:243,0
-DA:244,0
-DA:347,0
-DA:348,0
-DA:351,0
-DA:352,0
-DA:356,0
-DA:357,0
-DA:360,0
-DA:361,0
-DA:364,0
-DA:366,0
-DA:368,0
-DA:369,0
-DA:371,0
-DA:372,0
-DA:374,0
-DA:378,0
-DA:380,0
-DA:381,0
-DA:382,0
-DA:383,0
-DA:384,0
-DA:388,0
-DA:390,0
-DA:391,0
-DA:392,0
-DA:398,0
-DA:403,0
-DA:405,0
-DA:406,0
-DA:408,0
-DA:410,0
-DA:411,0
-DA:415,0
-DA:417,0
-DA:418,0
-DA:419,0
-DA:420,0
-DA:421,0
-DA:428,0
-DA:429,0
-DA:432,0
-DA:433,0
-DA:436,0
-DA:437,0
-DA:444,0
-DA:445,0
-DA:452,0
-DA:453,0
-DA:456,0
-DA:459,0
-DA:463,0
-DA:464,0
-DA:471,0
-DA:472,0
-DA:475,0
-DA:476,0
-DA:479,0
-DA:480,0
-DA:483,0
-DA:484,0
-DA:487,0
-DA:488,0
-DA:491,0
-DA:492,0
-DA:495,0
-DA:496,0
-DA:499,0
-DA:500,0
-DA:503,0
-DA:504,0
-DA:511,0
-DA:512,0
-DA:562,0
-DA:568,0
-DA:569,0
-DA:571,0
-DA:573,0
-DA:574,0
-DA:575,0
-DA:576,0
-DA:578,0
-DA:584,0
-DA:585,0
-DA:596,0
-DA:599,0
-DA:846,0
-DA:850,0
-DA:852,0
-DA:854,0
-DA:857,0
-DA:858,0
-DA:900,0
-DA:903,0
-DA:904,0
-DA:908,0
-DA:909,0
-DA:910,0
-DA:911,0
-DA:913,0
-DA:915,0
-DA:916,0
-DA:917,0
-DA:918,0
-DA:919,0
-DA:920,0
-DA:921,0
-DA:924,0
-DA:926,0
-DA:927,0
-DA:929,0
-DA:936,0
-DA:939,0
-DA:941,0
-DA:942,0
-DA:943,0
-DA:944,0
-DA:946,0
-DA:1133,0
-DA:1135,0
-DA:1136,0
-DA:1137,0
-DA:1138,0
-DA:1140,0
-DA:1141,0
-DA:1142,0
-DA:1144,0
-DA:1145,0
-DA:1147,0
-DA:1148,0
-DA:1150,0
-DA:1152,0
-DA:1153,0
-DA:1154,0
-BA:105,0
-BA:105,0
-BA:119,0
-BA:119,0
-BA:571,0
-BA:571,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:850,0
-BA:908,0
-BA:908,0
-BA:913,0
-BA:913,0
-BA:918,0
-BA:918,0
-BA:939,0
-BA:939,0
-BA:1138,0
-BA:1138,0
-BA:1142,0
-BA:1142,0
-BA:1145,0
-BA:1145,0
-BA:1147,0
-BA:1147,0
-BA:1152,0
-BA:1152,0
-LF:148
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEEC2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEEC2ERKS3_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE8max_sizeEv
-FN:107,_ZN9__gnu_cxx13new_allocatorISsE9constructEPSsRKSs
-FN:87,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE8allocateEjPKv
-FN:97,_ZN9__gnu_cxx13new_allocatorISt13_Rb_tree_nodeISsEE10deallocateEPS2_j
-FN:118,_ZN9__gnu_cxx13new_allocatorISsE7destroyEPSs
-DA:69,0
-DA:71,0
-DA:76,0
-DA:87,0
-DA:89,0
-DA:90,0
-DA:92,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:107,0
-DA:108,0
-DA:118,0
-BA:89,0
-BA:89,0
-BA:108,0
-BA:108,0
-LF:14
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/apt/recordparser.cc
-FN:38,_ZN3ept3apt9rpcompareC1ERKNS0_12RecordParserE
-FN:110,_ZNK3ept3apt12RecordParser5fieldEj
-FN:129,_ZNK3ept3apt12RecordParser6lookupEj
-FN:120,_ZNK3ept3apt12RecordParser4nameEj
-FN:145,_ZNK3ept3apt12RecordParser5indexERKSs
-FN:39,_ZN3ept3apt9rpcompareclEjj
-FN:45,_ZN3ept3apt12RecordParser4scanERKSs
-DA:38,2618
-DA:39,177724
-DA:41,177724
-DA:45,2618
-DA:47,2618
-DA:48,2618
-DA:49,2618
-DA:54,2618
-DA:55,2618
-DA:56,59427
-DA:59,56809
-DA:63,56809
-DA:66,1
-DA:67,1
-DA:68,1
-DA:69,1
-DA:72,56808
-DA:76,56808
-DA:79,11
-DA:80,11
-DA:81,11
-DA:85,56797
-DA:88,2606
-DA:89,2606
-DA:90,2606
-DA:94,54191
-DA:97,34233
-DA:98,34233
-DA:104,2618
-DA:108,2618
-DA:110,465183
-DA:112,465183
-DA:113,2664
-DA:114,462519
-DA:115,52771
-DA:117,409748
-DA:120,446879
-DA:122,446879
-DA:123,446879
-DA:124,446879
-DA:125,1
-DA:126,446878
-DA:129,18279
-DA:131,18279
-DA:132,18279
-DA:133,18279
-DA:134,2662
-DA:136,15617
-DA:138,15617
-DA:140,46850
-DA:141,15616
-DA:142,15617
-DA:145,18283
-DA:150,18283
-DA:151,109703
-DA:153,73137
-DA:155,73137
-DA:156,32507
-DA:158,40630
-DA:161,18283
-DA:162,2661
-DA:164,15622
-BA:56,2
-BA:56,1
-BA:63,2
-BA:63,2
-BA:76,2
-BA:76,2
-BA:85,2
-BA:85,2
-BA:94,2
-BA:94,2
-BA:112,2
-BA:112,2
-BA:114,2
-BA:114,2
-BA:124,2
-BA:124,2
-BA:133,2
-BA:133,2
-BA:136,2
-BA:136,2
-BA:136,2
-BA:136,2
-BA:136,2
-BA:136,2
-BA:140,2
-BA:140,2
-BA:140,2
-BA:140,2
-BA:140,2
-BA:140,2
-BA:151,2
-BA:151,2
-BA:155,2
-BA:155,2
-BA:161,2
-BA:161,1
-BA:161,2
-BA:161,2
-BA:161,2
-BA:161,1
-BA:161,0
-BA:161,0
-BA:161,2
-BA:161,2
-LF:62
-LH:62
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/apt/recordparser.h
-FN:88,_ZNK3ept3apt12RecordParser4sizeEv
-DA:88,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:100,_ZNSaIcEC1ERKS_
-FN:100,_ZNSaIcEC2ERKS_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:277,_ZNKSs7_M_dataEv
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:1544,_ZNKSs4dataEv
-FN:392,_ZNSs10_S_compareEjj
-FN:188,_ZNKSs4_Rep12_M_is_leakedEv
-FN:1551,_ZNKSs13get_allocatorEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1941,_ZNKSs7compareERKSs
-FN:2275,_ZStgtIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:2238,_ZStltIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:2162,_ZSteqIcEN9__gnu_cxx11__enable_ifIXsrSt9__is_charIT_E7__valueEbE6__typeERKSbIS3_St11char_traitsIS3_ESaIS3_EESC_
-FN:2201,_ZStneIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:1593,_ZNKSs4findEPKcj
-FN:306,_ZNKSs8_M_checkEjPKc
-FN:1923,_ZNKSs6substrEjj
-FN:501,_ZNSsaSERKSs
-FN:644,_ZNSs6resizeEj
-FN:299,_ZNSs7_M_leakEv
-FN:718,_ZNSsixEj
-DA:178,0
-DA:183,0
-DA:184,0
-DA:188,0
-DA:189,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:299,0
-DA:301,0
-DA:302,0
-DA:303,0
-DA:306,0
-DA:308,0
-DA:309,0
-DA:310,0
-DA:392,0
-DA:394,0
-DA:401,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:644,0
-DA:645,0
-DA:686,0
-DA:687,0
-DA:718,0
-DA:724,0
-DA:725,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:1593,0
-DA:1596,0
-DA:1923,0
-DA:1925,0
-DA:1941,0
-DA:1943,0
-DA:1944,0
-DA:1945,0
-DA:1947,0
-DA:1948,0
-DA:1949,0
-DA:1950,0
-DA:2067,0
-DA:2069,0
-DA:2162,0
-DA:2165,0
-DA:2201,0
-DA:2202,0
-DA:2238,0
-DA:2239,0
-DA:2275,0
-DA:2276,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:301,0
-BA:301,0
-BA:308,0
-BA:308,0
-BA:1948,0
-BA:1948,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-LF:71
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-DA:257,0
-DA:258,0
-DA:261,0
-DA:262,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algo.h
-FN:1568,_ZSt13__heap_selectIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEN3ept3apt9rpcompareEEvT_SA_SA_T0_
-FN:4661,_ZSt12partial_sortIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEN3ept3apt9rpcompareEEvT_SA_SA_T0_
-FN:123,_ZSt8__medianIjN3ept3apt9rpcompareEERKT_S5_S5_S5_T0_
-FN:1877,_ZSt21__unguarded_partitionIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEjN3ept3apt9rpcompareEET_SA_SA_T0_T1_
-FN:1930,_ZSt16__introsort_loopIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEiN3ept3apt9rpcompareEEvT_SA_T0_T1_
-FN:1731,_ZSt25__unguarded_linear_insertIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEjN3ept3apt9rpcompareEEvT_T0_T1_
-FN:1806,_ZSt26__unguarded_insertion_sortIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEN3ept3apt9rpcompareEEvT_SA_T0_
-FN:1771,_ZSt16__insertion_sortIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEN3ept3apt9rpcompareEEvT_SA_T0_
-FN:1840,_ZSt22__final_insertion_sortIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEN3ept3apt9rpcompareEEvT_SA_T0_
-FN:1970,_ZSt4__lgi
-FN:4806,_ZSt4sortIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEN3ept3apt9rpcompareEEvT_SA_T0_
-DA:123,165
-DA:128,165
-DA:129,145
-DA:130,13
-DA:131,132
-DA:132,0
-DA:134,132
-DA:135,20
-DA:136,20
-DA:137,0
-DA:138,0
-DA:140,0
-DA:1568,0
-DA:1570,0
-DA:1571,0
-DA:1572,0
-DA:1573,0
-DA:1574,0
-DA:1731,29164
-DA:1733,29164
-DA:1734,29164
-DA:1735,169218
-DA:1737,110890
-DA:1738,110890
-DA:1739,110890
-DA:1741,29164
-DA:1742,29164
-DA:1771,2618
-DA:1773,2618
-DA:1775,36660
-DA:1778,34042
-DA:1779,34042
-DA:1781,5069
-DA:1782,5069
-DA:1785,28973
-DA:1806,164
-DA:1811,355
-DA:1812,191
-DA:1813,164
-DA:1840,2618
-DA:1842,2618
-DA:1844,164
-DA:1845,164
-DA:1849,2454
-DA:1850,2618
-DA:1877,970
-DA:1879,805
-DA:1881,2512
-DA:1882,572
-DA:1883,970
-DA:1884,2594
-DA:1885,654
-DA:1886,970
-DA:1887,165
-DA:1888,805
-DA:1889,805
-DA:1930,2783
-DA:1935,5731
-DA:1937,165
-DA:1939,0
-DA:1940,0
-DA:1942,165
-DA:1952,165
-DA:1953,165
-DA:1954,165
-DA:1970,0
-DA:1971,0
-DA:4661,0
-DA:4674,0
-DA:4675,0
-DA:4676,0
-DA:4806,2618
-DA:4818,2618
-DA:4820,2618
-DA:4822,2618
-DA:4824,2618
-BA:128,2
-BA:128,2
-BA:129,2
-BA:129,2
-BA:131,1
-BA:131,2
-BA:135,2
-BA:135,1
-BA:137,0
-BA:137,0
-BA:1571,0
-BA:1571,0
-BA:1572,0
-BA:1572,0
-BA:1735,2
-BA:1735,2
-BA:1773,2
-BA:1773,1
-BA:1775,2
-BA:1775,2
-BA:1779,2
-BA:1779,2
-BA:1811,2
-BA:1811,2
-BA:1842,2
-BA:1842,2
-BA:1881,2
-BA:1881,2
-BA:1884,2
-BA:1884,2
-BA:1886,2
-BA:1886,2
-BA:1935,2
-BA:1935,2
-BA:1937,1
-BA:1937,2
-BA:4818,2
-BA:4818,1
-LF:76
-LH:58
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:188,_ZSt3minIjERKT_S2_S2_
-FN:286,_ZNSt12__miter_baseIPjLb0EE3__bES0_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:268,_ZNSt12__niter_baseIPjLb0EE3__bES0_
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEELb0EE3__bES6_
-FN:104,_ZNSt11__iter_swapILb1EE9iter_swapIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEES8_EEvT_T0_
-FN:121,_ZSt9iter_swapIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEES6_EvT_T0_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEELb1EE3__bES6_
-FN:569,_ZNSt20__copy_move_backwardILb0ELb1ESt26random_access_iterator_tagE13__copy_move_bIjEEPT_PKS3_S6_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0EPjS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPjS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardIPjS0_ET0_T_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEES6_ET1_T0_S8_S7_
-FN:624,_ZSt13copy_backwardIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEES6_ET0_T_S8_S7_
-FN:375,_ZNSt11__copy_moveILb0ELb1ESt26random_access_iterator_tagE8__copy_mIjEEPT_PKS3_S6_S4_
-FN:385,_ZSt13__copy_move_aILb0EPjS0_ET1_T0_S2_S1_
-FN:430,_ZSt14__copy_move_a2ILb0EPjS0_ET1_T0_S2_S1_
-FN:456,_ZSt4copyIPjS0_ET0_T_S2_S1_
-DA:104,0
-DA:106,0
-DA:107,0
-DA:121,0
-DA:142,0
-DA:146,0
-DA:188,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:210,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:268,0
-DA:269,0
-DA:276,0
-DA:277,0
-DA:286,0
-DA:287,0
-DA:375,0
-DA:377,0
-DA:379,0
-DA:385,0
-DA:393,0
-DA:396,0
-DA:430,0
-DA:435,0
-DA:456,0
-DA:466,0
-DA:569,0
-DA:571,0
-DA:572,0
-DA:573,0
-DA:579,0
-DA:587,0
-DA:592,0
-DA:597,0
-DA:602,0
-DA:624,0
-DA:636,0
-BA:193,0
-BA:193,0
-BA:215,0
-BA:215,0
-LF:41
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:97,_ZSt8_DestroyIPjEvT_S1_
-FN:126,_ZSt8_DestroyIPjjEvT_S1_RSaIT0_E
-DA:97,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-LF:5
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_heap.h
-FN:177,_ZSt11__push_heapIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEijN3ept3apt9rpcompareEEvT_T0_SB_T1_T2_
-FN:295,_ZSt13__adjust_heapIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEijN3ept3apt9rpcompareEEvT_T0_SB_T1_T2_
-FN:412,_ZSt9make_heapIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEN3ept3apt9rpcompareEEvT_SA_T0_
-FN:322,_ZSt10__pop_heapIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEN3ept3apt9rpcompareEEvT_SA_SA_T0_
-FN:350,_ZSt8pop_heapIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEN3ept3apt9rpcompareEEvT_SA_T0_
-FN:477,_ZSt9sort_heapIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEN3ept3apt9rpcompareEEvT_SA_T0_
-DA:177,0
-DA:179,0
-DA:180,0
-DA:183,0
-DA:184,0
-DA:185,0
-DA:187,0
-DA:188,0
-DA:295,0
-DA:297,0
-DA:298,0
-DA:299,0
-DA:301,0
-DA:302,0
-DA:304,0
-DA:305,0
-DA:306,0
-DA:308,0
-DA:310,0
-DA:311,0
-DA:313,0
-DA:315,0
-DA:317,0
-DA:322,0
-DA:329,0
-DA:330,0
-DA:331,0
-DA:334,0
-DA:350,0
-DA:358,0
-DA:359,0
-DA:412,0
-DA:424,0
-DA:425,0
-DA:427,0
-DA:428,0
-DA:429,0
-DA:431,0
-DA:432,0
-DA:434,0
-DA:435,0
-DA:436,0
-DA:477,0
-DA:485,0
-DA:486,0
-DA:487,0
-BA:180,0
-BA:180,0
-BA:180,0
-BA:180,0
-BA:180,0
-BA:180,0
-BA:299,0
-BA:299,0
-BA:302,0
-BA:302,0
-BA:308,0
-BA:308,0
-BA:308,0
-BA:308,0
-BA:424,0
-BA:424,0
-BA:434,0
-BA:434,0
-BA:485,0
-BA:485,0
-LF:46
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEC1ERKS1_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEE4baseEv
-FN:781,_ZN9__gnu_cxxneIPjSt6vectorIjSaIjEEEEbRKNS_17__normal_iteratorIT_T0_EESA_
-FN:846,_ZN9__gnu_cxxmiIPjSt6vectorIjSaIjEEEENS_17__normal_iteratorIT_T0_E15difference_typeERKS8_SB_
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEdeEv
-FN:735,_ZNK9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEplERKi
-FN:743,_ZNK9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEmiERKi
-FN:703,_ZN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEppEv
-FN:715,_ZN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEmmEv
-FN:794,_ZN9__gnu_cxxltIPjSt6vectorIjSaIjEEEEbRKNS_17__normal_iteratorIT_T0_EESA_
-FN:769,_ZN9__gnu_cxxeqIPjSt6vectorIjSaIjEEEEbRKNS_17__normal_iteratorIT_T0_EESA_
-FN:722,_ZN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEmmEi
-DA:683,0
-DA:695,0
-DA:696,0
-DA:703,0
-DA:705,0
-DA:706,0
-DA:715,0
-DA:717,0
-DA:718,0
-DA:722,0
-DA:723,0
-DA:735,0
-DA:736,0
-DA:743,0
-DA:744,0
-DA:747,0
-DA:748,0
-DA:769,0
-DA:770,0
-DA:781,0
-DA:782,0
-DA:794,0
-DA:795,0
-DA:846,0
-DA:847,0
-LF:25
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_move.h
-FN:80,_ZSt4swapIjEvRT_S1_
-DA:80,0
-DA:85,0
-DA:86,0
-DA:87,0
-DA:88,0
-LF:5
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:97,_ZNSt20__uninitialized_copyILb1EE18uninitialized_copyIPjS2_EET0_T_S4_S3_
-FN:113,_ZSt18uninitialized_copyIPjS0_ET0_T_S2_S1_
-FN:261,_ZSt22__uninitialized_copy_aIPjS0_jET0_T_S2_S1_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPjS0_SaIjEET0_T_S3_S2_RT1_
-DA:97,0
-DA:98,0
-DA:113,0
-DA:122,0
-DA:261,0
-DA:262,0
-DA:268,0
-DA:272,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:484,_ZNKSt6vectorIjSaIjEE4sizeEv
-FN:577,_ZNKSt6vectorIjSaIjEEixEj
-FN:97,_ZNSt12_Vector_baseIjSaIjEE19_M_get_Tp_allocatorEv
-FN:395,_ZNSt6vectorIjSaIjEE3endEv
-FN:377,_ZNSt6vectorIjSaIjEE5beginEv
-FN:1089,_ZNSt6vectorIjSaIjEE15_M_erase_at_endEPj
-FN:891,_ZNSt6vectorIjSaIjEE5clearEv
-FN:101,_ZNKSt12_Vector_baseIjSaIjEE19_M_get_Tp_allocatorEv
-FN:489,_ZNKSt6vectorIjSaIjEE8max_sizeEv
-FN:1075,_ZNKSt6vectorIjSaIjEE12_M_check_lenEjPKc
-FN:143,_ZNSt12_Vector_baseIjSaIjEE11_M_allocateEj
-FN:147,_ZNSt12_Vector_baseIjSaIjEE13_M_deallocateEPjj
-FN:686,_ZNSt6vectorIjSaIjEE9push_backERKj
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:143,0
-DA:144,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:377,0
-DA:378,0
-DA:395,0
-DA:396,0
-DA:484,0
-DA:485,0
-DA:489,0
-DA:490,0
-DA:577,0
-DA:578,0
-DA:686,0
-DA:688,0
-DA:690,0
-DA:691,0
-DA:694,0
-DA:695,0
-DA:891,0
-DA:892,0
-DA:1075,0
-DA:1077,0
-DA:1078,0
-DA:1080,0
-DA:1081,0
-DA:1089,0
-DA:1091,0
-DA:1092,0
-DA:1093,0
-BA:144,0
-BA:144,0
-BA:149,0
-BA:149,0
-BA:688,0
-BA:688,0
-BA:1077,0
-BA:1077,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-LF:37
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/vector.tcc
-FN:283,_ZNSt6vectorIjSaIjEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPjS1_EERKj
-DA:283,0
-DA:286,0
-DA:288,0
-DA:291,0
-DA:293,0
-DA:295,0
-DA:299,0
-DA:307,0
-DA:308,0
-DA:309,0
-DA:316,0
-DA:321,0
-DA:323,0
-DA:324,0
-DA:330,0
-DA:332,0
-DA:333,0
-DA:334,0
-DA:336,0
-DA:338,0
-DA:341,0
-DA:342,0
-DA:343,0
-DA:345,0
-BA:286,0
-BA:286,0
-LF:24
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:107,_ZN9__gnu_cxx13new_allocatorIjE9constructEPjRKj
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:101,_ZNK9__gnu_cxx13new_allocatorIjE8max_sizeEv
-FN:87,_ZN9__gnu_cxx13new_allocatorIjE8allocateEjPKv
-FN:97,_ZN9__gnu_cxx13new_allocatorIjE10deallocateEPjj
-DA:69,0
-DA:71,0
-DA:76,0
-DA:87,0
-DA:89,0
-DA:90,0
-DA:92,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:107,0
-DA:108,0
-BA:89,0
-BA:89,0
-BA:108,0
-BA:108,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-DA:105,0
-LF:1
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/apt/version.cc
-FN:85,_Z41__static_initialization_and_destruction_0ii
-FN:85,_GLOBAL__I_version.cc
-FN:75,_ZNK3ept3apt7VersiongtERKS1_
-FN:67,_ZNK3ept3apt7VersiongeERKS1_
-FN:59,_ZNK3ept3apt7VersionltERKS1_
-FN:51,_ZNK3ept3apt7VersionleERKS1_
-FN:32,_ZNK3ept3apt7Version15upstreamVersionEv
-DA:32,4
-DA:35,4
-DA:36,4
-DA:37,3
-DA:39,1
-DA:42,4
-DA:43,4
-DA:44,1
-DA:46,4
-DA:51,4
-DA:53,4
-DA:54,1
-DA:55,3
-DA:56,3
-DA:57,0
-DA:59,5
-DA:61,5
-DA:62,1
-DA:63,4
-DA:64,4
-DA:65,0
-DA:67,4
-DA:69,4
-DA:70,0
-DA:71,4
-DA:72,3
-DA:73,1
-DA:75,5
-DA:77,5
-DA:78,0
-DA:79,5
-DA:80,4
-DA:81,1
-DA:85,6
-BA:36,2
-BA:36,2
-BA:43,2
-BA:43,2
-BA:53,2
-BA:53,2
-BA:55,2
-BA:55,1
-BA:61,2
-BA:61,2
-BA:63,2
-BA:63,1
-BA:69,1
-BA:69,2
-BA:71,2
-BA:71,2
-BA:77,1
-BA:77,2
-BA:79,2
-BA:79,2
-BA:85,2
-BA:85,1
-BA:85,2
-BA:85,1
-LF:34
-LH:30
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/apt/version.h
-FN:61,_ZNK3ept3apt7Version4nameEv
-FN:67,_ZNK3ept3apt7Version7versionEv
-DA:61,0
-DA:67,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/apt-pkg/version.h
-FN:53,_ZN19pkgVersioningSystem10CmpVersionESsSs
-DA:53,14
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:100,_ZNSaIcEC1ERKS_
-DA:100,0
-DA:101,0
-DA:106,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:612,_ZNKSs6lengthEv
-FN:1544,_ZNKSs4dataEv
-FN:1534,_ZNKSs5c_strEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:392,_ZNSs10_S_compareEjj
-FN:1551,_ZNKSs13get_allocatorEv
-FN:1941,_ZNKSs7compareERKSs
-FN:2275,_ZStgtIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:2238,_ZStltIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:2162,_ZSteqIcEN9__gnu_cxx11__enable_ifIXsrSt9__is_charIT_E7__valueEbE6__typeERKSbIS3_St11char_traitsIS3_ESaIS3_EESC_
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:306,_ZNKSs8_M_checkEjPKc
-FN:1923,_ZNKSs6substrEjj
-DA:178,0
-DA:183,0
-DA:184,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:306,0
-DA:308,0
-DA:309,0
-DA:310,0
-DA:392,0
-DA:394,0
-DA:401,0
-DA:493,0
-DA:494,0
-DA:606,0
-DA:607,0
-DA:612,0
-DA:613,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:1923,0
-DA:1925,0
-DA:1941,0
-DA:1943,0
-DA:1944,0
-DA:1945,0
-DA:1947,0
-DA:1948,0
-DA:1949,0
-DA:1950,0
-DA:2162,0
-DA:2165,0
-DA:2238,0
-DA:2239,0
-DA:2275,0
-DA:2276,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:308,0
-BA:308,0
-BA:1948,0
-BA:1948,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-LF:48
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-DA:257,0
-DA:258,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:188,_ZSt3minIjERKT_S2_S2_
-DA:188,0
-DA:193,0
-DA:194,0
-DA:195,0
-BA:193,0
-BA:193,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-DA:71,0
-DA:76,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,2
-LF:1
-LH:1
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/apt/apt.cc
-FN:124,_ZN3ept3apt17AptImplementation5cacheEv
-FN:129,_ZN3ept3apt17AptImplementation6policyEv
-FN:147,_ZN3ept3apt15localityCompareEPKN8pkgCache7VerFileES4_
-FN:239,_ZN3ept3apt18RecordIteratorImpl3refEv
-FN:240,_ZN3ept3apt18RecordIteratorImpl5unrefEv
-FN:337,_ZNK3ept3apt3Apt8IteratoreqERKS2_
-FN:347,_ZNK3ept3apt3Apt8IteratorneERKS2_
-FN:423,_ZNK3ept3apt3Apt14RecordIteratoreqERKS2_
-FN:427,_ZNK3ept3apt3Apt14RecordIteratorneERKS2_
-FN:443,_ZNK3ept3apt3Apt3endEv
-FN:458,_ZNK3ept3apt3Apt4sizeEv
-FN:632,_ZN3ept3apt3Apt19invalidateTimestampEv
-FN:242,_ZN3ept3apt18RecordIteratorImpl4sizeEv
-FN:453,_ZNK3ept3apt3Apt9recordEndEv
-FN:638,_Z41__static_initialization_and_destruction_0ii
-FN:638,_GLOBAL__I_apt.cc
-FN:316,_ZN3ept3apt3Apt8IteratorD1Ev
-FN:316,_ZN3ept3apt3Apt8IteratorD2Ev
-FN:300,_ZN3ept3apt3Apt8IteratoraSERKS2_
-FN:289,_ZN3ept3apt3Apt8IteratorC1ERKS2_
-FN:289,_ZN3ept3apt3Apt8IteratorC2ERKS2_
-FN:115,_ZN3ept3apt17AptImplementationD1Ev
-FN:434,_ZN3ept3apt3AptD1Ev
-FN:434,_ZN3ept3apt3AptD2Ev
-FN:463,_ZN3ept3apt3Apt9timestampEv
-FN:320,_ZN3ept3apt3Apt8IteratordeEv
-FN:369,_ZN3ept3apt3Apt14RecordIteratorC1ERKS2_
-FN:369,_ZN3ept3apt3Apt14RecordIteratorC2ERKS2_
-FN:507,_ZNK3ept3apt3Apt10anyVersionERKSs
-FN:497,_ZNK3ept3apt3Apt16installedVersionERKSs
-FN:488,_ZNK3ept3apt3Apt16candidateVersionERKSs
-FN:468,_ZNK3ept3apt3Apt7isValidERKSs
-FN:474,_ZNK3ept3apt3Apt8validateERKNS0_7VersionE
-FN:436,_ZNK3ept3apt3Apt5beginEv
-FN:324,_ZN3ept3apt3Apt8IteratorppEv
-FN:171,_ZN3ept3apt18RecordIteratorImplC1ERNS0_17AptImplementationE
-FN:233,_ZN3ept3apt18RecordIteratorImplD1Ev
-FN:411,_ZN3ept3apt3Apt14RecordIteratoraSERKS2_
-FN:398,_ZN3ept3apt3Apt14RecordIteratorppEv
-FN:375,_ZN3ept3apt3Apt14RecordIteratorD1Ev
-FN:375,_ZN3ept3apt3Apt14RecordIteratorD2Ev
-FN:47,_ZN3ept3apt9ExceptionC1ERKSs
-FN:576,_ZNK3ept3apt3Apt9rawRecordERKNS0_7VersionE
-FN:569,_ZNK3ept3apt3Apt9rawRecordERKSs
-FN:134,_ZN3ept3apt17AptImplementation8depcacheEv
-FN:522,_ZNK3ept3apt3Apt5stateERKSs
-FN:244,_ZN3ept3apt18RecordIteratorImpl6recordEj
-FN:389,_ZN3ept3apt3Apt14RecordIteratorptEv
-FN:380,_ZN3ept3apt3Apt14RecordIteratordeEv
-FN:359,_ZN3ept3apt3Apt14RecordIteratorC1EPNS0_18RecordIteratorImplEj
-FN:448,_ZNK3ept3apt3Apt11recordBeginEv
-FN:359,_ZN3ept3apt3Apt14RecordIteratorC2EPNS0_18RecordIteratorImplEj
-FN:62,_ZN3ept3aptL7aptInitEv
-FN:93,_ZN3ept3apt17AptImplementationC1Ev
-FN:622,_ZN3ept3apt3Apt17checkCacheUpdatesEv
-FN:433,_ZN3ept3apt3AptC1Ev
-FN:433,_ZN3ept3apt3AptC2Ev
-FN:47,_ZN3ept3apt9ExceptionC2ERKSs
-DA:47,0
-DA:48,0
-DA:51,0
-DA:52,0
-DA:54,0
-DA:55,0
-DA:56,0
-DA:58,0
-DA:59,0
-DA:60,0
-DA:62,29
-DA:64,29
-DA:65,29
-DA:67,0
-DA:68,0
-DA:70,0
-DA:79,0
-DA:80,0
-DA:93,29
-DA:96,29
-DA:98,29
-DA:100,29
-DA:101,58
-DA:102,0
-DA:104,29
-DA:105,29
-DA:106,29
-DA:107,0
-DA:109,29
-DA:110,58
-DA:111,58
-DA:112,0
-DA:113,29
-DA:115,29
-DA:117,29
-DA:118,29
-DA:119,29
-DA:120,29
-DA:121,29
-DA:122,29
-DA:124,3980
-DA:126,3980
-DA:129,16099
-DA:131,16099
-DA:134,1
-DA:136,1
-DA:138,1
-DA:139,1
-DA:140,0
-DA:142,1
-DA:147,39519
-DA:149,39519
-DA:150,0
-DA:151,39519
-DA:152,0
-DA:153,39519
-DA:154,0
-DA:156,39519
-DA:157,39060
-DA:158,459
-DA:171,9
-DA:174,9
-DA:177,34002
-DA:179,33993
-DA:180,17901
-DA:184,16092
-DA:185,16092
-DA:187,1926
-DA:188,1926
-DA:189,0
-DA:193,14166
-DA:194,24507
-DA:195,14166
-DA:196,3825
-DA:200,14166
-DA:202,20682
-DA:204,20763
-DA:206,10422
-DA:208,81
-DA:209,81
-DA:213,10422
-DA:214,81
-DA:217,14166
-DA:218,3906
-DA:223,9
-DA:231,9
-DA:233,9
-DA:235,9
-DA:236,9
-DA:237,9
-DA:239,14
-DA:240,14
-DA:242,3906
-DA:244,3906
-DA:249,3906
-DA:252,18
-DA:253,18
-DA:254,0
-DA:256,18
-DA:257,9
-DA:258,18
-DA:259,0
-DA:261,18
-DA:267,3906
-DA:269,3906
-DA:272,171
-DA:273,171
-DA:274,0
-DA:277,3906
-DA:278,3906
-DA:279,0
-DA:280,3906
-DA:283,3906
-DA:285,3906
-DA:289,20
-DA:291,20
-DA:293,10
-DA:294,10
-DA:295,10
-DA:297,10
-DA:298,20
-DA:300,0
-DA:302,0
-DA:304,0
-DA:305,0
-DA:307,0
-DA:308,0
-DA:309,0
-DA:311,0
-DA:313,0
-DA:316,3605
-DA:318,3605
-DA:319,3605
-DA:320,5364
-DA:322,5364
-DA:324,7152
-DA:326,7152
-DA:327,7152
-DA:328,22260
-DA:329,7956
-DA:330,7152
-DA:332,4
-DA:333,4
-DA:335,7152
-DA:337,0
-DA:339,0
-DA:340,0
-DA:341,0
-DA:342,0
-DA:343,0
-DA:344,0
-DA:345,0
-DA:347,7157
-DA:349,7157
-DA:350,4
-DA:351,7153
-DA:352,7153
-DA:353,0
-DA:354,0
-DA:355,0
-DA:359,9
-DA:360,9
-DA:362,9
-DA:364,9
-DA:365,9
-DA:366,9
-DA:368,9
-DA:369,10
-DA:370,10
-DA:372,10
-DA:373,5
-DA:374,10
-DA:375,3500
-DA:377,3500
-DA:378,1
-DA:379,3500
-DA:380,3906
-DA:382,3906
-DA:384,3464
-DA:385,3464
-DA:387,3906
-DA:389,868
-DA:391,868
-DA:393,433
-DA:394,433
-DA:396,868
-DA:398,3906
-DA:400,3906
-DA:401,3906
-DA:404,9
-DA:405,8
-DA:406,9
-DA:407,9
-DA:409,3906
-DA:411,0
-DA:414,0
-DA:415,0
-DA:416,0
-DA:417,0
-DA:418,0
-DA:419,0
-DA:420,0
-DA:421,0
-DA:423,0
-DA:425,0
-DA:427,3915
-DA:429,3915
-DA:433,28
-DA:434,28
-DA:436,4
-DA:438,4
-DA:439,4
-DA:440,4
-DA:443,3581
-DA:445,3581
-DA:448,9
-DA:450,9
-DA:453,3481
-DA:455,3481
-DA:458,0
-DA:460,0
-DA:463,16
-DA:465,16
-DA:468,5
-DA:470,5
-DA:471,5
-DA:474,4
-DA:476,4
-DA:477,5
-DA:478,4
-DA:480,3
-DA:481,3
-DA:482,3
-DA:483,2
-DA:485,1
-DA:488,4
-DA:490,4
-DA:491,4
-DA:492,3
-DA:493,3
-DA:494,3
-DA:497,2
-DA:499,2
-DA:500,2
-DA:501,1
-DA:502,1
-DA:503,1
-DA:504,1
-DA:507,4
-DA:509,4
-DA:510,4
-DA:512,3
-DA:513,3
-DA:515,0
-DA:516,0
-DA:517,0
-DA:519,3
-DA:522,2
-DA:524,2
-DA:525,2
-DA:526,1
-DA:528,1
-DA:531,1
-DA:536,1
-DA:537,1
-DA:540,1
-DA:543,1
-DA:547,1
-DA:548,0
-DA:551,1
-DA:552,0
-DA:553,1
-DA:554,0
-DA:555,1
-DA:556,1
-DA:557,1
-DA:558,0
-DA:559,1
-DA:560,0
-DA:561,1
-DA:562,0
-DA:563,1
-DA:564,0
-DA:566,1
-DA:569,1
-DA:573,1
-DA:576,4
-DA:578,4
-DA:579,4
-DA:580,5
-DA:582,4
-DA:583,4
-DA:584,4
-DA:589,3
-DA:590,3
-DA:591,3
-DA:592,3
-DA:593,3
-DA:594,0
-DA:597,3
-DA:598,3
-DA:599,0
-DA:601,3
-DA:602,6
-DA:603,0
-DA:606,3
-DA:607,3
-DA:608,3
-DA:610,0
-DA:611,0
-DA:614,3
-DA:615,6
-DA:616,3
-DA:619,1
-DA:622,2
-DA:624,2
-DA:627,1
-DA:628,1
-DA:630,2
-DA:632,1
-DA:634,1
-DA:635,1
-DA:638,6
-BA:52,0
-BA:52,0
-BA:52,0
-BA:52,0
-BA:55,0
-BA:55,0
-BA:55,0
-BA:55,0
-BA:64,1
-BA:64,2
-BA:67,0
-BA:67,0
-BA:79,0
-BA:79,0
-BA:101,1
-BA:101,2
-BA:106,1
-BA:106,2
-BA:111,1
-BA:111,2
-BA:117,2
-BA:117,2
-BA:117,2
-BA:117,1
-BA:118,2
-BA:118,1
-BA:118,2
-BA:118,1
-BA:119,2
-BA:119,1
-BA:119,2
-BA:119,1
-BA:120,2
-BA:120,1
-BA:120,2
-BA:120,1
-BA:121,2
-BA:121,1
-BA:121,2
-BA:121,1
-BA:136,2
-BA:136,1
-BA:139,1
-BA:139,2
-BA:149,1
-BA:149,2
-BA:149,0
-BA:149,0
-BA:151,1
-BA:151,2
-BA:153,1
-BA:153,2
-BA:156,2
-BA:156,2
-BA:177,2
-BA:177,2
-BA:179,2
-BA:179,2
-BA:185,2
-BA:185,2
-BA:187,2
-BA:187,1
-BA:194,2
-BA:194,2
-BA:195,2
-BA:195,2
-BA:200,2
-BA:200,2
-BA:202,2
-BA:202,2
-BA:204,2
-BA:204,2
-BA:206,2
-BA:206,2
-BA:213,2
-BA:213,2
-BA:217,2
-BA:217,2
-BA:235,2
-BA:235,1
-BA:249,2
-BA:249,2
-BA:249,2
-BA:249,2
-BA:249,2
-BA:249,2
-BA:253,1
-BA:253,2
-BA:256,2
-BA:256,2
-BA:258,1
-BA:258,2
-BA:269,2
-BA:269,2
-BA:273,1
-BA:273,2
-BA:278,1
-BA:278,2
-BA:291,2
-BA:291,2
-BA:291,0
-BA:291,0
-BA:302,0
-BA:302,0
-BA:304,0
-BA:304,0
-BA:305,0
-BA:305,0
-BA:318,2
-BA:318,2
-BA:318,0
-BA:318,0
-BA:328,2
-BA:328,2
-BA:328,2
-BA:328,2
-BA:328,2
-BA:328,2
-BA:330,2
-BA:330,2
-BA:339,0
-BA:339,0
-BA:339,0
-BA:339,0
-BA:341,0
-BA:341,0
-BA:341,0
-BA:341,0
-BA:349,2
-BA:349,2
-BA:349,2
-BA:349,1
-BA:351,2
-BA:351,1
-BA:351,2
-BA:351,1
-BA:362,2
-BA:362,1
-BA:362,0
-BA:362,0
-BA:372,2
-BA:372,2
-BA:372,0
-BA:372,0
-BA:377,2
-BA:377,2
-BA:377,2
-BA:377,2
-BA:377,2
-BA:377,2
-BA:377,0
-BA:377,0
-BA:377,0
-BA:377,0
-BA:377,0
-BA:377,0
-BA:378,2
-BA:378,1
-BA:378,0
-BA:378,0
-BA:382,2
-BA:382,2
-BA:391,2
-BA:391,2
-BA:401,2
-BA:401,2
-BA:404,2
-BA:404,1
-BA:404,2
-BA:404,2
-BA:404,2
-BA:404,2
-BA:405,2
-BA:405,1
-BA:414,0
-BA:414,0
-BA:415,0
-BA:415,0
-BA:415,0
-BA:415,0
-BA:415,0
-BA:415,0
-BA:416,0
-BA:416,0
-BA:425,0
-BA:425,0
-BA:425,0
-BA:425,0
-BA:429,2
-BA:429,2
-BA:429,1
-BA:429,2
-BA:434,2
-BA:434,1
-BA:434,0
-BA:434,0
-BA:477,2
-BA:477,2
-BA:478,2
-BA:478,2
-BA:481,2
-BA:481,1
-BA:482,2
-BA:482,2
-BA:491,2
-BA:491,2
-BA:493,1
-BA:493,2
-BA:500,2
-BA:500,2
-BA:501,1
-BA:501,2
-BA:503,1
-BA:503,2
-BA:510,2
-BA:510,2
-BA:513,1
-BA:513,2
-BA:515,0
-BA:515,0
-BA:517,0
-BA:517,0
-BA:525,2
-BA:525,2
-BA:531,2
-BA:531,1
-BA:531,2
-BA:531,1
-BA:531,2
-BA:531,1
-BA:531,2
-BA:531,1
-BA:537,2
-BA:537,1
-BA:547,2
-BA:547,1
-BA:547,1
-BA:547,2
-BA:547,1
-BA:547,2
-BA:551,1
-BA:551,2
-BA:553,1
-BA:553,2
-BA:555,2
-BA:555,1
-BA:557,1
-BA:557,2
-BA:559,1
-BA:559,2
-BA:561,1
-BA:561,2
-BA:563,1
-BA:563,2
-BA:579,1
-BA:579,2
-BA:580,2
-BA:580,2
-BA:583,2
-BA:583,1
-BA:584,2
-BA:584,2
-BA:590,2
-BA:590,1
-BA:591,2
-BA:591,1
-BA:593,1
-BA:593,2
-BA:598,1
-BA:598,2
-BA:602,1
-BA:602,2
-BA:608,2
-BA:608,1
-BA:608,1
-BA:608,2
-BA:608,1
-BA:608,2
-BA:610,0
-BA:610,0
-BA:615,2
-BA:615,1
-BA:624,2
-BA:624,2
-BA:627,2
-BA:627,1
-BA:638,2
-BA:638,1
-BA:638,2
-BA:638,1
-LF:323
-LH:248
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/apt/apt.h
-FN:45,_ZNK3ept3apt9Exception4typeEv
-FN:73,_ZN3ept3apt3Apt8IteratorC1EPv
-FN:76,_ZN3ept3apt3Apt8IteratorC1Ev
-FN:107,_ZN3ept3apt3Apt14RecordIteratorC1Ev
-FN:46,_ZNK3ept3apt9Exception4descEv
-FN:43,_ZN3ept3apt9ExceptionD1Ev
-FN:43,_ZN3ept3apt9ExceptionD0Ev
-DA:43,0
-DA:45,0
-DA:46,0
-DA:73,4
-DA:76,3581
-DA:107,3481
-BA:43,0
-BA:43,0
-BA:43,0
-BA:43,0
-LF:6
-LH:3
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/apt/version.h
-FN:41,_ZN3ept3apt7VersionD1Ev
-FN:50,_ZN3ept3apt7VersionC1Ev
-FN:61,_ZNK3ept3apt7Version4nameEv
-FN:67,_ZNK3ept3apt7Version7versionEv
-FN:55,_ZN3ept3apt7VersionC1ERKSsS3_
-FN:41,_ZN3ept3apt7VersionC1ERKS1_
-DA:41,0
-DA:50,0
-DA:55,0
-DA:56,0
-DA:61,0
-DA:67,0
-LF:6
-LH:0
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt/record.h
-DA:86,2
-BA:86,1
-BA:86,2
-LF:1
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt.h
-FN:72,_ZN3ept4core12PackageStateC1Ej
-FN:76,_ZN3ept4core12PackageStateC1Ev
-DA:72,0
-DA:73,0
-DA:74,0
-DA:76,1
-LF:4
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/wibble/exception.h
-FN:190,_ZNK6wibble9exception7Generic4typeEv
-FN:137,_ZN6wibble9exception7ContextD2Ev
-FN:109,_ZN6wibble9exception10AddContext7contextEv
-FN:213,_ZNK6wibble9exception7Generic4whatEv
-FN:193,_ZNK6wibble9exception7Generic4descEv
-FN:154,_ZNK6wibble9exception7Context13formatContextEv
-FN:205,_ZNK6wibble9exception7Generic8fullInfoEv
-FN:187,_ZN6wibble9exception7GenericD2Ev
-FN:187,_ZN6wibble9exception7GenericD0Ev
-FN:187,_ZN6wibble9exception7GenericD1Ev
-FN:117,_ZN6wibble9exception10AddContext11copyContextISt20back_insert_iteratorISt6vectorISsSaISsEEEEEvT_
-FN:153,_ZN6wibble9exception7Context10addContextERKSs
-FN:147,_ZN6wibble9exception7ContextC2ERKSs
-FN:186,_ZN6wibble9exception7GenericC2ERKSs
-DA:109,0
-DA:110,0
-DA:111,0
-DA:112,0
-DA:113,0
-DA:117,0
-DA:118,0
-DA:119,0
-DA:137,0
-DA:147,0
-DA:148,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:153,0
-DA:154,0
-DA:155,0
-DA:156,0
-DA:157,0
-DA:159,0
-DA:161,0
-DA:162,0
-DA:163,0
-DA:186,0
-DA:187,0
-DA:190,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:205,0
-DA:206,0
-DA:207,0
-DA:209,0
-DA:210,0
-DA:213,0
-BA:110,0
-BA:110,0
-BA:156,0
-BA:156,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:187,0
-BA:207,0
-BA:207,0
-LF:35
-LH:0
-end_of_record
-SF:/usr/include/apt-pkg/cachefile.h
-FN:45,_ZN12pkgCacheFileixERKN8pkgCache11PkgIteratorE
-DA:45,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/apt-pkg/cacheiterators.h
-FN:59,_ZNK8pkgCache11PkgIterator3endEv
-FN:62,_ZNK8pkgCache11PkgIteratoreqERKS0_
-FN:63,_ZNK8pkgCache11PkgIteratorneERKS0_
-FN:66,_ZN8pkgCache11PkgIteratorptEv
-FN:67,_ZNK8pkgCache11PkgIteratorptEv
-FN:73,_ZNK8pkgCache11PkgIterator4NameEv
-FN:91,_ZN8pkgCache11PkgIteratorC1Ev
-FN:105,_ZN8pkgCache11VerIteratorppEi
-FN:107,_ZNK8pkgCache11VerIterator3endEv
-FN:108,_ZN8pkgCache11VerIteratoraSERKS0_
-FN:112,_ZNK8pkgCache11VerIteratorneERKS0_
-FN:124,_ZNK8pkgCache11VerIterator6VerStrEv
-FN:142,_ZN8pkgCache11VerIteratorC1ERS_PNS_7VersionE
-FN:324,_ZN8pkgCache15PkgFileIteratorptEv
-FN:327,_ZN8pkgCache15PkgFileIteratorcvPNS_11PackageFileEEv
-FN:329,_ZN8pkgCache15PkgFileIterator5CacheEv
-FN:331,_ZNK8pkgCache15PkgFileIterator8FileNameEv
-FN:347,_ZN8pkgCache15PkgFileIteratorC1Ev
-FN:349,_ZN8pkgCache15PkgFileIteratorC1ERS_PNS_11PackageFileE
-FN:361,_ZN8pkgCache15VerFileIteratorppEi
-FN:362,_ZN8pkgCache15VerFileIteratorppEv
-FN:363,_ZNK8pkgCache15VerFileIterator3endEv
-FN:370,_ZN8pkgCache15VerFileIteratorptEv
-FN:373,_ZN8pkgCache15VerFileIteratorcvPNS_7VerFileEEv
-FN:377,_ZNK8pkgCache15VerFileIterator4FileEv
-FN:381,_ZN8pkgCache15VerFileIteratorC1ERS_PNS_7VerFileE
-FN:417,_ZNK8pkgCache11PkgIterator11VersionListEv
-FN:419,_ZNK8pkgCache11PkgIterator10CurrentVerEv
-FN:431,_ZNK8pkgCache11VerIterator8FileListEv
-FN:46,_ZN8pkgCache11PkgIteratorC1ERS_
-FN:58,_ZN8pkgCache11PkgIteratorppEv
-DA:46,0
-DA:48,0
-DA:49,0
-DA:50,0
-DA:58,0
-DA:59,0
-DA:62,0
-DA:63,0
-DA:66,0
-DA:67,0
-DA:73,0
-DA:91,0
-DA:105,0
-DA:107,0
-DA:108,0
-DA:112,0
-DA:124,0
-DA:142,0
-DA:143,0
-DA:145,0
-DA:146,0
-DA:147,0
-DA:324,0
-DA:327,0
-DA:329,0
-DA:331,0
-DA:347,0
-DA:349,0
-DA:361,0
-DA:362,0
-DA:363,0
-DA:370,0
-DA:373,0
-DA:377,0
-DA:381,0
-DA:417,0
-DA:418,0
-DA:419,2
-DA:420,2
-DA:431,0
-DA:432,0
-BA:59,0
-BA:59,0
-BA:59,0
-BA:59,0
-BA:73,0
-BA:73,0
-BA:105,0
-BA:105,0
-BA:107,0
-BA:107,0
-BA:107,0
-BA:107,0
-BA:124,0
-BA:124,0
-BA:145,0
-BA:145,0
-BA:327,0
-BA:327,0
-BA:331,0
-BA:331,0
-BA:361,0
-BA:361,0
-BA:373,0
-BA:373,0
-LF:41
-LH:2
-end_of_record
-SF:/usr/include/apt-pkg/depcache.h
-FN:242,_ZNK11pkgDepCache10StateCache6DeleteEv
-FN:243,_ZNK11pkgDepCache10StateCache4KeepEv
-FN:248,_ZNK11pkgDepCache10StateCache9NowBrokenEv
-FN:250,_ZNK11pkgDepCache10StateCache10InstBrokenEv
-FN:252,_ZNK11pkgDepCache10StateCache7InstallEv
-FN:342,_ZN11pkgDepCacheixERKN8pkgCache11PkgIteratorE
-DA:242,0
-DA:243,0
-DA:248,0
-DA:250,0
-DA:252,0
-DA:342,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/apt-pkg/error.h
-FN:83,_ZN11GlobalError12PendingErrorEv
-FN:84,_ZN11GlobalError5emptyEv
-DA:83,3
-DA:84,0
-LF:2
-LH:1
-end_of_record
-SF:/usr/include/apt-pkg/fileutl.h
-FN:63,_ZN6FileFd6IsOpenEv
-FN:75,_ZN6FileFdC1Ei
-FN:70,_ZN6FileFdC1ESsNS_8OpenModeEm
-DA:63,0
-DA:70,53
-DA:71,53
-DA:73,53
-DA:74,53
-DA:75,0
-LF:6
-LH:4
-end_of_record
-SF:/usr/include/apt-pkg/pkgcache.h
-FN:326,_ZN8pkgCache8PkgBeginEv
-DA:326,0
-DA:327,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/apt-pkg/progress.h
-FN:53,_ZN10OpProgress6UpdateEv
-FN:62,_ZN10OpProgress4DoneEv
-FN:65,_ZN10OpProgressD1Ev
-FN:65,_ZN10OpProgressD0Ev
-DA:53,24433
-DA:62,62
-DA:65,29
-BA:65,1
-BA:65,2
-BA:65,0
-BA:65,0
-LF:3
-LH:3
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:98,_ZNSaIPN8pkgCache7VerFileEEC1Ev
-FN:106,_ZNSaIPN8pkgCache7VerFileEED2Ev
-FN:106,_ZNSaIPN8pkgCache7VerFileEED1Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-FN:106,_ZNSaISsED2Ev
-FN:98,_ZNSaISsEC2Ev
-FN:100,_ZNSaIPN8pkgCache7VerFileEEC2ERKS2_
-FN:118,_ZSteqIcEbRKSaIT_ES3_
-DA:98,9
-DA:100,9
-DA:101,9
-DA:106,9
-DA:118,0
-DA:119,0
-LF:6
-LH:4
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_ios.h
-FN:131,_ZNKSt9basic_iosIcSt11char_traitsIcEE7rdstateEv
-FN:454,_ZNSt9basic_iosIcSt11char_traitsIcEEC2Ev
-FN:276,_ZNSt9basic_iosIcSt11char_traitsIcEED2Ev
-FN:151,_ZNSt9basic_iosIcSt11char_traitsIcEE8setstateESt12_Ios_Iostate
-DA:131,0
-DA:132,0
-DA:151,0
-DA:152,0
-DA:276,0
-DA:454,0
-DA:456,0
-DA:457,0
-BA:276,0
-BA:276,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:1534,_ZNKSs5c_strEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:612,_ZNKSs6lengthEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:1544,_ZNKSs4dataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:2421,_ZStlsIcSt11char_traitsIcESaIcEERSt13basic_ostreamIT_T0_ES7_RKSbIS4_S5_T1_E
-FN:339,_ZNSs7_M_copyEPcPKcj
-FN:384,_ZNSs13_S_copy_charsEPcS_S_
-FN:1462,_ZNSs16_S_construct_auxIPcEES0_T_S1_RKSaIcESt12__false_type
-FN:1478,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcE
-FN:835,_ZNSs6appendEPKc
-FN:2121,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_
-FN:2084,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_
-FN:773,_ZNSspLERKSs
-FN:501,_ZNSsaSERKSs
-FN:2188,_ZSteqIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_EPKS3_
-DA:178,0
-DA:183,0
-DA:184,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:339,0
-DA:341,0
-DA:342,0
-DA:344,0
-DA:345,0
-DA:384,0
-DA:385,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:612,0
-DA:613,0
-DA:686,0
-DA:687,0
-DA:773,0
-DA:774,0
-DA:835,0
-DA:838,0
-DA:1462,0
-DA:1465,0
-DA:1478,0
-DA:1481,0
-DA:1534,0
-DA:1535,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2084,0
-DA:2086,0
-DA:2087,0
-DA:2088,0
-DA:2121,0
-DA:2123,0
-DA:2124,0
-DA:2125,0
-DA:2188,0
-DA:2189,0
-DA:2421,0
-DA:2425,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:341,0
-BA:341,0
-LF:71
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:130,_ZNSs12_S_constructIPcEES0_T_S1_RKSaIcESt20forward_iterator_tag
-FN:234,_ZNSsC1IPcEET_S1_RKSaIcE
-FN:668,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_EPKS3_RKS6_
-DA:130,0
-DA:133,0
-DA:134,0
-DA:137,0
-DA:139,0
-DA:142,0
-DA:144,0
-DA:146,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:152,0
-DA:153,0
-DA:234,0
-DA:235,0
-DA:236,0
-DA:668,0
-DA:673,0
-DA:674,0
-DA:675,0
-DA:676,0
-DA:677,0
-DA:678,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:133,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-BA:137,0
-LF:23
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:273,_ZNSt11char_traitsIcE4copyEPcPKcj
-DA:245,0
-DA:246,0
-DA:261,0
-DA:262,0
-DA:273,0
-DA:274,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/ios_base.h
-FN:125,_ZStorSt13_Ios_OpenmodeS_
-FN:163,_ZStorSt12_Ios_IostateS_
-DA:125,0
-DA:126,0
-DA:163,0
-DA:164,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algo.h
-FN:123,_ZSt8__medianIPN8pkgCache7VerFileEPFbPKS1_S4_EERKT_S9_S9_S9_T0_
-FN:1731,_ZSt25__unguarded_linear_insertIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEES4_PFbPKS3_SB_EEvT_T0_T1_
-FN:1806,_ZSt26__unguarded_insertion_sortIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEEPFbPKS3_SB_EEvT_SE_T0_
-FN:1877,_ZSt21__unguarded_partitionIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEES4_PFbPKS3_SB_EET_SE_SE_T0_T1_
-FN:1568,_ZSt13__heap_selectIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEEPFbPKS3_SB_EEvT_SE_SE_T0_
-FN:4661,_ZSt12partial_sortIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEEPFbPKS3_SB_EEvT_SE_SE_T0_
-FN:1930,_ZSt16__introsort_loopIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEEiPFbPKS3_SB_EEvT_SE_T0_T1_
-FN:1771,_ZSt16__insertion_sortIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEEPFbPKS3_SB_EEvT_SE_T0_
-FN:1840,_ZSt22__final_insertion_sortIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEEPFbPKS3_SB_EEvT_SE_T0_
-FN:1970,_ZSt4__lgi
-FN:4806,_ZSt4sortIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEEPFbPKS3_SB_EEvT_SE_T0_
-DA:123,0
-DA:128,0
-DA:129,0
-DA:130,0
-DA:131,0
-DA:132,0
-DA:134,0
-DA:135,0
-DA:136,0
-DA:137,0
-DA:138,0
-DA:140,0
-DA:1568,0
-DA:1570,0
-DA:1571,0
-DA:1572,0
-DA:1573,0
-DA:1574,0
-DA:1731,0
-DA:1733,0
-DA:1734,0
-DA:1735,0
-DA:1737,0
-DA:1738,0
-DA:1739,0
-DA:1741,0
-DA:1742,0
-DA:1771,0
-DA:1773,0
-DA:1775,0
-DA:1778,0
-DA:1779,0
-DA:1781,0
-DA:1782,0
-DA:1785,0
-DA:1806,0
-DA:1811,0
-DA:1812,0
-DA:1813,0
-DA:1840,0
-DA:1842,0
-DA:1844,0
-DA:1845,0
-DA:1849,0
-DA:1850,0
-DA:1877,0
-DA:1879,0
-DA:1881,0
-DA:1882,0
-DA:1883,0
-DA:1884,0
-DA:1885,0
-DA:1886,0
-DA:1887,0
-DA:1888,0
-DA:1889,0
-DA:1930,0
-DA:1935,0
-DA:1937,0
-DA:1939,0
-DA:1940,0
-DA:1942,0
-DA:1952,0
-DA:1953,0
-DA:1954,0
-DA:1970,0
-DA:1971,0
-DA:4661,0
-DA:4674,0
-DA:4675,0
-DA:4676,0
-DA:4806,0
-DA:4818,0
-DA:4820,0
-DA:4822,0
-DA:4824,0
-BA:128,0
-BA:128,0
-BA:129,0
-BA:129,0
-BA:131,0
-BA:131,0
-BA:135,0
-BA:135,0
-BA:137,0
-BA:137,0
-BA:1571,0
-BA:1571,0
-BA:1572,0
-BA:1572,0
-BA:1735,0
-BA:1735,0
-BA:1773,0
-BA:1773,0
-BA:1775,0
-BA:1775,0
-BA:1779,0
-BA:1779,0
-BA:1811,0
-BA:1811,0
-BA:1842,0
-BA:1842,0
-BA:1881,0
-BA:1881,0
-BA:1884,0
-BA:1884,0
-BA:1886,0
-BA:1886,0
-BA:1935,0
-BA:1935,0
-BA:1937,0
-BA:1937,0
-BA:4818,0
-BA:4818,0
-LF:76
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb0EE3__bES7_
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb0EE3__bES6_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEELb1EE3__bES7_
-FN:268,_ZNSt12__niter_baseISt16ostream_iteratorISscSt11char_traitsIcEELb0EE3__bES3_
-FN:286,_ZNSt12__miter_baseIPSsLb0EE3__bES0_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEELb1EE3__bES6_
-FN:268,_ZNSt12__niter_baseISt20back_insert_iteratorISt6vectorISsSaISsEEELb0EE3__bES4_
-FN:286,_ZNSt12__miter_baseIPPN8pkgCache7VerFileELb0EE3__bES3_
-FN:268,_ZNSt12__niter_baseIPSsLb0EE3__bES0_
-FN:268,_ZNSt12__niter_baseIPPN8pkgCache7VerFileELb0EE3__bES3_
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEELb0EE3__bES9_
-FN:104,_ZNSt11__iter_swapILb1EE9iter_swapIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS6_SaIS6_EEEESB_EEvT_T0_
-FN:121,_ZSt9iter_swapIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEES9_EvT_T0_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEELb1EE3__bES9_
-FN:748,_ZSt10__fill_n_aIPPN8pkgCache7VerFileEjS2_EN9__gnu_cxx11__enable_ifIXsrSt11__is_scalarIT1_E7__valueET_E6__typeES9_T0_RKS7_
-FN:778,_ZSt6fill_nIPPN8pkgCache7VerFileEjS2_ET_S4_T0_RKT1_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPKSsSt16ostream_iteratorISscSt11char_traitsIcEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPKSsSt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET1_T0_SD_SC_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEESt16ostream_iteratorISscSt11char_traitsIcEEET0_T_SD_SC_
-FN:539,_ZNSt20__copy_move_backwardILb0ELb0ESt26random_access_iterator_tagE13__copy_move_bIPSsS3_EET0_T_S5_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0EPSsS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPSsS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardIPSsS0_ET0_T_S2_S1_
-FN:337,_ZNSt11__copy_moveILb0ELb0ESt26random_access_iterator_tagE8__copy_mIPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEEET0_T_SA_S9_
-FN:385,_ZSt13__copy_move_aILb0EPSsSt20back_insert_iteratorISt6vectorISsSaISsEEEET1_T0_S7_S6_
-FN:430,_ZSt14__copy_move_a2ILb0EN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET1_T0_SA_S9_
-FN:456,_ZSt4copyIN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEESt20back_insert_iteratorIS5_EET0_T_SA_S9_
-FN:375,_ZNSt11__copy_moveILb0ELb1ESt26random_access_iterator_tagE8__copy_mIPN8pkgCache7VerFileEEEPT_PKS6_S9_S7_
-FN:385,_ZSt13__copy_move_aILb0EPPN8pkgCache7VerFileES3_ET1_T0_S5_S4_
-FN:430,_ZSt14__copy_move_a2ILb0EPPN8pkgCache7VerFileES3_ET1_T0_S5_S4_
-FN:456,_ZSt4copyIPPN8pkgCache7VerFileES3_ET0_T_S5_S4_
-FN:569,_ZNSt20__copy_move_backwardILb0ELb1ESt26random_access_iterator_tagE13__copy_move_bIPN8pkgCache7VerFileEEEPT_PKS6_S9_S7_
-FN:579,_ZSt22__copy_move_backward_aILb0EPPN8pkgCache7VerFileES3_ET1_T0_S5_S4_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPPN8pkgCache7VerFileES3_ET1_T0_S5_S4_
-FN:624,_ZSt13copy_backwardIPPN8pkgCache7VerFileES3_ET0_T_S5_S4_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEES9_ET1_T0_SB_SA_
-FN:624,_ZSt13copy_backwardIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEES9_ET0_T_SB_SA_
-DA:104,0
-DA:106,0
-DA:107,0
-DA:121,0
-DA:142,0
-DA:146,0
-DA:210,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:268,0
-DA:269,0
-DA:276,0
-DA:277,0
-DA:286,0
-DA:287,0
-DA:337,0
-DA:340,0
-DA:342,0
-DA:343,0
-DA:344,0
-DA:346,0
-DA:375,0
-DA:377,0
-DA:379,0
-DA:385,0
-DA:393,0
-DA:396,0
-DA:430,0
-DA:435,0
-DA:456,0
-DA:466,0
-DA:539,0
-DA:542,0
-DA:543,0
-DA:544,0
-DA:569,0
-DA:571,0
-DA:572,0
-DA:573,0
-DA:579,0
-DA:587,0
-DA:592,0
-DA:597,0
-DA:602,0
-DA:624,0
-DA:636,0
-DA:748,9
-DA:750,9
-DA:751,9
-DA:752,0
-DA:753,9
-DA:778,9
-DA:784,9
-BA:215,0
-BA:215,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:340,0
-BA:542,0
-BA:542,0
-BA:751,1
-BA:751,2
-LF:54
-LH:6
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:97,_ZSt8_DestroyIPPN8pkgCache7VerFileEEvT_S4_
-FN:126,_ZSt8_DestroyIPPN8pkgCache7VerFileES2_EvT_S4_RSaIT0_E
-FN:87,_ZSt8_DestroyISsEvPT_
-FN:97,_ZSt8_DestroyIPSsEvT_S1_
-FN:126,_ZSt8_DestroyIPSsSsEvT_S1_RSaIT0_E
-DA:87,0
-DA:88,0
-DA:97,0
-DA:101,0
-DA:103,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-BA:101,0
-BA:101,0
-LF:9
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_heap.h
-FN:177,_ZSt11__push_heapIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEEiS4_PFbPKS3_SB_EEvT_T0_SF_T1_T2_
-FN:295,_ZSt13__adjust_heapIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEEiS4_PFbPKS3_SB_EEvT_T0_SF_T1_T2_
-FN:412,_ZSt9make_heapIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEEPFbPKS3_SB_EEvT_SE_T0_
-FN:322,_ZSt10__pop_heapIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEEPFbPKS3_SB_EEvT_SE_SE_T0_
-FN:350,_ZSt8pop_heapIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEEPFbPKS3_SB_EEvT_SE_T0_
-FN:477,_ZSt9sort_heapIN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS4_SaIS4_EEEEPFbPKS3_SB_EEvT_SE_T0_
-DA:177,0
-DA:179,0
-DA:180,0
-DA:183,0
-DA:184,0
-DA:185,0
-DA:187,0
-DA:188,0
-DA:295,0
-DA:297,0
-DA:298,0
-DA:299,0
-DA:301,0
-DA:302,0
-DA:304,0
-DA:305,0
-DA:306,0
-DA:308,0
-DA:310,0
-DA:311,0
-DA:313,0
-DA:315,0
-DA:317,0
-DA:322,0
-DA:329,0
-DA:330,0
-DA:331,0
-DA:334,0
-DA:350,0
-DA:358,0
-DA:359,0
-DA:412,0
-DA:424,0
-DA:425,0
-DA:427,0
-DA:428,0
-DA:429,0
-DA:431,0
-DA:432,0
-DA:434,0
-DA:435,0
-DA:436,0
-DA:477,0
-DA:485,0
-DA:486,0
-DA:487,0
-BA:180,0
-BA:180,0
-BA:180,0
-BA:180,0
-BA:180,0
-BA:180,0
-BA:299,0
-BA:299,0
-BA:302,0
-BA:302,0
-BA:308,0
-BA:308,0
-BA:308,0
-BA:308,0
-BA:424,0
-BA:424,0
-BA:434,0
-BA:434,0
-BA:485,0
-BA:485,0
-LF:46
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEdeEv
-FN:398,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEC1ERS2_
-FN:456,_ZSt13back_inserterISt6vectorISsSaISsEEESt20back_insert_iteratorIT_ERS4_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEEC1ERKS2_
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS3_SaIS3_EEEC1ERKS4_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEE4baseEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPSsSt6vectorISsSaISsEEEC1ERKS1_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKSsSt6vectorISsSaISsEEE4baseEv
-FN:769,_ZN9__gnu_cxxeqIPKSsSt6vectorISsSaISsEEEEbRKNS_17__normal_iteratorIT_T0_EESB_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS3_SaIS3_EEE4baseEv
-FN:781,_ZN9__gnu_cxxneIPPN8pkgCache7VerFileESt6vectorIS3_SaIS3_EEEEbRKNS_17__normal_iteratorIT_T0_EESD_
-FN:846,_ZN9__gnu_cxxmiIPPN8pkgCache7VerFileESt6vectorIS3_SaIS3_EEEENS_17__normal_iteratorIT_T0_E15difference_typeERKSB_SE_
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS3_SaIS3_EEEdeEv
-FN:735,_ZNK9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS3_SaIS3_EEEplERKi
-FN:743,_ZNK9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS3_SaIS3_EEEmiERKi
-FN:703,_ZN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS3_SaIS3_EEEppEv
-FN:715,_ZN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS3_SaIS3_EEEmmEv
-FN:794,_ZN9__gnu_cxxltIPPN8pkgCache7VerFileESt6vectorIS3_SaIS3_EEEEbRKNS_17__normal_iteratorIT_T0_EESD_
-FN:769,_ZN9__gnu_cxxeqIPPN8pkgCache7VerFileESt6vectorIS3_SaIS3_EEEEbRKNS_17__normal_iteratorIT_T0_EESD_
-FN:722,_ZN9__gnu_cxx17__normal_iteratorIPPN8pkgCache7VerFileESt6vectorIS3_SaIS3_EEEmmEi
-FN:429,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEdeEv
-FN:434,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEppEv
-FN:412,_ZNSt20back_insert_iteratorISt6vectorISsSaISsEEEaSERKSs
-DA:398,0
-DA:412,0
-DA:414,0
-DA:415,0
-DA:429,0
-DA:430,0
-DA:434,0
-DA:435,0
-DA:456,0
-DA:457,0
-DA:683,0
-DA:695,0
-DA:696,0
-DA:703,0
-DA:705,0
-DA:706,0
-DA:715,0
-DA:717,0
-DA:718,0
-DA:722,0
-DA:723,0
-DA:735,0
-DA:736,0
-DA:743,0
-DA:744,0
-DA:747,0
-DA:748,0
-DA:769,0
-DA:770,0
-DA:781,0
-DA:782,0
-DA:794,0
-DA:795,0
-DA:846,0
-DA:847,0
-LF:35
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h
-FN:93,_ZSt10__distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_St26random_access_iterator_tag
-FN:115,_ZSt8distanceIPcENSt15iterator_traitsIT_E15difference_typeES2_S2_
-DA:93,0
-DA:98,0
-DA:115,0
-DA:119,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator_base_types.h
-FN:111,_ZNSt8iteratorISt18input_iterator_tagSsvvvEC2Ev
-FN:111,_ZNSt8iteratorISt19output_iterator_tagvvvvEC2Ev
-FN:166,_ZSt19__iterator_categoryIPcENSt15iterator_traitsIT_E17iterator_categoryERKS2_
-DA:111,7105
-DA:166,0
-DA:167,0
-LF:3
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_move.h
-FN:80,_ZSt4swapIPN8pkgCache7VerFileEEvRT_S4_
-DA:80,0
-DA:85,0
-DA:86,0
-DA:87,0
-DA:88,0
-LF:5
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:208,_ZNSt22__uninitialized_fill_nILb1EE20uninitialized_fill_nIPPN8pkgCache7VerFileEjS4_EEvT_T0_RKT1_
-FN:223,_ZSt20uninitialized_fill_nIPPN8pkgCache7VerFileEjS2_EvT_T0_RKT1_
-FN:322,_ZSt24__uninitialized_fill_n_aIPPN8pkgCache7VerFileEjS2_S2_EvT_T0_RKT1_RSaIT2_E
-FN:73,_ZNSt20__uninitialized_copyILb0EE18uninitialized_copyIPSsS2_EET0_T_S4_S3_
-FN:113,_ZSt18uninitialized_copyIPSsS0_ET0_T_S2_S1_
-FN:261,_ZSt22__uninitialized_copy_aIPSsS0_SsET0_T_S2_S1_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPSsS0_SaISsEET0_T_S3_S2_RT1_
-FN:97,_ZNSt20__uninitialized_copyILb1EE18uninitialized_copyIPPN8pkgCache7VerFileES5_EET0_T_S7_S6_
-FN:113,_ZSt18uninitialized_copyIPPN8pkgCache7VerFileES3_ET0_T_S5_S4_
-FN:261,_ZSt22__uninitialized_copy_aIPPN8pkgCache7VerFileES3_S2_ET0_T_S5_S4_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPPN8pkgCache7VerFileES3_SaIS2_EET0_T_S6_S5_RT1_
-DA:73,0
-DA:75,0
-DA:78,0
-DA:79,0
-DA:81,0
-DA:83,0
-DA:85,0
-DA:86,0
-DA:97,0
-DA:98,0
-DA:113,0
-DA:122,0
-DA:208,9
-DA:209,9
-DA:223,9
-DA:228,9
-DA:230,9
-DA:261,0
-DA:262,0
-DA:268,0
-DA:272,0
-DA:322,9
-DA:323,9
-BA:78,0
-BA:78,0
-BA:79,0
-BA:79,0
-LF:23
-LH:7
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:484,_ZNKSt6vectorIPN8pkgCache7VerFileESaIS2_EE4sizeEv
-FN:562,_ZNSt6vectorIPN8pkgCache7VerFileESaIS2_EEixEj
-FN:97,_ZNSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:404,_ZNKSt6vectorISsSaISsEE3endEv
-FN:386,_ZNKSt6vectorISsSaISsEE5beginEv
-FN:484,_ZNKSt6vectorISsSaISsEE4sizeEv
-FN:101,_ZNKSt12_Vector_baseISsSaISsEE19_M_get_Tp_allocatorEv
-FN:517,_ZNKSt6vectorIPN8pkgCache7VerFileESaIS2_EE8capacityEv
-FN:97,_ZNSt12_Vector_baseIPN8pkgCache7VerFileESaIS2_EE19_M_get_Tp_allocatorEv
-FN:395,_ZNSt6vectorIPN8pkgCache7VerFileESaIS2_EE3endEv
-FN:377,_ZNSt6vectorIPN8pkgCache7VerFileESaIS2_EE5beginEv
-FN:79,_ZNSt12_Vector_baseIPN8pkgCache7VerFileESaIS2_EE12_Vector_implD1Ev
-FN:395,_ZNSt6vectorISsSaISsEE3endEv
-FN:377,_ZNSt6vectorISsSaISsEE5beginEv
-FN:526,_ZNKSt6vectorISsSaISsEE5emptyEv
-FN:101,_ZNKSt12_Vector_baseIPN8pkgCache7VerFileESaIS2_EE19_M_get_Tp_allocatorEv
-FN:489,_ZNKSt6vectorIPN8pkgCache7VerFileESaIS2_EE8max_sizeEv
-FN:79,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implD1Ev
-FN:84,_ZNSt12_Vector_baseISsSaISsEE12_Vector_implC1Ev
-FN:108,_ZNSt12_Vector_baseISsSaISsEEC2Ev
-FN:213,_ZNSt6vectorISsSaISsEEC1Ev
-FN:489,_ZNKSt6vectorISsSaISsEE8max_sizeEv
-FN:88,_ZNSt12_Vector_baseIPN8pkgCache7VerFileESaIS2_EE12_Vector_implC1ERKS3_
-FN:974,_ZNSt6vectorIPN8pkgCache7VerFileESaIS2_EE18_M_fill_initializeEjRKS2_
-FN:147,_ZNSt12_Vector_baseISsSaISsEE13_M_deallocateEPSsj
-FN:135,_ZNSt12_Vector_baseISsSaISsEED2Ev
-FN:299,_ZNSt6vectorISsSaISsEED1Ev
-FN:147,_ZNSt12_Vector_baseIPN8pkgCache7VerFileESaIS2_EE13_M_deallocateEPS2_j
-FN:135,_ZNSt12_Vector_baseIPN8pkgCache7VerFileESaIS2_EED2Ev
-FN:299,_ZNSt6vectorIPN8pkgCache7VerFileESaIS2_EED1Ev
-FN:143,_ZNSt12_Vector_baseIPN8pkgCache7VerFileESaIS2_EE11_M_allocateEj
-FN:114,_ZNSt12_Vector_baseIPN8pkgCache7VerFileESaIS2_EEC2EjRKS3_
-FN:234,_ZNSt6vectorIPN8pkgCache7VerFileESaIS2_EEC1EjRKS2_RKS3_
-FN:143,_ZNSt12_Vector_baseISsSaISsEE11_M_allocateEj
-FN:1075,_ZNKSt6vectorIPN8pkgCache7VerFileESaIS2_EE12_M_check_lenEjPKc
-FN:1075,_ZNKSt6vectorISsSaISsEE12_M_check_lenEjPKc
-FN:686,_ZNSt6vectorISsSaISsEE9push_backERKSs
-FN:902,_ZNSt6vectorIPN8pkgCache7VerFileESaIS2_EE20_M_allocate_and_copyIPS2_EES6_jT_S7_
-FN:686,_ZNSt6vectorIPN8pkgCache7VerFileESaIS2_EE9push_backERKS2_
-DA:79,0
-DA:84,0
-DA:85,0
-DA:86,0
-DA:88,9
-DA:89,9
-DA:90,9
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:108,0
-DA:109,0
-DA:114,9
-DA:115,9
-DA:117,9
-DA:118,9
-DA:119,9
-DA:120,9
-DA:135,0
-DA:136,0
-DA:137,0
-DA:143,0
-DA:144,0
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:213,0
-DA:214,0
-DA:234,9
-DA:235,9
-DA:236,9
-DA:299,0
-DA:300,0
-DA:301,0
-DA:377,0
-DA:378,0
-DA:386,0
-DA:387,0
-DA:395,0
-DA:396,0
-DA:404,0
-DA:405,0
-DA:484,0
-DA:485,0
-DA:489,0
-DA:490,0
-DA:517,0
-DA:519,0
-DA:526,0
-DA:527,0
-DA:562,0
-DA:563,0
-DA:686,0
-DA:688,0
-DA:690,0
-DA:691,0
-DA:694,0
-DA:695,0
-DA:902,0
-DA:904,0
-DA:907,0
-DA:909,0
-DA:911,0
-DA:913,0
-DA:914,0
-DA:974,9
-DA:976,9
-DA:978,9
-DA:979,9
-DA:1075,0
-DA:1077,0
-DA:1078,0
-DA:1080,0
-DA:1081,0
-BA:144,0
-BA:144,0
-BA:144,0
-BA:144,0
-BA:149,0
-BA:149,0
-BA:149,0
-BA:149,0
-BA:688,0
-BA:688,0
-BA:688,0
-BA:688,0
-BA:1077,0
-BA:1077,0
-BA:1077,0
-BA:1077,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-BA:1081,0
-LF:76
-LH:16
-end_of_record
-SF:/usr/include/c++/4.3/bits/stream_iterator.h
-FN:181,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERSoPKc
-FN:185,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEC1ERKS2_
-FN:202,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEdeEv
-FN:206,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEppEv
-FN:191,_ZNSt16ostream_iteratorISscSt11char_traitsIcEEaSERKSs
-DA:181,0
-DA:182,0
-DA:185,0
-DA:186,0
-DA:191,0
-DA:196,0
-DA:197,0
-DA:198,0
-DA:202,0
-DA:203,0
-DA:206,0
-DA:207,0
-BA:197,0
-BA:197,0
-LF:12
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/vector.tcc
-FN:283,_ZNSt6vectorISsSaISsEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPSsS1_EERKSs
-FN:70,_ZNSt6vectorIPN8pkgCache7VerFileESaIS2_EE7reserveEj
-FN:283,_ZNSt6vectorIPN8pkgCache7VerFileESaIS2_EE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPS2_S4_EERKS2_
-DA:70,0
-DA:72,0
-DA:73,0
-DA:74,0
-DA:76,0
-DA:79,0
-DA:80,0
-DA:82,0
-DA:85,0
-DA:86,0
-DA:87,0
-DA:89,0
-DA:283,0
-DA:286,0
-DA:288,0
-DA:291,0
-DA:293,0
-DA:295,0
-DA:299,0
-DA:307,0
-DA:308,0
-DA:309,0
-DA:316,0
-DA:321,0
-DA:323,0
-DA:324,0
-DA:330,0
-DA:332,0
-DA:333,0
-DA:334,0
-DA:336,0
-DA:338,0
-DA:341,0
-DA:342,0
-DA:343,0
-DA:345,0
-BA:72,0
-BA:72,0
-BA:74,0
-BA:74,0
-BA:286,0
-BA:286,0
-BA:286,0
-BA:286,0
-LF:36
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/exception
-FN:59,_ZNSt9exceptionC2Ev
-DA:59,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:107,_ZN9__gnu_cxx13new_allocatorIPN8pkgCache7VerFileEE9constructEPS3_RKS3_
-FN:69,_ZN9__gnu_cxx13new_allocatorIPN8pkgCache7VerFileEEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIPN8pkgCache7VerFileEED2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorIPN8pkgCache7VerFileEE8max_sizeEv
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:76,_ZN9__gnu_cxx13new_allocatorISsED2Ev
-FN:69,_ZN9__gnu_cxx13new_allocatorISsEC2Ev
-FN:101,_ZNK9__gnu_cxx13new_allocatorISsE8max_sizeEv
-FN:71,_ZN9__gnu_cxx13new_allocatorIPN8pkgCache7VerFileEEC2ERKS4_
-FN:97,_ZN9__gnu_cxx13new_allocatorISsE10deallocateEPSsj
-FN:97,_ZN9__gnu_cxx13new_allocatorIPN8pkgCache7VerFileEE10deallocateEPS3_j
-FN:107,_ZN9__gnu_cxx13new_allocatorISsE9constructEPSsRKSs
-FN:87,_ZN9__gnu_cxx13new_allocatorIPN8pkgCache7VerFileEE8allocateEjPKv
-FN:87,_ZN9__gnu_cxx13new_allocatorISsE8allocateEjPKv
-DA:69,0
-DA:71,9
-DA:76,0
-DA:87,0
-DA:89,0
-DA:90,0
-DA:92,0
-DA:97,0
-DA:98,0
-DA:101,0
-DA:102,0
-DA:107,0
-DA:108,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:89,0
-BA:108,0
-BA:108,0
-BA:108,0
-BA:108,0
-LF:13
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/ext/type_traits.h
-FN:154,_ZN9__gnu_cxx17__is_null_pointerIcEEbPT_
-DA:154,0
-DA:155,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iosfwd
-FN:68,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEED1Ev
-DA:68,0
-BA:68,0
-BA:68,0
-LF:1
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,2
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/istream
-FN:585,_ZNSiC2Ev
-FN:105,_ZNSiD2Ev
-FN:804,_ZNSdC2Ev
-FN:801,_ZNSdD2Ev
-DA:105,0
-DA:106,0
-DA:585,0
-DA:586,0
-DA:587,0
-DA:801,0
-DA:804,0
-DA:805,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:106,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-BA:801,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-FN:109,_ZdlPvS_
-DA:105,0
-DA:109,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ostream
-FN:365,_ZNSoC2Ev
-FN:95,_ZNSoD2Ev
-FN:512,_ZStlsISt11char_traitsIcEERSt13basic_ostreamIcT_ES5_PKc
-DA:95,0
-DA:365,0
-DA:366,0
-DA:512,0
-DA:514,0
-DA:515,0
-DA:517,0
-DA:519,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:95,0
-BA:514,0
-BA:514,0
-LF:8
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/sstream
-FN:96,_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:509,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode
-FN:536,_ZNSt18basic_stringstreamIcSt11char_traitsIcESaIcEED1Ev
-FN:124,_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv
-FN:555,_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv
-DA:96,0
-DA:97,0
-DA:98,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:130,0
-DA:131,0
-DA:133,0
-DA:136,0
-DA:137,0
-DA:509,0
-DA:510,0
-DA:511,0
-DA:536,0
-DA:537,0
-DA:555,0
-DA:556,0
-BA:127,0
-BA:127,0
-BA:130,0
-BA:130,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-BA:537,0
-LF:18
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/streambuf
-FN:513,_ZNKSt15basic_streambufIcSt11char_traitsIcEE4pptrEv
-FN:469,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5egptrEv
-FN:510,_ZNKSt15basic_streambufIcSt11char_traitsIcEE5pbaseEv
-FN:444,_ZNSt15basic_streambufIcSt11char_traitsIcEEC2Ev
-FN:197,_ZNSt15basic_streambufIcSt11char_traitsIcEED2Ev
-DA:197,0
-DA:198,0
-DA:444,0
-DA:447,0
-DA:448,0
-DA:469,0
-DA:510,0
-DA:513,0
-BA:198,0
-BA:198,0
-LF:8
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt/record.h
-DA:86,1
-BA:86,1
-BA:86,2
-LF:1
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/xapian.cpp
-FN:139,_Z41__static_initialization_and_destruction_0ii
-FN:139,_GLOBAL__I_xapian.cpp
-FN:85,_ZNK3ept4core6xapian6Source11docidByNameERKSs
-FN:66,_ZN3ept4core6xapian6Source7toLowerERKSs
-FN:76,_ZNK3ept4core6xapian6Source17normalize_and_addERN6Xapian8DocumentERKSsRi
-FN:54,_ZNK3ept4core6xapian6Source9timestampEv
-FN:58,_ZNK3ept4core6xapian6Source4openEv
-FN:124,_ZNK3ept4core6xapian6Source11getIntValueERKSsj
-FN:110,_ZNK3ept4core6xapian6Source14getDoubleValueERKSsj
-FN:94,_ZNK3ept4core6xapian6Source16makeRelatedQueryERKSs
-FN:49,_ZN3ept4core6xapian6SourceC1Ev
-FN:49,_ZN3ept4core6xapian6SourceC2Ev
-DA:49,4
-DA:50,4
-DA:52,4
-DA:54,9
-DA:55,9
-DA:58,9
-DA:59,9
-DA:60,9
-DA:61,9
-DA:62,9
-DA:64,9
-DA:66,0
-DA:68,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:72,0
-DA:76,0
-DA:78,0
-DA:79,0
-DA:80,0
-DA:81,0
-DA:82,0
-DA:83,0
-DA:85,0
-DA:87,0
-DA:88,0
-DA:89,0
-DA:91,0
-DA:94,0
-DA:96,0
-DA:99,0
-DA:100,0
-DA:101,0
-DA:102,0
-DA:103,0
-DA:106,0
-DA:110,0
-DA:112,0
-DA:113,0
-DA:114,0
-DA:115,0
-DA:116,0
-DA:117,0
-DA:118,0
-DA:120,0
-DA:124,0
-DA:126,0
-DA:127,0
-DA:128,0
-DA:129,0
-DA:130,0
-DA:131,0
-DA:132,0
-DA:134,0
-DA:139,3
-BA:59,2
-BA:59,1
-BA:70,0
-BA:70,0
-BA:81,0
-BA:81,0
-BA:88,0
-BA:88,0
-BA:102,0
-BA:102,0
-BA:113,0
-BA:113,0
-BA:117,0
-BA:117,0
-BA:127,0
-BA:127,0
-BA:131,0
-BA:131,0
-BA:139,2
-BA:139,1
-BA:139,2
-BA:139,1
-LF:56
-LH:12
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/xapian.h
-FN:258,_ZNK3ept4core6xapian6Source2dbEv
-DA:258,0
-DA:259,0
-DA:260,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:277,_ZNKSs7_M_dataEv
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:1544,_ZNKSs4dataEv
-FN:543,_ZNKSs5beginEv
-FN:562,_ZNKSs3endEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:192,_ZNKSs4_Rep12_M_is_sharedEv
-FN:652,_ZNKSs8capacityEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:200,_ZNSs4_Rep15_M_set_sharableEv
-FN:204,_ZNSs4_Rep26_M_set_length_and_sharableEj
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:870,_ZNSs9push_backEc
-FN:791,_ZNSspLEc
-FN:2162,_ZSteqIcEN9__gnu_cxx11__enable_ifIXsrSt9__is_charIT_E7__valueEbE6__typeERKSbIS3_St11char_traitsIS3_ESaIS3_EESC_
-FN:2201,_ZStneIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-DA:178,0
-DA:183,0
-DA:184,0
-DA:192,0
-DA:193,0
-DA:200,0
-DA:201,0
-DA:204,0
-DA:206,0
-DA:207,0
-DA:208,0
-DA:211,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:543,0
-DA:544,0
-DA:562,0
-DA:563,0
-DA:606,0
-DA:607,0
-DA:652,0
-DA:653,0
-DA:686,0
-DA:687,0
-DA:791,0
-DA:793,0
-DA:794,0
-DA:870,0
-DA:872,0
-DA:873,0
-DA:874,0
-DA:875,0
-DA:876,0
-DA:877,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-DA:2162,0
-DA:2165,0
-DA:2201,0
-DA:2202,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:873,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-LF:60
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.tcc
-FN:668,_ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_EPKS3_RKS6_
-DA:668,0
-DA:673,0
-DA:674,0
-DA:675,0
-DA:676,0
-DA:677,0
-DA:678,0
-LF:7
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:245,_ZNSt11char_traitsIcE6assignERcRKc
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-DA:245,0
-DA:246,0
-DA:257,0
-DA:258,0
-DA:261,0
-DA:262,0
-LF:6
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:703,_ZN9__gnu_cxx17__normal_iteratorIPKcSsEppEv
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPKcSsEdeEv
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPKcSsEC1ERKS2_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPKcSsE4baseEv
-FN:781,_ZN9__gnu_cxxneIPKcSsEEbRKNS_17__normal_iteratorIT_T0_EES8_
-DA:683,0
-DA:695,0
-DA:696,0
-DA:703,0
-DA:705,0
-DA:706,0
-DA:747,0
-DA:748,0
-DA:781,0
-DA:782,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-DA:69,0
-DA:71,0
-DA:76,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/xapian/base.h
-FN:164,_ZNK6Xapian8Internal9RefCntPtrINS_15PostingIterator8InternalEE3getEv
-FN:164,_ZNK6Xapian8Internal9RefCntPtrINS_12TermIterator8InternalEE3getEv
-FN:94,_ZN6Xapian8Internal9RefCntPtrINS_5Query8InternalEEC1EPS3_
-FN:130,_ZN6Xapian8Internal9RefCntPtrINS_5Query8InternalEED1Ev
-DA:94,0
-DA:96,0
-DA:97,0
-DA:130,0
-DA:132,0
-DA:136,0
-DA:137,0
-DA:138,0
-DA:140,0
-DA:164,20
-DA:166,20
-BA:96,0
-BA:96,0
-BA:132,0
-BA:132,0
-BA:132,0
-BA:132,0
-BA:132,0
-BA:132,0
-BA:138,0
-BA:138,0
-LF:11
-LH:2
-end_of_record
-SF:/usr/include/xapian/database.h
-FN:124,_ZNK6Xapian8Database12postlist_endERKSs
-DA:124,10
-DA:125,10
-LF:2
-LH:2
-end_of_record
-SF:/usr/include/xapian/document.h
-FN:170,_ZNK6Xapian8Document12termlist_endEv
-DA:170,0
-DA:171,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/xapian/enquire.h
-FN:374,_ZN6XapianeqERKNS_12MSetIteratorES2_
-FN:258,_ZN6Xapian12MSetIteratorD1Ev
-DA:258,0
-DA:374,0
-DA:376,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/xapian/postingiterator.h
-FN:150,_ZN6XapianeqERKNS_15PostingIteratorES2_
-DA:150,10
-DA:152,10
-LF:2
-LH:2
-end_of_record
-SF:/usr/include/xapian/query.h
-FN:258,_ZN6Xapian5QueryC1INS_12TermIteratorEEENS0_2opET_S4_j
-DA:258,0
-DA:259,0
-DA:262,0
-DA:265,0
-DA:266,0
-DA:267,0
-DA:270,0
-DA:271,0
-DA:272,0
-DA:273,0
-DA:275,0
-BA:265,0
-BA:265,0
-LF:11
-LH:0
-end_of_record
-SF:/usr/include/xapian/termiterator.h
-FN:136,_ZN6XapianeqERKNS_12TermIteratorES2_
-FN:142,_ZN6XapianneERKNS_12TermIteratorES2_
-DA:136,0
-DA:138,0
-DA:142,0
-DA:144,0
-LF:4
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt/record.cpp
-FN:16,_Z41__static_initialization_and_destruction_0ii
-FN:16,_GLOBAL__I_record.cpp
-DA:16,3
-BA:16,2
-BA:16,1
-BA:16,2
-BA:16,1
-LF:1
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt/record.h
-DA:86,1
-BA:86,1
-BA:86,2
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-DA:178,0
-DA:183,0
-DA:184,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-LF:25
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-DA:69,0
-DA:71,0
-DA:76,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,1
-LF:1
-LH:1
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt/recordparser.cpp
-FN:39,_ZN3ept4core6record9rpcompareC1ERKNS1_12RecordParserE
-FN:111,_ZNK3ept4core6record12RecordParser5fieldEj
-FN:130,_ZNK3ept4core6record12RecordParser6lookupEj
-FN:121,_ZNK3ept4core6record12RecordParser4nameEj
-FN:146,_ZNK3ept4core6record12RecordParser5indexERKSs
-FN:40,_ZN3ept4core6record9rpcompareclEjj
-FN:46,_ZN3ept4core6record12RecordParser4scanERKSs
-DA:39,1310
-DA:40,89600
-DA:42,89600
-DA:46,1310
-DA:48,1310
-DA:49,1310
-DA:50,1310
-DA:55,1310
-DA:56,1310
-DA:57,29815
-DA:60,28505
-DA:64,28505
-DA:67,1
-DA:68,1
-DA:69,1
-DA:70,1
-DA:73,28504
-DA:77,28504
-DA:80,1309
-DA:81,1309
-DA:82,1309
-DA:86,27195
-DA:89,0
-DA:90,0
-DA:91,0
-DA:95,27195
-DA:98,17224
-DA:99,17224
-DA:105,1310
-DA:109,1310
-DA:111,187124
-DA:113,187124
-DA:114,1
-DA:115,187123
-DA:116,16577
-DA:118,170546
-DA:121,185814
-DA:123,185814
-DA:124,185814
-DA:125,185814
-DA:126,2
-DA:127,185812
-DA:130,1310
-DA:132,1310
-DA:133,1310
-DA:134,1310
-DA:135,1
-DA:137,1309
-DA:139,1309
-DA:141,3927
-DA:142,1309
-DA:143,1309
-DA:146,1310
-DA:151,1310
-DA:152,7924
-DA:154,5304
-DA:156,5304
-DA:157,1724
-DA:159,3580
-DA:162,1310
-DA:163,1
-DA:165,1309
-BA:57,2
-BA:57,1
-BA:64,2
-BA:64,2
-BA:77,2
-BA:77,2
-BA:86,1
-BA:86,2
-BA:95,2
-BA:95,2
-BA:113,2
-BA:113,2
-BA:115,2
-BA:115,2
-BA:125,2
-BA:125,2
-BA:134,2
-BA:134,2
-BA:137,2
-BA:137,1
-BA:137,2
-BA:137,2
-BA:137,2
-BA:137,2
-BA:141,2
-BA:141,1
-BA:141,2
-BA:141,2
-BA:141,2
-BA:141,2
-BA:152,2
-BA:152,2
-BA:156,2
-BA:156,2
-BA:162,2
-BA:162,1
-BA:162,2
-BA:162,2
-BA:162,2
-BA:162,1
-BA:162,0
-BA:162,0
-BA:162,2
-BA:162,2
-LF:62
-LH:59
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt/recordparser.h
-FN:90,_ZNK3ept4core6record12RecordParser4sizeEv
-DA:90,1311
-LF:1
-LH:1
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:100,_ZNSaIcEC1ERKS_
-FN:100,_ZNSaIcEC2ERKS_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:277,_ZNKSs7_M_dataEv
-FN:285,_ZNKSs6_M_repEv
-FN:606,_ZNKSs4sizeEv
-FN:686,_ZNKSs5emptyEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:1544,_ZNKSs4dataEv
-FN:392,_ZNSs10_S_compareEjj
-FN:188,_ZNKSs4_Rep12_M_is_leakedEv
-FN:1551,_ZNKSs13get_allocatorEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1941,_ZNKSs7compareERKSs
-FN:2275,_ZStgtIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:2238,_ZStltIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:2162,_ZSteqIcEN9__gnu_cxx11__enable_ifIXsrSt9__is_charIT_E7__valueEbE6__typeERKSbIS3_St11char_traitsIS3_ESaIS3_EESC_
-FN:2201,_ZStneIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_ES8_
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-FN:1593,_ZNKSs4findEPKcj
-FN:306,_ZNKSs8_M_checkEjPKc
-FN:1923,_ZNKSs6substrEjj
-FN:501,_ZNSsaSERKSs
-FN:644,_ZNSs6resizeEj
-FN:299,_ZNSs7_M_leakEv
-FN:718,_ZNSsixEj
-DA:178,0
-DA:183,0
-DA:184,0
-DA:188,0
-DA:189,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:299,0
-DA:301,0
-DA:302,0
-DA:303,0
-DA:306,0
-DA:308,0
-DA:309,0
-DA:310,0
-DA:392,0
-DA:394,0
-DA:401,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:501,0
-DA:502,0
-DA:606,0
-DA:607,0
-DA:644,0
-DA:645,0
-DA:686,0
-DA:687,0
-DA:718,0
-DA:724,0
-DA:725,0
-DA:1544,0
-DA:1545,0
-DA:1551,0
-DA:1552,0
-DA:1593,0
-DA:1596,0
-DA:1923,0
-DA:1925,0
-DA:1941,0
-DA:1943,0
-DA:1944,0
-DA:1945,0
-DA:1947,0
-DA:1948,0
-DA:1949,0
-DA:1950,0
-DA:2067,0
-DA:2069,0
-DA:2162,0
-DA:2165,0
-DA:2201,0
-DA:2202,0
-DA:2238,0
-DA:2239,0
-DA:2275,1024110
-DA:2276,1024110
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-BA:301,0
-BA:301,0
-BA:308,0
-BA:308,0
-BA:1948,0
-BA:1948,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-BA:2165,0
-LF:71
-LH:2
-end_of_record
-SF:/usr/include/c++/4.3/bits/char_traits.h
-FN:257,_ZNSt11char_traitsIcE7compareEPKcS2_j
-FN:261,_ZNSt11char_traitsIcE6lengthEPKc
-DA:257,0
-DA:258,0
-DA:261,0
-DA:262,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algo.h
-FN:1568,_ZSt13__heap_selectIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEN3ept4core6record9rpcompareEEvT_SB_SB_T0_
-FN:4661,_ZSt12partial_sortIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEN3ept4core6record9rpcompareEEvT_SB_SB_T0_
-FN:123,_ZSt8__medianIjN3ept4core6record9rpcompareEERKT_S6_S6_S6_T0_
-FN:1877,_ZSt21__unguarded_partitionIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEjN3ept4core6record9rpcompareEET_SB_SB_T0_T1_
-FN:1930,_ZSt16__introsort_loopIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEiN3ept4core6record9rpcompareEEvT_SB_T0_T1_
-FN:1731,_ZSt25__unguarded_linear_insertIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEjN3ept4core6record9rpcompareEEvT_T0_T1_
-FN:1806,_ZSt26__unguarded_insertion_sortIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEN3ept4core6record9rpcompareEEvT_SB_T0_
-FN:1771,_ZSt16__insertion_sortIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEN3ept4core6record9rpcompareEEvT_SB_T0_
-FN:1840,_ZSt22__final_insertion_sortIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEN3ept4core6record9rpcompareEEvT_SB_T0_
-FN:1970,_ZSt4__lgi
-FN:4806,_ZSt4sortIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEN3ept4core6record9rpcompareEEvT_SB_T0_
-DA:123,87
-DA:128,87
-DA:129,75
-DA:130,12
-DA:131,63
-DA:132,0
-DA:134,63
-DA:135,12
-DA:136,9
-DA:137,3
-DA:138,3
-DA:140,0
-DA:1568,0
-DA:1570,0
-DA:1571,0
-DA:1572,0
-DA:1573,0
-DA:1574,0
-DA:1731,14678
-DA:1733,14678
-DA:1734,14678
-DA:1735,85248
-DA:1737,55892
-DA:1738,55892
-DA:1739,55892
-DA:1741,14678
-DA:1742,14678
-DA:1771,1310
-DA:1773,1310
-DA:1775,18435
-DA:1778,17125
-DA:1779,17125
-DA:1781,2546
-DA:1782,2546
-DA:1785,14579
-DA:1806,87
-DA:1811,186
-DA:1812,99
-DA:1813,87
-DA:1840,1310
-DA:1842,1310
-DA:1844,87
-DA:1845,87
-DA:1849,1223
-DA:1850,1310
-DA:1877,507
-DA:1879,420
-DA:1881,1314
-DA:1882,300
-DA:1883,507
-DA:1884,1365
-DA:1885,351
-DA:1886,507
-DA:1887,87
-DA:1888,420
-DA:1889,420
-DA:1930,1397
-DA:1935,2881
-DA:1937,87
-DA:1939,0
-DA:1940,0
-DA:1942,87
-DA:1952,87
-DA:1953,87
-DA:1954,87
-DA:1970,0
-DA:1971,0
-DA:4661,0
-DA:4674,0
-DA:4675,0
-DA:4676,0
-DA:4806,1310
-DA:4818,1310
-DA:4820,1310
-DA:4822,1310
-DA:4824,1310
-BA:128,2
-BA:128,2
-BA:129,2
-BA:129,2
-BA:131,1
-BA:131,2
-BA:135,2
-BA:135,2
-BA:137,2
-BA:137,1
-BA:1571,0
-BA:1571,0
-BA:1572,0
-BA:1572,0
-BA:1735,2
-BA:1735,2
-BA:1773,2
-BA:1773,1
-BA:1775,2
-BA:1775,2
-BA:1779,2
-BA:1779,2
-BA:1811,2
-BA:1811,2
-BA:1842,2
-BA:1842,2
-BA:1881,2
-BA:1881,2
-BA:1884,2
-BA:1884,2
-BA:1886,2
-BA:1886,2
-BA:1935,2
-BA:1935,2
-BA:1937,1
-BA:1937,2
-BA:4818,2
-BA:4818,1
-LF:76
-LH:60
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_algobase.h
-FN:188,_ZSt3minIjERKT_S2_S2_
-FN:286,_ZNSt12__miter_baseIPjLb0EE3__bES0_
-FN:210,_ZSt3maxIjERKT_S2_S2_
-FN:268,_ZNSt12__niter_baseIPjLb0EE3__bES0_
-FN:286,_ZNSt12__miter_baseIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEELb0EE3__bES6_
-FN:104,_ZNSt11__iter_swapILb1EE9iter_swapIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEES8_EEvT_T0_
-FN:121,_ZSt9iter_swapIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEES6_EvT_T0_
-FN:276,_ZNSt12__niter_baseIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEELb1EE3__bES6_
-FN:569,_ZNSt20__copy_move_backwardILb0ELb1ESt26random_access_iterator_tagE13__copy_move_bIjEEPT_PKS3_S6_S4_
-FN:579,_ZSt22__copy_move_backward_aILb0EPjS0_ET1_T0_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EPjS0_ET1_T0_S2_S1_
-FN:624,_ZSt13copy_backwardIPjS0_ET0_T_S2_S1_
-FN:597,_ZSt23__copy_move_backward_a2ILb0EN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEES6_ET1_T0_S8_S7_
-FN:624,_ZSt13copy_backwardIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEES6_ET0_T_S8_S7_
-FN:375,_ZNSt11__copy_moveILb0ELb1ESt26random_access_iterator_tagE8__copy_mIjEEPT_PKS3_S6_S4_
-FN:385,_ZSt13__copy_move_aILb0EPjS0_ET1_T0_S2_S1_
-FN:430,_ZSt14__copy_move_a2ILb0EPjS0_ET1_T0_S2_S1_
-FN:456,_ZSt4copyIPjS0_ET0_T_S2_S1_
-DA:104,1225
-DA:106,1225
-DA:107,1225
-DA:121,1225
-DA:142,1225
-DA:146,1225
-DA:188,0
-DA:193,0
-DA:194,0
-DA:195,0
-DA:210,0
-DA:215,0
-DA:216,0
-DA:217,0
-DA:268,80616
-DA:269,80616
-DA:276,22845
-DA:277,22845
-DA:286,68974
-DA:287,68974
-DA:375,26872
-DA:377,26872
-DA:379,26872
-DA:385,26872
-DA:393,26872
-DA:396,26872
-DA:430,26872
-DA:435,26872
-DA:456,26872
-DA:466,26872
-DA:569,7615
-DA:571,7615
-DA:572,7615
-DA:573,7615
-DA:579,7615
-DA:587,7615
-DA:592,7615
-DA:597,7615
-DA:602,7615
-DA:624,7615
-DA:636,7615
-BA:193,0
-BA:193,0
-BA:215,0
-BA:215,0
-LF:41
-LH:33
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_construct.h
-FN:97,_ZSt8_DestroyIPjEvT_S1_
-FN:126,_ZSt8_DestroyIPjjEvT_S1_RSaIT0_E
-DA:97,0
-DA:104,0
-DA:126,0
-DA:128,0
-DA:129,0
-LF:5
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_heap.h
-FN:177,_ZSt11__push_heapIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEijN3ept4core6record9rpcompareEEvT_T0_SC_T1_T2_
-FN:295,_ZSt13__adjust_heapIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEijN3ept4core6record9rpcompareEEvT_T0_SC_T1_T2_
-FN:412,_ZSt9make_heapIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEN3ept4core6record9rpcompareEEvT_SB_T0_
-FN:322,_ZSt10__pop_heapIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEN3ept4core6record9rpcompareEEvT_SB_SB_T0_
-FN:350,_ZSt8pop_heapIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEN3ept4core6record9rpcompareEEvT_SB_T0_
-FN:477,_ZSt9sort_heapIN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEEN3ept4core6record9rpcompareEEvT_SB_T0_
-DA:177,0
-DA:179,0
-DA:180,0
-DA:183,0
-DA:184,0
-DA:185,0
-DA:187,0
-DA:188,0
-DA:295,0
-DA:297,0
-DA:298,0
-DA:299,0
-DA:301,0
-DA:302,0
-DA:304,0
-DA:305,0
-DA:306,0
-DA:308,0
-DA:310,0
-DA:311,0
-DA:313,0
-DA:315,0
-DA:317,0
-DA:322,0
-DA:329,0
-DA:330,0
-DA:331,0
-DA:334,0
-DA:350,0
-DA:358,0
-DA:359,0
-DA:412,0
-DA:424,0
-DA:425,0
-DA:427,0
-DA:428,0
-DA:429,0
-DA:431,0
-DA:432,0
-DA:434,0
-DA:435,0
-DA:436,0
-DA:477,0
-DA:485,0
-DA:486,0
-DA:487,0
-BA:180,0
-BA:180,0
-BA:180,0
-BA:180,0
-BA:180,0
-BA:180,0
-BA:299,0
-BA:299,0
-BA:302,0
-BA:302,0
-BA:308,0
-BA:308,0
-BA:308,0
-BA:308,0
-BA:424,0
-BA:424,0
-BA:434,0
-BA:434,0
-BA:485,0
-BA:485,0
-LF:46
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_iterator.h
-FN:683,_ZN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEC1ERKS1_
-FN:747,_ZNK9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEE4baseEv
-FN:781,_ZN9__gnu_cxxneIPjSt6vectorIjSaIjEEEEbRKNS_17__normal_iteratorIT_T0_EESA_
-FN:846,_ZN9__gnu_cxxmiIPjSt6vectorIjSaIjEEEENS_17__normal_iteratorIT_T0_E15difference_typeERKS8_SB_
-FN:695,_ZNK9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEdeEv
-FN:735,_ZNK9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEplERKi
-FN:743,_ZNK9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEmiERKi
-FN:703,_ZN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEppEv
-FN:715,_ZN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEmmEv
-FN:794,_ZN9__gnu_cxxltIPjSt6vectorIjSaIjEEEEbRKNS_17__normal_iteratorIT_T0_EESA_
-FN:769,_ZN9__gnu_cxxeqIPjSt6vectorIjSaIjEEEEbRKNS_17__normal_iteratorIT_T0_EESA_
-FN:722,_ZN9__gnu_cxx17__normal_iteratorIPjSt6vectorIjSaIjEEEmmEi
-DA:683,41456
-DA:695,706306
-DA:696,706306
-DA:703,53554
-DA:705,53554
-DA:706,53554
-DA:715,213106
-DA:717,213106
-DA:718,213106
-DA:722,0
-DA:723,0
-DA:735,12297
-DA:736,12297
-DA:743,252
-DA:744,252
-DA:747,204735
-DA:748,204735
-DA:769,3928
-DA:770,3928
-DA:781,59564
-DA:782,59564
-DA:794,1477
-DA:795,1477
-DA:846,12540
-DA:847,12540
-LF:25
-LH:23
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_move.h
-FN:80,_ZSt4swapIjEvRT_S1_
-DA:80,1225
-DA:85,1225
-DA:86,1225
-DA:87,1225
-DA:88,1225
-LF:5
-LH:5
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_uninitialized.h
-FN:97,_ZNSt20__uninitialized_copyILb1EE18uninitialized_copyIPjS2_EET0_T_S4_S3_
-FN:113,_ZSt18uninitialized_copyIPjS0_ET0_T_S2_S1_
-FN:261,_ZSt22__uninitialized_copy_aIPjS0_jET0_T_S2_S1_RSaIT1_E
-FN:268,_ZSt22__uninitialized_move_aIPjS0_SaIjEET0_T_S3_S2_RT1_
-DA:97,26872
-DA:98,26872
-DA:113,26872
-DA:122,26872
-DA:261,26872
-DA:262,26872
-DA:268,26872
-DA:272,26872
-LF:8
-LH:8
-end_of_record
-SF:/usr/include/c++/4.3/bits/stl_vector.h
-FN:484,_ZNKSt6vectorIjSaIjEE4sizeEv
-FN:577,_ZNKSt6vectorIjSaIjEEixEj
-FN:97,_ZNSt12_Vector_baseIjSaIjEE19_M_get_Tp_allocatorEv
-FN:395,_ZNSt6vectorIjSaIjEE3endEv
-FN:377,_ZNSt6vectorIjSaIjEE5beginEv
-FN:1089,_ZNSt6vectorIjSaIjEE15_M_erase_at_endEPj
-FN:891,_ZNSt6vectorIjSaIjEE5clearEv
-FN:101,_ZNKSt12_Vector_baseIjSaIjEE19_M_get_Tp_allocatorEv
-FN:489,_ZNKSt6vectorIjSaIjEE8max_sizeEv
-FN:1075,_ZNKSt6vectorIjSaIjEE12_M_check_lenEjPKc
-FN:143,_ZNSt12_Vector_baseIjSaIjEE11_M_allocateEj
-FN:147,_ZNSt12_Vector_baseIjSaIjEE13_M_deallocateEPjj
-FN:686,_ZNSt6vectorIjSaIjEE9push_backERKj
-DA:97,0
-DA:98,0
-DA:101,26872
-DA:102,26872
-DA:143,13436
-DA:144,13436
-DA:147,0
-DA:149,0
-DA:150,0
-DA:151,0
-DA:377,3928
-DA:378,3928
-DA:395,17364
-DA:396,17364
-DA:484,0
-DA:485,0
-DA:489,26872
-DA:490,26872
-DA:577,1925195
-DA:578,1925195
-DA:686,110770
-DA:688,110770
-DA:690,97334
-DA:691,97334
-DA:694,13436
-DA:695,110770
-DA:891,7856
-DA:892,7856
-DA:1075,13436
-DA:1077,13436
-DA:1078,0
-DA:1080,13436
-DA:1081,13436
-DA:1089,7856
-DA:1091,7856
-DA:1092,7856
-DA:1093,7856
-BA:144,2
-BA:144,1
-BA:149,0
-BA:149,0
-BA:688,2
-BA:688,2
-BA:1077,1
-BA:1077,2
-BA:1081,2
-BA:1081,1
-BA:1081,1
-BA:1081,2
-LF:37
-LH:28
-end_of_record
-SF:/usr/include/c++/4.3/bits/vector.tcc
-FN:283,_ZNSt6vectorIjSaIjEE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPjS1_EERKj
-DA:283,13436
-DA:286,13436
-DA:288,0
-DA:291,0
-DA:293,0
-DA:295,0
-DA:299,0
-DA:307,13436
-DA:308,13436
-DA:309,13436
-DA:316,13436
-DA:321,13436
-DA:323,13436
-DA:324,13436
-DA:330,0
-DA:332,0
-DA:333,0
-DA:334,0
-DA:336,13436
-DA:338,13436
-DA:341,13436
-DA:342,13436
-DA:343,13436
-DA:345,13436
-BA:286,1
-BA:286,2
-LF:24
-LH:15
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:107,_ZN9__gnu_cxx13new_allocatorIjE9constructEPjRKj
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-FN:101,_ZNK9__gnu_cxx13new_allocatorIjE8max_sizeEv
-FN:87,_ZN9__gnu_cxx13new_allocatorIjE8allocateEjPKv
-FN:97,_ZN9__gnu_cxx13new_allocatorIjE10deallocateEPjj
-DA:69,0
-DA:71,0
-DA:76,0
-DA:87,13436
-DA:89,13436
-DA:90,0
-DA:92,13436
-DA:97,0
-DA:98,0
-DA:101,40308
-DA:102,40308
-DA:107,110770
-DA:108,110770
-BA:89,1
-BA:89,2
-BA:108,2
-BA:108,1
-LF:13
-LH:7
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/new
-FN:105,_ZnwjPv
-DA:105,0
-LF:1
-LH:0
-end_of_record
-TN:
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt/record.h
-DA:86,2
-BA:86,2
-BA:86,1
-LF:1
-LH:1
-end_of_record
-SF:/home/mornfall/dev/pkg/ept-work/ept/core/apt.cpp
-FN:23,_Z41__static_initialization_and_destruction_0ii
-FN:23,_GLOBAL__I_apt.cpp
-FN:9,_ZN3ept4core12aptTimestampEv
-DA:9,45
-DA:12,45
-DA:13,45
-DA:16,45
-DA:17,45
-DA:19,45
-DA:23,6
-BA:13,2
-BA:13,1
-BA:17,2
-BA:17,1
-BA:19,2
-BA:19,1
-BA:23,2
-BA:23,1
-BA:23,2
-BA:23,1
-LF:7
-LH:7
-end_of_record
-SF:/usr/include/c++/4.3/backward/auto_ptr.h
-FN:263,_ZNSt8auto_ptrI4statEC1ESt12auto_ptr_refIS0_E
-FN:214,_ZNKSt8auto_ptrI4statE3getEv
-FN:197,_ZNKSt8auto_ptrI4statEptEv
-FN:228,_ZNSt8auto_ptrI4statE7releaseEv
-FN:56,_ZNSt12auto_ptr_refI4statEC1EPS0_
-FN:278,_ZNSt8auto_ptrI4statEcvSt12auto_ptr_refIT_EIS0_EEv
-FN:173,_ZNSt8auto_ptrI4statED1Ev
-DA:56,0
-DA:173,0
-DA:197,0
-DA:200,0
-DA:214,0
-DA:228,0
-DA:230,0
-DA:231,0
-DA:232,0
-DA:263,0
-DA:264,0
-DA:278,0
-DA:279,0
-LF:13
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/allocator.h
-FN:98,_ZNSaIcEC1Ev
-FN:106,_ZNSaIcED1Ev
-FN:106,_ZNSaIcED2Ev
-FN:100,_ZNSaIcEC2ERKS_
-FN:100,_ZNSaIcEC1ERKS_
-DA:98,0
-DA:100,0
-DA:101,0
-DA:106,0
-LF:4
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/bits/basic_string.h
-FN:277,_ZNKSs7_M_dataEv
-FN:258,_ZNSs12_Alloc_hiderD1Ev
-FN:285,_ZNKSs6_M_repEv
-FN:214,_ZNSs4_Rep10_M_refdataEv
-FN:178,_ZNSs4_Rep12_S_empty_repEv
-FN:411,_ZNSs12_S_empty_repEv
-FN:259,_ZNSs12_Alloc_hiderC1EPcRKSaIcE
-FN:2067,_ZNSsC1Ev
-FN:1551,_ZNKSs13get_allocatorEv
-FN:229,_ZNSs4_Rep10_M_disposeERKSaIcE
-FN:493,_ZNSsD1Ev
-DA:178,0
-DA:183,0
-DA:184,0
-DA:214,0
-DA:215,0
-DA:229,0
-DA:232,0
-DA:234,0
-DA:236,0
-DA:237,0
-DA:258,0
-DA:259,0
-DA:260,0
-DA:277,0
-DA:278,0
-DA:285,0
-DA:286,0
-DA:411,0
-DA:412,0
-DA:493,0
-DA:494,0
-DA:1551,0
-DA:1552,0
-DA:2067,0
-DA:2069,0
-BA:232,0
-BA:232,0
-BA:234,0
-BA:234,0
-LF:25
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/atomicity.h
-FN:67,_ZN9__gnu_cxxL25__exchange_and_add_singleEPii
-FN:50,_ZN9__gnu_cxxL18__exchange_and_addEPVii
-FN:80,_ZN9__gnu_cxxL27__exchange_and_add_dispatchEPii
-DA:50,0
-DA:51,0
-DA:67,0
-DA:69,0
-DA:70,0
-DA:71,0
-DA:80,0
-DA:83,0
-DA:84,0
-DA:86,0
-BA:83,0
-BA:83,0
-LF:10
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/ext/new_allocator.h
-FN:69,_ZN9__gnu_cxx13new_allocatorIcEC2Ev
-FN:76,_ZN9__gnu_cxx13new_allocatorIcED2Ev
-FN:71,_ZN9__gnu_cxx13new_allocatorIcEC2ERKS1_
-DA:69,0
-DA:71,0
-DA:76,0
-LF:3
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h
-FN:212,_ZL18__gthread_active_pv
-DA:212,0
-DA:216,0
-LF:2
-LH:0
-end_of_record
-SF:/usr/include/c++/4.3/iostream
-DA:77,2
-LF:1
-LH:1
-end_of_record
diff --git a/rep/ruby.png b/rep/ruby.png
deleted file mode 100644
index 991b6d4..0000000
--- a/rep/ruby.png
+++ /dev/null
diff --git a/rep/snow.png b/rep/snow.png
deleted file mode 100644
index 2cdae10..0000000
--- a/rep/snow.png
+++ /dev/null
diff --git a/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_apt_apt.cpp.gcov.html b/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_apt_apt.cpp.gcov.html
deleted file mode 100644
index f9f8cc1..0000000
--- a/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_apt_apt.cpp.gcov.html
+++ /dev/null
@@ -1,82 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_apt_apt.cpp</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../../index.html">directory</a> - <a href="index.html">srv/build/pkg/ept-work/default/ept</a> - ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_apt_apt.cpp</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">13</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">13</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #include &quot;/home/mornfall/dev/pkg/ept-work/ept/apt/apt.test.h&quot;
-<span class="lineNum">       2 </span>                : #define RUN(x,y) x().y()
-<span class="lineNum">       3 </span><span class="lineCov">              1 : void run_Apt_iterators() { RUN( TestApt, iterators ); }</span>
-<span class="lineNum">       4 </span><span class="lineCov">              1 : void run_Apt_aptExists() { RUN( TestApt, aptExists ); }</span>
-<span class="lineNum">       5 </span><span class="lineCov">              1 : void run_Apt_timestamp() { RUN( TestApt, timestamp ); }</span>
-<span class="lineNum">       6 </span><span class="lineCov">              1 : void run_Apt_validity() { RUN( TestApt, validity ); }</span>
-<span class="lineNum">       7 </span><span class="lineCov">              1 : void run_Apt_versions() { RUN( TestApt, versions ); }</span>
-<span class="lineNum">       8 </span><span class="lineCov">              1 : void run_Apt_versionValidity() { RUN( TestApt, versionValidity ); }</span>
-<span class="lineNum">       9 </span><span class="lineCov">              1 : void run_Apt_rawRecord() { RUN( TestApt, rawRecord ); }</span>
-<span class="lineNum">      10 </span><span class="lineCov">              1 : void run_Apt_state() { RUN( TestApt, state ); }</span>
-<span class="lineNum">      11 </span><span class="lineCov">              1 : void run_Apt_recordIteration() { RUN( TestApt, recordIteration ); }</span>
-<span class="lineNum">      12 </span><span class="lineCov">              1 : void run_Apt_recordIteration2() { RUN( TestApt, recordIteration2 ); }</span>
-<span class="lineNum">      13 </span><span class="lineCov">              1 : void run_Apt_stlIteration() { RUN( TestApt, stlIteration ); }</span>
-<span class="lineNum">      14 </span><span class="lineCov">              1 : void run_Apt_stlRecordIteration() { RUN( TestApt, stlRecordIteration ); }</span>
-<span class="lineNum">      15 </span><span class="lineCov">              4 : void run_Apt_checkUpdates() { RUN( TestApt, checkUpdates ); }</span>
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_apt_packagerecord.cpp.gcov.html b/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_apt_packagerecord.cpp.gcov.html
deleted file mode 100644
index 408a573..0000000
--- a/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_apt_packagerecord.cpp.gcov.html
+++ /dev/null
@@ -1,70 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_apt_packagerecord.cpp</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../../index.html">directory</a> - <a href="index.html">srv/build/pkg/ept-work/default/ept</a> - ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_apt_packagerecord.cpp</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">1</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">1</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #include &quot;/home/mornfall/dev/pkg/ept-work/ept/apt/packagerecord.test.h&quot;
-<span class="lineNum">       2 </span>                : #define RUN(x,y) x().y()
-<span class="lineNum">       3 </span><span class="lineCov">              4 : void run_AptPackagerecord_supportedFields() { RUN( TestAptPackagerecord, supportedFields ); }</span>
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_apt_recordparser.cpp.gcov.html b/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_apt_recordparser.cpp.gcov.html
deleted file mode 100644
index d951e99..0000000
--- a/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_apt_recordparser.cpp.gcov.html
+++ /dev/null
@@ -1,81 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_apt_recordparser.cpp</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../../index.html">directory</a> - <a href="index.html">srv/build/pkg/ept-work/default/ept</a> - ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_apt_recordparser.cpp</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">12</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">12</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #include &quot;/home/mornfall/dev/pkg/ept-work/ept/apt/recordparser.test.h&quot;
-<span class="lineNum">       2 </span>                : #define RUN(x,y) x().y()
-<span class="lineNum">       3 </span><span class="lineCov">              1 : void run_AptRecordparser_parsing() { RUN( TestAptRecordparser, parsing ); }</span>
-<span class="lineNum">       4 </span><span class="lineCov">              1 : void run_AptRecordparser_fieldTuples() { RUN( TestAptRecordparser, fieldTuples ); }</span>
-<span class="lineNum">       5 </span><span class="lineCov">              1 : void run_AptRecordparser_fieldKeys() { RUN( TestAptRecordparser, fieldKeys ); }</span>
-<span class="lineNum">       6 </span><span class="lineCov">              1 : void run_AptRecordparser_fieldValues() { RUN( TestAptRecordparser, fieldValues ); }</span>
-<span class="lineNum">       7 </span><span class="lineCov">              1 : void run_AptRecordparser_findByName() { RUN( TestAptRecordparser, findByName ); }</span>
-<span class="lineNum">       8 </span><span class="lineCov">              1 : void run_AptRecordparser_indexing() { RUN( TestAptRecordparser, indexing ); }</span>
-<span class="lineNum">       9 </span><span class="lineCov">              1 : void run_AptRecordparser_missingBehaviour() { RUN( TestAptRecordparser, missingBehaviour ); }</span>
-<span class="lineNum">      10 </span><span class="lineCov">              1 : void run_AptRecordparser_rescan() { RUN( TestAptRecordparser, rescan ); }</span>
-<span class="lineNum">      11 </span><span class="lineCov">              1 : void run_AptRecordparser_realLife() { RUN( TestAptRecordparser, realLife ); }</span>
-<span class="lineNum">      12 </span><span class="lineCov">              1 : void run_AptRecordparser_bufferTermination() { RUN( TestAptRecordparser, bufferTermination ); }</span>
-<span class="lineNum">      13 </span><span class="lineCov">              1 : void run_AptRecordparser_bufferTermination2() { RUN( TestAptRecordparser, bufferTermination2 ); }</span>
-<span class="lineNum">      14 </span><span class="lineCov">              4 : void run_AptRecordparser_bufferTermination3() { RUN( TestAptRecordparser, bufferTermination3 ); }</span>
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_apt_version.cpp.gcov.html b/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_apt_version.cpp.gcov.html
deleted file mode 100644
index 76973f9..0000000
--- a/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_apt_version.cpp.gcov.html
+++ /dev/null
@@ -1,75 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_apt_version.cpp</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../../index.html">directory</a> - <a href="index.html">srv/build/pkg/ept-work/default/ept</a> - ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_apt_version.cpp</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">6</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">6</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #include &quot;/home/mornfall/dev/pkg/ept-work/ept/apt/version.test.h&quot;
-<span class="lineNum">       2 </span>                : #define RUN(x,y) x().y()
-<span class="lineNum">       3 </span><span class="lineCov">              1 : void run_AptVersion_invalid() { RUN( TestAptVersion, invalid ); }</span>
-<span class="lineNum">       4 </span><span class="lineCov">              1 : void run_AptVersion_basic() { RUN( TestAptVersion, basic ); }</span>
-<span class="lineNum">       5 </span><span class="lineCov">              1 : void run_AptVersion_comparison() { RUN( TestAptVersion, comparison ); }</span>
-<span class="lineNum">       6 </span><span class="lineCov">              1 : void run_AptVersion_valueCopy() { RUN( TestAptVersion, valueCopy ); }</span>
-<span class="lineNum">       7 </span><span class="lineCov">              1 : void run_AptVersion_upstreamVersion() { RUN( TestAptVersion, upstreamVersion ); }</span>
-<span class="lineNum">       8 </span><span class="lineCov">              4 : void run_AptVersion_policyComparison() { RUN( TestAptVersion, policyComparison ); }</span>
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_apt.cpp.gcov.html b/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_apt.cpp.gcov.html
deleted file mode 100644
index f3bd875..0000000
--- a/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_apt.cpp.gcov.html
+++ /dev/null
@@ -1,81 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_apt.cpp</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../../index.html">directory</a> - <a href="index.html">srv/build/pkg/ept-work/default/ept</a> - ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_apt.cpp</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">12</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">12</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #include &quot;/home/mornfall/dev/pkg/ept-work/ept/core/apt.test.h&quot;
-<span class="lineNum">       2 </span>                : #define RUN(x,y) x().y()
-<span class="lineNum">       3 </span><span class="lineCov">              1 : void run_CoreApt_token() { RUN( TestCoreApt, token ); }</span>
-<span class="lineNum">       4 </span><span class="lineCov">              1 : void run_CoreApt_tokenVersion() { RUN( TestCoreApt, tokenVersion ); }</span>
-<span class="lineNum">       5 </span><span class="lineCov">              1 : void run_CoreApt_packageName() { RUN( TestCoreApt, packageName ); }</span>
-<span class="lineNum">       6 </span><span class="lineCov">              1 : void run_CoreApt_packageCount() { RUN( TestCoreApt, packageCount ); }</span>
-<span class="lineNum">       7 </span><span class="lineCov">              1 : void run_CoreApt_packageNameList() { RUN( TestCoreApt, packageNameList ); }</span>
-<span class="lineNum">       8 </span><span class="lineCov">              1 : void run_CoreApt_versionCount() { RUN( TestCoreApt, versionCount ); }</span>
-<span class="lineNum">       9 </span><span class="lineCov">              1 : void run_CoreApt_versionPackage() { RUN( TestCoreApt, versionPackage ); }</span>
-<span class="lineNum">      10 </span><span class="lineCov">              1 : void run_CoreApt_validate() { RUN( TestCoreApt, validate ); }</span>
-<span class="lineNum">      11 </span><span class="lineCov">              1 : void run_CoreApt_packageState() { RUN( TestCoreApt, packageState ); }</span>
-<span class="lineNum">      12 </span><span class="lineCov">              1 : void run_CoreApt_packageState2() { RUN( TestCoreApt, packageState2 ); }</span>
-<span class="lineNum">      13 </span><span class="lineCov">              1 : void run_CoreApt_exists() { RUN( TestCoreApt, exists ); }</span>
-<span class="lineNum">      14 </span><span class="lineCov">              4 : void run_CoreApt_invalidate() { RUN( TestCoreApt, invalidate ); }</span>
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_apt_action.cpp.gcov.html b/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_apt_action.cpp.gcov.html
deleted file mode 100644
index c1d30cf..0000000
--- a/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_apt_action.cpp.gcov.html
+++ /dev/null
@@ -1,72 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_apt_action.cpp</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../../index.html">directory</a> - <a href="index.html">srv/build/pkg/ept-work/default/ept</a> - ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_apt_action.cpp</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">3</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">3</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #include &quot;/home/mornfall/dev/pkg/ept-work/ept/core/apt/action.test.h&quot;
-<span class="lineNum">       2 </span>                : #define RUN(x,y) x().y()
-<span class="lineNum">       3 </span><span class="lineCov">              1 : void run_AptAction_basic() { RUN( TestAptAction, basic ); }</span>
-<span class="lineNum">       4 </span><span class="lineCov">              1 : void run_AptAction_revert() { RUN( TestAptAction, revert ); }</span>
-<span class="lineNum">       5 </span><span class="lineCov">              4 : void run_AptAction_keep() { RUN( TestAptAction, keep ); }</span>
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_apt_record.cpp.gcov.html b/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_apt_record.cpp.gcov.html
deleted file mode 100644
index 967467d..0000000
--- a/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_apt_record.cpp.gcov.html
+++ /dev/null
@@ -1,75 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_apt_record.cpp</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../../index.html">directory</a> - <a href="index.html">srv/build/pkg/ept-work/default/ept</a> - ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_apt_record.cpp</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">6</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">6</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #include &quot;/home/mornfall/dev/pkg/ept-work/ept/core/apt/record.test.h&quot;
-<span class="lineNum">       2 </span>                : #define RUN(x,y) x().y()
-<span class="lineNum">       3 </span><span class="lineCov">              1 : void run_AptRecord_checkLookup() { RUN( TestAptRecord, checkLookup ); }</span>
-<span class="lineNum">       4 </span><span class="lineCov">              1 : void run_AptRecord_checkLookupValue() { RUN( TestAptRecord, checkLookupValue ); }</span>
-<span class="lineNum">       5 </span><span class="lineCov">              1 : void run_AptRecord_checkLookupNumeric() { RUN( TestAptRecord, checkLookupNumeric ); }</span>
-<span class="lineNum">       6 </span><span class="lineCov">              1 : void run_AptRecord_checkShortDescription() { RUN( TestAptRecord, checkShortDescription ); }</span>
-<span class="lineNum">       7 </span><span class="lineCov">              1 : void run_AptRecord_checkList() { RUN( TestAptRecord, checkList ); }</span>
-<span class="lineNum">       8 </span><span class="lineCov">              4 : void run_AptRecord_nonexistent() { RUN( TestAptRecord, nonexistent ); }</span>
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_desktop.cpp.gcov.html b/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_desktop.cpp.gcov.html
deleted file mode 100644
index 3851297..0000000
--- a/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_desktop.cpp.gcov.html
+++ /dev/null
@@ -1,74 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_desktop.cpp</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../../index.html">directory</a> - <a href="index.html">srv/build/pkg/ept-work/default/ept</a> - ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_desktop.cpp</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">5</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">5</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #include &quot;/home/mornfall/dev/pkg/ept-work/ept/core/desktop.test.h&quot;
-<span class="lineNum">       2 </span>                : #define RUN(x,y) x().y()
-<span class="lineNum">       3 </span><span class="lineCov">              1 : void run_Desktop_iteration() { RUN( TestDesktop, iteration ); }</span>
-<span class="lineNum">       4 </span><span class="lineCov">              1 : void run_Desktop_groupProperty() { RUN( TestDesktop, groupProperty ); }</span>
-<span class="lineNum">       5 </span><span class="lineCov">              1 : void run_Desktop_groups() { RUN( TestDesktop, groups ); }</span>
-<span class="lineNum">       6 </span><span class="lineCov">              1 : void run_Desktop_groupList() { RUN( TestDesktop, groupList ); }</span>
-<span class="lineNum">       7 </span><span class="lineCov">              4 : void run_Desktop_emptyGroupList() { RUN( TestDesktop, emptyGroupList ); }</span>
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_xapian.cpp.gcov.html b/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_xapian.cpp.gcov.html
deleted file mode 100644
index 6e3ebb9..0000000
--- a/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_xapian.cpp.gcov.html
+++ /dev/null
@@ -1,73 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_xapian.cpp</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../../index.html">directory</a> - <a href="index.html">srv/build/pkg/ept-work/default/ept</a> - ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_xapian.cpp</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">4</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">4</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #include &quot;/home/mornfall/dev/pkg/ept-work/ept/core/xapian.test.h&quot;
-<span class="lineNum">       2 </span>                : #define RUN(x,y) x().y()
-<span class="lineNum">       3 </span><span class="lineCov">              1 : void run_Xapian_enquire() { RUN( TestXapian, enquire ); }</span>
-<span class="lineNum">       4 </span><span class="lineCov">              1 : void run_Xapian_listCount() { RUN( TestXapian, listCount ); }</span>
-<span class="lineNum">       5 </span><span class="lineCov">              1 : void run_Xapian_list() { RUN( TestXapian, list ); }</span>
-<span class="lineNum">       6 </span><span class="lineCov">              4 : void run_Xapian_checkQuery() { RUN( TestXapian, checkQuery ); }</span>
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_debtags.cpp.gcov.html b/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_debtags.cpp.gcov.html
deleted file mode 100644
index b72c713..0000000
--- a/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_debtags.cpp.gcov.html
+++ /dev/null
@@ -1,74 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_debtags.cpp</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../../index.html">directory</a> - <a href="index.html">srv/build/pkg/ept-work/default/ept</a> - ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_debtags.cpp</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">5</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">5</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #include &quot;/home/mornfall/dev/pkg/ept-work/ept/debtags/debtags.test.h&quot;
-<span class="lineNum">       2 </span>                : #define RUN(x,y) x().y()
-<span class="lineNum">       3 </span><span class="lineCov">              1 : void run_Debtags__1() { RUN( TestDebtags, _1 ); }</span>
-<span class="lineNum">       4 </span><span class="lineCov">              1 : void run_Debtags__2() { RUN( TestDebtags, _2 ); }</span>
-<span class="lineNum">       5 </span><span class="lineCov">              1 : void run_Debtags__3() { RUN( TestDebtags, _3 ); }</span>
-<span class="lineNum">       6 </span><span class="lineCov">              1 : void run_Debtags__4() { RUN( TestDebtags, _4 ); }</span>
-<span class="lineNum">       7 </span><span class="lineCov">              4 : void run_Debtags__5() { RUN( TestDebtags, _5 ); }</span>
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_expression.cpp.gcov.html b/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_expression.cpp.gcov.html
deleted file mode 100644
index 563e81e..0000000
--- a/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_expression.cpp.gcov.html
+++ /dev/null
@@ -1,70 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_expression.cpp</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../../index.html">directory</a> - <a href="index.html">srv/build/pkg/ept-work/default/ept</a> - ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_expression.cpp</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">1</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">1</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #include &quot;/home/mornfall/dev/pkg/ept-work/ept/debtags/expression.test.h&quot;
-<span class="lineNum">       2 </span>                : #define RUN(x,y) x().y()
-<span class="lineNum">       3 </span><span class="lineCov">              4 : void run_Expression__1() { RUN( TestExpression, _1 ); }</span>
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_maint_pkgid.cpp.gcov.html b/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_maint_pkgid.cpp.gcov.html
deleted file mode 100644
index 71f136f..0000000
--- a/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_maint_pkgid.cpp.gcov.html
+++ /dev/null
@@ -1,71 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_maint_pkgid.cpp</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../../index.html">directory</a> - <a href="index.html">srv/build/pkg/ept-work/default/ept</a> - ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_maint_pkgid.cpp</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">2</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">2</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #include &quot;/home/mornfall/dev/pkg/ept-work/ept/debtags/maint/pkgid.test.h&quot;
-<span class="lineNum">       2 </span>                : #define RUN(x,y) x().y()
-<span class="lineNum">       3 </span><span class="lineCov">              1 : void run_Pkgid__1() { RUN( TestPkgid, _1 ); }</span>
-<span class="lineNum">       4 </span><span class="lineCov">              4 : void run_Pkgid__2() { RUN( TestPkgid, _2 ); }</span>
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_maint_serializer.cpp.gcov.html b/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_maint_serializer.cpp.gcov.html
deleted file mode 100644
index 687eaf4..0000000
--- a/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_maint_serializer.cpp.gcov.html
+++ /dev/null
@@ -1,71 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_maint_serializer.cpp</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../../index.html">directory</a> - <a href="index.html">srv/build/pkg/ept-work/default/ept</a> - ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_maint_serializer.cpp</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">2</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">2</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #include &quot;/home/mornfall/dev/pkg/ept-work/ept/debtags/maint/serializer.test.h&quot;
-<span class="lineNum">       2 </span>                : #define RUN(x,y) x().y()
-<span class="lineNum">       3 </span><span class="lineCov">              1 : void run_Serializer__1() { RUN( TestSerializer, _1 ); }</span>
-<span class="lineNum">       4 </span><span class="lineCov">              4 : void run_Serializer__2() { RUN( TestSerializer, _2 ); }</span>
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_maint_vocabularymerger.cpp.gcov.html b/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_maint_vocabularymerger.cpp.gcov.html
deleted file mode 100644
index 5f9dbea..0000000
--- a/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_maint_vocabularymerger.cpp.gcov.html
+++ /dev/null
@@ -1,72 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_maint_vocabularymerger.cpp</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../../index.html">directory</a> - <a href="index.html">srv/build/pkg/ept-work/default/ept</a> - ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_maint_vocabularymerger.cpp</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">3</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">3</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #include &quot;/home/mornfall/dev/pkg/ept-work/ept/debtags/maint/vocabularymerger.test.h&quot;
-<span class="lineNum">       2 </span>                : #define RUN(x,y) x().y()
-<span class="lineNum">       3 </span><span class="lineCov">              1 : void run_VocabularyMerger__1() { RUN( TestVocabularyMerger, _1 ); }</span>
-<span class="lineNum">       4 </span><span class="lineCov">              1 : void run_VocabularyMerger__2() { RUN( TestVocabularyMerger, _2 ); }</span>
-<span class="lineNum">       5 </span><span class="lineCov">              4 : void run_VocabularyMerger__3() { RUN( TestVocabularyMerger, _3 ); }</span>
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_vocabulary.cpp.gcov.html b/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_vocabulary.cpp.gcov.html
deleted file mode 100644
index 45233da..0000000
--- a/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_vocabulary.cpp.gcov.html
+++ /dev/null
@@ -1,88 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_vocabulary.cpp</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../../index.html">directory</a> - <a href="index.html">srv/build/pkg/ept-work/default/ept</a> - ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_vocabulary.cpp</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">19</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">19</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #include &quot;/home/mornfall/dev/pkg/ept-work/ept/debtags/vocabulary.test.h&quot;
-<span class="lineNum">       2 </span>                : #define RUN(x,y) x().y()
-<span class="lineNum">       3 </span><span class="lineCov">              1 : void run_Vocabulary__1() { RUN( TestVocabulary, _1 ); }</span>
-<span class="lineNum">       4 </span><span class="lineCov">              1 : void run_Vocabulary__2() { RUN( TestVocabulary, _2 ); }</span>
-<span class="lineNum">       5 </span><span class="lineCov">              1 : void run_Vocabulary__3() { RUN( TestVocabulary, _3 ); }</span>
-<span class="lineNum">       6 </span><span class="lineCov">              1 : void run_Vocabulary__4() { RUN( TestVocabulary, _4 ); }</span>
-<span class="lineNum">       7 </span><span class="lineCov">              1 : void run_Vocabulary__5() { RUN( TestVocabulary, _5 ); }</span>
-<span class="lineNum">       8 </span><span class="lineCov">              1 : void run_Vocabulary__6() { RUN( TestVocabulary, _6 ); }</span>
-<span class="lineNum">       9 </span><span class="lineCov">              1 : void run_Vocabulary__7() { RUN( TestVocabulary, _7 ); }</span>
-<span class="lineNum">      10 </span><span class="lineCov">              1 : void run_Vocabulary__8() { RUN( TestVocabulary, _8 ); }</span>
-<span class="lineNum">      11 </span><span class="lineCov">              1 : void run_Vocabulary__9() { RUN( TestVocabulary, _9 ); }</span>
-<span class="lineNum">      12 </span><span class="lineCov">              1 : void run_Vocabulary__11() { RUN( TestVocabulary, _11 ); }</span>
-<span class="lineNum">      13 </span><span class="lineCov">              1 : void run_Vocabulary__12() { RUN( TestVocabulary, _12 ); }</span>
-<span class="lineNum">      14 </span><span class="lineCov">              1 : void run_Vocabulary__13() { RUN( TestVocabulary, _13 ); }</span>
-<span class="lineNum">      15 </span><span class="lineCov">              1 : void run_Vocabulary__14() { RUN( TestVocabulary, _14 ); }</span>
-<span class="lineNum">      16 </span><span class="lineCov">              1 : void run_Vocabulary__15() { RUN( TestVocabulary, _15 ); }</span>
-<span class="lineNum">      17 </span><span class="lineCov">              1 : void run_Vocabulary__16() { RUN( TestVocabulary, _16 ); }</span>
-<span class="lineNum">      18 </span><span class="lineCov">              1 : void run_Vocabulary__17() { RUN( TestVocabulary, _17 ); }</span>
-<span class="lineNum">      19 </span><span class="lineCov">              1 : void run_Vocabulary__18() { RUN( TestVocabulary, _18 ); }</span>
-<span class="lineNum">      20 </span><span class="lineCov">              1 : void run_Vocabulary__19() { RUN( TestVocabulary, _19 ); }</span>
-<span class="lineNum">      21 </span><span class="lineCov">              4 : void run_Vocabulary__21() { RUN( TestVocabulary, _21 ); }</span>
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_popcon_local.cpp.gcov.html b/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_popcon_local.cpp.gcov.html
deleted file mode 100644
index 1b3c698..0000000
--- a/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_popcon_local.cpp.gcov.html
+++ /dev/null
@@ -1,70 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_popcon_local.cpp</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../../index.html">directory</a> - <a href="index.html">srv/build/pkg/ept-work/default/ept</a> - ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_popcon_local.cpp</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">1</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">1</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #include &quot;/home/mornfall/dev/pkg/ept-work/ept/popcon/local.test.h&quot;
-<span class="lineNum">       2 </span>                : #define RUN(x,y) x().y()
-<span class="lineNum">       3 </span><span class="lineCov">              4 : void run_PopconLocal_basicAccess() { RUN( TestPopconLocal, basicAccess ); }</span>
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_popcon_popcon.cpp.gcov.html b/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_popcon_popcon.cpp.gcov.html
deleted file mode 100644
index 6b3ffb6..0000000
--- a/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_popcon_popcon.cpp.gcov.html
+++ /dev/null
@@ -1,74 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_popcon_popcon.cpp</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../../index.html">directory</a> - <a href="index.html">srv/build/pkg/ept-work/default/ept</a> - ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_popcon_popcon.cpp</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">5</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">5</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #include &quot;/home/mornfall/dev/pkg/ept-work/ept/popcon/popcon.test.h&quot;
-<span class="lineNum">       2 </span>                : #define RUN(x,y) x().y()
-<span class="lineNum">       3 </span><span class="lineCov">              1 : void run_Popcon_basicAccess() { RUN( TestPopcon, basicAccess ); }</span>
-<span class="lineNum">       4 </span><span class="lineCov">              1 : void run_Popcon_accessibility() { RUN( TestPopcon, accessibility ); }</span>
-<span class="lineNum">       5 </span><span class="lineCov">              1 : void run_Popcon_haveScores() { RUN( TestPopcon, haveScores ); }</span>
-<span class="lineNum">       6 </span><span class="lineCov">              1 : void run_Popcon_validScores() { RUN( TestPopcon, validScores ); }</span>
-<span class="lineNum">       7 </span><span class="lineCov">              4 : void run_Popcon_fallbackValues() { RUN( TestPopcon, fallbackValues ); }</span>
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_textsearch_textsearch.cpp.gcov.html b/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_textsearch_textsearch.cpp.gcov.html
deleted file mode 100644
index ae1605d..0000000
--- a/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_textsearch_textsearch.cpp.gcov.html
+++ /dev/null
@@ -1,75 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /srv/build/pkg/ept-work/default/ept/ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_textsearch_textsearch.cpp</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../../index.html">directory</a> - <a href="index.html">srv/build/pkg/ept-work/default/ept</a> - ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_textsearch_textsearch.cpp</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">6</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">6</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #include &quot;/home/mornfall/dev/pkg/ept-work/ept/textsearch/textsearch.test.h&quot;
-<span class="lineNum">       2 </span>                : #define RUN(x,y) x().y()
-<span class="lineNum">       3 </span><span class="lineCov">              1 : void run_Textsearch_empty() { RUN( TestTextsearch, empty ); }</span>
-<span class="lineNum">       4 </span><span class="lineCov">              1 : void run_Textsearch_basicAccess() { RUN( TestTextsearch, basicAccess ); }</span>
-<span class="lineNum">       5 </span><span class="lineCov">              1 : void run_Textsearch_queryAccess() { RUN( TestTextsearch, queryAccess ); }</span>
-<span class="lineNum">       6 </span><span class="lineCov">              1 : void run_Textsearch_partialOrQuery() { RUN( TestTextsearch, partialOrQuery ); }</span>
-<span class="lineNum">       7 </span><span class="lineCov">              1 : void run_Textsearch_docidByName() { RUN( TestTextsearch, docidByName ); }</span>
-<span class="lineNum">       8 </span><span class="lineCov">              4 : void run_Textsearch_values() { RUN( TestTextsearch, values ); }</span>
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-main.cpp.gcov.html b/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-main.cpp.gcov.html
deleted file mode 100644
index a5716f0..0000000
--- a/rep/srv/build/pkg/ept-work/default/ept/ept-test-generated-main.cpp.gcov.html
+++ /dev/null
@@ -1,340 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /srv/build/pkg/ept-work/default/ept/ept-test-generated-main.cpp</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../../index.html">directory</a> - <a href="index.html">srv/build/pkg/ept-work/default/ept</a> - ept-test-generated-main.cpp</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">1</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">1</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #undef NDEBUG
-<span class="lineNum">       2 </span>                : #include &lt;wibble/test.h&gt;
-<span class="lineNum">       3 </span>                : #include &lt;wibble/test-runner.h&gt;
-<span class="lineNum">       4 </span>                : void run_AptRecord_checkLookup();
-<span class="lineNum">       5 </span>                : void run_AptRecord_checkLookupValue();
-<span class="lineNum">       6 </span>                : void run_AptRecord_checkLookupNumeric();
-<span class="lineNum">       7 </span>                : void run_AptRecord_checkShortDescription();
-<span class="lineNum">       8 </span>                : void run_AptRecord_checkList();
-<span class="lineNum">       9 </span>                : void run_AptRecord_nonexistent();
-<span class="lineNum">      10 </span>                : RunTest run_AptRecord[] = {
-<span class="lineNum">      11 </span>                :         { &quot;checkLookup&quot;, run_AptRecord_checkLookup },
-<span class="lineNum">      12 </span>                :         { &quot;checkLookupValue&quot;, run_AptRecord_checkLookupValue },
-<span class="lineNum">      13 </span>                :         { &quot;checkLookupNumeric&quot;, run_AptRecord_checkLookupNumeric },
-<span class="lineNum">      14 </span>                :         { &quot;checkShortDescription&quot;, run_AptRecord_checkShortDescription },
-<span class="lineNum">      15 </span>                :         { &quot;checkList&quot;, run_AptRecord_checkList },
-<span class="lineNum">      16 </span>                :         { &quot;nonexistent&quot;, run_AptRecord_nonexistent },
-<span class="lineNum">      17 </span>                : };
-<span class="lineNum">      18 </span>                : void run_Expression__1();
-<span class="lineNum">      19 </span>                : RunTest run_Expression[] = {
-<span class="lineNum">      20 </span>                :         { &quot;_1&quot;, run_Expression__1 },
-<span class="lineNum">      21 </span>                : };
-<span class="lineNum">      22 </span>                : void run_Textsearch_empty();
-<span class="lineNum">      23 </span>                : void run_Textsearch_basicAccess();
-<span class="lineNum">      24 </span>                : void run_Textsearch_queryAccess();
-<span class="lineNum">      25 </span>                : void run_Textsearch_partialOrQuery();
-<span class="lineNum">      26 </span>                : void run_Textsearch_docidByName();
-<span class="lineNum">      27 </span>                : void run_Textsearch_values();
-<span class="lineNum">      28 </span>                : RunTest run_Textsearch[] = {
-<span class="lineNum">      29 </span>                :         { &quot;empty&quot;, run_Textsearch_empty },
-<span class="lineNum">      30 </span>                :         { &quot;basicAccess&quot;, run_Textsearch_basicAccess },
-<span class="lineNum">      31 </span>                :         { &quot;queryAccess&quot;, run_Textsearch_queryAccess },
-<span class="lineNum">      32 </span>                :         { &quot;partialOrQuery&quot;, run_Textsearch_partialOrQuery },
-<span class="lineNum">      33 </span>                :         { &quot;docidByName&quot;, run_Textsearch_docidByName },
-<span class="lineNum">      34 </span>                :         { &quot;values&quot;, run_Textsearch_values },
-<span class="lineNum">      35 </span>                : };
-<span class="lineNum">      36 </span>                : void run_VocabularyMerger__1();
-<span class="lineNum">      37 </span>                : void run_VocabularyMerger__2();
-<span class="lineNum">      38 </span>                : void run_VocabularyMerger__3();
-<span class="lineNum">      39 </span>                : RunTest run_VocabularyMerger[] = {
-<span class="lineNum">      40 </span>                :         { &quot;_1&quot;, run_VocabularyMerger__1 },
-<span class="lineNum">      41 </span>                :         { &quot;_2&quot;, run_VocabularyMerger__2 },
-<span class="lineNum">      42 </span>                :         { &quot;_3&quot;, run_VocabularyMerger__3 },
-<span class="lineNum">      43 </span>                : };
-<span class="lineNum">      44 </span>                : void run_AptAction_basic();
-<span class="lineNum">      45 </span>                : void run_AptAction_revert();
-<span class="lineNum">      46 </span>                : void run_AptAction_keep();
-<span class="lineNum">      47 </span>                : RunTest run_AptAction[] = {
-<span class="lineNum">      48 </span>                :         { &quot;basic&quot;, run_AptAction_basic },
-<span class="lineNum">      49 </span>                :         { &quot;revert&quot;, run_AptAction_revert },
-<span class="lineNum">      50 </span>                :         { &quot;keep&quot;, run_AptAction_keep },
-<span class="lineNum">      51 </span>                : };
-<span class="lineNum">      52 </span>                : void run_AptPackagerecord_supportedFields();
-<span class="lineNum">      53 </span>                : RunTest run_AptPackagerecord[] = {
-<span class="lineNum">      54 </span>                :         { &quot;supportedFields&quot;, run_AptPackagerecord_supportedFields },
-<span class="lineNum">      55 </span>                : };
-<span class="lineNum">      56 </span>                : void run_Pkgid__1();
-<span class="lineNum">      57 </span>                : void run_Pkgid__2();
-<span class="lineNum">      58 </span>                : RunTest run_Pkgid[] = {
-<span class="lineNum">      59 </span>                :         { &quot;_1&quot;, run_Pkgid__1 },
-<span class="lineNum">      60 </span>                :         { &quot;_2&quot;, run_Pkgid__2 },
-<span class="lineNum">      61 </span>                : };
-<span class="lineNum">      62 </span>                : void run_Xapian_enquire();
-<span class="lineNum">      63 </span>                : void run_Xapian_listCount();
-<span class="lineNum">      64 </span>                : void run_Xapian_list();
-<span class="lineNum">      65 </span>                : void run_Xapian_checkQuery();
-<span class="lineNum">      66 </span>                : RunTest run_Xapian[] = {
-<span class="lineNum">      67 </span>                :         { &quot;enquire&quot;, run_Xapian_enquire },
-<span class="lineNum">      68 </span>                :         { &quot;listCount&quot;, run_Xapian_listCount },
-<span class="lineNum">      69 </span>                :         { &quot;list&quot;, run_Xapian_list },
-<span class="lineNum">      70 </span>                :         { &quot;checkQuery&quot;, run_Xapian_checkQuery },
-<span class="lineNum">      71 </span>                : };
-<span class="lineNum">      72 </span>                : void run_AptVersion_invalid();
-<span class="lineNum">      73 </span>                : void run_AptVersion_basic();
-<span class="lineNum">      74 </span>                : void run_AptVersion_comparison();
-<span class="lineNum">      75 </span>                : void run_AptVersion_valueCopy();
-<span class="lineNum">      76 </span>                : void run_AptVersion_upstreamVersion();
-<span class="lineNum">      77 </span>                : void run_AptVersion_policyComparison();
-<span class="lineNum">      78 </span>                : RunTest run_AptVersion[] = {
-<span class="lineNum">      79 </span>                :         { &quot;invalid&quot;, run_AptVersion_invalid },
-<span class="lineNum">      80 </span>                :         { &quot;basic&quot;, run_AptVersion_basic },
-<span class="lineNum">      81 </span>                :         { &quot;comparison&quot;, run_AptVersion_comparison },
-<span class="lineNum">      82 </span>                :         { &quot;valueCopy&quot;, run_AptVersion_valueCopy },
-<span class="lineNum">      83 </span>                :         { &quot;upstreamVersion&quot;, run_AptVersion_upstreamVersion },
-<span class="lineNum">      84 </span>                :         { &quot;policyComparison&quot;, run_AptVersion_policyComparison },
-<span class="lineNum">      85 </span>                : };
-<span class="lineNum">      86 </span>                : void run_Vocabulary__1();
-<span class="lineNum">      87 </span>                : void run_Vocabulary__2();
-<span class="lineNum">      88 </span>                : void run_Vocabulary__3();
-<span class="lineNum">      89 </span>                : void run_Vocabulary__4();
-<span class="lineNum">      90 </span>                : void run_Vocabulary__5();
-<span class="lineNum">      91 </span>                : void run_Vocabulary__6();
-<span class="lineNum">      92 </span>                : void run_Vocabulary__7();
-<span class="lineNum">      93 </span>                : void run_Vocabulary__8();
-<span class="lineNum">      94 </span>                : void run_Vocabulary__9();
-<span class="lineNum">      95 </span>                : void run_Vocabulary__11();
-<span class="lineNum">      96 </span>                : void run_Vocabulary__12();
-<span class="lineNum">      97 </span>                : void run_Vocabulary__13();
-<span class="lineNum">      98 </span>                : void run_Vocabulary__14();
-<span class="lineNum">      99 </span>                : void run_Vocabulary__15();
-<span class="lineNum">     100 </span>                : void run_Vocabulary__16();
-<span class="lineNum">     101 </span>                : void run_Vocabulary__17();
-<span class="lineNum">     102 </span>                : void run_Vocabulary__18();
-<span class="lineNum">     103 </span>                : void run_Vocabulary__19();
-<span class="lineNum">     104 </span>                : void run_Vocabulary__21();
-<span class="lineNum">     105 </span>                : RunTest run_Vocabulary[] = {
-<span class="lineNum">     106 </span>                :         { &quot;_1&quot;, run_Vocabulary__1 },
-<span class="lineNum">     107 </span>                :         { &quot;_2&quot;, run_Vocabulary__2 },
-<span class="lineNum">     108 </span>                :         { &quot;_3&quot;, run_Vocabulary__3 },
-<span class="lineNum">     109 </span>                :         { &quot;_4&quot;, run_Vocabulary__4 },
-<span class="lineNum">     110 </span>                :         { &quot;_5&quot;, run_Vocabulary__5 },
-<span class="lineNum">     111 </span>                :         { &quot;_6&quot;, run_Vocabulary__6 },
-<span class="lineNum">     112 </span>                :         { &quot;_7&quot;, run_Vocabulary__7 },
-<span class="lineNum">     113 </span>                :         { &quot;_8&quot;, run_Vocabulary__8 },
-<span class="lineNum">     114 </span>                :         { &quot;_9&quot;, run_Vocabulary__9 },
-<span class="lineNum">     115 </span>                :         { &quot;_11&quot;, run_Vocabulary__11 },
-<span class="lineNum">     116 </span>                :         { &quot;_12&quot;, run_Vocabulary__12 },
-<span class="lineNum">     117 </span>                :         { &quot;_13&quot;, run_Vocabulary__13 },
-<span class="lineNum">     118 </span>                :         { &quot;_14&quot;, run_Vocabulary__14 },
-<span class="lineNum">     119 </span>                :         { &quot;_15&quot;, run_Vocabulary__15 },
-<span class="lineNum">     120 </span>                :         { &quot;_16&quot;, run_Vocabulary__16 },
-<span class="lineNum">     121 </span>                :         { &quot;_17&quot;, run_Vocabulary__17 },
-<span class="lineNum">     122 </span>                :         { &quot;_18&quot;, run_Vocabulary__18 },
-<span class="lineNum">     123 </span>                :         { &quot;_19&quot;, run_Vocabulary__19 },
-<span class="lineNum">     124 </span>                :         { &quot;_21&quot;, run_Vocabulary__21 },
-<span class="lineNum">     125 </span>                : };
-<span class="lineNum">     126 </span>                : void run_CoreApt_token();
-<span class="lineNum">     127 </span>                : void run_CoreApt_tokenVersion();
-<span class="lineNum">     128 </span>                : void run_CoreApt_packageName();
-<span class="lineNum">     129 </span>                : void run_CoreApt_packageCount();
-<span class="lineNum">     130 </span>                : void run_CoreApt_packageNameList();
-<span class="lineNum">     131 </span>                : void run_CoreApt_versionCount();
-<span class="lineNum">     132 </span>                : void run_CoreApt_versionPackage();
-<span class="lineNum">     133 </span>                : void run_CoreApt_validate();
-<span class="lineNum">     134 </span>                : void run_CoreApt_packageState();
-<span class="lineNum">     135 </span>                : void run_CoreApt_packageState2();
-<span class="lineNum">     136 </span>                : void run_CoreApt_exists();
-<span class="lineNum">     137 </span>                : void run_CoreApt_invalidate();
-<span class="lineNum">     138 </span>                : RunTest run_CoreApt[] = {
-<span class="lineNum">     139 </span>                :         { &quot;token&quot;, run_CoreApt_token },
-<span class="lineNum">     140 </span>                :         { &quot;tokenVersion&quot;, run_CoreApt_tokenVersion },
-<span class="lineNum">     141 </span>                :         { &quot;packageName&quot;, run_CoreApt_packageName },
-<span class="lineNum">     142 </span>                :         { &quot;packageCount&quot;, run_CoreApt_packageCount },
-<span class="lineNum">     143 </span>                :         { &quot;packageNameList&quot;, run_CoreApt_packageNameList },
-<span class="lineNum">     144 </span>                :         { &quot;versionCount&quot;, run_CoreApt_versionCount },
-<span class="lineNum">     145 </span>                :         { &quot;versionPackage&quot;, run_CoreApt_versionPackage },
-<span class="lineNum">     146 </span>                :         { &quot;validate&quot;, run_CoreApt_validate },
-<span class="lineNum">     147 </span>                :         { &quot;packageState&quot;, run_CoreApt_packageState },
-<span class="lineNum">     148 </span>                :         { &quot;packageState2&quot;, run_CoreApt_packageState2 },
-<span class="lineNum">     149 </span>                :         { &quot;exists&quot;, run_CoreApt_exists },
-<span class="lineNum">     150 </span>                :         { &quot;invalidate&quot;, run_CoreApt_invalidate },
-<span class="lineNum">     151 </span>                : };
-<span class="lineNum">     152 </span>                : void run_Popcon_basicAccess();
-<span class="lineNum">     153 </span>                : void run_Popcon_accessibility();
-<span class="lineNum">     154 </span>                : void run_Popcon_haveScores();
-<span class="lineNum">     155 </span>                : void run_Popcon_validScores();
-<span class="lineNum">     156 </span>                : void run_Popcon_fallbackValues();
-<span class="lineNum">     157 </span>                : RunTest run_Popcon[] = {
-<span class="lineNum">     158 </span>                :         { &quot;basicAccess&quot;, run_Popcon_basicAccess },
-<span class="lineNum">     159 </span>                :         { &quot;accessibility&quot;, run_Popcon_accessibility },
-<span class="lineNum">     160 </span>                :         { &quot;haveScores&quot;, run_Popcon_haveScores },
-<span class="lineNum">     161 </span>                :         { &quot;validScores&quot;, run_Popcon_validScores },
-<span class="lineNum">     162 </span>                :         { &quot;fallbackValues&quot;, run_Popcon_fallbackValues },
-<span class="lineNum">     163 </span>                : };
-<span class="lineNum">     164 </span>                : void run_Apt_iterators();
-<span class="lineNum">     165 </span>                : void run_Apt_aptExists();
-<span class="lineNum">     166 </span>                : void run_Apt_timestamp();
-<span class="lineNum">     167 </span>                : void run_Apt_validity();
-<span class="lineNum">     168 </span>                : void run_Apt_versions();
-<span class="lineNum">     169 </span>                : void run_Apt_versionValidity();
-<span class="lineNum">     170 </span>                : void run_Apt_rawRecord();
-<span class="lineNum">     171 </span>                : void run_Apt_state();
-<span class="lineNum">     172 </span>                : void run_Apt_recordIteration();
-<span class="lineNum">     173 </span>                : void run_Apt_recordIteration2();
-<span class="lineNum">     174 </span>                : void run_Apt_stlIteration();
-<span class="lineNum">     175 </span>                : void run_Apt_stlRecordIteration();
-<span class="lineNum">     176 </span>                : void run_Apt_checkUpdates();
-<span class="lineNum">     177 </span>                : RunTest run_Apt[] = {
-<span class="lineNum">     178 </span>                :         { &quot;iterators&quot;, run_Apt_iterators },
-<span class="lineNum">     179 </span>                :         { &quot;aptExists&quot;, run_Apt_aptExists },
-<span class="lineNum">     180 </span>                :         { &quot;timestamp&quot;, run_Apt_timestamp },
-<span class="lineNum">     181 </span>                :         { &quot;validity&quot;, run_Apt_validity },
-<span class="lineNum">     182 </span>                :         { &quot;versions&quot;, run_Apt_versions },
-<span class="lineNum">     183 </span>                :         { &quot;versionValidity&quot;, run_Apt_versionValidity },
-<span class="lineNum">     184 </span>                :         { &quot;rawRecord&quot;, run_Apt_rawRecord },
-<span class="lineNum">     185 </span>                :         { &quot;state&quot;, run_Apt_state },
-<span class="lineNum">     186 </span>                :         { &quot;recordIteration&quot;, run_Apt_recordIteration },
-<span class="lineNum">     187 </span>                :         { &quot;recordIteration2&quot;, run_Apt_recordIteration2 },
-<span class="lineNum">     188 </span>                :         { &quot;stlIteration&quot;, run_Apt_stlIteration },
-<span class="lineNum">     189 </span>                :         { &quot;stlRecordIteration&quot;, run_Apt_stlRecordIteration },
-<span class="lineNum">     190 </span>                :         { &quot;checkUpdates&quot;, run_Apt_checkUpdates },
-<span class="lineNum">     191 </span>                : };
-<span class="lineNum">     192 </span>                : void run_Desktop_iteration();
-<span class="lineNum">     193 </span>                : void run_Desktop_groupProperty();
-<span class="lineNum">     194 </span>                : void run_Desktop_groups();
-<span class="lineNum">     195 </span>                : void run_Desktop_groupList();
-<span class="lineNum">     196 </span>                : void run_Desktop_emptyGroupList();
-<span class="lineNum">     197 </span>                : RunTest run_Desktop[] = {
-<span class="lineNum">     198 </span>                :         { &quot;iteration&quot;, run_Desktop_iteration },
-<span class="lineNum">     199 </span>                :         { &quot;groupProperty&quot;, run_Desktop_groupProperty },
-<span class="lineNum">     200 </span>                :         { &quot;groups&quot;, run_Desktop_groups },
-<span class="lineNum">     201 </span>                :         { &quot;groupList&quot;, run_Desktop_groupList },
-<span class="lineNum">     202 </span>                :         { &quot;emptyGroupList&quot;, run_Desktop_emptyGroupList },
-<span class="lineNum">     203 </span>                : };
-<span class="lineNum">     204 </span>                : void run_Debtags__1();
-<span class="lineNum">     205 </span>                : void run_Debtags__2();
-<span class="lineNum">     206 </span>                : void run_Debtags__3();
-<span class="lineNum">     207 </span>                : void run_Debtags__4();
-<span class="lineNum">     208 </span>                : void run_Debtags__5();
-<span class="lineNum">     209 </span>                : RunTest run_Debtags[] = {
-<span class="lineNum">     210 </span>                :         { &quot;_1&quot;, run_Debtags__1 },
-<span class="lineNum">     211 </span>                :         { &quot;_2&quot;, run_Debtags__2 },
-<span class="lineNum">     212 </span>                :         { &quot;_3&quot;, run_Debtags__3 },
-<span class="lineNum">     213 </span>                :         { &quot;_4&quot;, run_Debtags__4 },
-<span class="lineNum">     214 </span>                :         { &quot;_5&quot;, run_Debtags__5 },
-<span class="lineNum">     215 </span>                : };
-<span class="lineNum">     216 </span>                : void run_AptRecordparser_parsing();
-<span class="lineNum">     217 </span>                : void run_AptRecordparser_fieldTuples();
-<span class="lineNum">     218 </span>                : void run_AptRecordparser_fieldKeys();
-<span class="lineNum">     219 </span>                : void run_AptRecordparser_fieldValues();
-<span class="lineNum">     220 </span>                : void run_AptRecordparser_findByName();
-<span class="lineNum">     221 </span>                : void run_AptRecordparser_indexing();
-<span class="lineNum">     222 </span>                : void run_AptRecordparser_missingBehaviour();
-<span class="lineNum">     223 </span>                : void run_AptRecordparser_rescan();
-<span class="lineNum">     224 </span>                : void run_AptRecordparser_realLife();
-<span class="lineNum">     225 </span>                : void run_AptRecordparser_bufferTermination();
-<span class="lineNum">     226 </span>                : void run_AptRecordparser_bufferTermination2();
-<span class="lineNum">     227 </span>                : void run_AptRecordparser_bufferTermination3();
-<span class="lineNum">     228 </span>                : RunTest run_AptRecordparser[] = {
-<span class="lineNum">     229 </span>                :         { &quot;parsing&quot;, run_AptRecordparser_parsing },
-<span class="lineNum">     230 </span>                :         { &quot;fieldTuples&quot;, run_AptRecordparser_fieldTuples },
-<span class="lineNum">     231 </span>                :         { &quot;fieldKeys&quot;, run_AptRecordparser_fieldKeys },
-<span class="lineNum">     232 </span>                :         { &quot;fieldValues&quot;, run_AptRecordparser_fieldValues },
-<span class="lineNum">     233 </span>                :         { &quot;findByName&quot;, run_AptRecordparser_findByName },
-<span class="lineNum">     234 </span>                :         { &quot;indexing&quot;, run_AptRecordparser_indexing },
-<span class="lineNum">     235 </span>                :         { &quot;missingBehaviour&quot;, run_AptRecordparser_missingBehaviour },
-<span class="lineNum">     236 </span>                :         { &quot;rescan&quot;, run_AptRecordparser_rescan },
-<span class="lineNum">     237 </span>                :         { &quot;realLife&quot;, run_AptRecordparser_realLife },
-<span class="lineNum">     238 </span>                :         { &quot;bufferTermination&quot;, run_AptRecordparser_bufferTermination },
-<span class="lineNum">     239 </span>                :         { &quot;bufferTermination2&quot;, run_AptRecordparser_bufferTermination2 },
-<span class="lineNum">     240 </span>                :         { &quot;bufferTermination3&quot;, run_AptRecordparser_bufferTermination3 },
-<span class="lineNum">     241 </span>                : };
-<span class="lineNum">     242 </span>                : void run_PopconLocal_basicAccess();
-<span class="lineNum">     243 </span>                : RunTest run_PopconLocal[] = {
-<span class="lineNum">     244 </span>                :         { &quot;basicAccess&quot;, run_PopconLocal_basicAccess },
-<span class="lineNum">     245 </span>                : };
-<span class="lineNum">     246 </span>                : void run_Serializer__1();
-<span class="lineNum">     247 </span>                : void run_Serializer__2();
-<span class="lineNum">     248 </span>                : RunTest run_Serializer[] = {
-<span class="lineNum">     249 </span>                :         { &quot;_1&quot;, run_Serializer__1 },
-<span class="lineNum">     250 </span>                :         { &quot;_2&quot;, run_Serializer__2 },
-<span class="lineNum">     251 </span>                : };
-<span class="lineNum">     252 </span>                : RunSuite suites[] = {
-<span class="lineNum">     253 </span>                : { &quot;AptRecord&quot;, run_AptRecord, 6 },
-<span class="lineNum">     254 </span>                : { &quot;Expression&quot;, run_Expression, 1 },
-<span class="lineNum">     255 </span>                : { &quot;Textsearch&quot;, run_Textsearch, 6 },
-<span class="lineNum">     256 </span>                : { &quot;VocabularyMerger&quot;, run_VocabularyMerger, 3 },
-<span class="lineNum">     257 </span>                : { &quot;AptAction&quot;, run_AptAction, 3 },
-<span class="lineNum">     258 </span>                : { &quot;AptPackagerecord&quot;, run_AptPackagerecord, 1 },
-<span class="lineNum">     259 </span>                : { &quot;Pkgid&quot;, run_Pkgid, 2 },
-<span class="lineNum">     260 </span>                : { &quot;Xapian&quot;, run_Xapian, 4 },
-<span class="lineNum">     261 </span>                : { &quot;AptVersion&quot;, run_AptVersion, 6 },
-<span class="lineNum">     262 </span>                : { &quot;Vocabulary&quot;, run_Vocabulary, 19 },
-<span class="lineNum">     263 </span>                : { &quot;CoreApt&quot;, run_CoreApt, 12 },
-<span class="lineNum">     264 </span>                : { &quot;Popcon&quot;, run_Popcon, 5 },
-<span class="lineNum">     265 </span>                : { &quot;Apt&quot;, run_Apt, 13 },
-<span class="lineNum">     266 </span>                : { &quot;Desktop&quot;, run_Desktop, 5 },
-<span class="lineNum">     267 </span>                : { &quot;Debtags&quot;, run_Debtags, 5 },
-<span class="lineNum">     268 </span>                : { &quot;AptRecordparser&quot;, run_AptRecordparser, 12 },
-<span class="lineNum">     269 </span>                : { &quot;PopconLocal&quot;, run_PopconLocal, 1 },
-<span class="lineNum">     270 </span>                : { &quot;Serializer&quot;, run_Serializer, 2 },
-<span class="lineNum">     271 </span>                : };
-<span class="lineNum">     272 </span>                : #include &lt;wibble/test-main.h&gt;
-<span class="lineNum">     273 </span><span class="lineCov">              3 : int assertFailure = 0;</span>
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/srv/build/pkg/ept-work/default/ept/index.html b/rep/srv/build/pkg/ept-work/default/ept/index.html
deleted file mode 100644
index d908b39..0000000
--- a/rep/srv/build/pkg/ept-work/default/ept/index.html
+++ /dev/null
@@ -1,245 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /srv/build/pkg/ept-work/default/ept</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../../index.html">directory</a> - /srv/build/pkg/ept-work/default/ept</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">107</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">107</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <center>
-  <table width="80%" cellpadding=2 cellspacing=1 border=0>
-
-    <tr>
-      <td width="50%"><br></td>
-      <td width="15%"></td>
-      <td width="15%"></td>
-      <td width="20%"></td>
-    </tr>
-
-    <tr>
-      <td class="tableHead">Filename</td>
-      <td class="tableHead" colspan=3>Coverage</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_apt_apt.cpp.gcov.html">ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_apt_apt.cpp</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">13&nbsp;/&nbsp;13&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_apt_packagerecord.cpp.gcov.html">ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_apt_packagerecord.cpp</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">1&nbsp;/&nbsp;1&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_apt_recordparser.cpp.gcov.html">ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_apt_recordparser.cpp</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">12&nbsp;/&nbsp;12&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_apt_version.cpp.gcov.html">ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_apt_version.cpp</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">6&nbsp;/&nbsp;6&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_apt.cpp.gcov.html">ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_apt.cpp</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">12&nbsp;/&nbsp;12&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_apt_action.cpp.gcov.html">ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_apt_action.cpp</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">3&nbsp;/&nbsp;3&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_apt_record.cpp.gcov.html">ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_apt_record.cpp</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">6&nbsp;/&nbsp;6&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_desktop.cpp.gcov.html">ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_desktop.cpp</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">5&nbsp;/&nbsp;5&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_xapian.cpp.gcov.html">ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_core_xapian.cpp</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">4&nbsp;/&nbsp;4&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_debtags.cpp.gcov.html">ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_debtags.cpp</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">5&nbsp;/&nbsp;5&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_expression.cpp.gcov.html">ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_expression.cpp</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">1&nbsp;/&nbsp;1&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_maint_pkgid.cpp.gcov.html">ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_maint_pkgid.cpp</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">2&nbsp;/&nbsp;2&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_maint_serializer.cpp.gcov.html">ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_maint_serializer.cpp</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">2&nbsp;/&nbsp;2&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_maint_vocabularymerger.cpp.gcov.html">ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_maint_vocabularymerger.cpp</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">3&nbsp;/&nbsp;3&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_vocabulary.cpp.gcov.html">ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_debtags_vocabulary.cpp</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">19&nbsp;/&nbsp;19&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_popcon_local.cpp.gcov.html">ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_popcon_local.cpp</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">1&nbsp;/&nbsp;1&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_popcon_popcon.cpp.gcov.html">ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_popcon_popcon.cpp</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">5&nbsp;/&nbsp;5&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_textsearch_textsearch.cpp.gcov.html">ept-test-generated-_home_mornfall_dev_pkg_ept-work_ept_textsearch_textsearch.cpp</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">6&nbsp;/&nbsp;6&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="ept-test-generated-main.cpp.gcov.html">ept-test-generated-main.cpp</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">1&nbsp;/&nbsp;1&nbsp;lines</td>
-    </tr>
-
-  </table>
-  </center>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/apt-pkg/acquire.h.gcov.html b/rep/usr/include/apt-pkg/acquire.h.gcov.html
deleted file mode 100644
index e55d6ed..0000000
--- a/rep/usr/include/apt-pkg/acquire.h.gcov.html
+++ /dev/null
@@ -1,835 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/apt-pkg/acquire.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/apt-pkg</a> - acquire.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">5</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">0.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">0</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- mode: cpp; mode: fold -*-
-<span class="lineNum">       2 </span>                : // Description                                                          /*{{{*/
-<span class="lineNum">       3 </span>                : // $Id: acquire.h,v 1.29.2.1 2003/12/24 23:09:17 mdz Exp $
-<span class="lineNum">       4 </span>                : /* ######################################################################
-<span class="lineNum">       5 </span>                : 
-<span class="lineNum">       6 </span>                :    Acquire - File Acquiration
-<span class="lineNum">       7 </span>                :    
-<span class="lineNum">       8 </span>                :    This module contians the Acquire system. It is responsible for bringing
-<span class="lineNum">       9 </span>                :    files into the local pathname space. It deals with URIs for files and
-<span class="lineNum">      10 </span>                :    URI handlers responsible for downloading or finding the URIs.
-<span class="lineNum">      11 </span>                :    
-<span class="lineNum">      12 </span>                :    Each file to download is represented by an Acquire::Item class subclassed
-<span class="lineNum">      13 </span>                :    into a specialization. The Item class can add itself to several URI
-<span class="lineNum">      14 </span>                :    acquire queues each prioritized by the download scheduler. When the 
-<span class="lineNum">      15 </span>                :    system is run the proper URI handlers are spawned and the the acquire 
-<span class="lineNum">      16 </span>                :    queues are fed into the handlers by the schedular until the queues are
-<span class="lineNum">      17 </span>                :    empty. This allows for an Item to be downloaded from an alternate source
-<span class="lineNum">      18 </span>                :    if the first try turns out to fail. It also alows concurrent downloading
-<span class="lineNum">      19 </span>                :    of multiple items from multiple sources as well as dynamic balancing
-<span class="lineNum">      20 </span>                :    of load between the sources.
-<span class="lineNum">      21 </span>                :    
-<span class="lineNum">      22 </span>                :    Schedualing of downloads is done on a first ask first get basis. This
-<span class="lineNum">      23 </span>                :    preserves the order of the download as much as possible. And means the
-<span class="lineNum">      24 </span>                :    fastest source will tend to process the largest number of files.
-<span class="lineNum">      25 </span>                :    
-<span class="lineNum">      26 </span>                :    Internal methods and queues for performing gzip decompression,
-<span class="lineNum">      27 </span>                :    md5sum hashing and file copying are provided to allow items to apply
-<span class="lineNum">      28 </span>                :    a number of transformations to the data files they are working with.
-<span class="lineNum">      29 </span>                :    
-<span class="lineNum">      30 </span>                :    ##################################################################### */
-<span class="lineNum">      31 </span>                :                                                                         /*}}}*/
-<span class="lineNum">      32 </span>                : 
-<span class="lineNum">      33 </span>                : /** \defgroup acquire Acquire system
-<span class="lineNum">      34 </span>                :  *
-<span class="lineNum">      35 </span>                :  *  \brief The Acquire system is responsible for retrieving files from
-<span class="lineNum">      36 </span>                :  *  local or remote URIs and postprocessing them (for instance,
-<span class="lineNum">      37 </span>                :  *  verifying their authenticity).  The core class in this system is
-<span class="lineNum">      38 </span>                :  *  pkgAcquire, which is responsible for managing the download queues
-<span class="lineNum">      39 </span>                :  *  during the download.  There is at least one download queue for
-<span class="lineNum">      40 </span>                :  *  each supported protocol; protocols such as http may provide one
-<span class="lineNum">      41 </span>                :  *  queue per host.
-<span class="lineNum">      42 </span>                :  *
-<span class="lineNum">      43 </span>                :  *  Each file to download is represented by a subclass of
-<span class="lineNum">      44 </span>                :  *  pkgAcquire::Item.  The files add themselves to the download
-<span class="lineNum">      45 </span>                :  *  queue(s) by providing their URI information to
-<span class="lineNum">      46 </span>                :  *  pkgAcquire::Item::QueueURI, which calls pkgAcquire::Enqueue.
-<span class="lineNum">      47 </span>                :  *
-<span class="lineNum">      48 </span>                :  *  Once the system is set up, the Run method will spawn subprocesses
-<span class="lineNum">      49 </span>                :  *  to handle the enqueued URIs; the scheduler will then take items
-<span class="lineNum">      50 </span>                :  *  from the queues and feed them into the handlers until the queues
-<span class="lineNum">      51 </span>                :  *  are empty.
-<span class="lineNum">      52 </span>                :  *
-<span class="lineNum">      53 </span>                :  *  \todo Acquire supports inserting an object into several queues at
-<span class="lineNum">      54 </span>                :  *  once, but it is not clear what its behavior in this case is, and
-<span class="lineNum">      55 </span>                :  *  no subclass of pkgAcquire::Item seems to actually use this
-<span class="lineNum">      56 </span>                :  *  capability.
-<span class="lineNum">      57 </span>                :  */
-<span class="lineNum">      58 </span>                : 
-<span class="lineNum">      59 </span>                : /** \addtogroup acquire
-<span class="lineNum">      60 </span>                :  *
-<span class="lineNum">      61 </span>                :  *  @{
-<span class="lineNum">      62 </span>                :  *
-<span class="lineNum">      63 </span>                :  *  \file acquire.h
-<span class="lineNum">      64 </span>                :  */
-<span class="lineNum">      65 </span>                : 
-<span class="lineNum">      66 </span>                : #ifndef PKGLIB_ACQUIRE_H
-<span class="lineNum">      67 </span>                : #define PKGLIB_ACQUIRE_H
-<span class="lineNum">      68 </span>                : 
-<span class="lineNum">      69 </span>                : #include &lt;vector&gt;
-<span class="lineNum">      70 </span>                : #include &lt;string&gt;
-<span class="lineNum">      71 </span>                : 
-<span class="lineNum">      72 </span>                : using std::vector;
-<span class="lineNum">      73 </span>                : using std::string;
-<span class="lineNum">      74 </span>                : 
-<span class="lineNum">      75 </span>                : 
-<span class="lineNum">      76 </span>                : #include &lt;sys/time.h&gt;
-<span class="lineNum">      77 </span>                : #include &lt;unistd.h&gt;
-<span class="lineNum">      78 </span>                : 
-<span class="lineNum">      79 </span>                : class pkgAcquireStatus;
-<span class="lineNum">      80 </span>                : 
-<span class="lineNum">      81 </span>                : /** \brief The core download scheduler.
-<span class="lineNum">      82 </span>                :  *
-<span class="lineNum">      83 </span>                :  *  This class represents an ongoing download.  It manages the lists
-<span class="lineNum">      84 </span>                :  *  of active and pending downloads and handles setting up and tearing
-<span class="lineNum">      85 </span>                :  *  down download-related structures.
-<span class="lineNum">      86 </span>                :  *
-<span class="lineNum">      87 </span>                :  *  \todo Why all the protected data items and methods?
-<span class="lineNum">      88 </span>                :  */
-<span class="lineNum">      89 </span>                : class pkgAcquire
-<span class="lineNum">      90 </span>                : {   
-<span class="lineNum">      91 </span>                :    public:
-<span class="lineNum">      92 </span>                :    
-<span class="lineNum">      93 </span>                :    class Item;
-<span class="lineNum">      94 </span>                :    class Queue;
-<span class="lineNum">      95 </span>                :    class Worker;
-<span class="lineNum">      96 </span>                :    struct MethodConfig;
-<span class="lineNum">      97 </span>                :    struct ItemDesc;
-<span class="lineNum">      98 </span>                :    friend class Item;
-<span class="lineNum">      99 </span>                :    friend class Queue;
-<span class="lineNum">     100 </span>                : 
-<span class="lineNum">     101 </span>                :    typedef vector&lt;Item *&gt;::iterator ItemIterator;
-<span class="lineNum">     102 </span>                :    typedef vector&lt;Item *&gt;::const_iterator ItemCIterator;
-<span class="lineNum">     103 </span>                : 
-<span class="lineNum">     104 </span>                :    protected:
-<span class="lineNum">     105 </span>                :    
-<span class="lineNum">     106 </span>                :    /** \brief A list of items to download.
-<span class="lineNum">     107 </span>                :     *
-<span class="lineNum">     108 </span>                :     *  This is built monotonically as items are created and only
-<span class="lineNum">     109 </span>                :     *  emptied when the download shuts down.
-<span class="lineNum">     110 </span>                :     */
-<span class="lineNum">     111 </span>                :    vector&lt;Item *&gt; Items;
-<span class="lineNum">     112 </span>                :    
-<span class="lineNum">     113 </span>                :    /** \brief The head of the list of active queues.
-<span class="lineNum">     114 </span>                :     *
-<span class="lineNum">     115 </span>                :     *  \todo why a hand-managed list of queues instead of std::list or
-<span class="lineNum">     116 </span>                :     *  std::set?
-<span class="lineNum">     117 </span>                :     */
-<span class="lineNum">     118 </span>                :    Queue *Queues;
-<span class="lineNum">     119 </span>                : 
-<span class="lineNum">     120 </span>                :    /** \brief The head of the list of active workers.
-<span class="lineNum">     121 </span>                :     *
-<span class="lineNum">     122 </span>                :     *  \todo why a hand-managed list of workers instead of std::list
-<span class="lineNum">     123 </span>                :     *  or std::set?
-<span class="lineNum">     124 </span>                :     */
-<span class="lineNum">     125 </span>                :    Worker *Workers;
-<span class="lineNum">     126 </span>                : 
-<span class="lineNum">     127 </span>                :    /** \brief The head of the list of acquire method configurations.
-<span class="lineNum">     128 </span>                :     *
-<span class="lineNum">     129 </span>                :     *  Each protocol (http, ftp, gzip, etc) via which files can be
-<span class="lineNum">     130 </span>                :     *  fetched can have a representation in this list.  The
-<span class="lineNum">     131 </span>                :     *  configuration data is filled in by parsing the 100 Capabilities
-<span class="lineNum">     132 </span>                :     *  string output by a method on startup (see
-<span class="lineNum">     133 </span>                :     *  pkgAcqMethod::pkgAcqMethod and pkgAcquire::GetConfig).
-<span class="lineNum">     134 </span>                :     *
-<span class="lineNum">     135 </span>                :     *  \todo why a hand-managed config dictionary instead of std::map?
-<span class="lineNum">     136 </span>                :     */
-<span class="lineNum">     137 </span>                :    MethodConfig *Configs;
-<span class="lineNum">     138 </span>                : 
-<span class="lineNum">     139 </span>                :    /** \brief The progress indicator for this download. */
-<span class="lineNum">     140 </span>                :    pkgAcquireStatus *Log;
-<span class="lineNum">     141 </span>                : 
-<span class="lineNum">     142 </span>                :    /** \brief The total size of the files which are to be fetched.
-<span class="lineNum">     143 </span>                :     *
-<span class="lineNum">     144 </span>                :     *  This is not necessarily the total number of bytes to download
-<span class="lineNum">     145 </span>                :     *  when, e.g., download resumption and list updates via patches
-<span class="lineNum">     146 </span>                :     *  are taken into account.
-<span class="lineNum">     147 </span>                :     */
-<span class="lineNum">     148 </span>                :    unsigned long ToFetch;
-<span class="lineNum">     149 </span>                : 
-<span class="lineNum">     150 </span>                :    // Configurable parameters for the scheduler
-<span class="lineNum">     151 </span>                : 
-<span class="lineNum">     152 </span>                :    /** \brief Represents the queuing strategy for remote URIs. */
-<span class="lineNum">     153 </span>                :    enum QueueStrategy {
-<span class="lineNum">     154 </span>                :      /** \brief Generate one queue for each protocol/host combination; downloads from 
-<span class="lineNum">     155 </span>                :       *  multiple hosts can proceed in parallel.
-<span class="lineNum">     156 </span>                :       */
-<span class="lineNum">     157 </span>                :      QueueHost,
-<span class="lineNum">     158 </span>                :      /** \brief Generate a single queue for each protocol; serialize
-<span class="lineNum">     159 </span>                :       *  downloads from multiple hosts.
-<span class="lineNum">     160 </span>                :       */
-<span class="lineNum">     161 </span>                :      QueueAccess} QueueMode;
-<span class="lineNum">     162 </span>                : 
-<span class="lineNum">     163 </span>                :    /** \brief If \b true, debugging information will be dumped to std::clog. */
-<span class="lineNum">     164 </span>                :    bool Debug;
-<span class="lineNum">     165 </span>                :    /** \brief If \b true, a download is currently in progress. */
-<span class="lineNum">     166 </span>                :    bool Running;
-<span class="lineNum">     167 </span>                : 
-<span class="lineNum">     168 </span>                :    /** \brief Add the given item to the list of items. */
-<span class="lineNum">     169 </span>                :    void Add(Item *Item);
-<span class="lineNum">     170 </span>                : 
-<span class="lineNum">     171 </span>                :    /** \brief Remove the given item from the list of items. */
-<span class="lineNum">     172 </span>                :    void Remove(Item *Item);
-<span class="lineNum">     173 </span>                : 
-<span class="lineNum">     174 </span>                :    /** \brief Add the given worker to the list of workers. */
-<span class="lineNum">     175 </span>                :    void Add(Worker *Work);
-<span class="lineNum">     176 </span>                : 
-<span class="lineNum">     177 </span>                :    /** \brief Remove the given worker from the list of workers. */
-<span class="lineNum">     178 </span>                :    void Remove(Worker *Work);
-<span class="lineNum">     179 </span>                :    
-<span class="lineNum">     180 </span>                :    /** \brief Insert the given fetch request into the appropriate queue.
-<span class="lineNum">     181 </span>                :     *
-<span class="lineNum">     182 </span>                :     *  \param Item The URI to download and the item to download it
-<span class="lineNum">     183 </span>                :     *  for.  Copied by value into the queue; no reference to Item is
-<span class="lineNum">     184 </span>                :     *  retained.
-<span class="lineNum">     185 </span>                :     */
-<span class="lineNum">     186 </span>                :    void Enqueue(ItemDesc &amp;Item);
-<span class="lineNum">     187 </span>                : 
-<span class="lineNum">     188 </span>                :    /** \brief Remove all fetch requests for this item from all queues. */
-<span class="lineNum">     189 </span>                :    void Dequeue(Item *Item);
-<span class="lineNum">     190 </span>                : 
-<span class="lineNum">     191 </span>                :    /** \brief Determine the fetch method and queue of a URI.
-<span class="lineNum">     192 </span>                :     *
-<span class="lineNum">     193 </span>                :     *  \param URI The URI to fetch.
-<span class="lineNum">     194 </span>                :     *
-<span class="lineNum">     195 </span>                :     *  \param[out] Config A location in which to place the method via
-<span class="lineNum">     196 </span>                :     *  which the URI is to be fetched.
-<span class="lineNum">     197 </span>                :     *
-<span class="lineNum">     198 </span>                :     *  \return the string-name of the queue in which a fetch request
-<span class="lineNum">     199 </span>                :     *  for the given URI should be placed.
-<span class="lineNum">     200 </span>                :     */
-<span class="lineNum">     201 </span>                :    string QueueName(string URI,MethodConfig const *&amp;Config);
-<span class="lineNum">     202 </span>                : 
-<span class="lineNum">     203 </span>                :    /** \brief Build up the set of file descriptors upon which select() should
-<span class="lineNum">     204 </span>                :     *  block.
-<span class="lineNum">     205 </span>                :     *
-<span class="lineNum">     206 </span>                :     *  The default implementation inserts the file descriptors
-<span class="lineNum">     207 </span>                :     *  corresponding to active downloads.
-<span class="lineNum">     208 </span>                :     *
-<span class="lineNum">     209 </span>                :     *  \param[out] Fd The largest file descriptor in the generated sets.
-<span class="lineNum">     210 </span>                :     *
-<span class="lineNum">     211 </span>                :     *  \param[out] RSet The set of file descriptors that should be
-<span class="lineNum">     212 </span>                :     *  watched for input.
-<span class="lineNum">     213 </span>                :     *
-<span class="lineNum">     214 </span>                :     *  \param[out] WSet The set of file descriptors that should be
-<span class="lineNum">     215 </span>                :     *  watched for output.
-<span class="lineNum">     216 </span>                :     */
-<span class="lineNum">     217 </span>                :    virtual void SetFds(int &amp;Fd,fd_set *RSet,fd_set *WSet);
-<span class="lineNum">     218 </span>                : 
-<span class="lineNum">     219 </span>                :    /** Handle input from and output to file descriptors which select()
-<span class="lineNum">     220 </span>                :     *  has determined are ready.  The default implementation
-<span class="lineNum">     221 </span>                :     *  dispatches to all active downloads.
-<span class="lineNum">     222 </span>                :     *
-<span class="lineNum">     223 </span>                :     *  \param RSet The set of file descriptors that are ready for
-<span class="lineNum">     224 </span>                :     *  input.
-<span class="lineNum">     225 </span>                :     *
-<span class="lineNum">     226 </span>                :     *  \param WSet The set of file descriptors that are ready for
-<span class="lineNum">     227 </span>                :     *  output.
-<span class="lineNum">     228 </span>                :     */
-<span class="lineNum">     229 </span>                :    virtual void RunFds(fd_set *RSet,fd_set *WSet);   
-<span class="lineNum">     230 </span>                : 
-<span class="lineNum">     231 </span>                :    /** \brief Check for idle queues with ready-to-fetch items.
-<span class="lineNum">     232 </span>                :     *
-<span class="lineNum">     233 </span>                :     *  Called by pkgAcquire::Queue::Done each time an item is dequeued
-<span class="lineNum">     234 </span>                :     *  but remains on some queues; i.e., another queue should start
-<span class="lineNum">     235 </span>                :     *  fetching it.
-<span class="lineNum">     236 </span>                :     */
-<span class="lineNum">     237 </span>                :    void Bump();
-<span class="lineNum">     238 </span>                :    
-<span class="lineNum">     239 </span>                :    public:
-<span class="lineNum">     240 </span>                : 
-<span class="lineNum">     241 </span>                :    /** \brief Retrieve information about a fetch method by name.
-<span class="lineNum">     242 </span>                :     *
-<span class="lineNum">     243 </span>                :     *  \param Access The name of the method to look up.
-<span class="lineNum">     244 </span>                :     *
-<span class="lineNum">     245 </span>                :     *  \return the method whose name is Access, or \b NULL if no such method exists.
-<span class="lineNum">     246 </span>                :     */
-<span class="lineNum">     247 </span>                :    MethodConfig *GetConfig(string Access);
-<span class="lineNum">     248 </span>                : 
-<span class="lineNum">     249 </span>                :    /** \brief Provides information on how a download terminated. */
-<span class="lineNum">     250 </span>                :    enum RunResult {
-<span class="lineNum">     251 </span>                :      /** \brief All files were fetched successfully. */
-<span class="lineNum">     252 </span>                :      Continue,
-<span class="lineNum">     253 </span>                : 
-<span class="lineNum">     254 </span>                :      /** \brief Some files failed to download. */
-<span class="lineNum">     255 </span>                :      Failed,
-<span class="lineNum">     256 </span>                : 
-<span class="lineNum">     257 </span>                :      /** \brief The download was cancelled by the user (i.e., #Log's
-<span class="lineNum">     258 </span>                :       *  pkgAcquireStatus::Pulse() method returned \b false).
-<span class="lineNum">     259 </span>                :       */
-<span class="lineNum">     260 </span>                :      Cancelled};
-<span class="lineNum">     261 </span>                : 
-<span class="lineNum">     262 </span>                :    /** \brief Download all the items that have been Add()ed to this
-<span class="lineNum">     263 </span>                :     *  download process.
-<span class="lineNum">     264 </span>                :     *
-<span class="lineNum">     265 </span>                :     *  This method will block until the download completes, invoking
-<span class="lineNum">     266 </span>                :     *  methods on #Log to report on the progress of the download.
-<span class="lineNum">     267 </span>                :     *
-<span class="lineNum">     268 </span>                :     *  \param PulseInterval The method pkgAcquireStatus::Pulse will be
-<span class="lineNum">     269 </span>                :     *  invoked on #Log at intervals of PulseInterval milliseconds.
-<span class="lineNum">     270 </span>                :     *
-<span class="lineNum">     271 </span>                :     *  \return the result of the download.
-<span class="lineNum">     272 </span>                :     */
-<span class="lineNum">     273 </span>                :    RunResult Run(int PulseInterval=500000);
-<span class="lineNum">     274 </span>                : 
-<span class="lineNum">     275 </span>                :    /** \brief Remove all items from this download process, terminate
-<span class="lineNum">     276 </span>                :     *  all download workers, and empty all queues.
-<span class="lineNum">     277 </span>                :     */
-<span class="lineNum">     278 </span>                :    void Shutdown();
-<span class="lineNum">     279 </span>                :    
-<span class="lineNum">     280 </span>                :    /** \brief Get the first #Worker object.
-<span class="lineNum">     281 </span>                :     *
-<span class="lineNum">     282 </span>                :     *  \return the first active worker in this download process.
-<span class="lineNum">     283 </span>                :     */
-<span class="lineNum">     284 </span>                :    inline Worker *WorkersBegin() {return Workers;};
-<span class="lineNum">     285 </span>                : 
-<span class="lineNum">     286 </span>                :    /** \brief Advance to the next #Worker object.
-<span class="lineNum">     287 </span>                :     *
-<span class="lineNum">     288 </span>                :     *  \return the worker immediately following I, or \b NULL if none
-<span class="lineNum">     289 </span>                :     *  exists.
-<span class="lineNum">     290 </span>                :     */
-<span class="lineNum">     291 </span>                :    Worker *WorkerStep(Worker *I);
-<span class="lineNum">     292 </span>                : 
-<span class="lineNum">     293 </span>                :    /** \brief Get the head of the list of items. */
-<span class="lineNum">     294 </span>                :    inline ItemIterator ItemsBegin() {return Items.begin();};
-<span class="lineNum">     295 </span>                : 
-<span class="lineNum">     296 </span>                :    /** \brief Get the end iterator of the list of items. */
-<span class="lineNum">     297 </span>                :    inline ItemIterator ItemsEnd() {return Items.end();};
-<span class="lineNum">     298 </span>                :    
-<span class="lineNum">     299 </span>                :    // Iterate over queued Item URIs
-<span class="lineNum">     300 </span>                :    class UriIterator;
-<span class="lineNum">     301 </span>                :    /** \brief Get the head of the list of enqueued item URIs.
-<span class="lineNum">     302 </span>                :     *
-<span class="lineNum">     303 </span>                :     *  This iterator will step over every element of every active
-<span class="lineNum">     304 </span>                :     *  queue.
-<span class="lineNum">     305 </span>                :     */
-<span class="lineNum">     306 </span>                :    UriIterator UriBegin();
-<span class="lineNum">     307 </span>                :    /** \brief Get the end iterator of the list of enqueued item URIs. */
-<span class="lineNum">     308 </span>                :    UriIterator UriEnd();
-<span class="lineNum">     309 </span>                :    
-<span class="lineNum">     310 </span>                :    /** Deletes each entry in the given directory that is not being
-<span class="lineNum">     311 </span>                :     *  downloaded by this object.  For instance, when downloading new
-<span class="lineNum">     312 </span>                :     *  list files, calling Clean() will delete the old ones.
-<span class="lineNum">     313 </span>                :     *
-<span class="lineNum">     314 </span>                :     *  \param Dir The directory to be cleaned out.
-<span class="lineNum">     315 </span>                :     *
-<span class="lineNum">     316 </span>                :     *  \return \b true if the directory exists and is readable.
-<span class="lineNum">     317 </span>                :     */
-<span class="lineNum">     318 </span>                :    bool Clean(string Dir);
-<span class="lineNum">     319 </span>                : 
-<span class="lineNum">     320 </span>                :    /** \return the total size in bytes of all the items included in
-<span class="lineNum">     321 </span>                :     *  this download.
-<span class="lineNum">     322 </span>                :     */
-<span class="lineNum">     323 </span>                :    double TotalNeeded();
-<span class="lineNum">     324 </span>                : 
-<span class="lineNum">     325 </span>                :    /** \return the size in bytes of all non-local items included in
-<span class="lineNum">     326 </span>                :     *  this download.
-<span class="lineNum">     327 </span>                :     */
-<span class="lineNum">     328 </span>                :    double FetchNeeded();
-<span class="lineNum">     329 </span>                : 
-<span class="lineNum">     330 </span>                :    /** \return the amount of data to be fetched that is already
-<span class="lineNum">     331 </span>                :     *  present on the filesystem.
-<span class="lineNum">     332 </span>                :     */
-<span class="lineNum">     333 </span>                :    double PartialPresent();
-<span class="lineNum">     334 </span>                : 
-<span class="lineNum">     335 </span>                :    /** \brief Construct a new pkgAcquire.
-<span class="lineNum">     336 </span>                :     *
-<span class="lineNum">     337 </span>                :     *  \param Log The progress indicator associated with this
-<span class="lineNum">     338 </span>                :     *  download, or \b NULL for none.  This object is not owned by the
-<span class="lineNum">     339 </span>                :     *  download process and will not be deleted when the pkgAcquire
-<span class="lineNum">     340 </span>                :     *  object is destroyed.  Naturally, it should live for at least as
-<span class="lineNum">     341 </span>                :     *  long as the pkgAcquire object does.
-<span class="lineNum">     342 </span>                :     */
-<span class="lineNum">     343 </span>                :    pkgAcquire(pkgAcquireStatus *Log = 0);
-<span class="lineNum">     344 </span>                : 
-<span class="lineNum">     345 </span>                :    /** \brief Destroy this pkgAcquire object.
-<span class="lineNum">     346 </span>                :     *
-<span class="lineNum">     347 </span>                :     *  Destroys all queue, method, and item objects associated with
-<span class="lineNum">     348 </span>                :     *  this download.
-<span class="lineNum">     349 </span>                :     */
-<span class="lineNum">     350 </span>                :    virtual ~pkgAcquire();
-<span class="lineNum">     351 </span>                : };
-<span class="lineNum">     352 </span>                : 
-<span class="lineNum">     353 </span>                : /** \brief Represents a single download source from which an item
-<span class="lineNum">     354 </span>                :  *  should be downloaded.
-<span class="lineNum">     355 </span>                :  *
-<span class="lineNum">     356 </span>                :  *  An item may have several assocated ItemDescs over its lifetime.
-<span class="lineNum">     357 </span>                :  */
-<span class="lineNum">     358 </span>                : struct pkgAcquire::ItemDesc
-<span class="lineNum">     359 </span>                : {
-<span class="lineNum">     360 </span>                :    /** \brief The URI from which to download this item. */
-<span class="lineNum">     361 </span>                :    string URI;
-<span class="lineNum">     362 </span>                :    /** brief A description of this item. */
-<span class="lineNum">     363 </span>                :    string Description;
-<span class="lineNum">     364 </span>                :    /** brief A shorter description of this item. */
-<span class="lineNum">     365 </span>                :    string ShortDesc;
-<span class="lineNum">     366 </span>                :    /** brief The underlying item which is to be downloaded. */
-<span class="lineNum">     367 </span>                :    Item *Owner;
-<span class="lineNum">     368 </span>                : };
-<span class="lineNum">     369 </span>                : 
-<span class="lineNum">     370 </span>                : /** \brief A single download queue in a pkgAcquire object.
-<span class="lineNum">     371 </span>                :  *
-<span class="lineNum">     372 </span>                :  *  \todo Why so many protected values?
-<span class="lineNum">     373 </span>                :  */
-<span class="lineNum">     374 </span>                : class pkgAcquire::Queue
-<span class="lineNum">     375 </span>                : {
-<span class="lineNum">     376 </span>                :    friend class pkgAcquire;
-<span class="lineNum">     377 </span>                :    friend class pkgAcquire::UriIterator;
-<span class="lineNum">     378 </span>                :    friend class pkgAcquire::Worker;
-<span class="lineNum">     379 </span>                : 
-<span class="lineNum">     380 </span>                :    /** \brief The next queue in the pkgAcquire object's list of queues. */
-<span class="lineNum">     381 </span>                :    Queue *Next;
-<span class="lineNum">     382 </span>                :    
-<span class="lineNum">     383 </span>                :    protected:
-<span class="lineNum">     384 </span>                : 
-<span class="lineNum">     385 </span>                :    /** \brief A single item placed in this queue. */
-<span class="lineNum">     386 </span>                :    struct QItem : pkgAcquire::ItemDesc
-<span class="lineNum">     387 </span>                :    {
-<span class="lineNum">     388 </span>                :       /** \brief The next item in the queue. */
-<span class="lineNum">     389 </span>                :       QItem *Next;
-<span class="lineNum">     390 </span>                :       /** \brief The worker associated with this item, if any. */
-<span class="lineNum">     391 </span>                :       pkgAcquire::Worker *Worker;
-<span class="lineNum">     392 </span>                : 
-<span class="lineNum">     393 </span>                :       /** \brief Assign the ItemDesc portion of this QItem from
-<span class="lineNum">     394 </span>                :        *  another ItemDesc
-<span class="lineNum">     395 </span>                :        */
-<span class="lineNum">     396 </span>                :       void operator =(pkgAcquire::ItemDesc const &amp;I)
-<span class="lineNum">     397 </span>                :       {
-<span class="lineNum">     398 </span>                :          URI = I.URI;
-<span class="lineNum">     399 </span>                :          Description = I.Description;
-<span class="lineNum">     400 </span>                :          ShortDesc = I.ShortDesc;
-<span class="lineNum">     401 </span>                :          Owner = I.Owner;
-<span class="lineNum">     402 </span>                :       };
-<span class="lineNum">     403 </span>                :    };
-<span class="lineNum">     404 </span>                :    
-<span class="lineNum">     405 </span>                :    /** \brief The name of this queue. */
-<span class="lineNum">     406 </span>                :    string Name;
-<span class="lineNum">     407 </span>                : 
-<span class="lineNum">     408 </span>                :    /** \brief The head of the list of items contained in this queue.
-<span class="lineNum">     409 </span>                :     *
-<span class="lineNum">     410 </span>                :     *  \todo why a by-hand list instead of an STL structure?
-<span class="lineNum">     411 </span>                :     */
-<span class="lineNum">     412 </span>                :    QItem *Items;
-<span class="lineNum">     413 </span>                : 
-<span class="lineNum">     414 </span>                :    /** \brief The head of the list of workers associated with this queue.
-<span class="lineNum">     415 </span>                :     *
-<span class="lineNum">     416 </span>                :     *  \todo This is plural because support exists in Queue for
-<span class="lineNum">     417 </span>                :     *  multiple workers.  However, it does not appear that there is
-<span class="lineNum">     418 </span>                :     *  any way to actually associate more than one worker with a
-<span class="lineNum">     419 </span>                :     *  queue.
-<span class="lineNum">     420 </span>                :     *
-<span class="lineNum">     421 </span>                :     *  \todo Why not just use a std::set?
-<span class="lineNum">     422 </span>                :     */
-<span class="lineNum">     423 </span>                :    pkgAcquire::Worker *Workers;
-<span class="lineNum">     424 </span>                : 
-<span class="lineNum">     425 </span>                :    /** \brief the download scheduler with which this queue is associated. */
-<span class="lineNum">     426 </span>                :    pkgAcquire *Owner;
-<span class="lineNum">     427 </span>                : 
-<span class="lineNum">     428 </span>                :    /** \brief The number of entries in this queue that are currently
-<span class="lineNum">     429 </span>                :     *  being downloaded.
-<span class="lineNum">     430 </span>                :     */
-<span class="lineNum">     431 </span>                :    signed long PipeDepth;
-<span class="lineNum">     432 </span>                : 
-<span class="lineNum">     433 </span>                :    /** \brief The maximum number of entries that this queue will
-<span class="lineNum">     434 </span>                :     *  attempt to download at once.
-<span class="lineNum">     435 </span>                :     */
-<span class="lineNum">     436 </span>                :    unsigned long MaxPipeDepth;
-<span class="lineNum">     437 </span>                :    
-<span class="lineNum">     438 </span>                :    public:
-<span class="lineNum">     439 </span>                :    
-<span class="lineNum">     440 </span>                :    /** \brief Insert the given fetch request into this queue. 
-<span class="lineNum">     441 </span>                :     *
-<span class="lineNum">     442 </span>                :     *  \return \b true if the queuing was successful. May return
-<span class="lineNum">     443 </span>                :     *  \b false if the Item is already in the queue
-<span class="lineNum">     444 </span>                :     */
-<span class="lineNum">     445 </span>                :    bool Enqueue(ItemDesc &amp;Item);
-<span class="lineNum">     446 </span>                : 
-<span class="lineNum">     447 </span>                :    /** \brief Remove all fetch requests for the given item from this queue.
-<span class="lineNum">     448 </span>                :     *
-<span class="lineNum">     449 </span>                :     *  \return \b true if at least one request was removed from the queue.
-<span class="lineNum">     450 </span>                :     */
-<span class="lineNum">     451 </span>                :    bool Dequeue(Item *Owner);
-<span class="lineNum">     452 </span>                : 
-<span class="lineNum">     453 </span>                :    /** \brief Locate an item in this queue.
-<span class="lineNum">     454 </span>                :     *
-<span class="lineNum">     455 </span>                :     *  \param URI A URI to match against.
-<span class="lineNum">     456 </span>                :     *  \param Owner A pkgAcquire::Worker to match against.
-<span class="lineNum">     457 </span>                :     *
-<span class="lineNum">     458 </span>                :     *  \return the first item in the queue whose URI is #URI and that
-<span class="lineNum">     459 </span>                :     *  is being downloaded by #Owner.
-<span class="lineNum">     460 </span>                :     */
-<span class="lineNum">     461 </span>                :    QItem *FindItem(string URI,pkgAcquire::Worker *Owner);
-<span class="lineNum">     462 </span>                : 
-<span class="lineNum">     463 </span>                :    /** Presumably this should start downloading an item?
-<span class="lineNum">     464 </span>                :     *
-<span class="lineNum">     465 </span>                :     *  \todo Unimplemented.  Implement it or remove?
-<span class="lineNum">     466 </span>                :     */
-<span class="lineNum">     467 </span>                :    bool ItemStart(QItem *Itm,unsigned long Size);
-<span class="lineNum">     468 </span>                : 
-<span class="lineNum">     469 </span>                :    /** \brief Remove the given item from this queue and set its state
-<span class="lineNum">     470 </span>                :     *  to pkgAcquire::Item::StatDone.
-<span class="lineNum">     471 </span>                :     *
-<span class="lineNum">     472 </span>                :     *  If this is the only queue containing the item, the item is also
-<span class="lineNum">     473 </span>                :     *  removed from the main queue by calling pkgAcquire::Dequeue.
-<span class="lineNum">     474 </span>                :     *
-<span class="lineNum">     475 </span>                :     *  \param Itm The item to remove.
-<span class="lineNum">     476 </span>                :     *
-<span class="lineNum">     477 </span>                :     *  \return \b true if no errors are encountered.
-<span class="lineNum">     478 </span>                :     */
-<span class="lineNum">     479 </span>                :    bool ItemDone(QItem *Itm);
-<span class="lineNum">     480 </span>                :    
-<span class="lineNum">     481 </span>                :    /** \brief Start the worker process associated with this queue.
-<span class="lineNum">     482 </span>                :     *
-<span class="lineNum">     483 </span>                :     *  If a worker process is already associated with this queue,
-<span class="lineNum">     484 </span>                :     *  this is equivalent to calling Cycle().
-<span class="lineNum">     485 </span>                :     *
-<span class="lineNum">     486 </span>                :     *  \return \b true if the startup was successful.
-<span class="lineNum">     487 </span>                :     */
-<span class="lineNum">     488 </span>                :    bool Startup();
-<span class="lineNum">     489 </span>                : 
-<span class="lineNum">     490 </span>                :    /** \brief Shut down the worker process associated with this queue.
-<span class="lineNum">     491 </span>                :     *
-<span class="lineNum">     492 </span>                :     *  \param Final If \b true, then the process is stopped unconditionally.
-<span class="lineNum">     493 </span>                :     *               Otherwise, it is only stopped if it does not need cleanup
-<span class="lineNum">     494 </span>                :     *               as indicated by the pkgAcqMethod::NeedsCleanup member of
-<span class="lineNum">     495 </span>                :     *               its configuration.
-<span class="lineNum">     496 </span>                :     *
-<span class="lineNum">     497 </span>                :     *  \return \b true.
-<span class="lineNum">     498 </span>                :     */
-<span class="lineNum">     499 </span>                :    bool Shutdown(bool Final);
-<span class="lineNum">     500 </span>                : 
-<span class="lineNum">     501 </span>                :    /** \brief Send idle items to the worker process.
-<span class="lineNum">     502 </span>                :     *
-<span class="lineNum">     503 </span>                :     *  Fills up the pipeline by inserting idle items into the worker's queue.
-<span class="lineNum">     504 </span>                :     */
-<span class="lineNum">     505 </span>                :    bool Cycle();
-<span class="lineNum">     506 </span>                : 
-<span class="lineNum">     507 </span>                :    /** \brief Check for items that could be enqueued.
-<span class="lineNum">     508 </span>                :     *
-<span class="lineNum">     509 </span>                :     *  Call this after an item placed in multiple queues has gone from
-<span class="lineNum">     510 </span>                :     *  the pkgAcquire::Item::StatFetching state to the
-<span class="lineNum">     511 </span>                :     *  pkgAcquire::Item::StatIdle state, to possibly refill an empty queue.
-<span class="lineNum">     512 </span>                :     *  This is an alias for Cycle().
-<span class="lineNum">     513 </span>                :     *
-<span class="lineNum">     514 </span>                :     *  \todo Why both this and Cycle()?  Are they expected to be
-<span class="lineNum">     515 </span>                :     *  different someday?
-<span class="lineNum">     516 </span>                :     */
-<span class="lineNum">     517 </span>                :    void Bump();
-<span class="lineNum">     518 </span>                :    
-<span class="lineNum">     519 </span>                :    /** \brief Create a new Queue.
-<span class="lineNum">     520 </span>                :     *
-<span class="lineNum">     521 </span>                :     *  \param Name The name of the new queue.
-<span class="lineNum">     522 </span>                :     *  \param Owner The download process that owns the new queue.
-<span class="lineNum">     523 </span>                :     */
-<span class="lineNum">     524 </span>                :    Queue(string Name,pkgAcquire *Owner);
-<span class="lineNum">     525 </span>                : 
-<span class="lineNum">     526 </span>                :    /** Shut down all the worker processes associated with this queue
-<span class="lineNum">     527 </span>                :     *  and empty the queue.
-<span class="lineNum">     528 </span>                :     */
-<span class="lineNum">     529 </span>                :    ~Queue();
-<span class="lineNum">     530 </span>                : };
-<span class="lineNum">     531 </span>                : 
-<span class="lineNum">     532 </span>                : /** \brief Iterates over all the URIs being fetched by a pkgAcquire object. */
-<span class="lineNum">     533 </span>                : class pkgAcquire::UriIterator
-<span class="lineNum">     534 </span>                : {
-<span class="lineNum">     535 </span>                :    /** The next queue to iterate over. */
-<span class="lineNum">     536 </span>                :    pkgAcquire::Queue *CurQ;
-<span class="lineNum">     537 </span>                :    /** The item that we currently point at. */
-<span class="lineNum">     538 </span>                :    pkgAcquire::Queue::QItem *CurItem;
-<span class="lineNum">     539 </span>                :    
-<span class="lineNum">     540 </span>                :    public:
-<span class="lineNum">     541 </span>                :    
-<span class="lineNum">     542 </span>                :    inline void operator ++() {operator ++();};
-<span class="lineNum">     543 </span>                : 
-<span class="lineNum">     544 </span>                :    void operator ++(int)
-<span class="lineNum">     545 </span>                :    {
-<span class="lineNum">     546 </span>                :       CurItem = CurItem-&gt;Next;
-<span class="lineNum">     547 </span>                :       while (CurItem == 0 &amp;&amp; CurQ != 0)
-<span class="lineNum">     548 </span>                :       {
-<span class="lineNum">     549 </span>                :          CurItem = CurQ-&gt;Items;
-<span class="lineNum">     550 </span>                :          CurQ = CurQ-&gt;Next;
-<span class="lineNum">     551 </span>                :       }
-<span class="lineNum">     552 </span>                :    };
-<span class="lineNum">     553 </span>                :    
-<span class="lineNum">     554 </span>                :    inline pkgAcquire::ItemDesc const *operator -&gt;() const {return CurItem;};
-<span class="lineNum">     555 </span>                :    inline bool operator !=(UriIterator const &amp;rhs) const {return rhs.CurQ != CurQ || rhs.CurItem != CurItem;};
-<span class="lineNum">     556 </span>                :    inline bool operator ==(UriIterator const &amp;rhs) const {return rhs.CurQ == CurQ &amp;&amp; rhs.CurItem == CurItem;};
-<span class="lineNum">     557 </span>                :    
-<span class="lineNum">     558 </span>                :    /** \brief Create a new UriIterator.
-<span class="lineNum">     559 </span>                :     *
-<span class="lineNum">     560 </span>                :     *  \param Q The queue over which this UriIterator should iterate.
-<span class="lineNum">     561 </span>                :     */
-<span class="lineNum">     562 </span>                :    UriIterator(pkgAcquire::Queue *Q) : CurQ(Q), CurItem(0)
-<span class="lineNum">     563 </span>                :    {
-<span class="lineNum">     564 </span>                :       while (CurItem == 0 &amp;&amp; CurQ != 0)
-<span class="lineNum">     565 </span>                :       {
-<span class="lineNum">     566 </span>                :          CurItem = CurQ-&gt;Items;
-<span class="lineNum">     567 </span>                :          CurQ = CurQ-&gt;Next;
-<span class="lineNum">     568 </span>                :       }
-<span class="lineNum">     569 </span>                :    }   
-<span class="lineNum">     570 </span>                : };
-<span class="lineNum">     571 </span>                : 
-<span class="lineNum">     572 </span>                : /** \brief Information about the properties of a single acquire method. */
-<span class="lineNum">     573 </span>                : struct pkgAcquire::MethodConfig
-<span class="lineNum">     574 </span>                : {
-<span class="lineNum">     575 </span>                :    /** \brief The next link on the acquire method list.
-<span class="lineNum">     576 </span>                :     *
-<span class="lineNum">     577 </span>                :     *  \todo Why not an STL container?
-<span class="lineNum">     578 </span>                :     */
-<span class="lineNum">     579 </span>                :    MethodConfig *Next;
-<span class="lineNum">     580 </span>                :    
-<span class="lineNum">     581 </span>                :    /** \brief The name of this acquire method (e.g., http). */
-<span class="lineNum">     582 </span>                :    string Access;
-<span class="lineNum">     583 </span>                : 
-<span class="lineNum">     584 </span>                :    /** \brief The implementation version of this acquire method. */
-<span class="lineNum">     585 </span>                :    string Version;
-<span class="lineNum">     586 </span>                : 
-<span class="lineNum">     587 </span>                :    /** \brief If \b true, only one download queue should be created for this
-<span class="lineNum">     588 </span>                :     *  method.
-<span class="lineNum">     589 </span>                :     */
-<span class="lineNum">     590 </span>                :    bool SingleInstance;
-<span class="lineNum">     591 </span>                : 
-<span class="lineNum">     592 </span>                :    /** \brief If \b true, this method supports pipelined downloading. */
-<span class="lineNum">     593 </span>                :    bool Pipeline;
-<span class="lineNum">     594 </span>                : 
-<span class="lineNum">     595 </span>                :    /** \brief If \b true, the worker process should send the entire
-<span class="lineNum">     596 </span>                :     *  APT configuration tree to the fetch subprocess when it starts
-<span class="lineNum">     597 </span>                :     *  up.
-<span class="lineNum">     598 </span>                :     */
-<span class="lineNum">     599 </span>                :    bool SendConfig;
-<span class="lineNum">     600 </span>                : 
-<span class="lineNum">     601 </span>                :    /** \brief If \b true, this fetch method does not require network access;
-<span class="lineNum">     602 </span>                :     *  all files are to be acquired from the local disk.
-<span class="lineNum">     603 </span>                :     */
-<span class="lineNum">     604 </span>                :    bool LocalOnly;
-<span class="lineNum">     605 </span>                : 
-<span class="lineNum">     606 </span>                :    /** \brief If \b true, the subprocess has to carry out some cleanup
-<span class="lineNum">     607 </span>                :     *  actions before shutting down.
-<span class="lineNum">     608 </span>                :     *
-<span class="lineNum">     609 </span>                :     *  For instance, the cdrom method needs to unmount the CD after it
-<span class="lineNum">     610 </span>                :     *  finishes.
-<span class="lineNum">     611 </span>                :     */
-<span class="lineNum">     612 </span>                :    bool NeedsCleanup;
-<span class="lineNum">     613 </span>                : 
-<span class="lineNum">     614 </span>                :    /** \brief If \b true, this fetch method acquires files from removable media. */
-<span class="lineNum">     615 </span>                :    bool Removable;
-<span class="lineNum">     616 </span>                :    
-<span class="lineNum">     617 </span>                :    /** \brief Set up the default method parameters.
-<span class="lineNum">     618 </span>                :     *
-<span class="lineNum">     619 </span>                :     *  All fields are initialized to NULL, &quot;&quot;, or \b false as
-<span class="lineNum">     620 </span>                :     *  appropriate.
-<span class="lineNum">     621 </span>                :     */
-<span class="lineNum">     622 </span>                :    MethodConfig();
-<span class="lineNum">     623 </span>                : };
-<span class="lineNum">     624 </span>                : 
-<span class="lineNum">     625 </span>                : /** \brief A monitor object for downloads controlled by the pkgAcquire class.
-<span class="lineNum">     626 </span>                :  *
-<span class="lineNum">     627 </span>                :  *  \todo Why protected members?
-<span class="lineNum">     628 </span>                :  *
-<span class="lineNum">     629 </span>                :  *  \todo Should the double members be uint64_t?
-<span class="lineNum">     630 </span>                :  */
-<span class="lineNum">     631 </span>                : class pkgAcquireStatus
-<span class="lineNum">     632 </span>                : {
-<span class="lineNum">     633 </span>                :    protected:
-<span class="lineNum">     634 </span>                :    
-<span class="lineNum">     635 </span>                :    /** \brief The last time at which this monitor object was updated. */
-<span class="lineNum">     636 </span>                :    struct timeval Time;
-<span class="lineNum">     637 </span>                : 
-<span class="lineNum">     638 </span>                :    /** \brief The time at which the download started. */
-<span class="lineNum">     639 </span>                :    struct timeval StartTime;
-<span class="lineNum">     640 </span>                : 
-<span class="lineNum">     641 </span>                :    /** \brief The number of bytes fetched as of the previous call to
-<span class="lineNum">     642 </span>                :     *  pkgAcquireStatus::Pulse, including local items.
-<span class="lineNum">     643 </span>                :     */
-<span class="lineNum">     644 </span>                :    double LastBytes;
-<span class="lineNum">     645 </span>                : 
-<span class="lineNum">     646 </span>                :    /** \brief The current rate of download as of the most recent call
-<span class="lineNum">     647 </span>                :     *  to pkgAcquireStatus::Pulse, in bytes per second.
-<span class="lineNum">     648 </span>                :     */
-<span class="lineNum">     649 </span>                :    double CurrentCPS;
-<span class="lineNum">     650 </span>                : 
-<span class="lineNum">     651 </span>                :    /** \brief The number of bytes fetched as of the most recent call
-<span class="lineNum">     652 </span>                :     *  to pkgAcquireStatus::Pulse, including local items.
-<span class="lineNum">     653 </span>                :     */
-<span class="lineNum">     654 </span>                :    double CurrentBytes;
-<span class="lineNum">     655 </span>                : 
-<span class="lineNum">     656 </span>                :    /** \brief The total number of bytes that need to be fetched.
-<span class="lineNum">     657 </span>                :     *
-<span class="lineNum">     658 </span>                :     *  \warning This member is inaccurate, as new items might be
-<span class="lineNum">     659 </span>                :     *  enqueued while the download is in progress!
-<span class="lineNum">     660 </span>                :     */
-<span class="lineNum">     661 </span>                :    double TotalBytes;
-<span class="lineNum">     662 </span>                : 
-<span class="lineNum">     663 </span>                :    /** \brief The total number of bytes accounted for by items that
-<span class="lineNum">     664 </span>                :     *  were successfully fetched.
-<span class="lineNum">     665 </span>                :     */
-<span class="lineNum">     666 </span>                :    double FetchedBytes;
-<span class="lineNum">     667 </span>                : 
-<span class="lineNum">     668 </span>                :    /** \brief The amount of time that has elapsed since the download
-<span class="lineNum">     669 </span>                :     *   started.
-<span class="lineNum">     670 </span>                :     */
-<span class="lineNum">     671 </span>                :    unsigned long ElapsedTime;
-<span class="lineNum">     672 </span>                : 
-<span class="lineNum">     673 </span>                :    /** \brief The total number of items that need to be fetched.
-<span class="lineNum">     674 </span>                :     *
-<span class="lineNum">     675 </span>                :     *  \warning This member is inaccurate, as new items might be
-<span class="lineNum">     676 </span>                :     *  enqueued while the download is in progress!
-<span class="lineNum">     677 </span>                :     */
-<span class="lineNum">     678 </span>                :    unsigned long TotalItems;
-<span class="lineNum">     679 </span>                : 
-<span class="lineNum">     680 </span>                :    /** \brief The number of items that have been successfully downloaded. */
-<span class="lineNum">     681 </span>                :    unsigned long CurrentItems;
-<span class="lineNum">     682 </span>                :    
-<span class="lineNum">     683 </span>                :    public:
-<span class="lineNum">     684 </span>                : 
-<span class="lineNum">     685 </span>                :    /** \brief If \b true, the download scheduler should call Pulse()
-<span class="lineNum">     686 </span>                :     *  at the next available opportunity.
-<span class="lineNum">     687 </span>                :     */
-<span class="lineNum">     688 </span>                :    bool Update;
-<span class="lineNum">     689 </span>                : 
-<span class="lineNum">     690 </span>                :    /** \brief If \b true, extra Pulse() invocations will be performed.
-<span class="lineNum">     691 </span>                :     *
-<span class="lineNum">     692 </span>                :     *  With this option set, Pulse() will be called every time that a
-<span class="lineNum">     693 </span>                :     *  download item starts downloading, finishes downloading, or
-<span class="lineNum">     694 </span>                :     *  terminates with an error.
-<span class="lineNum">     695 </span>                :     */
-<span class="lineNum">     696 </span>                :    bool MorePulses;
-<span class="lineNum">     697 </span>                :       
-<span class="lineNum">     698 </span>                :    /** \brief Invoked when a local or remote file has been completely fetched.
-<span class="lineNum">     699 </span>                :     *
-<span class="lineNum">     700 </span>                :     *  \param Size The size of the file fetched.
-<span class="lineNum">     701 </span>                :     *
-<span class="lineNum">     702 </span>                :     *  \param ResumePoint How much of the file was already fetched.
-<span class="lineNum">     703 </span>                :     */
-<span class="lineNum">     704 </span>                :    virtual void Fetched(unsigned long Size,unsigned long ResumePoint);
-<span class="lineNum">     705 </span>                :    
-<span class="lineNum">     706 </span>                :    /** \brief Invoked when the user should be prompted to change the
-<span class="lineNum">     707 </span>                :     *         inserted removable media.
-<span class="lineNum">     708 </span>                :     *
-<span class="lineNum">     709 </span>                :     *  This method should not return until the user has confirmed to
-<span class="lineNum">     710 </span>                :     *  the user interface that the media change is complete.
-<span class="lineNum">     711 </span>                :     *
-<span class="lineNum">     712 </span>                :     *  \param Media The name of the media type that should be changed.
-<span class="lineNum">     713 </span>                :     *
-<span class="lineNum">     714 </span>                :     *  \param Drive The identifying name of the drive whose media
-<span class="lineNum">     715 </span>                :     *               should be changed.
-<span class="lineNum">     716 </span>                :     *
-<span class="lineNum">     717 </span>                :     *  \return \b true if the user confirms the media change, \b
-<span class="lineNum">     718 </span>                :     *  false if it is cancelled.
-<span class="lineNum">     719 </span>                :     *
-<span class="lineNum">     720 </span>                :     *  \todo This is a horrible blocking monster; it should be CPSed
-<span class="lineNum">     721 </span>                :     *  with prejudice.
-<span class="lineNum">     722 </span>                :     */
-<span class="lineNum">     723 </span>                :    virtual bool MediaChange(string Media,string Drive) = 0;
-<span class="lineNum">     724 </span>                :    
-<span class="lineNum">     725 </span>                :    /** \brief Invoked when an item is confirmed to be up-to-date.
-<span class="lineNum">     726 </span>                : 
-<span class="lineNum">     727 </span>                :     * For instance, when an HTTP download is informed that the file on
-<span class="lineNum">     728 </span>                :     * the server was not modified.
-<span class="lineNum">     729 </span>                :     */
-<span class="lineNum">     730 </span><span class="lineNoCov">              0 :    virtual void IMSHit(pkgAcquire::ItemDesc &amp;/*Itm*/) {};</span>
-<span class="lineNum">     731 </span>                : 
-<span class="lineNum">     732 </span>                :    /** \brief Invoked when some of an item's data is fetched. */
-<span class="lineNum">     733 </span><span class="lineNoCov">              0 :    virtual void Fetch(pkgAcquire::ItemDesc &amp;/*Itm*/) {};</span>
-<span class="lineNum">     734 </span>                : 
-<span class="lineNum">     735 </span>                :    /** \brief Invoked when an item is successfully and completely fetched. */
-<span class="lineNum">     736 </span><span class="lineNoCov">              0 :    virtual void Done(pkgAcquire::ItemDesc &amp;/*Itm*/) {};</span>
-<span class="lineNum">     737 </span>                : 
-<span class="lineNum">     738 </span>                :    /** \brief Invoked when the process of fetching an item encounters
-<span class="lineNum">     739 </span>                :     *  a fatal error.
-<span class="lineNum">     740 </span>                :     */
-<span class="lineNum">     741 </span><span class="lineNoCov">              0 :    virtual void Fail(pkgAcquire::ItemDesc &amp;/*Itm*/) {};</span>
-<span class="lineNum">     742 </span>                : 
-<span class="lineNum">     743 </span>                :    /** \brief Periodically invoked while the Acquire process is underway.
-<span class="lineNum">     744 </span>                :     *
-<span class="lineNum">     745 </span>                :     *  Subclasses should first call pkgAcquireStatus::Pulse(), then
-<span class="lineNum">     746 </span>                :     *  update their status output.  The download process is blocked
-<span class="lineNum">     747 </span>                :     *  while Pulse() is being called.
-<span class="lineNum">     748 </span>                :     *
-<span class="lineNum">     749 </span>                :     *  \return \b false if the user asked to cancel the whole Acquire process.
-<span class="lineNum">     750 </span>                :     *
-<span class="lineNum">     751 </span>                :     *  \see pkgAcquire::Run
-<span class="lineNum">     752 </span>                :     */
-<span class="lineNum">     753 </span>                :    virtual bool Pulse(pkgAcquire *Owner);
-<span class="lineNum">     754 </span>                : 
-<span class="lineNum">     755 </span>                :    /** \brief Invoked when the Acquire process starts running. */
-<span class="lineNum">     756 </span>                :    virtual void Start();
-<span class="lineNum">     757 </span>                : 
-<span class="lineNum">     758 </span>                :    /** \brief Invoked when the Acquire process stops running. */
-<span class="lineNum">     759 </span>                :    virtual void Stop();
-<span class="lineNum">     760 </span>                :    
-<span class="lineNum">     761 </span>                :    /** \brief Initialize all counters to 0 and the time to the current time. */
-<span class="lineNum">     762 </span>                :    pkgAcquireStatus();
-<span class="lineNum">     763 </span><span class="lineNoCov">              0 :    virtual ~pkgAcquireStatus() {};</span>
-<span class="lineNum">     764 </span>                : };
-<span class="lineNum">     765 </span>                : 
-<span class="lineNum">     766 </span>                : /** @} */
-<span class="lineNum">     767 </span>                : 
-<span class="lineNum">     768 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/apt-pkg/algorithms.h.gcov.html b/rep/usr/include/apt-pkg/algorithms.h.gcov.html
deleted file mode 100644
index c11132e..0000000
--- a/rep/usr/include/apt-pkg/algorithms.h.gcov.html
+++ /dev/null
@@ -1,204 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/apt-pkg/algorithms.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/apt-pkg</a> - algorithms.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">3</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">66.7 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">2</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- mode: cpp; mode: fold -*-
-<span class="lineNum">       2 </span>                : // Description                                                          /*{{{*/
-<span class="lineNum">       3 </span>                : // $Id: algorithms.h,v 1.10 2001/05/22 04:17:41 jgg Exp $
-<span class="lineNum">       4 </span>                : /* ######################################################################
-<span class="lineNum">       5 </span>                : 
-<span class="lineNum">       6 </span>                :    Algorithms - A set of misc algorithms
-<span class="lineNum">       7 </span>                :    
-<span class="lineNum">       8 </span>                :    This simulate class displays what the ordering code has done and
-<span class="lineNum">       9 </span>                :    analyses it with a fresh new dependency cache. In this way we can
-<span class="lineNum">      10 </span>                :    see all of the effects of an upgrade run.
-<span class="lineNum">      11 </span>                : 
-<span class="lineNum">      12 </span>                :    pkgDistUpgrade computes an upgrade that causes as many packages as
-<span class="lineNum">      13 </span>                :    possible to move to the newest verison.
-<span class="lineNum">      14 </span>                :    
-<span class="lineNum">      15 </span>                :    pkgApplyStatus sets the target state based on the content of the status
-<span class="lineNum">      16 </span>                :    field in the status file. It is important to get proper crash recovery.
-<span class="lineNum">      17 </span>                : 
-<span class="lineNum">      18 </span>                :    pkgFixBroken corrects a broken system so that it is in a sane state.
-<span class="lineNum">      19 </span>                :  
-<span class="lineNum">      20 </span>                :    pkgAllUpgrade attempts to upgade as many packages as possible but 
-<span class="lineNum">      21 </span>                :    without installing new packages.
-<span class="lineNum">      22 </span>                :    
-<span class="lineNum">      23 </span>                :    The problem resolver class contains a number of complex algorithms
-<span class="lineNum">      24 </span>                :    to try to best-guess an upgrade state. It solves the problem of 
-<span class="lineNum">      25 </span>                :    maximizing the number of install state packages while having no broken
-<span class="lineNum">      26 </span>                :    packages. 
-<span class="lineNum">      27 </span>                : 
-<span class="lineNum">      28 </span>                :    ##################################################################### */
-<span class="lineNum">      29 </span>                :                                                                         /*}}}*/
-<span class="lineNum">      30 </span>                : #ifndef PKGLIB_ALGORITHMS_H
-<span class="lineNum">      31 </span>                : #define PKGLIB_ALGORITHMS_H
-<span class="lineNum">      32 </span>                : 
-<span class="lineNum">      33 </span>                : 
-<span class="lineNum">      34 </span>                : #include &lt;apt-pkg/packagemanager.h&gt;
-<span class="lineNum">      35 </span>                : #include &lt;apt-pkg/depcache.h&gt;
-<span class="lineNum">      36 </span>                : #include &lt;apt-pkg/acquire.h&gt;
-<span class="lineNum">      37 </span>                : 
-<span class="lineNum">      38 </span>                : #include &lt;iostream&gt;
-<span class="lineNum">      39 </span>                : 
-<span class="lineNum">      40 </span>                : using std::ostream;
-<span class="lineNum">      41 </span>                : 
-<span class="lineNum">      42 </span>                : class pkgSimulate : public pkgPackageManager
-<span class="lineNum">      43 </span>                : {
-<span class="lineNum">      44 </span>                :    protected:
-<span class="lineNum">      45 </span>                : 
-<span class="lineNum">      46 </span>                :    class Policy : public pkgDepCache::Policy
-<span class="lineNum">      47 </span>                :    {
-<span class="lineNum">      48 </span>                :       pkgDepCache *Cache;
-<span class="lineNum">      49 </span>                :       public:
-<span class="lineNum">      50 </span>                :       
-<span class="lineNum">      51 </span>                :       virtual VerIterator GetCandidateVer(PkgIterator Pkg)
-<span class="lineNum">      52 </span>                :       {
-<span class="lineNum">      53 </span>                :          return (*Cache)[Pkg].CandidateVerIter(*Cache);
-<span class="lineNum">      54 </span>                :       }
-<span class="lineNum">      55 </span>                :       
-<span class="lineNum">      56 </span>                :       Policy(pkgDepCache *Cache) : Cache(Cache) {};
-<span class="lineNum">      57 </span>                :    };
-<span class="lineNum">      58 </span>                :    
-<span class="lineNum">      59 </span>                :    unsigned char *Flags;
-<span class="lineNum">      60 </span>                :    
-<span class="lineNum">      61 </span>                :    Policy iPolicy;
-<span class="lineNum">      62 </span>                :    pkgDepCache Sim;
-<span class="lineNum">      63 </span>                :    
-<span class="lineNum">      64 </span>                :    // The Actuall installation implementation
-<span class="lineNum">      65 </span>                :    virtual bool Install(PkgIterator Pkg,string File);
-<span class="lineNum">      66 </span>                :    virtual bool Configure(PkgIterator Pkg);
-<span class="lineNum">      67 </span>                :    virtual bool Remove(PkgIterator Pkg,bool Purge);
-<span class="lineNum">      68 </span>                : 
-<span class="lineNum">      69 </span>                : private:
-<span class="lineNum">      70 </span>                :    void ShortBreaks();
-<span class="lineNum">      71 </span>                :    void Describe(PkgIterator iPkg,ostream &amp;out,bool Current,bool Candidate);
-<span class="lineNum">      72 </span>                :    
-<span class="lineNum">      73 </span>                :    public:
-<span class="lineNum">      74 </span>                : 
-<span class="lineNum">      75 </span>                :    pkgSimulate(pkgDepCache *Cache);
-<span class="lineNum">      76 </span>                : };
-<span class="lineNum">      77 </span>                : 
-<span class="lineNum">      78 </span>                : class pkgProblemResolver
-<span class="lineNum">      79 </span>                : {
-<span class="lineNum">      80 </span>                :    pkgDepCache &amp;Cache;
-<span class="lineNum">      81 </span>                :    typedef pkgCache::PkgIterator PkgIterator;
-<span class="lineNum">      82 </span>                :    typedef pkgCache::VerIterator VerIterator;
-<span class="lineNum">      83 </span>                :    typedef pkgCache::DepIterator DepIterator;
-<span class="lineNum">      84 </span>                :    typedef pkgCache::PrvIterator PrvIterator;
-<span class="lineNum">      85 </span>                :    typedef pkgCache::Version Version;
-<span class="lineNum">      86 </span>                :    typedef pkgCache::Package Package;
-<span class="lineNum">      87 </span>                :    
-<span class="lineNum">      88 </span>                :    enum Flags {Protected = (1 &lt;&lt; 0), PreInstalled = (1 &lt;&lt; 1),
-<span class="lineNum">      89 </span>                :                Upgradable = (1 &lt;&lt; 2), ReInstateTried = (1 &lt;&lt; 3),
-<span class="lineNum">      90 </span>                :                ToRemove = (1 &lt;&lt; 4)};
-<span class="lineNum">      91 </span>                :    signed short *Scores;
-<span class="lineNum">      92 </span>                :    unsigned char *Flags;
-<span class="lineNum">      93 </span>                :    bool Debug;
-<span class="lineNum">      94 </span>                :    
-<span class="lineNum">      95 </span>                :    // Sort stuff
-<span class="lineNum">      96 </span>                :    static pkgProblemResolver *This;
-<span class="lineNum">      97 </span>                :    static int ScoreSort(const void *a,const void *b);
-<span class="lineNum">      98 </span>                : 
-<span class="lineNum">      99 </span>                :    struct PackageKill
-<span class="lineNum">     100 </span>                :    {
-<span class="lineNum">     101 </span>                :       PkgIterator Pkg;
-<span class="lineNum">     102 </span>                :       DepIterator Dep;
-<span class="lineNum">     103 </span>                :    };
-<span class="lineNum">     104 </span>                : 
-<span class="lineNum">     105 </span>                :    void MakeScores();
-<span class="lineNum">     106 </span>                :    bool DoUpgrade(pkgCache::PkgIterator Pkg);
-<span class="lineNum">     107 </span>                :    
-<span class="lineNum">     108 </span>                :    public:
-<span class="lineNum">     109 </span>                :    
-<span class="lineNum">     110 </span><span class="lineCov">              4 :    inline void Protect(pkgCache::PkgIterator Pkg) {Flags[Pkg-&gt;ID] |= Protected;};</span>
-<span class="lineNum">     111 </span><span class="lineNoCov">              0 :    inline void Remove(pkgCache::PkgIterator Pkg) {Flags[Pkg-&gt;ID] |= ToRemove;};</span>
-<span class="lineNum">     112 </span><span class="lineCov">              4 :    inline void Clear(pkgCache::PkgIterator Pkg) {Flags[Pkg-&gt;ID] &amp;= ~(Protected | ToRemove);};</span>
-<span class="lineNum">     113 </span>                :    
-<span class="lineNum">     114 </span>                :    // Try to intelligently resolve problems by installing and removing packages   
-<span class="lineNum">     115 </span>                :    bool Resolve(bool BrokenFix = false);
-<span class="lineNum">     116 </span>                :    
-<span class="lineNum">     117 </span>                :    // Try to resolve problems only by using keep
-<span class="lineNum">     118 </span>                :    bool ResolveByKeep();
-<span class="lineNum">     119 </span>                : 
-<span class="lineNum">     120 </span>                :    // Install all protected packages   
-<span class="lineNum">     121 </span>                :    void InstallProtect();   
-<span class="lineNum">     122 </span>                :    
-<span class="lineNum">     123 </span>                :    pkgProblemResolver(pkgDepCache *Cache);
-<span class="lineNum">     124 </span>                :    ~pkgProblemResolver();
-<span class="lineNum">     125 </span>                : };
-<span class="lineNum">     126 </span>                : 
-<span class="lineNum">     127 </span>                : bool pkgDistUpgrade(pkgDepCache &amp;Cache);
-<span class="lineNum">     128 </span>                : bool pkgApplyStatus(pkgDepCache &amp;Cache);
-<span class="lineNum">     129 </span>                : bool pkgFixBroken(pkgDepCache &amp;Cache);
-<span class="lineNum">     130 </span>                : bool pkgAllUpgrade(pkgDepCache &amp;Cache);
-<span class="lineNum">     131 </span>                : bool pkgMinimizeUpgrade(pkgDepCache &amp;Cache);
-<span class="lineNum">     132 </span>                : 
-<span class="lineNum">     133 </span>                : void pkgPrioSortList(pkgCache &amp;Cache,pkgCache::Version **List);
-<span class="lineNum">     134 </span>                : 
-<span class="lineNum">     135 </span>                : bool ListUpdate(pkgAcquireStatus &amp;progress, pkgSourceList &amp;List, int PulseInterval=0);
-<span class="lineNum">     136 </span>                :                      
-<span class="lineNum">     137 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/apt-pkg/cachefile.h.gcov.html b/rep/usr/include/apt-pkg/cachefile.h.gcov.html
deleted file mode 100644
index 8b9c073..0000000
--- a/rep/usr/include/apt-pkg/cachefile.h.gcov.html
+++ /dev/null
@@ -1,123 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/apt-pkg/cachefile.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/apt-pkg</a> - cachefile.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">1</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">1</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- mode: cpp; mode: fold -*-
-<span class="lineNum">       2 </span>                : // Description                                                          /*{{{*/
-<span class="lineNum">       3 </span>                : // $Id: cachefile.h,v 1.5 2002/04/27 04:28:04 jgg Exp $
-<span class="lineNum">       4 </span>                : /* ######################################################################
-<span class="lineNum">       5 </span>                :    
-<span class="lineNum">       6 </span>                :    CacheFile - Simple wrapper class for opening, generating and whatnot
-<span class="lineNum">       7 </span>                :    
-<span class="lineNum">       8 </span>                :    This class implements a simple 2 line mechanism to open various sorts
-<span class="lineNum">       9 </span>                :    of caches. It can operate as root, as not root, show progress and so on,
-<span class="lineNum">      10 </span>                :    it transparently handles everything necessary.
-<span class="lineNum">      11 </span>                :    
-<span class="lineNum">      12 </span>                :    This means it can rebuild caches from the source list and instantiates
-<span class="lineNum">      13 </span>                :    and prepares the standard policy mechanism.
-<span class="lineNum">      14 </span>                :    
-<span class="lineNum">      15 </span>                :    ##################################################################### */
-<span class="lineNum">      16 </span>                :                                                                         /*}}}*/
-<span class="lineNum">      17 </span>                : #ifndef PKGLIB_CACHEFILE_H
-<span class="lineNum">      18 </span>                : #define PKGLIB_CACHEFILE_H
-<span class="lineNum">      19 </span>                : 
-<span class="lineNum">      20 </span>                : 
-<span class="lineNum">      21 </span>                : #include &lt;apt-pkg/depcache.h&gt;
-<span class="lineNum">      22 </span>                : #include &lt;apt-pkg/acquire.h&gt;
-<span class="lineNum">      23 </span>                : #include &lt;apt-pkg/sourcelist.h&gt;
-<span class="lineNum">      24 </span>                : 
-<span class="lineNum">      25 </span>                : class pkgPolicy;
-<span class="lineNum">      26 </span>                : class pkgCacheFile
-<span class="lineNum">      27 </span>                : {
-<span class="lineNum">      28 </span>                :    protected:
-<span class="lineNum">      29 </span>                :    
-<span class="lineNum">      30 </span>                :    MMap *Map;
-<span class="lineNum">      31 </span>                :    pkgCache *Cache;
-<span class="lineNum">      32 </span>                :    pkgDepCache *DCache;
-<span class="lineNum">      33 </span>                :    
-<span class="lineNum">      34 </span>                :    public:
-<span class="lineNum">      35 </span>                : 
-<span class="lineNum">      36 </span>                :    pkgPolicy *Policy;
-<span class="lineNum">      37 </span>                :       
-<span class="lineNum">      38 </span>                :    // We look pretty much exactly like a pointer to a dep cache
-<span class="lineNum">      39 </span>                :    inline operator pkgCache &amp;() {return *Cache;};
-<span class="lineNum">      40 </span>                :    inline operator pkgCache *() {return Cache;};
-<span class="lineNum">      41 </span>                :    inline operator pkgDepCache &amp;() {return *DCache;};
-<span class="lineNum">      42 </span>                :    inline operator pkgDepCache *() {return DCache;};
-<span class="lineNum">      43 </span>                :    inline pkgDepCache *operator -&gt;() {return DCache;};
-<span class="lineNum">      44 </span>                :    inline pkgDepCache &amp;operator *() {return *DCache;};
-<span class="lineNum">      45 </span><span class="lineCov">              1 :    inline pkgDepCache::StateCache &amp;operator [](pkgCache::PkgIterator const &amp;I) {return (*DCache)[I];};</span>
-<span class="lineNum">      46 </span>                :    inline unsigned char &amp;operator [](pkgCache::DepIterator const &amp;I) {return (*DCache)[I];};
-<span class="lineNum">      47 </span>                : 
-<span class="lineNum">      48 </span>                :    bool BuildCaches(OpProgress &amp;Progress,bool WithLock = true);
-<span class="lineNum">      49 </span>                :    bool Open(OpProgress &amp;Progress,bool WithLock = true);
-<span class="lineNum">      50 </span>                :    void Close();
-<span class="lineNum">      51 </span>                :    
-<span class="lineNum">      52 </span>                :    pkgCacheFile();
-<span class="lineNum">      53 </span>                :    ~pkgCacheFile();
-<span class="lineNum">      54 </span>                : };
-<span class="lineNum">      55 </span>                : 
-<span class="lineNum">      56 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/apt-pkg/cacheiterators.h.gcov.html b/rep/usr/include/apt-pkg/cacheiterators.h.gcov.html
deleted file mode 100644
index ac4c9b8..0000000
--- a/rep/usr/include/apt-pkg/cacheiterators.h.gcov.html
+++ /dev/null
@@ -1,503 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/apt-pkg/cacheiterators.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/apt-pkg</a> - cacheiterators.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">51</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">92.2 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">47</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- mode: cpp; mode: fold -*-
-<span class="lineNum">       2 </span>                : // Description                                                          /*{{{*/
-<span class="lineNum">       3 </span>                : // $Id: cacheiterators.h,v 1.18.2.1 2004/05/08 22:44:27 mdz Exp $
-<span class="lineNum">       4 </span>                : /* ######################################################################
-<span class="lineNum">       5 </span>                :    
-<span class="lineNum">       6 </span>                :    Cache Iterators - Iterators for navigating the cache structure
-<span class="lineNum">       7 </span>                :    
-<span class="lineNum">       8 </span>                :    The iterators all provides ++,==,!=,-&gt;,* and end for their type.
-<span class="lineNum">       9 </span>                :    The end function can be used to tell if the list has been fully
-<span class="lineNum">      10 </span>                :    traversed.
-<span class="lineNum">      11 </span>                :    
-<span class="lineNum">      12 </span>                :    Unlike STL iterators these contain helper functions to access the data
-<span class="lineNum">      13 </span>                :    that is being iterated over. This is because the data structures can't
-<span class="lineNum">      14 </span>                :    be formed in a manner that is intuitive to use and also mmapable.
-<span class="lineNum">      15 </span>                :    
-<span class="lineNum">      16 </span>                :    For each variable in the target structure that would need a translation
-<span class="lineNum">      17 </span>                :    to be accessed correctly a translating function of the same name is
-<span class="lineNum">      18 </span>                :    present in the iterator. If applicable the translating function will
-<span class="lineNum">      19 </span>                :    return an iterator.
-<span class="lineNum">      20 </span>                : 
-<span class="lineNum">      21 </span>                :    The DepIterator can iterate over two lists, a list of 'version depends'
-<span class="lineNum">      22 </span>                :    or a list of 'package reverse depends'. The type is determined by the
-<span class="lineNum">      23 </span>                :    structure passed to the constructor, which should be the structure
-<span class="lineNum">      24 </span>                :    that has the depends pointer as a member. The provide iterator has the
-<span class="lineNum">      25 </span>                :    same system.
-<span class="lineNum">      26 </span>                :    
-<span class="lineNum">      27 </span>                :    This header is not user includable, please use apt-pkg/pkgcache.h
-<span class="lineNum">      28 </span>                :    
-<span class="lineNum">      29 </span>                :    ##################################################################### */
-<span class="lineNum">      30 </span>                :                                                                         /*}}}*/
-<span class="lineNum">      31 </span>                : #ifndef PKGLIB_CACHEITERATORS_H
-<span class="lineNum">      32 </span>                : #define PKGLIB_CACHEITERATORS_H
-<span class="lineNum">      33 </span>                : 
-<span class="lineNum">      34 </span>                : 
-<span class="lineNum">      35 </span>                : // Package Iterator
-<span class="lineNum">      36 </span>                : class pkgCache::PkgIterator
-<span class="lineNum">      37 </span>                : {
-<span class="lineNum">      38 </span>                :    friend class pkgCache;
-<span class="lineNum">      39 </span>                :    Package *Pkg;
-<span class="lineNum">      40 </span>                :    pkgCache *Owner;
-<span class="lineNum">      41 </span>                :    long HashIndex;
-<span class="lineNum">      42 </span>                : 
-<span class="lineNum">      43 </span>                :    protected:
-<span class="lineNum">      44 </span>                :    
-<span class="lineNum">      45 </span>                :    // This constructor is the 'begin' constructor, never use it.
-<span class="lineNum">      46 </span><span class="lineCov">             19 :    inline PkgIterator(pkgCache &amp;Owner) : Owner(&amp;Owner), HashIndex(-1)</span>
-<span class="lineNum">      47 </span>                :    {
-<span class="lineNum">      48 </span><span class="lineCov">             19 :       Pkg = Owner.PkgP;</span>
-<span class="lineNum">      49 </span><span class="lineCov">             19 :       operator ++(0);</span>
-<span class="lineNum">      50 </span><span class="lineCov">             19 :    };</span>
-<span class="lineNum">      51 </span>                :    
-<span class="lineNum">      52 </span>                :    public:
-<span class="lineNum">      53 </span>                : 
-<span class="lineNum">      54 </span>                :    enum OkState {NeedsNothing,NeedsUnpack,NeedsConfigure};
-<span class="lineNum">      55 </span>                :       
-<span class="lineNum">      56 </span>                :    // Iteration
-<span class="lineNum">      57 </span>                :    void operator ++(int);
-<span class="lineNum">      58 </span><span class="lineCov">          52878 :    inline void operator ++() {operator ++(0);};</span>
-<span class="lineNum">      59 </span><span class="lineCov">          89241 :    inline bool end() const {return Owner == 0 || Pkg == Owner-&gt;PkgP?true:false;};</span>
-<span class="lineNum">      60 </span>                : 
-<span class="lineNum">      61 </span>                :    // Comparison
-<span class="lineNum">      62 </span><span class="lineNoCov">              0 :    inline bool operator ==(const PkgIterator &amp;B) const {return Pkg == B.Pkg;};</span>
-<span class="lineNum">      63 </span><span class="lineNoCov">              0 :    inline bool operator !=(const PkgIterator &amp;B) const {return Pkg != B.Pkg;};</span>
-<span class="lineNum">      64 </span>                :                            
-<span class="lineNum">      65 </span>                :    // Accessors
-<span class="lineNum">      66 </span><span class="lineCov">          67369 :    inline Package *operator -&gt;() {return Pkg;};</span>
-<span class="lineNum">      67 </span><span class="lineCov">           3787 :    inline Package const *operator -&gt;() const {return Pkg;};</span>
-<span class="lineNum">      68 </span>                :    inline Package const &amp;operator *() const {return *Pkg;};
-<span class="lineNum">      69 </span>                :    inline operator Package *() {return Pkg == Owner-&gt;PkgP?0:Pkg;};
-<span class="lineNum">      70 </span>                :    inline operator Package const *() const {return Pkg == Owner-&gt;PkgP?0:Pkg;};
-<span class="lineNum">      71 </span>                :    inline pkgCache *Cache() {return Owner;};
-<span class="lineNum">      72 </span>                :    
-<span class="lineNum">      73 </span><span class="lineCov">          18343 :    inline const char *Name() const {return Pkg-&gt;Name == 0?0:Owner-&gt;StrP + Pkg-&gt;Name;};</span>
-<span class="lineNum">      74 </span>                :    inline const char *Section() const {return Pkg-&gt;Section == 0?0:Owner-&gt;StrP + Pkg-&gt;Section;};
-<span class="lineNum">      75 </span>                :    inline bool Purge() const {return Pkg-&gt;CurrentState == pkgCache::State::Purge ||
-<span class="lineNum">      76 </span>                :          (Pkg-&gt;CurrentVer == 0 &amp;&amp; Pkg-&gt;CurrentState == pkgCache::State::NotInstalled);};
-<span class="lineNum">      77 </span>                :    inline VerIterator VersionList() const;
-<span class="lineNum">      78 </span>                :    inline VerIterator CurrentVer() const;
-<span class="lineNum">      79 </span>                :    inline DepIterator RevDependsList() const;
-<span class="lineNum">      80 </span>                :    inline PrvIterator ProvidesList() const;
-<span class="lineNum">      81 </span>                :    inline unsigned long Index() const {return Pkg - Owner-&gt;PkgP;};
-<span class="lineNum">      82 </span>                :    OkState State() const;
-<span class="lineNum">      83 </span>                :    
-<span class="lineNum">      84 </span>                :    // Constructors
-<span class="lineNum">      85 </span><span class="lineCov">           5424 :    inline PkgIterator(pkgCache &amp;Owner,Package *Trg) : Pkg(Trg), Owner(&amp;Owner),</span>
-<span class="lineNum">      86 </span><span class="lineCov">           5424 :           HashIndex(0) </span>
-<span class="lineNum">      87 </span>                :    { 
-<span class="lineNum">      88 </span><span class="lineCov">           5424 :       if (Pkg == 0)</span>
-<span class="lineNum">      89 </span><span class="lineNoCov">              0 :          Pkg = Owner.PkgP;</span>
-<span class="lineNum">      90 </span><span class="lineCov">           5424 :    };</span>
-<span class="lineNum">      91 </span><span class="lineCov">             29 :    inline PkgIterator() : Pkg(0), Owner(0), HashIndex(0) {};</span>
-<span class="lineNum">      92 </span>                : };
-<span class="lineNum">      93 </span>                : 
-<span class="lineNum">      94 </span>                : // Version Iterator
-<span class="lineNum">      95 </span>                : class pkgCache::VerIterator
-<span class="lineNum">      96 </span>                : {
-<span class="lineNum">      97 </span>                :    Version *Ver;
-<span class="lineNum">      98 </span>                :    pkgCache *Owner;
-<span class="lineNum">      99 </span>                : 
-<span class="lineNum">     100 </span>                :    void _dummy();
-<span class="lineNum">     101 </span>                :    
-<span class="lineNum">     102 </span>                :    public:
-<span class="lineNum">     103 </span>                : 
-<span class="lineNum">     104 </span>                :    // Iteration
-<span class="lineNum">     105 </span><span class="lineCov">          15767 :    void operator ++(int) {if (Ver != Owner-&gt;VerP) Ver = Owner-&gt;VerP + Ver-&gt;NextVer;};</span>
-<span class="lineNum">     106 </span><span class="lineCov">           1808 :    inline void operator ++() {operator ++(0);};</span>
-<span class="lineNum">     107 </span><span class="lineCov">          58053 :    inline bool end() const {return Owner == NULL || (Ver == Owner-&gt;VerP?true:false);};</span>
-<span class="lineNum">     108 </span><span class="lineCov">          11172 :    inline void operator =(const VerIterator &amp;B) {Ver = B.Ver; Owner = B.Owner;};</span>
-<span class="lineNum">     109 </span>                :    
-<span class="lineNum">     110 </span>                :    // Comparison
-<span class="lineNum">     111 </span>                :    inline bool operator ==(const VerIterator &amp;B) const {return Ver == B.Ver;};
-<span class="lineNum">     112 </span><span class="lineCov">           1433 :    inline bool operator !=(const VerIterator &amp;B) const {return Ver != B.Ver;};</span>
-<span class="lineNum">     113 </span>                :    int CompareVer(const VerIterator &amp;B) const;
-<span class="lineNum">     114 </span>                :    
-<span class="lineNum">     115 </span>                :    // Accessors
-<span class="lineNum">     116 </span>                :    inline Version *operator -&gt;() {return Ver;};
-<span class="lineNum">     117 </span>                :    inline Version const *operator -&gt;() const {return Ver;};
-<span class="lineNum">     118 </span>                :    inline Version &amp;operator *() {return *Ver;};
-<span class="lineNum">     119 </span>                :    inline Version const &amp;operator *() const {return *Ver;};
-<span class="lineNum">     120 </span>                :    inline operator Version *() {return Ver == Owner-&gt;VerP?0:Ver;};
-<span class="lineNum">     121 </span>                :    inline operator Version const *() const {return Ver == Owner-&gt;VerP?0:Ver;};
-<span class="lineNum">     122 </span>                :    inline pkgCache *Cache() {return Owner;};
-<span class="lineNum">     123 </span>                :       
-<span class="lineNum">     124 </span><span class="lineCov">           1830 :    inline const char *VerStr() const {return Ver-&gt;VerStr == 0?0:Owner-&gt;StrP + Ver-&gt;VerStr;};</span>
-<span class="lineNum">     125 </span>                :    inline const char *Section() const {return Ver-&gt;Section == 0?0:Owner-&gt;StrP + Ver-&gt;Section;};
-<span class="lineNum">     126 </span>                :    inline const char *Arch() const {return Ver-&gt;Arch == 0?0:Owner-&gt;StrP + Ver-&gt;Arch;};
-<span class="lineNum">     127 </span><span class="lineCov">           5424 :    inline PkgIterator ParentPkg() const {return PkgIterator(*Owner,Owner-&gt;PkgP + Ver-&gt;ParentPkg);};</span>
-<span class="lineNum">     128 </span>                :    inline DescIterator DescriptionList() const;
-<span class="lineNum">     129 </span>                :    DescIterator TranslatedDescription() const;
-<span class="lineNum">     130 </span>                :    inline DepIterator DependsList() const;
-<span class="lineNum">     131 </span>                :    inline PrvIterator ProvidesList() const;
-<span class="lineNum">     132 </span>                :    inline VerFileIterator FileList() const;
-<span class="lineNum">     133 </span>                :    inline unsigned long Index() const {return Ver - Owner-&gt;VerP;};
-<span class="lineNum">     134 </span>                :    bool Downloadable() const;
-<span class="lineNum">     135 </span>                :    inline const char *PriorityType() {return Owner-&gt;Priority(Ver-&gt;Priority);};
-<span class="lineNum">     136 </span>                :    string RelStr();
-<span class="lineNum">     137 </span>                :    
-<span class="lineNum">     138 </span>                :    bool Automatic() const;
-<span class="lineNum">     139 </span>                :    VerFileIterator NewestFile() const;
-<span class="lineNum">     140 </span>                : 
-<span class="lineNum">     141 </span><span class="lineCov">             15 :    inline VerIterator() : Ver(0), Owner(0) {};   </span>
-<span class="lineNum">     142 </span><span class="lineCov">          21130 :    inline VerIterator(pkgCache &amp;Owner,Version *Trg = 0) : Ver(Trg), </span>
-<span class="lineNum">     143 </span><span class="lineCov">          21130 :               Owner(&amp;Owner) </span>
-<span class="lineNum">     144 </span>                :    { 
-<span class="lineNum">     145 </span><span class="lineCov">          21130 :       if (Ver == 0)</span>
-<span class="lineNum">     146 </span><span class="lineNoCov">              0 :          Ver = Owner.VerP;</span>
-<span class="lineNum">     147 </span><span class="lineCov">          21130 :    };</span>
-<span class="lineNum">     148 </span>                : };
-<span class="lineNum">     149 </span>                : 
-<span class="lineNum">     150 </span>                : // Description Iterator
-<span class="lineNum">     151 </span>                : class pkgCache::DescIterator
-<span class="lineNum">     152 </span>                : {
-<span class="lineNum">     153 </span>                :    Description *Desc;
-<span class="lineNum">     154 </span>                :    pkgCache *Owner;
-<span class="lineNum">     155 </span>                :    
-<span class="lineNum">     156 </span>                :    void _dummy();
-<span class="lineNum">     157 </span>                :    
-<span class="lineNum">     158 </span>                :    public:
-<span class="lineNum">     159 </span>                : 
-<span class="lineNum">     160 </span>                :    // Iteration
-<span class="lineNum">     161 </span>                :    void operator ++(int) {if (Desc != Owner-&gt;DescP) Desc = Owner-&gt;DescP + Desc-&gt;NextDesc;};
-<span class="lineNum">     162 </span>                :    inline void operator ++() {operator ++(0);};
-<span class="lineNum">     163 </span>                :    inline bool end() const {return Desc == Owner-&gt;DescP?true:false;};
-<span class="lineNum">     164 </span>                :    inline void operator =(const DescIterator &amp;B) {Desc = B.Desc; Owner = B.Owner;};
-<span class="lineNum">     165 </span>                :    
-<span class="lineNum">     166 </span>                :    // Comparison
-<span class="lineNum">     167 </span>                :    inline bool operator ==(const DescIterator &amp;B) const {return Desc == B.Desc;};
-<span class="lineNum">     168 </span>                :    inline bool operator !=(const DescIterator &amp;B) const {return Desc != B.Desc;};
-<span class="lineNum">     169 </span>                :    int CompareDesc(const DescIterator &amp;B) const;
-<span class="lineNum">     170 </span>                :    
-<span class="lineNum">     171 </span>                :    // Accessors
-<span class="lineNum">     172 </span>                :    inline Description *operator -&gt;() {return Desc;};
-<span class="lineNum">     173 </span>                :    inline Description const *operator -&gt;() const {return Desc;};
-<span class="lineNum">     174 </span>                :    inline Description &amp;operator *() {return *Desc;};
-<span class="lineNum">     175 </span>                :    inline Description const &amp;operator *() const {return *Desc;};
-<span class="lineNum">     176 </span>                :    inline operator Description *() {return Desc == Owner-&gt;DescP?0:Desc;};
-<span class="lineNum">     177 </span>                :    inline operator Description const *() const {return Desc == Owner-&gt;DescP?0:Desc;};
-<span class="lineNum">     178 </span>                :    inline pkgCache *Cache() {return Owner;};
-<span class="lineNum">     179 </span>                :       
-<span class="lineNum">     180 </span>                :    inline const char *LanguageCode() const {return Owner-&gt;StrP + Desc-&gt;language_code;};
-<span class="lineNum">     181 </span>                :    inline const char *md5() const {return Owner-&gt;StrP + Desc-&gt;md5sum;};
-<span class="lineNum">     182 </span>                :    inline DescFileIterator FileList() const;
-<span class="lineNum">     183 </span>                :    inline unsigned long Index() const {return Desc - Owner-&gt;DescP;};
-<span class="lineNum">     184 </span>                : 
-<span class="lineNum">     185 </span>                :    inline DescIterator() : Desc(0), Owner(0) {};   
-<span class="lineNum">     186 </span>                :    inline DescIterator(pkgCache &amp;Owner,Description *Trg = 0) : Desc(Trg), 
-<span class="lineNum">     187 </span>                :               Owner(&amp;Owner) 
-<span class="lineNum">     188 </span>                :    { 
-<span class="lineNum">     189 </span>                :       if (Desc == 0)
-<span class="lineNum">     190 </span>                :          Desc = Owner.DescP;
-<span class="lineNum">     191 </span>                :    };
-<span class="lineNum">     192 </span>                : };
-<span class="lineNum">     193 </span>                : 
-<span class="lineNum">     194 </span>                : // Dependency iterator
-<span class="lineNum">     195 </span>                : class pkgCache::DepIterator
-<span class="lineNum">     196 </span>                : {
-<span class="lineNum">     197 </span>                :    Dependency *Dep;
-<span class="lineNum">     198 </span>                :    enum {DepVer, DepRev} Type;
-<span class="lineNum">     199 </span>                :    pkgCache *Owner;
-<span class="lineNum">     200 </span>                :    
-<span class="lineNum">     201 </span>                :    void _dummy();
-<span class="lineNum">     202 </span>                :    
-<span class="lineNum">     203 </span>                :    public:
-<span class="lineNum">     204 </span>                : 
-<span class="lineNum">     205 </span>                :    // Iteration
-<span class="lineNum">     206 </span>                :    void operator ++(int) {if (Dep != Owner-&gt;DepP) Dep = Owner-&gt;DepP +
-<span class="lineNum">     207 </span>                :         (Type == DepVer?Dep-&gt;NextDepends:Dep-&gt;NextRevDepends);};
-<span class="lineNum">     208 </span>                :    inline void operator ++() {operator ++(0);};
-<span class="lineNum">     209 </span>                :    inline bool end() const {return Owner == 0 || Dep == Owner-&gt;DepP?true:false;};
-<span class="lineNum">     210 </span>                :    
-<span class="lineNum">     211 </span>                :    // Comparison
-<span class="lineNum">     212 </span>                :    inline bool operator ==(const DepIterator &amp;B) const {return Dep == B.Dep;};
-<span class="lineNum">     213 </span>                :    inline bool operator !=(const DepIterator &amp;B) const {return Dep != B.Dep;};
-<span class="lineNum">     214 </span>                : 
-<span class="lineNum">     215 </span>                :    // Accessors
-<span class="lineNum">     216 </span>                :    inline Dependency *operator -&gt;() {return Dep;};
-<span class="lineNum">     217 </span>                :    inline Dependency const *operator -&gt;() const {return Dep;};
-<span class="lineNum">     218 </span>                :    inline Dependency &amp;operator *() {return *Dep;};
-<span class="lineNum">     219 </span>                :    inline Dependency const &amp;operator *() const {return *Dep;};
-<span class="lineNum">     220 </span>                :    inline operator Dependency *() {return Dep == Owner-&gt;DepP?0:Dep;};
-<span class="lineNum">     221 </span>                :    inline operator Dependency const *() const {return Dep == Owner-&gt;DepP?0:Dep;};
-<span class="lineNum">     222 </span>                :    inline pkgCache *Cache() {return Owner;};
-<span class="lineNum">     223 </span>                :    
-<span class="lineNum">     224 </span>                :    inline const char *TargetVer() const {return Dep-&gt;Version == 0?0:Owner-&gt;StrP + Dep-&gt;Version;};
-<span class="lineNum">     225 </span>                :    inline PkgIterator TargetPkg() {return PkgIterator(*Owner,Owner-&gt;PkgP + Dep-&gt;Package);};
-<span class="lineNum">     226 </span>                :    inline PkgIterator SmartTargetPkg() {PkgIterator R(*Owner,0);SmartTargetPkg(R);return R;};
-<span class="lineNum">     227 </span>                :    inline VerIterator ParentVer() {return VerIterator(*Owner,Owner-&gt;VerP + Dep-&gt;ParentVer);};
-<span class="lineNum">     228 </span>                :    inline PkgIterator ParentPkg() {return PkgIterator(*Owner,Owner-&gt;PkgP + Owner-&gt;VerP[Dep-&gt;ParentVer].ParentPkg);};
-<span class="lineNum">     229 </span>                :    inline bool Reverse() {return Type == DepRev;};
-<span class="lineNum">     230 </span>                :    inline unsigned long Index() const {return Dep - Owner-&gt;DepP;};
-<span class="lineNum">     231 </span>                :    bool IsCritical();
-<span class="lineNum">     232 </span>                :    void GlobOr(DepIterator &amp;Start,DepIterator &amp;End);
-<span class="lineNum">     233 </span>                :    Version **AllTargets();   
-<span class="lineNum">     234 </span>                :    bool SmartTargetPkg(PkgIterator &amp;Result);
-<span class="lineNum">     235 </span>                :    inline const char *CompType() {return Owner-&gt;CompType(Dep-&gt;CompareOp);};
-<span class="lineNum">     236 </span>                :    inline const char *DepType() {return Owner-&gt;DepType(Dep-&gt;Type);};
-<span class="lineNum">     237 </span>                :    
-<span class="lineNum">     238 </span>                :    inline DepIterator(pkgCache &amp;Owner,Dependency *Trg,Version * = 0) :
-<span class="lineNum">     239 </span>                :           Dep(Trg), Type(DepVer), Owner(&amp;Owner) 
-<span class="lineNum">     240 </span>                :    {
-<span class="lineNum">     241 </span>                :       if (Dep == 0)
-<span class="lineNum">     242 </span>                :          Dep = Owner.DepP;
-<span class="lineNum">     243 </span>                :    };
-<span class="lineNum">     244 </span>                :    inline DepIterator(pkgCache &amp;Owner,Dependency *Trg,Package *) :
-<span class="lineNum">     245 </span>                :           Dep(Trg), Type(DepRev), Owner(&amp;Owner)
-<span class="lineNum">     246 </span>                :    {
-<span class="lineNum">     247 </span>                :       if (Dep == 0)
-<span class="lineNum">     248 </span>                :          Dep = Owner.DepP;
-<span class="lineNum">     249 </span>                :    };
-<span class="lineNum">     250 </span>                :    inline DepIterator() : Dep(0), Type(DepVer), Owner(0) {};
-<span class="lineNum">     251 </span>                : };
-<span class="lineNum">     252 </span>                : 
-<span class="lineNum">     253 </span>                : // Provides iterator
-<span class="lineNum">     254 </span>                : class pkgCache::PrvIterator
-<span class="lineNum">     255 </span>                : {
-<span class="lineNum">     256 </span>                :    Provides *Prv;
-<span class="lineNum">     257 </span>                :    enum {PrvVer, PrvPkg} Type;
-<span class="lineNum">     258 </span>                :    pkgCache *Owner;
-<span class="lineNum">     259 </span>                :    
-<span class="lineNum">     260 </span>                :    void _dummy();
-<span class="lineNum">     261 </span>                :    
-<span class="lineNum">     262 </span>                :    public:
-<span class="lineNum">     263 </span>                : 
-<span class="lineNum">     264 </span>                :    // Iteration
-<span class="lineNum">     265 </span>                :    void operator ++(int) {if (Prv != Owner-&gt;ProvideP) Prv = Owner-&gt;ProvideP +
-<span class="lineNum">     266 </span>                :         (Type == PrvVer?Prv-&gt;NextPkgProv:Prv-&gt;NextProvides);};
-<span class="lineNum">     267 </span>                :    inline void operator ++() {operator ++(0);};
-<span class="lineNum">     268 </span>                :    inline bool end() const {return Owner == 0 || Prv == Owner-&gt;ProvideP?true:false;};
-<span class="lineNum">     269 </span>                :    
-<span class="lineNum">     270 </span>                :    // Comparison
-<span class="lineNum">     271 </span>                :    inline bool operator ==(const PrvIterator &amp;B) const {return Prv == B.Prv;};
-<span class="lineNum">     272 </span>                :    inline bool operator !=(const PrvIterator &amp;B) const {return Prv != B.Prv;};
-<span class="lineNum">     273 </span>                : 
-<span class="lineNum">     274 </span>                :    // Accessors
-<span class="lineNum">     275 </span>                :    inline Provides *operator -&gt;() {return Prv;};
-<span class="lineNum">     276 </span>                :    inline Provides const *operator -&gt;() const {return Prv;};
-<span class="lineNum">     277 </span>                :    inline Provides &amp;operator *() {return *Prv;};
-<span class="lineNum">     278 </span>                :    inline Provides const &amp;operator *() const {return *Prv;};
-<span class="lineNum">     279 </span>                :    inline operator Provides *() {return Prv == Owner-&gt;ProvideP?0:Prv;};
-<span class="lineNum">     280 </span>                :    inline operator Provides const *() const {return Prv == Owner-&gt;ProvideP?0:Prv;};
-<span class="lineNum">     281 </span>                :    inline pkgCache *Cache() {return Owner;};
-<span class="lineNum">     282 </span>                : 
-<span class="lineNum">     283 </span>                :    inline const char *Name() const {return Owner-&gt;StrP + Owner-&gt;PkgP[Prv-&gt;ParentPkg].Name;};
-<span class="lineNum">     284 </span>                :    inline const char *ProvideVersion() const {return Prv-&gt;ProvideVersion == 0?0:Owner-&gt;StrP + Prv-&gt;ProvideVersion;};
-<span class="lineNum">     285 </span>                :    inline PkgIterator ParentPkg() {return PkgIterator(*Owner,Owner-&gt;PkgP + Prv-&gt;ParentPkg);};
-<span class="lineNum">     286 </span>                :    inline VerIterator OwnerVer() {return VerIterator(*Owner,Owner-&gt;VerP + Prv-&gt;Version);};
-<span class="lineNum">     287 </span>                :    inline PkgIterator OwnerPkg() {return PkgIterator(*Owner,Owner-&gt;PkgP + Owner-&gt;VerP[Prv-&gt;Version].ParentPkg);};
-<span class="lineNum">     288 </span>                :    inline unsigned long Index() const {return Prv - Owner-&gt;ProvideP;};
-<span class="lineNum">     289 </span>                : 
-<span class="lineNum">     290 </span>                :    inline PrvIterator() : Prv(0), Type(PrvVer), Owner(0)  {};
-<span class="lineNum">     291 </span>                : 
-<span class="lineNum">     292 </span>                :    inline PrvIterator(pkgCache &amp;Owner,Provides *Trg,Version *) :
-<span class="lineNum">     293 </span>                :           Prv(Trg), Type(PrvVer), Owner(&amp;Owner) 
-<span class="lineNum">     294 </span>                :    {
-<span class="lineNum">     295 </span>                :       if (Prv == 0)
-<span class="lineNum">     296 </span>                :          Prv = Owner.ProvideP;
-<span class="lineNum">     297 </span>                :    };
-<span class="lineNum">     298 </span>                :    inline PrvIterator(pkgCache &amp;Owner,Provides *Trg,Package *) : 
-<span class="lineNum">     299 </span>                :           Prv(Trg), Type(PrvPkg), Owner(&amp;Owner)
-<span class="lineNum">     300 </span>                :    {
-<span class="lineNum">     301 </span>                :       if (Prv == 0)
-<span class="lineNum">     302 </span>                :          Prv = Owner.ProvideP;
-<span class="lineNum">     303 </span>                :    };
-<span class="lineNum">     304 </span>                : };
-<span class="lineNum">     305 </span>                : 
-<span class="lineNum">     306 </span>                : // Package file 
-<span class="lineNum">     307 </span>                : class pkgCache::PkgFileIterator
-<span class="lineNum">     308 </span>                : {
-<span class="lineNum">     309 </span>                :    pkgCache *Owner;
-<span class="lineNum">     310 </span>                :    PackageFile *File;
-<span class="lineNum">     311 </span>                : 
-<span class="lineNum">     312 </span>                :    public:
-<span class="lineNum">     313 </span>                : 
-<span class="lineNum">     314 </span>                :    // Iteration
-<span class="lineNum">     315 </span>                :    void operator ++(int) {if (File!= Owner-&gt;PkgFileP) File = Owner-&gt;PkgFileP + File-&gt;NextFile;};
-<span class="lineNum">     316 </span>                :    inline void operator ++() {operator ++(0);};
-<span class="lineNum">     317 </span>                :    inline bool end() const {return File == Owner-&gt;PkgFileP?true:false;};
-<span class="lineNum">     318 </span>                : 
-<span class="lineNum">     319 </span>                :    // Comparison
-<span class="lineNum">     320 </span>                :    inline bool operator ==(const PkgFileIterator &amp;B) const {return File == B.File;};
-<span class="lineNum">     321 </span>                :    inline bool operator !=(const PkgFileIterator &amp;B) const {return File != B.File;};
-<span class="lineNum">     322 </span>                :                            
-<span class="lineNum">     323 </span>                :    // Accessors
-<span class="lineNum">     324 </span><span class="lineCov">          26403 :    inline PackageFile *operator -&gt;() {return File;};</span>
-<span class="lineNum">     325 </span>                :    inline PackageFile const *operator -&gt;() const {return File;};
-<span class="lineNum">     326 </span>                :    inline PackageFile const &amp;operator *() const {return *File;};
-<span class="lineNum">     327 </span><span class="lineCov">           5202 :    inline operator PackageFile *() {return File == Owner-&gt;PkgFileP?0:File;};</span>
-<span class="lineNum">     328 </span>                :    inline operator PackageFile const *() const {return File == Owner-&gt;PkgFileP?0:File;};
-<span class="lineNum">     329 </span><span class="lineCov">           5216 :    inline pkgCache *Cache() {return Owner;};</span>
-<span class="lineNum">     330 </span>                : 
-<span class="lineNum">     331 </span><span class="lineCov">             26 :    inline const char *FileName() const {return File-&gt;FileName == 0?0:Owner-&gt;StrP + File-&gt;FileName;};</span>
-<span class="lineNum">     332 </span>                :    inline const char *Archive() const {return File-&gt;Archive == 0?0:Owner-&gt;StrP + File-&gt;Archive;};
-<span class="lineNum">     333 </span>                :    inline const char *Component() const {return File-&gt;Component == 0?0:Owner-&gt;StrP + File-&gt;Component;};
-<span class="lineNum">     334 </span>                :    inline const char *Version() const {return File-&gt;Version == 0?0:Owner-&gt;StrP + File-&gt;Version;};
-<span class="lineNum">     335 </span>                :    inline const char *Origin() const {return File-&gt;Origin == 0?0:Owner-&gt;StrP + File-&gt;Origin;};
-<span class="lineNum">     336 </span>                :    inline const char *Label() const {return File-&gt;Label == 0?0:Owner-&gt;StrP + File-&gt;Label;};
-<span class="lineNum">     337 </span>                :    inline const char *Site() const {return File-&gt;Site == 0?0:Owner-&gt;StrP + File-&gt;Site;};
-<span class="lineNum">     338 </span>                :    inline const char *Architecture() const {return File-&gt;Architecture == 0?0:Owner-&gt;StrP + File-&gt;Architecture;};
-<span class="lineNum">     339 </span>                :    inline const char *IndexType() const {return File-&gt;IndexType == 0?0:Owner-&gt;StrP + File-&gt;IndexType;};
-<span class="lineNum">     340 </span>                : 
-<span class="lineNum">     341 </span>                :    inline unsigned long Index() const {return File - Owner-&gt;PkgFileP;};
-<span class="lineNum">     342 </span>                : 
-<span class="lineNum">     343 </span>                :    bool IsOk();
-<span class="lineNum">     344 </span>                :    string RelStr();
-<span class="lineNum">     345 </span>                :    
-<span class="lineNum">     346 </span>                :    // Constructors
-<span class="lineNum">     347 </span><span class="lineCov">             15 :    inline PkgFileIterator() : Owner(0), File(0) {};</span>
-<span class="lineNum">     348 </span>                :    inline PkgFileIterator(pkgCache &amp;Owner) : Owner(&amp;Owner), File(Owner.PkgFileP) {};
-<span class="lineNum">     349 </span><span class="lineCov">          26429 :    inline PkgFileIterator(pkgCache &amp;Owner,PackageFile *Trg) : Owner(&amp;Owner), File(Trg) {};</span>
-<span class="lineNum">     350 </span>                : };
-<span class="lineNum">     351 </span>                : 
-<span class="lineNum">     352 </span>                : // Version File 
-<span class="lineNum">     353 </span>                : class pkgCache::VerFileIterator
-<span class="lineNum">     354 </span>                : {
-<span class="lineNum">     355 </span>                :    pkgCache *Owner;
-<span class="lineNum">     356 </span>                :    VerFile *FileP;
-<span class="lineNum">     357 </span>                : 
-<span class="lineNum">     358 </span>                :    public:
-<span class="lineNum">     359 </span>                : 
-<span class="lineNum">     360 </span>                :    // Iteration
-<span class="lineNum">     361 </span><span class="lineCov">          22055 :    void operator ++(int) {if (FileP != Owner-&gt;VerFileP) FileP = Owner-&gt;VerFileP + FileP-&gt;NextFile;};</span>
-<span class="lineNum">     362 </span><span class="lineCov">          11714 :    inline void operator ++() {operator ++(0);};</span>
-<span class="lineNum">     363 </span><span class="lineCov">          90338 :    inline bool end() const {return FileP == Owner-&gt;VerFileP?true:false;};</span>
-<span class="lineNum">     364 </span>                : 
-<span class="lineNum">     365 </span>                :    // Comparison
-<span class="lineNum">     366 </span>                :    inline bool operator ==(const VerFileIterator &amp;B) const {return FileP == B.FileP;};
-<span class="lineNum">     367 </span>                :    inline bool operator !=(const VerFileIterator &amp;B) const {return FileP != B.FileP;};
-<span class="lineNum">     368 </span>                :                            
-<span class="lineNum">     369 </span>                :    // Accessors
-<span class="lineNum">     370 </span><span class="lineCov">          10056 :    inline VerFile *operator -&gt;() {return FileP;};</span>
-<span class="lineNum">     371 </span>                :    inline VerFile const *operator -&gt;() const {return FileP;};
-<span class="lineNum">     372 </span>                :    inline VerFile const &amp;operator *() const {return *FileP;};
-<span class="lineNum">     373 </span><span class="lineCov">           4341 :    inline operator VerFile *() {return FileP == Owner-&gt;VerFileP?0:FileP;};</span>
-<span class="lineNum">     374 </span>                :    inline operator VerFile const *() const {return FileP == Owner-&gt;VerFileP?0:FileP;};
-<span class="lineNum">     375 </span><span class="lineCov">           1311 :    inline pkgCache *Cache() {return Owner;};</span>
-<span class="lineNum">     376 </span>                :   
-<span class="lineNum">     377 </span><span class="lineCov">          26406 :    inline PkgFileIterator File() const {return PkgFileIterator(*Owner,FileP-&gt;File + Owner-&gt;PkgFileP);};</span>
-<span class="lineNum">     378 </span>                :    inline unsigned long Index() const {return FileP - Owner-&gt;VerFileP;};
-<span class="lineNum">     379 </span>                :       
-<span class="lineNum">     380 </span><span class="lineCov">              7 :    inline VerFileIterator() : Owner(0), FileP(0) {};</span>
-<span class="lineNum">     381 </span><span class="lineCov">          27354 :    inline VerFileIterator(pkgCache &amp;Owner,VerFile *Trg) : Owner(&amp;Owner), FileP(Trg) {};</span>
-<span class="lineNum">     382 </span>                : };
-<span class="lineNum">     383 </span>                : 
-<span class="lineNum">     384 </span>                : // Description File 
-<span class="lineNum">     385 </span>                : class pkgCache::DescFileIterator
-<span class="lineNum">     386 </span>                : {
-<span class="lineNum">     387 </span>                :    pkgCache *Owner;
-<span class="lineNum">     388 </span>                :    DescFile *FileP;
-<span class="lineNum">     389 </span>                : 
-<span class="lineNum">     390 </span>                :    public:
-<span class="lineNum">     391 </span>                : 
-<span class="lineNum">     392 </span>                :    // Iteration
-<span class="lineNum">     393 </span>                :    void operator ++(int) {if (FileP != Owner-&gt;DescFileP) FileP = Owner-&gt;DescFileP + FileP-&gt;NextFile;};
-<span class="lineNum">     394 </span>                :    inline void operator ++() {operator ++(0);};
-<span class="lineNum">     395 </span>                :    inline bool end() const {return FileP == Owner-&gt;DescFileP?true:false;};
-<span class="lineNum">     396 </span>                : 
-<span class="lineNum">     397 </span>                :    // Comparison
-<span class="lineNum">     398 </span>                :    inline bool operator ==(const DescFileIterator &amp;B) const {return FileP == B.FileP;};
-<span class="lineNum">     399 </span>                :    inline bool operator !=(const DescFileIterator &amp;B) const {return FileP != B.FileP;};
-<span class="lineNum">     400 </span>                :                            
-<span class="lineNum">     401 </span>                :    // Accessors
-<span class="lineNum">     402 </span>                :    inline DescFile *operator -&gt;() {return FileP;};
-<span class="lineNum">     403 </span>                :    inline DescFile const *operator -&gt;() const {return FileP;};
-<span class="lineNum">     404 </span>                :    inline DescFile const &amp;operator *() const {return *FileP;};
-<span class="lineNum">     405 </span>                :    inline operator DescFile *() {return FileP == Owner-&gt;DescFileP?0:FileP;};
-<span class="lineNum">     406 </span>                :    inline operator DescFile const *() const {return FileP == Owner-&gt;DescFileP?0:FileP;};
-<span class="lineNum">     407 </span>                :    inline pkgCache *Cache() {return Owner;};
-<span class="lineNum">     408 </span>                :   
-<span class="lineNum">     409 </span>                :    inline PkgFileIterator File() const {return PkgFileIterator(*Owner,FileP-&gt;File + Owner-&gt;PkgFileP);};
-<span class="lineNum">     410 </span>                :    inline unsigned long Index() const {return FileP - Owner-&gt;DescFileP;};
-<span class="lineNum">     411 </span>                :       
-<span class="lineNum">     412 </span>                :    inline DescFileIterator() : Owner(0), FileP(0) {};
-<span class="lineNum">     413 </span>                :    inline DescFileIterator(pkgCache &amp;Owner,DescFile *Trg) : Owner(&amp;Owner), FileP(Trg) {};
-<span class="lineNum">     414 </span>                : };
-<span class="lineNum">     415 </span>                : 
-<span class="lineNum">     416 </span>                : // Inlined Begin functions cant be in the class because of order problems
-<span class="lineNum">     417 </span><span class="lineCov">          19696 : inline pkgCache::VerIterator pkgCache::PkgIterator::VersionList() const</span>
-<span class="lineNum">     418 </span><span class="lineCov">          19696 :        {return VerIterator(*Owner,Owner-&gt;VerP + Pkg-&gt;VersionList);};</span>
-<span class="lineNum">     419 </span><span class="lineCov">              2 : inline pkgCache::VerIterator pkgCache::PkgIterator::CurrentVer() const</span>
-<span class="lineNum">     420 </span><span class="lineCov">              2 :        {return VerIterator(*Owner,Owner-&gt;VerP + Pkg-&gt;CurrentVer);};</span>
-<span class="lineNum">     421 </span>                : inline pkgCache::DepIterator pkgCache::PkgIterator::RevDependsList() const
-<span class="lineNum">     422 </span>                :        {return DepIterator(*Owner,Owner-&gt;DepP + Pkg-&gt;RevDepends,Pkg);};
-<span class="lineNum">     423 </span>                : inline pkgCache::PrvIterator pkgCache::PkgIterator::ProvidesList() const
-<span class="lineNum">     424 </span>                :        {return PrvIterator(*Owner,Owner-&gt;ProvideP + Pkg-&gt;ProvidesList,Pkg);};
-<span class="lineNum">     425 </span>                : inline pkgCache::DescIterator pkgCache::VerIterator::DescriptionList() const
-<span class="lineNum">     426 </span>                :        {return DescIterator(*Owner,Owner-&gt;DescP + Ver-&gt;DescriptionList);};
-<span class="lineNum">     427 </span>                : inline pkgCache::PrvIterator pkgCache::VerIterator::ProvidesList() const
-<span class="lineNum">     428 </span>                :        {return PrvIterator(*Owner,Owner-&gt;ProvideP + Ver-&gt;ProvidesList,Ver);};
-<span class="lineNum">     429 </span>                : inline pkgCache::DepIterator pkgCache::VerIterator::DependsList() const
-<span class="lineNum">     430 </span>                :        {return DepIterator(*Owner,Owner-&gt;DepP + Ver-&gt;DependsList,Ver);};
-<span class="lineNum">     431 </span><span class="lineCov">          26484 : inline pkgCache::VerFileIterator pkgCache::VerIterator::FileList() const</span>
-<span class="lineNum">     432 </span><span class="lineCov">          26484 :        {return VerFileIterator(*Owner,Owner-&gt;VerFileP + Ver-&gt;FileList);};</span>
-<span class="lineNum">     433 </span>                : inline pkgCache::DescFileIterator pkgCache::DescIterator::FileList() const
-<span class="lineNum">     434 </span>                :        {return DescFileIterator(*Owner,Owner-&gt;DescFileP + Desc-&gt;FileList);};
-<span class="lineNum">     435 </span>                : 
-<span class="lineNum">     436 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/apt-pkg/depcache.h.gcov.html b/rep/usr/include/apt-pkg/depcache.h.gcov.html
deleted file mode 100644
index f982f27..0000000
--- a/rep/usr/include/apt-pkg/depcache.h.gcov.html
+++ /dev/null
@@ -1,492 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/apt-pkg/depcache.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/apt-pkg</a> - depcache.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">6</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">6</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- mode: c++; mode: fold -*-
-<span class="lineNum">       2 </span>                : // Description                                                          /*{{{*/
-<span class="lineNum">       3 </span>                : // $Id: depcache.h,v 1.14 2001/02/20 07:03:17 jgg Exp $
-<span class="lineNum">       4 </span>                : /* ######################################################################
-<span class="lineNum">       5 </span>                : 
-<span class="lineNum">       6 </span>                :    DepCache - Dependency Extension data for the cache
-<span class="lineNum">       7 </span>                :    
-<span class="lineNum">       8 </span>                :    This class stores the cache data and a set of extension structures for
-<span class="lineNum">       9 </span>                :    monitoring the current state of all the packages. It also generates and
-<span class="lineNum">      10 </span>                :    caches the 'install' state of many things. This refers to the state of the
-<span class="lineNum">      11 </span>                :    package after an install has been run.
-<span class="lineNum">      12 </span>                : 
-<span class="lineNum">      13 </span>                :    The StateCache::State field can be -1,0,1,2 which is &lt;,=,&gt;,no current.
-<span class="lineNum">      14 </span>                :    StateCache::Mode is which of the 3 fields is active.
-<span class="lineNum">      15 </span>                :    
-<span class="lineNum">      16 </span>                :    This structure is important to support the readonly status of the cache 
-<span class="lineNum">      17 </span>                :    file. When the data is saved the cache will be refereshed from our 
-<span class="lineNum">      18 </span>                :    internal rep and written to disk. Then the actual persistant data 
-<span class="lineNum">      19 </span>                :    files will be put on the disk.
-<span class="lineNum">      20 </span>                : 
-<span class="lineNum">      21 </span>                :    Each dependency is compared against 3 target versions to produce to
-<span class="lineNum">      22 </span>                :    3 dependency results.
-<span class="lineNum">      23 </span>                :      Now - Compared using the Currently install version
-<span class="lineNum">      24 </span>                :      Install - Compared using the install version (final state)
-<span class="lineNum">      25 </span>                :      CVer - (Candidate Verion) Compared using the Candidate Version
-<span class="lineNum">      26 </span>                :    The candidate and now results are used to decide wheather a package
-<span class="lineNum">      27 </span>                :    should be automatically installed or if it should be left alone.
-<span class="lineNum">      28 </span>                :    
-<span class="lineNum">      29 </span>                :    Remember, the Candidate Version is selected based on the distribution
-<span class="lineNum">      30 </span>                :    settings for the Package. The Install Version is selected based on the
-<span class="lineNum">      31 </span>                :    state (Delete, Keep, Install) field and can be either the Current Version
-<span class="lineNum">      32 </span>                :    or the Candidate version.
-<span class="lineNum">      33 </span>                :    
-<span class="lineNum">      34 </span>                :    The Candidate version is what is shown the 'Install Version' field.
-<span class="lineNum">      35 </span>                :    
-<span class="lineNum">      36 </span>                :    ##################################################################### */
-<span class="lineNum">      37 </span>                :                                                                         /*}}}*/
-<span class="lineNum">      38 </span>                : #ifndef PKGLIB_DEPCACHE_H
-<span class="lineNum">      39 </span>                : #define PKGLIB_DEPCACHE_H
-<span class="lineNum">      40 </span>                : 
-<span class="lineNum">      41 </span>                : 
-<span class="lineNum">      42 </span>                : #include &lt;apt-pkg/pkgcache.h&gt;
-<span class="lineNum">      43 </span>                : #include &lt;apt-pkg/progress.h&gt;
-<span class="lineNum">      44 </span>                : 
-<span class="lineNum">      45 </span>                : #include &lt;regex.h&gt;
-<span class="lineNum">      46 </span>                : 
-<span class="lineNum">      47 </span>                : #include &lt;vector&gt;
-<span class="lineNum">      48 </span>                : #include &lt;memory&gt;
-<span class="lineNum">      49 </span>                : 
-<span class="lineNum">      50 </span>                : class pkgDepCache : protected pkgCache::Namespace
-<span class="lineNum">      51 </span>                : {
-<span class="lineNum">      52 </span>                :    public:
-<span class="lineNum">      53 </span>                : 
-<span class="lineNum">      54 </span>                :    /** \brief An arbitrary predicate on packages. */
-<span class="lineNum">      55 </span>                :    class InRootSetFunc
-<span class="lineNum">      56 </span>                :    {
-<span class="lineNum">      57 </span>                :    public:
-<span class="lineNum">      58 </span>                :      virtual bool InRootSet(const pkgCache::PkgIterator &amp;pkg) {return false;};
-<span class="lineNum">      59 </span>                :      virtual ~InRootSetFunc() {};
-<span class="lineNum">      60 </span>                :    };
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span>                :    private:
-<span class="lineNum">      63 </span>                :    /** \brief Mark a single package and all its unmarked important
-<span class="lineNum">      64 </span>                :     *  dependencies during mark-and-sweep.
-<span class="lineNum">      65 </span>                :     *
-<span class="lineNum">      66 </span>                :     *  Recursively invokes itself to mark all dependencies of the
-<span class="lineNum">      67 </span>                :     *  package.
-<span class="lineNum">      68 </span>                :     *
-<span class="lineNum">      69 </span>                :     *  \param pkg The package to mark.
-<span class="lineNum">      70 </span>                :     *
-<span class="lineNum">      71 </span>                :     *  \param ver The version of the package that is to be marked.
-<span class="lineNum">      72 </span>                :     *
-<span class="lineNum">      73 </span>                :     *  \param follow_recommends If \b true, recommendations of the
-<span class="lineNum">      74 </span>                :     *  package will be recursively marked.
-<span class="lineNum">      75 </span>                :     *
-<span class="lineNum">      76 </span>                :     *  \param follow_suggests If \b true, suggestions of the package
-<span class="lineNum">      77 </span>                :     *  will be recursively marked.
-<span class="lineNum">      78 </span>                :     */
-<span class="lineNum">      79 </span>                :    void MarkPackage(const pkgCache::PkgIterator &amp;pkg,
-<span class="lineNum">      80 </span>                :                     const pkgCache::VerIterator &amp;ver,
-<span class="lineNum">      81 </span>                :                     bool follow_recommends,
-<span class="lineNum">      82 </span>                :                     bool follow_suggests);
-<span class="lineNum">      83 </span>                : 
-<span class="lineNum">      84 </span>                :    /** \brief Update the Marked field of all packages.
-<span class="lineNum">      85 </span>                :     *
-<span class="lineNum">      86 </span>                :     *  Each package's StateCache::Marked field will be set to \b true
-<span class="lineNum">      87 </span>                :     *  if and only if it can be reached from the root set.  By
-<span class="lineNum">      88 </span>                :     *  default, the root set consists of the set of manually installed
-<span class="lineNum">      89 </span>                :     *  or essential packages, but it can be extended using the
-<span class="lineNum">      90 </span>                :     *  parameter #rootFunc.
-<span class="lineNum">      91 </span>                :     *
-<span class="lineNum">      92 </span>                :     *  \param rootFunc A callback that can be used to add extra
-<span class="lineNum">      93 </span>                :     *  packages to the root set.
-<span class="lineNum">      94 </span>                :     *
-<span class="lineNum">      95 </span>                :     *  \return \b false if an error occurred.
-<span class="lineNum">      96 </span>                :     */
-<span class="lineNum">      97 </span>                :    bool MarkRequired(InRootSetFunc &amp;rootFunc);
-<span class="lineNum">      98 </span>                : 
-<span class="lineNum">      99 </span>                :    /** \brief Set the StateCache::Garbage flag on all packages that
-<span class="lineNum">     100 </span>                :     *  should be removed.
-<span class="lineNum">     101 </span>                :     *
-<span class="lineNum">     102 </span>                :     *  Packages that were not marked by the last call to #MarkRequired
-<span class="lineNum">     103 </span>                :     *  are tested to see whether they are actually garbage.  If so,
-<span class="lineNum">     104 </span>                :     *  they are marked as such.
-<span class="lineNum">     105 </span>                :     *
-<span class="lineNum">     106 </span>                :     *  \return \b false if an error occurred.
-<span class="lineNum">     107 </span>                :     */
-<span class="lineNum">     108 </span>                :    bool Sweep();
-<span class="lineNum">     109 </span>                : 
-<span class="lineNum">     110 </span>                :    public:
-<span class="lineNum">     111 </span>                :    
-<span class="lineNum">     112 </span>                :    // These flags are used in DepState
-<span class="lineNum">     113 </span>                :    enum DepFlags {DepNow = (1 &lt;&lt; 0),DepInstall = (1 &lt;&lt; 1),DepCVer = (1 &lt;&lt; 2),
-<span class="lineNum">     114 </span>                :                   DepGNow = (1 &lt;&lt; 3),DepGInstall = (1 &lt;&lt; 4),DepGCVer = (1 &lt;&lt; 5)};
-<span class="lineNum">     115 </span>                : 
-<span class="lineNum">     116 </span>                :    // These flags are used in StateCache::DepState
-<span class="lineNum">     117 </span>                :    enum DepStateFlags {DepNowPolicy = (1 &lt;&lt; 0), DepNowMin = (1 &lt;&lt; 1),
-<span class="lineNum">     118 </span>                :                        DepInstPolicy = (1 &lt;&lt; 2), DepInstMin = (1 &lt;&lt; 3),
-<span class="lineNum">     119 </span>                :                        DepCandPolicy = (1 &lt;&lt; 4), DepCandMin = (1 &lt;&lt; 5)};
-<span class="lineNum">     120 </span>                :    
-<span class="lineNum">     121 </span>                :    // These flags are used in StateCache::iFlags
-<span class="lineNum">     122 </span>                :    enum InternalFlags {AutoKept = (1 &lt;&lt; 0), Purge = (1 &lt;&lt; 1), ReInstall = (1 &lt;&lt; 2)};
-<span class="lineNum">     123 </span>                :       
-<span class="lineNum">     124 </span>                :    enum VersionTypes {NowVersion, InstallVersion, CandidateVersion};
-<span class="lineNum">     125 </span>                :    enum ModeList {ModeDelete = 0, ModeKeep = 1, ModeInstall = 2};
-<span class="lineNum">     126 </span>                : 
-<span class="lineNum">     127 </span>                :    /** \brief Represents an active action group.
-<span class="lineNum">     128 </span>                :     *
-<span class="lineNum">     129 </span>                :     *  An action group is a group of actions that are currently being
-<span class="lineNum">     130 </span>                :     *  performed.  While an active group is active, certain routine
-<span class="lineNum">     131 </span>                :     *  clean-up actions that would normally be performed after every
-<span class="lineNum">     132 </span>                :     *  cache operation are delayed until the action group is
-<span class="lineNum">     133 </span>                :     *  completed.  This is necessary primarily to avoid inefficiencies
-<span class="lineNum">     134 </span>                :     *  when modifying a large number of packages at once.
-<span class="lineNum">     135 </span>                :     *
-<span class="lineNum">     136 </span>                :     *  This class represents an active action group.  Creating an
-<span class="lineNum">     137 </span>                :     *  instance will create an action group; destroying one will
-<span class="lineNum">     138 </span>                :     *  destroy the corresponding action group.
-<span class="lineNum">     139 </span>                :     *
-<span class="lineNum">     140 </span>                :     *  The following operations are suppressed by this class:
-<span class="lineNum">     141 </span>                :     *
-<span class="lineNum">     142 </span>                :     *    - Keeping the Marked and Garbage flags up to date.
-<span class="lineNum">     143 </span>                :     *
-<span class="lineNum">     144 </span>                :     *  \note This can be used in the future to easily accumulate
-<span class="lineNum">     145 </span>                :     *  atomic actions for undo or to display &quot;what apt did anyway&quot;;
-<span class="lineNum">     146 </span>                :     *  e.g., change the counter of how many action groups are active
-<span class="lineNum">     147 </span>                :     *  to a std::set of pointers to them and use those to store
-<span class="lineNum">     148 </span>                :     *  information about what happened in a group in the group.
-<span class="lineNum">     149 </span>                :     */
-<span class="lineNum">     150 </span>                :    class ActionGroup
-<span class="lineNum">     151 </span>                :    {
-<span class="lineNum">     152 </span>                :        pkgDepCache &amp;cache;
-<span class="lineNum">     153 </span>                : 
-<span class="lineNum">     154 </span>                :        bool released;
-<span class="lineNum">     155 </span>                : 
-<span class="lineNum">     156 </span>                :        /** Action groups are noncopyable. */
-<span class="lineNum">     157 </span>                :        ActionGroup(const ActionGroup &amp;other);
-<span class="lineNum">     158 </span>                :    public:
-<span class="lineNum">     159 </span>                :        /** \brief Create a new ActionGroup.
-<span class="lineNum">     160 </span>                :         *
-<span class="lineNum">     161 </span>                :         *  \param cache The cache that this ActionGroup should
-<span class="lineNum">     162 </span>                :         *  manipulate.
-<span class="lineNum">     163 </span>                :         *
-<span class="lineNum">     164 </span>                :         *  As long as this object exists, no automatic cleanup
-<span class="lineNum">     165 </span>                :         *  operations will be undertaken.
-<span class="lineNum">     166 </span>                :         */
-<span class="lineNum">     167 </span>                :        ActionGroup(pkgDepCache &amp;cache);
-<span class="lineNum">     168 </span>                : 
-<span class="lineNum">     169 </span>                :        /** \brief Clean up the action group before it is destroyed.
-<span class="lineNum">     170 </span>                :         *
-<span class="lineNum">     171 </span>                :         *  If it is destroyed later, no second cleanup wil be run.
-<span class="lineNum">     172 </span>                :         */
-<span class="lineNum">     173 </span>                :        void release();
-<span class="lineNum">     174 </span>                : 
-<span class="lineNum">     175 </span>                :        /** \brief Destroy the action group.
-<span class="lineNum">     176 </span>                :         *
-<span class="lineNum">     177 </span>                :         *  If this is the last action group, the automatic cache
-<span class="lineNum">     178 </span>                :         *  cleanup operations will be undertaken.
-<span class="lineNum">     179 </span>                :         */
-<span class="lineNum">     180 </span>                :        ~ActionGroup();
-<span class="lineNum">     181 </span>                :    };
-<span class="lineNum">     182 </span>                : 
-<span class="lineNum">     183 </span>                :    /** \brief Returns \b true for packages matching a regular
-<span class="lineNum">     184 </span>                :     *  expression in APT::NeverAutoRemove.
-<span class="lineNum">     185 </span>                :     */
-<span class="lineNum">     186 </span>                :    class DefaultRootSetFunc : public InRootSetFunc
-<span class="lineNum">     187 </span>                :    {
-<span class="lineNum">     188 </span>                :      std::vector&lt;regex_t *&gt; rootSetRegexp;
-<span class="lineNum">     189 </span>                :      bool constructedSuccessfully;
-<span class="lineNum">     190 </span>                : 
-<span class="lineNum">     191 </span>                :    public:
-<span class="lineNum">     192 </span>                :      DefaultRootSetFunc();
-<span class="lineNum">     193 </span>                :      ~DefaultRootSetFunc();
-<span class="lineNum">     194 </span>                : 
-<span class="lineNum">     195 </span>                :      /** \return \b true if the class initialized successfully, \b
-<span class="lineNum">     196 </span>                :       *  false otherwise.  Used to avoid throwing an exception, since
-<span class="lineNum">     197 </span>                :       *  APT classes generally don't.
-<span class="lineNum">     198 </span>                :       */
-<span class="lineNum">     199 </span>                :      bool wasConstructedSuccessfully() const { return constructedSuccessfully; }
-<span class="lineNum">     200 </span>                : 
-<span class="lineNum">     201 </span>                :      bool InRootSet(const pkgCache::PkgIterator &amp;pkg);
-<span class="lineNum">     202 </span>                :    };
-<span class="lineNum">     203 </span>                : 
-<span class="lineNum">     204 </span>                :    struct StateCache
-<span class="lineNum">     205 </span>                :    {
-<span class="lineNum">     206 </span>                :       // Epoch stripped text versions of the two version fields
-<span class="lineNum">     207 </span>                :       const char *CandVersion;
-<span class="lineNum">     208 </span>                :       const char *CurVersion;
-<span class="lineNum">     209 </span>                : 
-<span class="lineNum">     210 </span>                :       // Pointer to the candidate install version. 
-<span class="lineNum">     211 </span>                :       Version *CandidateVer;
-<span class="lineNum">     212 </span>                : 
-<span class="lineNum">     213 </span>                :       // Pointer to the install version.
-<span class="lineNum">     214 </span>                :       Version *InstallVer;
-<span class="lineNum">     215 </span>                :       
-<span class="lineNum">     216 </span>                :       // Copy of Package::Flags
-<span class="lineNum">     217 </span>                :       unsigned short Flags;
-<span class="lineNum">     218 </span>                :       unsigned short iFlags;           // Internal flags
-<span class="lineNum">     219 </span>                : 
-<span class="lineNum">     220 </span>                :       /** \brief \b true if this package can be reached from the root set. */
-<span class="lineNum">     221 </span>                :       bool Marked;
-<span class="lineNum">     222 </span>                : 
-<span class="lineNum">     223 </span>                :       /** \brief \b true if this package is unused and should be removed.
-<span class="lineNum">     224 </span>                :        *
-<span class="lineNum">     225 </span>                :        *  This differs from !#Marked, because it is possible that some
-<span class="lineNum">     226 </span>                :        *  unreachable packages will be protected from becoming
-<span class="lineNum">     227 </span>                :        *  garbage.
-<span class="lineNum">     228 </span>                :        */
-<span class="lineNum">     229 </span>                :       bool Garbage;
-<span class="lineNum">     230 </span>                : 
-<span class="lineNum">     231 </span>                :       // Various tree indicators
-<span class="lineNum">     232 </span>                :       signed char Status;              // -1,0,1,2
-<span class="lineNum">     233 </span>                :       unsigned char Mode;              // ModeList
-<span class="lineNum">     234 </span>                :       unsigned char DepState;          // DepState Flags
-<span class="lineNum">     235 </span>                : 
-<span class="lineNum">     236 </span>                :       // Update of candidate version
-<span class="lineNum">     237 </span>                :       const char *StripEpoch(const char *Ver);
-<span class="lineNum">     238 </span>                :       void Update(PkgIterator Pkg,pkgCache &amp;Cache);
-<span class="lineNum">     239 </span>                :       
-<span class="lineNum">     240 </span>                :       // Various test members for the current status of the package
-<span class="lineNum">     241 </span>                :       inline bool NewInstall() const {return Status == 2 &amp;&amp; Mode == ModeInstall;};
-<span class="lineNum">     242 </span><span class="lineCov">           3785 :       inline bool Delete() const {return Mode == ModeDelete;};</span>
-<span class="lineNum">     243 </span><span class="lineCov">           3785 :       inline bool Keep() const {return Mode == ModeKeep;};</span>
-<span class="lineNum">     244 </span>                :       inline bool Upgrade() const {return Status &gt; 0 &amp;&amp; Mode == ModeInstall;};
-<span class="lineNum">     245 </span>                :       inline bool Upgradable() const {return Status &gt;= 1;};
-<span class="lineNum">     246 </span>                :       inline bool Downgrade() const {return Status &lt; 0 &amp;&amp; Mode == ModeInstall;};
-<span class="lineNum">     247 </span>                :       inline bool Held() const {return Status != 0 &amp;&amp; Keep();};
-<span class="lineNum">     248 </span><span class="lineCov">           3785 :       inline bool NowBroken() const {return (DepState &amp; DepNowMin) != DepNowMin;};</span>
-<span class="lineNum">     249 </span>                :       inline bool NowPolicyBroken() const {return (DepState &amp; DepNowPolicy) != DepNowPolicy;};
-<span class="lineNum">     250 </span><span class="lineCov">           3785 :       inline bool InstBroken() const {return (DepState &amp; DepInstMin) != DepInstMin;};</span>
-<span class="lineNum">     251 </span>                :       inline bool InstPolicyBroken() const {return (DepState &amp; DepInstPolicy) != DepInstPolicy;};
-<span class="lineNum">     252 </span><span class="lineCov">           3785 :       inline bool Install() const {return Mode == ModeInstall;};</span>
-<span class="lineNum">     253 </span>                :       inline VerIterator InstVerIter(pkgCache &amp;Cache)
-<span class="lineNum">     254 </span>                :                 {return VerIterator(Cache,InstallVer);};
-<span class="lineNum">     255 </span>                :       inline VerIterator CandidateVerIter(pkgCache &amp;Cache)
-<span class="lineNum">     256 </span>                :                 {return VerIterator(Cache,CandidateVer);};
-<span class="lineNum">     257 </span>                :    };
-<span class="lineNum">     258 </span>                :    
-<span class="lineNum">     259 </span>                :    // Helper functions
-<span class="lineNum">     260 </span>                :    void BuildGroupOrs(VerIterator const &amp;V);
-<span class="lineNum">     261 </span>                :    void UpdateVerState(PkgIterator Pkg);
-<span class="lineNum">     262 </span>                : 
-<span class="lineNum">     263 </span>                :    // User Policy control
-<span class="lineNum">     264 </span>                :    class Policy
-<span class="lineNum">     265 </span>                :    {
-<span class="lineNum">     266 </span>                :       public:
-<span class="lineNum">     267 </span>                :       
-<span class="lineNum">     268 </span>                :       virtual VerIterator GetCandidateVer(PkgIterator Pkg);
-<span class="lineNum">     269 </span>                :       virtual bool IsImportantDep(DepIterator Dep);
-<span class="lineNum">     270 </span>                :       
-<span class="lineNum">     271 </span>                :       virtual ~Policy() {};
-<span class="lineNum">     272 </span>                :    };
-<span class="lineNum">     273 </span>                : 
-<span class="lineNum">     274 </span>                :    private:
-<span class="lineNum">     275 </span>                :    /** The number of open &quot;action groups&quot;; certain post-action
-<span class="lineNum">     276 </span>                :     *  operations are suppressed if this number is &gt; 0.
-<span class="lineNum">     277 </span>                :     */
-<span class="lineNum">     278 </span>                :    int group_level;
-<span class="lineNum">     279 </span>                : 
-<span class="lineNum">     280 </span>                :    friend class ActionGroup;
-<span class="lineNum">     281 </span>                :      
-<span class="lineNum">     282 </span>                :    protected:
-<span class="lineNum">     283 </span>                : 
-<span class="lineNum">     284 </span>                :    // State information
-<span class="lineNum">     285 </span>                :    pkgCache *Cache;
-<span class="lineNum">     286 </span>                :    StateCache *PkgState;
-<span class="lineNum">     287 </span>                :    unsigned char *DepState;
-<span class="lineNum">     288 </span>                :    
-<span class="lineNum">     289 </span>                :    double iUsrSize;
-<span class="lineNum">     290 </span>                :    double iDownloadSize;
-<span class="lineNum">     291 </span>                :    unsigned long iInstCount;
-<span class="lineNum">     292 </span>                :    unsigned long iDelCount;
-<span class="lineNum">     293 </span>                :    unsigned long iKeepCount;
-<span class="lineNum">     294 </span>                :    unsigned long iBrokenCount;
-<span class="lineNum">     295 </span>                :    unsigned long iPolicyBrokenCount;
-<span class="lineNum">     296 </span>                :    unsigned long iBadCount;
-<span class="lineNum">     297 </span>                :    
-<span class="lineNum">     298 </span>                :    Policy *delLocalPolicy;           // For memory clean up..
-<span class="lineNum">     299 </span>                :    Policy *LocalPolicy;
-<span class="lineNum">     300 </span>                :    
-<span class="lineNum">     301 </span>                :    // Check for a matching provides
-<span class="lineNum">     302 </span>                :    bool CheckDep(DepIterator Dep,int Type,PkgIterator &amp;Res);
-<span class="lineNum">     303 </span>                :    inline bool CheckDep(DepIterator Dep,int Type)
-<span class="lineNum">     304 </span>                :    {
-<span class="lineNum">     305 </span>                :       PkgIterator Res(*this,0);
-<span class="lineNum">     306 </span>                :       return CheckDep(Dep,Type,Res);
-<span class="lineNum">     307 </span>                :    }
-<span class="lineNum">     308 </span>                :    
-<span class="lineNum">     309 </span>                :    // Computes state information for deps and versions (w/o storing)
-<span class="lineNum">     310 </span>                :    unsigned char DependencyState(DepIterator &amp;D);
-<span class="lineNum">     311 </span>                :    unsigned char VersionState(DepIterator D,unsigned char Check,
-<span class="lineNum">     312 </span>                :                               unsigned char SetMin,
-<span class="lineNum">     313 </span>                :                               unsigned char SetPolicy);
-<span class="lineNum">     314 </span>                : 
-<span class="lineNum">     315 </span>                :    // Recalculates various portions of the cache, call after changing something
-<span class="lineNum">     316 </span>                :    void Update(DepIterator Dep);           // Mostly internal
-<span class="lineNum">     317 </span>                :    void Update(PkgIterator const &amp;P);
-<span class="lineNum">     318 </span>                :    
-<span class="lineNum">     319 </span>                :    // Count manipulators
-<span class="lineNum">     320 </span>                :    void AddSizes(const PkgIterator &amp;Pkg,signed long Mult = 1);
-<span class="lineNum">     321 </span>                :    inline void RemoveSizes(const PkgIterator &amp;Pkg) {AddSizes(Pkg,-1);};
-<span class="lineNum">     322 </span>                :    void AddStates(const PkgIterator &amp;Pkg,int Add = 1);
-<span class="lineNum">     323 </span>                :    inline void RemoveStates(const PkgIterator &amp;Pkg) {AddStates(Pkg,-1);};
-<span class="lineNum">     324 </span>                :    
-<span class="lineNum">     325 </span>                :    public:
-<span class="lineNum">     326 </span>                : 
-<span class="lineNum">     327 </span>                :    // Legacy.. We look like a pkgCache
-<span class="lineNum">     328 </span>                :    inline operator pkgCache &amp;() {return *Cache;};
-<span class="lineNum">     329 </span>                :    inline Header &amp;Head() {return *Cache-&gt;HeaderP;};
-<span class="lineNum">     330 </span>                :    inline PkgIterator PkgBegin() {return Cache-&gt;PkgBegin();};
-<span class="lineNum">     331 </span>                :    inline PkgIterator FindPkg(string const &amp;Name) {return Cache-&gt;FindPkg(Name);};
-<span class="lineNum">     332 </span>                : 
-<span class="lineNum">     333 </span>                :    inline pkgCache &amp;GetCache() {return *Cache;};
-<span class="lineNum">     334 </span>                :    inline pkgVersioningSystem &amp;VS() {return *Cache-&gt;VS;};
-<span class="lineNum">     335 </span>                :    
-<span class="lineNum">     336 </span>                :    // Policy implementation
-<span class="lineNum">     337 </span>                :    inline VerIterator GetCandidateVer(PkgIterator Pkg) {return LocalPolicy-&gt;GetCandidateVer(Pkg);};
-<span class="lineNum">     338 </span>                :    inline bool IsImportantDep(DepIterator Dep) {return LocalPolicy-&gt;IsImportantDep(Dep);};
-<span class="lineNum">     339 </span>                :    inline Policy &amp;GetPolicy() {return *LocalPolicy;};
-<span class="lineNum">     340 </span>                :    
-<span class="lineNum">     341 </span>                :    // Accessors
-<span class="lineNum">     342 </span><span class="lineCov">           3787 :    inline StateCache &amp;operator [](PkgIterator const &amp;I) {return PkgState[I-&gt;ID];};</span>
-<span class="lineNum">     343 </span>                :    inline unsigned char &amp;operator [](DepIterator const &amp;I) {return DepState[I-&gt;ID];};
-<span class="lineNum">     344 </span>                : 
-<span class="lineNum">     345 </span>                :    /** \return A function identifying packages in the root set other
-<span class="lineNum">     346 </span>                :     *  than manually installed packages and essential packages, or \b
-<span class="lineNum">     347 </span>                :     *  NULL if an error occurs.
-<span class="lineNum">     348 </span>                :     *
-<span class="lineNum">     349 </span>                :     *  \todo Is this the best place for this function?  Perhaps the
-<span class="lineNum">     350 </span>                :     *  settings for mark-and-sweep should be stored in a single
-<span class="lineNum">     351 </span>                :     *  external class?
-<span class="lineNum">     352 </span>                :     */
-<span class="lineNum">     353 </span>                :    virtual InRootSetFunc *GetRootSetFunc();
-<span class="lineNum">     354 </span>                : 
-<span class="lineNum">     355 </span>                :    /** \return \b true if the garbage collector should follow recommendations.
-<span class="lineNum">     356 </span>                :     */
-<span class="lineNum">     357 </span>                :    virtual bool MarkFollowsRecommends();
-<span class="lineNum">     358 </span>                : 
-<span class="lineNum">     359 </span>                :    /** \return \b true if the garbage collector should follow suggestions.
-<span class="lineNum">     360 </span>                :     */
-<span class="lineNum">     361 </span>                :    virtual bool MarkFollowsSuggests();
-<span class="lineNum">     362 </span>                : 
-<span class="lineNum">     363 </span>                :    /** \brief Update the Marked and Garbage fields of all packages.
-<span class="lineNum">     364 </span>                :     *
-<span class="lineNum">     365 </span>                :     *  This routine is implicitly invoked after all state manipulators
-<span class="lineNum">     366 </span>                :     *  and when an ActionGroup is destroyed.  It invokes #MarkRequired
-<span class="lineNum">     367 </span>                :     *  and #Sweep to do its dirty work.
-<span class="lineNum">     368 </span>                :     *
-<span class="lineNum">     369 </span>                :     *  \param rootFunc A predicate that returns \b true for packages
-<span class="lineNum">     370 </span>                :     *  that should be added to the root set.
-<span class="lineNum">     371 </span>                :     */
-<span class="lineNum">     372 </span>                :    bool MarkAndSweep(InRootSetFunc &amp;rootFunc)
-<span class="lineNum">     373 </span>                :    {
-<span class="lineNum">     374 </span>                :      return MarkRequired(rootFunc) &amp;&amp; Sweep();
-<span class="lineNum">     375 </span>                :    }
-<span class="lineNum">     376 </span>                : 
-<span class="lineNum">     377 </span>                :    bool MarkAndSweep()
-<span class="lineNum">     378 </span>                :    {
-<span class="lineNum">     379 </span>                :      std::auto_ptr&lt;InRootSetFunc&gt; f(GetRootSetFunc());
-<span class="lineNum">     380 </span>                :      if(f.get() != NULL)
-<span class="lineNum">     381 </span>                :        return MarkAndSweep(*f.get());
-<span class="lineNum">     382 </span>                :      else
-<span class="lineNum">     383 </span>                :        return false;
-<span class="lineNum">     384 </span>                :    }
-<span class="lineNum">     385 </span>                : 
-<span class="lineNum">     386 </span>                :    /** \name State Manipulators
-<span class="lineNum">     387 </span>                :     */
-<span class="lineNum">     388 </span>                :    // @{
-<span class="lineNum">     389 </span>                :    void MarkKeep(PkgIterator const &amp;Pkg, bool Soft = false,
-<span class="lineNum">     390 </span>                :                  bool FromUser = true);
-<span class="lineNum">     391 </span>                :    void MarkDelete(PkgIterator const &amp;Pkg,bool Purge = false);
-<span class="lineNum">     392 </span>                :    void MarkInstall(PkgIterator const &amp;Pkg,bool AutoInst = true,
-<span class="lineNum">     393 </span>                :                     unsigned long Depth = 0, bool FromUser = true,
-<span class="lineNum">     394 </span>                :                     bool ForceImportantDeps = false);
-<span class="lineNum">     395 </span>                :    void SetReInstall(PkgIterator const &amp;Pkg,bool To);
-<span class="lineNum">     396 </span>                :    void SetCandidateVersion(VerIterator TargetVer);
-<span class="lineNum">     397 </span>                : 
-<span class="lineNum">     398 </span>                :    /** Set the &quot;is automatically installed&quot; flag of Pkg. */
-<span class="lineNum">     399 </span>                :    void MarkAuto(const PkgIterator &amp;Pkg, bool Auto);
-<span class="lineNum">     400 </span>                :    // @}
-<span class="lineNum">     401 </span>                :    
-<span class="lineNum">     402 </span>                :    // This is for debuging
-<span class="lineNum">     403 </span>                :    void Update(OpProgress *Prog = 0);
-<span class="lineNum">     404 </span>                : 
-<span class="lineNum">     405 </span>                :    // read persistent states
-<span class="lineNum">     406 </span>                :    bool readStateFile(OpProgress *prog);
-<span class="lineNum">     407 </span>                :    bool writeStateFile(OpProgress *prog, bool InstalledOnly=false);
-<span class="lineNum">     408 </span>                :    
-<span class="lineNum">     409 </span>                :    // Size queries
-<span class="lineNum">     410 </span>                :    inline double UsrSize() {return iUsrSize;};
-<span class="lineNum">     411 </span>                :    inline double DebSize() {return iDownloadSize;};
-<span class="lineNum">     412 </span>                :    inline unsigned long DelCount() {return iDelCount;};
-<span class="lineNum">     413 </span>                :    inline unsigned long KeepCount() {return iKeepCount;};
-<span class="lineNum">     414 </span>                :    inline unsigned long InstCount() {return iInstCount;};
-<span class="lineNum">     415 </span>                :    inline unsigned long BrokenCount() {return iBrokenCount;};
-<span class="lineNum">     416 </span>                :    inline unsigned long PolicyBrokenCount() {return iPolicyBrokenCount;};
-<span class="lineNum">     417 </span>                :    inline unsigned long BadCount() {return iBadCount;};
-<span class="lineNum">     418 </span>                : 
-<span class="lineNum">     419 </span>                :    bool Init(OpProgress *Prog);
-<span class="lineNum">     420 </span>                :    
-<span class="lineNum">     421 </span>                :    pkgDepCache(pkgCache *Cache,Policy *Plcy = 0);
-<span class="lineNum">     422 </span>                :    virtual ~pkgDepCache();
-<span class="lineNum">     423 </span>                : };
-<span class="lineNum">     424 </span>                : 
-<span class="lineNum">     425 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/apt-pkg/error.h.gcov.html b/rep/usr/include/apt-pkg/error.h.gcov.html
deleted file mode 100644
index b4b55f3..0000000
--- a/rep/usr/include/apt-pkg/error.h.gcov.html
+++ /dev/null
@@ -1,168 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/apt-pkg/error.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/apt-pkg</a> - error.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">2</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">50.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">1</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- mode: cpp; mode: fold -*-
-<span class="lineNum">       2 </span>                : // Description                                                          /*{{{*/
-<span class="lineNum">       3 </span>                : // $Id: error.h,v 1.8 2001/05/07 05:06:52 jgg Exp $
-<span class="lineNum">       4 </span>                : /* ######################################################################
-<span class="lineNum">       5 </span>                :    
-<span class="lineNum">       6 </span>                :    Global Erorr Class - Global error mechanism
-<span class="lineNum">       7 </span>                : 
-<span class="lineNum">       8 </span>                :    This class has a single global instance. When a function needs to 
-<span class="lineNum">       9 </span>                :    generate an error condition, such as a read error, it calls a member
-<span class="lineNum">      10 </span>                :    in this class to add the error to a stack of errors. 
-<span class="lineNum">      11 </span>                :    
-<span class="lineNum">      12 </span>                :    By using a stack the problem with a scheme like errno is removed and
-<span class="lineNum">      13 </span>                :    it allows a very detailed account of what went wrong to be transmitted
-<span class="lineNum">      14 </span>                :    to the UI for display. (Errno has problems because each function sets
-<span class="lineNum">      15 </span>                :    errno to 0 if it didn't have an error thus eraseing erno in the process
-<span class="lineNum">      16 </span>                :    of cleanup)
-<span class="lineNum">      17 </span>                :    
-<span class="lineNum">      18 </span>                :    Several predefined error generators are provided to handle common 
-<span class="lineNum">      19 </span>                :    things like errno. The general idea is that all methods return a bool.
-<span class="lineNum">      20 </span>                :    If the bool is true then things are OK, if it is false then things 
-<span class="lineNum">      21 </span>                :    should start being undone and the stack should unwind under program
-<span class="lineNum">      22 </span>                :    control.
-<span class="lineNum">      23 </span>                :    
-<span class="lineNum">      24 </span>                :    A Warning should not force the return of false. Things did not fail, but
-<span class="lineNum">      25 </span>                :    they might have had unexpected problems. Errors are stored in a FIFO
-<span class="lineNum">      26 </span>                :    so Pop will return the first item..
-<span class="lineNum">      27 </span>                :    
-<span class="lineNum">      28 </span>                :    I have some thoughts about extending this into a more general UI&lt;-&gt; 
-<span class="lineNum">      29 </span>                :    Engine interface, ie allowing the Engine to say 'The disk is full' in 
-<span class="lineNum">      30 </span>                :    a dialog that says 'Panic' and 'Retry'.. The error generator functions
-<span class="lineNum">      31 </span>                :    like errno, Warning and Error return false always so this is normal:
-<span class="lineNum">      32 </span>                :      if (open(..))
-<span class="lineNum">      33 </span>                :         return _error-&gt;Errno(..);
-<span class="lineNum">      34 </span>                :    
-<span class="lineNum">      35 </span>                :    This source is placed in the Public Domain, do with it what you will
-<span class="lineNum">      36 </span>                :    It was originally written by Jason Gunthorpe.
-<span class="lineNum">      37 </span>                :    
-<span class="lineNum">      38 </span>                :    ##################################################################### */
-<span class="lineNum">      39 </span>                :                                                                         /*}}}*/
-<span class="lineNum">      40 </span>                : #ifndef PKGLIB_ERROR_H
-<span class="lineNum">      41 </span>                : #define PKGLIB_ERROR_H
-<span class="lineNum">      42 </span>                : 
-<span class="lineNum">      43 </span>                : 
-<span class="lineNum">      44 </span>                : 
-<span class="lineNum">      45 </span>                : #ifdef __GNUG__
-<span class="lineNum">      46 </span>                : // Methods have a hidden this parameter that is visible to this attribute
-<span class="lineNum">      47 </span>                : #define APT_MFORMAT1 __attribute__ ((format (printf, 2, 3)))
-<span class="lineNum">      48 </span>                : #define APT_MFORMAT2 __attribute__ ((format (printf, 3, 4)))
-<span class="lineNum">      49 </span>                : #else
-<span class="lineNum">      50 </span>                : #define APT_MFORMAT1
-<span class="lineNum">      51 </span>                : #define APT_MFORMAT2    
-<span class="lineNum">      52 </span>                : #endif    
-<span class="lineNum">      53 </span>                :     
-<span class="lineNum">      54 </span>                : #include &lt;string&gt;
-<span class="lineNum">      55 </span>                : 
-<span class="lineNum">      56 </span>                : using std::string;
-<span class="lineNum">      57 </span>                : 
-<span class="lineNum">      58 </span>                : class GlobalError
-<span class="lineNum">      59 </span>                : {
-<span class="lineNum">      60 </span>                :    struct Item
-<span class="lineNum">      61 </span>                :    {
-<span class="lineNum">      62 </span>                :       string Text;
-<span class="lineNum">      63 </span>                :       bool Error;
-<span class="lineNum">      64 </span>                :       Item *Next;
-<span class="lineNum">      65 </span>                :    };
-<span class="lineNum">      66 </span>                :    
-<span class="lineNum">      67 </span>                :    Item *List;
-<span class="lineNum">      68 </span>                :    bool PendingFlag;
-<span class="lineNum">      69 </span>                :    void Insert(Item *I);
-<span class="lineNum">      70 </span>                :    
-<span class="lineNum">      71 </span>                :    public:
-<span class="lineNum">      72 </span>                : 
-<span class="lineNum">      73 </span>                :    // Call to generate an error from a library call.
-<span class="lineNum">      74 </span>                :    bool Errno(const char *Function,const char *Description,...) APT_MFORMAT2;
-<span class="lineNum">      75 </span>                :    bool WarningE(const char *Function,const char *Description,...) APT_MFORMAT2;
-<span class="lineNum">      76 </span>                : 
-<span class="lineNum">      77 </span>                :    /* A warning should be considered less severe than an error, and may be
-<span class="lineNum">      78 </span>                :       ignored by the client. */
-<span class="lineNum">      79 </span>                :    bool Error(const char *Description,...) APT_MFORMAT1;
-<span class="lineNum">      80 </span>                :    bool Warning(const char *Description,...) APT_MFORMAT1;
-<span class="lineNum">      81 </span>                : 
-<span class="lineNum">      82 </span>                :    // Simple accessors
-<span class="lineNum">      83 </span><span class="lineCov">              3 :    inline bool PendingError() {return PendingFlag;};</span>
-<span class="lineNum">      84 </span><span class="lineNoCov">              0 :    inline bool empty() {return List == 0;};</span>
-<span class="lineNum">      85 </span>                :    bool PopMessage(string &amp;Text);
-<span class="lineNum">      86 </span>                :    void Discard();
-<span class="lineNum">      87 </span>                : 
-<span class="lineNum">      88 </span>                :    // Usefull routine to dump to cerr
-<span class="lineNum">      89 </span>                :    void DumpErrors();
-<span class="lineNum">      90 </span>                :    
-<span class="lineNum">      91 </span>                :    GlobalError();
-<span class="lineNum">      92 </span>                : };
-<span class="lineNum">      93 </span>                : 
-<span class="lineNum">      94 </span>                : // The 'extra-ansi' syntax is used to help with collisions. 
-<span class="lineNum">      95 </span>                : GlobalError *_GetErrorObj();
-<span class="lineNum">      96 </span>                : #define _error _GetErrorObj()
-<span class="lineNum">      97 </span>                : 
-<span class="lineNum">      98 </span>                : #undef APT_MFORMAT1
-<span class="lineNum">      99 </span>                : #undef APT_MFORMAT2
-<span class="lineNum">     100 </span>                : 
-<span class="lineNum">     101 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/apt-pkg/fileutl.h.gcov.html b/rep/usr/include/apt-pkg/fileutl.h.gcov.html
deleted file mode 100644
index 9726c50..0000000
--- a/rep/usr/include/apt-pkg/fileutl.h.gcov.html
+++ /dev/null
@@ -1,165 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/apt-pkg/fileutl.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/apt-pkg</a> - fileutl.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">6</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">6</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- mode: cpp; mode: fold -*-
-<span class="lineNum">       2 </span>                : // Description                                                          /*{{{*/
-<span class="lineNum">       3 </span>                : // $Id: fileutl.h,v 1.26 2001/05/07 05:06:52 jgg Exp $
-<span class="lineNum">       4 </span>                : /* ######################################################################
-<span class="lineNum">       5 </span>                :    
-<span class="lineNum">       6 </span>                :    File Utilities
-<span class="lineNum">       7 </span>                :    
-<span class="lineNum">       8 </span>                :    CopyFile - Buffered copy of a single file
-<span class="lineNum">       9 </span>                :    GetLock - dpkg compatible lock file manipulation (fcntl)
-<span class="lineNum">      10 </span>                :    FileExists - Returns true if the file exists
-<span class="lineNum">      11 </span>                :    SafeGetCWD - Returns the CWD in a string with overrun protection 
-<span class="lineNum">      12 </span>                :    
-<span class="lineNum">      13 </span>                :    The file class is a handy abstraction for various functions+classes
-<span class="lineNum">      14 </span>                :    that need to accept filenames.
-<span class="lineNum">      15 </span>                :    
-<span class="lineNum">      16 </span>                :    This source is placed in the Public Domain, do with it what you will
-<span class="lineNum">      17 </span>                :    It was originally written by Jason Gunthorpe.
-<span class="lineNum">      18 </span>                :    
-<span class="lineNum">      19 </span>                :    ##################################################################### */
-<span class="lineNum">      20 </span>                :                                                                         /*}}}*/
-<span class="lineNum">      21 </span>                : #ifndef PKGLIB_FILEUTL_H
-<span class="lineNum">      22 </span>                : #define PKGLIB_FILEUTL_H
-<span class="lineNum">      23 </span>                : 
-<span class="lineNum">      24 </span>                : 
-<span class="lineNum">      25 </span>                : #include &lt;string&gt;
-<span class="lineNum">      26 </span>                : 
-<span class="lineNum">      27 </span>                : using std::string;
-<span class="lineNum">      28 </span>                : 
-<span class="lineNum">      29 </span>                : class FileFd
-<span class="lineNum">      30 </span>                : {
-<span class="lineNum">      31 </span>                :    protected:
-<span class="lineNum">      32 </span>                :    int iFd;
-<span class="lineNum">      33 </span>                :  
-<span class="lineNum">      34 </span>                :    enum LocalFlags {AutoClose = (1&lt;&lt;0),Fail = (1&lt;&lt;1),DelOnFail = (1&lt;&lt;2),
-<span class="lineNum">      35 </span>                :                     HitEof = (1&lt;&lt;3)};
-<span class="lineNum">      36 </span>                :    unsigned long Flags;
-<span class="lineNum">      37 </span>                :    string FileName;
-<span class="lineNum">      38 </span>                :    
-<span class="lineNum">      39 </span>                :    public:
-<span class="lineNum">      40 </span>                :    enum OpenMode {ReadOnly,WriteEmpty,WriteExists,WriteAny,WriteTemp};
-<span class="lineNum">      41 </span>                :    
-<span class="lineNum">      42 </span>                :    inline bool Read(void *To,unsigned long Size,bool AllowEof)
-<span class="lineNum">      43 </span>                :    {
-<span class="lineNum">      44 </span>                :       unsigned long Jnk;
-<span class="lineNum">      45 </span>                :       if (AllowEof)
-<span class="lineNum">      46 </span>                :          return Read(To,Size,&amp;Jnk);
-<span class="lineNum">      47 </span>                :       return Read(To,Size);
-<span class="lineNum">      48 </span>                :    }   
-<span class="lineNum">      49 </span>                :    bool Read(void *To,unsigned long Size,unsigned long *Actual = 0);
-<span class="lineNum">      50 </span>                :    bool Write(const void *From,unsigned long Size);
-<span class="lineNum">      51 </span>                :    bool Seek(unsigned long To);
-<span class="lineNum">      52 </span>                :    bool Skip(unsigned long To);
-<span class="lineNum">      53 </span>                :    bool Truncate(unsigned long To);
-<span class="lineNum">      54 </span>                :    unsigned long Tell();
-<span class="lineNum">      55 </span>                :    unsigned long Size();
-<span class="lineNum">      56 </span>                :    bool Open(string FileName,OpenMode Mode,unsigned long Perms = 0666);
-<span class="lineNum">      57 </span>                :    bool Close();
-<span class="lineNum">      58 </span>                :    bool Sync();
-<span class="lineNum">      59 </span>                :    
-<span class="lineNum">      60 </span>                :    // Simple manipulators
-<span class="lineNum">      61 </span>                :    inline int Fd() {return iFd;};
-<span class="lineNum">      62 </span>                :    inline void Fd(int fd) {iFd = fd;};
-<span class="lineNum">      63 </span><span class="lineCov">             32 :    inline bool IsOpen() {return iFd &gt;= 0;};</span>
-<span class="lineNum">      64 </span>                :    inline bool Failed() {return (Flags &amp; Fail) == Fail;};
-<span class="lineNum">      65 </span>                :    inline void EraseOnFailure() {Flags |= DelOnFail;};
-<span class="lineNum">      66 </span>                :    inline void OpFail() {Flags |= Fail;};
-<span class="lineNum">      67 </span>                :    inline bool Eof() {return (Flags &amp; HitEof) == HitEof;};
-<span class="lineNum">      68 </span>                :    inline string &amp;Name() {return FileName;};
-<span class="lineNum">      69 </span>                :    
-<span class="lineNum">      70 </span><span class="lineCov">             53 :    FileFd(string FileName,OpenMode Mode,unsigned long Perms = 0666) : iFd(-1), </span>
-<span class="lineNum">      71 </span><span class="lineCov">             53 :             Flags(0) </span>
-<span class="lineNum">      72 </span>                :    {
-<span class="lineNum">      73 </span><span class="lineCov">             53 :       Open(FileName,Mode,Perms);</span>
-<span class="lineNum">      74 </span><span class="lineCov">             53 :    };</span>
-<span class="lineNum">      75 </span><span class="lineCov">             15 :    FileFd(int Fd = -1) : iFd(Fd), Flags(AutoClose) {};</span>
-<span class="lineNum">      76 </span>                :    FileFd(int Fd,bool) : iFd(Fd), Flags(0) {};
-<span class="lineNum">      77 </span>                :    virtual ~FileFd();
-<span class="lineNum">      78 </span>                : };
-<span class="lineNum">      79 </span>                : 
-<span class="lineNum">      80 </span>                : bool RunScripts(const char *Cnf);
-<span class="lineNum">      81 </span>                : bool CopyFile(FileFd &amp;From,FileFd &amp;To);
-<span class="lineNum">      82 </span>                : int GetLock(string File,bool Errors = true);
-<span class="lineNum">      83 </span>                : bool FileExists(string File);
-<span class="lineNum">      84 </span>                : string SafeGetCWD();
-<span class="lineNum">      85 </span>                : void SetCloseExec(int Fd,bool Close);
-<span class="lineNum">      86 </span>                : void SetNonBlock(int Fd,bool Block);
-<span class="lineNum">      87 </span>                : bool WaitFd(int Fd,bool write = false,unsigned long timeout = 0);
-<span class="lineNum">      88 </span>                : pid_t ExecFork();
-<span class="lineNum">      89 </span>                : bool ExecWait(pid_t Pid,const char *Name,bool Reap = false);
-<span class="lineNum">      90 </span>                : 
-<span class="lineNum">      91 </span>                : // File string manipulators
-<span class="lineNum">      92 </span>                : string flNotDir(string File);
-<span class="lineNum">      93 </span>                : string flNotFile(string File);
-<span class="lineNum">      94 </span>                : string flNoLink(string File);
-<span class="lineNum">      95 </span>                : string flExtension(string File);
-<span class="lineNum">      96 </span>                : string flCombine(string Dir,string File);
-<span class="lineNum">      97 </span>                : 
-<span class="lineNum">      98 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/apt-pkg/index.html b/rep/usr/include/apt-pkg/index.html
deleted file mode 100644
index 659d250..0000000
--- a/rep/usr/include/apt-pkg/index.html
+++ /dev/null
@@ -1,164 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/apt-pkg</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - /usr/include/apt-pkg</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">80</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">86.2 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">69</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <center>
-  <table width="80%" cellpadding=2 cellspacing=1 border=0>
-
-    <tr>
-      <td width="50%"><br></td>
-      <td width="15%"></td>
-      <td width="15%"></td>
-      <td width="20%"></td>
-    </tr>
-
-    <tr>
-      <td class="tableHead">Filename</td>
-      <td class="tableHead" colspan=3>Coverage</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="acquire.h.gcov.html">acquire.h</a></td>
-      <td class="coverBar" align="center">
-                <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../snow.png" width=100 height=10 alt="0.0%"></td></tr></table>
-      </td>
-      <td class="coverPerLo">0.0&nbsp;%</td>
-      <td class="coverNumLo">0&nbsp;/&nbsp;5&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="algorithms.h.gcov.html">algorithms.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=67 height=10 alt="66.7%"><img src="../../../snow.png" width=33 height=10 alt="66.7%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">66.7&nbsp;%</td>
-      <td class="coverNumHi">2&nbsp;/&nbsp;3&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="cachefile.h.gcov.html">cachefile.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">1&nbsp;/&nbsp;1&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="cacheiterators.h.gcov.html">cacheiterators.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=92 height=10 alt="92.2%"><img src="../../../snow.png" width=8 height=10 alt="92.2%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">92.2&nbsp;%</td>
-      <td class="coverNumHi">47&nbsp;/&nbsp;51&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="depcache.h.gcov.html">depcache.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">6&nbsp;/&nbsp;6&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="error.h.gcov.html">error.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=50 height=10 alt="50.0%"><img src="../../../snow.png" width=50 height=10 alt="50.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">50.0&nbsp;%</td>
-      <td class="coverNumHi">1&nbsp;/&nbsp;2&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="fileutl.h.gcov.html">fileutl.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">6&nbsp;/&nbsp;6&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="pkgcache.h.gcov.html">pkgcache.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">2&nbsp;/&nbsp;2&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="progress.h.gcov.html">progress.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">3&nbsp;/&nbsp;3&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="version.h.gcov.html">version.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">1&nbsp;/&nbsp;1&nbsp;lines</td>
-    </tr>
-
-  </table>
-  </center>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/apt-pkg/pkgcache.h.gcov.html b/rep/usr/include/apt-pkg/pkgcache.h.gcov.html
deleted file mode 100644
index aeda4f5..0000000
--- a/rep/usr/include/apt-pkg/pkgcache.h.gcov.html
+++ /dev/null
@@ -1,422 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/apt-pkg/pkgcache.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/apt-pkg</a> - pkgcache.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">2</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">2</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- mode: cpp; mode: fold -*-
-<span class="lineNum">       2 </span>                : // Description                                                          /*{{{*/
-<span class="lineNum">       3 </span>                : // $Id: pkgcache.h,v 1.25 2001/07/01 22:28:24 jgg Exp $
-<span class="lineNum">       4 </span>                : /* ######################################################################
-<span class="lineNum">       5 </span>                :    
-<span class="lineNum">       6 </span>                :    Cache - Structure definitions for the cache file
-<span class="lineNum">       7 </span>                :    
-<span class="lineNum">       8 </span>                :    Please see doc/apt-pkg/cache.sgml for a more detailed description of 
-<span class="lineNum">       9 </span>                :    this format. Also be sure to keep that file up-to-date!!
-<span class="lineNum">      10 </span>                :    
-<span class="lineNum">      11 </span>                :    Clients should always use the CacheIterators classes for access to the
-<span class="lineNum">      12 </span>                :    cache. They provide a simple STL-like method for traversing the links
-<span class="lineNum">      13 </span>                :    of the datastructure.
-<span class="lineNum">      14 </span>                :    
-<span class="lineNum">      15 </span>                :    See pkgcachegen.h for information about generating cache structures.
-<span class="lineNum">      16 </span>                :    
-<span class="lineNum">      17 </span>                :    ##################################################################### */
-<span class="lineNum">      18 </span>                :                                                                         /*}}}*/
-<span class="lineNum">      19 </span>                : #ifndef PKGLIB_PKGCACHE_H
-<span class="lineNum">      20 </span>                : #define PKGLIB_PKGCACHE_H
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                : 
-<span class="lineNum">      23 </span>                : #include &lt;string&gt;
-<span class="lineNum">      24 </span>                : #include &lt;time.h&gt;
-<span class="lineNum">      25 </span>                : #include &lt;apt-pkg/mmap.h&gt;
-<span class="lineNum">      26 </span>                : 
-<span class="lineNum">      27 </span>                : using std::string;
-<span class="lineNum">      28 </span>                :     
-<span class="lineNum">      29 </span>                : class pkgVersioningSystem;
-<span class="lineNum">      30 </span>                : class pkgCache
-<span class="lineNum">      31 </span>                : {
-<span class="lineNum">      32 </span>                :    public:
-<span class="lineNum">      33 </span>                :    // Cache element predeclarations
-<span class="lineNum">      34 </span>                :    struct Header;
-<span class="lineNum">      35 </span>                :    struct Package;
-<span class="lineNum">      36 </span>                :    struct PackageFile;
-<span class="lineNum">      37 </span>                :    struct Version;
-<span class="lineNum">      38 </span>                :    struct Description;
-<span class="lineNum">      39 </span>                :    struct Provides;
-<span class="lineNum">      40 </span>                :    struct Dependency;
-<span class="lineNum">      41 </span>                :    struct StringItem;
-<span class="lineNum">      42 </span>                :    struct VerFile;
-<span class="lineNum">      43 </span>                :    struct DescFile;
-<span class="lineNum">      44 </span>                :    
-<span class="lineNum">      45 </span>                :    // Iterators
-<span class="lineNum">      46 </span>                :    class PkgIterator;
-<span class="lineNum">      47 </span>                :    class VerIterator;
-<span class="lineNum">      48 </span>                :    class DescIterator;
-<span class="lineNum">      49 </span>                :    class DepIterator;
-<span class="lineNum">      50 </span>                :    class PrvIterator;
-<span class="lineNum">      51 </span>                :    class PkgFileIterator;
-<span class="lineNum">      52 </span>                :    class VerFileIterator;
-<span class="lineNum">      53 </span>                :    class DescFileIterator;
-<span class="lineNum">      54 </span>                :    friend class PkgIterator;
-<span class="lineNum">      55 </span>                :    friend class VerIterator;
-<span class="lineNum">      56 </span>                :    friend class DescInterator;
-<span class="lineNum">      57 </span>                :    friend class DepIterator;
-<span class="lineNum">      58 </span>                :    friend class PrvIterator;
-<span class="lineNum">      59 </span>                :    friend class PkgFileIterator;
-<span class="lineNum">      60 </span>                :    friend class VerFileIterator;
-<span class="lineNum">      61 </span>                :    friend class DescFileIterator;
-<span class="lineNum">      62 </span>                :    
-<span class="lineNum">      63 </span>                :    class Namespace;
-<span class="lineNum">      64 </span>                :    
-<span class="lineNum">      65 </span>                :    // These are all the constants used in the cache structures
-<span class="lineNum">      66 </span>                : 
-<span class="lineNum">      67 </span>                :    // WARNING - if you change these lists you must also edit
-<span class="lineNum">      68 </span>                :    // the stringification in pkgcache.cc and also consider whether
-<span class="lineNum">      69 </span>                :    // the cache file will become incompatible.
-<span class="lineNum">      70 </span>                :    struct Dep
-<span class="lineNum">      71 </span>                :    {
-<span class="lineNum">      72 </span>                :       enum DepType {Depends=1,PreDepends=2,Suggests=3,Recommends=4,
-<span class="lineNum">      73 </span>                :          Conflicts=5,Replaces=6,Obsoletes=7,DpkgBreaks=8};
-<span class="lineNum">      74 </span>                :       enum DepCompareOp {Or=0x10,NoOp=0,LessEq=0x1,GreaterEq=0x2,Less=0x3,
-<span class="lineNum">      75 </span>                :          Greater=0x4,Equals=0x5,NotEquals=0x6};
-<span class="lineNum">      76 </span>                :    };
-<span class="lineNum">      77 </span>                :    
-<span class="lineNum">      78 </span>                :    struct State
-<span class="lineNum">      79 </span>                :    {
-<span class="lineNum">      80 </span>                :       enum VerPriority {Important=1,Required=2,Standard=3,Optional=4,Extra=5};
-<span class="lineNum">      81 </span>                :       enum PkgSelectedState {Unknown=0,Install=1,Hold=2,DeInstall=3,Purge=4};
-<span class="lineNum">      82 </span>                :       enum PkgInstState {Ok=0,ReInstReq=1,HoldInst=2,HoldReInstReq=3};
-<span class="lineNum">      83 </span>                :       enum PkgCurrentState {NotInstalled=0,UnPacked=1,HalfConfigured=2,
-<span class="lineNum">      84 </span>                :            HalfInstalled=4,ConfigFiles=5,Installed=6,
-<span class="lineNum">      85 </span>                :            TriggersAwaited=7,TriggersPending=8};
-<span class="lineNum">      86 </span>                :    };
-<span class="lineNum">      87 </span>                :    
-<span class="lineNum">      88 </span>                :    struct Flag
-<span class="lineNum">      89 </span>                :    {
-<span class="lineNum">      90 </span>                :       enum PkgFlags {Auto=(1&lt;&lt;0),Essential=(1&lt;&lt;3),Important=(1&lt;&lt;4)};
-<span class="lineNum">      91 </span>                :       enum PkgFFlags {NotSource=(1&lt;&lt;0),NotAutomatic=(1&lt;&lt;1)};
-<span class="lineNum">      92 </span>                :    };
-<span class="lineNum">      93 </span>                :    
-<span class="lineNum">      94 </span>                :    protected:
-<span class="lineNum">      95 </span>                :    
-<span class="lineNum">      96 </span>                :    // Memory mapped cache file
-<span class="lineNum">      97 </span>                :    string CacheFile;
-<span class="lineNum">      98 </span>                :    MMap &amp;Map;
-<span class="lineNum">      99 </span>                : 
-<span class="lineNum">     100 </span>                :    unsigned long sHash(const string &amp;S) const;
-<span class="lineNum">     101 </span>                :    unsigned long sHash(const char *S) const;
-<span class="lineNum">     102 </span>                :    
-<span class="lineNum">     103 </span>                :    public:
-<span class="lineNum">     104 </span>                :    
-<span class="lineNum">     105 </span>                :    // Pointers to the arrays of items
-<span class="lineNum">     106 </span>                :    Header *HeaderP;
-<span class="lineNum">     107 </span>                :    Package *PkgP;
-<span class="lineNum">     108 </span>                :    VerFile *VerFileP;
-<span class="lineNum">     109 </span>                :    DescFile *DescFileP;
-<span class="lineNum">     110 </span>                :    PackageFile *PkgFileP;
-<span class="lineNum">     111 </span>                :    Version *VerP;
-<span class="lineNum">     112 </span>                :    Description *DescP;
-<span class="lineNum">     113 </span>                :    Provides *ProvideP;
-<span class="lineNum">     114 </span>                :    Dependency *DepP;
-<span class="lineNum">     115 </span>                :    StringItem *StringItemP;
-<span class="lineNum">     116 </span>                :    char *StrP;
-<span class="lineNum">     117 </span>                : 
-<span class="lineNum">     118 </span>                :    virtual bool ReMap();
-<span class="lineNum">     119 </span>                :    inline bool Sync() {return Map.Sync();};
-<span class="lineNum">     120 </span>                :    inline MMap &amp;GetMap() {return Map;};
-<span class="lineNum">     121 </span>                :    inline void *DataEnd() {return ((unsigned char *)Map.Data()) + Map.Size();};
-<span class="lineNum">     122 </span>                :       
-<span class="lineNum">     123 </span>                :    // String hashing function (512 range)
-<span class="lineNum">     124 </span>                :    inline unsigned long Hash(const string &amp;S) const {return sHash(S);};
-<span class="lineNum">     125 </span>                :    inline unsigned long Hash(const char *S) const {return sHash(S);};
-<span class="lineNum">     126 </span>                : 
-<span class="lineNum">     127 </span>                :    // Usefull transformation things
-<span class="lineNum">     128 </span>                :    const char *Priority(unsigned char Priority);
-<span class="lineNum">     129 </span>                :    
-<span class="lineNum">     130 </span>                :    // Accessors
-<span class="lineNum">     131 </span>                :    PkgIterator FindPkg(const string &amp;Name);
-<span class="lineNum">     132 </span>                :    Header &amp;Head() {return *HeaderP;};
-<span class="lineNum">     133 </span>                :    inline PkgIterator PkgBegin();
-<span class="lineNum">     134 </span>                :    inline PkgIterator PkgEnd();
-<span class="lineNum">     135 </span>                :    inline PkgFileIterator FileBegin();
-<span class="lineNum">     136 </span>                :    inline PkgFileIterator FileEnd();
-<span class="lineNum">     137 </span>                : 
-<span class="lineNum">     138 </span>                :    // Make me a function
-<span class="lineNum">     139 </span>                :    pkgVersioningSystem *VS;
-<span class="lineNum">     140 </span>                :    
-<span class="lineNum">     141 </span>                :    // Converters
-<span class="lineNum">     142 </span>                :    static const char *CompTypeDeb(unsigned char Comp);
-<span class="lineNum">     143 </span>                :    static const char *CompType(unsigned char Comp);
-<span class="lineNum">     144 </span>                :    static const char *DepType(unsigned char Dep);
-<span class="lineNum">     145 </span>                :    
-<span class="lineNum">     146 </span>                :    pkgCache(MMap *Map,bool DoMap = true);
-<span class="lineNum">     147 </span>                :    virtual ~pkgCache() {};
-<span class="lineNum">     148 </span>                : };
-<span class="lineNum">     149 </span>                : 
-<span class="lineNum">     150 </span>                : // Header structure
-<span class="lineNum">     151 </span>                : struct pkgCache::Header
-<span class="lineNum">     152 </span>                : {
-<span class="lineNum">     153 </span>                :    // Signature information
-<span class="lineNum">     154 </span>                :    unsigned long Signature;
-<span class="lineNum">     155 </span>                :    short MajorVersion;
-<span class="lineNum">     156 </span>                :    short MinorVersion;
-<span class="lineNum">     157 </span>                :    bool Dirty;
-<span class="lineNum">     158 </span>                :    
-<span class="lineNum">     159 </span>                :    // Size of structure values
-<span class="lineNum">     160 </span>                :    unsigned short HeaderSz;
-<span class="lineNum">     161 </span>                :    unsigned short PackageSz;
-<span class="lineNum">     162 </span>                :    unsigned short PackageFileSz;
-<span class="lineNum">     163 </span>                :    unsigned short VersionSz;
-<span class="lineNum">     164 </span>                :    unsigned short DescriptionSz;
-<span class="lineNum">     165 </span>                :    unsigned short DependencySz;
-<span class="lineNum">     166 </span>                :    unsigned short ProvidesSz;
-<span class="lineNum">     167 </span>                :    unsigned short VerFileSz;
-<span class="lineNum">     168 </span>                :    unsigned short DescFileSz;
-<span class="lineNum">     169 </span>                :    
-<span class="lineNum">     170 </span>                :    // Structure counts
-<span class="lineNum">     171 </span>                :    unsigned long PackageCount;
-<span class="lineNum">     172 </span>                :    unsigned long VersionCount;
-<span class="lineNum">     173 </span>                :    unsigned long DescriptionCount;
-<span class="lineNum">     174 </span>                :    unsigned long DependsCount;
-<span class="lineNum">     175 </span>                :    unsigned long PackageFileCount;
-<span class="lineNum">     176 </span>                :    unsigned long VerFileCount;
-<span class="lineNum">     177 </span>                :    unsigned long DescFileCount;
-<span class="lineNum">     178 </span>                :    unsigned long ProvidesCount;
-<span class="lineNum">     179 </span>                :    
-<span class="lineNum">     180 </span>                :    // Offsets
-<span class="lineNum">     181 </span>                :    map_ptrloc FileList;              // struct PackageFile
-<span class="lineNum">     182 </span>                :    map_ptrloc StringList;            // struct StringItem
-<span class="lineNum">     183 </span>                :    map_ptrloc VerSysName;            // StringTable
-<span class="lineNum">     184 </span>                :    map_ptrloc Architecture;          // StringTable
-<span class="lineNum">     185 </span>                :    unsigned long MaxVerFileSize;
-<span class="lineNum">     186 </span>                :    unsigned long MaxDescFileSize;
-<span class="lineNum">     187 </span>                : 
-<span class="lineNum">     188 </span>                :    /* Allocation pools, there should be one of these for each structure
-<span class="lineNum">     189 </span>                :       excluding the header */
-<span class="lineNum">     190 </span>                :    DynamicMMap::Pool Pools[8];
-<span class="lineNum">     191 </span>                :    
-<span class="lineNum">     192 </span>                :    // Rapid package name lookup
-<span class="lineNum">     193 </span>                :    map_ptrloc HashTable[2*1048];
-<span class="lineNum">     194 </span>                : 
-<span class="lineNum">     195 </span>                :    bool CheckSizes(Header &amp;Against) const;
-<span class="lineNum">     196 </span>                :    Header();
-<span class="lineNum">     197 </span>                : };
-<span class="lineNum">     198 </span>                : 
-<span class="lineNum">     199 </span>                : struct pkgCache::Package
-<span class="lineNum">     200 </span>                : {
-<span class="lineNum">     201 </span>                :    // Pointers
-<span class="lineNum">     202 </span>                :    map_ptrloc Name;              // Stringtable
-<span class="lineNum">     203 </span>                :    map_ptrloc VersionList;       // Version
-<span class="lineNum">     204 </span>                :    map_ptrloc CurrentVer;        // Version
-<span class="lineNum">     205 </span>                :    map_ptrloc Section;           // StringTable (StringItem)
-<span class="lineNum">     206 </span>                :       
-<span class="lineNum">     207 </span>                :    // Linked list 
-<span class="lineNum">     208 </span>                :    map_ptrloc NextPackage;       // Package
-<span class="lineNum">     209 </span>                :    map_ptrloc RevDepends;        // Dependency
-<span class="lineNum">     210 </span>                :    map_ptrloc ProvidesList;      // Provides
-<span class="lineNum">     211 </span>                : 
-<span class="lineNum">     212 </span>                :    // Install/Remove/Purge etc
-<span class="lineNum">     213 </span>                :    unsigned char SelectedState;     // What
-<span class="lineNum">     214 </span>                :    unsigned char InstState;         // Flags
-<span class="lineNum">     215 </span>                :    unsigned char CurrentState;      // State
-<span class="lineNum">     216 </span>                :    
-<span class="lineNum">     217 </span>                :    unsigned short ID;
-<span class="lineNum">     218 </span>                :    unsigned long Flags;
-<span class="lineNum">     219 </span>                : };
-<span class="lineNum">     220 </span>                : 
-<span class="lineNum">     221 </span>                : struct pkgCache::PackageFile
-<span class="lineNum">     222 </span>                : {
-<span class="lineNum">     223 </span>                :    // Names
-<span class="lineNum">     224 </span>                :    map_ptrloc FileName;        // Stringtable
-<span class="lineNum">     225 </span>                :    map_ptrloc Archive;         // Stringtable
-<span class="lineNum">     226 </span>                :    map_ptrloc Component;       // Stringtable
-<span class="lineNum">     227 </span>                :    map_ptrloc Version;         // Stringtable
-<span class="lineNum">     228 </span>                :    map_ptrloc Origin;          // Stringtable
-<span class="lineNum">     229 </span>                :    map_ptrloc Label;           // Stringtable
-<span class="lineNum">     230 </span>                :    map_ptrloc Architecture;    // Stringtable
-<span class="lineNum">     231 </span>                :    map_ptrloc Site;            // Stringtable
-<span class="lineNum">     232 </span>                :    map_ptrloc IndexType;       // Stringtable
-<span class="lineNum">     233 </span>                :    unsigned long Size;            
-<span class="lineNum">     234 </span>                :    unsigned long Flags;
-<span class="lineNum">     235 </span>                :    
-<span class="lineNum">     236 </span>                :    // Linked list
-<span class="lineNum">     237 </span>                :    map_ptrloc NextFile;        // PackageFile
-<span class="lineNum">     238 </span>                :    unsigned short ID;
-<span class="lineNum">     239 </span>                :    time_t mtime;                  // Modification time for the file
-<span class="lineNum">     240 </span>                : };
-<span class="lineNum">     241 </span>                : 
-<span class="lineNum">     242 </span>                : struct pkgCache::VerFile
-<span class="lineNum">     243 </span>                : {
-<span class="lineNum">     244 </span>                :    map_ptrloc File;           // PackageFile
-<span class="lineNum">     245 </span>                :    map_ptrloc NextFile;       // PkgVerFile
-<span class="lineNum">     246 </span>                :    map_ptrloc Offset;         // File offset
-<span class="lineNum">     247 </span>                :    unsigned short Size;
-<span class="lineNum">     248 </span>                : };
-<span class="lineNum">     249 </span>                : 
-<span class="lineNum">     250 </span>                : struct pkgCache::DescFile
-<span class="lineNum">     251 </span>                : {
-<span class="lineNum">     252 </span>                :    map_ptrloc File;           // PackageFile
-<span class="lineNum">     253 </span>                :    map_ptrloc NextFile;       // PkgVerFile
-<span class="lineNum">     254 </span>                :    map_ptrloc Offset;         // File offset
-<span class="lineNum">     255 </span>                :    unsigned short Size;
-<span class="lineNum">     256 </span>                : };
-<span class="lineNum">     257 </span>                : 
-<span class="lineNum">     258 </span>                : struct pkgCache::Version
-<span class="lineNum">     259 </span>                : {
-<span class="lineNum">     260 </span>                :    map_ptrloc VerStr;            // Stringtable
-<span class="lineNum">     261 </span>                :    map_ptrloc Section;           // StringTable (StringItem)
-<span class="lineNum">     262 </span>                :    map_ptrloc Arch;              // StringTable
-<span class="lineNum">     263 </span>                :       
-<span class="lineNum">     264 </span>                :    // Lists
-<span class="lineNum">     265 </span>                :    map_ptrloc FileList;          // VerFile
-<span class="lineNum">     266 </span>                :    map_ptrloc NextVer;           // Version
-<span class="lineNum">     267 </span>                :    map_ptrloc DescriptionList;   // Description
-<span class="lineNum">     268 </span>                :    map_ptrloc DependsList;       // Dependency
-<span class="lineNum">     269 </span>                :    map_ptrloc ParentPkg;         // Package
-<span class="lineNum">     270 </span>                :    map_ptrloc ProvidesList;      // Provides
-<span class="lineNum">     271 </span>                :    
-<span class="lineNum">     272 </span>                :    map_ptrloc Size;              // These are the .deb size
-<span class="lineNum">     273 </span>                :    map_ptrloc InstalledSize;
-<span class="lineNum">     274 </span>                :    unsigned short Hash;
-<span class="lineNum">     275 </span>                :    unsigned short ID;
-<span class="lineNum">     276 </span>                :    unsigned char Priority;
-<span class="lineNum">     277 </span>                : };
-<span class="lineNum">     278 </span>                : 
-<span class="lineNum">     279 </span>                : struct pkgCache::Description
-<span class="lineNum">     280 </span>                : {
-<span class="lineNum">     281 </span>                :    // Language Code store the description translation language code. If
-<span class="lineNum">     282 </span>                :    // the value has a 0 lenght then this is readed using the Package
-<span class="lineNum">     283 </span>                :    // file else the Translation-CODE are used.
-<span class="lineNum">     284 </span>                :    map_ptrloc language_code;     // StringTable
-<span class="lineNum">     285 </span>                :    map_ptrloc md5sum;            // StringTable
-<span class="lineNum">     286 </span>                : 
-<span class="lineNum">     287 </span>                :    // Linked list 
-<span class="lineNum">     288 </span>                :    map_ptrloc FileList;          // DescFile
-<span class="lineNum">     289 </span>                :    map_ptrloc NextDesc;          // Description
-<span class="lineNum">     290 </span>                :    map_ptrloc ParentPkg;         // Package
-<span class="lineNum">     291 </span>                : 
-<span class="lineNum">     292 </span>                :    unsigned short ID;
-<span class="lineNum">     293 </span>                : };
-<span class="lineNum">     294 </span>                : 
-<span class="lineNum">     295 </span>                : struct pkgCache::Dependency
-<span class="lineNum">     296 </span>                : {
-<span class="lineNum">     297 </span>                :    map_ptrloc Version;         // Stringtable
-<span class="lineNum">     298 </span>                :    map_ptrloc Package;         // Package
-<span class="lineNum">     299 </span>                :    map_ptrloc NextDepends;     // Dependency
-<span class="lineNum">     300 </span>                :    map_ptrloc NextRevDepends;  // Dependency
-<span class="lineNum">     301 </span>                :    map_ptrloc ParentVer;       // Version
-<span class="lineNum">     302 </span>                :    
-<span class="lineNum">     303 </span>                :    // Specific types of depends
-<span class="lineNum">     304 </span>                :    map_ptrloc ID;   
-<span class="lineNum">     305 </span>                :    unsigned char Type;
-<span class="lineNum">     306 </span>                :    unsigned char CompareOp;
-<span class="lineNum">     307 </span>                : };
-<span class="lineNum">     308 </span>                : 
-<span class="lineNum">     309 </span>                : struct pkgCache::Provides
-<span class="lineNum">     310 </span>                : {
-<span class="lineNum">     311 </span>                :    map_ptrloc ParentPkg;        // Pacakge
-<span class="lineNum">     312 </span>                :    map_ptrloc Version;          // Version
-<span class="lineNum">     313 </span>                :    map_ptrloc ProvideVersion;   // Stringtable
-<span class="lineNum">     314 </span>                :    map_ptrloc NextProvides;     // Provides
-<span class="lineNum">     315 </span>                :    map_ptrloc NextPkgProv;      // Provides
-<span class="lineNum">     316 </span>                : };
-<span class="lineNum">     317 </span>                : 
-<span class="lineNum">     318 </span>                : struct pkgCache::StringItem
-<span class="lineNum">     319 </span>                : {
-<span class="lineNum">     320 </span>                :    map_ptrloc String;        // Stringtable
-<span class="lineNum">     321 </span>                :    map_ptrloc NextItem;      // StringItem
-<span class="lineNum">     322 </span>                : };
-<span class="lineNum">     323 </span>                : 
-<span class="lineNum">     324 </span>                : #include &lt;apt-pkg/cacheiterators.h&gt;
-<span class="lineNum">     325 </span>                : 
-<span class="lineNum">     326 </span><span class="lineCov">             19 : inline pkgCache::PkgIterator pkgCache::PkgBegin() </span>
-<span class="lineNum">     327 </span><span class="lineCov">             19 :        {return PkgIterator(*this);};</span>
-<span class="lineNum">     328 </span>                : inline pkgCache::PkgIterator pkgCache::PkgEnd() 
-<span class="lineNum">     329 </span>                :        {return PkgIterator(*this,PkgP);};
-<span class="lineNum">     330 </span>                : inline pkgCache::PkgFileIterator pkgCache::FileBegin()
-<span class="lineNum">     331 </span>                :        {return PkgFileIterator(*this,PkgFileP + HeaderP-&gt;FileList);};
-<span class="lineNum">     332 </span>                : inline pkgCache::PkgFileIterator pkgCache::FileEnd()
-<span class="lineNum">     333 </span>                :        {return PkgFileIterator(*this,PkgFileP);};
-<span class="lineNum">     334 </span>                : 
-<span class="lineNum">     335 </span>                : // Oh I wish for Real Name Space Support
-<span class="lineNum">     336 </span>                : class pkgCache::Namespace
-<span class="lineNum">     337 </span>                : {   
-<span class="lineNum">     338 </span>                :    public:
-<span class="lineNum">     339 </span>                : 
-<span class="lineNum">     340 </span>                :    typedef pkgCache::PkgIterator PkgIterator;
-<span class="lineNum">     341 </span>                :    typedef pkgCache::VerIterator VerIterator;
-<span class="lineNum">     342 </span>                :    typedef pkgCache::DescIterator DescIterator;
-<span class="lineNum">     343 </span>                :    typedef pkgCache::DepIterator DepIterator;
-<span class="lineNum">     344 </span>                :    typedef pkgCache::PrvIterator PrvIterator;
-<span class="lineNum">     345 </span>                :    typedef pkgCache::PkgFileIterator PkgFileIterator;
-<span class="lineNum">     346 </span>                :    typedef pkgCache::VerFileIterator VerFileIterator;   
-<span class="lineNum">     347 </span>                :    typedef pkgCache::Version Version;
-<span class="lineNum">     348 </span>                :    typedef pkgCache::Description Description;
-<span class="lineNum">     349 </span>                :    typedef pkgCache::Package Package;
-<span class="lineNum">     350 </span>                :    typedef pkgCache::Header Header;
-<span class="lineNum">     351 </span>                :    typedef pkgCache::Dep Dep;
-<span class="lineNum">     352 </span>                :    typedef pkgCache::Flag Flag;
-<span class="lineNum">     353 </span>                : };
-<span class="lineNum">     354 </span>                : 
-<span class="lineNum">     355 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/apt-pkg/progress.h.gcov.html b/rep/usr/include/apt-pkg/progress.h.gcov.html
deleted file mode 100644
index 6dce14e..0000000
--- a/rep/usr/include/apt-pkg/progress.h.gcov.html
+++ /dev/null
@@ -1,156 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/apt-pkg/progress.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/apt-pkg</a> - progress.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">3</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">3</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- mode: cpp; mode: fold -*-
-<span class="lineNum">       2 </span>                : // Description                                                          /*{{{*/
-<span class="lineNum">       3 </span>                : // $Id: progress.h,v 1.6 2001/05/07 05:06:52 jgg Exp $
-<span class="lineNum">       4 </span>                : /* ######################################################################
-<span class="lineNum">       5 </span>                :    
-<span class="lineNum">       6 </span>                :    OpProgress - Operation Progress
-<span class="lineNum">       7 </span>                :    
-<span class="lineNum">       8 </span>                :    This class allows lengthy operations to communicate their progress 
-<span class="lineNum">       9 </span>                :    to the GUI. The progress model is simple and is not designed to handle
-<span class="lineNum">      10 </span>                :    the complex case of the multi-activity aquire class.
-<span class="lineNum">      11 </span>                :    
-<span class="lineNum">      12 </span>                :    The model is based on the concept of an overall operation consisting
-<span class="lineNum">      13 </span>                :    of a series of small sub operations. Each sub operation has it's own
-<span class="lineNum">      14 </span>                :    completion status and the overall operation has it's completion status.
-<span class="lineNum">      15 </span>                :    The units of the two are not mixed and are completely independent.
-<span class="lineNum">      16 </span>                :    
-<span class="lineNum">      17 </span>                :    The UI is expected to subclass this to provide the visuals to the user.
-<span class="lineNum">      18 </span>                :    
-<span class="lineNum">      19 </span>                :    ##################################################################### */
-<span class="lineNum">      20 </span>                :                                                                         /*}}}*/
-<span class="lineNum">      21 </span>                : #ifndef PKGLIB_PROGRESS_H
-<span class="lineNum">      22 </span>                : #define PKGLIB_PROGRESS_H
-<span class="lineNum">      23 </span>                : 
-<span class="lineNum">      24 </span>                : 
-<span class="lineNum">      25 </span>                : #include &lt;string&gt;
-<span class="lineNum">      26 </span>                : #include &lt;sys/time.h&gt;
-<span class="lineNum">      27 </span>                : 
-<span class="lineNum">      28 </span>                : using std::string;
-<span class="lineNum">      29 </span>                : 
-<span class="lineNum">      30 </span>                : class Configuration;
-<span class="lineNum">      31 </span>                : class OpProgress
-<span class="lineNum">      32 </span>                : {
-<span class="lineNum">      33 </span>                :    unsigned long Current;
-<span class="lineNum">      34 </span>                :    unsigned long Total;
-<span class="lineNum">      35 </span>                :    unsigned long Size;
-<span class="lineNum">      36 </span>                :    unsigned long SubTotal;
-<span class="lineNum">      37 </span>                :    float LastPercent;
-<span class="lineNum">      38 </span>                :    
-<span class="lineNum">      39 </span>                :    // Change reduction code
-<span class="lineNum">      40 </span>                :    struct timeval LastTime;
-<span class="lineNum">      41 </span>                :    string LastOp;
-<span class="lineNum">      42 </span>                :    string LastSubOp;
-<span class="lineNum">      43 </span>                :    
-<span class="lineNum">      44 </span>                :    protected:
-<span class="lineNum">      45 </span>                :    
-<span class="lineNum">      46 </span>                :    string Op;
-<span class="lineNum">      47 </span>                :    string SubOp;
-<span class="lineNum">      48 </span>                :    float Percent;
-<span class="lineNum">      49 </span>                :    
-<span class="lineNum">      50 </span>                :    bool MajorChange;
-<span class="lineNum">      51 </span>                :    
-<span class="lineNum">      52 </span>                :    bool CheckChange(float Interval = 0.7);                  
-<span class="lineNum">      53 </span><span class="lineCov">          24433 :    virtual void Update() {};</span>
-<span class="lineNum">      54 </span>                :    
-<span class="lineNum">      55 </span>                :    public:
-<span class="lineNum">      56 </span>                :    
-<span class="lineNum">      57 </span>                :    void Progress(unsigned long Current);
-<span class="lineNum">      58 </span>                :    void SubProgress(unsigned long SubTotal);
-<span class="lineNum">      59 </span>                :    void SubProgress(unsigned long SubTotal,const string &amp;Op);
-<span class="lineNum">      60 </span>                :    void OverallProgress(unsigned long Current,unsigned long Total,
-<span class="lineNum">      61 </span>                :                         unsigned long Size,const string &amp;Op);
-<span class="lineNum">      62 </span><span class="lineCov">             62 :    virtual void Done() {};</span>
-<span class="lineNum">      63 </span>                :    
-<span class="lineNum">      64 </span>                :    OpProgress();
-<span class="lineNum">      65 </span><span class="lineCov">             29 :    virtual ~OpProgress() {};</span>
-<span class="lineNum">      66 </span>                : };
-<span class="lineNum">      67 </span>                : 
-<span class="lineNum">      68 </span>                : class OpTextProgress : public OpProgress
-<span class="lineNum">      69 </span>                : {
-<span class="lineNum">      70 </span>                :    protected:
-<span class="lineNum">      71 </span>                :    
-<span class="lineNum">      72 </span>                :    string OldOp;
-<span class="lineNum">      73 </span>                :    bool NoUpdate;
-<span class="lineNum">      74 </span>                :    bool NoDisplay;
-<span class="lineNum">      75 </span>                :    unsigned long LastLen;
-<span class="lineNum">      76 </span>                :    virtual void Update();
-<span class="lineNum">      77 </span>                :    void Write(const char *S);
-<span class="lineNum">      78 </span>                :    
-<span class="lineNum">      79 </span>                :    public:
-<span class="lineNum">      80 </span>                : 
-<span class="lineNum">      81 </span>                :    virtual void Done();
-<span class="lineNum">      82 </span>                :    
-<span class="lineNum">      83 </span>                :    OpTextProgress(bool NoUpdate = false) : NoUpdate(NoUpdate), 
-<span class="lineNum">      84 </span>                :                 NoDisplay(false), LastLen(0) {};
-<span class="lineNum">      85 </span>                :    OpTextProgress(Configuration &amp;Config);
-<span class="lineNum">      86 </span>                :    virtual ~OpTextProgress() {Done();};
-<span class="lineNum">      87 </span>                : };
-<span class="lineNum">      88 </span>                : 
-<span class="lineNum">      89 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/apt-pkg/version.h.gcov.html b/rep/usr/include/apt-pkg/version.h.gcov.html
deleted file mode 100644
index 6bcff73..0000000
--- a/rep/usr/include/apt-pkg/version.h.gcov.html
+++ /dev/null
@@ -1,131 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/apt-pkg/version.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/apt-pkg</a> - version.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">1</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">1</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- mode: cpp; mode: fold -*-
-<span class="lineNum">       2 </span>                : // Description                                                          /*{{{*/
-<span class="lineNum">       3 </span>                : // $Id: version.h,v 1.8 2001/05/27 05:55:27 jgg Exp $
-<span class="lineNum">       4 </span>                : /* ######################################################################
-<span class="lineNum">       5 </span>                : 
-<span class="lineNum">       6 </span>                :    Version - Versioning system..
-<span class="lineNum">       7 </span>                : 
-<span class="lineNum">       8 </span>                :    The versioning system represents how versions are compared, represented
-<span class="lineNum">       9 </span>                :    and how dependencies are evaluated. As a general rule versioning
-<span class="lineNum">      10 </span>                :    systems are not compatible unless specifically allowed by the 
-<span class="lineNum">      11 </span>                :    TestCompatibility query.
-<span class="lineNum">      12 </span>                :    
-<span class="lineNum">      13 </span>                :    The versions are stored in a global list of versions, but that is just
-<span class="lineNum">      14 </span>                :    so that they can be queried when someone does 'apt-get -v'. 
-<span class="lineNum">      15 </span>                :    pkgSystem provides the proper means to access the VS for the active
-<span class="lineNum">      16 </span>                :    system.
-<span class="lineNum">      17 </span>                :    
-<span class="lineNum">      18 </span>                :    ##################################################################### */
-<span class="lineNum">      19 </span>                :                                                                         /*}}}*/
-<span class="lineNum">      20 </span>                : #ifndef PKGLIB_VERSION_H
-<span class="lineNum">      21 </span>                : #define PKGLIB_VERSION_H
-<span class="lineNum">      22 </span>                : 
-<span class="lineNum">      23 </span>                : 
-<span class="lineNum">      24 </span>                : #include &lt;apt-pkg/strutl.h&gt;    
-<span class="lineNum">      25 </span>                : #include &lt;string&gt;
-<span class="lineNum">      26 </span>                : 
-<span class="lineNum">      27 </span>                : using std::string;
-<span class="lineNum">      28 </span>                : 
-<span class="lineNum">      29 </span>                : class pkgVersioningSystem
-<span class="lineNum">      30 </span>                : {
-<span class="lineNum">      31 </span>                :    public:
-<span class="lineNum">      32 </span>                :    // Global list of VS's
-<span class="lineNum">      33 </span>                :    static pkgVersioningSystem **GlobalList;
-<span class="lineNum">      34 </span>                :    static unsigned long GlobalListLen;
-<span class="lineNum">      35 </span>                :    static pkgVersioningSystem *GetVS(const char *Label);
-<span class="lineNum">      36 </span>                :    
-<span class="lineNum">      37 </span>                :    const char *Label;
-<span class="lineNum">      38 </span>                :    
-<span class="lineNum">      39 </span>                :    // Compare versions..
-<span class="lineNum">      40 </span>                :    virtual int DoCmpVersion(const char *A,const char *Aend,
-<span class="lineNum">      41 </span>                :                           const char *B,const char *Bend) = 0;   
-<span class="lineNum">      42 </span>                : 
-<span class="lineNum">      43 </span>                :    virtual bool CheckDep(const char *PkgVer,int Op,const char *DepVer) = 0;
-<span class="lineNum">      44 </span>                :    virtual int DoCmpReleaseVer(const char *A,const char *Aend,
-<span class="lineNum">      45 </span>                :                                const char *B,const char *Bend) = 0;
-<span class="lineNum">      46 </span>                :    virtual string UpstreamVersion(const char *A) = 0;
-<span class="lineNum">      47 </span>                :    
-<span class="lineNum">      48 </span>                :    // See if the given VS is compatible with this one.. 
-<span class="lineNum">      49 </span>                :    virtual bool TestCompatibility(pkgVersioningSystem const &amp;Against) 
-<span class="lineNum">      50 </span>                :                 {return this == &amp;Against;};
-<span class="lineNum">      51 </span>                : 
-<span class="lineNum">      52 </span>                :    // Shortcuts
-<span class="lineNum">      53 </span><span class="lineCov">             14 :    APT_MKSTRCMP(CmpVersion,DoCmpVersion);</span>
-<span class="lineNum">      54 </span>                :    APT_MKSTRCMP(CmpReleaseVer,DoCmpReleaseVer);
-<span class="lineNum">      55 </span>                :    
-<span class="lineNum">      56 </span>                :    pkgVersioningSystem();
-<span class="lineNum">      57 </span>                :    virtual ~pkgVersioningSystem() {};
-<span class="lineNum">      58 </span>                : };
-<span class="lineNum">      59 </span>                : 
-<span class="lineNum">      60 </span>                : #ifdef APT_COMPATIBILITY
-<span class="lineNum">      61 </span>                : #include &lt;apt-pkg/debversion.h&gt;
-<span class="lineNum">      62 </span>                : #endif
-<span class="lineNum">      63 </span>                : 
-<span class="lineNum">      64 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/backward/auto_ptr.h.gcov.html b/rep/usr/include/c++/4.3/backward/auto_ptr.h.gcov.html
deleted file mode 100644
index 4afaec9..0000000
--- a/rep/usr/include/c++/4.3/backward/auto_ptr.h.gcov.html
+++ /dev/null
@@ -1,364 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/backward/auto_ptr.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/backward</a> - auto_ptr.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">15</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">15</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // auto_ptr implementation -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 2007, 2008 Free Software Foundation, Inc.
-<span class="lineNum">       4 </span>                : //
-<span class="lineNum">       5 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       6 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       7 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">       8 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">       9 </span>                : // any later version.
-<span class="lineNum">      10 </span>                : 
-<span class="lineNum">      11 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      12 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      13 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      14 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      15 </span>                : 
-<span class="lineNum">      16 </span>                : // You should have received a copy of the GNU General Public License
-<span class="lineNum">      17 </span>                : // along with this library; see the file COPYING.  If not, write to
-<span class="lineNum">      18 </span>                : // the Free Software Foundation, 51 Franklin Street, Fifth Floor,
-<span class="lineNum">      19 </span>                : // Boston, MA 02110-1301, USA.
-<span class="lineNum">      20 </span>                : 
-<span class="lineNum">      21 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      22 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      23 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      24 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      25 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      26 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      27 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      28 </span>                : // the GNU General Public License.
-<span class="lineNum">      29 </span>                : 
-<span class="lineNum">      30 </span>                : /** @file backward/auto_ptr.h
-<span class="lineNum">      31 </span>                :  *  This is an internal header file, included by other library headers.
-<span class="lineNum">      32 </span>                :  *  You should not attempt to use it directly.
-<span class="lineNum">      33 </span>                :  */
-<span class="lineNum">      34 </span>                : 
-<span class="lineNum">      35 </span>                : #ifndef _STL_AUTO_PTR_H
-<span class="lineNum">      36 </span>                : #define _STL_AUTO_PTR_H 1
-<span class="lineNum">      37 </span>                : 
-<span class="lineNum">      38 </span>                : #include &lt;bits/c++config.h&gt;
-<span class="lineNum">      39 </span>                : #include &lt;debug/debug.h&gt;
-<span class="lineNum">      40 </span>                : 
-<span class="lineNum">      41 </span>                : _GLIBCXX_BEGIN_NAMESPACE(std)
-<span class="lineNum">      42 </span>                : 
-<span class="lineNum">      43 </span>                :   /**
-<span class="lineNum">      44 </span>                :    *  A wrapper class to provide auto_ptr with reference semantics.
-<span class="lineNum">      45 </span>                :    *  For example, an auto_ptr can be assigned (or constructed from)
-<span class="lineNum">      46 </span>                :    *  the result of a function which returns an auto_ptr by value.
-<span class="lineNum">      47 </span>                :    *
-<span class="lineNum">      48 </span>                :    *  All the auto_ptr_ref stuff should happen behind the scenes.
-<span class="lineNum">      49 </span>                :    */
-<span class="lineNum">      50 </span>                :   template&lt;typename _Tp1&gt;
-<span class="lineNum">      51 </span>                :     struct auto_ptr_ref
-<span class="lineNum">      52 </span>                :     {
-<span class="lineNum">      53 </span>                :       _Tp1* _M_ptr;
-<span class="lineNum">      54 </span>                :       
-<span class="lineNum">      55 </span>                :       explicit
-<span class="lineNum">      56 </span><span class="lineCov">            666 :       auto_ptr_ref(_Tp1* __p): _M_ptr(__p) { }</span>
-<span class="lineNum">      57 </span>                :     } _GLIBCXX_DEPRECATED_ATTR;
-<span class="lineNum">      58 </span>                : 
-<span class="lineNum">      59 </span>                : 
-<span class="lineNum">      60 </span>                :   /**
-<span class="lineNum">      61 </span>                :    *  @brief  A simple smart pointer providing strict ownership semantics.
-<span class="lineNum">      62 </span>                :    *
-<span class="lineNum">      63 </span>                :    *  The Standard says:
-<span class="lineNum">      64 </span>                :    *  &lt;pre&gt;
-<span class="lineNum">      65 </span>                :    *  An @c auto_ptr owns the object it holds a pointer to.  Copying
-<span class="lineNum">      66 </span>                :    *  an @c auto_ptr copies the pointer and transfers ownership to the
-<span class="lineNum">      67 </span>                :    *  destination.  If more than one @c auto_ptr owns the same object
-<span class="lineNum">      68 </span>                :    *  at the same time the behavior of the program is undefined.
-<span class="lineNum">      69 </span>                :    *
-<span class="lineNum">      70 </span>                :    *  The uses of @c auto_ptr include providing temporary
-<span class="lineNum">      71 </span>                :    *  exception-safety for dynamically allocated memory, passing
-<span class="lineNum">      72 </span>                :    *  ownership of dynamically allocated memory to a function, and
-<span class="lineNum">      73 </span>                :    *  returning dynamically allocated memory from a function.  @c
-<span class="lineNum">      74 </span>                :    *  auto_ptr does not meet the CopyConstructible and Assignable
-<span class="lineNum">      75 </span>                :    *  requirements for Standard Library &lt;a
-<span class="lineNum">      76 </span>                :    *  href=&quot;tables.html#65&quot;&gt;container&lt;/a&gt; elements and thus
-<span class="lineNum">      77 </span>                :    *  instantiating a Standard Library container with an @c auto_ptr
-<span class="lineNum">      78 </span>                :    *  results in undefined behavior.
-<span class="lineNum">      79 </span>                :    *  &lt;/pre&gt;
-<span class="lineNum">      80 </span>                :    *  Quoted from [20.4.5]/3.
-<span class="lineNum">      81 </span>                :    *
-<span class="lineNum">      82 </span>                :    *  Good examples of what can and cannot be done with auto_ptr can
-<span class="lineNum">      83 </span>                :    *  be found in the libstdc++ testsuite.
-<span class="lineNum">      84 </span>                :    *
-<span class="lineNum">      85 </span>                :    *  _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">      86 </span>                :    *  127.  auto_ptr&lt;&gt; conversion issues
-<span class="lineNum">      87 </span>                :    *  These resolutions have all been incorporated.
-<span class="lineNum">      88 </span>                :    */
-<span class="lineNum">      89 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">      90 </span>                :     class auto_ptr
-<span class="lineNum">      91 </span>                :     {
-<span class="lineNum">      92 </span>                :     private:
-<span class="lineNum">      93 </span>                :       _Tp* _M_ptr;
-<span class="lineNum">      94 </span>                :       
-<span class="lineNum">      95 </span>                :     public:
-<span class="lineNum">      96 </span>                :       /// The pointed-to type.
-<span class="lineNum">      97 </span>                :       typedef _Tp element_type;
-<span class="lineNum">      98 </span>                :       
-<span class="lineNum">      99 </span>                :       /**
-<span class="lineNum">     100 </span>                :        *  @brief  An %auto_ptr is usually constructed from a raw pointer.
-<span class="lineNum">     101 </span>                :        *  @param  p  A pointer (defaults to NULL).
-<span class="lineNum">     102 </span>                :        *
-<span class="lineNum">     103 </span>                :        *  This object now @e owns the object pointed to by @a p.
-<span class="lineNum">     104 </span>                :        */
-<span class="lineNum">     105 </span>                :       explicit
-<span class="lineNum">     106 </span><span class="lineCov">            666 :       auto_ptr(element_type* __p = 0) throw() : _M_ptr(__p) { }</span>
-<span class="lineNum">     107 </span>                : 
-<span class="lineNum">     108 </span>                :       /**
-<span class="lineNum">     109 </span>                :        *  @brief  An %auto_ptr can be constructed from another %auto_ptr.
-<span class="lineNum">     110 </span>                :        *  @param  a  Another %auto_ptr of the same type.
-<span class="lineNum">     111 </span>                :        *
-<span class="lineNum">     112 </span>                :        *  This object now @e owns the object previously owned by @a a,
-<span class="lineNum">     113 </span>                :        *  which has given up ownership.
-<span class="lineNum">     114 </span>                :        */
-<span class="lineNum">     115 </span><span class="lineCov">            590 :       auto_ptr(auto_ptr&amp; __a) throw() : _M_ptr(__a.release()) { }</span>
-<span class="lineNum">     116 </span>                : 
-<span class="lineNum">     117 </span>                :       /**
-<span class="lineNum">     118 </span>                :        *  @brief  An %auto_ptr can be constructed from another %auto_ptr.
-<span class="lineNum">     119 </span>                :        *  @param  a  Another %auto_ptr of a different but related type.
-<span class="lineNum">     120 </span>                :        *
-<span class="lineNum">     121 </span>                :        *  A pointer-to-Tp1 must be convertible to a
-<span class="lineNum">     122 </span>                :        *  pointer-to-Tp/element_type.
-<span class="lineNum">     123 </span>                :        *
-<span class="lineNum">     124 </span>                :        *  This object now @e owns the object previously owned by @a a,
-<span class="lineNum">     125 </span>                :        *  which has given up ownership.
-<span class="lineNum">     126 </span>                :        */
-<span class="lineNum">     127 </span>                :       template&lt;typename _Tp1&gt;
-<span class="lineNum">     128 </span>                :         auto_ptr(auto_ptr&lt;_Tp1&gt;&amp; __a) throw() : _M_ptr(__a.release()) { }
-<span class="lineNum">     129 </span>                : 
-<span class="lineNum">     130 </span>                :       /**
-<span class="lineNum">     131 </span>                :        *  @brief  %auto_ptr assignment operator.
-<span class="lineNum">     132 </span>                :        *  @param  a  Another %auto_ptr of the same type.
-<span class="lineNum">     133 </span>                :        *
-<span class="lineNum">     134 </span>                :        *  This object now @e owns the object previously owned by @a a,
-<span class="lineNum">     135 </span>                :        *  which has given up ownership.  The object that this one @e
-<span class="lineNum">     136 </span>                :        *  used to own and track has been deleted.
-<span class="lineNum">     137 </span>                :        */
-<span class="lineNum">     138 </span>                :       auto_ptr&amp;
-<span class="lineNum">     139 </span>                :       operator=(auto_ptr&amp; __a) throw()
-<span class="lineNum">     140 </span>                :       {
-<span class="lineNum">     141 </span>                :         reset(__a.release());
-<span class="lineNum">     142 </span>                :         return *this;
-<span class="lineNum">     143 </span>                :       }
-<span class="lineNum">     144 </span>                : 
-<span class="lineNum">     145 </span>                :       /**
-<span class="lineNum">     146 </span>                :        *  @brief  %auto_ptr assignment operator.
-<span class="lineNum">     147 </span>                :        *  @param  a  Another %auto_ptr of a different but related type.
-<span class="lineNum">     148 </span>                :        *
-<span class="lineNum">     149 </span>                :        *  A pointer-to-Tp1 must be convertible to a pointer-to-Tp/element_type.
-<span class="lineNum">     150 </span>                :        *
-<span class="lineNum">     151 </span>                :        *  This object now @e owns the object previously owned by @a a,
-<span class="lineNum">     152 </span>                :        *  which has given up ownership.  The object that this one @e
-<span class="lineNum">     153 </span>                :        *  used to own and track has been deleted.
-<span class="lineNum">     154 </span>                :        */
-<span class="lineNum">     155 </span>                :       template&lt;typename _Tp1&gt;
-<span class="lineNum">     156 </span>                :         auto_ptr&amp;
-<span class="lineNum">     157 </span>                :         operator=(auto_ptr&lt;_Tp1&gt;&amp; __a) throw()
-<span class="lineNum">     158 </span>                :         {
-<span class="lineNum">     159 </span>                :           reset(__a.release());
-<span class="lineNum">     160 </span>                :           return *this;
-<span class="lineNum">     161 </span>                :         }
-<span class="lineNum">     162 </span>                : 
-<span class="lineNum">     163 </span>                :       /**
-<span class="lineNum">     164 </span>                :        *  When the %auto_ptr goes out of scope, the object it owns is
-<span class="lineNum">     165 </span>                :        *  deleted.  If it no longer owns anything (i.e., @c get() is
-<span class="lineNum">     166 </span>                :        *  @c NULL), then this has no effect.
-<span class="lineNum">     167 </span>                :        *
-<span class="lineNum">     168 </span>                :        *  The C++ standard says there is supposed to be an empty throw
-<span class="lineNum">     169 </span>                :        *  specification here, but omitting it is standard conforming.  Its
-<span class="lineNum">     170 </span>                :        *  presence can be detected only if _Tp::~_Tp() throws, but this is
-<span class="lineNum">     171 </span>                :        *  prohibited.  [17.4.3.6]/2
-<span class="lineNum">     172 </span>                :        */
-<span class="lineNum">     173 </span><span class="lineCov">           1922 :       ~auto_ptr() { delete _M_ptr; }</span>
-<span class="lineNum">     174 </span>                :       
-<span class="lineNum">     175 </span>                :       /**
-<span class="lineNum">     176 </span>                :        *  @brief  Smart pointer dereferencing.
-<span class="lineNum">     177 </span>                :        *
-<span class="lineNum">     178 </span>                :        *  If this %auto_ptr no longer owns anything, then this
-<span class="lineNum">     179 </span>                :        *  operation will crash.  (For a smart pointer, &quot;no longer owns
-<span class="lineNum">     180 </span>                :        *  anything&quot; is the same as being a null pointer, and you know
-<span class="lineNum">     181 </span>                :        *  what happens when you dereference one of those...)
-<span class="lineNum">     182 </span>                :        */
-<span class="lineNum">     183 </span>                :       element_type&amp;
-<span class="lineNum">     184 </span>                :       operator*() const throw() 
-<span class="lineNum">     185 </span>                :       {
-<span class="lineNum">     186 </span>                :         _GLIBCXX_DEBUG_ASSERT(_M_ptr != 0);
-<span class="lineNum">     187 </span>                :         return *_M_ptr; 
-<span class="lineNum">     188 </span>                :       }
-<span class="lineNum">     189 </span>                :       
-<span class="lineNum">     190 </span>                :       /**
-<span class="lineNum">     191 </span>                :        *  @brief  Smart pointer dereferencing.
-<span class="lineNum">     192 </span>                :        *
-<span class="lineNum">     193 </span>                :        *  This returns the pointer itself, which the language then will
-<span class="lineNum">     194 </span>                :        *  automatically cause to be dereferenced.
-<span class="lineNum">     195 </span>                :        */
-<span class="lineNum">     196 </span>                :       element_type*
-<span class="lineNum">     197 </span><span class="lineCov">            590 :       operator-&gt;() const throw() </span>
-<span class="lineNum">     198 </span>                :       {
-<span class="lineNum">     199 </span>                :         _GLIBCXX_DEBUG_ASSERT(_M_ptr != 0);
-<span class="lineNum">     200 </span><span class="lineCov">            590 :         return _M_ptr; </span>
-<span class="lineNum">     201 </span>                :       }
-<span class="lineNum">     202 </span>                :       
-<span class="lineNum">     203 </span>                :       /**
-<span class="lineNum">     204 </span>                :        *  @brief  Bypassing the smart pointer.
-<span class="lineNum">     205 </span>                :        *  @return  The raw pointer being managed.
-<span class="lineNum">     206 </span>                :        *
-<span class="lineNum">     207 </span>                :        *  You can get a copy of the pointer that this object owns, for
-<span class="lineNum">     208 </span>                :        *  situations such as passing to a function which only accepts
-<span class="lineNum">     209 </span>                :        *  a raw pointer.
-<span class="lineNum">     210 </span>                :        *
-<span class="lineNum">     211 </span>                :        *  @note  This %auto_ptr still owns the memory.
-<span class="lineNum">     212 </span>                :        */
-<span class="lineNum">     213 </span>                :       element_type*
-<span class="lineNum">     214 </span><span class="lineCov">           1256 :       get() const throw() { return _M_ptr; }</span>
-<span class="lineNum">     215 </span>                :       
-<span class="lineNum">     216 </span>                :       /**
-<span class="lineNum">     217 </span>                :        *  @brief  Bypassing the smart pointer.
-<span class="lineNum">     218 </span>                :        *  @return  The raw pointer being managed.
-<span class="lineNum">     219 </span>                :        *
-<span class="lineNum">     220 </span>                :        *  You can get a copy of the pointer that this object owns, for
-<span class="lineNum">     221 </span>                :        *  situations such as passing to a function which only accepts
-<span class="lineNum">     222 </span>                :        *  a raw pointer.
-<span class="lineNum">     223 </span>                :        *
-<span class="lineNum">     224 </span>                :        *  @note  This %auto_ptr no longer owns the memory.  When this object
-<span class="lineNum">     225 </span>                :        *  goes out of scope, nothing will happen.
-<span class="lineNum">     226 </span>                :        */
-<span class="lineNum">     227 </span>                :       element_type*
-<span class="lineNum">     228 </span><span class="lineCov">           1256 :       release() throw()</span>
-<span class="lineNum">     229 </span>                :       {
-<span class="lineNum">     230 </span><span class="lineCov">           1256 :         element_type* __tmp = _M_ptr;</span>
-<span class="lineNum">     231 </span><span class="lineCov">           1256 :         _M_ptr = 0;</span>
-<span class="lineNum">     232 </span><span class="lineCov">           1256 :         return __tmp;</span>
-<span class="lineNum">     233 </span>                :       }
-<span class="lineNum">     234 </span>                :       
-<span class="lineNum">     235 </span>                :       /**
-<span class="lineNum">     236 </span>                :        *  @brief  Forcibly deletes the managed object.
-<span class="lineNum">     237 </span>                :        *  @param  p  A pointer (defaults to NULL).
-<span class="lineNum">     238 </span>                :        *
-<span class="lineNum">     239 </span>                :        *  This object now @e owns the object pointed to by @a p.  The
-<span class="lineNum">     240 </span>                :        *  previous object has been deleted.
-<span class="lineNum">     241 </span>                :        */
-<span class="lineNum">     242 </span>                :       void
-<span class="lineNum">     243 </span>                :       reset(element_type* __p = 0) throw()
-<span class="lineNum">     244 </span>                :       {
-<span class="lineNum">     245 </span>                :         if (__p != _M_ptr)
-<span class="lineNum">     246 </span>                :           {
-<span class="lineNum">     247 </span>                :             delete _M_ptr;
-<span class="lineNum">     248 </span>                :             _M_ptr = __p;
-<span class="lineNum">     249 </span>                :           }
-<span class="lineNum">     250 </span>                :       }
-<span class="lineNum">     251 </span>                :       
-<span class="lineNum">     252 </span>                :       /** 
-<span class="lineNum">     253 </span>                :        *  @brief  Automatic conversions
-<span class="lineNum">     254 </span>                :        *
-<span class="lineNum">     255 </span>                :        *  These operations convert an %auto_ptr into and from an auto_ptr_ref
-<span class="lineNum">     256 </span>                :        *  automatically as needed.  This allows constructs such as
-<span class="lineNum">     257 </span>                :        *  @code
-<span class="lineNum">     258 </span>                :        *    auto_ptr&lt;Derived&gt;  func_returning_auto_ptr(.....);
-<span class="lineNum">     259 </span>                :        *    ...
-<span class="lineNum">     260 </span>                :        *    auto_ptr&lt;Base&gt; ptr = func_returning_auto_ptr(.....);
-<span class="lineNum">     261 </span>                :        *  @endcode
-<span class="lineNum">     262 </span>                :        */
-<span class="lineNum">     263 </span><span class="lineCov">            666 :       auto_ptr(auto_ptr_ref&lt;element_type&gt; __ref) throw()</span>
-<span class="lineNum">     264 </span><span class="lineCov">            666 :       : _M_ptr(__ref._M_ptr) { }</span>
-<span class="lineNum">     265 </span>                :       
-<span class="lineNum">     266 </span>                :       auto_ptr&amp;
-<span class="lineNum">     267 </span>                :       operator=(auto_ptr_ref&lt;element_type&gt; __ref) throw()
-<span class="lineNum">     268 </span>                :       {
-<span class="lineNum">     269 </span>                :         if (__ref._M_ptr != this-&gt;get())
-<span class="lineNum">     270 </span>                :           {
-<span class="lineNum">     271 </span>                :             delete _M_ptr;
-<span class="lineNum">     272 </span>                :             _M_ptr = __ref._M_ptr;
-<span class="lineNum">     273 </span>                :           }
-<span class="lineNum">     274 </span>                :         return *this;
-<span class="lineNum">     275 </span>                :       }
-<span class="lineNum">     276 </span>                :       
-<span class="lineNum">     277 </span>                :       template&lt;typename _Tp1&gt;
-<span class="lineNum">     278 </span><span class="lineCov">            666 :         operator auto_ptr_ref&lt;_Tp1&gt;() throw()</span>
-<span class="lineNum">     279 </span><span class="lineCov">            666 :         { return auto_ptr_ref&lt;_Tp1&gt;(this-&gt;release()); }</span>
-<span class="lineNum">     280 </span>                : 
-<span class="lineNum">     281 </span>                :       template&lt;typename _Tp1&gt;
-<span class="lineNum">     282 </span>                :         operator auto_ptr&lt;_Tp1&gt;() throw()
-<span class="lineNum">     283 </span>                :         { return auto_ptr&lt;_Tp1&gt;(this-&gt;release()); }
-<span class="lineNum">     284 </span>                :     } _GLIBCXX_DEPRECATED_ATTR;
-<span class="lineNum">     285 </span>                : 
-<span class="lineNum">     286 </span>                :   // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     287 </span>                :   // 541. shared_ptr template assignment and void
-<span class="lineNum">     288 </span>                :   template&lt;&gt;
-<span class="lineNum">     289 </span>                :     class auto_ptr&lt;void&gt;
-<span class="lineNum">     290 </span>                :     {
-<span class="lineNum">     291 </span>                :     public:
-<span class="lineNum">     292 </span>                :       typedef void element_type;
-<span class="lineNum">     293 </span>                :     } _GLIBCXX_DEPRECATED_ATTR;
-<span class="lineNum">     294 </span>                : 
-<span class="lineNum">     295 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">     296 </span>                : 
-<span class="lineNum">     297 </span>                : #endif /* _STL_AUTO_PTR_H */
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/backward/binders.h.gcov.html b/rep/usr/include/c++/4.3/backward/binders.h.gcov.html
deleted file mode 100644
index 861e1d9..0000000
--- a/rep/usr/include/c++/4.3/backward/binders.h.gcov.html
+++ /dev/null
@@ -1,238 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/backward/binders.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/backward</a> - binders.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">7</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">7</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // Functor implementations -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007
-<span class="lineNum">       4 </span>                : // Free Software Foundation, Inc.
-<span class="lineNum">       5 </span>                : //
-<span class="lineNum">       6 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       7 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       8 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">       9 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      10 </span>                : // any later version.
-<span class="lineNum">      11 </span>                : 
-<span class="lineNum">      12 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      13 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      14 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      15 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      16 </span>                : 
-<span class="lineNum">      17 </span>                : // You should have received a copy of the GNU General Public License along
-<span class="lineNum">      18 </span>                : // with this library; see the file COPYING.  If not, write to the Free
-<span class="lineNum">      19 </span>                : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-<span class="lineNum">      20 </span>                : // USA.
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      23 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      24 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      25 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      26 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      27 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      28 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      29 </span>                : // the GNU General Public License.
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : /*
-<span class="lineNum">      32 </span>                :  *
-<span class="lineNum">      33 </span>                :  * Copyright (c) 1994
-<span class="lineNum">      34 </span>                :  * Hewlett-Packard Company
-<span class="lineNum">      35 </span>                :  *
-<span class="lineNum">      36 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      37 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      38 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      39 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      40 </span>                :  * in supporting documentation.  Hewlett-Packard Company makes no
-<span class="lineNum">      41 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      42 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      43 </span>                :  *
-<span class="lineNum">      44 </span>                :  *
-<span class="lineNum">      45 </span>                :  * Copyright (c) 1996-1998
-<span class="lineNum">      46 </span>                :  * Silicon Graphics Computer Systems, Inc.
-<span class="lineNum">      47 </span>                :  *
-<span class="lineNum">      48 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      49 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      50 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      51 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      52 </span>                :  * in supporting documentation.  Silicon Graphics makes no
-<span class="lineNum">      53 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      54 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      55 </span>                :  */
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span>                : /** @file backward/binders.h
-<span class="lineNum">      58 </span>                :  *  This is an internal header file, included by other library headers.
-<span class="lineNum">      59 </span>                :  *  You should not attempt to use it directly.
-<span class="lineNum">      60 </span>                :  */
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span>                : #ifndef _GLIBCXX_BINDERS_H
-<span class="lineNum">      63 </span>                : #define _GLIBCXX_BINDERS_H 1
-<span class="lineNum">      64 </span>                : 
-<span class="lineNum">      65 </span>                : _GLIBCXX_BEGIN_NAMESPACE(std)
-<span class="lineNum">      66 </span>                : 
-<span class="lineNum">      67 </span>                :   // 20.3.6 binders
-<span class="lineNum">      68 </span>                :   /** @defgroup s20_3_6_binder Binder Classes
-<span class="lineNum">      69 </span>                :    *  Binders turn functions/functors with two arguments into functors with
-<span class="lineNum">      70 </span>                :    *  a single argument, storing an argument to be applied later.  For
-<span class="lineNum">      71 </span>                :    *  example, a variable @c B of type @c binder1st is constructed from a
-<span class="lineNum">      72 </span>                :    *  functor @c f and an argument @c x.  Later, B's @c operator() is called
-<span class="lineNum">      73 </span>                :    *  with a single argument @c y.  The return value is the value of @c f(x,y).
-<span class="lineNum">      74 </span>                :    *  @c B can be &quot;called&quot; with various arguments (y1, y2, ...) and will in
-<span class="lineNum">      75 </span>                :    *  turn call @c f(x,y1), @c f(x,y2), ...
-<span class="lineNum">      76 </span>                :    *
-<span class="lineNum">      77 </span>                :    *  The function @c bind1st is provided to save some typing.  It takes the
-<span class="lineNum">      78 </span>                :    *  function and an argument as parameters, and returns an instance of
-<span class="lineNum">      79 </span>                :    *  @c binder1st.
-<span class="lineNum">      80 </span>                :    *
-<span class="lineNum">      81 </span>                :    *  The type @c binder2nd and its creator function @c bind2nd do the same
-<span class="lineNum">      82 </span>                :    *  thing, but the stored argument is passed as the second parameter instead
-<span class="lineNum">      83 </span>                :    *  of the first, e.g., @c bind2nd(std::minus&lt;float&gt;,1.3) will create a
-<span class="lineNum">      84 </span>                :    *  functor whose @c operator() accepts a floating-point number, subtracts
-<span class="lineNum">      85 </span>                :    *  1.3 from it, and returns the result.  (If @c bind1st had been used,
-<span class="lineNum">      86 </span>                :    *  the functor would perform &quot;1.3 - x&quot; instead.
-<span class="lineNum">      87 </span>                :    *
-<span class="lineNum">      88 </span>                :    *  Creator-wrapper functions like @c bind1st are intended to be used in
-<span class="lineNum">      89 </span>                :    *  calling algorithms.  Their return values will be temporary objects.
-<span class="lineNum">      90 </span>                :    *  (The goal is to not require you to type names like
-<span class="lineNum">      91 </span>                :    *  @c std::binder1st&lt;std::plus&lt;int&gt;&gt; for declaring a variable to hold the
-<span class="lineNum">      92 </span>                :    *  return value from @c bind1st(std::plus&lt;int&gt;,5).
-<span class="lineNum">      93 </span>                :    *
-<span class="lineNum">      94 </span>                :    *  These become more useful when combined with the composition functions.
-<span class="lineNum">      95 </span>                :    *
-<span class="lineNum">      96 </span>                :    *  @{
-<span class="lineNum">      97 </span>                :    */
-<span class="lineNum">      98 </span>                :   /// One of the @link s20_3_6_binder binder functors@endlink.
-<span class="lineNum">      99 </span>                :   template&lt;typename _Operation&gt;
-<span class="lineNum">     100 </span>                :     class binder1st
-<span class="lineNum">     101 </span>                :     : public unary_function&lt;typename _Operation::second_argument_type,
-<span class="lineNum">     102 </span>                :                             typename _Operation::result_type&gt;
-<span class="lineNum">     103 </span><span class="lineCov">             16 :     {</span>
-<span class="lineNum">     104 </span>                :     protected:
-<span class="lineNum">     105 </span>                :       _Operation op;
-<span class="lineNum">     106 </span>                :       typename _Operation::first_argument_type value;
-<span class="lineNum">     107 </span>                : 
-<span class="lineNum">     108 </span>                :     public:
-<span class="lineNum">     109 </span>                :       binder1st(const _Operation&amp; __x,
-<span class="lineNum">     110 </span><span class="lineCov">             19 :                 const typename _Operation::first_argument_type&amp; __y)</span>
-<span class="lineNum">     111 </span><span class="lineCov">             19 :       : op(__x), value(__y) { }</span>
-<span class="lineNum">     112 </span>                : 
-<span class="lineNum">     113 </span>                :       typename _Operation::result_type
-<span class="lineNum">     114 </span><span class="lineCov">             70 :       operator()(const typename _Operation::second_argument_type&amp; __x) const</span>
-<span class="lineNum">     115 </span><span class="lineCov">             70 :       { return op(value, __x); }</span>
-<span class="lineNum">     116 </span>                : 
-<span class="lineNum">     117 </span>                :       // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     118 </span>                :       // 109.  Missing binders for non-const sequence elements
-<span class="lineNum">     119 </span>                :       typename _Operation::result_type
-<span class="lineNum">     120 </span>                :       operator()(typename _Operation::second_argument_type&amp; __x) const
-<span class="lineNum">     121 </span>                :       { return op(value, __x); }
-<span class="lineNum">     122 </span>                :     } _GLIBCXX_DEPRECATED_ATTR;
-<span class="lineNum">     123 </span>                : 
-<span class="lineNum">     124 </span>                :   /// One of the @link s20_3_6_binder binder functors@endlink.
-<span class="lineNum">     125 </span>                :   template&lt;typename _Operation, typename _Tp&gt;
-<span class="lineNum">     126 </span>                :     inline binder1st&lt;_Operation&gt;
-<span class="lineNum">     127 </span><span class="lineCov">             19 :     bind1st(const _Operation&amp; __fn, const _Tp&amp; __x)</span>
-<span class="lineNum">     128 </span>                :     {
-<span class="lineNum">     129 </span>                :       typedef typename _Operation::first_argument_type _Arg1_type;
-<span class="lineNum">     130 </span><span class="lineCov">             19 :       return binder1st&lt;_Operation&gt;(__fn, _Arg1_type(__x));</span>
-<span class="lineNum">     131 </span>                :     }
-<span class="lineNum">     132 </span>                : 
-<span class="lineNum">     133 </span>                :   /// One of the @link s20_3_6_binder binder functors@endlink.
-<span class="lineNum">     134 </span>                :   template&lt;typename _Operation&gt;
-<span class="lineNum">     135 </span>                :     class binder2nd
-<span class="lineNum">     136 </span>                :     : public unary_function&lt;typename _Operation::first_argument_type,
-<span class="lineNum">     137 </span>                :                             typename _Operation::result_type&gt;
-<span class="lineNum">     138 </span>                :     {
-<span class="lineNum">     139 </span>                :     protected:
-<span class="lineNum">     140 </span>                :       _Operation op;
-<span class="lineNum">     141 </span>                :       typename _Operation::second_argument_type value;
-<span class="lineNum">     142 </span>                : 
-<span class="lineNum">     143 </span>                :     public:
-<span class="lineNum">     144 </span>                :       binder2nd(const _Operation&amp; __x,
-<span class="lineNum">     145 </span>                :                 const typename _Operation::second_argument_type&amp; __y)
-<span class="lineNum">     146 </span>                :       : op(__x), value(__y) { }
-<span class="lineNum">     147 </span>                : 
-<span class="lineNum">     148 </span>                :       typename _Operation::result_type
-<span class="lineNum">     149 </span>                :       operator()(const typename _Operation::first_argument_type&amp; __x) const
-<span class="lineNum">     150 </span>                :       { return op(__x, value); }
-<span class="lineNum">     151 </span>                : 
-<span class="lineNum">     152 </span>                :       // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     153 </span>                :       // 109.  Missing binders for non-const sequence elements
-<span class="lineNum">     154 </span>                :       typename _Operation::result_type
-<span class="lineNum">     155 </span>                :       operator()(typename _Operation::first_argument_type&amp; __x) const
-<span class="lineNum">     156 </span>                :       { return op(__x, value); }
-<span class="lineNum">     157 </span>                :     } _GLIBCXX_DEPRECATED_ATTR;
-<span class="lineNum">     158 </span>                : 
-<span class="lineNum">     159 </span>                :   /// One of the @link s20_3_6_binder binder functors@endlink.
-<span class="lineNum">     160 </span>                :   template&lt;typename _Operation, typename _Tp&gt;
-<span class="lineNum">     161 </span>                :     inline binder2nd&lt;_Operation&gt;
-<span class="lineNum">     162 </span>                :     bind2nd(const _Operation&amp; __fn, const _Tp&amp; __x)
-<span class="lineNum">     163 </span>                :     {
-<span class="lineNum">     164 </span>                :       typedef typename _Operation::second_argument_type _Arg2_type;
-<span class="lineNum">     165 </span>                :       return binder2nd&lt;_Operation&gt;(__fn, _Arg2_type(__x));
-<span class="lineNum">     166 </span>                :     } 
-<span class="lineNum">     167 </span>                :   /** @}  */
-<span class="lineNum">     168 </span>                : 
-<span class="lineNum">     169 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">     170 </span>                : 
-<span class="lineNum">     171 </span>                : #endif /* _GLIBCXX_BINDERS_H */
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/backward/index.html b/rep/usr/include/c++/4.3/backward/index.html
deleted file mode 100644
index 3ef4b52..0000000
--- a/rep/usr/include/c++/4.3/backward/index.html
+++ /dev/null
@@ -1,92 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/backward</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - /usr/include/c++/4.3/backward</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">22</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">22</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <center>
-  <table width="80%" cellpadding=2 cellspacing=1 border=0>
-
-    <tr>
-      <td width="50%"><br></td>
-      <td width="15%"></td>
-      <td width="15%"></td>
-      <td width="20%"></td>
-    </tr>
-
-    <tr>
-      <td class="tableHead">Filename</td>
-      <td class="tableHead" colspan=3>Coverage</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="auto_ptr.h.gcov.html">auto_ptr.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">15&nbsp;/&nbsp;15&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="binders.h.gcov.html">binders.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">7&nbsp;/&nbsp;7&nbsp;lines</td>
-    </tr>
-
-  </table>
-  </center>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/bits/allocator.h.gcov.html b/rep/usr/include/c++/4.3/bits/allocator.h.gcov.html
deleted file mode 100644
index 6f76dc6..0000000
--- a/rep/usr/include/c++/4.3/bits/allocator.h.gcov.html
+++ /dev/null
@@ -1,245 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/allocator.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - allocator.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">7</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">71.4 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">5</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // Allocators -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
-<span class="lineNum">       4 </span>                : // Free Software Foundation, Inc.
-<span class="lineNum">       5 </span>                : //
-<span class="lineNum">       6 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       7 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       8 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">       9 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      10 </span>                : // any later version.
-<span class="lineNum">      11 </span>                : 
-<span class="lineNum">      12 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      13 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      14 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      15 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      16 </span>                : 
-<span class="lineNum">      17 </span>                : // You should have received a copy of the GNU General Public License along
-<span class="lineNum">      18 </span>                : // with this library; see the file COPYING.  If not, write to the Free
-<span class="lineNum">      19 </span>                : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-<span class="lineNum">      20 </span>                : // USA.
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      23 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      24 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      25 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      26 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      27 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      28 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      29 </span>                : // the GNU General Public License.
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : /*
-<span class="lineNum">      32 </span>                :  * Copyright (c) 1996-1997
-<span class="lineNum">      33 </span>                :  * Silicon Graphics Computer Systems, Inc.
-<span class="lineNum">      34 </span>                :  *
-<span class="lineNum">      35 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      36 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      37 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      38 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      39 </span>                :  * in supporting documentation.  Silicon Graphics makes no
-<span class="lineNum">      40 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      41 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      42 </span>                :  */
-<span class="lineNum">      43 </span>                : 
-<span class="lineNum">      44 </span>                : /** @file allocator.h
-<span class="lineNum">      45 </span>                :  *  This is an internal header file, included by other library headers.
-<span class="lineNum">      46 </span>                :  *  You should not attempt to use it directly.
-<span class="lineNum">      47 </span>                :  */
-<span class="lineNum">      48 </span>                : 
-<span class="lineNum">      49 </span>                : #ifndef _ALLOCATOR_H
-<span class="lineNum">      50 </span>                : #define _ALLOCATOR_H 1
-<span class="lineNum">      51 </span>                : 
-<span class="lineNum">      52 </span>                : // Define the base class to std::allocator.
-<span class="lineNum">      53 </span>                : #include &lt;bits/c++allocator.h&gt;
-<span class="lineNum">      54 </span>                : 
-<span class="lineNum">      55 </span>                : _GLIBCXX_BEGIN_NAMESPACE(std)
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">      58 </span>                :     class allocator;
-<span class="lineNum">      59 </span>                : 
-<span class="lineNum">      60 </span>                :   /// allocator&lt;void&gt; specialization.
-<span class="lineNum">      61 </span>                :   template&lt;&gt;
-<span class="lineNum">      62 </span>                :     class allocator&lt;void&gt;
-<span class="lineNum">      63 </span>                :     {
-<span class="lineNum">      64 </span>                :     public:
-<span class="lineNum">      65 </span>                :       typedef size_t      size_type;
-<span class="lineNum">      66 </span>                :       typedef ptrdiff_t   difference_type;
-<span class="lineNum">      67 </span>                :       typedef void*       pointer;
-<span class="lineNum">      68 </span>                :       typedef const void* const_pointer;
-<span class="lineNum">      69 </span>                :       typedef void        value_type;
-<span class="lineNum">      70 </span>                : 
-<span class="lineNum">      71 </span>                :       template&lt;typename _Tp1&gt;
-<span class="lineNum">      72 </span>                :         struct rebind
-<span class="lineNum">      73 </span>                :         { typedef allocator&lt;_Tp1&gt; other; };
-<span class="lineNum">      74 </span>                :     };
-<span class="lineNum">      75 </span>                : 
-<span class="lineNum">      76 </span>                :   /**
-<span class="lineNum">      77 </span>                :    * @brief  The &quot;standard&quot; allocator, as per [20.4].
-<span class="lineNum">      78 </span>                :    *
-<span class="lineNum">      79 </span>                :    *  Further details:
-<span class="lineNum">      80 </span>                :    *  http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt04ch11.html
-<span class="lineNum">      81 </span>                :    */
-<span class="lineNum">      82 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">      83 </span>                :     class allocator: public __glibcxx_base_allocator&lt;_Tp&gt;
-<span class="lineNum">      84 </span>                :     {
-<span class="lineNum">      85 </span>                :    public:
-<span class="lineNum">      86 </span>                :       typedef size_t     size_type;
-<span class="lineNum">      87 </span>                :       typedef ptrdiff_t  difference_type;
-<span class="lineNum">      88 </span>                :       typedef _Tp*       pointer;
-<span class="lineNum">      89 </span>                :       typedef const _Tp* const_pointer;
-<span class="lineNum">      90 </span>                :       typedef _Tp&amp;       reference;
-<span class="lineNum">      91 </span>                :       typedef const _Tp&amp; const_reference;
-<span class="lineNum">      92 </span>                :       typedef _Tp        value_type;
-<span class="lineNum">      93 </span>                : 
-<span class="lineNum">      94 </span>                :       template&lt;typename _Tp1&gt;
-<span class="lineNum">      95 </span>                :         struct rebind
-<span class="lineNum">      96 </span>                :         { typedef allocator&lt;_Tp1&gt; other; };
-<span class="lineNum">      97 </span>                : 
-<span class="lineNum">      98 </span><span class="lineCov">         285441 :       allocator() throw() { }</span>
-<span class="lineNum">      99 </span>                : 
-<span class="lineNum">     100 </span><span class="lineCov">         934618 :       allocator(const allocator&amp; __a) throw()</span>
-<span class="lineNum">     101 </span><span class="lineCov">         934618 :       : __glibcxx_base_allocator&lt;_Tp&gt;(__a) { }</span>
-<span class="lineNum">     102 </span>                : 
-<span class="lineNum">     103 </span>                :       template&lt;typename _Tp1&gt;
-<span class="lineNum">     104 </span><span class="lineCov">       11289504 :         allocator(const allocator&lt;_Tp1&gt;&amp;) throw() { }</span>
-<span class="lineNum">     105 </span>                : 
-<span class="lineNum">     106 </span><span class="lineCov">       12615289 :       ~allocator() throw() { }</span>
-<span class="lineNum">     107 </span>                : 
-<span class="lineNum">     108 </span>                :       // Inherit everything else.
-<span class="lineNum">     109 </span>                :     };
-<span class="lineNum">     110 </span>                : 
-<span class="lineNum">     111 </span>                :   template&lt;typename _T1, typename _T2&gt;
-<span class="lineNum">     112 </span>                :     inline bool
-<span class="lineNum">     113 </span>                :     operator==(const allocator&lt;_T1&gt;&amp;, const allocator&lt;_T2&gt;&amp;)
-<span class="lineNum">     114 </span>                :     { return true; }
-<span class="lineNum">     115 </span>                : 
-<span class="lineNum">     116 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     117 </span>                :     inline bool
-<span class="lineNum">     118 </span><span class="lineNoCov">              0 :     operator==(const allocator&lt;_Tp&gt;&amp;, const allocator&lt;_Tp&gt;&amp;)</span>
-<span class="lineNum">     119 </span><span class="lineNoCov">              0 :     { return true; }</span>
-<span class="lineNum">     120 </span>                : 
-<span class="lineNum">     121 </span>                :   template&lt;typename _T1, typename _T2&gt;
-<span class="lineNum">     122 </span>                :     inline bool
-<span class="lineNum">     123 </span>                :     operator!=(const allocator&lt;_T1&gt;&amp;, const allocator&lt;_T2&gt;&amp;)
-<span class="lineNum">     124 </span>                :     { return false; }
-<span class="lineNum">     125 </span>                : 
-<span class="lineNum">     126 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     127 </span>                :     inline bool
-<span class="lineNum">     128 </span>                :     operator!=(const allocator&lt;_Tp&gt;&amp;, const allocator&lt;_Tp&gt;&amp;)
-<span class="lineNum">     129 </span>                :     { return false; }
-<span class="lineNum">     130 </span>                : 
-<span class="lineNum">     131 </span>                :   // Inhibit implicit instantiations for required instantiations,
-<span class="lineNum">     132 </span>                :   // which are defined via explicit instantiations elsewhere.
-<span class="lineNum">     133 </span>                :   // NB: This syntax is a GNU extension.
-<span class="lineNum">     134 </span>                : #if _GLIBCXX_EXTERN_TEMPLATE
-<span class="lineNum">     135 </span>                :   extern template class allocator&lt;char&gt;;
-<span class="lineNum">     136 </span>                :   extern template class allocator&lt;wchar_t&gt;;
-<span class="lineNum">     137 </span>                : #endif
-<span class="lineNum">     138 </span>                : 
-<span class="lineNum">     139 </span>                :   // Undefine.
-<span class="lineNum">     140 </span>                : #undef __glibcxx_base_allocator
-<span class="lineNum">     141 </span>                : 
-<span class="lineNum">     142 </span>                :   // To implement Option 3 of DR 431.
-<span class="lineNum">     143 </span>                :   template&lt;typename _Alloc, bool = __is_empty(_Alloc)&gt;
-<span class="lineNum">     144 </span>                :     struct __alloc_swap
-<span class="lineNum">     145 </span>                :     { static void _S_do_it(_Alloc&amp;, _Alloc&amp;) { } };
-<span class="lineNum">     146 </span>                : 
-<span class="lineNum">     147 </span>                :   template&lt;typename _Alloc&gt;
-<span class="lineNum">     148 </span>                :     struct __alloc_swap&lt;_Alloc, false&gt;
-<span class="lineNum">     149 </span>                :     {
-<span class="lineNum">     150 </span>                :       static void
-<span class="lineNum">     151 </span>                :       _S_do_it(_Alloc&amp; __one, _Alloc&amp; __two)
-<span class="lineNum">     152 </span>                :       {
-<span class="lineNum">     153 </span>                :         // Precondition: swappable allocators.
-<span class="lineNum">     154 </span>                :         if (__one != __two)
-<span class="lineNum">     155 </span>                :           swap(__one, __two);
-<span class="lineNum">     156 </span>                :       }
-<span class="lineNum">     157 </span>                :     };
-<span class="lineNum">     158 </span>                : 
-<span class="lineNum">     159 </span>                :   // Optimize for stateless allocators.
-<span class="lineNum">     160 </span>                :   template&lt;typename _Alloc, bool = __is_empty(_Alloc)&gt;
-<span class="lineNum">     161 </span>                :     struct __alloc_neq
-<span class="lineNum">     162 </span>                :     {
-<span class="lineNum">     163 </span>                :       static bool
-<span class="lineNum">     164 </span>                :       _S_do_it(const _Alloc&amp;, const _Alloc&amp;)
-<span class="lineNum">     165 </span>                :       { return false; }
-<span class="lineNum">     166 </span>                :     };
-<span class="lineNum">     167 </span>                : 
-<span class="lineNum">     168 </span>                :   template&lt;typename _Alloc&gt;
-<span class="lineNum">     169 </span>                :     struct __alloc_neq&lt;_Alloc, false&gt;
-<span class="lineNum">     170 </span>                :     {
-<span class="lineNum">     171 </span>                :       static bool
-<span class="lineNum">     172 </span>                :       _S_do_it(const _Alloc&amp; __one, const _Alloc&amp; __two)
-<span class="lineNum">     173 </span>                :       { return __one != __two; }
-<span class="lineNum">     174 </span>                :     };
-<span class="lineNum">     175 </span>                : 
-<span class="lineNum">     176 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">     177 </span>                : 
-<span class="lineNum">     178 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/bits/basic_ios.h.gcov.html b/rep/usr/include/c++/4.3/bits/basic_ios.h.gcov.html
deleted file mode 100644
index a436d4e..0000000
--- a/rep/usr/include/c++/4.3/bits/basic_ios.h.gcov.html
+++ /dev/null
@@ -1,545 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/basic_ios.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - basic_ios.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">35</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">0.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">0</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // Iostreams base classes -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005,
-<span class="lineNum">       4 </span>                : // 2006, 2007, 2008
-<span class="lineNum">       5 </span>                : // Free Software Foundation, Inc.
-<span class="lineNum">       6 </span>                : //
-<span class="lineNum">       7 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       8 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       9 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">      10 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      11 </span>                : // any later version.
-<span class="lineNum">      12 </span>                : 
-<span class="lineNum">      13 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      14 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      15 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      16 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      17 </span>                : 
-<span class="lineNum">      18 </span>                : // You should have received a copy of the GNU General Public License along
-<span class="lineNum">      19 </span>                : // with this library; see the file COPYING.  If not, write to the Free
-<span class="lineNum">      20 </span>                : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-<span class="lineNum">      21 </span>                : // USA.
-<span class="lineNum">      22 </span>                : 
-<span class="lineNum">      23 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      24 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      25 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      26 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      27 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      28 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      29 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      30 </span>                : // the GNU General Public License.
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span>                : /** @file basic_ios.h
-<span class="lineNum">      33 </span>                :  *  This is an internal header file, included by other library headers.
-<span class="lineNum">      34 </span>                :  *  You should not attempt to use it directly.
-<span class="lineNum">      35 </span>                :  */
-<span class="lineNum">      36 </span>                : 
-<span class="lineNum">      37 </span>                : #ifndef _BASIC_IOS_H
-<span class="lineNum">      38 </span>                : #define _BASIC_IOS_H 1
-<span class="lineNum">      39 </span>                : 
-<span class="lineNum">      40 </span>                : #pragma GCC system_header
-<span class="lineNum">      41 </span>                : 
-<span class="lineNum">      42 </span>                : #include &lt;bits/localefwd.h&gt;
-<span class="lineNum">      43 </span>                : #include &lt;bits/locale_classes.h&gt;
-<span class="lineNum">      44 </span>                : #include &lt;bits/locale_facets.h&gt;
-<span class="lineNum">      45 </span>                : #include &lt;bits/streambuf_iterator.h&gt;
-<span class="lineNum">      46 </span>                : 
-<span class="lineNum">      47 </span>                : _GLIBCXX_BEGIN_NAMESPACE(std)
-<span class="lineNum">      48 </span>                : 
-<span class="lineNum">      49 </span>                :   template&lt;typename _Facet&gt;
-<span class="lineNum">      50 </span>                :     inline const _Facet&amp;
-<span class="lineNum">      51 </span><span class="lineNoCov">              0 :     __check_facet(const _Facet* __f)</span>
-<span class="lineNum">      52 </span>                :     {
-<span class="lineNum">      53 </span><span class="lineNoCov">              0 :       if (!__f)</span>
-<span class="lineNum">      54 </span><span class="lineNoCov">              0 :         __throw_bad_cast();</span>
-<span class="lineNum">      55 </span><span class="lineNoCov">              0 :       return *__f;</span>
-<span class="lineNum">      56 </span>                :     }
-<span class="lineNum">      57 </span>                : 
-<span class="lineNum">      58 </span>                :   // 27.4.5  Template class basic_ios
-<span class="lineNum">      59 </span>                :   /**
-<span class="lineNum">      60 </span>                :    *  @brief  Virtual base class for all stream classes.
-<span class="lineNum">      61 </span>                :    *
-<span class="lineNum">      62 </span>                :    *  Most of the member functions called dispatched on stream objects
-<span class="lineNum">      63 </span>                :    *  (e.g., @c std::cout.foo(bar);) are consolidated in this class.
-<span class="lineNum">      64 </span>                :   */
-<span class="lineNum">      65 </span>                :   template&lt;typename _CharT, typename _Traits&gt;
-<span class="lineNum">      66 </span>                :     class basic_ios : public ios_base
-<span class="lineNum">      67 </span>                :     {
-<span class="lineNum">      68 </span>                :     public:
-<span class="lineNum">      69 </span>                :       //@{
-<span class="lineNum">      70 </span>                :       /**
-<span class="lineNum">      71 </span>                :        *  These are standard types.  They permit a standardized way of
-<span class="lineNum">      72 </span>                :        *  referring to names of (or names dependant on) the template
-<span class="lineNum">      73 </span>                :        *  parameters, which are specific to the implementation.
-<span class="lineNum">      74 </span>                :       */
-<span class="lineNum">      75 </span>                :       typedef _CharT                                 char_type;
-<span class="lineNum">      76 </span>                :       typedef typename _Traits::int_type             int_type;
-<span class="lineNum">      77 </span>                :       typedef typename _Traits::pos_type             pos_type;
-<span class="lineNum">      78 </span>                :       typedef typename _Traits::off_type             off_type;
-<span class="lineNum">      79 </span>                :       typedef _Traits                                traits_type;
-<span class="lineNum">      80 </span>                :       //@}
-<span class="lineNum">      81 </span>                : 
-<span class="lineNum">      82 </span>                :       //@{
-<span class="lineNum">      83 </span>                :       /**
-<span class="lineNum">      84 </span>                :        *  These are non-standard types.
-<span class="lineNum">      85 </span>                :       */
-<span class="lineNum">      86 </span>                :       typedef ctype&lt;_CharT&gt;                          __ctype_type;
-<span class="lineNum">      87 </span>                :       typedef num_put&lt;_CharT, ostreambuf_iterator&lt;_CharT, _Traits&gt; &gt;
-<span class="lineNum">      88 </span>                :                                                      __num_put_type;
-<span class="lineNum">      89 </span>                :       typedef num_get&lt;_CharT, istreambuf_iterator&lt;_CharT, _Traits&gt; &gt;
-<span class="lineNum">      90 </span>                :                                                      __num_get_type;
-<span class="lineNum">      91 </span>                :       //@}
-<span class="lineNum">      92 </span>                : 
-<span class="lineNum">      93 </span>                :       // Data members:
-<span class="lineNum">      94 </span>                :     protected:
-<span class="lineNum">      95 </span>                :       basic_ostream&lt;_CharT, _Traits&gt;*                _M_tie;
-<span class="lineNum">      96 </span>                :       mutable char_type                              _M_fill;
-<span class="lineNum">      97 </span>                :       mutable bool                                   _M_fill_init;
-<span class="lineNum">      98 </span>                :       basic_streambuf&lt;_CharT, _Traits&gt;*              _M_streambuf;
-<span class="lineNum">      99 </span>                : 
-<span class="lineNum">     100 </span>                :       // Cached use_facet&lt;ctype&gt;, which is based on the current locale info.
-<span class="lineNum">     101 </span>                :       const __ctype_type*                            _M_ctype;
-<span class="lineNum">     102 </span>                :       // For ostream.
-<span class="lineNum">     103 </span>                :       const __num_put_type*                          _M_num_put;
-<span class="lineNum">     104 </span>                :       // For istream.
-<span class="lineNum">     105 </span>                :       const __num_get_type*                          _M_num_get;
-<span class="lineNum">     106 </span>                : 
-<span class="lineNum">     107 </span>                :     public:
-<span class="lineNum">     108 </span>                :       //@{
-<span class="lineNum">     109 </span>                :       /**
-<span class="lineNum">     110 </span>                :        *  @brief  The quick-and-easy status check.
-<span class="lineNum">     111 </span>                :        *
-<span class="lineNum">     112 </span>                :        *  This allows you to write constructs such as
-<span class="lineNum">     113 </span>                :        *  &quot;if (!a_stream) ...&quot; and &quot;while (a_stream) ...&quot;
-<span class="lineNum">     114 </span>                :       */
-<span class="lineNum">     115 </span><span class="lineNoCov">              0 :       operator void*() const</span>
-<span class="lineNum">     116 </span><span class="lineNoCov">              0 :       { return this-&gt;fail() ? 0 : const_cast&lt;basic_ios*&gt;(this); }</span>
-<span class="lineNum">     117 </span>                : 
-<span class="lineNum">     118 </span>                :       bool
-<span class="lineNum">     119 </span><span class="lineNoCov">              0 :       operator!() const</span>
-<span class="lineNum">     120 </span><span class="lineNoCov">              0 :       { return this-&gt;fail(); }</span>
-<span class="lineNum">     121 </span>                :       //@}
-<span class="lineNum">     122 </span>                : 
-<span class="lineNum">     123 </span>                :       /**
-<span class="lineNum">     124 </span>                :        *  @brief  Returns the error state of the stream buffer.
-<span class="lineNum">     125 </span>                :        *  @return  A bit pattern (well, isn't everything?)
-<span class="lineNum">     126 </span>                :        *
-<span class="lineNum">     127 </span>                :        *  See std::ios_base::iostate for the possible bit values.  Most
-<span class="lineNum">     128 </span>                :        *  users will call one of the interpreting wrappers, e.g., good().
-<span class="lineNum">     129 </span>                :       */
-<span class="lineNum">     130 </span>                :       iostate
-<span class="lineNum">     131 </span><span class="lineNoCov">              0 :       rdstate() const</span>
-<span class="lineNum">     132 </span><span class="lineNoCov">              0 :       { return _M_streambuf_state; }</span>
-<span class="lineNum">     133 </span>                : 
-<span class="lineNum">     134 </span>                :       /**
-<span class="lineNum">     135 </span>                :        *  @brief  [Re]sets the error state.
-<span class="lineNum">     136 </span>                :        *  @param  state  The new state flag(s) to set.
-<span class="lineNum">     137 </span>                :        *
-<span class="lineNum">     138 </span>                :        *  See std::ios_base::iostate for the possible bit values.  Most
-<span class="lineNum">     139 </span>                :        *  users will not need to pass an argument.
-<span class="lineNum">     140 </span>                :       */
-<span class="lineNum">     141 </span>                :       void
-<span class="lineNum">     142 </span>                :       clear(iostate __state = goodbit);
-<span class="lineNum">     143 </span>                : 
-<span class="lineNum">     144 </span>                :       /**
-<span class="lineNum">     145 </span>                :        *  @brief  Sets additional flags in the error state.
-<span class="lineNum">     146 </span>                :        *  @param  state  The additional state flag(s) to set.
-<span class="lineNum">     147 </span>                :        *
-<span class="lineNum">     148 </span>                :        *  See std::ios_base::iostate for the possible bit values.
-<span class="lineNum">     149 </span>                :       */
-<span class="lineNum">     150 </span>                :       void
-<span class="lineNum">     151 </span><span class="lineNoCov">              0 :       setstate(iostate __state)</span>
-<span class="lineNum">     152 </span><span class="lineNoCov">              0 :       { this-&gt;clear(this-&gt;rdstate() | __state); }</span>
-<span class="lineNum">     153 </span>                : 
-<span class="lineNum">     154 </span>                :       // Flip the internal state on for the proper state bits, then re
-<span class="lineNum">     155 </span>                :       // throws the propagated exception if bit also set in
-<span class="lineNum">     156 </span>                :       // exceptions().
-<span class="lineNum">     157 </span>                :       void
-<span class="lineNum">     158 </span>                :       _M_setstate(iostate __state)
-<span class="lineNum">     159 </span>                :       {
-<span class="lineNum">     160 </span>                :         // 27.6.1.2.1 Common requirements.
-<span class="lineNum">     161 </span>                :         // Turn this on without causing an ios::failure to be thrown.
-<span class="lineNum">     162 </span>                :         _M_streambuf_state |= __state;
-<span class="lineNum">     163 </span>                :         if (this-&gt;exceptions() &amp; __state)
-<span class="lineNum">     164 </span>                :           __throw_exception_again;
-<span class="lineNum">     165 </span>                :       }
-<span class="lineNum">     166 </span>                : 
-<span class="lineNum">     167 </span>                :       /**
-<span class="lineNum">     168 </span>                :        *  @brief  Fast error checking.
-<span class="lineNum">     169 </span>                :        *  @return  True if no error flags are set.
-<span class="lineNum">     170 </span>                :        *
-<span class="lineNum">     171 </span>                :        *  A wrapper around rdstate.
-<span class="lineNum">     172 </span>                :       */
-<span class="lineNum">     173 </span>                :       bool
-<span class="lineNum">     174 </span><span class="lineNoCov">              0 :       good() const</span>
-<span class="lineNum">     175 </span><span class="lineNoCov">              0 :       { return this-&gt;rdstate() == 0; }</span>
-<span class="lineNum">     176 </span>                : 
-<span class="lineNum">     177 </span>                :       /**
-<span class="lineNum">     178 </span>                :        *  @brief  Fast error checking.
-<span class="lineNum">     179 </span>                :        *  @return  True if the eofbit is set.
-<span class="lineNum">     180 </span>                :        *
-<span class="lineNum">     181 </span>                :        *  Note that other iostate flags may also be set.
-<span class="lineNum">     182 </span>                :       */
-<span class="lineNum">     183 </span>                :       bool
-<span class="lineNum">     184 </span><span class="lineNoCov">              0 :       eof() const</span>
-<span class="lineNum">     185 </span><span class="lineNoCov">              0 :       { return (this-&gt;rdstate() &amp; eofbit) != 0; }</span>
-<span class="lineNum">     186 </span>                : 
-<span class="lineNum">     187 </span>                :       /**
-<span class="lineNum">     188 </span>                :        *  @brief  Fast error checking.
-<span class="lineNum">     189 </span>                :        *  @return  True if either the badbit or the failbit is set.
-<span class="lineNum">     190 </span>                :        *
-<span class="lineNum">     191 </span>                :        *  Checking the badbit in fail() is historical practice.
-<span class="lineNum">     192 </span>                :        *  Note that other iostate flags may also be set.
-<span class="lineNum">     193 </span>                :       */
-<span class="lineNum">     194 </span>                :       bool
-<span class="lineNum">     195 </span><span class="lineNoCov">              0 :       fail() const</span>
-<span class="lineNum">     196 </span><span class="lineNoCov">              0 :       { return (this-&gt;rdstate() &amp; (badbit | failbit)) != 0; }</span>
-<span class="lineNum">     197 </span>                : 
-<span class="lineNum">     198 </span>                :       /**
-<span class="lineNum">     199 </span>                :        *  @brief  Fast error checking.
-<span class="lineNum">     200 </span>                :        *  @return  True if the badbit is set.
-<span class="lineNum">     201 </span>                :        *
-<span class="lineNum">     202 </span>                :        *  Note that other iostate flags may also be set.
-<span class="lineNum">     203 </span>                :       */
-<span class="lineNum">     204 </span>                :       bool
-<span class="lineNum">     205 </span>                :       bad() const
-<span class="lineNum">     206 </span>                :       { return (this-&gt;rdstate() &amp; badbit) != 0; }
-<span class="lineNum">     207 </span>                : 
-<span class="lineNum">     208 </span>                :       /**
-<span class="lineNum">     209 </span>                :        *  @brief  Throwing exceptions on errors.
-<span class="lineNum">     210 </span>                :        *  @return  The current exceptions mask.
-<span class="lineNum">     211 </span>                :        *
-<span class="lineNum">     212 </span>                :        *  This changes nothing in the stream.  See the one-argument version
-<span class="lineNum">     213 </span>                :        *  of exceptions(iostate) for the meaning of the return value.
-<span class="lineNum">     214 </span>                :       */
-<span class="lineNum">     215 </span>                :       iostate
-<span class="lineNum">     216 </span>                :       exceptions() const
-<span class="lineNum">     217 </span>                :       { return _M_exception; }
-<span class="lineNum">     218 </span>                : 
-<span class="lineNum">     219 </span>                :       /**
-<span class="lineNum">     220 </span>                :        *  @brief  Throwing exceptions on errors.
-<span class="lineNum">     221 </span>                :        *  @param  except  The new exceptions mask.
-<span class="lineNum">     222 </span>                :        *
-<span class="lineNum">     223 </span>                :        *  By default, error flags are set silently.  You can set an
-<span class="lineNum">     224 </span>                :        *  exceptions mask for each stream; if a bit in the mask becomes set
-<span class="lineNum">     225 </span>                :        *  in the error flags, then an exception of type
-<span class="lineNum">     226 </span>                :        *  std::ios_base::failure is thrown.
-<span class="lineNum">     227 </span>                :        *
-<span class="lineNum">     228 </span>                :        *  If the error flag is already set when the exceptions mask is
-<span class="lineNum">     229 </span>                :        *  added, the exception is immediately thrown.  Try running the
-<span class="lineNum">     230 </span>                :        *  following under GCC 3.1 or later:
-<span class="lineNum">     231 </span>                :        *  @code
-<span class="lineNum">     232 </span>                :        *  #include &lt;iostream&gt;
-<span class="lineNum">     233 </span>                :        *  #include &lt;fstream&gt;
-<span class="lineNum">     234 </span>                :        *  #include &lt;exception&gt;
-<span class="lineNum">     235 </span>                :        *
-<span class="lineNum">     236 </span>                :        *  int main()
-<span class="lineNum">     237 </span>                :        *  {
-<span class="lineNum">     238 </span>                :        *      std::set_terminate (__gnu_cxx::__verbose_terminate_handler);
-<span class="lineNum">     239 </span>                :        *
-<span class="lineNum">     240 </span>                :        *      std::ifstream f (&quot;/etc/motd&quot;);
-<span class="lineNum">     241 </span>                :        *
-<span class="lineNum">     242 </span>                :        *      std::cerr &lt;&lt; &quot;Setting badbit\n&quot;;
-<span class="lineNum">     243 </span>                :        *      f.setstate (std::ios_base::badbit);
-<span class="lineNum">     244 </span>                :        *
-<span class="lineNum">     245 </span>                :        *      std::cerr &lt;&lt; &quot;Setting exception mask\n&quot;;
-<span class="lineNum">     246 </span>                :        *      f.exceptions (std::ios_base::badbit);
-<span class="lineNum">     247 </span>                :        *  }
-<span class="lineNum">     248 </span>                :        *  @endcode
-<span class="lineNum">     249 </span>                :       */
-<span class="lineNum">     250 </span>                :       void
-<span class="lineNum">     251 </span>                :       exceptions(iostate __except)
-<span class="lineNum">     252 </span>                :       {
-<span class="lineNum">     253 </span>                :         _M_exception = __except;
-<span class="lineNum">     254 </span>                :         this-&gt;clear(_M_streambuf_state);
-<span class="lineNum">     255 </span>                :       }
-<span class="lineNum">     256 </span>                : 
-<span class="lineNum">     257 </span>                :       // Constructor/destructor:
-<span class="lineNum">     258 </span>                :       /**
-<span class="lineNum">     259 </span>                :        *  @brief  Constructor performs initialization.
-<span class="lineNum">     260 </span>                :        *
-<span class="lineNum">     261 </span>                :        *  The parameter is passed by derived streams.
-<span class="lineNum">     262 </span>                :       */
-<span class="lineNum">     263 </span>                :       explicit
-<span class="lineNum">     264 </span>                :       basic_ios(basic_streambuf&lt;_CharT, _Traits&gt;* __sb)
-<span class="lineNum">     265 </span>                :       : ios_base(), _M_tie(0), _M_fill(), _M_fill_init(false), _M_streambuf(0),
-<span class="lineNum">     266 </span>                :         _M_ctype(0), _M_num_put(0), _M_num_get(0)
-<span class="lineNum">     267 </span>                :       { this-&gt;init(__sb); }
-<span class="lineNum">     268 </span>                : 
-<span class="lineNum">     269 </span>                :       /**
-<span class="lineNum">     270 </span>                :        *  @brief  Empty.
-<span class="lineNum">     271 </span>                :        *
-<span class="lineNum">     272 </span>                :        *  The destructor does nothing.  More specifically, it does not
-<span class="lineNum">     273 </span>                :        *  destroy the streambuf held by rdbuf().
-<span class="lineNum">     274 </span>                :       */
-<span class="lineNum">     275 </span>                :       virtual
-<span class="lineNum">     276 </span><span class="lineNoCov">              0 :       ~basic_ios() { }</span>
-<span class="lineNum">     277 </span>                : 
-<span class="lineNum">     278 </span>                :       // Members:
-<span class="lineNum">     279 </span>                :       /**
-<span class="lineNum">     280 </span>                :        *  @brief  Fetches the current @e tied stream.
-<span class="lineNum">     281 </span>                :        *  @return  A pointer to the tied stream, or NULL if the stream is
-<span class="lineNum">     282 </span>                :        *           not tied.
-<span class="lineNum">     283 </span>                :        *
-<span class="lineNum">     284 </span>                :        *  A stream may be @e tied (or synchronized) to a second output
-<span class="lineNum">     285 </span>                :        *  stream.  When this stream performs any I/O, the tied stream is
-<span class="lineNum">     286 </span>                :        *  first flushed.  For example, @c std::cin is tied to @c std::cout.
-<span class="lineNum">     287 </span>                :       */
-<span class="lineNum">     288 </span>                :       basic_ostream&lt;_CharT, _Traits&gt;*
-<span class="lineNum">     289 </span>                :       tie() const
-<span class="lineNum">     290 </span>                :       { return _M_tie; }
-<span class="lineNum">     291 </span>                : 
-<span class="lineNum">     292 </span>                :       /**
-<span class="lineNum">     293 </span>                :        *  @brief  Ties this stream to an output stream.
-<span class="lineNum">     294 </span>                :        *  @param  tiestr  The output stream.
-<span class="lineNum">     295 </span>                :        *  @return  The previously tied output stream, or NULL if the stream
-<span class="lineNum">     296 </span>                :        *           was not tied.
-<span class="lineNum">     297 </span>                :        *
-<span class="lineNum">     298 </span>                :        *  This sets up a new tie; see tie() for more.
-<span class="lineNum">     299 </span>                :       */
-<span class="lineNum">     300 </span>                :       basic_ostream&lt;_CharT, _Traits&gt;*
-<span class="lineNum">     301 </span>                :       tie(basic_ostream&lt;_CharT, _Traits&gt;* __tiestr)
-<span class="lineNum">     302 </span>                :       {
-<span class="lineNum">     303 </span>                :         basic_ostream&lt;_CharT, _Traits&gt;* __old = _M_tie;
-<span class="lineNum">     304 </span>                :         _M_tie = __tiestr;
-<span class="lineNum">     305 </span>                :         return __old;
-<span class="lineNum">     306 </span>                :       }
-<span class="lineNum">     307 </span>                : 
-<span class="lineNum">     308 </span>                :       /**
-<span class="lineNum">     309 </span>                :        *  @brief  Accessing the underlying buffer.
-<span class="lineNum">     310 </span>                :        *  @return  The current stream buffer.
-<span class="lineNum">     311 </span>                :        *
-<span class="lineNum">     312 </span>                :        *  This does not change the state of the stream.
-<span class="lineNum">     313 </span>                :       */
-<span class="lineNum">     314 </span>                :       basic_streambuf&lt;_CharT, _Traits&gt;*
-<span class="lineNum">     315 </span><span class="lineNoCov">              0 :       rdbuf() const</span>
-<span class="lineNum">     316 </span><span class="lineNoCov">              0 :       { return _M_streambuf; }</span>
-<span class="lineNum">     317 </span>                : 
-<span class="lineNum">     318 </span>                :       /**
-<span class="lineNum">     319 </span>                :        *  @brief  Changing the underlying buffer.
-<span class="lineNum">     320 </span>                :        *  @param  sb  The new stream buffer.
-<span class="lineNum">     321 </span>                :        *  @return  The previous stream buffer.
-<span class="lineNum">     322 </span>                :        *
-<span class="lineNum">     323 </span>                :        *  Associates a new buffer with the current stream, and clears the
-<span class="lineNum">     324 </span>                :        *  error state.
-<span class="lineNum">     325 </span>                :        *
-<span class="lineNum">     326 </span>                :        *  Due to historical accidents which the LWG refuses to correct, the
-<span class="lineNum">     327 </span>                :        *  I/O library suffers from a design error:  this function is hidden
-<span class="lineNum">     328 </span>                :        *  in derived classes by overrides of the zero-argument @c rdbuf(),
-<span class="lineNum">     329 </span>                :        *  which is non-virtual for hysterical raisins.  As a result, you
-<span class="lineNum">     330 </span>                :        *  must use explicit qualifications to access this function via any
-<span class="lineNum">     331 </span>                :        *  derived class.  For example:
-<span class="lineNum">     332 </span>                :        *
-<span class="lineNum">     333 </span>                :        *  @code
-<span class="lineNum">     334 </span>                :        *  std::fstream     foo;         // or some other derived type
-<span class="lineNum">     335 </span>                :        *  std::streambuf*  p = .....;
-<span class="lineNum">     336 </span>                :        *
-<span class="lineNum">     337 </span>                :        *  foo.ios::rdbuf(p);            // ios == basic_ios&lt;char&gt;
-<span class="lineNum">     338 </span>                :        *  @endcode
-<span class="lineNum">     339 </span>                :       */
-<span class="lineNum">     340 </span>                :       basic_streambuf&lt;_CharT, _Traits&gt;*
-<span class="lineNum">     341 </span>                :       rdbuf(basic_streambuf&lt;_CharT, _Traits&gt;* __sb);
-<span class="lineNum">     342 </span>                : 
-<span class="lineNum">     343 </span>                :       /**
-<span class="lineNum">     344 </span>                :        *  @brief  Copies fields of __rhs into this.
-<span class="lineNum">     345 </span>                :        *  @param  __rhs  The source values for the copies.
-<span class="lineNum">     346 </span>                :        *  @return  Reference to this object.
-<span class="lineNum">     347 </span>                :        *
-<span class="lineNum">     348 </span>                :        *  All fields of __rhs are copied into this object except that rdbuf()
-<span class="lineNum">     349 </span>                :        *  and rdstate() remain unchanged.  All values in the pword and iword
-<span class="lineNum">     350 </span>                :        *  arrays are copied.  Before copying, each callback is invoked with
-<span class="lineNum">     351 </span>                :        *  erase_event.  After copying, each (new) callback is invoked with
-<span class="lineNum">     352 </span>                :        *  copyfmt_event.  The final step is to copy exceptions().
-<span class="lineNum">     353 </span>                :       */
-<span class="lineNum">     354 </span>                :       basic_ios&amp;
-<span class="lineNum">     355 </span>                :       copyfmt(const basic_ios&amp; __rhs);
-<span class="lineNum">     356 </span>                : 
-<span class="lineNum">     357 </span>                :       /**
-<span class="lineNum">     358 </span>                :        *  @brief  Retrieves the &quot;empty&quot; character.
-<span class="lineNum">     359 </span>                :        *  @return  The current fill character.
-<span class="lineNum">     360 </span>                :        *
-<span class="lineNum">     361 </span>                :        *  It defaults to a space (' ') in the current locale.
-<span class="lineNum">     362 </span>                :       */
-<span class="lineNum">     363 </span>                :       char_type
-<span class="lineNum">     364 </span><span class="lineNoCov">              0 :       fill() const</span>
-<span class="lineNum">     365 </span>                :       {
-<span class="lineNum">     366 </span><span class="lineNoCov">              0 :         if (!_M_fill_init)</span>
-<span class="lineNum">     367 </span>                :           {
-<span class="lineNum">     368 </span><span class="lineNoCov">              0 :             _M_fill = this-&gt;widen(' ');</span>
-<span class="lineNum">     369 </span><span class="lineNoCov">              0 :             _M_fill_init = true;</span>
-<span class="lineNum">     370 </span>                :           }
-<span class="lineNum">     371 </span><span class="lineNoCov">              0 :         return _M_fill;</span>
-<span class="lineNum">     372 </span>                :       }
-<span class="lineNum">     373 </span>                : 
-<span class="lineNum">     374 </span>                :       /**
-<span class="lineNum">     375 </span>                :        *  @brief  Sets a new &quot;empty&quot; character.
-<span class="lineNum">     376 </span>                :        *  @param  ch  The new character.
-<span class="lineNum">     377 </span>                :        *  @return  The previous fill character.
-<span class="lineNum">     378 </span>                :        *
-<span class="lineNum">     379 </span>                :        *  The fill character is used to fill out space when P+ characters
-<span class="lineNum">     380 </span>                :        *  have been requested (e.g., via setw), Q characters are actually
-<span class="lineNum">     381 </span>                :        *  used, and Q&lt;P.  It defaults to a space (' ') in the current locale.
-<span class="lineNum">     382 </span>                :       */
-<span class="lineNum">     383 </span>                :       char_type
-<span class="lineNum">     384 </span><span class="lineNoCov">              0 :       fill(char_type __ch)</span>
-<span class="lineNum">     385 </span>                :       {
-<span class="lineNum">     386 </span><span class="lineNoCov">              0 :         char_type __old = this-&gt;fill();</span>
-<span class="lineNum">     387 </span><span class="lineNoCov">              0 :         _M_fill = __ch;</span>
-<span class="lineNum">     388 </span><span class="lineNoCov">              0 :         return __old;</span>
-<span class="lineNum">     389 </span>                :       }
-<span class="lineNum">     390 </span>                : 
-<span class="lineNum">     391 </span>                :       // Locales:
-<span class="lineNum">     392 </span>                :       /**
-<span class="lineNum">     393 </span>                :        *  @brief  Moves to a new locale.
-<span class="lineNum">     394 </span>                :        *  @param  loc  The new locale.
-<span class="lineNum">     395 </span>                :        *  @return  The previous locale.
-<span class="lineNum">     396 </span>                :        *
-<span class="lineNum">     397 </span>                :        *  Calls @c ios_base::imbue(loc), and if a stream buffer is associated
-<span class="lineNum">     398 </span>                :        *  with this stream, calls that buffer's @c pubimbue(loc).
-<span class="lineNum">     399 </span>                :        *
-<span class="lineNum">     400 </span>                :        *  Additional l10n notes are at
-<span class="lineNum">     401 </span>                :        *  http://gcc.gnu.org/onlinedocs/libstdc++/22_locale/howto.html
-<span class="lineNum">     402 </span>                :       */
-<span class="lineNum">     403 </span>                :       locale
-<span class="lineNum">     404 </span>                :       imbue(const locale&amp; __loc);
-<span class="lineNum">     405 </span>                : 
-<span class="lineNum">     406 </span>                :       /**
-<span class="lineNum">     407 </span>                :        *  @brief  Squeezes characters.
-<span class="lineNum">     408 </span>                :        *  @param  c  The character to narrow.
-<span class="lineNum">     409 </span>                :        *  @param  dfault  The character to narrow.
-<span class="lineNum">     410 </span>                :        *  @return  The narrowed character.
-<span class="lineNum">     411 </span>                :        *
-<span class="lineNum">     412 </span>                :        *  Maps a character of @c char_type to a character of @c char,
-<span class="lineNum">     413 </span>                :        *  if possible.
-<span class="lineNum">     414 </span>                :        *
-<span class="lineNum">     415 </span>                :        *  Returns the result of
-<span class="lineNum">     416 </span>                :        *  @code
-<span class="lineNum">     417 </span>                :        *    std::use_facet&lt;ctype&lt;char_type&gt; &gt;(getloc()).narrow(c,dfault)
-<span class="lineNum">     418 </span>                :        *  @endcode
-<span class="lineNum">     419 </span>                :        *
-<span class="lineNum">     420 </span>                :        *  Additional l10n notes are at
-<span class="lineNum">     421 </span>                :        *  http://gcc.gnu.org/onlinedocs/libstdc++/22_locale/howto.html
-<span class="lineNum">     422 </span>                :       */
-<span class="lineNum">     423 </span>                :       char
-<span class="lineNum">     424 </span>                :       narrow(char_type __c, char __dfault) const
-<span class="lineNum">     425 </span>                :       { return __check_facet(_M_ctype).narrow(__c, __dfault); }
-<span class="lineNum">     426 </span>                : 
-<span class="lineNum">     427 </span>                :       /**
-<span class="lineNum">     428 </span>                :        *  @brief  Widens characters.
-<span class="lineNum">     429 </span>                :        *  @param  c  The character to widen.
-<span class="lineNum">     430 </span>                :        *  @return  The widened character.
-<span class="lineNum">     431 </span>                :        *
-<span class="lineNum">     432 </span>                :        *  Maps a character of @c char to a character of @c char_type.
-<span class="lineNum">     433 </span>                :        *
-<span class="lineNum">     434 </span>                :        *  Returns the result of
-<span class="lineNum">     435 </span>                :        *  @code
-<span class="lineNum">     436 </span>                :        *    std::use_facet&lt;ctype&lt;char_type&gt; &gt;(getloc()).widen(c)
-<span class="lineNum">     437 </span>                :        *  @endcode
-<span class="lineNum">     438 </span>                :        *
-<span class="lineNum">     439 </span>                :        *  Additional l10n notes are at
-<span class="lineNum">     440 </span>                :        *  http://gcc.gnu.org/onlinedocs/libstdc++/22_locale/howto.html
-<span class="lineNum">     441 </span>                :       */
-<span class="lineNum">     442 </span>                :       char_type
-<span class="lineNum">     443 </span><span class="lineNoCov">              0 :       widen(char __c) const</span>
-<span class="lineNum">     444 </span><span class="lineNoCov">              0 :       { return __check_facet(_M_ctype).widen(__c); }</span>
-<span class="lineNum">     445 </span>                : 
-<span class="lineNum">     446 </span>                :     protected:
-<span class="lineNum">     447 </span>                :       // 27.4.5.1  basic_ios constructors
-<span class="lineNum">     448 </span>                :       /**
-<span class="lineNum">     449 </span>                :        *  @brief  Empty.
-<span class="lineNum">     450 </span>                :        *
-<span class="lineNum">     451 </span>                :        *  The default constructor does nothing and is not normally
-<span class="lineNum">     452 </span>                :        *  accessible to users.
-<span class="lineNum">     453 </span>                :       */
-<span class="lineNum">     454 </span><span class="lineNoCov">              0 :       basic_ios()</span>
-<span class="lineNum">     455 </span>                :       : ios_base(), _M_tie(0), _M_fill(char_type()), _M_fill_init(false), 
-<span class="lineNum">     456 </span><span class="lineNoCov">              0 :         _M_streambuf(0), _M_ctype(0), _M_num_put(0), _M_num_get(0)</span>
-<span class="lineNum">     457 </span><span class="lineNoCov">              0 :       { }</span>
-<span class="lineNum">     458 </span>                : 
-<span class="lineNum">     459 </span>                :       /**
-<span class="lineNum">     460 </span>                :        *  @brief  All setup is performed here.
-<span class="lineNum">     461 </span>                :        *
-<span class="lineNum">     462 </span>                :        *  This is called from the public constructor.  It is not virtual and
-<span class="lineNum">     463 </span>                :        *  cannot be redefined.
-<span class="lineNum">     464 </span>                :       */
-<span class="lineNum">     465 </span>                :       void
-<span class="lineNum">     466 </span>                :       init(basic_streambuf&lt;_CharT, _Traits&gt;* __sb);
-<span class="lineNum">     467 </span>                : 
-<span class="lineNum">     468 </span>                :       void
-<span class="lineNum">     469 </span>                :       _M_cache_locale(const locale&amp; __loc);
-<span class="lineNum">     470 </span>                :     };
-<span class="lineNum">     471 </span>                : 
-<span class="lineNum">     472 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">     473 </span>                : 
-<span class="lineNum">     474 </span>                : #ifndef _GLIBCXX_EXPORT_TEMPLATE
-<span class="lineNum">     475 </span>                : #include &lt;bits/basic_ios.tcc&gt;
-<span class="lineNum">     476 </span>                : #endif
-<span class="lineNum">     477 </span>                : 
-<span class="lineNum">     478 </span>                : #endif /* _BASIC_IOS_H */
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/bits/basic_string.h.gcov.html b/rep/usr/include/c++/4.3/bits/basic_string.h.gcov.html
deleted file mode 100644
index 909cd58..0000000
--- a/rep/usr/include/c++/4.3/bits/basic_string.h.gcov.html
+++ /dev/null
@@ -1,2545 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/basic_string.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - basic_string.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">178</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">17.4 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">31</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // Components for manipulating sequences of characters -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005,
-<span class="lineNum">       4 </span>                : // 2006, 2007, 2008
-<span class="lineNum">       5 </span>                : // Free Software Foundation, Inc.
-<span class="lineNum">       6 </span>                : //
-<span class="lineNum">       7 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       8 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       9 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">      10 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      11 </span>                : // any later version.
-<span class="lineNum">      12 </span>                : 
-<span class="lineNum">      13 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      14 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      15 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      16 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      17 </span>                : 
-<span class="lineNum">      18 </span>                : // You should have received a copy of the GNU General Public License along
-<span class="lineNum">      19 </span>                : // with this library; see the file COPYING.  If not, write to the Free
-<span class="lineNum">      20 </span>                : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-<span class="lineNum">      21 </span>                : // USA.
-<span class="lineNum">      22 </span>                : 
-<span class="lineNum">      23 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      24 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      25 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      26 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      27 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      28 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      29 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      30 </span>                : // the GNU General Public License.
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span>                : /** @file basic_string.h
-<span class="lineNum">      33 </span>                :  *  This is an internal header file, included by other library headers.
-<span class="lineNum">      34 </span>                :  *  You should not attempt to use it directly.
-<span class="lineNum">      35 </span>                :  */
-<span class="lineNum">      36 </span>                : 
-<span class="lineNum">      37 </span>                : //
-<span class="lineNum">      38 </span>                : // ISO C++ 14882: 21 Strings library
-<span class="lineNum">      39 </span>                : //
-<span class="lineNum">      40 </span>                : 
-<span class="lineNum">      41 </span>                : #ifndef _BASIC_STRING_H
-<span class="lineNum">      42 </span>                : #define _BASIC_STRING_H 1
-<span class="lineNum">      43 </span>                : 
-<span class="lineNum">      44 </span>                : #pragma GCC system_header
-<span class="lineNum">      45 </span>                : 
-<span class="lineNum">      46 </span>                : #include &lt;ext/atomicity.h&gt;
-<span class="lineNum">      47 </span>                : #include &lt;debug/debug.h&gt;
-<span class="lineNum">      48 </span>                : 
-<span class="lineNum">      49 </span>                : _GLIBCXX_BEGIN_NAMESPACE(std)
-<span class="lineNum">      50 </span>                : 
-<span class="lineNum">      51 </span>                :   /**
-<span class="lineNum">      52 </span>                :    *  @class basic_string basic_string.h &lt;string&gt;
-<span class="lineNum">      53 </span>                :    *  @brief  Managing sequences of characters and character-like objects.
-<span class="lineNum">      54 </span>                :    *
-<span class="lineNum">      55 </span>                :    *  @ingroup Containers
-<span class="lineNum">      56 </span>                :    *  @ingroup Sequences
-<span class="lineNum">      57 </span>                :    *
-<span class="lineNum">      58 </span>                :    *  Meets the requirements of a &lt;a href=&quot;tables.html#65&quot;&gt;container&lt;/a&gt;, a
-<span class="lineNum">      59 </span>                :    *  &lt;a href=&quot;tables.html#66&quot;&gt;reversible container&lt;/a&gt;, and a
-<span class="lineNum">      60 </span>                :    *  &lt;a href=&quot;tables.html#67&quot;&gt;sequence&lt;/a&gt;.  Of the
-<span class="lineNum">      61 </span>                :    *  &lt;a href=&quot;tables.html#68&quot;&gt;optional sequence requirements&lt;/a&gt;, only
-<span class="lineNum">      62 </span>                :    *  @c push_back, @c at, and array access are supported.
-<span class="lineNum">      63 </span>                :    *
-<span class="lineNum">      64 </span>                :    *  @doctodo
-<span class="lineNum">      65 </span>                :    *
-<span class="lineNum">      66 </span>                :    *
-<span class="lineNum">      67 </span>                :    *  Documentation?  What's that?
-<span class="lineNum">      68 </span>                :    *  Nathan Myers &lt;ncm@cantrip.org&gt;.
-<span class="lineNum">      69 </span>                :    *
-<span class="lineNum">      70 </span>                :    *  A string looks like this:
-<span class="lineNum">      71 </span>                :    *
-<span class="lineNum">      72 </span>                :    *  @code
-<span class="lineNum">      73 </span>                :    *                                        [_Rep]
-<span class="lineNum">      74 </span>                :    *                                        _M_length
-<span class="lineNum">      75 </span>                :    *   [basic_string&lt;char_type&gt;]            _M_capacity
-<span class="lineNum">      76 </span>                :    *   _M_dataplus                          _M_refcount
-<span class="lineNum">      77 </span>                :    *   _M_p ----------------&gt;               unnamed array of char_type
-<span class="lineNum">      78 </span>                :    *  @endcode
-<span class="lineNum">      79 </span>                :    *
-<span class="lineNum">      80 </span>                :    *  Where the _M_p points to the first character in the string, and
-<span class="lineNum">      81 </span>                :    *  you cast it to a pointer-to-_Rep and subtract 1 to get a
-<span class="lineNum">      82 </span>                :    *  pointer to the header.
-<span class="lineNum">      83 </span>                :    *
-<span class="lineNum">      84 </span>                :    *  This approach has the enormous advantage that a string object
-<span class="lineNum">      85 </span>                :    *  requires only one allocation.  All the ugliness is confined
-<span class="lineNum">      86 </span>                :    *  within a single pair of inline functions, which each compile to
-<span class="lineNum">      87 </span>                :    *  a single &quot;add&quot; instruction: _Rep::_M_data(), and
-<span class="lineNum">      88 </span>                :    *  string::_M_rep(); and the allocation function which gets a
-<span class="lineNum">      89 </span>                :    *  block of raw bytes and with room enough and constructs a _Rep
-<span class="lineNum">      90 </span>                :    *  object at the front.
-<span class="lineNum">      91 </span>                :    *
-<span class="lineNum">      92 </span>                :    *  The reason you want _M_data pointing to the character array and
-<span class="lineNum">      93 </span>                :    *  not the _Rep is so that the debugger can see the string
-<span class="lineNum">      94 </span>                :    *  contents. (Probably we should add a non-inline member to get
-<span class="lineNum">      95 </span>                :    *  the _Rep for the debugger to use, so users can check the actual
-<span class="lineNum">      96 </span>                :    *  string length.)
-<span class="lineNum">      97 </span>                :    *
-<span class="lineNum">      98 </span>                :    *  Note that the _Rep object is a POD so that you can have a
-<span class="lineNum">      99 </span>                :    *  static &quot;empty string&quot; _Rep object already &quot;constructed&quot; before
-<span class="lineNum">     100 </span>                :    *  static constructors have run.  The reference-count encoding is
-<span class="lineNum">     101 </span>                :    *  chosen so that a 0 indicates one reference, so you never try to
-<span class="lineNum">     102 </span>                :    *  destroy the empty-string _Rep object.
-<span class="lineNum">     103 </span>                :    *
-<span class="lineNum">     104 </span>                :    *  All but the last paragraph is considered pretty conventional
-<span class="lineNum">     105 </span>                :    *  for a C++ string implementation.
-<span class="lineNum">     106 </span>                :   */
-<span class="lineNum">     107 </span>                :   // 21.3  Template class basic_string
-<span class="lineNum">     108 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     109 </span>                :     class basic_string
-<span class="lineNum">     110 </span>                :     {
-<span class="lineNum">     111 </span>                :       typedef typename _Alloc::template rebind&lt;_CharT&gt;::other _CharT_alloc_type;
-<span class="lineNum">     112 </span>                : 
-<span class="lineNum">     113 </span>                :       // Types:
-<span class="lineNum">     114 </span>                :     public:
-<span class="lineNum">     115 </span>                :       typedef _Traits                                       traits_type;
-<span class="lineNum">     116 </span>                :       typedef typename _Traits::char_type                   value_type;
-<span class="lineNum">     117 </span>                :       typedef _Alloc                                        allocator_type;
-<span class="lineNum">     118 </span>                :       typedef typename _CharT_alloc_type::size_type         size_type;
-<span class="lineNum">     119 </span>                :       typedef typename _CharT_alloc_type::difference_type   difference_type;
-<span class="lineNum">     120 </span>                :       typedef typename _CharT_alloc_type::reference         reference;
-<span class="lineNum">     121 </span>                :       typedef typename _CharT_alloc_type::const_reference   const_reference;
-<span class="lineNum">     122 </span>                :       typedef typename _CharT_alloc_type::pointer           pointer;
-<span class="lineNum">     123 </span>                :       typedef typename _CharT_alloc_type::const_pointer     const_pointer;
-<span class="lineNum">     124 </span>                :       typedef __gnu_cxx::__normal_iterator&lt;pointer, basic_string&gt;  iterator;
-<span class="lineNum">     125 </span>                :       typedef __gnu_cxx::__normal_iterator&lt;const_pointer, basic_string&gt;
-<span class="lineNum">     126 </span>                :                                                             const_iterator;
-<span class="lineNum">     127 </span>                :       typedef std::reverse_iterator&lt;const_iterator&gt;       const_reverse_iterator;
-<span class="lineNum">     128 </span>                :       typedef std::reverse_iterator&lt;iterator&gt;                 reverse_iterator;
-<span class="lineNum">     129 </span>                : 
-<span class="lineNum">     130 </span>                :     private:
-<span class="lineNum">     131 </span>                :       // _Rep: string representation
-<span class="lineNum">     132 </span>                :       //   Invariants:
-<span class="lineNum">     133 </span>                :       //   1. String really contains _M_length + 1 characters: due to 21.3.4
-<span class="lineNum">     134 </span>                :       //      must be kept null-terminated.
-<span class="lineNum">     135 </span>                :       //   2. _M_capacity &gt;= _M_length
-<span class="lineNum">     136 </span>                :       //      Allocated memory is always (_M_capacity + 1) * sizeof(_CharT).
-<span class="lineNum">     137 </span>                :       //   3. _M_refcount has three states:
-<span class="lineNum">     138 </span>                :       //      -1: leaked, one reference, no ref-copies allowed, non-const.
-<span class="lineNum">     139 </span>                :       //       0: one reference, non-const.
-<span class="lineNum">     140 </span>                :       //     n&gt;0: n + 1 references, operations require a lock, const.
-<span class="lineNum">     141 </span>                :       //   4. All fields==0 is an empty string, given the extra storage
-<span class="lineNum">     142 </span>                :       //      beyond-the-end for a null terminator; thus, the shared
-<span class="lineNum">     143 </span>                :       //      empty string representation needs no constructor.
-<span class="lineNum">     144 </span>                : 
-<span class="lineNum">     145 </span>                :       struct _Rep_base
-<span class="lineNum">     146 </span>                :       {
-<span class="lineNum">     147 </span>                :         size_type               _M_length;
-<span class="lineNum">     148 </span>                :         size_type               _M_capacity;
-<span class="lineNum">     149 </span>                :         _Atomic_word            _M_refcount;
-<span class="lineNum">     150 </span>                :       };
-<span class="lineNum">     151 </span>                : 
-<span class="lineNum">     152 </span>                :       struct _Rep : _Rep_base
-<span class="lineNum">     153 </span>                :       {
-<span class="lineNum">     154 </span>                :         // Types:
-<span class="lineNum">     155 </span>                :         typedef typename _Alloc::template rebind&lt;char&gt;::other _Raw_bytes_alloc;
-<span class="lineNum">     156 </span>                : 
-<span class="lineNum">     157 </span>                :         // (Public) Data members:
-<span class="lineNum">     158 </span>                : 
-<span class="lineNum">     159 </span>                :         // The maximum number of individual char_type elements of an
-<span class="lineNum">     160 </span>                :         // individual string is determined by _S_max_size. This is the
-<span class="lineNum">     161 </span>                :         // value that will be returned by max_size().  (Whereas npos
-<span class="lineNum">     162 </span>                :         // is the maximum number of bytes the allocator can allocate.)
-<span class="lineNum">     163 </span>                :         // If one was to divvy up the theoretical largest size string,
-<span class="lineNum">     164 </span>                :         // with a terminating character and m _CharT elements, it'd
-<span class="lineNum">     165 </span>                :         // look like this:
-<span class="lineNum">     166 </span>                :         // npos = sizeof(_Rep) + (m * sizeof(_CharT)) + sizeof(_CharT)
-<span class="lineNum">     167 </span>                :         // Solving for m:
-<span class="lineNum">     168 </span>                :         // m = ((npos - sizeof(_Rep))/sizeof(CharT)) - 1
-<span class="lineNum">     169 </span>                :         // In addition, this implementation quarters this amount.
-<span class="lineNum">     170 </span>                :         static const size_type  _S_max_size;
-<span class="lineNum">     171 </span>                :         static const _CharT     _S_terminal;
-<span class="lineNum">     172 </span>                : 
-<span class="lineNum">     173 </span>                :         // The following storage is init'd to 0 by the linker, resulting
-<span class="lineNum">     174 </span>                :         // (carefully) in an empty string with one reference.
-<span class="lineNum">     175 </span>                :         static size_type _S_empty_rep_storage[];
-<span class="lineNum">     176 </span>                : 
-<span class="lineNum">     177 </span>                :         static _Rep&amp;
-<span class="lineNum">     178 </span><span class="lineNoCov">              0 :         _S_empty_rep()</span>
-<span class="lineNum">     179 </span>                :         { 
-<span class="lineNum">     180 </span>                :           // NB: Mild hack to avoid strict-aliasing warnings.  Note that
-<span class="lineNum">     181 </span>                :           // _S_empty_rep_storage is never modified and the punning should
-<span class="lineNum">     182 </span>                :           // be reasonably safe in this case.
-<span class="lineNum">     183 </span><span class="lineNoCov">              0 :           void* __p = reinterpret_cast&lt;void*&gt;(&amp;_S_empty_rep_storage);</span>
-<span class="lineNum">     184 </span><span class="lineNoCov">              0 :           return *reinterpret_cast&lt;_Rep*&gt;(__p);</span>
-<span class="lineNum">     185 </span>                :         }
-<span class="lineNum">     186 </span>                : 
-<span class="lineNum">     187 </span>                :         bool
-<span class="lineNum">     188 </span><span class="lineNoCov">              0 :         _M_is_leaked() const</span>
-<span class="lineNum">     189 </span><span class="lineNoCov">              0 :         { return this-&gt;_M_refcount &lt; 0; }</span>
-<span class="lineNum">     190 </span>                : 
-<span class="lineNum">     191 </span>                :         bool
-<span class="lineNum">     192 </span><span class="lineNoCov">              0 :         _M_is_shared() const</span>
-<span class="lineNum">     193 </span><span class="lineNoCov">              0 :         { return this-&gt;_M_refcount &gt; 0; }</span>
-<span class="lineNum">     194 </span>                : 
-<span class="lineNum">     195 </span>                :         void
-<span class="lineNum">     196 </span><span class="lineNoCov">              0 :         _M_set_leaked()</span>
-<span class="lineNum">     197 </span><span class="lineNoCov">              0 :         { this-&gt;_M_refcount = -1; }</span>
-<span class="lineNum">     198 </span>                : 
-<span class="lineNum">     199 </span>                :         void
-<span class="lineNum">     200 </span><span class="lineNoCov">              0 :         _M_set_sharable()</span>
-<span class="lineNum">     201 </span><span class="lineNoCov">              0 :         { this-&gt;_M_refcount = 0; }</span>
-<span class="lineNum">     202 </span>                : 
-<span class="lineNum">     203 </span>                :         void
-<span class="lineNum">     204 </span><span class="lineNoCov">              0 :         _M_set_length_and_sharable(size_type __n)</span>
-<span class="lineNum">     205 </span>                :         { 
-<span class="lineNum">     206 </span><span class="lineNoCov">              0 :           this-&gt;_M_set_sharable();  // One reference.</span>
-<span class="lineNum">     207 </span><span class="lineNoCov">              0 :           this-&gt;_M_length = __n;</span>
-<span class="lineNum">     208 </span><span class="lineNoCov">              0 :           traits_type::assign(this-&gt;_M_refdata()[__n], _S_terminal);</span>
-<span class="lineNum">     209 </span>                :           // grrr. (per 21.3.4)
-<span class="lineNum">     210 </span>                :           // You cannot leave those LWG people alone for a second.
-<span class="lineNum">     211 </span><span class="lineNoCov">              0 :         }</span>
-<span class="lineNum">     212 </span>                : 
-<span class="lineNum">     213 </span>                :         _CharT*
-<span class="lineNum">     214 </span><span class="lineNoCov">              0 :         _M_refdata() throw()</span>
-<span class="lineNum">     215 </span><span class="lineNoCov">              0 :         { return reinterpret_cast&lt;_CharT*&gt;(this + 1); }</span>
-<span class="lineNum">     216 </span>                : 
-<span class="lineNum">     217 </span>                :         _CharT*
-<span class="lineNum">     218 </span>                :         _M_grab(const _Alloc&amp; __alloc1, const _Alloc&amp; __alloc2)
-<span class="lineNum">     219 </span>                :         {
-<span class="lineNum">     220 </span>                :           return (!_M_is_leaked() &amp;&amp; __alloc1 == __alloc2)
-<span class="lineNum">     221 </span>                :                   ? _M_refcopy() : _M_clone(__alloc1);
-<span class="lineNum">     222 </span>                :         }
-<span class="lineNum">     223 </span>                : 
-<span class="lineNum">     224 </span>                :         // Create &amp; Destroy
-<span class="lineNum">     225 </span>                :         static _Rep*
-<span class="lineNum">     226 </span>                :         _S_create(size_type, size_type, const _Alloc&amp;);
-<span class="lineNum">     227 </span>                : 
-<span class="lineNum">     228 </span>                :         void
-<span class="lineNum">     229 </span><span class="lineNoCov">              0 :         _M_dispose(const _Alloc&amp; __a)</span>
-<span class="lineNum">     230 </span>                :         {
-<span class="lineNum">     231 </span>                : #ifndef _GLIBCXX_FULLY_DYNAMIC_STRING
-<span class="lineNum">     232 </span><span class="lineNoCov">              0 :           if (__builtin_expect(this != &amp;_S_empty_rep(), false))</span>
-<span class="lineNum">     233 </span>                : #endif
-<span class="lineNum">     234 </span><span class="lineNoCov">              0 :             if (__gnu_cxx::__exchange_and_add_dispatch(&amp;this-&gt;_M_refcount,</span>
-<span class="lineNum">     235 </span>                :                                                        -1) &lt;= 0)
-<span class="lineNum">     236 </span><span class="lineNoCov">              0 :               _M_destroy(__a);</span>
-<span class="lineNum">     237 </span><span class="lineNoCov">              0 :         }  // XXX MT</span>
-<span class="lineNum">     238 </span>                : 
-<span class="lineNum">     239 </span>                :         void
-<span class="lineNum">     240 </span>                :         _M_destroy(const _Alloc&amp;) throw();
-<span class="lineNum">     241 </span>                : 
-<span class="lineNum">     242 </span>                :         _CharT*
-<span class="lineNum">     243 </span>                :         _M_refcopy() throw()
-<span class="lineNum">     244 </span>                :         {
-<span class="lineNum">     245 </span>                : #ifndef _GLIBCXX_FULLY_DYNAMIC_STRING
-<span class="lineNum">     246 </span>                :           if (__builtin_expect(this != &amp;_S_empty_rep(), false))
-<span class="lineNum">     247 </span>                : #endif
-<span class="lineNum">     248 </span>                :             __gnu_cxx::__atomic_add_dispatch(&amp;this-&gt;_M_refcount, 1);
-<span class="lineNum">     249 </span>                :           return _M_refdata();
-<span class="lineNum">     250 </span>                :         }  // XXX MT
-<span class="lineNum">     251 </span>                : 
-<span class="lineNum">     252 </span>                :         _CharT*
-<span class="lineNum">     253 </span>                :         _M_clone(const _Alloc&amp;, size_type __res = 0);
-<span class="lineNum">     254 </span>                :       };
-<span class="lineNum">     255 </span>                : 
-<span class="lineNum">     256 </span>                :       // Use empty-base optimization: http://www.cantrip.org/emptyopt.html
-<span class="lineNum">     257 </span>                :       struct _Alloc_hider : _Alloc
-<span class="lineNum">     258 </span><span class="lineNoCov">              0 :       {</span>
-<span class="lineNum">     259 </span><span class="lineNoCov">              0 :         _Alloc_hider(_CharT* __dat, const _Alloc&amp; __a)</span>
-<span class="lineNum">     260 </span><span class="lineNoCov">              0 :         : _Alloc(__a), _M_p(__dat) { }</span>
-<span class="lineNum">     261 </span>                : 
-<span class="lineNum">     262 </span>                :         _CharT* _M_p; // The actual data.
-<span class="lineNum">     263 </span>                :       };
-<span class="lineNum">     264 </span>                : 
-<span class="lineNum">     265 </span>                :     public:
-<span class="lineNum">     266 </span>                :       // Data Members (public):
-<span class="lineNum">     267 </span>                :       // NB: This is an unsigned type, and thus represents the maximum
-<span class="lineNum">     268 </span>                :       // size that the allocator can hold.
-<span class="lineNum">     269 </span>                :       ///  Value returned by various member functions when they fail.
-<span class="lineNum">     270 </span>                :       static const size_type    npos = static_cast&lt;size_type&gt;(-1);
-<span class="lineNum">     271 </span>                : 
-<span class="lineNum">     272 </span>                :     private:
-<span class="lineNum">     273 </span>                :       // Data Members (private):
-<span class="lineNum">     274 </span>                :       mutable _Alloc_hider      _M_dataplus;
-<span class="lineNum">     275 </span>                : 
-<span class="lineNum">     276 </span>                :       _CharT*
-<span class="lineNum">     277 </span><span class="lineNoCov">              0 :       _M_data() const</span>
-<span class="lineNum">     278 </span><span class="lineNoCov">              0 :       { return  _M_dataplus._M_p; }</span>
-<span class="lineNum">     279 </span>                : 
-<span class="lineNum">     280 </span>                :       _CharT*
-<span class="lineNum">     281 </span>                :       _M_data(_CharT* __p)
-<span class="lineNum">     282 </span>                :       { return (_M_dataplus._M_p = __p); }
-<span class="lineNum">     283 </span>                : 
-<span class="lineNum">     284 </span>                :       _Rep*
-<span class="lineNum">     285 </span><span class="lineNoCov">              0 :       _M_rep() const</span>
-<span class="lineNum">     286 </span><span class="lineNoCov">              0 :       { return &amp;((reinterpret_cast&lt;_Rep*&gt; (_M_data()))[-1]); }</span>
-<span class="lineNum">     287 </span>                : 
-<span class="lineNum">     288 </span>                :       // For the internal use we have functions similar to `begin'/`end'
-<span class="lineNum">     289 </span>                :       // but they do not call _M_leak.
-<span class="lineNum">     290 </span>                :       iterator
-<span class="lineNum">     291 </span><span class="lineNoCov">              0 :       _M_ibegin() const</span>
-<span class="lineNum">     292 </span><span class="lineNoCov">              0 :       { return iterator(_M_data()); }</span>
-<span class="lineNum">     293 </span>                : 
-<span class="lineNum">     294 </span>                :       iterator
-<span class="lineNum">     295 </span>                :       _M_iend() const
-<span class="lineNum">     296 </span>                :       { return iterator(_M_data() + this-&gt;size()); }
-<span class="lineNum">     297 </span>                : 
-<span class="lineNum">     298 </span>                :       void
-<span class="lineNum">     299 </span><span class="lineNoCov">              0 :       _M_leak()    // for use in begin() &amp; non-const op[]</span>
-<span class="lineNum">     300 </span>                :       {
-<span class="lineNum">     301 </span><span class="lineNoCov">              0 :         if (!_M_rep()-&gt;_M_is_leaked())</span>
-<span class="lineNum">     302 </span><span class="lineNoCov">              0 :           _M_leak_hard();</span>
-<span class="lineNum">     303 </span><span class="lineNoCov">              0 :       }</span>
-<span class="lineNum">     304 </span>                : 
-<span class="lineNum">     305 </span>                :       size_type
-<span class="lineNum">     306 </span><span class="lineNoCov">              0 :       _M_check(size_type __pos, const char* __s) const</span>
-<span class="lineNum">     307 </span>                :       {
-<span class="lineNum">     308 </span><span class="lineNoCov">              0 :         if (__pos &gt; this-&gt;size())</span>
-<span class="lineNum">     309 </span><span class="lineNoCov">              0 :           __throw_out_of_range(__N(__s));</span>
-<span class="lineNum">     310 </span><span class="lineNoCov">              0 :         return __pos;</span>
-<span class="lineNum">     311 </span>                :       }
-<span class="lineNum">     312 </span>                : 
-<span class="lineNum">     313 </span>                :       void
-<span class="lineNum">     314 </span>                :       _M_check_length(size_type __n1, size_type __n2, const char* __s) const
-<span class="lineNum">     315 </span>                :       {
-<span class="lineNum">     316 </span>                :         if (this-&gt;max_size() - (this-&gt;size() - __n1) &lt; __n2)
-<span class="lineNum">     317 </span>                :           __throw_length_error(__N(__s));
-<span class="lineNum">     318 </span>                :       }
-<span class="lineNum">     319 </span>                : 
-<span class="lineNum">     320 </span>                :       // NB: _M_limit doesn't check for a bad __pos value.
-<span class="lineNum">     321 </span>                :       size_type
-<span class="lineNum">     322 </span>                :       _M_limit(size_type __pos, size_type __off) const
-<span class="lineNum">     323 </span>                :       {
-<span class="lineNum">     324 </span>                :         const bool __testoff =  __off &lt; this-&gt;size() - __pos;
-<span class="lineNum">     325 </span>                :         return __testoff ? __off : this-&gt;size() - __pos;
-<span class="lineNum">     326 </span>                :       }
-<span class="lineNum">     327 </span>                : 
-<span class="lineNum">     328 </span>                :       // True if _Rep and source do not overlap.
-<span class="lineNum">     329 </span>                :       bool
-<span class="lineNum">     330 </span>                :       _M_disjunct(const _CharT* __s) const
-<span class="lineNum">     331 </span>                :       {
-<span class="lineNum">     332 </span>                :         return (less&lt;const _CharT*&gt;()(__s, _M_data())
-<span class="lineNum">     333 </span>                :                 || less&lt;const _CharT*&gt;()(_M_data() + this-&gt;size(), __s));
-<span class="lineNum">     334 </span>                :       }
-<span class="lineNum">     335 </span>                : 
-<span class="lineNum">     336 </span>                :       // When __n = 1 way faster than the general multichar
-<span class="lineNum">     337 </span>                :       // traits_type::copy/move/assign.
-<span class="lineNum">     338 </span>                :       static void
-<span class="lineNum">     339 </span><span class="lineNoCov">              0 :       _M_copy(_CharT* __d, const _CharT* __s, size_type __n)</span>
-<span class="lineNum">     340 </span>                :       {
-<span class="lineNum">     341 </span><span class="lineNoCov">              0 :         if (__n == 1)</span>
-<span class="lineNum">     342 </span><span class="lineNoCov">              0 :           traits_type::assign(*__d, *__s);</span>
-<span class="lineNum">     343 </span>                :         else
-<span class="lineNum">     344 </span><span class="lineNoCov">              0 :           traits_type::copy(__d, __s, __n);</span>
-<span class="lineNum">     345 </span><span class="lineNoCov">              0 :       }</span>
-<span class="lineNum">     346 </span>                : 
-<span class="lineNum">     347 </span>                :       static void
-<span class="lineNum">     348 </span>                :       _M_move(_CharT* __d, const _CharT* __s, size_type __n)
-<span class="lineNum">     349 </span>                :       {
-<span class="lineNum">     350 </span>                :         if (__n == 1)
-<span class="lineNum">     351 </span>                :           traits_type::assign(*__d, *__s);
-<span class="lineNum">     352 </span>                :         else
-<span class="lineNum">     353 </span>                :           traits_type::move(__d, __s, __n);       
-<span class="lineNum">     354 </span>                :       }
-<span class="lineNum">     355 </span>                : 
-<span class="lineNum">     356 </span>                :       static void
-<span class="lineNum">     357 </span>                :       _M_assign(_CharT* __d, size_type __n, _CharT __c)
-<span class="lineNum">     358 </span>                :       {
-<span class="lineNum">     359 </span>                :         if (__n == 1)
-<span class="lineNum">     360 </span>                :           traits_type::assign(*__d, __c);
-<span class="lineNum">     361 </span>                :         else
-<span class="lineNum">     362 </span>                :           traits_type::assign(__d, __n, __c);     
-<span class="lineNum">     363 </span>                :       }
-<span class="lineNum">     364 </span>                : 
-<span class="lineNum">     365 </span>                :       // _S_copy_chars is a separate template to permit specialization
-<span class="lineNum">     366 </span>                :       // to optimize for the common case of pointers as iterators.
-<span class="lineNum">     367 </span>                :       template&lt;class _Iterator&gt;
-<span class="lineNum">     368 </span>                :         static void
-<span class="lineNum">     369 </span><span class="lineCov">           1012 :         _S_copy_chars(_CharT* __p, _Iterator __k1, _Iterator __k2)</span>
-<span class="lineNum">     370 </span>                :         {
-<span class="lineNum">     371 </span><span class="lineCov">          11988 :           for (; __k1 != __k2; ++__k1, ++__p)</span>
-<span class="lineNum">     372 </span><span class="lineCov">          10976 :             traits_type::assign(*__p, *__k1); // These types are off.</span>
-<span class="lineNum">     373 </span><span class="lineCov">           1012 :         }</span>
-<span class="lineNum">     374 </span>                : 
-<span class="lineNum">     375 </span>                :       static void
-<span class="lineNum">     376 </span><span class="lineNoCov">              0 :       _S_copy_chars(_CharT* __p, iterator __k1, iterator __k2)</span>
-<span class="lineNum">     377 </span><span class="lineNoCov">              0 :       { _S_copy_chars(__p, __k1.base(), __k2.base()); }</span>
-<span class="lineNum">     378 </span>                : 
-<span class="lineNum">     379 </span>                :       static void
-<span class="lineNum">     380 </span>                :       _S_copy_chars(_CharT* __p, const_iterator __k1, const_iterator __k2)
-<span class="lineNum">     381 </span>                :       { _S_copy_chars(__p, __k1.base(), __k2.base()); }
-<span class="lineNum">     382 </span>                : 
-<span class="lineNum">     383 </span>                :       static void
-<span class="lineNum">     384 </span><span class="lineNoCov">              0 :       _S_copy_chars(_CharT* __p, _CharT* __k1, _CharT* __k2)</span>
-<span class="lineNum">     385 </span><span class="lineNoCov">              0 :       { _M_copy(__p, __k1, __k2 - __k1); }</span>
-<span class="lineNum">     386 </span>                : 
-<span class="lineNum">     387 </span>                :       static void
-<span class="lineNum">     388 </span>                :       _S_copy_chars(_CharT* __p, const _CharT* __k1, const _CharT* __k2)
-<span class="lineNum">     389 </span>                :       { _M_copy(__p, __k1, __k2 - __k1); }
-<span class="lineNum">     390 </span>                : 
-<span class="lineNum">     391 </span>                :       static int
-<span class="lineNum">     392 </span><span class="lineNoCov">              0 :       _S_compare(size_type __n1, size_type __n2)</span>
-<span class="lineNum">     393 </span>                :       {
-<span class="lineNum">     394 </span><span class="lineNoCov">              0 :         const difference_type __d = difference_type(__n1 - __n2);</span>
-<span class="lineNum">     395 </span>                : 
-<span class="lineNum">     396 </span>                :         if (__d &gt; __gnu_cxx::__numeric_traits&lt;int&gt;::__max)
-<span class="lineNum">     397 </span>                :           return __gnu_cxx::__numeric_traits&lt;int&gt;::__max;
-<span class="lineNum">     398 </span>                :         else if (__d &lt; __gnu_cxx::__numeric_traits&lt;int&gt;::__min)
-<span class="lineNum">     399 </span>                :           return __gnu_cxx::__numeric_traits&lt;int&gt;::__min;
-<span class="lineNum">     400 </span>                :         else
-<span class="lineNum">     401 </span><span class="lineNoCov">              0 :           return int(__d);</span>
-<span class="lineNum">     402 </span>                :       }
-<span class="lineNum">     403 </span>                : 
-<span class="lineNum">     404 </span>                :       void
-<span class="lineNum">     405 </span>                :       _M_mutate(size_type __pos, size_type __len1, size_type __len2);
-<span class="lineNum">     406 </span>                : 
-<span class="lineNum">     407 </span>                :       void
-<span class="lineNum">     408 </span>                :       _M_leak_hard();
-<span class="lineNum">     409 </span>                : 
-<span class="lineNum">     410 </span>                :       static _Rep&amp;
-<span class="lineNum">     411 </span><span class="lineNoCov">              0 :       _S_empty_rep()</span>
-<span class="lineNum">     412 </span><span class="lineNoCov">              0 :       { return _Rep::_S_empty_rep(); }</span>
-<span class="lineNum">     413 </span>                : 
-<span class="lineNum">     414 </span>                :     public:
-<span class="lineNum">     415 </span>                :       // Construct/copy/destroy:
-<span class="lineNum">     416 </span>                :       // NB: We overload ctors in some cases instead of using default
-<span class="lineNum">     417 </span>                :       // arguments, per 17.4.4.4 para. 2 item 2.
-<span class="lineNum">     418 </span>                : 
-<span class="lineNum">     419 </span>                :       /**
-<span class="lineNum">     420 </span>                :        *  @brief  Default constructor creates an empty string.
-<span class="lineNum">     421 </span>                :        */
-<span class="lineNum">     422 </span>                :       inline
-<span class="lineNum">     423 </span>                :       basic_string();
-<span class="lineNum">     424 </span>                : 
-<span class="lineNum">     425 </span>                :       /**
-<span class="lineNum">     426 </span>                :        *  @brief  Construct an empty string using allocator @a a.
-<span class="lineNum">     427 </span>                :        */
-<span class="lineNum">     428 </span>                :       explicit
-<span class="lineNum">     429 </span>                :       basic_string(const _Alloc&amp; __a);
-<span class="lineNum">     430 </span>                : 
-<span class="lineNum">     431 </span>                :       // NB: per LWG issue 42, semantics different from IS:
-<span class="lineNum">     432 </span>                :       /**
-<span class="lineNum">     433 </span>                :        *  @brief  Construct string with copy of value of @a str.
-<span class="lineNum">     434 </span>                :        *  @param  str  Source string.
-<span class="lineNum">     435 </span>                :        */
-<span class="lineNum">     436 </span>                :       basic_string(const basic_string&amp; __str);
-<span class="lineNum">     437 </span>                :       /**
-<span class="lineNum">     438 </span>                :        *  @brief  Construct string as copy of a substring.
-<span class="lineNum">     439 </span>                :        *  @param  str  Source string.
-<span class="lineNum">     440 </span>                :        *  @param  pos  Index of first character to copy from.
-<span class="lineNum">     441 </span>                :        *  @param  n  Number of characters to copy (default remainder).
-<span class="lineNum">     442 </span>                :        */
-<span class="lineNum">     443 </span>                :       basic_string(const basic_string&amp; __str, size_type __pos,
-<span class="lineNum">     444 </span>                :                    size_type __n = npos);
-<span class="lineNum">     445 </span>                :       /**
-<span class="lineNum">     446 </span>                :        *  @brief  Construct string as copy of a substring.
-<span class="lineNum">     447 </span>                :        *  @param  str  Source string.
-<span class="lineNum">     448 </span>                :        *  @param  pos  Index of first character to copy from.
-<span class="lineNum">     449 </span>                :        *  @param  n  Number of characters to copy.
-<span class="lineNum">     450 </span>                :        *  @param  a  Allocator to use.
-<span class="lineNum">     451 </span>                :        */
-<span class="lineNum">     452 </span>                :       basic_string(const basic_string&amp; __str, size_type __pos,
-<span class="lineNum">     453 </span>                :                    size_type __n, const _Alloc&amp; __a);
-<span class="lineNum">     454 </span>                : 
-<span class="lineNum">     455 </span>                :       /**
-<span class="lineNum">     456 </span>                :        *  @brief  Construct string initialized by a character array.
-<span class="lineNum">     457 </span>                :        *  @param  s  Source character array.
-<span class="lineNum">     458 </span>                :        *  @param  n  Number of characters to copy.
-<span class="lineNum">     459 </span>                :        *  @param  a  Allocator to use (default is default allocator).
-<span class="lineNum">     460 </span>                :        *
-<span class="lineNum">     461 </span>                :        *  NB: @a s must have at least @a n characters, '\0' has no special
-<span class="lineNum">     462 </span>                :        *  meaning.
-<span class="lineNum">     463 </span>                :        */
-<span class="lineNum">     464 </span>                :       basic_string(const _CharT* __s, size_type __n,
-<span class="lineNum">     465 </span>                :                    const _Alloc&amp; __a = _Alloc());
-<span class="lineNum">     466 </span>                :       /**
-<span class="lineNum">     467 </span>                :        *  @brief  Construct string as copy of a C string.
-<span class="lineNum">     468 </span>                :        *  @param  s  Source C string.
-<span class="lineNum">     469 </span>                :        *  @param  a  Allocator to use (default is default allocator).
-<span class="lineNum">     470 </span>                :        */
-<span class="lineNum">     471 </span>                :       basic_string(const _CharT* __s, const _Alloc&amp; __a = _Alloc());
-<span class="lineNum">     472 </span>                :       /**
-<span class="lineNum">     473 </span>                :        *  @brief  Construct string as multiple characters.
-<span class="lineNum">     474 </span>                :        *  @param  n  Number of characters.
-<span class="lineNum">     475 </span>                :        *  @param  c  Character to use.
-<span class="lineNum">     476 </span>                :        *  @param  a  Allocator to use (default is default allocator).
-<span class="lineNum">     477 </span>                :        */
-<span class="lineNum">     478 </span>                :       basic_string(size_type __n, _CharT __c, const _Alloc&amp; __a = _Alloc());
-<span class="lineNum">     479 </span>                : 
-<span class="lineNum">     480 </span>                :       /**
-<span class="lineNum">     481 </span>                :        *  @brief  Construct string as copy of a range.
-<span class="lineNum">     482 </span>                :        *  @param  beg  Start of range.
-<span class="lineNum">     483 </span>                :        *  @param  end  End of range.
-<span class="lineNum">     484 </span>                :        *  @param  a  Allocator to use (default is default allocator).
-<span class="lineNum">     485 </span>                :        */
-<span class="lineNum">     486 </span>                :       template&lt;class _InputIterator&gt;
-<span class="lineNum">     487 </span>                :         basic_string(_InputIterator __beg, _InputIterator __end,
-<span class="lineNum">     488 </span>                :                      const _Alloc&amp; __a = _Alloc());
-<span class="lineNum">     489 </span>                : 
-<span class="lineNum">     490 </span>                :       /**
-<span class="lineNum">     491 </span>                :        *  @brief  Destroy the string instance.
-<span class="lineNum">     492 </span>                :        */
-<span class="lineNum">     493 </span><span class="lineNoCov">              0 :       ~basic_string()</span>
-<span class="lineNum">     494 </span><span class="lineNoCov">              0 :       { _M_rep()-&gt;_M_dispose(this-&gt;get_allocator()); }</span>
-<span class="lineNum">     495 </span>                : 
-<span class="lineNum">     496 </span>                :       /**
-<span class="lineNum">     497 </span>                :        *  @brief  Assign the value of @a str to this string.
-<span class="lineNum">     498 </span>                :        *  @param  str  Source string.
-<span class="lineNum">     499 </span>                :        */
-<span class="lineNum">     500 </span>                :       basic_string&amp;
-<span class="lineNum">     501 </span><span class="lineNoCov">              0 :       operator=(const basic_string&amp; __str) </span>
-<span class="lineNum">     502 </span><span class="lineNoCov">              0 :       { return this-&gt;assign(__str); }</span>
-<span class="lineNum">     503 </span>                : 
-<span class="lineNum">     504 </span>                :       /**
-<span class="lineNum">     505 </span>                :        *  @brief  Copy contents of @a s into this string.
-<span class="lineNum">     506 </span>                :        *  @param  s  Source null-terminated string.
-<span class="lineNum">     507 </span>                :        */
-<span class="lineNum">     508 </span>                :       basic_string&amp;
-<span class="lineNum">     509 </span><span class="lineNoCov">              0 :       operator=(const _CharT* __s) </span>
-<span class="lineNum">     510 </span><span class="lineNoCov">              0 :       { return this-&gt;assign(__s); }</span>
-<span class="lineNum">     511 </span>                : 
-<span class="lineNum">     512 </span>                :       /**
-<span class="lineNum">     513 </span>                :        *  @brief  Set value to string of length 1.
-<span class="lineNum">     514 </span>                :        *  @param  c  Source character.
-<span class="lineNum">     515 </span>                :        *
-<span class="lineNum">     516 </span>                :        *  Assigning to a character makes this string length 1 and
-<span class="lineNum">     517 </span>                :        *  (*this)[0] == @a c.
-<span class="lineNum">     518 </span>                :        */
-<span class="lineNum">     519 </span>                :       basic_string&amp;
-<span class="lineNum">     520 </span>                :       operator=(_CharT __c) 
-<span class="lineNum">     521 </span>                :       { 
-<span class="lineNum">     522 </span>                :         this-&gt;assign(1, __c); 
-<span class="lineNum">     523 </span>                :         return *this;
-<span class="lineNum">     524 </span>                :       }
-<span class="lineNum">     525 </span>                : 
-<span class="lineNum">     526 </span>                :       // Iterators:
-<span class="lineNum">     527 </span>                :       /**
-<span class="lineNum">     528 </span>                :        *  Returns a read/write iterator that points to the first character in
-<span class="lineNum">     529 </span>                :        *  the %string.  Unshares the string.
-<span class="lineNum">     530 </span>                :        */
-<span class="lineNum">     531 </span>                :       iterator
-<span class="lineNum">     532 </span><span class="lineNoCov">              0 :       begin()</span>
-<span class="lineNum">     533 </span>                :       {
-<span class="lineNum">     534 </span><span class="lineNoCov">              0 :         _M_leak();</span>
-<span class="lineNum">     535 </span><span class="lineNoCov">              0 :         return iterator(_M_data());</span>
-<span class="lineNum">     536 </span>                :       }
-<span class="lineNum">     537 </span>                : 
-<span class="lineNum">     538 </span>                :       /**
-<span class="lineNum">     539 </span>                :        *  Returns a read-only (constant) iterator that points to the first
-<span class="lineNum">     540 </span>                :        *  character in the %string.
-<span class="lineNum">     541 </span>                :        */
-<span class="lineNum">     542 </span>                :       const_iterator
-<span class="lineNum">     543 </span><span class="lineNoCov">              0 :       begin() const</span>
-<span class="lineNum">     544 </span><span class="lineNoCov">              0 :       { return const_iterator(_M_data()); }</span>
-<span class="lineNum">     545 </span>                : 
-<span class="lineNum">     546 </span>                :       /**
-<span class="lineNum">     547 </span>                :        *  Returns a read/write iterator that points one past the last
-<span class="lineNum">     548 </span>                :        *  character in the %string.  Unshares the string.
-<span class="lineNum">     549 </span>                :        */
-<span class="lineNum">     550 </span>                :       iterator
-<span class="lineNum">     551 </span><span class="lineNoCov">              0 :       end()</span>
-<span class="lineNum">     552 </span>                :       {
-<span class="lineNum">     553 </span><span class="lineNoCov">              0 :         _M_leak();</span>
-<span class="lineNum">     554 </span><span class="lineNoCov">              0 :         return iterator(_M_data() + this-&gt;size());</span>
-<span class="lineNum">     555 </span>                :       }
-<span class="lineNum">     556 </span>                : 
-<span class="lineNum">     557 </span>                :       /**
-<span class="lineNum">     558 </span>                :        *  Returns a read-only (constant) iterator that points one past the
-<span class="lineNum">     559 </span>                :        *  last character in the %string.
-<span class="lineNum">     560 </span>                :        */
-<span class="lineNum">     561 </span>                :       const_iterator
-<span class="lineNum">     562 </span><span class="lineNoCov">              0 :       end() const</span>
-<span class="lineNum">     563 </span><span class="lineNoCov">              0 :       { return const_iterator(_M_data() + this-&gt;size()); }</span>
-<span class="lineNum">     564 </span>                : 
-<span class="lineNum">     565 </span>                :       /**
-<span class="lineNum">     566 </span>                :        *  Returns a read/write reverse iterator that points to the last
-<span class="lineNum">     567 </span>                :        *  character in the %string.  Iteration is done in reverse element
-<span class="lineNum">     568 </span>                :        *  order.  Unshares the string.
-<span class="lineNum">     569 </span>                :        */
-<span class="lineNum">     570 </span>                :       reverse_iterator
-<span class="lineNum">     571 </span>                :       rbegin()
-<span class="lineNum">     572 </span>                :       { return reverse_iterator(this-&gt;end()); }
-<span class="lineNum">     573 </span>                : 
-<span class="lineNum">     574 </span>                :       /**
-<span class="lineNum">     575 </span>                :        *  Returns a read-only (constant) reverse iterator that points
-<span class="lineNum">     576 </span>                :        *  to the last character in the %string.  Iteration is done in
-<span class="lineNum">     577 </span>                :        *  reverse element order.
-<span class="lineNum">     578 </span>                :        */
-<span class="lineNum">     579 </span>                :       const_reverse_iterator
-<span class="lineNum">     580 </span>                :       rbegin() const
-<span class="lineNum">     581 </span>                :       { return const_reverse_iterator(this-&gt;end()); }
-<span class="lineNum">     582 </span>                : 
-<span class="lineNum">     583 </span>                :       /**
-<span class="lineNum">     584 </span>                :        *  Returns a read/write reverse iterator that points to one before the
-<span class="lineNum">     585 </span>                :        *  first character in the %string.  Iteration is done in reverse
-<span class="lineNum">     586 </span>                :        *  element order.  Unshares the string.
-<span class="lineNum">     587 </span>                :        */
-<span class="lineNum">     588 </span>                :       reverse_iterator
-<span class="lineNum">     589 </span>                :       rend()
-<span class="lineNum">     590 </span>                :       { return reverse_iterator(this-&gt;begin()); }
-<span class="lineNum">     591 </span>                : 
-<span class="lineNum">     592 </span>                :       /**
-<span class="lineNum">     593 </span>                :        *  Returns a read-only (constant) reverse iterator that points
-<span class="lineNum">     594 </span>                :        *  to one before the first character in the %string.  Iteration
-<span class="lineNum">     595 </span>                :        *  is done in reverse element order.
-<span class="lineNum">     596 </span>                :        */
-<span class="lineNum">     597 </span>                :       const_reverse_iterator
-<span class="lineNum">     598 </span>                :       rend() const
-<span class="lineNum">     599 </span>                :       { return const_reverse_iterator(this-&gt;begin()); }
-<span class="lineNum">     600 </span>                : 
-<span class="lineNum">     601 </span>                :     public:
-<span class="lineNum">     602 </span>                :       // Capacity:
-<span class="lineNum">     603 </span>                :       ///  Returns the number of characters in the string, not including any
-<span class="lineNum">     604 </span>                :       ///  null-termination.
-<span class="lineNum">     605 </span>                :       size_type
-<span class="lineNum">     606 </span><span class="lineNoCov">              0 :       size() const</span>
-<span class="lineNum">     607 </span><span class="lineNoCov">              0 :       { return _M_rep()-&gt;_M_length; }</span>
-<span class="lineNum">     608 </span>                : 
-<span class="lineNum">     609 </span>                :       ///  Returns the number of characters in the string, not including any
-<span class="lineNum">     610 </span>                :       ///  null-termination.
-<span class="lineNum">     611 </span>                :       size_type
-<span class="lineNum">     612 </span><span class="lineNoCov">              0 :       length() const</span>
-<span class="lineNum">     613 </span><span class="lineNoCov">              0 :       { return _M_rep()-&gt;_M_length; }</span>
-<span class="lineNum">     614 </span>                : 
-<span class="lineNum">     615 </span>                :       /// Returns the size() of the largest possible %string.
-<span class="lineNum">     616 </span>                :       size_type
-<span class="lineNum">     617 </span>                :       max_size() const
-<span class="lineNum">     618 </span>                :       { return _Rep::_S_max_size; }
-<span class="lineNum">     619 </span>                : 
-<span class="lineNum">     620 </span>                :       /**
-<span class="lineNum">     621 </span>                :        *  @brief  Resizes the %string to the specified number of characters.
-<span class="lineNum">     622 </span>                :        *  @param  n  Number of characters the %string should contain.
-<span class="lineNum">     623 </span>                :        *  @param  c  Character to fill any new elements.
-<span class="lineNum">     624 </span>                :        *
-<span class="lineNum">     625 </span>                :        *  This function will %resize the %string to the specified
-<span class="lineNum">     626 </span>                :        *  number of characters.  If the number is smaller than the
-<span class="lineNum">     627 </span>                :        *  %string's current size the %string is truncated, otherwise
-<span class="lineNum">     628 </span>                :        *  the %string is extended and new elements are set to @a c.
-<span class="lineNum">     629 </span>                :        */
-<span class="lineNum">     630 </span>                :       void
-<span class="lineNum">     631 </span>                :       resize(size_type __n, _CharT __c);
-<span class="lineNum">     632 </span>                : 
-<span class="lineNum">     633 </span>                :       /**
-<span class="lineNum">     634 </span>                :        *  @brief  Resizes the %string to the specified number of characters.
-<span class="lineNum">     635 </span>                :        *  @param  n  Number of characters the %string should contain.
-<span class="lineNum">     636 </span>                :        *
-<span class="lineNum">     637 </span>                :        *  This function will resize the %string to the specified length.  If
-<span class="lineNum">     638 </span>                :        *  the new size is smaller than the %string's current size the %string
-<span class="lineNum">     639 </span>                :        *  is truncated, otherwise the %string is extended and new characters
-<span class="lineNum">     640 </span>                :        *  are default-constructed.  For basic types such as char, this means
-<span class="lineNum">     641 </span>                :        *  setting them to 0.
-<span class="lineNum">     642 </span>                :        */
-<span class="lineNum">     643 </span>                :       void
-<span class="lineNum">     644 </span><span class="lineNoCov">              0 :       resize(size_type __n)</span>
-<span class="lineNum">     645 </span><span class="lineNoCov">              0 :       { this-&gt;resize(__n, _CharT()); }</span>
-<span class="lineNum">     646 </span>                : 
-<span class="lineNum">     647 </span>                :       /**
-<span class="lineNum">     648 </span>                :        *  Returns the total number of characters that the %string can hold
-<span class="lineNum">     649 </span>                :        *  before needing to allocate more memory.
-<span class="lineNum">     650 </span>                :        */
-<span class="lineNum">     651 </span>                :       size_type
-<span class="lineNum">     652 </span><span class="lineNoCov">              0 :       capacity() const</span>
-<span class="lineNum">     653 </span><span class="lineNoCov">              0 :       { return _M_rep()-&gt;_M_capacity; }</span>
-<span class="lineNum">     654 </span>                : 
-<span class="lineNum">     655 </span>                :       /**
-<span class="lineNum">     656 </span>                :        *  @brief  Attempt to preallocate enough memory for specified number of
-<span class="lineNum">     657 </span>                :        *          characters.
-<span class="lineNum">     658 </span>                :        *  @param  res_arg  Number of characters required.
-<span class="lineNum">     659 </span>                :        *  @throw  std::length_error  If @a res_arg exceeds @c max_size().
-<span class="lineNum">     660 </span>                :        *
-<span class="lineNum">     661 </span>                :        *  This function attempts to reserve enough memory for the
-<span class="lineNum">     662 </span>                :        *  %string to hold the specified number of characters.  If the
-<span class="lineNum">     663 </span>                :        *  number requested is more than max_size(), length_error is
-<span class="lineNum">     664 </span>                :        *  thrown.
-<span class="lineNum">     665 </span>                :        *
-<span class="lineNum">     666 </span>                :        *  The advantage of this function is that if optimal code is a
-<span class="lineNum">     667 </span>                :        *  necessity and the user can determine the string length that will be
-<span class="lineNum">     668 </span>                :        *  required, the user can reserve the memory in %advance, and thus
-<span class="lineNum">     669 </span>                :        *  prevent a possible reallocation of memory and copying of %string
-<span class="lineNum">     670 </span>                :        *  data.
-<span class="lineNum">     671 </span>                :        */
-<span class="lineNum">     672 </span>                :       void
-<span class="lineNum">     673 </span>                :       reserve(size_type __res_arg = 0);
-<span class="lineNum">     674 </span>                : 
-<span class="lineNum">     675 </span>                :       /**
-<span class="lineNum">     676 </span>                :        *  Erases the string, making it empty.
-<span class="lineNum">     677 </span>                :        */
-<span class="lineNum">     678 </span>                :       void
-<span class="lineNum">     679 </span><span class="lineNoCov">              0 :       clear()</span>
-<span class="lineNum">     680 </span><span class="lineNoCov">              0 :       { _M_mutate(0, this-&gt;size(), 0); }</span>
-<span class="lineNum">     681 </span>                : 
-<span class="lineNum">     682 </span>                :       /**
-<span class="lineNum">     683 </span>                :        *  Returns true if the %string is empty.  Equivalent to *this == &quot;&quot;.
-<span class="lineNum">     684 </span>                :        */
-<span class="lineNum">     685 </span>                :       bool
-<span class="lineNum">     686 </span><span class="lineNoCov">              0 :       empty() const</span>
-<span class="lineNum">     687 </span><span class="lineNoCov">              0 :       { return this-&gt;size() == 0; }</span>
-<span class="lineNum">     688 </span>                : 
-<span class="lineNum">     689 </span>                :       // Element access:
-<span class="lineNum">     690 </span>                :       /**
-<span class="lineNum">     691 </span>                :        *  @brief  Subscript access to the data contained in the %string.
-<span class="lineNum">     692 </span>                :        *  @param  pos  The index of the character to access.
-<span class="lineNum">     693 </span>                :        *  @return  Read-only (constant) reference to the character.
-<span class="lineNum">     694 </span>                :        *
-<span class="lineNum">     695 </span>                :        *  This operator allows for easy, array-style, data access.
-<span class="lineNum">     696 </span>                :        *  Note that data access with this operator is unchecked and
-<span class="lineNum">     697 </span>                :        *  out_of_range lookups are not defined. (For checked lookups
-<span class="lineNum">     698 </span>                :        *  see at().)
-<span class="lineNum">     699 </span>                :        */
-<span class="lineNum">     700 </span>                :       const_reference
-<span class="lineNum">     701 </span><span class="lineNoCov">              0 :       operator[] (size_type __pos) const</span>
-<span class="lineNum">     702 </span>                :       {
-<span class="lineNum">     703 </span>                :         _GLIBCXX_DEBUG_ASSERT(__pos &lt;= size());
-<span class="lineNum">     704 </span><span class="lineNoCov">              0 :         return _M_data()[__pos];</span>
-<span class="lineNum">     705 </span>                :       }
-<span class="lineNum">     706 </span>                : 
-<span class="lineNum">     707 </span>                :       /**
-<span class="lineNum">     708 </span>                :        *  @brief  Subscript access to the data contained in the %string.
-<span class="lineNum">     709 </span>                :        *  @param  pos  The index of the character to access.
-<span class="lineNum">     710 </span>                :        *  @return  Read/write reference to the character.
-<span class="lineNum">     711 </span>                :        *
-<span class="lineNum">     712 </span>                :        *  This operator allows for easy, array-style, data access.
-<span class="lineNum">     713 </span>                :        *  Note that data access with this operator is unchecked and
-<span class="lineNum">     714 </span>                :        *  out_of_range lookups are not defined. (For checked lookups
-<span class="lineNum">     715 </span>                :        *  see at().)  Unshares the string.
-<span class="lineNum">     716 </span>                :        */
-<span class="lineNum">     717 </span>                :       reference
-<span class="lineNum">     718 </span><span class="lineNoCov">              0 :       operator[](size_type __pos)</span>
-<span class="lineNum">     719 </span>                :       {
-<span class="lineNum">     720 </span>                :         // allow pos == size() as v3 extension:
-<span class="lineNum">     721 </span>                :         _GLIBCXX_DEBUG_ASSERT(__pos &lt;= size());
-<span class="lineNum">     722 </span>                :         // but be strict in pedantic mode:
-<span class="lineNum">     723 </span>                :         _GLIBCXX_DEBUG_PEDASSERT(__pos &lt; size());
-<span class="lineNum">     724 </span><span class="lineNoCov">              0 :         _M_leak();</span>
-<span class="lineNum">     725 </span><span class="lineNoCov">              0 :         return _M_data()[__pos];</span>
-<span class="lineNum">     726 </span>                :       }
-<span class="lineNum">     727 </span>                : 
-<span class="lineNum">     728 </span>                :       /**
-<span class="lineNum">     729 </span>                :        *  @brief  Provides access to the data contained in the %string.
-<span class="lineNum">     730 </span>                :        *  @param n The index of the character to access.
-<span class="lineNum">     731 </span>                :        *  @return  Read-only (const) reference to the character.
-<span class="lineNum">     732 </span>                :        *  @throw  std::out_of_range  If @a n is an invalid index.
-<span class="lineNum">     733 </span>                :        *
-<span class="lineNum">     734 </span>                :        *  This function provides for safer data access.  The parameter is
-<span class="lineNum">     735 </span>                :        *  first checked that it is in the range of the string.  The function
-<span class="lineNum">     736 </span>                :        *  throws out_of_range if the check fails.
-<span class="lineNum">     737 </span>                :        */
-<span class="lineNum">     738 </span>                :       const_reference
-<span class="lineNum">     739 </span>                :       at(size_type __n) const
-<span class="lineNum">     740 </span>                :       {
-<span class="lineNum">     741 </span>                :         if (__n &gt;= this-&gt;size())
-<span class="lineNum">     742 </span>                :           __throw_out_of_range(__N(&quot;basic_string::at&quot;));
-<span class="lineNum">     743 </span>                :         return _M_data()[__n];
-<span class="lineNum">     744 </span>                :       }
-<span class="lineNum">     745 </span>                : 
-<span class="lineNum">     746 </span>                :       /**
-<span class="lineNum">     747 </span>                :        *  @brief  Provides access to the data contained in the %string.
-<span class="lineNum">     748 </span>                :        *  @param n The index of the character to access.
-<span class="lineNum">     749 </span>                :        *  @return  Read/write reference to the character.
-<span class="lineNum">     750 </span>                :        *  @throw  std::out_of_range  If @a n is an invalid index.
-<span class="lineNum">     751 </span>                :        *
-<span class="lineNum">     752 </span>                :        *  This function provides for safer data access.  The parameter is
-<span class="lineNum">     753 </span>                :        *  first checked that it is in the range of the string.  The function
-<span class="lineNum">     754 </span>                :        *  throws out_of_range if the check fails.  Success results in
-<span class="lineNum">     755 </span>                :        *  unsharing the string.
-<span class="lineNum">     756 </span>                :        */
-<span class="lineNum">     757 </span>                :       reference
-<span class="lineNum">     758 </span>                :       at(size_type __n)
-<span class="lineNum">     759 </span>                :       {
-<span class="lineNum">     760 </span>                :         if (__n &gt;= size())
-<span class="lineNum">     761 </span>                :           __throw_out_of_range(__N(&quot;basic_string::at&quot;));
-<span class="lineNum">     762 </span>                :         _M_leak();
-<span class="lineNum">     763 </span>                :         return _M_data()[__n];
-<span class="lineNum">     764 </span>                :       }
-<span class="lineNum">     765 </span>                : 
-<span class="lineNum">     766 </span>                :       // Modifiers:
-<span class="lineNum">     767 </span>                :       /**
-<span class="lineNum">     768 </span>                :        *  @brief  Append a string to this string.
-<span class="lineNum">     769 </span>                :        *  @param str  The string to append.
-<span class="lineNum">     770 </span>                :        *  @return  Reference to this string.
-<span class="lineNum">     771 </span>                :        */
-<span class="lineNum">     772 </span>                :       basic_string&amp;
-<span class="lineNum">     773 </span><span class="lineNoCov">              0 :       operator+=(const basic_string&amp; __str)</span>
-<span class="lineNum">     774 </span><span class="lineNoCov">              0 :       { return this-&gt;append(__str); }</span>
-<span class="lineNum">     775 </span>                : 
-<span class="lineNum">     776 </span>                :       /**
-<span class="lineNum">     777 </span>                :        *  @brief  Append a C string.
-<span class="lineNum">     778 </span>                :        *  @param s  The C string to append.
-<span class="lineNum">     779 </span>                :        *  @return  Reference to this string.
-<span class="lineNum">     780 </span>                :        */
-<span class="lineNum">     781 </span>                :       basic_string&amp;
-<span class="lineNum">     782 </span><span class="lineNoCov">              0 :       operator+=(const _CharT* __s)</span>
-<span class="lineNum">     783 </span><span class="lineNoCov">              0 :       { return this-&gt;append(__s); }</span>
-<span class="lineNum">     784 </span>                : 
-<span class="lineNum">     785 </span>                :       /**
-<span class="lineNum">     786 </span>                :        *  @brief  Append a character.
-<span class="lineNum">     787 </span>                :        *  @param c  The character to append.
-<span class="lineNum">     788 </span>                :        *  @return  Reference to this string.
-<span class="lineNum">     789 </span>                :        */
-<span class="lineNum">     790 </span>                :       basic_string&amp;
-<span class="lineNum">     791 </span><span class="lineNoCov">              0 :       operator+=(_CharT __c)</span>
-<span class="lineNum">     792 </span>                :       { 
-<span class="lineNum">     793 </span><span class="lineNoCov">              0 :         this-&gt;push_back(__c);</span>
-<span class="lineNum">     794 </span><span class="lineNoCov">              0 :         return *this;</span>
-<span class="lineNum">     795 </span>                :       }
-<span class="lineNum">     796 </span>                : 
-<span class="lineNum">     797 </span>                :       /**
-<span class="lineNum">     798 </span>                :        *  @brief  Append a string to this string.
-<span class="lineNum">     799 </span>                :        *  @param str  The string to append.
-<span class="lineNum">     800 </span>                :        *  @return  Reference to this string.
-<span class="lineNum">     801 </span>                :        */
-<span class="lineNum">     802 </span>                :       basic_string&amp;
-<span class="lineNum">     803 </span>                :       append(const basic_string&amp; __str);
-<span class="lineNum">     804 </span>                : 
-<span class="lineNum">     805 </span>                :       /**
-<span class="lineNum">     806 </span>                :        *  @brief  Append a substring.
-<span class="lineNum">     807 </span>                :        *  @param str  The string to append.
-<span class="lineNum">     808 </span>                :        *  @param pos  Index of the first character of str to append.
-<span class="lineNum">     809 </span>                :        *  @param n  The number of characters to append.
-<span class="lineNum">     810 </span>                :        *  @return  Reference to this string.
-<span class="lineNum">     811 </span>                :        *  @throw  std::out_of_range if @a pos is not a valid index.
-<span class="lineNum">     812 </span>                :        *
-<span class="lineNum">     813 </span>                :        *  This function appends @a n characters from @a str starting at @a pos
-<span class="lineNum">     814 </span>                :        *  to this string.  If @a n is is larger than the number of available
-<span class="lineNum">     815 </span>                :        *  characters in @a str, the remainder of @a str is appended.
-<span class="lineNum">     816 </span>                :        */
-<span class="lineNum">     817 </span>                :       basic_string&amp;
-<span class="lineNum">     818 </span>                :       append(const basic_string&amp; __str, size_type __pos, size_type __n);
-<span class="lineNum">     819 </span>                : 
-<span class="lineNum">     820 </span>                :       /**
-<span class="lineNum">     821 </span>                :        *  @brief  Append a C substring.
-<span class="lineNum">     822 </span>                :        *  @param s  The C string to append.
-<span class="lineNum">     823 </span>                :        *  @param n  The number of characters to append.
-<span class="lineNum">     824 </span>                :        *  @return  Reference to this string.
-<span class="lineNum">     825 </span>                :        */
-<span class="lineNum">     826 </span>                :       basic_string&amp;
-<span class="lineNum">     827 </span>                :       append(const _CharT* __s, size_type __n);
-<span class="lineNum">     828 </span>                : 
-<span class="lineNum">     829 </span>                :       /**
-<span class="lineNum">     830 </span>                :        *  @brief  Append a C string.
-<span class="lineNum">     831 </span>                :        *  @param s  The C string to append.
-<span class="lineNum">     832 </span>                :        *  @return  Reference to this string.
-<span class="lineNum">     833 </span>                :        */
-<span class="lineNum">     834 </span>                :       basic_string&amp;
-<span class="lineNum">     835 </span><span class="lineNoCov">              0 :       append(const _CharT* __s)</span>
-<span class="lineNum">     836 </span>                :       {
-<span class="lineNum">     837 </span>                :         __glibcxx_requires_string(__s);
-<span class="lineNum">     838 </span><span class="lineNoCov">              0 :         return this-&gt;append(__s, traits_type::length(__s));</span>
-<span class="lineNum">     839 </span>                :       }
-<span class="lineNum">     840 </span>                : 
-<span class="lineNum">     841 </span>                :       /**
-<span class="lineNum">     842 </span>                :        *  @brief  Append multiple characters.
-<span class="lineNum">     843 </span>                :        *  @param n  The number of characters to append.
-<span class="lineNum">     844 </span>                :        *  @param c  The character to use.
-<span class="lineNum">     845 </span>                :        *  @return  Reference to this string.
-<span class="lineNum">     846 </span>                :        *
-<span class="lineNum">     847 </span>                :        *  Appends n copies of c to this string.
-<span class="lineNum">     848 </span>                :        */
-<span class="lineNum">     849 </span>                :       basic_string&amp;
-<span class="lineNum">     850 </span>                :       append(size_type __n, _CharT __c);
-<span class="lineNum">     851 </span>                : 
-<span class="lineNum">     852 </span>                :       /**
-<span class="lineNum">     853 </span>                :        *  @brief  Append a range of characters.
-<span class="lineNum">     854 </span>                :        *  @param first  Iterator referencing the first character to append.
-<span class="lineNum">     855 </span>                :        *  @param last  Iterator marking the end of the range.
-<span class="lineNum">     856 </span>                :        *  @return  Reference to this string.
-<span class="lineNum">     857 </span>                :        *
-<span class="lineNum">     858 </span>                :        *  Appends characters in the range [first,last) to this string.
-<span class="lineNum">     859 </span>                :        */
-<span class="lineNum">     860 </span>                :       template&lt;class _InputIterator&gt;
-<span class="lineNum">     861 </span>                :         basic_string&amp;
-<span class="lineNum">     862 </span>                :         append(_InputIterator __first, _InputIterator __last)
-<span class="lineNum">     863 </span>                :         { return this-&gt;replace(_M_iend(), _M_iend(), __first, __last); }
-<span class="lineNum">     864 </span>                : 
-<span class="lineNum">     865 </span>                :       /**
-<span class="lineNum">     866 </span>                :        *  @brief  Append a single character.
-<span class="lineNum">     867 </span>                :        *  @param c  Character to append.
-<span class="lineNum">     868 </span>                :        */
-<span class="lineNum">     869 </span>                :       void
-<span class="lineNum">     870 </span><span class="lineNoCov">              0 :       push_back(_CharT __c)</span>
-<span class="lineNum">     871 </span>                :       { 
-<span class="lineNum">     872 </span><span class="lineNoCov">              0 :         const size_type __len = 1 + this-&gt;size();</span>
-<span class="lineNum">     873 </span><span class="lineNoCov">              0 :         if (__len &gt; this-&gt;capacity() || _M_rep()-&gt;_M_is_shared())</span>
-<span class="lineNum">     874 </span><span class="lineNoCov">              0 :           this-&gt;reserve(__len);</span>
-<span class="lineNum">     875 </span><span class="lineNoCov">              0 :         traits_type::assign(_M_data()[this-&gt;size()], __c);</span>
-<span class="lineNum">     876 </span><span class="lineNoCov">              0 :         _M_rep()-&gt;_M_set_length_and_sharable(__len);</span>
-<span class="lineNum">     877 </span><span class="lineNoCov">              0 :       }</span>
-<span class="lineNum">     878 </span>                : 
-<span class="lineNum">     879 </span>                :       /**
-<span class="lineNum">     880 </span>                :        *  @brief  Set value to contents of another string.
-<span class="lineNum">     881 </span>                :        *  @param  str  Source string to use.
-<span class="lineNum">     882 </span>                :        *  @return  Reference to this string.
-<span class="lineNum">     883 </span>                :        */
-<span class="lineNum">     884 </span>                :       basic_string&amp;
-<span class="lineNum">     885 </span>                :       assign(const basic_string&amp; __str);
-<span class="lineNum">     886 </span>                : 
-<span class="lineNum">     887 </span>                :       /**
-<span class="lineNum">     888 </span>                :        *  @brief  Set value to a substring of a string.
-<span class="lineNum">     889 </span>                :        *  @param str  The string to use.
-<span class="lineNum">     890 </span>                :        *  @param pos  Index of the first character of str.
-<span class="lineNum">     891 </span>                :        *  @param n  Number of characters to use.
-<span class="lineNum">     892 </span>                :        *  @return  Reference to this string.
-<span class="lineNum">     893 </span>                :        *  @throw  std::out_of_range if @a pos is not a valid index.
-<span class="lineNum">     894 </span>                :        *
-<span class="lineNum">     895 </span>                :        *  This function sets this string to the substring of @a str consisting
-<span class="lineNum">     896 </span>                :        *  of @a n characters at @a pos.  If @a n is is larger than the number
-<span class="lineNum">     897 </span>                :        *  of available characters in @a str, the remainder of @a str is used.
-<span class="lineNum">     898 </span>                :        */
-<span class="lineNum">     899 </span>                :       basic_string&amp;
-<span class="lineNum">     900 </span>                :       assign(const basic_string&amp; __str, size_type __pos, size_type __n)
-<span class="lineNum">     901 </span>                :       { return this-&gt;assign(__str._M_data()
-<span class="lineNum">     902 </span>                :                             + __str._M_check(__pos, &quot;basic_string::assign&quot;),
-<span class="lineNum">     903 </span>                :                             __str._M_limit(__pos, __n)); }
-<span class="lineNum">     904 </span>                : 
-<span class="lineNum">     905 </span>                :       /**
-<span class="lineNum">     906 </span>                :        *  @brief  Set value to a C substring.
-<span class="lineNum">     907 </span>                :        *  @param s  The C string to use.
-<span class="lineNum">     908 </span>                :        *  @param n  Number of characters to use.
-<span class="lineNum">     909 </span>                :        *  @return  Reference to this string.
-<span class="lineNum">     910 </span>                :        *
-<span class="lineNum">     911 </span>                :        *  This function sets the value of this string to the first @a n
-<span class="lineNum">     912 </span>                :        *  characters of @a s.  If @a n is is larger than the number of
-<span class="lineNum">     913 </span>                :        *  available characters in @a s, the remainder of @a s is used.
-<span class="lineNum">     914 </span>                :        */
-<span class="lineNum">     915 </span>                :       basic_string&amp;
-<span class="lineNum">     916 </span>                :       assign(const _CharT* __s, size_type __n);
-<span class="lineNum">     917 </span>                : 
-<span class="lineNum">     918 </span>                :       /**
-<span class="lineNum">     919 </span>                :        *  @brief  Set value to contents of a C string.
-<span class="lineNum">     920 </span>                :        *  @param s  The C string to use.
-<span class="lineNum">     921 </span>                :        *  @return  Reference to this string.
-<span class="lineNum">     922 </span>                :        *
-<span class="lineNum">     923 </span>                :        *  This function sets the value of this string to the value of @a s.
-<span class="lineNum">     924 </span>                :        *  The data is copied, so there is no dependence on @a s once the
-<span class="lineNum">     925 </span>                :        *  function returns.
-<span class="lineNum">     926 </span>                :        */
-<span class="lineNum">     927 </span>                :       basic_string&amp;
-<span class="lineNum">     928 </span><span class="lineNoCov">              0 :       assign(const _CharT* __s)</span>
-<span class="lineNum">     929 </span>                :       {
-<span class="lineNum">     930 </span>                :         __glibcxx_requires_string(__s);
-<span class="lineNum">     931 </span><span class="lineNoCov">              0 :         return this-&gt;assign(__s, traits_type::length(__s));</span>
-<span class="lineNum">     932 </span>                :       }
-<span class="lineNum">     933 </span>                : 
-<span class="lineNum">     934 </span>                :       /**
-<span class="lineNum">     935 </span>                :        *  @brief  Set value to multiple characters.
-<span class="lineNum">     936 </span>                :        *  @param n  Length of the resulting string.
-<span class="lineNum">     937 </span>                :        *  @param c  The character to use.
-<span class="lineNum">     938 </span>                :        *  @return  Reference to this string.
-<span class="lineNum">     939 </span>                :        *
-<span class="lineNum">     940 </span>                :        *  This function sets the value of this string to @a n copies of
-<span class="lineNum">     941 </span>                :        *  character @a c.
-<span class="lineNum">     942 </span>                :        */
-<span class="lineNum">     943 </span>                :       basic_string&amp;
-<span class="lineNum">     944 </span>                :       assign(size_type __n, _CharT __c)
-<span class="lineNum">     945 </span>                :       { return _M_replace_aux(size_type(0), this-&gt;size(), __n, __c); }
-<span class="lineNum">     946 </span>                : 
-<span class="lineNum">     947 </span>                :       /**
-<span class="lineNum">     948 </span>                :        *  @brief  Set value to a range of characters.
-<span class="lineNum">     949 </span>                :        *  @param first  Iterator referencing the first character to append.
-<span class="lineNum">     950 </span>                :        *  @param last  Iterator marking the end of the range.
-<span class="lineNum">     951 </span>                :        *  @return  Reference to this string.
-<span class="lineNum">     952 </span>                :        *
-<span class="lineNum">     953 </span>                :        *  Sets value of string to characters in the range [first,last).
-<span class="lineNum">     954 </span>                :       */
-<span class="lineNum">     955 </span>                :       template&lt;class _InputIterator&gt;
-<span class="lineNum">     956 </span>                :         basic_string&amp;
-<span class="lineNum">     957 </span>                :         assign(_InputIterator __first, _InputIterator __last)
-<span class="lineNum">     958 </span>                :         { return this-&gt;replace(_M_ibegin(), _M_iend(), __first, __last); }
-<span class="lineNum">     959 </span>                : 
-<span class="lineNum">     960 </span>                :       /**
-<span class="lineNum">     961 </span>                :        *  @brief  Insert multiple characters.
-<span class="lineNum">     962 </span>                :        *  @param p  Iterator referencing location in string to insert at.
-<span class="lineNum">     963 </span>                :        *  @param n  Number of characters to insert
-<span class="lineNum">     964 </span>                :        *  @param c  The character to insert.
-<span class="lineNum">     965 </span>                :        *  @throw  std::length_error  If new length exceeds @c max_size().
-<span class="lineNum">     966 </span>                :        *
-<span class="lineNum">     967 </span>                :        *  Inserts @a n copies of character @a c starting at the position
-<span class="lineNum">     968 </span>                :        *  referenced by iterator @a p.  If adding characters causes the length
-<span class="lineNum">     969 </span>                :        *  to exceed max_size(), length_error is thrown.  The value of the
-<span class="lineNum">     970 </span>                :        *  string doesn't change if an error is thrown.
-<span class="lineNum">     971 </span>                :       */
-<span class="lineNum">     972 </span>                :       void
-<span class="lineNum">     973 </span>                :       insert(iterator __p, size_type __n, _CharT __c)
-<span class="lineNum">     974 </span>                :       { this-&gt;replace(__p, __p, __n, __c);  }
-<span class="lineNum">     975 </span>                : 
-<span class="lineNum">     976 </span>                :       /**
-<span class="lineNum">     977 </span>                :        *  @brief  Insert a range of characters.
-<span class="lineNum">     978 </span>                :        *  @param p  Iterator referencing location in string to insert at.
-<span class="lineNum">     979 </span>                :        *  @param beg  Start of range.
-<span class="lineNum">     980 </span>                :        *  @param end  End of range.
-<span class="lineNum">     981 </span>                :        *  @throw  std::length_error  If new length exceeds @c max_size().
-<span class="lineNum">     982 </span>                :        *
-<span class="lineNum">     983 </span>                :        *  Inserts characters in range [beg,end).  If adding characters causes
-<span class="lineNum">     984 </span>                :        *  the length to exceed max_size(), length_error is thrown.  The value
-<span class="lineNum">     985 </span>                :        *  of the string doesn't change if an error is thrown.
-<span class="lineNum">     986 </span>                :       */
-<span class="lineNum">     987 </span>                :       template&lt;class _InputIterator&gt;
-<span class="lineNum">     988 </span>                :         void
-<span class="lineNum">     989 </span>                :         insert(iterator __p, _InputIterator __beg, _InputIterator __end)
-<span class="lineNum">     990 </span>                :         { this-&gt;replace(__p, __p, __beg, __end); }
-<span class="lineNum">     991 </span>                : 
-<span class="lineNum">     992 </span>                :       /**
-<span class="lineNum">     993 </span>                :        *  @brief  Insert value of a string.
-<span class="lineNum">     994 </span>                :        *  @param pos1  Iterator referencing location in string to insert at.
-<span class="lineNum">     995 </span>                :        *  @param str  The string to insert.
-<span class="lineNum">     996 </span>                :        *  @return  Reference to this string.
-<span class="lineNum">     997 </span>                :        *  @throw  std::length_error  If new length exceeds @c max_size().
-<span class="lineNum">     998 </span>                :        *
-<span class="lineNum">     999 </span>                :        *  Inserts value of @a str starting at @a pos1.  If adding characters
-<span class="lineNum">    1000 </span>                :        *  causes the length to exceed max_size(), length_error is thrown.  The
-<span class="lineNum">    1001 </span>                :        *  value of the string doesn't change if an error is thrown.
-<span class="lineNum">    1002 </span>                :       */
-<span class="lineNum">    1003 </span>                :       basic_string&amp;
-<span class="lineNum">    1004 </span>                :       insert(size_type __pos1, const basic_string&amp; __str)
-<span class="lineNum">    1005 </span>                :       { return this-&gt;insert(__pos1, __str, size_type(0), __str.size()); }
-<span class="lineNum">    1006 </span>                : 
-<span class="lineNum">    1007 </span>                :       /**
-<span class="lineNum">    1008 </span>                :        *  @brief  Insert a substring.
-<span class="lineNum">    1009 </span>                :        *  @param pos1  Iterator referencing location in string to insert at.
-<span class="lineNum">    1010 </span>                :        *  @param str  The string to insert.
-<span class="lineNum">    1011 </span>                :        *  @param pos2  Start of characters in str to insert.
-<span class="lineNum">    1012 </span>                :        *  @param n  Number of characters to insert.
-<span class="lineNum">    1013 </span>                :        *  @return  Reference to this string.
-<span class="lineNum">    1014 </span>                :        *  @throw  std::length_error  If new length exceeds @c max_size().
-<span class="lineNum">    1015 </span>                :        *  @throw  std::out_of_range  If @a pos1 &gt; size() or
-<span class="lineNum">    1016 </span>                :        *  @a pos2 &gt; @a str.size().
-<span class="lineNum">    1017 </span>                :        *
-<span class="lineNum">    1018 </span>                :        *  Starting at @a pos1, insert @a n character of @a str beginning with
-<span class="lineNum">    1019 </span>                :        *  @a pos2.  If adding characters causes the length to exceed
-<span class="lineNum">    1020 </span>                :        *  max_size(), length_error is thrown.  If @a pos1 is beyond the end of
-<span class="lineNum">    1021 </span>                :        *  this string or @a pos2 is beyond the end of @a str, out_of_range is
-<span class="lineNum">    1022 </span>                :        *  thrown.  The value of the string doesn't change if an error is
-<span class="lineNum">    1023 </span>                :        *  thrown.
-<span class="lineNum">    1024 </span>                :       */
-<span class="lineNum">    1025 </span>                :       basic_string&amp;
-<span class="lineNum">    1026 </span>                :       insert(size_type __pos1, const basic_string&amp; __str,
-<span class="lineNum">    1027 </span>                :              size_type __pos2, size_type __n)
-<span class="lineNum">    1028 </span>                :       { return this-&gt;insert(__pos1, __str._M_data()
-<span class="lineNum">    1029 </span>                :                             + __str._M_check(__pos2, &quot;basic_string::insert&quot;),
-<span class="lineNum">    1030 </span>                :                             __str._M_limit(__pos2, __n)); }
-<span class="lineNum">    1031 </span>                : 
-<span class="lineNum">    1032 </span>                :       /**
-<span class="lineNum">    1033 </span>                :        *  @brief  Insert a C substring.
-<span class="lineNum">    1034 </span>                :        *  @param pos  Iterator referencing location in string to insert at.
-<span class="lineNum">    1035 </span>                :        *  @param s  The C string to insert.
-<span class="lineNum">    1036 </span>                :        *  @param n  The number of characters to insert.
-<span class="lineNum">    1037 </span>                :        *  @return  Reference to this string.
-<span class="lineNum">    1038 </span>                :        *  @throw  std::length_error  If new length exceeds @c max_size().
-<span class="lineNum">    1039 </span>                :        *  @throw  std::out_of_range  If @a pos is beyond the end of this
-<span class="lineNum">    1040 </span>                :        *  string.
-<span class="lineNum">    1041 </span>                :        *
-<span class="lineNum">    1042 </span>                :        *  Inserts the first @a n characters of @a s starting at @a pos.  If
-<span class="lineNum">    1043 </span>                :        *  adding characters causes the length to exceed max_size(),
-<span class="lineNum">    1044 </span>                :        *  length_error is thrown.  If @a pos is beyond end(), out_of_range is
-<span class="lineNum">    1045 </span>                :        *  thrown.  The value of the string doesn't change if an error is
-<span class="lineNum">    1046 </span>                :        *  thrown.
-<span class="lineNum">    1047 </span>                :       */
-<span class="lineNum">    1048 </span>                :       basic_string&amp;
-<span class="lineNum">    1049 </span>                :       insert(size_type __pos, const _CharT* __s, size_type __n);
-<span class="lineNum">    1050 </span>                : 
-<span class="lineNum">    1051 </span>                :       /**
-<span class="lineNum">    1052 </span>                :        *  @brief  Insert a C string.
-<span class="lineNum">    1053 </span>                :        *  @param pos  Iterator referencing location in string to insert at.
-<span class="lineNum">    1054 </span>                :        *  @param s  The C string to insert.
-<span class="lineNum">    1055 </span>                :        *  @return  Reference to this string.
-<span class="lineNum">    1056 </span>                :        *  @throw  std::length_error  If new length exceeds @c max_size().
-<span class="lineNum">    1057 </span>                :        *  @throw  std::out_of_range  If @a pos is beyond the end of this
-<span class="lineNum">    1058 </span>                :        *  string.
-<span class="lineNum">    1059 </span>                :        *
-<span class="lineNum">    1060 </span>                :        *  Inserts the first @a n characters of @a s starting at @a pos.  If
-<span class="lineNum">    1061 </span>                :        *  adding characters causes the length to exceed max_size(),
-<span class="lineNum">    1062 </span>                :        *  length_error is thrown.  If @a pos is beyond end(), out_of_range is
-<span class="lineNum">    1063 </span>                :        *  thrown.  The value of the string doesn't change if an error is
-<span class="lineNum">    1064 </span>                :        *  thrown.
-<span class="lineNum">    1065 </span>                :       */
-<span class="lineNum">    1066 </span>                :       basic_string&amp;
-<span class="lineNum">    1067 </span>                :       insert(size_type __pos, const _CharT* __s)
-<span class="lineNum">    1068 </span>                :       {
-<span class="lineNum">    1069 </span>                :         __glibcxx_requires_string(__s);
-<span class="lineNum">    1070 </span>                :         return this-&gt;insert(__pos, __s, traits_type::length(__s));
-<span class="lineNum">    1071 </span>                :       }
-<span class="lineNum">    1072 </span>                : 
-<span class="lineNum">    1073 </span>                :       /**
-<span class="lineNum">    1074 </span>                :        *  @brief  Insert multiple characters.
-<span class="lineNum">    1075 </span>                :        *  @param pos  Index in string to insert at.
-<span class="lineNum">    1076 </span>                :        *  @param n  Number of characters to insert
-<span class="lineNum">    1077 </span>                :        *  @param c  The character to insert.
-<span class="lineNum">    1078 </span>                :        *  @return  Reference to this string.
-<span class="lineNum">    1079 </span>                :        *  @throw  std::length_error  If new length exceeds @c max_size().
-<span class="lineNum">    1080 </span>                :        *  @throw  std::out_of_range  If @a pos is beyond the end of this
-<span class="lineNum">    1081 </span>                :        *  string.
-<span class="lineNum">    1082 </span>                :        *
-<span class="lineNum">    1083 </span>                :        *  Inserts @a n copies of character @a c starting at index @a pos.  If
-<span class="lineNum">    1084 </span>                :        *  adding characters causes the length to exceed max_size(),
-<span class="lineNum">    1085 </span>                :        *  length_error is thrown.  If @a pos &gt; length(), out_of_range is
-<span class="lineNum">    1086 </span>                :        *  thrown.  The value of the string doesn't change if an error is
-<span class="lineNum">    1087 </span>                :        *  thrown.
-<span class="lineNum">    1088 </span>                :       */
-<span class="lineNum">    1089 </span>                :       basic_string&amp;
-<span class="lineNum">    1090 </span>                :       insert(size_type __pos, size_type __n, _CharT __c)
-<span class="lineNum">    1091 </span>                :       { return _M_replace_aux(_M_check(__pos, &quot;basic_string::insert&quot;),
-<span class="lineNum">    1092 </span>                :                               size_type(0), __n, __c); }
-<span class="lineNum">    1093 </span>                : 
-<span class="lineNum">    1094 </span>                :       /**
-<span class="lineNum">    1095 </span>                :        *  @brief  Insert one character.
-<span class="lineNum">    1096 </span>                :        *  @param p  Iterator referencing position in string to insert at.
-<span class="lineNum">    1097 </span>                :        *  @param c  The character to insert.
-<span class="lineNum">    1098 </span>                :        *  @return  Iterator referencing newly inserted char.
-<span class="lineNum">    1099 </span>                :        *  @throw  std::length_error  If new length exceeds @c max_size().
-<span class="lineNum">    1100 </span>                :        *
-<span class="lineNum">    1101 </span>                :        *  Inserts character @a c at position referenced by @a p.  If adding
-<span class="lineNum">    1102 </span>                :        *  character causes the length to exceed max_size(), length_error is
-<span class="lineNum">    1103 </span>                :        *  thrown.  If @a p is beyond end of string, out_of_range is thrown.
-<span class="lineNum">    1104 </span>                :        *  The value of the string doesn't change if an error is thrown.
-<span class="lineNum">    1105 </span>                :       */
-<span class="lineNum">    1106 </span>                :       iterator
-<span class="lineNum">    1107 </span>                :       insert(iterator __p, _CharT __c)
-<span class="lineNum">    1108 </span>                :       {
-<span class="lineNum">    1109 </span>                :         _GLIBCXX_DEBUG_PEDASSERT(__p &gt;= _M_ibegin() &amp;&amp; __p &lt;= _M_iend());
-<span class="lineNum">    1110 </span>                :         const size_type __pos = __p - _M_ibegin();
-<span class="lineNum">    1111 </span>                :         _M_replace_aux(__pos, size_type(0), size_type(1), __c);
-<span class="lineNum">    1112 </span>                :         _M_rep()-&gt;_M_set_leaked();
-<span class="lineNum">    1113 </span>                :         return iterator(_M_data() + __pos);
-<span class="lineNum">    1114 </span>                :       }
-<span class="lineNum">    1115 </span>                : 
-<span class="lineNum">    1116 </span>                :       /**
-<span class="lineNum">    1117 </span>                :        *  @brief  Remove characters.
-<span class="lineNum">    1118 </span>                :        *  @param pos  Index of first character to remove (default 0).
-<span class="lineNum">    1119 </span>                :        *  @param n  Number of characters to remove (default remainder).
-<span class="lineNum">    1120 </span>                :        *  @return  Reference to this string.
-<span class="lineNum">    1121 </span>                :        *  @throw  std::out_of_range  If @a pos is beyond the end of this
-<span class="lineNum">    1122 </span>                :        *  string.
-<span class="lineNum">    1123 </span>                :        *
-<span class="lineNum">    1124 </span>                :        *  Removes @a n characters from this string starting at @a pos.  The
-<span class="lineNum">    1125 </span>                :        *  length of the string is reduced by @a n.  If there are &lt; @a n
-<span class="lineNum">    1126 </span>                :        *  characters to remove, the remainder of the string is truncated.  If
-<span class="lineNum">    1127 </span>                :        *  @a p is beyond end of string, out_of_range is thrown.  The value of
-<span class="lineNum">    1128 </span>                :        *  the string doesn't change if an error is thrown.
-<span class="lineNum">    1129 </span>                :       */
-<span class="lineNum">    1130 </span>                :       basic_string&amp;
-<span class="lineNum">    1131 </span>                :       erase(size_type __pos = 0, size_type __n = npos)
-<span class="lineNum">    1132 </span>                :       { 
-<span class="lineNum">    1133 </span>                :         _M_mutate(_M_check(__pos, &quot;basic_string::erase&quot;),
-<span class="lineNum">    1134 </span>                :                   _M_limit(__pos, __n), size_type(0));
-<span class="lineNum">    1135 </span>                :         return *this;
-<span class="lineNum">    1136 </span>                :       }
-<span class="lineNum">    1137 </span>                : 
-<span class="lineNum">    1138 </span>                :       /**
-<span class="lineNum">    1139 </span>                :        *  @brief  Remove one character.
-<span class="lineNum">    1140 </span>                :        *  @param position  Iterator referencing the character to remove.
-<span class="lineNum">    1141 </span>                :        *  @return  iterator referencing same location after removal.
-<span class="lineNum">    1142 </span>                :        *
-<span class="lineNum">    1143 </span>                :        *  Removes the character at @a position from this string. The value
-<span class="lineNum">    1144 </span>                :        *  of the string doesn't change if an error is thrown.
-<span class="lineNum">    1145 </span>                :       */
-<span class="lineNum">    1146 </span>                :       iterator
-<span class="lineNum">    1147 </span><span class="lineNoCov">              0 :       erase(iterator __position)</span>
-<span class="lineNum">    1148 </span>                :       {
-<span class="lineNum">    1149 </span>                :         _GLIBCXX_DEBUG_PEDASSERT(__position &gt;= _M_ibegin()
-<span class="lineNum">    1150 </span>                :                                  &amp;&amp; __position &lt; _M_iend());
-<span class="lineNum">    1151 </span><span class="lineNoCov">              0 :         const size_type __pos = __position - _M_ibegin();</span>
-<span class="lineNum">    1152 </span><span class="lineNoCov">              0 :         _M_mutate(__pos, size_type(1), size_type(0));</span>
-<span class="lineNum">    1153 </span><span class="lineNoCov">              0 :         _M_rep()-&gt;_M_set_leaked();</span>
-<span class="lineNum">    1154 </span><span class="lineNoCov">              0 :         return iterator(_M_data() + __pos);</span>
-<span class="lineNum">    1155 </span>                :       }
-<span class="lineNum">    1156 </span>                : 
-<span class="lineNum">    1157 </span>                :       /**
-<span class="lineNum">    1158 </span>                :        *  @brief  Remove a range of characters.
-<span class="lineNum">    1159 </span>                :        *  @param first  Iterator referencing the first character to remove.
-<span class="lineNum">    1160 </span>                :        *  @param last  Iterator referencing the end of the range.
-<span class="lineNum">    1161 </span>                :        *  @return  Iterator referencing location of first after removal.
-<span class="lineNum">    1162 </span>                :        *
-<span class="lineNum">    1163 </span>                :        *  Removes the characters in the range [first,last) from this string.
-<span class="lineNum">    1164 </span>                :        *  The value of the string doesn't change if an error is thrown.
-<span class="lineNum">    1165 </span>                :       */
-<span class="lineNum">    1166 </span>                :       iterator
-<span class="lineNum">    1167 </span>                :       erase(iterator __first, iterator __last)
-<span class="lineNum">    1168 </span>                :       {
-<span class="lineNum">    1169 </span>                :         _GLIBCXX_DEBUG_PEDASSERT(__first &gt;= _M_ibegin() &amp;&amp; __first &lt;= __last
-<span class="lineNum">    1170 </span>                :                                  &amp;&amp; __last &lt;= _M_iend());
-<span class="lineNum">    1171 </span>                :         const size_type __pos = __first - _M_ibegin();
-<span class="lineNum">    1172 </span>                :         _M_mutate(__pos, __last - __first, size_type(0));
-<span class="lineNum">    1173 </span>                :         _M_rep()-&gt;_M_set_leaked();
-<span class="lineNum">    1174 </span>                :         return iterator(_M_data() + __pos);
-<span class="lineNum">    1175 </span>                :       }
-<span class="lineNum">    1176 </span>                : 
-<span class="lineNum">    1177 </span>                :       /**
-<span class="lineNum">    1178 </span>                :        *  @brief  Replace characters with value from another string.
-<span class="lineNum">    1179 </span>                :        *  @param pos  Index of first character to replace.
-<span class="lineNum">    1180 </span>                :        *  @param n  Number of characters to be replaced.
-<span class="lineNum">    1181 </span>                :        *  @param str  String to insert.
-<span class="lineNum">    1182 </span>                :        *  @return  Reference to this string.
-<span class="lineNum">    1183 </span>                :        *  @throw  std::out_of_range  If @a pos is beyond the end of this
-<span class="lineNum">    1184 </span>                :        *  string.
-<span class="lineNum">    1185 </span>                :        *  @throw  std::length_error  If new length exceeds @c max_size().
-<span class="lineNum">    1186 </span>                :        *
-<span class="lineNum">    1187 </span>                :        *  Removes the characters in the range [pos,pos+n) from this string.
-<span class="lineNum">    1188 </span>                :        *  In place, the value of @a str is inserted.  If @a pos is beyond end
-<span class="lineNum">    1189 </span>                :        *  of string, out_of_range is thrown.  If the length of the result
-<span class="lineNum">    1190 </span>                :        *  exceeds max_size(), length_error is thrown.  The value of the string
-<span class="lineNum">    1191 </span>                :        *  doesn't change if an error is thrown.
-<span class="lineNum">    1192 </span>                :       */
-<span class="lineNum">    1193 </span>                :       basic_string&amp;
-<span class="lineNum">    1194 </span>                :       replace(size_type __pos, size_type __n, const basic_string&amp; __str)
-<span class="lineNum">    1195 </span>                :       { return this-&gt;replace(__pos, __n, __str._M_data(), __str.size()); }
-<span class="lineNum">    1196 </span>                : 
-<span class="lineNum">    1197 </span>                :       /**
-<span class="lineNum">    1198 </span>                :        *  @brief  Replace characters with value from another string.
-<span class="lineNum">    1199 </span>                :        *  @param pos1  Index of first character to replace.
-<span class="lineNum">    1200 </span>                :        *  @param n1  Number of characters to be replaced.
-<span class="lineNum">    1201 </span>                :        *  @param str  String to insert.
-<span class="lineNum">    1202 </span>                :        *  @param pos2  Index of first character of str to use.
-<span class="lineNum">    1203 </span>                :        *  @param n2  Number of characters from str to use.
-<span class="lineNum">    1204 </span>                :        *  @return  Reference to this string.
-<span class="lineNum">    1205 </span>                :        *  @throw  std::out_of_range  If @a pos1 &gt; size() or @a pos2 &gt;
-<span class="lineNum">    1206 </span>                :        *  str.size().
-<span class="lineNum">    1207 </span>                :        *  @throw  std::length_error  If new length exceeds @c max_size().
-<span class="lineNum">    1208 </span>                :        *
-<span class="lineNum">    1209 </span>                :        *  Removes the characters in the range [pos1,pos1 + n) from this
-<span class="lineNum">    1210 </span>                :        *  string.  In place, the value of @a str is inserted.  If @a pos is
-<span class="lineNum">    1211 </span>                :        *  beyond end of string, out_of_range is thrown.  If the length of the
-<span class="lineNum">    1212 </span>                :        *  result exceeds max_size(), length_error is thrown.  The value of the
-<span class="lineNum">    1213 </span>                :        *  string doesn't change if an error is thrown.
-<span class="lineNum">    1214 </span>                :       */
-<span class="lineNum">    1215 </span>                :       basic_string&amp;
-<span class="lineNum">    1216 </span>                :       replace(size_type __pos1, size_type __n1, const basic_string&amp; __str,
-<span class="lineNum">    1217 </span>                :               size_type __pos2, size_type __n2)
-<span class="lineNum">    1218 </span>                :       { return this-&gt;replace(__pos1, __n1, __str._M_data()
-<span class="lineNum">    1219 </span>                :                              + __str._M_check(__pos2, &quot;basic_string::replace&quot;),
-<span class="lineNum">    1220 </span>                :                              __str._M_limit(__pos2, __n2)); }
-<span class="lineNum">    1221 </span>                : 
-<span class="lineNum">    1222 </span>                :       /**
-<span class="lineNum">    1223 </span>                :        *  @brief  Replace characters with value of a C substring.
-<span class="lineNum">    1224 </span>                :        *  @param pos  Index of first character to replace.
-<span class="lineNum">    1225 </span>                :        *  @param n1  Number of characters to be replaced.
-<span class="lineNum">    1226 </span>                :        *  @param s  C string to insert.
-<span class="lineNum">    1227 </span>                :        *  @param n2  Number of characters from @a s to use.
-<span class="lineNum">    1228 </span>                :        *  @return  Reference to this string.
-<span class="lineNum">    1229 </span>                :        *  @throw  std::out_of_range  If @a pos1 &gt; size().
-<span class="lineNum">    1230 </span>                :        *  @throw  std::length_error  If new length exceeds @c max_size().
-<span class="lineNum">    1231 </span>                :        *
-<span class="lineNum">    1232 </span>                :        *  Removes the characters in the range [pos,pos + n1) from this string.
-<span class="lineNum">    1233 </span>                :        *  In place, the first @a n2 characters of @a s are inserted, or all
-<span class="lineNum">    1234 </span>                :        *  of @a s if @a n2 is too large.  If @a pos is beyond end of string,
-<span class="lineNum">    1235 </span>                :        *  out_of_range is thrown.  If the length of result exceeds max_size(),
-<span class="lineNum">    1236 </span>                :        *  length_error is thrown.  The value of the string doesn't change if
-<span class="lineNum">    1237 </span>                :        *  an error is thrown.
-<span class="lineNum">    1238 </span>                :       */
-<span class="lineNum">    1239 </span>                :       basic_string&amp;
-<span class="lineNum">    1240 </span>                :       replace(size_type __pos, size_type __n1, const _CharT* __s,
-<span class="lineNum">    1241 </span>                :               size_type __n2);
-<span class="lineNum">    1242 </span>                : 
-<span class="lineNum">    1243 </span>                :       /**
-<span class="lineNum">    1244 </span>                :        *  @brief  Replace characters with value of a C string.
-<span class="lineNum">    1245 </span>                :        *  @param pos  Index of first character to replace.
-<span class="lineNum">    1246 </span>                :        *  @param n1  Number of characters to be replaced.
-<span class="lineNum">    1247 </span>                :        *  @param s  C string to insert.
-<span class="lineNum">    1248 </span>                :        *  @return  Reference to this string.
-<span class="lineNum">    1249 </span>                :        *  @throw  std::out_of_range  If @a pos &gt; size().
-<span class="lineNum">    1250 </span>                :        *  @throw  std::length_error  If new length exceeds @c max_size().
-<span class="lineNum">    1251 </span>                :        *
-<span class="lineNum">    1252 </span>                :        *  Removes the characters in the range [pos,pos + n1) from this string.
-<span class="lineNum">    1253 </span>                :        *  In place, the first @a n characters of @a s are inserted.  If @a
-<span class="lineNum">    1254 </span>                :        *  pos is beyond end of string, out_of_range is thrown.  If the length
-<span class="lineNum">    1255 </span>                :        *  of result exceeds max_size(), length_error is thrown.  The value of
-<span class="lineNum">    1256 </span>                :        *  the string doesn't change if an error is thrown.
-<span class="lineNum">    1257 </span>                :       */
-<span class="lineNum">    1258 </span>                :       basic_string&amp;
-<span class="lineNum">    1259 </span>                :       replace(size_type __pos, size_type __n1, const _CharT* __s)
-<span class="lineNum">    1260 </span>                :       {
-<span class="lineNum">    1261 </span>                :         __glibcxx_requires_string(__s);
-<span class="lineNum">    1262 </span>                :         return this-&gt;replace(__pos, __n1, __s, traits_type::length(__s));
-<span class="lineNum">    1263 </span>                :       }
-<span class="lineNum">    1264 </span>                : 
-<span class="lineNum">    1265 </span>                :       /**
-<span class="lineNum">    1266 </span>                :        *  @brief  Replace characters with multiple characters.
-<span class="lineNum">    1267 </span>                :        *  @param pos  Index of first character to replace.
-<span class="lineNum">    1268 </span>                :        *  @param n1  Number of characters to be replaced.
-<span class="lineNum">    1269 </span>                :        *  @param n2  Number of characters to insert.
-<span class="lineNum">    1270 </span>                :        *  @param c  Character to insert.
-<span class="lineNum">    1271 </span>                :        *  @return  Reference to this string.
-<span class="lineNum">    1272 </span>                :        *  @throw  std::out_of_range  If @a pos &gt; size().
-<span class="lineNum">    1273 </span>                :        *  @throw  std::length_error  If new length exceeds @c max_size().
-<span class="lineNum">    1274 </span>                :        *
-<span class="lineNum">    1275 </span>                :        *  Removes the characters in the range [pos,pos + n1) from this string.
-<span class="lineNum">    1276 </span>                :        *  In place, @a n2 copies of @a c are inserted.  If @a pos is beyond
-<span class="lineNum">    1277 </span>                :        *  end of string, out_of_range is thrown.  If the length of result
-<span class="lineNum">    1278 </span>                :        *  exceeds max_size(), length_error is thrown.  The value of the string
-<span class="lineNum">    1279 </span>                :        *  doesn't change if an error is thrown.
-<span class="lineNum">    1280 </span>                :       */
-<span class="lineNum">    1281 </span>                :       basic_string&amp;
-<span class="lineNum">    1282 </span>                :       replace(size_type __pos, size_type __n1, size_type __n2, _CharT __c)
-<span class="lineNum">    1283 </span>                :       { return _M_replace_aux(_M_check(__pos, &quot;basic_string::replace&quot;),
-<span class="lineNum">    1284 </span>                :                               _M_limit(__pos, __n1), __n2, __c); }
-<span class="lineNum">    1285 </span>                : 
-<span class="lineNum">    1286 </span>                :       /**
-<span class="lineNum">    1287 </span>                :        *  @brief  Replace range of characters with string.
-<span class="lineNum">    1288 </span>                :        *  @param i1  Iterator referencing start of range to replace.
-<span class="lineNum">    1289 </span>                :        *  @param i2  Iterator referencing end of range to replace.
-<span class="lineNum">    1290 </span>                :        *  @param str  String value to insert.
-<span class="lineNum">    1291 </span>                :        *  @return  Reference to this string.
-<span class="lineNum">    1292 </span>                :        *  @throw  std::length_error  If new length exceeds @c max_size().
-<span class="lineNum">    1293 </span>                :        *
-<span class="lineNum">    1294 </span>                :        *  Removes the characters in the range [i1,i2).  In place, the value of
-<span class="lineNum">    1295 </span>                :        *  @a str is inserted.  If the length of result exceeds max_size(),
-<span class="lineNum">    1296 </span>                :        *  length_error is thrown.  The value of the string doesn't change if
-<span class="lineNum">    1297 </span>                :        *  an error is thrown.
-<span class="lineNum">    1298 </span>                :       */
-<span class="lineNum">    1299 </span>                :       basic_string&amp;
-<span class="lineNum">    1300 </span>                :       replace(iterator __i1, iterator __i2, const basic_string&amp; __str)
-<span class="lineNum">    1301 </span>                :       { return this-&gt;replace(__i1, __i2, __str._M_data(), __str.size()); }
-<span class="lineNum">    1302 </span>                : 
-<span class="lineNum">    1303 </span>                :       /**
-<span class="lineNum">    1304 </span>                :        *  @brief  Replace range of characters with C substring.
-<span class="lineNum">    1305 </span>                :        *  @param i1  Iterator referencing start of range to replace.
-<span class="lineNum">    1306 </span>                :        *  @param i2  Iterator referencing end of range to replace.
-<span class="lineNum">    1307 </span>                :        *  @param s  C string value to insert.
-<span class="lineNum">    1308 </span>                :        *  @param n  Number of characters from s to insert.
-<span class="lineNum">    1309 </span>                :        *  @return  Reference to this string.
-<span class="lineNum">    1310 </span>                :        *  @throw  std::length_error  If new length exceeds @c max_size().
-<span class="lineNum">    1311 </span>                :        *
-<span class="lineNum">    1312 </span>                :        *  Removes the characters in the range [i1,i2).  In place, the first @a
-<span class="lineNum">    1313 </span>                :        *  n characters of @a s are inserted.  If the length of result exceeds
-<span class="lineNum">    1314 </span>                :        *  max_size(), length_error is thrown.  The value of the string doesn't
-<span class="lineNum">    1315 </span>                :        *  change if an error is thrown.
-<span class="lineNum">    1316 </span>                :       */
-<span class="lineNum">    1317 </span>                :       basic_string&amp;
-<span class="lineNum">    1318 </span>                :       replace(iterator __i1, iterator __i2, const _CharT* __s, size_type __n)
-<span class="lineNum">    1319 </span>                :       {
-<span class="lineNum">    1320 </span>                :         _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() &lt;= __i1 &amp;&amp; __i1 &lt;= __i2
-<span class="lineNum">    1321 </span>                :                                  &amp;&amp; __i2 &lt;= _M_iend());
-<span class="lineNum">    1322 </span>                :         return this-&gt;replace(__i1 - _M_ibegin(), __i2 - __i1, __s, __n);
-<span class="lineNum">    1323 </span>                :       }
-<span class="lineNum">    1324 </span>                : 
-<span class="lineNum">    1325 </span>                :       /**
-<span class="lineNum">    1326 </span>                :        *  @brief  Replace range of characters with C string.
-<span class="lineNum">    1327 </span>                :        *  @param i1  Iterator referencing start of range to replace.
-<span class="lineNum">    1328 </span>                :        *  @param i2  Iterator referencing end of range to replace.
-<span class="lineNum">    1329 </span>                :        *  @param s  C string value to insert.
-<span class="lineNum">    1330 </span>                :        *  @return  Reference to this string.
-<span class="lineNum">    1331 </span>                :        *  @throw  std::length_error  If new length exceeds @c max_size().
-<span class="lineNum">    1332 </span>                :        *
-<span class="lineNum">    1333 </span>                :        *  Removes the characters in the range [i1,i2).  In place, the
-<span class="lineNum">    1334 </span>                :        *  characters of @a s are inserted.  If the length of result exceeds
-<span class="lineNum">    1335 </span>                :        *  max_size(), length_error is thrown.  The value of the string doesn't
-<span class="lineNum">    1336 </span>                :        *  change if an error is thrown.
-<span class="lineNum">    1337 </span>                :       */
-<span class="lineNum">    1338 </span>                :       basic_string&amp;
-<span class="lineNum">    1339 </span>                :       replace(iterator __i1, iterator __i2, const _CharT* __s)
-<span class="lineNum">    1340 </span>                :       {
-<span class="lineNum">    1341 </span>                :         __glibcxx_requires_string(__s);
-<span class="lineNum">    1342 </span>                :         return this-&gt;replace(__i1, __i2, __s, traits_type::length(__s));
-<span class="lineNum">    1343 </span>                :       }
-<span class="lineNum">    1344 </span>                : 
-<span class="lineNum">    1345 </span>                :       /**
-<span class="lineNum">    1346 </span>                :        *  @brief  Replace range of characters with multiple characters
-<span class="lineNum">    1347 </span>                :        *  @param i1  Iterator referencing start of range to replace.
-<span class="lineNum">    1348 </span>                :        *  @param i2  Iterator referencing end of range to replace.
-<span class="lineNum">    1349 </span>                :        *  @param n  Number of characters to insert.
-<span class="lineNum">    1350 </span>                :        *  @param c  Character to insert.
-<span class="lineNum">    1351 </span>                :        *  @return  Reference to this string.
-<span class="lineNum">    1352 </span>                :        *  @throw  std::length_error  If new length exceeds @c max_size().
-<span class="lineNum">    1353 </span>                :        *
-<span class="lineNum">    1354 </span>                :        *  Removes the characters in the range [i1,i2).  In place, @a n copies
-<span class="lineNum">    1355 </span>                :        *  of @a c are inserted.  If the length of result exceeds max_size(),
-<span class="lineNum">    1356 </span>                :        *  length_error is thrown.  The value of the string doesn't change if
-<span class="lineNum">    1357 </span>                :        *  an error is thrown.
-<span class="lineNum">    1358 </span>                :       */
-<span class="lineNum">    1359 </span>                :       basic_string&amp;
-<span class="lineNum">    1360 </span>                :       replace(iterator __i1, iterator __i2, size_type __n, _CharT __c)
-<span class="lineNum">    1361 </span>                :       {
-<span class="lineNum">    1362 </span>                :         _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() &lt;= __i1 &amp;&amp; __i1 &lt;= __i2
-<span class="lineNum">    1363 </span>                :                                  &amp;&amp; __i2 &lt;= _M_iend());
-<span class="lineNum">    1364 </span>                :         return _M_replace_aux(__i1 - _M_ibegin(), __i2 - __i1, __n, __c);
-<span class="lineNum">    1365 </span>                :       }
-<span class="lineNum">    1366 </span>                : 
-<span class="lineNum">    1367 </span>                :       /**
-<span class="lineNum">    1368 </span>                :        *  @brief  Replace range of characters with range.
-<span class="lineNum">    1369 </span>                :        *  @param i1  Iterator referencing start of range to replace.
-<span class="lineNum">    1370 </span>                :        *  @param i2  Iterator referencing end of range to replace.
-<span class="lineNum">    1371 </span>                :        *  @param k1  Iterator referencing start of range to insert.
-<span class="lineNum">    1372 </span>                :        *  @param k2  Iterator referencing end of range to insert.
-<span class="lineNum">    1373 </span>                :        *  @return  Reference to this string.
-<span class="lineNum">    1374 </span>                :        *  @throw  std::length_error  If new length exceeds @c max_size().
-<span class="lineNum">    1375 </span>                :        *
-<span class="lineNum">    1376 </span>                :        *  Removes the characters in the range [i1,i2).  In place, characters
-<span class="lineNum">    1377 </span>                :        *  in the range [k1,k2) are inserted.  If the length of result exceeds
-<span class="lineNum">    1378 </span>                :        *  max_size(), length_error is thrown.  The value of the string doesn't
-<span class="lineNum">    1379 </span>                :        *  change if an error is thrown.
-<span class="lineNum">    1380 </span>                :       */
-<span class="lineNum">    1381 </span>                :       template&lt;class _InputIterator&gt;
-<span class="lineNum">    1382 </span>                :         basic_string&amp;
-<span class="lineNum">    1383 </span>                :         replace(iterator __i1, iterator __i2,
-<span class="lineNum">    1384 </span>                :                 _InputIterator __k1, _InputIterator __k2)
-<span class="lineNum">    1385 </span>                :         {
-<span class="lineNum">    1386 </span>                :           _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() &lt;= __i1 &amp;&amp; __i1 &lt;= __i2
-<span class="lineNum">    1387 </span>                :                                    &amp;&amp; __i2 &lt;= _M_iend());
-<span class="lineNum">    1388 </span>                :           __glibcxx_requires_valid_range(__k1, __k2);
-<span class="lineNum">    1389 </span>                :           typedef typename std::__is_integer&lt;_InputIterator&gt;::__type _Integral;
-<span class="lineNum">    1390 </span>                :           return _M_replace_dispatch(__i1, __i2, __k1, __k2, _Integral());
-<span class="lineNum">    1391 </span>                :         }
-<span class="lineNum">    1392 </span>                : 
-<span class="lineNum">    1393 </span>                :       // Specializations for the common case of pointer and iterator:
-<span class="lineNum">    1394 </span>                :       // useful to avoid the overhead of temporary buffering in _M_replace.
-<span class="lineNum">    1395 </span>                :       basic_string&amp;
-<span class="lineNum">    1396 </span>                :       replace(iterator __i1, iterator __i2, _CharT* __k1, _CharT* __k2)
-<span class="lineNum">    1397 </span>                :       {
-<span class="lineNum">    1398 </span>                :         _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() &lt;= __i1 &amp;&amp; __i1 &lt;= __i2
-<span class="lineNum">    1399 </span>                :                                  &amp;&amp; __i2 &lt;= _M_iend());
-<span class="lineNum">    1400 </span>                :         __glibcxx_requires_valid_range(__k1, __k2);
-<span class="lineNum">    1401 </span>                :         return this-&gt;replace(__i1 - _M_ibegin(), __i2 - __i1,
-<span class="lineNum">    1402 </span>                :                              __k1, __k2 - __k1);
-<span class="lineNum">    1403 </span>                :       }
-<span class="lineNum">    1404 </span>                : 
-<span class="lineNum">    1405 </span>                :       basic_string&amp;
-<span class="lineNum">    1406 </span>                :       replace(iterator __i1, iterator __i2,
-<span class="lineNum">    1407 </span>                :               const _CharT* __k1, const _CharT* __k2)
-<span class="lineNum">    1408 </span>                :       {
-<span class="lineNum">    1409 </span>                :         _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() &lt;= __i1 &amp;&amp; __i1 &lt;= __i2
-<span class="lineNum">    1410 </span>                :                                  &amp;&amp; __i2 &lt;= _M_iend());
-<span class="lineNum">    1411 </span>                :         __glibcxx_requires_valid_range(__k1, __k2);
-<span class="lineNum">    1412 </span>                :         return this-&gt;replace(__i1 - _M_ibegin(), __i2 - __i1,
-<span class="lineNum">    1413 </span>                :                              __k1, __k2 - __k1);
-<span class="lineNum">    1414 </span>                :       }
-<span class="lineNum">    1415 </span>                : 
-<span class="lineNum">    1416 </span>                :       basic_string&amp;
-<span class="lineNum">    1417 </span>                :       replace(iterator __i1, iterator __i2, iterator __k1, iterator __k2)
-<span class="lineNum">    1418 </span>                :       {
-<span class="lineNum">    1419 </span>                :         _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() &lt;= __i1 &amp;&amp; __i1 &lt;= __i2
-<span class="lineNum">    1420 </span>                :                                  &amp;&amp; __i2 &lt;= _M_iend());
-<span class="lineNum">    1421 </span>                :         __glibcxx_requires_valid_range(__k1, __k2);
-<span class="lineNum">    1422 </span>                :         return this-&gt;replace(__i1 - _M_ibegin(), __i2 - __i1,
-<span class="lineNum">    1423 </span>                :                              __k1.base(), __k2 - __k1);
-<span class="lineNum">    1424 </span>                :       }
-<span class="lineNum">    1425 </span>                : 
-<span class="lineNum">    1426 </span>                :       basic_string&amp;
-<span class="lineNum">    1427 </span>                :       replace(iterator __i1, iterator __i2,
-<span class="lineNum">    1428 </span>                :               const_iterator __k1, const_iterator __k2)
-<span class="lineNum">    1429 </span>                :       {
-<span class="lineNum">    1430 </span>                :         _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() &lt;= __i1 &amp;&amp; __i1 &lt;= __i2
-<span class="lineNum">    1431 </span>                :                                  &amp;&amp; __i2 &lt;= _M_iend());
-<span class="lineNum">    1432 </span>                :         __glibcxx_requires_valid_range(__k1, __k2);
-<span class="lineNum">    1433 </span>                :         return this-&gt;replace(__i1 - _M_ibegin(), __i2 - __i1,
-<span class="lineNum">    1434 </span>                :                              __k1.base(), __k2 - __k1);
-<span class="lineNum">    1435 </span>                :       }
-<span class="lineNum">    1436 </span>                :       
-<span class="lineNum">    1437 </span>                :     private:
-<span class="lineNum">    1438 </span>                :       template&lt;class _Integer&gt;
-<span class="lineNum">    1439 </span>                :         basic_string&amp;
-<span class="lineNum">    1440 </span>                :         _M_replace_dispatch(iterator __i1, iterator __i2, _Integer __n,
-<span class="lineNum">    1441 </span>                :                             _Integer __val, __true_type)
-<span class="lineNum">    1442 </span>                :         { return _M_replace_aux(__i1 - _M_ibegin(), __i2 - __i1, __n, __val); }
-<span class="lineNum">    1443 </span>                : 
-<span class="lineNum">    1444 </span>                :       template&lt;class _InputIterator&gt;
-<span class="lineNum">    1445 </span>                :         basic_string&amp;
-<span class="lineNum">    1446 </span>                :         _M_replace_dispatch(iterator __i1, iterator __i2, _InputIterator __k1,
-<span class="lineNum">    1447 </span>                :                             _InputIterator __k2, __false_type);
-<span class="lineNum">    1448 </span>                : 
-<span class="lineNum">    1449 </span>                :       basic_string&amp;
-<span class="lineNum">    1450 </span>                :       _M_replace_aux(size_type __pos1, size_type __n1, size_type __n2,
-<span class="lineNum">    1451 </span>                :                      _CharT __c);
-<span class="lineNum">    1452 </span>                : 
-<span class="lineNum">    1453 </span>                :       basic_string&amp;
-<span class="lineNum">    1454 </span>                :       _M_replace_safe(size_type __pos1, size_type __n1, const _CharT* __s,
-<span class="lineNum">    1455 </span>                :                       size_type __n2);
-<span class="lineNum">    1456 </span>                : 
-<span class="lineNum">    1457 </span>                :       // _S_construct_aux is used to implement the 21.3.1 para 15 which
-<span class="lineNum">    1458 </span>                :       // requires special behaviour if _InIter is an integral type
-<span class="lineNum">    1459 </span>                :       template&lt;class _InIterator&gt;
-<span class="lineNum">    1460 </span>                :         static _CharT*
-<span class="lineNum">    1461 </span>                :         _S_construct_aux(_InIterator __beg, _InIterator __end,
-<span class="lineNum">    1462 </span><span class="lineCov">           1287 :                          const _Alloc&amp; __a, __false_type)</span>
-<span class="lineNum">    1463 </span>                :         {
-<span class="lineNum">    1464 </span>                :           typedef typename iterator_traits&lt;_InIterator&gt;::iterator_category _Tag;
-<span class="lineNum">    1465 </span><span class="lineCov">           1287 :           return _S_construct(__beg, __end, __a, _Tag());</span>
-<span class="lineNum">    1466 </span>                :         }
-<span class="lineNum">    1467 </span>                : 
-<span class="lineNum">    1468 </span>                :       // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">    1469 </span>                :       // 438. Ambiguity in the &quot;do the right thing&quot; clause
-<span class="lineNum">    1470 </span>                :       template&lt;class _Integer&gt;
-<span class="lineNum">    1471 </span>                :         static _CharT*
-<span class="lineNum">    1472 </span>                :         _S_construct_aux(_Integer __beg, _Integer __end,
-<span class="lineNum">    1473 </span>                :                          const _Alloc&amp; __a, __true_type)
-<span class="lineNum">    1474 </span>                :         { return _S_construct(static_cast&lt;size_type&gt;(__beg), __end, __a); }
-<span class="lineNum">    1475 </span>                : 
-<span class="lineNum">    1476 </span>                :       template&lt;class _InIterator&gt;
-<span class="lineNum">    1477 </span>                :         static _CharT*
-<span class="lineNum">    1478 </span><span class="lineCov">           1287 :         _S_construct(_InIterator __beg, _InIterator __end, const _Alloc&amp; __a)</span>
-<span class="lineNum">    1479 </span>                :         {
-<span class="lineNum">    1480 </span>                :           typedef typename std::__is_integer&lt;_InIterator&gt;::__type _Integral;
-<span class="lineNum">    1481 </span><span class="lineCov">           1287 :           return _S_construct_aux(__beg, __end, __a, _Integral());</span>
-<span class="lineNum">    1482 </span>                :         }
-<span class="lineNum">    1483 </span>                : 
-<span class="lineNum">    1484 </span>                :       // For Input Iterators, used in istreambuf_iterators, etc.
-<span class="lineNum">    1485 </span>                :       template&lt;class _InIterator&gt;
-<span class="lineNum">    1486 </span>                :         static _CharT*
-<span class="lineNum">    1487 </span>                :          _S_construct(_InIterator __beg, _InIterator __end, const _Alloc&amp; __a,
-<span class="lineNum">    1488 </span>                :                       input_iterator_tag);
-<span class="lineNum">    1489 </span>                : 
-<span class="lineNum">    1490 </span>                :       // For forward_iterators up to random_access_iterators, used for
-<span class="lineNum">    1491 </span>                :       // string::iterator, _CharT*, etc.
-<span class="lineNum">    1492 </span>                :       template&lt;class _FwdIterator&gt;
-<span class="lineNum">    1493 </span>                :         static _CharT*
-<span class="lineNum">    1494 </span>                :         _S_construct(_FwdIterator __beg, _FwdIterator __end, const _Alloc&amp; __a,
-<span class="lineNum">    1495 </span>                :                      forward_iterator_tag);
-<span class="lineNum">    1496 </span>                : 
-<span class="lineNum">    1497 </span>                :       static _CharT*
-<span class="lineNum">    1498 </span>                :       _S_construct(size_type __req, _CharT __c, const _Alloc&amp; __a);
-<span class="lineNum">    1499 </span>                : 
-<span class="lineNum">    1500 </span>                :     public:
-<span class="lineNum">    1501 </span>                : 
-<span class="lineNum">    1502 </span>                :       /**
-<span class="lineNum">    1503 </span>                :        *  @brief  Copy substring into C string.
-<span class="lineNum">    1504 </span>                :        *  @param s  C string to copy value into.
-<span class="lineNum">    1505 </span>                :        *  @param n  Number of characters to copy.
-<span class="lineNum">    1506 </span>                :        *  @param pos  Index of first character to copy.
-<span class="lineNum">    1507 </span>                :        *  @return  Number of characters actually copied
-<span class="lineNum">    1508 </span>                :        *  @throw  std::out_of_range  If pos &gt; size().
-<span class="lineNum">    1509 </span>                :        *
-<span class="lineNum">    1510 </span>                :        *  Copies up to @a n characters starting at @a pos into the C string @a
-<span class="lineNum">    1511 </span>                :        *  s.  If @a pos is greater than size(), out_of_range is thrown.
-<span class="lineNum">    1512 </span>                :       */
-<span class="lineNum">    1513 </span>                :       size_type
-<span class="lineNum">    1514 </span>                :       copy(_CharT* __s, size_type __n, size_type __pos = 0) const;
-<span class="lineNum">    1515 </span>                : 
-<span class="lineNum">    1516 </span>                :       /**
-<span class="lineNum">    1517 </span>                :        *  @brief  Swap contents with another string.
-<span class="lineNum">    1518 </span>                :        *  @param s  String to swap with.
-<span class="lineNum">    1519 </span>                :        *
-<span class="lineNum">    1520 </span>                :        *  Exchanges the contents of this string with that of @a s in constant
-<span class="lineNum">    1521 </span>                :        *  time.
-<span class="lineNum">    1522 </span>                :       */
-<span class="lineNum">    1523 </span>                :       void
-<span class="lineNum">    1524 </span>                :       swap(basic_string&amp; __s);
-<span class="lineNum">    1525 </span>                : 
-<span class="lineNum">    1526 </span>                :       // String operations:
-<span class="lineNum">    1527 </span>                :       /**
-<span class="lineNum">    1528 </span>                :        *  @brief  Return const pointer to null-terminated contents.
-<span class="lineNum">    1529 </span>                :        *
-<span class="lineNum">    1530 </span>                :        *  This is a handle to internal data.  Do not modify or dire things may
-<span class="lineNum">    1531 </span>                :        *  happen.
-<span class="lineNum">    1532 </span>                :       */
-<span class="lineNum">    1533 </span>                :       const _CharT*
-<span class="lineNum">    1534 </span><span class="lineNoCov">              0 :       c_str() const</span>
-<span class="lineNum">    1535 </span><span class="lineNoCov">              0 :       { return _M_data(); }</span>
-<span class="lineNum">    1536 </span>                : 
-<span class="lineNum">    1537 </span>                :       /**
-<span class="lineNum">    1538 </span>                :        *  @brief  Return const pointer to contents.
-<span class="lineNum">    1539 </span>                :        *
-<span class="lineNum">    1540 </span>                :        *  This is a handle to internal data.  Do not modify or dire things may
-<span class="lineNum">    1541 </span>                :        *  happen.
-<span class="lineNum">    1542 </span>                :       */
-<span class="lineNum">    1543 </span>                :       const _CharT*
-<span class="lineNum">    1544 </span><span class="lineNoCov">              0 :       data() const</span>
-<span class="lineNum">    1545 </span><span class="lineNoCov">              0 :       { return _M_data(); }</span>
-<span class="lineNum">    1546 </span>                : 
-<span class="lineNum">    1547 </span>                :       /**
-<span class="lineNum">    1548 </span>                :        *  @brief  Return copy of allocator used to construct this string.
-<span class="lineNum">    1549 </span>                :       */
-<span class="lineNum">    1550 </span>                :       allocator_type
-<span class="lineNum">    1551 </span><span class="lineNoCov">              0 :       get_allocator() const</span>
-<span class="lineNum">    1552 </span><span class="lineNoCov">              0 :       { return _M_dataplus; }</span>
-<span class="lineNum">    1553 </span>                : 
-<span class="lineNum">    1554 </span>                :       /**
-<span class="lineNum">    1555 </span>                :        *  @brief  Find position of a C substring.
-<span class="lineNum">    1556 </span>                :        *  @param s  C string to locate.
-<span class="lineNum">    1557 </span>                :        *  @param pos  Index of character to search from.
-<span class="lineNum">    1558 </span>                :        *  @param n  Number of characters from @a s to search for.
-<span class="lineNum">    1559 </span>                :        *  @return  Index of start of first occurrence.
-<span class="lineNum">    1560 </span>                :        *
-<span class="lineNum">    1561 </span>                :        *  Starting from @a pos, searches forward for the first @a n characters
-<span class="lineNum">    1562 </span>                :        *  in @a s within this string.  If found, returns the index where it
-<span class="lineNum">    1563 </span>                :        *  begins.  If not found, returns npos.
-<span class="lineNum">    1564 </span>                :       */
-<span class="lineNum">    1565 </span>                :       size_type
-<span class="lineNum">    1566 </span>                :       find(const _CharT* __s, size_type __pos, size_type __n) const;
-<span class="lineNum">    1567 </span>                : 
-<span class="lineNum">    1568 </span>                :       /**
-<span class="lineNum">    1569 </span>                :        *  @brief  Find position of a string.
-<span class="lineNum">    1570 </span>                :        *  @param str  String to locate.
-<span class="lineNum">    1571 </span>                :        *  @param pos  Index of character to search from (default 0).
-<span class="lineNum">    1572 </span>                :        *  @return  Index of start of first occurrence.
-<span class="lineNum">    1573 </span>                :        *
-<span class="lineNum">    1574 </span>                :        *  Starting from @a pos, searches forward for value of @a str within
-<span class="lineNum">    1575 </span>                :        *  this string.  If found, returns the index where it begins.  If not
-<span class="lineNum">    1576 </span>                :        *  found, returns npos.
-<span class="lineNum">    1577 </span>                :       */
-<span class="lineNum">    1578 </span>                :       size_type
-<span class="lineNum">    1579 </span><span class="lineNoCov">              0 :       find(const basic_string&amp; __str, size_type __pos = 0) const</span>
-<span class="lineNum">    1580 </span><span class="lineNoCov">              0 :       { return this-&gt;find(__str.data(), __pos, __str.size()); }</span>
-<span class="lineNum">    1581 </span>                : 
-<span class="lineNum">    1582 </span>                :       /**
-<span class="lineNum">    1583 </span>                :        *  @brief  Find position of a C string.
-<span class="lineNum">    1584 </span>                :        *  @param s  C string to locate.
-<span class="lineNum">    1585 </span>                :        *  @param pos  Index of character to search from (default 0).
-<span class="lineNum">    1586 </span>                :        *  @return  Index of start of first occurrence.
-<span class="lineNum">    1587 </span>                :        *
-<span class="lineNum">    1588 </span>                :        *  Starting from @a pos, searches forward for the value of @a s within
-<span class="lineNum">    1589 </span>                :        *  this string.  If found, returns the index where it begins.  If not
-<span class="lineNum">    1590 </span>                :        *  found, returns npos.
-<span class="lineNum">    1591 </span>                :       */
-<span class="lineNum">    1592 </span>                :       size_type
-<span class="lineNum">    1593 </span><span class="lineNoCov">              0 :       find(const _CharT* __s, size_type __pos = 0) const</span>
-<span class="lineNum">    1594 </span>                :       {
-<span class="lineNum">    1595 </span>                :         __glibcxx_requires_string(__s);
-<span class="lineNum">    1596 </span><span class="lineNoCov">              0 :         return this-&gt;find(__s, __pos, traits_type::length(__s));</span>
-<span class="lineNum">    1597 </span>                :       }
-<span class="lineNum">    1598 </span>                : 
-<span class="lineNum">    1599 </span>                :       /**
-<span class="lineNum">    1600 </span>                :        *  @brief  Find position of a character.
-<span class="lineNum">    1601 </span>                :        *  @param c  Character to locate.
-<span class="lineNum">    1602 </span>                :        *  @param pos  Index of character to search from (default 0).
-<span class="lineNum">    1603 </span>                :        *  @return  Index of first occurrence.
-<span class="lineNum">    1604 </span>                :        *
-<span class="lineNum">    1605 </span>                :        *  Starting from @a pos, searches forward for @a c within this string.
-<span class="lineNum">    1606 </span>                :        *  If found, returns the index where it was found.  If not found,
-<span class="lineNum">    1607 </span>                :        *  returns npos.
-<span class="lineNum">    1608 </span>                :       */
-<span class="lineNum">    1609 </span>                :       size_type
-<span class="lineNum">    1610 </span>                :       find(_CharT __c, size_type __pos = 0) const;
-<span class="lineNum">    1611 </span>                : 
-<span class="lineNum">    1612 </span>                :       /**
-<span class="lineNum">    1613 </span>                :        *  @brief  Find last position of a string.
-<span class="lineNum">    1614 </span>                :        *  @param str  String to locate.
-<span class="lineNum">    1615 </span>                :        *  @param pos  Index of character to search back from (default end).
-<span class="lineNum">    1616 </span>                :        *  @return  Index of start of last occurrence.
-<span class="lineNum">    1617 </span>                :        *
-<span class="lineNum">    1618 </span>                :        *  Starting from @a pos, searches backward for value of @a str within
-<span class="lineNum">    1619 </span>                :        *  this string.  If found, returns the index where it begins.  If not
-<span class="lineNum">    1620 </span>                :        *  found, returns npos.
-<span class="lineNum">    1621 </span>                :       */
-<span class="lineNum">    1622 </span>                :       size_type
-<span class="lineNum">    1623 </span>                :       rfind(const basic_string&amp; __str, size_type __pos = npos) const
-<span class="lineNum">    1624 </span>                :       { return this-&gt;rfind(__str.data(), __pos, __str.size()); }
-<span class="lineNum">    1625 </span>                : 
-<span class="lineNum">    1626 </span>                :       /**
-<span class="lineNum">    1627 </span>                :        *  @brief  Find last position of a C substring.
-<span class="lineNum">    1628 </span>                :        *  @param s  C string to locate.
-<span class="lineNum">    1629 </span>                :        *  @param pos  Index of character to search back from.
-<span class="lineNum">    1630 </span>                :        *  @param n  Number of characters from s to search for.
-<span class="lineNum">    1631 </span>                :        *  @return  Index of start of last occurrence.
-<span class="lineNum">    1632 </span>                :        *
-<span class="lineNum">    1633 </span>                :        *  Starting from @a pos, searches backward for the first @a n
-<span class="lineNum">    1634 </span>                :        *  characters in @a s within this string.  If found, returns the index
-<span class="lineNum">    1635 </span>                :        *  where it begins.  If not found, returns npos.
-<span class="lineNum">    1636 </span>                :       */
-<span class="lineNum">    1637 </span>                :       size_type
-<span class="lineNum">    1638 </span>                :       rfind(const _CharT* __s, size_type __pos, size_type __n) const;
-<span class="lineNum">    1639 </span>                : 
-<span class="lineNum">    1640 </span>                :       /**
-<span class="lineNum">    1641 </span>                :        *  @brief  Find last position of a C string.
-<span class="lineNum">    1642 </span>                :        *  @param s  C string to locate.
-<span class="lineNum">    1643 </span>                :        *  @param pos  Index of character to start search at (default end).
-<span class="lineNum">    1644 </span>                :        *  @return  Index of start of  last occurrence.
-<span class="lineNum">    1645 </span>                :        *
-<span class="lineNum">    1646 </span>                :        *  Starting from @a pos, searches backward for the value of @a s within
-<span class="lineNum">    1647 </span>                :        *  this string.  If found, returns the index where it begins.  If not
-<span class="lineNum">    1648 </span>                :        *  found, returns npos.
-<span class="lineNum">    1649 </span>                :       */
-<span class="lineNum">    1650 </span>                :       size_type
-<span class="lineNum">    1651 </span><span class="lineNoCov">              0 :       rfind(const _CharT* __s, size_type __pos = npos) const</span>
-<span class="lineNum">    1652 </span>                :       {
-<span class="lineNum">    1653 </span>                :         __glibcxx_requires_string(__s);
-<span class="lineNum">    1654 </span><span class="lineNoCov">              0 :         return this-&gt;rfind(__s, __pos, traits_type::length(__s));</span>
-<span class="lineNum">    1655 </span>                :       }
-<span class="lineNum">    1656 </span>                : 
-<span class="lineNum">    1657 </span>                :       /**
-<span class="lineNum">    1658 </span>                :        *  @brief  Find last position of a character.
-<span class="lineNum">    1659 </span>                :        *  @param c  Character to locate.
-<span class="lineNum">    1660 </span>                :        *  @param pos  Index of character to search back from (default end).
-<span class="lineNum">    1661 </span>                :        *  @return  Index of last occurrence.
-<span class="lineNum">    1662 </span>                :        *
-<span class="lineNum">    1663 </span>                :        *  Starting from @a pos, searches backward for @a c within this string.
-<span class="lineNum">    1664 </span>                :        *  If found, returns the index where it was found.  If not found,
-<span class="lineNum">    1665 </span>                :        *  returns npos.
-<span class="lineNum">    1666 </span>                :       */
-<span class="lineNum">    1667 </span>                :       size_type
-<span class="lineNum">    1668 </span>                :       rfind(_CharT __c, size_type __pos = npos) const;
-<span class="lineNum">    1669 </span>                : 
-<span class="lineNum">    1670 </span>                :       /**
-<span class="lineNum">    1671 </span>                :        *  @brief  Find position of a character of string.
-<span class="lineNum">    1672 </span>                :        *  @param str  String containing characters to locate.
-<span class="lineNum">    1673 </span>                :        *  @param pos  Index of character to search from (default 0).
-<span class="lineNum">    1674 </span>                :        *  @return  Index of first occurrence.
-<span class="lineNum">    1675 </span>                :        *
-<span class="lineNum">    1676 </span>                :        *  Starting from @a pos, searches forward for one of the characters of
-<span class="lineNum">    1677 </span>                :        *  @a str within this string.  If found, returns the index where it was
-<span class="lineNum">    1678 </span>                :        *  found.  If not found, returns npos.
-<span class="lineNum">    1679 </span>                :       */
-<span class="lineNum">    1680 </span>                :       size_type
-<span class="lineNum">    1681 </span>                :       find_first_of(const basic_string&amp; __str, size_type __pos = 0) const
-<span class="lineNum">    1682 </span>                :       { return this-&gt;find_first_of(__str.data(), __pos, __str.size()); }
-<span class="lineNum">    1683 </span>                : 
-<span class="lineNum">    1684 </span>                :       /**
-<span class="lineNum">    1685 </span>                :        *  @brief  Find position of a character of C substring.
-<span class="lineNum">    1686 </span>                :        *  @param s  String containing characters to locate.
-<span class="lineNum">    1687 </span>                :        *  @param pos  Index of character to search from.
-<span class="lineNum">    1688 </span>                :        *  @param n  Number of characters from s to search for.
-<span class="lineNum">    1689 </span>                :        *  @return  Index of first occurrence.
-<span class="lineNum">    1690 </span>                :        *
-<span class="lineNum">    1691 </span>                :        *  Starting from @a pos, searches forward for one of the first @a n
-<span class="lineNum">    1692 </span>                :        *  characters of @a s within this string.  If found, returns the index
-<span class="lineNum">    1693 </span>                :        *  where it was found.  If not found, returns npos.
-<span class="lineNum">    1694 </span>                :       */
-<span class="lineNum">    1695 </span>                :       size_type
-<span class="lineNum">    1696 </span>                :       find_first_of(const _CharT* __s, size_type __pos, size_type __n) const;
-<span class="lineNum">    1697 </span>                : 
-<span class="lineNum">    1698 </span>                :       /**
-<span class="lineNum">    1699 </span>                :        *  @brief  Find position of a character of C string.
-<span class="lineNum">    1700 </span>                :        *  @param s  String containing characters to locate.
-<span class="lineNum">    1701 </span>                :        *  @param pos  Index of character to search from (default 0).
-<span class="lineNum">    1702 </span>                :        *  @return  Index of first occurrence.
-<span class="lineNum">    1703 </span>                :        *
-<span class="lineNum">    1704 </span>                :        *  Starting from @a pos, searches forward for one of the characters of
-<span class="lineNum">    1705 </span>                :        *  @a s within this string.  If found, returns the index where it was
-<span class="lineNum">    1706 </span>                :        *  found.  If not found, returns npos.
-<span class="lineNum">    1707 </span>                :       */
-<span class="lineNum">    1708 </span>                :       size_type
-<span class="lineNum">    1709 </span>                :       find_first_of(const _CharT* __s, size_type __pos = 0) const
-<span class="lineNum">    1710 </span>                :       {
-<span class="lineNum">    1711 </span>                :         __glibcxx_requires_string(__s);
-<span class="lineNum">    1712 </span>                :         return this-&gt;find_first_of(__s, __pos, traits_type::length(__s));
-<span class="lineNum">    1713 </span>                :       }
-<span class="lineNum">    1714 </span>                : 
-<span class="lineNum">    1715 </span>                :       /**
-<span class="lineNum">    1716 </span>                :        *  @brief  Find position of a character.
-<span class="lineNum">    1717 </span>                :        *  @param c  Character to locate.
-<span class="lineNum">    1718 </span>                :        *  @param pos  Index of character to search from (default 0).
-<span class="lineNum">    1719 </span>                :        *  @return  Index of first occurrence.
-<span class="lineNum">    1720 </span>                :        *
-<span class="lineNum">    1721 </span>                :        *  Starting from @a pos, searches forward for the character @a c within
-<span class="lineNum">    1722 </span>                :        *  this string.  If found, returns the index where it was found.  If
-<span class="lineNum">    1723 </span>                :        *  not found, returns npos.
-<span class="lineNum">    1724 </span>                :        *
-<span class="lineNum">    1725 </span>                :        *  Note: equivalent to find(c, pos).
-<span class="lineNum">    1726 </span>                :       */
-<span class="lineNum">    1727 </span>                :       size_type
-<span class="lineNum">    1728 </span>                :       find_first_of(_CharT __c, size_type __pos = 0) const
-<span class="lineNum">    1729 </span>                :       { return this-&gt;find(__c, __pos); }
-<span class="lineNum">    1730 </span>                : 
-<span class="lineNum">    1731 </span>                :       /**
-<span class="lineNum">    1732 </span>                :        *  @brief  Find last position of a character of string.
-<span class="lineNum">    1733 </span>                :        *  @param str  String containing characters to locate.
-<span class="lineNum">    1734 </span>                :        *  @param pos  Index of character to search back from (default end).
-<span class="lineNum">    1735 </span>                :        *  @return  Index of last occurrence.
-<span class="lineNum">    1736 </span>                :        *
-<span class="lineNum">    1737 </span>                :        *  Starting from @a pos, searches backward for one of the characters of
-<span class="lineNum">    1738 </span>                :        *  @a str within this string.  If found, returns the index where it was
-<span class="lineNum">    1739 </span>                :        *  found.  If not found, returns npos.
-<span class="lineNum">    1740 </span>                :       */
-<span class="lineNum">    1741 </span>                :       size_type
-<span class="lineNum">    1742 </span>                :       find_last_of(const basic_string&amp; __str, size_type __pos = npos) const
-<span class="lineNum">    1743 </span>                :       { return this-&gt;find_last_of(__str.data(), __pos, __str.size()); }
-<span class="lineNum">    1744 </span>                : 
-<span class="lineNum">    1745 </span>                :       /**
-<span class="lineNum">    1746 </span>                :        *  @brief  Find last position of a character of C substring.
-<span class="lineNum">    1747 </span>                :        *  @param s  C string containing characters to locate.
-<span class="lineNum">    1748 </span>                :        *  @param pos  Index of character to search back from.
-<span class="lineNum">    1749 </span>                :        *  @param n  Number of characters from s to search for.
-<span class="lineNum">    1750 </span>                :        *  @return  Index of last occurrence.
-<span class="lineNum">    1751 </span>                :        *
-<span class="lineNum">    1752 </span>                :        *  Starting from @a pos, searches backward for one of the first @a n
-<span class="lineNum">    1753 </span>                :        *  characters of @a s within this string.  If found, returns the index
-<span class="lineNum">    1754 </span>                :        *  where it was found.  If not found, returns npos.
-<span class="lineNum">    1755 </span>                :       */
-<span class="lineNum">    1756 </span>                :       size_type
-<span class="lineNum">    1757 </span>                :       find_last_of(const _CharT* __s, size_type __pos, size_type __n) const;
-<span class="lineNum">    1758 </span>                : 
-<span class="lineNum">    1759 </span>                :       /**
-<span class="lineNum">    1760 </span>                :        *  @brief  Find last position of a character of C string.
-<span class="lineNum">    1761 </span>                :        *  @param s  C string containing characters to locate.
-<span class="lineNum">    1762 </span>                :        *  @param pos  Index of character to search back from (default end).
-<span class="lineNum">    1763 </span>                :        *  @return  Index of last occurrence.
-<span class="lineNum">    1764 </span>                :        *
-<span class="lineNum">    1765 </span>                :        *  Starting from @a pos, searches backward for one of the characters of
-<span class="lineNum">    1766 </span>                :        *  @a s within this string.  If found, returns the index where it was
-<span class="lineNum">    1767 </span>                :        *  found.  If not found, returns npos.
-<span class="lineNum">    1768 </span>                :       */
-<span class="lineNum">    1769 </span>                :       size_type
-<span class="lineNum">    1770 </span>                :       find_last_of(const _CharT* __s, size_type __pos = npos) const
-<span class="lineNum">    1771 </span>                :       {
-<span class="lineNum">    1772 </span>                :         __glibcxx_requires_string(__s);
-<span class="lineNum">    1773 </span>                :         return this-&gt;find_last_of(__s, __pos, traits_type::length(__s));
-<span class="lineNum">    1774 </span>                :       }
-<span class="lineNum">    1775 </span>                : 
-<span class="lineNum">    1776 </span>                :       /**
-<span class="lineNum">    1777 </span>                :        *  @brief  Find last position of a character.
-<span class="lineNum">    1778 </span>                :        *  @param c  Character to locate.
-<span class="lineNum">    1779 </span>                :        *  @param pos  Index of character to search back from (default end).
-<span class="lineNum">    1780 </span>                :        *  @return  Index of last occurrence.
-<span class="lineNum">    1781 </span>                :        *
-<span class="lineNum">    1782 </span>                :        *  Starting from @a pos, searches backward for @a c within this string.
-<span class="lineNum">    1783 </span>                :        *  If found, returns the index where it was found.  If not found,
-<span class="lineNum">    1784 </span>                :        *  returns npos.
-<span class="lineNum">    1785 </span>                :        *
-<span class="lineNum">    1786 </span>                :        *  Note: equivalent to rfind(c, pos).
-<span class="lineNum">    1787 </span>                :       */
-<span class="lineNum">    1788 </span>                :       size_type
-<span class="lineNum">    1789 </span>                :       find_last_of(_CharT __c, size_type __pos = npos) const
-<span class="lineNum">    1790 </span>                :       { return this-&gt;rfind(__c, __pos); }
-<span class="lineNum">    1791 </span>                : 
-<span class="lineNum">    1792 </span>                :       /**
-<span class="lineNum">    1793 </span>                :        *  @brief  Find position of a character not in string.
-<span class="lineNum">    1794 </span>                :        *  @param str  String containing characters to avoid.
-<span class="lineNum">    1795 </span>                :        *  @param pos  Index of character to search from (default 0).
-<span class="lineNum">    1796 </span>                :        *  @return  Index of first occurrence.
-<span class="lineNum">    1797 </span>                :        *
-<span class="lineNum">    1798 </span>                :        *  Starting from @a pos, searches forward for a character not contained
-<span class="lineNum">    1799 </span>                :        *  in @a str within this string.  If found, returns the index where it
-<span class="lineNum">    1800 </span>                :        *  was found.  If not found, returns npos.
-<span class="lineNum">    1801 </span>                :       */
-<span class="lineNum">    1802 </span>                :       size_type
-<span class="lineNum">    1803 </span>                :       find_first_not_of(const basic_string&amp; __str, size_type __pos = 0) const
-<span class="lineNum">    1804 </span>                :       { return this-&gt;find_first_not_of(__str.data(), __pos, __str.size()); }
-<span class="lineNum">    1805 </span>                : 
-<span class="lineNum">    1806 </span>                :       /**
-<span class="lineNum">    1807 </span>                :        *  @brief  Find position of a character not in C substring.
-<span class="lineNum">    1808 </span>                :        *  @param s  C string containing characters to avoid.
-<span class="lineNum">    1809 </span>                :        *  @param pos  Index of character to search from.
-<span class="lineNum">    1810 </span>                :        *  @param n  Number of characters from s to consider.
-<span class="lineNum">    1811 </span>                :        *  @return  Index of first occurrence.
-<span class="lineNum">    1812 </span>                :        *
-<span class="lineNum">    1813 </span>                :        *  Starting from @a pos, searches forward for a character not contained
-<span class="lineNum">    1814 </span>                :        *  in the first @a n characters of @a s within this string.  If found,
-<span class="lineNum">    1815 </span>                :        *  returns the index where it was found.  If not found, returns npos.
-<span class="lineNum">    1816 </span>                :       */
-<span class="lineNum">    1817 </span>                :       size_type
-<span class="lineNum">    1818 </span>                :       find_first_not_of(const _CharT* __s, size_type __pos,
-<span class="lineNum">    1819 </span>                :                         size_type __n) const;
-<span class="lineNum">    1820 </span>                : 
-<span class="lineNum">    1821 </span>                :       /**
-<span class="lineNum">    1822 </span>                :        *  @brief  Find position of a character not in C string.
-<span class="lineNum">    1823 </span>                :        *  @param s  C string containing characters to avoid.
-<span class="lineNum">    1824 </span>                :        *  @param pos  Index of character to search from (default 0).
-<span class="lineNum">    1825 </span>                :        *  @return  Index of first occurrence.
-<span class="lineNum">    1826 </span>                :        *
-<span class="lineNum">    1827 </span>                :        *  Starting from @a pos, searches forward for a character not contained
-<span class="lineNum">    1828 </span>                :        *  in @a s within this string.  If found, returns the index where it
-<span class="lineNum">    1829 </span>                :        *  was found.  If not found, returns npos.
-<span class="lineNum">    1830 </span>                :       */
-<span class="lineNum">    1831 </span>                :       size_type
-<span class="lineNum">    1832 </span>                :       find_first_not_of(const _CharT* __s, size_type __pos = 0) const
-<span class="lineNum">    1833 </span>                :       {
-<span class="lineNum">    1834 </span>                :         __glibcxx_requires_string(__s);
-<span class="lineNum">    1835 </span>                :         return this-&gt;find_first_not_of(__s, __pos, traits_type::length(__s));
-<span class="lineNum">    1836 </span>                :       }
-<span class="lineNum">    1837 </span>                : 
-<span class="lineNum">    1838 </span>                :       /**
-<span class="lineNum">    1839 </span>                :        *  @brief  Find position of a different character.
-<span class="lineNum">    1840 </span>                :        *  @param c  Character to avoid.
-<span class="lineNum">    1841 </span>                :        *  @param pos  Index of character to search from (default 0).
-<span class="lineNum">    1842 </span>                :        *  @return  Index of first occurrence.
-<span class="lineNum">    1843 </span>                :        *
-<span class="lineNum">    1844 </span>                :        *  Starting from @a pos, searches forward for a character other than @a c
-<span class="lineNum">    1845 </span>                :        *  within this string.  If found, returns the index where it was found.
-<span class="lineNum">    1846 </span>                :        *  If not found, returns npos.
-<span class="lineNum">    1847 </span>                :       */
-<span class="lineNum">    1848 </span>                :       size_type
-<span class="lineNum">    1849 </span>                :       find_first_not_of(_CharT __c, size_type __pos = 0) const;
-<span class="lineNum">    1850 </span>                : 
-<span class="lineNum">    1851 </span>                :       /**
-<span class="lineNum">    1852 </span>                :        *  @brief  Find last position of a character not in string.
-<span class="lineNum">    1853 </span>                :        *  @param str  String containing characters to avoid.
-<span class="lineNum">    1854 </span>                :        *  @param pos  Index of character to search back from (default end).
-<span class="lineNum">    1855 </span>                :        *  @return  Index of last occurrence.
-<span class="lineNum">    1856 </span>                :        *
-<span class="lineNum">    1857 </span>                :        *  Starting from @a pos, searches backward for a character not
-<span class="lineNum">    1858 </span>                :        *  contained in @a str within this string.  If found, returns the index
-<span class="lineNum">    1859 </span>                :        *  where it was found.  If not found, returns npos.
-<span class="lineNum">    1860 </span>                :       */
-<span class="lineNum">    1861 </span>                :       size_type
-<span class="lineNum">    1862 </span>                :       find_last_not_of(const basic_string&amp; __str, size_type __pos = npos) const
-<span class="lineNum">    1863 </span>                :       { return this-&gt;find_last_not_of(__str.data(), __pos, __str.size()); }
-<span class="lineNum">    1864 </span>                : 
-<span class="lineNum">    1865 </span>                :       /**
-<span class="lineNum">    1866 </span>                :        *  @brief  Find last position of a character not in C substring.
-<span class="lineNum">    1867 </span>                :        *  @param s  C string containing characters to avoid.
-<span class="lineNum">    1868 </span>                :        *  @param pos  Index of character to search back from.
-<span class="lineNum">    1869 </span>                :        *  @param n  Number of characters from s to consider.
-<span class="lineNum">    1870 </span>                :        *  @return  Index of last occurrence.
-<span class="lineNum">    1871 </span>                :        *
-<span class="lineNum">    1872 </span>                :        *  Starting from @a pos, searches backward for a character not
-<span class="lineNum">    1873 </span>                :        *  contained in the first @a n characters of @a s within this string.
-<span class="lineNum">    1874 </span>                :        *  If found, returns the index where it was found.  If not found,
-<span class="lineNum">    1875 </span>                :        *  returns npos.
-<span class="lineNum">    1876 </span>                :       */
-<span class="lineNum">    1877 </span>                :       size_type
-<span class="lineNum">    1878 </span>                :       find_last_not_of(const _CharT* __s, size_type __pos,
-<span class="lineNum">    1879 </span>                :                        size_type __n) const;
-<span class="lineNum">    1880 </span>                :       /**
-<span class="lineNum">    1881 </span>                :        *  @brief  Find last position of a character not in C string.
-<span class="lineNum">    1882 </span>                :        *  @param s  C string containing characters to avoid.
-<span class="lineNum">    1883 </span>                :        *  @param pos  Index of character to search back from (default end).
-<span class="lineNum">    1884 </span>                :        *  @return  Index of last occurrence.
-<span class="lineNum">    1885 </span>                :        *
-<span class="lineNum">    1886 </span>                :        *  Starting from @a pos, searches backward for a character not
-<span class="lineNum">    1887 </span>                :        *  contained in @a s within this string.  If found, returns the index
-<span class="lineNum">    1888 </span>                :        *  where it was found.  If not found, returns npos.
-<span class="lineNum">    1889 </span>                :       */
-<span class="lineNum">    1890 </span>                :       size_type
-<span class="lineNum">    1891 </span><span class="lineNoCov">              0 :       find_last_not_of(const _CharT* __s, size_type __pos = npos) const</span>
-<span class="lineNum">    1892 </span>                :       {
-<span class="lineNum">    1893 </span>                :         __glibcxx_requires_string(__s);
-<span class="lineNum">    1894 </span><span class="lineNoCov">              0 :         return this-&gt;find_last_not_of(__s, __pos, traits_type::length(__s));</span>
-<span class="lineNum">    1895 </span>                :       }
-<span class="lineNum">    1896 </span>                : 
-<span class="lineNum">    1897 </span>                :       /**
-<span class="lineNum">    1898 </span>                :        *  @brief  Find last position of a different character.
-<span class="lineNum">    1899 </span>                :        *  @param c  Character to avoid.
-<span class="lineNum">    1900 </span>                :        *  @param pos  Index of character to search back from (default end).
-<span class="lineNum">    1901 </span>                :        *  @return  Index of last occurrence.
-<span class="lineNum">    1902 </span>                :        *
-<span class="lineNum">    1903 </span>                :        *  Starting from @a pos, searches backward for a character other than
-<span class="lineNum">    1904 </span>                :        *  @a c within this string.  If found, returns the index where it was
-<span class="lineNum">    1905 </span>                :        *  found.  If not found, returns npos.
-<span class="lineNum">    1906 </span>                :       */
-<span class="lineNum">    1907 </span>                :       size_type
-<span class="lineNum">    1908 </span>                :       find_last_not_of(_CharT __c, size_type __pos = npos) const;
-<span class="lineNum">    1909 </span>                : 
-<span class="lineNum">    1910 </span>                :       /**
-<span class="lineNum">    1911 </span>                :        *  @brief  Get a substring.
-<span class="lineNum">    1912 </span>                :        *  @param pos  Index of first character (default 0).
-<span class="lineNum">    1913 </span>                :        *  @param n  Number of characters in substring (default remainder).
-<span class="lineNum">    1914 </span>                :        *  @return  The new string.
-<span class="lineNum">    1915 </span>                :        *  @throw  std::out_of_range  If pos &gt; size().
-<span class="lineNum">    1916 </span>                :        *
-<span class="lineNum">    1917 </span>                :        *  Construct and return a new string using the @a n characters starting
-<span class="lineNum">    1918 </span>                :        *  at @a pos.  If the string is too short, use the remainder of the
-<span class="lineNum">    1919 </span>                :        *  characters.  If @a pos is beyond the end of the string, out_of_range
-<span class="lineNum">    1920 </span>                :        *  is thrown.
-<span class="lineNum">    1921 </span>                :       */
-<span class="lineNum">    1922 </span>                :       basic_string
-<span class="lineNum">    1923 </span><span class="lineNoCov">              0 :       substr(size_type __pos = 0, size_type __n = npos) const</span>
-<span class="lineNum">    1924 </span>                :       { return basic_string(*this,
-<span class="lineNum">    1925 </span><span class="lineNoCov">              0 :                             _M_check(__pos, &quot;basic_string::substr&quot;), __n); }</span>
-<span class="lineNum">    1926 </span>                : 
-<span class="lineNum">    1927 </span>                :       /**
-<span class="lineNum">    1928 </span>                :        *  @brief  Compare to a string.
-<span class="lineNum">    1929 </span>                :        *  @param str  String to compare against.
-<span class="lineNum">    1930 </span>                :        *  @return  Integer &lt; 0, 0, or &gt; 0.
-<span class="lineNum">    1931 </span>                :        *
-<span class="lineNum">    1932 </span>                :        *  Returns an integer &lt; 0 if this string is ordered before @a str, 0 if
-<span class="lineNum">    1933 </span>                :        *  their values are equivalent, or &gt; 0 if this string is ordered after
-<span class="lineNum">    1934 </span>                :        *  @a str.  Determines the effective length rlen of the strings to
-<span class="lineNum">    1935 </span>                :        *  compare as the smallest of size() and str.size().  The function
-<span class="lineNum">    1936 </span>                :        *  then compares the two strings by calling traits::compare(data(),
-<span class="lineNum">    1937 </span>                :        *  str.data(),rlen).  If the result of the comparison is nonzero returns
-<span class="lineNum">    1938 </span>                :        *  it, otherwise the shorter one is ordered first.
-<span class="lineNum">    1939 </span>                :       */
-<span class="lineNum">    1940 </span>                :       int
-<span class="lineNum">    1941 </span><span class="lineNoCov">              0 :       compare(const basic_string&amp; __str) const</span>
-<span class="lineNum">    1942 </span>                :       {
-<span class="lineNum">    1943 </span><span class="lineNoCov">              0 :         const size_type __size = this-&gt;size();</span>
-<span class="lineNum">    1944 </span><span class="lineNoCov">              0 :         const size_type __osize = __str.size();</span>
-<span class="lineNum">    1945 </span><span class="lineNoCov">              0 :         const size_type __len = std::min(__size, __osize);</span>
-<span class="lineNum">    1946 </span>                : 
-<span class="lineNum">    1947 </span><span class="lineNoCov">              0 :         int __r = traits_type::compare(_M_data(), __str.data(), __len);</span>
-<span class="lineNum">    1948 </span><span class="lineNoCov">              0 :         if (!__r)</span>
-<span class="lineNum">    1949 </span><span class="lineNoCov">              0 :           __r = _S_compare(__size, __osize);</span>
-<span class="lineNum">    1950 </span><span class="lineNoCov">              0 :         return __r;</span>
-<span class="lineNum">    1951 </span>                :       }
-<span class="lineNum">    1952 </span>                : 
-<span class="lineNum">    1953 </span>                :       /**
-<span class="lineNum">    1954 </span>                :        *  @brief  Compare substring to a string.
-<span class="lineNum">    1955 </span>                :        *  @param pos  Index of first character of substring.
-<span class="lineNum">    1956 </span>                :        *  @param n  Number of characters in substring.
-<span class="lineNum">    1957 </span>                :        *  @param str  String to compare against.
-<span class="lineNum">    1958 </span>                :        *  @return  Integer &lt; 0, 0, or &gt; 0.
-<span class="lineNum">    1959 </span>                :        *
-<span class="lineNum">    1960 </span>                :        *  Form the substring of this string from the @a n characters starting
-<span class="lineNum">    1961 </span>                :        *  at @a pos.  Returns an integer &lt; 0 if the substring is ordered
-<span class="lineNum">    1962 </span>                :        *  before @a str, 0 if their values are equivalent, or &gt; 0 if the
-<span class="lineNum">    1963 </span>                :        *  substring is ordered after @a str.  Determines the effective length
-<span class="lineNum">    1964 </span>                :        *  rlen of the strings to compare as the smallest of the length of the
-<span class="lineNum">    1965 </span>                :        *  substring and @a str.size().  The function then compares the two
-<span class="lineNum">    1966 </span>                :        *  strings by calling traits::compare(substring.data(),str.data(),rlen).
-<span class="lineNum">    1967 </span>                :        *  If the result of the comparison is nonzero returns it, otherwise the
-<span class="lineNum">    1968 </span>                :        *  shorter one is ordered first.
-<span class="lineNum">    1969 </span>                :       */
-<span class="lineNum">    1970 </span>                :       int
-<span class="lineNum">    1971 </span>                :       compare(size_type __pos, size_type __n, const basic_string&amp; __str) const;
-<span class="lineNum">    1972 </span>                : 
-<span class="lineNum">    1973 </span>                :       /**
-<span class="lineNum">    1974 </span>                :        *  @brief  Compare substring to a substring.
-<span class="lineNum">    1975 </span>                :        *  @param pos1  Index of first character of substring.
-<span class="lineNum">    1976 </span>                :        *  @param n1  Number of characters in substring.
-<span class="lineNum">    1977 </span>                :        *  @param str  String to compare against.
-<span class="lineNum">    1978 </span>                :        *  @param pos2  Index of first character of substring of str.
-<span class="lineNum">    1979 </span>                :        *  @param n2  Number of characters in substring of str.
-<span class="lineNum">    1980 </span>                :        *  @return  Integer &lt; 0, 0, or &gt; 0.
-<span class="lineNum">    1981 </span>                :        *
-<span class="lineNum">    1982 </span>                :        *  Form the substring of this string from the @a n1 characters starting
-<span class="lineNum">    1983 </span>                :        *  at @a pos1.  Form the substring of @a str from the @a n2 characters
-<span class="lineNum">    1984 </span>                :        *  starting at @a pos2.  Returns an integer &lt; 0 if this substring is
-<span class="lineNum">    1985 </span>                :        *  ordered before the substring of @a str, 0 if their values are
-<span class="lineNum">    1986 </span>                :        *  equivalent, or &gt; 0 if this substring is ordered after the substring
-<span class="lineNum">    1987 </span>                :        *  of @a str.  Determines the effective length rlen of the strings
-<span class="lineNum">    1988 </span>                :        *  to compare as the smallest of the lengths of the substrings.  The
-<span class="lineNum">    1989 </span>                :        *  function then compares the two strings by calling
-<span class="lineNum">    1990 </span>                :        *  traits::compare(substring.data(),str.substr(pos2,n2).data(),rlen).
-<span class="lineNum">    1991 </span>                :        *  If the result of the comparison is nonzero returns it, otherwise the
-<span class="lineNum">    1992 </span>                :        *  shorter one is ordered first.
-<span class="lineNum">    1993 </span>                :       */
-<span class="lineNum">    1994 </span>                :       int
-<span class="lineNum">    1995 </span>                :       compare(size_type __pos1, size_type __n1, const basic_string&amp; __str,
-<span class="lineNum">    1996 </span>                :               size_type __pos2, size_type __n2) const;
-<span class="lineNum">    1997 </span>                : 
-<span class="lineNum">    1998 </span>                :       /**
-<span class="lineNum">    1999 </span>                :        *  @brief  Compare to a C string.
-<span class="lineNum">    2000 </span>                :        *  @param s  C string to compare against.
-<span class="lineNum">    2001 </span>                :        *  @return  Integer &lt; 0, 0, or &gt; 0.
-<span class="lineNum">    2002 </span>                :        *
-<span class="lineNum">    2003 </span>                :        *  Returns an integer &lt; 0 if this string is ordered before @a s, 0 if
-<span class="lineNum">    2004 </span>                :        *  their values are equivalent, or &gt; 0 if this string is ordered after
-<span class="lineNum">    2005 </span>                :        *  @a s.  Determines the effective length rlen of the strings to
-<span class="lineNum">    2006 </span>                :        *  compare as the smallest of size() and the length of a string
-<span class="lineNum">    2007 </span>                :        *  constructed from @a s.  The function then compares the two strings
-<span class="lineNum">    2008 </span>                :        *  by calling traits::compare(data(),s,rlen).  If the result of the
-<span class="lineNum">    2009 </span>                :        *  comparison is nonzero returns it, otherwise the shorter one is
-<span class="lineNum">    2010 </span>                :        *  ordered first.
-<span class="lineNum">    2011 </span>                :       */
-<span class="lineNum">    2012 </span>                :       int
-<span class="lineNum">    2013 </span>                :       compare(const _CharT* __s) const;
-<span class="lineNum">    2014 </span>                : 
-<span class="lineNum">    2015 </span>                :       // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">    2016 </span>                :       // 5 String::compare specification questionable
-<span class="lineNum">    2017 </span>                :       /**
-<span class="lineNum">    2018 </span>                :        *  @brief  Compare substring to a C string.
-<span class="lineNum">    2019 </span>                :        *  @param pos  Index of first character of substring.
-<span class="lineNum">    2020 </span>                :        *  @param n1  Number of characters in substring.
-<span class="lineNum">    2021 </span>                :        *  @param s  C string to compare against.
-<span class="lineNum">    2022 </span>                :        *  @return  Integer &lt; 0, 0, or &gt; 0.
-<span class="lineNum">    2023 </span>                :        *
-<span class="lineNum">    2024 </span>                :        *  Form the substring of this string from the @a n1 characters starting
-<span class="lineNum">    2025 </span>                :        *  at @a pos.  Returns an integer &lt; 0 if the substring is ordered
-<span class="lineNum">    2026 </span>                :        *  before @a s, 0 if their values are equivalent, or &gt; 0 if the
-<span class="lineNum">    2027 </span>                :        *  substring is ordered after @a s.  Determines the effective length
-<span class="lineNum">    2028 </span>                :        *  rlen of the strings to compare as the smallest of the length of the 
-<span class="lineNum">    2029 </span>                :        *  substring and the length of a string constructed from @a s.  The
-<span class="lineNum">    2030 </span>                :        *  function then compares the two string by calling
-<span class="lineNum">    2031 </span>                :        *  traits::compare(substring.data(),s,rlen).  If the result of the
-<span class="lineNum">    2032 </span>                :        *  comparison is nonzero returns it, otherwise the shorter one is
-<span class="lineNum">    2033 </span>                :        *  ordered first.
-<span class="lineNum">    2034 </span>                :       */
-<span class="lineNum">    2035 </span>                :       int
-<span class="lineNum">    2036 </span>                :       compare(size_type __pos, size_type __n1, const _CharT* __s) const;
-<span class="lineNum">    2037 </span>                : 
-<span class="lineNum">    2038 </span>                :       /**
-<span class="lineNum">    2039 </span>                :        *  @brief  Compare substring against a character array.
-<span class="lineNum">    2040 </span>                :        *  @param pos1  Index of first character of substring.
-<span class="lineNum">    2041 </span>                :        *  @param n1  Number of characters in substring.
-<span class="lineNum">    2042 </span>                :        *  @param s  character array to compare against.
-<span class="lineNum">    2043 </span>                :        *  @param n2  Number of characters of s.
-<span class="lineNum">    2044 </span>                :        *  @return  Integer &lt; 0, 0, or &gt; 0.
-<span class="lineNum">    2045 </span>                :        *
-<span class="lineNum">    2046 </span>                :        *  Form the substring of this string from the @a n1 characters starting
-<span class="lineNum">    2047 </span>                :        *  at @a pos1.  Form a string from the first @a n2 characters of @a s.
-<span class="lineNum">    2048 </span>                :        *  Returns an integer &lt; 0 if this substring is ordered before the string
-<span class="lineNum">    2049 </span>                :        *  from @a s, 0 if their values are equivalent, or &gt; 0 if this substring
-<span class="lineNum">    2050 </span>                :        *  is ordered after the string from @a s.   Determines the effective
-<span class="lineNum">    2051 </span>                :        *  length rlen of the strings to compare as the smallest of the length
-<span class="lineNum">    2052 </span>                :        *  of the substring and @a n2.  The function then compares the two
-<span class="lineNum">    2053 </span>                :        *  strings by calling traits::compare(substring.data(),s,rlen).  If the
-<span class="lineNum">    2054 </span>                :        *  result of the comparison is nonzero returns it, otherwise the shorter
-<span class="lineNum">    2055 </span>                :        *  one is ordered first.
-<span class="lineNum">    2056 </span>                :        *
-<span class="lineNum">    2057 </span>                :        *  NB: s must have at least n2 characters, '\0' has no special
-<span class="lineNum">    2058 </span>                :        *  meaning.
-<span class="lineNum">    2059 </span>                :       */
-<span class="lineNum">    2060 </span>                :       int
-<span class="lineNum">    2061 </span>                :       compare(size_type __pos, size_type __n1, const _CharT* __s,
-<span class="lineNum">    2062 </span>                :               size_type __n2) const;
-<span class="lineNum">    2063 </span>                :   };
-<span class="lineNum">    2064 </span>                : 
-<span class="lineNum">    2065 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">    2066 </span>                :     inline basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">    2067 </span><span class="lineNoCov">              0 :     basic_string()</span>
-<span class="lineNum">    2068 </span>                : #ifndef _GLIBCXX_FULLY_DYNAMIC_STRING
-<span class="lineNum">    2069 </span><span class="lineNoCov">              0 :     : _M_dataplus(_S_empty_rep()._M_refdata(), _Alloc()) { }</span>
-<span class="lineNum">    2070 </span>                : #else
-<span class="lineNum">    2071 </span>                :     : _M_dataplus(_S_construct(size_type(), _CharT(), _Alloc()), _Alloc()) { }
-<span class="lineNum">    2072 </span>                : #endif
-<span class="lineNum">    2073 </span>                : 
-<span class="lineNum">    2074 </span>                :   // operator+
-<span class="lineNum">    2075 </span>                :   /**
-<span class="lineNum">    2076 </span>                :    *  @brief  Concatenate two strings.
-<span class="lineNum">    2077 </span>                :    *  @param lhs  First string.
-<span class="lineNum">    2078 </span>                :    *  @param rhs  Last string.
-<span class="lineNum">    2079 </span>                :    *  @return  New string with value of @a lhs followed by @a rhs.
-<span class="lineNum">    2080 </span>                :    */
-<span class="lineNum">    2081 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">    2082 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;
-<span class="lineNum">    2083 </span>                :     operator+(const basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp; __lhs,
-<span class="lineNum">    2084 </span><span class="lineCov">         715370 :               const basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp; __rhs)</span>
-<span class="lineNum">    2085 </span>                :     {
-<span class="lineNum">    2086 </span><span class="lineCov">         715370 :       basic_string&lt;_CharT, _Traits, _Alloc&gt; __str(__lhs);</span>
-<span class="lineNum">    2087 </span><span class="lineCov">         715370 :       __str.append(__rhs);</span>
-<span class="lineNum">    2088 </span><span class="lineNoCov">              0 :       return __str;</span>
-<span class="lineNum">    2089 </span>                :     }
-<span class="lineNum">    2090 </span>                : 
-<span class="lineNum">    2091 </span>                :   /**
-<span class="lineNum">    2092 </span>                :    *  @brief  Concatenate C string and string.
-<span class="lineNum">    2093 </span>                :    *  @param lhs  First string.
-<span class="lineNum">    2094 </span>                :    *  @param rhs  Last string.
-<span class="lineNum">    2095 </span>                :    *  @return  New string with value of @a lhs followed by @a rhs.
-<span class="lineNum">    2096 </span>                :    */
-<span class="lineNum">    2097 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">    2098 </span>                :     basic_string&lt;_CharT,_Traits,_Alloc&gt;
-<span class="lineNum">    2099 </span>                :     operator+(const _CharT* __lhs,
-<span class="lineNum">    2100 </span>                :               const basic_string&lt;_CharT,_Traits,_Alloc&gt;&amp; __rhs);
-<span class="lineNum">    2101 </span>                : 
-<span class="lineNum">    2102 </span>                :   /**
-<span class="lineNum">    2103 </span>                :    *  @brief  Concatenate character and string.
-<span class="lineNum">    2104 </span>                :    *  @param lhs  First string.
-<span class="lineNum">    2105 </span>                :    *  @param rhs  Last string.
-<span class="lineNum">    2106 </span>                :    *  @return  New string with @a lhs followed by @a rhs.
-<span class="lineNum">    2107 </span>                :    */
-<span class="lineNum">    2108 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">    2109 </span>                :     basic_string&lt;_CharT,_Traits,_Alloc&gt;
-<span class="lineNum">    2110 </span>                :     operator+(_CharT __lhs, const basic_string&lt;_CharT,_Traits,_Alloc&gt;&amp; __rhs);
-<span class="lineNum">    2111 </span>                : 
-<span class="lineNum">    2112 </span>                :   /**
-<span class="lineNum">    2113 </span>                :    *  @brief  Concatenate string and C string.
-<span class="lineNum">    2114 </span>                :    *  @param lhs  First string.
-<span class="lineNum">    2115 </span>                :    *  @param rhs  Last string.
-<span class="lineNum">    2116 </span>                :    *  @return  New string with @a lhs followed by @a rhs.
-<span class="lineNum">    2117 </span>                :    */
-<span class="lineNum">    2118 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">    2119 </span>                :     inline basic_string&lt;_CharT, _Traits, _Alloc&gt;
-<span class="lineNum">    2120 </span>                :     operator+(const basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp; __lhs,
-<span class="lineNum">    2121 </span><span class="lineCov">           5962 :              const _CharT* __rhs)</span>
-<span class="lineNum">    2122 </span>                :     {
-<span class="lineNum">    2123 </span><span class="lineCov">           5962 :       basic_string&lt;_CharT, _Traits, _Alloc&gt; __str(__lhs);</span>
-<span class="lineNum">    2124 </span><span class="lineCov">           5962 :       __str.append(__rhs);</span>
-<span class="lineNum">    2125 </span><span class="lineNoCov">              0 :       return __str;</span>
-<span class="lineNum">    2126 </span>                :     }
-<span class="lineNum">    2127 </span>                : 
-<span class="lineNum">    2128 </span>                :   /**
-<span class="lineNum">    2129 </span>                :    *  @brief  Concatenate string and character.
-<span class="lineNum">    2130 </span>                :    *  @param lhs  First string.
-<span class="lineNum">    2131 </span>                :    *  @param rhs  Last string.
-<span class="lineNum">    2132 </span>                :    *  @return  New string with @a lhs followed by @a rhs.
-<span class="lineNum">    2133 </span>                :    */
-<span class="lineNum">    2134 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">    2135 </span>                :     inline basic_string&lt;_CharT, _Traits, _Alloc&gt;
-<span class="lineNum">    2136 </span><span class="lineCov">            140 :     operator+(const basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp; __lhs, _CharT __rhs)</span>
-<span class="lineNum">    2137 </span>                :     {
-<span class="lineNum">    2138 </span>                :       typedef basic_string&lt;_CharT, _Traits, _Alloc&gt;       __string_type;
-<span class="lineNum">    2139 </span>                :       typedef typename __string_type::size_type         __size_type;
-<span class="lineNum">    2140 </span><span class="lineCov">            140 :       __string_type __str(__lhs);</span>
-<span class="lineNum">    2141 </span><span class="lineCov">            140 :       __str.append(__size_type(1), __rhs);</span>
-<span class="lineNum">    2142 </span><span class="lineNoCov">              0 :       return __str;</span>
-<span class="lineNum">    2143 </span>                :     }
-<span class="lineNum">    2144 </span>                : 
-<span class="lineNum">    2145 </span>                :   // operator ==
-<span class="lineNum">    2146 </span>                :   /**
-<span class="lineNum">    2147 </span>                :    *  @brief  Test equivalence of two strings.
-<span class="lineNum">    2148 </span>                :    *  @param lhs  First string.
-<span class="lineNum">    2149 </span>                :    *  @param rhs  Second string.
-<span class="lineNum">    2150 </span>                :    *  @return  True if @a lhs.compare(@a rhs) == 0.  False otherwise.
-<span class="lineNum">    2151 </span>                :    */
-<span class="lineNum">    2152 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">    2153 </span>                :     inline bool
-<span class="lineNum">    2154 </span>                :     operator==(const basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp; __lhs,
-<span class="lineNum">    2155 </span>                :                const basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp; __rhs)
-<span class="lineNum">    2156 </span>                :     { return __lhs.compare(__rhs) == 0; }
-<span class="lineNum">    2157 </span>                : 
-<span class="lineNum">    2158 </span>                :   template&lt;typename _CharT&gt;
-<span class="lineNum">    2159 </span>                :     inline
-<span class="lineNum">    2160 </span>                :     typename __gnu_cxx::__enable_if&lt;__is_char&lt;_CharT&gt;::__value, bool&gt;::__type
-<span class="lineNum">    2161 </span>                :     operator==(const basic_string&lt;_CharT&gt;&amp; __lhs,
-<span class="lineNum">    2162 </span><span class="lineCov">         134945 :                const basic_string&lt;_CharT&gt;&amp; __rhs)</span>
-<span class="lineNum">    2163 </span>                :     { return (__lhs.size() == __rhs.size()
-<span class="lineNum">    2164 </span>                :               &amp;&amp; !std::char_traits&lt;_CharT&gt;::compare(__lhs.data(), __rhs.data(),
-<span class="lineNum">    2165 </span><span class="lineCov">         134945 :                                                     __lhs.size())); }</span>
-<span class="lineNum">    2166 </span>                : 
-<span class="lineNum">    2167 </span>                :   /**
-<span class="lineNum">    2168 </span>                :    *  @brief  Test equivalence of C string and string.
-<span class="lineNum">    2169 </span>                :    *  @param lhs  C string.
-<span class="lineNum">    2170 </span>                :    *  @param rhs  String.
-<span class="lineNum">    2171 </span>                :    *  @return  True if @a rhs.compare(@a lhs) == 0.  False otherwise.
-<span class="lineNum">    2172 </span>                :    */
-<span class="lineNum">    2173 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">    2174 </span>                :     inline bool
-<span class="lineNum">    2175 </span>                :     operator==(const _CharT* __lhs,
-<span class="lineNum">    2176 </span><span class="lineNoCov">              0 :                const basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp; __rhs)</span>
-<span class="lineNum">    2177 </span><span class="lineNoCov">              0 :     { return __rhs.compare(__lhs) == 0; }</span>
-<span class="lineNum">    2178 </span>                : 
-<span class="lineNum">    2179 </span>                :   /**
-<span class="lineNum">    2180 </span>                :    *  @brief  Test equivalence of string and C string.
-<span class="lineNum">    2181 </span>                :    *  @param lhs  String.
-<span class="lineNum">    2182 </span>                :    *  @param rhs  C string.
-<span class="lineNum">    2183 </span>                :    *  @return  True if @a lhs.compare(@a rhs) == 0.  False otherwise.
-<span class="lineNum">    2184 </span>                :    */
-<span class="lineNum">    2185 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">    2186 </span>                :     inline bool
-<span class="lineNum">    2187 </span>                :     operator==(const basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp; __lhs,
-<span class="lineNum">    2188 </span><span class="lineCov">         156952 :                const _CharT* __rhs)</span>
-<span class="lineNum">    2189 </span><span class="lineCov">         156952 :     { return __lhs.compare(__rhs) == 0; }</span>
-<span class="lineNum">    2190 </span>                : 
-<span class="lineNum">    2191 </span>                :   // operator !=
-<span class="lineNum">    2192 </span>                :   /**
-<span class="lineNum">    2193 </span>                :    *  @brief  Test difference of two strings.
-<span class="lineNum">    2194 </span>                :    *  @param lhs  First string.
-<span class="lineNum">    2195 </span>                :    *  @param rhs  Second string.
-<span class="lineNum">    2196 </span>                :    *  @return  True if @a lhs.compare(@a rhs) != 0.  False otherwise.
-<span class="lineNum">    2197 </span>                :    */
-<span class="lineNum">    2198 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">    2199 </span>                :     inline bool
-<span class="lineNum">    2200 </span>                :     operator!=(const basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp; __lhs,
-<span class="lineNum">    2201 </span><span class="lineCov">          84867 :                const basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp; __rhs)</span>
-<span class="lineNum">    2202 </span><span class="lineCov">          84867 :     { return !(__lhs == __rhs); }</span>
-<span class="lineNum">    2203 </span>                : 
-<span class="lineNum">    2204 </span>                :   /**
-<span class="lineNum">    2205 </span>                :    *  @brief  Test difference of C string and string.
-<span class="lineNum">    2206 </span>                :    *  @param lhs  C string.
-<span class="lineNum">    2207 </span>                :    *  @param rhs  String.
-<span class="lineNum">    2208 </span>                :    *  @return  True if @a rhs.compare(@a lhs) != 0.  False otherwise.
-<span class="lineNum">    2209 </span>                :    */
-<span class="lineNum">    2210 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">    2211 </span>                :     inline bool
-<span class="lineNum">    2212 </span>                :     operator!=(const _CharT* __lhs,
-<span class="lineNum">    2213 </span>                :                const basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp; __rhs)
-<span class="lineNum">    2214 </span>                :     { return !(__lhs == __rhs); }
-<span class="lineNum">    2215 </span>                : 
-<span class="lineNum">    2216 </span>                :   /**
-<span class="lineNum">    2217 </span>                :    *  @brief  Test difference of string and C string.
-<span class="lineNum">    2218 </span>                :    *  @param lhs  String.
-<span class="lineNum">    2219 </span>                :    *  @param rhs  C string.
-<span class="lineNum">    2220 </span>                :    *  @return  True if @a lhs.compare(@a rhs) != 0.  False otherwise.
-<span class="lineNum">    2221 </span>                :    */
-<span class="lineNum">    2222 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">    2223 </span>                :     inline bool
-<span class="lineNum">    2224 </span>                :     operator!=(const basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp; __lhs,
-<span class="lineNum">    2225 </span><span class="lineCov">          74475 :                const _CharT* __rhs)</span>
-<span class="lineNum">    2226 </span><span class="lineCov">          74475 :     { return !(__lhs == __rhs); }</span>
-<span class="lineNum">    2227 </span>                : 
-<span class="lineNum">    2228 </span>                :   // operator &lt;
-<span class="lineNum">    2229 </span>                :   /**
-<span class="lineNum">    2230 </span>                :    *  @brief  Test if string precedes string.
-<span class="lineNum">    2231 </span>                :    *  @param lhs  First string.
-<span class="lineNum">    2232 </span>                :    *  @param rhs  Second string.
-<span class="lineNum">    2233 </span>                :    *  @return  True if @a lhs precedes @a rhs.  False otherwise.
-<span class="lineNum">    2234 </span>                :    */
-<span class="lineNum">    2235 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">    2236 </span>                :     inline bool
-<span class="lineNum">    2237 </span>                :     operator&lt;(const basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp; __lhs,
-<span class="lineNum">    2238 </span><span class="lineCov">        4885154 :               const basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp; __rhs)</span>
-<span class="lineNum">    2239 </span><span class="lineCov">        4885154 :     { return __lhs.compare(__rhs) &lt; 0; }</span>
-<span class="lineNum">    2240 </span>                : 
-<span class="lineNum">    2241 </span>                :   /**
-<span class="lineNum">    2242 </span>                :    *  @brief  Test if string precedes C string.
-<span class="lineNum">    2243 </span>                :    *  @param lhs  String.
-<span class="lineNum">    2244 </span>                :    *  @param rhs  C string.
-<span class="lineNum">    2245 </span>                :    *  @return  True if @a lhs precedes @a rhs.  False otherwise.
-<span class="lineNum">    2246 </span>                :    */
-<span class="lineNum">    2247 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">    2248 </span>                :     inline bool
-<span class="lineNum">    2249 </span>                :     operator&lt;(const basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp; __lhs,
-<span class="lineNum">    2250 </span>                :               const _CharT* __rhs)
-<span class="lineNum">    2251 </span>                :     { return __lhs.compare(__rhs) &lt; 0; }
-<span class="lineNum">    2252 </span>                : 
-<span class="lineNum">    2253 </span>                :   /**
-<span class="lineNum">    2254 </span>                :    *  @brief  Test if C string precedes string.
-<span class="lineNum">    2255 </span>                :    *  @param lhs  C string.
-<span class="lineNum">    2256 </span>                :    *  @param rhs  String.
-<span class="lineNum">    2257 </span>                :    *  @return  True if @a lhs precedes @a rhs.  False otherwise.
-<span class="lineNum">    2258 </span>                :    */
-<span class="lineNum">    2259 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">    2260 </span>                :     inline bool
-<span class="lineNum">    2261 </span>                :     operator&lt;(const _CharT* __lhs,
-<span class="lineNum">    2262 </span>                :               const basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp; __rhs)
-<span class="lineNum">    2263 </span>                :     { return __rhs.compare(__lhs) &gt; 0; }
-<span class="lineNum">    2264 </span>                : 
-<span class="lineNum">    2265 </span>                :   // operator &gt;
-<span class="lineNum">    2266 </span>                :   /**
-<span class="lineNum">    2267 </span>                :    *  @brief  Test if string follows string.
-<span class="lineNum">    2268 </span>                :    *  @param lhs  First string.
-<span class="lineNum">    2269 </span>                :    *  @param rhs  Second string.
-<span class="lineNum">    2270 </span>                :    *  @return  True if @a lhs follows @a rhs.  False otherwise.
-<span class="lineNum">    2271 </span>                :    */
-<span class="lineNum">    2272 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">    2273 </span>                :     inline bool
-<span class="lineNum">    2274 </span>                :     operator&gt;(const basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp; __lhs,
-<span class="lineNum">    2275 </span><span class="lineCov">        1024110 :               const basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp; __rhs)</span>
-<span class="lineNum">    2276 </span><span class="lineCov">        1024110 :     { return __lhs.compare(__rhs) &gt; 0; }</span>
-<span class="lineNum">    2277 </span>                : 
-<span class="lineNum">    2278 </span>                :   /**
-<span class="lineNum">    2279 </span>                :    *  @brief  Test if string follows C string.
-<span class="lineNum">    2280 </span>                :    *  @param lhs  String.
-<span class="lineNum">    2281 </span>                :    *  @param rhs  C string.
-<span class="lineNum">    2282 </span>                :    *  @return  True if @a lhs follows @a rhs.  False otherwise.
-<span class="lineNum">    2283 </span>                :    */
-<span class="lineNum">    2284 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">    2285 </span>                :     inline bool
-<span class="lineNum">    2286 </span>                :     operator&gt;(const basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp; __lhs,
-<span class="lineNum">    2287 </span>                :               const _CharT* __rhs)
-<span class="lineNum">    2288 </span>                :     { return __lhs.compare(__rhs) &gt; 0; }
-<span class="lineNum">    2289 </span>                : 
-<span class="lineNum">    2290 </span>                :   /**
-<span class="lineNum">    2291 </span>                :    *  @brief  Test if C string follows string.
-<span class="lineNum">    2292 </span>                :    *  @param lhs  C string.
-<span class="lineNum">    2293 </span>                :    *  @param rhs  String.
-<span class="lineNum">    2294 </span>                :    *  @return  True if @a lhs follows @a rhs.  False otherwise.
-<span class="lineNum">    2295 </span>                :    */
-<span class="lineNum">    2296 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">    2297 </span>                :     inline bool
-<span class="lineNum">    2298 </span>                :     operator&gt;(const _CharT* __lhs,
-<span class="lineNum">    2299 </span>                :               const basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp; __rhs)
-<span class="lineNum">    2300 </span>                :     { return __rhs.compare(__lhs) &lt; 0; }
-<span class="lineNum">    2301 </span>                : 
-<span class="lineNum">    2302 </span>                :   // operator &lt;=
-<span class="lineNum">    2303 </span>                :   /**
-<span class="lineNum">    2304 </span>                :    *  @brief  Test if string doesn't follow string.
-<span class="lineNum">    2305 </span>                :    *  @param lhs  First string.
-<span class="lineNum">    2306 </span>                :    *  @param rhs  Second string.
-<span class="lineNum">    2307 </span>                :    *  @return  True if @a lhs doesn't follow @a rhs.  False otherwise.
-<span class="lineNum">    2308 </span>                :    */
-<span class="lineNum">    2309 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">    2310 </span>                :     inline bool
-<span class="lineNum">    2311 </span>                :     operator&lt;=(const basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp; __lhs,
-<span class="lineNum">    2312 </span><span class="lineCov">             58 :                const basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp; __rhs)</span>
-<span class="lineNum">    2313 </span><span class="lineCov">             58 :     { return __lhs.compare(__rhs) &lt;= 0; }</span>
-<span class="lineNum">    2314 </span>                : 
-<span class="lineNum">    2315 </span>                :   /**
-<span class="lineNum">    2316 </span>                :    *  @brief  Test if string doesn't follow C string.
-<span class="lineNum">    2317 </span>                :    *  @param lhs  String.
-<span class="lineNum">    2318 </span>                :    *  @param rhs  C string.
-<span class="lineNum">    2319 </span>                :    *  @return  True if @a lhs doesn't follow @a rhs.  False otherwise.
-<span class="lineNum">    2320 </span>                :    */
-<span class="lineNum">    2321 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">    2322 </span>                :     inline bool
-<span class="lineNum">    2323 </span>                :     operator&lt;=(const basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp; __lhs,
-<span class="lineNum">    2324 </span>                :                const _CharT* __rhs)
-<span class="lineNum">    2325 </span>                :     { return __lhs.compare(__rhs) &lt;= 0; }
-<span class="lineNum">    2326 </span>                : 
-<span class="lineNum">    2327 </span>                :   /**
-<span class="lineNum">    2328 </span>                :    *  @brief  Test if C string doesn't follow string.
-<span class="lineNum">    2329 </span>                :    *  @param lhs  C string.
-<span class="lineNum">    2330 </span>                :    *  @param rhs  String.
-<span class="lineNum">    2331 </span>                :    *  @return  True if @a lhs doesn't follow @a rhs.  False otherwise.
-<span class="lineNum">    2332 </span>                :    */
-<span class="lineNum">    2333 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">    2334 </span>                :     inline bool
-<span class="lineNum">    2335 </span>                :     operator&lt;=(const _CharT* __lhs,
-<span class="lineNum">    2336 </span>                :                const basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp; __rhs)
-<span class="lineNum">    2337 </span>                :     { return __rhs.compare(__lhs) &gt;= 0; }
-<span class="lineNum">    2338 </span>                : 
-<span class="lineNum">    2339 </span>                :   // operator &gt;=
-<span class="lineNum">    2340 </span>                :   /**
-<span class="lineNum">    2341 </span>                :    *  @brief  Test if string doesn't precede string.
-<span class="lineNum">    2342 </span>                :    *  @param lhs  First string.
-<span class="lineNum">    2343 </span>                :    *  @param rhs  Second string.
-<span class="lineNum">    2344 </span>                :    *  @return  True if @a lhs doesn't precede @a rhs.  False otherwise.
-<span class="lineNum">    2345 </span>                :    */
-<span class="lineNum">    2346 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">    2347 </span>                :     inline bool
-<span class="lineNum">    2348 </span>                :     operator&gt;=(const basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp; __lhs,
-<span class="lineNum">    2349 </span>                :                const basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp; __rhs)
-<span class="lineNum">    2350 </span>                :     { return __lhs.compare(__rhs) &gt;= 0; }
-<span class="lineNum">    2351 </span>                : 
-<span class="lineNum">    2352 </span>                :   /**
-<span class="lineNum">    2353 </span>                :    *  @brief  Test if string doesn't precede C string.
-<span class="lineNum">    2354 </span>                :    *  @param lhs  String.
-<span class="lineNum">    2355 </span>                :    *  @param rhs  C string.
-<span class="lineNum">    2356 </span>                :    *  @return  True if @a lhs doesn't precede @a rhs.  False otherwise.
-<span class="lineNum">    2357 </span>                :    */
-<span class="lineNum">    2358 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">    2359 </span>                :     inline bool
-<span class="lineNum">    2360 </span>                :     operator&gt;=(const basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp; __lhs,
-<span class="lineNum">    2361 </span>                :                const _CharT* __rhs)
-<span class="lineNum">    2362 </span>                :     { return __lhs.compare(__rhs) &gt;= 0; }
-<span class="lineNum">    2363 </span>                : 
-<span class="lineNum">    2364 </span>                :   /**
-<span class="lineNum">    2365 </span>                :    *  @brief  Test if C string doesn't precede string.
-<span class="lineNum">    2366 </span>                :    *  @param lhs  C string.
-<span class="lineNum">    2367 </span>                :    *  @param rhs  String.
-<span class="lineNum">    2368 </span>                :    *  @return  True if @a lhs doesn't precede @a rhs.  False otherwise.
-<span class="lineNum">    2369 </span>                :    */
-<span class="lineNum">    2370 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">    2371 </span>                :     inline bool
-<span class="lineNum">    2372 </span>                :     operator&gt;=(const _CharT* __lhs,
-<span class="lineNum">    2373 </span>                :              const basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp; __rhs)
-<span class="lineNum">    2374 </span>                :     { return __rhs.compare(__lhs) &lt;= 0; }
-<span class="lineNum">    2375 </span>                : 
-<span class="lineNum">    2376 </span>                :   /**
-<span class="lineNum">    2377 </span>                :    *  @brief  Swap contents of two strings.
-<span class="lineNum">    2378 </span>                :    *  @param lhs  First string.
-<span class="lineNum">    2379 </span>                :    *  @param rhs  Second string.
-<span class="lineNum">    2380 </span>                :    *
-<span class="lineNum">    2381 </span>                :    *  Exchanges the contents of @a lhs and @a rhs in constant time.
-<span class="lineNum">    2382 </span>                :    */
-<span class="lineNum">    2383 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">    2384 </span>                :     inline void
-<span class="lineNum">    2385 </span>                :     swap(basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp; __lhs,
-<span class="lineNum">    2386 </span><span class="lineNoCov">              0 :          basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp; __rhs)</span>
-<span class="lineNum">    2387 </span><span class="lineNoCov">              0 :     { __lhs.swap(__rhs); }</span>
-<span class="lineNum">    2388 </span>                : 
-<span class="lineNum">    2389 </span>                :   /**
-<span class="lineNum">    2390 </span>                :    *  @brief  Read stream into a string.
-<span class="lineNum">    2391 </span>                :    *  @param is  Input stream.
-<span class="lineNum">    2392 </span>                :    *  @param str  Buffer to store into.
-<span class="lineNum">    2393 </span>                :    *  @return  Reference to the input stream.
-<span class="lineNum">    2394 </span>                :    *
-<span class="lineNum">    2395 </span>                :    *  Stores characters from @a is into @a str until whitespace is found, the
-<span class="lineNum">    2396 </span>                :    *  end of the stream is encountered, or str.max_size() is reached.  If
-<span class="lineNum">    2397 </span>                :    *  is.width() is non-zero, that is the limit on the number of characters
-<span class="lineNum">    2398 </span>                :    *  stored into @a str.  Any previous contents of @a str are erased.
-<span class="lineNum">    2399 </span>                :    */
-<span class="lineNum">    2400 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">    2401 </span>                :     basic_istream&lt;_CharT, _Traits&gt;&amp;
-<span class="lineNum">    2402 </span>                :     operator&gt;&gt;(basic_istream&lt;_CharT, _Traits&gt;&amp; __is,
-<span class="lineNum">    2403 </span>                :                basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp; __str);
-<span class="lineNum">    2404 </span>                : 
-<span class="lineNum">    2405 </span>                :   template&lt;&gt;
-<span class="lineNum">    2406 </span>                :     basic_istream&lt;char&gt;&amp;
-<span class="lineNum">    2407 </span>                :     operator&gt;&gt;(basic_istream&lt;char&gt;&amp; __is, basic_string&lt;char&gt;&amp; __str);
-<span class="lineNum">    2408 </span>                : 
-<span class="lineNum">    2409 </span>                :   /**
-<span class="lineNum">    2410 </span>                :    *  @brief  Write string to a stream.
-<span class="lineNum">    2411 </span>                :    *  @param os  Output stream.
-<span class="lineNum">    2412 </span>                :    *  @param str  String to write out.
-<span class="lineNum">    2413 </span>                :    *  @return  Reference to the output stream.
-<span class="lineNum">    2414 </span>                :    *
-<span class="lineNum">    2415 </span>                :    *  Output characters of @a str into os following the same rules as for
-<span class="lineNum">    2416 </span>                :    *  writing a C string.
-<span class="lineNum">    2417 </span>                :    */
-<span class="lineNum">    2418 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">    2419 </span>                :     inline basic_ostream&lt;_CharT, _Traits&gt;&amp;
-<span class="lineNum">    2420 </span>                :     operator&lt;&lt;(basic_ostream&lt;_CharT, _Traits&gt;&amp; __os,
-<span class="lineNum">    2421 </span><span class="lineNoCov">              0 :                const basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp; __str)</span>
-<span class="lineNum">    2422 </span>                :     {
-<span class="lineNum">    2423 </span>                :       // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">    2424 </span>                :       // 586. string inserter not a formatted function
-<span class="lineNum">    2425 </span><span class="lineNoCov">              0 :       return __ostream_insert(__os, __str.data(), __str.size());</span>
-<span class="lineNum">    2426 </span>                :     }
-<span class="lineNum">    2427 </span>                : 
-<span class="lineNum">    2428 </span>                :   /**
-<span class="lineNum">    2429 </span>                :    *  @brief  Read a line from stream into a string.
-<span class="lineNum">    2430 </span>                :    *  @param is  Input stream.
-<span class="lineNum">    2431 </span>                :    *  @param str  Buffer to store into.
-<span class="lineNum">    2432 </span>                :    *  @param delim  Character marking end of line.
-<span class="lineNum">    2433 </span>                :    *  @return  Reference to the input stream.
-<span class="lineNum">    2434 </span>                :    *
-<span class="lineNum">    2435 </span>                :    *  Stores characters from @a is into @a str until @a delim is found, the
-<span class="lineNum">    2436 </span>                :    *  end of the stream is encountered, or str.max_size() is reached.  If
-<span class="lineNum">    2437 </span>                :    *  is.width() is non-zero, that is the limit on the number of characters
-<span class="lineNum">    2438 </span>                :    *  stored into @a str.  Any previous contents of @a str are erased.  If @a
-<span class="lineNum">    2439 </span>                :    *  delim was encountered, it is extracted but not stored into @a str.
-<span class="lineNum">    2440 </span>                :    */
-<span class="lineNum">    2441 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">    2442 </span>                :     basic_istream&lt;_CharT, _Traits&gt;&amp;
-<span class="lineNum">    2443 </span>                :     getline(basic_istream&lt;_CharT, _Traits&gt;&amp; __is,
-<span class="lineNum">    2444 </span>                :             basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp; __str, _CharT __delim);
-<span class="lineNum">    2445 </span>                : 
-<span class="lineNum">    2446 </span>                :   /**
-<span class="lineNum">    2447 </span>                :    *  @brief  Read a line from stream into a string.
-<span class="lineNum">    2448 </span>                :    *  @param is  Input stream.
-<span class="lineNum">    2449 </span>                :    *  @param str  Buffer to store into.
-<span class="lineNum">    2450 </span>                :    *  @return  Reference to the input stream.
-<span class="lineNum">    2451 </span>                :    *
-<span class="lineNum">    2452 </span>                :    *  Stores characters from is into @a str until '\n' is found, the end of
-<span class="lineNum">    2453 </span>                :    *  the stream is encountered, or str.max_size() is reached.  If is.width()
-<span class="lineNum">    2454 </span>                :    *  is non-zero, that is the limit on the number of characters stored into
-<span class="lineNum">    2455 </span>                :    *  @a str.  Any previous contents of @a str are erased.  If end of line was
-<span class="lineNum">    2456 </span>                :    *  encountered, it is extracted but not stored into @a str.
-<span class="lineNum">    2457 </span>                :    */
-<span class="lineNum">    2458 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">    2459 </span>                :     inline basic_istream&lt;_CharT, _Traits&gt;&amp;
-<span class="lineNum">    2460 </span>                :     getline(basic_istream&lt;_CharT, _Traits&gt;&amp; __is,
-<span class="lineNum">    2461 </span><span class="lineNoCov">              0 :             basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp; __str)</span>
-<span class="lineNum">    2462 </span><span class="lineNoCov">              0 :     { return getline(__is, __str, __is.widen('\n')); }</span>
-<span class="lineNum">    2463 </span>                : 
-<span class="lineNum">    2464 </span>                :   template&lt;&gt;
-<span class="lineNum">    2465 </span>                :     basic_istream&lt;char&gt;&amp;
-<span class="lineNum">    2466 </span>                :     getline(basic_istream&lt;char&gt;&amp; __in, basic_string&lt;char&gt;&amp; __str,
-<span class="lineNum">    2467 </span>                :             char __delim);
-<span class="lineNum">    2468 </span>                : 
-<span class="lineNum">    2469 </span>                : #ifdef _GLIBCXX_USE_WCHAR_T
-<span class="lineNum">    2470 </span>                :   template&lt;&gt;
-<span class="lineNum">    2471 </span>                :     basic_istream&lt;wchar_t&gt;&amp;
-<span class="lineNum">    2472 </span>                :     getline(basic_istream&lt;wchar_t&gt;&amp; __in, basic_string&lt;wchar_t&gt;&amp; __str,
-<span class="lineNum">    2473 </span>                :             wchar_t __delim);
-<span class="lineNum">    2474 </span>                : #endif  
-<span class="lineNum">    2475 </span>                : 
-<span class="lineNum">    2476 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">    2477 </span>                : 
-<span class="lineNum">    2478 </span>                : #endif /* _BASIC_STRING_H */
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/bits/basic_string.tcc.gcov.html b/rep/usr/include/c++/4.3/bits/basic_string.tcc.gcov.html
deleted file mode 100644
index 169e3e7..0000000
--- a/rep/usr/include/c++/4.3/bits/basic_string.tcc.gcov.html
+++ /dev/null
@@ -1,1208 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/basic_string.tcc</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - basic_string.tcc</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">23</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">73.9 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">17</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // Components for manipulating sequences of characters -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005,
-<span class="lineNum">       4 </span>                : // 2006, 2007
-<span class="lineNum">       5 </span>                : // Free Software Foundation, Inc.
-<span class="lineNum">       6 </span>                : //
-<span class="lineNum">       7 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       8 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       9 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">      10 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      11 </span>                : // any later version.
-<span class="lineNum">      12 </span>                : 
-<span class="lineNum">      13 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      14 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      15 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      16 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      17 </span>                : 
-<span class="lineNum">      18 </span>                : // You should have received a copy of the GNU General Public License along
-<span class="lineNum">      19 </span>                : // with this library; see the file COPYING.  If not, write to the Free
-<span class="lineNum">      20 </span>                : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-<span class="lineNum">      21 </span>                : // USA.
-<span class="lineNum">      22 </span>                : 
-<span class="lineNum">      23 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      24 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      25 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      26 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      27 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      28 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      29 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      30 </span>                : // the GNU General Public License.
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span>                : /** @file basic_string.tcc
-<span class="lineNum">      33 </span>                :  *  This is an internal header file, included by other library headers.
-<span class="lineNum">      34 </span>                :  *  You should not attempt to use it directly.
-<span class="lineNum">      35 </span>                :  */
-<span class="lineNum">      36 </span>                : 
-<span class="lineNum">      37 </span>                : //
-<span class="lineNum">      38 </span>                : // ISO C++ 14882: 21  Strings library
-<span class="lineNum">      39 </span>                : //
-<span class="lineNum">      40 </span>                : 
-<span class="lineNum">      41 </span>                : // Written by Jason Merrill based upon the specification by Takanori Adachi
-<span class="lineNum">      42 </span>                : // in ANSI X3J16/94-0013R2.  Rewritten by Nathan Myers to ISO-14882.
-<span class="lineNum">      43 </span>                : 
-<span class="lineNum">      44 </span>                : #ifndef _BASIC_STRING_TCC
-<span class="lineNum">      45 </span>                : #define _BASIC_STRING_TCC 1
-<span class="lineNum">      46 </span>                : 
-<span class="lineNum">      47 </span>                : #pragma GCC system_header
-<span class="lineNum">      48 </span>                : 
-<span class="lineNum">      49 </span>                : #include &lt;cxxabi-forced.h&gt;
-<span class="lineNum">      50 </span>                : 
-<span class="lineNum">      51 </span>                : _GLIBCXX_BEGIN_NAMESPACE(std)
-<span class="lineNum">      52 </span>                : 
-<span class="lineNum">      53 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">      54 </span>                :     const typename basic_string&lt;_CharT, _Traits, _Alloc&gt;::size_type
-<span class="lineNum">      55 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">      56 </span>                :     _Rep::_S_max_size = (((npos - sizeof(_Rep_base))/sizeof(_CharT)) - 1) / 4;
-<span class="lineNum">      57 </span>                : 
-<span class="lineNum">      58 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">      59 </span>                :     const _CharT
-<span class="lineNum">      60 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">      61 </span>                :     _Rep::_S_terminal = _CharT();
-<span class="lineNum">      62 </span>                : 
-<span class="lineNum">      63 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">      64 </span>                :     const typename basic_string&lt;_CharT, _Traits, _Alloc&gt;::size_type
-<span class="lineNum">      65 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::npos;
-<span class="lineNum">      66 </span>                : 
-<span class="lineNum">      67 </span>                :   // Linker sets _S_empty_rep_storage to all 0s (one reference, empty string)
-<span class="lineNum">      68 </span>                :   // at static init time (before static ctors are run).
-<span class="lineNum">      69 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">      70 </span>                :     typename basic_string&lt;_CharT, _Traits, _Alloc&gt;::size_type
-<span class="lineNum">      71 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::_Rep::_S_empty_rep_storage[
-<span class="lineNum">      72 </span>                :     (sizeof(_Rep_base) + sizeof(_CharT) + sizeof(size_type) - 1) /
-<span class="lineNum">      73 </span>                :       sizeof(size_type)];
-<span class="lineNum">      74 </span>                : 
-<span class="lineNum">      75 </span>                :   // NB: This is the special case for Input Iterators, used in
-<span class="lineNum">      76 </span>                :   // istreambuf_iterators, etc.
-<span class="lineNum">      77 </span>                :   // Input Iterators have a cost structure very different from
-<span class="lineNum">      78 </span>                :   // pointers, calling for a different coding style.
-<span class="lineNum">      79 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">      80 </span>                :     template&lt;typename _InIterator&gt;
-<span class="lineNum">      81 </span>                :       _CharT*
-<span class="lineNum">      82 </span>                :       basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">      83 </span>                :       _S_construct(_InIterator __beg, _InIterator __end, const _Alloc&amp; __a,
-<span class="lineNum">      84 </span>                :                    input_iterator_tag)
-<span class="lineNum">      85 </span>                :       {
-<span class="lineNum">      86 </span>                : #ifndef _GLIBCXX_FULLY_DYNAMIC_STRING
-<span class="lineNum">      87 </span>                :         if (__beg == __end &amp;&amp; __a == _Alloc())
-<span class="lineNum">      88 </span>                :           return _S_empty_rep()._M_refdata();
-<span class="lineNum">      89 </span>                : #endif
-<span class="lineNum">      90 </span>                :         // Avoid reallocation for common case.
-<span class="lineNum">      91 </span>                :         _CharT __buf[128];
-<span class="lineNum">      92 </span>                :         size_type __len = 0;
-<span class="lineNum">      93 </span>                :         while (__beg != __end &amp;&amp; __len &lt; sizeof(__buf) / sizeof(_CharT))
-<span class="lineNum">      94 </span>                :           {
-<span class="lineNum">      95 </span>                :             __buf[__len++] = *__beg;
-<span class="lineNum">      96 </span>                :             ++__beg;
-<span class="lineNum">      97 </span>                :           }
-<span class="lineNum">      98 </span>                :         _Rep* __r = _Rep::_S_create(__len, size_type(0), __a);
-<span class="lineNum">      99 </span>                :         _M_copy(__r-&gt;_M_refdata(), __buf, __len);
-<span class="lineNum">     100 </span>                :         try
-<span class="lineNum">     101 </span>                :           {
-<span class="lineNum">     102 </span>                :             while (__beg != __end)
-<span class="lineNum">     103 </span>                :               {
-<span class="lineNum">     104 </span>                :                 if (__len == __r-&gt;_M_capacity)
-<span class="lineNum">     105 </span>                :                   {
-<span class="lineNum">     106 </span>                :                     // Allocate more space.
-<span class="lineNum">     107 </span>                :                     _Rep* __another = _Rep::_S_create(__len + 1, __len, __a);
-<span class="lineNum">     108 </span>                :                     _M_copy(__another-&gt;_M_refdata(), __r-&gt;_M_refdata(), __len);
-<span class="lineNum">     109 </span>                :                     __r-&gt;_M_destroy(__a);
-<span class="lineNum">     110 </span>                :                     __r = __another;
-<span class="lineNum">     111 </span>                :                   }
-<span class="lineNum">     112 </span>                :                 __r-&gt;_M_refdata()[__len++] = *__beg;
-<span class="lineNum">     113 </span>                :                 ++__beg;
-<span class="lineNum">     114 </span>                :               }
-<span class="lineNum">     115 </span>                :           }
-<span class="lineNum">     116 </span>                :         catch(...)
-<span class="lineNum">     117 </span>                :           {
-<span class="lineNum">     118 </span>                :             __r-&gt;_M_destroy(__a);
-<span class="lineNum">     119 </span>                :             __throw_exception_again;
-<span class="lineNum">     120 </span>                :           }
-<span class="lineNum">     121 </span>                :         __r-&gt;_M_set_length_and_sharable(__len);
-<span class="lineNum">     122 </span>                :         return __r-&gt;_M_refdata();
-<span class="lineNum">     123 </span>                :       }
-<span class="lineNum">     124 </span>                : 
-<span class="lineNum">     125 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     126 </span>                :     template &lt;typename _InIterator&gt;
-<span class="lineNum">     127 </span>                :       _CharT*
-<span class="lineNum">     128 </span>                :       basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     129 </span>                :       _S_construct(_InIterator __beg, _InIterator __end, const _Alloc&amp; __a,
-<span class="lineNum">     130 </span><span class="lineCov">           1287 :                    forward_iterator_tag)</span>
-<span class="lineNum">     131 </span>                :       {
-<span class="lineNum">     132 </span>                : #ifndef _GLIBCXX_FULLY_DYNAMIC_STRING
-<span class="lineNum">     133 </span><span class="lineCov">           1287 :         if (__beg == __end &amp;&amp; __a == _Alloc())</span>
-<span class="lineNum">     134 </span><span class="lineNoCov">              0 :           return _S_empty_rep()._M_refdata();</span>
-<span class="lineNum">     135 </span>                : #endif
-<span class="lineNum">     136 </span>                :         // NB: Not required, but considered best practice.
-<span class="lineNum">     137 </span><span class="lineCov">           1287 :         if (__builtin_expect(__gnu_cxx::__is_null_pointer(__beg)</span>
-<span class="lineNum">     138 </span>                :                              &amp;&amp; __beg != __end, 0))
-<span class="lineNum">     139 </span><span class="lineNoCov">              0 :           __throw_logic_error(__N(&quot;basic_string::_S_construct NULL not valid&quot;));</span>
-<span class="lineNum">     140 </span>                : 
-<span class="lineNum">     141 </span>                :         const size_type __dnew = static_cast&lt;size_type&gt;(std::distance(__beg,
-<span class="lineNum">     142 </span><span class="lineCov">           1287 :                                                                       __end));</span>
-<span class="lineNum">     143 </span>                :         // Check for out_of_range and length_error exceptions.
-<span class="lineNum">     144 </span><span class="lineCov">           1287 :         _Rep* __r = _Rep::_S_create(__dnew, size_type(0), __a);</span>
-<span class="lineNum">     145 </span>                :         try
-<span class="lineNum">     146 </span><span class="lineCov">           1287 :           { _S_copy_chars(__r-&gt;_M_refdata(), __beg, __end); }</span>
-<span class="lineNum">     147 </span><span class="lineNoCov">              0 :         catch(...)</span>
-<span class="lineNum">     148 </span>                :           {
-<span class="lineNum">     149 </span><span class="lineNoCov">              0 :             __r-&gt;_M_destroy(__a);</span>
-<span class="lineNum">     150 </span><span class="lineNoCov">              0 :             __throw_exception_again;</span>
-<span class="lineNum">     151 </span>                :           }
-<span class="lineNum">     152 </span><span class="lineCov">           1287 :         __r-&gt;_M_set_length_and_sharable(__dnew);</span>
-<span class="lineNum">     153 </span><span class="lineCov">           1287 :         return __r-&gt;_M_refdata();</span>
-<span class="lineNum">     154 </span>                :       }
-<span class="lineNum">     155 </span>                : 
-<span class="lineNum">     156 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     157 </span>                :     _CharT*
-<span class="lineNum">     158 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     159 </span>                :     _S_construct(size_type __n, _CharT __c, const _Alloc&amp; __a)
-<span class="lineNum">     160 </span>                :     {
-<span class="lineNum">     161 </span>                : #ifndef _GLIBCXX_FULLY_DYNAMIC_STRING
-<span class="lineNum">     162 </span>                :       if (__n == 0 &amp;&amp; __a == _Alloc())
-<span class="lineNum">     163 </span>                :         return _S_empty_rep()._M_refdata();
-<span class="lineNum">     164 </span>                : #endif
-<span class="lineNum">     165 </span>                :       // Check for out_of_range and length_error exceptions.
-<span class="lineNum">     166 </span>                :       _Rep* __r = _Rep::_S_create(__n, size_type(0), __a);
-<span class="lineNum">     167 </span>                :       if (__n)
-<span class="lineNum">     168 </span>                :         _M_assign(__r-&gt;_M_refdata(), __n, __c);
-<span class="lineNum">     169 </span>                : 
-<span class="lineNum">     170 </span>                :       __r-&gt;_M_set_length_and_sharable(__n);
-<span class="lineNum">     171 </span>                :       return __r-&gt;_M_refdata();
-<span class="lineNum">     172 </span>                :     }
-<span class="lineNum">     173 </span>                : 
-<span class="lineNum">     174 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     175 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     176 </span>                :     basic_string(const basic_string&amp; __str)
-<span class="lineNum">     177 </span>                :     : _M_dataplus(__str._M_rep()-&gt;_M_grab(_Alloc(__str.get_allocator()),
-<span class="lineNum">     178 </span>                :                                           __str.get_allocator()),
-<span class="lineNum">     179 </span>                :                   __str.get_allocator())
-<span class="lineNum">     180 </span>                :     { }
-<span class="lineNum">     181 </span>                : 
-<span class="lineNum">     182 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     183 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     184 </span>                :     basic_string(const _Alloc&amp; __a)
-<span class="lineNum">     185 </span>                :     : _M_dataplus(_S_construct(size_type(), _CharT(), __a), __a)
-<span class="lineNum">     186 </span>                :     { }
-<span class="lineNum">     187 </span>                : 
-<span class="lineNum">     188 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     189 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     190 </span>                :     basic_string(const basic_string&amp; __str, size_type __pos, size_type __n)
-<span class="lineNum">     191 </span>                :     : _M_dataplus(_S_construct(__str._M_data()
-<span class="lineNum">     192 </span>                :                                + __str._M_check(__pos,
-<span class="lineNum">     193 </span>                :                                                 &quot;basic_string::basic_string&quot;),
-<span class="lineNum">     194 </span>                :                                __str._M_data() + __str._M_limit(__pos, __n)
-<span class="lineNum">     195 </span>                :                                + __pos, _Alloc()), _Alloc())
-<span class="lineNum">     196 </span>                :     { }
-<span class="lineNum">     197 </span>                : 
-<span class="lineNum">     198 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     199 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     200 </span>                :     basic_string(const basic_string&amp; __str, size_type __pos,
-<span class="lineNum">     201 </span>                :                  size_type __n, const _Alloc&amp; __a)
-<span class="lineNum">     202 </span>                :     : _M_dataplus(_S_construct(__str._M_data()
-<span class="lineNum">     203 </span>                :                                + __str._M_check(__pos,
-<span class="lineNum">     204 </span>                :                                                 &quot;basic_string::basic_string&quot;),
-<span class="lineNum">     205 </span>                :                                __str._M_data() + __str._M_limit(__pos, __n)
-<span class="lineNum">     206 </span>                :                                + __pos, __a), __a)
-<span class="lineNum">     207 </span>                :     { }
-<span class="lineNum">     208 </span>                : 
-<span class="lineNum">     209 </span>                :   // TBD: DPG annotate
-<span class="lineNum">     210 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     211 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     212 </span>                :     basic_string(const _CharT* __s, size_type __n, const _Alloc&amp; __a)
-<span class="lineNum">     213 </span>                :     : _M_dataplus(_S_construct(__s, __s + __n, __a), __a)
-<span class="lineNum">     214 </span>                :     { }
-<span class="lineNum">     215 </span>                : 
-<span class="lineNum">     216 </span>                :   // TBD: DPG annotate
-<span class="lineNum">     217 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     218 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     219 </span>                :     basic_string(const _CharT* __s, const _Alloc&amp; __a)
-<span class="lineNum">     220 </span>                :     : _M_dataplus(_S_construct(__s, __s ? __s + traits_type::length(__s) :
-<span class="lineNum">     221 </span>                :                                __s + npos, __a), __a)
-<span class="lineNum">     222 </span>                :     { }
-<span class="lineNum">     223 </span>                : 
-<span class="lineNum">     224 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     225 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     226 </span>                :     basic_string(size_type __n, _CharT __c, const _Alloc&amp; __a)
-<span class="lineNum">     227 </span>                :     : _M_dataplus(_S_construct(__n, __c, __a), __a)
-<span class="lineNum">     228 </span>                :     { }
-<span class="lineNum">     229 </span>                : 
-<span class="lineNum">     230 </span>                :   // TBD: DPG annotate
-<span class="lineNum">     231 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     232 </span>                :     template&lt;typename _InputIterator&gt;
-<span class="lineNum">     233 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     234 </span><span class="lineCov">           1287 :     basic_string(_InputIterator __beg, _InputIterator __end, const _Alloc&amp; __a)</span>
-<span class="lineNum">     235 </span><span class="lineCov">           1287 :     : _M_dataplus(_S_construct(__beg, __end, __a), __a)</span>
-<span class="lineNum">     236 </span><span class="lineCov">           1287 :     { }</span>
-<span class="lineNum">     237 </span>                : 
-<span class="lineNum">     238 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     239 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp;
-<span class="lineNum">     240 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     241 </span>                :     assign(const basic_string&amp; __str)
-<span class="lineNum">     242 </span>                :     {
-<span class="lineNum">     243 </span>                :       if (_M_rep() != __str._M_rep())
-<span class="lineNum">     244 </span>                :         {
-<span class="lineNum">     245 </span>                :           // XXX MT
-<span class="lineNum">     246 </span>                :           const allocator_type __a = this-&gt;get_allocator();
-<span class="lineNum">     247 </span>                :           _CharT* __tmp = __str._M_rep()-&gt;_M_grab(__a, __str.get_allocator());
-<span class="lineNum">     248 </span>                :           _M_rep()-&gt;_M_dispose(__a);
-<span class="lineNum">     249 </span>                :           _M_data(__tmp);
-<span class="lineNum">     250 </span>                :         }
-<span class="lineNum">     251 </span>                :       return *this;
-<span class="lineNum">     252 </span>                :     }
-<span class="lineNum">     253 </span>                : 
-<span class="lineNum">     254 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     255 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp;
-<span class="lineNum">     256 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     257 </span>                :     assign(const _CharT* __s, size_type __n)
-<span class="lineNum">     258 </span>                :     {
-<span class="lineNum">     259 </span>                :       __glibcxx_requires_string_len(__s, __n);
-<span class="lineNum">     260 </span>                :       _M_check_length(this-&gt;size(), __n, &quot;basic_string::assign&quot;);
-<span class="lineNum">     261 </span>                :       if (_M_disjunct(__s) || _M_rep()-&gt;_M_is_shared())
-<span class="lineNum">     262 </span>                :         return _M_replace_safe(size_type(0), this-&gt;size(), __s, __n);
-<span class="lineNum">     263 </span>                :       else
-<span class="lineNum">     264 </span>                :         {
-<span class="lineNum">     265 </span>                :           // Work in-place.
-<span class="lineNum">     266 </span>                :           const size_type __pos = __s - _M_data();
-<span class="lineNum">     267 </span>                :           if (__pos &gt;= __n)
-<span class="lineNum">     268 </span>                :             _M_copy(_M_data(), __s, __n);
-<span class="lineNum">     269 </span>                :           else if (__pos)
-<span class="lineNum">     270 </span>                :             _M_move(_M_data(), __s, __n);
-<span class="lineNum">     271 </span>                :           _M_rep()-&gt;_M_set_length_and_sharable(__n);
-<span class="lineNum">     272 </span>                :           return *this;
-<span class="lineNum">     273 </span>                :         }
-<span class="lineNum">     274 </span>                :      }
-<span class="lineNum">     275 </span>                : 
-<span class="lineNum">     276 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     277 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp;
-<span class="lineNum">     278 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     279 </span>                :     append(size_type __n, _CharT __c)
-<span class="lineNum">     280 </span>                :     {
-<span class="lineNum">     281 </span>                :       if (__n)
-<span class="lineNum">     282 </span>                :         {
-<span class="lineNum">     283 </span>                :           _M_check_length(size_type(0), __n, &quot;basic_string::append&quot;);   
-<span class="lineNum">     284 </span>                :           const size_type __len = __n + this-&gt;size();
-<span class="lineNum">     285 </span>                :           if (__len &gt; this-&gt;capacity() || _M_rep()-&gt;_M_is_shared())
-<span class="lineNum">     286 </span>                :             this-&gt;reserve(__len);
-<span class="lineNum">     287 </span>                :           _M_assign(_M_data() + this-&gt;size(), __n, __c);
-<span class="lineNum">     288 </span>                :           _M_rep()-&gt;_M_set_length_and_sharable(__len);
-<span class="lineNum">     289 </span>                :         }
-<span class="lineNum">     290 </span>                :       return *this;
-<span class="lineNum">     291 </span>                :     }
-<span class="lineNum">     292 </span>                : 
-<span class="lineNum">     293 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     294 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp;
-<span class="lineNum">     295 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     296 </span>                :     append(const _CharT* __s, size_type __n)
-<span class="lineNum">     297 </span>                :     {
-<span class="lineNum">     298 </span>                :       __glibcxx_requires_string_len(__s, __n);
-<span class="lineNum">     299 </span>                :       if (__n)
-<span class="lineNum">     300 </span>                :         {
-<span class="lineNum">     301 </span>                :           _M_check_length(size_type(0), __n, &quot;basic_string::append&quot;);
-<span class="lineNum">     302 </span>                :           const size_type __len = __n + this-&gt;size();
-<span class="lineNum">     303 </span>                :           if (__len &gt; this-&gt;capacity() || _M_rep()-&gt;_M_is_shared())
-<span class="lineNum">     304 </span>                :             {
-<span class="lineNum">     305 </span>                :               if (_M_disjunct(__s))
-<span class="lineNum">     306 </span>                :                 this-&gt;reserve(__len);
-<span class="lineNum">     307 </span>                :               else
-<span class="lineNum">     308 </span>                :                 {
-<span class="lineNum">     309 </span>                :                   const size_type __off = __s - _M_data();
-<span class="lineNum">     310 </span>                :                   this-&gt;reserve(__len);
-<span class="lineNum">     311 </span>                :                   __s = _M_data() + __off;
-<span class="lineNum">     312 </span>                :                 }
-<span class="lineNum">     313 </span>                :             }
-<span class="lineNum">     314 </span>                :           _M_copy(_M_data() + this-&gt;size(), __s, __n);
-<span class="lineNum">     315 </span>                :           _M_rep()-&gt;_M_set_length_and_sharable(__len);
-<span class="lineNum">     316 </span>                :         }
-<span class="lineNum">     317 </span>                :       return *this;
-<span class="lineNum">     318 </span>                :     }
-<span class="lineNum">     319 </span>                : 
-<span class="lineNum">     320 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     321 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp;
-<span class="lineNum">     322 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     323 </span>                :     append(const basic_string&amp; __str)
-<span class="lineNum">     324 </span>                :     {
-<span class="lineNum">     325 </span>                :       const size_type __size = __str.size();
-<span class="lineNum">     326 </span>                :       if (__size)
-<span class="lineNum">     327 </span>                :         {
-<span class="lineNum">     328 </span>                :           const size_type __len = __size + this-&gt;size();
-<span class="lineNum">     329 </span>                :           if (__len &gt; this-&gt;capacity() || _M_rep()-&gt;_M_is_shared())
-<span class="lineNum">     330 </span>                :             this-&gt;reserve(__len);
-<span class="lineNum">     331 </span>                :           _M_copy(_M_data() + this-&gt;size(), __str._M_data(), __size);
-<span class="lineNum">     332 </span>                :           _M_rep()-&gt;_M_set_length_and_sharable(__len);
-<span class="lineNum">     333 </span>                :         }
-<span class="lineNum">     334 </span>                :       return *this;
-<span class="lineNum">     335 </span>                :     }    
-<span class="lineNum">     336 </span>                : 
-<span class="lineNum">     337 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     338 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp;
-<span class="lineNum">     339 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     340 </span>                :     append(const basic_string&amp; __str, size_type __pos, size_type __n)
-<span class="lineNum">     341 </span>                :     {
-<span class="lineNum">     342 </span>                :       __str._M_check(__pos, &quot;basic_string::append&quot;);
-<span class="lineNum">     343 </span>                :       __n = __str._M_limit(__pos, __n);
-<span class="lineNum">     344 </span>                :       if (__n)
-<span class="lineNum">     345 </span>                :         {
-<span class="lineNum">     346 </span>                :           const size_type __len = __n + this-&gt;size();
-<span class="lineNum">     347 </span>                :           if (__len &gt; this-&gt;capacity() || _M_rep()-&gt;_M_is_shared())
-<span class="lineNum">     348 </span>                :             this-&gt;reserve(__len);
-<span class="lineNum">     349 </span>                :           _M_copy(_M_data() + this-&gt;size(), __str._M_data() + __pos, __n);
-<span class="lineNum">     350 </span>                :           _M_rep()-&gt;_M_set_length_and_sharable(__len);         
-<span class="lineNum">     351 </span>                :         }
-<span class="lineNum">     352 </span>                :       return *this;
-<span class="lineNum">     353 </span>                :     }
-<span class="lineNum">     354 </span>                : 
-<span class="lineNum">     355 </span>                :    template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     356 </span>                :      basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp;
-<span class="lineNum">     357 </span>                :      basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     358 </span>                :      insert(size_type __pos, const _CharT* __s, size_type __n)
-<span class="lineNum">     359 </span>                :      {
-<span class="lineNum">     360 </span>                :        __glibcxx_requires_string_len(__s, __n);
-<span class="lineNum">     361 </span>                :        _M_check(__pos, &quot;basic_string::insert&quot;);
-<span class="lineNum">     362 </span>                :        _M_check_length(size_type(0), __n, &quot;basic_string::insert&quot;);
-<span class="lineNum">     363 </span>                :        if (_M_disjunct(__s) || _M_rep()-&gt;_M_is_shared())
-<span class="lineNum">     364 </span>                :          return _M_replace_safe(__pos, size_type(0), __s, __n);
-<span class="lineNum">     365 </span>                :        else
-<span class="lineNum">     366 </span>                :          {
-<span class="lineNum">     367 </span>                :            // Work in-place.
-<span class="lineNum">     368 </span>                :            const size_type __off = __s - _M_data();
-<span class="lineNum">     369 </span>                :            _M_mutate(__pos, 0, __n);
-<span class="lineNum">     370 </span>                :            __s = _M_data() + __off;
-<span class="lineNum">     371 </span>                :            _CharT* __p = _M_data() + __pos;
-<span class="lineNum">     372 </span>                :            if (__s  + __n &lt;= __p)
-<span class="lineNum">     373 </span>                :              _M_copy(__p, __s, __n);
-<span class="lineNum">     374 </span>                :            else if (__s &gt;= __p)
-<span class="lineNum">     375 </span>                :              _M_copy(__p, __s + __n, __n);
-<span class="lineNum">     376 </span>                :            else
-<span class="lineNum">     377 </span>                :              {
-<span class="lineNum">     378 </span>                :                const size_type __nleft = __p - __s;
-<span class="lineNum">     379 </span>                :                _M_copy(__p, __s, __nleft);
-<span class="lineNum">     380 </span>                :                _M_copy(__p + __nleft, __p + __n, __n - __nleft);
-<span class="lineNum">     381 </span>                :              }
-<span class="lineNum">     382 </span>                :            return *this;
-<span class="lineNum">     383 </span>                :          }
-<span class="lineNum">     384 </span>                :      }
-<span class="lineNum">     385 </span>                : 
-<span class="lineNum">     386 </span>                :    template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     387 </span>                :      basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp;
-<span class="lineNum">     388 </span>                :      basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     389 </span>                :      replace(size_type __pos, size_type __n1, const _CharT* __s,
-<span class="lineNum">     390 </span>                :              size_type __n2)
-<span class="lineNum">     391 </span>                :      {
-<span class="lineNum">     392 </span>                :        __glibcxx_requires_string_len(__s, __n2);
-<span class="lineNum">     393 </span>                :        _M_check(__pos, &quot;basic_string::replace&quot;);
-<span class="lineNum">     394 </span>                :        __n1 = _M_limit(__pos, __n1);
-<span class="lineNum">     395 </span>                :        _M_check_length(__n1, __n2, &quot;basic_string::replace&quot;);
-<span class="lineNum">     396 </span>                :        bool __left;
-<span class="lineNum">     397 </span>                :        if (_M_disjunct(__s) || _M_rep()-&gt;_M_is_shared())
-<span class="lineNum">     398 </span>                :          return _M_replace_safe(__pos, __n1, __s, __n2);
-<span class="lineNum">     399 </span>                :        else if ((__left = __s + __n2 &lt;= _M_data() + __pos)
-<span class="lineNum">     400 </span>                :                 || _M_data() + __pos + __n1 &lt;= __s)
-<span class="lineNum">     401 </span>                :          {
-<span class="lineNum">     402 </span>                :            // Work in-place: non-overlapping case.
-<span class="lineNum">     403 </span>                :            size_type __off = __s - _M_data();
-<span class="lineNum">     404 </span>                :            __left ? __off : (__off += __n2 - __n1);
-<span class="lineNum">     405 </span>                :            _M_mutate(__pos, __n1, __n2);
-<span class="lineNum">     406 </span>                :            _M_copy(_M_data() + __pos, _M_data() + __off, __n2);
-<span class="lineNum">     407 </span>                :            return *this;
-<span class="lineNum">     408 </span>                :          }
-<span class="lineNum">     409 </span>                :        else
-<span class="lineNum">     410 </span>                :          {
-<span class="lineNum">     411 </span>                :            // Todo: overlapping case.
-<span class="lineNum">     412 </span>                :            const basic_string __tmp(__s, __n2);
-<span class="lineNum">     413 </span>                :            return _M_replace_safe(__pos, __n1, __tmp._M_data(), __n2);
-<span class="lineNum">     414 </span>                :          }
-<span class="lineNum">     415 </span>                :      }
-<span class="lineNum">     416 </span>                : 
-<span class="lineNum">     417 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     418 </span>                :     void
-<span class="lineNum">     419 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::_Rep::
-<span class="lineNum">     420 </span>                :     _M_destroy(const _Alloc&amp; __a) throw ()
-<span class="lineNum">     421 </span>                :     {
-<span class="lineNum">     422 </span>                :       const size_type __size = sizeof(_Rep_base) +
-<span class="lineNum">     423 </span>                :                                (this-&gt;_M_capacity + 1) * sizeof(_CharT);
-<span class="lineNum">     424 </span>                :       _Raw_bytes_alloc(__a).deallocate(reinterpret_cast&lt;char*&gt;(this), __size);
-<span class="lineNum">     425 </span>                :     }
-<span class="lineNum">     426 </span>                : 
-<span class="lineNum">     427 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     428 </span>                :     void
-<span class="lineNum">     429 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     430 </span>                :     _M_leak_hard()
-<span class="lineNum">     431 </span>                :     {
-<span class="lineNum">     432 </span>                : #ifndef _GLIBCXX_FULLY_DYNAMIC_STRING
-<span class="lineNum">     433 </span>                :       if (_M_rep() == &amp;_S_empty_rep())
-<span class="lineNum">     434 </span>                :         return;
-<span class="lineNum">     435 </span>                : #endif
-<span class="lineNum">     436 </span>                :       if (_M_rep()-&gt;_M_is_shared())
-<span class="lineNum">     437 </span>                :         _M_mutate(0, 0, 0);
-<span class="lineNum">     438 </span>                :       _M_rep()-&gt;_M_set_leaked();
-<span class="lineNum">     439 </span>                :     }
-<span class="lineNum">     440 </span>                : 
-<span class="lineNum">     441 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     442 </span>                :     void
-<span class="lineNum">     443 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     444 </span>                :     _M_mutate(size_type __pos, size_type __len1, size_type __len2)
-<span class="lineNum">     445 </span>                :     {
-<span class="lineNum">     446 </span>                :       const size_type __old_size = this-&gt;size();
-<span class="lineNum">     447 </span>                :       const size_type __new_size = __old_size + __len2 - __len1;
-<span class="lineNum">     448 </span>                :       const size_type __how_much = __old_size - __pos - __len1;
-<span class="lineNum">     449 </span>                : 
-<span class="lineNum">     450 </span>                :       if (__new_size &gt; this-&gt;capacity() || _M_rep()-&gt;_M_is_shared())
-<span class="lineNum">     451 </span>                :         {
-<span class="lineNum">     452 </span>                :           // Must reallocate.
-<span class="lineNum">     453 </span>                :           const allocator_type __a = get_allocator();
-<span class="lineNum">     454 </span>                :           _Rep* __r = _Rep::_S_create(__new_size, this-&gt;capacity(), __a);
-<span class="lineNum">     455 </span>                : 
-<span class="lineNum">     456 </span>                :           if (__pos)
-<span class="lineNum">     457 </span>                :             _M_copy(__r-&gt;_M_refdata(), _M_data(), __pos);
-<span class="lineNum">     458 </span>                :           if (__how_much)
-<span class="lineNum">     459 </span>                :             _M_copy(__r-&gt;_M_refdata() + __pos + __len2,
-<span class="lineNum">     460 </span>                :                     _M_data() + __pos + __len1, __how_much);
-<span class="lineNum">     461 </span>                : 
-<span class="lineNum">     462 </span>                :           _M_rep()-&gt;_M_dispose(__a);
-<span class="lineNum">     463 </span>                :           _M_data(__r-&gt;_M_refdata());
-<span class="lineNum">     464 </span>                :         }
-<span class="lineNum">     465 </span>                :       else if (__how_much &amp;&amp; __len1 != __len2)
-<span class="lineNum">     466 </span>                :         {
-<span class="lineNum">     467 </span>                :           // Work in-place.
-<span class="lineNum">     468 </span>                :           _M_move(_M_data() + __pos + __len2,
-<span class="lineNum">     469 </span>                :                   _M_data() + __pos + __len1, __how_much);
-<span class="lineNum">     470 </span>                :         }
-<span class="lineNum">     471 </span>                :       _M_rep()-&gt;_M_set_length_and_sharable(__new_size);
-<span class="lineNum">     472 </span>                :     }
-<span class="lineNum">     473 </span>                : 
-<span class="lineNum">     474 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     475 </span>                :     void
-<span class="lineNum">     476 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     477 </span>                :     reserve(size_type __res)
-<span class="lineNum">     478 </span>                :     {
-<span class="lineNum">     479 </span>                :       if (__res != this-&gt;capacity() || _M_rep()-&gt;_M_is_shared())
-<span class="lineNum">     480 </span>                :         {
-<span class="lineNum">     481 </span>                :           // Make sure we don't shrink below the current size
-<span class="lineNum">     482 </span>                :           if (__res &lt; this-&gt;size())
-<span class="lineNum">     483 </span>                :             __res = this-&gt;size();
-<span class="lineNum">     484 </span>                :           const allocator_type __a = get_allocator();
-<span class="lineNum">     485 </span>                :           _CharT* __tmp = _M_rep()-&gt;_M_clone(__a, __res - this-&gt;size());
-<span class="lineNum">     486 </span>                :           _M_rep()-&gt;_M_dispose(__a);
-<span class="lineNum">     487 </span>                :           _M_data(__tmp);
-<span class="lineNum">     488 </span>                :         }
-<span class="lineNum">     489 </span>                :     }
-<span class="lineNum">     490 </span>                : 
-<span class="lineNum">     491 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     492 </span>                :     void
-<span class="lineNum">     493 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     494 </span>                :     swap(basic_string&amp; __s)
-<span class="lineNum">     495 </span>                :     {
-<span class="lineNum">     496 </span>                :       if (_M_rep()-&gt;_M_is_leaked())
-<span class="lineNum">     497 </span>                :         _M_rep()-&gt;_M_set_sharable();
-<span class="lineNum">     498 </span>                :       if (__s._M_rep()-&gt;_M_is_leaked())
-<span class="lineNum">     499 </span>                :         __s._M_rep()-&gt;_M_set_sharable();
-<span class="lineNum">     500 </span>                :       if (this-&gt;get_allocator() == __s.get_allocator())
-<span class="lineNum">     501 </span>                :         {
-<span class="lineNum">     502 </span>                :           _CharT* __tmp = _M_data();
-<span class="lineNum">     503 </span>                :           _M_data(__s._M_data());
-<span class="lineNum">     504 </span>                :           __s._M_data(__tmp);
-<span class="lineNum">     505 </span>                :         }
-<span class="lineNum">     506 </span>                :       // The code below can usually be optimized away.
-<span class="lineNum">     507 </span>                :       else
-<span class="lineNum">     508 </span>                :         {
-<span class="lineNum">     509 </span>                :           const basic_string __tmp1(_M_ibegin(), _M_iend(),
-<span class="lineNum">     510 </span>                :                                     __s.get_allocator());
-<span class="lineNum">     511 </span>                :           const basic_string __tmp2(__s._M_ibegin(), __s._M_iend(),
-<span class="lineNum">     512 </span>                :                                     this-&gt;get_allocator());
-<span class="lineNum">     513 </span>                :           *this = __tmp2;
-<span class="lineNum">     514 </span>                :           __s = __tmp1;
-<span class="lineNum">     515 </span>                :         }
-<span class="lineNum">     516 </span>                :     }
-<span class="lineNum">     517 </span>                : 
-<span class="lineNum">     518 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     519 </span>                :     typename basic_string&lt;_CharT, _Traits, _Alloc&gt;::_Rep*
-<span class="lineNum">     520 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::_Rep::
-<span class="lineNum">     521 </span>                :     _S_create(size_type __capacity, size_type __old_capacity,
-<span class="lineNum">     522 </span>                :               const _Alloc&amp; __alloc)
-<span class="lineNum">     523 </span>                :     {
-<span class="lineNum">     524 </span>                :       // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     525 </span>                :       // 83.  String::npos vs. string::max_size()
-<span class="lineNum">     526 </span>                :       if (__capacity &gt; _S_max_size)
-<span class="lineNum">     527 </span>                :         __throw_length_error(__N(&quot;basic_string::_S_create&quot;));
-<span class="lineNum">     528 </span>                : 
-<span class="lineNum">     529 </span>                :       // The standard places no restriction on allocating more memory
-<span class="lineNum">     530 </span>                :       // than is strictly needed within this layer at the moment or as
-<span class="lineNum">     531 </span>                :       // requested by an explicit application call to reserve().
-<span class="lineNum">     532 </span>                : 
-<span class="lineNum">     533 </span>                :       // Many malloc implementations perform quite poorly when an
-<span class="lineNum">     534 </span>                :       // application attempts to allocate memory in a stepwise fashion
-<span class="lineNum">     535 </span>                :       // growing each allocation size by only 1 char.  Additionally,
-<span class="lineNum">     536 </span>                :       // it makes little sense to allocate less linear memory than the
-<span class="lineNum">     537 </span>                :       // natural blocking size of the malloc implementation.
-<span class="lineNum">     538 </span>                :       // Unfortunately, we would need a somewhat low-level calculation
-<span class="lineNum">     539 </span>                :       // with tuned parameters to get this perfect for any particular
-<span class="lineNum">     540 </span>                :       // malloc implementation.  Fortunately, generalizations about
-<span class="lineNum">     541 </span>                :       // common features seen among implementations seems to suffice.
-<span class="lineNum">     542 </span>                : 
-<span class="lineNum">     543 </span>                :       // __pagesize need not match the actual VM page size for good
-<span class="lineNum">     544 </span>                :       // results in practice, thus we pick a common value on the low
-<span class="lineNum">     545 </span>                :       // side.  __malloc_header_size is an estimate of the amount of
-<span class="lineNum">     546 </span>                :       // overhead per memory allocation (in practice seen N * sizeof
-<span class="lineNum">     547 </span>                :       // (void*) where N is 0, 2 or 4).  According to folklore,
-<span class="lineNum">     548 </span>                :       // picking this value on the high side is better than
-<span class="lineNum">     549 </span>                :       // low-balling it (especially when this algorithm is used with
-<span class="lineNum">     550 </span>                :       // malloc implementations that allocate memory blocks rounded up
-<span class="lineNum">     551 </span>                :       // to a size which is a power of 2).
-<span class="lineNum">     552 </span>                :       const size_type __pagesize = 4096;
-<span class="lineNum">     553 </span>                :       const size_type __malloc_header_size = 4 * sizeof(void*);
-<span class="lineNum">     554 </span>                : 
-<span class="lineNum">     555 </span>                :       // The below implements an exponential growth policy, necessary to
-<span class="lineNum">     556 </span>                :       // meet amortized linear time requirements of the library: see
-<span class="lineNum">     557 </span>                :       // http://gcc.gnu.org/ml/libstdc++/2001-07/msg00085.html.
-<span class="lineNum">     558 </span>                :       // It's active for allocations requiring an amount of memory above
-<span class="lineNum">     559 </span>                :       // system pagesize. This is consistent with the requirements of the
-<span class="lineNum">     560 </span>                :       // standard: http://gcc.gnu.org/ml/libstdc++/2001-07/msg00130.html
-<span class="lineNum">     561 </span>                :       if (__capacity &gt; __old_capacity &amp;&amp; __capacity &lt; 2 * __old_capacity)
-<span class="lineNum">     562 </span>                :         __capacity = 2 * __old_capacity;
-<span class="lineNum">     563 </span>                : 
-<span class="lineNum">     564 </span>                :       // NB: Need an array of char_type[__capacity], plus a terminating
-<span class="lineNum">     565 </span>                :       // null char_type() element, plus enough for the _Rep data structure.
-<span class="lineNum">     566 </span>                :       // Whew. Seemingly so needy, yet so elemental.
-<span class="lineNum">     567 </span>                :       size_type __size = (__capacity + 1) * sizeof(_CharT) + sizeof(_Rep);
-<span class="lineNum">     568 </span>                : 
-<span class="lineNum">     569 </span>                :       const size_type __adj_size = __size + __malloc_header_size;
-<span class="lineNum">     570 </span>                :       if (__adj_size &gt; __pagesize &amp;&amp; __capacity &gt; __old_capacity)
-<span class="lineNum">     571 </span>                :         {
-<span class="lineNum">     572 </span>                :           const size_type __extra = __pagesize - __adj_size % __pagesize;
-<span class="lineNum">     573 </span>                :           __capacity += __extra / sizeof(_CharT);
-<span class="lineNum">     574 </span>                :           // Never allocate a string bigger than _S_max_size.
-<span class="lineNum">     575 </span>                :           if (__capacity &gt; _S_max_size)
-<span class="lineNum">     576 </span>                :             __capacity = _S_max_size;
-<span class="lineNum">     577 </span>                :           __size = (__capacity + 1) * sizeof(_CharT) + sizeof(_Rep);
-<span class="lineNum">     578 </span>                :         }
-<span class="lineNum">     579 </span>                : 
-<span class="lineNum">     580 </span>                :       // NB: Might throw, but no worries about a leak, mate: _Rep()
-<span class="lineNum">     581 </span>                :       // does not throw.
-<span class="lineNum">     582 </span>                :       void* __place = _Raw_bytes_alloc(__alloc).allocate(__size);
-<span class="lineNum">     583 </span>                :       _Rep *__p = new (__place) _Rep;
-<span class="lineNum">     584 </span>                :       __p-&gt;_M_capacity = __capacity;
-<span class="lineNum">     585 </span>                :       // ABI compatibility - 3.4.x set in _S_create both
-<span class="lineNum">     586 </span>                :       // _M_refcount and _M_length.  All callers of _S_create
-<span class="lineNum">     587 </span>                :       // in basic_string.tcc then set just _M_length.
-<span class="lineNum">     588 </span>                :       // In 4.0.x and later both _M_refcount and _M_length
-<span class="lineNum">     589 </span>                :       // are initialized in the callers, unfortunately we can
-<span class="lineNum">     590 </span>                :       // have 3.4.x compiled code with _S_create callers inlined
-<span class="lineNum">     591 </span>                :       // calling 4.0.x+ _S_create.
-<span class="lineNum">     592 </span>                :       __p-&gt;_M_set_sharable();
-<span class="lineNum">     593 </span>                :       return __p;
-<span class="lineNum">     594 </span>                :     }
-<span class="lineNum">     595 </span>                : 
-<span class="lineNum">     596 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     597 </span>                :     _CharT*
-<span class="lineNum">     598 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::_Rep::
-<span class="lineNum">     599 </span>                :     _M_clone(const _Alloc&amp; __alloc, size_type __res)
-<span class="lineNum">     600 </span>                :     {
-<span class="lineNum">     601 </span>                :       // Requested capacity of the clone.
-<span class="lineNum">     602 </span>                :       const size_type __requested_cap = this-&gt;_M_length + __res;
-<span class="lineNum">     603 </span>                :       _Rep* __r = _Rep::_S_create(__requested_cap, this-&gt;_M_capacity,
-<span class="lineNum">     604 </span>                :                                   __alloc);
-<span class="lineNum">     605 </span>                :       if (this-&gt;_M_length)
-<span class="lineNum">     606 </span>                :         _M_copy(__r-&gt;_M_refdata(), _M_refdata(), this-&gt;_M_length);
-<span class="lineNum">     607 </span>                : 
-<span class="lineNum">     608 </span>                :       __r-&gt;_M_set_length_and_sharable(this-&gt;_M_length);
-<span class="lineNum">     609 </span>                :       return __r-&gt;_M_refdata();
-<span class="lineNum">     610 </span>                :     }
-<span class="lineNum">     611 </span>                : 
-<span class="lineNum">     612 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     613 </span>                :     void
-<span class="lineNum">     614 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     615 </span>                :     resize(size_type __n, _CharT __c)
-<span class="lineNum">     616 </span>                :     {
-<span class="lineNum">     617 </span>                :       const size_type __size = this-&gt;size();
-<span class="lineNum">     618 </span>                :       _M_check_length(__size, __n, &quot;basic_string::resize&quot;);
-<span class="lineNum">     619 </span>                :       if (__size &lt; __n)
-<span class="lineNum">     620 </span>                :         this-&gt;append(__n - __size, __c);
-<span class="lineNum">     621 </span>                :       else if (__n &lt; __size)
-<span class="lineNum">     622 </span>                :         this-&gt;erase(__n);
-<span class="lineNum">     623 </span>                :       // else nothing (in particular, avoid calling _M_mutate() unnecessarily.)
-<span class="lineNum">     624 </span>                :     }
-<span class="lineNum">     625 </span>                : 
-<span class="lineNum">     626 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     627 </span>                :     template&lt;typename _InputIterator&gt;
-<span class="lineNum">     628 </span>                :       basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp;
-<span class="lineNum">     629 </span>                :       basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     630 </span>                :       _M_replace_dispatch(iterator __i1, iterator __i2, _InputIterator __k1,
-<span class="lineNum">     631 </span>                :                           _InputIterator __k2, __false_type)
-<span class="lineNum">     632 </span>                :       {
-<span class="lineNum">     633 </span>                :         const basic_string __s(__k1, __k2);
-<span class="lineNum">     634 </span>                :         const size_type __n1 = __i2 - __i1;
-<span class="lineNum">     635 </span>                :         _M_check_length(__n1, __s.size(), &quot;basic_string::_M_replace_dispatch&quot;);
-<span class="lineNum">     636 </span>                :         return _M_replace_safe(__i1 - _M_ibegin(), __n1, __s._M_data(),
-<span class="lineNum">     637 </span>                :                                __s.size());
-<span class="lineNum">     638 </span>                :       }
-<span class="lineNum">     639 </span>                : 
-<span class="lineNum">     640 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     641 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp;
-<span class="lineNum">     642 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     643 </span>                :     _M_replace_aux(size_type __pos1, size_type __n1, size_type __n2,
-<span class="lineNum">     644 </span>                :                    _CharT __c)
-<span class="lineNum">     645 </span>                :     {
-<span class="lineNum">     646 </span>                :       _M_check_length(__n1, __n2, &quot;basic_string::_M_replace_aux&quot;);
-<span class="lineNum">     647 </span>                :       _M_mutate(__pos1, __n1, __n2);
-<span class="lineNum">     648 </span>                :       if (__n2)
-<span class="lineNum">     649 </span>                :         _M_assign(_M_data() + __pos1, __n2, __c);
-<span class="lineNum">     650 </span>                :       return *this;
-<span class="lineNum">     651 </span>                :     }
-<span class="lineNum">     652 </span>                : 
-<span class="lineNum">     653 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     654 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp;
-<span class="lineNum">     655 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     656 </span>                :     _M_replace_safe(size_type __pos1, size_type __n1, const _CharT* __s,
-<span class="lineNum">     657 </span>                :                     size_type __n2)
-<span class="lineNum">     658 </span>                :     {
-<span class="lineNum">     659 </span>                :       _M_mutate(__pos1, __n1, __n2);
-<span class="lineNum">     660 </span>                :       if (__n2)
-<span class="lineNum">     661 </span>                :         _M_copy(_M_data() + __pos1, __s, __n2);
-<span class="lineNum">     662 </span>                :       return *this;
-<span class="lineNum">     663 </span>                :     }
-<span class="lineNum">     664 </span>                :    
-<span class="lineNum">     665 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     666 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;
-<span class="lineNum">     667 </span>                :     operator+(const _CharT* __lhs,
-<span class="lineNum">     668 </span><span class="lineCov">           2633 :               const basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp; __rhs)</span>
-<span class="lineNum">     669 </span>                :     {
-<span class="lineNum">     670 </span>                :       __glibcxx_requires_string(__lhs);
-<span class="lineNum">     671 </span>                :       typedef basic_string&lt;_CharT, _Traits, _Alloc&gt; __string_type;
-<span class="lineNum">     672 </span>                :       typedef typename __string_type::size_type   __size_type;
-<span class="lineNum">     673 </span><span class="lineCov">           2633 :       const __size_type __len = _Traits::length(__lhs);</span>
-<span class="lineNum">     674 </span><span class="lineCov">           2633 :       __string_type __str;</span>
-<span class="lineNum">     675 </span><span class="lineCov">           2633 :       __str.reserve(__len + __rhs.size());</span>
-<span class="lineNum">     676 </span><span class="lineCov">           2633 :       __str.append(__lhs, __len);</span>
-<span class="lineNum">     677 </span><span class="lineCov">           2633 :       __str.append(__rhs);</span>
-<span class="lineNum">     678 </span><span class="lineNoCov">              0 :       return __str;</span>
-<span class="lineNum">     679 </span>                :     }
-<span class="lineNum">     680 </span>                : 
-<span class="lineNum">     681 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     682 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;
-<span class="lineNum">     683 </span>                :     operator+(_CharT __lhs, const basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp; __rhs)
-<span class="lineNum">     684 </span>                :     {
-<span class="lineNum">     685 </span>                :       typedef basic_string&lt;_CharT, _Traits, _Alloc&gt; __string_type;
-<span class="lineNum">     686 </span>                :       typedef typename __string_type::size_type   __size_type;
-<span class="lineNum">     687 </span>                :       __string_type __str;
-<span class="lineNum">     688 </span>                :       const __size_type __len = __rhs.size();
-<span class="lineNum">     689 </span>                :       __str.reserve(__len + 1);
-<span class="lineNum">     690 </span>                :       __str.append(__size_type(1), __lhs);
-<span class="lineNum">     691 </span>                :       __str.append(__rhs);
-<span class="lineNum">     692 </span>                :       return __str;
-<span class="lineNum">     693 </span>                :     }
-<span class="lineNum">     694 </span>                : 
-<span class="lineNum">     695 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     696 </span>                :     typename basic_string&lt;_CharT, _Traits, _Alloc&gt;::size_type
-<span class="lineNum">     697 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     698 </span>                :     copy(_CharT* __s, size_type __n, size_type __pos) const
-<span class="lineNum">     699 </span>                :     {
-<span class="lineNum">     700 </span>                :       _M_check(__pos, &quot;basic_string::copy&quot;);
-<span class="lineNum">     701 </span>                :       __n = _M_limit(__pos, __n);
-<span class="lineNum">     702 </span>                :       __glibcxx_requires_string_len(__s, __n);
-<span class="lineNum">     703 </span>                :       if (__n)
-<span class="lineNum">     704 </span>                :         _M_copy(__s, _M_data() + __pos, __n);
-<span class="lineNum">     705 </span>                :       // 21.3.5.7 par 3: do not append null.  (good.)
-<span class="lineNum">     706 </span>                :       return __n;
-<span class="lineNum">     707 </span>                :     }
-<span class="lineNum">     708 </span>                : 
-<span class="lineNum">     709 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     710 </span>                :     typename basic_string&lt;_CharT, _Traits, _Alloc&gt;::size_type
-<span class="lineNum">     711 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     712 </span>                :     find(const _CharT* __s, size_type __pos, size_type __n) const
-<span class="lineNum">     713 </span>                :     {
-<span class="lineNum">     714 </span>                :       __glibcxx_requires_string_len(__s, __n);
-<span class="lineNum">     715 </span>                :       const size_type __size = this-&gt;size();
-<span class="lineNum">     716 </span>                :       const _CharT* __data = _M_data();
-<span class="lineNum">     717 </span>                : 
-<span class="lineNum">     718 </span>                :       if (__n == 0)
-<span class="lineNum">     719 </span>                :         return __pos &lt;= __size ? __pos : npos;
-<span class="lineNum">     720 </span>                : 
-<span class="lineNum">     721 </span>                :       if (__n &lt;= __size)
-<span class="lineNum">     722 </span>                :         {
-<span class="lineNum">     723 </span>                :           for (; __pos &lt;= __size - __n; ++__pos)
-<span class="lineNum">     724 </span>                :             if (traits_type::eq(__data[__pos], __s[0])
-<span class="lineNum">     725 </span>                :                 &amp;&amp; traits_type::compare(__data + __pos + 1,
-<span class="lineNum">     726 </span>                :                                         __s + 1, __n - 1) == 0)
-<span class="lineNum">     727 </span>                :               return __pos;
-<span class="lineNum">     728 </span>                :         }
-<span class="lineNum">     729 </span>                :       return npos;
-<span class="lineNum">     730 </span>                :     }
-<span class="lineNum">     731 </span>                : 
-<span class="lineNum">     732 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     733 </span>                :     typename basic_string&lt;_CharT, _Traits, _Alloc&gt;::size_type
-<span class="lineNum">     734 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     735 </span>                :     find(_CharT __c, size_type __pos) const
-<span class="lineNum">     736 </span>                :     {
-<span class="lineNum">     737 </span>                :       size_type __ret = npos;
-<span class="lineNum">     738 </span>                :       const size_type __size = this-&gt;size();
-<span class="lineNum">     739 </span>                :       if (__pos &lt; __size)
-<span class="lineNum">     740 </span>                :         {
-<span class="lineNum">     741 </span>                :           const _CharT* __data = _M_data();
-<span class="lineNum">     742 </span>                :           const size_type __n = __size - __pos;
-<span class="lineNum">     743 </span>                :           const _CharT* __p = traits_type::find(__data + __pos, __n, __c);
-<span class="lineNum">     744 </span>                :           if (__p)
-<span class="lineNum">     745 </span>                :             __ret = __p - __data;
-<span class="lineNum">     746 </span>                :         }
-<span class="lineNum">     747 </span>                :       return __ret;
-<span class="lineNum">     748 </span>                :     }
-<span class="lineNum">     749 </span>                : 
-<span class="lineNum">     750 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     751 </span>                :     typename basic_string&lt;_CharT, _Traits, _Alloc&gt;::size_type
-<span class="lineNum">     752 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     753 </span>                :     rfind(const _CharT* __s, size_type __pos, size_type __n) const
-<span class="lineNum">     754 </span>                :     {
-<span class="lineNum">     755 </span>                :       __glibcxx_requires_string_len(__s, __n);
-<span class="lineNum">     756 </span>                :       const size_type __size = this-&gt;size();
-<span class="lineNum">     757 </span>                :       if (__n &lt;= __size)
-<span class="lineNum">     758 </span>                :         {
-<span class="lineNum">     759 </span>                :           __pos = std::min(size_type(__size - __n), __pos);
-<span class="lineNum">     760 </span>                :           const _CharT* __data = _M_data();
-<span class="lineNum">     761 </span>                :           do
-<span class="lineNum">     762 </span>                :             {
-<span class="lineNum">     763 </span>                :               if (traits_type::compare(__data + __pos, __s, __n) == 0)
-<span class="lineNum">     764 </span>                :                 return __pos;
-<span class="lineNum">     765 </span>                :             }
-<span class="lineNum">     766 </span>                :           while (__pos-- &gt; 0);
-<span class="lineNum">     767 </span>                :         }
-<span class="lineNum">     768 </span>                :       return npos;
-<span class="lineNum">     769 </span>                :     }
-<span class="lineNum">     770 </span>                : 
-<span class="lineNum">     771 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     772 </span>                :     typename basic_string&lt;_CharT, _Traits, _Alloc&gt;::size_type
-<span class="lineNum">     773 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     774 </span>                :     rfind(_CharT __c, size_type __pos) const
-<span class="lineNum">     775 </span>                :     {
-<span class="lineNum">     776 </span>                :       size_type __size = this-&gt;size();
-<span class="lineNum">     777 </span>                :       if (__size)
-<span class="lineNum">     778 </span>                :         {
-<span class="lineNum">     779 </span>                :           if (--__size &gt; __pos)
-<span class="lineNum">     780 </span>                :             __size = __pos;
-<span class="lineNum">     781 </span>                :           for (++__size; __size-- &gt; 0; )
-<span class="lineNum">     782 </span>                :             if (traits_type::eq(_M_data()[__size], __c))
-<span class="lineNum">     783 </span>                :               return __size;
-<span class="lineNum">     784 </span>                :         }
-<span class="lineNum">     785 </span>                :       return npos;
-<span class="lineNum">     786 </span>                :     }
-<span class="lineNum">     787 </span>                : 
-<span class="lineNum">     788 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     789 </span>                :     typename basic_string&lt;_CharT, _Traits, _Alloc&gt;::size_type
-<span class="lineNum">     790 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     791 </span>                :     find_first_of(const _CharT* __s, size_type __pos, size_type __n) const
-<span class="lineNum">     792 </span>                :     {
-<span class="lineNum">     793 </span>                :       __glibcxx_requires_string_len(__s, __n);
-<span class="lineNum">     794 </span>                :       for (; __n &amp;&amp; __pos &lt; this-&gt;size(); ++__pos)
-<span class="lineNum">     795 </span>                :         {
-<span class="lineNum">     796 </span>                :           const _CharT* __p = traits_type::find(__s, __n, _M_data()[__pos]);
-<span class="lineNum">     797 </span>                :           if (__p)
-<span class="lineNum">     798 </span>                :             return __pos;
-<span class="lineNum">     799 </span>                :         }
-<span class="lineNum">     800 </span>                :       return npos;
-<span class="lineNum">     801 </span>                :     }
-<span class="lineNum">     802 </span>                : 
-<span class="lineNum">     803 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     804 </span>                :     typename basic_string&lt;_CharT, _Traits, _Alloc&gt;::size_type
-<span class="lineNum">     805 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     806 </span>                :     find_last_of(const _CharT* __s, size_type __pos, size_type __n) const
-<span class="lineNum">     807 </span>                :     {
-<span class="lineNum">     808 </span>                :       __glibcxx_requires_string_len(__s, __n);
-<span class="lineNum">     809 </span>                :       size_type __size = this-&gt;size();
-<span class="lineNum">     810 </span>                :       if (__size &amp;&amp; __n)
-<span class="lineNum">     811 </span>                :         {
-<span class="lineNum">     812 </span>                :           if (--__size &gt; __pos)
-<span class="lineNum">     813 </span>                :             __size = __pos;
-<span class="lineNum">     814 </span>                :           do
-<span class="lineNum">     815 </span>                :             {
-<span class="lineNum">     816 </span>                :               if (traits_type::find(__s, __n, _M_data()[__size]))
-<span class="lineNum">     817 </span>                :                 return __size;
-<span class="lineNum">     818 </span>                :             }
-<span class="lineNum">     819 </span>                :           while (__size-- != 0);
-<span class="lineNum">     820 </span>                :         }
-<span class="lineNum">     821 </span>                :       return npos;
-<span class="lineNum">     822 </span>                :     }
-<span class="lineNum">     823 </span>                : 
-<span class="lineNum">     824 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     825 </span>                :     typename basic_string&lt;_CharT, _Traits, _Alloc&gt;::size_type
-<span class="lineNum">     826 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     827 </span>                :     find_first_not_of(const _CharT* __s, size_type __pos, size_type __n) const
-<span class="lineNum">     828 </span>                :     {
-<span class="lineNum">     829 </span>                :       __glibcxx_requires_string_len(__s, __n);
-<span class="lineNum">     830 </span>                :       for (; __pos &lt; this-&gt;size(); ++__pos)
-<span class="lineNum">     831 </span>                :         if (!traits_type::find(__s, __n, _M_data()[__pos]))
-<span class="lineNum">     832 </span>                :           return __pos;
-<span class="lineNum">     833 </span>                :       return npos;
-<span class="lineNum">     834 </span>                :     }
-<span class="lineNum">     835 </span>                : 
-<span class="lineNum">     836 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     837 </span>                :     typename basic_string&lt;_CharT, _Traits, _Alloc&gt;::size_type
-<span class="lineNum">     838 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     839 </span>                :     find_first_not_of(_CharT __c, size_type __pos) const
-<span class="lineNum">     840 </span>                :     {
-<span class="lineNum">     841 </span>                :       for (; __pos &lt; this-&gt;size(); ++__pos)
-<span class="lineNum">     842 </span>                :         if (!traits_type::eq(_M_data()[__pos], __c))
-<span class="lineNum">     843 </span>                :           return __pos;
-<span class="lineNum">     844 </span>                :       return npos;
-<span class="lineNum">     845 </span>                :     }
-<span class="lineNum">     846 </span>                : 
-<span class="lineNum">     847 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     848 </span>                :     typename basic_string&lt;_CharT, _Traits, _Alloc&gt;::size_type
-<span class="lineNum">     849 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     850 </span>                :     find_last_not_of(const _CharT* __s, size_type __pos, size_type __n) const
-<span class="lineNum">     851 </span>                :     {
-<span class="lineNum">     852 </span>                :       __glibcxx_requires_string_len(__s, __n);
-<span class="lineNum">     853 </span>                :       size_type __size = this-&gt;size();
-<span class="lineNum">     854 </span>                :       if (__size)
-<span class="lineNum">     855 </span>                :         {
-<span class="lineNum">     856 </span>                :           if (--__size &gt; __pos)
-<span class="lineNum">     857 </span>                :             __size = __pos;
-<span class="lineNum">     858 </span>                :           do
-<span class="lineNum">     859 </span>                :             {
-<span class="lineNum">     860 </span>                :               if (!traits_type::find(__s, __n, _M_data()[__size]))
-<span class="lineNum">     861 </span>                :                 return __size;
-<span class="lineNum">     862 </span>                :             }
-<span class="lineNum">     863 </span>                :           while (__size--);
-<span class="lineNum">     864 </span>                :         }
-<span class="lineNum">     865 </span>                :       return npos;
-<span class="lineNum">     866 </span>                :     }
-<span class="lineNum">     867 </span>                : 
-<span class="lineNum">     868 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     869 </span>                :     typename basic_string&lt;_CharT, _Traits, _Alloc&gt;::size_type
-<span class="lineNum">     870 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     871 </span>                :     find_last_not_of(_CharT __c, size_type __pos) const
-<span class="lineNum">     872 </span>                :     {
-<span class="lineNum">     873 </span>                :       size_type __size = this-&gt;size();
-<span class="lineNum">     874 </span>                :       if (__size)
-<span class="lineNum">     875 </span>                :         {
-<span class="lineNum">     876 </span>                :           if (--__size &gt; __pos)
-<span class="lineNum">     877 </span>                :             __size = __pos;
-<span class="lineNum">     878 </span>                :           do
-<span class="lineNum">     879 </span>                :             {
-<span class="lineNum">     880 </span>                :               if (!traits_type::eq(_M_data()[__size], __c))
-<span class="lineNum">     881 </span>                :                 return __size;
-<span class="lineNum">     882 </span>                :             }
-<span class="lineNum">     883 </span>                :           while (__size--);
-<span class="lineNum">     884 </span>                :         }
-<span class="lineNum">     885 </span>                :       return npos;
-<span class="lineNum">     886 </span>                :     }
-<span class="lineNum">     887 </span>                : 
-<span class="lineNum">     888 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     889 </span>                :     int
-<span class="lineNum">     890 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     891 </span>                :     compare(size_type __pos, size_type __n, const basic_string&amp; __str) const
-<span class="lineNum">     892 </span>                :     {
-<span class="lineNum">     893 </span>                :       _M_check(__pos, &quot;basic_string::compare&quot;);
-<span class="lineNum">     894 </span>                :       __n = _M_limit(__pos, __n);
-<span class="lineNum">     895 </span>                :       const size_type __osize = __str.size();
-<span class="lineNum">     896 </span>                :       const size_type __len = std::min(__n, __osize);
-<span class="lineNum">     897 </span>                :       int __r = traits_type::compare(_M_data() + __pos, __str.data(), __len);
-<span class="lineNum">     898 </span>                :       if (!__r)
-<span class="lineNum">     899 </span>                :         __r = _S_compare(__n, __osize);
-<span class="lineNum">     900 </span>                :       return __r;
-<span class="lineNum">     901 </span>                :     }
-<span class="lineNum">     902 </span>                : 
-<span class="lineNum">     903 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     904 </span>                :     int
-<span class="lineNum">     905 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     906 </span>                :     compare(size_type __pos1, size_type __n1, const basic_string&amp; __str,
-<span class="lineNum">     907 </span>                :             size_type __pos2, size_type __n2) const
-<span class="lineNum">     908 </span>                :     {
-<span class="lineNum">     909 </span>                :       _M_check(__pos1, &quot;basic_string::compare&quot;);
-<span class="lineNum">     910 </span>                :       __str._M_check(__pos2, &quot;basic_string::compare&quot;);
-<span class="lineNum">     911 </span>                :       __n1 = _M_limit(__pos1, __n1);
-<span class="lineNum">     912 </span>                :       __n2 = __str._M_limit(__pos2, __n2);
-<span class="lineNum">     913 </span>                :       const size_type __len = std::min(__n1, __n2);
-<span class="lineNum">     914 </span>                :       int __r = traits_type::compare(_M_data() + __pos1,
-<span class="lineNum">     915 </span>                :                                      __str.data() + __pos2, __len);
-<span class="lineNum">     916 </span>                :       if (!__r)
-<span class="lineNum">     917 </span>                :         __r = _S_compare(__n1, __n2);
-<span class="lineNum">     918 </span>                :       return __r;
-<span class="lineNum">     919 </span>                :     }
-<span class="lineNum">     920 </span>                : 
-<span class="lineNum">     921 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     922 </span>                :     int
-<span class="lineNum">     923 </span>                :     basic_string&lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     924 </span>                :     compare(const _CharT* __s) const
-<span class="lineNum">     925 </span>                :     {
-<span class="lineNum">     926 </span>                :       __glibcxx_requires_string(__s);
-<span class="lineNum">     927 </span>                :       const size_type __size = this-&gt;size();
-<span class="lineNum">     928 </span>                :       const size_type __osize = traits_type::length(__s);
-<span class="lineNum">     929 </span>                :       const size_type __len = std::min(__size, __osize);
-<span class="lineNum">     930 </span>                :       int __r = traits_type::compare(_M_data(), __s, __len);
-<span class="lineNum">     931 </span>                :       if (!__r)
-<span class="lineNum">     932 </span>                :         __r = _S_compare(__size, __osize);
-<span class="lineNum">     933 </span>                :       return __r;
-<span class="lineNum">     934 </span>                :     }
-<span class="lineNum">     935 </span>                : 
-<span class="lineNum">     936 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     937 </span>                :     int
-<span class="lineNum">     938 </span>                :     basic_string &lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     939 </span>                :     compare(size_type __pos, size_type __n1, const _CharT* __s) const
-<span class="lineNum">     940 </span>                :     {
-<span class="lineNum">     941 </span>                :       __glibcxx_requires_string(__s);
-<span class="lineNum">     942 </span>                :       _M_check(__pos, &quot;basic_string::compare&quot;);
-<span class="lineNum">     943 </span>                :       __n1 = _M_limit(__pos, __n1);
-<span class="lineNum">     944 </span>                :       const size_type __osize = traits_type::length(__s);
-<span class="lineNum">     945 </span>                :       const size_type __len = std::min(__n1, __osize);
-<span class="lineNum">     946 </span>                :       int __r = traits_type::compare(_M_data() + __pos, __s, __len);
-<span class="lineNum">     947 </span>                :       if (!__r)
-<span class="lineNum">     948 </span>                :         __r = _S_compare(__n1, __osize);
-<span class="lineNum">     949 </span>                :       return __r;
-<span class="lineNum">     950 </span>                :     }
-<span class="lineNum">     951 </span>                : 
-<span class="lineNum">     952 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     953 </span>                :     int
-<span class="lineNum">     954 </span>                :     basic_string &lt;_CharT, _Traits, _Alloc&gt;::
-<span class="lineNum">     955 </span>                :     compare(size_type __pos, size_type __n1, const _CharT* __s,
-<span class="lineNum">     956 </span>                :             size_type __n2) const
-<span class="lineNum">     957 </span>                :     {
-<span class="lineNum">     958 </span>                :       __glibcxx_requires_string_len(__s, __n2);
-<span class="lineNum">     959 </span>                :       _M_check(__pos, &quot;basic_string::compare&quot;);
-<span class="lineNum">     960 </span>                :       __n1 = _M_limit(__pos, __n1);
-<span class="lineNum">     961 </span>                :       const size_type __len = std::min(__n1, __n2);
-<span class="lineNum">     962 </span>                :       int __r = traits_type::compare(_M_data() + __pos, __s, __len);
-<span class="lineNum">     963 </span>                :       if (!__r)
-<span class="lineNum">     964 </span>                :         __r = _S_compare(__n1, __n2);
-<span class="lineNum">     965 </span>                :       return __r;
-<span class="lineNum">     966 </span>                :     }
-<span class="lineNum">     967 </span>                : 
-<span class="lineNum">     968 </span>                :   // 21.3.7.9 basic_string::getline and operators
-<span class="lineNum">     969 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     970 </span>                :     basic_istream&lt;_CharT, _Traits&gt;&amp;
-<span class="lineNum">     971 </span>                :     operator&gt;&gt;(basic_istream&lt;_CharT, _Traits&gt;&amp; __in,
-<span class="lineNum">     972 </span>                :                basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp; __str)
-<span class="lineNum">     973 </span>                :     {
-<span class="lineNum">     974 </span>                :       typedef basic_istream&lt;_CharT, _Traits&gt;              __istream_type;
-<span class="lineNum">     975 </span>                :       typedef basic_string&lt;_CharT, _Traits, _Alloc&gt;       __string_type;
-<span class="lineNum">     976 </span>                :       typedef typename __istream_type::ios_base         __ios_base;
-<span class="lineNum">     977 </span>                :       typedef typename __istream_type::int_type         __int_type;
-<span class="lineNum">     978 </span>                :       typedef typename __string_type::size_type         __size_type;
-<span class="lineNum">     979 </span>                :       typedef ctype&lt;_CharT&gt;                               __ctype_type;
-<span class="lineNum">     980 </span>                :       typedef typename __ctype_type::ctype_base         __ctype_base;
-<span class="lineNum">     981 </span>                : 
-<span class="lineNum">     982 </span>                :       __size_type __extracted = 0;
-<span class="lineNum">     983 </span>                :       typename __ios_base::iostate __err = __ios_base::goodbit;
-<span class="lineNum">     984 </span>                :       typename __istream_type::sentry __cerb(__in, false);
-<span class="lineNum">     985 </span>                :       if (__cerb)
-<span class="lineNum">     986 </span>                :         {
-<span class="lineNum">     987 </span>                :           try
-<span class="lineNum">     988 </span>                :             {
-<span class="lineNum">     989 </span>                :               // Avoid reallocation for common case.
-<span class="lineNum">     990 </span>                :               __str.erase();
-<span class="lineNum">     991 </span>                :               _CharT __buf[128];
-<span class="lineNum">     992 </span>                :               __size_type __len = 0;          
-<span class="lineNum">     993 </span>                :               const streamsize __w = __in.width();
-<span class="lineNum">     994 </span>                :               const __size_type __n = __w &gt; 0 ? static_cast&lt;__size_type&gt;(__w)
-<span class="lineNum">     995 </span>                :                                               : __str.max_size();
-<span class="lineNum">     996 </span>                :               const __ctype_type&amp; __ct = use_facet&lt;__ctype_type&gt;(__in.getloc());
-<span class="lineNum">     997 </span>                :               const __int_type __eof = _Traits::eof();
-<span class="lineNum">     998 </span>                :               __int_type __c = __in.rdbuf()-&gt;sgetc();
-<span class="lineNum">     999 </span>                : 
-<span class="lineNum">    1000 </span>                :               while (__extracted &lt; __n
-<span class="lineNum">    1001 </span>                :                      &amp;&amp; !_Traits::eq_int_type(__c, __eof)
-<span class="lineNum">    1002 </span>                :                      &amp;&amp; !__ct.is(__ctype_base::space,
-<span class="lineNum">    1003 </span>                :                                  _Traits::to_char_type(__c)))
-<span class="lineNum">    1004 </span>                :                 {
-<span class="lineNum">    1005 </span>                :                   if (__len == sizeof(__buf) / sizeof(_CharT))
-<span class="lineNum">    1006 </span>                :                     {
-<span class="lineNum">    1007 </span>                :                       __str.append(__buf, sizeof(__buf) / sizeof(_CharT));
-<span class="lineNum">    1008 </span>                :                       __len = 0;
-<span class="lineNum">    1009 </span>                :                     }
-<span class="lineNum">    1010 </span>                :                   __buf[__len++] = _Traits::to_char_type(__c);
-<span class="lineNum">    1011 </span>                :                   ++__extracted;
-<span class="lineNum">    1012 </span>                :                   __c = __in.rdbuf()-&gt;snextc();
-<span class="lineNum">    1013 </span>                :                 }
-<span class="lineNum">    1014 </span>                :               __str.append(__buf, __len);
-<span class="lineNum">    1015 </span>                : 
-<span class="lineNum">    1016 </span>                :               if (_Traits::eq_int_type(__c, __eof))
-<span class="lineNum">    1017 </span>                :                 __err |= __ios_base::eofbit;
-<span class="lineNum">    1018 </span>                :               __in.width(0);
-<span class="lineNum">    1019 </span>                :             }
-<span class="lineNum">    1020 </span>                :           catch(__cxxabiv1::__forced_unwind&amp;)
-<span class="lineNum">    1021 </span>                :             {
-<span class="lineNum">    1022 </span>                :               __in._M_setstate(__ios_base::badbit);
-<span class="lineNum">    1023 </span>                :               __throw_exception_again;
-<span class="lineNum">    1024 </span>                :             }
-<span class="lineNum">    1025 </span>                :           catch(...)
-<span class="lineNum">    1026 </span>                :             {
-<span class="lineNum">    1027 </span>                :               // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">    1028 </span>                :               // 91. Description of operator&gt;&gt; and getline() for string&lt;&gt;
-<span class="lineNum">    1029 </span>                :               // might cause endless loop
-<span class="lineNum">    1030 </span>                :               __in._M_setstate(__ios_base::badbit);
-<span class="lineNum">    1031 </span>                :             }
-<span class="lineNum">    1032 </span>                :         }
-<span class="lineNum">    1033 </span>                :       // 211.  operator&gt;&gt;(istream&amp;, string&amp;) doesn't set failbit
-<span class="lineNum">    1034 </span>                :       if (!__extracted)
-<span class="lineNum">    1035 </span>                :         __err |= __ios_base::failbit;
-<span class="lineNum">    1036 </span>                :       if (__err)
-<span class="lineNum">    1037 </span>                :         __in.setstate(__err);
-<span class="lineNum">    1038 </span>                :       return __in;
-<span class="lineNum">    1039 </span>                :     }
-<span class="lineNum">    1040 </span>                : 
-<span class="lineNum">    1041 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">    1042 </span>                :     basic_istream&lt;_CharT, _Traits&gt;&amp;
-<span class="lineNum">    1043 </span>                :     getline(basic_istream&lt;_CharT, _Traits&gt;&amp; __in,
-<span class="lineNum">    1044 </span>                :             basic_string&lt;_CharT, _Traits, _Alloc&gt;&amp; __str, _CharT __delim)
-<span class="lineNum">    1045 </span>                :     {
-<span class="lineNum">    1046 </span>                :       typedef basic_istream&lt;_CharT, _Traits&gt;              __istream_type;
-<span class="lineNum">    1047 </span>                :       typedef basic_string&lt;_CharT, _Traits, _Alloc&gt;       __string_type;
-<span class="lineNum">    1048 </span>                :       typedef typename __istream_type::ios_base         __ios_base;
-<span class="lineNum">    1049 </span>                :       typedef typename __istream_type::int_type         __int_type;
-<span class="lineNum">    1050 </span>                :       typedef typename __string_type::size_type         __size_type;
-<span class="lineNum">    1051 </span>                : 
-<span class="lineNum">    1052 </span>                :       __size_type __extracted = 0;
-<span class="lineNum">    1053 </span>                :       const __size_type __n = __str.max_size();
-<span class="lineNum">    1054 </span>                :       typename __ios_base::iostate __err = __ios_base::goodbit;
-<span class="lineNum">    1055 </span>                :       typename __istream_type::sentry __cerb(__in, true);
-<span class="lineNum">    1056 </span>                :       if (__cerb)
-<span class="lineNum">    1057 </span>                :         {
-<span class="lineNum">    1058 </span>                :           try
-<span class="lineNum">    1059 </span>                :             {
-<span class="lineNum">    1060 </span>                :               __str.erase();
-<span class="lineNum">    1061 </span>                :               const __int_type __idelim = _Traits::to_int_type(__delim);
-<span class="lineNum">    1062 </span>                :               const __int_type __eof = _Traits::eof();
-<span class="lineNum">    1063 </span>                :               __int_type __c = __in.rdbuf()-&gt;sgetc();
-<span class="lineNum">    1064 </span>                : 
-<span class="lineNum">    1065 </span>                :               while (__extracted &lt; __n
-<span class="lineNum">    1066 </span>                :                      &amp;&amp; !_Traits::eq_int_type(__c, __eof)
-<span class="lineNum">    1067 </span>                :                      &amp;&amp; !_Traits::eq_int_type(__c, __idelim))
-<span class="lineNum">    1068 </span>                :                 {
-<span class="lineNum">    1069 </span>                :                   __str += _Traits::to_char_type(__c);
-<span class="lineNum">    1070 </span>                :                   ++__extracted;
-<span class="lineNum">    1071 </span>                :                   __c = __in.rdbuf()-&gt;snextc();
-<span class="lineNum">    1072 </span>                :                 }
-<span class="lineNum">    1073 </span>                : 
-<span class="lineNum">    1074 </span>                :               if (_Traits::eq_int_type(__c, __eof))
-<span class="lineNum">    1075 </span>                :                 __err |= __ios_base::eofbit;
-<span class="lineNum">    1076 </span>                :               else if (_Traits::eq_int_type(__c, __idelim))
-<span class="lineNum">    1077 </span>                :                 {
-<span class="lineNum">    1078 </span>                :                   ++__extracted;                  
-<span class="lineNum">    1079 </span>                :                   __in.rdbuf()-&gt;sbumpc();
-<span class="lineNum">    1080 </span>                :                 }
-<span class="lineNum">    1081 </span>                :               else
-<span class="lineNum">    1082 </span>                :                 __err |= __ios_base::failbit;
-<span class="lineNum">    1083 </span>                :             }
-<span class="lineNum">    1084 </span>                :           catch(__cxxabiv1::__forced_unwind&amp;)
-<span class="lineNum">    1085 </span>                :             {
-<span class="lineNum">    1086 </span>                :               __in._M_setstate(__ios_base::badbit);
-<span class="lineNum">    1087 </span>                :               __throw_exception_again;
-<span class="lineNum">    1088 </span>                :             }
-<span class="lineNum">    1089 </span>                :           catch(...)
-<span class="lineNum">    1090 </span>                :             {
-<span class="lineNum">    1091 </span>                :               // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">    1092 </span>                :               // 91. Description of operator&gt;&gt; and getline() for string&lt;&gt;
-<span class="lineNum">    1093 </span>                :               // might cause endless loop
-<span class="lineNum">    1094 </span>                :               __in._M_setstate(__ios_base::badbit);
-<span class="lineNum">    1095 </span>                :             }
-<span class="lineNum">    1096 </span>                :         }
-<span class="lineNum">    1097 </span>                :       if (!__extracted)
-<span class="lineNum">    1098 </span>                :         __err |= __ios_base::failbit;
-<span class="lineNum">    1099 </span>                :       if (__err)
-<span class="lineNum">    1100 </span>                :         __in.setstate(__err);
-<span class="lineNum">    1101 </span>                :       return __in;
-<span class="lineNum">    1102 </span>                :     }
-<span class="lineNum">    1103 </span>                : 
-<span class="lineNum">    1104 </span>                :   // Inhibit implicit instantiations for required instantiations,
-<span class="lineNum">    1105 </span>                :   // which are defined via explicit instantiations elsewhere.
-<span class="lineNum">    1106 </span>                :   // NB: This syntax is a GNU extension.
-<span class="lineNum">    1107 </span>                : #if _GLIBCXX_EXTERN_TEMPLATE
-<span class="lineNum">    1108 </span>                :   extern template class basic_string&lt;char&gt;;
-<span class="lineNum">    1109 </span>                :   extern template
-<span class="lineNum">    1110 </span>                :     basic_istream&lt;char&gt;&amp;
-<span class="lineNum">    1111 </span>                :     operator&gt;&gt;(basic_istream&lt;char&gt;&amp;, string&amp;);
-<span class="lineNum">    1112 </span>                :   extern template
-<span class="lineNum">    1113 </span>                :     basic_ostream&lt;char&gt;&amp;
-<span class="lineNum">    1114 </span>                :     operator&lt;&lt;(basic_ostream&lt;char&gt;&amp;, const string&amp;);
-<span class="lineNum">    1115 </span>                :   extern template
-<span class="lineNum">    1116 </span>                :     basic_istream&lt;char&gt;&amp;
-<span class="lineNum">    1117 </span>                :     getline(basic_istream&lt;char&gt;&amp;, string&amp;, char);
-<span class="lineNum">    1118 </span>                :   extern template
-<span class="lineNum">    1119 </span>                :     basic_istream&lt;char&gt;&amp;
-<span class="lineNum">    1120 </span>                :     getline(basic_istream&lt;char&gt;&amp;, string&amp;);
-<span class="lineNum">    1121 </span>                : 
-<span class="lineNum">    1122 </span>                : #ifdef _GLIBCXX_USE_WCHAR_T
-<span class="lineNum">    1123 </span>                :   extern template class basic_string&lt;wchar_t&gt;;
-<span class="lineNum">    1124 </span>                :   extern template
-<span class="lineNum">    1125 </span>                :     basic_istream&lt;wchar_t&gt;&amp;
-<span class="lineNum">    1126 </span>                :     operator&gt;&gt;(basic_istream&lt;wchar_t&gt;&amp;, wstring&amp;);
-<span class="lineNum">    1127 </span>                :   extern template
-<span class="lineNum">    1128 </span>                :     basic_ostream&lt;wchar_t&gt;&amp;
-<span class="lineNum">    1129 </span>                :     operator&lt;&lt;(basic_ostream&lt;wchar_t&gt;&amp;, const wstring&amp;);
-<span class="lineNum">    1130 </span>                :   extern template
-<span class="lineNum">    1131 </span>                :     basic_istream&lt;wchar_t&gt;&amp;
-<span class="lineNum">    1132 </span>                :     getline(basic_istream&lt;wchar_t&gt;&amp;, wstring&amp;, wchar_t);
-<span class="lineNum">    1133 </span>                :   extern template
-<span class="lineNum">    1134 </span>                :     basic_istream&lt;wchar_t&gt;&amp;
-<span class="lineNum">    1135 </span>                :     getline(basic_istream&lt;wchar_t&gt;&amp;, wstring&amp;);
-<span class="lineNum">    1136 </span>                : #endif
-<span class="lineNum">    1137 </span>                : #endif
-<span class="lineNum">    1138 </span>                : 
-<span class="lineNum">    1139 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">    1140 </span>                : 
-<span class="lineNum">    1141 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/bits/char_traits.h.gcov.html b/rep/usr/include/c++/4.3/bits/char_traits.h.gcov.html
deleted file mode 100644
index 5a682d1..0000000
--- a/rep/usr/include/c++/4.3/bits/char_traits.h.gcov.html
+++ /dev/null
@@ -1,438 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/char_traits.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - char_traits.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">13</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">46.2 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">6</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // Character Traits for use by standard string and iostream -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005,
-<span class="lineNum">       4 </span>                : // 2006, 2007
-<span class="lineNum">       5 </span>                : // Free Software Foundation, Inc.
-<span class="lineNum">       6 </span>                : //
-<span class="lineNum">       7 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       8 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       9 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">      10 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      11 </span>                : // any later version.
-<span class="lineNum">      12 </span>                : 
-<span class="lineNum">      13 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      14 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      15 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      16 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      17 </span>                : 
-<span class="lineNum">      18 </span>                : // You should have received a copy of the GNU General Public License along
-<span class="lineNum">      19 </span>                : // with this library; see the file COPYING.  If not, write to the Free
-<span class="lineNum">      20 </span>                : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-<span class="lineNum">      21 </span>                : // USA.
-<span class="lineNum">      22 </span>                : 
-<span class="lineNum">      23 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      24 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      25 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      26 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      27 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      28 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      29 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      30 </span>                : // the GNU General Public License.
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span>                : /** @file char_traits.h
-<span class="lineNum">      33 </span>                :  *  This is an internal header file, included by other library headers.
-<span class="lineNum">      34 </span>                :  *  You should not attempt to use it directly.
-<span class="lineNum">      35 </span>                :  */
-<span class="lineNum">      36 </span>                : 
-<span class="lineNum">      37 </span>                : //
-<span class="lineNum">      38 </span>                : // ISO C++ 14882: 21  Strings library
-<span class="lineNum">      39 </span>                : //
-<span class="lineNum">      40 </span>                : 
-<span class="lineNum">      41 </span>                : #ifndef _CHAR_TRAITS_H
-<span class="lineNum">      42 </span>                : #define _CHAR_TRAITS_H 1
-<span class="lineNum">      43 </span>                : 
-<span class="lineNum">      44 </span>                : #pragma GCC system_header
-<span class="lineNum">      45 </span>                : 
-<span class="lineNum">      46 </span>                : #include &lt;bits/stl_algobase.h&gt;  // std::copy, std::fill_n
-<span class="lineNum">      47 </span>                : #include &lt;bits/postypes.h&gt;      // For streampos
-<span class="lineNum">      48 </span>                : #include &lt;cstdio&gt;               // For EOF
-<span class="lineNum">      49 </span>                : #include &lt;cwchar&gt;               // For WEOF, wmemmove, wmemset, etc.
-<span class="lineNum">      50 </span>                : 
-<span class="lineNum">      51 </span>                : _GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx)
-<span class="lineNum">      52 </span>                : 
-<span class="lineNum">      53 </span>                :   /**
-<span class="lineNum">      54 </span>                :    *  @brief  Mapping from character type to associated types.
-<span class="lineNum">      55 </span>                :    *
-<span class="lineNum">      56 </span>                :    *  @note This is an implementation class for the generic version
-<span class="lineNum">      57 </span>                :    *  of char_traits.  It defines int_type, off_type, pos_type, and
-<span class="lineNum">      58 </span>                :    *  state_type.  By default these are unsigned long, streamoff,
-<span class="lineNum">      59 </span>                :    *  streampos, and mbstate_t.  Users who need a different set of
-<span class="lineNum">      60 </span>                :    *  types, but who don't need to change the definitions of any function
-<span class="lineNum">      61 </span>                :    *  defined in char_traits, can specialize __gnu_cxx::_Char_types
-<span class="lineNum">      62 </span>                :    *  while leaving __gnu_cxx::char_traits alone. */
-<span class="lineNum">      63 </span>                :   template&lt;typename _CharT&gt;
-<span class="lineNum">      64 </span>                :     struct _Char_types
-<span class="lineNum">      65 </span>                :     {
-<span class="lineNum">      66 </span>                :       typedef unsigned long   int_type;
-<span class="lineNum">      67 </span>                :       typedef std::streampos  pos_type;
-<span class="lineNum">      68 </span>                :       typedef std::streamoff  off_type;
-<span class="lineNum">      69 </span>                :       typedef std::mbstate_t  state_type;
-<span class="lineNum">      70 </span>                :     };
-<span class="lineNum">      71 </span>                : 
-<span class="lineNum">      72 </span>                : 
-<span class="lineNum">      73 </span>                :   /**
-<span class="lineNum">      74 </span>                :    *  @brief  Base class used to implement std::char_traits.
-<span class="lineNum">      75 </span>                :    *
-<span class="lineNum">      76 </span>                :    *  @note For any given actual character type, this definition is
-<span class="lineNum">      77 </span>                :    *  probably wrong.  (Most of the member functions are likely to be
-<span class="lineNum">      78 </span>                :    *  right, but the int_type and state_type typedefs, and the eof()
-<span class="lineNum">      79 </span>                :    *  member function, are likely to be wrong.)  The reason this class
-<span class="lineNum">      80 </span>                :    *  exists is so users can specialize it.  Classes in namespace std
-<span class="lineNum">      81 </span>                :    *  may not be specialized for fundamental types, but classes in
-<span class="lineNum">      82 </span>                :    *  namespace __gnu_cxx may be.
-<span class="lineNum">      83 </span>                :    *
-<span class="lineNum">      84 </span>                :    *  See http://gcc.gnu.org/onlinedocs/libstdc++/21_strings/howto.html#5
-<span class="lineNum">      85 </span>                :    *  for advice on how to make use of this class for &quot;unusual&quot; character
-<span class="lineNum">      86 </span>                :    *  types. Also, check out include/ext/pod_char_traits.h.  
-<span class="lineNum">      87 </span>                :    */
-<span class="lineNum">      88 </span>                :   template&lt;typename _CharT&gt;
-<span class="lineNum">      89 </span>                :     struct char_traits
-<span class="lineNum">      90 </span>                :     {
-<span class="lineNum">      91 </span>                :       typedef _CharT                                    char_type;
-<span class="lineNum">      92 </span>                :       typedef typename _Char_types&lt;_CharT&gt;::int_type    int_type;
-<span class="lineNum">      93 </span>                :       typedef typename _Char_types&lt;_CharT&gt;::pos_type    pos_type;
-<span class="lineNum">      94 </span>                :       typedef typename _Char_types&lt;_CharT&gt;::off_type    off_type;
-<span class="lineNum">      95 </span>                :       typedef typename _Char_types&lt;_CharT&gt;::state_type  state_type;
-<span class="lineNum">      96 </span>                : 
-<span class="lineNum">      97 </span>                :       static void
-<span class="lineNum">      98 </span>                :       assign(char_type&amp; __c1, const char_type&amp; __c2)
-<span class="lineNum">      99 </span>                :       { __c1 = __c2; }
-<span class="lineNum">     100 </span>                : 
-<span class="lineNum">     101 </span>                :       static bool
-<span class="lineNum">     102 </span>                :       eq(const char_type&amp; __c1, const char_type&amp; __c2)
-<span class="lineNum">     103 </span>                :       { return __c1 == __c2; }
-<span class="lineNum">     104 </span>                : 
-<span class="lineNum">     105 </span>                :       static bool
-<span class="lineNum">     106 </span>                :       lt(const char_type&amp; __c1, const char_type&amp; __c2)
-<span class="lineNum">     107 </span>                :       { return __c1 &lt; __c2; }
-<span class="lineNum">     108 </span>                : 
-<span class="lineNum">     109 </span>                :       static int
-<span class="lineNum">     110 </span>                :       compare(const char_type* __s1, const char_type* __s2, std::size_t __n);
-<span class="lineNum">     111 </span>                : 
-<span class="lineNum">     112 </span>                :       static std::size_t
-<span class="lineNum">     113 </span>                :       length(const char_type* __s);
-<span class="lineNum">     114 </span>                : 
-<span class="lineNum">     115 </span>                :       static const char_type*
-<span class="lineNum">     116 </span>                :       find(const char_type* __s, std::size_t __n, const char_type&amp; __a);
-<span class="lineNum">     117 </span>                : 
-<span class="lineNum">     118 </span>                :       static char_type*
-<span class="lineNum">     119 </span>                :       move(char_type* __s1, const char_type* __s2, std::size_t __n);
-<span class="lineNum">     120 </span>                : 
-<span class="lineNum">     121 </span>                :       static char_type*
-<span class="lineNum">     122 </span>                :       copy(char_type* __s1, const char_type* __s2, std::size_t __n);
-<span class="lineNum">     123 </span>                : 
-<span class="lineNum">     124 </span>                :       static char_type*
-<span class="lineNum">     125 </span>                :       assign(char_type* __s, std::size_t __n, char_type __a);
-<span class="lineNum">     126 </span>                : 
-<span class="lineNum">     127 </span>                :       static char_type
-<span class="lineNum">     128 </span>                :       to_char_type(const int_type&amp; __c)
-<span class="lineNum">     129 </span>                :       { return static_cast&lt;char_type&gt;(__c); }
-<span class="lineNum">     130 </span>                : 
-<span class="lineNum">     131 </span>                :       static int_type
-<span class="lineNum">     132 </span>                :       to_int_type(const char_type&amp; __c)
-<span class="lineNum">     133 </span>                :       { return static_cast&lt;int_type&gt;(__c); }
-<span class="lineNum">     134 </span>                : 
-<span class="lineNum">     135 </span>                :       static bool
-<span class="lineNum">     136 </span>                :       eq_int_type(const int_type&amp; __c1, const int_type&amp; __c2)
-<span class="lineNum">     137 </span>                :       { return __c1 == __c2; }
-<span class="lineNum">     138 </span>                : 
-<span class="lineNum">     139 </span>                :       static int_type
-<span class="lineNum">     140 </span>                :       eof()
-<span class="lineNum">     141 </span>                :       { return static_cast&lt;int_type&gt;(EOF); }
-<span class="lineNum">     142 </span>                : 
-<span class="lineNum">     143 </span>                :       static int_type
-<span class="lineNum">     144 </span>                :       not_eof(const int_type&amp; __c)
-<span class="lineNum">     145 </span>                :       { return !eq_int_type(__c, eof()) ? __c : to_int_type(char_type()); }
-<span class="lineNum">     146 </span>                :     };
-<span class="lineNum">     147 </span>                : 
-<span class="lineNum">     148 </span>                :   template&lt;typename _CharT&gt;
-<span class="lineNum">     149 </span>                :     int
-<span class="lineNum">     150 </span>                :     char_traits&lt;_CharT&gt;::
-<span class="lineNum">     151 </span>                :     compare(const char_type* __s1, const char_type* __s2, std::size_t __n)
-<span class="lineNum">     152 </span>                :     {
-<span class="lineNum">     153 </span>                :       for (std::size_t __i = 0; __i &lt; __n; ++__i)
-<span class="lineNum">     154 </span>                :         if (lt(__s1[__i], __s2[__i]))
-<span class="lineNum">     155 </span>                :           return -1;
-<span class="lineNum">     156 </span>                :         else if (lt(__s2[__i], __s1[__i]))
-<span class="lineNum">     157 </span>                :           return 1;
-<span class="lineNum">     158 </span>                :       return 0;
-<span class="lineNum">     159 </span>                :     }
-<span class="lineNum">     160 </span>                : 
-<span class="lineNum">     161 </span>                :   template&lt;typename _CharT&gt;
-<span class="lineNum">     162 </span>                :     std::size_t
-<span class="lineNum">     163 </span>                :     char_traits&lt;_CharT&gt;::
-<span class="lineNum">     164 </span>                :     length(const char_type* __p)
-<span class="lineNum">     165 </span>                :     {
-<span class="lineNum">     166 </span>                :       std::size_t __i = 0;
-<span class="lineNum">     167 </span>                :       while (!eq(__p[__i], char_type()))
-<span class="lineNum">     168 </span>                :         ++__i;
-<span class="lineNum">     169 </span>                :       return __i;
-<span class="lineNum">     170 </span>                :     }
-<span class="lineNum">     171 </span>                : 
-<span class="lineNum">     172 </span>                :   template&lt;typename _CharT&gt;
-<span class="lineNum">     173 </span>                :     const typename char_traits&lt;_CharT&gt;::char_type*
-<span class="lineNum">     174 </span>                :     char_traits&lt;_CharT&gt;::
-<span class="lineNum">     175 </span>                :     find(const char_type* __s, std::size_t __n, const char_type&amp; __a)
-<span class="lineNum">     176 </span>                :     {
-<span class="lineNum">     177 </span>                :       for (std::size_t __i = 0; __i &lt; __n; ++__i)
-<span class="lineNum">     178 </span>                :         if (eq(__s[__i], __a))
-<span class="lineNum">     179 </span>                :           return __s + __i;
-<span class="lineNum">     180 </span>                :       return 0;
-<span class="lineNum">     181 </span>                :     }
-<span class="lineNum">     182 </span>                : 
-<span class="lineNum">     183 </span>                :   template&lt;typename _CharT&gt;
-<span class="lineNum">     184 </span>                :     typename char_traits&lt;_CharT&gt;::char_type*
-<span class="lineNum">     185 </span>                :     char_traits&lt;_CharT&gt;::
-<span class="lineNum">     186 </span>                :     move(char_type* __s1, const char_type* __s2, std::size_t __n)
-<span class="lineNum">     187 </span>                :     {
-<span class="lineNum">     188 </span>                :       return static_cast&lt;_CharT*&gt;(__builtin_memmove(__s1, __s2,
-<span class="lineNum">     189 </span>                :                                                     __n * sizeof(char_type)));
-<span class="lineNum">     190 </span>                :     }
-<span class="lineNum">     191 </span>                : 
-<span class="lineNum">     192 </span>                :   template&lt;typename _CharT&gt;
-<span class="lineNum">     193 </span>                :     typename char_traits&lt;_CharT&gt;::char_type*
-<span class="lineNum">     194 </span>                :     char_traits&lt;_CharT&gt;::
-<span class="lineNum">     195 </span>                :     copy(char_type* __s1, const char_type* __s2, std::size_t __n)
-<span class="lineNum">     196 </span>                :     {
-<span class="lineNum">     197 </span>                :       // NB: Inline std::copy so no recursive dependencies.
-<span class="lineNum">     198 </span>                :       std::copy(__s2, __s2 + __n, __s1);
-<span class="lineNum">     199 </span>                :       return __s1;
-<span class="lineNum">     200 </span>                :     }
-<span class="lineNum">     201 </span>                : 
-<span class="lineNum">     202 </span>                :   template&lt;typename _CharT&gt;
-<span class="lineNum">     203 </span>                :     typename char_traits&lt;_CharT&gt;::char_type*
-<span class="lineNum">     204 </span>                :     char_traits&lt;_CharT&gt;::
-<span class="lineNum">     205 </span>                :     assign(char_type* __s, std::size_t __n, char_type __a)
-<span class="lineNum">     206 </span>                :     {
-<span class="lineNum">     207 </span>                :       // NB: Inline std::fill_n so no recursive dependencies.
-<span class="lineNum">     208 </span>                :       std::fill_n(__s, __n, __a);
-<span class="lineNum">     209 </span>                :       return __s;
-<span class="lineNum">     210 </span>                :     }
-<span class="lineNum">     211 </span>                : 
-<span class="lineNum">     212 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">     213 </span>                : 
-<span class="lineNum">     214 </span>                : _GLIBCXX_BEGIN_NAMESPACE(std)
-<span class="lineNum">     215 </span>                : 
-<span class="lineNum">     216 </span>                :   // 21.1
-<span class="lineNum">     217 </span>                :   /**
-<span class="lineNum">     218 </span>                :    *  @brief  Basis for explicit traits specializations.
-<span class="lineNum">     219 </span>                :    *
-<span class="lineNum">     220 </span>                :    *  @note  For any given actual character type, this definition is
-<span class="lineNum">     221 </span>                :    *  probably wrong.  Since this is just a thin wrapper around
-<span class="lineNum">     222 </span>                :    *  __gnu_cxx::char_traits, it is possible to achieve a more
-<span class="lineNum">     223 </span>                :    *  appropriate definition by specializing __gnu_cxx::char_traits.
-<span class="lineNum">     224 </span>                :    *
-<span class="lineNum">     225 </span>                :    *  See http://gcc.gnu.org/onlinedocs/libstdc++/21_strings/howto.html#5
-<span class="lineNum">     226 </span>                :    *  for advice on how to make use of this class for &quot;unusual&quot; character
-<span class="lineNum">     227 </span>                :    *  types. Also, check out include/ext/pod_char_traits.h.
-<span class="lineNum">     228 </span>                :   */
-<span class="lineNum">     229 </span>                :   template&lt;class _CharT&gt;
-<span class="lineNum">     230 </span>                :     struct char_traits : public __gnu_cxx::char_traits&lt;_CharT&gt;
-<span class="lineNum">     231 </span>                :     { };
-<span class="lineNum">     232 </span>                : 
-<span class="lineNum">     233 </span>                : 
-<span class="lineNum">     234 </span>                :   /// 21.1.3.1  char_traits specializations
-<span class="lineNum">     235 </span>                :   template&lt;&gt;
-<span class="lineNum">     236 </span>                :     struct char_traits&lt;char&gt;
-<span class="lineNum">     237 </span>                :     {
-<span class="lineNum">     238 </span>                :       typedef char              char_type;
-<span class="lineNum">     239 </span>                :       typedef int               int_type;
-<span class="lineNum">     240 </span>                :       typedef streampos         pos_type;
-<span class="lineNum">     241 </span>                :       typedef streamoff         off_type;
-<span class="lineNum">     242 </span>                :       typedef mbstate_t         state_type;
-<span class="lineNum">     243 </span>                : 
-<span class="lineNum">     244 </span>                :       static void
-<span class="lineNum">     245 </span><span class="lineCov">          10976 :       assign(char_type&amp; __c1, const char_type&amp; __c2)</span>
-<span class="lineNum">     246 </span><span class="lineCov">          10976 :       { __c1 = __c2; }</span>
-<span class="lineNum">     247 </span>                : 
-<span class="lineNum">     248 </span>                :       static bool
-<span class="lineNum">     249 </span>                :       eq(const char_type&amp; __c1, const char_type&amp; __c2)
-<span class="lineNum">     250 </span>                :       { return __c1 == __c2; }
-<span class="lineNum">     251 </span>                : 
-<span class="lineNum">     252 </span>                :       static bool
-<span class="lineNum">     253 </span>                :       lt(const char_type&amp; __c1, const char_type&amp; __c2)
-<span class="lineNum">     254 </span>                :       { return __c1 &lt; __c2; }
-<span class="lineNum">     255 </span>                : 
-<span class="lineNum">     256 </span>                :       static int
-<span class="lineNum">     257 </span><span class="lineCov">         115296 :       compare(const char_type* __s1, const char_type* __s2, size_t __n)</span>
-<span class="lineNum">     258 </span><span class="lineCov">         115296 :       { return __builtin_memcmp(__s1, __s2, __n); }</span>
-<span class="lineNum">     259 </span>                : 
-<span class="lineNum">     260 </span>                :       static size_t
-<span class="lineNum">     261 </span><span class="lineCov">           2633 :       length(const char_type* __s)</span>
-<span class="lineNum">     262 </span><span class="lineCov">           2633 :       { return __builtin_strlen(__s); }</span>
-<span class="lineNum">     263 </span>                : 
-<span class="lineNum">     264 </span>                :       static const char_type*
-<span class="lineNum">     265 </span>                :       find(const char_type* __s, size_t __n, const char_type&amp; __a)
-<span class="lineNum">     266 </span>                :       { return static_cast&lt;const char_type*&gt;(__builtin_memchr(__s, __a, __n)); }
-<span class="lineNum">     267 </span>                : 
-<span class="lineNum">     268 </span>                :       static char_type*
-<span class="lineNum">     269 </span>                :       move(char_type* __s1, const char_type* __s2, size_t __n)
-<span class="lineNum">     270 </span>                :       { return static_cast&lt;char_type*&gt;(__builtin_memmove(__s1, __s2, __n)); }
-<span class="lineNum">     271 </span>                : 
-<span class="lineNum">     272 </span>                :       static char_type*
-<span class="lineNum">     273 </span><span class="lineNoCov">              0 :       copy(char_type* __s1, const char_type* __s2, size_t __n)</span>
-<span class="lineNum">     274 </span><span class="lineNoCov">              0 :       { return static_cast&lt;char_type*&gt;(__builtin_memcpy(__s1, __s2, __n)); }</span>
-<span class="lineNum">     275 </span>                : 
-<span class="lineNum">     276 </span>                :       static char_type*
-<span class="lineNum">     277 </span>                :       assign(char_type* __s, size_t __n, char_type __a)
-<span class="lineNum">     278 </span>                :       { return static_cast&lt;char_type*&gt;(__builtin_memset(__s, __a, __n)); }
-<span class="lineNum">     279 </span>                : 
-<span class="lineNum">     280 </span>                :       static char_type
-<span class="lineNum">     281 </span>                :       to_char_type(const int_type&amp; __c)
-<span class="lineNum">     282 </span>                :       { return static_cast&lt;char_type&gt;(__c); }
-<span class="lineNum">     283 </span>                : 
-<span class="lineNum">     284 </span>                :       // To keep both the byte 0xff and the eof symbol 0xffffffff
-<span class="lineNum">     285 </span>                :       // from ending up as 0xffffffff.
-<span class="lineNum">     286 </span>                :       static int_type
-<span class="lineNum">     287 </span><span class="lineNoCov">              0 :       to_int_type(const char_type&amp; __c)</span>
-<span class="lineNum">     288 </span><span class="lineNoCov">              0 :       { return static_cast&lt;int_type&gt;(static_cast&lt;unsigned char&gt;(__c)); }</span>
-<span class="lineNum">     289 </span>                : 
-<span class="lineNum">     290 </span>                :       static bool
-<span class="lineNum">     291 </span><span class="lineNoCov">              0 :       eq_int_type(const int_type&amp; __c1, const int_type&amp; __c2)</span>
-<span class="lineNum">     292 </span><span class="lineNoCov">              0 :       { return __c1 == __c2; }</span>
-<span class="lineNum">     293 </span>                : 
-<span class="lineNum">     294 </span>                :       static int_type
-<span class="lineNum">     295 </span><span class="lineNoCov">              0 :       eof() { return static_cast&lt;int_type&gt;(EOF); }</span>
-<span class="lineNum">     296 </span>                : 
-<span class="lineNum">     297 </span>                :       static int_type
-<span class="lineNum">     298 </span>                :       not_eof(const int_type&amp; __c)
-<span class="lineNum">     299 </span>                :       { return (__c == eof()) ? 0 : __c; }
-<span class="lineNum">     300 </span>                :   };
-<span class="lineNum">     301 </span>                : 
-<span class="lineNum">     302 </span>                : 
-<span class="lineNum">     303 </span>                : #ifdef _GLIBCXX_USE_WCHAR_T
-<span class="lineNum">     304 </span>                :   /// 21.1.3.2  char_traits specializations
-<span class="lineNum">     305 </span>                :   template&lt;&gt;
-<span class="lineNum">     306 </span>                :     struct char_traits&lt;wchar_t&gt;
-<span class="lineNum">     307 </span>                :     {
-<span class="lineNum">     308 </span>                :       typedef wchar_t           char_type;
-<span class="lineNum">     309 </span>                :       typedef wint_t            int_type;
-<span class="lineNum">     310 </span>                :       typedef streamoff         off_type;
-<span class="lineNum">     311 </span>                :       typedef wstreampos        pos_type;
-<span class="lineNum">     312 </span>                :       typedef mbstate_t         state_type;
-<span class="lineNum">     313 </span>                : 
-<span class="lineNum">     314 </span>                :       static void
-<span class="lineNum">     315 </span>                :       assign(char_type&amp; __c1, const char_type&amp; __c2)
-<span class="lineNum">     316 </span>                :       { __c1 = __c2; }
-<span class="lineNum">     317 </span>                : 
-<span class="lineNum">     318 </span>                :       static bool
-<span class="lineNum">     319 </span>                :       eq(const char_type&amp; __c1, const char_type&amp; __c2)
-<span class="lineNum">     320 </span>                :       { return __c1 == __c2; }
-<span class="lineNum">     321 </span>                : 
-<span class="lineNum">     322 </span>                :       static bool
-<span class="lineNum">     323 </span>                :       lt(const char_type&amp; __c1, const char_type&amp; __c2)
-<span class="lineNum">     324 </span>                :       { return __c1 &lt; __c2; }
-<span class="lineNum">     325 </span>                : 
-<span class="lineNum">     326 </span>                :       static int
-<span class="lineNum">     327 </span>                :       compare(const char_type* __s1, const char_type* __s2, size_t __n)
-<span class="lineNum">     328 </span>                :       { return wmemcmp(__s1, __s2, __n); }
-<span class="lineNum">     329 </span>                : 
-<span class="lineNum">     330 </span>                :       static size_t
-<span class="lineNum">     331 </span>                :       length(const char_type* __s)
-<span class="lineNum">     332 </span>                :       { return wcslen(__s); }
-<span class="lineNum">     333 </span>                : 
-<span class="lineNum">     334 </span>                :       static const char_type*
-<span class="lineNum">     335 </span>                :       find(const char_type* __s, size_t __n, const char_type&amp; __a)
-<span class="lineNum">     336 </span>                :       { return wmemchr(__s, __a, __n); }
-<span class="lineNum">     337 </span>                : 
-<span class="lineNum">     338 </span>                :       static char_type*
-<span class="lineNum">     339 </span>                :       move(char_type* __s1, const char_type* __s2, size_t __n)
-<span class="lineNum">     340 </span>                :       { return wmemmove(__s1, __s2, __n); }
-<span class="lineNum">     341 </span>                : 
-<span class="lineNum">     342 </span>                :       static char_type*
-<span class="lineNum">     343 </span>                :       copy(char_type* __s1, const char_type* __s2, size_t __n)
-<span class="lineNum">     344 </span>                :       { return wmemcpy(__s1, __s2, __n); }
-<span class="lineNum">     345 </span>                : 
-<span class="lineNum">     346 </span>                :       static char_type*
-<span class="lineNum">     347 </span>                :       assign(char_type* __s, size_t __n, char_type __a)
-<span class="lineNum">     348 </span>                :       { return wmemset(__s, __a, __n); }
-<span class="lineNum">     349 </span>                : 
-<span class="lineNum">     350 </span>                :       static char_type
-<span class="lineNum">     351 </span>                :       to_char_type(const int_type&amp; __c) { return char_type(__c); }
-<span class="lineNum">     352 </span>                : 
-<span class="lineNum">     353 </span>                :       static int_type
-<span class="lineNum">     354 </span>                :       to_int_type(const char_type&amp; __c) { return int_type(__c); }
-<span class="lineNum">     355 </span>                : 
-<span class="lineNum">     356 </span>                :       static bool
-<span class="lineNum">     357 </span>                :       eq_int_type(const int_type&amp; __c1, const int_type&amp; __c2)
-<span class="lineNum">     358 </span>                :       { return __c1 == __c2; }
-<span class="lineNum">     359 </span>                : 
-<span class="lineNum">     360 </span>                :       static int_type
-<span class="lineNum">     361 </span>                :       eof() { return static_cast&lt;int_type&gt;(WEOF); }
-<span class="lineNum">     362 </span>                : 
-<span class="lineNum">     363 </span>                :       static int_type
-<span class="lineNum">     364 </span>                :       not_eof(const int_type&amp; __c)
-<span class="lineNum">     365 </span>                :       { return eq_int_type(__c, eof()) ? 0 : __c; }
-<span class="lineNum">     366 </span>                :   };
-<span class="lineNum">     367 </span>                : #endif //_GLIBCXX_USE_WCHAR_T
-<span class="lineNum">     368 </span>                : 
-<span class="lineNum">     369 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">     370 </span>                : 
-<span class="lineNum">     371 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/bits/deque.tcc.gcov.html b/rep/usr/include/c++/4.3/bits/deque.tcc.gcov.html
deleted file mode 100644
index 08f01e5..0000000
--- a/rep/usr/include/c++/4.3/bits/deque.tcc.gcov.html
+++ /dev/null
@@ -1,900 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/deque.tcc</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - deque.tcc</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">147</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">19.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">28</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // Deque implementation (out of line) -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007
-<span class="lineNum">       4 </span>                : // Free Software Foundation, Inc.
-<span class="lineNum">       5 </span>                : //
-<span class="lineNum">       6 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       7 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       8 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">       9 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      10 </span>                : // any later version.
-<span class="lineNum">      11 </span>                : 
-<span class="lineNum">      12 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      13 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      14 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      15 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      16 </span>                : 
-<span class="lineNum">      17 </span>                : // You should have received a copy of the GNU General Public License along
-<span class="lineNum">      18 </span>                : // with this library; see the file COPYING.  If not, write to the Free
-<span class="lineNum">      19 </span>                : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-<span class="lineNum">      20 </span>                : // USA.
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      23 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      24 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      25 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      26 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      27 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      28 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      29 </span>                : // the GNU General Public License.
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : /*
-<span class="lineNum">      32 </span>                :  *
-<span class="lineNum">      33 </span>                :  * Copyright (c) 1994
-<span class="lineNum">      34 </span>                :  * Hewlett-Packard Company
-<span class="lineNum">      35 </span>                :  *
-<span class="lineNum">      36 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      37 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      38 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      39 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      40 </span>                :  * in supporting documentation.  Hewlett-Packard Company makes no
-<span class="lineNum">      41 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      42 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      43 </span>                :  *
-<span class="lineNum">      44 </span>                :  *
-<span class="lineNum">      45 </span>                :  * Copyright (c) 1997
-<span class="lineNum">      46 </span>                :  * Silicon Graphics Computer Systems, Inc.
-<span class="lineNum">      47 </span>                :  *
-<span class="lineNum">      48 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      49 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      50 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      51 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      52 </span>                :  * in supporting documentation.  Silicon Graphics makes no
-<span class="lineNum">      53 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      54 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      55 </span>                :  */
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span>                : /** @file deque.tcc
-<span class="lineNum">      58 </span>                :  *  This is an internal header file, included by other library headers.
-<span class="lineNum">      59 </span>                :  *  You should not attempt to use it directly.
-<span class="lineNum">      60 </span>                :  */
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span>                : #ifndef _DEQUE_TCC
-<span class="lineNum">      63 </span>                : #define _DEQUE_TCC 1
-<span class="lineNum">      64 </span>                : 
-<span class="lineNum">      65 </span>                : _GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D)
-<span class="lineNum">      66 </span>                : 
-<span class="lineNum">      67 </span>                :   template &lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">      68 </span>                :     deque&lt;_Tp, _Alloc&gt;&amp;
-<span class="lineNum">      69 </span>                :     deque&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">      70 </span><span class="lineCov">              4 :     operator=(const deque&amp; __x)</span>
-<span class="lineNum">      71 </span>                :     {
-<span class="lineNum">      72 </span><span class="lineCov">              4 :       const size_type __len = size();</span>
-<span class="lineNum">      73 </span><span class="lineCov">              4 :       if (&amp;__x != this)</span>
-<span class="lineNum">      74 </span>                :         {
-<span class="lineNum">      75 </span><span class="lineCov">              4 :           if (__len &gt;= __x.size())</span>
-<span class="lineNum">      76 </span><span class="lineCov">              4 :             _M_erase_at_end(std::copy(__x.begin(), __x.end(),</span>
-<span class="lineNum">      77 </span>                :                                       this-&gt;_M_impl._M_start));
-<span class="lineNum">      78 </span>                :           else
-<span class="lineNum">      79 </span>                :             {
-<span class="lineNum">      80 </span><span class="lineNoCov">              0 :               const_iterator __mid = __x.begin() + difference_type(__len);</span>
-<span class="lineNum">      81 </span><span class="lineNoCov">              0 :               std::copy(__x.begin(), __mid, this-&gt;_M_impl._M_start);</span>
-<span class="lineNum">      82 </span><span class="lineNoCov">              0 :               insert(this-&gt;_M_impl._M_finish, __mid, __x.end());</span>
-<span class="lineNum">      83 </span>                :             }
-<span class="lineNum">      84 </span>                :         }
-<span class="lineNum">      85 </span><span class="lineCov">              4 :       return *this;</span>
-<span class="lineNum">      86 </span>                :     }
-<span class="lineNum">      87 </span>                : 
-<span class="lineNum">      88 </span>                :   template &lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">      89 </span>                :     typename deque&lt;_Tp, _Alloc&gt;::iterator
-<span class="lineNum">      90 </span>                :     deque&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">      91 </span>                :     insert(iterator __position, const value_type&amp; __x)
-<span class="lineNum">      92 </span>                :     {
-<span class="lineNum">      93 </span>                :       if (__position._M_cur == this-&gt;_M_impl._M_start._M_cur)
-<span class="lineNum">      94 </span>                :         {
-<span class="lineNum">      95 </span>                :           push_front(__x);
-<span class="lineNum">      96 </span>                :           return this-&gt;_M_impl._M_start;
-<span class="lineNum">      97 </span>                :         }
-<span class="lineNum">      98 </span>                :       else if (__position._M_cur == this-&gt;_M_impl._M_finish._M_cur)
-<span class="lineNum">      99 </span>                :         {
-<span class="lineNum">     100 </span>                :           push_back(__x);
-<span class="lineNum">     101 </span>                :           iterator __tmp = this-&gt;_M_impl._M_finish;
-<span class="lineNum">     102 </span>                :           --__tmp;
-<span class="lineNum">     103 </span>                :           return __tmp;
-<span class="lineNum">     104 </span>                :         }
-<span class="lineNum">     105 </span>                :       else
-<span class="lineNum">     106 </span>                :         return _M_insert_aux(__position, __x);
-<span class="lineNum">     107 </span>                :     }
-<span class="lineNum">     108 </span>                : 
-<span class="lineNum">     109 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     110 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     111 </span>                :     template&lt;typename... _Args&gt;
-<span class="lineNum">     112 </span>                :       typename deque&lt;_Tp, _Alloc&gt;::iterator
-<span class="lineNum">     113 </span>                :       deque&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     114 </span>                :       emplace(iterator __position, _Args&amp;&amp;... __args)
-<span class="lineNum">     115 </span>                :       {
-<span class="lineNum">     116 </span>                :         if (__position._M_cur == this-&gt;_M_impl._M_start._M_cur)
-<span class="lineNum">     117 </span>                :           {
-<span class="lineNum">     118 </span>                :             push_front(std::forward&lt;_Args&gt;(__args)...);
-<span class="lineNum">     119 </span>                :             return this-&gt;_M_impl._M_start;
-<span class="lineNum">     120 </span>                :           }
-<span class="lineNum">     121 </span>                :         else if (__position._M_cur == this-&gt;_M_impl._M_finish._M_cur)
-<span class="lineNum">     122 </span>                :           {
-<span class="lineNum">     123 </span>                :             push_back(std::forward&lt;_Args&gt;(__args)...);
-<span class="lineNum">     124 </span>                :             iterator __tmp = this-&gt;_M_impl._M_finish;
-<span class="lineNum">     125 </span>                :             --__tmp;
-<span class="lineNum">     126 </span>                :             return __tmp;
-<span class="lineNum">     127 </span>                :           }
-<span class="lineNum">     128 </span>                :         else
-<span class="lineNum">     129 </span>                :           return _M_insert_aux(__position, std::forward&lt;_Args&gt;(__args)...);
-<span class="lineNum">     130 </span>                :       }
-<span class="lineNum">     131 </span>                : #endif
-<span class="lineNum">     132 </span>                : 
-<span class="lineNum">     133 </span>                :   template &lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     134 </span>                :     typename deque&lt;_Tp, _Alloc&gt;::iterator
-<span class="lineNum">     135 </span>                :     deque&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     136 </span>                :     erase(iterator __position)
-<span class="lineNum">     137 </span>                :     {
-<span class="lineNum">     138 </span>                :       iterator __next = __position;
-<span class="lineNum">     139 </span>                :       ++__next;
-<span class="lineNum">     140 </span>                :       const difference_type __index = __position - begin();
-<span class="lineNum">     141 </span>                :       if (static_cast&lt;size_type&gt;(__index) &lt; (size() &gt;&gt; 1))
-<span class="lineNum">     142 </span>                :         {
-<span class="lineNum">     143 </span>                :           if (__position != begin())
-<span class="lineNum">     144 </span>                :             _GLIBCXX_MOVE_BACKWARD3(begin(), __position, __next);
-<span class="lineNum">     145 </span>                :           pop_front();
-<span class="lineNum">     146 </span>                :         }
-<span class="lineNum">     147 </span>                :       else
-<span class="lineNum">     148 </span>                :         {
-<span class="lineNum">     149 </span>                :           if (__next != end())
-<span class="lineNum">     150 </span>                :             _GLIBCXX_MOVE3(__next, end(), __position);
-<span class="lineNum">     151 </span>                :           pop_back();
-<span class="lineNum">     152 </span>                :         }
-<span class="lineNum">     153 </span>                :       return begin() + __index;
-<span class="lineNum">     154 </span>                :     }
-<span class="lineNum">     155 </span>                : 
-<span class="lineNum">     156 </span>                :   template &lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     157 </span>                :     typename deque&lt;_Tp, _Alloc&gt;::iterator
-<span class="lineNum">     158 </span>                :     deque&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     159 </span><span class="lineCov">           1012 :     erase(iterator __first, iterator __last)</span>
-<span class="lineNum">     160 </span>                :     {
-<span class="lineNum">     161 </span><span class="lineCov">           1012 :       if (__first == begin() &amp;&amp; __last == end())</span>
-<span class="lineNum">     162 </span>                :         {
-<span class="lineNum">     163 </span><span class="lineCov">            922 :           clear();</span>
-<span class="lineNum">     164 </span><span class="lineCov">            922 :           return end();</span>
-<span class="lineNum">     165 </span>                :         }
-<span class="lineNum">     166 </span>                :       else
-<span class="lineNum">     167 </span>                :         {
-<span class="lineNum">     168 </span><span class="lineCov">             90 :           const difference_type __n = __last - __first;</span>
-<span class="lineNum">     169 </span><span class="lineCov">             90 :           const difference_type __elems_before = __first - begin();</span>
-<span class="lineNum">     170 </span><span class="lineCov">             90 :           if (static_cast&lt;size_type&gt;(__elems_before) &lt;= (size() - __n) / 2)</span>
-<span class="lineNum">     171 </span>                :             {
-<span class="lineNum">     172 </span><span class="lineCov">             90 :               if (__first != begin())</span>
-<span class="lineNum">     173 </span><span class="lineNoCov">              0 :                 _GLIBCXX_MOVE_BACKWARD3(begin(), __first, __last);</span>
-<span class="lineNum">     174 </span><span class="lineCov">             90 :               _M_erase_at_begin(begin() + __n);</span>
-<span class="lineNum">     175 </span>                :             }
-<span class="lineNum">     176 </span>                :           else
-<span class="lineNum">     177 </span>                :             {
-<span class="lineNum">     178 </span><span class="lineNoCov">              0 :               if (__last != end())</span>
-<span class="lineNum">     179 </span><span class="lineNoCov">              0 :                 _GLIBCXX_MOVE3(__last, end(), __first);</span>
-<span class="lineNum">     180 </span><span class="lineNoCov">              0 :               _M_erase_at_end(end() - __n);</span>
-<span class="lineNum">     181 </span>                :             }
-<span class="lineNum">     182 </span><span class="lineCov">             90 :           return begin() + __elems_before;</span>
-<span class="lineNum">     183 </span>                :         }
-<span class="lineNum">     184 </span>                :     }
-<span class="lineNum">     185 </span>                : 
-<span class="lineNum">     186 </span>                :   template &lt;typename _Tp, class _Alloc&gt;
-<span class="lineNum">     187 </span>                :     template &lt;typename _InputIterator&gt;
-<span class="lineNum">     188 </span>                :       void
-<span class="lineNum">     189 </span>                :       deque&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     190 </span>                :       _M_assign_aux(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">     191 </span>                :                     std::input_iterator_tag)
-<span class="lineNum">     192 </span>                :       {
-<span class="lineNum">     193 </span>                :         iterator __cur = begin();
-<span class="lineNum">     194 </span>                :         for (; __first != __last &amp;&amp; __cur != end(); ++__cur, ++__first)
-<span class="lineNum">     195 </span>                :           *__cur = *__first;
-<span class="lineNum">     196 </span>                :         if (__first == __last)
-<span class="lineNum">     197 </span>                :           _M_erase_at_end(__cur);
-<span class="lineNum">     198 </span>                :         else
-<span class="lineNum">     199 </span>                :           insert(end(), __first, __last);
-<span class="lineNum">     200 </span>                :       }
-<span class="lineNum">     201 </span>                : 
-<span class="lineNum">     202 </span>                :   template &lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     203 </span>                :     void
-<span class="lineNum">     204 </span>                :     deque&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     205 </span>                :     _M_fill_insert(iterator __pos, size_type __n, const value_type&amp; __x)
-<span class="lineNum">     206 </span>                :     {
-<span class="lineNum">     207 </span>                :       if (__pos._M_cur == this-&gt;_M_impl._M_start._M_cur)
-<span class="lineNum">     208 </span>                :         {
-<span class="lineNum">     209 </span>                :           iterator __new_start = _M_reserve_elements_at_front(__n);
-<span class="lineNum">     210 </span>                :           try
-<span class="lineNum">     211 </span>                :             {
-<span class="lineNum">     212 </span>                :               std::__uninitialized_fill_a(__new_start, this-&gt;_M_impl._M_start,
-<span class="lineNum">     213 </span>                :                                           __x, _M_get_Tp_allocator());
-<span class="lineNum">     214 </span>                :               this-&gt;_M_impl._M_start = __new_start;
-<span class="lineNum">     215 </span>                :             }
-<span class="lineNum">     216 </span>                :           catch(...)
-<span class="lineNum">     217 </span>                :             {
-<span class="lineNum">     218 </span>                :               _M_destroy_nodes(__new_start._M_node,
-<span class="lineNum">     219 </span>                :                                this-&gt;_M_impl._M_start._M_node);
-<span class="lineNum">     220 </span>                :               __throw_exception_again;
-<span class="lineNum">     221 </span>                :             }
-<span class="lineNum">     222 </span>                :         }
-<span class="lineNum">     223 </span>                :       else if (__pos._M_cur == this-&gt;_M_impl._M_finish._M_cur)
-<span class="lineNum">     224 </span>                :         {
-<span class="lineNum">     225 </span>                :           iterator __new_finish = _M_reserve_elements_at_back(__n);
-<span class="lineNum">     226 </span>                :           try
-<span class="lineNum">     227 </span>                :             {
-<span class="lineNum">     228 </span>                :               std::__uninitialized_fill_a(this-&gt;_M_impl._M_finish,
-<span class="lineNum">     229 </span>                :                                           __new_finish, __x,
-<span class="lineNum">     230 </span>                :                                           _M_get_Tp_allocator());
-<span class="lineNum">     231 </span>                :               this-&gt;_M_impl._M_finish = __new_finish;
-<span class="lineNum">     232 </span>                :             }
-<span class="lineNum">     233 </span>                :           catch(...)
-<span class="lineNum">     234 </span>                :             {
-<span class="lineNum">     235 </span>                :               _M_destroy_nodes(this-&gt;_M_impl._M_finish._M_node + 1,
-<span class="lineNum">     236 </span>                :                                __new_finish._M_node + 1);
-<span class="lineNum">     237 </span>                :               __throw_exception_again;
-<span class="lineNum">     238 </span>                :             }
-<span class="lineNum">     239 </span>                :         }
-<span class="lineNum">     240 </span>                :       else
-<span class="lineNum">     241 </span>                :         _M_insert_aux(__pos, __n, __x);
-<span class="lineNum">     242 </span>                :     }
-<span class="lineNum">     243 </span>                : 
-<span class="lineNum">     244 </span>                :   template &lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     245 </span>                :     void
-<span class="lineNum">     246 </span>                :     deque&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     247 </span>                :     _M_fill_initialize(const value_type&amp; __value)
-<span class="lineNum">     248 </span>                :     {
-<span class="lineNum">     249 </span>                :       _Map_pointer __cur;
-<span class="lineNum">     250 </span>                :       try
-<span class="lineNum">     251 </span>                :         {
-<span class="lineNum">     252 </span>                :           for (__cur = this-&gt;_M_impl._M_start._M_node;
-<span class="lineNum">     253 </span>                :                __cur &lt; this-&gt;_M_impl._M_finish._M_node;
-<span class="lineNum">     254 </span>                :                ++__cur)
-<span class="lineNum">     255 </span>                :             std::__uninitialized_fill_a(*__cur, *__cur + _S_buffer_size(),
-<span class="lineNum">     256 </span>                :                                         __value, _M_get_Tp_allocator());
-<span class="lineNum">     257 </span>                :           std::__uninitialized_fill_a(this-&gt;_M_impl._M_finish._M_first,
-<span class="lineNum">     258 </span>                :                                       this-&gt;_M_impl._M_finish._M_cur,
-<span class="lineNum">     259 </span>                :                                       __value, _M_get_Tp_allocator());
-<span class="lineNum">     260 </span>                :         }
-<span class="lineNum">     261 </span>                :       catch(...)
-<span class="lineNum">     262 </span>                :         {
-<span class="lineNum">     263 </span>                :           std::_Destroy(this-&gt;_M_impl._M_start, iterator(*__cur, __cur),
-<span class="lineNum">     264 </span>                :                         _M_get_Tp_allocator());
-<span class="lineNum">     265 </span>                :           __throw_exception_again;
-<span class="lineNum">     266 </span>                :         }
-<span class="lineNum">     267 </span>                :     }
-<span class="lineNum">     268 </span>                : 
-<span class="lineNum">     269 </span>                :   template &lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     270 </span>                :     template &lt;typename _InputIterator&gt;
-<span class="lineNum">     271 </span>                :       void
-<span class="lineNum">     272 </span>                :       deque&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     273 </span>                :       _M_range_initialize(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">     274 </span>                :                           std::input_iterator_tag)
-<span class="lineNum">     275 </span>                :       {
-<span class="lineNum">     276 </span>                :         this-&gt;_M_initialize_map(0);
-<span class="lineNum">     277 </span>                :         try
-<span class="lineNum">     278 </span>                :           {
-<span class="lineNum">     279 </span>                :             for (; __first != __last; ++__first)
-<span class="lineNum">     280 </span>                :               push_back(*__first);
-<span class="lineNum">     281 </span>                :           }
-<span class="lineNum">     282 </span>                :         catch(...)
-<span class="lineNum">     283 </span>                :           {
-<span class="lineNum">     284 </span>                :             clear();
-<span class="lineNum">     285 </span>                :             __throw_exception_again;
-<span class="lineNum">     286 </span>                :           }
-<span class="lineNum">     287 </span>                :       }
-<span class="lineNum">     288 </span>                : 
-<span class="lineNum">     289 </span>                :   template &lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     290 </span>                :     template &lt;typename _ForwardIterator&gt;
-<span class="lineNum">     291 </span>                :       void
-<span class="lineNum">     292 </span>                :       deque&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     293 </span>                :       _M_range_initialize(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">     294 </span>                :                           std::forward_iterator_tag)
-<span class="lineNum">     295 </span>                :       {
-<span class="lineNum">     296 </span>                :         const size_type __n = std::distance(__first, __last);
-<span class="lineNum">     297 </span>                :         this-&gt;_M_initialize_map(__n);
-<span class="lineNum">     298 </span>                : 
-<span class="lineNum">     299 </span>                :         _Map_pointer __cur_node;
-<span class="lineNum">     300 </span>                :         try
-<span class="lineNum">     301 </span>                :           {
-<span class="lineNum">     302 </span>                :             for (__cur_node = this-&gt;_M_impl._M_start._M_node;
-<span class="lineNum">     303 </span>                :                  __cur_node &lt; this-&gt;_M_impl._M_finish._M_node;
-<span class="lineNum">     304 </span>                :                  ++__cur_node)
-<span class="lineNum">     305 </span>                :               {
-<span class="lineNum">     306 </span>                :                 _ForwardIterator __mid = __first;
-<span class="lineNum">     307 </span>                :                 std::advance(__mid, _S_buffer_size());
-<span class="lineNum">     308 </span>                :                 std::__uninitialized_copy_a(__first, __mid, *__cur_node,
-<span class="lineNum">     309 </span>                :                                             _M_get_Tp_allocator());
-<span class="lineNum">     310 </span>                :                 __first = __mid;
-<span class="lineNum">     311 </span>                :               }
-<span class="lineNum">     312 </span>                :             std::__uninitialized_copy_a(__first, __last,
-<span class="lineNum">     313 </span>                :                                         this-&gt;_M_impl._M_finish._M_first,
-<span class="lineNum">     314 </span>                :                                         _M_get_Tp_allocator());
-<span class="lineNum">     315 </span>                :           }
-<span class="lineNum">     316 </span>                :         catch(...)
-<span class="lineNum">     317 </span>                :           {
-<span class="lineNum">     318 </span>                :             std::_Destroy(this-&gt;_M_impl._M_start,
-<span class="lineNum">     319 </span>                :                           iterator(*__cur_node, __cur_node),
-<span class="lineNum">     320 </span>                :                           _M_get_Tp_allocator());
-<span class="lineNum">     321 </span>                :             __throw_exception_again;
-<span class="lineNum">     322 </span>                :           }
-<span class="lineNum">     323 </span>                :       }
-<span class="lineNum">     324 </span>                : 
-<span class="lineNum">     325 </span>                :   // Called only if _M_impl._M_finish._M_cur == _M_impl._M_finish._M_last - 1.
-<span class="lineNum">     326 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     327 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     328 </span>                :     template&lt;typename... _Args&gt;
-<span class="lineNum">     329 </span>                :       void
-<span class="lineNum">     330 </span>                :       deque&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     331 </span>                :       _M_push_back_aux(_Args&amp;&amp;... __args)
-<span class="lineNum">     332 </span>                : #else
-<span class="lineNum">     333 </span>                :       void
-<span class="lineNum">     334 </span>                :       deque&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     335 </span><span class="lineCov">             13 :       _M_push_back_aux(const value_type&amp; __t)</span>
-<span class="lineNum">     336 </span>                : #endif
-<span class="lineNum">     337 </span>                :       {
-<span class="lineNum">     338 </span><span class="lineCov">             13 :         _M_reserve_map_at_back();</span>
-<span class="lineNum">     339 </span><span class="lineCov">             13 :         *(this-&gt;_M_impl._M_finish._M_node + 1) = this-&gt;_M_allocate_node();</span>
-<span class="lineNum">     340 </span>                :         try
-<span class="lineNum">     341 </span>                :           {
-<span class="lineNum">     342 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     343 </span>                :             this-&gt;_M_impl.construct(this-&gt;_M_impl._M_finish._M_cur,
-<span class="lineNum">     344 </span>                :                                     std::forward&lt;_Args&gt;(__args)...);
-<span class="lineNum">     345 </span>                : #else
-<span class="lineNum">     346 </span><span class="lineCov">             13 :             this-&gt;_M_impl.construct(this-&gt;_M_impl._M_finish._M_cur, __t);</span>
-<span class="lineNum">     347 </span>                : #endif
-<span class="lineNum">     348 </span><span class="lineCov">             13 :             this-&gt;_M_impl._M_finish._M_set_node(this-&gt;_M_impl._M_finish._M_node</span>
-<span class="lineNum">     349 </span>                :                                                 + 1);
-<span class="lineNum">     350 </span><span class="lineCov">             13 :             this-&gt;_M_impl._M_finish._M_cur = this-&gt;_M_impl._M_finish._M_first;</span>
-<span class="lineNum">     351 </span>                :           }
-<span class="lineNum">     352 </span><span class="lineNoCov">              0 :         catch(...)</span>
-<span class="lineNum">     353 </span>                :           {
-<span class="lineNum">     354 </span><span class="lineNoCov">              0 :             _M_deallocate_node(*(this-&gt;_M_impl._M_finish._M_node + 1));</span>
-<span class="lineNum">     355 </span><span class="lineNoCov">              0 :             __throw_exception_again;</span>
-<span class="lineNum">     356 </span>                :           }
-<span class="lineNum">     357 </span><span class="lineCov">             13 :       }</span>
-<span class="lineNum">     358 </span>                : 
-<span class="lineNum">     359 </span>                :   // Called only if _M_impl._M_start._M_cur == _M_impl._M_start._M_first.
-<span class="lineNum">     360 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     361 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     362 </span>                :     template&lt;typename... _Args&gt;
-<span class="lineNum">     363 </span>                :       void
-<span class="lineNum">     364 </span>                :       deque&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     365 </span>                :       _M_push_front_aux(_Args&amp;&amp;... __args)
-<span class="lineNum">     366 </span>                : #else
-<span class="lineNum">     367 </span>                :       void
-<span class="lineNum">     368 </span>                :       deque&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     369 </span>                :       _M_push_front_aux(const value_type&amp; __t)
-<span class="lineNum">     370 </span>                : #endif
-<span class="lineNum">     371 </span>                :       {
-<span class="lineNum">     372 </span>                :         _M_reserve_map_at_front();
-<span class="lineNum">     373 </span>                :         *(this-&gt;_M_impl._M_start._M_node - 1) = this-&gt;_M_allocate_node();
-<span class="lineNum">     374 </span>                :         try
-<span class="lineNum">     375 </span>                :           {
-<span class="lineNum">     376 </span>                :             this-&gt;_M_impl._M_start._M_set_node(this-&gt;_M_impl._M_start._M_node
-<span class="lineNum">     377 </span>                :                                                - 1);
-<span class="lineNum">     378 </span>                :             this-&gt;_M_impl._M_start._M_cur = this-&gt;_M_impl._M_start._M_last - 1;
-<span class="lineNum">     379 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     380 </span>                :             this-&gt;_M_impl.construct(this-&gt;_M_impl._M_start._M_cur,
-<span class="lineNum">     381 </span>                :                                     std::forward&lt;_Args&gt;(__args)...);
-<span class="lineNum">     382 </span>                : #else
-<span class="lineNum">     383 </span>                :             this-&gt;_M_impl.construct(this-&gt;_M_impl._M_start._M_cur, __t);
-<span class="lineNum">     384 </span>                : #endif
-<span class="lineNum">     385 </span>                :           }
-<span class="lineNum">     386 </span>                :         catch(...)
-<span class="lineNum">     387 </span>                :           {
-<span class="lineNum">     388 </span>                :             ++this-&gt;_M_impl._M_start;
-<span class="lineNum">     389 </span>                :             _M_deallocate_node(*(this-&gt;_M_impl._M_start._M_node - 1));
-<span class="lineNum">     390 </span>                :             __throw_exception_again;
-<span class="lineNum">     391 </span>                :           }
-<span class="lineNum">     392 </span>                :       }
-<span class="lineNum">     393 </span>                : 
-<span class="lineNum">     394 </span>                :   // Called only if _M_impl._M_finish._M_cur == _M_impl._M_finish._M_first.
-<span class="lineNum">     395 </span>                :   template &lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     396 </span>                :     void deque&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     397 </span><span class="lineNoCov">              0 :     _M_pop_back_aux()</span>
-<span class="lineNum">     398 </span>                :     {
-<span class="lineNum">     399 </span><span class="lineNoCov">              0 :       _M_deallocate_node(this-&gt;_M_impl._M_finish._M_first);</span>
-<span class="lineNum">     400 </span><span class="lineNoCov">              0 :       this-&gt;_M_impl._M_finish._M_set_node(this-&gt;_M_impl._M_finish._M_node - 1);</span>
-<span class="lineNum">     401 </span><span class="lineNoCov">              0 :       this-&gt;_M_impl._M_finish._M_cur = this-&gt;_M_impl._M_finish._M_last - 1;</span>
-<span class="lineNum">     402 </span><span class="lineNoCov">              0 :       this-&gt;_M_impl.destroy(this-&gt;_M_impl._M_finish._M_cur);</span>
-<span class="lineNum">     403 </span><span class="lineNoCov">              0 :     }</span>
-<span class="lineNum">     404 </span>                : 
-<span class="lineNum">     405 </span>                :   // Called only if _M_impl._M_start._M_cur == _M_impl._M_start._M_last - 1.
-<span class="lineNum">     406 </span>                :   // Note that if the deque has at least one element (a precondition for this
-<span class="lineNum">     407 </span>                :   // member function), and if
-<span class="lineNum">     408 </span>                :   //   _M_impl._M_start._M_cur == _M_impl._M_start._M_last,
-<span class="lineNum">     409 </span>                :   // then the deque must have at least two nodes.
-<span class="lineNum">     410 </span>                :   template &lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     411 </span>                :     void deque&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     412 </span>                :     _M_pop_front_aux()
-<span class="lineNum">     413 </span>                :     {
-<span class="lineNum">     414 </span>                :       this-&gt;_M_impl.destroy(this-&gt;_M_impl._M_start._M_cur);
-<span class="lineNum">     415 </span>                :       _M_deallocate_node(this-&gt;_M_impl._M_start._M_first);
-<span class="lineNum">     416 </span>                :       this-&gt;_M_impl._M_start._M_set_node(this-&gt;_M_impl._M_start._M_node + 1);
-<span class="lineNum">     417 </span>                :       this-&gt;_M_impl._M_start._M_cur = this-&gt;_M_impl._M_start._M_first;
-<span class="lineNum">     418 </span>                :     }
-<span class="lineNum">     419 </span>                : 
-<span class="lineNum">     420 </span>                :   template &lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     421 </span>                :     template &lt;typename _InputIterator&gt;
-<span class="lineNum">     422 </span>                :       void
-<span class="lineNum">     423 </span>                :       deque&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     424 </span>                :       _M_range_insert_aux(iterator __pos,
-<span class="lineNum">     425 </span>                :                           _InputIterator __first, _InputIterator __last,
-<span class="lineNum">     426 </span>                :                           std::input_iterator_tag)
-<span class="lineNum">     427 </span>                :       { std::copy(__first, __last, std::inserter(*this, __pos)); }
-<span class="lineNum">     428 </span>                : 
-<span class="lineNum">     429 </span>                :   template &lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     430 </span>                :     template &lt;typename _ForwardIterator&gt;
-<span class="lineNum">     431 </span>                :       void
-<span class="lineNum">     432 </span>                :       deque&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     433 </span>                :       _M_range_insert_aux(iterator __pos,
-<span class="lineNum">     434 </span>                :                           _ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">     435 </span><span class="lineNoCov">              0 :                           std::forward_iterator_tag)</span>
-<span class="lineNum">     436 </span>                :       {
-<span class="lineNum">     437 </span><span class="lineNoCov">              0 :         const size_type __n = std::distance(__first, __last);</span>
-<span class="lineNum">     438 </span><span class="lineNoCov">              0 :         if (__pos._M_cur == this-&gt;_M_impl._M_start._M_cur)</span>
-<span class="lineNum">     439 </span>                :           {
-<span class="lineNum">     440 </span><span class="lineNoCov">              0 :             iterator __new_start = _M_reserve_elements_at_front(__n);</span>
-<span class="lineNum">     441 </span>                :             try
-<span class="lineNum">     442 </span>                :               {
-<span class="lineNum">     443 </span><span class="lineNoCov">              0 :                 std::__uninitialized_copy_a(__first, __last, __new_start,</span>
-<span class="lineNum">     444 </span>                :                                             _M_get_Tp_allocator());
-<span class="lineNum">     445 </span><span class="lineNoCov">              0 :                 this-&gt;_M_impl._M_start = __new_start;</span>
-<span class="lineNum">     446 </span>                :               }
-<span class="lineNum">     447 </span><span class="lineNoCov">              0 :             catch(...)</span>
-<span class="lineNum">     448 </span>                :               {
-<span class="lineNum">     449 </span><span class="lineNoCov">              0 :                 _M_destroy_nodes(__new_start._M_node,</span>
-<span class="lineNum">     450 </span>                :                                  this-&gt;_M_impl._M_start._M_node);
-<span class="lineNum">     451 </span><span class="lineNoCov">              0 :                 __throw_exception_again;</span>
-<span class="lineNum">     452 </span>                :               }
-<span class="lineNum">     453 </span>                :           }
-<span class="lineNum">     454 </span><span class="lineNoCov">              0 :         else if (__pos._M_cur == this-&gt;_M_impl._M_finish._M_cur)</span>
-<span class="lineNum">     455 </span>                :           {
-<span class="lineNum">     456 </span><span class="lineNoCov">              0 :             iterator __new_finish = _M_reserve_elements_at_back(__n);</span>
-<span class="lineNum">     457 </span>                :             try
-<span class="lineNum">     458 </span>                :               {
-<span class="lineNum">     459 </span><span class="lineNoCov">              0 :                 std::__uninitialized_copy_a(__first, __last,</span>
-<span class="lineNum">     460 </span>                :                                             this-&gt;_M_impl._M_finish,
-<span class="lineNum">     461 </span>                :                                             _M_get_Tp_allocator());
-<span class="lineNum">     462 </span><span class="lineNoCov">              0 :                 this-&gt;_M_impl._M_finish = __new_finish;</span>
-<span class="lineNum">     463 </span>                :               }
-<span class="lineNum">     464 </span><span class="lineNoCov">              0 :             catch(...)</span>
-<span class="lineNum">     465 </span>                :               {
-<span class="lineNum">     466 </span><span class="lineNoCov">              0 :                 _M_destroy_nodes(this-&gt;_M_impl._M_finish._M_node + 1,</span>
-<span class="lineNum">     467 </span>                :                                  __new_finish._M_node + 1);
-<span class="lineNum">     468 </span><span class="lineNoCov">              0 :                 __throw_exception_again;</span>
-<span class="lineNum">     469 </span>                :               }
-<span class="lineNum">     470 </span>                :           }
-<span class="lineNum">     471 </span>                :         else
-<span class="lineNum">     472 </span><span class="lineNoCov">              0 :           _M_insert_aux(__pos, __first, __last, __n);</span>
-<span class="lineNum">     473 </span><span class="lineNoCov">              0 :       }</span>
-<span class="lineNum">     474 </span>                : 
-<span class="lineNum">     475 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     476 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     477 </span>                :     template&lt;typename... _Args&gt;
-<span class="lineNum">     478 </span>                :       typename deque&lt;_Tp, _Alloc&gt;::iterator
-<span class="lineNum">     479 </span>                :       deque&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     480 </span>                :       _M_insert_aux(iterator __pos, _Args&amp;&amp;... __args)
-<span class="lineNum">     481 </span>                :       {
-<span class="lineNum">     482 </span>                :         value_type __x_copy(std::forward&lt;_Args&gt;(__args)...); // XXX copy
-<span class="lineNum">     483 </span>                : #else
-<span class="lineNum">     484 </span>                :     typename deque&lt;_Tp, _Alloc&gt;::iterator
-<span class="lineNum">     485 </span>                :       deque&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     486 </span>                :       _M_insert_aux(iterator __pos, const value_type&amp; __x)
-<span class="lineNum">     487 </span>                :       {
-<span class="lineNum">     488 </span>                :         value_type __x_copy = __x; // XXX copy
-<span class="lineNum">     489 </span>                : #endif
-<span class="lineNum">     490 </span>                :         difference_type __index = __pos - this-&gt;_M_impl._M_start;
-<span class="lineNum">     491 </span>                :         if (static_cast&lt;size_type&gt;(__index) &lt; size() / 2)
-<span class="lineNum">     492 </span>                :           {
-<span class="lineNum">     493 </span>                :             push_front(_GLIBCXX_MOVE(front()));
-<span class="lineNum">     494 </span>                :             iterator __front1 = this-&gt;_M_impl._M_start;
-<span class="lineNum">     495 </span>                :             ++__front1;
-<span class="lineNum">     496 </span>                :             iterator __front2 = __front1;
-<span class="lineNum">     497 </span>                :             ++__front2;
-<span class="lineNum">     498 </span>                :             __pos = this-&gt;_M_impl._M_start + __index;
-<span class="lineNum">     499 </span>                :             iterator __pos1 = __pos;
-<span class="lineNum">     500 </span>                :             ++__pos1;
-<span class="lineNum">     501 </span>                :             _GLIBCXX_MOVE3(__front2, __pos1, __front1);
-<span class="lineNum">     502 </span>                :           }
-<span class="lineNum">     503 </span>                :         else
-<span class="lineNum">     504 </span>                :           {
-<span class="lineNum">     505 </span>                :             push_back(_GLIBCXX_MOVE(back()));
-<span class="lineNum">     506 </span>                :             iterator __back1 = this-&gt;_M_impl._M_finish;
-<span class="lineNum">     507 </span>                :             --__back1;
-<span class="lineNum">     508 </span>                :             iterator __back2 = __back1;
-<span class="lineNum">     509 </span>                :             --__back2;
-<span class="lineNum">     510 </span>                :             __pos = this-&gt;_M_impl._M_start + __index;
-<span class="lineNum">     511 </span>                :             _GLIBCXX_MOVE_BACKWARD3(__pos, __back2, __back1);
-<span class="lineNum">     512 </span>                :           }
-<span class="lineNum">     513 </span>                :         *__pos = _GLIBCXX_MOVE(__x_copy);
-<span class="lineNum">     514 </span>                :         return __pos;
-<span class="lineNum">     515 </span>                :       }
-<span class="lineNum">     516 </span>                : 
-<span class="lineNum">     517 </span>                :   template &lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     518 </span>                :     void
-<span class="lineNum">     519 </span>                :     deque&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     520 </span>                :     _M_insert_aux(iterator __pos, size_type __n, const value_type&amp; __x)
-<span class="lineNum">     521 </span>                :     {
-<span class="lineNum">     522 </span>                :       const difference_type __elems_before = __pos - this-&gt;_M_impl._M_start;
-<span class="lineNum">     523 </span>                :       const size_type __length = this-&gt;size();
-<span class="lineNum">     524 </span>                :       value_type __x_copy = __x;
-<span class="lineNum">     525 </span>                :       if (__elems_before &lt; difference_type(__length / 2))
-<span class="lineNum">     526 </span>                :         {
-<span class="lineNum">     527 </span>                :           iterator __new_start = _M_reserve_elements_at_front(__n);
-<span class="lineNum">     528 </span>                :           iterator __old_start = this-&gt;_M_impl._M_start;
-<span class="lineNum">     529 </span>                :           __pos = this-&gt;_M_impl._M_start + __elems_before;
-<span class="lineNum">     530 </span>                :           try
-<span class="lineNum">     531 </span>                :             {
-<span class="lineNum">     532 </span>                :               if (__elems_before &gt;= difference_type(__n))
-<span class="lineNum">     533 </span>                :                 {
-<span class="lineNum">     534 </span>                :                   iterator __start_n = (this-&gt;_M_impl._M_start
-<span class="lineNum">     535 </span>                :                                         + difference_type(__n));
-<span class="lineNum">     536 </span>                :                   std::__uninitialized_move_a(this-&gt;_M_impl._M_start,
-<span class="lineNum">     537 </span>                :                                               __start_n, __new_start,
-<span class="lineNum">     538 </span>                :                                               _M_get_Tp_allocator());
-<span class="lineNum">     539 </span>                :                   this-&gt;_M_impl._M_start = __new_start;
-<span class="lineNum">     540 </span>                :                   _GLIBCXX_MOVE3(__start_n, __pos, __old_start);
-<span class="lineNum">     541 </span>                :                   std::fill(__pos - difference_type(__n), __pos, __x_copy);
-<span class="lineNum">     542 </span>                :                 }
-<span class="lineNum">     543 </span>                :               else
-<span class="lineNum">     544 </span>                :                 {
-<span class="lineNum">     545 </span>                :                   std::__uninitialized_move_fill(this-&gt;_M_impl._M_start,
-<span class="lineNum">     546 </span>                :                                                  __pos, __new_start,
-<span class="lineNum">     547 </span>                :                                                  this-&gt;_M_impl._M_start,
-<span class="lineNum">     548 </span>                :                                                  __x_copy,
-<span class="lineNum">     549 </span>                :                                                  _M_get_Tp_allocator());
-<span class="lineNum">     550 </span>                :                   this-&gt;_M_impl._M_start = __new_start;
-<span class="lineNum">     551 </span>                :                   std::fill(__old_start, __pos, __x_copy);
-<span class="lineNum">     552 </span>                :                 }
-<span class="lineNum">     553 </span>                :             }
-<span class="lineNum">     554 </span>                :           catch(...)
-<span class="lineNum">     555 </span>                :             {
-<span class="lineNum">     556 </span>                :               _M_destroy_nodes(__new_start._M_node,
-<span class="lineNum">     557 </span>                :                                this-&gt;_M_impl._M_start._M_node);
-<span class="lineNum">     558 </span>                :               __throw_exception_again;
-<span class="lineNum">     559 </span>                :             }
-<span class="lineNum">     560 </span>                :         }
-<span class="lineNum">     561 </span>                :       else
-<span class="lineNum">     562 </span>                :         {
-<span class="lineNum">     563 </span>                :           iterator __new_finish = _M_reserve_elements_at_back(__n);
-<span class="lineNum">     564 </span>                :           iterator __old_finish = this-&gt;_M_impl._M_finish;
-<span class="lineNum">     565 </span>                :           const difference_type __elems_after =
-<span class="lineNum">     566 </span>                :             difference_type(__length) - __elems_before;
-<span class="lineNum">     567 </span>                :           __pos = this-&gt;_M_impl._M_finish - __elems_after;
-<span class="lineNum">     568 </span>                :           try
-<span class="lineNum">     569 </span>                :             {
-<span class="lineNum">     570 </span>                :               if (__elems_after &gt; difference_type(__n))
-<span class="lineNum">     571 </span>                :                 {
-<span class="lineNum">     572 </span>                :                   iterator __finish_n = (this-&gt;_M_impl._M_finish
-<span class="lineNum">     573 </span>                :                                          - difference_type(__n));
-<span class="lineNum">     574 </span>                :                   std::__uninitialized_move_a(__finish_n,
-<span class="lineNum">     575 </span>                :                                               this-&gt;_M_impl._M_finish,
-<span class="lineNum">     576 </span>                :                                               this-&gt;_M_impl._M_finish,
-<span class="lineNum">     577 </span>                :                                               _M_get_Tp_allocator());
-<span class="lineNum">     578 </span>                :                   this-&gt;_M_impl._M_finish = __new_finish;
-<span class="lineNum">     579 </span>                :                   _GLIBCXX_MOVE_BACKWARD3(__pos, __finish_n, __old_finish);
-<span class="lineNum">     580 </span>                :                   std::fill(__pos, __pos + difference_type(__n), __x_copy);
-<span class="lineNum">     581 </span>                :                 }
-<span class="lineNum">     582 </span>                :               else
-<span class="lineNum">     583 </span>                :                 {
-<span class="lineNum">     584 </span>                :                   std::__uninitialized_fill_move(this-&gt;_M_impl._M_finish,
-<span class="lineNum">     585 </span>                :                                                  __pos + difference_type(__n),
-<span class="lineNum">     586 </span>                :                                                  __x_copy, __pos,
-<span class="lineNum">     587 </span>                :                                                  this-&gt;_M_impl._M_finish,
-<span class="lineNum">     588 </span>                :                                                  _M_get_Tp_allocator());
-<span class="lineNum">     589 </span>                :                   this-&gt;_M_impl._M_finish = __new_finish;
-<span class="lineNum">     590 </span>                :                   std::fill(__pos, __old_finish, __x_copy);
-<span class="lineNum">     591 </span>                :                 }
-<span class="lineNum">     592 </span>                :             }
-<span class="lineNum">     593 </span>                :           catch(...)
-<span class="lineNum">     594 </span>                :             {
-<span class="lineNum">     595 </span>                :               _M_destroy_nodes(this-&gt;_M_impl._M_finish._M_node + 1,
-<span class="lineNum">     596 </span>                :                                __new_finish._M_node + 1);
-<span class="lineNum">     597 </span>                :               __throw_exception_again;
-<span class="lineNum">     598 </span>                :             }
-<span class="lineNum">     599 </span>                :         }
-<span class="lineNum">     600 </span>                :     }
-<span class="lineNum">     601 </span>                : 
-<span class="lineNum">     602 </span>                :   template &lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     603 </span>                :     template &lt;typename _ForwardIterator&gt;
-<span class="lineNum">     604 </span>                :       void
-<span class="lineNum">     605 </span>                :       deque&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     606 </span>                :       _M_insert_aux(iterator __pos,
-<span class="lineNum">     607 </span>                :                     _ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">     608 </span><span class="lineNoCov">              0 :                     size_type __n)</span>
-<span class="lineNum">     609 </span>                :       {
-<span class="lineNum">     610 </span><span class="lineNoCov">              0 :         const difference_type __elemsbefore = __pos - this-&gt;_M_impl._M_start;</span>
-<span class="lineNum">     611 </span><span class="lineNoCov">              0 :         const size_type __length = size();</span>
-<span class="lineNum">     612 </span><span class="lineNoCov">              0 :         if (static_cast&lt;size_type&gt;(__elemsbefore) &lt; __length / 2)</span>
-<span class="lineNum">     613 </span>                :           {
-<span class="lineNum">     614 </span><span class="lineNoCov">              0 :             iterator __new_start = _M_reserve_elements_at_front(__n);</span>
-<span class="lineNum">     615 </span><span class="lineNoCov">              0 :             iterator __old_start = this-&gt;_M_impl._M_start;</span>
-<span class="lineNum">     616 </span><span class="lineNoCov">              0 :             __pos = this-&gt;_M_impl._M_start + __elemsbefore;</span>
-<span class="lineNum">     617 </span>                :             try
-<span class="lineNum">     618 </span>                :               {
-<span class="lineNum">     619 </span><span class="lineNoCov">              0 :                 if (__elemsbefore &gt;= difference_type(__n))</span>
-<span class="lineNum">     620 </span>                :                   {
-<span class="lineNum">     621 </span>                :                     iterator __start_n = (this-&gt;_M_impl._M_start
-<span class="lineNum">     622 </span><span class="lineNoCov">              0 :                                           + difference_type(__n));</span>
-<span class="lineNum">     623 </span><span class="lineNoCov">              0 :                     std::__uninitialized_move_a(this-&gt;_M_impl._M_start,</span>
-<span class="lineNum">     624 </span>                :                                                 __start_n, __new_start,
-<span class="lineNum">     625 </span>                :                                                 _M_get_Tp_allocator());
-<span class="lineNum">     626 </span><span class="lineNoCov">              0 :                     this-&gt;_M_impl._M_start = __new_start;</span>
-<span class="lineNum">     627 </span><span class="lineNoCov">              0 :                     _GLIBCXX_MOVE3(__start_n, __pos, __old_start);</span>
-<span class="lineNum">     628 </span><span class="lineNoCov">              0 :                     std::copy(__first, __last, __pos - difference_type(__n));</span>
-<span class="lineNum">     629 </span>                :                   }
-<span class="lineNum">     630 </span>                :                 else
-<span class="lineNum">     631 </span>                :                   {
-<span class="lineNum">     632 </span><span class="lineNoCov">              0 :                     _ForwardIterator __mid = __first;</span>
-<span class="lineNum">     633 </span><span class="lineNoCov">              0 :                     std::advance(__mid, difference_type(__n) - __elemsbefore);</span>
-<span class="lineNum">     634 </span><span class="lineNoCov">              0 :                     std::__uninitialized_move_copy(this-&gt;_M_impl._M_start,</span>
-<span class="lineNum">     635 </span>                :                                                    __pos, __first, __mid,
-<span class="lineNum">     636 </span>                :                                                    __new_start,
-<span class="lineNum">     637 </span>                :                                                    _M_get_Tp_allocator());
-<span class="lineNum">     638 </span><span class="lineNoCov">              0 :                     this-&gt;_M_impl._M_start = __new_start;</span>
-<span class="lineNum">     639 </span><span class="lineNoCov">              0 :                     std::copy(__mid, __last, __old_start);</span>
-<span class="lineNum">     640 </span>                :                   }
-<span class="lineNum">     641 </span>                :               }
-<span class="lineNum">     642 </span><span class="lineNoCov">              0 :             catch(...)</span>
-<span class="lineNum">     643 </span>                :               {
-<span class="lineNum">     644 </span><span class="lineNoCov">              0 :                 _M_destroy_nodes(__new_start._M_node,</span>
-<span class="lineNum">     645 </span>                :                                  this-&gt;_M_impl._M_start._M_node);
-<span class="lineNum">     646 </span><span class="lineNoCov">              0 :                 __throw_exception_again;</span>
-<span class="lineNum">     647 </span>                :               }
-<span class="lineNum">     648 </span>                :           }
-<span class="lineNum">     649 </span>                :         else
-<span class="lineNum">     650 </span>                :         {
-<span class="lineNum">     651 </span><span class="lineNoCov">              0 :           iterator __new_finish = _M_reserve_elements_at_back(__n);</span>
-<span class="lineNum">     652 </span><span class="lineNoCov">              0 :           iterator __old_finish = this-&gt;_M_impl._M_finish;</span>
-<span class="lineNum">     653 </span>                :           const difference_type __elemsafter =
-<span class="lineNum">     654 </span><span class="lineNoCov">              0 :             difference_type(__length) - __elemsbefore;</span>
-<span class="lineNum">     655 </span><span class="lineNoCov">              0 :           __pos = this-&gt;_M_impl._M_finish - __elemsafter;</span>
-<span class="lineNum">     656 </span>                :           try
-<span class="lineNum">     657 </span>                :             {
-<span class="lineNum">     658 </span><span class="lineNoCov">              0 :               if (__elemsafter &gt; difference_type(__n))</span>
-<span class="lineNum">     659 </span>                :                 {
-<span class="lineNum">     660 </span>                :                   iterator __finish_n = (this-&gt;_M_impl._M_finish
-<span class="lineNum">     661 </span><span class="lineNoCov">              0 :                                          - difference_type(__n));</span>
-<span class="lineNum">     662 </span><span class="lineNoCov">              0 :                   std::__uninitialized_move_a(__finish_n,</span>
-<span class="lineNum">     663 </span>                :                                               this-&gt;_M_impl._M_finish,
-<span class="lineNum">     664 </span>                :                                               this-&gt;_M_impl._M_finish,
-<span class="lineNum">     665 </span>                :                                               _M_get_Tp_allocator());
-<span class="lineNum">     666 </span><span class="lineNoCov">              0 :                   this-&gt;_M_impl._M_finish = __new_finish;</span>
-<span class="lineNum">     667 </span><span class="lineNoCov">              0 :                   _GLIBCXX_MOVE_BACKWARD3(__pos, __finish_n, __old_finish);</span>
-<span class="lineNum">     668 </span><span class="lineNoCov">              0 :                   std::copy(__first, __last, __pos);</span>
-<span class="lineNum">     669 </span>                :                 }
-<span class="lineNum">     670 </span>                :               else
-<span class="lineNum">     671 </span>                :                 {
-<span class="lineNum">     672 </span><span class="lineNoCov">              0 :                   _ForwardIterator __mid = __first;</span>
-<span class="lineNum">     673 </span><span class="lineNoCov">              0 :                   std::advance(__mid, __elemsafter);</span>
-<span class="lineNum">     674 </span><span class="lineNoCov">              0 :                   std::__uninitialized_copy_move(__mid, __last, __pos,</span>
-<span class="lineNum">     675 </span>                :                                                  this-&gt;_M_impl._M_finish,
-<span class="lineNum">     676 </span>                :                                                  this-&gt;_M_impl._M_finish,
-<span class="lineNum">     677 </span>                :                                                  _M_get_Tp_allocator());
-<span class="lineNum">     678 </span><span class="lineNoCov">              0 :                   this-&gt;_M_impl._M_finish = __new_finish;</span>
-<span class="lineNum">     679 </span><span class="lineNoCov">              0 :                   std::copy(__first, __mid, __pos);</span>
-<span class="lineNum">     680 </span>                :                 }
-<span class="lineNum">     681 </span>                :             }
-<span class="lineNum">     682 </span><span class="lineNoCov">              0 :           catch(...)</span>
-<span class="lineNum">     683 </span>                :             {
-<span class="lineNum">     684 </span><span class="lineNoCov">              0 :               _M_destroy_nodes(this-&gt;_M_impl._M_finish._M_node + 1,</span>
-<span class="lineNum">     685 </span>                :                                __new_finish._M_node + 1);
-<span class="lineNum">     686 </span><span class="lineNoCov">              0 :               __throw_exception_again;</span>
-<span class="lineNum">     687 </span>                :             }
-<span class="lineNum">     688 </span>                :         }
-<span class="lineNum">     689 </span><span class="lineNoCov">              0 :       }</span>
-<span class="lineNum">     690 </span>                : 
-<span class="lineNum">     691 </span>                :    template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     692 </span>                :      void
-<span class="lineNum">     693 </span>                :      deque&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     694 </span><span class="lineCov">             26 :      _M_destroy_data_aux(iterator __first, iterator __last)</span>
-<span class="lineNum">     695 </span>                :      {
-<span class="lineNum">     696 </span><span class="lineCov">             26 :        for (_Map_pointer __node = __first._M_node + 1;</span>
-<span class="lineNum">     697 </span>                :             __node &lt; __last._M_node; ++__node)
-<span class="lineNum">     698 </span><span class="lineNoCov">              0 :          std::_Destroy(*__node, *__node + _S_buffer_size(),</span>
-<span class="lineNum">     699 </span>                :                        _M_get_Tp_allocator());
-<span class="lineNum">     700 </span>                : 
-<span class="lineNum">     701 </span><span class="lineCov">             26 :        if (__first._M_node != __last._M_node)</span>
-<span class="lineNum">     702 </span>                :          {
-<span class="lineNum">     703 </span><span class="lineNoCov">              0 :            std::_Destroy(__first._M_cur, __first._M_last,</span>
-<span class="lineNum">     704 </span>                :                          _M_get_Tp_allocator());
-<span class="lineNum">     705 </span><span class="lineNoCov">              0 :            std::_Destroy(__last._M_first, __last._M_cur,</span>
-<span class="lineNum">     706 </span>                :                          _M_get_Tp_allocator());
-<span class="lineNum">     707 </span>                :          }
-<span class="lineNum">     708 </span>                :        else
-<span class="lineNum">     709 </span><span class="lineCov">             26 :          std::_Destroy(__first._M_cur, __last._M_cur,</span>
-<span class="lineNum">     710 </span>                :                        _M_get_Tp_allocator());
-<span class="lineNum">     711 </span><span class="lineCov">             26 :      }</span>
-<span class="lineNum">     712 </span>                : 
-<span class="lineNum">     713 </span>                :   template &lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     714 </span>                :     void
-<span class="lineNum">     715 </span>                :     deque&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     716 </span><span class="lineNoCov">              0 :     _M_new_elements_at_front(size_type __new_elems)</span>
-<span class="lineNum">     717 </span>                :     {
-<span class="lineNum">     718 </span><span class="lineNoCov">              0 :       if (this-&gt;max_size() - this-&gt;size() &lt; __new_elems)</span>
-<span class="lineNum">     719 </span><span class="lineNoCov">              0 :         __throw_length_error(__N(&quot;deque::_M_new_elements_at_front&quot;));</span>
-<span class="lineNum">     720 </span>                : 
-<span class="lineNum">     721 </span>                :       const size_type __new_nodes = ((__new_elems + _S_buffer_size() - 1)
-<span class="lineNum">     722 </span><span class="lineNoCov">              0 :                                      / _S_buffer_size());</span>
-<span class="lineNum">     723 </span><span class="lineNoCov">              0 :       _M_reserve_map_at_front(__new_nodes);</span>
-<span class="lineNum">     724 </span>                :       size_type __i;
-<span class="lineNum">     725 </span>                :       try
-<span class="lineNum">     726 </span>                :         {
-<span class="lineNum">     727 </span><span class="lineNoCov">              0 :           for (__i = 1; __i &lt;= __new_nodes; ++__i)</span>
-<span class="lineNum">     728 </span><span class="lineNoCov">              0 :             *(this-&gt;_M_impl._M_start._M_node - __i) = this-&gt;_M_allocate_node();</span>
-<span class="lineNum">     729 </span>                :         }
-<span class="lineNum">     730 </span><span class="lineNoCov">              0 :       catch(...)</span>
-<span class="lineNum">     731 </span>                :         {
-<span class="lineNum">     732 </span><span class="lineNoCov">              0 :           for (size_type __j = 1; __j &lt; __i; ++__j)</span>
-<span class="lineNum">     733 </span><span class="lineNoCov">              0 :             _M_deallocate_node(*(this-&gt;_M_impl._M_start._M_node - __j));</span>
-<span class="lineNum">     734 </span><span class="lineNoCov">              0 :           __throw_exception_again;</span>
-<span class="lineNum">     735 </span>                :         }
-<span class="lineNum">     736 </span><span class="lineNoCov">              0 :     }</span>
-<span class="lineNum">     737 </span>                : 
-<span class="lineNum">     738 </span>                :   template &lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     739 </span>                :     void
-<span class="lineNum">     740 </span>                :     deque&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     741 </span><span class="lineNoCov">              0 :     _M_new_elements_at_back(size_type __new_elems)</span>
-<span class="lineNum">     742 </span>                :     {
-<span class="lineNum">     743 </span><span class="lineNoCov">              0 :       if (this-&gt;max_size() - this-&gt;size() &lt; __new_elems)</span>
-<span class="lineNum">     744 </span><span class="lineNoCov">              0 :         __throw_length_error(__N(&quot;deque::_M_new_elements_at_back&quot;));</span>
-<span class="lineNum">     745 </span>                : 
-<span class="lineNum">     746 </span>                :       const size_type __new_nodes = ((__new_elems + _S_buffer_size() - 1)
-<span class="lineNum">     747 </span><span class="lineNoCov">              0 :                                      / _S_buffer_size());</span>
-<span class="lineNum">     748 </span><span class="lineNoCov">              0 :       _M_reserve_map_at_back(__new_nodes);</span>
-<span class="lineNum">     749 </span>                :       size_type __i;
-<span class="lineNum">     750 </span>                :       try
-<span class="lineNum">     751 </span>                :         {
-<span class="lineNum">     752 </span><span class="lineNoCov">              0 :           for (__i = 1; __i &lt;= __new_nodes; ++__i)</span>
-<span class="lineNum">     753 </span><span class="lineNoCov">              0 :             *(this-&gt;_M_impl._M_finish._M_node + __i) = this-&gt;_M_allocate_node();</span>
-<span class="lineNum">     754 </span>                :         }
-<span class="lineNum">     755 </span><span class="lineNoCov">              0 :       catch(...)</span>
-<span class="lineNum">     756 </span>                :         {
-<span class="lineNum">     757 </span><span class="lineNoCov">              0 :           for (size_type __j = 1; __j &lt; __i; ++__j)</span>
-<span class="lineNum">     758 </span><span class="lineNoCov">              0 :             _M_deallocate_node(*(this-&gt;_M_impl._M_finish._M_node + __j));</span>
-<span class="lineNum">     759 </span><span class="lineNoCov">              0 :           __throw_exception_again;</span>
-<span class="lineNum">     760 </span>                :         }
-<span class="lineNum">     761 </span><span class="lineNoCov">              0 :     }</span>
-<span class="lineNum">     762 </span>                : 
-<span class="lineNum">     763 </span>                :   template &lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     764 </span>                :     void
-<span class="lineNum">     765 </span>                :     deque&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     766 </span><span class="lineNoCov">              0 :     _M_reallocate_map(size_type __nodes_to_add, bool __add_at_front)</span>
-<span class="lineNum">     767 </span>                :     {
-<span class="lineNum">     768 </span>                :       const size_type __old_num_nodes
-<span class="lineNum">     769 </span><span class="lineNoCov">              0 :         = this-&gt;_M_impl._M_finish._M_node - this-&gt;_M_impl._M_start._M_node + 1;</span>
-<span class="lineNum">     770 </span><span class="lineNoCov">              0 :       const size_type __new_num_nodes = __old_num_nodes + __nodes_to_add;</span>
-<span class="lineNum">     771 </span>                : 
-<span class="lineNum">     772 </span>                :       _Map_pointer __new_nstart;
-<span class="lineNum">     773 </span><span class="lineNoCov">              0 :       if (this-&gt;_M_impl._M_map_size &gt; 2 * __new_num_nodes)</span>
-<span class="lineNum">     774 </span>                :         {
-<span class="lineNum">     775 </span><span class="lineNoCov">              0 :           __new_nstart = this-&gt;_M_impl._M_map + (this-&gt;_M_impl._M_map_size</span>
-<span class="lineNum">     776 </span>                :                                          - __new_num_nodes) / 2
-<span class="lineNum">     777 </span>                :                          + (__add_at_front ? __nodes_to_add : 0);
-<span class="lineNum">     778 </span><span class="lineNoCov">              0 :           if (__new_nstart &lt; this-&gt;_M_impl._M_start._M_node)</span>
-<span class="lineNum">     779 </span><span class="lineNoCov">              0 :             std::copy(this-&gt;_M_impl._M_start._M_node,</span>
-<span class="lineNum">     780 </span>                :                       this-&gt;_M_impl._M_finish._M_node + 1,
-<span class="lineNum">     781 </span>                :                       __new_nstart);
-<span class="lineNum">     782 </span>                :           else
-<span class="lineNum">     783 </span><span class="lineNoCov">              0 :             std::copy_backward(this-&gt;_M_impl._M_start._M_node,</span>
-<span class="lineNum">     784 </span>                :                                this-&gt;_M_impl._M_finish._M_node + 1,
-<span class="lineNum">     785 </span>                :                                __new_nstart + __old_num_nodes);
-<span class="lineNum">     786 </span>                :         }
-<span class="lineNum">     787 </span>                :       else
-<span class="lineNum">     788 </span>                :         {
-<span class="lineNum">     789 </span>                :           size_type __new_map_size = this-&gt;_M_impl._M_map_size
-<span class="lineNum">     790 </span>                :                                      + std::max(this-&gt;_M_impl._M_map_size,
-<span class="lineNum">     791 </span><span class="lineNoCov">              0 :                                                 __nodes_to_add) + 2;</span>
-<span class="lineNum">     792 </span>                : 
-<span class="lineNum">     793 </span><span class="lineNoCov">              0 :           _Map_pointer __new_map = this-&gt;_M_allocate_map(__new_map_size);</span>
-<span class="lineNum">     794 </span><span class="lineNoCov">              0 :           __new_nstart = __new_map + (__new_map_size - __new_num_nodes) / 2</span>
-<span class="lineNum">     795 </span>                :                          + (__add_at_front ? __nodes_to_add : 0);
-<span class="lineNum">     796 </span><span class="lineNoCov">              0 :           std::copy(this-&gt;_M_impl._M_start._M_node,</span>
-<span class="lineNum">     797 </span>                :                     this-&gt;_M_impl._M_finish._M_node + 1,
-<span class="lineNum">     798 </span>                :                     __new_nstart);
-<span class="lineNum">     799 </span><span class="lineNoCov">              0 :           _M_deallocate_map(this-&gt;_M_impl._M_map, this-&gt;_M_impl._M_map_size);</span>
-<span class="lineNum">     800 </span>                : 
-<span class="lineNum">     801 </span><span class="lineNoCov">              0 :           this-&gt;_M_impl._M_map = __new_map;</span>
-<span class="lineNum">     802 </span><span class="lineNoCov">              0 :           this-&gt;_M_impl._M_map_size = __new_map_size;</span>
-<span class="lineNum">     803 </span>                :         }
-<span class="lineNum">     804 </span>                : 
-<span class="lineNum">     805 </span><span class="lineNoCov">              0 :       this-&gt;_M_impl._M_start._M_set_node(__new_nstart);</span>
-<span class="lineNum">     806 </span><span class="lineNoCov">              0 :       this-&gt;_M_impl._M_finish._M_set_node(__new_nstart + __old_num_nodes - 1);</span>
-<span class="lineNum">     807 </span><span class="lineNoCov">              0 :     }</span>
-<span class="lineNum">     808 </span>                : 
-<span class="lineNum">     809 </span>                :   // Overload for deque::iterators, exploiting the &quot;segmented-iterator
-<span class="lineNum">     810 </span>                :   // optimization&quot;.  NB: leave const_iterators alone!
-<span class="lineNum">     811 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     812 </span>                :     void
-<span class="lineNum">     813 </span>                :     fill(const _Deque_iterator&lt;_Tp, _Tp&amp;, _Tp*&gt;&amp; __first,
-<span class="lineNum">     814 </span>                :          const _Deque_iterator&lt;_Tp, _Tp&amp;, _Tp*&gt;&amp; __last, const _Tp&amp; __value)
-<span class="lineNum">     815 </span>                :     {
-<span class="lineNum">     816 </span>                :       typedef typename _Deque_iterator&lt;_Tp, _Tp&amp;, _Tp*&gt;::_Self _Self;
-<span class="lineNum">     817 </span>                : 
-<span class="lineNum">     818 </span>                :       for (typename _Self::_Map_pointer __node = __first._M_node + 1;
-<span class="lineNum">     819 </span>                :            __node &lt; __last._M_node; ++__node)
-<span class="lineNum">     820 </span>                :         std::fill(*__node, *__node + _Self::_S_buffer_size(), __value);
-<span class="lineNum">     821 </span>                : 
-<span class="lineNum">     822 </span>                :       if (__first._M_node != __last._M_node)
-<span class="lineNum">     823 </span>                :         {
-<span class="lineNum">     824 </span>                :           std::fill(__first._M_cur, __first._M_last, __value);
-<span class="lineNum">     825 </span>                :           std::fill(__last._M_first, __last._M_cur, __value);
-<span class="lineNum">     826 </span>                :         }
-<span class="lineNum">     827 </span>                :       else
-<span class="lineNum">     828 </span>                :         std::fill(__first._M_cur, __last._M_cur, __value);
-<span class="lineNum">     829 </span>                :     }
-<span class="lineNum">     830 </span>                : 
-<span class="lineNum">     831 </span>                : _GLIBCXX_END_NESTED_NAMESPACE
-<span class="lineNum">     832 </span>                : 
-<span class="lineNum">     833 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/bits/index.html b/rep/usr/include/c++/4.3/bits/index.html
deleted file mode 100644
index 4e6a4f9..0000000
--- a/rep/usr/include/c++/4.3/bits/index.html
+++ /dev/null
@@ -1,353 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/bits</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - /usr/include/c++/4.3/bits</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">2051</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">69.1 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">1418</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <center>
-  <table width="80%" cellpadding=2 cellspacing=1 border=0>
-
-    <tr>
-      <td width="50%"><br></td>
-      <td width="15%"></td>
-      <td width="15%"></td>
-      <td width="20%"></td>
-    </tr>
-
-    <tr>
-      <td class="tableHead">Filename</td>
-      <td class="tableHead" colspan=3>Coverage</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="allocator.h.gcov.html">allocator.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=71 height=10 alt="71.4%"><img src="../../../../../snow.png" width=29 height=10 alt="71.4%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">71.4&nbsp;%</td>
-      <td class="coverNumHi">5&nbsp;/&nbsp;7&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="basic_ios.h.gcov.html">basic_ios.h</a></td>
-      <td class="coverBar" align="center">
-                <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../snow.png" width=100 height=10 alt="0.0%"></td></tr></table>
-      </td>
-      <td class="coverPerLo">0.0&nbsp;%</td>
-      <td class="coverNumLo">0&nbsp;/&nbsp;35&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="basic_string.h.gcov.html">basic_string.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../amber.png" width=17 height=10 alt="17.4%"><img src="../../../../../snow.png" width=83 height=10 alt="17.4%"></td></tr></table>
-      </td>
-      <td class="coverPerMed">17.4&nbsp;%</td>
-      <td class="coverNumMed">31&nbsp;/&nbsp;178&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="basic_string.tcc.gcov.html">basic_string.tcc</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=74 height=10 alt="73.9%"><img src="../../../../../snow.png" width=26 height=10 alt="73.9%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">73.9&nbsp;%</td>
-      <td class="coverNumHi">17&nbsp;/&nbsp;23&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="char_traits.h.gcov.html">char_traits.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../amber.png" width=46 height=10 alt="46.2%"><img src="../../../../../snow.png" width=54 height=10 alt="46.2%"></td></tr></table>
-      </td>
-      <td class="coverPerMed">46.2&nbsp;%</td>
-      <td class="coverNumMed">6&nbsp;/&nbsp;13&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="deque.tcc.gcov.html">deque.tcc</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../amber.png" width=19 height=10 alt="19.0%"><img src="../../../../../snow.png" width=81 height=10 alt="19.0%"></td></tr></table>
-      </td>
-      <td class="coverPerMed">19.0&nbsp;%</td>
-      <td class="coverNumMed">28&nbsp;/&nbsp;147&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="ios_base.h.gcov.html">ios_base.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=67 height=10 alt="66.7%"><img src="../../../../../snow.png" width=33 height=10 alt="66.7%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">66.7&nbsp;%</td>
-      <td class="coverNumHi">20&nbsp;/&nbsp;30&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="list.tcc.gcov.html">list.tcc</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">11&nbsp;/&nbsp;11&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="locale_facets.h.gcov.html">locale_facets.h</a></td>
-      <td class="coverBar" align="center">
-                <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../snow.png" width=100 height=10 alt="0.0%"></td></tr></table>
-      </td>
-      <td class="coverPerLo">0.0&nbsp;%</td>
-      <td class="coverNumLo">0&nbsp;/&nbsp;13&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="postypes.h.gcov.html">postypes.h</a></td>
-      <td class="coverBar" align="center">
-                <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../snow.png" width=100 height=10 alt="0.0%"></td></tr></table>
-      </td>
-      <td class="coverPerLo">0.0&nbsp;%</td>
-      <td class="coverNumLo">0&nbsp;/&nbsp;3&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="stl_algo.h.gcov.html">stl_algo.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=85 height=10 alt="85.0%"><img src="../../../../../snow.png" width=15 height=10 alt="85.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">85.0&nbsp;%</td>
-      <td class="coverNumHi">192&nbsp;/&nbsp;226&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="stl_algobase.h.gcov.html">stl_algobase.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=91 height=10 alt="91.1%"><img src="../../../../../snow.png" width=9 height=10 alt="91.1%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">91.1&nbsp;%</td>
-      <td class="coverNumHi">72&nbsp;/&nbsp;79&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="stl_bvector.h.gcov.html">stl_bvector.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=70 height=10 alt="70.4%"><img src="../../../../../snow.png" width=30 height=10 alt="70.4%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">70.4&nbsp;%</td>
-      <td class="coverNumHi">81&nbsp;/&nbsp;115&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="stl_construct.h.gcov.html">stl_construct.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">12&nbsp;/&nbsp;12&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="stl_deque.h.gcov.html">stl_deque.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=78 height=10 alt="78.3%"><img src="../../../../../snow.png" width=22 height=10 alt="78.3%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">78.3&nbsp;%</td>
-      <td class="coverNumHi">148&nbsp;/&nbsp;189&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="stl_function.h.gcov.html">stl_function.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">17&nbsp;/&nbsp;17&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="stl_heap.h.gcov.html">stl_heap.h</a></td>
-      <td class="coverBar" align="center">
-                <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../snow.png" width=100 height=10 alt="0.0%"></td></tr></table>
-      </td>
-      <td class="coverPerLo">0.0&nbsp;%</td>
-      <td class="coverNumLo">0&nbsp;/&nbsp;92&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="stl_iterator.h.gcov.html">stl_iterator.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=94 height=10 alt="93.9%"><img src="../../../../../snow.png" width=6 height=10 alt="93.9%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">93.9&nbsp;%</td>
-      <td class="coverNumHi">62&nbsp;/&nbsp;66&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="stl_iterator_base_funcs.h.gcov.html">stl_iterator_base_funcs.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=82 height=10 alt="82.1%"><img src="../../../../../snow.png" width=18 height=10 alt="82.1%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">82.1&nbsp;%</td>
-      <td class="coverNumHi">23&nbsp;/&nbsp;28&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="stl_iterator_base_types.h.gcov.html">stl_iterator_base_types.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">3&nbsp;/&nbsp;3&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="stl_list.h.gcov.html">stl_list.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=94 height=10 alt="93.6%"><img src="../../../../../snow.png" width=6 height=10 alt="93.6%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">93.6&nbsp;%</td>
-      <td class="coverNumHi">88&nbsp;/&nbsp;94&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="stl_map.h.gcov.html">stl_map.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">41&nbsp;/&nbsp;41&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="stl_move.h.gcov.html">stl_move.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">5&nbsp;/&nbsp;5&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="stl_pair.h.gcov.html">stl_pair.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">9&nbsp;/&nbsp;9&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="stl_set.h.gcov.html">stl_set.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">33&nbsp;/&nbsp;33&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="stl_stack.h.gcov.html">stl_stack.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">12&nbsp;/&nbsp;12&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="stl_tree.h.gcov.html">stl_tree.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=94 height=10 alt="94.2%"><img src="../../../../../snow.png" width=6 height=10 alt="94.2%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">94.2&nbsp;%</td>
-      <td class="coverNumHi">278&nbsp;/&nbsp;295&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="stl_uninitialized.h.gcov.html">stl_uninitialized.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=58 height=10 alt="58.1%"><img src="../../../../../snow.png" width=42 height=10 alt="58.1%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">58.1&nbsp;%</td>
-      <td class="coverNumHi">25&nbsp;/&nbsp;43&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="stl_vector.h.gcov.html">stl_vector.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=91 height=10 alt="91.3%"><img src="../../../../../snow.png" width=9 height=10 alt="91.3%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">91.3&nbsp;%</td>
-      <td class="coverNumHi">94&nbsp;/&nbsp;103&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="stream_iterator.h.gcov.html">stream_iterator.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">33&nbsp;/&nbsp;33&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="vector.tcc.gcov.html">vector.tcc</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=75 height=10 alt="75.0%"><img src="../../../../../snow.png" width=25 height=10 alt="75.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">75.0&nbsp;%</td>
-      <td class="coverNumHi">72&nbsp;/&nbsp;96&nbsp;lines</td>
-    </tr>
-
-  </table>
-  </center>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/bits/ios_base.h.gcov.html b/rep/usr/include/c++/4.3/bits/ios_base.h.gcov.html
deleted file mode 100644
index 091c26d..0000000
--- a/rep/usr/include/c++/4.3/bits/ios_base.h.gcov.html
+++ /dev/null
@@ -1,1039 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/ios_base.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - ios_base.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">30</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">66.7 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">20</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // Iostreams base classes -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005,
-<span class="lineNum">       4 </span>                : // 2006, 2007, 2008
-<span class="lineNum">       5 </span>                : // Free Software Foundation, Inc.
-<span class="lineNum">       6 </span>                : //
-<span class="lineNum">       7 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       8 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       9 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">      10 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      11 </span>                : // any later version.
-<span class="lineNum">      12 </span>                : 
-<span class="lineNum">      13 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      14 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      15 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      16 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      17 </span>                : 
-<span class="lineNum">      18 </span>                : // You should have received a copy of the GNU General Public License along
-<span class="lineNum">      19 </span>                : // with this library; see the file COPYING.  If not, write to the Free
-<span class="lineNum">      20 </span>                : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-<span class="lineNum">      21 </span>                : // USA.
-<span class="lineNum">      22 </span>                : 
-<span class="lineNum">      23 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      24 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      25 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      26 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      27 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      28 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      29 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      30 </span>                : // the GNU General Public License.
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span>                : /** @file ios_base.h
-<span class="lineNum">      33 </span>                :  *  This is an internal header file, included by other library headers.
-<span class="lineNum">      34 </span>                :  *  You should not attempt to use it directly.
-<span class="lineNum">      35 </span>                :  */
-<span class="lineNum">      36 </span>                : 
-<span class="lineNum">      37 </span>                : //
-<span class="lineNum">      38 </span>                : // ISO C++ 14882: 27.4  Iostreams base classes
-<span class="lineNum">      39 </span>                : //
-<span class="lineNum">      40 </span>                : 
-<span class="lineNum">      41 </span>                : #ifndef _IOS_BASE_H
-<span class="lineNum">      42 </span>                : #define _IOS_BASE_H 1
-<span class="lineNum">      43 </span>                : 
-<span class="lineNum">      44 </span>                : #pragma GCC system_header
-<span class="lineNum">      45 </span>                : 
-<span class="lineNum">      46 </span>                : #include &lt;ext/atomicity.h&gt;
-<span class="lineNum">      47 </span>                : #include &lt;bits/localefwd.h&gt;
-<span class="lineNum">      48 </span>                : #include &lt;bits/locale_classes.h&gt;
-<span class="lineNum">      49 </span>                : #include &lt;cstdio&gt;  // For SEEK_CUR, SEEK_END
-<span class="lineNum">      50 </span>                : 
-<span class="lineNum">      51 </span>                : _GLIBCXX_BEGIN_NAMESPACE(std)
-<span class="lineNum">      52 </span>                : 
-<span class="lineNum">      53 </span>                :   // The following definitions of bitmask types are enums, not ints,
-<span class="lineNum">      54 </span>                :   // as permitted (but not required) in the standard, in order to provide
-<span class="lineNum">      55 </span>                :   // better type safety in iostream calls.  A side effect is that
-<span class="lineNum">      56 </span>                :   // expressions involving them are no longer compile-time constants.
-<span class="lineNum">      57 </span>                :   enum _Ios_Fmtflags 
-<span class="lineNum">      58 </span>                :     { 
-<span class="lineNum">      59 </span>                :       _S_boolalpha      = 1L &lt;&lt; 0,
-<span class="lineNum">      60 </span>                :       _S_dec            = 1L &lt;&lt; 1,
-<span class="lineNum">      61 </span>                :       _S_fixed          = 1L &lt;&lt; 2,
-<span class="lineNum">      62 </span>                :       _S_hex            = 1L &lt;&lt; 3,
-<span class="lineNum">      63 </span>                :       _S_internal       = 1L &lt;&lt; 4,
-<span class="lineNum">      64 </span>                :       _S_left           = 1L &lt;&lt; 5,
-<span class="lineNum">      65 </span>                :       _S_oct            = 1L &lt;&lt; 6,
-<span class="lineNum">      66 </span>                :       _S_right          = 1L &lt;&lt; 7,
-<span class="lineNum">      67 </span>                :       _S_scientific     = 1L &lt;&lt; 8,
-<span class="lineNum">      68 </span>                :       _S_showbase       = 1L &lt;&lt; 9,
-<span class="lineNum">      69 </span>                :       _S_showpoint      = 1L &lt;&lt; 10,
-<span class="lineNum">      70 </span>                :       _S_showpos        = 1L &lt;&lt; 11,
-<span class="lineNum">      71 </span>                :       _S_skipws         = 1L &lt;&lt; 12,
-<span class="lineNum">      72 </span>                :       _S_unitbuf        = 1L &lt;&lt; 13,
-<span class="lineNum">      73 </span>                :       _S_uppercase      = 1L &lt;&lt; 14,
-<span class="lineNum">      74 </span>                :       _S_adjustfield    = _S_left | _S_right | _S_internal,
-<span class="lineNum">      75 </span>                :       _S_basefield      = _S_dec | _S_oct | _S_hex,
-<span class="lineNum">      76 </span>                :       _S_floatfield     = _S_scientific | _S_fixed,
-<span class="lineNum">      77 </span>                :       _S_ios_fmtflags_end = 1L &lt;&lt; 16 
-<span class="lineNum">      78 </span>                :     };
-<span class="lineNum">      79 </span>                : 
-<span class="lineNum">      80 </span>                :   inline _Ios_Fmtflags
-<span class="lineNum">      81 </span><span class="lineCov">             66 :   operator&amp;(_Ios_Fmtflags __a, _Ios_Fmtflags __b)</span>
-<span class="lineNum">      82 </span><span class="lineCov">             66 :   { return _Ios_Fmtflags(static_cast&lt;int&gt;(__a) &amp; static_cast&lt;int&gt;(__b)); }</span>
-<span class="lineNum">      83 </span>                : 
-<span class="lineNum">      84 </span>                :   inline _Ios_Fmtflags
-<span class="lineNum">      85 </span><span class="lineCov">             33 :   operator|(_Ios_Fmtflags __a, _Ios_Fmtflags __b)</span>
-<span class="lineNum">      86 </span><span class="lineCov">             33 :   { return _Ios_Fmtflags(static_cast&lt;int&gt;(__a) | static_cast&lt;int&gt;(__b)); }</span>
-<span class="lineNum">      87 </span>                : 
-<span class="lineNum">      88 </span>                :   inline _Ios_Fmtflags
-<span class="lineNum">      89 </span>                :   operator^(_Ios_Fmtflags __a, _Ios_Fmtflags __b)
-<span class="lineNum">      90 </span>                :   { return _Ios_Fmtflags(static_cast&lt;int&gt;(__a) ^ static_cast&lt;int&gt;(__b)); }
-<span class="lineNum">      91 </span>                : 
-<span class="lineNum">      92 </span>                :   inline _Ios_Fmtflags&amp;
-<span class="lineNum">      93 </span><span class="lineCov">             33 :   operator|=(_Ios_Fmtflags&amp; __a, _Ios_Fmtflags __b)</span>
-<span class="lineNum">      94 </span><span class="lineCov">             33 :   { return __a = __a | __b; }</span>
-<span class="lineNum">      95 </span>                : 
-<span class="lineNum">      96 </span>                :   inline _Ios_Fmtflags&amp;
-<span class="lineNum">      97 </span><span class="lineCov">             33 :   operator&amp;=(_Ios_Fmtflags&amp; __a, _Ios_Fmtflags __b)</span>
-<span class="lineNum">      98 </span><span class="lineCov">             33 :   { return __a = __a &amp; __b; }</span>
-<span class="lineNum">      99 </span>                : 
-<span class="lineNum">     100 </span>                :   inline _Ios_Fmtflags&amp;
-<span class="lineNum">     101 </span>                :   operator^=(_Ios_Fmtflags&amp; __a, _Ios_Fmtflags __b)
-<span class="lineNum">     102 </span>                :   { return __a = __a ^ __b; }
-<span class="lineNum">     103 </span>                : 
-<span class="lineNum">     104 </span>                :   inline _Ios_Fmtflags
-<span class="lineNum">     105 </span><span class="lineCov">             33 :   operator~(_Ios_Fmtflags __a)</span>
-<span class="lineNum">     106 </span><span class="lineCov">             33 :   { return _Ios_Fmtflags(~static_cast&lt;int&gt;(__a)); }</span>
-<span class="lineNum">     107 </span>                : 
-<span class="lineNum">     108 </span>                : 
-<span class="lineNum">     109 </span>                :   enum _Ios_Openmode 
-<span class="lineNum">     110 </span>                :     { 
-<span class="lineNum">     111 </span>                :       _S_app            = 1L &lt;&lt; 0,
-<span class="lineNum">     112 </span>                :       _S_ate            = 1L &lt;&lt; 1,
-<span class="lineNum">     113 </span>                :       _S_bin            = 1L &lt;&lt; 2,
-<span class="lineNum">     114 </span>                :       _S_in             = 1L &lt;&lt; 3,
-<span class="lineNum">     115 </span>                :       _S_out            = 1L &lt;&lt; 4,
-<span class="lineNum">     116 </span>                :       _S_trunc          = 1L &lt;&lt; 5,
-<span class="lineNum">     117 </span>                :       _S_ios_openmode_end = 1L &lt;&lt; 16 
-<span class="lineNum">     118 </span>                :     };
-<span class="lineNum">     119 </span>                : 
-<span class="lineNum">     120 </span>                :   inline _Ios_Openmode
-<span class="lineNum">     121 </span><span class="lineNoCov">              0 :   operator&amp;(_Ios_Openmode __a, _Ios_Openmode __b)</span>
-<span class="lineNum">     122 </span><span class="lineNoCov">              0 :   { return _Ios_Openmode(static_cast&lt;int&gt;(__a) &amp; static_cast&lt;int&gt;(__b)); }</span>
-<span class="lineNum">     123 </span>                : 
-<span class="lineNum">     124 </span>                :   inline _Ios_Openmode
-<span class="lineNum">     125 </span><span class="lineCov">           1364 :   operator|(_Ios_Openmode __a, _Ios_Openmode __b)</span>
-<span class="lineNum">     126 </span><span class="lineCov">           1364 :   { return _Ios_Openmode(static_cast&lt;int&gt;(__a) | static_cast&lt;int&gt;(__b)); }</span>
-<span class="lineNum">     127 </span>                : 
-<span class="lineNum">     128 </span>                :   inline _Ios_Openmode
-<span class="lineNum">     129 </span>                :   operator^(_Ios_Openmode __a, _Ios_Openmode __b)
-<span class="lineNum">     130 </span>                :   { return _Ios_Openmode(static_cast&lt;int&gt;(__a) ^ static_cast&lt;int&gt;(__b)); }
-<span class="lineNum">     131 </span>                : 
-<span class="lineNum">     132 </span>                :   inline _Ios_Openmode&amp;
-<span class="lineNum">     133 </span>                :   operator|=(_Ios_Openmode&amp; __a, _Ios_Openmode __b)
-<span class="lineNum">     134 </span>                :   { return __a = __a | __b; }
-<span class="lineNum">     135 </span>                : 
-<span class="lineNum">     136 </span>                :   inline _Ios_Openmode&amp;
-<span class="lineNum">     137 </span>                :   operator&amp;=(_Ios_Openmode&amp; __a, _Ios_Openmode __b)
-<span class="lineNum">     138 </span>                :   { return __a = __a &amp; __b; }
-<span class="lineNum">     139 </span>                : 
-<span class="lineNum">     140 </span>                :   inline _Ios_Openmode&amp;
-<span class="lineNum">     141 </span>                :   operator^=(_Ios_Openmode&amp; __a, _Ios_Openmode __b)
-<span class="lineNum">     142 </span>                :   { return __a = __a ^ __b; }
-<span class="lineNum">     143 </span>                : 
-<span class="lineNum">     144 </span>                :   inline _Ios_Openmode
-<span class="lineNum">     145 </span>                :   operator~(_Ios_Openmode __a)
-<span class="lineNum">     146 </span>                :   { return _Ios_Openmode(~static_cast&lt;int&gt;(__a)); }
-<span class="lineNum">     147 </span>                : 
-<span class="lineNum">     148 </span>                : 
-<span class="lineNum">     149 </span>                :   enum _Ios_Iostate
-<span class="lineNum">     150 </span>                :     { 
-<span class="lineNum">     151 </span>                :       _S_goodbit                = 0,
-<span class="lineNum">     152 </span>                :       _S_badbit                 = 1L &lt;&lt; 0,
-<span class="lineNum">     153 </span>                :       _S_eofbit                 = 1L &lt;&lt; 1,
-<span class="lineNum">     154 </span>                :       _S_failbit                = 1L &lt;&lt; 2,
-<span class="lineNum">     155 </span>                :       _S_ios_iostate_end = 1L &lt;&lt; 16 
-<span class="lineNum">     156 </span>                :     };
-<span class="lineNum">     157 </span>                : 
-<span class="lineNum">     158 </span>                :   inline _Ios_Iostate
-<span class="lineNum">     159 </span><span class="lineNoCov">              0 :   operator&amp;(_Ios_Iostate __a, _Ios_Iostate __b)</span>
-<span class="lineNum">     160 </span><span class="lineNoCov">              0 :   { return _Ios_Iostate(static_cast&lt;int&gt;(__a) &amp; static_cast&lt;int&gt;(__b)); }</span>
-<span class="lineNum">     161 </span>                : 
-<span class="lineNum">     162 </span>                :   inline _Ios_Iostate
-<span class="lineNum">     163 </span><span class="lineNoCov">              0 :   operator|(_Ios_Iostate __a, _Ios_Iostate __b)</span>
-<span class="lineNum">     164 </span><span class="lineNoCov">              0 :   { return _Ios_Iostate(static_cast&lt;int&gt;(__a) | static_cast&lt;int&gt;(__b)); }</span>
-<span class="lineNum">     165 </span>                : 
-<span class="lineNum">     166 </span>                :   inline _Ios_Iostate
-<span class="lineNum">     167 </span>                :   operator^(_Ios_Iostate __a, _Ios_Iostate __b)
-<span class="lineNum">     168 </span>                :   { return _Ios_Iostate(static_cast&lt;int&gt;(__a) ^ static_cast&lt;int&gt;(__b)); }
-<span class="lineNum">     169 </span>                : 
-<span class="lineNum">     170 </span>                :   inline _Ios_Iostate&amp;
-<span class="lineNum">     171 </span>                :   operator|=(_Ios_Iostate&amp; __a, _Ios_Iostate __b)
-<span class="lineNum">     172 </span>                :   { return __a = __a | __b; }
-<span class="lineNum">     173 </span>                : 
-<span class="lineNum">     174 </span>                :   inline _Ios_Iostate&amp;
-<span class="lineNum">     175 </span>                :   operator&amp;=(_Ios_Iostate&amp; __a, _Ios_Iostate __b)
-<span class="lineNum">     176 </span>                :   { return __a = __a &amp; __b; }
-<span class="lineNum">     177 </span>                : 
-<span class="lineNum">     178 </span>                :   inline _Ios_Iostate&amp;
-<span class="lineNum">     179 </span>                :   operator^=(_Ios_Iostate&amp; __a, _Ios_Iostate __b)
-<span class="lineNum">     180 </span>                :   { return __a = __a ^ __b; }
-<span class="lineNum">     181 </span>                : 
-<span class="lineNum">     182 </span>                :   inline _Ios_Iostate
-<span class="lineNum">     183 </span>                :   operator~(_Ios_Iostate __a)
-<span class="lineNum">     184 </span>                :   { return _Ios_Iostate(~static_cast&lt;int&gt;(__a)); }
-<span class="lineNum">     185 </span>                : 
-<span class="lineNum">     186 </span>                :   enum _Ios_Seekdir 
-<span class="lineNum">     187 </span>                :     { 
-<span class="lineNum">     188 </span>                :       _S_beg = 0,
-<span class="lineNum">     189 </span>                :       _S_cur = SEEK_CUR,
-<span class="lineNum">     190 </span>                :       _S_end = SEEK_END,
-<span class="lineNum">     191 </span>                :       _S_ios_seekdir_end = 1L &lt;&lt; 16 
-<span class="lineNum">     192 </span>                :     };
-<span class="lineNum">     193 </span>                : 
-<span class="lineNum">     194 </span>                :   // 27.4.2  Class ios_base
-<span class="lineNum">     195 </span>                :   /**
-<span class="lineNum">     196 </span>                :    *  @brief  The base of the I/O class hierarchy.
-<span class="lineNum">     197 </span>                :    *
-<span class="lineNum">     198 </span>                :    *  This class defines everything that can be defined about I/O that does
-<span class="lineNum">     199 </span>                :    *  not depend on the type of characters being input or output.  Most
-<span class="lineNum">     200 </span>                :    *  people will only see @c ios_base when they need to specify the full
-<span class="lineNum">     201 </span>                :    *  name of the various I/O flags (e.g., the openmodes).
-<span class="lineNum">     202 </span>                :   */
-<span class="lineNum">     203 </span>                :   class ios_base
-<span class="lineNum">     204 </span>                :   {
-<span class="lineNum">     205 </span>                :   public:
-<span class="lineNum">     206 </span>                : 
-<span class="lineNum">     207 </span>                :     // 27.4.2.1.1  Class ios_base::failure
-<span class="lineNum">     208 </span>                :     /// These are thrown to indicate problems.  Doc me.
-<span class="lineNum">     209 </span>                :     class failure : public exception
-<span class="lineNum">     210 </span>                :     {
-<span class="lineNum">     211 </span>                :     public:
-<span class="lineNum">     212 </span>                :       // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     213 </span>                :       // 48.  Use of non-existent exception constructor
-<span class="lineNum">     214 </span>                :       explicit
-<span class="lineNum">     215 </span>                :       failure(const string&amp; __str) throw();
-<span class="lineNum">     216 </span>                : 
-<span class="lineNum">     217 </span>                :       // This declaration is not useless:
-<span class="lineNum">     218 </span>                :       // http://gcc.gnu.org/onlinedocs/gcc-3.0.2/gcc_6.html#SEC118
-<span class="lineNum">     219 </span>                :       virtual
-<span class="lineNum">     220 </span>                :       ~failure() throw();
-<span class="lineNum">     221 </span>                : 
-<span class="lineNum">     222 </span>                :       virtual const char*
-<span class="lineNum">     223 </span>                :       what() const throw();
-<span class="lineNum">     224 </span>                : 
-<span class="lineNum">     225 </span>                :     private:
-<span class="lineNum">     226 </span>                :       string _M_msg;
-<span class="lineNum">     227 </span>                :     };
-<span class="lineNum">     228 </span>                : 
-<span class="lineNum">     229 </span>                :     // 27.4.2.1.2  Type ios_base::fmtflags
-<span class="lineNum">     230 </span>                :     /**
-<span class="lineNum">     231 </span>                :      *  @brief This is a bitmask type.
-<span class="lineNum">     232 </span>                :      *
-<span class="lineNum">     233 </span>                :      *  @c &quot;_Ios_Fmtflags&quot; is implementation-defined, but it is valid to
-<span class="lineNum">     234 </span>                :      *  perform bitwise operations on these values and expect the Right
-<span class="lineNum">     235 </span>                :      *  Thing to happen.  Defined objects of type fmtflags are:
-<span class="lineNum">     236 </span>                :      *  - boolalpha
-<span class="lineNum">     237 </span>                :      *  - dec
-<span class="lineNum">     238 </span>                :      *  - fixed
-<span class="lineNum">     239 </span>                :      *  - hex
-<span class="lineNum">     240 </span>                :      *  - internal
-<span class="lineNum">     241 </span>                :      *  - left
-<span class="lineNum">     242 </span>                :      *  - oct
-<span class="lineNum">     243 </span>                :      *  - right
-<span class="lineNum">     244 </span>                :      *  - scientific
-<span class="lineNum">     245 </span>                :      *  - showbase
-<span class="lineNum">     246 </span>                :      *  - showpoint
-<span class="lineNum">     247 </span>                :      *  - showpos
-<span class="lineNum">     248 </span>                :      *  - skipws
-<span class="lineNum">     249 </span>                :      *  - unitbuf
-<span class="lineNum">     250 </span>                :      *  - uppercase
-<span class="lineNum">     251 </span>                :      *  - adjustfield
-<span class="lineNum">     252 </span>                :      *  - basefield
-<span class="lineNum">     253 </span>                :      *  - floatfield
-<span class="lineNum">     254 </span>                :     */
-<span class="lineNum">     255 </span>                :     typedef _Ios_Fmtflags fmtflags;
-<span class="lineNum">     256 </span>                : 
-<span class="lineNum">     257 </span>                :     /// Insert/extract @c bool in alphabetic rather than numeric format.
-<span class="lineNum">     258 </span>                :     static const fmtflags boolalpha =   _S_boolalpha;
-<span class="lineNum">     259 </span>                : 
-<span class="lineNum">     260 </span>                :     /// Converts integer input or generates integer output in decimal base.
-<span class="lineNum">     261 </span>                :     static const fmtflags dec =         _S_dec;
-<span class="lineNum">     262 </span>                : 
-<span class="lineNum">     263 </span>                :     /// Generate floating-point output in fixed-point notation.
-<span class="lineNum">     264 </span>                :     static const fmtflags fixed =       _S_fixed;
-<span class="lineNum">     265 </span>                : 
-<span class="lineNum">     266 </span>                :     /// Converts integer input or generates integer output in hexadecimal base.
-<span class="lineNum">     267 </span>                :     static const fmtflags hex =         _S_hex;
-<span class="lineNum">     268 </span>                : 
-<span class="lineNum">     269 </span>                :     /// Adds fill characters at a designated internal point in certain
-<span class="lineNum">     270 </span>                :     /// generated output, or identical to @c right if no such point is
-<span class="lineNum">     271 </span>                :     /// designated.
-<span class="lineNum">     272 </span>                :     static const fmtflags internal =    _S_internal;
-<span class="lineNum">     273 </span>                : 
-<span class="lineNum">     274 </span>                :     /// Adds fill characters on the right (final positions) of certain
-<span class="lineNum">     275 </span>                :     /// generated output.  (I.e., the thing you print is flush left.)
-<span class="lineNum">     276 </span>                :     static const fmtflags left =        _S_left;
-<span class="lineNum">     277 </span>                : 
-<span class="lineNum">     278 </span>                :     /// Converts integer input or generates integer output in octal base.
-<span class="lineNum">     279 </span>                :     static const fmtflags oct =         _S_oct;
-<span class="lineNum">     280 </span>                : 
-<span class="lineNum">     281 </span>                :     /// Adds fill characters on the left (initial positions) of certain
-<span class="lineNum">     282 </span>                :     /// generated output.  (I.e., the thing you print is flush right.)
-<span class="lineNum">     283 </span>                :     static const fmtflags right =       _S_right;
-<span class="lineNum">     284 </span>                : 
-<span class="lineNum">     285 </span>                :     /// Generates floating-point output in scientific notation.
-<span class="lineNum">     286 </span>                :     static const fmtflags scientific =  _S_scientific;
-<span class="lineNum">     287 </span>                : 
-<span class="lineNum">     288 </span>                :     /// Generates a prefix indicating the numeric base of generated integer
-<span class="lineNum">     289 </span>                :     /// output.
-<span class="lineNum">     290 </span>                :     static const fmtflags showbase =    _S_showbase;
-<span class="lineNum">     291 </span>                : 
-<span class="lineNum">     292 </span>                :     /// Generates a decimal-point character unconditionally in generated
-<span class="lineNum">     293 </span>                :     /// floating-point output.
-<span class="lineNum">     294 </span>                :     static const fmtflags showpoint =   _S_showpoint;
-<span class="lineNum">     295 </span>                : 
-<span class="lineNum">     296 </span>                :     /// Generates a + sign in non-negative generated numeric output.
-<span class="lineNum">     297 </span>                :     static const fmtflags showpos =     _S_showpos;
-<span class="lineNum">     298 </span>                : 
-<span class="lineNum">     299 </span>                :     /// Skips leading white space before certain input operations.
-<span class="lineNum">     300 </span>                :     static const fmtflags skipws =      _S_skipws;
-<span class="lineNum">     301 </span>                : 
-<span class="lineNum">     302 </span>                :     /// Flushes output after each output operation.
-<span class="lineNum">     303 </span>                :     static const fmtflags unitbuf =     _S_unitbuf;
-<span class="lineNum">     304 </span>                : 
-<span class="lineNum">     305 </span>                :     /// Replaces certain lowercase letters with their uppercase equivalents
-<span class="lineNum">     306 </span>                :     /// in generated output.
-<span class="lineNum">     307 </span>                :     static const fmtflags uppercase =   _S_uppercase;
-<span class="lineNum">     308 </span>                : 
-<span class="lineNum">     309 </span>                :     /// A mask of left|right|internal.  Useful for the 2-arg form of @c setf.
-<span class="lineNum">     310 </span>                :     static const fmtflags adjustfield = _S_adjustfield;
-<span class="lineNum">     311 </span>                : 
-<span class="lineNum">     312 </span>                :     /// A mask of dec|oct|hex.  Useful for the 2-arg form of @c setf.
-<span class="lineNum">     313 </span>                :     static const fmtflags basefield =   _S_basefield;
-<span class="lineNum">     314 </span>                : 
-<span class="lineNum">     315 </span>                :     /// A mask of scientific|fixed.  Useful for the 2-arg form of @c setf.
-<span class="lineNum">     316 </span>                :     static const fmtflags floatfield =  _S_floatfield;
-<span class="lineNum">     317 </span>                : 
-<span class="lineNum">     318 </span>                :     // 27.4.2.1.3  Type ios_base::iostate
-<span class="lineNum">     319 </span>                :     /**
-<span class="lineNum">     320 </span>                :      *  @brief This is a bitmask type.
-<span class="lineNum">     321 </span>                :      *
-<span class="lineNum">     322 </span>                :      *  @c &quot;_Ios_Iostate&quot; is implementation-defined, but it is valid to
-<span class="lineNum">     323 </span>                :      *  perform bitwise operations on these values and expect the Right
-<span class="lineNum">     324 </span>                :      *  Thing to happen.  Defined objects of type iostate are:
-<span class="lineNum">     325 </span>                :      *  - badbit
-<span class="lineNum">     326 </span>                :      *  - eofbit
-<span class="lineNum">     327 </span>                :      *  - failbit
-<span class="lineNum">     328 </span>                :      *  - goodbit
-<span class="lineNum">     329 </span>                :     */
-<span class="lineNum">     330 </span>                :     typedef _Ios_Iostate iostate;
-<span class="lineNum">     331 </span>                : 
-<span class="lineNum">     332 </span>                :     /// Indicates a loss of integrity in an input or output sequence (such
-<span class="lineNum">     333 </span>                :     /// as an irrecoverable read error from a file).
-<span class="lineNum">     334 </span>                :     static const iostate badbit =       _S_badbit;
-<span class="lineNum">     335 </span>                : 
-<span class="lineNum">     336 </span>                :     /// Indicates that an input operation reached the end of an input sequence.
-<span class="lineNum">     337 </span>                :     static const iostate eofbit =       _S_eofbit;
-<span class="lineNum">     338 </span>                : 
-<span class="lineNum">     339 </span>                :     /// Indicates that an input operation failed to read the expected
-<span class="lineNum">     340 </span>                :     /// characters, or that an output operation failed to generate the
-<span class="lineNum">     341 </span>                :     /// desired characters.
-<span class="lineNum">     342 </span>                :     static const iostate failbit =      _S_failbit;
-<span class="lineNum">     343 </span>                : 
-<span class="lineNum">     344 </span>                :     /// Indicates all is well.
-<span class="lineNum">     345 </span>                :     static const iostate goodbit =      _S_goodbit;
-<span class="lineNum">     346 </span>                : 
-<span class="lineNum">     347 </span>                :     // 27.4.2.1.4  Type ios_base::openmode
-<span class="lineNum">     348 </span>                :     /**
-<span class="lineNum">     349 </span>                :      *  @brief This is a bitmask type.
-<span class="lineNum">     350 </span>                :      *
-<span class="lineNum">     351 </span>                :      *  @c &quot;_Ios_Openmode&quot; is implementation-defined, but it is valid to
-<span class="lineNum">     352 </span>                :      *  perform bitwise operations on these values and expect the Right
-<span class="lineNum">     353 </span>                :      *  Thing to happen.  Defined objects of type openmode are:
-<span class="lineNum">     354 </span>                :      *  - app
-<span class="lineNum">     355 </span>                :      *  - ate
-<span class="lineNum">     356 </span>                :      *  - binary
-<span class="lineNum">     357 </span>                :      *  - in
-<span class="lineNum">     358 </span>                :      *  - out
-<span class="lineNum">     359 </span>                :      *  - trunc
-<span class="lineNum">     360 </span>                :     */
-<span class="lineNum">     361 </span>                :     typedef _Ios_Openmode openmode;
-<span class="lineNum">     362 </span>                : 
-<span class="lineNum">     363 </span>                :     /// Seek to end before each write.
-<span class="lineNum">     364 </span>                :     static const openmode app =         _S_app;
-<span class="lineNum">     365 </span>                : 
-<span class="lineNum">     366 </span>                :     /// Open and seek to end immediately after opening.
-<span class="lineNum">     367 </span>                :     static const openmode ate =         _S_ate;
-<span class="lineNum">     368 </span>                : 
-<span class="lineNum">     369 </span>                :     /// Perform input and output in binary mode (as opposed to text mode).
-<span class="lineNum">     370 </span>                :     /// This is probably not what you think it is; see
-<span class="lineNum">     371 </span>                :     /// http://gcc.gnu.org/onlinedocs/libstdc++/27_io/howto.html#3 and
-<span class="lineNum">     372 </span>                :     /// http://gcc.gnu.org/onlinedocs/libstdc++/27_io/howto.html#7 for more.
-<span class="lineNum">     373 </span>                :     static const openmode binary =      _S_bin;
-<span class="lineNum">     374 </span>                : 
-<span class="lineNum">     375 </span>                :     /// Open for input.  Default for @c ifstream and fstream.
-<span class="lineNum">     376 </span>                :     static const openmode in =          _S_in;
-<span class="lineNum">     377 </span>                : 
-<span class="lineNum">     378 </span>                :     /// Open for output.  Default for @c ofstream and fstream.
-<span class="lineNum">     379 </span>                :     static const openmode out =         _S_out;
-<span class="lineNum">     380 </span>                : 
-<span class="lineNum">     381 </span>                :     /// Open for input.  Default for @c ofstream.
-<span class="lineNum">     382 </span>                :     static const openmode trunc =       _S_trunc;
-<span class="lineNum">     383 </span>                : 
-<span class="lineNum">     384 </span>                :     // 27.4.2.1.5  Type ios_base::seekdir
-<span class="lineNum">     385 </span>                :     /**
-<span class="lineNum">     386 </span>                :      *  @brief This is an enumerated type.
-<span class="lineNum">     387 </span>                :      *
-<span class="lineNum">     388 </span>                :      *  @c &quot;_Ios_Seekdir&quot; is implementation-defined.  Defined values
-<span class="lineNum">     389 </span>                :      *  of type seekdir are:
-<span class="lineNum">     390 </span>                :      *  - beg
-<span class="lineNum">     391 </span>                :      *  - cur, equivalent to @c SEEK_CUR in the C standard library.
-<span class="lineNum">     392 </span>                :      *  - end, equivalent to @c SEEK_END in the C standard library.
-<span class="lineNum">     393 </span>                :     */
-<span class="lineNum">     394 </span>                :     typedef _Ios_Seekdir seekdir;
-<span class="lineNum">     395 </span>                : 
-<span class="lineNum">     396 </span>                :     /// Request a seek relative to the beginning of the stream.
-<span class="lineNum">     397 </span>                :     static const seekdir beg =          _S_beg;
-<span class="lineNum">     398 </span>                : 
-<span class="lineNum">     399 </span>                :     /// Request a seek relative to the current position within the sequence.
-<span class="lineNum">     400 </span>                :     static const seekdir cur =          _S_cur;
-<span class="lineNum">     401 </span>                : 
-<span class="lineNum">     402 </span>                :     /// Request a seek relative to the current end of the sequence.
-<span class="lineNum">     403 </span>                :     static const seekdir end =          _S_end;
-<span class="lineNum">     404 </span>                : 
-<span class="lineNum">     405 </span>                :     // Annex D.6
-<span class="lineNum">     406 </span>                :     typedef int io_state;
-<span class="lineNum">     407 </span>                :     typedef int open_mode;
-<span class="lineNum">     408 </span>                :     typedef int seek_dir;
-<span class="lineNum">     409 </span>                : 
-<span class="lineNum">     410 </span>                :     typedef std::streampos streampos;
-<span class="lineNum">     411 </span>                :     typedef std::streamoff streamoff;
-<span class="lineNum">     412 </span>                : 
-<span class="lineNum">     413 </span>                :     // Callbacks;
-<span class="lineNum">     414 </span>                :     /**
-<span class="lineNum">     415 </span>                :      *  @brief  The set of events that may be passed to an event callback.
-<span class="lineNum">     416 </span>                :      *
-<span class="lineNum">     417 </span>                :      *  erase_event is used during ~ios() and copyfmt().  imbue_event is used
-<span class="lineNum">     418 </span>                :      *  during imbue().  copyfmt_event is used during copyfmt().
-<span class="lineNum">     419 </span>                :     */
-<span class="lineNum">     420 </span>                :     enum event
-<span class="lineNum">     421 </span>                :     {
-<span class="lineNum">     422 </span>                :       erase_event,
-<span class="lineNum">     423 </span>                :       imbue_event,
-<span class="lineNum">     424 </span>                :       copyfmt_event
-<span class="lineNum">     425 </span>                :     };
-<span class="lineNum">     426 </span>                : 
-<span class="lineNum">     427 </span>                :     /**
-<span class="lineNum">     428 </span>                :      *  @brief  The type of an event callback function.
-<span class="lineNum">     429 </span>                :      *  @param  event  One of the members of the event enum.
-<span class="lineNum">     430 </span>                :      *  @param  ios_base  Reference to the ios_base object.
-<span class="lineNum">     431 </span>                :      *  @param  int  The integer provided when the callback was registered.
-<span class="lineNum">     432 </span>                :      *
-<span class="lineNum">     433 </span>                :      *  Event callbacks are user defined functions that get called during
-<span class="lineNum">     434 </span>                :      *  several ios_base and basic_ios functions, specifically imbue(),
-<span class="lineNum">     435 </span>                :      *  copyfmt(), and ~ios().
-<span class="lineNum">     436 </span>                :     */
-<span class="lineNum">     437 </span>                :     typedef void (*event_callback) (event, ios_base&amp;, int);
-<span class="lineNum">     438 </span>                : 
-<span class="lineNum">     439 </span>                :     /**
-<span class="lineNum">     440 </span>                :      *  @brief  Add the callback __fn with parameter __index.
-<span class="lineNum">     441 </span>                :      *  @param  __fn  The function to add.
-<span class="lineNum">     442 </span>                :      *  @param  __index  The integer to pass to the function when invoked.
-<span class="lineNum">     443 </span>                :      *
-<span class="lineNum">     444 </span>                :      *  Registers a function as an event callback with an integer parameter to
-<span class="lineNum">     445 </span>                :      *  be passed to the function when invoked.  Multiple copies of the
-<span class="lineNum">     446 </span>                :      *  function are allowed.  If there are multiple callbacks, they are
-<span class="lineNum">     447 </span>                :      *  invoked in the order they were registered.
-<span class="lineNum">     448 </span>                :     */
-<span class="lineNum">     449 </span>                :     void
-<span class="lineNum">     450 </span>                :     register_callback(event_callback __fn, int __index);
-<span class="lineNum">     451 </span>                : 
-<span class="lineNum">     452 </span>                :   protected:
-<span class="lineNum">     453 </span>                :     //@{
-<span class="lineNum">     454 </span>                :     /**
-<span class="lineNum">     455 </span>                :      *  ios_base data members (doc me)
-<span class="lineNum">     456 </span>                :     */
-<span class="lineNum">     457 </span>                :     streamsize          _M_precision;
-<span class="lineNum">     458 </span>                :     streamsize          _M_width;
-<span class="lineNum">     459 </span>                :     fmtflags            _M_flags;
-<span class="lineNum">     460 </span>                :     iostate             _M_exception;
-<span class="lineNum">     461 </span>                :     iostate             _M_streambuf_state;
-<span class="lineNum">     462 </span>                :     //@}
-<span class="lineNum">     463 </span>                : 
-<span class="lineNum">     464 </span>                :     // 27.4.2.6  Members for callbacks
-<span class="lineNum">     465 </span>                :     // 27.4.2.6  ios_base callbacks
-<span class="lineNum">     466 </span>                :     struct _Callback_list
-<span class="lineNum">     467 </span>                :     {
-<span class="lineNum">     468 </span>                :       // Data Members
-<span class="lineNum">     469 </span>                :       _Callback_list*           _M_next;
-<span class="lineNum">     470 </span>                :       ios_base::event_callback  _M_fn;
-<span class="lineNum">     471 </span>                :       int                       _M_index;
-<span class="lineNum">     472 </span>                :       _Atomic_word              _M_refcount;  // 0 means one reference.
-<span class="lineNum">     473 </span>                : 
-<span class="lineNum">     474 </span>                :       _Callback_list(ios_base::event_callback __fn, int __index,
-<span class="lineNum">     475 </span>                :                      _Callback_list* __cb)
-<span class="lineNum">     476 </span>                :       : _M_next(__cb), _M_fn(__fn), _M_index(__index), _M_refcount(0) { }
-<span class="lineNum">     477 </span>                : 
-<span class="lineNum">     478 </span>                :       void
-<span class="lineNum">     479 </span>                :       _M_add_reference() { __gnu_cxx::__atomic_add_dispatch(&amp;_M_refcount, 1); }
-<span class="lineNum">     480 </span>                : 
-<span class="lineNum">     481 </span>                :       // 0 =&gt; OK to delete.
-<span class="lineNum">     482 </span>                :       int
-<span class="lineNum">     483 </span>                :       _M_remove_reference() 
-<span class="lineNum">     484 </span>                :       { return __gnu_cxx::__exchange_and_add_dispatch(&amp;_M_refcount, -1); }
-<span class="lineNum">     485 </span>                :     };
-<span class="lineNum">     486 </span>                : 
-<span class="lineNum">     487 </span>                :      _Callback_list*    _M_callbacks;
-<span class="lineNum">     488 </span>                : 
-<span class="lineNum">     489 </span>                :     void
-<span class="lineNum">     490 </span>                :     _M_call_callbacks(event __ev) throw();
-<span class="lineNum">     491 </span>                : 
-<span class="lineNum">     492 </span>                :     void
-<span class="lineNum">     493 </span>                :     _M_dispose_callbacks(void);
-<span class="lineNum">     494 </span>                : 
-<span class="lineNum">     495 </span>                :     // 27.4.2.5  Members for iword/pword storage
-<span class="lineNum">     496 </span>                :     struct _Words
-<span class="lineNum">     497 </span>                :     {
-<span class="lineNum">     498 </span>                :       void*     _M_pword;
-<span class="lineNum">     499 </span>                :       long      _M_iword;
-<span class="lineNum">     500 </span>                :       _Words() : _M_pword(0), _M_iword(0) { }
-<span class="lineNum">     501 </span>                :     };
-<span class="lineNum">     502 </span>                : 
-<span class="lineNum">     503 </span>                :     // Only for failed iword/pword calls.
-<span class="lineNum">     504 </span>                :     _Words              _M_word_zero;
-<span class="lineNum">     505 </span>                : 
-<span class="lineNum">     506 </span>                :     // Guaranteed storage.
-<span class="lineNum">     507 </span>                :     // The first 5 iword and pword slots are reserved for internal use.
-<span class="lineNum">     508 </span>                :     enum { _S_local_word_size = 8 };
-<span class="lineNum">     509 </span>                :     _Words              _M_local_word[_S_local_word_size];
-<span class="lineNum">     510 </span>                : 
-<span class="lineNum">     511 </span>                :     // Allocated storage.
-<span class="lineNum">     512 </span>                :     int                 _M_word_size;
-<span class="lineNum">     513 </span>                :     _Words*             _M_word;
-<span class="lineNum">     514 </span>                : 
-<span class="lineNum">     515 </span>                :     _Words&amp;
-<span class="lineNum">     516 </span>                :     _M_grow_words(int __index, bool __iword);
-<span class="lineNum">     517 </span>                : 
-<span class="lineNum">     518 </span>                :     // Members for locale and locale caching.
-<span class="lineNum">     519 </span>                :     locale              _M_ios_locale;
-<span class="lineNum">     520 </span>                : 
-<span class="lineNum">     521 </span>                :     void
-<span class="lineNum">     522 </span>                :     _M_init();
-<span class="lineNum">     523 </span>                : 
-<span class="lineNum">     524 </span>                :   public:
-<span class="lineNum">     525 </span>                : 
-<span class="lineNum">     526 </span>                :     // 27.4.2.1.6  Class ios_base::Init
-<span class="lineNum">     527 </span>                :     // Used to initialize standard streams. In theory, g++ could use
-<span class="lineNum">     528 </span>                :     // -finit-priority to order this stuff correctly without going
-<span class="lineNum">     529 </span>                :     // through these machinations.
-<span class="lineNum">     530 </span>                :     class Init
-<span class="lineNum">     531 </span>                :     {
-<span class="lineNum">     532 </span>                :       friend class ios_base;
-<span class="lineNum">     533 </span>                :     public:
-<span class="lineNum">     534 </span>                :       Init();
-<span class="lineNum">     535 </span>                :       ~Init();
-<span class="lineNum">     536 </span>                : 
-<span class="lineNum">     537 </span>                :     private:
-<span class="lineNum">     538 </span>                :       static _Atomic_word       _S_refcount;
-<span class="lineNum">     539 </span>                :       static bool               _S_synced_with_stdio;
-<span class="lineNum">     540 </span>                :     };
-<span class="lineNum">     541 </span>                : 
-<span class="lineNum">     542 </span>                :     // [27.4.2.2] fmtflags state functions
-<span class="lineNum">     543 </span>                :     /**
-<span class="lineNum">     544 </span>                :      *  @brief  Access to format flags.
-<span class="lineNum">     545 </span>                :      *  @return  The format control flags for both input and output.
-<span class="lineNum">     546 </span>                :     */
-<span class="lineNum">     547 </span>                :     fmtflags
-<span class="lineNum">     548 </span>                :     flags() const
-<span class="lineNum">     549 </span>                :     { return _M_flags; }
-<span class="lineNum">     550 </span>                : 
-<span class="lineNum">     551 </span>                :     /**
-<span class="lineNum">     552 </span>                :      *  @brief  Setting new format flags all at once.
-<span class="lineNum">     553 </span>                :      *  @param  fmtfl  The new flags to set.
-<span class="lineNum">     554 </span>                :      *  @return  The previous format control flags.
-<span class="lineNum">     555 </span>                :      *
-<span class="lineNum">     556 </span>                :      *  This function overwrites all the format flags with @a fmtfl.
-<span class="lineNum">     557 </span>                :     */
-<span class="lineNum">     558 </span>                :     fmtflags
-<span class="lineNum">     559 </span>                :     flags(fmtflags __fmtfl)
-<span class="lineNum">     560 </span>                :     {
-<span class="lineNum">     561 </span>                :       fmtflags __old = _M_flags;
-<span class="lineNum">     562 </span>                :       _M_flags = __fmtfl;
-<span class="lineNum">     563 </span>                :       return __old;
-<span class="lineNum">     564 </span>                :     }
-<span class="lineNum">     565 </span>                : 
-<span class="lineNum">     566 </span>                :     /**
-<span class="lineNum">     567 </span>                :      *  @brief  Setting new format flags.
-<span class="lineNum">     568 </span>                :      *  @param  fmtfl  Additional flags to set.
-<span class="lineNum">     569 </span>                :      *  @return  The previous format control flags.
-<span class="lineNum">     570 </span>                :      *
-<span class="lineNum">     571 </span>                :      *  This function sets additional flags in format control.  Flags that
-<span class="lineNum">     572 </span>                :      *  were previously set remain set.
-<span class="lineNum">     573 </span>                :     */
-<span class="lineNum">     574 </span>                :     fmtflags
-<span class="lineNum">     575 </span>                :     setf(fmtflags __fmtfl)
-<span class="lineNum">     576 </span>                :     {
-<span class="lineNum">     577 </span>                :       fmtflags __old = _M_flags;
-<span class="lineNum">     578 </span>                :       _M_flags |= __fmtfl;
-<span class="lineNum">     579 </span>                :       return __old;
-<span class="lineNum">     580 </span>                :     }
-<span class="lineNum">     581 </span>                : 
-<span class="lineNum">     582 </span>                :     /**
-<span class="lineNum">     583 </span>                :      *  @brief  Setting new format flags.
-<span class="lineNum">     584 </span>                :      *  @param  fmtfl  Additional flags to set.
-<span class="lineNum">     585 </span>                :      *  @param  mask  The flags mask for @a fmtfl.
-<span class="lineNum">     586 </span>                :      *  @return  The previous format control flags.
-<span class="lineNum">     587 </span>                :      *
-<span class="lineNum">     588 </span>                :      *  This function clears @a mask in the format flags, then sets
-<span class="lineNum">     589 </span>                :      *  @a fmtfl @c &amp; @a mask.  An example mask is @c ios_base::adjustfield.
-<span class="lineNum">     590 </span>                :     */
-<span class="lineNum">     591 </span>                :     fmtflags
-<span class="lineNum">     592 </span><span class="lineCov">             33 :     setf(fmtflags __fmtfl, fmtflags __mask)</span>
-<span class="lineNum">     593 </span>                :     {
-<span class="lineNum">     594 </span><span class="lineCov">             33 :       fmtflags __old = _M_flags;</span>
-<span class="lineNum">     595 </span><span class="lineCov">             33 :       _M_flags &amp;= ~__mask;</span>
-<span class="lineNum">     596 </span><span class="lineCov">             33 :       _M_flags |= (__fmtfl &amp; __mask);</span>
-<span class="lineNum">     597 </span><span class="lineCov">             33 :       return __old;</span>
-<span class="lineNum">     598 </span>                :     }
-<span class="lineNum">     599 </span>                : 
-<span class="lineNum">     600 </span>                :     /**
-<span class="lineNum">     601 </span>                :      *  @brief  Clearing format flags.
-<span class="lineNum">     602 </span>                :      *  @param  mask  The flags to unset.
-<span class="lineNum">     603 </span>                :      *
-<span class="lineNum">     604 </span>                :      *  This function clears @a mask in the format flags.
-<span class="lineNum">     605 </span>                :     */
-<span class="lineNum">     606 </span>                :     void
-<span class="lineNum">     607 </span>                :     unsetf(fmtflags __mask)
-<span class="lineNum">     608 </span>                :     { _M_flags &amp;= ~__mask; }
-<span class="lineNum">     609 </span>                : 
-<span class="lineNum">     610 </span>                :     /**
-<span class="lineNum">     611 </span>                :      *  @brief  Flags access.
-<span class="lineNum">     612 </span>                :      *  @return  The precision to generate on certain output operations.
-<span class="lineNum">     613 </span>                :      *
-<span class="lineNum">     614 </span>                :      *  Be careful if you try to give a definition of &quot;precision&quot; here; see
-<span class="lineNum">     615 </span>                :      *  DR 189.
-<span class="lineNum">     616 </span>                :     */
-<span class="lineNum">     617 </span>                :     streamsize
-<span class="lineNum">     618 </span>                :     precision() const
-<span class="lineNum">     619 </span>                :     { return _M_precision; }
-<span class="lineNum">     620 </span>                : 
-<span class="lineNum">     621 </span>                :     /**
-<span class="lineNum">     622 </span>                :      *  @brief  Changing flags.
-<span class="lineNum">     623 </span>                :      *  @param  prec  The new precision value.
-<span class="lineNum">     624 </span>                :      *  @return  The previous value of precision().
-<span class="lineNum">     625 </span>                :     */
-<span class="lineNum">     626 </span>                :     streamsize
-<span class="lineNum">     627 </span>                :     precision(streamsize __prec)
-<span class="lineNum">     628 </span>                :     {
-<span class="lineNum">     629 </span>                :       streamsize __old = _M_precision;
-<span class="lineNum">     630 </span>                :       _M_precision = __prec;
-<span class="lineNum">     631 </span>                :       return __old;
-<span class="lineNum">     632 </span>                :     }
-<span class="lineNum">     633 </span>                : 
-<span class="lineNum">     634 </span>                :     /**
-<span class="lineNum">     635 </span>                :      *  @brief  Flags access.
-<span class="lineNum">     636 </span>                :      *  @return  The minimum field width to generate on output operations.
-<span class="lineNum">     637 </span>                :      *
-<span class="lineNum">     638 </span>                :      *  &quot;Minimum field width&quot; refers to the number of characters.
-<span class="lineNum">     639 </span>                :     */
-<span class="lineNum">     640 </span>                :     streamsize
-<span class="lineNum">     641 </span>                :     width() const
-<span class="lineNum">     642 </span>                :     { return _M_width; }
-<span class="lineNum">     643 </span>                : 
-<span class="lineNum">     644 </span>                :     /**
-<span class="lineNum">     645 </span>                :      *  @brief  Changing flags.
-<span class="lineNum">     646 </span>                :      *  @param  wide  The new width value.
-<span class="lineNum">     647 </span>                :      *  @return  The previous value of width().
-<span class="lineNum">     648 </span>                :     */
-<span class="lineNum">     649 </span>                :     streamsize
-<span class="lineNum">     650 </span><span class="lineNoCov">              0 :     width(streamsize __wide)</span>
-<span class="lineNum">     651 </span>                :     {
-<span class="lineNum">     652 </span><span class="lineNoCov">              0 :       streamsize __old = _M_width;</span>
-<span class="lineNum">     653 </span><span class="lineNoCov">              0 :       _M_width = __wide;</span>
-<span class="lineNum">     654 </span><span class="lineNoCov">              0 :       return __old;</span>
-<span class="lineNum">     655 </span>                :     }
-<span class="lineNum">     656 </span>                : 
-<span class="lineNum">     657 </span>                :     // [27.4.2.4] ios_base static members
-<span class="lineNum">     658 </span>                :     /**
-<span class="lineNum">     659 </span>                :      *  @brief  Interaction with the standard C I/O objects.
-<span class="lineNum">     660 </span>                :      *  @param  sync  Whether to synchronize or not.
-<span class="lineNum">     661 </span>                :      *  @return  True if the standard streams were previously synchronized.
-<span class="lineNum">     662 </span>                :      *
-<span class="lineNum">     663 </span>                :      *  The synchronization referred to is @e only that between the standard
-<span class="lineNum">     664 </span>                :      *  C facilities (e.g., stdout) and the standard C++ objects (e.g.,
-<span class="lineNum">     665 </span>                :      *  cout).  User-declared streams are unaffected.  See
-<span class="lineNum">     666 </span>                :      *  http://gcc.gnu.org/onlinedocs/libstdc++/27_io/howto.html#8 for more.
-<span class="lineNum">     667 </span>                :     */
-<span class="lineNum">     668 </span>                :     static bool
-<span class="lineNum">     669 </span>                :     sync_with_stdio(bool __sync = true);
-<span class="lineNum">     670 </span>                : 
-<span class="lineNum">     671 </span>                :     // [27.4.2.3] ios_base locale functions
-<span class="lineNum">     672 </span>                :     /**
-<span class="lineNum">     673 </span>                :      *  @brief  Setting a new locale.
-<span class="lineNum">     674 </span>                :      *  @param  loc  The new locale.
-<span class="lineNum">     675 </span>                :      *  @return  The previous locale.
-<span class="lineNum">     676 </span>                :      *
-<span class="lineNum">     677 </span>                :      *  Sets the new locale for this stream, and then invokes each callback
-<span class="lineNum">     678 </span>                :      *  with imbue_event.
-<span class="lineNum">     679 </span>                :     */
-<span class="lineNum">     680 </span>                :     locale
-<span class="lineNum">     681 </span>                :     imbue(const locale&amp; __loc);
-<span class="lineNum">     682 </span>                : 
-<span class="lineNum">     683 </span>                :     /**
-<span class="lineNum">     684 </span>                :      *  @brief  Locale access
-<span class="lineNum">     685 </span>                :      *  @return  A copy of the current locale.
-<span class="lineNum">     686 </span>                :      *
-<span class="lineNum">     687 </span>                :      *  If @c imbue(loc) has previously been called, then this function
-<span class="lineNum">     688 </span>                :      *  returns @c loc.  Otherwise, it returns a copy of @c std::locale(),
-<span class="lineNum">     689 </span>                :      *  the global C++ locale.
-<span class="lineNum">     690 </span>                :     */
-<span class="lineNum">     691 </span>                :     locale
-<span class="lineNum">     692 </span>                :     getloc() const
-<span class="lineNum">     693 </span>                :     { return _M_ios_locale; }
-<span class="lineNum">     694 </span>                : 
-<span class="lineNum">     695 </span>                :     /**
-<span class="lineNum">     696 </span>                :      *  @brief  Locale access
-<span class="lineNum">     697 </span>                :      *  @return  A reference to the current locale.
-<span class="lineNum">     698 </span>                :      *
-<span class="lineNum">     699 </span>                :      *  Like getloc above, but returns a reference instead of
-<span class="lineNum">     700 </span>                :      *  generating a copy.
-<span class="lineNum">     701 </span>                :     */
-<span class="lineNum">     702 </span>                :     const locale&amp;
-<span class="lineNum">     703 </span>                :     _M_getloc() const
-<span class="lineNum">     704 </span>                :     { return _M_ios_locale; }
-<span class="lineNum">     705 </span>                : 
-<span class="lineNum">     706 </span>                :     // [27.4.2.5] ios_base storage functions
-<span class="lineNum">     707 </span>                :     /**
-<span class="lineNum">     708 </span>                :      *  @brief  Access to unique indices.
-<span class="lineNum">     709 </span>                :      *  @return  An integer different from all previous calls.
-<span class="lineNum">     710 </span>                :      *
-<span class="lineNum">     711 </span>                :      *  This function returns a unique integer every time it is called.  It
-<span class="lineNum">     712 </span>                :      *  can be used for any purpose, but is primarily intended to be a unique
-<span class="lineNum">     713 </span>                :      *  index for the iword and pword functions.  The expectation is that an
-<span class="lineNum">     714 </span>                :      *  application calls xalloc in order to obtain an index in the iword and
-<span class="lineNum">     715 </span>                :      *  pword arrays that can be used without fear of conflict.
-<span class="lineNum">     716 </span>                :      *
-<span class="lineNum">     717 </span>                :      *  The implementation maintains a static variable that is incremented and
-<span class="lineNum">     718 </span>                :      *  returned on each invocation.  xalloc is guaranteed to return an index
-<span class="lineNum">     719 </span>                :      *  that is safe to use in the iword and pword arrays.
-<span class="lineNum">     720 </span>                :     */
-<span class="lineNum">     721 </span>                :     static int
-<span class="lineNum">     722 </span>                :     xalloc() throw();
-<span class="lineNum">     723 </span>                : 
-<span class="lineNum">     724 </span>                :     /**
-<span class="lineNum">     725 </span>                :      *  @brief  Access to integer array.
-<span class="lineNum">     726 </span>                :      *  @param  __ix  Index into the array.
-<span class="lineNum">     727 </span>                :      *  @return  A reference to an integer associated with the index.
-<span class="lineNum">     728 </span>                :      *
-<span class="lineNum">     729 </span>                :      *  The iword function provides access to an array of integers that can be
-<span class="lineNum">     730 </span>                :      *  used for any purpose.  The array grows as required to hold the
-<span class="lineNum">     731 </span>                :      *  supplied index.  All integers in the array are initialized to 0.
-<span class="lineNum">     732 </span>                :      *
-<span class="lineNum">     733 </span>                :      *  The implementation reserves several indices.  You should use xalloc to
-<span class="lineNum">     734 </span>                :      *  obtain an index that is safe to use.  Also note that since the array
-<span class="lineNum">     735 </span>                :      *  can grow dynamically, it is not safe to hold onto the reference.
-<span class="lineNum">     736 </span>                :     */
-<span class="lineNum">     737 </span>                :     long&amp;
-<span class="lineNum">     738 </span>                :     iword(int __ix)
-<span class="lineNum">     739 </span>                :     {
-<span class="lineNum">     740 </span>                :       _Words&amp; __word = (__ix &lt; _M_word_size)
-<span class="lineNum">     741 </span>                :                         ? _M_word[__ix] : _M_grow_words(__ix, true);
-<span class="lineNum">     742 </span>                :       return __word._M_iword;
-<span class="lineNum">     743 </span>                :     }
-<span class="lineNum">     744 </span>                : 
-<span class="lineNum">     745 </span>                :     /**
-<span class="lineNum">     746 </span>                :      *  @brief  Access to void pointer array.
-<span class="lineNum">     747 </span>                :      *  @param  __ix  Index into the array.
-<span class="lineNum">     748 </span>                :      *  @return  A reference to a void* associated with the index.
-<span class="lineNum">     749 </span>                :      *
-<span class="lineNum">     750 </span>                :      *  The pword function provides access to an array of pointers that can be
-<span class="lineNum">     751 </span>                :      *  used for any purpose.  The array grows as required to hold the
-<span class="lineNum">     752 </span>                :      *  supplied index.  All pointers in the array are initialized to 0.
-<span class="lineNum">     753 </span>                :      *
-<span class="lineNum">     754 </span>                :      *  The implementation reserves several indices.  You should use xalloc to
-<span class="lineNum">     755 </span>                :      *  obtain an index that is safe to use.  Also note that since the array
-<span class="lineNum">     756 </span>                :      *  can grow dynamically, it is not safe to hold onto the reference.
-<span class="lineNum">     757 </span>                :     */
-<span class="lineNum">     758 </span>                :     void*&amp;
-<span class="lineNum">     759 </span>                :     pword(int __ix)
-<span class="lineNum">     760 </span>                :     {
-<span class="lineNum">     761 </span>                :       _Words&amp; __word = (__ix &lt; _M_word_size)
-<span class="lineNum">     762 </span>                :                         ? _M_word[__ix] : _M_grow_words(__ix, false);
-<span class="lineNum">     763 </span>                :       return __word._M_pword;
-<span class="lineNum">     764 </span>                :     }
-<span class="lineNum">     765 </span>                : 
-<span class="lineNum">     766 </span>                :     // Destructor
-<span class="lineNum">     767 </span>                :     /**
-<span class="lineNum">     768 </span>                :      *  Invokes each callback with erase_event.  Destroys local storage.
-<span class="lineNum">     769 </span>                :      *
-<span class="lineNum">     770 </span>                :      *  Note that the ios_base object for the standard streams never gets
-<span class="lineNum">     771 </span>                :      *  destroyed.  As a result, any callbacks registered with the standard
-<span class="lineNum">     772 </span>                :      *  streams will not get invoked with erase_event (unless copyfmt is
-<span class="lineNum">     773 </span>                :      *  used).
-<span class="lineNum">     774 </span>                :     */
-<span class="lineNum">     775 </span>                :     virtual ~ios_base();
-<span class="lineNum">     776 </span>                : 
-<span class="lineNum">     777 </span>                :   protected:
-<span class="lineNum">     778 </span>                :     ios_base();
-<span class="lineNum">     779 </span>                : 
-<span class="lineNum">     780 </span>                :   // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     781 </span>                :   // 50.  Copy constructor and assignment operator of ios_base
-<span class="lineNum">     782 </span>                :   private:
-<span class="lineNum">     783 </span>                :     ios_base(const ios_base&amp;);
-<span class="lineNum">     784 </span>                : 
-<span class="lineNum">     785 </span>                :     ios_base&amp;
-<span class="lineNum">     786 </span>                :     operator=(const ios_base&amp;);
-<span class="lineNum">     787 </span>                :   };
-<span class="lineNum">     788 </span>                : 
-<span class="lineNum">     789 </span>                :   // [27.4.5.1] fmtflags manipulators
-<span class="lineNum">     790 </span>                :   /// Calls base.setf(ios_base::boolalpha).
-<span class="lineNum">     791 </span>                :   inline ios_base&amp;
-<span class="lineNum">     792 </span>                :   boolalpha(ios_base&amp; __base)
-<span class="lineNum">     793 </span>                :   {
-<span class="lineNum">     794 </span>                :     __base.setf(ios_base::boolalpha);
-<span class="lineNum">     795 </span>                :     return __base;
-<span class="lineNum">     796 </span>                :   }
-<span class="lineNum">     797 </span>                : 
-<span class="lineNum">     798 </span>                :   /// Calls base.unsetf(ios_base::boolalpha).
-<span class="lineNum">     799 </span>                :   inline ios_base&amp;
-<span class="lineNum">     800 </span>                :   noboolalpha(ios_base&amp; __base)
-<span class="lineNum">     801 </span>                :   {
-<span class="lineNum">     802 </span>                :     __base.unsetf(ios_base::boolalpha);
-<span class="lineNum">     803 </span>                :     return __base;
-<span class="lineNum">     804 </span>                :   }
-<span class="lineNum">     805 </span>                : 
-<span class="lineNum">     806 </span>                :   /// Calls base.setf(ios_base::showbase).
-<span class="lineNum">     807 </span>                :   inline ios_base&amp;
-<span class="lineNum">     808 </span>                :   showbase(ios_base&amp; __base)
-<span class="lineNum">     809 </span>                :   {
-<span class="lineNum">     810 </span>                :     __base.setf(ios_base::showbase);
-<span class="lineNum">     811 </span>                :     return __base;
-<span class="lineNum">     812 </span>                :   }
-<span class="lineNum">     813 </span>                : 
-<span class="lineNum">     814 </span>                :   /// Calls base.unsetf(ios_base::showbase).
-<span class="lineNum">     815 </span>                :   inline ios_base&amp;
-<span class="lineNum">     816 </span>                :   noshowbase(ios_base&amp; __base)
-<span class="lineNum">     817 </span>                :   {
-<span class="lineNum">     818 </span>                :     __base.unsetf(ios_base::showbase);
-<span class="lineNum">     819 </span>                :     return __base;
-<span class="lineNum">     820 </span>                :   }
-<span class="lineNum">     821 </span>                : 
-<span class="lineNum">     822 </span>                :   /// Calls base.setf(ios_base::showpoint).
-<span class="lineNum">     823 </span>                :   inline ios_base&amp;
-<span class="lineNum">     824 </span>                :   showpoint(ios_base&amp; __base)
-<span class="lineNum">     825 </span>                :   {
-<span class="lineNum">     826 </span>                :     __base.setf(ios_base::showpoint);
-<span class="lineNum">     827 </span>                :     return __base;
-<span class="lineNum">     828 </span>                :   }
-<span class="lineNum">     829 </span>                : 
-<span class="lineNum">     830 </span>                :   /// Calls base.unsetf(ios_base::showpoint).
-<span class="lineNum">     831 </span>                :   inline ios_base&amp;
-<span class="lineNum">     832 </span>                :   noshowpoint(ios_base&amp; __base)
-<span class="lineNum">     833 </span>                :   {
-<span class="lineNum">     834 </span>                :     __base.unsetf(ios_base::showpoint);
-<span class="lineNum">     835 </span>                :     return __base;
-<span class="lineNum">     836 </span>                :   }
-<span class="lineNum">     837 </span>                : 
-<span class="lineNum">     838 </span>                :   /// Calls base.setf(ios_base::showpos).
-<span class="lineNum">     839 </span>                :   inline ios_base&amp;
-<span class="lineNum">     840 </span>                :   showpos(ios_base&amp; __base)
-<span class="lineNum">     841 </span>                :   {
-<span class="lineNum">     842 </span>                :     __base.setf(ios_base::showpos);
-<span class="lineNum">     843 </span>                :     return __base;
-<span class="lineNum">     844 </span>                :   }
-<span class="lineNum">     845 </span>                : 
-<span class="lineNum">     846 </span>                :   /// Calls base.unsetf(ios_base::showpos).
-<span class="lineNum">     847 </span>                :   inline ios_base&amp;
-<span class="lineNum">     848 </span>                :   noshowpos(ios_base&amp; __base)
-<span class="lineNum">     849 </span>                :   {
-<span class="lineNum">     850 </span>                :     __base.unsetf(ios_base::showpos);
-<span class="lineNum">     851 </span>                :     return __base;
-<span class="lineNum">     852 </span>                :   }
-<span class="lineNum">     853 </span>                : 
-<span class="lineNum">     854 </span>                :   /// Calls base.setf(ios_base::skipws).
-<span class="lineNum">     855 </span>                :   inline ios_base&amp;
-<span class="lineNum">     856 </span>                :   skipws(ios_base&amp; __base)
-<span class="lineNum">     857 </span>                :   {
-<span class="lineNum">     858 </span>                :     __base.setf(ios_base::skipws);
-<span class="lineNum">     859 </span>                :     return __base;
-<span class="lineNum">     860 </span>                :   }
-<span class="lineNum">     861 </span>                : 
-<span class="lineNum">     862 </span>                :   /// Calls base.unsetf(ios_base::skipws).
-<span class="lineNum">     863 </span>                :   inline ios_base&amp;
-<span class="lineNum">     864 </span>                :   noskipws(ios_base&amp; __base)
-<span class="lineNum">     865 </span>                :   {
-<span class="lineNum">     866 </span>                :     __base.unsetf(ios_base::skipws);
-<span class="lineNum">     867 </span>                :     return __base;
-<span class="lineNum">     868 </span>                :   }
-<span class="lineNum">     869 </span>                : 
-<span class="lineNum">     870 </span>                :   /// Calls base.setf(ios_base::uppercase).
-<span class="lineNum">     871 </span>                :   inline ios_base&amp;
-<span class="lineNum">     872 </span>                :   uppercase(ios_base&amp; __base)
-<span class="lineNum">     873 </span>                :   {
-<span class="lineNum">     874 </span>                :     __base.setf(ios_base::uppercase);
-<span class="lineNum">     875 </span>                :     return __base;
-<span class="lineNum">     876 </span>                :   }
-<span class="lineNum">     877 </span>                : 
-<span class="lineNum">     878 </span>                :   /// Calls base.unsetf(ios_base::uppercase).
-<span class="lineNum">     879 </span>                :   inline ios_base&amp;
-<span class="lineNum">     880 </span>                :   nouppercase(ios_base&amp; __base)
-<span class="lineNum">     881 </span>                :   {
-<span class="lineNum">     882 </span>                :     __base.unsetf(ios_base::uppercase);
-<span class="lineNum">     883 </span>                :     return __base;
-<span class="lineNum">     884 </span>                :   }
-<span class="lineNum">     885 </span>                : 
-<span class="lineNum">     886 </span>                :   /// Calls base.setf(ios_base::unitbuf).
-<span class="lineNum">     887 </span>                :   inline ios_base&amp;
-<span class="lineNum">     888 </span>                :   unitbuf(ios_base&amp; __base)
-<span class="lineNum">     889 </span>                :   {
-<span class="lineNum">     890 </span>                :      __base.setf(ios_base::unitbuf);
-<span class="lineNum">     891 </span>                :      return __base;
-<span class="lineNum">     892 </span>                :   }
-<span class="lineNum">     893 </span>                : 
-<span class="lineNum">     894 </span>                :   /// Calls base.unsetf(ios_base::unitbuf).
-<span class="lineNum">     895 </span>                :   inline ios_base&amp;
-<span class="lineNum">     896 </span>                :   nounitbuf(ios_base&amp; __base)
-<span class="lineNum">     897 </span>                :   {
-<span class="lineNum">     898 </span>                :      __base.unsetf(ios_base::unitbuf);
-<span class="lineNum">     899 </span>                :      return __base;
-<span class="lineNum">     900 </span>                :   }
-<span class="lineNum">     901 </span>                : 
-<span class="lineNum">     902 </span>                :   // [27.4.5.2] adjustfield manipulators
-<span class="lineNum">     903 </span>                :   /// Calls base.setf(ios_base::internal, ios_base::adjustfield).
-<span class="lineNum">     904 </span>                :   inline ios_base&amp;
-<span class="lineNum">     905 </span><span class="lineCov">             33 :   internal(ios_base&amp; __base)</span>
-<span class="lineNum">     906 </span>                :   {
-<span class="lineNum">     907 </span><span class="lineCov">             33 :      __base.setf(ios_base::internal, ios_base::adjustfield);</span>
-<span class="lineNum">     908 </span><span class="lineCov">             33 :      return __base;</span>
-<span class="lineNum">     909 </span>                :   }
-<span class="lineNum">     910 </span>                : 
-<span class="lineNum">     911 </span>                :   /// Calls base.setf(ios_base::left, ios_base::adjustfield).
-<span class="lineNum">     912 </span>                :   inline ios_base&amp;
-<span class="lineNum">     913 </span>                :   left(ios_base&amp; __base)
-<span class="lineNum">     914 </span>                :   {
-<span class="lineNum">     915 </span>                :     __base.setf(ios_base::left, ios_base::adjustfield);
-<span class="lineNum">     916 </span>                :     return __base;
-<span class="lineNum">     917 </span>                :   }
-<span class="lineNum">     918 </span>                : 
-<span class="lineNum">     919 </span>                :   /// Calls base.setf(ios_base::right, ios_base::adjustfield).
-<span class="lineNum">     920 </span>                :   inline ios_base&amp;
-<span class="lineNum">     921 </span>                :   right(ios_base&amp; __base)
-<span class="lineNum">     922 </span>                :   {
-<span class="lineNum">     923 </span>                :     __base.setf(ios_base::right, ios_base::adjustfield);
-<span class="lineNum">     924 </span>                :     return __base;
-<span class="lineNum">     925 </span>                :   }
-<span class="lineNum">     926 </span>                : 
-<span class="lineNum">     927 </span>                :   // [27.4.5.3] basefield manipulators
-<span class="lineNum">     928 </span>                :   /// Calls base.setf(ios_base::dec, ios_base::basefield).
-<span class="lineNum">     929 </span>                :   inline ios_base&amp;
-<span class="lineNum">     930 </span>                :   dec(ios_base&amp; __base)
-<span class="lineNum">     931 </span>                :   {
-<span class="lineNum">     932 </span>                :     __base.setf(ios_base::dec, ios_base::basefield);
-<span class="lineNum">     933 </span>                :     return __base;
-<span class="lineNum">     934 </span>                :   }
-<span class="lineNum">     935 </span>                : 
-<span class="lineNum">     936 </span>                :   /// Calls base.setf(ios_base::hex, ios_base::basefield).
-<span class="lineNum">     937 </span>                :   inline ios_base&amp;
-<span class="lineNum">     938 </span>                :   hex(ios_base&amp; __base)
-<span class="lineNum">     939 </span>                :   {
-<span class="lineNum">     940 </span>                :     __base.setf(ios_base::hex, ios_base::basefield);
-<span class="lineNum">     941 </span>                :     return __base;
-<span class="lineNum">     942 </span>                :   }
-<span class="lineNum">     943 </span>                : 
-<span class="lineNum">     944 </span>                :   /// Calls base.setf(ios_base::oct, ios_base::basefield).
-<span class="lineNum">     945 </span>                :   inline ios_base&amp;
-<span class="lineNum">     946 </span>                :   oct(ios_base&amp; __base)
-<span class="lineNum">     947 </span>                :   {
-<span class="lineNum">     948 </span>                :     __base.setf(ios_base::oct, ios_base::basefield);
-<span class="lineNum">     949 </span>                :     return __base;
-<span class="lineNum">     950 </span>                :   }
-<span class="lineNum">     951 </span>                : 
-<span class="lineNum">     952 </span>                :   // [27.4.5.4] floatfield manipulators
-<span class="lineNum">     953 </span>                :   /// Calls base.setf(ios_base::fixed, ios_base::floatfield).
-<span class="lineNum">     954 </span>                :   inline ios_base&amp;
-<span class="lineNum">     955 </span>                :   fixed(ios_base&amp; __base)
-<span class="lineNum">     956 </span>                :   {
-<span class="lineNum">     957 </span>                :     __base.setf(ios_base::fixed, ios_base::floatfield);
-<span class="lineNum">     958 </span>                :     return __base;
-<span class="lineNum">     959 </span>                :   }
-<span class="lineNum">     960 </span>                : 
-<span class="lineNum">     961 </span>                :   /// Calls base.setf(ios_base::scientific, ios_base::floatfield).
-<span class="lineNum">     962 </span>                :   inline ios_base&amp;
-<span class="lineNum">     963 </span>                :   scientific(ios_base&amp; __base)
-<span class="lineNum">     964 </span>                :   {
-<span class="lineNum">     965 </span>                :     __base.setf(ios_base::scientific, ios_base::floatfield);
-<span class="lineNum">     966 </span>                :     return __base;
-<span class="lineNum">     967 </span>                :   }
-<span class="lineNum">     968 </span>                : 
-<span class="lineNum">     969 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">     970 </span>                : 
-<span class="lineNum">     971 </span>                : #endif /* _IOS_BASE_H */
-<span class="lineNum">     972 </span>                : 
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/bits/list.tcc.gcov.html b/rep/usr/include/c++/4.3/bits/list.tcc.gcov.html
deleted file mode 100644
index 18b3b6a..0000000
--- a/rep/usr/include/c++/4.3/bits/list.tcc.gcov.html
+++ /dev/null
@@ -1,484 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/list.tcc</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - list.tcc</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">11</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">11</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // List implementation (out of line) -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007
-<span class="lineNum">       4 </span>                : // Free Software Foundation, Inc.
-<span class="lineNum">       5 </span>                : //
-<span class="lineNum">       6 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       7 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       8 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">       9 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      10 </span>                : // any later version.
-<span class="lineNum">      11 </span>                : 
-<span class="lineNum">      12 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      13 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      14 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      15 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      16 </span>                : 
-<span class="lineNum">      17 </span>                : // You should have received a copy of the GNU General Public License along
-<span class="lineNum">      18 </span>                : // with this library; see the file COPYING.  If not, write to the Free
-<span class="lineNum">      19 </span>                : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-<span class="lineNum">      20 </span>                : // USA.
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      23 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      24 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      25 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      26 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      27 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      28 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      29 </span>                : // the GNU General Public License.
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : /*
-<span class="lineNum">      32 </span>                :  *
-<span class="lineNum">      33 </span>                :  * Copyright (c) 1994
-<span class="lineNum">      34 </span>                :  * Hewlett-Packard Company
-<span class="lineNum">      35 </span>                :  *
-<span class="lineNum">      36 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      37 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      38 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      39 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      40 </span>                :  * in supporting documentation.  Hewlett-Packard Company makes no
-<span class="lineNum">      41 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      42 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      43 </span>                :  *
-<span class="lineNum">      44 </span>                :  *
-<span class="lineNum">      45 </span>                :  * Copyright (c) 1996,1997
-<span class="lineNum">      46 </span>                :  * Silicon Graphics Computer Systems, Inc.
-<span class="lineNum">      47 </span>                :  *
-<span class="lineNum">      48 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      49 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      50 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      51 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      52 </span>                :  * in supporting documentation.  Silicon Graphics makes no
-<span class="lineNum">      53 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      54 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      55 </span>                :  */
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span>                : /** @file list.tcc
-<span class="lineNum">      58 </span>                :  *  This is an internal header file, included by other library headers.
-<span class="lineNum">      59 </span>                :  *  You should not attempt to use it directly.
-<span class="lineNum">      60 </span>                :  */
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span>                : #ifndef _LIST_TCC
-<span class="lineNum">      63 </span>                : #define _LIST_TCC 1
-<span class="lineNum">      64 </span>                : 
-<span class="lineNum">      65 </span>                : _GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D)
-<span class="lineNum">      66 </span>                : 
-<span class="lineNum">      67 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">      68 </span>                :     void
-<span class="lineNum">      69 </span>                :     _List_base&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">      70 </span><span class="lineCov">             19 :     _M_clear()</span>
-<span class="lineNum">      71 </span>                :     {
-<span class="lineNum">      72 </span>                :       typedef _List_node&lt;_Tp&gt;  _Node;
-<span class="lineNum">      73 </span><span class="lineCov">             19 :       _Node* __cur = static_cast&lt;_Node*&gt;(this-&gt;_M_impl._M_node._M_next);</span>
-<span class="lineNum">      74 </span><span class="lineCov">             60 :       while (__cur != &amp;this-&gt;_M_impl._M_node)</span>
-<span class="lineNum">      75 </span>                :         {
-<span class="lineNum">      76 </span><span class="lineCov">             22 :           _Node* __tmp = __cur;</span>
-<span class="lineNum">      77 </span><span class="lineCov">             22 :           __cur = static_cast&lt;_Node*&gt;(__cur-&gt;_M_next);</span>
-<span class="lineNum">      78 </span><span class="lineCov">             22 :           _M_get_Tp_allocator().destroy(&amp;__tmp-&gt;_M_data);</span>
-<span class="lineNum">      79 </span><span class="lineCov">             22 :           _M_put_node(__tmp);</span>
-<span class="lineNum">      80 </span>                :         }
-<span class="lineNum">      81 </span><span class="lineCov">             19 :     }</span>
-<span class="lineNum">      82 </span>                : 
-<span class="lineNum">      83 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">      84 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">      85 </span>                :     template&lt;typename... _Args&gt;
-<span class="lineNum">      86 </span>                :       typename list&lt;_Tp, _Alloc&gt;::iterator
-<span class="lineNum">      87 </span>                :       list&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">      88 </span>                :       emplace(iterator __position, _Args&amp;&amp;... __args)
-<span class="lineNum">      89 </span>                :       {
-<span class="lineNum">      90 </span>                :         _Node* __tmp = _M_create_node(std::forward&lt;_Args&gt;(__args)...);
-<span class="lineNum">      91 </span>                :         __tmp-&gt;hook(__position._M_node);
-<span class="lineNum">      92 </span>                :         return iterator(__tmp);
-<span class="lineNum">      93 </span>                :       }
-<span class="lineNum">      94 </span>                : #endif
-<span class="lineNum">      95 </span>                : 
-<span class="lineNum">      96 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">      97 </span>                :     typename list&lt;_Tp, _Alloc&gt;::iterator
-<span class="lineNum">      98 </span>                :     list&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">      99 </span>                :     insert(iterator __position, const value_type&amp; __x)
-<span class="lineNum">     100 </span>                :     {
-<span class="lineNum">     101 </span>                :       _Node* __tmp = _M_create_node(__x);
-<span class="lineNum">     102 </span>                :       __tmp-&gt;hook(__position._M_node);
-<span class="lineNum">     103 </span>                :       return iterator(__tmp);
-<span class="lineNum">     104 </span>                :     }
-<span class="lineNum">     105 </span>                : 
-<span class="lineNum">     106 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     107 </span>                :     typename list&lt;_Tp, _Alloc&gt;::iterator
-<span class="lineNum">     108 </span>                :     list&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     109 </span><span class="lineCov">             25 :     erase(iterator __position)</span>
-<span class="lineNum">     110 </span>                :     {
-<span class="lineNum">     111 </span><span class="lineCov">             25 :       iterator __ret = iterator(__position._M_node-&gt;_M_next);</span>
-<span class="lineNum">     112 </span><span class="lineCov">             25 :       _M_erase(__position);</span>
-<span class="lineNum">     113 </span>                :       return __ret;
-<span class="lineNum">     114 </span>                :     }
-<span class="lineNum">     115 </span>                : 
-<span class="lineNum">     116 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     117 </span>                :     void
-<span class="lineNum">     118 </span>                :     list&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     119 </span>                :     resize(size_type __new_size, value_type __x)
-<span class="lineNum">     120 </span>                :     {
-<span class="lineNum">     121 </span>                :       iterator __i = begin();
-<span class="lineNum">     122 </span>                :       size_type __len = 0;
-<span class="lineNum">     123 </span>                :       for (; __i != end() &amp;&amp; __len &lt; __new_size; ++__i, ++__len)
-<span class="lineNum">     124 </span>                :         ;
-<span class="lineNum">     125 </span>                :       if (__len == __new_size)
-<span class="lineNum">     126 </span>                :         erase(__i, end());
-<span class="lineNum">     127 </span>                :       else                          // __i == end()
-<span class="lineNum">     128 </span>                :         insert(end(), __new_size - __len, __x);
-<span class="lineNum">     129 </span>                :     }
-<span class="lineNum">     130 </span>                : 
-<span class="lineNum">     131 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     132 </span>                :     list&lt;_Tp, _Alloc&gt;&amp;
-<span class="lineNum">     133 </span>                :     list&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     134 </span>                :     operator=(const list&amp; __x)
-<span class="lineNum">     135 </span>                :     {
-<span class="lineNum">     136 </span>                :       if (this != &amp;__x)
-<span class="lineNum">     137 </span>                :         {
-<span class="lineNum">     138 </span>                :           iterator __first1 = begin();
-<span class="lineNum">     139 </span>                :           iterator __last1 = end();
-<span class="lineNum">     140 </span>                :           const_iterator __first2 = __x.begin();
-<span class="lineNum">     141 </span>                :           const_iterator __last2 = __x.end();
-<span class="lineNum">     142 </span>                :           for (; __first1 != __last1 &amp;&amp; __first2 != __last2;
-<span class="lineNum">     143 </span>                :                ++__first1, ++__first2)
-<span class="lineNum">     144 </span>                :             *__first1 = *__first2;
-<span class="lineNum">     145 </span>                :           if (__first2 == __last2)
-<span class="lineNum">     146 </span>                :             erase(__first1, __last1);
-<span class="lineNum">     147 </span>                :           else
-<span class="lineNum">     148 </span>                :             insert(__last1, __first2, __last2);
-<span class="lineNum">     149 </span>                :         }
-<span class="lineNum">     150 </span>                :       return *this;
-<span class="lineNum">     151 </span>                :     }
-<span class="lineNum">     152 </span>                : 
-<span class="lineNum">     153 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     154 </span>                :     void
-<span class="lineNum">     155 </span>                :     list&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     156 </span>                :     _M_fill_assign(size_type __n, const value_type&amp; __val)
-<span class="lineNum">     157 </span>                :     {
-<span class="lineNum">     158 </span>                :       iterator __i = begin();
-<span class="lineNum">     159 </span>                :       for (; __i != end() &amp;&amp; __n &gt; 0; ++__i, --__n)
-<span class="lineNum">     160 </span>                :         *__i = __val;
-<span class="lineNum">     161 </span>                :       if (__n &gt; 0)
-<span class="lineNum">     162 </span>                :         insert(end(), __n, __val);
-<span class="lineNum">     163 </span>                :       else
-<span class="lineNum">     164 </span>                :         erase(__i, end());
-<span class="lineNum">     165 </span>                :     }
-<span class="lineNum">     166 </span>                : 
-<span class="lineNum">     167 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     168 </span>                :     template &lt;typename _InputIterator&gt;
-<span class="lineNum">     169 </span>                :       void
-<span class="lineNum">     170 </span>                :       list&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     171 </span>                :       _M_assign_dispatch(_InputIterator __first2, _InputIterator __last2,
-<span class="lineNum">     172 </span>                :                          __false_type)
-<span class="lineNum">     173 </span>                :       {
-<span class="lineNum">     174 </span>                :         iterator __first1 = begin();
-<span class="lineNum">     175 </span>                :         iterator __last1 = end();
-<span class="lineNum">     176 </span>                :         for (; __first1 != __last1 &amp;&amp; __first2 != __last2;
-<span class="lineNum">     177 </span>                :              ++__first1, ++__first2)
-<span class="lineNum">     178 </span>                :           *__first1 = *__first2;
-<span class="lineNum">     179 </span>                :         if (__first2 == __last2)
-<span class="lineNum">     180 </span>                :           erase(__first1, __last1);
-<span class="lineNum">     181 </span>                :         else
-<span class="lineNum">     182 </span>                :           insert(__last1, __first2, __last2);
-<span class="lineNum">     183 </span>                :       }
-<span class="lineNum">     184 </span>                : 
-<span class="lineNum">     185 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     186 </span>                :     void
-<span class="lineNum">     187 </span>                :     list&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     188 </span>                :     remove(const value_type&amp; __value)
-<span class="lineNum">     189 </span>                :     {
-<span class="lineNum">     190 </span>                :       iterator __first = begin();
-<span class="lineNum">     191 </span>                :       iterator __last = end();
-<span class="lineNum">     192 </span>                :       iterator __extra = __last;
-<span class="lineNum">     193 </span>                :       while (__first != __last)
-<span class="lineNum">     194 </span>                :         {
-<span class="lineNum">     195 </span>                :           iterator __next = __first;
-<span class="lineNum">     196 </span>                :           ++__next;
-<span class="lineNum">     197 </span>                :           if (*__first == __value)
-<span class="lineNum">     198 </span>                :             {
-<span class="lineNum">     199 </span>                :               // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     200 </span>                :               // 526. Is it undefined if a function in the standard changes
-<span class="lineNum">     201 </span>                :               // in parameters?
-<span class="lineNum">     202 </span>                :               if (&amp;*__first != &amp;__value)
-<span class="lineNum">     203 </span>                :                 _M_erase(__first);
-<span class="lineNum">     204 </span>                :               else
-<span class="lineNum">     205 </span>                :                 __extra = __first;
-<span class="lineNum">     206 </span>                :             }
-<span class="lineNum">     207 </span>                :           __first = __next;
-<span class="lineNum">     208 </span>                :         }
-<span class="lineNum">     209 </span>                :       if (__extra != __last)
-<span class="lineNum">     210 </span>                :         _M_erase(__extra);
-<span class="lineNum">     211 </span>                :     }
-<span class="lineNum">     212 </span>                : 
-<span class="lineNum">     213 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     214 </span>                :     void
-<span class="lineNum">     215 </span>                :     list&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     216 </span>                :     unique()
-<span class="lineNum">     217 </span>                :     {
-<span class="lineNum">     218 </span>                :       iterator __first = begin();
-<span class="lineNum">     219 </span>                :       iterator __last = end();
-<span class="lineNum">     220 </span>                :       if (__first == __last)
-<span class="lineNum">     221 </span>                :         return;
-<span class="lineNum">     222 </span>                :       iterator __next = __first;
-<span class="lineNum">     223 </span>                :       while (++__next != __last)
-<span class="lineNum">     224 </span>                :         {
-<span class="lineNum">     225 </span>                :           if (*__first == *__next)
-<span class="lineNum">     226 </span>                :             _M_erase(__next);
-<span class="lineNum">     227 </span>                :           else
-<span class="lineNum">     228 </span>                :             __first = __next;
-<span class="lineNum">     229 </span>                :           __next = __first;
-<span class="lineNum">     230 </span>                :         }
-<span class="lineNum">     231 </span>                :     }
-<span class="lineNum">     232 </span>                : 
-<span class="lineNum">     233 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     234 </span>                :     void
-<span class="lineNum">     235 </span>                :     list&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     236 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     237 </span>                :     merge(list&amp;&amp; __x)
-<span class="lineNum">     238 </span>                : #else
-<span class="lineNum">     239 </span>                :     merge(list&amp; __x)
-<span class="lineNum">     240 </span>                : #endif
-<span class="lineNum">     241 </span>                :     {
-<span class="lineNum">     242 </span>                :       // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     243 </span>                :       // 300. list::merge() specification incomplete
-<span class="lineNum">     244 </span>                :       if (this != &amp;__x)
-<span class="lineNum">     245 </span>                :         {
-<span class="lineNum">     246 </span>                :           _M_check_equal_allocators(__x); 
-<span class="lineNum">     247 </span>                : 
-<span class="lineNum">     248 </span>                :           iterator __first1 = begin();
-<span class="lineNum">     249 </span>                :           iterator __last1 = end();
-<span class="lineNum">     250 </span>                :           iterator __first2 = __x.begin();
-<span class="lineNum">     251 </span>                :           iterator __last2 = __x.end();
-<span class="lineNum">     252 </span>                :           while (__first1 != __last1 &amp;&amp; __first2 != __last2)
-<span class="lineNum">     253 </span>                :             if (*__first2 &lt; *__first1)
-<span class="lineNum">     254 </span>                :               {
-<span class="lineNum">     255 </span>                :                 iterator __next = __first2;
-<span class="lineNum">     256 </span>                :                 _M_transfer(__first1, __first2, ++__next);
-<span class="lineNum">     257 </span>                :                 __first2 = __next;
-<span class="lineNum">     258 </span>                :               }
-<span class="lineNum">     259 </span>                :             else
-<span class="lineNum">     260 </span>                :               ++__first1;
-<span class="lineNum">     261 </span>                :           if (__first2 != __last2)
-<span class="lineNum">     262 </span>                :             _M_transfer(__last1, __first2, __last2);
-<span class="lineNum">     263 </span>                :         }
-<span class="lineNum">     264 </span>                :     }
-<span class="lineNum">     265 </span>                : 
-<span class="lineNum">     266 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     267 </span>                :     template &lt;typename _StrictWeakOrdering&gt;
-<span class="lineNum">     268 </span>                :       void
-<span class="lineNum">     269 </span>                :       list&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     270 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     271 </span>                :       merge(list&amp;&amp; __x, _StrictWeakOrdering __comp)
-<span class="lineNum">     272 </span>                : #else
-<span class="lineNum">     273 </span>                :       merge(list&amp; __x, _StrictWeakOrdering __comp)
-<span class="lineNum">     274 </span>                : #endif
-<span class="lineNum">     275 </span>                :       {
-<span class="lineNum">     276 </span>                :         // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     277 </span>                :         // 300. list::merge() specification incomplete
-<span class="lineNum">     278 </span>                :         if (this != &amp;__x)
-<span class="lineNum">     279 </span>                :           {
-<span class="lineNum">     280 </span>                :             _M_check_equal_allocators(__x);
-<span class="lineNum">     281 </span>                : 
-<span class="lineNum">     282 </span>                :             iterator __first1 = begin();
-<span class="lineNum">     283 </span>                :             iterator __last1 = end();
-<span class="lineNum">     284 </span>                :             iterator __first2 = __x.begin();
-<span class="lineNum">     285 </span>                :             iterator __last2 = __x.end();
-<span class="lineNum">     286 </span>                :             while (__first1 != __last1 &amp;&amp; __first2 != __last2)
-<span class="lineNum">     287 </span>                :               if (__comp(*__first2, *__first1))
-<span class="lineNum">     288 </span>                :                 {
-<span class="lineNum">     289 </span>                :                   iterator __next = __first2;
-<span class="lineNum">     290 </span>                :                   _M_transfer(__first1, __first2, ++__next);
-<span class="lineNum">     291 </span>                :                   __first2 = __next;
-<span class="lineNum">     292 </span>                :                 }
-<span class="lineNum">     293 </span>                :               else
-<span class="lineNum">     294 </span>                :                 ++__first1;
-<span class="lineNum">     295 </span>                :             if (__first2 != __last2)
-<span class="lineNum">     296 </span>                :               _M_transfer(__last1, __first2, __last2);
-<span class="lineNum">     297 </span>                :           }
-<span class="lineNum">     298 </span>                :       }
-<span class="lineNum">     299 </span>                : 
-<span class="lineNum">     300 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     301 </span>                :     void
-<span class="lineNum">     302 </span>                :     list&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     303 </span>                :     sort()
-<span class="lineNum">     304 </span>                :     {
-<span class="lineNum">     305 </span>                :       // Do nothing if the list has length 0 or 1.
-<span class="lineNum">     306 </span>                :       if (this-&gt;_M_impl._M_node._M_next != &amp;this-&gt;_M_impl._M_node
-<span class="lineNum">     307 </span>                :           &amp;&amp; this-&gt;_M_impl._M_node._M_next-&gt;_M_next != &amp;this-&gt;_M_impl._M_node)
-<span class="lineNum">     308 </span>                :       {
-<span class="lineNum">     309 </span>                :         list __carry;
-<span class="lineNum">     310 </span>                :         list __tmp[64];
-<span class="lineNum">     311 </span>                :         list * __fill = &amp;__tmp[0];
-<span class="lineNum">     312 </span>                :         list * __counter;
-<span class="lineNum">     313 </span>                : 
-<span class="lineNum">     314 </span>                :         do
-<span class="lineNum">     315 </span>                :           {
-<span class="lineNum">     316 </span>                :             __carry.splice(__carry.begin(), *this, begin());
-<span class="lineNum">     317 </span>                : 
-<span class="lineNum">     318 </span>                :             for(__counter = &amp;__tmp[0];
-<span class="lineNum">     319 </span>                :                 __counter != __fill &amp;&amp; !__counter-&gt;empty();
-<span class="lineNum">     320 </span>                :                 ++__counter)
-<span class="lineNum">     321 </span>                :               {
-<span class="lineNum">     322 </span>                :                 __counter-&gt;merge(__carry);
-<span class="lineNum">     323 </span>                :                 __carry.swap(*__counter);
-<span class="lineNum">     324 </span>                :               }
-<span class="lineNum">     325 </span>                :             __carry.swap(*__counter);
-<span class="lineNum">     326 </span>                :             if (__counter == __fill)
-<span class="lineNum">     327 </span>                :               ++__fill;
-<span class="lineNum">     328 </span>                :           }
-<span class="lineNum">     329 </span>                :         while ( !empty() );
-<span class="lineNum">     330 </span>                : 
-<span class="lineNum">     331 </span>                :         for (__counter = &amp;__tmp[1]; __counter != __fill; ++__counter)
-<span class="lineNum">     332 </span>                :           __counter-&gt;merge(*(__counter - 1));
-<span class="lineNum">     333 </span>                :         swap( *(__fill - 1) );
-<span class="lineNum">     334 </span>                :       }
-<span class="lineNum">     335 </span>                :     }
-<span class="lineNum">     336 </span>                : 
-<span class="lineNum">     337 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     338 </span>                :     template &lt;typename _Predicate&gt;
-<span class="lineNum">     339 </span>                :       void
-<span class="lineNum">     340 </span>                :       list&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     341 </span>                :       remove_if(_Predicate __pred)
-<span class="lineNum">     342 </span>                :       {
-<span class="lineNum">     343 </span>                :         iterator __first = begin();
-<span class="lineNum">     344 </span>                :         iterator __last = end();
-<span class="lineNum">     345 </span>                :         while (__first != __last)
-<span class="lineNum">     346 </span>                :           {
-<span class="lineNum">     347 </span>                :             iterator __next = __first;
-<span class="lineNum">     348 </span>                :             ++__next;
-<span class="lineNum">     349 </span>                :             if (__pred(*__first))
-<span class="lineNum">     350 </span>                :               _M_erase(__first);
-<span class="lineNum">     351 </span>                :             __first = __next;
-<span class="lineNum">     352 </span>                :           }
-<span class="lineNum">     353 </span>                :       }
-<span class="lineNum">     354 </span>                : 
-<span class="lineNum">     355 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     356 </span>                :     template &lt;typename _BinaryPredicate&gt;
-<span class="lineNum">     357 </span>                :       void
-<span class="lineNum">     358 </span>                :       list&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     359 </span>                :       unique(_BinaryPredicate __binary_pred)
-<span class="lineNum">     360 </span>                :       {
-<span class="lineNum">     361 </span>                :         iterator __first = begin();
-<span class="lineNum">     362 </span>                :         iterator __last = end();
-<span class="lineNum">     363 </span>                :         if (__first == __last)
-<span class="lineNum">     364 </span>                :           return;
-<span class="lineNum">     365 </span>                :         iterator __next = __first;
-<span class="lineNum">     366 </span>                :         while (++__next != __last)
-<span class="lineNum">     367 </span>                :           {
-<span class="lineNum">     368 </span>                :             if (__binary_pred(*__first, *__next))
-<span class="lineNum">     369 </span>                :               _M_erase(__next);
-<span class="lineNum">     370 </span>                :             else
-<span class="lineNum">     371 </span>                :               __first = __next;
-<span class="lineNum">     372 </span>                :             __next = __first;
-<span class="lineNum">     373 </span>                :           }
-<span class="lineNum">     374 </span>                :       }
-<span class="lineNum">     375 </span>                : 
-<span class="lineNum">     376 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     377 </span>                :     template &lt;typename _StrictWeakOrdering&gt;
-<span class="lineNum">     378 </span>                :       void
-<span class="lineNum">     379 </span>                :       list&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     380 </span>                :       sort(_StrictWeakOrdering __comp)
-<span class="lineNum">     381 </span>                :       {
-<span class="lineNum">     382 </span>                :         // Do nothing if the list has length 0 or 1.
-<span class="lineNum">     383 </span>                :         if (this-&gt;_M_impl._M_node._M_next != &amp;this-&gt;_M_impl._M_node
-<span class="lineNum">     384 </span>                :             &amp;&amp; this-&gt;_M_impl._M_node._M_next-&gt;_M_next != &amp;this-&gt;_M_impl._M_node)
-<span class="lineNum">     385 </span>                :           {
-<span class="lineNum">     386 </span>                :             list __carry;
-<span class="lineNum">     387 </span>                :             list __tmp[64];
-<span class="lineNum">     388 </span>                :             list * __fill = &amp;__tmp[0];
-<span class="lineNum">     389 </span>                :             list * __counter;
-<span class="lineNum">     390 </span>                : 
-<span class="lineNum">     391 </span>                :             do
-<span class="lineNum">     392 </span>                :               {
-<span class="lineNum">     393 </span>                :                 __carry.splice(__carry.begin(), *this, begin());
-<span class="lineNum">     394 </span>                : 
-<span class="lineNum">     395 </span>                :                 for(__counter = &amp;__tmp[0];
-<span class="lineNum">     396 </span>                :                     __counter != __fill &amp;&amp; !__counter-&gt;empty();
-<span class="lineNum">     397 </span>                :                     ++__counter)
-<span class="lineNum">     398 </span>                :                   {
-<span class="lineNum">     399 </span>                :                     __counter-&gt;merge(__carry, __comp);
-<span class="lineNum">     400 </span>                :                     __carry.swap(*__counter);
-<span class="lineNum">     401 </span>                :                   }
-<span class="lineNum">     402 </span>                :                 __carry.swap(*__counter);
-<span class="lineNum">     403 </span>                :                 if (__counter == __fill)
-<span class="lineNum">     404 </span>                :                   ++__fill;
-<span class="lineNum">     405 </span>                :               }
-<span class="lineNum">     406 </span>                :             while ( !empty() );
-<span class="lineNum">     407 </span>                : 
-<span class="lineNum">     408 </span>                :             for (__counter = &amp;__tmp[1]; __counter != __fill; ++__counter)
-<span class="lineNum">     409 </span>                :               __counter-&gt;merge(*(__counter - 1), __comp);
-<span class="lineNum">     410 </span>                :             swap(*(__fill - 1));
-<span class="lineNum">     411 </span>                :           }
-<span class="lineNum">     412 </span>                :       }
-<span class="lineNum">     413 </span>                : 
-<span class="lineNum">     414 </span>                : _GLIBCXX_END_NESTED_NAMESPACE
-<span class="lineNum">     415 </span>                : 
-<span class="lineNum">     416 </span>                : #endif /* _LIST_TCC */
-<span class="lineNum">     417 </span>                : 
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/bits/locale_facets.h.gcov.html b/rep/usr/include/c++/4.3/bits/locale_facets.h.gcov.html
deleted file mode 100644
index d54e58e..0000000
--- a/rep/usr/include/c++/4.3/bits/locale_facets.h.gcov.html
+++ /dev/null
@@ -1,2705 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/locale_facets.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - locale_facets.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">13</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">0.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">0</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // Locale support -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005,
-<span class="lineNum">       4 </span>                : // 2006, 2007
-<span class="lineNum">       5 </span>                : // Free Software Foundation, Inc.
-<span class="lineNum">       6 </span>                : //
-<span class="lineNum">       7 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       8 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       9 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">      10 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      11 </span>                : // any later version.
-<span class="lineNum">      12 </span>                : 
-<span class="lineNum">      13 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      14 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      15 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      16 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      17 </span>                : 
-<span class="lineNum">      18 </span>                : // You should have received a copy of the GNU General Public License along
-<span class="lineNum">      19 </span>                : // with this library; see the file COPYING.  If not, write to the Free
-<span class="lineNum">      20 </span>                : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-<span class="lineNum">      21 </span>                : // USA.
-<span class="lineNum">      22 </span>                : 
-<span class="lineNum">      23 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      24 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      25 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      26 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      27 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      28 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      29 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      30 </span>                : // the GNU General Public License.
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span>                : /** @file locale_facets.h
-<span class="lineNum">      33 </span>                :  *  This is an internal header file, included by other library headers.
-<span class="lineNum">      34 </span>                :  *  You should not attempt to use it directly.
-<span class="lineNum">      35 </span>                :  */
-<span class="lineNum">      36 </span>                : 
-<span class="lineNum">      37 </span>                : //
-<span class="lineNum">      38 </span>                : // ISO C++ 14882: 22.1  Locales
-<span class="lineNum">      39 </span>                : //
-<span class="lineNum">      40 </span>                : 
-<span class="lineNum">      41 </span>                : #ifndef _LOCALE_FACETS_H
-<span class="lineNum">      42 </span>                : #define _LOCALE_FACETS_H 1
-<span class="lineNum">      43 </span>                : 
-<span class="lineNum">      44 </span>                : #pragma GCC system_header
-<span class="lineNum">      45 </span>                : 
-<span class="lineNum">      46 </span>                : #include &lt;cwctype&gt;        // For wctype_t
-<span class="lineNum">      47 </span>                : #include &lt;cctype&gt;
-<span class="lineNum">      48 </span>                : #include &lt;bits/ctype_base.h&gt;      
-<span class="lineNum">      49 </span>                : #include &lt;iosfwd&gt;
-<span class="lineNum">      50 </span>                : #include &lt;bits/ios_base.h&gt;  // For ios_base, ios_base::iostate
-<span class="lineNum">      51 </span>                : #include &lt;streambuf&gt;
-<span class="lineNum">      52 </span>                : #include &lt;bits/cpp_type_traits.h&gt;
-<span class="lineNum">      53 </span>                : #include &lt;ext/type_traits.h&gt;
-<span class="lineNum">      54 </span>                : #include &lt;ext/numeric_traits.h&gt;
-<span class="lineNum">      55 </span>                : #include &lt;bits/streambuf_iterator.h&gt;
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span>                : _GLIBCXX_BEGIN_NAMESPACE(std)
-<span class="lineNum">      58 </span>                : 
-<span class="lineNum">      59 </span>                :   // NB: Don't instantiate required wchar_t facets if no wchar_t support.
-<span class="lineNum">      60 </span>                : #ifdef _GLIBCXX_USE_WCHAR_T
-<span class="lineNum">      61 </span>                : # define  _GLIBCXX_NUM_FACETS 28
-<span class="lineNum">      62 </span>                : #else
-<span class="lineNum">      63 </span>                : # define  _GLIBCXX_NUM_FACETS 14
-<span class="lineNum">      64 </span>                : #endif
-<span class="lineNum">      65 </span>                : 
-<span class="lineNum">      66 </span>                :   // Convert string to numeric value of type _Tv and store results.
-<span class="lineNum">      67 </span>                :   // NB: This is specialized for all required types, there is no
-<span class="lineNum">      68 </span>                :   // generic definition.
-<span class="lineNum">      69 </span>                :   template&lt;typename _Tv&gt;
-<span class="lineNum">      70 </span>                :     void
-<span class="lineNum">      71 </span>                :     __convert_to_v(const char* __in, _Tv&amp; __out, ios_base::iostate&amp; __err,
-<span class="lineNum">      72 </span>                :                    const __c_locale&amp; __cloc);
-<span class="lineNum">      73 </span>                : 
-<span class="lineNum">      74 </span>                :   // Explicit specializations for required types.
-<span class="lineNum">      75 </span>                :   template&lt;&gt;
-<span class="lineNum">      76 </span>                :     void
-<span class="lineNum">      77 </span>                :     __convert_to_v(const char*, float&amp;, ios_base::iostate&amp;,
-<span class="lineNum">      78 </span>                :                    const __c_locale&amp;);
-<span class="lineNum">      79 </span>                : 
-<span class="lineNum">      80 </span>                :   template&lt;&gt;
-<span class="lineNum">      81 </span>                :     void
-<span class="lineNum">      82 </span>                :     __convert_to_v(const char*, double&amp;, ios_base::iostate&amp;,
-<span class="lineNum">      83 </span>                :                    const __c_locale&amp;);
-<span class="lineNum">      84 </span>                : 
-<span class="lineNum">      85 </span>                :   template&lt;&gt;
-<span class="lineNum">      86 </span>                :     void
-<span class="lineNum">      87 </span>                :     __convert_to_v(const char*, long double&amp;, ios_base::iostate&amp;,
-<span class="lineNum">      88 </span>                :                    const __c_locale&amp;);
-<span class="lineNum">      89 </span>                : 
-<span class="lineNum">      90 </span>                :   // NB: __pad is a struct, rather than a function, so it can be
-<span class="lineNum">      91 </span>                :   // partially-specialized.
-<span class="lineNum">      92 </span>                :   template&lt;typename _CharT, typename _Traits&gt;
-<span class="lineNum">      93 </span>                :     struct __pad
-<span class="lineNum">      94 </span>                :     {
-<span class="lineNum">      95 </span>                :       static void
-<span class="lineNum">      96 </span>                :       _S_pad(ios_base&amp; __io, _CharT __fill, _CharT* __news,
-<span class="lineNum">      97 </span>                :              const _CharT* __olds, const streamsize __newlen,
-<span class="lineNum">      98 </span>                :              const streamsize __oldlen);
-<span class="lineNum">      99 </span>                :     };
-<span class="lineNum">     100 </span>                : 
-<span class="lineNum">     101 </span>                :   // Used by both numeric and monetary facets.
-<span class="lineNum">     102 </span>                :   // Inserts &quot;group separator&quot; characters into an array of characters.
-<span class="lineNum">     103 </span>                :   // It's recursive, one iteration per group.  It moves the characters
-<span class="lineNum">     104 </span>                :   // in the buffer this way: &quot;xxxx12345&quot; -&gt; &quot;12,345xxx&quot;.  Call this
-<span class="lineNum">     105 </span>                :   // only with __gsize != 0.
-<span class="lineNum">     106 </span>                :   template&lt;typename _CharT&gt;
-<span class="lineNum">     107 </span>                :     _CharT*
-<span class="lineNum">     108 </span>                :     __add_grouping(_CharT* __s, _CharT __sep,
-<span class="lineNum">     109 </span>                :                    const char* __gbeg, size_t __gsize,
-<span class="lineNum">     110 </span>                :                    const _CharT* __first, const _CharT* __last);
-<span class="lineNum">     111 </span>                : 
-<span class="lineNum">     112 </span>                :   // This template permits specializing facet output code for
-<span class="lineNum">     113 </span>                :   // ostreambuf_iterator.  For ostreambuf_iterator, sputn is
-<span class="lineNum">     114 </span>                :   // significantly more efficient than incrementing iterators.
-<span class="lineNum">     115 </span>                :   template&lt;typename _CharT&gt;
-<span class="lineNum">     116 </span>                :     inline
-<span class="lineNum">     117 </span>                :     ostreambuf_iterator&lt;_CharT&gt;
-<span class="lineNum">     118 </span>                :     __write(ostreambuf_iterator&lt;_CharT&gt; __s, const _CharT* __ws, int __len)
-<span class="lineNum">     119 </span>                :     {
-<span class="lineNum">     120 </span>                :       __s._M_put(__ws, __len);
-<span class="lineNum">     121 </span>                :       return __s;
-<span class="lineNum">     122 </span>                :     }
-<span class="lineNum">     123 </span>                : 
-<span class="lineNum">     124 </span>                :   // This is the unspecialized form of the template.
-<span class="lineNum">     125 </span>                :   template&lt;typename _CharT, typename _OutIter&gt;
-<span class="lineNum">     126 </span>                :     inline
-<span class="lineNum">     127 </span>                :     _OutIter
-<span class="lineNum">     128 </span>                :     __write(_OutIter __s, const _CharT* __ws, int __len)
-<span class="lineNum">     129 </span>                :     {
-<span class="lineNum">     130 </span>                :       for (int __j = 0; __j &lt; __len; __j++, ++__s)
-<span class="lineNum">     131 </span>                :         *__s = __ws[__j];
-<span class="lineNum">     132 </span>                :       return __s;
-<span class="lineNum">     133 </span>                :     }
-<span class="lineNum">     134 </span>                : 
-<span class="lineNum">     135 </span>                : 
-<span class="lineNum">     136 </span>                :   // 22.2.1.1  Template class ctype
-<span class="lineNum">     137 </span>                :   // Include host and configuration specific ctype enums for ctype_base.
-<span class="lineNum">     138 </span>                : 
-<span class="lineNum">     139 </span>                :   // Common base for ctype&lt;_CharT&gt;.
-<span class="lineNum">     140 </span>                :   /**
-<span class="lineNum">     141 </span>                :    *  @brief  Common base for ctype facet
-<span class="lineNum">     142 </span>                :    *
-<span class="lineNum">     143 </span>                :    *  This template class provides implementations of the public functions
-<span class="lineNum">     144 </span>                :    *  that forward to the protected virtual functions.
-<span class="lineNum">     145 </span>                :    *
-<span class="lineNum">     146 </span>                :    *  This template also provides abstract stubs for the protected virtual
-<span class="lineNum">     147 </span>                :    *  functions.
-<span class="lineNum">     148 </span>                :   */
-<span class="lineNum">     149 </span>                :   template&lt;typename _CharT&gt;
-<span class="lineNum">     150 </span>                :     class __ctype_abstract_base : public locale::facet, public ctype_base
-<span class="lineNum">     151 </span>                :     {
-<span class="lineNum">     152 </span>                :     public:
-<span class="lineNum">     153 </span>                :       // Types:
-<span class="lineNum">     154 </span>                :       /// Typedef for the template parameter
-<span class="lineNum">     155 </span>                :       typedef _CharT char_type;
-<span class="lineNum">     156 </span>                : 
-<span class="lineNum">     157 </span>                :       /**
-<span class="lineNum">     158 </span>                :        *  @brief  Test char_type classification.
-<span class="lineNum">     159 </span>                :        *
-<span class="lineNum">     160 </span>                :        *  This function finds a mask M for @a c and compares it to mask @a m.
-<span class="lineNum">     161 </span>                :        *  It does so by returning the value of ctype&lt;char_type&gt;::do_is().
-<span class="lineNum">     162 </span>                :        *
-<span class="lineNum">     163 </span>                :        *  @param c  The char_type to compare the mask of.
-<span class="lineNum">     164 </span>                :        *  @param m  The mask to compare against.
-<span class="lineNum">     165 </span>                :        *  @return  (M &amp; m) != 0.
-<span class="lineNum">     166 </span>                :       */
-<span class="lineNum">     167 </span>                :       bool
-<span class="lineNum">     168 </span>                :       is(mask __m, char_type __c) const
-<span class="lineNum">     169 </span>                :       { return this-&gt;do_is(__m, __c); }
-<span class="lineNum">     170 </span>                : 
-<span class="lineNum">     171 </span>                :       /**
-<span class="lineNum">     172 </span>                :        *  @brief  Return a mask array.
-<span class="lineNum">     173 </span>                :        *
-<span class="lineNum">     174 </span>                :        *  This function finds the mask for each char_type in the range [lo,hi)
-<span class="lineNum">     175 </span>                :        *  and successively writes it to vec.  vec must have as many elements
-<span class="lineNum">     176 </span>                :        *  as the char array.  It does so by returning the value of
-<span class="lineNum">     177 </span>                :        *  ctype&lt;char_type&gt;::do_is().
-<span class="lineNum">     178 </span>                :        *
-<span class="lineNum">     179 </span>                :        *  @param lo  Pointer to start of range.
-<span class="lineNum">     180 </span>                :        *  @param hi  Pointer to end of range.
-<span class="lineNum">     181 </span>                :        *  @param vec  Pointer to an array of mask storage.
-<span class="lineNum">     182 </span>                :        *  @return  @a hi.
-<span class="lineNum">     183 </span>                :       */
-<span class="lineNum">     184 </span>                :       const char_type*
-<span class="lineNum">     185 </span>                :       is(const char_type *__lo, const char_type *__hi, mask *__vec) const
-<span class="lineNum">     186 </span>                :       { return this-&gt;do_is(__lo, __hi, __vec); }
-<span class="lineNum">     187 </span>                : 
-<span class="lineNum">     188 </span>                :       /**
-<span class="lineNum">     189 </span>                :        *  @brief  Find char_type matching a mask
-<span class="lineNum">     190 </span>                :        *
-<span class="lineNum">     191 </span>                :        *  This function searches for and returns the first char_type c in
-<span class="lineNum">     192 </span>                :        *  [lo,hi) for which is(m,c) is true.  It does so by returning
-<span class="lineNum">     193 </span>                :        *  ctype&lt;char_type&gt;::do_scan_is().
-<span class="lineNum">     194 </span>                :        *
-<span class="lineNum">     195 </span>                :        *  @param m  The mask to compare against.
-<span class="lineNum">     196 </span>                :        *  @param lo  Pointer to start of range.
-<span class="lineNum">     197 </span>                :        *  @param hi  Pointer to end of range.
-<span class="lineNum">     198 </span>                :        *  @return  Pointer to matching char_type if found, else @a hi.
-<span class="lineNum">     199 </span>                :       */
-<span class="lineNum">     200 </span>                :       const char_type*
-<span class="lineNum">     201 </span>                :       scan_is(mask __m, const char_type* __lo, const char_type* __hi) const
-<span class="lineNum">     202 </span>                :       { return this-&gt;do_scan_is(__m, __lo, __hi); }
-<span class="lineNum">     203 </span>                : 
-<span class="lineNum">     204 </span>                :       /**
-<span class="lineNum">     205 </span>                :        *  @brief  Find char_type not matching a mask
-<span class="lineNum">     206 </span>                :        *
-<span class="lineNum">     207 </span>                :        *  This function searches for and returns the first char_type c in
-<span class="lineNum">     208 </span>                :        *  [lo,hi) for which is(m,c) is false.  It does so by returning
-<span class="lineNum">     209 </span>                :        *  ctype&lt;char_type&gt;::do_scan_not().
-<span class="lineNum">     210 </span>                :        *
-<span class="lineNum">     211 </span>                :        *  @param m  The mask to compare against.
-<span class="lineNum">     212 </span>                :        *  @param lo  Pointer to first char in range.
-<span class="lineNum">     213 </span>                :        *  @param hi  Pointer to end of range.
-<span class="lineNum">     214 </span>                :        *  @return  Pointer to non-matching char if found, else @a hi.
-<span class="lineNum">     215 </span>                :       */
-<span class="lineNum">     216 </span>                :       const char_type*
-<span class="lineNum">     217 </span>                :       scan_not(mask __m, const char_type* __lo, const char_type* __hi) const
-<span class="lineNum">     218 </span>                :       { return this-&gt;do_scan_not(__m, __lo, __hi); }
-<span class="lineNum">     219 </span>                : 
-<span class="lineNum">     220 </span>                :       /**
-<span class="lineNum">     221 </span>                :        *  @brief  Convert to uppercase.
-<span class="lineNum">     222 </span>                :        *
-<span class="lineNum">     223 </span>                :        *  This function converts the argument to uppercase if possible.
-<span class="lineNum">     224 </span>                :        *  If not possible (for example, '2'), returns the argument.  It does
-<span class="lineNum">     225 </span>                :        *  so by returning ctype&lt;char_type&gt;::do_toupper().
-<span class="lineNum">     226 </span>                :        *
-<span class="lineNum">     227 </span>                :        *  @param c  The char_type to convert.
-<span class="lineNum">     228 </span>                :        *  @return  The uppercase char_type if convertible, else @a c.
-<span class="lineNum">     229 </span>                :       */
-<span class="lineNum">     230 </span>                :       char_type
-<span class="lineNum">     231 </span>                :       toupper(char_type __c) const
-<span class="lineNum">     232 </span>                :       { return this-&gt;do_toupper(__c); }
-<span class="lineNum">     233 </span>                : 
-<span class="lineNum">     234 </span>                :       /**
-<span class="lineNum">     235 </span>                :        *  @brief  Convert array to uppercase.
-<span class="lineNum">     236 </span>                :        *
-<span class="lineNum">     237 </span>                :        *  This function converts each char_type in the range [lo,hi) to
-<span class="lineNum">     238 </span>                :        *  uppercase if possible.  Other elements remain untouched.  It does so
-<span class="lineNum">     239 </span>                :        *  by returning ctype&lt;char_type&gt;:: do_toupper(lo, hi).
-<span class="lineNum">     240 </span>                :        *
-<span class="lineNum">     241 </span>                :        *  @param lo  Pointer to start of range.
-<span class="lineNum">     242 </span>                :        *  @param hi  Pointer to end of range.
-<span class="lineNum">     243 </span>                :        *  @return  @a hi.
-<span class="lineNum">     244 </span>                :       */
-<span class="lineNum">     245 </span>                :       const char_type*
-<span class="lineNum">     246 </span>                :       toupper(char_type *__lo, const char_type* __hi) const
-<span class="lineNum">     247 </span>                :       { return this-&gt;do_toupper(__lo, __hi); }
-<span class="lineNum">     248 </span>                : 
-<span class="lineNum">     249 </span>                :       /**
-<span class="lineNum">     250 </span>                :        *  @brief  Convert to lowercase.
-<span class="lineNum">     251 </span>                :        *
-<span class="lineNum">     252 </span>                :        *  This function converts the argument to lowercase if possible.  If
-<span class="lineNum">     253 </span>                :        *  not possible (for example, '2'), returns the argument.  It does so
-<span class="lineNum">     254 </span>                :        *  by returning ctype&lt;char_type&gt;::do_tolower(c).
-<span class="lineNum">     255 </span>                :        *
-<span class="lineNum">     256 </span>                :        *  @param c  The char_type to convert.
-<span class="lineNum">     257 </span>                :        *  @return  The lowercase char_type if convertible, else @a c.
-<span class="lineNum">     258 </span>                :       */
-<span class="lineNum">     259 </span>                :       char_type
-<span class="lineNum">     260 </span>                :       tolower(char_type __c) const
-<span class="lineNum">     261 </span>                :       { return this-&gt;do_tolower(__c); }
-<span class="lineNum">     262 </span>                : 
-<span class="lineNum">     263 </span>                :       /**
-<span class="lineNum">     264 </span>                :        *  @brief  Convert array to lowercase.
-<span class="lineNum">     265 </span>                :        *
-<span class="lineNum">     266 </span>                :        *  This function converts each char_type in the range [lo,hi) to
-<span class="lineNum">     267 </span>                :        *  lowercase if possible.  Other elements remain untouched.  It does so
-<span class="lineNum">     268 </span>                :        *  by returning ctype&lt;char_type&gt;:: do_tolower(lo, hi).
-<span class="lineNum">     269 </span>                :        *
-<span class="lineNum">     270 </span>                :        *  @param lo  Pointer to start of range.
-<span class="lineNum">     271 </span>                :        *  @param hi  Pointer to end of range.
-<span class="lineNum">     272 </span>                :        *  @return  @a hi.
-<span class="lineNum">     273 </span>                :       */
-<span class="lineNum">     274 </span>                :       const char_type*
-<span class="lineNum">     275 </span>                :       tolower(char_type* __lo, const char_type* __hi) const
-<span class="lineNum">     276 </span>                :       { return this-&gt;do_tolower(__lo, __hi); }
-<span class="lineNum">     277 </span>                : 
-<span class="lineNum">     278 </span>                :       /**
-<span class="lineNum">     279 </span>                :        *  @brief  Widen char to char_type
-<span class="lineNum">     280 </span>                :        *
-<span class="lineNum">     281 </span>                :        *  This function converts the char argument to char_type using the
-<span class="lineNum">     282 </span>                :        *  simplest reasonable transformation.  It does so by returning
-<span class="lineNum">     283 </span>                :        *  ctype&lt;char_type&gt;::do_widen(c).
-<span class="lineNum">     284 </span>                :        *
-<span class="lineNum">     285 </span>                :        *  Note: this is not what you want for codepage conversions.  See
-<span class="lineNum">     286 </span>                :        *  codecvt for that.
-<span class="lineNum">     287 </span>                :        *
-<span class="lineNum">     288 </span>                :        *  @param c  The char to convert.
-<span class="lineNum">     289 </span>                :        *  @return  The converted char_type.
-<span class="lineNum">     290 </span>                :       */
-<span class="lineNum">     291 </span>                :       char_type
-<span class="lineNum">     292 </span>                :       widen(char __c) const
-<span class="lineNum">     293 </span>                :       { return this-&gt;do_widen(__c); }
-<span class="lineNum">     294 </span>                : 
-<span class="lineNum">     295 </span>                :       /**
-<span class="lineNum">     296 </span>                :        *  @brief  Widen array to char_type
-<span class="lineNum">     297 </span>                :        *
-<span class="lineNum">     298 </span>                :        *  This function converts each char in the input to char_type using the
-<span class="lineNum">     299 </span>                :        *  simplest reasonable transformation.  It does so by returning
-<span class="lineNum">     300 </span>                :        *  ctype&lt;char_type&gt;::do_widen(c).
-<span class="lineNum">     301 </span>                :        *
-<span class="lineNum">     302 </span>                :        *  Note: this is not what you want for codepage conversions.  See
-<span class="lineNum">     303 </span>                :        *  codecvt for that.
-<span class="lineNum">     304 </span>                :        *
-<span class="lineNum">     305 </span>                :        *  @param lo  Pointer to start of range.
-<span class="lineNum">     306 </span>                :        *  @param hi  Pointer to end of range.
-<span class="lineNum">     307 </span>                :        *  @param to  Pointer to the destination array.
-<span class="lineNum">     308 </span>                :        *  @return  @a hi.
-<span class="lineNum">     309 </span>                :       */
-<span class="lineNum">     310 </span>                :       const char*
-<span class="lineNum">     311 </span>                :       widen(const char* __lo, const char* __hi, char_type* __to) const
-<span class="lineNum">     312 </span>                :       { return this-&gt;do_widen(__lo, __hi, __to); }
-<span class="lineNum">     313 </span>                : 
-<span class="lineNum">     314 </span>                :       /**
-<span class="lineNum">     315 </span>                :        *  @brief  Narrow char_type to char
-<span class="lineNum">     316 </span>                :        *
-<span class="lineNum">     317 </span>                :        *  This function converts the char_type to char using the simplest
-<span class="lineNum">     318 </span>                :        *  reasonable transformation.  If the conversion fails, dfault is
-<span class="lineNum">     319 </span>                :        *  returned instead.  It does so by returning
-<span class="lineNum">     320 </span>                :        *  ctype&lt;char_type&gt;::do_narrow(c).
-<span class="lineNum">     321 </span>                :        *
-<span class="lineNum">     322 </span>                :        *  Note: this is not what you want for codepage conversions.  See
-<span class="lineNum">     323 </span>                :        *  codecvt for that.
-<span class="lineNum">     324 </span>                :        *
-<span class="lineNum">     325 </span>                :        *  @param c  The char_type to convert.
-<span class="lineNum">     326 </span>                :        *  @param dfault  Char to return if conversion fails.
-<span class="lineNum">     327 </span>                :        *  @return  The converted char.
-<span class="lineNum">     328 </span>                :       */
-<span class="lineNum">     329 </span>                :       char
-<span class="lineNum">     330 </span>                :       narrow(char_type __c, char __dfault) const
-<span class="lineNum">     331 </span>                :       { return this-&gt;do_narrow(__c, __dfault); }
-<span class="lineNum">     332 </span>                : 
-<span class="lineNum">     333 </span>                :       /**
-<span class="lineNum">     334 </span>                :        *  @brief  Narrow array to char array
-<span class="lineNum">     335 </span>                :        *
-<span class="lineNum">     336 </span>                :        *  This function converts each char_type in the input to char using the
-<span class="lineNum">     337 </span>                :        *  simplest reasonable transformation and writes the results to the
-<span class="lineNum">     338 </span>                :        *  destination array.  For any char_type in the input that cannot be
-<span class="lineNum">     339 </span>                :        *  converted, @a dfault is used instead.  It does so by returning
-<span class="lineNum">     340 </span>                :        *  ctype&lt;char_type&gt;::do_narrow(lo, hi, dfault, to).
-<span class="lineNum">     341 </span>                :        *
-<span class="lineNum">     342 </span>                :        *  Note: this is not what you want for codepage conversions.  See
-<span class="lineNum">     343 </span>                :        *  codecvt for that.
-<span class="lineNum">     344 </span>                :        *
-<span class="lineNum">     345 </span>                :        *  @param lo  Pointer to start of range.
-<span class="lineNum">     346 </span>                :        *  @param hi  Pointer to end of range.
-<span class="lineNum">     347 </span>                :        *  @param dfault  Char to use if conversion fails.
-<span class="lineNum">     348 </span>                :        *  @param to  Pointer to the destination array.
-<span class="lineNum">     349 </span>                :        *  @return  @a hi.
-<span class="lineNum">     350 </span>                :       */
-<span class="lineNum">     351 </span>                :       const char_type*
-<span class="lineNum">     352 </span>                :       narrow(const char_type* __lo, const char_type* __hi,
-<span class="lineNum">     353 </span>                :               char __dfault, char *__to) const
-<span class="lineNum">     354 </span>                :       { return this-&gt;do_narrow(__lo, __hi, __dfault, __to); }
-<span class="lineNum">     355 </span>                : 
-<span class="lineNum">     356 </span>                :     protected:
-<span class="lineNum">     357 </span>                :       explicit
-<span class="lineNum">     358 </span>                :       __ctype_abstract_base(size_t __refs = 0): facet(__refs) { }
-<span class="lineNum">     359 </span>                : 
-<span class="lineNum">     360 </span>                :       virtual
-<span class="lineNum">     361 </span>                :       ~__ctype_abstract_base() { }
-<span class="lineNum">     362 </span>                : 
-<span class="lineNum">     363 </span>                :       /**
-<span class="lineNum">     364 </span>                :        *  @brief  Test char_type classification.
-<span class="lineNum">     365 </span>                :        *
-<span class="lineNum">     366 </span>                :        *  This function finds a mask M for @a c and compares it to mask @a m.
-<span class="lineNum">     367 </span>                :        *
-<span class="lineNum">     368 </span>                :        *  do_is() is a hook for a derived facet to change the behavior of
-<span class="lineNum">     369 </span>                :        *  classifying.  do_is() must always return the same result for the
-<span class="lineNum">     370 </span>                :        *  same input.
-<span class="lineNum">     371 </span>                :        *
-<span class="lineNum">     372 </span>                :        *  @param c  The char_type to find the mask of.
-<span class="lineNum">     373 </span>                :        *  @param m  The mask to compare against.
-<span class="lineNum">     374 </span>                :        *  @return  (M &amp; m) != 0.
-<span class="lineNum">     375 </span>                :       */
-<span class="lineNum">     376 </span>                :       virtual bool
-<span class="lineNum">     377 </span>                :       do_is(mask __m, char_type __c) const = 0;
-<span class="lineNum">     378 </span>                : 
-<span class="lineNum">     379 </span>                :       /**
-<span class="lineNum">     380 </span>                :        *  @brief  Return a mask array.
-<span class="lineNum">     381 </span>                :        *
-<span class="lineNum">     382 </span>                :        *  This function finds the mask for each char_type in the range [lo,hi)
-<span class="lineNum">     383 </span>                :        *  and successively writes it to vec.  vec must have as many elements
-<span class="lineNum">     384 </span>                :        *  as the input.
-<span class="lineNum">     385 </span>                :        *
-<span class="lineNum">     386 </span>                :        *  do_is() is a hook for a derived facet to change the behavior of
-<span class="lineNum">     387 </span>                :        *  classifying.  do_is() must always return the same result for the
-<span class="lineNum">     388 </span>                :        *  same input.
-<span class="lineNum">     389 </span>                :        *
-<span class="lineNum">     390 </span>                :        *  @param lo  Pointer to start of range.
-<span class="lineNum">     391 </span>                :        *  @param hi  Pointer to end of range.
-<span class="lineNum">     392 </span>                :        *  @param vec  Pointer to an array of mask storage.
-<span class="lineNum">     393 </span>                :        *  @return  @a hi.
-<span class="lineNum">     394 </span>                :       */
-<span class="lineNum">     395 </span>                :       virtual const char_type*
-<span class="lineNum">     396 </span>                :       do_is(const char_type* __lo, const char_type* __hi,
-<span class="lineNum">     397 </span>                :             mask* __vec) const = 0;
-<span class="lineNum">     398 </span>                : 
-<span class="lineNum">     399 </span>                :       /**
-<span class="lineNum">     400 </span>                :        *  @brief  Find char_type matching mask
-<span class="lineNum">     401 </span>                :        *
-<span class="lineNum">     402 </span>                :        *  This function searches for and returns the first char_type c in
-<span class="lineNum">     403 </span>                :        *  [lo,hi) for which is(m,c) is true.
-<span class="lineNum">     404 </span>                :        *
-<span class="lineNum">     405 </span>                :        *  do_scan_is() is a hook for a derived facet to change the behavior of
-<span class="lineNum">     406 </span>                :        *  match searching.  do_is() must always return the same result for the
-<span class="lineNum">     407 </span>                :        *  same input.
-<span class="lineNum">     408 </span>                :        *
-<span class="lineNum">     409 </span>                :        *  @param m  The mask to compare against.
-<span class="lineNum">     410 </span>                :        *  @param lo  Pointer to start of range.
-<span class="lineNum">     411 </span>                :        *  @param hi  Pointer to end of range.
-<span class="lineNum">     412 </span>                :        *  @return  Pointer to a matching char_type if found, else @a hi.
-<span class="lineNum">     413 </span>                :       */
-<span class="lineNum">     414 </span>                :       virtual const char_type*
-<span class="lineNum">     415 </span>                :       do_scan_is(mask __m, const char_type* __lo,
-<span class="lineNum">     416 </span>                :                  const char_type* __hi) const = 0;
-<span class="lineNum">     417 </span>                : 
-<span class="lineNum">     418 </span>                :       /**
-<span class="lineNum">     419 </span>                :        *  @brief  Find char_type not matching mask
-<span class="lineNum">     420 </span>                :        *
-<span class="lineNum">     421 </span>                :        *  This function searches for and returns a pointer to the first
-<span class="lineNum">     422 </span>                :        *  char_type c of [lo,hi) for which is(m,c) is false.
-<span class="lineNum">     423 </span>                :        *
-<span class="lineNum">     424 </span>                :        *  do_scan_is() is a hook for a derived facet to change the behavior of
-<span class="lineNum">     425 </span>                :        *  match searching.  do_is() must always return the same result for the
-<span class="lineNum">     426 </span>                :        *  same input.
-<span class="lineNum">     427 </span>                :        *
-<span class="lineNum">     428 </span>                :        *  @param m  The mask to compare against.
-<span class="lineNum">     429 </span>                :        *  @param lo  Pointer to start of range.
-<span class="lineNum">     430 </span>                :        *  @param hi  Pointer to end of range.
-<span class="lineNum">     431 </span>                :        *  @return  Pointer to a non-matching char_type if found, else @a hi.
-<span class="lineNum">     432 </span>                :       */
-<span class="lineNum">     433 </span>                :       virtual const char_type*
-<span class="lineNum">     434 </span>                :       do_scan_not(mask __m, const char_type* __lo,
-<span class="lineNum">     435 </span>                :                   const char_type* __hi) const = 0;
-<span class="lineNum">     436 </span>                : 
-<span class="lineNum">     437 </span>                :       /**
-<span class="lineNum">     438 </span>                :        *  @brief  Convert to uppercase.
-<span class="lineNum">     439 </span>                :        *
-<span class="lineNum">     440 </span>                :        *  This virtual function converts the char_type argument to uppercase
-<span class="lineNum">     441 </span>                :        *  if possible.  If not possible (for example, '2'), returns the
-<span class="lineNum">     442 </span>                :        *  argument.
-<span class="lineNum">     443 </span>                :        *
-<span class="lineNum">     444 </span>                :        *  do_toupper() is a hook for a derived facet to change the behavior of
-<span class="lineNum">     445 </span>                :        *  uppercasing.  do_toupper() must always return the same result for
-<span class="lineNum">     446 </span>                :        *  the same input.
-<span class="lineNum">     447 </span>                :        *
-<span class="lineNum">     448 </span>                :        *  @param c  The char_type to convert.
-<span class="lineNum">     449 </span>                :        *  @return  The uppercase char_type if convertible, else @a c.
-<span class="lineNum">     450 </span>                :       */
-<span class="lineNum">     451 </span>                :       virtual char_type
-<span class="lineNum">     452 </span>                :       do_toupper(char_type) const = 0;
-<span class="lineNum">     453 </span>                : 
-<span class="lineNum">     454 </span>                :       /**
-<span class="lineNum">     455 </span>                :        *  @brief  Convert array to uppercase.
-<span class="lineNum">     456 </span>                :        *
-<span class="lineNum">     457 </span>                :        *  This virtual function converts each char_type in the range [lo,hi)
-<span class="lineNum">     458 </span>                :        *  to uppercase if possible.  Other elements remain untouched.
-<span class="lineNum">     459 </span>                :        *
-<span class="lineNum">     460 </span>                :        *  do_toupper() is a hook for a derived facet to change the behavior of
-<span class="lineNum">     461 </span>                :        *  uppercasing.  do_toupper() must always return the same result for
-<span class="lineNum">     462 </span>                :        *  the same input.
-<span class="lineNum">     463 </span>                :        *
-<span class="lineNum">     464 </span>                :        *  @param lo  Pointer to start of range.
-<span class="lineNum">     465 </span>                :        *  @param hi  Pointer to end of range.
-<span class="lineNum">     466 </span>                :        *  @return  @a hi.
-<span class="lineNum">     467 </span>                :       */
-<span class="lineNum">     468 </span>                :       virtual const char_type*
-<span class="lineNum">     469 </span>                :       do_toupper(char_type* __lo, const char_type* __hi) const = 0;
-<span class="lineNum">     470 </span>                : 
-<span class="lineNum">     471 </span>                :       /**
-<span class="lineNum">     472 </span>                :        *  @brief  Convert to lowercase.
-<span class="lineNum">     473 </span>                :        *
-<span class="lineNum">     474 </span>                :        *  This virtual function converts the argument to lowercase if
-<span class="lineNum">     475 </span>                :        *  possible.  If not possible (for example, '2'), returns the argument.
-<span class="lineNum">     476 </span>                :        *
-<span class="lineNum">     477 </span>                :        *  do_tolower() is a hook for a derived facet to change the behavior of
-<span class="lineNum">     478 </span>                :        *  lowercasing.  do_tolower() must always return the same result for
-<span class="lineNum">     479 </span>                :        *  the same input.
-<span class="lineNum">     480 </span>                :        *
-<span class="lineNum">     481 </span>                :        *  @param c  The char_type to convert.
-<span class="lineNum">     482 </span>                :        *  @return  The lowercase char_type if convertible, else @a c.
-<span class="lineNum">     483 </span>                :       */
-<span class="lineNum">     484 </span>                :       virtual char_type
-<span class="lineNum">     485 </span>                :       do_tolower(char_type) const = 0;
-<span class="lineNum">     486 </span>                : 
-<span class="lineNum">     487 </span>                :       /**
-<span class="lineNum">     488 </span>                :        *  @brief  Convert array to lowercase.
-<span class="lineNum">     489 </span>                :        *
-<span class="lineNum">     490 </span>                :        *  This virtual function converts each char_type in the range [lo,hi)
-<span class="lineNum">     491 </span>                :        *  to lowercase if possible.  Other elements remain untouched.
-<span class="lineNum">     492 </span>                :        *
-<span class="lineNum">     493 </span>                :        *  do_tolower() is a hook for a derived facet to change the behavior of
-<span class="lineNum">     494 </span>                :        *  lowercasing.  do_tolower() must always return the same result for
-<span class="lineNum">     495 </span>                :        *  the same input.
-<span class="lineNum">     496 </span>                :        *
-<span class="lineNum">     497 </span>                :        *  @param lo  Pointer to start of range.
-<span class="lineNum">     498 </span>                :        *  @param hi  Pointer to end of range.
-<span class="lineNum">     499 </span>                :        *  @return  @a hi.
-<span class="lineNum">     500 </span>                :       */
-<span class="lineNum">     501 </span>                :       virtual const char_type*
-<span class="lineNum">     502 </span>                :       do_tolower(char_type* __lo, const char_type* __hi) const = 0;
-<span class="lineNum">     503 </span>                : 
-<span class="lineNum">     504 </span>                :       /**
-<span class="lineNum">     505 </span>                :        *  @brief  Widen char
-<span class="lineNum">     506 </span>                :        *
-<span class="lineNum">     507 </span>                :        *  This virtual function converts the char to char_type using the
-<span class="lineNum">     508 </span>                :        *  simplest reasonable transformation.
-<span class="lineNum">     509 </span>                :        *
-<span class="lineNum">     510 </span>                :        *  do_widen() is a hook for a derived facet to change the behavior of
-<span class="lineNum">     511 </span>                :        *  widening.  do_widen() must always return the same result for the
-<span class="lineNum">     512 </span>                :        *  same input.
-<span class="lineNum">     513 </span>                :        *
-<span class="lineNum">     514 </span>                :        *  Note: this is not what you want for codepage conversions.  See
-<span class="lineNum">     515 </span>                :        *  codecvt for that.
-<span class="lineNum">     516 </span>                :        *
-<span class="lineNum">     517 </span>                :        *  @param c  The char to convert.
-<span class="lineNum">     518 </span>                :        *  @return  The converted char_type
-<span class="lineNum">     519 </span>                :       */
-<span class="lineNum">     520 </span>                :       virtual char_type
-<span class="lineNum">     521 </span>                :       do_widen(char) const = 0;
-<span class="lineNum">     522 </span>                : 
-<span class="lineNum">     523 </span>                :       /**
-<span class="lineNum">     524 </span>                :        *  @brief  Widen char array
-<span class="lineNum">     525 </span>                :        *
-<span class="lineNum">     526 </span>                :        *  This function converts each char in the input to char_type using the
-<span class="lineNum">     527 </span>                :        *  simplest reasonable transformation.
-<span class="lineNum">     528 </span>                :        *
-<span class="lineNum">     529 </span>                :        *  do_widen() is a hook for a derived facet to change the behavior of
-<span class="lineNum">     530 </span>                :        *  widening.  do_widen() must always return the same result for the
-<span class="lineNum">     531 </span>                :        *  same input.
-<span class="lineNum">     532 </span>                :        *
-<span class="lineNum">     533 </span>                :        *  Note: this is not what you want for codepage conversions.  See
-<span class="lineNum">     534 </span>                :        *  codecvt for that.
-<span class="lineNum">     535 </span>                :        *
-<span class="lineNum">     536 </span>                :        *  @param lo  Pointer to start range.
-<span class="lineNum">     537 </span>                :        *  @param hi  Pointer to end of range.
-<span class="lineNum">     538 </span>                :        *  @param to  Pointer to the destination array.
-<span class="lineNum">     539 </span>                :        *  @return  @a hi.
-<span class="lineNum">     540 </span>                :       */
-<span class="lineNum">     541 </span>                :       virtual const char*
-<span class="lineNum">     542 </span>                :       do_widen(const char* __lo, const char* __hi,
-<span class="lineNum">     543 </span>                :                char_type* __dest) const = 0;
-<span class="lineNum">     544 </span>                : 
-<span class="lineNum">     545 </span>                :       /**
-<span class="lineNum">     546 </span>                :        *  @brief  Narrow char_type to char
-<span class="lineNum">     547 </span>                :        *
-<span class="lineNum">     548 </span>                :        *  This virtual function converts the argument to char using the
-<span class="lineNum">     549 </span>                :        *  simplest reasonable transformation.  If the conversion fails, dfault
-<span class="lineNum">     550 </span>                :        *  is returned instead.
-<span class="lineNum">     551 </span>                :        *
-<span class="lineNum">     552 </span>                :        *  do_narrow() is a hook for a derived facet to change the behavior of
-<span class="lineNum">     553 </span>                :        *  narrowing.  do_narrow() must always return the same result for the
-<span class="lineNum">     554 </span>                :        *  same input.
-<span class="lineNum">     555 </span>                :        *
-<span class="lineNum">     556 </span>                :        *  Note: this is not what you want for codepage conversions.  See
-<span class="lineNum">     557 </span>                :        *  codecvt for that.
-<span class="lineNum">     558 </span>                :        *
-<span class="lineNum">     559 </span>                :        *  @param c  The char_type to convert.
-<span class="lineNum">     560 </span>                :        *  @param dfault  Char to return if conversion fails.
-<span class="lineNum">     561 </span>                :        *  @return  The converted char.
-<span class="lineNum">     562 </span>                :       */
-<span class="lineNum">     563 </span>                :       virtual char
-<span class="lineNum">     564 </span>                :       do_narrow(char_type, char __dfault) const = 0;
-<span class="lineNum">     565 </span>                : 
-<span class="lineNum">     566 </span>                :       /**
-<span class="lineNum">     567 </span>                :        *  @brief  Narrow char_type array to char
-<span class="lineNum">     568 </span>                :        *
-<span class="lineNum">     569 </span>                :        *  This virtual function converts each char_type in the range [lo,hi) to
-<span class="lineNum">     570 </span>                :        *  char using the simplest reasonable transformation and writes the
-<span class="lineNum">     571 </span>                :        *  results to the destination array.  For any element in the input that
-<span class="lineNum">     572 </span>                :        *  cannot be converted, @a dfault is used instead.
-<span class="lineNum">     573 </span>                :        *
-<span class="lineNum">     574 </span>                :        *  do_narrow() is a hook for a derived facet to change the behavior of
-<span class="lineNum">     575 </span>                :        *  narrowing.  do_narrow() must always return the same result for the
-<span class="lineNum">     576 </span>                :        *  same input.
-<span class="lineNum">     577 </span>                :        *
-<span class="lineNum">     578 </span>                :        *  Note: this is not what you want for codepage conversions.  See
-<span class="lineNum">     579 </span>                :        *  codecvt for that.
-<span class="lineNum">     580 </span>                :        *
-<span class="lineNum">     581 </span>                :        *  @param lo  Pointer to start of range.
-<span class="lineNum">     582 </span>                :        *  @param hi  Pointer to end of range.
-<span class="lineNum">     583 </span>                :        *  @param dfault  Char to use if conversion fails.
-<span class="lineNum">     584 </span>                :        *  @param to  Pointer to the destination array.
-<span class="lineNum">     585 </span>                :        *  @return  @a hi.
-<span class="lineNum">     586 </span>                :       */
-<span class="lineNum">     587 </span>                :       virtual const char_type*
-<span class="lineNum">     588 </span>                :       do_narrow(const char_type* __lo, const char_type* __hi,
-<span class="lineNum">     589 </span>                :                 char __dfault, char* __dest) const = 0;
-<span class="lineNum">     590 </span>                :     };
-<span class="lineNum">     591 </span>                : 
-<span class="lineNum">     592 </span>                :   // NB: Generic, mostly useless implementation.
-<span class="lineNum">     593 </span>                :   /**
-<span class="lineNum">     594 </span>                :    *  @brief  Template ctype facet
-<span class="lineNum">     595 </span>                :    *
-<span class="lineNum">     596 </span>                :    *  This template class defines classification and conversion functions for
-<span class="lineNum">     597 </span>                :    *  character sets.  It wraps &lt;cctype&gt; functionality.  Ctype gets used by
-<span class="lineNum">     598 </span>                :    *  streams for many I/O operations.
-<span class="lineNum">     599 </span>                :    *
-<span class="lineNum">     600 </span>                :    *  This template provides the protected virtual functions the developer
-<span class="lineNum">     601 </span>                :    *  will have to replace in a derived class or specialization to make a
-<span class="lineNum">     602 </span>                :    *  working facet.  The public functions that access them are defined in
-<span class="lineNum">     603 </span>                :    *  __ctype_abstract_base, to allow for implementation flexibility.  See
-<span class="lineNum">     604 </span>                :    *  ctype&lt;wchar_t&gt; for an example.  The functions are documented in
-<span class="lineNum">     605 </span>                :    *  __ctype_abstract_base.
-<span class="lineNum">     606 </span>                :    *
-<span class="lineNum">     607 </span>                :    *  Note: implementations are provided for all the protected virtual
-<span class="lineNum">     608 </span>                :    *  functions, but will likely not be useful.
-<span class="lineNum">     609 </span>                :   */
-<span class="lineNum">     610 </span>                :   template&lt;typename _CharT&gt;
-<span class="lineNum">     611 </span>                :     class ctype : public __ctype_abstract_base&lt;_CharT&gt;
-<span class="lineNum">     612 </span>                :     {
-<span class="lineNum">     613 </span>                :     public:
-<span class="lineNum">     614 </span>                :       // Types:
-<span class="lineNum">     615 </span>                :       typedef _CharT                    char_type;
-<span class="lineNum">     616 </span>                :       typedef typename __ctype_abstract_base&lt;_CharT&gt;::mask mask;
-<span class="lineNum">     617 </span>                : 
-<span class="lineNum">     618 </span>                :       /// The facet id for ctype&lt;char_type&gt;
-<span class="lineNum">     619 </span>                :       static locale::id                 id;
-<span class="lineNum">     620 </span>                : 
-<span class="lineNum">     621 </span>                :       explicit
-<span class="lineNum">     622 </span>                :       ctype(size_t __refs = 0) : __ctype_abstract_base&lt;_CharT&gt;(__refs) { }
-<span class="lineNum">     623 </span>                : 
-<span class="lineNum">     624 </span>                :    protected:
-<span class="lineNum">     625 </span>                :       virtual
-<span class="lineNum">     626 </span>                :       ~ctype();
-<span class="lineNum">     627 </span>                : 
-<span class="lineNum">     628 </span>                :       virtual bool
-<span class="lineNum">     629 </span>                :       do_is(mask __m, char_type __c) const;
-<span class="lineNum">     630 </span>                : 
-<span class="lineNum">     631 </span>                :       virtual const char_type*
-<span class="lineNum">     632 </span>                :       do_is(const char_type* __lo, const char_type* __hi, mask* __vec) const;
-<span class="lineNum">     633 </span>                : 
-<span class="lineNum">     634 </span>                :       virtual const char_type*
-<span class="lineNum">     635 </span>                :       do_scan_is(mask __m, const char_type* __lo, const char_type* __hi) const;
-<span class="lineNum">     636 </span>                : 
-<span class="lineNum">     637 </span>                :       virtual const char_type*
-<span class="lineNum">     638 </span>                :       do_scan_not(mask __m, const char_type* __lo,
-<span class="lineNum">     639 </span>                :                   const char_type* __hi) const;
-<span class="lineNum">     640 </span>                : 
-<span class="lineNum">     641 </span>                :       virtual char_type
-<span class="lineNum">     642 </span>                :       do_toupper(char_type __c) const;
-<span class="lineNum">     643 </span>                : 
-<span class="lineNum">     644 </span>                :       virtual const char_type*
-<span class="lineNum">     645 </span>                :       do_toupper(char_type* __lo, const char_type* __hi) const;
-<span class="lineNum">     646 </span>                : 
-<span class="lineNum">     647 </span>                :       virtual char_type
-<span class="lineNum">     648 </span>                :       do_tolower(char_type __c) const;
-<span class="lineNum">     649 </span>                : 
-<span class="lineNum">     650 </span>                :       virtual const char_type*
-<span class="lineNum">     651 </span>                :       do_tolower(char_type* __lo, const char_type* __hi) const;
-<span class="lineNum">     652 </span>                : 
-<span class="lineNum">     653 </span>                :       virtual char_type
-<span class="lineNum">     654 </span>                :       do_widen(char __c) const;
-<span class="lineNum">     655 </span>                : 
-<span class="lineNum">     656 </span>                :       virtual const char*
-<span class="lineNum">     657 </span>                :       do_widen(const char* __lo, const char* __hi, char_type* __dest) const;
-<span class="lineNum">     658 </span>                : 
-<span class="lineNum">     659 </span>                :       virtual char
-<span class="lineNum">     660 </span>                :       do_narrow(char_type, char __dfault) const;
-<span class="lineNum">     661 </span>                : 
-<span class="lineNum">     662 </span>                :       virtual const char_type*
-<span class="lineNum">     663 </span>                :       do_narrow(const char_type* __lo, const char_type* __hi,
-<span class="lineNum">     664 </span>                :                 char __dfault, char* __dest) const;
-<span class="lineNum">     665 </span>                :     };
-<span class="lineNum">     666 </span>                : 
-<span class="lineNum">     667 </span>                :   template&lt;typename _CharT&gt;
-<span class="lineNum">     668 </span>                :     locale::id ctype&lt;_CharT&gt;::id;
-<span class="lineNum">     669 </span>                : 
-<span class="lineNum">     670 </span>                :   // 22.2.1.3  ctype&lt;char&gt; specialization.
-<span class="lineNum">     671 </span>                :   /**
-<span class="lineNum">     672 </span>                :    *  @brief  The ctype&lt;char&gt; specialization.
-<span class="lineNum">     673 </span>                :    *
-<span class="lineNum">     674 </span>                :    *  This class defines classification and conversion functions for
-<span class="lineNum">     675 </span>                :    *  the char type.  It gets used by char streams for many I/O
-<span class="lineNum">     676 </span>                :    *  operations.  The char specialization provides a number of
-<span class="lineNum">     677 </span>                :    *  optimizations as well.
-<span class="lineNum">     678 </span>                :   */
-<span class="lineNum">     679 </span>                :   template&lt;&gt;
-<span class="lineNum">     680 </span>                :     class ctype&lt;char&gt; : public locale::facet, public ctype_base
-<span class="lineNum">     681 </span>                :     {
-<span class="lineNum">     682 </span>                :     public:
-<span class="lineNum">     683 </span>                :       // Types:
-<span class="lineNum">     684 </span>                :       /// Typedef for the template parameter char.
-<span class="lineNum">     685 </span>                :       typedef char              char_type;
-<span class="lineNum">     686 </span>                : 
-<span class="lineNum">     687 </span>                :     protected:
-<span class="lineNum">     688 </span>                :       // Data Members:
-<span class="lineNum">     689 </span>                :       __c_locale                _M_c_locale_ctype;
-<span class="lineNum">     690 </span>                :       bool                      _M_del;
-<span class="lineNum">     691 </span>                :       __to_type                 _M_toupper;
-<span class="lineNum">     692 </span>                :       __to_type                 _M_tolower;
-<span class="lineNum">     693 </span>                :       const mask*               _M_table;
-<span class="lineNum">     694 </span>                :       mutable char              _M_widen_ok;
-<span class="lineNum">     695 </span>                :       mutable char              _M_widen[1 + static_cast&lt;unsigned char&gt;(-1)];
-<span class="lineNum">     696 </span>                :       mutable char              _M_narrow[1 + static_cast&lt;unsigned char&gt;(-1)];
-<span class="lineNum">     697 </span>                :       mutable char              _M_narrow_ok;   // 0 uninitialized, 1 init,
-<span class="lineNum">     698 </span>                :                                                 // 2 memcpy can't be used
-<span class="lineNum">     699 </span>                : 
-<span class="lineNum">     700 </span>                :     public:
-<span class="lineNum">     701 </span>                :       /// The facet id for ctype&lt;char&gt;
-<span class="lineNum">     702 </span>                :       static locale::id        id;
-<span class="lineNum">     703 </span>                :       /// The size of the mask table.  It is SCHAR_MAX + 1.
-<span class="lineNum">     704 </span>                :       static const size_t      table_size = 1 + static_cast&lt;unsigned char&gt;(-1);
-<span class="lineNum">     705 </span>                : 
-<span class="lineNum">     706 </span>                :       /**
-<span class="lineNum">     707 </span>                :        *  @brief  Constructor performs initialization.
-<span class="lineNum">     708 </span>                :        *
-<span class="lineNum">     709 </span>                :        *  This is the constructor provided by the standard.
-<span class="lineNum">     710 </span>                :        *
-<span class="lineNum">     711 </span>                :        *  @param table If non-zero, table is used as the per-char mask.
-<span class="lineNum">     712 </span>                :        *               Else classic_table() is used.
-<span class="lineNum">     713 </span>                :        *  @param del   If true, passes ownership of table to this facet.
-<span class="lineNum">     714 </span>                :        *  @param refs  Passed to the base facet class.
-<span class="lineNum">     715 </span>                :       */
-<span class="lineNum">     716 </span>                :       explicit
-<span class="lineNum">     717 </span>                :       ctype(const mask* __table = 0, bool __del = false, size_t __refs = 0);
-<span class="lineNum">     718 </span>                : 
-<span class="lineNum">     719 </span>                :       /**
-<span class="lineNum">     720 </span>                :        *  @brief  Constructor performs static initialization.
-<span class="lineNum">     721 </span>                :        *
-<span class="lineNum">     722 </span>                :        *  This constructor is used to construct the initial C locale facet.
-<span class="lineNum">     723 </span>                :        *
-<span class="lineNum">     724 </span>                :        *  @param cloc  Handle to C locale data.
-<span class="lineNum">     725 </span>                :        *  @param table If non-zero, table is used as the per-char mask.
-<span class="lineNum">     726 </span>                :        *  @param del   If true, passes ownership of table to this facet.
-<span class="lineNum">     727 </span>                :        *  @param refs  Passed to the base facet class.
-<span class="lineNum">     728 </span>                :       */
-<span class="lineNum">     729 </span>                :       explicit
-<span class="lineNum">     730 </span>                :       ctype(__c_locale __cloc, const mask* __table = 0, bool __del = false,
-<span class="lineNum">     731 </span>                :             size_t __refs = 0);
-<span class="lineNum">     732 </span>                : 
-<span class="lineNum">     733 </span>                :       /**
-<span class="lineNum">     734 </span>                :        *  @brief  Test char classification.
-<span class="lineNum">     735 </span>                :        *
-<span class="lineNum">     736 </span>                :        *  This function compares the mask table[c] to @a m.
-<span class="lineNum">     737 </span>                :        *
-<span class="lineNum">     738 </span>                :        *  @param c  The char to compare the mask of.
-<span class="lineNum">     739 </span>                :        *  @param m  The mask to compare against.
-<span class="lineNum">     740 </span>                :        *  @return  True if m &amp; table[c] is true, false otherwise.
-<span class="lineNum">     741 </span>                :       */
-<span class="lineNum">     742 </span>                :       inline bool
-<span class="lineNum">     743 </span>                :       is(mask __m, char __c) const;
-<span class="lineNum">     744 </span>                : 
-<span class="lineNum">     745 </span>                :       /**
-<span class="lineNum">     746 </span>                :        *  @brief  Return a mask array.
-<span class="lineNum">     747 </span>                :        *
-<span class="lineNum">     748 </span>                :        *  This function finds the mask for each char in the range [lo, hi) and
-<span class="lineNum">     749 </span>                :        *  successively writes it to vec.  vec must have as many elements as
-<span class="lineNum">     750 </span>                :        *  the char array.
-<span class="lineNum">     751 </span>                :        *
-<span class="lineNum">     752 </span>                :        *  @param lo  Pointer to start of range.
-<span class="lineNum">     753 </span>                :        *  @param hi  Pointer to end of range.
-<span class="lineNum">     754 </span>                :        *  @param vec  Pointer to an array of mask storage.
-<span class="lineNum">     755 </span>                :        *  @return  @a hi.
-<span class="lineNum">     756 </span>                :       */
-<span class="lineNum">     757 </span>                :       inline const char*
-<span class="lineNum">     758 </span>                :       is(const char* __lo, const char* __hi, mask* __vec) const;
-<span class="lineNum">     759 </span>                : 
-<span class="lineNum">     760 </span>                :       /**
-<span class="lineNum">     761 </span>                :        *  @brief  Find char matching a mask
-<span class="lineNum">     762 </span>                :        *
-<span class="lineNum">     763 </span>                :        *  This function searches for and returns the first char in [lo,hi) for
-<span class="lineNum">     764 </span>                :        *  which is(m,char) is true.
-<span class="lineNum">     765 </span>                :        *
-<span class="lineNum">     766 </span>                :        *  @param m  The mask to compare against.
-<span class="lineNum">     767 </span>                :        *  @param lo  Pointer to start of range.
-<span class="lineNum">     768 </span>                :        *  @param hi  Pointer to end of range.
-<span class="lineNum">     769 </span>                :        *  @return  Pointer to a matching char if found, else @a hi.
-<span class="lineNum">     770 </span>                :       */
-<span class="lineNum">     771 </span>                :       inline const char*
-<span class="lineNum">     772 </span>                :       scan_is(mask __m, const char* __lo, const char* __hi) const;
-<span class="lineNum">     773 </span>                : 
-<span class="lineNum">     774 </span>                :       /**
-<span class="lineNum">     775 </span>                :        *  @brief  Find char not matching a mask
-<span class="lineNum">     776 </span>                :        *
-<span class="lineNum">     777 </span>                :        *  This function searches for and returns a pointer to the first char
-<span class="lineNum">     778 </span>                :        *  in [lo,hi) for which is(m,char) is false.
-<span class="lineNum">     779 </span>                :        *
-<span class="lineNum">     780 </span>                :        *  @param m  The mask to compare against.
-<span class="lineNum">     781 </span>                :        *  @param lo  Pointer to start of range.
-<span class="lineNum">     782 </span>                :        *  @param hi  Pointer to end of range.
-<span class="lineNum">     783 </span>                :        *  @return  Pointer to a non-matching char if found, else @a hi.
-<span class="lineNum">     784 </span>                :       */
-<span class="lineNum">     785 </span>                :       inline const char*
-<span class="lineNum">     786 </span>                :       scan_not(mask __m, const char* __lo, const char* __hi) const;
-<span class="lineNum">     787 </span>                : 
-<span class="lineNum">     788 </span>                :       /**
-<span class="lineNum">     789 </span>                :        *  @brief  Convert to uppercase.
-<span class="lineNum">     790 </span>                :        *
-<span class="lineNum">     791 </span>                :        *  This function converts the char argument to uppercase if possible.
-<span class="lineNum">     792 </span>                :        *  If not possible (for example, '2'), returns the argument.
-<span class="lineNum">     793 </span>                :        *
-<span class="lineNum">     794 </span>                :        *  toupper() acts as if it returns ctype&lt;char&gt;::do_toupper(c).
-<span class="lineNum">     795 </span>                :        *  do_toupper() must always return the same result for the same input.
-<span class="lineNum">     796 </span>                :        *
-<span class="lineNum">     797 </span>                :        *  @param c  The char to convert.
-<span class="lineNum">     798 </span>                :        *  @return  The uppercase char if convertible, else @a c.
-<span class="lineNum">     799 </span>                :       */
-<span class="lineNum">     800 </span>                :       char_type
-<span class="lineNum">     801 </span>                :       toupper(char_type __c) const
-<span class="lineNum">     802 </span>                :       { return this-&gt;do_toupper(__c); }
-<span class="lineNum">     803 </span>                : 
-<span class="lineNum">     804 </span>                :       /**
-<span class="lineNum">     805 </span>                :        *  @brief  Convert array to uppercase.
-<span class="lineNum">     806 </span>                :        *
-<span class="lineNum">     807 </span>                :        *  This function converts each char in the range [lo,hi) to uppercase
-<span class="lineNum">     808 </span>                :        *  if possible.  Other chars remain untouched.
-<span class="lineNum">     809 </span>                :        *
-<span class="lineNum">     810 </span>                :        *  toupper() acts as if it returns ctype&lt;char&gt;:: do_toupper(lo, hi).
-<span class="lineNum">     811 </span>                :        *  do_toupper() must always return the same result for the same input.
-<span class="lineNum">     812 </span>                :        *
-<span class="lineNum">     813 </span>                :        *  @param lo  Pointer to first char in range.
-<span class="lineNum">     814 </span>                :        *  @param hi  Pointer to end of range.
-<span class="lineNum">     815 </span>                :        *  @return  @a hi.
-<span class="lineNum">     816 </span>                :       */
-<span class="lineNum">     817 </span>                :       const char_type*
-<span class="lineNum">     818 </span>                :       toupper(char_type *__lo, const char_type* __hi) const
-<span class="lineNum">     819 </span>                :       { return this-&gt;do_toupper(__lo, __hi); }
-<span class="lineNum">     820 </span>                : 
-<span class="lineNum">     821 </span>                :       /**
-<span class="lineNum">     822 </span>                :        *  @brief  Convert to lowercase.
-<span class="lineNum">     823 </span>                :        *
-<span class="lineNum">     824 </span>                :        *  This function converts the char argument to lowercase if possible.
-<span class="lineNum">     825 </span>                :        *  If not possible (for example, '2'), returns the argument.
-<span class="lineNum">     826 </span>                :        *
-<span class="lineNum">     827 </span>                :        *  tolower() acts as if it returns ctype&lt;char&gt;::do_tolower(c).
-<span class="lineNum">     828 </span>                :        *  do_tolower() must always return the same result for the same input.
-<span class="lineNum">     829 </span>                :        *
-<span class="lineNum">     830 </span>                :        *  @param c  The char to convert.
-<span class="lineNum">     831 </span>                :        *  @return  The lowercase char if convertible, else @a c.
-<span class="lineNum">     832 </span>                :       */
-<span class="lineNum">     833 </span>                :       char_type
-<span class="lineNum">     834 </span>                :       tolower(char_type __c) const
-<span class="lineNum">     835 </span>                :       { return this-&gt;do_tolower(__c); }
-<span class="lineNum">     836 </span>                : 
-<span class="lineNum">     837 </span>                :       /**
-<span class="lineNum">     838 </span>                :        *  @brief  Convert array to lowercase.
-<span class="lineNum">     839 </span>                :        *
-<span class="lineNum">     840 </span>                :        *  This function converts each char in the range [lo,hi) to lowercase
-<span class="lineNum">     841 </span>                :        *  if possible.  Other chars remain untouched.
-<span class="lineNum">     842 </span>                :        *
-<span class="lineNum">     843 </span>                :        *  tolower() acts as if it returns ctype&lt;char&gt;:: do_tolower(lo, hi).
-<span class="lineNum">     844 </span>                :        *  do_tolower() must always return the same result for the same input.
-<span class="lineNum">     845 </span>                :        *
-<span class="lineNum">     846 </span>                :        *  @param lo  Pointer to first char in range.
-<span class="lineNum">     847 </span>                :        *  @param hi  Pointer to end of range.
-<span class="lineNum">     848 </span>                :        *  @return  @a hi.
-<span class="lineNum">     849 </span>                :       */
-<span class="lineNum">     850 </span>                :       const char_type*
-<span class="lineNum">     851 </span>                :       tolower(char_type* __lo, const char_type* __hi) const
-<span class="lineNum">     852 </span>                :       { return this-&gt;do_tolower(__lo, __hi); }
-<span class="lineNum">     853 </span>                : 
-<span class="lineNum">     854 </span>                :       /**
-<span class="lineNum">     855 </span>                :        *  @brief  Widen char
-<span class="lineNum">     856 </span>                :        *
-<span class="lineNum">     857 </span>                :        *  This function converts the char to char_type using the simplest
-<span class="lineNum">     858 </span>                :        *  reasonable transformation.  For an underived ctype&lt;char&gt; facet, the
-<span class="lineNum">     859 </span>                :        *  argument will be returned unchanged.
-<span class="lineNum">     860 </span>                :        *
-<span class="lineNum">     861 </span>                :        *  This function works as if it returns ctype&lt;char&gt;::do_widen(c).
-<span class="lineNum">     862 </span>                :        *  do_widen() must always return the same result for the same input.
-<span class="lineNum">     863 </span>                :        *
-<span class="lineNum">     864 </span>                :        *  Note: this is not what you want for codepage conversions.  See
-<span class="lineNum">     865 </span>                :        *  codecvt for that.
-<span class="lineNum">     866 </span>                :        *
-<span class="lineNum">     867 </span>                :        *  @param c  The char to convert.
-<span class="lineNum">     868 </span>                :        *  @return  The converted character.
-<span class="lineNum">     869 </span>                :       */
-<span class="lineNum">     870 </span>                :       char_type
-<span class="lineNum">     871 </span><span class="lineNoCov">              0 :       widen(char __c) const</span>
-<span class="lineNum">     872 </span>                :       {
-<span class="lineNum">     873 </span><span class="lineNoCov">              0 :         if (_M_widen_ok)</span>
-<span class="lineNum">     874 </span><span class="lineNoCov">              0 :           return _M_widen[static_cast&lt;unsigned char&gt;(__c)];</span>
-<span class="lineNum">     875 </span><span class="lineNoCov">              0 :         this-&gt;_M_widen_init();</span>
-<span class="lineNum">     876 </span><span class="lineNoCov">              0 :         return this-&gt;do_widen(__c);</span>
-<span class="lineNum">     877 </span>                :       }
-<span class="lineNum">     878 </span>                : 
-<span class="lineNum">     879 </span>                :       /**
-<span class="lineNum">     880 </span>                :        *  @brief  Widen char array
-<span class="lineNum">     881 </span>                :        *
-<span class="lineNum">     882 </span>                :        *  This function converts each char in the input to char using the
-<span class="lineNum">     883 </span>                :        *  simplest reasonable transformation.  For an underived ctype&lt;char&gt;
-<span class="lineNum">     884 </span>                :        *  facet, the argument will be copied unchanged.
-<span class="lineNum">     885 </span>                :        *
-<span class="lineNum">     886 </span>                :        *  This function works as if it returns ctype&lt;char&gt;::do_widen(c).
-<span class="lineNum">     887 </span>                :        *  do_widen() must always return the same result for the same input.
-<span class="lineNum">     888 </span>                :        *
-<span class="lineNum">     889 </span>                :        *  Note: this is not what you want for codepage conversions.  See
-<span class="lineNum">     890 </span>                :        *  codecvt for that.
-<span class="lineNum">     891 </span>                :        *
-<span class="lineNum">     892 </span>                :        *  @param lo  Pointer to first char in range.
-<span class="lineNum">     893 </span>                :        *  @param hi  Pointer to end of range.
-<span class="lineNum">     894 </span>                :        *  @param to  Pointer to the destination array.
-<span class="lineNum">     895 </span>                :        *  @return  @a hi.
-<span class="lineNum">     896 </span>                :       */
-<span class="lineNum">     897 </span>                :       const char*
-<span class="lineNum">     898 </span>                :       widen(const char* __lo, const char* __hi, char_type* __to) const
-<span class="lineNum">     899 </span>                :       {
-<span class="lineNum">     900 </span>                :         if (_M_widen_ok == 1)
-<span class="lineNum">     901 </span>                :           {
-<span class="lineNum">     902 </span>                :             __builtin_memcpy(__to, __lo, __hi - __lo);
-<span class="lineNum">     903 </span>                :             return __hi;
-<span class="lineNum">     904 </span>                :           }
-<span class="lineNum">     905 </span>                :         if (!_M_widen_ok)
-<span class="lineNum">     906 </span>                :           _M_widen_init();
-<span class="lineNum">     907 </span>                :         return this-&gt;do_widen(__lo, __hi, __to);
-<span class="lineNum">     908 </span>                :       }
-<span class="lineNum">     909 </span>                : 
-<span class="lineNum">     910 </span>                :       /**
-<span class="lineNum">     911 </span>                :        *  @brief  Narrow char
-<span class="lineNum">     912 </span>                :        *
-<span class="lineNum">     913 </span>                :        *  This function converts the char to char using the simplest
-<span class="lineNum">     914 </span>                :        *  reasonable transformation.  If the conversion fails, dfault is
-<span class="lineNum">     915 </span>                :        *  returned instead.  For an underived ctype&lt;char&gt; facet, @a c
-<span class="lineNum">     916 </span>                :        *  will be returned unchanged.
-<span class="lineNum">     917 </span>                :        *
-<span class="lineNum">     918 </span>                :        *  This function works as if it returns ctype&lt;char&gt;::do_narrow(c).
-<span class="lineNum">     919 </span>                :        *  do_narrow() must always return the same result for the same input.
-<span class="lineNum">     920 </span>                :        *
-<span class="lineNum">     921 </span>                :        *  Note: this is not what you want for codepage conversions.  See
-<span class="lineNum">     922 </span>                :        *  codecvt for that.
-<span class="lineNum">     923 </span>                :        *
-<span class="lineNum">     924 </span>                :        *  @param c  The char to convert.
-<span class="lineNum">     925 </span>                :        *  @param dfault  Char to return if conversion fails.
-<span class="lineNum">     926 </span>                :        *  @return  The converted character.
-<span class="lineNum">     927 </span>                :       */
-<span class="lineNum">     928 </span>                :       char
-<span class="lineNum">     929 </span>                :       narrow(char_type __c, char __dfault) const
-<span class="lineNum">     930 </span>                :       {
-<span class="lineNum">     931 </span>                :         if (_M_narrow[static_cast&lt;unsigned char&gt;(__c)])
-<span class="lineNum">     932 </span>                :           return _M_narrow[static_cast&lt;unsigned char&gt;(__c)];
-<span class="lineNum">     933 </span>                :         const char __t = do_narrow(__c, __dfault);
-<span class="lineNum">     934 </span>                :         if (__t != __dfault)
-<span class="lineNum">     935 </span>                :           _M_narrow[static_cast&lt;unsigned char&gt;(__c)] = __t;
-<span class="lineNum">     936 </span>                :         return __t;
-<span class="lineNum">     937 </span>                :       }
-<span class="lineNum">     938 </span>                : 
-<span class="lineNum">     939 </span>                :       /**
-<span class="lineNum">     940 </span>                :        *  @brief  Narrow char array
-<span class="lineNum">     941 </span>                :        *
-<span class="lineNum">     942 </span>                :        *  This function converts each char in the input to char using the
-<span class="lineNum">     943 </span>                :        *  simplest reasonable transformation and writes the results to the
-<span class="lineNum">     944 </span>                :        *  destination array.  For any char in the input that cannot be
-<span class="lineNum">     945 </span>                :        *  converted, @a dfault is used instead.  For an underived ctype&lt;char&gt;
-<span class="lineNum">     946 </span>                :        *  facet, the argument will be copied unchanged.
-<span class="lineNum">     947 </span>                :        *
-<span class="lineNum">     948 </span>                :        *  This function works as if it returns ctype&lt;char&gt;::do_narrow(lo, hi,
-<span class="lineNum">     949 </span>                :        *  dfault, to).  do_narrow() must always return the same result for the
-<span class="lineNum">     950 </span>                :        *  same input.
-<span class="lineNum">     951 </span>                :        *
-<span class="lineNum">     952 </span>                :        *  Note: this is not what you want for codepage conversions.  See
-<span class="lineNum">     953 </span>                :        *  codecvt for that.
-<span class="lineNum">     954 </span>                :        *
-<span class="lineNum">     955 </span>                :        *  @param lo  Pointer to start of range.
-<span class="lineNum">     956 </span>                :        *  @param hi  Pointer to end of range.
-<span class="lineNum">     957 </span>                :        *  @param dfault  Char to use if conversion fails.
-<span class="lineNum">     958 </span>                :        *  @param to  Pointer to the destination array.
-<span class="lineNum">     959 </span>                :        *  @return  @a hi.
-<span class="lineNum">     960 </span>                :       */
-<span class="lineNum">     961 </span>                :       const char_type*
-<span class="lineNum">     962 </span>                :       narrow(const char_type* __lo, const char_type* __hi,
-<span class="lineNum">     963 </span>                :              char __dfault, char *__to) const
-<span class="lineNum">     964 </span>                :       {
-<span class="lineNum">     965 </span>                :         if (__builtin_expect(_M_narrow_ok == 1, true))
-<span class="lineNum">     966 </span>                :           {
-<span class="lineNum">     967 </span>                :             __builtin_memcpy(__to, __lo, __hi - __lo);
-<span class="lineNum">     968 </span>                :             return __hi;
-<span class="lineNum">     969 </span>                :           }
-<span class="lineNum">     970 </span>                :         if (!_M_narrow_ok)
-<span class="lineNum">     971 </span>                :           _M_narrow_init();
-<span class="lineNum">     972 </span>                :         return this-&gt;do_narrow(__lo, __hi, __dfault, __to);
-<span class="lineNum">     973 </span>                :       }
-<span class="lineNum">     974 </span>                : 
-<span class="lineNum">     975 </span>                :       // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     976 </span>                :       // DR 695. ctype&lt;char&gt;::classic_table() not accessible.
-<span class="lineNum">     977 </span>                :       /// Returns a pointer to the mask table provided to the constructor, or
-<span class="lineNum">     978 </span>                :       /// the default from classic_table() if none was provided.
-<span class="lineNum">     979 </span>                :       const mask*
-<span class="lineNum">     980 </span>                :       table() const throw()
-<span class="lineNum">     981 </span>                :       { return _M_table; }
-<span class="lineNum">     982 </span>                : 
-<span class="lineNum">     983 </span>                :       /// Returns a pointer to the C locale mask table.
-<span class="lineNum">     984 </span>                :       static const mask*
-<span class="lineNum">     985 </span>                :       classic_table() throw();
-<span class="lineNum">     986 </span>                :     protected:
-<span class="lineNum">     987 </span>                : 
-<span class="lineNum">     988 </span>                :       /**
-<span class="lineNum">     989 </span>                :        *  @brief  Destructor.
-<span class="lineNum">     990 </span>                :        *
-<span class="lineNum">     991 </span>                :        *  This function deletes table() if @a del was true in the
-<span class="lineNum">     992 </span>                :        *  constructor.
-<span class="lineNum">     993 </span>                :       */
-<span class="lineNum">     994 </span>                :       virtual
-<span class="lineNum">     995 </span>                :       ~ctype();
-<span class="lineNum">     996 </span>                : 
-<span class="lineNum">     997 </span>                :       /**
-<span class="lineNum">     998 </span>                :        *  @brief  Convert to uppercase.
-<span class="lineNum">     999 </span>                :        *
-<span class="lineNum">    1000 </span>                :        *  This virtual function converts the char argument to uppercase if
-<span class="lineNum">    1001 </span>                :        *  possible.  If not possible (for example, '2'), returns the argument.
-<span class="lineNum">    1002 </span>                :        *
-<span class="lineNum">    1003 </span>                :        *  do_toupper() is a hook for a derived facet to change the behavior of
-<span class="lineNum">    1004 </span>                :        *  uppercasing.  do_toupper() must always return the same result for
-<span class="lineNum">    1005 </span>                :        *  the same input.
-<span class="lineNum">    1006 </span>                :        *
-<span class="lineNum">    1007 </span>                :        *  @param c  The char to convert.
-<span class="lineNum">    1008 </span>                :        *  @return  The uppercase char if convertible, else @a c.
-<span class="lineNum">    1009 </span>                :       */
-<span class="lineNum">    1010 </span>                :       virtual char_type
-<span class="lineNum">    1011 </span>                :       do_toupper(char_type) const;
-<span class="lineNum">    1012 </span>                : 
-<span class="lineNum">    1013 </span>                :       /**
-<span class="lineNum">    1014 </span>                :        *  @brief  Convert array to uppercase.
-<span class="lineNum">    1015 </span>                :        *
-<span class="lineNum">    1016 </span>                :        *  This virtual function converts each char in the range [lo,hi) to
-<span class="lineNum">    1017 </span>                :        *  uppercase if possible.  Other chars remain untouched.
-<span class="lineNum">    1018 </span>                :        *
-<span class="lineNum">    1019 </span>                :        *  do_toupper() is a hook for a derived facet to change the behavior of
-<span class="lineNum">    1020 </span>                :        *  uppercasing.  do_toupper() must always return the same result for
-<span class="lineNum">    1021 </span>                :        *  the same input.
-<span class="lineNum">    1022 </span>                :        *
-<span class="lineNum">    1023 </span>                :        *  @param lo  Pointer to start of range.
-<span class="lineNum">    1024 </span>                :        *  @param hi  Pointer to end of range.
-<span class="lineNum">    1025 </span>                :        *  @return  @a hi.
-<span class="lineNum">    1026 </span>                :       */
-<span class="lineNum">    1027 </span>                :       virtual const char_type*
-<span class="lineNum">    1028 </span>                :       do_toupper(char_type* __lo, const char_type* __hi) const;
-<span class="lineNum">    1029 </span>                : 
-<span class="lineNum">    1030 </span>                :       /**
-<span class="lineNum">    1031 </span>                :        *  @brief  Convert to lowercase.
-<span class="lineNum">    1032 </span>                :        *
-<span class="lineNum">    1033 </span>                :        *  This virtual function converts the char argument to lowercase if
-<span class="lineNum">    1034 </span>                :        *  possible.  If not possible (for example, '2'), returns the argument.
-<span class="lineNum">    1035 </span>                :        *
-<span class="lineNum">    1036 </span>                :        *  do_tolower() is a hook for a derived facet to change the behavior of
-<span class="lineNum">    1037 </span>                :        *  lowercasing.  do_tolower() must always return the same result for
-<span class="lineNum">    1038 </span>                :        *  the same input.
-<span class="lineNum">    1039 </span>                :        *
-<span class="lineNum">    1040 </span>                :        *  @param c  The char to convert.
-<span class="lineNum">    1041 </span>                :        *  @return  The lowercase char if convertible, else @a c.
-<span class="lineNum">    1042 </span>                :       */
-<span class="lineNum">    1043 </span>                :       virtual char_type
-<span class="lineNum">    1044 </span>                :       do_tolower(char_type) const;
-<span class="lineNum">    1045 </span>                : 
-<span class="lineNum">    1046 </span>                :       /**
-<span class="lineNum">    1047 </span>                :        *  @brief  Convert array to lowercase.
-<span class="lineNum">    1048 </span>                :        *
-<span class="lineNum">    1049 </span>                :        *  This virtual function converts each char in the range [lo,hi) to
-<span class="lineNum">    1050 </span>                :        *  lowercase if possible.  Other chars remain untouched.
-<span class="lineNum">    1051 </span>                :        *
-<span class="lineNum">    1052 </span>                :        *  do_tolower() is a hook for a derived facet to change the behavior of
-<span class="lineNum">    1053 </span>                :        *  lowercasing.  do_tolower() must always return the same result for
-<span class="lineNum">    1054 </span>                :        *  the same input.
-<span class="lineNum">    1055 </span>                :        *
-<span class="lineNum">    1056 </span>                :        *  @param lo  Pointer to first char in range.
-<span class="lineNum">    1057 </span>                :        *  @param hi  Pointer to end of range.
-<span class="lineNum">    1058 </span>                :        *  @return  @a hi.
-<span class="lineNum">    1059 </span>                :       */
-<span class="lineNum">    1060 </span>                :       virtual const char_type*
-<span class="lineNum">    1061 </span>                :       do_tolower(char_type* __lo, const char_type* __hi) const;
-<span class="lineNum">    1062 </span>                : 
-<span class="lineNum">    1063 </span>                :       /**
-<span class="lineNum">    1064 </span>                :        *  @brief  Widen char
-<span class="lineNum">    1065 </span>                :        *
-<span class="lineNum">    1066 </span>                :        *  This virtual function converts the char to char using the simplest
-<span class="lineNum">    1067 </span>                :        *  reasonable transformation.  For an underived ctype&lt;char&gt; facet, the
-<span class="lineNum">    1068 </span>                :        *  argument will be returned unchanged.
-<span class="lineNum">    1069 </span>                :        *
-<span class="lineNum">    1070 </span>                :        *  do_widen() is a hook for a derived facet to change the behavior of
-<span class="lineNum">    1071 </span>                :        *  widening.  do_widen() must always return the same result for the
-<span class="lineNum">    1072 </span>                :        *  same input.
-<span class="lineNum">    1073 </span>                :        *
-<span class="lineNum">    1074 </span>                :        *  Note: this is not what you want for codepage conversions.  See
-<span class="lineNum">    1075 </span>                :        *  codecvt for that.
-<span class="lineNum">    1076 </span>                :        *
-<span class="lineNum">    1077 </span>                :        *  @param c  The char to convert.
-<span class="lineNum">    1078 </span>                :        *  @return  The converted character.
-<span class="lineNum">    1079 </span>                :       */
-<span class="lineNum">    1080 </span>                :       virtual char_type
-<span class="lineNum">    1081 </span>                :       do_widen(char __c) const
-<span class="lineNum">    1082 </span>                :       { return __c; }
-<span class="lineNum">    1083 </span>                : 
-<span class="lineNum">    1084 </span>                :       /**
-<span class="lineNum">    1085 </span>                :        *  @brief  Widen char array
-<span class="lineNum">    1086 </span>                :        *
-<span class="lineNum">    1087 </span>                :        *  This function converts each char in the range [lo,hi) to char using
-<span class="lineNum">    1088 </span>                :        *  the simplest reasonable transformation.  For an underived
-<span class="lineNum">    1089 </span>                :        *  ctype&lt;char&gt; facet, the argument will be copied unchanged.
-<span class="lineNum">    1090 </span>                :        *
-<span class="lineNum">    1091 </span>                :        *  do_widen() is a hook for a derived facet to change the behavior of
-<span class="lineNum">    1092 </span>                :        *  widening.  do_widen() must always return the same result for the
-<span class="lineNum">    1093 </span>                :        *  same input.
-<span class="lineNum">    1094 </span>                :        *
-<span class="lineNum">    1095 </span>                :        *  Note: this is not what you want for codepage conversions.  See
-<span class="lineNum">    1096 </span>                :        *  codecvt for that.
-<span class="lineNum">    1097 </span>                :        *
-<span class="lineNum">    1098 </span>                :        *  @param lo  Pointer to start of range.
-<span class="lineNum">    1099 </span>                :        *  @param hi  Pointer to end of range.
-<span class="lineNum">    1100 </span>                :        *  @param to  Pointer to the destination array.
-<span class="lineNum">    1101 </span>                :        *  @return  @a hi.
-<span class="lineNum">    1102 </span>                :       */
-<span class="lineNum">    1103 </span>                :       virtual const char*
-<span class="lineNum">    1104 </span>                :       do_widen(const char* __lo, const char* __hi, char_type* __dest) const
-<span class="lineNum">    1105 </span>                :       {
-<span class="lineNum">    1106 </span>                :         __builtin_memcpy(__dest, __lo, __hi - __lo);
-<span class="lineNum">    1107 </span>                :         return __hi;
-<span class="lineNum">    1108 </span>                :       }
-<span class="lineNum">    1109 </span>                : 
-<span class="lineNum">    1110 </span>                :       /**
-<span class="lineNum">    1111 </span>                :        *  @brief  Narrow char
-<span class="lineNum">    1112 </span>                :        *
-<span class="lineNum">    1113 </span>                :        *  This virtual function converts the char to char using the simplest
-<span class="lineNum">    1114 </span>                :        *  reasonable transformation.  If the conversion fails, dfault is
-<span class="lineNum">    1115 </span>                :        *  returned instead.  For an underived ctype&lt;char&gt; facet, @a c will be
-<span class="lineNum">    1116 </span>                :        *  returned unchanged.
-<span class="lineNum">    1117 </span>                :        *
-<span class="lineNum">    1118 </span>                :        *  do_narrow() is a hook for a derived facet to change the behavior of
-<span class="lineNum">    1119 </span>                :        *  narrowing.  do_narrow() must always return the same result for the
-<span class="lineNum">    1120 </span>                :        *  same input.
-<span class="lineNum">    1121 </span>                :        *
-<span class="lineNum">    1122 </span>                :        *  Note: this is not what you want for codepage conversions.  See
-<span class="lineNum">    1123 </span>                :        *  codecvt for that.
-<span class="lineNum">    1124 </span>                :        *
-<span class="lineNum">    1125 </span>                :        *  @param c  The char to convert.
-<span class="lineNum">    1126 </span>                :        *  @param dfault  Char to return if conversion fails.
-<span class="lineNum">    1127 </span>                :        *  @return  The converted char.
-<span class="lineNum">    1128 </span>                :       */
-<span class="lineNum">    1129 </span>                :       virtual char
-<span class="lineNum">    1130 </span>                :       do_narrow(char_type __c, char) const
-<span class="lineNum">    1131 </span>                :       { return __c; }
-<span class="lineNum">    1132 </span>                : 
-<span class="lineNum">    1133 </span>                :       /**
-<span class="lineNum">    1134 </span>                :        *  @brief  Narrow char array to char array
-<span class="lineNum">    1135 </span>                :        *
-<span class="lineNum">    1136 </span>                :        *  This virtual function converts each char in the range [lo,hi) to
-<span class="lineNum">    1137 </span>                :        *  char using the simplest reasonable transformation and writes the
-<span class="lineNum">    1138 </span>                :        *  results to the destination array.  For any char in the input that
-<span class="lineNum">    1139 </span>                :        *  cannot be converted, @a dfault is used instead.  For an underived
-<span class="lineNum">    1140 </span>                :        *  ctype&lt;char&gt; facet, the argument will be copied unchanged.
-<span class="lineNum">    1141 </span>                :        *
-<span class="lineNum">    1142 </span>                :        *  do_narrow() is a hook for a derived facet to change the behavior of
-<span class="lineNum">    1143 </span>                :        *  narrowing.  do_narrow() must always return the same result for the
-<span class="lineNum">    1144 </span>                :        *  same input.
-<span class="lineNum">    1145 </span>                :        *
-<span class="lineNum">    1146 </span>                :        *  Note: this is not what you want for codepage conversions.  See
-<span class="lineNum">    1147 </span>                :        *  codecvt for that.
-<span class="lineNum">    1148 </span>                :        *
-<span class="lineNum">    1149 </span>                :        *  @param lo  Pointer to start of range.
-<span class="lineNum">    1150 </span>                :        *  @param hi  Pointer to end of range.
-<span class="lineNum">    1151 </span>                :        *  @param dfault  Char to use if conversion fails.
-<span class="lineNum">    1152 </span>                :        *  @param to  Pointer to the destination array.
-<span class="lineNum">    1153 </span>                :        *  @return  @a hi.
-<span class="lineNum">    1154 </span>                :       */
-<span class="lineNum">    1155 </span>                :       virtual const char_type*
-<span class="lineNum">    1156 </span>                :       do_narrow(const char_type* __lo, const char_type* __hi,
-<span class="lineNum">    1157 </span>                :                 char, char* __dest) const
-<span class="lineNum">    1158 </span>                :       {
-<span class="lineNum">    1159 </span>                :         __builtin_memcpy(__dest, __lo, __hi - __lo);
-<span class="lineNum">    1160 </span>                :         return __hi;
-<span class="lineNum">    1161 </span>                :       }
-<span class="lineNum">    1162 </span>                : 
-<span class="lineNum">    1163 </span>                :     private:
-<span class="lineNum">    1164 </span>                : 
-<span class="lineNum">    1165 </span><span class="lineNoCov">              0 :       void _M_widen_init() const</span>
-<span class="lineNum">    1166 </span>                :       {
-<span class="lineNum">    1167 </span>                :         char __tmp[sizeof(_M_widen)];
-<span class="lineNum">    1168 </span><span class="lineNoCov">              0 :         for (size_t __i = 0; __i &lt; sizeof(_M_widen); ++__i)</span>
-<span class="lineNum">    1169 </span><span class="lineNoCov">              0 :           __tmp[__i] = __i;</span>
-<span class="lineNum">    1170 </span><span class="lineNoCov">              0 :         do_widen(__tmp, __tmp + sizeof(__tmp), _M_widen);</span>
-<span class="lineNum">    1171 </span>                : 
-<span class="lineNum">    1172 </span><span class="lineNoCov">              0 :         _M_widen_ok = 1;</span>
-<span class="lineNum">    1173 </span>                :         // Set _M_widen_ok to 2 if memcpy can't be used.
-<span class="lineNum">    1174 </span><span class="lineNoCov">              0 :         if (__builtin_memcmp(__tmp, _M_widen, sizeof(_M_widen)))</span>
-<span class="lineNum">    1175 </span><span class="lineNoCov">              0 :           _M_widen_ok = 2;</span>
-<span class="lineNum">    1176 </span><span class="lineNoCov">              0 :       }</span>
-<span class="lineNum">    1177 </span>                : 
-<span class="lineNum">    1178 </span>                :       // Fill in the narrowing cache and flag whether all values are
-<span class="lineNum">    1179 </span>                :       // valid or not.  _M_narrow_ok is set to 2 if memcpy can't
-<span class="lineNum">    1180 </span>                :       // be used.
-<span class="lineNum">    1181 </span>                :       void _M_narrow_init() const
-<span class="lineNum">    1182 </span>                :       {
-<span class="lineNum">    1183 </span>                :         char __tmp[sizeof(_M_narrow)];
-<span class="lineNum">    1184 </span>                :         for (size_t __i = 0; __i &lt; sizeof(_M_narrow); ++__i)
-<span class="lineNum">    1185 </span>                :           __tmp[__i] = __i;
-<span class="lineNum">    1186 </span>                :         do_narrow(__tmp, __tmp + sizeof(__tmp), 0, _M_narrow);
-<span class="lineNum">    1187 </span>                : 
-<span class="lineNum">    1188 </span>                :         _M_narrow_ok = 1;
-<span class="lineNum">    1189 </span>                :         if (__builtin_memcmp(__tmp, _M_narrow, sizeof(_M_narrow)))
-<span class="lineNum">    1190 </span>                :           _M_narrow_ok = 2;
-<span class="lineNum">    1191 </span>                :         else
-<span class="lineNum">    1192 </span>                :           {
-<span class="lineNum">    1193 </span>                :             // Deal with the special case of zero: renarrow with a
-<span class="lineNum">    1194 </span>                :             // different default and compare.
-<span class="lineNum">    1195 </span>                :             char __c;
-<span class="lineNum">    1196 </span>                :             do_narrow(__tmp, __tmp + 1, 1, &amp;__c);
-<span class="lineNum">    1197 </span>                :             if (__c == 1)
-<span class="lineNum">    1198 </span>                :               _M_narrow_ok = 2;
-<span class="lineNum">    1199 </span>                :           }
-<span class="lineNum">    1200 </span>                :       }
-<span class="lineNum">    1201 </span>                :     };
-<span class="lineNum">    1202 </span>                : 
-<span class="lineNum">    1203 </span>                :   template&lt;&gt;
-<span class="lineNum">    1204 </span>                :     const ctype&lt;char&gt;&amp;
-<span class="lineNum">    1205 </span>                :     use_facet&lt;ctype&lt;char&gt; &gt;(const locale&amp; __loc);
-<span class="lineNum">    1206 </span>                : 
-<span class="lineNum">    1207 </span>                : #ifdef _GLIBCXX_USE_WCHAR_T
-<span class="lineNum">    1208 </span>                :   // 22.2.1.3  ctype&lt;wchar_t&gt; specialization
-<span class="lineNum">    1209 </span>                :   /**
-<span class="lineNum">    1210 </span>                :    *  @brief  The ctype&lt;wchar_t&gt; specialization.
-<span class="lineNum">    1211 </span>                :    *
-<span class="lineNum">    1212 </span>                :    *  This class defines classification and conversion functions for the
-<span class="lineNum">    1213 </span>                :    *  wchar_t type.  It gets used by wchar_t streams for many I/O operations.
-<span class="lineNum">    1214 </span>                :    *  The wchar_t specialization provides a number of optimizations as well.
-<span class="lineNum">    1215 </span>                :    *
-<span class="lineNum">    1216 </span>                :    *  ctype&lt;wchar_t&gt; inherits its public methods from
-<span class="lineNum">    1217 </span>                :    *  __ctype_abstract_base&lt;wchar_t&gt;.
-<span class="lineNum">    1218 </span>                :   */
-<span class="lineNum">    1219 </span>                :   template&lt;&gt;
-<span class="lineNum">    1220 </span>                :     class ctype&lt;wchar_t&gt; : public __ctype_abstract_base&lt;wchar_t&gt;
-<span class="lineNum">    1221 </span>                :     {
-<span class="lineNum">    1222 </span>                :     public:
-<span class="lineNum">    1223 </span>                :       // Types:
-<span class="lineNum">    1224 </span>                :       /// Typedef for the template parameter wchar_t.
-<span class="lineNum">    1225 </span>                :       typedef wchar_t           char_type;
-<span class="lineNum">    1226 </span>                :       typedef wctype_t          __wmask_type;
-<span class="lineNum">    1227 </span>                : 
-<span class="lineNum">    1228 </span>                :     protected:
-<span class="lineNum">    1229 </span>                :       __c_locale                _M_c_locale_ctype;
-<span class="lineNum">    1230 </span>                : 
-<span class="lineNum">    1231 </span>                :       // Pre-computed narrowed and widened chars.
-<span class="lineNum">    1232 </span>                :       bool                      _M_narrow_ok;
-<span class="lineNum">    1233 </span>                :       char                      _M_narrow[128];
-<span class="lineNum">    1234 </span>                :       wint_t                    _M_widen[1 + static_cast&lt;unsigned char&gt;(-1)];
-<span class="lineNum">    1235 </span>                : 
-<span class="lineNum">    1236 </span>                :       // Pre-computed elements for do_is.
-<span class="lineNum">    1237 </span>                :       mask                      _M_bit[16];
-<span class="lineNum">    1238 </span>                :       __wmask_type              _M_wmask[16];
-<span class="lineNum">    1239 </span>                : 
-<span class="lineNum">    1240 </span>                :     public:
-<span class="lineNum">    1241 </span>                :       // Data Members:
-<span class="lineNum">    1242 </span>                :       /// The facet id for ctype&lt;wchar_t&gt;
-<span class="lineNum">    1243 </span>                :       static locale::id         id;
-<span class="lineNum">    1244 </span>                : 
-<span class="lineNum">    1245 </span>                :       /**
-<span class="lineNum">    1246 </span>                :        *  @brief  Constructor performs initialization.
-<span class="lineNum">    1247 </span>                :        *
-<span class="lineNum">    1248 </span>                :        *  This is the constructor provided by the standard.
-<span class="lineNum">    1249 </span>                :        *
-<span class="lineNum">    1250 </span>                :        *  @param refs  Passed to the base facet class.
-<span class="lineNum">    1251 </span>                :       */
-<span class="lineNum">    1252 </span>                :       explicit
-<span class="lineNum">    1253 </span>                :       ctype(size_t __refs = 0);
-<span class="lineNum">    1254 </span>                : 
-<span class="lineNum">    1255 </span>                :       /**
-<span class="lineNum">    1256 </span>                :        *  @brief  Constructor performs static initialization.
-<span class="lineNum">    1257 </span>                :        *
-<span class="lineNum">    1258 </span>                :        *  This constructor is used to construct the initial C locale facet.
-<span class="lineNum">    1259 </span>                :        *
-<span class="lineNum">    1260 </span>                :        *  @param cloc  Handle to C locale data.
-<span class="lineNum">    1261 </span>                :        *  @param refs  Passed to the base facet class.
-<span class="lineNum">    1262 </span>                :       */
-<span class="lineNum">    1263 </span>                :       explicit
-<span class="lineNum">    1264 </span>                :       ctype(__c_locale __cloc, size_t __refs = 0);
-<span class="lineNum">    1265 </span>                : 
-<span class="lineNum">    1266 </span>                :     protected:
-<span class="lineNum">    1267 </span>                :       __wmask_type
-<span class="lineNum">    1268 </span>                :       _M_convert_to_wmask(const mask __m) const;
-<span class="lineNum">    1269 </span>                : 
-<span class="lineNum">    1270 </span>                :       /// Destructor
-<span class="lineNum">    1271 </span>                :       virtual
-<span class="lineNum">    1272 </span>                :       ~ctype();
-<span class="lineNum">    1273 </span>                : 
-<span class="lineNum">    1274 </span>                :       /**
-<span class="lineNum">    1275 </span>                :        *  @brief  Test wchar_t classification.
-<span class="lineNum">    1276 </span>                :        *
-<span class="lineNum">    1277 </span>                :        *  This function finds a mask M for @a c and compares it to mask @a m.
-<span class="lineNum">    1278 </span>                :        *
-<span class="lineNum">    1279 </span>                :        *  do_is() is a hook for a derived facet to change the behavior of
-<span class="lineNum">    1280 </span>                :        *  classifying.  do_is() must always return the same result for the
-<span class="lineNum">    1281 </span>                :        *  same input.
-<span class="lineNum">    1282 </span>                :        *
-<span class="lineNum">    1283 </span>                :        *  @param c  The wchar_t to find the mask of.
-<span class="lineNum">    1284 </span>                :        *  @param m  The mask to compare against.
-<span class="lineNum">    1285 </span>                :        *  @return  (M &amp; m) != 0.
-<span class="lineNum">    1286 </span>                :       */
-<span class="lineNum">    1287 </span>                :       virtual bool
-<span class="lineNum">    1288 </span>                :       do_is(mask __m, char_type __c) const;
-<span class="lineNum">    1289 </span>                : 
-<span class="lineNum">    1290 </span>                :       /**
-<span class="lineNum">    1291 </span>                :        *  @brief  Return a mask array.
-<span class="lineNum">    1292 </span>                :        *
-<span class="lineNum">    1293 </span>                :        *  This function finds the mask for each wchar_t in the range [lo,hi)
-<span class="lineNum">    1294 </span>                :        *  and successively writes it to vec.  vec must have as many elements
-<span class="lineNum">    1295 </span>                :        *  as the input.
-<span class="lineNum">    1296 </span>                :        *
-<span class="lineNum">    1297 </span>                :        *  do_is() is a hook for a derived facet to change the behavior of
-<span class="lineNum">    1298 </span>                :        *  classifying.  do_is() must always return the same result for the
-<span class="lineNum">    1299 </span>                :        *  same input.
-<span class="lineNum">    1300 </span>                :        *
-<span class="lineNum">    1301 </span>                :        *  @param lo  Pointer to start of range.
-<span class="lineNum">    1302 </span>                :        *  @param hi  Pointer to end of range.
-<span class="lineNum">    1303 </span>                :        *  @param vec  Pointer to an array of mask storage.
-<span class="lineNum">    1304 </span>                :        *  @return  @a hi.
-<span class="lineNum">    1305 </span>                :       */
-<span class="lineNum">    1306 </span>                :       virtual const char_type*
-<span class="lineNum">    1307 </span>                :       do_is(const char_type* __lo, const char_type* __hi, mask* __vec) const;
-<span class="lineNum">    1308 </span>                : 
-<span class="lineNum">    1309 </span>                :       /**
-<span class="lineNum">    1310 </span>                :        *  @brief  Find wchar_t matching mask
-<span class="lineNum">    1311 </span>                :        *
-<span class="lineNum">    1312 </span>                :        *  This function searches for and returns the first wchar_t c in
-<span class="lineNum">    1313 </span>                :        *  [lo,hi) for which is(m,c) is true.
-<span class="lineNum">    1314 </span>                :        *
-<span class="lineNum">    1315 </span>                :        *  do_scan_is() is a hook for a derived facet to change the behavior of
-<span class="lineNum">    1316 </span>                :        *  match searching.  do_is() must always return the same result for the
-<span class="lineNum">    1317 </span>                :        *  same input.
-<span class="lineNum">    1318 </span>                :        *
-<span class="lineNum">    1319 </span>                :        *  @param m  The mask to compare against.
-<span class="lineNum">    1320 </span>                :        *  @param lo  Pointer to start of range.
-<span class="lineNum">    1321 </span>                :        *  @param hi  Pointer to end of range.
-<span class="lineNum">    1322 </span>                :        *  @return  Pointer to a matching wchar_t if found, else @a hi.
-<span class="lineNum">    1323 </span>                :       */
-<span class="lineNum">    1324 </span>                :       virtual const char_type*
-<span class="lineNum">    1325 </span>                :       do_scan_is(mask __m, const char_type* __lo, const char_type* __hi) const;
-<span class="lineNum">    1326 </span>                : 
-<span class="lineNum">    1327 </span>                :       /**
-<span class="lineNum">    1328 </span>                :        *  @brief  Find wchar_t not matching mask
-<span class="lineNum">    1329 </span>                :        *
-<span class="lineNum">    1330 </span>                :        *  This function searches for and returns a pointer to the first
-<span class="lineNum">    1331 </span>                :        *  wchar_t c of [lo,hi) for which is(m,c) is false.
-<span class="lineNum">    1332 </span>                :        *
-<span class="lineNum">    1333 </span>                :        *  do_scan_is() is a hook for a derived facet to change the behavior of
-<span class="lineNum">    1334 </span>                :        *  match searching.  do_is() must always return the same result for the
-<span class="lineNum">    1335 </span>                :        *  same input.
-<span class="lineNum">    1336 </span>                :        *
-<span class="lineNum">    1337 </span>                :        *  @param m  The mask to compare against.
-<span class="lineNum">    1338 </span>                :        *  @param lo  Pointer to start of range.
-<span class="lineNum">    1339 </span>                :        *  @param hi  Pointer to end of range.
-<span class="lineNum">    1340 </span>                :        *  @return  Pointer to a non-matching wchar_t if found, else @a hi.
-<span class="lineNum">    1341 </span>                :       */
-<span class="lineNum">    1342 </span>                :       virtual const char_type*
-<span class="lineNum">    1343 </span>                :       do_scan_not(mask __m, const char_type* __lo,
-<span class="lineNum">    1344 </span>                :                   const char_type* __hi) const;
-<span class="lineNum">    1345 </span>                : 
-<span class="lineNum">    1346 </span>                :       /**
-<span class="lineNum">    1347 </span>                :        *  @brief  Convert to uppercase.
-<span class="lineNum">    1348 </span>                :        *
-<span class="lineNum">    1349 </span>                :        *  This virtual function converts the wchar_t argument to uppercase if
-<span class="lineNum">    1350 </span>                :        *  possible.  If not possible (for example, '2'), returns the argument.
-<span class="lineNum">    1351 </span>                :        *
-<span class="lineNum">    1352 </span>                :        *  do_toupper() is a hook for a derived facet to change the behavior of
-<span class="lineNum">    1353 </span>                :        *  uppercasing.  do_toupper() must always return the same result for
-<span class="lineNum">    1354 </span>                :        *  the same input.
-<span class="lineNum">    1355 </span>                :        *
-<span class="lineNum">    1356 </span>                :        *  @param c  The wchar_t to convert.
-<span class="lineNum">    1357 </span>                :        *  @return  The uppercase wchar_t if convertible, else @a c.
-<span class="lineNum">    1358 </span>                :       */
-<span class="lineNum">    1359 </span>                :       virtual char_type
-<span class="lineNum">    1360 </span>                :       do_toupper(char_type) const;
-<span class="lineNum">    1361 </span>                : 
-<span class="lineNum">    1362 </span>                :       /**
-<span class="lineNum">    1363 </span>                :        *  @brief  Convert array to uppercase.
-<span class="lineNum">    1364 </span>                :        *
-<span class="lineNum">    1365 </span>                :        *  This virtual function converts each wchar_t in the range [lo,hi) to
-<span class="lineNum">    1366 </span>                :        *  uppercase if possible.  Other elements remain untouched.
-<span class="lineNum">    1367 </span>                :        *
-<span class="lineNum">    1368 </span>                :        *  do_toupper() is a hook for a derived facet to change the behavior of
-<span class="lineNum">    1369 </span>                :        *  uppercasing.  do_toupper() must always return the same result for
-<span class="lineNum">    1370 </span>                :        *  the same input.
-<span class="lineNum">    1371 </span>                :        *
-<span class="lineNum">    1372 </span>                :        *  @param lo  Pointer to start of range.
-<span class="lineNum">    1373 </span>                :        *  @param hi  Pointer to end of range.
-<span class="lineNum">    1374 </span>                :        *  @return  @a hi.
-<span class="lineNum">    1375 </span>                :       */
-<span class="lineNum">    1376 </span>                :       virtual const char_type*
-<span class="lineNum">    1377 </span>                :       do_toupper(char_type* __lo, const char_type* __hi) const;
-<span class="lineNum">    1378 </span>                : 
-<span class="lineNum">    1379 </span>                :       /**
-<span class="lineNum">    1380 </span>                :        *  @brief  Convert to lowercase.
-<span class="lineNum">    1381 </span>                :        *
-<span class="lineNum">    1382 </span>                :        *  This virtual function converts the argument to lowercase if
-<span class="lineNum">    1383 </span>                :        *  possible.  If not possible (for example, '2'), returns the argument.
-<span class="lineNum">    1384 </span>                :        *
-<span class="lineNum">    1385 </span>                :        *  do_tolower() is a hook for a derived facet to change the behavior of
-<span class="lineNum">    1386 </span>                :        *  lowercasing.  do_tolower() must always return the same result for
-<span class="lineNum">    1387 </span>                :        *  the same input.
-<span class="lineNum">    1388 </span>                :        *
-<span class="lineNum">    1389 </span>                :        *  @param c  The wchar_t to convert.
-<span class="lineNum">    1390 </span>                :        *  @return  The lowercase wchar_t if convertible, else @a c.
-<span class="lineNum">    1391 </span>                :       */
-<span class="lineNum">    1392 </span>                :       virtual char_type
-<span class="lineNum">    1393 </span>                :       do_tolower(char_type) const;
-<span class="lineNum">    1394 </span>                : 
-<span class="lineNum">    1395 </span>                :       /**
-<span class="lineNum">    1396 </span>                :        *  @brief  Convert array to lowercase.
-<span class="lineNum">    1397 </span>                :        *
-<span class="lineNum">    1398 </span>                :        *  This virtual function converts each wchar_t in the range [lo,hi) to
-<span class="lineNum">    1399 </span>                :        *  lowercase if possible.  Other elements remain untouched.
-<span class="lineNum">    1400 </span>                :        *
-<span class="lineNum">    1401 </span>                :        *  do_tolower() is a hook for a derived facet to change the behavior of
-<span class="lineNum">    1402 </span>                :        *  lowercasing.  do_tolower() must always return the same result for
-<span class="lineNum">    1403 </span>                :        *  the same input.
-<span class="lineNum">    1404 </span>                :        *
-<span class="lineNum">    1405 </span>                :        *  @param lo  Pointer to start of range.
-<span class="lineNum">    1406 </span>                :        *  @param hi  Pointer to end of range.
-<span class="lineNum">    1407 </span>                :        *  @return  @a hi.
-<span class="lineNum">    1408 </span>                :       */
-<span class="lineNum">    1409 </span>                :       virtual const char_type*
-<span class="lineNum">    1410 </span>                :       do_tolower(char_type* __lo, const char_type* __hi) const;
-<span class="lineNum">    1411 </span>                : 
-<span class="lineNum">    1412 </span>                :       /**
-<span class="lineNum">    1413 </span>                :        *  @brief  Widen char to wchar_t
-<span class="lineNum">    1414 </span>                :        *
-<span class="lineNum">    1415 </span>                :        *  This virtual function converts the char to wchar_t using the
-<span class="lineNum">    1416 </span>                :        *  simplest reasonable transformation.  For an underived ctype&lt;wchar_t&gt;
-<span class="lineNum">    1417 </span>                :        *  facet, the argument will be cast to wchar_t.
-<span class="lineNum">    1418 </span>                :        *
-<span class="lineNum">    1419 </span>                :        *  do_widen() is a hook for a derived facet to change the behavior of
-<span class="lineNum">    1420 </span>                :        *  widening.  do_widen() must always return the same result for the
-<span class="lineNum">    1421 </span>                :        *  same input.
-<span class="lineNum">    1422 </span>                :        *
-<span class="lineNum">    1423 </span>                :        *  Note: this is not what you want for codepage conversions.  See
-<span class="lineNum">    1424 </span>                :        *  codecvt for that.
-<span class="lineNum">    1425 </span>                :        *
-<span class="lineNum">    1426 </span>                :        *  @param c  The char to convert.
-<span class="lineNum">    1427 </span>                :        *  @return  The converted wchar_t.
-<span class="lineNum">    1428 </span>                :       */
-<span class="lineNum">    1429 </span>                :       virtual char_type
-<span class="lineNum">    1430 </span>                :       do_widen(char) const;
-<span class="lineNum">    1431 </span>                : 
-<span class="lineNum">    1432 </span>                :       /**
-<span class="lineNum">    1433 </span>                :        *  @brief  Widen char array to wchar_t array
-<span class="lineNum">    1434 </span>                :        *
-<span class="lineNum">    1435 </span>                :        *  This function converts each char in the input to wchar_t using the
-<span class="lineNum">    1436 </span>                :        *  simplest reasonable transformation.  For an underived ctype&lt;wchar_t&gt;
-<span class="lineNum">    1437 </span>                :        *  facet, the argument will be copied, casting each element to wchar_t.
-<span class="lineNum">    1438 </span>                :        *
-<span class="lineNum">    1439 </span>                :        *  do_widen() is a hook for a derived facet to change the behavior of
-<span class="lineNum">    1440 </span>                :        *  widening.  do_widen() must always return the same result for the
-<span class="lineNum">    1441 </span>                :        *  same input.
-<span class="lineNum">    1442 </span>                :        *
-<span class="lineNum">    1443 </span>                :        *  Note: this is not what you want for codepage conversions.  See
-<span class="lineNum">    1444 </span>                :        *  codecvt for that.
-<span class="lineNum">    1445 </span>                :        *
-<span class="lineNum">    1446 </span>                :        *  @param lo  Pointer to start range.
-<span class="lineNum">    1447 </span>                :        *  @param hi  Pointer to end of range.
-<span class="lineNum">    1448 </span>                :        *  @param to  Pointer to the destination array.
-<span class="lineNum">    1449 </span>                :        *  @return  @a hi.
-<span class="lineNum">    1450 </span>                :       */
-<span class="lineNum">    1451 </span>                :       virtual const char*
-<span class="lineNum">    1452 </span>                :       do_widen(const char* __lo, const char* __hi, char_type* __dest) const;
-<span class="lineNum">    1453 </span>                : 
-<span class="lineNum">    1454 </span>                :       /**
-<span class="lineNum">    1455 </span>                :        *  @brief  Narrow wchar_t to char
-<span class="lineNum">    1456 </span>                :        *
-<span class="lineNum">    1457 </span>                :        *  This virtual function converts the argument to char using
-<span class="lineNum">    1458 </span>                :        *  the simplest reasonable transformation.  If the conversion
-<span class="lineNum">    1459 </span>                :        *  fails, dfault is returned instead.  For an underived
-<span class="lineNum">    1460 </span>                :        *  ctype&lt;wchar_t&gt; facet, @a c will be cast to char and
-<span class="lineNum">    1461 </span>                :        *  returned.
-<span class="lineNum">    1462 </span>                :        *
-<span class="lineNum">    1463 </span>                :        *  do_narrow() is a hook for a derived facet to change the
-<span class="lineNum">    1464 </span>                :        *  behavior of narrowing.  do_narrow() must always return the
-<span class="lineNum">    1465 </span>                :        *  same result for the same input.
-<span class="lineNum">    1466 </span>                :        *
-<span class="lineNum">    1467 </span>                :        *  Note: this is not what you want for codepage conversions.  See
-<span class="lineNum">    1468 </span>                :        *  codecvt for that.
-<span class="lineNum">    1469 </span>                :        *
-<span class="lineNum">    1470 </span>                :        *  @param c  The wchar_t to convert.
-<span class="lineNum">    1471 </span>                :        *  @param dfault  Char to return if conversion fails.
-<span class="lineNum">    1472 </span>                :        *  @return  The converted char.
-<span class="lineNum">    1473 </span>                :       */
-<span class="lineNum">    1474 </span>                :       virtual char
-<span class="lineNum">    1475 </span>                :       do_narrow(char_type, char __dfault) const;
-<span class="lineNum">    1476 </span>                : 
-<span class="lineNum">    1477 </span>                :       /**
-<span class="lineNum">    1478 </span>                :        *  @brief  Narrow wchar_t array to char array
-<span class="lineNum">    1479 </span>                :        *
-<span class="lineNum">    1480 </span>                :        *  This virtual function converts each wchar_t in the range [lo,hi) to
-<span class="lineNum">    1481 </span>                :        *  char using the simplest reasonable transformation and writes the
-<span class="lineNum">    1482 </span>                :        *  results to the destination array.  For any wchar_t in the input that
-<span class="lineNum">    1483 </span>                :        *  cannot be converted, @a dfault is used instead.  For an underived
-<span class="lineNum">    1484 </span>                :        *  ctype&lt;wchar_t&gt; facet, the argument will be copied, casting each
-<span class="lineNum">    1485 </span>                :        *  element to char.
-<span class="lineNum">    1486 </span>                :        *
-<span class="lineNum">    1487 </span>                :        *  do_narrow() is a hook for a derived facet to change the behavior of
-<span class="lineNum">    1488 </span>                :        *  narrowing.  do_narrow() must always return the same result for the
-<span class="lineNum">    1489 </span>                :        *  same input.
-<span class="lineNum">    1490 </span>                :        *
-<span class="lineNum">    1491 </span>                :        *  Note: this is not what you want for codepage conversions.  See
-<span class="lineNum">    1492 </span>                :        *  codecvt for that.
-<span class="lineNum">    1493 </span>                :        *
-<span class="lineNum">    1494 </span>                :        *  @param lo  Pointer to start of range.
-<span class="lineNum">    1495 </span>                :        *  @param hi  Pointer to end of range.
-<span class="lineNum">    1496 </span>                :        *  @param dfault  Char to use if conversion fails.
-<span class="lineNum">    1497 </span>                :        *  @param to  Pointer to the destination array.
-<span class="lineNum">    1498 </span>                :        *  @return  @a hi.
-<span class="lineNum">    1499 </span>                :       */
-<span class="lineNum">    1500 </span>                :       virtual const char_type*
-<span class="lineNum">    1501 </span>                :       do_narrow(const char_type* __lo, const char_type* __hi,
-<span class="lineNum">    1502 </span>                :                 char __dfault, char* __dest) const;
-<span class="lineNum">    1503 </span>                : 
-<span class="lineNum">    1504 </span>                :       // For use at construction time only.
-<span class="lineNum">    1505 </span>                :       void
-<span class="lineNum">    1506 </span>                :       _M_initialize_ctype();
-<span class="lineNum">    1507 </span>                :     };
-<span class="lineNum">    1508 </span>                : 
-<span class="lineNum">    1509 </span>                :   template&lt;&gt;
-<span class="lineNum">    1510 </span>                :     const ctype&lt;wchar_t&gt;&amp;
-<span class="lineNum">    1511 </span>                :     use_facet&lt;ctype&lt;wchar_t&gt; &gt;(const locale&amp; __loc);
-<span class="lineNum">    1512 </span>                : #endif //_GLIBCXX_USE_WCHAR_T
-<span class="lineNum">    1513 </span>                : 
-<span class="lineNum">    1514 </span>                :   /// class ctype_byname [22.2.1.2].
-<span class="lineNum">    1515 </span>                :   template&lt;typename _CharT&gt;
-<span class="lineNum">    1516 </span>                :     class ctype_byname : public ctype&lt;_CharT&gt;
-<span class="lineNum">    1517 </span>                :     {
-<span class="lineNum">    1518 </span>                :     public:
-<span class="lineNum">    1519 </span>                :       typedef typename ctype&lt;_CharT&gt;::mask  mask;
-<span class="lineNum">    1520 </span>                : 
-<span class="lineNum">    1521 </span>                :       explicit
-<span class="lineNum">    1522 </span>                :       ctype_byname(const char* __s, size_t __refs = 0);
-<span class="lineNum">    1523 </span>                : 
-<span class="lineNum">    1524 </span>                :     protected:
-<span class="lineNum">    1525 </span>                :       virtual
-<span class="lineNum">    1526 </span>                :       ~ctype_byname() { };
-<span class="lineNum">    1527 </span>                :     };
-<span class="lineNum">    1528 </span>                : 
-<span class="lineNum">    1529 </span>                :   /// 22.2.1.4  Class ctype_byname specializations.
-<span class="lineNum">    1530 </span>                :   template&lt;&gt;
-<span class="lineNum">    1531 </span>                :     class ctype_byname&lt;char&gt; : public ctype&lt;char&gt;
-<span class="lineNum">    1532 </span>                :     {
-<span class="lineNum">    1533 </span>                :     public:
-<span class="lineNum">    1534 </span>                :       explicit
-<span class="lineNum">    1535 </span>                :       ctype_byname(const char* __s, size_t __refs = 0);
-<span class="lineNum">    1536 </span>                : 
-<span class="lineNum">    1537 </span>                :     protected:
-<span class="lineNum">    1538 </span>                :       virtual
-<span class="lineNum">    1539 </span>                :       ~ctype_byname();
-<span class="lineNum">    1540 </span>                :     };
-<span class="lineNum">    1541 </span>                : 
-<span class="lineNum">    1542 </span>                : #ifdef _GLIBCXX_USE_WCHAR_T
-<span class="lineNum">    1543 </span>                :   template&lt;&gt;
-<span class="lineNum">    1544 </span>                :     class ctype_byname&lt;wchar_t&gt; : public ctype&lt;wchar_t&gt;
-<span class="lineNum">    1545 </span>                :     {
-<span class="lineNum">    1546 </span>                :     public:
-<span class="lineNum">    1547 </span>                :       explicit
-<span class="lineNum">    1548 </span>                :       ctype_byname(const char* __s, size_t __refs = 0);
-<span class="lineNum">    1549 </span>                : 
-<span class="lineNum">    1550 </span>                :     protected:
-<span class="lineNum">    1551 </span>                :       virtual
-<span class="lineNum">    1552 </span>                :       ~ctype_byname();
-<span class="lineNum">    1553 </span>                :     };
-<span class="lineNum">    1554 </span>                : #endif
-<span class="lineNum">    1555 </span>                : 
-<span class="lineNum">    1556 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">    1557 </span>                : 
-<span class="lineNum">    1558 </span>                : // Include host and configuration specific ctype inlines.
-<span class="lineNum">    1559 </span>                : #include &lt;bits/ctype_inline.h&gt;
-<span class="lineNum">    1560 </span>                : 
-<span class="lineNum">    1561 </span>                : _GLIBCXX_BEGIN_NAMESPACE(std)
-<span class="lineNum">    1562 </span>                : 
-<span class="lineNum">    1563 </span>                :   // 22.2.2  The numeric category.
-<span class="lineNum">    1564 </span>                :   class __num_base
-<span class="lineNum">    1565 </span>                :   {
-<span class="lineNum">    1566 </span>                :   public:
-<span class="lineNum">    1567 </span>                :     // NB: Code depends on the order of _S_atoms_out elements.
-<span class="lineNum">    1568 </span>                :     // Below are the indices into _S_atoms_out.
-<span class="lineNum">    1569 </span>                :     enum
-<span class="lineNum">    1570 </span>                :       {
-<span class="lineNum">    1571 </span>                :         _S_ominus,
-<span class="lineNum">    1572 </span>                :         _S_oplus,
-<span class="lineNum">    1573 </span>                :         _S_ox,
-<span class="lineNum">    1574 </span>                :         _S_oX,
-<span class="lineNum">    1575 </span>                :         _S_odigits,
-<span class="lineNum">    1576 </span>                :         _S_odigits_end = _S_odigits + 16,
-<span class="lineNum">    1577 </span>                :         _S_oudigits = _S_odigits_end,
-<span class="lineNum">    1578 </span>                :         _S_oudigits_end = _S_oudigits + 16,
-<span class="lineNum">    1579 </span>                :         _S_oe = _S_odigits + 14,  // For scientific notation, 'e'
-<span class="lineNum">    1580 </span>                :         _S_oE = _S_oudigits + 14, // For scientific notation, 'E'
-<span class="lineNum">    1581 </span>                :         _S_oend = _S_oudigits_end
-<span class="lineNum">    1582 </span>                :       };
-<span class="lineNum">    1583 </span>                : 
-<span class="lineNum">    1584 </span>                :     // A list of valid numeric literals for output.  This array
-<span class="lineNum">    1585 </span>                :     // contains chars that will be passed through the current locale's
-<span class="lineNum">    1586 </span>                :     // ctype&lt;_CharT&gt;.widen() and then used to render numbers.
-<span class="lineNum">    1587 </span>                :     // For the standard &quot;C&quot; locale, this is
-<span class="lineNum">    1588 </span>                :     // &quot;-+xX0123456789abcdef0123456789ABCDEF&quot;.
-<span class="lineNum">    1589 </span>                :     static const char* _S_atoms_out;
-<span class="lineNum">    1590 </span>                : 
-<span class="lineNum">    1591 </span>                :     // String literal of acceptable (narrow) input, for num_get.
-<span class="lineNum">    1592 </span>                :     // &quot;-+xX0123456789abcdefABCDEF&quot;
-<span class="lineNum">    1593 </span>                :     static const char* _S_atoms_in;
-<span class="lineNum">    1594 </span>                : 
-<span class="lineNum">    1595 </span>                :     enum
-<span class="lineNum">    1596 </span>                :     {
-<span class="lineNum">    1597 </span>                :       _S_iminus,
-<span class="lineNum">    1598 </span>                :       _S_iplus,
-<span class="lineNum">    1599 </span>                :       _S_ix,
-<span class="lineNum">    1600 </span>                :       _S_iX,
-<span class="lineNum">    1601 </span>                :       _S_izero,
-<span class="lineNum">    1602 </span>                :       _S_ie = _S_izero + 14,
-<span class="lineNum">    1603 </span>                :       _S_iE = _S_izero + 20,
-<span class="lineNum">    1604 </span>                :       _S_iend = 26
-<span class="lineNum">    1605 </span>                :     };
-<span class="lineNum">    1606 </span>                : 
-<span class="lineNum">    1607 </span>                :     // num_put
-<span class="lineNum">    1608 </span>                :     // Construct and return valid scanf format for floating point types.
-<span class="lineNum">    1609 </span>                :     static void
-<span class="lineNum">    1610 </span>                :     _S_format_float(const ios_base&amp; __io, char* __fptr, char __mod);
-<span class="lineNum">    1611 </span>                :   };
-<span class="lineNum">    1612 </span>                : 
-<span class="lineNum">    1613 </span>                :   template&lt;typename _CharT&gt;
-<span class="lineNum">    1614 </span>                :     struct __numpunct_cache : public locale::facet
-<span class="lineNum">    1615 </span>                :     {
-<span class="lineNum">    1616 </span>                :       const char*                       _M_grouping;
-<span class="lineNum">    1617 </span>                :       size_t                            _M_grouping_size;
-<span class="lineNum">    1618 </span>                :       bool                              _M_use_grouping;
-<span class="lineNum">    1619 </span>                :       const _CharT*                     _M_truename;
-<span class="lineNum">    1620 </span>                :       size_t                            _M_truename_size;
-<span class="lineNum">    1621 </span>                :       const _CharT*                     _M_falsename;
-<span class="lineNum">    1622 </span>                :       size_t                            _M_falsename_size;
-<span class="lineNum">    1623 </span>                :       _CharT                            _M_decimal_point;
-<span class="lineNum">    1624 </span>                :       _CharT                            _M_thousands_sep;
-<span class="lineNum">    1625 </span>                : 
-<span class="lineNum">    1626 </span>                :       // A list of valid numeric literals for output: in the standard
-<span class="lineNum">    1627 </span>                :       // &quot;C&quot; locale, this is &quot;-+xX0123456789abcdef0123456789ABCDEF&quot;.
-<span class="lineNum">    1628 </span>                :       // This array contains the chars after having been passed
-<span class="lineNum">    1629 </span>                :       // through the current locale's ctype&lt;_CharT&gt;.widen().
-<span class="lineNum">    1630 </span>                :       _CharT                            _M_atoms_out[__num_base::_S_oend];
-<span class="lineNum">    1631 </span>                : 
-<span class="lineNum">    1632 </span>                :       // A list of valid numeric literals for input: in the standard
-<span class="lineNum">    1633 </span>                :       // &quot;C&quot; locale, this is &quot;-+xX0123456789abcdefABCDEF&quot;
-<span class="lineNum">    1634 </span>                :       // This array contains the chars after having been passed
-<span class="lineNum">    1635 </span>                :       // through the current locale's ctype&lt;_CharT&gt;.widen().
-<span class="lineNum">    1636 </span>                :       _CharT                            _M_atoms_in[__num_base::_S_iend];
-<span class="lineNum">    1637 </span>                : 
-<span class="lineNum">    1638 </span>                :       bool                              _M_allocated;
-<span class="lineNum">    1639 </span>                : 
-<span class="lineNum">    1640 </span>                :       __numpunct_cache(size_t __refs = 0) : facet(__refs),
-<span class="lineNum">    1641 </span>                :       _M_grouping(NULL), _M_grouping_size(0), _M_use_grouping(false),
-<span class="lineNum">    1642 </span>                :       _M_truename(NULL), _M_truename_size(0), _M_falsename(NULL),
-<span class="lineNum">    1643 </span>                :       _M_falsename_size(0), _M_decimal_point(_CharT()),
-<span class="lineNum">    1644 </span>                :       _M_thousands_sep(_CharT()), _M_allocated(false)
-<span class="lineNum">    1645 </span>                :       { }
-<span class="lineNum">    1646 </span>                : 
-<span class="lineNum">    1647 </span>                :       ~__numpunct_cache();
-<span class="lineNum">    1648 </span>                : 
-<span class="lineNum">    1649 </span>                :       void
-<span class="lineNum">    1650 </span>                :       _M_cache(const locale&amp; __loc);
-<span class="lineNum">    1651 </span>                : 
-<span class="lineNum">    1652 </span>                :     private:
-<span class="lineNum">    1653 </span>                :       __numpunct_cache&amp;
-<span class="lineNum">    1654 </span>                :       operator=(const __numpunct_cache&amp;);
-<span class="lineNum">    1655 </span>                :       
-<span class="lineNum">    1656 </span>                :       explicit
-<span class="lineNum">    1657 </span>                :       __numpunct_cache(const __numpunct_cache&amp;);
-<span class="lineNum">    1658 </span>                :     };
-<span class="lineNum">    1659 </span>                : 
-<span class="lineNum">    1660 </span>                :   template&lt;typename _CharT&gt;
-<span class="lineNum">    1661 </span>                :     __numpunct_cache&lt;_CharT&gt;::~__numpunct_cache()
-<span class="lineNum">    1662 </span>                :     {
-<span class="lineNum">    1663 </span>                :       if (_M_allocated)
-<span class="lineNum">    1664 </span>                :         {
-<span class="lineNum">    1665 </span>                :           delete [] _M_grouping;
-<span class="lineNum">    1666 </span>                :           delete [] _M_truename;
-<span class="lineNum">    1667 </span>                :           delete [] _M_falsename;
-<span class="lineNum">    1668 </span>                :         }
-<span class="lineNum">    1669 </span>                :     }
-<span class="lineNum">    1670 </span>                : 
-<span class="lineNum">    1671 </span>                :   /**
-<span class="lineNum">    1672 </span>                :    *  @brief  Numpunct facet.
-<span class="lineNum">    1673 </span>                :    *
-<span class="lineNum">    1674 </span>                :    *  This facet stores several pieces of information related to printing and
-<span class="lineNum">    1675 </span>                :    *  scanning numbers, such as the decimal point character.  It takes a
-<span class="lineNum">    1676 </span>                :    *  template parameter specifying the char type.  The numpunct facet is
-<span class="lineNum">    1677 </span>                :    *  used by streams for many I/O operations involving numbers.
-<span class="lineNum">    1678 </span>                :    *
-<span class="lineNum">    1679 </span>                :    *  The numpunct template uses protected virtual functions to provide the
-<span class="lineNum">    1680 </span>                :    *  actual results.  The public accessors forward the call to the virtual
-<span class="lineNum">    1681 </span>                :    *  functions.  These virtual functions are hooks for developers to
-<span class="lineNum">    1682 </span>                :    *  implement the behavior they require from a numpunct facet.
-<span class="lineNum">    1683 </span>                :   */
-<span class="lineNum">    1684 </span>                :   template&lt;typename _CharT&gt;
-<span class="lineNum">    1685 </span>                :     class numpunct : public locale::facet
-<span class="lineNum">    1686 </span>                :     {
-<span class="lineNum">    1687 </span>                :     public:
-<span class="lineNum">    1688 </span>                :       // Types:
-<span class="lineNum">    1689 </span>                :       //@{
-<span class="lineNum">    1690 </span>                :       /// Public typedefs
-<span class="lineNum">    1691 </span>                :       typedef _CharT                    char_type;
-<span class="lineNum">    1692 </span>                :       typedef basic_string&lt;_CharT&gt;        string_type;
-<span class="lineNum">    1693 </span>                :       //@}
-<span class="lineNum">    1694 </span>                :       typedef __numpunct_cache&lt;_CharT&gt;  __cache_type;
-<span class="lineNum">    1695 </span>                : 
-<span class="lineNum">    1696 </span>                :     protected:
-<span class="lineNum">    1697 </span>                :       __cache_type*                     _M_data;
-<span class="lineNum">    1698 </span>                : 
-<span class="lineNum">    1699 </span>                :     public:
-<span class="lineNum">    1700 </span>                :       /// Numpunct facet id.
-<span class="lineNum">    1701 </span>                :       static locale::id                 id;
-<span class="lineNum">    1702 </span>                : 
-<span class="lineNum">    1703 </span>                :       /**
-<span class="lineNum">    1704 </span>                :        *  @brief  Numpunct constructor.
-<span class="lineNum">    1705 </span>                :        *
-<span class="lineNum">    1706 </span>                :        *  @param  refs  Refcount to pass to the base class.
-<span class="lineNum">    1707 </span>                :        */
-<span class="lineNum">    1708 </span>                :       explicit
-<span class="lineNum">    1709 </span>                :       numpunct(size_t __refs = 0) : facet(__refs), _M_data(NULL)
-<span class="lineNum">    1710 </span>                :       { _M_initialize_numpunct(); }
-<span class="lineNum">    1711 </span>                : 
-<span class="lineNum">    1712 </span>                :       /**
-<span class="lineNum">    1713 </span>                :        *  @brief  Internal constructor.  Not for general use.
-<span class="lineNum">    1714 </span>                :        *
-<span class="lineNum">    1715 </span>                :        *  This is a constructor for use by the library itself to set up the
-<span class="lineNum">    1716 </span>                :        *  predefined locale facets.
-<span class="lineNum">    1717 </span>                :        *
-<span class="lineNum">    1718 </span>                :        *  @param  cache  __numpunct_cache object.
-<span class="lineNum">    1719 </span>                :        *  @param  refs  Refcount to pass to the base class.
-<span class="lineNum">    1720 </span>                :        */
-<span class="lineNum">    1721 </span>                :       explicit
-<span class="lineNum">    1722 </span>                :       numpunct(__cache_type* __cache, size_t __refs = 0)
-<span class="lineNum">    1723 </span>                :       : facet(__refs), _M_data(__cache)
-<span class="lineNum">    1724 </span>                :       { _M_initialize_numpunct(); }
-<span class="lineNum">    1725 </span>                : 
-<span class="lineNum">    1726 </span>                :       /**
-<span class="lineNum">    1727 </span>                :        *  @brief  Internal constructor.  Not for general use.
-<span class="lineNum">    1728 </span>                :        *
-<span class="lineNum">    1729 </span>                :        *  This is a constructor for use by the library itself to set up new
-<span class="lineNum">    1730 </span>                :        *  locales.
-<span class="lineNum">    1731 </span>                :        *
-<span class="lineNum">    1732 </span>                :        *  @param  cloc  The &quot;C&quot; locale.
-<span class="lineNum">    1733 </span>                :        *  @param  refs  Refcount to pass to the base class.
-<span class="lineNum">    1734 </span>                :        */
-<span class="lineNum">    1735 </span>                :       explicit
-<span class="lineNum">    1736 </span>                :       numpunct(__c_locale __cloc, size_t __refs = 0)
-<span class="lineNum">    1737 </span>                :       : facet(__refs), _M_data(NULL)
-<span class="lineNum">    1738 </span>                :       { _M_initialize_numpunct(__cloc); }
-<span class="lineNum">    1739 </span>                : 
-<span class="lineNum">    1740 </span>                :       /**
-<span class="lineNum">    1741 </span>                :        *  @brief  Return decimal point character.
-<span class="lineNum">    1742 </span>                :        *
-<span class="lineNum">    1743 </span>                :        *  This function returns a char_type to use as a decimal point.  It
-<span class="lineNum">    1744 </span>                :        *  does so by returning returning
-<span class="lineNum">    1745 </span>                :        *  numpunct&lt;char_type&gt;::do_decimal_point().
-<span class="lineNum">    1746 </span>                :        *
-<span class="lineNum">    1747 </span>                :        *  @return  @a char_type representing a decimal point.
-<span class="lineNum">    1748 </span>                :       */
-<span class="lineNum">    1749 </span>                :       char_type
-<span class="lineNum">    1750 </span>                :       decimal_point() const
-<span class="lineNum">    1751 </span>                :       { return this-&gt;do_decimal_point(); }
-<span class="lineNum">    1752 </span>                : 
-<span class="lineNum">    1753 </span>                :       /**
-<span class="lineNum">    1754 </span>                :        *  @brief  Return thousands separator character.
-<span class="lineNum">    1755 </span>                :        *
-<span class="lineNum">    1756 </span>                :        *  This function returns a char_type to use as a thousands
-<span class="lineNum">    1757 </span>                :        *  separator.  It does so by returning returning
-<span class="lineNum">    1758 </span>                :        *  numpunct&lt;char_type&gt;::do_thousands_sep().
-<span class="lineNum">    1759 </span>                :        *
-<span class="lineNum">    1760 </span>                :        *  @return  char_type representing a thousands separator.
-<span class="lineNum">    1761 </span>                :       */
-<span class="lineNum">    1762 </span>                :       char_type
-<span class="lineNum">    1763 </span>                :       thousands_sep() const
-<span class="lineNum">    1764 </span>                :       { return this-&gt;do_thousands_sep(); }
-<span class="lineNum">    1765 </span>                : 
-<span class="lineNum">    1766 </span>                :       /**
-<span class="lineNum">    1767 </span>                :        *  @brief  Return grouping specification.
-<span class="lineNum">    1768 </span>                :        *
-<span class="lineNum">    1769 </span>                :        *  This function returns a string representing groupings for the
-<span class="lineNum">    1770 </span>                :        *  integer part of a number.  Groupings indicate where thousands
-<span class="lineNum">    1771 </span>                :        *  separators should be inserted in the integer part of a number.
-<span class="lineNum">    1772 </span>                :        *
-<span class="lineNum">    1773 </span>                :        *  Each char in the return string is interpret as an integer
-<span class="lineNum">    1774 </span>                :        *  rather than a character.  These numbers represent the number
-<span class="lineNum">    1775 </span>                :        *  of digits in a group.  The first char in the string
-<span class="lineNum">    1776 </span>                :        *  represents the number of digits in the least significant
-<span class="lineNum">    1777 </span>                :        *  group.  If a char is negative, it indicates an unlimited
-<span class="lineNum">    1778 </span>                :        *  number of digits for the group.  If more chars from the
-<span class="lineNum">    1779 </span>                :        *  string are required to group a number, the last char is used
-<span class="lineNum">    1780 </span>                :        *  repeatedly.
-<span class="lineNum">    1781 </span>                :        *
-<span class="lineNum">    1782 </span>                :        *  For example, if the grouping() returns &quot;\003\002&quot; and is
-<span class="lineNum">    1783 </span>                :        *  applied to the number 123456789, this corresponds to
-<span class="lineNum">    1784 </span>                :        *  12,34,56,789.  Note that if the string was &quot;32&quot;, this would
-<span class="lineNum">    1785 </span>                :        *  put more than 50 digits into the least significant group if
-<span class="lineNum">    1786 </span>                :        *  the character set is ASCII.
-<span class="lineNum">    1787 </span>                :        *
-<span class="lineNum">    1788 </span>                :        *  The string is returned by calling
-<span class="lineNum">    1789 </span>                :        *  numpunct&lt;char_type&gt;::do_grouping().
-<span class="lineNum">    1790 </span>                :        *
-<span class="lineNum">    1791 </span>                :        *  @return  string representing grouping specification.
-<span class="lineNum">    1792 </span>                :       */
-<span class="lineNum">    1793 </span>                :       string
-<span class="lineNum">    1794 </span>                :       grouping() const
-<span class="lineNum">    1795 </span>                :       { return this-&gt;do_grouping(); }
-<span class="lineNum">    1796 </span>                : 
-<span class="lineNum">    1797 </span>                :       /**
-<span class="lineNum">    1798 </span>                :        *  @brief  Return string representation of bool true.
-<span class="lineNum">    1799 </span>                :        *
-<span class="lineNum">    1800 </span>                :        *  This function returns a string_type containing the text
-<span class="lineNum">    1801 </span>                :        *  representation for true bool variables.  It does so by calling
-<span class="lineNum">    1802 </span>                :        *  numpunct&lt;char_type&gt;::do_truename().
-<span class="lineNum">    1803 </span>                :        *
-<span class="lineNum">    1804 </span>                :        *  @return  string_type representing printed form of true.
-<span class="lineNum">    1805 </span>                :       */
-<span class="lineNum">    1806 </span>                :       string_type
-<span class="lineNum">    1807 </span>                :       truename() const
-<span class="lineNum">    1808 </span>                :       { return this-&gt;do_truename(); }
-<span class="lineNum">    1809 </span>                : 
-<span class="lineNum">    1810 </span>                :       /**
-<span class="lineNum">    1811 </span>                :        *  @brief  Return string representation of bool false.
-<span class="lineNum">    1812 </span>                :        *
-<span class="lineNum">    1813 </span>                :        *  This function returns a string_type containing the text
-<span class="lineNum">    1814 </span>                :        *  representation for false bool variables.  It does so by calling
-<span class="lineNum">    1815 </span>                :        *  numpunct&lt;char_type&gt;::do_falsename().
-<span class="lineNum">    1816 </span>                :        *
-<span class="lineNum">    1817 </span>                :        *  @return  string_type representing printed form of false.
-<span class="lineNum">    1818 </span>                :       */
-<span class="lineNum">    1819 </span>                :       string_type
-<span class="lineNum">    1820 </span>                :       falsename() const
-<span class="lineNum">    1821 </span>                :       { return this-&gt;do_falsename(); }
-<span class="lineNum">    1822 </span>                : 
-<span class="lineNum">    1823 </span>                :     protected:
-<span class="lineNum">    1824 </span>                :       /// Destructor.
-<span class="lineNum">    1825 </span>                :       virtual
-<span class="lineNum">    1826 </span>                :       ~numpunct();
-<span class="lineNum">    1827 </span>                : 
-<span class="lineNum">    1828 </span>                :       /**
-<span class="lineNum">    1829 </span>                :        *  @brief  Return decimal point character.
-<span class="lineNum">    1830 </span>                :        *
-<span class="lineNum">    1831 </span>                :        *  Returns a char_type to use as a decimal point.  This function is a
-<span class="lineNum">    1832 </span>                :        *  hook for derived classes to change the value returned.
-<span class="lineNum">    1833 </span>                :        *
-<span class="lineNum">    1834 </span>                :        *  @return  @a char_type representing a decimal point.
-<span class="lineNum">    1835 </span>                :       */
-<span class="lineNum">    1836 </span>                :       virtual char_type
-<span class="lineNum">    1837 </span>                :       do_decimal_point() const
-<span class="lineNum">    1838 </span>                :       { return _M_data-&gt;_M_decimal_point; }
-<span class="lineNum">    1839 </span>                : 
-<span class="lineNum">    1840 </span>                :       /**
-<span class="lineNum">    1841 </span>                :        *  @brief  Return thousands separator character.
-<span class="lineNum">    1842 </span>                :        *
-<span class="lineNum">    1843 </span>                :        *  Returns a char_type to use as a thousands separator.  This function
-<span class="lineNum">    1844 </span>                :        *  is a hook for derived classes to change the value returned.
-<span class="lineNum">    1845 </span>                :        *
-<span class="lineNum">    1846 </span>                :        *  @return  @a char_type representing a thousands separator.
-<span class="lineNum">    1847 </span>                :       */
-<span class="lineNum">    1848 </span>                :       virtual char_type
-<span class="lineNum">    1849 </span>                :       do_thousands_sep() const
-<span class="lineNum">    1850 </span>                :       { return _M_data-&gt;_M_thousands_sep; }
-<span class="lineNum">    1851 </span>                : 
-<span class="lineNum">    1852 </span>                :       /**
-<span class="lineNum">    1853 </span>                :        *  @brief  Return grouping specification.
-<span class="lineNum">    1854 </span>                :        *
-<span class="lineNum">    1855 </span>                :        *  Returns a string representing groupings for the integer part of a
-<span class="lineNum">    1856 </span>                :        *  number.  This function is a hook for derived classes to change the
-<span class="lineNum">    1857 </span>                :        *  value returned.  @see grouping() for details.
-<span class="lineNum">    1858 </span>                :        *
-<span class="lineNum">    1859 </span>                :        *  @return  String representing grouping specification.
-<span class="lineNum">    1860 </span>                :       */
-<span class="lineNum">    1861 </span>                :       virtual string
-<span class="lineNum">    1862 </span>                :       do_grouping() const
-<span class="lineNum">    1863 </span>                :       { return _M_data-&gt;_M_grouping; }
-<span class="lineNum">    1864 </span>                : 
-<span class="lineNum">    1865 </span>                :       /**
-<span class="lineNum">    1866 </span>                :        *  @brief  Return string representation of bool true.
-<span class="lineNum">    1867 </span>                :        *
-<span class="lineNum">    1868 </span>                :        *  Returns a string_type containing the text representation for true
-<span class="lineNum">    1869 </span>                :        *  bool variables.  This function is a hook for derived classes to
-<span class="lineNum">    1870 </span>                :        *  change the value returned.
-<span class="lineNum">    1871 </span>                :        *
-<span class="lineNum">    1872 </span>                :        *  @return  string_type representing printed form of true.
-<span class="lineNum">    1873 </span>                :       */
-<span class="lineNum">    1874 </span>                :       virtual string_type
-<span class="lineNum">    1875 </span>                :       do_truename() const
-<span class="lineNum">    1876 </span>                :       { return _M_data-&gt;_M_truename; }
-<span class="lineNum">    1877 </span>                : 
-<span class="lineNum">    1878 </span>                :       /**
-<span class="lineNum">    1879 </span>                :        *  @brief  Return string representation of bool false.
-<span class="lineNum">    1880 </span>                :        *
-<span class="lineNum">    1881 </span>                :        *  Returns a string_type containing the text representation for false
-<span class="lineNum">    1882 </span>                :        *  bool variables.  This function is a hook for derived classes to
-<span class="lineNum">    1883 </span>                :        *  change the value returned.
-<span class="lineNum">    1884 </span>                :        *
-<span class="lineNum">    1885 </span>                :        *  @return  string_type representing printed form of false.
-<span class="lineNum">    1886 </span>                :       */
-<span class="lineNum">    1887 </span>                :       virtual string_type
-<span class="lineNum">    1888 </span>                :       do_falsename() const
-<span class="lineNum">    1889 </span>                :       { return _M_data-&gt;_M_falsename; }
-<span class="lineNum">    1890 </span>                : 
-<span class="lineNum">    1891 </span>                :       // For use at construction time only.
-<span class="lineNum">    1892 </span>                :       void
-<span class="lineNum">    1893 </span>                :       _M_initialize_numpunct(__c_locale __cloc = NULL);
-<span class="lineNum">    1894 </span>                :     };
-<span class="lineNum">    1895 </span>                : 
-<span class="lineNum">    1896 </span>                :   template&lt;typename _CharT&gt;
-<span class="lineNum">    1897 </span>                :     locale::id numpunct&lt;_CharT&gt;::id;
-<span class="lineNum">    1898 </span>                : 
-<span class="lineNum">    1899 </span>                :   template&lt;&gt;
-<span class="lineNum">    1900 </span>                :     numpunct&lt;char&gt;::~numpunct();
-<span class="lineNum">    1901 </span>                : 
-<span class="lineNum">    1902 </span>                :   template&lt;&gt;
-<span class="lineNum">    1903 </span>                :     void
-<span class="lineNum">    1904 </span>                :     numpunct&lt;char&gt;::_M_initialize_numpunct(__c_locale __cloc);
-<span class="lineNum">    1905 </span>                : 
-<span class="lineNum">    1906 </span>                : #ifdef _GLIBCXX_USE_WCHAR_T
-<span class="lineNum">    1907 </span>                :   template&lt;&gt;
-<span class="lineNum">    1908 </span>                :     numpunct&lt;wchar_t&gt;::~numpunct();
-<span class="lineNum">    1909 </span>                : 
-<span class="lineNum">    1910 </span>                :   template&lt;&gt;
-<span class="lineNum">    1911 </span>                :     void
-<span class="lineNum">    1912 </span>                :     numpunct&lt;wchar_t&gt;::_M_initialize_numpunct(__c_locale __cloc);
-<span class="lineNum">    1913 </span>                : #endif
-<span class="lineNum">    1914 </span>                : 
-<span class="lineNum">    1915 </span>                :   /// class numpunct_byname [22.2.3.2].
-<span class="lineNum">    1916 </span>                :   template&lt;typename _CharT&gt;
-<span class="lineNum">    1917 </span>                :     class numpunct_byname : public numpunct&lt;_CharT&gt;
-<span class="lineNum">    1918 </span>                :     {
-<span class="lineNum">    1919 </span>                :     public:
-<span class="lineNum">    1920 </span>                :       typedef _CharT                    char_type;
-<span class="lineNum">    1921 </span>                :       typedef basic_string&lt;_CharT&gt;        string_type;
-<span class="lineNum">    1922 </span>                : 
-<span class="lineNum">    1923 </span>                :       explicit
-<span class="lineNum">    1924 </span>                :       numpunct_byname(const char* __s, size_t __refs = 0)
-<span class="lineNum">    1925 </span>                :       : numpunct&lt;_CharT&gt;(__refs)
-<span class="lineNum">    1926 </span>                :       {
-<span class="lineNum">    1927 </span>                :         if (__builtin_strcmp(__s, &quot;C&quot;) != 0
-<span class="lineNum">    1928 </span>                :             &amp;&amp; __builtin_strcmp(__s, &quot;POSIX&quot;) != 0)
-<span class="lineNum">    1929 </span>                :           {
-<span class="lineNum">    1930 </span>                :             __c_locale __tmp;
-<span class="lineNum">    1931 </span>                :             this-&gt;_S_create_c_locale(__tmp, __s);
-<span class="lineNum">    1932 </span>                :             this-&gt;_M_initialize_numpunct(__tmp);
-<span class="lineNum">    1933 </span>                :             this-&gt;_S_destroy_c_locale(__tmp);
-<span class="lineNum">    1934 </span>                :           }
-<span class="lineNum">    1935 </span>                :       }
-<span class="lineNum">    1936 </span>                : 
-<span class="lineNum">    1937 </span>                :     protected:
-<span class="lineNum">    1938 </span>                :       virtual
-<span class="lineNum">    1939 </span>                :       ~numpunct_byname() { }
-<span class="lineNum">    1940 </span>                :     };
-<span class="lineNum">    1941 </span>                : 
-<span class="lineNum">    1942 </span>                : _GLIBCXX_BEGIN_LDBL_NAMESPACE
-<span class="lineNum">    1943 </span>                : 
-<span class="lineNum">    1944 </span>                :   /**
-<span class="lineNum">    1945 </span>                :    *  @brief  Facet for parsing number strings.
-<span class="lineNum">    1946 </span>                :    *
-<span class="lineNum">    1947 </span>                :    *  This facet encapsulates the code to parse and return a number
-<span class="lineNum">    1948 </span>                :    *  from a string.  It is used by the istream numeric extraction
-<span class="lineNum">    1949 </span>                :    *  operators.
-<span class="lineNum">    1950 </span>                :    *
-<span class="lineNum">    1951 </span>                :    *  The num_get template uses protected virtual functions to provide the
-<span class="lineNum">    1952 </span>                :    *  actual results.  The public accessors forward the call to the virtual
-<span class="lineNum">    1953 </span>                :    *  functions.  These virtual functions are hooks for developers to
-<span class="lineNum">    1954 </span>                :    *  implement the behavior they require from the num_get facet.
-<span class="lineNum">    1955 </span>                :   */
-<span class="lineNum">    1956 </span>                :   template&lt;typename _CharT, typename _InIter&gt;
-<span class="lineNum">    1957 </span>                :     class num_get : public locale::facet
-<span class="lineNum">    1958 </span>                :     {
-<span class="lineNum">    1959 </span>                :     public:
-<span class="lineNum">    1960 </span>                :       // Types:
-<span class="lineNum">    1961 </span>                :       //@{
-<span class="lineNum">    1962 </span>                :       /// Public typedefs
-<span class="lineNum">    1963 </span>                :       typedef _CharT                    char_type;
-<span class="lineNum">    1964 </span>                :       typedef _InIter                   iter_type;
-<span class="lineNum">    1965 </span>                :       //@}
-<span class="lineNum">    1966 </span>                : 
-<span class="lineNum">    1967 </span>                :       /// Numpunct facet id.
-<span class="lineNum">    1968 </span>                :       static locale::id                 id;
-<span class="lineNum">    1969 </span>                : 
-<span class="lineNum">    1970 </span>                :       /**
-<span class="lineNum">    1971 </span>                :        *  @brief  Constructor performs initialization.
-<span class="lineNum">    1972 </span>                :        *
-<span class="lineNum">    1973 </span>                :        *  This is the constructor provided by the standard.
-<span class="lineNum">    1974 </span>                :        *
-<span class="lineNum">    1975 </span>                :        *  @param refs  Passed to the base facet class.
-<span class="lineNum">    1976 </span>                :       */
-<span class="lineNum">    1977 </span>                :       explicit
-<span class="lineNum">    1978 </span>                :       num_get(size_t __refs = 0) : facet(__refs) { }
-<span class="lineNum">    1979 </span>                : 
-<span class="lineNum">    1980 </span>                :       /**
-<span class="lineNum">    1981 </span>                :        *  @brief  Numeric parsing.
-<span class="lineNum">    1982 </span>                :        *
-<span class="lineNum">    1983 </span>                :        *  Parses the input stream into the bool @a v.  It does so by calling
-<span class="lineNum">    1984 </span>                :        *  num_get::do_get().
-<span class="lineNum">    1985 </span>                :        *
-<span class="lineNum">    1986 </span>                :        *  If ios_base::boolalpha is set, attempts to read
-<span class="lineNum">    1987 </span>                :        *  ctype&lt;CharT&gt;::truename() or ctype&lt;CharT&gt;::falsename().  Sets
-<span class="lineNum">    1988 </span>                :        *  @a v to true or false if successful.  Sets err to
-<span class="lineNum">    1989 </span>                :        *  ios_base::failbit if reading the string fails.  Sets err to
-<span class="lineNum">    1990 </span>                :        *  ios_base::eofbit if the stream is emptied.
-<span class="lineNum">    1991 </span>                :        *
-<span class="lineNum">    1992 </span>                :        *  If ios_base::boolalpha is not set, proceeds as with reading a long,
-<span class="lineNum">    1993 </span>                :        *  except if the value is 1, sets @a v to true, if the value is 0, sets
-<span class="lineNum">    1994 </span>                :        *  @a v to false, and otherwise set err to ios_base::failbit.
-<span class="lineNum">    1995 </span>                :        *
-<span class="lineNum">    1996 </span>                :        *  @param  in  Start of input stream.
-<span class="lineNum">    1997 </span>                :        *  @param  end  End of input stream.
-<span class="lineNum">    1998 </span>                :        *  @param  io  Source of locale and flags.
-<span class="lineNum">    1999 </span>                :        *  @param  err  Error flags to set.
-<span class="lineNum">    2000 </span>                :        *  @param  v  Value to format and insert.
-<span class="lineNum">    2001 </span>                :        *  @return  Iterator after reading.
-<span class="lineNum">    2002 </span>                :       */
-<span class="lineNum">    2003 </span>                :       iter_type
-<span class="lineNum">    2004 </span>                :       get(iter_type __in, iter_type __end, ios_base&amp; __io,
-<span class="lineNum">    2005 </span>                :           ios_base::iostate&amp; __err, bool&amp; __v) const
-<span class="lineNum">    2006 </span>                :       { return this-&gt;do_get(__in, __end, __io, __err, __v); }
-<span class="lineNum">    2007 </span>                : 
-<span class="lineNum">    2008 </span>                :       //@{
-<span class="lineNum">    2009 </span>                :       /**
-<span class="lineNum">    2010 </span>                :        *  @brief  Numeric parsing.
-<span class="lineNum">    2011 </span>                :        *
-<span class="lineNum">    2012 </span>                :        *  Parses the input stream into the integral variable @a v.  It does so
-<span class="lineNum">    2013 </span>                :        *  by calling num_get::do_get().
-<span class="lineNum">    2014 </span>                :        *
-<span class="lineNum">    2015 </span>                :        *  Parsing is affected by the flag settings in @a io.
-<span class="lineNum">    2016 </span>                :        *
-<span class="lineNum">    2017 </span>                :        *  The basic parse is affected by the value of io.flags() &amp;
-<span class="lineNum">    2018 </span>                :        *  ios_base::basefield.  If equal to ios_base::oct, parses like the
-<span class="lineNum">    2019 </span>                :        *  scanf %o specifier.  Else if equal to ios_base::hex, parses like %X
-<span class="lineNum">    2020 </span>                :        *  specifier.  Else if basefield equal to 0, parses like the %i
-<span class="lineNum">    2021 </span>                :        *  specifier.  Otherwise, parses like %d for signed and %u for unsigned
-<span class="lineNum">    2022 </span>                :        *  types.  The matching type length modifier is also used.
-<span class="lineNum">    2023 </span>                :        *
-<span class="lineNum">    2024 </span>                :        *  Digit grouping is interpreted according to numpunct::grouping() and
-<span class="lineNum">    2025 </span>                :        *  numpunct::thousands_sep().  If the pattern of digit groups isn't
-<span class="lineNum">    2026 </span>                :        *  consistent, sets err to ios_base::failbit.
-<span class="lineNum">    2027 </span>                :        *
-<span class="lineNum">    2028 </span>                :        *  If parsing the string yields a valid value for @a v, @a v is set.
-<span class="lineNum">    2029 </span>                :        *  Otherwise, sets err to ios_base::failbit and leaves @a v unaltered.
-<span class="lineNum">    2030 </span>                :        *  Sets err to ios_base::eofbit if the stream is emptied.
-<span class="lineNum">    2031 </span>                :        *
-<span class="lineNum">    2032 </span>                :        *  @param  in  Start of input stream.
-<span class="lineNum">    2033 </span>                :        *  @param  end  End of input stream.
-<span class="lineNum">    2034 </span>                :        *  @param  io  Source of locale and flags.
-<span class="lineNum">    2035 </span>                :        *  @param  err  Error flags to set.
-<span class="lineNum">    2036 </span>                :        *  @param  v  Value to format and insert.
-<span class="lineNum">    2037 </span>                :        *  @return  Iterator after reading.
-<span class="lineNum">    2038 </span>                :       */
-<span class="lineNum">    2039 </span>                :       iter_type
-<span class="lineNum">    2040 </span>                :       get(iter_type __in, iter_type __end, ios_base&amp; __io,
-<span class="lineNum">    2041 </span>                :           ios_base::iostate&amp; __err, long&amp; __v) const
-<span class="lineNum">    2042 </span>                :       { return this-&gt;do_get(__in, __end, __io, __err, __v); }
-<span class="lineNum">    2043 </span>                : 
-<span class="lineNum">    2044 </span>                :       iter_type
-<span class="lineNum">    2045 </span>                :       get(iter_type __in, iter_type __end, ios_base&amp; __io,
-<span class="lineNum">    2046 </span>                :           ios_base::iostate&amp; __err, unsigned short&amp; __v) const
-<span class="lineNum">    2047 </span>                :       { return this-&gt;do_get(__in, __end, __io, __err, __v); }
-<span class="lineNum">    2048 </span>                : 
-<span class="lineNum">    2049 </span>                :       iter_type
-<span class="lineNum">    2050 </span>                :       get(iter_type __in, iter_type __end, ios_base&amp; __io,
-<span class="lineNum">    2051 </span>                :           ios_base::iostate&amp; __err, unsigned int&amp; __v)   const
-<span class="lineNum">    2052 </span>                :       { return this-&gt;do_get(__in, __end, __io, __err, __v); }
-<span class="lineNum">    2053 </span>                : 
-<span class="lineNum">    2054 </span>                :       iter_type
-<span class="lineNum">    2055 </span>                :       get(iter_type __in, iter_type __end, ios_base&amp; __io,
-<span class="lineNum">    2056 </span>                :           ios_base::iostate&amp; __err, unsigned long&amp; __v)  const
-<span class="lineNum">    2057 </span>                :       { return this-&gt;do_get(__in, __end, __io, __err, __v); }
-<span class="lineNum">    2058 </span>                : 
-<span class="lineNum">    2059 </span>                : #ifdef _GLIBCXX_USE_LONG_LONG
-<span class="lineNum">    2060 </span>                :       iter_type
-<span class="lineNum">    2061 </span>                :       get(iter_type __in, iter_type __end, ios_base&amp; __io,
-<span class="lineNum">    2062 </span>                :           ios_base::iostate&amp; __err, long long&amp; __v) const
-<span class="lineNum">    2063 </span>                :       { return this-&gt;do_get(__in, __end, __io, __err, __v); }
-<span class="lineNum">    2064 </span>                : 
-<span class="lineNum">    2065 </span>                :       iter_type
-<span class="lineNum">    2066 </span>                :       get(iter_type __in, iter_type __end, ios_base&amp; __io,
-<span class="lineNum">    2067 </span>                :           ios_base::iostate&amp; __err, unsigned long long&amp; __v)  const
-<span class="lineNum">    2068 </span>                :       { return this-&gt;do_get(__in, __end, __io, __err, __v); }
-<span class="lineNum">    2069 </span>                : #endif
-<span class="lineNum">    2070 </span>                :       //@}
-<span class="lineNum">    2071 </span>                : 
-<span class="lineNum">    2072 </span>                :       //@{
-<span class="lineNum">    2073 </span>                :       /**
-<span class="lineNum">    2074 </span>                :        *  @brief  Numeric parsing.
-<span class="lineNum">    2075 </span>                :        *
-<span class="lineNum">    2076 </span>                :        *  Parses the input stream into the integral variable @a v.  It does so
-<span class="lineNum">    2077 </span>                :        *  by calling num_get::do_get().
-<span class="lineNum">    2078 </span>                :        *
-<span class="lineNum">    2079 </span>                :        *  The input characters are parsed like the scanf %g specifier.  The
-<span class="lineNum">    2080 </span>                :        *  matching type length modifier is also used.
-<span class="lineNum">    2081 </span>                :        *
-<span class="lineNum">    2082 </span>                :        *  The decimal point character used is numpunct::decimal_point().
-<span class="lineNum">    2083 </span>                :        *  Digit grouping is interpreted according to numpunct::grouping() and
-<span class="lineNum">    2084 </span>                :        *  numpunct::thousands_sep().  If the pattern of digit groups isn't
-<span class="lineNum">    2085 </span>                :        *  consistent, sets err to ios_base::failbit.
-<span class="lineNum">    2086 </span>                :        *
-<span class="lineNum">    2087 </span>                :        *  If parsing the string yields a valid value for @a v, @a v is set.
-<span class="lineNum">    2088 </span>                :        *  Otherwise, sets err to ios_base::failbit and leaves @a v unaltered.
-<span class="lineNum">    2089 </span>                :        *  Sets err to ios_base::eofbit if the stream is emptied.
-<span class="lineNum">    2090 </span>                :        *
-<span class="lineNum">    2091 </span>                :        *  @param  in  Start of input stream.
-<span class="lineNum">    2092 </span>                :        *  @param  end  End of input stream.
-<span class="lineNum">    2093 </span>                :        *  @param  io  Source of locale and flags.
-<span class="lineNum">    2094 </span>                :        *  @param  err  Error flags to set.
-<span class="lineNum">    2095 </span>                :        *  @param  v  Value to format and insert.
-<span class="lineNum">    2096 </span>                :        *  @return  Iterator after reading.
-<span class="lineNum">    2097 </span>                :       */
-<span class="lineNum">    2098 </span>                :       iter_type
-<span class="lineNum">    2099 </span>                :       get(iter_type __in, iter_type __end, ios_base&amp; __io,
-<span class="lineNum">    2100 </span>                :           ios_base::iostate&amp; __err, float&amp; __v) const
-<span class="lineNum">    2101 </span>                :       { return this-&gt;do_get(__in, __end, __io, __err, __v); }
-<span class="lineNum">    2102 </span>                : 
-<span class="lineNum">    2103 </span>                :       iter_type
-<span class="lineNum">    2104 </span>                :       get(iter_type __in, iter_type __end, ios_base&amp; __io,
-<span class="lineNum">    2105 </span>                :           ios_base::iostate&amp; __err, double&amp; __v) const
-<span class="lineNum">    2106 </span>                :       { return this-&gt;do_get(__in, __end, __io, __err, __v); }
-<span class="lineNum">    2107 </span>                : 
-<span class="lineNum">    2108 </span>                :       iter_type
-<span class="lineNum">    2109 </span>                :       get(iter_type __in, iter_type __end, ios_base&amp; __io,
-<span class="lineNum">    2110 </span>                :           ios_base::iostate&amp; __err, long double&amp; __v) const
-<span class="lineNum">    2111 </span>                :       { return this-&gt;do_get(__in, __end, __io, __err, __v); }
-<span class="lineNum">    2112 </span>                :       //@}
-<span class="lineNum">    2113 </span>                : 
-<span class="lineNum">    2114 </span>                :       /**
-<span class="lineNum">    2115 </span>                :        *  @brief  Numeric parsing.
-<span class="lineNum">    2116 </span>                :        *
-<span class="lineNum">    2117 </span>                :        *  Parses the input stream into the pointer variable @a v.  It does so
-<span class="lineNum">    2118 </span>                :        *  by calling num_get::do_get().
-<span class="lineNum">    2119 </span>                :        *
-<span class="lineNum">    2120 </span>                :        *  The input characters are parsed like the scanf %p specifier.
-<span class="lineNum">    2121 </span>                :        *
-<span class="lineNum">    2122 </span>                :        *  Digit grouping is interpreted according to numpunct::grouping() and
-<span class="lineNum">    2123 </span>                :        *  numpunct::thousands_sep().  If the pattern of digit groups isn't
-<span class="lineNum">    2124 </span>                :        *  consistent, sets err to ios_base::failbit.
-<span class="lineNum">    2125 </span>                :        *
-<span class="lineNum">    2126 </span>                :        *  Note that the digit grouping effect for pointers is a bit ambiguous
-<span class="lineNum">    2127 </span>                :        *  in the standard and shouldn't be relied on.  See DR 344.
-<span class="lineNum">    2128 </span>                :        *
-<span class="lineNum">    2129 </span>                :        *  If parsing the string yields a valid value for @a v, @a v is set.
-<span class="lineNum">    2130 </span>                :        *  Otherwise, sets err to ios_base::failbit and leaves @a v unaltered.
-<span class="lineNum">    2131 </span>                :        *  Sets err to ios_base::eofbit if the stream is emptied.
-<span class="lineNum">    2132 </span>                :        *
-<span class="lineNum">    2133 </span>                :        *  @param  in  Start of input stream.
-<span class="lineNum">    2134 </span>                :        *  @param  end  End of input stream.
-<span class="lineNum">    2135 </span>                :        *  @param  io  Source of locale and flags.
-<span class="lineNum">    2136 </span>                :        *  @param  err  Error flags to set.
-<span class="lineNum">    2137 </span>                :        *  @param  v  Value to format and insert.
-<span class="lineNum">    2138 </span>                :        *  @return  Iterator after reading.
-<span class="lineNum">    2139 </span>                :       */
-<span class="lineNum">    2140 </span>                :       iter_type
-<span class="lineNum">    2141 </span>                :       get(iter_type __in, iter_type __end, ios_base&amp; __io,
-<span class="lineNum">    2142 </span>                :           ios_base::iostate&amp; __err, void*&amp; __v) const
-<span class="lineNum">    2143 </span>                :       { return this-&gt;do_get(__in, __end, __io, __err, __v); }
-<span class="lineNum">    2144 </span>                : 
-<span class="lineNum">    2145 </span>                :     protected:
-<span class="lineNum">    2146 </span>                :       /// Destructor.
-<span class="lineNum">    2147 </span>                :       virtual ~num_get() { }
-<span class="lineNum">    2148 </span>                : 
-<span class="lineNum">    2149 </span>                :       iter_type
-<span class="lineNum">    2150 </span>                :       _M_extract_float(iter_type, iter_type, ios_base&amp;, ios_base::iostate&amp;,
-<span class="lineNum">    2151 </span>                :                        string&amp; __xtrc) const;
-<span class="lineNum">    2152 </span>                : 
-<span class="lineNum">    2153 </span>                :       template&lt;typename _ValueT&gt;
-<span class="lineNum">    2154 </span>                :         iter_type
-<span class="lineNum">    2155 </span>                :         _M_extract_int(iter_type, iter_type, ios_base&amp;, ios_base::iostate&amp;,
-<span class="lineNum">    2156 </span>                :                        _ValueT&amp; __v) const;
-<span class="lineNum">    2157 </span>                : 
-<span class="lineNum">    2158 </span>                :       template&lt;typename _CharT2&gt;
-<span class="lineNum">    2159 </span>                :       typename __gnu_cxx::__enable_if&lt;__is_char&lt;_CharT2&gt;::__value, int&gt;::__type
-<span class="lineNum">    2160 </span>                :         _M_find(const _CharT2*, size_t __len, _CharT2 __c) const
-<span class="lineNum">    2161 </span>                :         {
-<span class="lineNum">    2162 </span>                :           int __ret = -1;
-<span class="lineNum">    2163 </span>                :           if (__len &lt;= 10)
-<span class="lineNum">    2164 </span>                :             {
-<span class="lineNum">    2165 </span>                :               if (__c &gt;= _CharT2('0') &amp;&amp; __c &lt; _CharT2(_CharT2('0') + __len))
-<span class="lineNum">    2166 </span>                :                 __ret = __c - _CharT2('0');
-<span class="lineNum">    2167 </span>                :             }
-<span class="lineNum">    2168 </span>                :           else
-<span class="lineNum">    2169 </span>                :             {
-<span class="lineNum">    2170 </span>                :               if (__c &gt;= _CharT2('0') &amp;&amp; __c &lt;= _CharT2('9'))
-<span class="lineNum">    2171 </span>                :                 __ret = __c - _CharT2('0');
-<span class="lineNum">    2172 </span>                :               else if (__c &gt;= _CharT2('a') &amp;&amp; __c &lt;= _CharT2('f'))
-<span class="lineNum">    2173 </span>                :                 __ret = 10 + (__c - _CharT2('a'));
-<span class="lineNum">    2174 </span>                :               else if (__c &gt;= _CharT2('A') &amp;&amp; __c &lt;= _CharT2('F'))
-<span class="lineNum">    2175 </span>                :                 __ret = 10 + (__c - _CharT2('A'));
-<span class="lineNum">    2176 </span>                :             }
-<span class="lineNum">    2177 </span>                :           return __ret;
-<span class="lineNum">    2178 </span>                :         }
-<span class="lineNum">    2179 </span>                : 
-<span class="lineNum">    2180 </span>                :       template&lt;typename _CharT2&gt;
-<span class="lineNum">    2181 </span>                :       typename __gnu_cxx::__enable_if&lt;!__is_char&lt;_CharT2&gt;::__value, 
-<span class="lineNum">    2182 </span>                :                                       int&gt;::__type
-<span class="lineNum">    2183 </span>                :         _M_find(const _CharT2* __zero, size_t __len, _CharT2 __c) const
-<span class="lineNum">    2184 </span>                :         {
-<span class="lineNum">    2185 </span>                :           int __ret = -1;
-<span class="lineNum">    2186 </span>                :           const char_type* __q = char_traits&lt;_CharT2&gt;::find(__zero, __len, __c);
-<span class="lineNum">    2187 </span>                :           if (__q)
-<span class="lineNum">    2188 </span>                :             {
-<span class="lineNum">    2189 </span>                :               __ret = __q - __zero;
-<span class="lineNum">    2190 </span>                :               if (__ret &gt; 15)
-<span class="lineNum">    2191 </span>                :                 __ret -= 6;
-<span class="lineNum">    2192 </span>                :             }
-<span class="lineNum">    2193 </span>                :           return __ret;
-<span class="lineNum">    2194 </span>                :         }
-<span class="lineNum">    2195 </span>                : 
-<span class="lineNum">    2196 </span>                :       //@{
-<span class="lineNum">    2197 </span>                :       /**
-<span class="lineNum">    2198 </span>                :        *  @brief  Numeric parsing.
-<span class="lineNum">    2199 </span>                :        *
-<span class="lineNum">    2200 </span>                :        *  Parses the input stream into the variable @a v.  This function is a
-<span class="lineNum">    2201 </span>                :        *  hook for derived classes to change the value returned.  @see get()
-<span class="lineNum">    2202 </span>                :        *  for more details.
-<span class="lineNum">    2203 </span>                :        *
-<span class="lineNum">    2204 </span>                :        *  @param  in  Start of input stream.
-<span class="lineNum">    2205 </span>                :        *  @param  end  End of input stream.
-<span class="lineNum">    2206 </span>                :        *  @param  io  Source of locale and flags.
-<span class="lineNum">    2207 </span>                :        *  @param  err  Error flags to set.
-<span class="lineNum">    2208 </span>                :        *  @param  v  Value to format and insert.
-<span class="lineNum">    2209 </span>                :        *  @return  Iterator after reading.
-<span class="lineNum">    2210 </span>                :       */
-<span class="lineNum">    2211 </span>                :       virtual iter_type
-<span class="lineNum">    2212 </span>                :       do_get(iter_type, iter_type, ios_base&amp;, ios_base::iostate&amp;, bool&amp;) const;
-<span class="lineNum">    2213 </span>                : 
-<span class="lineNum">    2214 </span>                : 
-<span class="lineNum">    2215 </span>                :       virtual iter_type
-<span class="lineNum">    2216 </span>                :       do_get(iter_type, iter_type, ios_base&amp;, ios_base::iostate&amp;, long&amp;) const;
-<span class="lineNum">    2217 </span>                : 
-<span class="lineNum">    2218 </span>                :       virtual iter_type
-<span class="lineNum">    2219 </span>                :       do_get(iter_type, iter_type, ios_base&amp;, ios_base::iostate&amp; __err,
-<span class="lineNum">    2220 </span>                :               unsigned short&amp;) const;
-<span class="lineNum">    2221 </span>                : 
-<span class="lineNum">    2222 </span>                :       virtual iter_type
-<span class="lineNum">    2223 </span>                :       do_get(iter_type, iter_type, ios_base&amp;, ios_base::iostate&amp; __err,
-<span class="lineNum">    2224 </span>                :              unsigned int&amp;) const;
-<span class="lineNum">    2225 </span>                : 
-<span class="lineNum">    2226 </span>                :       virtual iter_type
-<span class="lineNum">    2227 </span>                :       do_get(iter_type, iter_type, ios_base&amp;, ios_base::iostate&amp; __err,
-<span class="lineNum">    2228 </span>                :              unsigned long&amp;) const;
-<span class="lineNum">    2229 </span>                : 
-<span class="lineNum">    2230 </span>                : #ifdef _GLIBCXX_USE_LONG_LONG
-<span class="lineNum">    2231 </span>                :       virtual iter_type
-<span class="lineNum">    2232 </span>                :       do_get(iter_type, iter_type, ios_base&amp;, ios_base::iostate&amp; __err,
-<span class="lineNum">    2233 </span>                :              long long&amp;) const;
-<span class="lineNum">    2234 </span>                : 
-<span class="lineNum">    2235 </span>                :       virtual iter_type
-<span class="lineNum">    2236 </span>                :       do_get(iter_type, iter_type, ios_base&amp;, ios_base::iostate&amp; __err,
-<span class="lineNum">    2237 </span>                :              unsigned long long&amp;) const;
-<span class="lineNum">    2238 </span>                : #endif
-<span class="lineNum">    2239 </span>                : 
-<span class="lineNum">    2240 </span>                :       virtual iter_type
-<span class="lineNum">    2241 </span>                :       do_get(iter_type, iter_type, ios_base&amp;, ios_base::iostate&amp; __err,
-<span class="lineNum">    2242 </span>                :              float&amp;) const;
-<span class="lineNum">    2243 </span>                : 
-<span class="lineNum">    2244 </span>                :       virtual iter_type
-<span class="lineNum">    2245 </span>                :       do_get(iter_type, iter_type, ios_base&amp;, ios_base::iostate&amp; __err,
-<span class="lineNum">    2246 </span>                :              double&amp;) const;
-<span class="lineNum">    2247 </span>                : 
-<span class="lineNum">    2248 </span>                :       // XXX GLIBCXX_ABI Deprecated
-<span class="lineNum">    2249 </span>                : #if defined _GLIBCXX_LONG_DOUBLE_COMPAT &amp;&amp; defined __LONG_DOUBLE_128__
-<span class="lineNum">    2250 </span>                :       virtual iter_type
-<span class="lineNum">    2251 </span>                :       __do_get(iter_type, iter_type, ios_base&amp;, ios_base::iostate&amp; __err,
-<span class="lineNum">    2252 </span>                :                double&amp;) const;
-<span class="lineNum">    2253 </span>                : #else
-<span class="lineNum">    2254 </span>                :       virtual iter_type
-<span class="lineNum">    2255 </span>                :       do_get(iter_type, iter_type, ios_base&amp;, ios_base::iostate&amp; __err,
-<span class="lineNum">    2256 </span>                :              long double&amp;) const;
-<span class="lineNum">    2257 </span>                : #endif
-<span class="lineNum">    2258 </span>                : 
-<span class="lineNum">    2259 </span>                :       virtual iter_type
-<span class="lineNum">    2260 </span>                :       do_get(iter_type, iter_type, ios_base&amp;, ios_base::iostate&amp; __err,
-<span class="lineNum">    2261 </span>                :              void*&amp;) const;
-<span class="lineNum">    2262 </span>                : 
-<span class="lineNum">    2263 </span>                :       // XXX GLIBCXX_ABI Deprecated
-<span class="lineNum">    2264 </span>                : #if defined _GLIBCXX_LONG_DOUBLE_COMPAT &amp;&amp; defined __LONG_DOUBLE_128__
-<span class="lineNum">    2265 </span>                :       virtual iter_type
-<span class="lineNum">    2266 </span>                :       do_get(iter_type, iter_type, ios_base&amp;, ios_base::iostate&amp; __err,
-<span class="lineNum">    2267 </span>                :              long double&amp;) const;
-<span class="lineNum">    2268 </span>                : #endif
-<span class="lineNum">    2269 </span>                :       //@}
-<span class="lineNum">    2270 </span>                :     };
-<span class="lineNum">    2271 </span>                : 
-<span class="lineNum">    2272 </span>                :   template&lt;typename _CharT, typename _InIter&gt;
-<span class="lineNum">    2273 </span>                :     locale::id num_get&lt;_CharT, _InIter&gt;::id;
-<span class="lineNum">    2274 </span>                : 
-<span class="lineNum">    2275 </span>                : 
-<span class="lineNum">    2276 </span>                :   /**
-<span class="lineNum">    2277 </span>                :    *  @brief  Facet for converting numbers to strings.
-<span class="lineNum">    2278 </span>                :    *
-<span class="lineNum">    2279 </span>                :    *  This facet encapsulates the code to convert a number to a string.  It is
-<span class="lineNum">    2280 </span>                :    *  used by the ostream numeric insertion operators.
-<span class="lineNum">    2281 </span>                :    *
-<span class="lineNum">    2282 </span>                :    *  The num_put template uses protected virtual functions to provide the
-<span class="lineNum">    2283 </span>                :    *  actual results.  The public accessors forward the call to the virtual
-<span class="lineNum">    2284 </span>                :    *  functions.  These virtual functions are hooks for developers to
-<span class="lineNum">    2285 </span>                :    *  implement the behavior they require from the num_put facet.
-<span class="lineNum">    2286 </span>                :   */
-<span class="lineNum">    2287 </span>                :   template&lt;typename _CharT, typename _OutIter&gt;
-<span class="lineNum">    2288 </span>                :     class num_put : public locale::facet
-<span class="lineNum">    2289 </span>                :     {
-<span class="lineNum">    2290 </span>                :     public:
-<span class="lineNum">    2291 </span>                :       // Types:
-<span class="lineNum">    2292 </span>                :       //@{
-<span class="lineNum">    2293 </span>                :       /// Public typedefs
-<span class="lineNum">    2294 </span>                :       typedef _CharT            char_type;
-<span class="lineNum">    2295 </span>                :       typedef _OutIter          iter_type;
-<span class="lineNum">    2296 </span>                :       //@}
-<span class="lineNum">    2297 </span>                : 
-<span class="lineNum">    2298 </span>                :       /// Numpunct facet id.
-<span class="lineNum">    2299 </span>                :       static locale::id         id;
-<span class="lineNum">    2300 </span>                : 
-<span class="lineNum">    2301 </span>                :       /**
-<span class="lineNum">    2302 </span>                :        *  @brief  Constructor performs initialization.
-<span class="lineNum">    2303 </span>                :        *
-<span class="lineNum">    2304 </span>                :        *  This is the constructor provided by the standard.
-<span class="lineNum">    2305 </span>                :        *
-<span class="lineNum">    2306 </span>                :        *  @param refs  Passed to the base facet class.
-<span class="lineNum">    2307 </span>                :       */
-<span class="lineNum">    2308 </span>                :       explicit
-<span class="lineNum">    2309 </span>                :       num_put(size_t __refs = 0) : facet(__refs) { }
-<span class="lineNum">    2310 </span>                : 
-<span class="lineNum">    2311 </span>                :       /**
-<span class="lineNum">    2312 </span>                :        *  @brief  Numeric formatting.
-<span class="lineNum">    2313 </span>                :        *
-<span class="lineNum">    2314 </span>                :        *  Formats the boolean @a v and inserts it into a stream.  It does so
-<span class="lineNum">    2315 </span>                :        *  by calling num_put::do_put().
-<span class="lineNum">    2316 </span>                :        *
-<span class="lineNum">    2317 </span>                :        *  If ios_base::boolalpha is set, writes ctype&lt;CharT&gt;::truename() or
-<span class="lineNum">    2318 </span>                :        *  ctype&lt;CharT&gt;::falsename().  Otherwise formats @a v as an int.
-<span class="lineNum">    2319 </span>                :        *
-<span class="lineNum">    2320 </span>                :        *  @param  s  Stream to write to.
-<span class="lineNum">    2321 </span>                :        *  @param  io  Source of locale and flags.
-<span class="lineNum">    2322 </span>                :        *  @param  fill  Char_type to use for filling.
-<span class="lineNum">    2323 </span>                :        *  @param  v  Value to format and insert.
-<span class="lineNum">    2324 </span>                :        *  @return  Iterator after writing.
-<span class="lineNum">    2325 </span>                :       */
-<span class="lineNum">    2326 </span>                :       iter_type
-<span class="lineNum">    2327 </span>                :       put(iter_type __s, ios_base&amp; __f, char_type __fill, bool __v) const
-<span class="lineNum">    2328 </span>                :       { return this-&gt;do_put(__s, __f, __fill, __v); }
-<span class="lineNum">    2329 </span>                : 
-<span class="lineNum">    2330 </span>                :       //@{
-<span class="lineNum">    2331 </span>                :       /**
-<span class="lineNum">    2332 </span>                :        *  @brief  Numeric formatting.
-<span class="lineNum">    2333 </span>                :        *
-<span class="lineNum">    2334 </span>                :        *  Formats the integral value @a v and inserts it into a
-<span class="lineNum">    2335 </span>                :        *  stream.  It does so by calling num_put::do_put().
-<span class="lineNum">    2336 </span>                :        *
-<span class="lineNum">    2337 </span>                :        *  Formatting is affected by the flag settings in @a io.
-<span class="lineNum">    2338 </span>                :        *
-<span class="lineNum">    2339 </span>                :        *  The basic format is affected by the value of io.flags() &amp;
-<span class="lineNum">    2340 </span>                :        *  ios_base::basefield.  If equal to ios_base::oct, formats like the
-<span class="lineNum">    2341 </span>                :        *  printf %o specifier.  Else if equal to ios_base::hex, formats like
-<span class="lineNum">    2342 </span>                :        *  %x or %X with ios_base::uppercase unset or set respectively.
-<span class="lineNum">    2343 </span>                :        *  Otherwise, formats like %d, %ld, %lld for signed and %u, %lu, %llu
-<span class="lineNum">    2344 </span>                :        *  for unsigned values.  Note that if both oct and hex are set, neither
-<span class="lineNum">    2345 </span>                :        *  will take effect.
-<span class="lineNum">    2346 </span>                :        *
-<span class="lineNum">    2347 </span>                :        *  If ios_base::showpos is set, '+' is output before positive values.
-<span class="lineNum">    2348 </span>                :        *  If ios_base::showbase is set, '0' precedes octal values (except 0)
-<span class="lineNum">    2349 </span>                :        *  and '0[xX]' precedes hex values.
-<span class="lineNum">    2350 </span>                :        *
-<span class="lineNum">    2351 </span>                :        *  Thousands separators are inserted according to numpunct::grouping()
-<span class="lineNum">    2352 </span>                :        *  and numpunct::thousands_sep().  The decimal point character used is
-<span class="lineNum">    2353 </span>                :        *  numpunct::decimal_point().
-<span class="lineNum">    2354 </span>                :        *
-<span class="lineNum">    2355 </span>                :        *  If io.width() is non-zero, enough @a fill characters are inserted to
-<span class="lineNum">    2356 </span>                :        *  make the result at least that wide.  If
-<span class="lineNum">    2357 </span>                :        *  (io.flags() &amp; ios_base::adjustfield) == ios_base::left, result is
-<span class="lineNum">    2358 </span>                :        *  padded at the end.  If ios_base::internal, then padding occurs
-<span class="lineNum">    2359 </span>                :        *  immediately after either a '+' or '-' or after '0x' or '0X'.
-<span class="lineNum">    2360 </span>                :        *  Otherwise, padding occurs at the beginning.
-<span class="lineNum">    2361 </span>                :        *
-<span class="lineNum">    2362 </span>                :        *  @param  s  Stream to write to.
-<span class="lineNum">    2363 </span>                :        *  @param  io  Source of locale and flags.
-<span class="lineNum">    2364 </span>                :        *  @param  fill  Char_type to use for filling.
-<span class="lineNum">    2365 </span>                :        *  @param  v  Value to format and insert.
-<span class="lineNum">    2366 </span>                :        *  @return  Iterator after writing.
-<span class="lineNum">    2367 </span>                :       */
-<span class="lineNum">    2368 </span>                :       iter_type
-<span class="lineNum">    2369 </span>                :       put(iter_type __s, ios_base&amp; __f, char_type __fill, long __v) const
-<span class="lineNum">    2370 </span>                :       { return this-&gt;do_put(__s, __f, __fill, __v); }
-<span class="lineNum">    2371 </span>                : 
-<span class="lineNum">    2372 </span>                :       iter_type
-<span class="lineNum">    2373 </span>                :       put(iter_type __s, ios_base&amp; __f, char_type __fill,
-<span class="lineNum">    2374 </span>                :           unsigned long __v) const
-<span class="lineNum">    2375 </span>                :       { return this-&gt;do_put(__s, __f, __fill, __v); }
-<span class="lineNum">    2376 </span>                : 
-<span class="lineNum">    2377 </span>                : #ifdef _GLIBCXX_USE_LONG_LONG
-<span class="lineNum">    2378 </span>                :       iter_type
-<span class="lineNum">    2379 </span>                :       put(iter_type __s, ios_base&amp; __f, char_type __fill, long long __v) const
-<span class="lineNum">    2380 </span>                :       { return this-&gt;do_put(__s, __f, __fill, __v); }
-<span class="lineNum">    2381 </span>                : 
-<span class="lineNum">    2382 </span>                :       iter_type
-<span class="lineNum">    2383 </span>                :       put(iter_type __s, ios_base&amp; __f, char_type __fill,
-<span class="lineNum">    2384 </span>                :           unsigned long long __v) const
-<span class="lineNum">    2385 </span>                :       { return this-&gt;do_put(__s, __f, __fill, __v); }
-<span class="lineNum">    2386 </span>                : #endif
-<span class="lineNum">    2387 </span>                :       //@}
-<span class="lineNum">    2388 </span>                : 
-<span class="lineNum">    2389 </span>                :       //@{
-<span class="lineNum">    2390 </span>                :       /**
-<span class="lineNum">    2391 </span>                :        *  @brief  Numeric formatting.
-<span class="lineNum">    2392 </span>                :        *
-<span class="lineNum">    2393 </span>                :        *  Formats the floating point value @a v and inserts it into a stream.
-<span class="lineNum">    2394 </span>                :        *  It does so by calling num_put::do_put().
-<span class="lineNum">    2395 </span>                :        *
-<span class="lineNum">    2396 </span>                :        *  Formatting is affected by the flag settings in @a io.
-<span class="lineNum">    2397 </span>                :        *
-<span class="lineNum">    2398 </span>                :        *  The basic format is affected by the value of io.flags() &amp;
-<span class="lineNum">    2399 </span>                :        *  ios_base::floatfield.  If equal to ios_base::fixed, formats like the
-<span class="lineNum">    2400 </span>                :        *  printf %f specifier.  Else if equal to ios_base::scientific, formats
-<span class="lineNum">    2401 </span>                :        *  like %e or %E with ios_base::uppercase unset or set respectively.
-<span class="lineNum">    2402 </span>                :        *  Otherwise, formats like %g or %G depending on uppercase.  Note that
-<span class="lineNum">    2403 </span>                :        *  if both fixed and scientific are set, the effect will also be like
-<span class="lineNum">    2404 </span>                :        *  %g or %G.
-<span class="lineNum">    2405 </span>                :        *
-<span class="lineNum">    2406 </span>                :        *  The output precision is given by io.precision().  This precision is
-<span class="lineNum">    2407 </span>                :        *  capped at numeric_limits::digits10 + 2 (different for double and
-<span class="lineNum">    2408 </span>                :        *  long double).  The default precision is 6.
-<span class="lineNum">    2409 </span>                :        *
-<span class="lineNum">    2410 </span>                :        *  If ios_base::showpos is set, '+' is output before positive values.
-<span class="lineNum">    2411 </span>                :        *  If ios_base::showpoint is set, a decimal point will always be
-<span class="lineNum">    2412 </span>                :        *  output.
-<span class="lineNum">    2413 </span>                :        *
-<span class="lineNum">    2414 </span>                :        *  Thousands separators are inserted according to numpunct::grouping()
-<span class="lineNum">    2415 </span>                :        *  and numpunct::thousands_sep().  The decimal point character used is
-<span class="lineNum">    2416 </span>                :        *  numpunct::decimal_point().
-<span class="lineNum">    2417 </span>                :        *
-<span class="lineNum">    2418 </span>                :        *  If io.width() is non-zero, enough @a fill characters are inserted to
-<span class="lineNum">    2419 </span>                :        *  make the result at least that wide.  If
-<span class="lineNum">    2420 </span>                :        *  (io.flags() &amp; ios_base::adjustfield) == ios_base::left, result is
-<span class="lineNum">    2421 </span>                :        *  padded at the end.  If ios_base::internal, then padding occurs
-<span class="lineNum">    2422 </span>                :        *  immediately after either a '+' or '-' or after '0x' or '0X'.
-<span class="lineNum">    2423 </span>                :        *  Otherwise, padding occurs at the beginning.
-<span class="lineNum">    2424 </span>                :        *
-<span class="lineNum">    2425 </span>                :        *  @param  s  Stream to write to.
-<span class="lineNum">    2426 </span>                :        *  @param  io  Source of locale and flags.
-<span class="lineNum">    2427 </span>                :        *  @param  fill  Char_type to use for filling.
-<span class="lineNum">    2428 </span>                :        *  @param  v  Value to format and insert.
-<span class="lineNum">    2429 </span>                :        *  @return  Iterator after writing.
-<span class="lineNum">    2430 </span>                :       */
-<span class="lineNum">    2431 </span>                :       iter_type
-<span class="lineNum">    2432 </span>                :       put(iter_type __s, ios_base&amp; __f, char_type __fill, double __v) const
-<span class="lineNum">    2433 </span>                :       { return this-&gt;do_put(__s, __f, __fill, __v); }
-<span class="lineNum">    2434 </span>                : 
-<span class="lineNum">    2435 </span>                :       iter_type
-<span class="lineNum">    2436 </span>                :       put(iter_type __s, ios_base&amp; __f, char_type __fill,
-<span class="lineNum">    2437 </span>                :           long double __v) const
-<span class="lineNum">    2438 </span>                :       { return this-&gt;do_put(__s, __f, __fill, __v); }
-<span class="lineNum">    2439 </span>                :       //@}
-<span class="lineNum">    2440 </span>                : 
-<span class="lineNum">    2441 </span>                :       /**
-<span class="lineNum">    2442 </span>                :        *  @brief  Numeric formatting.
-<span class="lineNum">    2443 </span>                :        *
-<span class="lineNum">    2444 </span>                :        *  Formats the pointer value @a v and inserts it into a stream.  It
-<span class="lineNum">    2445 </span>                :        *  does so by calling num_put::do_put().
-<span class="lineNum">    2446 </span>                :        *
-<span class="lineNum">    2447 </span>                :        *  This function formats @a v as an unsigned long with ios_base::hex
-<span class="lineNum">    2448 </span>                :        *  and ios_base::showbase set.
-<span class="lineNum">    2449 </span>                :        *
-<span class="lineNum">    2450 </span>                :        *  @param  s  Stream to write to.
-<span class="lineNum">    2451 </span>                :        *  @param  io  Source of locale and flags.
-<span class="lineNum">    2452 </span>                :        *  @param  fill  Char_type to use for filling.
-<span class="lineNum">    2453 </span>                :        *  @param  v  Value to format and insert.
-<span class="lineNum">    2454 </span>                :        *  @return  Iterator after writing.
-<span class="lineNum">    2455 </span>                :       */
-<span class="lineNum">    2456 </span>                :       iter_type
-<span class="lineNum">    2457 </span>                :       put(iter_type __s, ios_base&amp; __f, char_type __fill,
-<span class="lineNum">    2458 </span>                :           const void* __v) const
-<span class="lineNum">    2459 </span>                :       { return this-&gt;do_put(__s, __f, __fill, __v); }
-<span class="lineNum">    2460 </span>                : 
-<span class="lineNum">    2461 </span>                :     protected:
-<span class="lineNum">    2462 </span>                :       template&lt;typename _ValueT&gt;
-<span class="lineNum">    2463 </span>                :         iter_type
-<span class="lineNum">    2464 </span>                :         _M_insert_float(iter_type, ios_base&amp; __io, char_type __fill,
-<span class="lineNum">    2465 </span>                :                         char __mod, _ValueT __v) const;
-<span class="lineNum">    2466 </span>                : 
-<span class="lineNum">    2467 </span>                :       void
-<span class="lineNum">    2468 </span>                :       _M_group_float(const char* __grouping, size_t __grouping_size,
-<span class="lineNum">    2469 </span>                :                      char_type __sep, const char_type* __p, char_type* __new,
-<span class="lineNum">    2470 </span>                :                      char_type* __cs, int&amp; __len) const;
-<span class="lineNum">    2471 </span>                : 
-<span class="lineNum">    2472 </span>                :       template&lt;typename _ValueT&gt;
-<span class="lineNum">    2473 </span>                :         iter_type
-<span class="lineNum">    2474 </span>                :         _M_insert_int(iter_type, ios_base&amp; __io, char_type __fill,
-<span class="lineNum">    2475 </span>                :                       _ValueT __v) const;
-<span class="lineNum">    2476 </span>                : 
-<span class="lineNum">    2477 </span>                :       void
-<span class="lineNum">    2478 </span>                :       _M_group_int(const char* __grouping, size_t __grouping_size,
-<span class="lineNum">    2479 </span>                :                    char_type __sep, ios_base&amp; __io, char_type* __new,
-<span class="lineNum">    2480 </span>                :                    char_type* __cs, int&amp; __len) const;
-<span class="lineNum">    2481 </span>                : 
-<span class="lineNum">    2482 </span>                :       void
-<span class="lineNum">    2483 </span>                :       _M_pad(char_type __fill, streamsize __w, ios_base&amp; __io,
-<span class="lineNum">    2484 </span>                :              char_type* __new, const char_type* __cs, int&amp; __len) const;
-<span class="lineNum">    2485 </span>                : 
-<span class="lineNum">    2486 </span>                :       /// Destructor.
-<span class="lineNum">    2487 </span>                :       virtual
-<span class="lineNum">    2488 </span>                :       ~num_put() { };
-<span class="lineNum">    2489 </span>                : 
-<span class="lineNum">    2490 </span>                :       //@{
-<span class="lineNum">    2491 </span>                :       /**
-<span class="lineNum">    2492 </span>                :        *  @brief  Numeric formatting.
-<span class="lineNum">    2493 </span>                :        *
-<span class="lineNum">    2494 </span>                :        *  These functions do the work of formatting numeric values and
-<span class="lineNum">    2495 </span>                :        *  inserting them into a stream. This function is a hook for derived
-<span class="lineNum">    2496 </span>                :        *  classes to change the value returned.
-<span class="lineNum">    2497 </span>                :        *
-<span class="lineNum">    2498 </span>                :        *  @param  s  Stream to write to.
-<span class="lineNum">    2499 </span>                :        *  @param  io  Source of locale and flags.
-<span class="lineNum">    2500 </span>                :        *  @param  fill  Char_type to use for filling.
-<span class="lineNum">    2501 </span>                :        *  @param  v  Value to format and insert.
-<span class="lineNum">    2502 </span>                :        *  @return  Iterator after writing.
-<span class="lineNum">    2503 </span>                :       */
-<span class="lineNum">    2504 </span>                :       virtual iter_type
-<span class="lineNum">    2505 </span>                :       do_put(iter_type, ios_base&amp;, char_type __fill, bool __v) const;
-<span class="lineNum">    2506 </span>                : 
-<span class="lineNum">    2507 </span>                :       virtual iter_type
-<span class="lineNum">    2508 </span>                :       do_put(iter_type, ios_base&amp;, char_type __fill, long __v) const;
-<span class="lineNum">    2509 </span>                : 
-<span class="lineNum">    2510 </span>                :       virtual iter_type
-<span class="lineNum">    2511 </span>                :       do_put(iter_type, ios_base&amp;, char_type __fill, unsigned long) const;
-<span class="lineNum">    2512 </span>                : 
-<span class="lineNum">    2513 </span>                : #ifdef _GLIBCXX_USE_LONG_LONG
-<span class="lineNum">    2514 </span>                :       virtual iter_type
-<span class="lineNum">    2515 </span>                :       do_put(iter_type, ios_base&amp;, char_type __fill, long long __v) const;
-<span class="lineNum">    2516 </span>                : 
-<span class="lineNum">    2517 </span>                :       virtual iter_type
-<span class="lineNum">    2518 </span>                :       do_put(iter_type, ios_base&amp;, char_type __fill, unsigned long long) const;
-<span class="lineNum">    2519 </span>                : #endif
-<span class="lineNum">    2520 </span>                : 
-<span class="lineNum">    2521 </span>                :       virtual iter_type
-<span class="lineNum">    2522 </span>                :       do_put(iter_type, ios_base&amp;, char_type __fill, double __v) const;
-<span class="lineNum">    2523 </span>                : 
-<span class="lineNum">    2524 </span>                :       // XXX GLIBCXX_ABI Deprecated
-<span class="lineNum">    2525 </span>                : #if defined _GLIBCXX_LONG_DOUBLE_COMPAT &amp;&amp; defined __LONG_DOUBLE_128__
-<span class="lineNum">    2526 </span>                :       virtual iter_type
-<span class="lineNum">    2527 </span>                :       __do_put(iter_type, ios_base&amp;, char_type __fill, double __v) const;
-<span class="lineNum">    2528 </span>                : #else
-<span class="lineNum">    2529 </span>                :       virtual iter_type
-<span class="lineNum">    2530 </span>                :       do_put(iter_type, ios_base&amp;, char_type __fill, long double __v) const;
-<span class="lineNum">    2531 </span>                : #endif
-<span class="lineNum">    2532 </span>                : 
-<span class="lineNum">    2533 </span>                :       virtual iter_type
-<span class="lineNum">    2534 </span>                :       do_put(iter_type, ios_base&amp;, char_type __fill, const void* __v) const;
-<span class="lineNum">    2535 </span>                : 
-<span class="lineNum">    2536 </span>                :       // XXX GLIBCXX_ABI Deprecated
-<span class="lineNum">    2537 </span>                : #if defined _GLIBCXX_LONG_DOUBLE_COMPAT &amp;&amp; defined __LONG_DOUBLE_128__
-<span class="lineNum">    2538 </span>                :       virtual iter_type
-<span class="lineNum">    2539 </span>                :       do_put(iter_type, ios_base&amp;, char_type __fill, long double __v) const;
-<span class="lineNum">    2540 </span>                : #endif
-<span class="lineNum">    2541 </span>                :       //@}
-<span class="lineNum">    2542 </span>                :     };
-<span class="lineNum">    2543 </span>                : 
-<span class="lineNum">    2544 </span>                :   template &lt;typename _CharT, typename _OutIter&gt;
-<span class="lineNum">    2545 </span>                :     locale::id num_put&lt;_CharT, _OutIter&gt;::id;
-<span class="lineNum">    2546 </span>                : 
-<span class="lineNum">    2547 </span>                : _GLIBCXX_END_LDBL_NAMESPACE
-<span class="lineNum">    2548 </span>                : 
-<span class="lineNum">    2549 </span>                :   // Subclause convenience interfaces, inlines.
-<span class="lineNum">    2550 </span>                :   // NB: These are inline because, when used in a loop, some compilers
-<span class="lineNum">    2551 </span>                :   // can hoist the body out of the loop; then it's just as fast as the
-<span class="lineNum">    2552 </span>                :   // C is*() function.
-<span class="lineNum">    2553 </span>                : 
-<span class="lineNum">    2554 </span>                :   /// Convenience interface to ctype.is(ctype_base::space, __c).
-<span class="lineNum">    2555 </span>                :   template&lt;typename _CharT&gt;
-<span class="lineNum">    2556 </span>                :     inline bool
-<span class="lineNum">    2557 </span>                :     isspace(_CharT __c, const locale&amp; __loc)
-<span class="lineNum">    2558 </span>                :     { return use_facet&lt;ctype&lt;_CharT&gt; &gt;(__loc).is(ctype_base::space, __c); }
-<span class="lineNum">    2559 </span>                : 
-<span class="lineNum">    2560 </span>                :   /// Convenience interface to ctype.is(ctype_base::print, __c).
-<span class="lineNum">    2561 </span>                :   template&lt;typename _CharT&gt;
-<span class="lineNum">    2562 </span>                :     inline bool
-<span class="lineNum">    2563 </span>                :     isprint(_CharT __c, const locale&amp; __loc)
-<span class="lineNum">    2564 </span>                :     { return use_facet&lt;ctype&lt;_CharT&gt; &gt;(__loc).is(ctype_base::print, __c); }
-<span class="lineNum">    2565 </span>                : 
-<span class="lineNum">    2566 </span>                :   /// Convenience interface to ctype.is(ctype_base::cntrl, __c).
-<span class="lineNum">    2567 </span>                :   template&lt;typename _CharT&gt;
-<span class="lineNum">    2568 </span>                :     inline bool
-<span class="lineNum">    2569 </span>                :     iscntrl(_CharT __c, const locale&amp; __loc)
-<span class="lineNum">    2570 </span>                :     { return use_facet&lt;ctype&lt;_CharT&gt; &gt;(__loc).is(ctype_base::cntrl, __c); }
-<span class="lineNum">    2571 </span>                : 
-<span class="lineNum">    2572 </span>                :   /// Convenience interface to ctype.is(ctype_base::upper, __c).
-<span class="lineNum">    2573 </span>                :   template&lt;typename _CharT&gt;
-<span class="lineNum">    2574 </span>                :     inline bool
-<span class="lineNum">    2575 </span>                :     isupper(_CharT __c, const locale&amp; __loc)
-<span class="lineNum">    2576 </span>                :     { return use_facet&lt;ctype&lt;_CharT&gt; &gt;(__loc).is(ctype_base::upper, __c); }
-<span class="lineNum">    2577 </span>                : 
-<span class="lineNum">    2578 </span>                :   /// Convenience interface to ctype.is(ctype_base::lower, __c).
-<span class="lineNum">    2579 </span>                :   template&lt;typename _CharT&gt;
-<span class="lineNum">    2580 </span>                :     inline bool 
-<span class="lineNum">    2581 </span>                :     islower(_CharT __c, const locale&amp; __loc)
-<span class="lineNum">    2582 </span>                :     { return use_facet&lt;ctype&lt;_CharT&gt; &gt;(__loc).is(ctype_base::lower, __c); }
-<span class="lineNum">    2583 </span>                : 
-<span class="lineNum">    2584 </span>                :   /// Convenience interface to ctype.is(ctype_base::alpha, __c).
-<span class="lineNum">    2585 </span>                :   template&lt;typename _CharT&gt;
-<span class="lineNum">    2586 </span>                :     inline bool
-<span class="lineNum">    2587 </span>                :     isalpha(_CharT __c, const locale&amp; __loc)
-<span class="lineNum">    2588 </span>                :     { return use_facet&lt;ctype&lt;_CharT&gt; &gt;(__loc).is(ctype_base::alpha, __c); }
-<span class="lineNum">    2589 </span>                : 
-<span class="lineNum">    2590 </span>                :   /// Convenience interface to ctype.is(ctype_base::digit, __c).
-<span class="lineNum">    2591 </span>                :   template&lt;typename _CharT&gt;
-<span class="lineNum">    2592 </span>                :     inline bool
-<span class="lineNum">    2593 </span>                :     isdigit(_CharT __c, const locale&amp; __loc)
-<span class="lineNum">    2594 </span>                :     { return use_facet&lt;ctype&lt;_CharT&gt; &gt;(__loc).is(ctype_base::digit, __c); }
-<span class="lineNum">    2595 </span>                : 
-<span class="lineNum">    2596 </span>                :   /// Convenience interface to ctype.is(ctype_base::punct, __c).
-<span class="lineNum">    2597 </span>                :   template&lt;typename _CharT&gt;
-<span class="lineNum">    2598 </span>                :     inline bool
-<span class="lineNum">    2599 </span>                :     ispunct(_CharT __c, const locale&amp; __loc)
-<span class="lineNum">    2600 </span>                :     { return use_facet&lt;ctype&lt;_CharT&gt; &gt;(__loc).is(ctype_base::punct, __c); }
-<span class="lineNum">    2601 </span>                : 
-<span class="lineNum">    2602 </span>                :   /// Convenience interface to ctype.is(ctype_base::xdigit, __c).
-<span class="lineNum">    2603 </span>                :   template&lt;typename _CharT&gt;
-<span class="lineNum">    2604 </span>                :     inline bool
-<span class="lineNum">    2605 </span>                :     isxdigit(_CharT __c, const locale&amp; __loc)
-<span class="lineNum">    2606 </span>                :     { return use_facet&lt;ctype&lt;_CharT&gt; &gt;(__loc).is(ctype_base::xdigit, __c); }
-<span class="lineNum">    2607 </span>                : 
-<span class="lineNum">    2608 </span>                :   /// Convenience interface to ctype.is(ctype_base::alnum, __c).
-<span class="lineNum">    2609 </span>                :   template&lt;typename _CharT&gt;
-<span class="lineNum">    2610 </span>                :     inline bool
-<span class="lineNum">    2611 </span>                :     isalnum(_CharT __c, const locale&amp; __loc)
-<span class="lineNum">    2612 </span>                :     { return use_facet&lt;ctype&lt;_CharT&gt; &gt;(__loc).is(ctype_base::alnum, __c); }
-<span class="lineNum">    2613 </span>                : 
-<span class="lineNum">    2614 </span>                :   /// Convenience interface to ctype.is(ctype_base::graph, __c).
-<span class="lineNum">    2615 </span>                :   template&lt;typename _CharT&gt;
-<span class="lineNum">    2616 </span>                :     inline bool
-<span class="lineNum">    2617 </span>                :     isgraph(_CharT __c, const locale&amp; __loc)
-<span class="lineNum">    2618 </span>                :     { return use_facet&lt;ctype&lt;_CharT&gt; &gt;(__loc).is(ctype_base::graph, __c); }
-<span class="lineNum">    2619 </span>                : 
-<span class="lineNum">    2620 </span>                :   /// Convenience interface to ctype.toupper(__c).
-<span class="lineNum">    2621 </span>                :   template&lt;typename _CharT&gt;
-<span class="lineNum">    2622 </span>                :     inline _CharT
-<span class="lineNum">    2623 </span>                :     toupper(_CharT __c, const locale&amp; __loc)
-<span class="lineNum">    2624 </span>                :     { return use_facet&lt;ctype&lt;_CharT&gt; &gt;(__loc).toupper(__c); }
-<span class="lineNum">    2625 </span>                : 
-<span class="lineNum">    2626 </span>                :   /// Convenience interface to ctype.tolower(__c).
-<span class="lineNum">    2627 </span>                :   template&lt;typename _CharT&gt;
-<span class="lineNum">    2628 </span>                :     inline _CharT
-<span class="lineNum">    2629 </span>                :     tolower(_CharT __c, const locale&amp; __loc)
-<span class="lineNum">    2630 </span>                :     { return use_facet&lt;ctype&lt;_CharT&gt; &gt;(__loc).tolower(__c); }
-<span class="lineNum">    2631 </span>                : 
-<span class="lineNum">    2632 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">    2633 </span>                : 
-<span class="lineNum">    2634 </span>                : #ifndef _GLIBCXX_EXPORT_TEMPLATE
-<span class="lineNum">    2635 </span>                : # include &lt;bits/locale_facets.tcc&gt;
-<span class="lineNum">    2636 </span>                : #endif
-<span class="lineNum">    2637 </span>                : 
-<span class="lineNum">    2638 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/bits/postypes.h.gcov.html b/rep/usr/include/c++/4.3/bits/postypes.h.gcov.html
deleted file mode 100644
index 9775ab9..0000000
--- a/rep/usr/include/c++/4.3/bits/postypes.h.gcov.html
+++ /dev/null
@@ -1,280 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/postypes.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - postypes.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">3</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">0.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">0</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // Position types -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005,
-<span class="lineNum">       4 </span>                : // 2006, 2007, 2008
-<span class="lineNum">       5 </span>                : // Free Software Foundation, Inc.
-<span class="lineNum">       6 </span>                : //
-<span class="lineNum">       7 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       8 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       9 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">      10 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      11 </span>                : // any later version.
-<span class="lineNum">      12 </span>                : 
-<span class="lineNum">      13 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      14 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      15 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      16 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      17 </span>                : 
-<span class="lineNum">      18 </span>                : // You should have received a copy of the GNU General Public License along
-<span class="lineNum">      19 </span>                : // with this library; see the file COPYING.  If not, write to the Free
-<span class="lineNum">      20 </span>                : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-<span class="lineNum">      21 </span>                : // USA.
-<span class="lineNum">      22 </span>                : 
-<span class="lineNum">      23 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      24 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      25 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      26 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      27 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      28 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      29 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      30 </span>                : // the GNU General Public License.
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span>                : /** @file postypes.h
-<span class="lineNum">      33 </span>                :  *  This is an internal header file, included by other library headers.
-<span class="lineNum">      34 </span>                :  *  You should not attempt to use it directly.
-<span class="lineNum">      35 </span>                :  */
-<span class="lineNum">      36 </span>                : 
-<span class="lineNum">      37 </span>                : //
-<span class="lineNum">      38 </span>                : // ISO C++ 14882: 27.4.1 - Types
-<span class="lineNum">      39 </span>                : // ISO C++ 14882: 27.4.3 - Template class fpos
-<span class="lineNum">      40 </span>                : //
-<span class="lineNum">      41 </span>                : 
-<span class="lineNum">      42 </span>                : #ifndef _GLIBCXX_POSTYPES_H
-<span class="lineNum">      43 </span>                : #define _GLIBCXX_POSTYPES_H 1
-<span class="lineNum">      44 </span>                : 
-<span class="lineNum">      45 </span>                : #pragma GCC system_header
-<span class="lineNum">      46 </span>                : 
-<span class="lineNum">      47 </span>                : #include &lt;cwchar&gt; // For mbstate_t
-<span class="lineNum">      48 </span>                : 
-<span class="lineNum">      49 </span>                : #ifdef _GLIBCXX_HAVE_STDINT_H
-<span class="lineNum">      50 </span>                : #include &lt;stdint.h&gt; // For int64_t
-<span class="lineNum">      51 </span>                : #endif
-<span class="lineNum">      52 </span>                : 
-<span class="lineNum">      53 </span>                : _GLIBCXX_BEGIN_NAMESPACE(std)
-<span class="lineNum">      54 </span>                : 
-<span class="lineNum">      55 </span>                :   // The types streamoff, streampos and wstreampos and the class
-<span class="lineNum">      56 </span>                :   // template fpos&lt;&gt; are described in clauses 21.1.2, 21.1.3, 27.1.2,
-<span class="lineNum">      57 </span>                :   // 27.2, 27.4.1, 27.4.3 and D.6. Despite all this verbiage, the
-<span class="lineNum">      58 </span>                :   // behaviour of these types is mostly implementation defined or
-<span class="lineNum">      59 </span>                :   // unspecified. The behaviour in this implementation is as noted
-<span class="lineNum">      60 </span>                :   // below.
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span>                :   /**
-<span class="lineNum">      63 </span>                :    *  @brief  Type used by fpos, char_traits&lt;char&gt;, and char_traits&lt;wchar_t&gt;.
-<span class="lineNum">      64 </span>                :    *
-<span class="lineNum">      65 </span>                :    *  In clauses 21.1.3.1 and 27.4.1 streamoff is described as an
-<span class="lineNum">      66 </span>                :    *  implementation defined type.
-<span class="lineNum">      67 </span>                :    *  Note: In versions of GCC up to and including GCC 3.3, streamoff
-<span class="lineNum">      68 </span>                :    *  was typedef long.
-<span class="lineNum">      69 </span>                :   */  
-<span class="lineNum">      70 </span>                : #ifdef _GLIBCXX_HAVE_INT64_T
-<span class="lineNum">      71 </span>                :   typedef int64_t       streamoff;
-<span class="lineNum">      72 </span>                : #else
-<span class="lineNum">      73 </span>                :   typedef long long     streamoff;
-<span class="lineNum">      74 </span>                : #endif
-<span class="lineNum">      75 </span>                : 
-<span class="lineNum">      76 </span>                :   /// Integral type for I/O operation counts and buffer sizes.
-<span class="lineNum">      77 </span>                :   typedef ptrdiff_t     streamsize; // Signed integral type
-<span class="lineNum">      78 </span>                : 
-<span class="lineNum">      79 </span>                :   /**
-<span class="lineNum">      80 </span>                :    *  @brief  Class representing stream positions.
-<span class="lineNum">      81 </span>                :    *
-<span class="lineNum">      82 </span>                :    *  The standard places no requirements upon the template parameter StateT.
-<span class="lineNum">      83 </span>                :    *  In this implementation StateT must be DefaultConstructible,
-<span class="lineNum">      84 </span>                :    *  CopyConstructible and Assignable.  The standard only requires that fpos
-<span class="lineNum">      85 </span>                :    *  should contain a member of type StateT. In this implementation it also
-<span class="lineNum">      86 </span>                :    *  contains an offset stored as a signed integer.
-<span class="lineNum">      87 </span>                :    *
-<span class="lineNum">      88 </span>                :    *  @param  StateT  Type passed to and returned from state().
-<span class="lineNum">      89 </span>                :    */
-<span class="lineNum">      90 </span>                :   template&lt;typename _StateT&gt;
-<span class="lineNum">      91 </span>                :     class fpos
-<span class="lineNum">      92 </span>                :     {
-<span class="lineNum">      93 </span>                :     private:
-<span class="lineNum">      94 </span>                :       streamoff                 _M_off;
-<span class="lineNum">      95 </span>                :       _StateT                   _M_state;
-<span class="lineNum">      96 </span>                : 
-<span class="lineNum">      97 </span>                :     public:
-<span class="lineNum">      98 </span>                :       // The standard doesn't require that fpos objects can be default
-<span class="lineNum">      99 </span>                :       // constructed. This implementation provides a default
-<span class="lineNum">     100 </span>                :       // constructor that initializes the offset to 0 and default
-<span class="lineNum">     101 </span>                :       // constructs the state.
-<span class="lineNum">     102 </span>                :       fpos()
-<span class="lineNum">     103 </span>                :       : _M_off(0), _M_state() { }
-<span class="lineNum">     104 </span>                : 
-<span class="lineNum">     105 </span>                :       // The standard requires that fpos objects can be constructed
-<span class="lineNum">     106 </span>                :       // from streamoff objects using the constructor syntax, and
-<span class="lineNum">     107 </span>                :       // fails to give any meaningful semantics. In this
-<span class="lineNum">     108 </span>                :       // implementation implicit conversion is also allowed, and this
-<span class="lineNum">     109 </span>                :       // constructor stores the streamoff as the offset and default
-<span class="lineNum">     110 </span>                :       // constructs the state.
-<span class="lineNum">     111 </span>                :       /// Construct position from offset.
-<span class="lineNum">     112 </span><span class="lineNoCov">              0 :       fpos(streamoff __off)</span>
-<span class="lineNum">     113 </span><span class="lineNoCov">              0 :       : _M_off(__off), _M_state() { }</span>
-<span class="lineNum">     114 </span>                : 
-<span class="lineNum">     115 </span>                :       /// Convert to streamoff.
-<span class="lineNum">     116 </span><span class="lineNoCov">              0 :       operator streamoff() const { return _M_off; }</span>
-<span class="lineNum">     117 </span>                : 
-<span class="lineNum">     118 </span>                :       /// Remember the value of @a st.
-<span class="lineNum">     119 </span>                :       void
-<span class="lineNum">     120 </span>                :       state(_StateT __st)
-<span class="lineNum">     121 </span>                :       { _M_state = __st; }
-<span class="lineNum">     122 </span>                : 
-<span class="lineNum">     123 </span>                :       /// Return the last set value of @a st.
-<span class="lineNum">     124 </span>                :       _StateT
-<span class="lineNum">     125 </span>                :       state() const
-<span class="lineNum">     126 </span>                :       { return _M_state; }
-<span class="lineNum">     127 </span>                : 
-<span class="lineNum">     128 </span>                :       // The standard requires that this operator must be defined, but
-<span class="lineNum">     129 </span>                :       // gives no semantics. In this implementation it just adds its
-<span class="lineNum">     130 </span>                :       // argument to the stored offset and returns *this.
-<span class="lineNum">     131 </span>                :       /// Add offset to this position.
-<span class="lineNum">     132 </span>                :       fpos&amp;
-<span class="lineNum">     133 </span>                :       operator+=(streamoff __off)
-<span class="lineNum">     134 </span>                :       {
-<span class="lineNum">     135 </span>                :         _M_off += __off;
-<span class="lineNum">     136 </span>                :         return *this;
-<span class="lineNum">     137 </span>                :       }
-<span class="lineNum">     138 </span>                : 
-<span class="lineNum">     139 </span>                :       // The standard requires that this operator must be defined, but
-<span class="lineNum">     140 </span>                :       // gives no semantics. In this implementation it just subtracts
-<span class="lineNum">     141 </span>                :       // its argument from the stored offset and returns *this.
-<span class="lineNum">     142 </span>                :       /// Subtract offset from this position.
-<span class="lineNum">     143 </span>                :       fpos&amp;
-<span class="lineNum">     144 </span>                :       operator-=(streamoff __off)
-<span class="lineNum">     145 </span>                :       {
-<span class="lineNum">     146 </span>                :         _M_off -= __off;
-<span class="lineNum">     147 </span>                :         return *this;
-<span class="lineNum">     148 </span>                :       }
-<span class="lineNum">     149 </span>                : 
-<span class="lineNum">     150 </span>                :       // The standard requires that this operator must be defined, but
-<span class="lineNum">     151 </span>                :       // defines its semantics only in terms of operator-. In this
-<span class="lineNum">     152 </span>                :       // implementation it constructs a copy of *this, adds the
-<span class="lineNum">     153 </span>                :       // argument to that copy using operator+= and then returns the
-<span class="lineNum">     154 </span>                :       // copy.
-<span class="lineNum">     155 </span>                :       /// Add position and offset.
-<span class="lineNum">     156 </span>                :       fpos
-<span class="lineNum">     157 </span>                :       operator+(streamoff __off) const
-<span class="lineNum">     158 </span>                :       {
-<span class="lineNum">     159 </span>                :         fpos __pos(*this);
-<span class="lineNum">     160 </span>                :         __pos += __off;
-<span class="lineNum">     161 </span>                :         return __pos;
-<span class="lineNum">     162 </span>                :       }
-<span class="lineNum">     163 </span>                : 
-<span class="lineNum">     164 </span>                :       // The standard requires that this operator must be defined, but
-<span class="lineNum">     165 </span>                :       // defines its semantics only in terms of operator+. In this
-<span class="lineNum">     166 </span>                :       // implementation it constructs a copy of *this, subtracts the
-<span class="lineNum">     167 </span>                :       // argument from that copy using operator-= and then returns the
-<span class="lineNum">     168 </span>                :       // copy.
-<span class="lineNum">     169 </span>                :       /// Subtract offset from position.
-<span class="lineNum">     170 </span>                :       fpos
-<span class="lineNum">     171 </span>                :       operator-(streamoff __off) const
-<span class="lineNum">     172 </span>                :       {
-<span class="lineNum">     173 </span>                :         fpos __pos(*this);
-<span class="lineNum">     174 </span>                :         __pos -= __off;
-<span class="lineNum">     175 </span>                :         return __pos;
-<span class="lineNum">     176 </span>                :       }
-<span class="lineNum">     177 </span>                : 
-<span class="lineNum">     178 </span>                :       // The standard requires that this operator must be defined, but
-<span class="lineNum">     179 </span>                :       // defines its semantics only in terms of operator+. In this
-<span class="lineNum">     180 </span>                :       // implementation it returns the difference between the offset
-<span class="lineNum">     181 </span>                :       // stored in *this and in the argument.
-<span class="lineNum">     182 </span>                :       /// Subtract position to return offset.
-<span class="lineNum">     183 </span>                :       streamoff
-<span class="lineNum">     184 </span>                :       operator-(const fpos&amp; __other) const
-<span class="lineNum">     185 </span>                :       { return _M_off - __other._M_off; }
-<span class="lineNum">     186 </span>                :     };
-<span class="lineNum">     187 </span>                : 
-<span class="lineNum">     188 </span>                :   // The standard only requires that operator== must be an
-<span class="lineNum">     189 </span>                :   // equivalence relation. In this implementation two fpos&lt;StateT&gt;
-<span class="lineNum">     190 </span>                :   // objects belong to the same equivalence class if the contained
-<span class="lineNum">     191 </span>                :   // offsets compare equal.
-<span class="lineNum">     192 </span>                :   /// Test if equivalent to another position.
-<span class="lineNum">     193 </span>                :   template&lt;typename _StateT&gt;
-<span class="lineNum">     194 </span>                :     inline bool
-<span class="lineNum">     195 </span>                :     operator==(const fpos&lt;_StateT&gt;&amp; __lhs, const fpos&lt;_StateT&gt;&amp; __rhs)
-<span class="lineNum">     196 </span>                :     { return streamoff(__lhs) == streamoff(__rhs); }
-<span class="lineNum">     197 </span>                : 
-<span class="lineNum">     198 </span>                :   template&lt;typename _StateT&gt;
-<span class="lineNum">     199 </span>                :     inline bool
-<span class="lineNum">     200 </span>                :     operator!=(const fpos&lt;_StateT&gt;&amp; __lhs, const fpos&lt;_StateT&gt;&amp; __rhs)
-<span class="lineNum">     201 </span>                :     { return streamoff(__lhs) != streamoff(__rhs); }
-<span class="lineNum">     202 </span>                : 
-<span class="lineNum">     203 </span>                :   // Clauses 21.1.3.1 and 21.1.3.2 describe streampos and wstreampos
-<span class="lineNum">     204 </span>                :   // as implementation defined types, but clause 27.2 requires that
-<span class="lineNum">     205 </span>                :   // they must both be typedefs for fpos&lt;mbstate_t&gt;
-<span class="lineNum">     206 </span>                :   /// File position for char streams.
-<span class="lineNum">     207 </span>                :   typedef fpos&lt;mbstate_t&gt; streampos;
-<span class="lineNum">     208 </span>                :   /// File position for wchar_t streams.
-<span class="lineNum">     209 </span>                :   typedef fpos&lt;mbstate_t&gt; wstreampos;
-<span class="lineNum">     210 </span>                : 
-<span class="lineNum">     211 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">     212 </span>                : 
-<span class="lineNum">     213 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/bits/stl_algo.h.gcov.html b/rep/usr/include/c++/4.3/bits/stl_algo.h.gcov.html
deleted file mode 100644
index bb0c409..0000000
--- a/rep/usr/include/c++/4.3/bits/stl_algo.h.gcov.html
+++ /dev/null
@@ -1,5703 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_algo.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_algo.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">226</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">85.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">192</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // Algorithm implementation -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
-<span class="lineNum">       4 </span>                : // Free Software Foundation, Inc.
-<span class="lineNum">       5 </span>                : //
-<span class="lineNum">       6 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       7 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       8 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">       9 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      10 </span>                : // any later version.
-<span class="lineNum">      11 </span>                : 
-<span class="lineNum">      12 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      13 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      14 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      15 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      16 </span>                : 
-<span class="lineNum">      17 </span>                : // You should have received a copy of the GNU General Public License along
-<span class="lineNum">      18 </span>                : // with this library; see the file COPYING.  If not, write to the Free
-<span class="lineNum">      19 </span>                : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-<span class="lineNum">      20 </span>                : // USA.
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      23 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      24 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      25 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      26 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      27 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      28 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      29 </span>                : // the GNU General Public License.
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : /*
-<span class="lineNum">      32 </span>                :  *
-<span class="lineNum">      33 </span>                :  * Copyright (c) 1994
-<span class="lineNum">      34 </span>                :  * Hewlett-Packard Company
-<span class="lineNum">      35 </span>                :  *
-<span class="lineNum">      36 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      37 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      38 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      39 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      40 </span>                :  * in supporting documentation.  Hewlett-Packard Company makes no
-<span class="lineNum">      41 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      42 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      43 </span>                :  *
-<span class="lineNum">      44 </span>                :  *
-<span class="lineNum">      45 </span>                :  * Copyright (c) 1996
-<span class="lineNum">      46 </span>                :  * Silicon Graphics Computer Systems, Inc.
-<span class="lineNum">      47 </span>                :  *
-<span class="lineNum">      48 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      49 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      50 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      51 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      52 </span>                :  * in supporting documentation.  Silicon Graphics makes no
-<span class="lineNum">      53 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      54 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      55 </span>                :  */
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span>                : /** @file stl_algo.h
-<span class="lineNum">      58 </span>                :  *  This is an internal header file, included by other library headers.
-<span class="lineNum">      59 </span>                :  *  You should not attempt to use it directly.
-<span class="lineNum">      60 </span>                :  */
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span>                : #ifndef _STL_ALGO_H
-<span class="lineNum">      63 </span>                : #define _STL_ALGO_H 1
-<span class="lineNum">      64 </span>                : 
-<span class="lineNum">      65 </span>                : #include &lt;cstdlib&gt;             // for rand
-<span class="lineNum">      66 </span>                : #include &lt;bits/algorithmfwd.h&gt;
-<span class="lineNum">      67 </span>                : #include &lt;bits/stl_heap.h&gt;
-<span class="lineNum">      68 </span>                : #include &lt;bits/stl_tempbuf.h&gt;  // for _Temporary_buffer
-<span class="lineNum">      69 </span>                : #include &lt;debug/debug.h&gt;
-<span class="lineNum">      70 </span>                : 
-<span class="lineNum">      71 </span>                : // See concept_check.h for the __glibcxx_*_requires macros.
-<span class="lineNum">      72 </span>                : 
-<span class="lineNum">      73 </span>                : _GLIBCXX_BEGIN_NAMESPACE(std)
-<span class="lineNum">      74 </span>                : 
-<span class="lineNum">      75 </span>                :   /**
-<span class="lineNum">      76 </span>                :    *  @brief Find the median of three values.
-<span class="lineNum">      77 </span>                :    *  @param  a  A value.
-<span class="lineNum">      78 </span>                :    *  @param  b  A value.
-<span class="lineNum">      79 </span>                :    *  @param  c  A value.
-<span class="lineNum">      80 </span>                :    *  @return One of @p a, @p b or @p c.
-<span class="lineNum">      81 </span>                :    *
-<span class="lineNum">      82 </span>                :    *  If @c {l,m,n} is some convolution of @p {a,b,c} such that @c l&lt;=m&lt;=n
-<span class="lineNum">      83 </span>                :    *  then the value returned will be @c m.
-<span class="lineNum">      84 </span>                :    *  This is an SGI extension.
-<span class="lineNum">      85 </span>                :    *  @ingroup SGIextensions
-<span class="lineNum">      86 </span>                :   */
-<span class="lineNum">      87 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">      88 </span>                :     inline const _Tp&amp;
-<span class="lineNum">      89 </span><span class="lineCov">            133 :     __median(const _Tp&amp; __a, const _Tp&amp; __b, const _Tp&amp; __c)</span>
-<span class="lineNum">      90 </span>                :     {
-<span class="lineNum">      91 </span>                :       // concept requirements
-<span class="lineNum">      92 </span>                :       __glibcxx_function_requires(_LessThanComparableConcept&lt;_Tp&gt;)
-<span class="lineNum">      93 </span><span class="lineCov">            133 :       if (__a &lt; __b)</span>
-<span class="lineNum">      94 </span><span class="lineCov">            132 :         if (__b &lt; __c)</span>
-<span class="lineNum">      95 </span><span class="lineCov">            132 :           return __b;</span>
-<span class="lineNum">      96 </span><span class="lineNoCov">              0 :         else if (__a &lt; __c)</span>
-<span class="lineNum">      97 </span><span class="lineNoCov">              0 :           return __c;</span>
-<span class="lineNum">      98 </span>                :         else
-<span class="lineNum">      99 </span><span class="lineNoCov">              0 :           return __a;</span>
-<span class="lineNum">     100 </span><span class="lineCov">              1 :       else if (__a &lt; __c)</span>
-<span class="lineNum">     101 </span><span class="lineNoCov">              0 :         return __a;</span>
-<span class="lineNum">     102 </span><span class="lineCov">              1 :       else if (__b &lt; __c)</span>
-<span class="lineNum">     103 </span><span class="lineNoCov">              0 :         return __c;</span>
-<span class="lineNum">     104 </span>                :       else
-<span class="lineNum">     105 </span><span class="lineCov">              1 :         return __b;</span>
-<span class="lineNum">     106 </span>                :     }
-<span class="lineNum">     107 </span>                : 
-<span class="lineNum">     108 </span>                :   /**
-<span class="lineNum">     109 </span>                :    *  @brief Find the median of three values using a predicate for comparison.
-<span class="lineNum">     110 </span>                :    *  @param  a     A value.
-<span class="lineNum">     111 </span>                :    *  @param  b     A value.
-<span class="lineNum">     112 </span>                :    *  @param  c     A value.
-<span class="lineNum">     113 </span>                :    *  @param  comp  A binary predicate.
-<span class="lineNum">     114 </span>                :    *  @return One of @p a, @p b or @p c.
-<span class="lineNum">     115 </span>                :    *
-<span class="lineNum">     116 </span>                :    *  If @c {l,m,n} is some convolution of @p {a,b,c} such that @p comp(l,m)
-<span class="lineNum">     117 </span>                :    *  and @p comp(m,n) are both true then the value returned will be @c m.
-<span class="lineNum">     118 </span>                :    *  This is an SGI extension.
-<span class="lineNum">     119 </span>                :    *  @ingroup SGIextensions
-<span class="lineNum">     120 </span>                :   */
-<span class="lineNum">     121 </span>                :   template&lt;typename _Tp, typename _Compare&gt;
-<span class="lineNum">     122 </span>                :     inline const _Tp&amp;
-<span class="lineNum">     123 </span><span class="lineCov">            710 :     __median(const _Tp&amp; __a, const _Tp&amp; __b, const _Tp&amp; __c, _Compare __comp)</span>
-<span class="lineNum">     124 </span>                :     {
-<span class="lineNum">     125 </span>                :       // concept requirements
-<span class="lineNum">     126 </span>                :       __glibcxx_function_requires(_BinaryFunctionConcept&lt;_Compare, bool,
-<span class="lineNum">     127 </span>                :                                                          _Tp, _Tp&gt;)
-<span class="lineNum">     128 </span><span class="lineCov">            710 :       if (__comp(__a, __b))</span>
-<span class="lineNum">     129 </span><span class="lineCov">            433 :         if (__comp(__b, __c))</span>
-<span class="lineNum">     130 </span><span class="lineCov">            143 :           return __b;</span>
-<span class="lineNum">     131 </span><span class="lineCov">            290 :         else if (__comp(__a, __c))</span>
-<span class="lineNum">     132 </span><span class="lineCov">             54 :           return __c;</span>
-<span class="lineNum">     133 </span>                :         else
-<span class="lineNum">     134 </span><span class="lineCov">            236 :           return __a;</span>
-<span class="lineNum">     135 </span><span class="lineCov">            277 :       else if (__comp(__a, __c))</span>
-<span class="lineNum">     136 </span><span class="lineCov">             81 :         return __a;</span>
-<span class="lineNum">     137 </span><span class="lineCov">            196 :       else if (__comp(__b, __c))</span>
-<span class="lineNum">     138 </span><span class="lineCov">             99 :         return __c;</span>
-<span class="lineNum">     139 </span>                :       else
-<span class="lineNum">     140 </span><span class="lineCov">             97 :         return __b;</span>
-<span class="lineNum">     141 </span>                :     }
-<span class="lineNum">     142 </span>                : 
-<span class="lineNum">     143 </span>                :   // for_each
-<span class="lineNum">     144 </span>                : 
-<span class="lineNum">     145 </span>                :   /// This is an overload used by find() for the Input Iterator case.
-<span class="lineNum">     146 </span>                :   template&lt;typename _InputIterator, typename _Tp&gt;
-<span class="lineNum">     147 </span>                :     inline _InputIterator
-<span class="lineNum">     148 </span>                :     __find(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">     149 </span>                :            const _Tp&amp; __val, input_iterator_tag)
-<span class="lineNum">     150 </span>                :     {
-<span class="lineNum">     151 </span>                :       while (__first != __last &amp;&amp; !(*__first == __val))
-<span class="lineNum">     152 </span>                :         ++__first;
-<span class="lineNum">     153 </span>                :       return __first;
-<span class="lineNum">     154 </span>                :     }
-<span class="lineNum">     155 </span>                : 
-<span class="lineNum">     156 </span>                :   /// This is an overload used by find_if() for the Input Iterator case.
-<span class="lineNum">     157 </span>                :   template&lt;typename _InputIterator, typename _Predicate&gt;
-<span class="lineNum">     158 </span>                :     inline _InputIterator
-<span class="lineNum">     159 </span>                :     __find_if(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">     160 </span><span class="lineCov">              3 :               _Predicate __pred, input_iterator_tag)</span>
-<span class="lineNum">     161 </span>                :     {
-<span class="lineNum">     162 </span><span class="lineCov">              7 :       while (__first != __last &amp;&amp; !bool(__pred(*__first)))</span>
-<span class="lineNum">     163 </span><span class="lineCov">              1 :         ++__first;</span>
-<span class="lineNum">     164 </span><span class="lineCov">              3 :       return __first;</span>
-<span class="lineNum">     165 </span>                :     }
-<span class="lineNum">     166 </span>                : 
-<span class="lineNum">     167 </span>                :   /// This is an overload used by find() for the RAI case.
-<span class="lineNum">     168 </span>                :   template&lt;typename _RandomAccessIterator, typename _Tp&gt;
-<span class="lineNum">     169 </span>                :     _RandomAccessIterator
-<span class="lineNum">     170 </span>                :     __find(_RandomAccessIterator __first, _RandomAccessIterator __last,
-<span class="lineNum">     171 </span><span class="lineCov">           3362 :            const _Tp&amp; __val, random_access_iterator_tag)</span>
-<span class="lineNum">     172 </span>                :     {
-<span class="lineNum">     173 </span>                :       typename iterator_traits&lt;_RandomAccessIterator&gt;::difference_type
-<span class="lineNum">     174 </span><span class="lineCov">           3362 :         __trip_count = (__last - __first) &gt;&gt; 2;</span>
-<span class="lineNum">     175 </span>                : 
-<span class="lineNum">     176 </span><span class="lineCov">           5967 :       for (; __trip_count &gt; 0; --__trip_count)</span>
-<span class="lineNum">     177 </span>                :         {
-<span class="lineNum">     178 </span><span class="lineCov">           3337 :           if (*__first == __val)</span>
-<span class="lineNum">     179 </span><span class="lineCov">             42 :             return __first;</span>
-<span class="lineNum">     180 </span><span class="lineCov">           3295 :           ++__first;</span>
-<span class="lineNum">     181 </span>                : 
-<span class="lineNum">     182 </span><span class="lineCov">           3295 :           if (*__first == __val)</span>
-<span class="lineNum">     183 </span><span class="lineCov">             16 :             return __first;</span>
-<span class="lineNum">     184 </span><span class="lineCov">           3279 :           ++__first;</span>
-<span class="lineNum">     185 </span>                : 
-<span class="lineNum">     186 </span><span class="lineCov">           3279 :           if (*__first == __val)</span>
-<span class="lineNum">     187 </span><span class="lineCov">             42 :             return __first;</span>
-<span class="lineNum">     188 </span><span class="lineCov">           3237 :           ++__first;</span>
-<span class="lineNum">     189 </span>                : 
-<span class="lineNum">     190 </span><span class="lineCov">           3237 :           if (*__first == __val)</span>
-<span class="lineNum">     191 </span><span class="lineCov">            632 :             return __first;</span>
-<span class="lineNum">     192 </span><span class="lineCov">           2605 :           ++__first;</span>
-<span class="lineNum">     193 </span>                :         }
-<span class="lineNum">     194 </span>                : 
-<span class="lineNum">     195 </span><span class="lineCov">           2630 :       switch (__last - __first)</span>
-<span class="lineNum">     196 </span>                :         {
-<span class="lineNum">     197 </span>                :         case 3:
-<span class="lineNum">     198 </span><span class="lineCov">            107 :           if (*__first == __val)</span>
-<span class="lineNum">     199 </span><span class="lineNoCov">              0 :             return __first;</span>
-<span class="lineNum">     200 </span><span class="lineCov">            107 :           ++__first;</span>
-<span class="lineNum">     201 </span>                :         case 2:
-<span class="lineNum">     202 </span><span class="lineCov">            243 :           if (*__first == __val)</span>
-<span class="lineNum">     203 </span><span class="lineNoCov">              0 :             return __first;</span>
-<span class="lineNum">     204 </span><span class="lineCov">            243 :           ++__first;</span>
-<span class="lineNum">     205 </span>                :         case 1:
-<span class="lineNum">     206 </span><span class="lineCov">            370 :           if (*__first == __val)</span>
-<span class="lineNum">     207 </span><span class="lineCov">            370 :             return __first;</span>
-<span class="lineNum">     208 </span><span class="lineNoCov">              0 :           ++__first;</span>
-<span class="lineNum">     209 </span>                :         case 0:
-<span class="lineNum">     210 </span>                :         default:
-<span class="lineNum">     211 </span><span class="lineCov">           2260 :           return __last;</span>
-<span class="lineNum">     212 </span>                :         }
-<span class="lineNum">     213 </span>                :     }
-<span class="lineNum">     214 </span>                : 
-<span class="lineNum">     215 </span>                :   /// This is an overload used by find_if() for the RAI case.
-<span class="lineNum">     216 </span>                :   template&lt;typename _RandomAccessIterator, typename _Predicate&gt;
-<span class="lineNum">     217 </span>                :     _RandomAccessIterator
-<span class="lineNum">     218 </span>                :     __find_if(_RandomAccessIterator __first, _RandomAccessIterator __last,
-<span class="lineNum">     219 </span>                :               _Predicate __pred, random_access_iterator_tag)
-<span class="lineNum">     220 </span>                :     {
-<span class="lineNum">     221 </span>                :       typename iterator_traits&lt;_RandomAccessIterator&gt;::difference_type
-<span class="lineNum">     222 </span>                :         __trip_count = (__last - __first) &gt;&gt; 2;
-<span class="lineNum">     223 </span>                : 
-<span class="lineNum">     224 </span>                :       for (; __trip_count &gt; 0; --__trip_count)
-<span class="lineNum">     225 </span>                :         {
-<span class="lineNum">     226 </span>                :           if (__pred(*__first))
-<span class="lineNum">     227 </span>                :             return __first;
-<span class="lineNum">     228 </span>                :           ++__first;
-<span class="lineNum">     229 </span>                : 
-<span class="lineNum">     230 </span>                :           if (__pred(*__first))
-<span class="lineNum">     231 </span>                :             return __first;
-<span class="lineNum">     232 </span>                :           ++__first;
-<span class="lineNum">     233 </span>                : 
-<span class="lineNum">     234 </span>                :           if (__pred(*__first))
-<span class="lineNum">     235 </span>                :             return __first;
-<span class="lineNum">     236 </span>                :           ++__first;
-<span class="lineNum">     237 </span>                : 
-<span class="lineNum">     238 </span>                :           if (__pred(*__first))
-<span class="lineNum">     239 </span>                :             return __first;
-<span class="lineNum">     240 </span>                :           ++__first;
-<span class="lineNum">     241 </span>                :         }
-<span class="lineNum">     242 </span>                : 
-<span class="lineNum">     243 </span>                :       switch (__last - __first)
-<span class="lineNum">     244 </span>                :         {
-<span class="lineNum">     245 </span>                :         case 3:
-<span class="lineNum">     246 </span>                :           if (__pred(*__first))
-<span class="lineNum">     247 </span>                :             return __first;
-<span class="lineNum">     248 </span>                :           ++__first;
-<span class="lineNum">     249 </span>                :         case 2:
-<span class="lineNum">     250 </span>                :           if (__pred(*__first))
-<span class="lineNum">     251 </span>                :             return __first;
-<span class="lineNum">     252 </span>                :           ++__first;
-<span class="lineNum">     253 </span>                :         case 1:
-<span class="lineNum">     254 </span>                :           if (__pred(*__first))
-<span class="lineNum">     255 </span>                :             return __first;
-<span class="lineNum">     256 </span>                :           ++__first;
-<span class="lineNum">     257 </span>                :         case 0:
-<span class="lineNum">     258 </span>                :         default:
-<span class="lineNum">     259 </span>                :           return __last;
-<span class="lineNum">     260 </span>                :         }
-<span class="lineNum">     261 </span>                :     }
-<span class="lineNum">     262 </span>                : 
-<span class="lineNum">     263 </span>                :   // set_difference
-<span class="lineNum">     264 </span>                :   // set_intersection
-<span class="lineNum">     265 </span>                :   // set_symmetric_difference
-<span class="lineNum">     266 </span>                :   // set_union
-<span class="lineNum">     267 </span>                :   // for_each
-<span class="lineNum">     268 </span>                :   // find
-<span class="lineNum">     269 </span>                :   // find_if
-<span class="lineNum">     270 </span>                :   // find_first_of
-<span class="lineNum">     271 </span>                :   // adjacent_find
-<span class="lineNum">     272 </span>                :   // count
-<span class="lineNum">     273 </span>                :   // count_if
-<span class="lineNum">     274 </span>                :   // search
-<span class="lineNum">     275 </span>                : 
-<span class="lineNum">     276 </span>                :   /**
-<span class="lineNum">     277 </span>                :    *  This is an uglified
-<span class="lineNum">     278 </span>                :    *  search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&amp;)
-<span class="lineNum">     279 </span>                :    *  overloaded for forward iterators.
-<span class="lineNum">     280 </span>                :   */
-<span class="lineNum">     281 </span>                :   template&lt;typename _ForwardIterator, typename _Integer, typename _Tp&gt;
-<span class="lineNum">     282 </span>                :     _ForwardIterator
-<span class="lineNum">     283 </span>                :     __search_n(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">     284 </span>                :                _Integer __count, const _Tp&amp; __val,
-<span class="lineNum">     285 </span>                :                std::forward_iterator_tag)
-<span class="lineNum">     286 </span>                :     {
-<span class="lineNum">     287 </span>                :       __first = _GLIBCXX_STD_P::find(__first, __last, __val);
-<span class="lineNum">     288 </span>                :       while (__first != __last)
-<span class="lineNum">     289 </span>                :         {
-<span class="lineNum">     290 </span>                :           typename iterator_traits&lt;_ForwardIterator&gt;::difference_type
-<span class="lineNum">     291 </span>                :             __n = __count;
-<span class="lineNum">     292 </span>                :           _ForwardIterator __i = __first;
-<span class="lineNum">     293 </span>                :           ++__i;
-<span class="lineNum">     294 </span>                :           while (__i != __last &amp;&amp; __n != 1 &amp;&amp; *__i == __val)
-<span class="lineNum">     295 </span>                :             {
-<span class="lineNum">     296 </span>                :               ++__i;
-<span class="lineNum">     297 </span>                :               --__n;
-<span class="lineNum">     298 </span>                :             }
-<span class="lineNum">     299 </span>                :           if (__n == 1)
-<span class="lineNum">     300 </span>                :             return __first;
-<span class="lineNum">     301 </span>                :           if (__i == __last)
-<span class="lineNum">     302 </span>                :             return __last;
-<span class="lineNum">     303 </span>                :           __first = _GLIBCXX_STD_P::find(++__i, __last, __val);
-<span class="lineNum">     304 </span>                :         }
-<span class="lineNum">     305 </span>                :       return __last;
-<span class="lineNum">     306 </span>                :     }
-<span class="lineNum">     307 </span>                : 
-<span class="lineNum">     308 </span>                :   /**
-<span class="lineNum">     309 </span>                :    *  This is an uglified
-<span class="lineNum">     310 </span>                :    *  search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&amp;)
-<span class="lineNum">     311 </span>                :    *  overloaded for random access iterators.
-<span class="lineNum">     312 </span>                :   */
-<span class="lineNum">     313 </span>                :   template&lt;typename _RandomAccessIter, typename _Integer, typename _Tp&gt;
-<span class="lineNum">     314 </span>                :     _RandomAccessIter
-<span class="lineNum">     315 </span>                :     __search_n(_RandomAccessIter __first, _RandomAccessIter __last,
-<span class="lineNum">     316 </span>                :                _Integer __count, const _Tp&amp; __val, 
-<span class="lineNum">     317 </span>                :                std::random_access_iterator_tag)
-<span class="lineNum">     318 </span>                :     {
-<span class="lineNum">     319 </span>                :       
-<span class="lineNum">     320 </span>                :       typedef typename std::iterator_traits&lt;_RandomAccessIter&gt;::difference_type
-<span class="lineNum">     321 </span>                :         _DistanceType;
-<span class="lineNum">     322 </span>                : 
-<span class="lineNum">     323 </span>                :       _DistanceType __tailSize = __last - __first;
-<span class="lineNum">     324 </span>                :       const _DistanceType __pattSize = __count;
-<span class="lineNum">     325 </span>                : 
-<span class="lineNum">     326 </span>                :       if (__tailSize &lt; __pattSize)
-<span class="lineNum">     327 </span>                :         return __last;
-<span class="lineNum">     328 </span>                : 
-<span class="lineNum">     329 </span>                :       const _DistanceType __skipOffset = __pattSize - 1;
-<span class="lineNum">     330 </span>                :       _RandomAccessIter __lookAhead = __first + __skipOffset;
-<span class="lineNum">     331 </span>                :       __tailSize -= __pattSize;
-<span class="lineNum">     332 </span>                : 
-<span class="lineNum">     333 </span>                :       while (1) // the main loop...
-<span class="lineNum">     334 </span>                :         {
-<span class="lineNum">     335 </span>                :           // __lookAhead here is always pointing to the last element of next 
-<span class="lineNum">     336 </span>                :           // possible match.
-<span class="lineNum">     337 </span>                :           while (!(*__lookAhead == __val)) // the skip loop...
-<span class="lineNum">     338 </span>                :             {
-<span class="lineNum">     339 </span>                :               if (__tailSize &lt; __pattSize)
-<span class="lineNum">     340 </span>                :                 return __last;  // Failure
-<span class="lineNum">     341 </span>                :               __lookAhead += __pattSize;
-<span class="lineNum">     342 </span>                :               __tailSize -= __pattSize;
-<span class="lineNum">     343 </span>                :             }
-<span class="lineNum">     344 </span>                :           _DistanceType __remainder = __skipOffset;
-<span class="lineNum">     345 </span>                :           for (_RandomAccessIter __backTrack = __lookAhead - 1; 
-<span class="lineNum">     346 </span>                :                *__backTrack == __val; --__backTrack)
-<span class="lineNum">     347 </span>                :             {
-<span class="lineNum">     348 </span>                :               if (--__remainder == 0)
-<span class="lineNum">     349 </span>                :                 return (__lookAhead - __skipOffset); // Success
-<span class="lineNum">     350 </span>                :             }
-<span class="lineNum">     351 </span>                :           if (__remainder &gt; __tailSize)
-<span class="lineNum">     352 </span>                :             return __last; // Failure
-<span class="lineNum">     353 </span>                :           __lookAhead += __remainder;
-<span class="lineNum">     354 </span>                :           __tailSize -= __remainder;
-<span class="lineNum">     355 </span>                :         }
-<span class="lineNum">     356 </span>                :     }
-<span class="lineNum">     357 </span>                : 
-<span class="lineNum">     358 </span>                :   // search_n
-<span class="lineNum">     359 </span>                : 
-<span class="lineNum">     360 </span>                :   /**
-<span class="lineNum">     361 </span>                :    *  This is an uglified
-<span class="lineNum">     362 </span>                :    *  search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&amp;,
-<span class="lineNum">     363 </span>                :    *           _BinaryPredicate)
-<span class="lineNum">     364 </span>                :    *  overloaded for forward iterators.
-<span class="lineNum">     365 </span>                :   */
-<span class="lineNum">     366 </span>                :   template&lt;typename _ForwardIterator, typename _Integer, typename _Tp,
-<span class="lineNum">     367 </span>                :            typename _BinaryPredicate&gt;
-<span class="lineNum">     368 </span>                :     _ForwardIterator
-<span class="lineNum">     369 </span>                :     __search_n(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">     370 </span>                :                _Integer __count, const _Tp&amp; __val,
-<span class="lineNum">     371 </span>                :                _BinaryPredicate __binary_pred, std::forward_iterator_tag)
-<span class="lineNum">     372 </span>                :     {
-<span class="lineNum">     373 </span>                :       while (__first != __last &amp;&amp; !bool(__binary_pred(*__first, __val)))
-<span class="lineNum">     374 </span>                :         ++__first;
-<span class="lineNum">     375 </span>                : 
-<span class="lineNum">     376 </span>                :       while (__first != __last)
-<span class="lineNum">     377 </span>                :         {
-<span class="lineNum">     378 </span>                :           typename iterator_traits&lt;_ForwardIterator&gt;::difference_type
-<span class="lineNum">     379 </span>                :             __n = __count;
-<span class="lineNum">     380 </span>                :           _ForwardIterator __i = __first;
-<span class="lineNum">     381 </span>                :           ++__i;
-<span class="lineNum">     382 </span>                :           while (__i != __last &amp;&amp; __n != 1 &amp;&amp; bool(__binary_pred(*__i, __val)))
-<span class="lineNum">     383 </span>                :             {
-<span class="lineNum">     384 </span>                :               ++__i;
-<span class="lineNum">     385 </span>                :               --__n;
-<span class="lineNum">     386 </span>                :             }
-<span class="lineNum">     387 </span>                :           if (__n == 1)
-<span class="lineNum">     388 </span>                :             return __first;
-<span class="lineNum">     389 </span>                :           if (__i == __last)
-<span class="lineNum">     390 </span>                :             return __last;
-<span class="lineNum">     391 </span>                :           __first = ++__i;
-<span class="lineNum">     392 </span>                :           while (__first != __last
-<span class="lineNum">     393 </span>                :                  &amp;&amp; !bool(__binary_pred(*__first, __val)))
-<span class="lineNum">     394 </span>                :             ++__first;
-<span class="lineNum">     395 </span>                :         }
-<span class="lineNum">     396 </span>                :       return __last;
-<span class="lineNum">     397 </span>                :     }
-<span class="lineNum">     398 </span>                : 
-<span class="lineNum">     399 </span>                :   /**
-<span class="lineNum">     400 </span>                :    *  This is an uglified
-<span class="lineNum">     401 </span>                :    *  search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&amp;,
-<span class="lineNum">     402 </span>                :    *           _BinaryPredicate)
-<span class="lineNum">     403 </span>                :    *  overloaded for random access iterators.
-<span class="lineNum">     404 </span>                :   */
-<span class="lineNum">     405 </span>                :   template&lt;typename _RandomAccessIter, typename _Integer, typename _Tp,
-<span class="lineNum">     406 </span>                :            typename _BinaryPredicate&gt;
-<span class="lineNum">     407 </span>                :     _RandomAccessIter
-<span class="lineNum">     408 </span>                :     __search_n(_RandomAccessIter __first, _RandomAccessIter __last,
-<span class="lineNum">     409 </span>                :                _Integer __count, const _Tp&amp; __val,
-<span class="lineNum">     410 </span>                :                _BinaryPredicate __binary_pred, std::random_access_iterator_tag)
-<span class="lineNum">     411 </span>                :     {
-<span class="lineNum">     412 </span>                :       
-<span class="lineNum">     413 </span>                :       typedef typename std::iterator_traits&lt;_RandomAccessIter&gt;::difference_type
-<span class="lineNum">     414 </span>                :         _DistanceType;
-<span class="lineNum">     415 </span>                : 
-<span class="lineNum">     416 </span>                :       _DistanceType __tailSize = __last - __first;
-<span class="lineNum">     417 </span>                :       const _DistanceType __pattSize = __count;
-<span class="lineNum">     418 </span>                : 
-<span class="lineNum">     419 </span>                :       if (__tailSize &lt; __pattSize)
-<span class="lineNum">     420 </span>                :         return __last;
-<span class="lineNum">     421 </span>                : 
-<span class="lineNum">     422 </span>                :       const _DistanceType __skipOffset = __pattSize - 1;
-<span class="lineNum">     423 </span>                :       _RandomAccessIter __lookAhead = __first + __skipOffset;
-<span class="lineNum">     424 </span>                :       __tailSize -= __pattSize;
-<span class="lineNum">     425 </span>                : 
-<span class="lineNum">     426 </span>                :       while (1) // the main loop...
-<span class="lineNum">     427 </span>                :         {
-<span class="lineNum">     428 </span>                :           // __lookAhead here is always pointing to the last element of next 
-<span class="lineNum">     429 </span>                :           // possible match.
-<span class="lineNum">     430 </span>                :           while (!bool(__binary_pred(*__lookAhead, __val))) // the skip loop...
-<span class="lineNum">     431 </span>                :             {
-<span class="lineNum">     432 </span>                :               if (__tailSize &lt; __pattSize)
-<span class="lineNum">     433 </span>                :                 return __last;  // Failure
-<span class="lineNum">     434 </span>                :               __lookAhead += __pattSize;
-<span class="lineNum">     435 </span>                :               __tailSize -= __pattSize;
-<span class="lineNum">     436 </span>                :             }
-<span class="lineNum">     437 </span>                :           _DistanceType __remainder = __skipOffset;
-<span class="lineNum">     438 </span>                :           for (_RandomAccessIter __backTrack = __lookAhead - 1; 
-<span class="lineNum">     439 </span>                :                __binary_pred(*__backTrack, __val); --__backTrack)
-<span class="lineNum">     440 </span>                :             {
-<span class="lineNum">     441 </span>                :               if (--__remainder == 0)
-<span class="lineNum">     442 </span>                :                 return (__lookAhead - __skipOffset); // Success
-<span class="lineNum">     443 </span>                :             }
-<span class="lineNum">     444 </span>                :           if (__remainder &gt; __tailSize)
-<span class="lineNum">     445 </span>                :             return __last; // Failure
-<span class="lineNum">     446 </span>                :           __lookAhead += __remainder;
-<span class="lineNum">     447 </span>                :           __tailSize -= __remainder;
-<span class="lineNum">     448 </span>                :         }
-<span class="lineNum">     449 </span>                :     }
-<span class="lineNum">     450 </span>                : 
-<span class="lineNum">     451 </span>                :   // find_end for forward iterators.
-<span class="lineNum">     452 </span>                :   template&lt;typename _ForwardIterator1, typename _ForwardIterator2&gt;
-<span class="lineNum">     453 </span>                :     _ForwardIterator1
-<span class="lineNum">     454 </span>                :     __find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
-<span class="lineNum">     455 </span>                :                _ForwardIterator2 __first2, _ForwardIterator2 __last2,
-<span class="lineNum">     456 </span>                :                forward_iterator_tag, forward_iterator_tag)
-<span class="lineNum">     457 </span>                :     {
-<span class="lineNum">     458 </span>                :       if (__first2 == __last2)
-<span class="lineNum">     459 </span>                :         return __last1;
-<span class="lineNum">     460 </span>                :       else
-<span class="lineNum">     461 </span>                :         {
-<span class="lineNum">     462 </span>                :           _ForwardIterator1 __result = __last1;
-<span class="lineNum">     463 </span>                :           while (1)
-<span class="lineNum">     464 </span>                :             {
-<span class="lineNum">     465 </span>                :               _ForwardIterator1 __new_result
-<span class="lineNum">     466 </span>                :                 = _GLIBCXX_STD_P::search(__first1, __last1, __first2, __last2);
-<span class="lineNum">     467 </span>                :               if (__new_result == __last1)
-<span class="lineNum">     468 </span>                :                 return __result;
-<span class="lineNum">     469 </span>                :               else
-<span class="lineNum">     470 </span>                :                 {
-<span class="lineNum">     471 </span>                :                   __result = __new_result;
-<span class="lineNum">     472 </span>                :                   __first1 = __new_result;
-<span class="lineNum">     473 </span>                :                   ++__first1;
-<span class="lineNum">     474 </span>                :                 }
-<span class="lineNum">     475 </span>                :             }
-<span class="lineNum">     476 </span>                :         }
-<span class="lineNum">     477 </span>                :     }
-<span class="lineNum">     478 </span>                : 
-<span class="lineNum">     479 </span>                :   template&lt;typename _ForwardIterator1, typename _ForwardIterator2,
-<span class="lineNum">     480 </span>                :            typename _BinaryPredicate&gt;
-<span class="lineNum">     481 </span>                :     _ForwardIterator1
-<span class="lineNum">     482 </span>                :     __find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
-<span class="lineNum">     483 </span>                :                _ForwardIterator2 __first2, _ForwardIterator2 __last2,
-<span class="lineNum">     484 </span>                :                forward_iterator_tag, forward_iterator_tag,
-<span class="lineNum">     485 </span>                :                _BinaryPredicate __comp)
-<span class="lineNum">     486 </span>                :     {
-<span class="lineNum">     487 </span>                :       if (__first2 == __last2)
-<span class="lineNum">     488 </span>                :         return __last1;
-<span class="lineNum">     489 </span>                :       else
-<span class="lineNum">     490 </span>                :         {
-<span class="lineNum">     491 </span>                :           _ForwardIterator1 __result = __last1;
-<span class="lineNum">     492 </span>                :           while (1)
-<span class="lineNum">     493 </span>                :             {
-<span class="lineNum">     494 </span>                :               _ForwardIterator1 __new_result
-<span class="lineNum">     495 </span>                :                 = _GLIBCXX_STD_P::search(__first1, __last1, __first2,
-<span class="lineNum">     496 </span>                :                                          __last2, __comp);
-<span class="lineNum">     497 </span>                :               if (__new_result == __last1)
-<span class="lineNum">     498 </span>                :                 return __result;
-<span class="lineNum">     499 </span>                :               else
-<span class="lineNum">     500 </span>                :                 {
-<span class="lineNum">     501 </span>                :                   __result = __new_result;
-<span class="lineNum">     502 </span>                :                   __first1 = __new_result;
-<span class="lineNum">     503 </span>                :                   ++__first1;
-<span class="lineNum">     504 </span>                :                 }
-<span class="lineNum">     505 </span>                :             }
-<span class="lineNum">     506 </span>                :         }
-<span class="lineNum">     507 </span>                :     }
-<span class="lineNum">     508 </span>                : 
-<span class="lineNum">     509 </span>                :   // find_end for bidirectional iterators (much faster).
-<span class="lineNum">     510 </span>                :   template&lt;typename _BidirectionalIterator1, typename _BidirectionalIterator2&gt;
-<span class="lineNum">     511 </span>                :     _BidirectionalIterator1
-<span class="lineNum">     512 </span>                :     __find_end(_BidirectionalIterator1 __first1,
-<span class="lineNum">     513 </span>                :                _BidirectionalIterator1 __last1,
-<span class="lineNum">     514 </span>                :                _BidirectionalIterator2 __first2,
-<span class="lineNum">     515 </span>                :                _BidirectionalIterator2 __last2,
-<span class="lineNum">     516 </span>                :                bidirectional_iterator_tag, bidirectional_iterator_tag)
-<span class="lineNum">     517 </span>                :     {
-<span class="lineNum">     518 </span>                :       // concept requirements
-<span class="lineNum">     519 </span>                :       __glibcxx_function_requires(_BidirectionalIteratorConcept&lt;
-<span class="lineNum">     520 </span>                :                                   _BidirectionalIterator1&gt;)
-<span class="lineNum">     521 </span>                :       __glibcxx_function_requires(_BidirectionalIteratorConcept&lt;
-<span class="lineNum">     522 </span>                :                                   _BidirectionalIterator2&gt;)
-<span class="lineNum">     523 </span>                : 
-<span class="lineNum">     524 </span>                :       typedef reverse_iterator&lt;_BidirectionalIterator1&gt; _RevIterator1;
-<span class="lineNum">     525 </span>                :       typedef reverse_iterator&lt;_BidirectionalIterator2&gt; _RevIterator2;
-<span class="lineNum">     526 </span>                : 
-<span class="lineNum">     527 </span>                :       _RevIterator1 __rlast1(__first1);
-<span class="lineNum">     528 </span>                :       _RevIterator2 __rlast2(__first2);
-<span class="lineNum">     529 </span>                :       _RevIterator1 __rresult = _GLIBCXX_STD_P::search(_RevIterator1(__last1),
-<span class="lineNum">     530 </span>                :                                                        __rlast1,
-<span class="lineNum">     531 </span>                :                                                        _RevIterator2(__last2),
-<span class="lineNum">     532 </span>                :                                                        __rlast2);
-<span class="lineNum">     533 </span>                : 
-<span class="lineNum">     534 </span>                :       if (__rresult == __rlast1)
-<span class="lineNum">     535 </span>                :         return __last1;
-<span class="lineNum">     536 </span>                :       else
-<span class="lineNum">     537 </span>                :         {
-<span class="lineNum">     538 </span>                :           _BidirectionalIterator1 __result = __rresult.base();
-<span class="lineNum">     539 </span>                :           std::advance(__result, -std::distance(__first2, __last2));
-<span class="lineNum">     540 </span>                :           return __result;
-<span class="lineNum">     541 </span>                :         }
-<span class="lineNum">     542 </span>                :     }
-<span class="lineNum">     543 </span>                : 
-<span class="lineNum">     544 </span>                :   template&lt;typename _BidirectionalIterator1, typename _BidirectionalIterator2,
-<span class="lineNum">     545 </span>                :            typename _BinaryPredicate&gt;
-<span class="lineNum">     546 </span>                :     _BidirectionalIterator1
-<span class="lineNum">     547 </span>                :     __find_end(_BidirectionalIterator1 __first1,
-<span class="lineNum">     548 </span>                :                _BidirectionalIterator1 __last1,
-<span class="lineNum">     549 </span>                :                _BidirectionalIterator2 __first2,
-<span class="lineNum">     550 </span>                :                _BidirectionalIterator2 __last2,
-<span class="lineNum">     551 </span>                :                bidirectional_iterator_tag, bidirectional_iterator_tag,
-<span class="lineNum">     552 </span>                :                _BinaryPredicate __comp)
-<span class="lineNum">     553 </span>                :     {
-<span class="lineNum">     554 </span>                :       // concept requirements
-<span class="lineNum">     555 </span>                :       __glibcxx_function_requires(_BidirectionalIteratorConcept&lt;
-<span class="lineNum">     556 </span>                :                                   _BidirectionalIterator1&gt;)
-<span class="lineNum">     557 </span>                :       __glibcxx_function_requires(_BidirectionalIteratorConcept&lt;
-<span class="lineNum">     558 </span>                :                                   _BidirectionalIterator2&gt;)
-<span class="lineNum">     559 </span>                : 
-<span class="lineNum">     560 </span>                :       typedef reverse_iterator&lt;_BidirectionalIterator1&gt; _RevIterator1;
-<span class="lineNum">     561 </span>                :       typedef reverse_iterator&lt;_BidirectionalIterator2&gt; _RevIterator2;
-<span class="lineNum">     562 </span>                : 
-<span class="lineNum">     563 </span>                :       _RevIterator1 __rlast1(__first1);
-<span class="lineNum">     564 </span>                :       _RevIterator2 __rlast2(__first2);
-<span class="lineNum">     565 </span>                :       _RevIterator1 __rresult = std::search(_RevIterator1(__last1), __rlast1,
-<span class="lineNum">     566 </span>                :                                             _RevIterator2(__last2), __rlast2,
-<span class="lineNum">     567 </span>                :                                             __comp);
-<span class="lineNum">     568 </span>                : 
-<span class="lineNum">     569 </span>                :       if (__rresult == __rlast1)
-<span class="lineNum">     570 </span>                :         return __last1;
-<span class="lineNum">     571 </span>                :       else
-<span class="lineNum">     572 </span>                :         {
-<span class="lineNum">     573 </span>                :           _BidirectionalIterator1 __result = __rresult.base();
-<span class="lineNum">     574 </span>                :           std::advance(__result, -std::distance(__first2, __last2));
-<span class="lineNum">     575 </span>                :           return __result;
-<span class="lineNum">     576 </span>                :         }
-<span class="lineNum">     577 </span>                :     }
-<span class="lineNum">     578 </span>                : 
-<span class="lineNum">     579 </span>                :   /**
-<span class="lineNum">     580 </span>                :    *  @brief  Find last matching subsequence in a sequence.
-<span class="lineNum">     581 </span>                :    *  @param  first1  Start of range to search.
-<span class="lineNum">     582 </span>                :    *  @param  last1   End of range to search.
-<span class="lineNum">     583 </span>                :    *  @param  first2  Start of sequence to match.
-<span class="lineNum">     584 </span>                :    *  @param  last2   End of sequence to match.
-<span class="lineNum">     585 </span>                :    *  @return   The last iterator @c i in the range
-<span class="lineNum">     586 </span>                :    *  @p [first1,last1-(last2-first2)) such that @c *(i+N) == @p *(first2+N)
-<span class="lineNum">     587 </span>                :    *  for each @c N in the range @p [0,last2-first2), or @p last1 if no
-<span class="lineNum">     588 </span>                :    *  such iterator exists.
-<span class="lineNum">     589 </span>                :    *
-<span class="lineNum">     590 </span>                :    *  Searches the range @p [first1,last1) for a sub-sequence that compares
-<span class="lineNum">     591 </span>                :    *  equal value-by-value with the sequence given by @p [first2,last2) and
-<span class="lineNum">     592 </span>                :    *  returns an iterator to the first element of the sub-sequence, or
-<span class="lineNum">     593 </span>                :    *  @p last1 if the sub-sequence is not found.  The sub-sequence will be the
-<span class="lineNum">     594 </span>                :    *  last such subsequence contained in [first,last1).
-<span class="lineNum">     595 </span>                :    *
-<span class="lineNum">     596 </span>                :    *  Because the sub-sequence must lie completely within the range
-<span class="lineNum">     597 </span>                :    *  @p [first1,last1) it must start at a position less than
-<span class="lineNum">     598 </span>                :    *  @p last1-(last2-first2) where @p last2-first2 is the length of the
-<span class="lineNum">     599 </span>                :    *  sub-sequence.
-<span class="lineNum">     600 </span>                :    *  This means that the returned iterator @c i will be in the range
-<span class="lineNum">     601 </span>                :    *  @p [first1,last1-(last2-first2))
-<span class="lineNum">     602 </span>                :   */
-<span class="lineNum">     603 </span>                :   template&lt;typename _ForwardIterator1, typename _ForwardIterator2&gt;
-<span class="lineNum">     604 </span>                :     inline _ForwardIterator1
-<span class="lineNum">     605 </span>                :     find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
-<span class="lineNum">     606 </span>                :              _ForwardIterator2 __first2, _ForwardIterator2 __last2)
-<span class="lineNum">     607 </span>                :     {
-<span class="lineNum">     608 </span>                :       // concept requirements
-<span class="lineNum">     609 </span>                :       __glibcxx_function_requires(_ForwardIteratorConcept&lt;_ForwardIterator1&gt;)
-<span class="lineNum">     610 </span>                :       __glibcxx_function_requires(_ForwardIteratorConcept&lt;_ForwardIterator2&gt;)
-<span class="lineNum">     611 </span>                :       __glibcxx_function_requires(_EqualOpConcept&lt;
-<span class="lineNum">     612 </span>                :             typename iterator_traits&lt;_ForwardIterator1&gt;::value_type,
-<span class="lineNum">     613 </span>                :             typename iterator_traits&lt;_ForwardIterator2&gt;::value_type&gt;)
-<span class="lineNum">     614 </span>                :       __glibcxx_requires_valid_range(__first1, __last1);
-<span class="lineNum">     615 </span>                :       __glibcxx_requires_valid_range(__first2, __last2);
-<span class="lineNum">     616 </span>                : 
-<span class="lineNum">     617 </span>                :       return std::__find_end(__first1, __last1, __first2, __last2,
-<span class="lineNum">     618 </span>                :                              std::__iterator_category(__first1),
-<span class="lineNum">     619 </span>                :                              std::__iterator_category(__first2));
-<span class="lineNum">     620 </span>                :     }
-<span class="lineNum">     621 </span>                : 
-<span class="lineNum">     622 </span>                :   /**
-<span class="lineNum">     623 </span>                :    *  @brief  Find last matching subsequence in a sequence using a predicate.
-<span class="lineNum">     624 </span>                :    *  @param  first1  Start of range to search.
-<span class="lineNum">     625 </span>                :    *  @param  last1   End of range to search.
-<span class="lineNum">     626 </span>                :    *  @param  first2  Start of sequence to match.
-<span class="lineNum">     627 </span>                :    *  @param  last2   End of sequence to match.
-<span class="lineNum">     628 </span>                :    *  @param  comp    The predicate to use.
-<span class="lineNum">     629 </span>                :    *  @return   The last iterator @c i in the range
-<span class="lineNum">     630 </span>                :    *  @p [first1,last1-(last2-first2)) such that @c predicate(*(i+N), @p
-<span class="lineNum">     631 </span>                :    *  (first2+N)) is true for each @c N in the range @p [0,last2-first2), or
-<span class="lineNum">     632 </span>                :    *  @p last1 if no such iterator exists.
-<span class="lineNum">     633 </span>                :    *
-<span class="lineNum">     634 </span>                :    *  Searches the range @p [first1,last1) for a sub-sequence that compares
-<span class="lineNum">     635 </span>                :    *  equal value-by-value with the sequence given by @p [first2,last2) using
-<span class="lineNum">     636 </span>                :    *  comp as a predicate and returns an iterator to the first element of the
-<span class="lineNum">     637 </span>                :    *  sub-sequence, or @p last1 if the sub-sequence is not found.  The
-<span class="lineNum">     638 </span>                :    *  sub-sequence will be the last such subsequence contained in
-<span class="lineNum">     639 </span>                :    *  [first,last1).
-<span class="lineNum">     640 </span>                :    *
-<span class="lineNum">     641 </span>                :    *  Because the sub-sequence must lie completely within the range
-<span class="lineNum">     642 </span>                :    *  @p [first1,last1) it must start at a position less than
-<span class="lineNum">     643 </span>                :    *  @p last1-(last2-first2) where @p last2-first2 is the length of the
-<span class="lineNum">     644 </span>                :    *  sub-sequence.
-<span class="lineNum">     645 </span>                :    *  This means that the returned iterator @c i will be in the range
-<span class="lineNum">     646 </span>                :    *  @p [first1,last1-(last2-first2))
-<span class="lineNum">     647 </span>                :   */
-<span class="lineNum">     648 </span>                :   template&lt;typename _ForwardIterator1, typename _ForwardIterator2,
-<span class="lineNum">     649 </span>                :            typename _BinaryPredicate&gt;
-<span class="lineNum">     650 </span>                :     inline _ForwardIterator1
-<span class="lineNum">     651 </span>                :     find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
-<span class="lineNum">     652 </span>                :              _ForwardIterator2 __first2, _ForwardIterator2 __last2,
-<span class="lineNum">     653 </span>                :              _BinaryPredicate __comp)
-<span class="lineNum">     654 </span>                :     {
-<span class="lineNum">     655 </span>                :       // concept requirements
-<span class="lineNum">     656 </span>                :       __glibcxx_function_requires(_ForwardIteratorConcept&lt;_ForwardIterator1&gt;)
-<span class="lineNum">     657 </span>                :       __glibcxx_function_requires(_ForwardIteratorConcept&lt;_ForwardIterator2&gt;)
-<span class="lineNum">     658 </span>                :       __glibcxx_function_requires(_BinaryPredicateConcept&lt;_BinaryPredicate,
-<span class="lineNum">     659 </span>                :             typename iterator_traits&lt;_ForwardIterator1&gt;::value_type,
-<span class="lineNum">     660 </span>                :             typename iterator_traits&lt;_ForwardIterator2&gt;::value_type&gt;)
-<span class="lineNum">     661 </span>                :       __glibcxx_requires_valid_range(__first1, __last1);
-<span class="lineNum">     662 </span>                :       __glibcxx_requires_valid_range(__first2, __last2);
-<span class="lineNum">     663 </span>                : 
-<span class="lineNum">     664 </span>                :       return std::__find_end(__first1, __last1, __first2, __last2,
-<span class="lineNum">     665 </span>                :                              std::__iterator_category(__first1),
-<span class="lineNum">     666 </span>                :                              std::__iterator_category(__first2),
-<span class="lineNum">     667 </span>                :                              __comp);
-<span class="lineNum">     668 </span>                :     }
-<span class="lineNum">     669 </span>                : 
-<span class="lineNum">     670 </span>                : 
-<span class="lineNum">     671 </span>                :   /**
-<span class="lineNum">     672 </span>                :    *  @brief Copy a sequence, removing elements of a given value.
-<span class="lineNum">     673 </span>                :    *  @param  first   An input iterator.
-<span class="lineNum">     674 </span>                :    *  @param  last    An input iterator.
-<span class="lineNum">     675 </span>                :    *  @param  result  An output iterator.
-<span class="lineNum">     676 </span>                :    *  @param  value   The value to be removed.
-<span class="lineNum">     677 </span>                :    *  @return   An iterator designating the end of the resulting sequence.
-<span class="lineNum">     678 </span>                :    *
-<span class="lineNum">     679 </span>                :    *  Copies each element in the range @p [first,last) not equal to @p value
-<span class="lineNum">     680 </span>                :    *  to the range beginning at @p result.
-<span class="lineNum">     681 </span>                :    *  remove_copy() is stable, so the relative order of elements that are
-<span class="lineNum">     682 </span>                :    *  copied is unchanged.
-<span class="lineNum">     683 </span>                :   */
-<span class="lineNum">     684 </span>                :   template&lt;typename _InputIterator, typename _OutputIterator, typename _Tp&gt;
-<span class="lineNum">     685 </span>                :     _OutputIterator
-<span class="lineNum">     686 </span>                :     remove_copy(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">     687 </span>                :                 _OutputIterator __result, const _Tp&amp; __value)
-<span class="lineNum">     688 </span>                :     {
-<span class="lineNum">     689 </span>                :       // concept requirements
-<span class="lineNum">     690 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator&gt;)
-<span class="lineNum">     691 </span>                :       __glibcxx_function_requires(_OutputIteratorConcept&lt;_OutputIterator,
-<span class="lineNum">     692 </span>                :             typename iterator_traits&lt;_InputIterator&gt;::value_type&gt;)
-<span class="lineNum">     693 </span>                :       __glibcxx_function_requires(_EqualOpConcept&lt;
-<span class="lineNum">     694 </span>                :             typename iterator_traits&lt;_InputIterator&gt;::value_type, _Tp&gt;)
-<span class="lineNum">     695 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">     696 </span>                : 
-<span class="lineNum">     697 </span>                :       for (; __first != __last; ++__first)
-<span class="lineNum">     698 </span>                :         if (!(*__first == __value))
-<span class="lineNum">     699 </span>                :           {
-<span class="lineNum">     700 </span>                :             *__result = *__first;
-<span class="lineNum">     701 </span>                :             ++__result;
-<span class="lineNum">     702 </span>                :           }
-<span class="lineNum">     703 </span>                :       return __result;
-<span class="lineNum">     704 </span>                :     }
-<span class="lineNum">     705 </span>                : 
-<span class="lineNum">     706 </span>                :   /**
-<span class="lineNum">     707 </span>                :    *  @brief Copy a sequence, removing elements for which a predicate is true.
-<span class="lineNum">     708 </span>                :    *  @param  first   An input iterator.
-<span class="lineNum">     709 </span>                :    *  @param  last    An input iterator.
-<span class="lineNum">     710 </span>                :    *  @param  result  An output iterator.
-<span class="lineNum">     711 </span>                :    *  @param  pred    A predicate.
-<span class="lineNum">     712 </span>                :    *  @return   An iterator designating the end of the resulting sequence.
-<span class="lineNum">     713 </span>                :    *
-<span class="lineNum">     714 </span>                :    *  Copies each element in the range @p [first,last) for which
-<span class="lineNum">     715 </span>                :    *  @p pred returns false to the range beginning at @p result.
-<span class="lineNum">     716 </span>                :    *
-<span class="lineNum">     717 </span>                :    *  remove_copy_if() is stable, so the relative order of elements that are
-<span class="lineNum">     718 </span>                :    *  copied is unchanged.
-<span class="lineNum">     719 </span>                :   */
-<span class="lineNum">     720 </span>                :   template&lt;typename _InputIterator, typename _OutputIterator,
-<span class="lineNum">     721 </span>                :            typename _Predicate&gt;
-<span class="lineNum">     722 </span>                :     _OutputIterator
-<span class="lineNum">     723 </span>                :     remove_copy_if(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">     724 </span><span class="lineCov">             16 :                    _OutputIterator __result, _Predicate __pred)</span>
-<span class="lineNum">     725 </span>                :     {
-<span class="lineNum">     726 </span>                :       // concept requirements
-<span class="lineNum">     727 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator&gt;)
-<span class="lineNum">     728 </span>                :       __glibcxx_function_requires(_OutputIteratorConcept&lt;_OutputIterator,
-<span class="lineNum">     729 </span>                :             typename iterator_traits&lt;_InputIterator&gt;::value_type&gt;)
-<span class="lineNum">     730 </span>                :       __glibcxx_function_requires(_UnaryPredicateConcept&lt;_Predicate,
-<span class="lineNum">     731 </span>                :             typename iterator_traits&lt;_InputIterator&gt;::value_type&gt;)
-<span class="lineNum">     732 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">     733 </span>                : 
-<span class="lineNum">     734 </span><span class="lineCov">             80 :       for (; __first != __last; ++__first)</span>
-<span class="lineNum">     735 </span><span class="lineCov">             64 :         if (!bool(__pred(*__first)))</span>
-<span class="lineNum">     736 </span>                :           {
-<span class="lineNum">     737 </span><span class="lineCov">             48 :             *__result = *__first;</span>
-<span class="lineNum">     738 </span><span class="lineCov">             48 :             ++__result;</span>
-<span class="lineNum">     739 </span>                :           }
-<span class="lineNum">     740 </span><span class="lineCov">             16 :       return __result;</span>
-<span class="lineNum">     741 </span>                :     }
-<span class="lineNum">     742 </span>                : 
-<span class="lineNum">     743 </span>                :   /**
-<span class="lineNum">     744 </span>                :    *  @brief Remove elements from a sequence.
-<span class="lineNum">     745 </span>                :    *  @param  first  An input iterator.
-<span class="lineNum">     746 </span>                :    *  @param  last   An input iterator.
-<span class="lineNum">     747 </span>                :    *  @param  value  The value to be removed.
-<span class="lineNum">     748 </span>                :    *  @return   An iterator designating the end of the resulting sequence.
-<span class="lineNum">     749 </span>                :    *
-<span class="lineNum">     750 </span>                :    *  All elements equal to @p value are removed from the range
-<span class="lineNum">     751 </span>                :    *  @p [first,last).
-<span class="lineNum">     752 </span>                :    *
-<span class="lineNum">     753 </span>                :    *  remove() is stable, so the relative order of elements that are
-<span class="lineNum">     754 </span>                :    *  not removed is unchanged.
-<span class="lineNum">     755 </span>                :    *
-<span class="lineNum">     756 </span>                :    *  Elements between the end of the resulting sequence and @p last
-<span class="lineNum">     757 </span>                :    *  are still present, but their value is unspecified.
-<span class="lineNum">     758 </span>                :   */
-<span class="lineNum">     759 </span>                :   template&lt;typename _ForwardIterator, typename _Tp&gt;
-<span class="lineNum">     760 </span>                :     _ForwardIterator
-<span class="lineNum">     761 </span>                :     remove(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">     762 </span>                :            const _Tp&amp; __value)
-<span class="lineNum">     763 </span>                :     {
-<span class="lineNum">     764 </span>                :       // concept requirements
-<span class="lineNum">     765 </span>                :       __glibcxx_function_requires(_Mutable_ForwardIteratorConcept&lt;
-<span class="lineNum">     766 </span>                :                                   _ForwardIterator&gt;)
-<span class="lineNum">     767 </span>                :       __glibcxx_function_requires(_EqualOpConcept&lt;
-<span class="lineNum">     768 </span>                :             typename iterator_traits&lt;_ForwardIterator&gt;::value_type, _Tp&gt;)
-<span class="lineNum">     769 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">     770 </span>                : 
-<span class="lineNum">     771 </span>                :       __first = _GLIBCXX_STD_P::find(__first, __last, __value);
-<span class="lineNum">     772 </span>                :       if(__first == __last)
-<span class="lineNum">     773 </span>                :         return __first;
-<span class="lineNum">     774 </span>                :       _ForwardIterator __result = __first;
-<span class="lineNum">     775 </span>                :       ++__first;
-<span class="lineNum">     776 </span>                :       for(; __first != __last; ++__first)
-<span class="lineNum">     777 </span>                :         if(!(*__first == __value))
-<span class="lineNum">     778 </span>                :           {
-<span class="lineNum">     779 </span>                :             *__result = _GLIBCXX_MOVE(*__first);
-<span class="lineNum">     780 </span>                :             ++__result;
-<span class="lineNum">     781 </span>                :           }
-<span class="lineNum">     782 </span>                :       return __result;
-<span class="lineNum">     783 </span>                :     }
-<span class="lineNum">     784 </span>                : 
-<span class="lineNum">     785 </span>                :   /**
-<span class="lineNum">     786 </span>                :    *  @brief Remove elements from a sequence using a predicate.
-<span class="lineNum">     787 </span>                :    *  @param  first  A forward iterator.
-<span class="lineNum">     788 </span>                :    *  @param  last   A forward iterator.
-<span class="lineNum">     789 </span>                :    *  @param  pred   A predicate.
-<span class="lineNum">     790 </span>                :    *  @return   An iterator designating the end of the resulting sequence.
-<span class="lineNum">     791 </span>                :    *
-<span class="lineNum">     792 </span>                :    *  All elements for which @p pred returns true are removed from the range
-<span class="lineNum">     793 </span>                :    *  @p [first,last).
-<span class="lineNum">     794 </span>                :    *
-<span class="lineNum">     795 </span>                :    *  remove_if() is stable, so the relative order of elements that are
-<span class="lineNum">     796 </span>                :    *  not removed is unchanged.
-<span class="lineNum">     797 </span>                :    *
-<span class="lineNum">     798 </span>                :    *  Elements between the end of the resulting sequence and @p last
-<span class="lineNum">     799 </span>                :    *  are still present, but their value is unspecified.
-<span class="lineNum">     800 </span>                :   */
-<span class="lineNum">     801 </span>                :   template&lt;typename _ForwardIterator, typename _Predicate&gt;
-<span class="lineNum">     802 </span>                :     _ForwardIterator
-<span class="lineNum">     803 </span>                :     remove_if(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">     804 </span>                :               _Predicate __pred)
-<span class="lineNum">     805 </span>                :     {
-<span class="lineNum">     806 </span>                :       // concept requirements
-<span class="lineNum">     807 </span>                :       __glibcxx_function_requires(_Mutable_ForwardIteratorConcept&lt;
-<span class="lineNum">     808 </span>                :                                   _ForwardIterator&gt;)
-<span class="lineNum">     809 </span>                :       __glibcxx_function_requires(_UnaryPredicateConcept&lt;_Predicate,
-<span class="lineNum">     810 </span>                :             typename iterator_traits&lt;_ForwardIterator&gt;::value_type&gt;)
-<span class="lineNum">     811 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">     812 </span>                : 
-<span class="lineNum">     813 </span>                :       __first = _GLIBCXX_STD_P::find_if(__first, __last, __pred);
-<span class="lineNum">     814 </span>                :       if(__first == __last)
-<span class="lineNum">     815 </span>                :         return __first;
-<span class="lineNum">     816 </span>                :       _ForwardIterator __result = __first;
-<span class="lineNum">     817 </span>                :       ++__first;
-<span class="lineNum">     818 </span>                :       for(; __first != __last; ++__first)
-<span class="lineNum">     819 </span>                :         if(!bool(__pred(*__first)))
-<span class="lineNum">     820 </span>                :           {
-<span class="lineNum">     821 </span>                :             *__result = _GLIBCXX_MOVE(*__first);
-<span class="lineNum">     822 </span>                :             ++__result;
-<span class="lineNum">     823 </span>                :           }
-<span class="lineNum">     824 </span>                :       return __result;
-<span class="lineNum">     825 </span>                :     }
-<span class="lineNum">     826 </span>                : 
-<span class="lineNum">     827 </span>                :   /**
-<span class="lineNum">     828 </span>                :    *  @brief Remove consecutive duplicate values from a sequence.
-<span class="lineNum">     829 </span>                :    *  @param  first  A forward iterator.
-<span class="lineNum">     830 </span>                :    *  @param  last   A forward iterator.
-<span class="lineNum">     831 </span>                :    *  @return  An iterator designating the end of the resulting sequence.
-<span class="lineNum">     832 </span>                :    *
-<span class="lineNum">     833 </span>                :    *  Removes all but the first element from each group of consecutive
-<span class="lineNum">     834 </span>                :    *  values that compare equal.
-<span class="lineNum">     835 </span>                :    *  unique() is stable, so the relative order of elements that are
-<span class="lineNum">     836 </span>                :    *  not removed is unchanged.
-<span class="lineNum">     837 </span>                :    *  Elements between the end of the resulting sequence and @p last
-<span class="lineNum">     838 </span>                :    *  are still present, but their value is unspecified.
-<span class="lineNum">     839 </span>                :   */
-<span class="lineNum">     840 </span>                :   template&lt;typename _ForwardIterator&gt;
-<span class="lineNum">     841 </span>                :     _ForwardIterator
-<span class="lineNum">     842 </span>                :     unique(_ForwardIterator __first, _ForwardIterator __last)
-<span class="lineNum">     843 </span>                :     {
-<span class="lineNum">     844 </span>                :       // concept requirements
-<span class="lineNum">     845 </span>                :       __glibcxx_function_requires(_Mutable_ForwardIteratorConcept&lt;
-<span class="lineNum">     846 </span>                :                                   _ForwardIterator&gt;)
-<span class="lineNum">     847 </span>                :       __glibcxx_function_requires(_EqualityComparableConcept&lt;
-<span class="lineNum">     848 </span>                :                      typename iterator_traits&lt;_ForwardIterator&gt;::value_type&gt;)
-<span class="lineNum">     849 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">     850 </span>                : 
-<span class="lineNum">     851 </span>                :       // Skip the beginning, if already unique.
-<span class="lineNum">     852 </span>                :       __first = _GLIBCXX_STD_P::adjacent_find(__first, __last);
-<span class="lineNum">     853 </span>                :       if (__first == __last)
-<span class="lineNum">     854 </span>                :         return __last;
-<span class="lineNum">     855 </span>                : 
-<span class="lineNum">     856 </span>                :       // Do the real copy work.
-<span class="lineNum">     857 </span>                :       _ForwardIterator __dest = __first;
-<span class="lineNum">     858 </span>                :       ++__first;
-<span class="lineNum">     859 </span>                :       while (++__first != __last)
-<span class="lineNum">     860 </span>                :         if (!(*__dest == *__first))
-<span class="lineNum">     861 </span>                :           *++__dest = _GLIBCXX_MOVE(*__first);
-<span class="lineNum">     862 </span>                :       return ++__dest;
-<span class="lineNum">     863 </span>                :     }
-<span class="lineNum">     864 </span>                : 
-<span class="lineNum">     865 </span>                :   /**
-<span class="lineNum">     866 </span>                :    *  @brief Remove consecutive values from a sequence using a predicate.
-<span class="lineNum">     867 </span>                :    *  @param  first        A forward iterator.
-<span class="lineNum">     868 </span>                :    *  @param  last         A forward iterator.
-<span class="lineNum">     869 </span>                :    *  @param  binary_pred  A binary predicate.
-<span class="lineNum">     870 </span>                :    *  @return  An iterator designating the end of the resulting sequence.
-<span class="lineNum">     871 </span>                :    *
-<span class="lineNum">     872 </span>                :    *  Removes all but the first element from each group of consecutive
-<span class="lineNum">     873 </span>                :    *  values for which @p binary_pred returns true.
-<span class="lineNum">     874 </span>                :    *  unique() is stable, so the relative order of elements that are
-<span class="lineNum">     875 </span>                :    *  not removed is unchanged.
-<span class="lineNum">     876 </span>                :    *  Elements between the end of the resulting sequence and @p last
-<span class="lineNum">     877 </span>                :    *  are still present, but their value is unspecified.
-<span class="lineNum">     878 </span>                :   */
-<span class="lineNum">     879 </span>                :   template&lt;typename _ForwardIterator, typename _BinaryPredicate&gt;
-<span class="lineNum">     880 </span>                :     _ForwardIterator
-<span class="lineNum">     881 </span>                :     unique(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">     882 </span>                :            _BinaryPredicate __binary_pred)
-<span class="lineNum">     883 </span>                :     {
-<span class="lineNum">     884 </span>                :       // concept requirements
-<span class="lineNum">     885 </span>                :       __glibcxx_function_requires(_Mutable_ForwardIteratorConcept&lt;
-<span class="lineNum">     886 </span>                :                                   _ForwardIterator&gt;)
-<span class="lineNum">     887 </span>                :       __glibcxx_function_requires(_BinaryPredicateConcept&lt;_BinaryPredicate,
-<span class="lineNum">     888 </span>                :                 typename iterator_traits&lt;_ForwardIterator&gt;::value_type,
-<span class="lineNum">     889 </span>                :                 typename iterator_traits&lt;_ForwardIterator&gt;::value_type&gt;)
-<span class="lineNum">     890 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">     891 </span>                : 
-<span class="lineNum">     892 </span>                :       // Skip the beginning, if already unique.
-<span class="lineNum">     893 </span>                :       __first = _GLIBCXX_STD_P::adjacent_find(__first, __last, __binary_pred);
-<span class="lineNum">     894 </span>                :       if (__first == __last)
-<span class="lineNum">     895 </span>                :         return __last;
-<span class="lineNum">     896 </span>                : 
-<span class="lineNum">     897 </span>                :       // Do the real copy work.
-<span class="lineNum">     898 </span>                :       _ForwardIterator __dest = __first;
-<span class="lineNum">     899 </span>                :       ++__first;
-<span class="lineNum">     900 </span>                :       while (++__first != __last)
-<span class="lineNum">     901 </span>                :         if (!bool(__binary_pred(*__dest, *__first)))
-<span class="lineNum">     902 </span>                :           *++__dest = _GLIBCXX_MOVE(*__first);
-<span class="lineNum">     903 </span>                :       return ++__dest;
-<span class="lineNum">     904 </span>                :     }
-<span class="lineNum">     905 </span>                : 
-<span class="lineNum">     906 </span>                :   /**
-<span class="lineNum">     907 </span>                :    *  This is an uglified unique_copy(_InputIterator, _InputIterator,
-<span class="lineNum">     908 </span>                :    *                                  _OutputIterator)
-<span class="lineNum">     909 </span>                :    *  overloaded for forward iterators and output iterator as result.
-<span class="lineNum">     910 </span>                :   */
-<span class="lineNum">     911 </span>                :   template&lt;typename _ForwardIterator, typename _OutputIterator&gt;
-<span class="lineNum">     912 </span>                :     _OutputIterator
-<span class="lineNum">     913 </span>                :     __unique_copy(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">     914 </span>                :                   _OutputIterator __result,
-<span class="lineNum">     915 </span>                :                   forward_iterator_tag, output_iterator_tag)
-<span class="lineNum">     916 </span>                :     {
-<span class="lineNum">     917 </span>                :       // concept requirements -- taken care of in dispatching function
-<span class="lineNum">     918 </span>                :       _ForwardIterator __next = __first;
-<span class="lineNum">     919 </span>                :       *__result = *__first;
-<span class="lineNum">     920 </span>                :       while (++__next != __last)
-<span class="lineNum">     921 </span>                :         if (!(*__first == *__next))
-<span class="lineNum">     922 </span>                :           {
-<span class="lineNum">     923 </span>                :             __first = __next;
-<span class="lineNum">     924 </span>                :             *++__result = *__first;
-<span class="lineNum">     925 </span>                :           }
-<span class="lineNum">     926 </span>                :       return ++__result;
-<span class="lineNum">     927 </span>                :     }
-<span class="lineNum">     928 </span>                : 
-<span class="lineNum">     929 </span>                :   /**
-<span class="lineNum">     930 </span>                :    *  This is an uglified unique_copy(_InputIterator, _InputIterator,
-<span class="lineNum">     931 </span>                :    *                                  _OutputIterator)
-<span class="lineNum">     932 </span>                :    *  overloaded for input iterators and output iterator as result.
-<span class="lineNum">     933 </span>                :   */
-<span class="lineNum">     934 </span>                :   template&lt;typename _InputIterator, typename _OutputIterator&gt;
-<span class="lineNum">     935 </span>                :     _OutputIterator
-<span class="lineNum">     936 </span>                :     __unique_copy(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">     937 </span>                :                   _OutputIterator __result,
-<span class="lineNum">     938 </span>                :                   input_iterator_tag, output_iterator_tag)
-<span class="lineNum">     939 </span>                :     {
-<span class="lineNum">     940 </span>                :       // concept requirements -- taken care of in dispatching function
-<span class="lineNum">     941 </span>                :       typename iterator_traits&lt;_InputIterator&gt;::value_type __value = *__first;
-<span class="lineNum">     942 </span>                :       *__result = __value;
-<span class="lineNum">     943 </span>                :       while (++__first != __last)
-<span class="lineNum">     944 </span>                :         if (!(__value == *__first))
-<span class="lineNum">     945 </span>                :           {
-<span class="lineNum">     946 </span>                :             __value = *__first;
-<span class="lineNum">     947 </span>                :             *++__result = __value;
-<span class="lineNum">     948 </span>                :           }
-<span class="lineNum">     949 </span>                :       return ++__result;
-<span class="lineNum">     950 </span>                :     }
-<span class="lineNum">     951 </span>                : 
-<span class="lineNum">     952 </span>                :   /**
-<span class="lineNum">     953 </span>                :    *  This is an uglified unique_copy(_InputIterator, _InputIterator,
-<span class="lineNum">     954 </span>                :    *                                  _OutputIterator)
-<span class="lineNum">     955 </span>                :    *  overloaded for input iterators and forward iterator as result.
-<span class="lineNum">     956 </span>                :   */
-<span class="lineNum">     957 </span>                :   template&lt;typename _InputIterator, typename _ForwardIterator&gt;
-<span class="lineNum">     958 </span>                :     _ForwardIterator
-<span class="lineNum">     959 </span>                :     __unique_copy(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">     960 </span>                :                   _ForwardIterator __result,
-<span class="lineNum">     961 </span>                :                   input_iterator_tag, forward_iterator_tag)
-<span class="lineNum">     962 </span>                :     {
-<span class="lineNum">     963 </span>                :       // concept requirements -- taken care of in dispatching function
-<span class="lineNum">     964 </span>                :       *__result = *__first;
-<span class="lineNum">     965 </span>                :       while (++__first != __last)
-<span class="lineNum">     966 </span>                :         if (!(*__result == *__first))
-<span class="lineNum">     967 </span>                :           *++__result = *__first;
-<span class="lineNum">     968 </span>                :       return ++__result;
-<span class="lineNum">     969 </span>                :     }
-<span class="lineNum">     970 </span>                : 
-<span class="lineNum">     971 </span>                :   /**
-<span class="lineNum">     972 </span>                :    *  This is an uglified
-<span class="lineNum">     973 </span>                :    *  unique_copy(_InputIterator, _InputIterator, _OutputIterator,
-<span class="lineNum">     974 </span>                :    *              _BinaryPredicate)
-<span class="lineNum">     975 </span>                :    *  overloaded for forward iterators and output iterator as result.
-<span class="lineNum">     976 </span>                :   */
-<span class="lineNum">     977 </span>                :   template&lt;typename _ForwardIterator, typename _OutputIterator,
-<span class="lineNum">     978 </span>                :            typename _BinaryPredicate&gt;
-<span class="lineNum">     979 </span>                :     _OutputIterator
-<span class="lineNum">     980 </span>                :     __unique_copy(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">     981 </span>                :                   _OutputIterator __result, _BinaryPredicate __binary_pred,
-<span class="lineNum">     982 </span>                :                   forward_iterator_tag, output_iterator_tag)
-<span class="lineNum">     983 </span>                :     {
-<span class="lineNum">     984 </span>                :       // concept requirements -- iterators already checked
-<span class="lineNum">     985 </span>                :       __glibcxx_function_requires(_BinaryPredicateConcept&lt;_BinaryPredicate,
-<span class="lineNum">     986 </span>                :           typename iterator_traits&lt;_ForwardIterator&gt;::value_type,
-<span class="lineNum">     987 </span>                :           typename iterator_traits&lt;_ForwardIterator&gt;::value_type&gt;)
-<span class="lineNum">     988 </span>                : 
-<span class="lineNum">     989 </span>                :       _ForwardIterator __next = __first;
-<span class="lineNum">     990 </span>                :       *__result = *__first;
-<span class="lineNum">     991 </span>                :       while (++__next != __last)
-<span class="lineNum">     992 </span>                :         if (!bool(__binary_pred(*__first, *__next)))
-<span class="lineNum">     993 </span>                :           {
-<span class="lineNum">     994 </span>                :             __first = __next;
-<span class="lineNum">     995 </span>                :             *++__result = *__first;
-<span class="lineNum">     996 </span>                :           }
-<span class="lineNum">     997 </span>                :       return ++__result;
-<span class="lineNum">     998 </span>                :     }
-<span class="lineNum">     999 </span>                : 
-<span class="lineNum">    1000 </span>                :   /**
-<span class="lineNum">    1001 </span>                :    *  This is an uglified
-<span class="lineNum">    1002 </span>                :    *  unique_copy(_InputIterator, _InputIterator, _OutputIterator,
-<span class="lineNum">    1003 </span>                :    *              _BinaryPredicate)
-<span class="lineNum">    1004 </span>                :    *  overloaded for input iterators and output iterator as result.
-<span class="lineNum">    1005 </span>                :   */
-<span class="lineNum">    1006 </span>                :   template&lt;typename _InputIterator, typename _OutputIterator,
-<span class="lineNum">    1007 </span>                :            typename _BinaryPredicate&gt;
-<span class="lineNum">    1008 </span>                :     _OutputIterator
-<span class="lineNum">    1009 </span>                :     __unique_copy(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">    1010 </span>                :                   _OutputIterator __result, _BinaryPredicate __binary_pred,
-<span class="lineNum">    1011 </span>                :                   input_iterator_tag, output_iterator_tag)
-<span class="lineNum">    1012 </span>                :     {
-<span class="lineNum">    1013 </span>                :       // concept requirements -- iterators already checked
-<span class="lineNum">    1014 </span>                :       __glibcxx_function_requires(_BinaryPredicateConcept&lt;_BinaryPredicate,
-<span class="lineNum">    1015 </span>                :           typename iterator_traits&lt;_InputIterator&gt;::value_type,
-<span class="lineNum">    1016 </span>                :           typename iterator_traits&lt;_InputIterator&gt;::value_type&gt;)
-<span class="lineNum">    1017 </span>                : 
-<span class="lineNum">    1018 </span>                :       typename iterator_traits&lt;_InputIterator&gt;::value_type __value = *__first;
-<span class="lineNum">    1019 </span>                :       *__result = __value;
-<span class="lineNum">    1020 </span>                :       while (++__first != __last)
-<span class="lineNum">    1021 </span>                :         if (!bool(__binary_pred(__value, *__first)))
-<span class="lineNum">    1022 </span>                :           {
-<span class="lineNum">    1023 </span>                :             __value = *__first;
-<span class="lineNum">    1024 </span>                :             *++__result = __value;
-<span class="lineNum">    1025 </span>                :           }
-<span class="lineNum">    1026 </span>                :       return ++__result;
-<span class="lineNum">    1027 </span>                :     }
-<span class="lineNum">    1028 </span>                : 
-<span class="lineNum">    1029 </span>                :   /**
-<span class="lineNum">    1030 </span>                :    *  This is an uglified
-<span class="lineNum">    1031 </span>                :    *  unique_copy(_InputIterator, _InputIterator, _OutputIterator,
-<span class="lineNum">    1032 </span>                :    *              _BinaryPredicate)
-<span class="lineNum">    1033 </span>                :    *  overloaded for input iterators and forward iterator as result.
-<span class="lineNum">    1034 </span>                :   */
-<span class="lineNum">    1035 </span>                :   template&lt;typename _InputIterator, typename _ForwardIterator,
-<span class="lineNum">    1036 </span>                :            typename _BinaryPredicate&gt;
-<span class="lineNum">    1037 </span>                :     _ForwardIterator
-<span class="lineNum">    1038 </span>                :     __unique_copy(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">    1039 </span>                :                   _ForwardIterator __result, _BinaryPredicate __binary_pred,
-<span class="lineNum">    1040 </span>                :                   input_iterator_tag, forward_iterator_tag)
-<span class="lineNum">    1041 </span>                :     {
-<span class="lineNum">    1042 </span>                :       // concept requirements -- iterators already checked
-<span class="lineNum">    1043 </span>                :       __glibcxx_function_requires(_BinaryPredicateConcept&lt;_BinaryPredicate,
-<span class="lineNum">    1044 </span>                :           typename iterator_traits&lt;_ForwardIterator&gt;::value_type,
-<span class="lineNum">    1045 </span>                :           typename iterator_traits&lt;_InputIterator&gt;::value_type&gt;)
-<span class="lineNum">    1046 </span>                : 
-<span class="lineNum">    1047 </span>                :       *__result = *__first;
-<span class="lineNum">    1048 </span>                :       while (++__first != __last)
-<span class="lineNum">    1049 </span>                :         if (!bool(__binary_pred(*__result, *__first)))
-<span class="lineNum">    1050 </span>                :           *++__result = *__first;
-<span class="lineNum">    1051 </span>                :       return ++__result;
-<span class="lineNum">    1052 </span>                :     }
-<span class="lineNum">    1053 </span>                : 
-<span class="lineNum">    1054 </span>                :   /**
-<span class="lineNum">    1055 </span>                :    *  This is an uglified reverse(_BidirectionalIterator,
-<span class="lineNum">    1056 </span>                :    *                              _BidirectionalIterator)
-<span class="lineNum">    1057 </span>                :    *  overloaded for bidirectional iterators.
-<span class="lineNum">    1058 </span>                :   */
-<span class="lineNum">    1059 </span>                :   template&lt;typename _BidirectionalIterator&gt;
-<span class="lineNum">    1060 </span>                :     void
-<span class="lineNum">    1061 </span>                :     __reverse(_BidirectionalIterator __first, _BidirectionalIterator __last,
-<span class="lineNum">    1062 </span>                :               bidirectional_iterator_tag)
-<span class="lineNum">    1063 </span>                :     {
-<span class="lineNum">    1064 </span>                :       while (true)
-<span class="lineNum">    1065 </span>                :         if (__first == __last || __first == --__last)
-<span class="lineNum">    1066 </span>                :           return;
-<span class="lineNum">    1067 </span>                :         else
-<span class="lineNum">    1068 </span>                :           {
-<span class="lineNum">    1069 </span>                :             std::iter_swap(__first, __last);
-<span class="lineNum">    1070 </span>                :             ++__first;
-<span class="lineNum">    1071 </span>                :           }
-<span class="lineNum">    1072 </span>                :     }
-<span class="lineNum">    1073 </span>                : 
-<span class="lineNum">    1074 </span>                :   /**
-<span class="lineNum">    1075 </span>                :    *  This is an uglified reverse(_BidirectionalIterator,
-<span class="lineNum">    1076 </span>                :    *                              _BidirectionalIterator)
-<span class="lineNum">    1077 </span>                :    *  overloaded for random access iterators.
-<span class="lineNum">    1078 </span>                :   */
-<span class="lineNum">    1079 </span>                :   template&lt;typename _RandomAccessIterator&gt;
-<span class="lineNum">    1080 </span>                :     void
-<span class="lineNum">    1081 </span>                :     __reverse(_RandomAccessIterator __first, _RandomAccessIterator __last,
-<span class="lineNum">    1082 </span>                :               random_access_iterator_tag)
-<span class="lineNum">    1083 </span>                :     {
-<span class="lineNum">    1084 </span>                :       if (__first == __last)
-<span class="lineNum">    1085 </span>                :         return;
-<span class="lineNum">    1086 </span>                :       --__last;
-<span class="lineNum">    1087 </span>                :       while (__first &lt; __last)
-<span class="lineNum">    1088 </span>                :         {
-<span class="lineNum">    1089 </span>                :           std::iter_swap(__first, __last);
-<span class="lineNum">    1090 </span>                :           ++__first;
-<span class="lineNum">    1091 </span>                :           --__last;
-<span class="lineNum">    1092 </span>                :         }
-<span class="lineNum">    1093 </span>                :     }
-<span class="lineNum">    1094 </span>                : 
-<span class="lineNum">    1095 </span>                :   /**
-<span class="lineNum">    1096 </span>                :    *  @brief Reverse a sequence.
-<span class="lineNum">    1097 </span>                :    *  @param  first  A bidirectional iterator.
-<span class="lineNum">    1098 </span>                :    *  @param  last   A bidirectional iterator.
-<span class="lineNum">    1099 </span>                :    *  @return   reverse() returns no value.
-<span class="lineNum">    1100 </span>                :    *
-<span class="lineNum">    1101 </span>                :    *  Reverses the order of the elements in the range @p [first,last),
-<span class="lineNum">    1102 </span>                :    *  so that the first element becomes the last etc.
-<span class="lineNum">    1103 </span>                :    *  For every @c i such that @p 0&lt;=i&lt;=(last-first)/2), @p reverse()
-<span class="lineNum">    1104 </span>                :    *  swaps @p *(first+i) and @p *(last-(i+1))
-<span class="lineNum">    1105 </span>                :   */
-<span class="lineNum">    1106 </span>                :   template&lt;typename _BidirectionalIterator&gt;
-<span class="lineNum">    1107 </span>                :     inline void
-<span class="lineNum">    1108 </span>                :     reverse(_BidirectionalIterator __first, _BidirectionalIterator __last)
-<span class="lineNum">    1109 </span>                :     {
-<span class="lineNum">    1110 </span>                :       // concept requirements
-<span class="lineNum">    1111 </span>                :       __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept&lt;
-<span class="lineNum">    1112 </span>                :                                   _BidirectionalIterator&gt;)
-<span class="lineNum">    1113 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    1114 </span>                :       std::__reverse(__first, __last, std::__iterator_category(__first));
-<span class="lineNum">    1115 </span>                :     }
-<span class="lineNum">    1116 </span>                : 
-<span class="lineNum">    1117 </span>                :   /**
-<span class="lineNum">    1118 </span>                :    *  @brief Copy a sequence, reversing its elements.
-<span class="lineNum">    1119 </span>                :    *  @param  first   A bidirectional iterator.
-<span class="lineNum">    1120 </span>                :    *  @param  last    A bidirectional iterator.
-<span class="lineNum">    1121 </span>                :    *  @param  result  An output iterator.
-<span class="lineNum">    1122 </span>                :    *  @return  An iterator designating the end of the resulting sequence.
-<span class="lineNum">    1123 </span>                :    *
-<span class="lineNum">    1124 </span>                :    *  Copies the elements in the range @p [first,last) to the range
-<span class="lineNum">    1125 </span>                :    *  @p [result,result+(last-first)) such that the order of the
-<span class="lineNum">    1126 </span>                :    *  elements is reversed.
-<span class="lineNum">    1127 </span>                :    *  For every @c i such that @p 0&lt;=i&lt;=(last-first), @p reverse_copy()
-<span class="lineNum">    1128 </span>                :    *  performs the assignment @p *(result+(last-first)-i) = *(first+i).
-<span class="lineNum">    1129 </span>                :    *  The ranges @p [first,last) and @p [result,result+(last-first))
-<span class="lineNum">    1130 </span>                :    *  must not overlap.
-<span class="lineNum">    1131 </span>                :   */
-<span class="lineNum">    1132 </span>                :   template&lt;typename _BidirectionalIterator, typename _OutputIterator&gt;
-<span class="lineNum">    1133 </span>                :     _OutputIterator
-<span class="lineNum">    1134 </span>                :     reverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last,
-<span class="lineNum">    1135 </span>                :                              _OutputIterator __result)
-<span class="lineNum">    1136 </span>                :     {
-<span class="lineNum">    1137 </span>                :       // concept requirements
-<span class="lineNum">    1138 </span>                :       __glibcxx_function_requires(_BidirectionalIteratorConcept&lt;
-<span class="lineNum">    1139 </span>                :                                   _BidirectionalIterator&gt;)
-<span class="lineNum">    1140 </span>                :       __glibcxx_function_requires(_OutputIteratorConcept&lt;_OutputIterator,
-<span class="lineNum">    1141 </span>                :                 typename iterator_traits&lt;_BidirectionalIterator&gt;::value_type&gt;)
-<span class="lineNum">    1142 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    1143 </span>                : 
-<span class="lineNum">    1144 </span>                :       while (__first != __last)
-<span class="lineNum">    1145 </span>                :         {
-<span class="lineNum">    1146 </span>                :           --__last;
-<span class="lineNum">    1147 </span>                :           *__result = *__last;
-<span class="lineNum">    1148 </span>                :           ++__result;
-<span class="lineNum">    1149 </span>                :         }
-<span class="lineNum">    1150 </span>                :       return __result;
-<span class="lineNum">    1151 </span>                :     }
-<span class="lineNum">    1152 </span>                : 
-<span class="lineNum">    1153 </span>                :   /**
-<span class="lineNum">    1154 </span>                :    *  This is a helper function for the rotate algorithm specialized on RAIs.
-<span class="lineNum">    1155 </span>                :    *  It returns the greatest common divisor of two integer values.
-<span class="lineNum">    1156 </span>                :   */
-<span class="lineNum">    1157 </span>                :   template&lt;typename _EuclideanRingElement&gt;
-<span class="lineNum">    1158 </span>                :     _EuclideanRingElement
-<span class="lineNum">    1159 </span>                :     __gcd(_EuclideanRingElement __m, _EuclideanRingElement __n)
-<span class="lineNum">    1160 </span>                :     {
-<span class="lineNum">    1161 </span>                :       while (__n != 0)
-<span class="lineNum">    1162 </span>                :         {
-<span class="lineNum">    1163 </span>                :           _EuclideanRingElement __t = __m % __n;
-<span class="lineNum">    1164 </span>                :           __m = __n;
-<span class="lineNum">    1165 </span>                :           __n = __t;
-<span class="lineNum">    1166 </span>                :         }
-<span class="lineNum">    1167 </span>                :       return __m;
-<span class="lineNum">    1168 </span>                :     }
-<span class="lineNum">    1169 </span>                : 
-<span class="lineNum">    1170 </span>                :   /// This is a helper function for the rotate algorithm.
-<span class="lineNum">    1171 </span>                :   template&lt;typename _ForwardIterator&gt;
-<span class="lineNum">    1172 </span>                :     void
-<span class="lineNum">    1173 </span>                :     __rotate(_ForwardIterator __first,
-<span class="lineNum">    1174 </span>                :              _ForwardIterator __middle,
-<span class="lineNum">    1175 </span>                :              _ForwardIterator __last,
-<span class="lineNum">    1176 </span>                :              forward_iterator_tag)
-<span class="lineNum">    1177 </span>                :     {
-<span class="lineNum">    1178 </span>                :       if (__first == __middle || __last  == __middle)
-<span class="lineNum">    1179 </span>                :         return;
-<span class="lineNum">    1180 </span>                : 
-<span class="lineNum">    1181 </span>                :       _ForwardIterator __first2 = __middle;
-<span class="lineNum">    1182 </span>                :       do
-<span class="lineNum">    1183 </span>                :         {
-<span class="lineNum">    1184 </span>                :           std::iter_swap(__first, __first2);
-<span class="lineNum">    1185 </span>                :           ++__first;
-<span class="lineNum">    1186 </span>                :           ++__first2;
-<span class="lineNum">    1187 </span>                :           if (__first == __middle)
-<span class="lineNum">    1188 </span>                :             __middle = __first2;
-<span class="lineNum">    1189 </span>                :         }
-<span class="lineNum">    1190 </span>                :       while (__first2 != __last);
-<span class="lineNum">    1191 </span>                : 
-<span class="lineNum">    1192 </span>                :       __first2 = __middle;
-<span class="lineNum">    1193 </span>                : 
-<span class="lineNum">    1194 </span>                :       while (__first2 != __last)
-<span class="lineNum">    1195 </span>                :         {
-<span class="lineNum">    1196 </span>                :           std::iter_swap(__first, __first2);
-<span class="lineNum">    1197 </span>                :           ++__first;
-<span class="lineNum">    1198 </span>                :           ++__first2;
-<span class="lineNum">    1199 </span>                :           if (__first == __middle)
-<span class="lineNum">    1200 </span>                :             __middle = __first2;
-<span class="lineNum">    1201 </span>                :           else if (__first2 == __last)
-<span class="lineNum">    1202 </span>                :             __first2 = __middle;
-<span class="lineNum">    1203 </span>                :         }
-<span class="lineNum">    1204 </span>                :     }
-<span class="lineNum">    1205 </span>                : 
-<span class="lineNum">    1206 </span>                :    /// This is a helper function for the rotate algorithm.
-<span class="lineNum">    1207 </span>                :   template&lt;typename _BidirectionalIterator&gt;
-<span class="lineNum">    1208 </span>                :     void
-<span class="lineNum">    1209 </span>                :     __rotate(_BidirectionalIterator __first,
-<span class="lineNum">    1210 </span>                :              _BidirectionalIterator __middle,
-<span class="lineNum">    1211 </span>                :              _BidirectionalIterator __last,
-<span class="lineNum">    1212 </span>                :               bidirectional_iterator_tag)
-<span class="lineNum">    1213 </span>                :     {
-<span class="lineNum">    1214 </span>                :       // concept requirements
-<span class="lineNum">    1215 </span>                :       __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept&lt;
-<span class="lineNum">    1216 </span>                :                                   _BidirectionalIterator&gt;)
-<span class="lineNum">    1217 </span>                : 
-<span class="lineNum">    1218 </span>                :       if (__first == __middle || __last  == __middle)
-<span class="lineNum">    1219 </span>                :         return;
-<span class="lineNum">    1220 </span>                : 
-<span class="lineNum">    1221 </span>                :       std::__reverse(__first,  __middle, bidirectional_iterator_tag());
-<span class="lineNum">    1222 </span>                :       std::__reverse(__middle, __last,   bidirectional_iterator_tag());
-<span class="lineNum">    1223 </span>                : 
-<span class="lineNum">    1224 </span>                :       while (__first != __middle &amp;&amp; __middle != __last)
-<span class="lineNum">    1225 </span>                :         {
-<span class="lineNum">    1226 </span>                :           std::iter_swap(__first, --__last);
-<span class="lineNum">    1227 </span>                :           ++__first;
-<span class="lineNum">    1228 </span>                :         }
-<span class="lineNum">    1229 </span>                : 
-<span class="lineNum">    1230 </span>                :       if (__first == __middle)
-<span class="lineNum">    1231 </span>                :         std::__reverse(__middle, __last,   bidirectional_iterator_tag());
-<span class="lineNum">    1232 </span>                :       else
-<span class="lineNum">    1233 </span>                :         std::__reverse(__first,  __middle, bidirectional_iterator_tag());
-<span class="lineNum">    1234 </span>                :     }
-<span class="lineNum">    1235 </span>                : 
-<span class="lineNum">    1236 </span>                :   /// This is a helper function for the rotate algorithm.
-<span class="lineNum">    1237 </span>                :   template&lt;typename _RandomAccessIterator&gt;
-<span class="lineNum">    1238 </span>                :     void
-<span class="lineNum">    1239 </span>                :     __rotate(_RandomAccessIterator __first,
-<span class="lineNum">    1240 </span>                :              _RandomAccessIterator __middle,
-<span class="lineNum">    1241 </span>                :              _RandomAccessIterator __last,
-<span class="lineNum">    1242 </span>                :              random_access_iterator_tag)
-<span class="lineNum">    1243 </span>                :     {
-<span class="lineNum">    1244 </span>                :       // concept requirements
-<span class="lineNum">    1245 </span>                :       __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept&lt;
-<span class="lineNum">    1246 </span>                :                                   _RandomAccessIterator&gt;)
-<span class="lineNum">    1247 </span>                : 
-<span class="lineNum">    1248 </span>                :       if (__first == __middle || __last  == __middle)
-<span class="lineNum">    1249 </span>                :         return;
-<span class="lineNum">    1250 </span>                : 
-<span class="lineNum">    1251 </span>                :       typedef typename iterator_traits&lt;_RandomAccessIterator&gt;::difference_type
-<span class="lineNum">    1252 </span>                :         _Distance;
-<span class="lineNum">    1253 </span>                :       typedef typename iterator_traits&lt;_RandomAccessIterator&gt;::value_type
-<span class="lineNum">    1254 </span>                :         _ValueType;
-<span class="lineNum">    1255 </span>                : 
-<span class="lineNum">    1256 </span>                :       const _Distance __n = __last   - __first;
-<span class="lineNum">    1257 </span>                :       const _Distance __k = __middle - __first;
-<span class="lineNum">    1258 </span>                :       const _Distance __l = __n - __k;
-<span class="lineNum">    1259 </span>                : 
-<span class="lineNum">    1260 </span>                :       if (__k == __l)
-<span class="lineNum">    1261 </span>                :         {
-<span class="lineNum">    1262 </span>                :           std::swap_ranges(__first, __middle, __middle);
-<span class="lineNum">    1263 </span>                :           return;
-<span class="lineNum">    1264 </span>                :         }
-<span class="lineNum">    1265 </span>                : 
-<span class="lineNum">    1266 </span>                :       const _Distance __d = std::__gcd(__n, __k);
-<span class="lineNum">    1267 </span>                : 
-<span class="lineNum">    1268 </span>                :       for (_Distance __i = 0; __i &lt; __d; __i++)
-<span class="lineNum">    1269 </span>                :         {
-<span class="lineNum">    1270 </span>                :           _ValueType __tmp = _GLIBCXX_MOVE(*__first);
-<span class="lineNum">    1271 </span>                :           _RandomAccessIterator __p = __first;
-<span class="lineNum">    1272 </span>                : 
-<span class="lineNum">    1273 </span>                :           if (__k &lt; __l)
-<span class="lineNum">    1274 </span>                :             {
-<span class="lineNum">    1275 </span>                :               for (_Distance __j = 0; __j &lt; __l / __d; __j++)
-<span class="lineNum">    1276 </span>                :                 {
-<span class="lineNum">    1277 </span>                :                   if (__p &gt; __first + __l)
-<span class="lineNum">    1278 </span>                :                     {
-<span class="lineNum">    1279 </span>                :                       *__p = _GLIBCXX_MOVE(*(__p - __l));
-<span class="lineNum">    1280 </span>                :                       __p -= __l;
-<span class="lineNum">    1281 </span>                :                     }
-<span class="lineNum">    1282 </span>                : 
-<span class="lineNum">    1283 </span>                :                   *__p = _GLIBCXX_MOVE(*(__p + __k));
-<span class="lineNum">    1284 </span>                :                   __p += __k;
-<span class="lineNum">    1285 </span>                :                 }
-<span class="lineNum">    1286 </span>                :             }
-<span class="lineNum">    1287 </span>                :           else
-<span class="lineNum">    1288 </span>                :             {
-<span class="lineNum">    1289 </span>                :               for (_Distance __j = 0; __j &lt; __k / __d - 1; __j ++)
-<span class="lineNum">    1290 </span>                :                 {
-<span class="lineNum">    1291 </span>                :                   if (__p &lt; __last - __k)
-<span class="lineNum">    1292 </span>                :                     {
-<span class="lineNum">    1293 </span>                :                       *__p = _GLIBCXX_MOVE(*(__p + __k));
-<span class="lineNum">    1294 </span>                :                       __p += __k;
-<span class="lineNum">    1295 </span>                :                     }
-<span class="lineNum">    1296 </span>                :                   *__p = _GLIBCXX_MOVE(*(__p - __l));
-<span class="lineNum">    1297 </span>                :                   __p -= __l;
-<span class="lineNum">    1298 </span>                :                 }
-<span class="lineNum">    1299 </span>                :             }
-<span class="lineNum">    1300 </span>                : 
-<span class="lineNum">    1301 </span>                :           *__p = _GLIBCXX_MOVE(__tmp);
-<span class="lineNum">    1302 </span>                :           ++__first;
-<span class="lineNum">    1303 </span>                :         }
-<span class="lineNum">    1304 </span>                :     }
-<span class="lineNum">    1305 </span>                : 
-<span class="lineNum">    1306 </span>                :   /**
-<span class="lineNum">    1307 </span>                :    *  @brief Rotate the elements of a sequence.
-<span class="lineNum">    1308 </span>                :    *  @param  first   A forward iterator.
-<span class="lineNum">    1309 </span>                :    *  @param  middle  A forward iterator.
-<span class="lineNum">    1310 </span>                :    *  @param  last    A forward iterator.
-<span class="lineNum">    1311 </span>                :    *  @return  Nothing.
-<span class="lineNum">    1312 </span>                :    *
-<span class="lineNum">    1313 </span>                :    *  Rotates the elements of the range @p [first,last) by @p (middle-first)
-<span class="lineNum">    1314 </span>                :    *  positions so that the element at @p middle is moved to @p first, the
-<span class="lineNum">    1315 </span>                :    *  element at @p middle+1 is moved to @first+1 and so on for each element
-<span class="lineNum">    1316 </span>                :    *  in the range @p [first,last).
-<span class="lineNum">    1317 </span>                :    *
-<span class="lineNum">    1318 </span>                :    *  This effectively swaps the ranges @p [first,middle) and
-<span class="lineNum">    1319 </span>                :    *  @p [middle,last).
-<span class="lineNum">    1320 </span>                :    *
-<span class="lineNum">    1321 </span>                :    *  Performs @p *(first+(n+(last-middle))%(last-first))=*(first+n) for
-<span class="lineNum">    1322 </span>                :    *  each @p n in the range @p [0,last-first).
-<span class="lineNum">    1323 </span>                :   */
-<span class="lineNum">    1324 </span>                :   template&lt;typename _ForwardIterator&gt;
-<span class="lineNum">    1325 </span>                :     inline void
-<span class="lineNum">    1326 </span>                :     rotate(_ForwardIterator __first, _ForwardIterator __middle,
-<span class="lineNum">    1327 </span>                :            _ForwardIterator __last)
-<span class="lineNum">    1328 </span>                :     {
-<span class="lineNum">    1329 </span>                :       // concept requirements
-<span class="lineNum">    1330 </span>                :       __glibcxx_function_requires(_Mutable_ForwardIteratorConcept&lt;
-<span class="lineNum">    1331 </span>                :                                   _ForwardIterator&gt;)
-<span class="lineNum">    1332 </span>                :       __glibcxx_requires_valid_range(__first, __middle);
-<span class="lineNum">    1333 </span>                :       __glibcxx_requires_valid_range(__middle, __last);
-<span class="lineNum">    1334 </span>                : 
-<span class="lineNum">    1335 </span>                :       typedef typename iterator_traits&lt;_ForwardIterator&gt;::iterator_category
-<span class="lineNum">    1336 </span>                :         _IterType;
-<span class="lineNum">    1337 </span>                :       std::__rotate(__first, __middle, __last, _IterType());
-<span class="lineNum">    1338 </span>                :     }
-<span class="lineNum">    1339 </span>                : 
-<span class="lineNum">    1340 </span>                :   /**
-<span class="lineNum">    1341 </span>                :    *  @brief Copy a sequence, rotating its elements.
-<span class="lineNum">    1342 </span>                :    *  @param  first   A forward iterator.
-<span class="lineNum">    1343 </span>                :    *  @param  middle  A forward iterator.
-<span class="lineNum">    1344 </span>                :    *  @param  last    A forward iterator.
-<span class="lineNum">    1345 </span>                :    *  @param  result  An output iterator.
-<span class="lineNum">    1346 </span>                :    *  @return   An iterator designating the end of the resulting sequence.
-<span class="lineNum">    1347 </span>                :    *
-<span class="lineNum">    1348 </span>                :    *  Copies the elements of the range @p [first,last) to the range
-<span class="lineNum">    1349 </span>                :    *  beginning at @result, rotating the copied elements by @p (middle-first)
-<span class="lineNum">    1350 </span>                :    *  positions so that the element at @p middle is moved to @p result, the
-<span class="lineNum">    1351 </span>                :    *  element at @p middle+1 is moved to @result+1 and so on for each element
-<span class="lineNum">    1352 </span>                :    *  in the range @p [first,last).
-<span class="lineNum">    1353 </span>                :    *
-<span class="lineNum">    1354 </span>                :    *  Performs @p *(result+(n+(last-middle))%(last-first))=*(first+n) for
-<span class="lineNum">    1355 </span>                :    *  each @p n in the range @p [0,last-first).
-<span class="lineNum">    1356 </span>                :   */
-<span class="lineNum">    1357 </span>                :   template&lt;typename _ForwardIterator, typename _OutputIterator&gt;
-<span class="lineNum">    1358 </span>                :     _OutputIterator
-<span class="lineNum">    1359 </span>                :     rotate_copy(_ForwardIterator __first, _ForwardIterator __middle,
-<span class="lineNum">    1360 </span>                :                 _ForwardIterator __last, _OutputIterator __result)
-<span class="lineNum">    1361 </span>                :     {
-<span class="lineNum">    1362 </span>                :       // concept requirements
-<span class="lineNum">    1363 </span>                :       __glibcxx_function_requires(_ForwardIteratorConcept&lt;_ForwardIterator&gt;)
-<span class="lineNum">    1364 </span>                :       __glibcxx_function_requires(_OutputIteratorConcept&lt;_OutputIterator,
-<span class="lineNum">    1365 </span>                :                 typename iterator_traits&lt;_ForwardIterator&gt;::value_type&gt;)
-<span class="lineNum">    1366 </span>                :       __glibcxx_requires_valid_range(__first, __middle);
-<span class="lineNum">    1367 </span>                :       __glibcxx_requires_valid_range(__middle, __last);
-<span class="lineNum">    1368 </span>                : 
-<span class="lineNum">    1369 </span>                :       return std::copy(__first, __middle,
-<span class="lineNum">    1370 </span>                :                        std::copy(__middle, __last, __result));
-<span class="lineNum">    1371 </span>                :     }
-<span class="lineNum">    1372 </span>                : 
-<span class="lineNum">    1373 </span>                :   /// This is a helper function...
-<span class="lineNum">    1374 </span>                :   template&lt;typename _ForwardIterator, typename _Predicate&gt;
-<span class="lineNum">    1375 </span>                :     _ForwardIterator
-<span class="lineNum">    1376 </span>                :     __partition(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">    1377 </span>                :                 _Predicate __pred, forward_iterator_tag)
-<span class="lineNum">    1378 </span>                :     {
-<span class="lineNum">    1379 </span>                :       if (__first == __last)
-<span class="lineNum">    1380 </span>                :         return __first;
-<span class="lineNum">    1381 </span>                : 
-<span class="lineNum">    1382 </span>                :       while (__pred(*__first))
-<span class="lineNum">    1383 </span>                :         if (++__first == __last)
-<span class="lineNum">    1384 </span>                :           return __first;
-<span class="lineNum">    1385 </span>                : 
-<span class="lineNum">    1386 </span>                :       _ForwardIterator __next = __first;
-<span class="lineNum">    1387 </span>                : 
-<span class="lineNum">    1388 </span>                :       while (++__next != __last)
-<span class="lineNum">    1389 </span>                :         if (__pred(*__next))
-<span class="lineNum">    1390 </span>                :           {
-<span class="lineNum">    1391 </span>                :             std::iter_swap(__first, __next);
-<span class="lineNum">    1392 </span>                :             ++__first;
-<span class="lineNum">    1393 </span>                :           }
-<span class="lineNum">    1394 </span>                : 
-<span class="lineNum">    1395 </span>                :       return __first;
-<span class="lineNum">    1396 </span>                :     }
-<span class="lineNum">    1397 </span>                : 
-<span class="lineNum">    1398 </span>                :   /// This is a helper function...
-<span class="lineNum">    1399 </span>                :   template&lt;typename _BidirectionalIterator, typename _Predicate&gt;
-<span class="lineNum">    1400 </span>                :     _BidirectionalIterator
-<span class="lineNum">    1401 </span>                :     __partition(_BidirectionalIterator __first, _BidirectionalIterator __last,
-<span class="lineNum">    1402 </span>                :                 _Predicate __pred, bidirectional_iterator_tag)
-<span class="lineNum">    1403 </span>                :     {
-<span class="lineNum">    1404 </span>                :       while (true)
-<span class="lineNum">    1405 </span>                :         {
-<span class="lineNum">    1406 </span>                :           while (true)
-<span class="lineNum">    1407 </span>                :             if (__first == __last)
-<span class="lineNum">    1408 </span>                :               return __first;
-<span class="lineNum">    1409 </span>                :             else if (__pred(*__first))
-<span class="lineNum">    1410 </span>                :               ++__first;
-<span class="lineNum">    1411 </span>                :             else
-<span class="lineNum">    1412 </span>                :               break;
-<span class="lineNum">    1413 </span>                :           --__last;
-<span class="lineNum">    1414 </span>                :           while (true)
-<span class="lineNum">    1415 </span>                :             if (__first == __last)
-<span class="lineNum">    1416 </span>                :               return __first;
-<span class="lineNum">    1417 </span>                :             else if (!bool(__pred(*__last)))
-<span class="lineNum">    1418 </span>                :               --__last;
-<span class="lineNum">    1419 </span>                :             else
-<span class="lineNum">    1420 </span>                :               break;
-<span class="lineNum">    1421 </span>                :           std::iter_swap(__first, __last);
-<span class="lineNum">    1422 </span>                :           ++__first;
-<span class="lineNum">    1423 </span>                :         }
-<span class="lineNum">    1424 </span>                :     }
-<span class="lineNum">    1425 </span>                : 
-<span class="lineNum">    1426 </span>                :   // partition
-<span class="lineNum">    1427 </span>                : 
-<span class="lineNum">    1428 </span>                :   /// This is a helper function...
-<span class="lineNum">    1429 </span>                :   template&lt;typename _ForwardIterator, typename _Predicate, typename _Distance&gt;
-<span class="lineNum">    1430 </span>                :     _ForwardIterator
-<span class="lineNum">    1431 </span>                :     __inplace_stable_partition(_ForwardIterator __first,
-<span class="lineNum">    1432 </span>                :                                _ForwardIterator __last,
-<span class="lineNum">    1433 </span>                :                                _Predicate __pred, _Distance __len)
-<span class="lineNum">    1434 </span>                :     {
-<span class="lineNum">    1435 </span>                :       if (__len == 1)
-<span class="lineNum">    1436 </span>                :         return __pred(*__first) ? __last : __first;
-<span class="lineNum">    1437 </span>                :       _ForwardIterator __middle = __first;
-<span class="lineNum">    1438 </span>                :       std::advance(__middle, __len / 2);
-<span class="lineNum">    1439 </span>                :       _ForwardIterator __begin = std::__inplace_stable_partition(__first,
-<span class="lineNum">    1440 </span>                :                                                                  __middle,
-<span class="lineNum">    1441 </span>                :                                                                  __pred,
-<span class="lineNum">    1442 </span>                :                                                                  __len / 2);
-<span class="lineNum">    1443 </span>                :       _ForwardIterator __end = std::__inplace_stable_partition(__middle, __last,
-<span class="lineNum">    1444 </span>                :                                                                __pred,
-<span class="lineNum">    1445 </span>                :                                                                __len
-<span class="lineNum">    1446 </span>                :                                                                - __len / 2);
-<span class="lineNum">    1447 </span>                :       std::rotate(__begin, __middle, __end);
-<span class="lineNum">    1448 </span>                :       std::advance(__begin, std::distance(__middle, __end));
-<span class="lineNum">    1449 </span>                :       return __begin;
-<span class="lineNum">    1450 </span>                :     }
-<span class="lineNum">    1451 </span>                : 
-<span class="lineNum">    1452 </span>                :   /// This is a helper function...
-<span class="lineNum">    1453 </span>                :   template&lt;typename _ForwardIterator, typename _Pointer, typename _Predicate,
-<span class="lineNum">    1454 </span>                :            typename _Distance&gt;
-<span class="lineNum">    1455 </span>                :     _ForwardIterator
-<span class="lineNum">    1456 </span>                :     __stable_partition_adaptive(_ForwardIterator __first,
-<span class="lineNum">    1457 </span>                :                                 _ForwardIterator __last,
-<span class="lineNum">    1458 </span>                :                                 _Predicate __pred, _Distance __len,
-<span class="lineNum">    1459 </span>                :                                 _Pointer __buffer,
-<span class="lineNum">    1460 </span>                :                                 _Distance __buffer_size)
-<span class="lineNum">    1461 </span>                :     {
-<span class="lineNum">    1462 </span>                :       if (__len &lt;= __buffer_size)
-<span class="lineNum">    1463 </span>                :         {
-<span class="lineNum">    1464 </span>                :           _ForwardIterator __result1 = __first;
-<span class="lineNum">    1465 </span>                :           _Pointer __result2 = __buffer;
-<span class="lineNum">    1466 </span>                :           for (; __first != __last; ++__first)
-<span class="lineNum">    1467 </span>                :             if (__pred(*__first))
-<span class="lineNum">    1468 </span>                :               {
-<span class="lineNum">    1469 </span>                :                 *__result1 = *__first;
-<span class="lineNum">    1470 </span>                :                 ++__result1;
-<span class="lineNum">    1471 </span>                :               }
-<span class="lineNum">    1472 </span>                :             else
-<span class="lineNum">    1473 </span>                :               {
-<span class="lineNum">    1474 </span>                :                 *__result2 = *__first;
-<span class="lineNum">    1475 </span>                :                 ++__result2;
-<span class="lineNum">    1476 </span>                :               }
-<span class="lineNum">    1477 </span>                :           std::copy(__buffer, __result2, __result1);
-<span class="lineNum">    1478 </span>                :           return __result1;
-<span class="lineNum">    1479 </span>                :         }
-<span class="lineNum">    1480 </span>                :       else
-<span class="lineNum">    1481 </span>                :         {
-<span class="lineNum">    1482 </span>                :           _ForwardIterator __middle = __first;
-<span class="lineNum">    1483 </span>                :           std::advance(__middle, __len / 2);
-<span class="lineNum">    1484 </span>                :           _ForwardIterator __begin =
-<span class="lineNum">    1485 </span>                :             std::__stable_partition_adaptive(__first, __middle, __pred,
-<span class="lineNum">    1486 </span>                :                                              __len / 2, __buffer,
-<span class="lineNum">    1487 </span>                :                                              __buffer_size);
-<span class="lineNum">    1488 </span>                :           _ForwardIterator __end =
-<span class="lineNum">    1489 </span>                :             std::__stable_partition_adaptive(__middle, __last, __pred,
-<span class="lineNum">    1490 </span>                :                                              __len - __len / 2,
-<span class="lineNum">    1491 </span>                :                                              __buffer, __buffer_size);
-<span class="lineNum">    1492 </span>                :           std::rotate(__begin, __middle, __end);
-<span class="lineNum">    1493 </span>                :           std::advance(__begin, std::distance(__middle, __end));
-<span class="lineNum">    1494 </span>                :           return __begin;
-<span class="lineNum">    1495 </span>                :         }
-<span class="lineNum">    1496 </span>                :     }
-<span class="lineNum">    1497 </span>                : 
-<span class="lineNum">    1498 </span>                :   /**
-<span class="lineNum">    1499 </span>                :    *  @brief Move elements for which a predicate is true to the beginning
-<span class="lineNum">    1500 </span>                :    *         of a sequence, preserving relative ordering.
-<span class="lineNum">    1501 </span>                :    *  @param  first   A forward iterator.
-<span class="lineNum">    1502 </span>                :    *  @param  last    A forward iterator.
-<span class="lineNum">    1503 </span>                :    *  @param  pred    A predicate functor.
-<span class="lineNum">    1504 </span>                :    *  @return  An iterator @p middle such that @p pred(i) is true for each
-<span class="lineNum">    1505 </span>                :    *  iterator @p i in the range @p [first,middle) and false for each @p i
-<span class="lineNum">    1506 </span>                :    *  in the range @p [middle,last).
-<span class="lineNum">    1507 </span>                :    *
-<span class="lineNum">    1508 </span>                :    *  Performs the same function as @p partition() with the additional
-<span class="lineNum">    1509 </span>                :    *  guarantee that the relative ordering of elements in each group is
-<span class="lineNum">    1510 </span>                :    *  preserved, so any two elements @p x and @p y in the range
-<span class="lineNum">    1511 </span>                :    *  @p [first,last) such that @p pred(x)==pred(y) will have the same
-<span class="lineNum">    1512 </span>                :    *  relative ordering after calling @p stable_partition().
-<span class="lineNum">    1513 </span>                :   */
-<span class="lineNum">    1514 </span>                :   template&lt;typename _ForwardIterator, typename _Predicate&gt;
-<span class="lineNum">    1515 </span>                :     _ForwardIterator
-<span class="lineNum">    1516 </span>                :     stable_partition(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">    1517 </span>                :                      _Predicate __pred)
-<span class="lineNum">    1518 </span>                :     {
-<span class="lineNum">    1519 </span>                :       // concept requirements
-<span class="lineNum">    1520 </span>                :       __glibcxx_function_requires(_Mutable_ForwardIteratorConcept&lt;
-<span class="lineNum">    1521 </span>                :                                   _ForwardIterator&gt;)
-<span class="lineNum">    1522 </span>                :       __glibcxx_function_requires(_UnaryPredicateConcept&lt;_Predicate,
-<span class="lineNum">    1523 </span>                :             typename iterator_traits&lt;_ForwardIterator&gt;::value_type&gt;)
-<span class="lineNum">    1524 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    1525 </span>                : 
-<span class="lineNum">    1526 </span>                :       if (__first == __last)
-<span class="lineNum">    1527 </span>                :         return __first;
-<span class="lineNum">    1528 </span>                :       else
-<span class="lineNum">    1529 </span>                :         {
-<span class="lineNum">    1530 </span>                :           typedef typename iterator_traits&lt;_ForwardIterator&gt;::value_type
-<span class="lineNum">    1531 </span>                :             _ValueType;
-<span class="lineNum">    1532 </span>                :           typedef typename iterator_traits&lt;_ForwardIterator&gt;::difference_type
-<span class="lineNum">    1533 </span>                :             _DistanceType;
-<span class="lineNum">    1534 </span>                : 
-<span class="lineNum">    1535 </span>                :           _Temporary_buffer&lt;_ForwardIterator, _ValueType&gt; __buf(__first,
-<span class="lineNum">    1536 </span>                :                                                                 __last);
-<span class="lineNum">    1537 </span>                :         if (__buf.size() &gt; 0)
-<span class="lineNum">    1538 </span>                :           return
-<span class="lineNum">    1539 </span>                :             std::__stable_partition_adaptive(__first, __last, __pred,
-<span class="lineNum">    1540 </span>                :                                           _DistanceType(__buf.requested_size()),
-<span class="lineNum">    1541 </span>                :                                           __buf.begin(),
-<span class="lineNum">    1542 </span>                :                                           _DistanceType(__buf.size()));
-<span class="lineNum">    1543 </span>                :         else
-<span class="lineNum">    1544 </span>                :           return
-<span class="lineNum">    1545 </span>                :             std::__inplace_stable_partition(__first, __last, __pred,
-<span class="lineNum">    1546 </span>                :                                          _DistanceType(__buf.requested_size()));
-<span class="lineNum">    1547 </span>                :         }
-<span class="lineNum">    1548 </span>                :     }
-<span class="lineNum">    1549 </span>                : 
-<span class="lineNum">    1550 </span>                :   /// This is a helper function for the sort routines.
-<span class="lineNum">    1551 </span>                :   template&lt;typename _RandomAccessIterator&gt;
-<span class="lineNum">    1552 </span>                :     void
-<span class="lineNum">    1553 </span>                :     __heap_select(_RandomAccessIterator __first,
-<span class="lineNum">    1554 </span>                :                   _RandomAccessIterator __middle,
-<span class="lineNum">    1555 </span><span class="lineNoCov">              0 :                   _RandomAccessIterator __last)</span>
-<span class="lineNum">    1556 </span>                :     {
-<span class="lineNum">    1557 </span><span class="lineNoCov">              0 :       std::make_heap(__first, __middle);</span>
-<span class="lineNum">    1558 </span><span class="lineNoCov">              0 :       for (_RandomAccessIterator __i = __middle; __i &lt; __last; ++__i)</span>
-<span class="lineNum">    1559 </span><span class="lineNoCov">              0 :         if (*__i &lt; *__first)</span>
-<span class="lineNum">    1560 </span><span class="lineNoCov">              0 :           std::__pop_heap(__first, __middle, __i);</span>
-<span class="lineNum">    1561 </span><span class="lineNoCov">              0 :     }</span>
-<span class="lineNum">    1562 </span>                : 
-<span class="lineNum">    1563 </span>                :   /// This is a helper function for the sort routines.
-<span class="lineNum">    1564 </span>                :   template&lt;typename _RandomAccessIterator, typename _Compare&gt;
-<span class="lineNum">    1565 </span>                :     void
-<span class="lineNum">    1566 </span>                :     __heap_select(_RandomAccessIterator __first,
-<span class="lineNum">    1567 </span>                :                   _RandomAccessIterator __middle,
-<span class="lineNum">    1568 </span><span class="lineNoCov">              0 :                   _RandomAccessIterator __last, _Compare __comp)</span>
-<span class="lineNum">    1569 </span>                :     {
-<span class="lineNum">    1570 </span><span class="lineNoCov">              0 :       std::make_heap(__first, __middle, __comp);</span>
-<span class="lineNum">    1571 </span><span class="lineNoCov">              0 :       for (_RandomAccessIterator __i = __middle; __i &lt; __last; ++__i)</span>
-<span class="lineNum">    1572 </span><span class="lineNoCov">              0 :         if (__comp(*__i, *__first))</span>
-<span class="lineNum">    1573 </span><span class="lineNoCov">              0 :           std::__pop_heap(__first, __middle, __i, __comp);</span>
-<span class="lineNum">    1574 </span><span class="lineNoCov">              0 :     }</span>
-<span class="lineNum">    1575 </span>                : 
-<span class="lineNum">    1576 </span>                :   // partial_sort
-<span class="lineNum">    1577 </span>                : 
-<span class="lineNum">    1578 </span>                :   /**
-<span class="lineNum">    1579 </span>                :    *  @brief Copy the smallest elements of a sequence.
-<span class="lineNum">    1580 </span>                :    *  @param  first   An iterator.
-<span class="lineNum">    1581 </span>                :    *  @param  last    Another iterator.
-<span class="lineNum">    1582 </span>                :    *  @param  result_first   A random-access iterator.
-<span class="lineNum">    1583 </span>                :    *  @param  result_last    Another random-access iterator.
-<span class="lineNum">    1584 </span>                :    *  @return   An iterator indicating the end of the resulting sequence.
-<span class="lineNum">    1585 </span>                :    *
-<span class="lineNum">    1586 </span>                :    *  Copies and sorts the smallest N values from the range @p [first,last)
-<span class="lineNum">    1587 </span>                :    *  to the range beginning at @p result_first, where the number of
-<span class="lineNum">    1588 </span>                :    *  elements to be copied, @p N, is the smaller of @p (last-first) and
-<span class="lineNum">    1589 </span>                :    *  @p (result_last-result_first).
-<span class="lineNum">    1590 </span>                :    *  After the sort if @p i and @j are iterators in the range
-<span class="lineNum">    1591 </span>                :    *  @p [result_first,result_first+N) such that @i precedes @j then
-<span class="lineNum">    1592 </span>                :    *  @p *j&lt;*i is false.
-<span class="lineNum">    1593 </span>                :    *  The value returned is @p result_first+N.
-<span class="lineNum">    1594 </span>                :   */
-<span class="lineNum">    1595 </span>                :   template&lt;typename _InputIterator, typename _RandomAccessIterator&gt;
-<span class="lineNum">    1596 </span>                :     _RandomAccessIterator
-<span class="lineNum">    1597 </span>                :     partial_sort_copy(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">    1598 </span>                :                       _RandomAccessIterator __result_first,
-<span class="lineNum">    1599 </span>                :                       _RandomAccessIterator __result_last)
-<span class="lineNum">    1600 </span>                :     {
-<span class="lineNum">    1601 </span>                :       typedef typename iterator_traits&lt;_InputIterator&gt;::value_type
-<span class="lineNum">    1602 </span>                :         _InputValueType;
-<span class="lineNum">    1603 </span>                :       typedef typename iterator_traits&lt;_RandomAccessIterator&gt;::value_type
-<span class="lineNum">    1604 </span>                :         _OutputValueType;
-<span class="lineNum">    1605 </span>                :       typedef typename iterator_traits&lt;_RandomAccessIterator&gt;::difference_type
-<span class="lineNum">    1606 </span>                :         _DistanceType;
-<span class="lineNum">    1607 </span>                : 
-<span class="lineNum">    1608 </span>                :       // concept requirements
-<span class="lineNum">    1609 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator&gt;)
-<span class="lineNum">    1610 </span>                :       __glibcxx_function_requires(_ConvertibleConcept&lt;_InputValueType,
-<span class="lineNum">    1611 </span>                :                                   _OutputValueType&gt;)
-<span class="lineNum">    1612 </span>                :       __glibcxx_function_requires(_LessThanOpConcept&lt;_InputValueType,
-<span class="lineNum">    1613 </span>                :                                                      _OutputValueType&gt;)
-<span class="lineNum">    1614 </span>                :       __glibcxx_function_requires(_LessThanComparableConcept&lt;_OutputValueType&gt;)
-<span class="lineNum">    1615 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    1616 </span>                :       __glibcxx_requires_valid_range(__result_first, __result_last);
-<span class="lineNum">    1617 </span>                : 
-<span class="lineNum">    1618 </span>                :       if (__result_first == __result_last)
-<span class="lineNum">    1619 </span>                :         return __result_last;
-<span class="lineNum">    1620 </span>                :       _RandomAccessIterator __result_real_last = __result_first;
-<span class="lineNum">    1621 </span>                :       while(__first != __last &amp;&amp; __result_real_last != __result_last)
-<span class="lineNum">    1622 </span>                :         {
-<span class="lineNum">    1623 </span>                :           *__result_real_last = *__first;
-<span class="lineNum">    1624 </span>                :           ++__result_real_last;
-<span class="lineNum">    1625 </span>                :           ++__first;
-<span class="lineNum">    1626 </span>                :         }
-<span class="lineNum">    1627 </span>                :       std::make_heap(__result_first, __result_real_last);
-<span class="lineNum">    1628 </span>                :       while (__first != __last)
-<span class="lineNum">    1629 </span>                :         {
-<span class="lineNum">    1630 </span>                :           if (*__first &lt; *__result_first)
-<span class="lineNum">    1631 </span>                :             std::__adjust_heap(__result_first, _DistanceType(0),
-<span class="lineNum">    1632 </span>                :                                _DistanceType(__result_real_last
-<span class="lineNum">    1633 </span>                :                                              - __result_first),
-<span class="lineNum">    1634 </span>                :                                _InputValueType(*__first));
-<span class="lineNum">    1635 </span>                :           ++__first;
-<span class="lineNum">    1636 </span>                :         }
-<span class="lineNum">    1637 </span>                :       std::sort_heap(__result_first, __result_real_last);
-<span class="lineNum">    1638 </span>                :       return __result_real_last;
-<span class="lineNum">    1639 </span>                :     }
-<span class="lineNum">    1640 </span>                : 
-<span class="lineNum">    1641 </span>                :   /**
-<span class="lineNum">    1642 </span>                :    *  @brief Copy the smallest elements of a sequence using a predicate for
-<span class="lineNum">    1643 </span>                :    *         comparison.
-<span class="lineNum">    1644 </span>                :    *  @param  first   An input iterator.
-<span class="lineNum">    1645 </span>                :    *  @param  last    Another input iterator.
-<span class="lineNum">    1646 </span>                :    *  @param  result_first   A random-access iterator.
-<span class="lineNum">    1647 </span>                :    *  @param  result_last    Another random-access iterator.
-<span class="lineNum">    1648 </span>                :    *  @param  comp    A comparison functor.
-<span class="lineNum">    1649 </span>                :    *  @return   An iterator indicating the end of the resulting sequence.
-<span class="lineNum">    1650 </span>                :    *
-<span class="lineNum">    1651 </span>                :    *  Copies and sorts the smallest N values from the range @p [first,last)
-<span class="lineNum">    1652 </span>                :    *  to the range beginning at @p result_first, where the number of
-<span class="lineNum">    1653 </span>                :    *  elements to be copied, @p N, is the smaller of @p (last-first) and
-<span class="lineNum">    1654 </span>                :    *  @p (result_last-result_first).
-<span class="lineNum">    1655 </span>                :    *  After the sort if @p i and @j are iterators in the range
-<span class="lineNum">    1656 </span>                :    *  @p [result_first,result_first+N) such that @i precedes @j then
-<span class="lineNum">    1657 </span>                :    *  @p comp(*j,*i) is false.
-<span class="lineNum">    1658 </span>                :    *  The value returned is @p result_first+N.
-<span class="lineNum">    1659 </span>                :   */
-<span class="lineNum">    1660 </span>                :   template&lt;typename _InputIterator, typename _RandomAccessIterator, typename _Compare&gt;
-<span class="lineNum">    1661 </span>                :     _RandomAccessIterator
-<span class="lineNum">    1662 </span>                :     partial_sort_copy(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">    1663 </span>                :                       _RandomAccessIterator __result_first,
-<span class="lineNum">    1664 </span>                :                       _RandomAccessIterator __result_last,
-<span class="lineNum">    1665 </span>                :                       _Compare __comp)
-<span class="lineNum">    1666 </span>                :     {
-<span class="lineNum">    1667 </span>                :       typedef typename iterator_traits&lt;_InputIterator&gt;::value_type
-<span class="lineNum">    1668 </span>                :         _InputValueType;
-<span class="lineNum">    1669 </span>                :       typedef typename iterator_traits&lt;_RandomAccessIterator&gt;::value_type
-<span class="lineNum">    1670 </span>                :         _OutputValueType;
-<span class="lineNum">    1671 </span>                :       typedef typename iterator_traits&lt;_RandomAccessIterator&gt;::difference_type
-<span class="lineNum">    1672 </span>                :         _DistanceType;
-<span class="lineNum">    1673 </span>                : 
-<span class="lineNum">    1674 </span>                :       // concept requirements
-<span class="lineNum">    1675 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator&gt;)
-<span class="lineNum">    1676 </span>                :       __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept&lt;
-<span class="lineNum">    1677 </span>                :                                   _RandomAccessIterator&gt;)
-<span class="lineNum">    1678 </span>                :       __glibcxx_function_requires(_ConvertibleConcept&lt;_InputValueType,
-<span class="lineNum">    1679 </span>                :                                   _OutputValueType&gt;)
-<span class="lineNum">    1680 </span>                :       __glibcxx_function_requires(_BinaryPredicateConcept&lt;_Compare,
-<span class="lineNum">    1681 </span>                :                                   _InputValueType, _OutputValueType&gt;)
-<span class="lineNum">    1682 </span>                :       __glibcxx_function_requires(_BinaryPredicateConcept&lt;_Compare,
-<span class="lineNum">    1683 </span>                :                                   _OutputValueType, _OutputValueType&gt;)
-<span class="lineNum">    1684 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    1685 </span>                :       __glibcxx_requires_valid_range(__result_first, __result_last);
-<span class="lineNum">    1686 </span>                : 
-<span class="lineNum">    1687 </span>                :       if (__result_first == __result_last)
-<span class="lineNum">    1688 </span>                :         return __result_last;
-<span class="lineNum">    1689 </span>                :       _RandomAccessIterator __result_real_last = __result_first;
-<span class="lineNum">    1690 </span>                :       while(__first != __last &amp;&amp; __result_real_last != __result_last)
-<span class="lineNum">    1691 </span>                :         {
-<span class="lineNum">    1692 </span>                :           *__result_real_last = *__first;
-<span class="lineNum">    1693 </span>                :           ++__result_real_last;
-<span class="lineNum">    1694 </span>                :           ++__first;
-<span class="lineNum">    1695 </span>                :         }
-<span class="lineNum">    1696 </span>                :       std::make_heap(__result_first, __result_real_last, __comp);
-<span class="lineNum">    1697 </span>                :       while (__first != __last)
-<span class="lineNum">    1698 </span>                :         {
-<span class="lineNum">    1699 </span>                :           if (__comp(*__first, *__result_first))
-<span class="lineNum">    1700 </span>                :             std::__adjust_heap(__result_first, _DistanceType(0),
-<span class="lineNum">    1701 </span>                :                                _DistanceType(__result_real_last
-<span class="lineNum">    1702 </span>                :                                              - __result_first),
-<span class="lineNum">    1703 </span>                :                                _InputValueType(*__first),
-<span class="lineNum">    1704 </span>                :                                __comp);
-<span class="lineNum">    1705 </span>                :           ++__first;
-<span class="lineNum">    1706 </span>                :         }
-<span class="lineNum">    1707 </span>                :       std::sort_heap(__result_first, __result_real_last, __comp);
-<span class="lineNum">    1708 </span>                :       return __result_real_last;
-<span class="lineNum">    1709 </span>                :     }
-<span class="lineNum">    1710 </span>                : 
-<span class="lineNum">    1711 </span>                :   /// This is a helper function for the sort routine.
-<span class="lineNum">    1712 </span>                :   template&lt;typename _RandomAccessIterator, typename _Tp&gt;
-<span class="lineNum">    1713 </span>                :     void
-<span class="lineNum">    1714 </span><span class="lineCov">           2369 :     __unguarded_linear_insert(_RandomAccessIterator __last, _Tp __val)</span>
-<span class="lineNum">    1715 </span>                :     {
-<span class="lineNum">    1716 </span><span class="lineCov">           2369 :       _RandomAccessIterator __next = __last;</span>
-<span class="lineNum">    1717 </span><span class="lineCov">           2369 :       --__next;</span>
-<span class="lineNum">    1718 </span><span class="lineCov">           5033 :       while (__val &lt; *__next)</span>
-<span class="lineNum">    1719 </span>                :         {
-<span class="lineNum">    1720 </span><span class="lineCov">            295 :           *__last = *__next;</span>
-<span class="lineNum">    1721 </span><span class="lineCov">            295 :           __last = __next;</span>
-<span class="lineNum">    1722 </span><span class="lineCov">            295 :           --__next;</span>
-<span class="lineNum">    1723 </span>                :         }
-<span class="lineNum">    1724 </span><span class="lineCov">           2369 :       *__last = __val;</span>
-<span class="lineNum">    1725 </span><span class="lineCov">           2369 :     }</span>
-<span class="lineNum">    1726 </span>                : 
-<span class="lineNum">    1727 </span>                :   /// This is a helper function for the sort routine.
-<span class="lineNum">    1728 </span>                :   template&lt;typename _RandomAccessIterator, typename _Tp, typename _Compare&gt;
-<span class="lineNum">    1729 </span>                :     void
-<span class="lineNum">    1730 </span>                :     __unguarded_linear_insert(_RandomAccessIterator __last, _Tp __val,
-<span class="lineNum">    1731 </span><span class="lineCov">          48163 :                               _Compare __comp)</span>
-<span class="lineNum">    1732 </span>                :     {
-<span class="lineNum">    1733 </span><span class="lineCov">          48163 :       _RandomAccessIterator __next = __last;</span>
-<span class="lineNum">    1734 </span><span class="lineCov">          48163 :       --__next;</span>
-<span class="lineNum">    1735 </span><span class="lineCov">         273339 :       while (__comp(__val, *__next))</span>
-<span class="lineNum">    1736 </span>                :         {
-<span class="lineNum">    1737 </span><span class="lineCov">         177013 :           *__last = *__next;</span>
-<span class="lineNum">    1738 </span><span class="lineCov">         177013 :           __last = __next;</span>
-<span class="lineNum">    1739 </span><span class="lineCov">         177013 :           --__next;</span>
-<span class="lineNum">    1740 </span>                :         }
-<span class="lineNum">    1741 </span><span class="lineCov">          48163 :       *__last = __val;</span>
-<span class="lineNum">    1742 </span><span class="lineCov">          48163 :     }</span>
-<span class="lineNum">    1743 </span>                : 
-<span class="lineNum">    1744 </span>                :   /// This is a helper function for the sort routine.
-<span class="lineNum">    1745 </span>                :   template&lt;typename _RandomAccessIterator&gt;
-<span class="lineNum">    1746 </span>                :     void
-<span class="lineNum">    1747 </span>                :     __insertion_sort(_RandomAccessIterator __first,
-<span class="lineNum">    1748 </span><span class="lineCov">             81 :                      _RandomAccessIterator __last)</span>
-<span class="lineNum">    1749 </span>                :     {
-<span class="lineNum">    1750 </span><span class="lineCov">             81 :       if (__first == __last)</span>
-<span class="lineNum">    1751 </span><span class="lineNoCov">              0 :         return;</span>
-<span class="lineNum">    1752 </span>                : 
-<span class="lineNum">    1753 </span><span class="lineCov">            503 :       for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)</span>
-<span class="lineNum">    1754 </span>                :         {
-<span class="lineNum">    1755 </span>                :           typename iterator_traits&lt;_RandomAccessIterator&gt;::value_type
-<span class="lineNum">    1756 </span><span class="lineCov">            422 :             __val = *__i;</span>
-<span class="lineNum">    1757 </span><span class="lineCov">            422 :           if (__val &lt; *__first)</span>
-<span class="lineNum">    1758 </span>                :             {
-<span class="lineNum">    1759 </span><span class="lineCov">            151 :               std::copy_backward(__first, __i, __i + 1);</span>
-<span class="lineNum">    1760 </span><span class="lineCov">            151 :               *__first = __val;</span>
-<span class="lineNum">    1761 </span>                :             }
-<span class="lineNum">    1762 </span>                :           else
-<span class="lineNum">    1763 </span><span class="lineCov">            271 :             std::__unguarded_linear_insert(__i, __val);</span>
-<span class="lineNum">    1764 </span>                :         }
-<span class="lineNum">    1765 </span>                :     }
-<span class="lineNum">    1766 </span>                : 
-<span class="lineNum">    1767 </span>                :   /// This is a helper function for the sort routine.
-<span class="lineNum">    1768 </span>                :   template&lt;typename _RandomAccessIterator, typename _Compare&gt;
-<span class="lineNum">    1769 </span>                :     void
-<span class="lineNum">    1770 </span>                :     __insertion_sort(_RandomAccessIterator __first,
-<span class="lineNum">    1771 </span><span class="lineCov">           3938 :                      _RandomAccessIterator __last, _Compare __comp)</span>
-<span class="lineNum">    1772 </span>                :     {
-<span class="lineNum">    1773 </span><span class="lineCov">           3938 :       if (__first == __last) return;</span>
-<span class="lineNum">    1774 </span>                : 
-<span class="lineNum">    1775 </span><span class="lineCov">          55255 :       for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)</span>
-<span class="lineNum">    1776 </span>                :         {
-<span class="lineNum">    1777 </span>                :           typename iterator_traits&lt;_RandomAccessIterator&gt;::value_type
-<span class="lineNum">    1778 </span><span class="lineCov">          51317 :             __val = *__i;</span>
-<span class="lineNum">    1779 </span><span class="lineCov">          51317 :           if (__comp(__val, *__first))</span>
-<span class="lineNum">    1780 </span>                :             {
-<span class="lineNum">    1781 </span><span class="lineCov">           7625 :               std::copy_backward(__first, __i, __i + 1);</span>
-<span class="lineNum">    1782 </span><span class="lineCov">           7625 :               *__first = __val;</span>
-<span class="lineNum">    1783 </span>                :             }
-<span class="lineNum">    1784 </span>                :           else
-<span class="lineNum">    1785 </span><span class="lineCov">          43692 :             std::__unguarded_linear_insert(__i, __val, __comp);</span>
-<span class="lineNum">    1786 </span>                :         }
-<span class="lineNum">    1787 </span>                :     }
-<span class="lineNum">    1788 </span>                : 
-<span class="lineNum">    1789 </span>                :   /// This is a helper function for the sort routine.
-<span class="lineNum">    1790 </span>                :   template&lt;typename _RandomAccessIterator&gt;
-<span class="lineNum">    1791 </span>                :     inline void
-<span class="lineNum">    1792 </span>                :     __unguarded_insertion_sort(_RandomAccessIterator __first,
-<span class="lineNum">    1793 </span><span class="lineCov">              3 :                                _RandomAccessIterator __last)</span>
-<span class="lineNum">    1794 </span>                :     {
-<span class="lineNum">    1795 </span>                :       typedef typename iterator_traits&lt;_RandomAccessIterator&gt;::value_type
-<span class="lineNum">    1796 </span>                :         _ValueType;
-<span class="lineNum">    1797 </span>                : 
-<span class="lineNum">    1798 </span><span class="lineCov">           2101 :       for (_RandomAccessIterator __i = __first; __i != __last; ++__i)</span>
-<span class="lineNum">    1799 </span><span class="lineCov">           2098 :         std::__unguarded_linear_insert(__i, _ValueType(*__i));</span>
-<span class="lineNum">    1800 </span><span class="lineCov">              3 :     }</span>
-<span class="lineNum">    1801 </span>                : 
-<span class="lineNum">    1802 </span>                :   /// This is a helper function for the sort routine.
-<span class="lineNum">    1803 </span>                :   template&lt;typename _RandomAccessIterator, typename _Compare&gt;
-<span class="lineNum">    1804 </span>                :     inline void
-<span class="lineNum">    1805 </span>                :     __unguarded_insertion_sort(_RandomAccessIterator __first,
-<span class="lineNum">    1806 </span><span class="lineCov">            261 :                                _RandomAccessIterator __last, _Compare __comp)</span>
-<span class="lineNum">    1807 </span>                :     {
-<span class="lineNum">    1808 </span>                :       typedef typename iterator_traits&lt;_RandomAccessIterator&gt;::value_type
-<span class="lineNum">    1809 </span>                :         _ValueType;
-<span class="lineNum">    1810 </span>                : 
-<span class="lineNum">    1811 </span><span class="lineCov">           4732 :       for (_RandomAccessIterator __i = __first; __i != __last; ++__i)</span>
-<span class="lineNum">    1812 </span><span class="lineCov">           4471 :         std::__unguarded_linear_insert(__i, _ValueType(*__i), __comp);</span>
-<span class="lineNum">    1813 </span><span class="lineCov">            261 :     }</span>
-<span class="lineNum">    1814 </span>                : 
-<span class="lineNum">    1815 </span>                :   /**
-<span class="lineNum">    1816 </span>                :    *  @doctodo
-<span class="lineNum">    1817 </span>                :    *  This controls some aspect of the sort routines.
-<span class="lineNum">    1818 </span>                :   */
-<span class="lineNum">    1819 </span>                :   enum { _S_threshold = 16 };
-<span class="lineNum">    1820 </span>                : 
-<span class="lineNum">    1821 </span>                :   /// This is a helper function for the sort routine.
-<span class="lineNum">    1822 </span>                :   template&lt;typename _RandomAccessIterator&gt;
-<span class="lineNum">    1823 </span>                :     void
-<span class="lineNum">    1824 </span>                :     __final_insertion_sort(_RandomAccessIterator __first,
-<span class="lineNum">    1825 </span><span class="lineCov">             81 :                            _RandomAccessIterator __last)</span>
-<span class="lineNum">    1826 </span>                :     {
-<span class="lineNum">    1827 </span><span class="lineCov">             81 :       if (__last - __first &gt; int(_S_threshold))</span>
-<span class="lineNum">    1828 </span>                :         {
-<span class="lineNum">    1829 </span><span class="lineCov">              3 :           std::__insertion_sort(__first, __first + int(_S_threshold));</span>
-<span class="lineNum">    1830 </span><span class="lineCov">              3 :           std::__unguarded_insertion_sort(__first + int(_S_threshold), __last);</span>
-<span class="lineNum">    1831 </span>                :         }
-<span class="lineNum">    1832 </span>                :       else
-<span class="lineNum">    1833 </span><span class="lineCov">             78 :         std::__insertion_sort(__first, __last);</span>
-<span class="lineNum">    1834 </span><span class="lineCov">             81 :     }</span>
-<span class="lineNum">    1835 </span>                : 
-<span class="lineNum">    1836 </span>                :   /// This is a helper function for the sort routine.
-<span class="lineNum">    1837 </span>                :   template&lt;typename _RandomAccessIterator, typename _Compare&gt;
-<span class="lineNum">    1838 </span>                :     void
-<span class="lineNum">    1839 </span>                :     __final_insertion_sort(_RandomAccessIterator __first,
-<span class="lineNum">    1840 </span><span class="lineCov">           3938 :                            _RandomAccessIterator __last, _Compare __comp)</span>
-<span class="lineNum">    1841 </span>                :     {
-<span class="lineNum">    1842 </span><span class="lineCov">           3938 :       if (__last - __first &gt; int(_S_threshold))</span>
-<span class="lineNum">    1843 </span>                :         {
-<span class="lineNum">    1844 </span><span class="lineCov">            261 :           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);</span>
-<span class="lineNum">    1845 </span><span class="lineCov">            261 :           std::__unguarded_insertion_sort(__first + int(_S_threshold), __last,</span>
-<span class="lineNum">    1846 </span>                :                                           __comp);
-<span class="lineNum">    1847 </span>                :         }
-<span class="lineNum">    1848 </span>                :       else
-<span class="lineNum">    1849 </span><span class="lineCov">           3677 :         std::__insertion_sort(__first, __last, __comp);</span>
-<span class="lineNum">    1850 </span><span class="lineCov">           3938 :     }</span>
-<span class="lineNum">    1851 </span>                : 
-<span class="lineNum">    1852 </span>                :   /// This is a helper function...
-<span class="lineNum">    1853 </span>                :   template&lt;typename _RandomAccessIterator, typename _Tp&gt;
-<span class="lineNum">    1854 </span>                :     _RandomAccessIterator
-<span class="lineNum">    1855 </span>                :     __unguarded_partition(_RandomAccessIterator __first,
-<span class="lineNum">    1856 </span><span class="lineCov">            183 :                           _RandomAccessIterator __last, _Tp __pivot)</span>
-<span class="lineNum">    1857 </span>                :     {
-<span class="lineNum">    1858 </span><span class="lineCov">             50 :       while (true)</span>
-<span class="lineNum">    1859 </span>                :         {
-<span class="lineNum">    1860 </span><span class="lineCov">           6596 :           while (*__first &lt; __pivot)</span>
-<span class="lineNum">    1861 </span><span class="lineCov">           6230 :             ++__first;</span>
-<span class="lineNum">    1862 </span><span class="lineCov">            183 :           --__last;</span>
-<span class="lineNum">    1863 </span><span class="lineCov">           6480 :           while (__pivot &lt; *__last)</span>
-<span class="lineNum">    1864 </span><span class="lineCov">           6114 :             --__last;</span>
-<span class="lineNum">    1865 </span><span class="lineCov">            183 :           if (!(__first &lt; __last))</span>
-<span class="lineNum">    1866 </span><span class="lineCov">            133 :             return __first;</span>
-<span class="lineNum">    1867 </span><span class="lineCov">             50 :           std::iter_swap(__first, __last);</span>
-<span class="lineNum">    1868 </span><span class="lineCov">             50 :           ++__first;</span>
-<span class="lineNum">    1869 </span>                :         }
-<span class="lineNum">    1870 </span>                :     }
-<span class="lineNum">    1871 </span>                : 
-<span class="lineNum">    1872 </span>                :   /// This is a helper function...
-<span class="lineNum">    1873 </span>                :   template&lt;typename _RandomAccessIterator, typename _Tp, typename _Compare&gt;
-<span class="lineNum">    1874 </span>                :     _RandomAccessIterator
-<span class="lineNum">    1875 </span>                :     __unguarded_partition(_RandomAccessIterator __first,
-<span class="lineNum">    1876 </span>                :                           _RandomAccessIterator __last,
-<span class="lineNum">    1877 </span><span class="lineCov">           7740 :                           _Tp __pivot, _Compare __comp)</span>
-<span class="lineNum">    1878 </span>                :     {
-<span class="lineNum">    1879 </span><span class="lineCov">           7030 :       while (true)</span>
-<span class="lineNum">    1880 </span>                :         {
-<span class="lineNum">    1881 </span><span class="lineCov">          25088 :           while (__comp(*__first, __pivot))</span>
-<span class="lineNum">    1882 </span><span class="lineCov">           9608 :             ++__first;</span>
-<span class="lineNum">    1883 </span><span class="lineCov">           7740 :           --__last;</span>
-<span class="lineNum">    1884 </span><span class="lineCov">          23207 :           while (__comp(__pivot, *__last))</span>
-<span class="lineNum">    1885 </span><span class="lineCov">           7727 :             --__last;</span>
-<span class="lineNum">    1886 </span><span class="lineCov">           7740 :           if (!(__first &lt; __last))</span>
-<span class="lineNum">    1887 </span><span class="lineCov">            710 :             return __first;</span>
-<span class="lineNum">    1888 </span><span class="lineCov">           7030 :           std::iter_swap(__first, __last);</span>
-<span class="lineNum">    1889 </span><span class="lineCov">           7030 :           ++__first;</span>
-<span class="lineNum">    1890 </span>                :         }
-<span class="lineNum">    1891 </span>                :     }
-<span class="lineNum">    1892 </span>                : 
-<span class="lineNum">    1893 </span>                :   /// This is a helper function for the sort routine.
-<span class="lineNum">    1894 </span>                :   template&lt;typename _RandomAccessIterator, typename _Size&gt;
-<span class="lineNum">    1895 </span>                :     void
-<span class="lineNum">    1896 </span>                :     __introsort_loop(_RandomAccessIterator __first,
-<span class="lineNum">    1897 </span>                :                      _RandomAccessIterator __last,
-<span class="lineNum">    1898 </span><span class="lineCov">            214 :                      _Size __depth_limit)</span>
-<span class="lineNum">    1899 </span>                :     {
-<span class="lineNum">    1900 </span>                :       typedef typename iterator_traits&lt;_RandomAccessIterator&gt;::value_type
-<span class="lineNum">    1901 </span>                :         _ValueType;
-<span class="lineNum">    1902 </span>                : 
-<span class="lineNum">    1903 </span><span class="lineCov">            561 :       while (__last - __first &gt; int(_S_threshold))</span>
-<span class="lineNum">    1904 </span>                :         {
-<span class="lineNum">    1905 </span><span class="lineCov">            133 :           if (__depth_limit == 0)</span>
-<span class="lineNum">    1906 </span>                :             {
-<span class="lineNum">    1907 </span><span class="lineNoCov">              0 :               _GLIBCXX_STD_P::partial_sort(__first, __last, __last);</span>
-<span class="lineNum">    1908 </span><span class="lineNoCov">              0 :               return;</span>
-<span class="lineNum">    1909 </span>                :             }
-<span class="lineNum">    1910 </span><span class="lineCov">            133 :           --__depth_limit;</span>
-<span class="lineNum">    1911 </span>                :           _RandomAccessIterator __cut =
-<span class="lineNum">    1912 </span>                :             std::__unguarded_partition(__first, __last,
-<span class="lineNum">    1913 </span>                :                                        _ValueType(std::__median(*__first,
-<span class="lineNum">    1914 </span>                :                                                                 *(__first
-<span class="lineNum">    1915 </span>                :                                                                   + (__last
-<span class="lineNum">    1916 </span>                :                                                                      - __first)
-<span class="lineNum">    1917 </span>                :                                                                   / 2),
-<span class="lineNum">    1918 </span>                :                                                                 *(__last
-<span class="lineNum">    1919 </span><span class="lineCov">            133 :                                                                   - 1))));</span>
-<span class="lineNum">    1920 </span><span class="lineCov">            133 :           std::__introsort_loop(__cut, __last, __depth_limit);</span>
-<span class="lineNum">    1921 </span><span class="lineCov">            133 :           __last = __cut;</span>
-<span class="lineNum">    1922 </span>                :         }
-<span class="lineNum">    1923 </span>                :     }
-<span class="lineNum">    1924 </span>                : 
-<span class="lineNum">    1925 </span>                :   /// This is a helper function for the sort routine.
-<span class="lineNum">    1926 </span>                :   template&lt;typename _RandomAccessIterator, typename _Size, typename _Compare&gt;
-<span class="lineNum">    1927 </span>                :     void
-<span class="lineNum">    1928 </span>                :     __introsort_loop(_RandomAccessIterator __first,
-<span class="lineNum">    1929 </span>                :                      _RandomAccessIterator __last,
-<span class="lineNum">    1930 </span><span class="lineCov">           4648 :                      _Size __depth_limit, _Compare __comp)</span>
-<span class="lineNum">    1931 </span>                :     {
-<span class="lineNum">    1932 </span>                :       typedef typename iterator_traits&lt;_RandomAccessIterator&gt;::value_type
-<span class="lineNum">    1933 </span>                :         _ValueType;
-<span class="lineNum">    1934 </span>                : 
-<span class="lineNum">    1935 </span><span class="lineCov">          10006 :       while (__last - __first &gt; int(_S_threshold))</span>
-<span class="lineNum">    1936 </span>                :         {
-<span class="lineNum">    1937 </span><span class="lineCov">            710 :           if (__depth_limit == 0)</span>
-<span class="lineNum">    1938 </span>                :             {
-<span class="lineNum">    1939 </span><span class="lineNoCov">              0 :               _GLIBCXX_STD_P::partial_sort(__first, __last, __last, __comp);</span>
-<span class="lineNum">    1940 </span><span class="lineNoCov">              0 :               return;</span>
-<span class="lineNum">    1941 </span>                :             }
-<span class="lineNum">    1942 </span><span class="lineCov">            710 :           --__depth_limit;</span>
-<span class="lineNum">    1943 </span>                :           _RandomAccessIterator __cut =
-<span class="lineNum">    1944 </span>                :             std::__unguarded_partition(__first, __last,
-<span class="lineNum">    1945 </span>                :                                        _ValueType(std::__median(*__first,
-<span class="lineNum">    1946 </span>                :                                                                 *(__first
-<span class="lineNum">    1947 </span>                :                                                                   + (__last
-<span class="lineNum">    1948 </span>                :                                                                      - __first)
-<span class="lineNum">    1949 </span>                :                                                                   / 2),
-<span class="lineNum">    1950 </span>                :                                                                 *(__last - 1),
-<span class="lineNum">    1951 </span>                :                                                                 __comp)),
-<span class="lineNum">    1952 </span><span class="lineCov">            710 :                                        __comp);</span>
-<span class="lineNum">    1953 </span><span class="lineCov">            710 :           std::__introsort_loop(__cut, __last, __depth_limit, __comp);</span>
-<span class="lineNum">    1954 </span><span class="lineCov">            710 :           __last = __cut;</span>
-<span class="lineNum">    1955 </span>                :         }
-<span class="lineNum">    1956 </span>                :     }
-<span class="lineNum">    1957 </span>                : 
-<span class="lineNum">    1958 </span>                :   /// This is a helper function for the sort routines.  Precondition: __n &gt; 0.
-<span class="lineNum">    1959 </span>                :   template&lt;typename _Size&gt;
-<span class="lineNum">    1960 </span>                :     inline _Size
-<span class="lineNum">    1961 </span>                :     __lg(_Size __n)
-<span class="lineNum">    1962 </span>                :     {
-<span class="lineNum">    1963 </span>                :       _Size __k;
-<span class="lineNum">    1964 </span>                :       for (__k = 0; __n != 0; __n &gt;&gt;= 1)
-<span class="lineNum">    1965 </span>                :         ++__k;
-<span class="lineNum">    1966 </span>                :       return __k - 1;
-<span class="lineNum">    1967 </span>                :     }
-<span class="lineNum">    1968 </span>                : 
-<span class="lineNum">    1969 </span>                :   inline int
-<span class="lineNum">    1970 </span><span class="lineCov">           3946 :   __lg(int __n)</span>
-<span class="lineNum">    1971 </span><span class="lineCov">           3946 :   { return sizeof(int) * __CHAR_BIT__  - 1 - __builtin_clz(__n); }</span>
-<span class="lineNum">    1972 </span>                : 
-<span class="lineNum">    1973 </span>                :   inline long
-<span class="lineNum">    1974 </span>                :   __lg(long __n)
-<span class="lineNum">    1975 </span>                :   { return sizeof(long) * __CHAR_BIT__ - 1 - __builtin_clzl(__n); }
-<span class="lineNum">    1976 </span>                : 
-<span class="lineNum">    1977 </span>                :   inline long long
-<span class="lineNum">    1978 </span>                :   __lg(long long __n)
-<span class="lineNum">    1979 </span>                :   { return sizeof(long long) * __CHAR_BIT__ - 1 - __builtin_clzll(__n); }
-<span class="lineNum">    1980 </span>                : 
-<span class="lineNum">    1981 </span>                :   // sort
-<span class="lineNum">    1982 </span>                : 
-<span class="lineNum">    1983 </span>                :   template&lt;typename _RandomAccessIterator, typename _Size&gt;
-<span class="lineNum">    1984 </span>                :     void
-<span class="lineNum">    1985 </span>                :     __introselect(_RandomAccessIterator __first, _RandomAccessIterator __nth,
-<span class="lineNum">    1986 </span>                :                   _RandomAccessIterator __last, _Size __depth_limit)
-<span class="lineNum">    1987 </span>                :     {
-<span class="lineNum">    1988 </span>                :       typedef typename iterator_traits&lt;_RandomAccessIterator&gt;::value_type
-<span class="lineNum">    1989 </span>                :         _ValueType;
-<span class="lineNum">    1990 </span>                : 
-<span class="lineNum">    1991 </span>                :       while (__last - __first &gt; 3)
-<span class="lineNum">    1992 </span>                :         {
-<span class="lineNum">    1993 </span>                :           if (__depth_limit == 0)
-<span class="lineNum">    1994 </span>                :             {
-<span class="lineNum">    1995 </span>                :               std::__heap_select(__first, __nth + 1, __last);
-<span class="lineNum">    1996 </span>                : 
-<span class="lineNum">    1997 </span>                :               // Place the nth largest element in its final position.
-<span class="lineNum">    1998 </span>                :               std::iter_swap(__first, __nth);
-<span class="lineNum">    1999 </span>                :               return;
-<span class="lineNum">    2000 </span>                :             }
-<span class="lineNum">    2001 </span>                :           --__depth_limit;
-<span class="lineNum">    2002 </span>                :           _RandomAccessIterator __cut =
-<span class="lineNum">    2003 </span>                :             std::__unguarded_partition(__first, __last,
-<span class="lineNum">    2004 </span>                :                                        _ValueType(std::__median(*__first,
-<span class="lineNum">    2005 </span>                :                                                                 *(__first
-<span class="lineNum">    2006 </span>                :                                                                   + (__last
-<span class="lineNum">    2007 </span>                :                                                                      - __first)
-<span class="lineNum">    2008 </span>                :                                                                   / 2),
-<span class="lineNum">    2009 </span>                :                                                                 *(__last
-<span class="lineNum">    2010 </span>                :                                                                   - 1))));
-<span class="lineNum">    2011 </span>                :           if (__cut &lt;= __nth)
-<span class="lineNum">    2012 </span>                :             __first = __cut;
-<span class="lineNum">    2013 </span>                :           else
-<span class="lineNum">    2014 </span>                :             __last = __cut;
-<span class="lineNum">    2015 </span>                :         }
-<span class="lineNum">    2016 </span>                :       std::__insertion_sort(__first, __last);
-<span class="lineNum">    2017 </span>                :     }
-<span class="lineNum">    2018 </span>                : 
-<span class="lineNum">    2019 </span>                :   template&lt;typename _RandomAccessIterator, typename _Size, typename _Compare&gt;
-<span class="lineNum">    2020 </span>                :     void
-<span class="lineNum">    2021 </span>                :     __introselect(_RandomAccessIterator __first, _RandomAccessIterator __nth,
-<span class="lineNum">    2022 </span>                :                   _RandomAccessIterator __last, _Size __depth_limit,
-<span class="lineNum">    2023 </span>                :                   _Compare __comp)
-<span class="lineNum">    2024 </span>                :     {
-<span class="lineNum">    2025 </span>                :       typedef typename iterator_traits&lt;_RandomAccessIterator&gt;::value_type
-<span class="lineNum">    2026 </span>                :         _ValueType;
-<span class="lineNum">    2027 </span>                : 
-<span class="lineNum">    2028 </span>                :       while (__last - __first &gt; 3)
-<span class="lineNum">    2029 </span>                :         {
-<span class="lineNum">    2030 </span>                :           if (__depth_limit == 0)
-<span class="lineNum">    2031 </span>                :             {
-<span class="lineNum">    2032 </span>                :               std::__heap_select(__first, __nth + 1, __last, __comp);
-<span class="lineNum">    2033 </span>                :               // Place the nth largest element in its final position.
-<span class="lineNum">    2034 </span>                :               std::iter_swap(__first, __nth);
-<span class="lineNum">    2035 </span>                :               return;
-<span class="lineNum">    2036 </span>                :             }
-<span class="lineNum">    2037 </span>                :           --__depth_limit;
-<span class="lineNum">    2038 </span>                :           _RandomAccessIterator __cut =
-<span class="lineNum">    2039 </span>                :             std::__unguarded_partition(__first, __last,
-<span class="lineNum">    2040 </span>                :                                        _ValueType(std::__median(*__first,
-<span class="lineNum">    2041 </span>                :                                                                 *(__first
-<span class="lineNum">    2042 </span>                :                                                                   + (__last
-<span class="lineNum">    2043 </span>                :                                                                      - __first)
-<span class="lineNum">    2044 </span>                :                                                                   / 2),
-<span class="lineNum">    2045 </span>                :                                                                 *(__last - 1),
-<span class="lineNum">    2046 </span>                :                                                                 __comp)),
-<span class="lineNum">    2047 </span>                :                                        __comp);
-<span class="lineNum">    2048 </span>                :           if (__cut &lt;= __nth)
-<span class="lineNum">    2049 </span>                :             __first = __cut;
-<span class="lineNum">    2050 </span>                :           else
-<span class="lineNum">    2051 </span>                :             __last = __cut;
-<span class="lineNum">    2052 </span>                :         }
-<span class="lineNum">    2053 </span>                :       std::__insertion_sort(__first, __last, __comp);
-<span class="lineNum">    2054 </span>                :     }
-<span class="lineNum">    2055 </span>                : 
-<span class="lineNum">    2056 </span>                :   // nth_element
-<span class="lineNum">    2057 </span>                : 
-<span class="lineNum">    2058 </span>                :   /**
-<span class="lineNum">    2059 </span>                :    *  @brief Finds the first position in which @a val could be inserted
-<span class="lineNum">    2060 </span>                :    *         without changing the ordering.
-<span class="lineNum">    2061 </span>                :    *  @param  first   An iterator.
-<span class="lineNum">    2062 </span>                :    *  @param  last    Another iterator.
-<span class="lineNum">    2063 </span>                :    *  @param  val     The search term.
-<span class="lineNum">    2064 </span>                :    *  @return         An iterator pointing to the first element &quot;not less
-<span class="lineNum">    2065 </span>                :    *                  than&quot; @a val, or end() if every element is less than 
-<span class="lineNum">    2066 </span>                :    *                  @a val.
-<span class="lineNum">    2067 </span>                :    *  @ingroup binarysearch
-<span class="lineNum">    2068 </span>                :   */
-<span class="lineNum">    2069 </span>                :   template&lt;typename _ForwardIterator, typename _Tp&gt;
-<span class="lineNum">    2070 </span>                :     _ForwardIterator
-<span class="lineNum">    2071 </span>                :     lower_bound(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">    2072 </span>                :                 const _Tp&amp; __val)
-<span class="lineNum">    2073 </span>                :     {
-<span class="lineNum">    2074 </span>                :       typedef typename iterator_traits&lt;_ForwardIterator&gt;::value_type
-<span class="lineNum">    2075 </span>                :         _ValueType;
-<span class="lineNum">    2076 </span>                :       typedef typename iterator_traits&lt;_ForwardIterator&gt;::difference_type
-<span class="lineNum">    2077 </span>                :         _DistanceType;
-<span class="lineNum">    2078 </span>                : 
-<span class="lineNum">    2079 </span>                :       // concept requirements
-<span class="lineNum">    2080 </span>                :       __glibcxx_function_requires(_ForwardIteratorConcept&lt;_ForwardIterator&gt;)
-<span class="lineNum">    2081 </span>                :       __glibcxx_function_requires(_LessThanOpConcept&lt;_ValueType, _Tp&gt;)
-<span class="lineNum">    2082 </span>                :       __glibcxx_requires_partitioned_lower(__first, __last, __val);
-<span class="lineNum">    2083 </span>                : 
-<span class="lineNum">    2084 </span>                :       _DistanceType __len = std::distance(__first, __last);
-<span class="lineNum">    2085 </span>                :       _DistanceType __half;
-<span class="lineNum">    2086 </span>                :       _ForwardIterator __middle;
-<span class="lineNum">    2087 </span>                : 
-<span class="lineNum">    2088 </span>                :       while (__len &gt; 0)
-<span class="lineNum">    2089 </span>                :         {
-<span class="lineNum">    2090 </span>                :           __half = __len &gt;&gt; 1;
-<span class="lineNum">    2091 </span>                :           __middle = __first;
-<span class="lineNum">    2092 </span>                :           std::advance(__middle, __half);
-<span class="lineNum">    2093 </span>                :           if (*__middle &lt; __val)
-<span class="lineNum">    2094 </span>                :             {
-<span class="lineNum">    2095 </span>                :               __first = __middle;
-<span class="lineNum">    2096 </span>                :               ++__first;
-<span class="lineNum">    2097 </span>                :               __len = __len - __half - 1;
-<span class="lineNum">    2098 </span>                :             }
-<span class="lineNum">    2099 </span>                :           else
-<span class="lineNum">    2100 </span>                :             __len = __half;
-<span class="lineNum">    2101 </span>                :         }
-<span class="lineNum">    2102 </span>                :       return __first;
-<span class="lineNum">    2103 </span>                :     }
-<span class="lineNum">    2104 </span>                : 
-<span class="lineNum">    2105 </span>                :   /**
-<span class="lineNum">    2106 </span>                :    *  @brief Finds the first position in which @a val could be inserted
-<span class="lineNum">    2107 </span>                :    *         without changing the ordering.
-<span class="lineNum">    2108 </span>                :    *  @param  first   An iterator.
-<span class="lineNum">    2109 </span>                :    *  @param  last    Another iterator.
-<span class="lineNum">    2110 </span>                :    *  @param  val     The search term.
-<span class="lineNum">    2111 </span>                :    *  @param  comp    A functor to use for comparisons.
-<span class="lineNum">    2112 </span>                :    *  @return  An iterator pointing to the first element &quot;not less than&quot; @a val,
-<span class="lineNum">    2113 </span>                :    *           or end() if every element is less than @a val.
-<span class="lineNum">    2114 </span>                :    *  @ingroup binarysearch
-<span class="lineNum">    2115 </span>                :    *
-<span class="lineNum">    2116 </span>                :    *  The comparison function should have the same effects on ordering as
-<span class="lineNum">    2117 </span>                :    *  the function used for the initial sort.
-<span class="lineNum">    2118 </span>                :   */
-<span class="lineNum">    2119 </span>                :   template&lt;typename _ForwardIterator, typename _Tp, typename _Compare&gt;
-<span class="lineNum">    2120 </span>                :     _ForwardIterator
-<span class="lineNum">    2121 </span>                :     lower_bound(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">    2122 </span>                :                 const _Tp&amp; __val, _Compare __comp)
-<span class="lineNum">    2123 </span>                :     {
-<span class="lineNum">    2124 </span>                :       typedef typename iterator_traits&lt;_ForwardIterator&gt;::value_type
-<span class="lineNum">    2125 </span>                :         _ValueType;
-<span class="lineNum">    2126 </span>                :       typedef typename iterator_traits&lt;_ForwardIterator&gt;::difference_type
-<span class="lineNum">    2127 </span>                :         _DistanceType;
-<span class="lineNum">    2128 </span>                : 
-<span class="lineNum">    2129 </span>                :       // concept requirements
-<span class="lineNum">    2130 </span>                :       __glibcxx_function_requires(_ForwardIteratorConcept&lt;_ForwardIterator&gt;)
-<span class="lineNum">    2131 </span>                :       __glibcxx_function_requires(_BinaryPredicateConcept&lt;_Compare,
-<span class="lineNum">    2132 </span>                :                                   _ValueType, _Tp&gt;)
-<span class="lineNum">    2133 </span>                :       __glibcxx_requires_partitioned_lower_pred(__first, __last,
-<span class="lineNum">    2134 </span>                :                                                 __val, __comp);
-<span class="lineNum">    2135 </span>                : 
-<span class="lineNum">    2136 </span>                :       _DistanceType __len = std::distance(__first, __last);
-<span class="lineNum">    2137 </span>                :       _DistanceType __half;
-<span class="lineNum">    2138 </span>                :       _ForwardIterator __middle;
-<span class="lineNum">    2139 </span>                : 
-<span class="lineNum">    2140 </span>                :       while (__len &gt; 0)
-<span class="lineNum">    2141 </span>                :         {
-<span class="lineNum">    2142 </span>                :           __half = __len &gt;&gt; 1;
-<span class="lineNum">    2143 </span>                :           __middle = __first;
-<span class="lineNum">    2144 </span>                :           std::advance(__middle, __half);
-<span class="lineNum">    2145 </span>                :           if (__comp(*__middle, __val))
-<span class="lineNum">    2146 </span>                :             {
-<span class="lineNum">    2147 </span>                :               __first = __middle;
-<span class="lineNum">    2148 </span>                :               ++__first;
-<span class="lineNum">    2149 </span>                :               __len = __len - __half - 1;
-<span class="lineNum">    2150 </span>                :             }
-<span class="lineNum">    2151 </span>                :           else
-<span class="lineNum">    2152 </span>                :             __len = __half;
-<span class="lineNum">    2153 </span>                :         }
-<span class="lineNum">    2154 </span>                :       return __first;
-<span class="lineNum">    2155 </span>                :     }
-<span class="lineNum">    2156 </span>                : 
-<span class="lineNum">    2157 </span>                :   /**
-<span class="lineNum">    2158 </span>                :    *  @brief Finds the last position in which @a val could be inserted
-<span class="lineNum">    2159 </span>                :    *         without changing the ordering.
-<span class="lineNum">    2160 </span>                :    *  @param  first   An iterator.
-<span class="lineNum">    2161 </span>                :    *  @param  last    Another iterator.
-<span class="lineNum">    2162 </span>                :    *  @param  val     The search term.
-<span class="lineNum">    2163 </span>                :    *  @return  An iterator pointing to the first element greater than @a val,
-<span class="lineNum">    2164 </span>                :    *           or end() if no elements are greater than @a val.
-<span class="lineNum">    2165 </span>                :    *  @ingroup binarysearch
-<span class="lineNum">    2166 </span>                :   */
-<span class="lineNum">    2167 </span>                :   template&lt;typename _ForwardIterator, typename _Tp&gt;
-<span class="lineNum">    2168 </span>                :     _ForwardIterator
-<span class="lineNum">    2169 </span>                :     upper_bound(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">    2170 </span>                :                 const _Tp&amp; __val)
-<span class="lineNum">    2171 </span>                :     {
-<span class="lineNum">    2172 </span>                :       typedef typename iterator_traits&lt;_ForwardIterator&gt;::value_type
-<span class="lineNum">    2173 </span>                :         _ValueType;
-<span class="lineNum">    2174 </span>                :       typedef typename iterator_traits&lt;_ForwardIterator&gt;::difference_type
-<span class="lineNum">    2175 </span>                :         _DistanceType;
-<span class="lineNum">    2176 </span>                : 
-<span class="lineNum">    2177 </span>                :       // concept requirements
-<span class="lineNum">    2178 </span>                :       __glibcxx_function_requires(_ForwardIteratorConcept&lt;_ForwardIterator&gt;)
-<span class="lineNum">    2179 </span>                :       __glibcxx_function_requires(_LessThanOpConcept&lt;_Tp, _ValueType&gt;)
-<span class="lineNum">    2180 </span>                :       __glibcxx_requires_partitioned_upper(__first, __last, __val);
-<span class="lineNum">    2181 </span>                : 
-<span class="lineNum">    2182 </span>                :       _DistanceType __len = std::distance(__first, __last);
-<span class="lineNum">    2183 </span>                :       _DistanceType __half;
-<span class="lineNum">    2184 </span>                :       _ForwardIterator __middle;
-<span class="lineNum">    2185 </span>                : 
-<span class="lineNum">    2186 </span>                :       while (__len &gt; 0)
-<span class="lineNum">    2187 </span>                :         {
-<span class="lineNum">    2188 </span>                :           __half = __len &gt;&gt; 1;
-<span class="lineNum">    2189 </span>                :           __middle = __first;
-<span class="lineNum">    2190 </span>                :           std::advance(__middle, __half);
-<span class="lineNum">    2191 </span>                :           if (__val &lt; *__middle)
-<span class="lineNum">    2192 </span>                :             __len = __half;
-<span class="lineNum">    2193 </span>                :           else
-<span class="lineNum">    2194 </span>                :             {
-<span class="lineNum">    2195 </span>                :               __first = __middle;
-<span class="lineNum">    2196 </span>                :               ++__first;
-<span class="lineNum">    2197 </span>                :               __len = __len - __half - 1;
-<span class="lineNum">    2198 </span>                :             }
-<span class="lineNum">    2199 </span>                :         }
-<span class="lineNum">    2200 </span>                :       return __first;
-<span class="lineNum">    2201 </span>                :     }
-<span class="lineNum">    2202 </span>                : 
-<span class="lineNum">    2203 </span>                :   /**
-<span class="lineNum">    2204 </span>                :    *  @brief Finds the last position in which @a val could be inserted
-<span class="lineNum">    2205 </span>                :    *         without changing the ordering.
-<span class="lineNum">    2206 </span>                :    *  @param  first   An iterator.
-<span class="lineNum">    2207 </span>                :    *  @param  last    Another iterator.
-<span class="lineNum">    2208 </span>                :    *  @param  val     The search term.
-<span class="lineNum">    2209 </span>                :    *  @param  comp    A functor to use for comparisons.
-<span class="lineNum">    2210 </span>                :    *  @return  An iterator pointing to the first element greater than @a val,
-<span class="lineNum">    2211 </span>                :    *           or end() if no elements are greater than @a val.
-<span class="lineNum">    2212 </span>                :    *  @ingroup binarysearch
-<span class="lineNum">    2213 </span>                :    *
-<span class="lineNum">    2214 </span>                :    *  The comparison function should have the same effects on ordering as
-<span class="lineNum">    2215 </span>                :    *  the function used for the initial sort.
-<span class="lineNum">    2216 </span>                :   */
-<span class="lineNum">    2217 </span>                :   template&lt;typename _ForwardIterator, typename _Tp, typename _Compare&gt;
-<span class="lineNum">    2218 </span>                :     _ForwardIterator
-<span class="lineNum">    2219 </span>                :     upper_bound(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">    2220 </span>                :                 const _Tp&amp; __val, _Compare __comp)
-<span class="lineNum">    2221 </span>                :     {
-<span class="lineNum">    2222 </span>                :       typedef typename iterator_traits&lt;_ForwardIterator&gt;::value_type
-<span class="lineNum">    2223 </span>                :         _ValueType;
-<span class="lineNum">    2224 </span>                :       typedef typename iterator_traits&lt;_ForwardIterator&gt;::difference_type
-<span class="lineNum">    2225 </span>                :         _DistanceType;
-<span class="lineNum">    2226 </span>                : 
-<span class="lineNum">    2227 </span>                :       // concept requirements
-<span class="lineNum">    2228 </span>                :       __glibcxx_function_requires(_ForwardIteratorConcept&lt;_ForwardIterator&gt;)
-<span class="lineNum">    2229 </span>                :       __glibcxx_function_requires(_BinaryPredicateConcept&lt;_Compare,
-<span class="lineNum">    2230 </span>                :                                   _Tp, _ValueType&gt;)
-<span class="lineNum">    2231 </span>                :       __glibcxx_requires_partitioned_upper_pred(__first, __last,
-<span class="lineNum">    2232 </span>                :                                                 __val, __comp);
-<span class="lineNum">    2233 </span>                : 
-<span class="lineNum">    2234 </span>                :       _DistanceType __len = std::distance(__first, __last);
-<span class="lineNum">    2235 </span>                :       _DistanceType __half;
-<span class="lineNum">    2236 </span>                :       _ForwardIterator __middle;
-<span class="lineNum">    2237 </span>                : 
-<span class="lineNum">    2238 </span>                :       while (__len &gt; 0)
-<span class="lineNum">    2239 </span>                :         {
-<span class="lineNum">    2240 </span>                :           __half = __len &gt;&gt; 1;
-<span class="lineNum">    2241 </span>                :           __middle = __first;
-<span class="lineNum">    2242 </span>                :           std::advance(__middle, __half);
-<span class="lineNum">    2243 </span>                :           if (__comp(__val, *__middle))
-<span class="lineNum">    2244 </span>                :             __len = __half;
-<span class="lineNum">    2245 </span>                :           else
-<span class="lineNum">    2246 </span>                :             {
-<span class="lineNum">    2247 </span>                :               __first = __middle;
-<span class="lineNum">    2248 </span>                :               ++__first;
-<span class="lineNum">    2249 </span>                :               __len = __len - __half - 1;
-<span class="lineNum">    2250 </span>                :             }
-<span class="lineNum">    2251 </span>                :         }
-<span class="lineNum">    2252 </span>                :       return __first;
-<span class="lineNum">    2253 </span>                :     }
-<span class="lineNum">    2254 </span>                : 
-<span class="lineNum">    2255 </span>                :   /**
-<span class="lineNum">    2256 </span>                :    *  @brief Finds the largest subrange in which @a val could be inserted
-<span class="lineNum">    2257 </span>                :    *         at any place in it without changing the ordering.
-<span class="lineNum">    2258 </span>                :    *  @param  first   An iterator.
-<span class="lineNum">    2259 </span>                :    *  @param  last    Another iterator.
-<span class="lineNum">    2260 </span>                :    *  @param  val     The search term.
-<span class="lineNum">    2261 </span>                :    *  @return  An pair of iterators defining the subrange.
-<span class="lineNum">    2262 </span>                :    *  @ingroup binarysearch
-<span class="lineNum">    2263 </span>                :    *
-<span class="lineNum">    2264 </span>                :    *  This is equivalent to
-<span class="lineNum">    2265 </span>                :    *  @code
-<span class="lineNum">    2266 </span>                :    *    std::make_pair(lower_bound(first, last, val),
-<span class="lineNum">    2267 </span>                :    *                   upper_bound(first, last, val))
-<span class="lineNum">    2268 </span>                :    *  @endcode
-<span class="lineNum">    2269 </span>                :    *  but does not actually call those functions.
-<span class="lineNum">    2270 </span>                :   */
-<span class="lineNum">    2271 </span>                :   template&lt;typename _ForwardIterator, typename _Tp&gt;
-<span class="lineNum">    2272 </span>                :     pair&lt;_ForwardIterator, _ForwardIterator&gt;
-<span class="lineNum">    2273 </span>                :     equal_range(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">    2274 </span>                :                 const _Tp&amp; __val)
-<span class="lineNum">    2275 </span>                :     {
-<span class="lineNum">    2276 </span>                :       typedef typename iterator_traits&lt;_ForwardIterator&gt;::value_type
-<span class="lineNum">    2277 </span>                :         _ValueType;
-<span class="lineNum">    2278 </span>                :       typedef typename iterator_traits&lt;_ForwardIterator&gt;::difference_type
-<span class="lineNum">    2279 </span>                :         _DistanceType;
-<span class="lineNum">    2280 </span>                : 
-<span class="lineNum">    2281 </span>                :       // concept requirements
-<span class="lineNum">    2282 </span>                :       __glibcxx_function_requires(_ForwardIteratorConcept&lt;_ForwardIterator&gt;)
-<span class="lineNum">    2283 </span>                :       __glibcxx_function_requires(_LessThanOpConcept&lt;_ValueType, _Tp&gt;)
-<span class="lineNum">    2284 </span>                :       __glibcxx_function_requires(_LessThanOpConcept&lt;_Tp, _ValueType&gt;)    
-<span class="lineNum">    2285 </span>                :       __glibcxx_requires_partitioned_lower(__first, __last, __val);
-<span class="lineNum">    2286 </span>                :       __glibcxx_requires_partitioned_upper(__first, __last, __val);      
-<span class="lineNum">    2287 </span>                : 
-<span class="lineNum">    2288 </span>                :       _DistanceType __len = std::distance(__first, __last);
-<span class="lineNum">    2289 </span>                :       _DistanceType __half;
-<span class="lineNum">    2290 </span>                :       _ForwardIterator __middle, __left, __right;
-<span class="lineNum">    2291 </span>                : 
-<span class="lineNum">    2292 </span>                :       while (__len &gt; 0)
-<span class="lineNum">    2293 </span>                :         {
-<span class="lineNum">    2294 </span>                :           __half = __len &gt;&gt; 1;
-<span class="lineNum">    2295 </span>                :           __middle = __first;
-<span class="lineNum">    2296 </span>                :           std::advance(__middle, __half);
-<span class="lineNum">    2297 </span>                :           if (*__middle &lt; __val)
-<span class="lineNum">    2298 </span>                :             {
-<span class="lineNum">    2299 </span>                :               __first = __middle;
-<span class="lineNum">    2300 </span>                :               ++__first;
-<span class="lineNum">    2301 </span>                :               __len = __len - __half - 1;
-<span class="lineNum">    2302 </span>                :             }
-<span class="lineNum">    2303 </span>                :           else if (__val &lt; *__middle)
-<span class="lineNum">    2304 </span>                :             __len = __half;
-<span class="lineNum">    2305 </span>                :           else
-<span class="lineNum">    2306 </span>                :             {
-<span class="lineNum">    2307 </span>                :               __left = std::lower_bound(__first, __middle, __val);
-<span class="lineNum">    2308 </span>                :               std::advance(__first, __len);
-<span class="lineNum">    2309 </span>                :               __right = std::upper_bound(++__middle, __first, __val);
-<span class="lineNum">    2310 </span>                :               return pair&lt;_ForwardIterator, _ForwardIterator&gt;(__left, __right);
-<span class="lineNum">    2311 </span>                :             }
-<span class="lineNum">    2312 </span>                :         }
-<span class="lineNum">    2313 </span>                :       return pair&lt;_ForwardIterator, _ForwardIterator&gt;(__first, __first);
-<span class="lineNum">    2314 </span>                :     }
-<span class="lineNum">    2315 </span>                : 
-<span class="lineNum">    2316 </span>                :   /**
-<span class="lineNum">    2317 </span>                :    *  @brief Finds the largest subrange in which @a val could be inserted
-<span class="lineNum">    2318 </span>                :    *         at any place in it without changing the ordering.
-<span class="lineNum">    2319 </span>                :    *  @param  first   An iterator.
-<span class="lineNum">    2320 </span>                :    *  @param  last    Another iterator.
-<span class="lineNum">    2321 </span>                :    *  @param  val     The search term.
-<span class="lineNum">    2322 </span>                :    *  @param  comp    A functor to use for comparisons.
-<span class="lineNum">    2323 </span>                :    *  @return  An pair of iterators defining the subrange.
-<span class="lineNum">    2324 </span>                :    *  @ingroup binarysearch
-<span class="lineNum">    2325 </span>                :    *
-<span class="lineNum">    2326 </span>                :    *  This is equivalent to
-<span class="lineNum">    2327 </span>                :    *  @code
-<span class="lineNum">    2328 </span>                :    *    std::make_pair(lower_bound(first, last, val, comp),
-<span class="lineNum">    2329 </span>                :    *                   upper_bound(first, last, val, comp))
-<span class="lineNum">    2330 </span>                :    *  @endcode
-<span class="lineNum">    2331 </span>                :    *  but does not actually call those functions.
-<span class="lineNum">    2332 </span>                :   */
-<span class="lineNum">    2333 </span>                :   template&lt;typename _ForwardIterator, typename _Tp, typename _Compare&gt;
-<span class="lineNum">    2334 </span>                :     pair&lt;_ForwardIterator, _ForwardIterator&gt;
-<span class="lineNum">    2335 </span>                :     equal_range(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">    2336 </span>                :                 const _Tp&amp; __val,
-<span class="lineNum">    2337 </span>                :                 _Compare __comp)
-<span class="lineNum">    2338 </span>                :     {
-<span class="lineNum">    2339 </span>                :       typedef typename iterator_traits&lt;_ForwardIterator&gt;::value_type
-<span class="lineNum">    2340 </span>                :         _ValueType;
-<span class="lineNum">    2341 </span>                :       typedef typename iterator_traits&lt;_ForwardIterator&gt;::difference_type
-<span class="lineNum">    2342 </span>                :         _DistanceType;
-<span class="lineNum">    2343 </span>                : 
-<span class="lineNum">    2344 </span>                :       // concept requirements
-<span class="lineNum">    2345 </span>                :       __glibcxx_function_requires(_ForwardIteratorConcept&lt;_ForwardIterator&gt;)
-<span class="lineNum">    2346 </span>                :       __glibcxx_function_requires(_BinaryPredicateConcept&lt;_Compare,
-<span class="lineNum">    2347 </span>                :                                   _ValueType, _Tp&gt;)
-<span class="lineNum">    2348 </span>                :       __glibcxx_function_requires(_BinaryPredicateConcept&lt;_Compare,
-<span class="lineNum">    2349 </span>                :                                   _Tp, _ValueType&gt;)
-<span class="lineNum">    2350 </span>                :       __glibcxx_requires_partitioned_lower_pred(__first, __last,
-<span class="lineNum">    2351 </span>                :                                                 __val, __comp);
-<span class="lineNum">    2352 </span>                :       __glibcxx_requires_partitioned_upper_pred(__first, __last,
-<span class="lineNum">    2353 </span>                :                                                 __val, __comp);
-<span class="lineNum">    2354 </span>                : 
-<span class="lineNum">    2355 </span>                :       _DistanceType __len = std::distance(__first, __last);
-<span class="lineNum">    2356 </span>                :       _DistanceType __half;
-<span class="lineNum">    2357 </span>                :       _ForwardIterator __middle, __left, __right;
-<span class="lineNum">    2358 </span>                : 
-<span class="lineNum">    2359 </span>                :       while (__len &gt; 0)
-<span class="lineNum">    2360 </span>                :         {
-<span class="lineNum">    2361 </span>                :           __half = __len &gt;&gt; 1;
-<span class="lineNum">    2362 </span>                :           __middle = __first;
-<span class="lineNum">    2363 </span>                :           std::advance(__middle, __half);
-<span class="lineNum">    2364 </span>                :           if (__comp(*__middle, __val))
-<span class="lineNum">    2365 </span>                :             {
-<span class="lineNum">    2366 </span>                :               __first = __middle;
-<span class="lineNum">    2367 </span>                :               ++__first;
-<span class="lineNum">    2368 </span>                :               __len = __len - __half - 1;
-<span class="lineNum">    2369 </span>                :             }
-<span class="lineNum">    2370 </span>                :           else if (__comp(__val, *__middle))
-<span class="lineNum">    2371 </span>                :             __len = __half;
-<span class="lineNum">    2372 </span>                :           else
-<span class="lineNum">    2373 </span>                :             {
-<span class="lineNum">    2374 </span>                :               __left = std::lower_bound(__first, __middle, __val, __comp);
-<span class="lineNum">    2375 </span>                :               std::advance(__first, __len);
-<span class="lineNum">    2376 </span>                :               __right = std::upper_bound(++__middle, __first, __val, __comp);
-<span class="lineNum">    2377 </span>                :               return pair&lt;_ForwardIterator, _ForwardIterator&gt;(__left, __right);
-<span class="lineNum">    2378 </span>                :             }
-<span class="lineNum">    2379 </span>                :         }
-<span class="lineNum">    2380 </span>                :       return pair&lt;_ForwardIterator, _ForwardIterator&gt;(__first, __first);
-<span class="lineNum">    2381 </span>                :     }
-<span class="lineNum">    2382 </span>                : 
-<span class="lineNum">    2383 </span>                :   /**
-<span class="lineNum">    2384 </span>                :    *  @brief Determines whether an element exists in a range.
-<span class="lineNum">    2385 </span>                :    *  @param  first   An iterator.
-<span class="lineNum">    2386 </span>                :    *  @param  last    Another iterator.
-<span class="lineNum">    2387 </span>                :    *  @param  val     The search term.
-<span class="lineNum">    2388 </span>                :    *  @return  True if @a val (or its equivalent) is in [@a first,@a last ].
-<span class="lineNum">    2389 </span>                :    *  @ingroup binarysearch
-<span class="lineNum">    2390 </span>                :    *
-<span class="lineNum">    2391 </span>                :    *  Note that this does not actually return an iterator to @a val.  For
-<span class="lineNum">    2392 </span>                :    *  that, use std::find or a container's specialized find member functions.
-<span class="lineNum">    2393 </span>                :   */
-<span class="lineNum">    2394 </span>                :   template&lt;typename _ForwardIterator, typename _Tp&gt;
-<span class="lineNum">    2395 </span>                :     bool
-<span class="lineNum">    2396 </span>                :     binary_search(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">    2397 </span>                :                   const _Tp&amp; __val)
-<span class="lineNum">    2398 </span>                :     {
-<span class="lineNum">    2399 </span>                :       typedef typename iterator_traits&lt;_ForwardIterator&gt;::value_type
-<span class="lineNum">    2400 </span>                :         _ValueType;
-<span class="lineNum">    2401 </span>                : 
-<span class="lineNum">    2402 </span>                :       // concept requirements
-<span class="lineNum">    2403 </span>                :       __glibcxx_function_requires(_ForwardIteratorConcept&lt;_ForwardIterator&gt;)
-<span class="lineNum">    2404 </span>                :       __glibcxx_function_requires(_LessThanOpConcept&lt;_Tp, _ValueType&gt;)
-<span class="lineNum">    2405 </span>                :       __glibcxx_requires_partitioned_lower(__first, __last, __val);
-<span class="lineNum">    2406 </span>                :       __glibcxx_requires_partitioned_upper(__first, __last, __val);
-<span class="lineNum">    2407 </span>                : 
-<span class="lineNum">    2408 </span>                :       _ForwardIterator __i = std::lower_bound(__first, __last, __val);
-<span class="lineNum">    2409 </span>                :       return __i != __last &amp;&amp; !(__val &lt; *__i);
-<span class="lineNum">    2410 </span>                :     }
-<span class="lineNum">    2411 </span>                : 
-<span class="lineNum">    2412 </span>                :   /**
-<span class="lineNum">    2413 </span>                :    *  @brief Determines whether an element exists in a range.
-<span class="lineNum">    2414 </span>                :    *  @param  first   An iterator.
-<span class="lineNum">    2415 </span>                :    *  @param  last    Another iterator.
-<span class="lineNum">    2416 </span>                :    *  @param  val     The search term.
-<span class="lineNum">    2417 </span>                :    *  @param  comp    A functor to use for comparisons.
-<span class="lineNum">    2418 </span>                :    *  @return  True if @a val (or its equivalent) is in [@a first,@a last ].
-<span class="lineNum">    2419 </span>                :    *  @ingroup binarysearch
-<span class="lineNum">    2420 </span>                :    *
-<span class="lineNum">    2421 </span>                :    *  Note that this does not actually return an iterator to @a val.  For
-<span class="lineNum">    2422 </span>                :    *  that, use std::find or a container's specialized find member functions.
-<span class="lineNum">    2423 </span>                :    *
-<span class="lineNum">    2424 </span>                :    *  The comparison function should have the same effects on ordering as
-<span class="lineNum">    2425 </span>                :    *  the function used for the initial sort.
-<span class="lineNum">    2426 </span>                :   */
-<span class="lineNum">    2427 </span>                :   template&lt;typename _ForwardIterator, typename _Tp, typename _Compare&gt;
-<span class="lineNum">    2428 </span>                :     bool
-<span class="lineNum">    2429 </span>                :     binary_search(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">    2430 </span>                :                   const _Tp&amp; __val, _Compare __comp)
-<span class="lineNum">    2431 </span>                :     {
-<span class="lineNum">    2432 </span>                :       typedef typename iterator_traits&lt;_ForwardIterator&gt;::value_type
-<span class="lineNum">    2433 </span>                :         _ValueType;
-<span class="lineNum">    2434 </span>                : 
-<span class="lineNum">    2435 </span>                :       // concept requirements
-<span class="lineNum">    2436 </span>                :       __glibcxx_function_requires(_ForwardIteratorConcept&lt;_ForwardIterator&gt;)
-<span class="lineNum">    2437 </span>                :       __glibcxx_function_requires(_BinaryPredicateConcept&lt;_Compare,
-<span class="lineNum">    2438 </span>                :                                   _Tp, _ValueType&gt;)
-<span class="lineNum">    2439 </span>                :       __glibcxx_requires_partitioned_lower_pred(__first, __last,
-<span class="lineNum">    2440 </span>                :                                                 __val, __comp);
-<span class="lineNum">    2441 </span>                :       __glibcxx_requires_partitioned_upper_pred(__first, __last,
-<span class="lineNum">    2442 </span>                :                                                 __val, __comp);
-<span class="lineNum">    2443 </span>                : 
-<span class="lineNum">    2444 </span>                :       _ForwardIterator __i = std::lower_bound(__first, __last, __val, __comp);
-<span class="lineNum">    2445 </span>                :       return __i != __last &amp;&amp; !bool(__comp(__val, *__i));
-<span class="lineNum">    2446 </span>                :     }
-<span class="lineNum">    2447 </span>                : 
-<span class="lineNum">    2448 </span>                :   // merge
-<span class="lineNum">    2449 </span>                : 
-<span class="lineNum">    2450 </span>                :   /// This is a helper function for the merge routines.
-<span class="lineNum">    2451 </span>                :   template&lt;typename _BidirectionalIterator1, typename _BidirectionalIterator2,
-<span class="lineNum">    2452 </span>                :            typename _BidirectionalIterator3&gt;
-<span class="lineNum">    2453 </span>                :     _BidirectionalIterator3
-<span class="lineNum">    2454 </span>                :     __merge_backward(_BidirectionalIterator1 __first1,
-<span class="lineNum">    2455 </span>                :                      _BidirectionalIterator1 __last1,
-<span class="lineNum">    2456 </span>                :                      _BidirectionalIterator2 __first2,
-<span class="lineNum">    2457 </span>                :                      _BidirectionalIterator2 __last2,
-<span class="lineNum">    2458 </span>                :                      _BidirectionalIterator3 __result)
-<span class="lineNum">    2459 </span>                :     {
-<span class="lineNum">    2460 </span>                :       if (__first1 == __last1)
-<span class="lineNum">    2461 </span>                :         return std::copy_backward(__first2, __last2, __result);
-<span class="lineNum">    2462 </span>                :       if (__first2 == __last2)
-<span class="lineNum">    2463 </span>                :         return std::copy_backward(__first1, __last1, __result);
-<span class="lineNum">    2464 </span>                :       --__last1;
-<span class="lineNum">    2465 </span>                :       --__last2;
-<span class="lineNum">    2466 </span>                :       while (true)
-<span class="lineNum">    2467 </span>                :         {
-<span class="lineNum">    2468 </span>                :           if (*__last2 &lt; *__last1)
-<span class="lineNum">    2469 </span>                :             {
-<span class="lineNum">    2470 </span>                :               *--__result = *__last1;
-<span class="lineNum">    2471 </span>                :               if (__first1 == __last1)
-<span class="lineNum">    2472 </span>                :                 return std::copy_backward(__first2, ++__last2, __result);
-<span class="lineNum">    2473 </span>                :               --__last1;
-<span class="lineNum">    2474 </span>                :             }
-<span class="lineNum">    2475 </span>                :           else
-<span class="lineNum">    2476 </span>                :             {
-<span class="lineNum">    2477 </span>                :               *--__result = *__last2;
-<span class="lineNum">    2478 </span>                :               if (__first2 == __last2)
-<span class="lineNum">    2479 </span>                :                 return std::copy_backward(__first1, ++__last1, __result);
-<span class="lineNum">    2480 </span>                :               --__last2;
-<span class="lineNum">    2481 </span>                :             }
-<span class="lineNum">    2482 </span>                :         }
-<span class="lineNum">    2483 </span>                :     }
-<span class="lineNum">    2484 </span>                : 
-<span class="lineNum">    2485 </span>                :   /// This is a helper function for the merge routines.
-<span class="lineNum">    2486 </span>                :   template&lt;typename _BidirectionalIterator1, typename _BidirectionalIterator2,
-<span class="lineNum">    2487 </span>                :            typename _BidirectionalIterator3, typename _Compare&gt;
-<span class="lineNum">    2488 </span>                :     _BidirectionalIterator3
-<span class="lineNum">    2489 </span>                :     __merge_backward(_BidirectionalIterator1 __first1,
-<span class="lineNum">    2490 </span>                :                      _BidirectionalIterator1 __last1,
-<span class="lineNum">    2491 </span>                :                      _BidirectionalIterator2 __first2,
-<span class="lineNum">    2492 </span>                :                      _BidirectionalIterator2 __last2,
-<span class="lineNum">    2493 </span>                :                      _BidirectionalIterator3 __result,
-<span class="lineNum">    2494 </span>                :                      _Compare __comp)
-<span class="lineNum">    2495 </span>                :     {
-<span class="lineNum">    2496 </span>                :       if (__first1 == __last1)
-<span class="lineNum">    2497 </span>                :         return std::copy_backward(__first2, __last2, __result);
-<span class="lineNum">    2498 </span>                :       if (__first2 == __last2)
-<span class="lineNum">    2499 </span>                :         return std::copy_backward(__first1, __last1, __result);
-<span class="lineNum">    2500 </span>                :       --__last1;
-<span class="lineNum">    2501 </span>                :       --__last2;
-<span class="lineNum">    2502 </span>                :       while (true)
-<span class="lineNum">    2503 </span>                :         {
-<span class="lineNum">    2504 </span>                :           if (__comp(*__last2, *__last1))
-<span class="lineNum">    2505 </span>                :             {
-<span class="lineNum">    2506 </span>                :               *--__result = *__last1;
-<span class="lineNum">    2507 </span>                :               if (__first1 == __last1)
-<span class="lineNum">    2508 </span>                :                 return std::copy_backward(__first2, ++__last2, __result);
-<span class="lineNum">    2509 </span>                :               --__last1;
-<span class="lineNum">    2510 </span>                :             }
-<span class="lineNum">    2511 </span>                :           else
-<span class="lineNum">    2512 </span>                :             {
-<span class="lineNum">    2513 </span>                :               *--__result = *__last2;
-<span class="lineNum">    2514 </span>                :               if (__first2 == __last2)
-<span class="lineNum">    2515 </span>                :                 return std::copy_backward(__first1, ++__last1, __result);
-<span class="lineNum">    2516 </span>                :               --__last2;
-<span class="lineNum">    2517 </span>                :             }
-<span class="lineNum">    2518 </span>                :         }
-<span class="lineNum">    2519 </span>                :     }
-<span class="lineNum">    2520 </span>                : 
-<span class="lineNum">    2521 </span>                :   /// This is a helper function for the merge routines.
-<span class="lineNum">    2522 </span>                :   template&lt;typename _BidirectionalIterator1, typename _BidirectionalIterator2,
-<span class="lineNum">    2523 </span>                :            typename _Distance&gt;
-<span class="lineNum">    2524 </span>                :     _BidirectionalIterator1
-<span class="lineNum">    2525 </span>                :     __rotate_adaptive(_BidirectionalIterator1 __first,
-<span class="lineNum">    2526 </span>                :                       _BidirectionalIterator1 __middle,
-<span class="lineNum">    2527 </span>                :                       _BidirectionalIterator1 __last,
-<span class="lineNum">    2528 </span>                :                       _Distance __len1, _Distance __len2,
-<span class="lineNum">    2529 </span>                :                       _BidirectionalIterator2 __buffer,
-<span class="lineNum">    2530 </span>                :                       _Distance __buffer_size)
-<span class="lineNum">    2531 </span>                :     {
-<span class="lineNum">    2532 </span>                :       _BidirectionalIterator2 __buffer_end;
-<span class="lineNum">    2533 </span>                :       if (__len1 &gt; __len2 &amp;&amp; __len2 &lt;= __buffer_size)
-<span class="lineNum">    2534 </span>                :         {
-<span class="lineNum">    2535 </span>                :           __buffer_end = std::copy(__middle, __last, __buffer);
-<span class="lineNum">    2536 </span>                :           std::copy_backward(__first, __middle, __last);
-<span class="lineNum">    2537 </span>                :           return std::copy(__buffer, __buffer_end, __first);
-<span class="lineNum">    2538 </span>                :         }
-<span class="lineNum">    2539 </span>                :       else if (__len1 &lt;= __buffer_size)
-<span class="lineNum">    2540 </span>                :         {
-<span class="lineNum">    2541 </span>                :           __buffer_end = std::copy(__first, __middle, __buffer);
-<span class="lineNum">    2542 </span>                :           std::copy(__middle, __last, __first);
-<span class="lineNum">    2543 </span>                :           return std::copy_backward(__buffer, __buffer_end, __last);
-<span class="lineNum">    2544 </span>                :         }
-<span class="lineNum">    2545 </span>                :       else
-<span class="lineNum">    2546 </span>                :         {
-<span class="lineNum">    2547 </span>                :           std::rotate(__first, __middle, __last);
-<span class="lineNum">    2548 </span>                :           std::advance(__first, std::distance(__middle, __last));
-<span class="lineNum">    2549 </span>                :           return __first;
-<span class="lineNum">    2550 </span>                :         }
-<span class="lineNum">    2551 </span>                :     }
-<span class="lineNum">    2552 </span>                : 
-<span class="lineNum">    2553 </span>                :   /// This is a helper function for the merge routines.
-<span class="lineNum">    2554 </span>                :   template&lt;typename _BidirectionalIterator, typename _Distance,
-<span class="lineNum">    2555 </span>                :            typename _Pointer&gt;
-<span class="lineNum">    2556 </span>                :     void
-<span class="lineNum">    2557 </span>                :     __merge_adaptive(_BidirectionalIterator __first,
-<span class="lineNum">    2558 </span>                :                      _BidirectionalIterator __middle,
-<span class="lineNum">    2559 </span>                :                      _BidirectionalIterator __last,
-<span class="lineNum">    2560 </span>                :                      _Distance __len1, _Distance __len2,
-<span class="lineNum">    2561 </span>                :                      _Pointer __buffer, _Distance __buffer_size)
-<span class="lineNum">    2562 </span>                :     {
-<span class="lineNum">    2563 </span>                :       if (__len1 &lt;= __len2 &amp;&amp; __len1 &lt;= __buffer_size)
-<span class="lineNum">    2564 </span>                :         {
-<span class="lineNum">    2565 </span>                :           _Pointer __buffer_end = std::copy(__first, __middle, __buffer);
-<span class="lineNum">    2566 </span>                :           _GLIBCXX_STD_P::merge(__buffer, __buffer_end, __middle, __last, 
-<span class="lineNum">    2567 </span>                :                                 __first);
-<span class="lineNum">    2568 </span>                :         }
-<span class="lineNum">    2569 </span>                :       else if (__len2 &lt;= __buffer_size)
-<span class="lineNum">    2570 </span>                :         {
-<span class="lineNum">    2571 </span>                :           _Pointer __buffer_end = std::copy(__middle, __last, __buffer);
-<span class="lineNum">    2572 </span>                :           std::__merge_backward(__first, __middle, __buffer,
-<span class="lineNum">    2573 </span>                :                                 __buffer_end, __last);
-<span class="lineNum">    2574 </span>                :         }
-<span class="lineNum">    2575 </span>                :       else
-<span class="lineNum">    2576 </span>                :         {
-<span class="lineNum">    2577 </span>                :           _BidirectionalIterator __first_cut = __first;
-<span class="lineNum">    2578 </span>                :           _BidirectionalIterator __second_cut = __middle;
-<span class="lineNum">    2579 </span>                :           _Distance __len11 = 0;
-<span class="lineNum">    2580 </span>                :           _Distance __len22 = 0;
-<span class="lineNum">    2581 </span>                :           if (__len1 &gt; __len2)
-<span class="lineNum">    2582 </span>                :             {
-<span class="lineNum">    2583 </span>                :               __len11 = __len1 / 2;
-<span class="lineNum">    2584 </span>                :               std::advance(__first_cut, __len11);
-<span class="lineNum">    2585 </span>                :               __second_cut = std::lower_bound(__middle, __last,
-<span class="lineNum">    2586 </span>                :                                               *__first_cut);
-<span class="lineNum">    2587 </span>                :               __len22 = std::distance(__middle, __second_cut);
-<span class="lineNum">    2588 </span>                :             }
-<span class="lineNum">    2589 </span>                :           else
-<span class="lineNum">    2590 </span>                :             {
-<span class="lineNum">    2591 </span>                :               __len22 = __len2 / 2;
-<span class="lineNum">    2592 </span>                :               std::advance(__second_cut, __len22);
-<span class="lineNum">    2593 </span>                :               __first_cut = std::upper_bound(__first, __middle,
-<span class="lineNum">    2594 </span>                :                                              *__second_cut);
-<span class="lineNum">    2595 </span>                :               __len11 = std::distance(__first, __first_cut);
-<span class="lineNum">    2596 </span>                :             }
-<span class="lineNum">    2597 </span>                :           _BidirectionalIterator __new_middle =
-<span class="lineNum">    2598 </span>                :             std::__rotate_adaptive(__first_cut, __middle, __second_cut,
-<span class="lineNum">    2599 </span>                :                                    __len1 - __len11, __len22, __buffer,
-<span class="lineNum">    2600 </span>                :                                    __buffer_size);
-<span class="lineNum">    2601 </span>                :           std::__merge_adaptive(__first, __first_cut, __new_middle, __len11,
-<span class="lineNum">    2602 </span>                :                                 __len22, __buffer, __buffer_size);
-<span class="lineNum">    2603 </span>                :           std::__merge_adaptive(__new_middle, __second_cut, __last,
-<span class="lineNum">    2604 </span>                :                                 __len1 - __len11,
-<span class="lineNum">    2605 </span>                :                                 __len2 - __len22, __buffer, __buffer_size);
-<span class="lineNum">    2606 </span>                :         }
-<span class="lineNum">    2607 </span>                :     }
-<span class="lineNum">    2608 </span>                : 
-<span class="lineNum">    2609 </span>                :   /// This is a helper function for the merge routines.
-<span class="lineNum">    2610 </span>                :   template&lt;typename _BidirectionalIterator, typename _Distance, 
-<span class="lineNum">    2611 </span>                :            typename _Pointer, typename _Compare&gt;
-<span class="lineNum">    2612 </span>                :     void
-<span class="lineNum">    2613 </span>                :     __merge_adaptive(_BidirectionalIterator __first,
-<span class="lineNum">    2614 </span>                :                      _BidirectionalIterator __middle,
-<span class="lineNum">    2615 </span>                :                      _BidirectionalIterator __last,
-<span class="lineNum">    2616 </span>                :                      _Distance __len1, _Distance __len2,
-<span class="lineNum">    2617 </span>                :                      _Pointer __buffer, _Distance __buffer_size,
-<span class="lineNum">    2618 </span>                :                      _Compare __comp)
-<span class="lineNum">    2619 </span>                :     {
-<span class="lineNum">    2620 </span>                :       if (__len1 &lt;= __len2 &amp;&amp; __len1 &lt;= __buffer_size)
-<span class="lineNum">    2621 </span>                :         {
-<span class="lineNum">    2622 </span>                :           _Pointer __buffer_end = std::copy(__first, __middle, __buffer);
-<span class="lineNum">    2623 </span>                :           _GLIBCXX_STD_P::merge(__buffer, __buffer_end, __middle, __last,
-<span class="lineNum">    2624 </span>                :                                 __first, __comp);
-<span class="lineNum">    2625 </span>                :         }
-<span class="lineNum">    2626 </span>                :       else if (__len2 &lt;= __buffer_size)
-<span class="lineNum">    2627 </span>                :         {
-<span class="lineNum">    2628 </span>                :           _Pointer __buffer_end = std::copy(__middle, __last, __buffer);
-<span class="lineNum">    2629 </span>                :           std::__merge_backward(__first, __middle, __buffer, __buffer_end,
-<span class="lineNum">    2630 </span>                :                                 __last, __comp);
-<span class="lineNum">    2631 </span>                :         }
-<span class="lineNum">    2632 </span>                :       else
-<span class="lineNum">    2633 </span>                :         {
-<span class="lineNum">    2634 </span>                :           _BidirectionalIterator __first_cut = __first;
-<span class="lineNum">    2635 </span>                :           _BidirectionalIterator __second_cut = __middle;
-<span class="lineNum">    2636 </span>                :           _Distance __len11 = 0;
-<span class="lineNum">    2637 </span>                :           _Distance __len22 = 0;
-<span class="lineNum">    2638 </span>                :           if (__len1 &gt; __len2)
-<span class="lineNum">    2639 </span>                :             {
-<span class="lineNum">    2640 </span>                :               __len11 = __len1 / 2;
-<span class="lineNum">    2641 </span>                :               std::advance(__first_cut, __len11);
-<span class="lineNum">    2642 </span>                :               __second_cut = std::lower_bound(__middle, __last, *__first_cut,
-<span class="lineNum">    2643 </span>                :                                               __comp);
-<span class="lineNum">    2644 </span>                :               __len22 = std::distance(__middle, __second_cut);
-<span class="lineNum">    2645 </span>                :             }
-<span class="lineNum">    2646 </span>                :           else
-<span class="lineNum">    2647 </span>                :             {
-<span class="lineNum">    2648 </span>                :               __len22 = __len2 / 2;
-<span class="lineNum">    2649 </span>                :               std::advance(__second_cut, __len22);
-<span class="lineNum">    2650 </span>                :               __first_cut = std::upper_bound(__first, __middle, *__second_cut,
-<span class="lineNum">    2651 </span>                :                                              __comp);
-<span class="lineNum">    2652 </span>                :               __len11 = std::distance(__first, __first_cut);
-<span class="lineNum">    2653 </span>                :             }
-<span class="lineNum">    2654 </span>                :           _BidirectionalIterator __new_middle =
-<span class="lineNum">    2655 </span>                :             std::__rotate_adaptive(__first_cut, __middle, __second_cut,
-<span class="lineNum">    2656 </span>                :                                    __len1 - __len11, __len22, __buffer,
-<span class="lineNum">    2657 </span>                :                                    __buffer_size);
-<span class="lineNum">    2658 </span>                :           std::__merge_adaptive(__first, __first_cut, __new_middle, __len11,
-<span class="lineNum">    2659 </span>                :                                 __len22, __buffer, __buffer_size, __comp);
-<span class="lineNum">    2660 </span>                :           std::__merge_adaptive(__new_middle, __second_cut, __last,
-<span class="lineNum">    2661 </span>                :                                 __len1 - __len11,
-<span class="lineNum">    2662 </span>                :                                 __len2 - __len22, __buffer,
-<span class="lineNum">    2663 </span>                :                                 __buffer_size, __comp);
-<span class="lineNum">    2664 </span>                :         }
-<span class="lineNum">    2665 </span>                :     }
-<span class="lineNum">    2666 </span>                : 
-<span class="lineNum">    2667 </span>                :   /// This is a helper function for the merge routines.
-<span class="lineNum">    2668 </span>                :   template&lt;typename _BidirectionalIterator, typename _Distance&gt;
-<span class="lineNum">    2669 </span>                :     void
-<span class="lineNum">    2670 </span>                :     __merge_without_buffer(_BidirectionalIterator __first,
-<span class="lineNum">    2671 </span>                :                            _BidirectionalIterator __middle,
-<span class="lineNum">    2672 </span>                :                            _BidirectionalIterator __last,
-<span class="lineNum">    2673 </span>                :                            _Distance __len1, _Distance __len2)
-<span class="lineNum">    2674 </span>                :     {
-<span class="lineNum">    2675 </span>                :       if (__len1 == 0 || __len2 == 0)
-<span class="lineNum">    2676 </span>                :         return;
-<span class="lineNum">    2677 </span>                :       if (__len1 + __len2 == 2)
-<span class="lineNum">    2678 </span>                :         {
-<span class="lineNum">    2679 </span>                :           if (*__middle &lt; *__first)
-<span class="lineNum">    2680 </span>                :             std::iter_swap(__first, __middle);
-<span class="lineNum">    2681 </span>                :           return;
-<span class="lineNum">    2682 </span>                :         }
-<span class="lineNum">    2683 </span>                :       _BidirectionalIterator __first_cut = __first;
-<span class="lineNum">    2684 </span>                :       _BidirectionalIterator __second_cut = __middle;
-<span class="lineNum">    2685 </span>                :       _Distance __len11 = 0;
-<span class="lineNum">    2686 </span>                :       _Distance __len22 = 0;
-<span class="lineNum">    2687 </span>                :       if (__len1 &gt; __len2)
-<span class="lineNum">    2688 </span>                :         {
-<span class="lineNum">    2689 </span>                :           __len11 = __len1 / 2;
-<span class="lineNum">    2690 </span>                :           std::advance(__first_cut, __len11);
-<span class="lineNum">    2691 </span>                :           __second_cut = std::lower_bound(__middle, __last, *__first_cut);
-<span class="lineNum">    2692 </span>                :           __len22 = std::distance(__middle, __second_cut);
-<span class="lineNum">    2693 </span>                :         }
-<span class="lineNum">    2694 </span>                :       else
-<span class="lineNum">    2695 </span>                :         {
-<span class="lineNum">    2696 </span>                :           __len22 = __len2 / 2;
-<span class="lineNum">    2697 </span>                :           std::advance(__second_cut, __len22);
-<span class="lineNum">    2698 </span>                :           __first_cut = std::upper_bound(__first, __middle, *__second_cut);
-<span class="lineNum">    2699 </span>                :           __len11 = std::distance(__first, __first_cut);
-<span class="lineNum">    2700 </span>                :         }
-<span class="lineNum">    2701 </span>                :       std::rotate(__first_cut, __middle, __second_cut);
-<span class="lineNum">    2702 </span>                :       _BidirectionalIterator __new_middle = __first_cut;
-<span class="lineNum">    2703 </span>                :       std::advance(__new_middle, std::distance(__middle, __second_cut));
-<span class="lineNum">    2704 </span>                :       std::__merge_without_buffer(__first, __first_cut, __new_middle,
-<span class="lineNum">    2705 </span>                :                                   __len11, __len22);
-<span class="lineNum">    2706 </span>                :       std::__merge_without_buffer(__new_middle, __second_cut, __last,
-<span class="lineNum">    2707 </span>                :                                   __len1 - __len11, __len2 - __len22);
-<span class="lineNum">    2708 </span>                :     }
-<span class="lineNum">    2709 </span>                : 
-<span class="lineNum">    2710 </span>                :   /// This is a helper function for the merge routines.
-<span class="lineNum">    2711 </span>                :   template&lt;typename _BidirectionalIterator, typename _Distance,
-<span class="lineNum">    2712 </span>                :            typename _Compare&gt;
-<span class="lineNum">    2713 </span>                :     void
-<span class="lineNum">    2714 </span>                :     __merge_without_buffer(_BidirectionalIterator __first,
-<span class="lineNum">    2715 </span>                :                            _BidirectionalIterator __middle,
-<span class="lineNum">    2716 </span>                :                            _BidirectionalIterator __last,
-<span class="lineNum">    2717 </span>                :                            _Distance __len1, _Distance __len2,
-<span class="lineNum">    2718 </span>                :                            _Compare __comp)
-<span class="lineNum">    2719 </span>                :     {
-<span class="lineNum">    2720 </span>                :       if (__len1 == 0 || __len2 == 0)
-<span class="lineNum">    2721 </span>                :         return;
-<span class="lineNum">    2722 </span>                :       if (__len1 + __len2 == 2)
-<span class="lineNum">    2723 </span>                :         {
-<span class="lineNum">    2724 </span>                :           if (__comp(*__middle, *__first))
-<span class="lineNum">    2725 </span>                :             std::iter_swap(__first, __middle);
-<span class="lineNum">    2726 </span>                :           return;
-<span class="lineNum">    2727 </span>                :         }
-<span class="lineNum">    2728 </span>                :       _BidirectionalIterator __first_cut = __first;
-<span class="lineNum">    2729 </span>                :       _BidirectionalIterator __second_cut = __middle;
-<span class="lineNum">    2730 </span>                :       _Distance __len11 = 0;
-<span class="lineNum">    2731 </span>                :       _Distance __len22 = 0;
-<span class="lineNum">    2732 </span>                :       if (__len1 &gt; __len2)
-<span class="lineNum">    2733 </span>                :         {
-<span class="lineNum">    2734 </span>                :           __len11 = __len1 / 2;
-<span class="lineNum">    2735 </span>                :           std::advance(__first_cut, __len11);
-<span class="lineNum">    2736 </span>                :           __second_cut = std::lower_bound(__middle, __last, *__first_cut,
-<span class="lineNum">    2737 </span>                :                                           __comp);
-<span class="lineNum">    2738 </span>                :           __len22 = std::distance(__middle, __second_cut);
-<span class="lineNum">    2739 </span>                :         }
-<span class="lineNum">    2740 </span>                :       else
-<span class="lineNum">    2741 </span>                :         {
-<span class="lineNum">    2742 </span>                :           __len22 = __len2 / 2;
-<span class="lineNum">    2743 </span>                :           std::advance(__second_cut, __len22);
-<span class="lineNum">    2744 </span>                :           __first_cut = std::upper_bound(__first, __middle, *__second_cut,
-<span class="lineNum">    2745 </span>                :                                          __comp);
-<span class="lineNum">    2746 </span>                :           __len11 = std::distance(__first, __first_cut);
-<span class="lineNum">    2747 </span>                :         }
-<span class="lineNum">    2748 </span>                :       std::rotate(__first_cut, __middle, __second_cut);
-<span class="lineNum">    2749 </span>                :       _BidirectionalIterator __new_middle = __first_cut;
-<span class="lineNum">    2750 </span>                :       std::advance(__new_middle, std::distance(__middle, __second_cut));
-<span class="lineNum">    2751 </span>                :       std::__merge_without_buffer(__first, __first_cut, __new_middle,
-<span class="lineNum">    2752 </span>                :                                   __len11, __len22, __comp);
-<span class="lineNum">    2753 </span>                :       std::__merge_without_buffer(__new_middle, __second_cut, __last,
-<span class="lineNum">    2754 </span>                :                                   __len1 - __len11, __len2 - __len22, __comp);
-<span class="lineNum">    2755 </span>                :     }
-<span class="lineNum">    2756 </span>                : 
-<span class="lineNum">    2757 </span>                :   /**
-<span class="lineNum">    2758 </span>                :    *  @brief Merges two sorted ranges in place.
-<span class="lineNum">    2759 </span>                :    *  @param  first   An iterator.
-<span class="lineNum">    2760 </span>                :    *  @param  middle  Another iterator.
-<span class="lineNum">    2761 </span>                :    *  @param  last    Another iterator.
-<span class="lineNum">    2762 </span>                :    *  @return  Nothing.
-<span class="lineNum">    2763 </span>                :    *
-<span class="lineNum">    2764 </span>                :    *  Merges two sorted and consecutive ranges, [first,middle) and
-<span class="lineNum">    2765 </span>                :    *  [middle,last), and puts the result in [first,last).  The output will
-<span class="lineNum">    2766 </span>                :    *  be sorted.  The sort is @e stable, that is, for equivalent
-<span class="lineNum">    2767 </span>                :    *  elements in the two ranges, elements from the first range will always
-<span class="lineNum">    2768 </span>                :    *  come before elements from the second.
-<span class="lineNum">    2769 </span>                :    *
-<span class="lineNum">    2770 </span>                :    *  If enough additional memory is available, this takes (last-first)-1
-<span class="lineNum">    2771 </span>                :    *  comparisons.  Otherwise an NlogN algorithm is used, where N is
-<span class="lineNum">    2772 </span>                :    *  distance(first,last).
-<span class="lineNum">    2773 </span>                :   */
-<span class="lineNum">    2774 </span>                :   template&lt;typename _BidirectionalIterator&gt;
-<span class="lineNum">    2775 </span>                :     void
-<span class="lineNum">    2776 </span>                :     inplace_merge(_BidirectionalIterator __first,
-<span class="lineNum">    2777 </span>                :                   _BidirectionalIterator __middle,
-<span class="lineNum">    2778 </span>                :                   _BidirectionalIterator __last)
-<span class="lineNum">    2779 </span>                :     {
-<span class="lineNum">    2780 </span>                :       typedef typename iterator_traits&lt;_BidirectionalIterator&gt;::value_type
-<span class="lineNum">    2781 </span>                :           _ValueType;
-<span class="lineNum">    2782 </span>                :       typedef typename iterator_traits&lt;_BidirectionalIterator&gt;::difference_type
-<span class="lineNum">    2783 </span>                :           _DistanceType;
-<span class="lineNum">    2784 </span>                : 
-<span class="lineNum">    2785 </span>                :       // concept requirements
-<span class="lineNum">    2786 </span>                :       __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept&lt;
-<span class="lineNum">    2787 </span>                :             _BidirectionalIterator&gt;)
-<span class="lineNum">    2788 </span>                :       __glibcxx_function_requires(_LessThanComparableConcept&lt;_ValueType&gt;)
-<span class="lineNum">    2789 </span>                :       __glibcxx_requires_sorted(__first, __middle);
-<span class="lineNum">    2790 </span>                :       __glibcxx_requires_sorted(__middle, __last);
-<span class="lineNum">    2791 </span>                : 
-<span class="lineNum">    2792 </span>                :       if (__first == __middle || __middle == __last)
-<span class="lineNum">    2793 </span>                :         return;
-<span class="lineNum">    2794 </span>                : 
-<span class="lineNum">    2795 </span>                :       _DistanceType __len1 = std::distance(__first, __middle);
-<span class="lineNum">    2796 </span>                :       _DistanceType __len2 = std::distance(__middle, __last);
-<span class="lineNum">    2797 </span>                : 
-<span class="lineNum">    2798 </span>                :       _Temporary_buffer&lt;_BidirectionalIterator, _ValueType&gt; __buf(__first,
-<span class="lineNum">    2799 </span>                :                                                                   __last);
-<span class="lineNum">    2800 </span>                :       if (__buf.begin() == 0)
-<span class="lineNum">    2801 </span>                :         std::__merge_without_buffer(__first, __middle, __last, __len1, __len2);
-<span class="lineNum">    2802 </span>                :       else
-<span class="lineNum">    2803 </span>                :         std::__merge_adaptive(__first, __middle, __last, __len1, __len2,
-<span class="lineNum">    2804 </span>                :                               __buf.begin(), _DistanceType(__buf.size()));
-<span class="lineNum">    2805 </span>                :     }
-<span class="lineNum">    2806 </span>                : 
-<span class="lineNum">    2807 </span>                :   /**
-<span class="lineNum">    2808 </span>                :    *  @brief Merges two sorted ranges in place.
-<span class="lineNum">    2809 </span>                :    *  @param  first   An iterator.
-<span class="lineNum">    2810 </span>                :    *  @param  middle  Another iterator.
-<span class="lineNum">    2811 </span>                :    *  @param  last    Another iterator.
-<span class="lineNum">    2812 </span>                :    *  @param  comp    A functor to use for comparisons.
-<span class="lineNum">    2813 </span>                :    *  @return  Nothing.
-<span class="lineNum">    2814 </span>                :    *
-<span class="lineNum">    2815 </span>                :    *  Merges two sorted and consecutive ranges, [first,middle) and
-<span class="lineNum">    2816 </span>                :    *  [middle,last), and puts the result in [first,last).  The output will
-<span class="lineNum">    2817 </span>                :    *  be sorted.  The sort is @e stable, that is, for equivalent
-<span class="lineNum">    2818 </span>                :    *  elements in the two ranges, elements from the first range will always
-<span class="lineNum">    2819 </span>                :    *  come before elements from the second.
-<span class="lineNum">    2820 </span>                :    *
-<span class="lineNum">    2821 </span>                :    *  If enough additional memory is available, this takes (last-first)-1
-<span class="lineNum">    2822 </span>                :    *  comparisons.  Otherwise an NlogN algorithm is used, where N is
-<span class="lineNum">    2823 </span>                :    *  distance(first,last).
-<span class="lineNum">    2824 </span>                :    *
-<span class="lineNum">    2825 </span>                :    *  The comparison function should have the same effects on ordering as
-<span class="lineNum">    2826 </span>                :    *  the function used for the initial sort.
-<span class="lineNum">    2827 </span>                :   */
-<span class="lineNum">    2828 </span>                :   template&lt;typename _BidirectionalIterator, typename _Compare&gt;
-<span class="lineNum">    2829 </span>                :     void
-<span class="lineNum">    2830 </span>                :     inplace_merge(_BidirectionalIterator __first,
-<span class="lineNum">    2831 </span>                :                   _BidirectionalIterator __middle,
-<span class="lineNum">    2832 </span>                :                   _BidirectionalIterator __last,
-<span class="lineNum">    2833 </span>                :                   _Compare __comp)
-<span class="lineNum">    2834 </span>                :     {
-<span class="lineNum">    2835 </span>                :       typedef typename iterator_traits&lt;_BidirectionalIterator&gt;::value_type
-<span class="lineNum">    2836 </span>                :           _ValueType;
-<span class="lineNum">    2837 </span>                :       typedef typename iterator_traits&lt;_BidirectionalIterator&gt;::difference_type
-<span class="lineNum">    2838 </span>                :           _DistanceType;
-<span class="lineNum">    2839 </span>                : 
-<span class="lineNum">    2840 </span>                :       // concept requirements
-<span class="lineNum">    2841 </span>                :       __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept&lt;
-<span class="lineNum">    2842 </span>                :             _BidirectionalIterator&gt;)
-<span class="lineNum">    2843 </span>                :       __glibcxx_function_requires(_BinaryPredicateConcept&lt;_Compare,
-<span class="lineNum">    2844 </span>                :             _ValueType, _ValueType&gt;)
-<span class="lineNum">    2845 </span>                :       __glibcxx_requires_sorted_pred(__first, __middle, __comp);
-<span class="lineNum">    2846 </span>                :       __glibcxx_requires_sorted_pred(__middle, __last, __comp);
-<span class="lineNum">    2847 </span>                : 
-<span class="lineNum">    2848 </span>                :       if (__first == __middle || __middle == __last)
-<span class="lineNum">    2849 </span>                :         return;
-<span class="lineNum">    2850 </span>                : 
-<span class="lineNum">    2851 </span>                :       const _DistanceType __len1 = std::distance(__first, __middle);
-<span class="lineNum">    2852 </span>                :       const _DistanceType __len2 = std::distance(__middle, __last);
-<span class="lineNum">    2853 </span>                : 
-<span class="lineNum">    2854 </span>                :       _Temporary_buffer&lt;_BidirectionalIterator, _ValueType&gt; __buf(__first,
-<span class="lineNum">    2855 </span>                :                                                                   __last);
-<span class="lineNum">    2856 </span>                :       if (__buf.begin() == 0)
-<span class="lineNum">    2857 </span>                :         std::__merge_without_buffer(__first, __middle, __last, __len1,
-<span class="lineNum">    2858 </span>                :                                     __len2, __comp);
-<span class="lineNum">    2859 </span>                :       else
-<span class="lineNum">    2860 </span>                :         std::__merge_adaptive(__first, __middle, __last, __len1, __len2,
-<span class="lineNum">    2861 </span>                :                               __buf.begin(), _DistanceType(__buf.size()),
-<span class="lineNum">    2862 </span>                :                               __comp);
-<span class="lineNum">    2863 </span>                :     }
-<span class="lineNum">    2864 </span>                : 
-<span class="lineNum">    2865 </span>                :   template&lt;typename _RandomAccessIterator1, typename _RandomAccessIterator2,
-<span class="lineNum">    2866 </span>                :            typename _Distance&gt;
-<span class="lineNum">    2867 </span>                :     void
-<span class="lineNum">    2868 </span>                :     __merge_sort_loop(_RandomAccessIterator1 __first,
-<span class="lineNum">    2869 </span>                :                       _RandomAccessIterator1 __last,
-<span class="lineNum">    2870 </span>                :                       _RandomAccessIterator2 __result,
-<span class="lineNum">    2871 </span>                :                       _Distance __step_size)
-<span class="lineNum">    2872 </span>                :     {
-<span class="lineNum">    2873 </span>                :       const _Distance __two_step = 2 * __step_size;
-<span class="lineNum">    2874 </span>                : 
-<span class="lineNum">    2875 </span>                :       while (__last - __first &gt;= __two_step)
-<span class="lineNum">    2876 </span>                :         {
-<span class="lineNum">    2877 </span>                :           __result = _GLIBCXX_STD_P::merge(__first, __first + __step_size,
-<span class="lineNum">    2878 </span>                :                                            __first + __step_size,
-<span class="lineNum">    2879 </span>                :                                            __first + __two_step,
-<span class="lineNum">    2880 </span>                :                                            __result);
-<span class="lineNum">    2881 </span>                :           __first += __two_step;
-<span class="lineNum">    2882 </span>                :         }
-<span class="lineNum">    2883 </span>                : 
-<span class="lineNum">    2884 </span>                :       __step_size = std::min(_Distance(__last - __first), __step_size);
-<span class="lineNum">    2885 </span>                :       _GLIBCXX_STD_P::merge(__first, __first + __step_size, 
-<span class="lineNum">    2886 </span>                :                             __first + __step_size, __last,
-<span class="lineNum">    2887 </span>                :                             __result);
-<span class="lineNum">    2888 </span>                :     }
-<span class="lineNum">    2889 </span>                : 
-<span class="lineNum">    2890 </span>                :   template&lt;typename _RandomAccessIterator1, typename _RandomAccessIterator2,
-<span class="lineNum">    2891 </span>                :            typename _Distance, typename _Compare&gt;
-<span class="lineNum">    2892 </span>                :     void
-<span class="lineNum">    2893 </span>                :     __merge_sort_loop(_RandomAccessIterator1 __first,
-<span class="lineNum">    2894 </span>                :                       _RandomAccessIterator1 __last,
-<span class="lineNum">    2895 </span>                :                       _RandomAccessIterator2 __result, _Distance __step_size,
-<span class="lineNum">    2896 </span>                :                       _Compare __comp)
-<span class="lineNum">    2897 </span>                :     {
-<span class="lineNum">    2898 </span>                :       const _Distance __two_step = 2 * __step_size;
-<span class="lineNum">    2899 </span>                : 
-<span class="lineNum">    2900 </span>                :       while (__last - __first &gt;= __two_step)
-<span class="lineNum">    2901 </span>                :         {
-<span class="lineNum">    2902 </span>                :           __result = _GLIBCXX_STD_P::merge(__first, __first + __step_size,
-<span class="lineNum">    2903 </span>                :                                 __first + __step_size, __first + __two_step,
-<span class="lineNum">    2904 </span>                :                                 __result,
-<span class="lineNum">    2905 </span>                :                                 __comp);
-<span class="lineNum">    2906 </span>                :           __first += __two_step;
-<span class="lineNum">    2907 </span>                :         }
-<span class="lineNum">    2908 </span>                :       __step_size = std::min(_Distance(__last - __first), __step_size);
-<span class="lineNum">    2909 </span>                : 
-<span class="lineNum">    2910 </span>                :       _GLIBCXX_STD_P::merge(__first, __first + __step_size,
-<span class="lineNum">    2911 </span>                :                             __first + __step_size, __last, __result, __comp);
-<span class="lineNum">    2912 </span>                :     }
-<span class="lineNum">    2913 </span>                : 
-<span class="lineNum">    2914 </span>                :   template&lt;typename _RandomAccessIterator, typename _Distance&gt;
-<span class="lineNum">    2915 </span>                :     void
-<span class="lineNum">    2916 </span>                :     __chunk_insertion_sort(_RandomAccessIterator __first,
-<span class="lineNum">    2917 </span>                :                            _RandomAccessIterator __last,
-<span class="lineNum">    2918 </span>                :                            _Distance __chunk_size)
-<span class="lineNum">    2919 </span>                :     {
-<span class="lineNum">    2920 </span>                :       while (__last - __first &gt;= __chunk_size)
-<span class="lineNum">    2921 </span>                :         {
-<span class="lineNum">    2922 </span>                :           std::__insertion_sort(__first, __first + __chunk_size);
-<span class="lineNum">    2923 </span>                :           __first += __chunk_size;
-<span class="lineNum">    2924 </span>                :         }
-<span class="lineNum">    2925 </span>                :       std::__insertion_sort(__first, __last);
-<span class="lineNum">    2926 </span>                :     }
-<span class="lineNum">    2927 </span>                : 
-<span class="lineNum">    2928 </span>                :   template&lt;typename _RandomAccessIterator, typename _Distance,
-<span class="lineNum">    2929 </span>                :            typename _Compare&gt;
-<span class="lineNum">    2930 </span>                :     void
-<span class="lineNum">    2931 </span>                :     __chunk_insertion_sort(_RandomAccessIterator __first,
-<span class="lineNum">    2932 </span>                :                            _RandomAccessIterator __last,
-<span class="lineNum">    2933 </span>                :                            _Distance __chunk_size, _Compare __comp)
-<span class="lineNum">    2934 </span>                :     {
-<span class="lineNum">    2935 </span>                :       while (__last - __first &gt;= __chunk_size)
-<span class="lineNum">    2936 </span>                :         {
-<span class="lineNum">    2937 </span>                :           std::__insertion_sort(__first, __first + __chunk_size, __comp);
-<span class="lineNum">    2938 </span>                :           __first += __chunk_size;
-<span class="lineNum">    2939 </span>                :         }
-<span class="lineNum">    2940 </span>                :       std::__insertion_sort(__first, __last, __comp);
-<span class="lineNum">    2941 </span>                :     }
-<span class="lineNum">    2942 </span>                : 
-<span class="lineNum">    2943 </span>                :   enum { _S_chunk_size = 7 };
-<span class="lineNum">    2944 </span>                : 
-<span class="lineNum">    2945 </span>                :   template&lt;typename _RandomAccessIterator, typename _Pointer&gt;
-<span class="lineNum">    2946 </span>                :     void
-<span class="lineNum">    2947 </span>                :     __merge_sort_with_buffer(_RandomAccessIterator __first,
-<span class="lineNum">    2948 </span>                :                              _RandomAccessIterator __last,
-<span class="lineNum">    2949 </span>                :                              _Pointer __buffer)
-<span class="lineNum">    2950 </span>                :     {
-<span class="lineNum">    2951 </span>                :       typedef typename iterator_traits&lt;_RandomAccessIterator&gt;::difference_type
-<span class="lineNum">    2952 </span>                :         _Distance;
-<span class="lineNum">    2953 </span>                : 
-<span class="lineNum">    2954 </span>                :       const _Distance __len = __last - __first;
-<span class="lineNum">    2955 </span>                :       const _Pointer __buffer_last = __buffer + __len;
-<span class="lineNum">    2956 </span>                : 
-<span class="lineNum">    2957 </span>                :       _Distance __step_size = _S_chunk_size;
-<span class="lineNum">    2958 </span>                :       std::__chunk_insertion_sort(__first, __last, __step_size);
-<span class="lineNum">    2959 </span>                : 
-<span class="lineNum">    2960 </span>                :       while (__step_size &lt; __len)
-<span class="lineNum">    2961 </span>                :         {
-<span class="lineNum">    2962 </span>                :           std::__merge_sort_loop(__first, __last, __buffer, __step_size);
-<span class="lineNum">    2963 </span>                :           __step_size *= 2;
-<span class="lineNum">    2964 </span>                :           std::__merge_sort_loop(__buffer, __buffer_last, __first, __step_size);
-<span class="lineNum">    2965 </span>                :           __step_size *= 2;
-<span class="lineNum">    2966 </span>                :         }
-<span class="lineNum">    2967 </span>                :     }
-<span class="lineNum">    2968 </span>                : 
-<span class="lineNum">    2969 </span>                :   template&lt;typename _RandomAccessIterator, typename _Pointer, typename _Compare&gt;
-<span class="lineNum">    2970 </span>                :     void
-<span class="lineNum">    2971 </span>                :     __merge_sort_with_buffer(_RandomAccessIterator __first,
-<span class="lineNum">    2972 </span>                :                              _RandomAccessIterator __last,
-<span class="lineNum">    2973 </span>                :                              _Pointer __buffer, _Compare __comp)
-<span class="lineNum">    2974 </span>                :     {
-<span class="lineNum">    2975 </span>                :       typedef typename iterator_traits&lt;_RandomAccessIterator&gt;::difference_type
-<span class="lineNum">    2976 </span>                :         _Distance;
-<span class="lineNum">    2977 </span>                : 
-<span class="lineNum">    2978 </span>                :       const _Distance __len = __last - __first;
-<span class="lineNum">    2979 </span>                :       const _Pointer __buffer_last = __buffer + __len;
-<span class="lineNum">    2980 </span>                : 
-<span class="lineNum">    2981 </span>                :       _Distance __step_size = _S_chunk_size;
-<span class="lineNum">    2982 </span>                :       std::__chunk_insertion_sort(__first, __last, __step_size, __comp);
-<span class="lineNum">    2983 </span>                : 
-<span class="lineNum">    2984 </span>                :       while (__step_size &lt; __len)
-<span class="lineNum">    2985 </span>                :         {
-<span class="lineNum">    2986 </span>                :           std::__merge_sort_loop(__first, __last, __buffer,
-<span class="lineNum">    2987 </span>                :                                  __step_size, __comp);
-<span class="lineNum">    2988 </span>                :           __step_size *= 2;
-<span class="lineNum">    2989 </span>                :           std::__merge_sort_loop(__buffer, __buffer_last, __first,
-<span class="lineNum">    2990 </span>                :                                  __step_size, __comp);
-<span class="lineNum">    2991 </span>                :           __step_size *= 2;
-<span class="lineNum">    2992 </span>                :         }
-<span class="lineNum">    2993 </span>                :     }
-<span class="lineNum">    2994 </span>                : 
-<span class="lineNum">    2995 </span>                :   template&lt;typename _RandomAccessIterator, typename _Pointer,
-<span class="lineNum">    2996 </span>                :            typename _Distance&gt;
-<span class="lineNum">    2997 </span>                :     void
-<span class="lineNum">    2998 </span>                :     __stable_sort_adaptive(_RandomAccessIterator __first,
-<span class="lineNum">    2999 </span>                :                            _RandomAccessIterator __last,
-<span class="lineNum">    3000 </span>                :                            _Pointer __buffer, _Distance __buffer_size)
-<span class="lineNum">    3001 </span>                :     {
-<span class="lineNum">    3002 </span>                :       const _Distance __len = (__last - __first + 1) / 2;
-<span class="lineNum">    3003 </span>                :       const _RandomAccessIterator __middle = __first + __len;
-<span class="lineNum">    3004 </span>                :       if (__len &gt; __buffer_size)
-<span class="lineNum">    3005 </span>                :         {
-<span class="lineNum">    3006 </span>                :           std::__stable_sort_adaptive(__first, __middle,
-<span class="lineNum">    3007 </span>                :                                       __buffer, __buffer_size);
-<span class="lineNum">    3008 </span>                :           std::__stable_sort_adaptive(__middle, __last,
-<span class="lineNum">    3009 </span>                :                                       __buffer, __buffer_size);
-<span class="lineNum">    3010 </span>                :         }
-<span class="lineNum">    3011 </span>                :       else
-<span class="lineNum">    3012 </span>                :         {
-<span class="lineNum">    3013 </span>                :           std::__merge_sort_with_buffer(__first, __middle, __buffer);
-<span class="lineNum">    3014 </span>                :           std::__merge_sort_with_buffer(__middle, __last, __buffer);
-<span class="lineNum">    3015 </span>                :         }
-<span class="lineNum">    3016 </span>                :       std::__merge_adaptive(__first, __middle, __last,
-<span class="lineNum">    3017 </span>                :                             _Distance(__middle - __first),
-<span class="lineNum">    3018 </span>                :                             _Distance(__last - __middle),
-<span class="lineNum">    3019 </span>                :                             __buffer, __buffer_size);
-<span class="lineNum">    3020 </span>                :     }
-<span class="lineNum">    3021 </span>                : 
-<span class="lineNum">    3022 </span>                :   template&lt;typename _RandomAccessIterator, typename _Pointer,
-<span class="lineNum">    3023 </span>                :            typename _Distance, typename _Compare&gt;
-<span class="lineNum">    3024 </span>                :     void
-<span class="lineNum">    3025 </span>                :     __stable_sort_adaptive(_RandomAccessIterator __first,
-<span class="lineNum">    3026 </span>                :                            _RandomAccessIterator __last,
-<span class="lineNum">    3027 </span>                :                            _Pointer __buffer, _Distance __buffer_size,
-<span class="lineNum">    3028 </span>                :                            _Compare __comp)
-<span class="lineNum">    3029 </span>                :     {
-<span class="lineNum">    3030 </span>                :       const _Distance __len = (__last - __first + 1) / 2;
-<span class="lineNum">    3031 </span>                :       const _RandomAccessIterator __middle = __first + __len;
-<span class="lineNum">    3032 </span>                :       if (__len &gt; __buffer_size)
-<span class="lineNum">    3033 </span>                :         {
-<span class="lineNum">    3034 </span>                :           std::__stable_sort_adaptive(__first, __middle, __buffer,
-<span class="lineNum">    3035 </span>                :                                       __buffer_size, __comp);
-<span class="lineNum">    3036 </span>                :           std::__stable_sort_adaptive(__middle, __last, __buffer,
-<span class="lineNum">    3037 </span>                :                                       __buffer_size, __comp);
-<span class="lineNum">    3038 </span>                :         }
-<span class="lineNum">    3039 </span>                :       else
-<span class="lineNum">    3040 </span>                :         {
-<span class="lineNum">    3041 </span>                :           std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp);
-<span class="lineNum">    3042 </span>                :           std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp);
-<span class="lineNum">    3043 </span>                :         }
-<span class="lineNum">    3044 </span>                :       std::__merge_adaptive(__first, __middle, __last,
-<span class="lineNum">    3045 </span>                :                             _Distance(__middle - __first),
-<span class="lineNum">    3046 </span>                :                             _Distance(__last - __middle),
-<span class="lineNum">    3047 </span>                :                             __buffer, __buffer_size,
-<span class="lineNum">    3048 </span>                :                             __comp);
-<span class="lineNum">    3049 </span>                :     }
-<span class="lineNum">    3050 </span>                : 
-<span class="lineNum">    3051 </span>                :   /// This is a helper function for the stable sorting routines.
-<span class="lineNum">    3052 </span>                :   template&lt;typename _RandomAccessIterator&gt;
-<span class="lineNum">    3053 </span>                :     void
-<span class="lineNum">    3054 </span>                :     __inplace_stable_sort(_RandomAccessIterator __first,
-<span class="lineNum">    3055 </span>                :                           _RandomAccessIterator __last)
-<span class="lineNum">    3056 </span>                :     {
-<span class="lineNum">    3057 </span>                :       if (__last - __first &lt; 15)
-<span class="lineNum">    3058 </span>                :         {
-<span class="lineNum">    3059 </span>                :           std::__insertion_sort(__first, __last);
-<span class="lineNum">    3060 </span>                :           return;
-<span class="lineNum">    3061 </span>                :         }
-<span class="lineNum">    3062 </span>                :       _RandomAccessIterator __middle = __first + (__last - __first) / 2;
-<span class="lineNum">    3063 </span>                :       std::__inplace_stable_sort(__first, __middle);
-<span class="lineNum">    3064 </span>                :       std::__inplace_stable_sort(__middle, __last);
-<span class="lineNum">    3065 </span>                :       std::__merge_without_buffer(__first, __middle, __last,
-<span class="lineNum">    3066 </span>                :                                   __middle - __first,
-<span class="lineNum">    3067 </span>                :                                   __last - __middle);
-<span class="lineNum">    3068 </span>                :     }
-<span class="lineNum">    3069 </span>                : 
-<span class="lineNum">    3070 </span>                :   /// This is a helper function for the stable sorting routines.
-<span class="lineNum">    3071 </span>                :   template&lt;typename _RandomAccessIterator, typename _Compare&gt;
-<span class="lineNum">    3072 </span>                :     void
-<span class="lineNum">    3073 </span>                :     __inplace_stable_sort(_RandomAccessIterator __first,
-<span class="lineNum">    3074 </span>                :                           _RandomAccessIterator __last, _Compare __comp)
-<span class="lineNum">    3075 </span>                :     {
-<span class="lineNum">    3076 </span>                :       if (__last - __first &lt; 15)
-<span class="lineNum">    3077 </span>                :         {
-<span class="lineNum">    3078 </span>                :           std::__insertion_sort(__first, __last, __comp);
-<span class="lineNum">    3079 </span>                :           return;
-<span class="lineNum">    3080 </span>                :         }
-<span class="lineNum">    3081 </span>                :       _RandomAccessIterator __middle = __first + (__last - __first) / 2;
-<span class="lineNum">    3082 </span>                :       std::__inplace_stable_sort(__first, __middle, __comp);
-<span class="lineNum">    3083 </span>                :       std::__inplace_stable_sort(__middle, __last, __comp);
-<span class="lineNum">    3084 </span>                :       std::__merge_without_buffer(__first, __middle, __last,
-<span class="lineNum">    3085 </span>                :                                   __middle - __first,
-<span class="lineNum">    3086 </span>                :                                   __last - __middle,
-<span class="lineNum">    3087 </span>                :                                   __comp);
-<span class="lineNum">    3088 </span>                :     }
-<span class="lineNum">    3089 </span>                : 
-<span class="lineNum">    3090 </span>                :   // stable_sort
-<span class="lineNum">    3091 </span>                : 
-<span class="lineNum">    3092 </span>                :   // Set algorithms: includes, set_union, set_intersection, set_difference,
-<span class="lineNum">    3093 </span>                :   // set_symmetric_difference.  All of these algorithms have the precondition
-<span class="lineNum">    3094 </span>                :   // that their input ranges are sorted and the postcondition that their output
-<span class="lineNum">    3095 </span>                :   // ranges are sorted.
-<span class="lineNum">    3096 </span>                : 
-<span class="lineNum">    3097 </span>                :   /**
-<span class="lineNum">    3098 </span>                :    *  @brief Determines whether all elements of a sequence exists in a range.
-<span class="lineNum">    3099 </span>                :    *  @param  first1  Start of search range.
-<span class="lineNum">    3100 </span>                :    *  @param  last1   End of search range.
-<span class="lineNum">    3101 </span>                :    *  @param  first2  Start of sequence
-<span class="lineNum">    3102 </span>                :    *  @param  last2   End of sequence.
-<span class="lineNum">    3103 </span>                :    *  @return  True if each element in [first2,last2) is contained in order
-<span class="lineNum">    3104 </span>                :    *  within [first1,last1).  False otherwise.
-<span class="lineNum">    3105 </span>                :    *  @ingroup setoperations
-<span class="lineNum">    3106 </span>                :    *
-<span class="lineNum">    3107 </span>                :    *  This operation expects both [first1,last1) and [first2,last2) to be
-<span class="lineNum">    3108 </span>                :    *  sorted.  Searches for the presence of each element in [first2,last2)
-<span class="lineNum">    3109 </span>                :    *  within [first1,last1).  The iterators over each range only move forward,
-<span class="lineNum">    3110 </span>                :    *  so this is a linear algorithm.  If an element in [first2,last2) is not
-<span class="lineNum">    3111 </span>                :    *  found before the search iterator reaches @a last2, false is returned.
-<span class="lineNum">    3112 </span>                :   */
-<span class="lineNum">    3113 </span>                :   template&lt;typename _InputIterator1, typename _InputIterator2&gt;
-<span class="lineNum">    3114 </span>                :     bool
-<span class="lineNum">    3115 </span>                :     includes(_InputIterator1 __first1, _InputIterator1 __last1,
-<span class="lineNum">    3116 </span>                :              _InputIterator2 __first2, _InputIterator2 __last2)
-<span class="lineNum">    3117 </span>                :     {
-<span class="lineNum">    3118 </span>                :       typedef typename iterator_traits&lt;_InputIterator1&gt;::value_type
-<span class="lineNum">    3119 </span>                :         _ValueType1;
-<span class="lineNum">    3120 </span>                :       typedef typename iterator_traits&lt;_InputIterator2&gt;::value_type
-<span class="lineNum">    3121 </span>                :         _ValueType2;
-<span class="lineNum">    3122 </span>                : 
-<span class="lineNum">    3123 </span>                :       // concept requirements
-<span class="lineNum">    3124 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator1&gt;)
-<span class="lineNum">    3125 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator2&gt;)
-<span class="lineNum">    3126 </span>                :       __glibcxx_function_requires(_LessThanOpConcept&lt;_ValueType1, _ValueType2&gt;)
-<span class="lineNum">    3127 </span>                :       __glibcxx_function_requires(_LessThanOpConcept&lt;_ValueType2, _ValueType1&gt;)
-<span class="lineNum">    3128 </span>                :       __glibcxx_requires_sorted_set(__first1, __last1, __first2);
-<span class="lineNum">    3129 </span>                :       __glibcxx_requires_sorted_set(__first2, __last2, __first1);
-<span class="lineNum">    3130 </span>                : 
-<span class="lineNum">    3131 </span>                :       while (__first1 != __last1 &amp;&amp; __first2 != __last2)
-<span class="lineNum">    3132 </span>                :         if (*__first2 &lt; *__first1)
-<span class="lineNum">    3133 </span>                :           return false;
-<span class="lineNum">    3134 </span>                :         else if(*__first1 &lt; *__first2)
-<span class="lineNum">    3135 </span>                :           ++__first1;
-<span class="lineNum">    3136 </span>                :         else
-<span class="lineNum">    3137 </span>                :           ++__first1, ++__first2;
-<span class="lineNum">    3138 </span>                : 
-<span class="lineNum">    3139 </span>                :       return __first2 == __last2;
-<span class="lineNum">    3140 </span>                :     }
-<span class="lineNum">    3141 </span>                : 
-<span class="lineNum">    3142 </span>                :   /**
-<span class="lineNum">    3143 </span>                :    *  @brief Determines whether all elements of a sequence exists in a range
-<span class="lineNum">    3144 </span>                :    *  using comparison.
-<span class="lineNum">    3145 </span>                :    *  @param  first1  Start of search range.
-<span class="lineNum">    3146 </span>                :    *  @param  last1   End of search range.
-<span class="lineNum">    3147 </span>                :    *  @param  first2  Start of sequence
-<span class="lineNum">    3148 </span>                :    *  @param  last2   End of sequence.
-<span class="lineNum">    3149 </span>                :    *  @param  comp    Comparison function to use.
-<span class="lineNum">    3150 </span>                :    *  @return  True if each element in [first2,last2) is contained in order
-<span class="lineNum">    3151 </span>                :    *  within [first1,last1) according to comp.  False otherwise.
-<span class="lineNum">    3152 </span>                :    *  @ingroup setoperations
-<span class="lineNum">    3153 </span>                :    *
-<span class="lineNum">    3154 </span>                :    *  This operation expects both [first1,last1) and [first2,last2) to be
-<span class="lineNum">    3155 </span>                :    *  sorted.  Searches for the presence of each element in [first2,last2)
-<span class="lineNum">    3156 </span>                :    *  within [first1,last1), using comp to decide.  The iterators over each
-<span class="lineNum">    3157 </span>                :    *  range only move forward, so this is a linear algorithm.  If an element
-<span class="lineNum">    3158 </span>                :    *  in [first2,last2) is not found before the search iterator reaches @a
-<span class="lineNum">    3159 </span>                :    *  last2, false is returned.
-<span class="lineNum">    3160 </span>                :   */
-<span class="lineNum">    3161 </span>                :   template&lt;typename _InputIterator1, typename _InputIterator2,
-<span class="lineNum">    3162 </span>                :            typename _Compare&gt;
-<span class="lineNum">    3163 </span>                :     bool
-<span class="lineNum">    3164 </span>                :     includes(_InputIterator1 __first1, _InputIterator1 __last1,
-<span class="lineNum">    3165 </span>                :              _InputIterator2 __first2, _InputIterator2 __last2,
-<span class="lineNum">    3166 </span>                :              _Compare __comp)
-<span class="lineNum">    3167 </span>                :     {
-<span class="lineNum">    3168 </span>                :       typedef typename iterator_traits&lt;_InputIterator1&gt;::value_type
-<span class="lineNum">    3169 </span>                :         _ValueType1;
-<span class="lineNum">    3170 </span>                :       typedef typename iterator_traits&lt;_InputIterator2&gt;::value_type
-<span class="lineNum">    3171 </span>                :         _ValueType2;
-<span class="lineNum">    3172 </span>                : 
-<span class="lineNum">    3173 </span>                :       // concept requirements
-<span class="lineNum">    3174 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator1&gt;)
-<span class="lineNum">    3175 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator2&gt;)
-<span class="lineNum">    3176 </span>                :       __glibcxx_function_requires(_BinaryPredicateConcept&lt;_Compare,
-<span class="lineNum">    3177 </span>                :                                   _ValueType1, _ValueType2&gt;)
-<span class="lineNum">    3178 </span>                :       __glibcxx_function_requires(_BinaryPredicateConcept&lt;_Compare,
-<span class="lineNum">    3179 </span>                :                                   _ValueType2, _ValueType1&gt;)
-<span class="lineNum">    3180 </span>                :       __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp);
-<span class="lineNum">    3181 </span>                :       __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp);
-<span class="lineNum">    3182 </span>                : 
-<span class="lineNum">    3183 </span>                :       while (__first1 != __last1 &amp;&amp; __first2 != __last2)
-<span class="lineNum">    3184 </span>                :         if (__comp(*__first2, *__first1))
-<span class="lineNum">    3185 </span>                :           return false;
-<span class="lineNum">    3186 </span>                :         else if(__comp(*__first1, *__first2))
-<span class="lineNum">    3187 </span>                :           ++__first1;
-<span class="lineNum">    3188 </span>                :         else
-<span class="lineNum">    3189 </span>                :           ++__first1, ++__first2;
-<span class="lineNum">    3190 </span>                : 
-<span class="lineNum">    3191 </span>                :       return __first2 == __last2;
-<span class="lineNum">    3192 </span>                :     }
-<span class="lineNum">    3193 </span>                : 
-<span class="lineNum">    3194 </span>                :   // nth_element
-<span class="lineNum">    3195 </span>                :   // merge
-<span class="lineNum">    3196 </span>                :   // set_difference
-<span class="lineNum">    3197 </span>                :   // set_intersection
-<span class="lineNum">    3198 </span>                :   // set_union
-<span class="lineNum">    3199 </span>                :   // stable_sort
-<span class="lineNum">    3200 </span>                :   // set_symmetric_difference
-<span class="lineNum">    3201 </span>                :   // min_element
-<span class="lineNum">    3202 </span>                :   // max_element
-<span class="lineNum">    3203 </span>                : 
-<span class="lineNum">    3204 </span>                :   /**
-<span class="lineNum">    3205 </span>                :    *  @brief  Permute range into the next &quot;dictionary&quot; ordering.
-<span class="lineNum">    3206 </span>                :    *  @param  first  Start of range.
-<span class="lineNum">    3207 </span>                :    *  @param  last   End of range.
-<span class="lineNum">    3208 </span>                :    *  @return  False if wrapped to first permutation, true otherwise.
-<span class="lineNum">    3209 </span>                :    *
-<span class="lineNum">    3210 </span>                :    *  Treats all permutations of the range as a set of &quot;dictionary&quot; sorted
-<span class="lineNum">    3211 </span>                :    *  sequences.  Permutes the current sequence into the next one of this set.
-<span class="lineNum">    3212 </span>                :    *  Returns true if there are more sequences to generate.  If the sequence
-<span class="lineNum">    3213 </span>                :    *  is the largest of the set, the smallest is generated and false returned.
-<span class="lineNum">    3214 </span>                :   */
-<span class="lineNum">    3215 </span>                :   template&lt;typename _BidirectionalIterator&gt;
-<span class="lineNum">    3216 </span>                :     bool
-<span class="lineNum">    3217 </span>                :     next_permutation(_BidirectionalIterator __first,
-<span class="lineNum">    3218 </span>                :                      _BidirectionalIterator __last)
-<span class="lineNum">    3219 </span>                :     {
-<span class="lineNum">    3220 </span>                :       // concept requirements
-<span class="lineNum">    3221 </span>                :       __glibcxx_function_requires(_BidirectionalIteratorConcept&lt;
-<span class="lineNum">    3222 </span>                :                                   _BidirectionalIterator&gt;)
-<span class="lineNum">    3223 </span>                :       __glibcxx_function_requires(_LessThanComparableConcept&lt;
-<span class="lineNum">    3224 </span>                :             typename iterator_traits&lt;_BidirectionalIterator&gt;::value_type&gt;)
-<span class="lineNum">    3225 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    3226 </span>                : 
-<span class="lineNum">    3227 </span>                :       if (__first == __last)
-<span class="lineNum">    3228 </span>                :         return false;
-<span class="lineNum">    3229 </span>                :       _BidirectionalIterator __i = __first;
-<span class="lineNum">    3230 </span>                :       ++__i;
-<span class="lineNum">    3231 </span>                :       if (__i == __last)
-<span class="lineNum">    3232 </span>                :         return false;
-<span class="lineNum">    3233 </span>                :       __i = __last;
-<span class="lineNum">    3234 </span>                :       --__i;
-<span class="lineNum">    3235 </span>                : 
-<span class="lineNum">    3236 </span>                :       for(;;)
-<span class="lineNum">    3237 </span>                :         {
-<span class="lineNum">    3238 </span>                :           _BidirectionalIterator __ii = __i;
-<span class="lineNum">    3239 </span>                :           --__i;
-<span class="lineNum">    3240 </span>                :           if (*__i &lt; *__ii)
-<span class="lineNum">    3241 </span>                :             {
-<span class="lineNum">    3242 </span>                :               _BidirectionalIterator __j = __last;
-<span class="lineNum">    3243 </span>                :               while (!(*__i &lt; *--__j))
-<span class="lineNum">    3244 </span>                :                 {}
-<span class="lineNum">    3245 </span>                :               std::iter_swap(__i, __j);
-<span class="lineNum">    3246 </span>                :               std::reverse(__ii, __last);
-<span class="lineNum">    3247 </span>                :               return true;
-<span class="lineNum">    3248 </span>                :             }
-<span class="lineNum">    3249 </span>                :           if (__i == __first)
-<span class="lineNum">    3250 </span>                :             {
-<span class="lineNum">    3251 </span>                :               std::reverse(__first, __last);
-<span class="lineNum">    3252 </span>                :               return false;
-<span class="lineNum">    3253 </span>                :             }
-<span class="lineNum">    3254 </span>                :         }
-<span class="lineNum">    3255 </span>                :     }
-<span class="lineNum">    3256 </span>                : 
-<span class="lineNum">    3257 </span>                :   /**
-<span class="lineNum">    3258 </span>                :    *  @brief  Permute range into the next &quot;dictionary&quot; ordering using
-<span class="lineNum">    3259 </span>                :    *          comparison functor.
-<span class="lineNum">    3260 </span>                :    *  @param  first  Start of range.
-<span class="lineNum">    3261 </span>                :    *  @param  last   End of range.
-<span class="lineNum">    3262 </span>                :    *  @param  comp   A comparison functor.
-<span class="lineNum">    3263 </span>                :    *  @return  False if wrapped to first permutation, true otherwise.
-<span class="lineNum">    3264 </span>                :    *
-<span class="lineNum">    3265 </span>                :    *  Treats all permutations of the range [first,last) as a set of
-<span class="lineNum">    3266 </span>                :    *  &quot;dictionary&quot; sorted sequences ordered by @a comp.  Permutes the current
-<span class="lineNum">    3267 </span>                :    *  sequence into the next one of this set.  Returns true if there are more
-<span class="lineNum">    3268 </span>                :    *  sequences to generate.  If the sequence is the largest of the set, the
-<span class="lineNum">    3269 </span>                :    *  smallest is generated and false returned.
-<span class="lineNum">    3270 </span>                :   */
-<span class="lineNum">    3271 </span>                :   template&lt;typename _BidirectionalIterator, typename _Compare&gt;
-<span class="lineNum">    3272 </span>                :     bool
-<span class="lineNum">    3273 </span>                :     next_permutation(_BidirectionalIterator __first,
-<span class="lineNum">    3274 </span>                :                      _BidirectionalIterator __last, _Compare __comp)
-<span class="lineNum">    3275 </span>                :     {
-<span class="lineNum">    3276 </span>                :       // concept requirements
-<span class="lineNum">    3277 </span>                :       __glibcxx_function_requires(_BidirectionalIteratorConcept&lt;
-<span class="lineNum">    3278 </span>                :                                   _BidirectionalIterator&gt;)
-<span class="lineNum">    3279 </span>                :       __glibcxx_function_requires(_BinaryPredicateConcept&lt;_Compare,
-<span class="lineNum">    3280 </span>                :             typename iterator_traits&lt;_BidirectionalIterator&gt;::value_type,
-<span class="lineNum">    3281 </span>                :             typename iterator_traits&lt;_BidirectionalIterator&gt;::value_type&gt;)
-<span class="lineNum">    3282 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    3283 </span>                : 
-<span class="lineNum">    3284 </span>                :       if (__first == __last)
-<span class="lineNum">    3285 </span>                :         return false;
-<span class="lineNum">    3286 </span>                :       _BidirectionalIterator __i = __first;
-<span class="lineNum">    3287 </span>                :       ++__i;
-<span class="lineNum">    3288 </span>                :       if (__i == __last)
-<span class="lineNum">    3289 </span>                :         return false;
-<span class="lineNum">    3290 </span>                :       __i = __last;
-<span class="lineNum">    3291 </span>                :       --__i;
-<span class="lineNum">    3292 </span>                : 
-<span class="lineNum">    3293 </span>                :       for(;;)
-<span class="lineNum">    3294 </span>                :         {
-<span class="lineNum">    3295 </span>                :           _BidirectionalIterator __ii = __i;
-<span class="lineNum">    3296 </span>                :           --__i;
-<span class="lineNum">    3297 </span>                :           if (__comp(*__i, *__ii))
-<span class="lineNum">    3298 </span>                :             {
-<span class="lineNum">    3299 </span>                :               _BidirectionalIterator __j = __last;
-<span class="lineNum">    3300 </span>                :               while (!bool(__comp(*__i, *--__j)))
-<span class="lineNum">    3301 </span>                :                 {}
-<span class="lineNum">    3302 </span>                :               std::iter_swap(__i, __j);
-<span class="lineNum">    3303 </span>                :               std::reverse(__ii, __last);
-<span class="lineNum">    3304 </span>                :               return true;
-<span class="lineNum">    3305 </span>                :             }
-<span class="lineNum">    3306 </span>                :           if (__i == __first)
-<span class="lineNum">    3307 </span>                :             {
-<span class="lineNum">    3308 </span>                :               std::reverse(__first, __last);
-<span class="lineNum">    3309 </span>                :               return false;
-<span class="lineNum">    3310 </span>                :             }
-<span class="lineNum">    3311 </span>                :         }
-<span class="lineNum">    3312 </span>                :     }
-<span class="lineNum">    3313 </span>                : 
-<span class="lineNum">    3314 </span>                :   /**
-<span class="lineNum">    3315 </span>                :    *  @brief  Permute range into the previous &quot;dictionary&quot; ordering.
-<span class="lineNum">    3316 </span>                :    *  @param  first  Start of range.
-<span class="lineNum">    3317 </span>                :    *  @param  last   End of range.
-<span class="lineNum">    3318 </span>                :    *  @return  False if wrapped to last permutation, true otherwise.
-<span class="lineNum">    3319 </span>                :    *
-<span class="lineNum">    3320 </span>                :    *  Treats all permutations of the range as a set of &quot;dictionary&quot; sorted
-<span class="lineNum">    3321 </span>                :    *  sequences.  Permutes the current sequence into the previous one of this
-<span class="lineNum">    3322 </span>                :    *  set.  Returns true if there are more sequences to generate.  If the
-<span class="lineNum">    3323 </span>                :    *  sequence is the smallest of the set, the largest is generated and false
-<span class="lineNum">    3324 </span>                :    *  returned.
-<span class="lineNum">    3325 </span>                :   */
-<span class="lineNum">    3326 </span>                :   template&lt;typename _BidirectionalIterator&gt;
-<span class="lineNum">    3327 </span>                :     bool
-<span class="lineNum">    3328 </span>                :     prev_permutation(_BidirectionalIterator __first,
-<span class="lineNum">    3329 </span>                :                      _BidirectionalIterator __last)
-<span class="lineNum">    3330 </span>                :     {
-<span class="lineNum">    3331 </span>                :       // concept requirements
-<span class="lineNum">    3332 </span>                :       __glibcxx_function_requires(_BidirectionalIteratorConcept&lt;
-<span class="lineNum">    3333 </span>                :                                   _BidirectionalIterator&gt;)
-<span class="lineNum">    3334 </span>                :       __glibcxx_function_requires(_LessThanComparableConcept&lt;
-<span class="lineNum">    3335 </span>                :             typename iterator_traits&lt;_BidirectionalIterator&gt;::value_type&gt;)
-<span class="lineNum">    3336 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    3337 </span>                : 
-<span class="lineNum">    3338 </span>                :       if (__first == __last)
-<span class="lineNum">    3339 </span>                :         return false;
-<span class="lineNum">    3340 </span>                :       _BidirectionalIterator __i = __first;
-<span class="lineNum">    3341 </span>                :       ++__i;
-<span class="lineNum">    3342 </span>                :       if (__i == __last)
-<span class="lineNum">    3343 </span>                :         return false;
-<span class="lineNum">    3344 </span>                :       __i = __last;
-<span class="lineNum">    3345 </span>                :       --__i;
-<span class="lineNum">    3346 </span>                : 
-<span class="lineNum">    3347 </span>                :       for(;;)
-<span class="lineNum">    3348 </span>                :         {
-<span class="lineNum">    3349 </span>                :           _BidirectionalIterator __ii = __i;
-<span class="lineNum">    3350 </span>                :           --__i;
-<span class="lineNum">    3351 </span>                :           if (*__ii &lt; *__i)
-<span class="lineNum">    3352 </span>                :             {
-<span class="lineNum">    3353 </span>                :               _BidirectionalIterator __j = __last;
-<span class="lineNum">    3354 </span>                :               while (!(*--__j &lt; *__i))
-<span class="lineNum">    3355 </span>                :                 {}
-<span class="lineNum">    3356 </span>                :               std::iter_swap(__i, __j);
-<span class="lineNum">    3357 </span>                :               std::reverse(__ii, __last);
-<span class="lineNum">    3358 </span>                :               return true;
-<span class="lineNum">    3359 </span>                :             }
-<span class="lineNum">    3360 </span>                :           if (__i == __first)
-<span class="lineNum">    3361 </span>                :             {
-<span class="lineNum">    3362 </span>                :               std::reverse(__first, __last);
-<span class="lineNum">    3363 </span>                :               return false;
-<span class="lineNum">    3364 </span>                :             }
-<span class="lineNum">    3365 </span>                :         }
-<span class="lineNum">    3366 </span>                :     }
-<span class="lineNum">    3367 </span>                : 
-<span class="lineNum">    3368 </span>                :   /**
-<span class="lineNum">    3369 </span>                :    *  @brief  Permute range into the previous &quot;dictionary&quot; ordering using
-<span class="lineNum">    3370 </span>                :    *          comparison functor.
-<span class="lineNum">    3371 </span>                :    *  @param  first  Start of range.
-<span class="lineNum">    3372 </span>                :    *  @param  last   End of range.
-<span class="lineNum">    3373 </span>                :    *  @param  comp   A comparison functor.
-<span class="lineNum">    3374 </span>                :    *  @return  False if wrapped to last permutation, true otherwise.
-<span class="lineNum">    3375 </span>                :    *
-<span class="lineNum">    3376 </span>                :    *  Treats all permutations of the range [first,last) as a set of
-<span class="lineNum">    3377 </span>                :    *  &quot;dictionary&quot; sorted sequences ordered by @a comp.  Permutes the current
-<span class="lineNum">    3378 </span>                :    *  sequence into the previous one of this set.  Returns true if there are
-<span class="lineNum">    3379 </span>                :    *  more sequences to generate.  If the sequence is the smallest of the set,
-<span class="lineNum">    3380 </span>                :    *  the largest is generated and false returned.
-<span class="lineNum">    3381 </span>                :   */
-<span class="lineNum">    3382 </span>                :   template&lt;typename _BidirectionalIterator, typename _Compare&gt;
-<span class="lineNum">    3383 </span>                :     bool
-<span class="lineNum">    3384 </span>                :     prev_permutation(_BidirectionalIterator __first,
-<span class="lineNum">    3385 </span>                :                      _BidirectionalIterator __last, _Compare __comp)
-<span class="lineNum">    3386 </span>                :     {
-<span class="lineNum">    3387 </span>                :       // concept requirements
-<span class="lineNum">    3388 </span>                :       __glibcxx_function_requires(_BidirectionalIteratorConcept&lt;
-<span class="lineNum">    3389 </span>                :                                   _BidirectionalIterator&gt;)
-<span class="lineNum">    3390 </span>                :       __glibcxx_function_requires(_BinaryPredicateConcept&lt;_Compare,
-<span class="lineNum">    3391 </span>                :             typename iterator_traits&lt;_BidirectionalIterator&gt;::value_type,
-<span class="lineNum">    3392 </span>                :             typename iterator_traits&lt;_BidirectionalIterator&gt;::value_type&gt;)
-<span class="lineNum">    3393 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    3394 </span>                : 
-<span class="lineNum">    3395 </span>                :       if (__first == __last)
-<span class="lineNum">    3396 </span>                :         return false;
-<span class="lineNum">    3397 </span>                :       _BidirectionalIterator __i = __first;
-<span class="lineNum">    3398 </span>                :       ++__i;
-<span class="lineNum">    3399 </span>                :       if (__i == __last)
-<span class="lineNum">    3400 </span>                :         return false;
-<span class="lineNum">    3401 </span>                :       __i = __last;
-<span class="lineNum">    3402 </span>                :       --__i;
-<span class="lineNum">    3403 </span>                : 
-<span class="lineNum">    3404 </span>                :       for(;;)
-<span class="lineNum">    3405 </span>                :         {
-<span class="lineNum">    3406 </span>                :           _BidirectionalIterator __ii = __i;
-<span class="lineNum">    3407 </span>                :           --__i;
-<span class="lineNum">    3408 </span>                :           if (__comp(*__ii, *__i))
-<span class="lineNum">    3409 </span>                :             {
-<span class="lineNum">    3410 </span>                :               _BidirectionalIterator __j = __last;
-<span class="lineNum">    3411 </span>                :               while (!bool(__comp(*--__j, *__i)))
-<span class="lineNum">    3412 </span>                :                 {}
-<span class="lineNum">    3413 </span>                :               std::iter_swap(__i, __j);
-<span class="lineNum">    3414 </span>                :               std::reverse(__ii, __last);
-<span class="lineNum">    3415 </span>                :               return true;
-<span class="lineNum">    3416 </span>                :             }
-<span class="lineNum">    3417 </span>                :           if (__i == __first)
-<span class="lineNum">    3418 </span>                :             {
-<span class="lineNum">    3419 </span>                :               std::reverse(__first, __last);
-<span class="lineNum">    3420 </span>                :               return false;
-<span class="lineNum">    3421 </span>                :             }
-<span class="lineNum">    3422 </span>                :         }
-<span class="lineNum">    3423 </span>                :     }
-<span class="lineNum">    3424 </span>                : 
-<span class="lineNum">    3425 </span>                :   // replace
-<span class="lineNum">    3426 </span>                :   // replace_if
-<span class="lineNum">    3427 </span>                : 
-<span class="lineNum">    3428 </span>                :   /**
-<span class="lineNum">    3429 </span>                :    *  @brief Copy a sequence, replacing each element of one value with another
-<span class="lineNum">    3430 </span>                :    *         value.
-<span class="lineNum">    3431 </span>                :    *  @param  first      An input iterator.
-<span class="lineNum">    3432 </span>                :    *  @param  last       An input iterator.
-<span class="lineNum">    3433 </span>                :    *  @param  result     An output iterator.
-<span class="lineNum">    3434 </span>                :    *  @param  old_value  The value to be replaced.
-<span class="lineNum">    3435 </span>                :    *  @param  new_value  The replacement value.
-<span class="lineNum">    3436 </span>                :    *  @return   The end of the output sequence, @p result+(last-first).
-<span class="lineNum">    3437 </span>                :    *
-<span class="lineNum">    3438 </span>                :    *  Copies each element in the input range @p [first,last) to the
-<span class="lineNum">    3439 </span>                :    *  output range @p [result,result+(last-first)) replacing elements
-<span class="lineNum">    3440 </span>                :    *  equal to @p old_value with @p new_value.
-<span class="lineNum">    3441 </span>                :   */
-<span class="lineNum">    3442 </span>                :   template&lt;typename _InputIterator, typename _OutputIterator, typename _Tp&gt;
-<span class="lineNum">    3443 </span>                :     _OutputIterator
-<span class="lineNum">    3444 </span>                :     replace_copy(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">    3445 </span>                :                  _OutputIterator __result,
-<span class="lineNum">    3446 </span>                :                  const _Tp&amp; __old_value, const _Tp&amp; __new_value)
-<span class="lineNum">    3447 </span>                :     {
-<span class="lineNum">    3448 </span>                :       // concept requirements
-<span class="lineNum">    3449 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator&gt;)
-<span class="lineNum">    3450 </span>                :       __glibcxx_function_requires(_OutputIteratorConcept&lt;_OutputIterator,
-<span class="lineNum">    3451 </span>                :             typename iterator_traits&lt;_InputIterator&gt;::value_type&gt;)
-<span class="lineNum">    3452 </span>                :       __glibcxx_function_requires(_EqualOpConcept&lt;
-<span class="lineNum">    3453 </span>                :             typename iterator_traits&lt;_InputIterator&gt;::value_type, _Tp&gt;)
-<span class="lineNum">    3454 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    3455 </span>                : 
-<span class="lineNum">    3456 </span>                :       for (; __first != __last; ++__first, ++__result)
-<span class="lineNum">    3457 </span>                :         if (*__first == __old_value)
-<span class="lineNum">    3458 </span>                :           *__result = __new_value;
-<span class="lineNum">    3459 </span>                :         else
-<span class="lineNum">    3460 </span>                :           *__result = *__first;
-<span class="lineNum">    3461 </span>                :       return __result;
-<span class="lineNum">    3462 </span>                :     }
-<span class="lineNum">    3463 </span>                : 
-<span class="lineNum">    3464 </span>                :   /**
-<span class="lineNum">    3465 </span>                :    *  @brief Copy a sequence, replacing each value for which a predicate
-<span class="lineNum">    3466 </span>                :    *         returns true with another value.
-<span class="lineNum">    3467 </span>                :    *  @param  first      An input iterator.
-<span class="lineNum">    3468 </span>                :    *  @param  last       An input iterator.
-<span class="lineNum">    3469 </span>                :    *  @param  result     An output iterator.
-<span class="lineNum">    3470 </span>                :    *  @param  pred       A predicate.
-<span class="lineNum">    3471 </span>                :    *  @param  new_value  The replacement value.
-<span class="lineNum">    3472 </span>                :    *  @return   The end of the output sequence, @p result+(last-first).
-<span class="lineNum">    3473 </span>                :    *
-<span class="lineNum">    3474 </span>                :    *  Copies each element in the range @p [first,last) to the range
-<span class="lineNum">    3475 </span>                :    *  @p [result,result+(last-first)) replacing elements for which
-<span class="lineNum">    3476 </span>                :    *  @p pred returns true with @p new_value.
-<span class="lineNum">    3477 </span>                :   */
-<span class="lineNum">    3478 </span>                :   template&lt;typename _InputIterator, typename _OutputIterator,
-<span class="lineNum">    3479 </span>                :            typename _Predicate, typename _Tp&gt;
-<span class="lineNum">    3480 </span>                :     _OutputIterator
-<span class="lineNum">    3481 </span>                :     replace_copy_if(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">    3482 </span>                :                     _OutputIterator __result,
-<span class="lineNum">    3483 </span>                :                     _Predicate __pred, const _Tp&amp; __new_value)
-<span class="lineNum">    3484 </span>                :     {
-<span class="lineNum">    3485 </span>                :       // concept requirements
-<span class="lineNum">    3486 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator&gt;)
-<span class="lineNum">    3487 </span>                :       __glibcxx_function_requires(_OutputIteratorConcept&lt;_OutputIterator,
-<span class="lineNum">    3488 </span>                :             typename iterator_traits&lt;_InputIterator&gt;::value_type&gt;)
-<span class="lineNum">    3489 </span>                :       __glibcxx_function_requires(_UnaryPredicateConcept&lt;_Predicate,
-<span class="lineNum">    3490 </span>                :             typename iterator_traits&lt;_InputIterator&gt;::value_type&gt;)
-<span class="lineNum">    3491 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    3492 </span>                : 
-<span class="lineNum">    3493 </span>                :       for (; __first != __last; ++__first, ++__result)
-<span class="lineNum">    3494 </span>                :         if (__pred(*__first))
-<span class="lineNum">    3495 </span>                :           *__result = __new_value;
-<span class="lineNum">    3496 </span>                :         else
-<span class="lineNum">    3497 </span>                :           *__result = *__first;
-<span class="lineNum">    3498 </span>                :       return __result;
-<span class="lineNum">    3499 </span>                :     }
-<span class="lineNum">    3500 </span>                : 
-<span class="lineNum">    3501 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">    3502 </span>                :   /**
-<span class="lineNum">    3503 </span>                :    *  @brief  Determines whether the elements of a sequence are sorted.
-<span class="lineNum">    3504 </span>                :    *  @param  first   An iterator.
-<span class="lineNum">    3505 </span>                :    *  @param  last    Another iterator.
-<span class="lineNum">    3506 </span>                :    *  @return  True if the elements are sorted, false otherwise.
-<span class="lineNum">    3507 </span>                :   */
-<span class="lineNum">    3508 </span>                :   template&lt;typename _ForwardIterator&gt;
-<span class="lineNum">    3509 </span>                :     inline bool
-<span class="lineNum">    3510 </span>                :     is_sorted(_ForwardIterator __first, _ForwardIterator __last)
-<span class="lineNum">    3511 </span>                :     { return std::is_sorted_until(__first, __last) == __last; }
-<span class="lineNum">    3512 </span>                : 
-<span class="lineNum">    3513 </span>                :   /**
-<span class="lineNum">    3514 </span>                :    *  @brief  Determines whether the elements of a sequence are sorted
-<span class="lineNum">    3515 </span>                :    *          according to a comparison functor.
-<span class="lineNum">    3516 </span>                :    *  @param  first   An iterator.
-<span class="lineNum">    3517 </span>                :    *  @param  last    Another iterator.
-<span class="lineNum">    3518 </span>                :    *  @param  comp    A comparison functor.
-<span class="lineNum">    3519 </span>                :    *  @return  True if the elements are sorted, false otherwise.
-<span class="lineNum">    3520 </span>                :   */
-<span class="lineNum">    3521 </span>                :   template&lt;typename _ForwardIterator, typename _Compare&gt;
-<span class="lineNum">    3522 </span>                :     inline bool
-<span class="lineNum">    3523 </span>                :     is_sorted(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">    3524 </span>                :               _Compare __comp)
-<span class="lineNum">    3525 </span>                :     { return std::is_sorted_until(__first, __last, __comp) == __last; }
-<span class="lineNum">    3526 </span>                : 
-<span class="lineNum">    3527 </span>                :   /**
-<span class="lineNum">    3528 </span>                :    *  @brief  Determines the end of a sorted sequence.
-<span class="lineNum">    3529 </span>                :    *  @param  first   An iterator.
-<span class="lineNum">    3530 </span>                :    *  @param  last    Another iterator.
-<span class="lineNum">    3531 </span>                :    *  @return  An iterator pointing to the last iterator i in [first, last)
-<span class="lineNum">    3532 </span>                :    *           for which the range [first, i) is sorted.
-<span class="lineNum">    3533 </span>                :   */
-<span class="lineNum">    3534 </span>                :   template&lt;typename _ForwardIterator&gt;
-<span class="lineNum">    3535 </span>                :     _ForwardIterator
-<span class="lineNum">    3536 </span>                :     is_sorted_until(_ForwardIterator __first, _ForwardIterator __last)
-<span class="lineNum">    3537 </span>                :     {
-<span class="lineNum">    3538 </span>                :       // concept requirements
-<span class="lineNum">    3539 </span>                :       __glibcxx_function_requires(_ForwardIteratorConcept&lt;_ForwardIterator&gt;)
-<span class="lineNum">    3540 </span>                :       __glibcxx_function_requires(_LessThanComparableConcept&lt;
-<span class="lineNum">    3541 </span>                :             typename iterator_traits&lt;_ForwardIterator&gt;::value_type&gt;)
-<span class="lineNum">    3542 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    3543 </span>                : 
-<span class="lineNum">    3544 </span>                :       if (__first == __last)
-<span class="lineNum">    3545 </span>                :         return __last;
-<span class="lineNum">    3546 </span>                : 
-<span class="lineNum">    3547 </span>                :       _ForwardIterator __next = __first;
-<span class="lineNum">    3548 </span>                :       for (++__next; __next != __last; __first = __next, ++__next)
-<span class="lineNum">    3549 </span>                :         if (*__next &lt; *__first)
-<span class="lineNum">    3550 </span>                :           return __next;
-<span class="lineNum">    3551 </span>                :       return __next;
-<span class="lineNum">    3552 </span>                :     }
-<span class="lineNum">    3553 </span>                : 
-<span class="lineNum">    3554 </span>                :   /**
-<span class="lineNum">    3555 </span>                :    *  @brief  Determines the end of a sorted sequence using comparison functor.
-<span class="lineNum">    3556 </span>                :    *  @param  first   An iterator.
-<span class="lineNum">    3557 </span>                :    *  @param  last    Another iterator.
-<span class="lineNum">    3558 </span>                :    *  @param  comp    A comparison functor.
-<span class="lineNum">    3559 </span>                :    *  @return  An iterator pointing to the last iterator i in [first, last)
-<span class="lineNum">    3560 </span>                :    *           for which the range [first, i) is sorted.
-<span class="lineNum">    3561 </span>                :   */
-<span class="lineNum">    3562 </span>                :   template&lt;typename _ForwardIterator, typename _Compare&gt;
-<span class="lineNum">    3563 </span>                :     _ForwardIterator
-<span class="lineNum">    3564 </span>                :     is_sorted_until(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">    3565 </span>                :                     _Compare __comp)
-<span class="lineNum">    3566 </span>                :     {
-<span class="lineNum">    3567 </span>                :       // concept requirements
-<span class="lineNum">    3568 </span>                :       __glibcxx_function_requires(_ForwardIteratorConcept&lt;_ForwardIterator&gt;)
-<span class="lineNum">    3569 </span>                :       __glibcxx_function_requires(_BinaryPredicateConcept&lt;_Compare,
-<span class="lineNum">    3570 </span>                :             typename iterator_traits&lt;_ForwardIterator&gt;::value_type,
-<span class="lineNum">    3571 </span>                :             typename iterator_traits&lt;_ForwardIterator&gt;::value_type&gt;)
-<span class="lineNum">    3572 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    3573 </span>                : 
-<span class="lineNum">    3574 </span>                :       if (__first == __last)
-<span class="lineNum">    3575 </span>                :         return __last;
-<span class="lineNum">    3576 </span>                : 
-<span class="lineNum">    3577 </span>                :       _ForwardIterator __next = __first;
-<span class="lineNum">    3578 </span>                :       for (++__next; __next != __last; __first = __next, ++__next)
-<span class="lineNum">    3579 </span>                :         if (__comp(*__next, *__first))
-<span class="lineNum">    3580 </span>                :           return __next;
-<span class="lineNum">    3581 </span>                :       return __next;
-<span class="lineNum">    3582 </span>                :     }
-<span class="lineNum">    3583 </span>                : 
-<span class="lineNum">    3584 </span>                :   /**
-<span class="lineNum">    3585 </span>                :    *  @brief  Determines min and max at once as an ordered pair.
-<span class="lineNum">    3586 </span>                :    *  @param  a  A thing of arbitrary type.
-<span class="lineNum">    3587 </span>                :    *  @param  b  Another thing of arbitrary type.
-<span class="lineNum">    3588 </span>                :    *  @return  A pair(b, a) if b is smaller than a, pair(a, b) otherwise.
-<span class="lineNum">    3589 </span>                :   */
-<span class="lineNum">    3590 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">    3591 </span>                :     inline pair&lt;const _Tp&amp;, const _Tp&amp;&gt;
-<span class="lineNum">    3592 </span>                :     minmax(const _Tp&amp; __a, const _Tp&amp; __b)
-<span class="lineNum">    3593 </span>                :     {
-<span class="lineNum">    3594 </span>                :       // concept requirements
-<span class="lineNum">    3595 </span>                :       __glibcxx_function_requires(_LessThanComparableConcept&lt;_Tp&gt;)
-<span class="lineNum">    3596 </span>                : 
-<span class="lineNum">    3597 </span>                :       return __b &lt; __a ? pair&lt;const _Tp&amp;, const _Tp&amp;&gt;(__b, __a)
-<span class="lineNum">    3598 </span>                :                        : pair&lt;const _Tp&amp;, const _Tp&amp;&gt;(__a, __b);
-<span class="lineNum">    3599 </span>                :     }
-<span class="lineNum">    3600 </span>                : 
-<span class="lineNum">    3601 </span>                :   /**
-<span class="lineNum">    3602 </span>                :    *  @brief  Determines min and max at once as an ordered pair.
-<span class="lineNum">    3603 </span>                :    *  @param  a  A thing of arbitrary type.
-<span class="lineNum">    3604 </span>                :    *  @param  b  Another thing of arbitrary type.
-<span class="lineNum">    3605 </span>                :    *  @param  comp  A @link s20_3_3_comparisons comparison functor@endlink.
-<span class="lineNum">    3606 </span>                :    *  @return  A pair(b, a) if b is smaller than a, pair(a, b) otherwise.
-<span class="lineNum">    3607 </span>                :   */
-<span class="lineNum">    3608 </span>                :   template&lt;typename _Tp, typename _Compare&gt;
-<span class="lineNum">    3609 </span>                :     inline pair&lt;const _Tp&amp;, const _Tp&amp;&gt;
-<span class="lineNum">    3610 </span>                :     minmax(const _Tp&amp; __a, const _Tp&amp; __b, _Compare __comp)
-<span class="lineNum">    3611 </span>                :     {
-<span class="lineNum">    3612 </span>                :       return __comp(__b, __a) ? pair&lt;const _Tp&amp;, const _Tp&amp;&gt;(__b, __a)
-<span class="lineNum">    3613 </span>                :                               : pair&lt;const _Tp&amp;, const _Tp&amp;&gt;(__a, __b);
-<span class="lineNum">    3614 </span>                :     }
-<span class="lineNum">    3615 </span>                : 
-<span class="lineNum">    3616 </span>                :   /**
-<span class="lineNum">    3617 </span>                :    *  @brief  Return a pair of iterators pointing to the minimum and maximum
-<span class="lineNum">    3618 </span>                :    *          elements in a range.
-<span class="lineNum">    3619 </span>                :    *  @param  first  Start of range.
-<span class="lineNum">    3620 </span>                :    *  @param  last   End of range.
-<span class="lineNum">    3621 </span>                :    *  @return  make_pair(m, M), where m is the first iterator i in 
-<span class="lineNum">    3622 </span>                :    *           [first, last) such that no other element in the range is
-<span class="lineNum">    3623 </span>                :    *           smaller, and where M is the last iterator i in [first, last)
-<span class="lineNum">    3624 </span>                :    *           such that no other element in the range is larger.
-<span class="lineNum">    3625 </span>                :   */
-<span class="lineNum">    3626 </span>                :   template&lt;typename _ForwardIterator&gt;
-<span class="lineNum">    3627 </span>                :     pair&lt;_ForwardIterator, _ForwardIterator&gt;
-<span class="lineNum">    3628 </span>                :     minmax_element(_ForwardIterator __first, _ForwardIterator __last)
-<span class="lineNum">    3629 </span>                :     {
-<span class="lineNum">    3630 </span>                :       // concept requirements
-<span class="lineNum">    3631 </span>                :       __glibcxx_function_requires(_ForwardIteratorConcept&lt;_ForwardIterator&gt;)
-<span class="lineNum">    3632 </span>                :       __glibcxx_function_requires(_LessThanComparableConcept&lt;
-<span class="lineNum">    3633 </span>                :             typename iterator_traits&lt;_ForwardIterator&gt;::value_type&gt;)
-<span class="lineNum">    3634 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    3635 </span>                : 
-<span class="lineNum">    3636 </span>                :       _ForwardIterator __next = __first;
-<span class="lineNum">    3637 </span>                :       if (__first == __last
-<span class="lineNum">    3638 </span>                :           || ++__next == __last)
-<span class="lineNum">    3639 </span>                :         return std::make_pair(__first, __first);
-<span class="lineNum">    3640 </span>                : 
-<span class="lineNum">    3641 </span>                :       _ForwardIterator __min, __max;
-<span class="lineNum">    3642 </span>                :       if (*__next &lt; *__first)
-<span class="lineNum">    3643 </span>                :         {
-<span class="lineNum">    3644 </span>                :           __min = __next;
-<span class="lineNum">    3645 </span>                :           __max = __first;
-<span class="lineNum">    3646 </span>                :         }
-<span class="lineNum">    3647 </span>                :       else
-<span class="lineNum">    3648 </span>                :         {
-<span class="lineNum">    3649 </span>                :           __min = __first;
-<span class="lineNum">    3650 </span>                :           __max = __next;
-<span class="lineNum">    3651 </span>                :         }
-<span class="lineNum">    3652 </span>                : 
-<span class="lineNum">    3653 </span>                :       __first = __next;
-<span class="lineNum">    3654 </span>                :       ++__first;
-<span class="lineNum">    3655 </span>                : 
-<span class="lineNum">    3656 </span>                :       while (__first != __last)
-<span class="lineNum">    3657 </span>                :         {
-<span class="lineNum">    3658 </span>                :           __next = __first;
-<span class="lineNum">    3659 </span>                :           if (++__next == __last)
-<span class="lineNum">    3660 </span>                :             {
-<span class="lineNum">    3661 </span>                :               if (*__first &lt; *__min)
-<span class="lineNum">    3662 </span>                :                 __min = __first;
-<span class="lineNum">    3663 </span>                :               else if (!(*__first &lt; *__max))
-<span class="lineNum">    3664 </span>                :                 __max = __first;
-<span class="lineNum">    3665 </span>                :               break;
-<span class="lineNum">    3666 </span>                :             }
-<span class="lineNum">    3667 </span>                : 
-<span class="lineNum">    3668 </span>                :           if (*__next &lt; *__first)
-<span class="lineNum">    3669 </span>                :             {
-<span class="lineNum">    3670 </span>                :               if (*__next &lt; *__min)
-<span class="lineNum">    3671 </span>                :                 __min = __next;
-<span class="lineNum">    3672 </span>                :               if (!(*__first &lt; *__max))
-<span class="lineNum">    3673 </span>                :                 __max = __first;
-<span class="lineNum">    3674 </span>                :             }
-<span class="lineNum">    3675 </span>                :           else
-<span class="lineNum">    3676 </span>                :             {
-<span class="lineNum">    3677 </span>                :               if (*__first &lt; *__min)
-<span class="lineNum">    3678 </span>                :                 __min = __first;
-<span class="lineNum">    3679 </span>                :               if (!(*__next &lt; *__max))
-<span class="lineNum">    3680 </span>                :                 __max = __next;
-<span class="lineNum">    3681 </span>                :             }
-<span class="lineNum">    3682 </span>                : 
-<span class="lineNum">    3683 </span>                :           __first = __next;
-<span class="lineNum">    3684 </span>                :           ++__first;
-<span class="lineNum">    3685 </span>                :         }
-<span class="lineNum">    3686 </span>                : 
-<span class="lineNum">    3687 </span>                :       return std::make_pair(__min, __max);
-<span class="lineNum">    3688 </span>                :     }
-<span class="lineNum">    3689 </span>                : 
-<span class="lineNum">    3690 </span>                :   /**
-<span class="lineNum">    3691 </span>                :    *  @brief  Return a pair of iterators pointing to the minimum and maximum
-<span class="lineNum">    3692 </span>                :    *          elements in a range.
-<span class="lineNum">    3693 </span>                :    *  @param  first  Start of range.
-<span class="lineNum">    3694 </span>                :    *  @param  last   End of range.
-<span class="lineNum">    3695 </span>                :    *  @param  comp   Comparison functor.
-<span class="lineNum">    3696 </span>                :    *  @return  make_pair(m, M), where m is the first iterator i in 
-<span class="lineNum">    3697 </span>                :    *           [first, last) such that no other element in the range is
-<span class="lineNum">    3698 </span>                :    *           smaller, and where M is the last iterator i in [first, last)
-<span class="lineNum">    3699 </span>                :    *           such that no other element in the range is larger.
-<span class="lineNum">    3700 </span>                :   */
-<span class="lineNum">    3701 </span>                :   template&lt;typename _ForwardIterator, typename _Compare&gt;
-<span class="lineNum">    3702 </span>                :     pair&lt;_ForwardIterator, _ForwardIterator&gt;
-<span class="lineNum">    3703 </span>                :     minmax_element(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">    3704 </span>                :                    _Compare __comp)
-<span class="lineNum">    3705 </span>                :     {
-<span class="lineNum">    3706 </span>                :       // concept requirements
-<span class="lineNum">    3707 </span>                :       __glibcxx_function_requires(_ForwardIteratorConcept&lt;_ForwardIterator&gt;)
-<span class="lineNum">    3708 </span>                :       __glibcxx_function_requires(_BinaryPredicateConcept&lt;_Compare,
-<span class="lineNum">    3709 </span>                :             typename iterator_traits&lt;_ForwardIterator&gt;::value_type,
-<span class="lineNum">    3710 </span>                :             typename iterator_traits&lt;_ForwardIterator&gt;::value_type&gt;)
-<span class="lineNum">    3711 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    3712 </span>                : 
-<span class="lineNum">    3713 </span>                :       _ForwardIterator __next = __first;
-<span class="lineNum">    3714 </span>                :       if (__first == __last
-<span class="lineNum">    3715 </span>                :           || ++__next == __last)
-<span class="lineNum">    3716 </span>                :         return std::make_pair(__first, __first);
-<span class="lineNum">    3717 </span>                : 
-<span class="lineNum">    3718 </span>                :       _ForwardIterator __min, __max;
-<span class="lineNum">    3719 </span>                :       if (__comp(*__next, *__first))
-<span class="lineNum">    3720 </span>                :         {
-<span class="lineNum">    3721 </span>                :           __min = __next;
-<span class="lineNum">    3722 </span>                :           __max = __first;
-<span class="lineNum">    3723 </span>                :         }
-<span class="lineNum">    3724 </span>                :       else
-<span class="lineNum">    3725 </span>                :         {
-<span class="lineNum">    3726 </span>                :           __min = __first;
-<span class="lineNum">    3727 </span>                :           __max = __next;
-<span class="lineNum">    3728 </span>                :         }
-<span class="lineNum">    3729 </span>                : 
-<span class="lineNum">    3730 </span>                :       __first = __next;
-<span class="lineNum">    3731 </span>                :       ++__first;
-<span class="lineNum">    3732 </span>                : 
-<span class="lineNum">    3733 </span>                :       while (__first != __last)
-<span class="lineNum">    3734 </span>                :         {
-<span class="lineNum">    3735 </span>                :           __next = __first;
-<span class="lineNum">    3736 </span>                :           if (++__next == __last)
-<span class="lineNum">    3737 </span>                :             {
-<span class="lineNum">    3738 </span>                :               if (__comp(*__first, *__min))
-<span class="lineNum">    3739 </span>                :                 __min = __first;
-<span class="lineNum">    3740 </span>                :               else if (!__comp(*__first, *__max))
-<span class="lineNum">    3741 </span>                :                 __max = __first;
-<span class="lineNum">    3742 </span>                :               break;
-<span class="lineNum">    3743 </span>                :             }
-<span class="lineNum">    3744 </span>                : 
-<span class="lineNum">    3745 </span>                :           if (__comp(*__next, *__first))
-<span class="lineNum">    3746 </span>                :             {
-<span class="lineNum">    3747 </span>                :               if (__comp(*__next, *__min))
-<span class="lineNum">    3748 </span>                :                 __min = __next;
-<span class="lineNum">    3749 </span>                :               if (!__comp(*__first, *__max))
-<span class="lineNum">    3750 </span>                :                 __max = __first;
-<span class="lineNum">    3751 </span>                :             }
-<span class="lineNum">    3752 </span>                :           else
-<span class="lineNum">    3753 </span>                :             {
-<span class="lineNum">    3754 </span>                :               if (__comp(*__first, *__min))
-<span class="lineNum">    3755 </span>                :                 __min = __first;
-<span class="lineNum">    3756 </span>                :               if (!__comp(*__next, *__max))
-<span class="lineNum">    3757 </span>                :                 __max = __next;
-<span class="lineNum">    3758 </span>                :             }
-<span class="lineNum">    3759 </span>                : 
-<span class="lineNum">    3760 </span>                :           __first = __next;
-<span class="lineNum">    3761 </span>                :           ++__first;
-<span class="lineNum">    3762 </span>                :         }
-<span class="lineNum">    3763 </span>                : 
-<span class="lineNum">    3764 </span>                :       return std::make_pair(__min, __max);
-<span class="lineNum">    3765 </span>                :     }
-<span class="lineNum">    3766 </span>                : #endif // __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">    3767 </span>                : 
-<span class="lineNum">    3768 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">    3769 </span>                : 
-<span class="lineNum">    3770 </span>                : _GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_P)
-<span class="lineNum">    3771 </span>                : 
-<span class="lineNum">    3772 </span>                :   /**
-<span class="lineNum">    3773 </span>                :    *  @brief Apply a function to every element of a sequence.
-<span class="lineNum">    3774 </span>                :    *  @param  first  An input iterator.
-<span class="lineNum">    3775 </span>                :    *  @param  last   An input iterator.
-<span class="lineNum">    3776 </span>                :    *  @param  f      A unary function object.
-<span class="lineNum">    3777 </span>                :    *  @return   @p f.
-<span class="lineNum">    3778 </span>                :    *
-<span class="lineNum">    3779 </span>                :    *  Applies the function object @p f to each element in the range
-<span class="lineNum">    3780 </span>                :    *  @p [first,last).  @p f must not modify the order of the sequence.
-<span class="lineNum">    3781 </span>                :    *  If @p f has a return value it is ignored.
-<span class="lineNum">    3782 </span>                :   */
-<span class="lineNum">    3783 </span>                :   template&lt;typename _InputIterator, typename _Function&gt;
-<span class="lineNum">    3784 </span>                :     _Function
-<span class="lineNum">    3785 </span>                :     for_each(_InputIterator __first, _InputIterator __last, _Function __f)
-<span class="lineNum">    3786 </span>                :     {
-<span class="lineNum">    3787 </span>                :       // concept requirements
-<span class="lineNum">    3788 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator&gt;)
-<span class="lineNum">    3789 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    3790 </span>                :       for (; __first != __last; ++__first)
-<span class="lineNum">    3791 </span>                :         __f(*__first);
-<span class="lineNum">    3792 </span>                :       return __f;
-<span class="lineNum">    3793 </span>                :     }
-<span class="lineNum">    3794 </span>                : 
-<span class="lineNum">    3795 </span>                :   /**
-<span class="lineNum">    3796 </span>                :    *  @brief Find the first occurrence of a value in a sequence.
-<span class="lineNum">    3797 </span>                :    *  @param  first  An input iterator.
-<span class="lineNum">    3798 </span>                :    *  @param  last   An input iterator.
-<span class="lineNum">    3799 </span>                :    *  @param  val    The value to find.
-<span class="lineNum">    3800 </span>                :    *  @return   The first iterator @c i in the range @p [first,last)
-<span class="lineNum">    3801 </span>                :    *  such that @c *i == @p val, or @p last if no such iterator exists.
-<span class="lineNum">    3802 </span>                :   */
-<span class="lineNum">    3803 </span>                :   template&lt;typename _InputIterator, typename _Tp&gt;
-<span class="lineNum">    3804 </span>                :     inline _InputIterator
-<span class="lineNum">    3805 </span>                :     find(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">    3806 </span><span class="lineCov">           3362 :          const _Tp&amp; __val)</span>
-<span class="lineNum">    3807 </span>                :     {
-<span class="lineNum">    3808 </span>                :       // concept requirements
-<span class="lineNum">    3809 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator&gt;)
-<span class="lineNum">    3810 </span>                :       __glibcxx_function_requires(_EqualOpConcept&lt;
-<span class="lineNum">    3811 </span>                :                 typename iterator_traits&lt;_InputIterator&gt;::value_type, _Tp&gt;)
-<span class="lineNum">    3812 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    3813 </span>                :       return std::__find(__first, __last, __val,
-<span class="lineNum">    3814 </span><span class="lineCov">           3362 :                          std::__iterator_category(__first));</span>
-<span class="lineNum">    3815 </span>                :     }
-<span class="lineNum">    3816 </span>                : 
-<span class="lineNum">    3817 </span>                :   /**
-<span class="lineNum">    3818 </span>                :    *  @brief Find the first element in a sequence for which a
-<span class="lineNum">    3819 </span>                :    *         predicate is true.
-<span class="lineNum">    3820 </span>                :    *  @param  first  An input iterator.
-<span class="lineNum">    3821 </span>                :    *  @param  last   An input iterator.
-<span class="lineNum">    3822 </span>                :    *  @param  pred   A predicate.
-<span class="lineNum">    3823 </span>                :    *  @return   The first iterator @c i in the range @p [first,last)
-<span class="lineNum">    3824 </span>                :    *  such that @p pred(*i) is true, or @p last if no such iterator exists.
-<span class="lineNum">    3825 </span>                :   */
-<span class="lineNum">    3826 </span>                :   template&lt;typename _InputIterator, typename _Predicate&gt;
-<span class="lineNum">    3827 </span>                :     inline _InputIterator
-<span class="lineNum">    3828 </span>                :     find_if(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">    3829 </span><span class="lineCov">              3 :             _Predicate __pred)</span>
-<span class="lineNum">    3830 </span>                :     {
-<span class="lineNum">    3831 </span>                :       // concept requirements
-<span class="lineNum">    3832 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator&gt;)
-<span class="lineNum">    3833 </span>                :       __glibcxx_function_requires(_UnaryPredicateConcept&lt;_Predicate,
-<span class="lineNum">    3834 </span>                :               typename iterator_traits&lt;_InputIterator&gt;::value_type&gt;)
-<span class="lineNum">    3835 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    3836 </span>                :       return std::__find_if(__first, __last, __pred,
-<span class="lineNum">    3837 </span><span class="lineCov">              3 :                             std::__iterator_category(__first));</span>
-<span class="lineNum">    3838 </span>                :     }
-<span class="lineNum">    3839 </span>                : 
-<span class="lineNum">    3840 </span>                :   /**
-<span class="lineNum">    3841 </span>                :    *  @brief  Find element from a set in a sequence.
-<span class="lineNum">    3842 </span>                :    *  @param  first1  Start of range to search.
-<span class="lineNum">    3843 </span>                :    *  @param  last1   End of range to search.
-<span class="lineNum">    3844 </span>                :    *  @param  first2  Start of match candidates.
-<span class="lineNum">    3845 </span>                :    *  @param  last2   End of match candidates.
-<span class="lineNum">    3846 </span>                :    *  @return   The first iterator @c i in the range
-<span class="lineNum">    3847 </span>                :    *  @p [first1,last1) such that @c *i == @p *(i2) such that i2 is an
-<span class="lineNum">    3848 </span>                :    *  iterator in [first2,last2), or @p last1 if no such iterator exists.
-<span class="lineNum">    3849 </span>                :    *
-<span class="lineNum">    3850 </span>                :    *  Searches the range @p [first1,last1) for an element that is equal to
-<span class="lineNum">    3851 </span>                :    *  some element in the range [first2,last2).  If found, returns an iterator
-<span class="lineNum">    3852 </span>                :    *  in the range [first1,last1), otherwise returns @p last1.
-<span class="lineNum">    3853 </span>                :   */
-<span class="lineNum">    3854 </span>                :   template&lt;typename _InputIterator, typename _ForwardIterator&gt;
-<span class="lineNum">    3855 </span>                :     _InputIterator
-<span class="lineNum">    3856 </span>                :     find_first_of(_InputIterator __first1, _InputIterator __last1,
-<span class="lineNum">    3857 </span>                :                   _ForwardIterator __first2, _ForwardIterator __last2)
-<span class="lineNum">    3858 </span>                :     {
-<span class="lineNum">    3859 </span>                :       // concept requirements
-<span class="lineNum">    3860 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator&gt;)
-<span class="lineNum">    3861 </span>                :       __glibcxx_function_requires(_ForwardIteratorConcept&lt;_ForwardIterator&gt;)
-<span class="lineNum">    3862 </span>                :       __glibcxx_function_requires(_EqualOpConcept&lt;
-<span class="lineNum">    3863 </span>                :             typename iterator_traits&lt;_InputIterator&gt;::value_type,
-<span class="lineNum">    3864 </span>                :             typename iterator_traits&lt;_ForwardIterator&gt;::value_type&gt;)
-<span class="lineNum">    3865 </span>                :       __glibcxx_requires_valid_range(__first1, __last1);
-<span class="lineNum">    3866 </span>                :       __glibcxx_requires_valid_range(__first2, __last2);
-<span class="lineNum">    3867 </span>                : 
-<span class="lineNum">    3868 </span>                :       for (; __first1 != __last1; ++__first1)
-<span class="lineNum">    3869 </span>                :         for (_ForwardIterator __iter = __first2; __iter != __last2; ++__iter)
-<span class="lineNum">    3870 </span>                :           if (*__first1 == *__iter)
-<span class="lineNum">    3871 </span>                :             return __first1;
-<span class="lineNum">    3872 </span>                :       return __last1;
-<span class="lineNum">    3873 </span>                :     }
-<span class="lineNum">    3874 </span>                : 
-<span class="lineNum">    3875 </span>                :   /**
-<span class="lineNum">    3876 </span>                :    *  @brief  Find element from a set in a sequence using a predicate.
-<span class="lineNum">    3877 </span>                :    *  @param  first1  Start of range to search.
-<span class="lineNum">    3878 </span>                :    *  @param  last1   End of range to search.
-<span class="lineNum">    3879 </span>                :    *  @param  first2  Start of match candidates.
-<span class="lineNum">    3880 </span>                :    *  @param  last2   End of match candidates.
-<span class="lineNum">    3881 </span>                :    *  @param  comp    Predicate to use.
-<span class="lineNum">    3882 </span>                :    *  @return   The first iterator @c i in the range
-<span class="lineNum">    3883 </span>                :    *  @p [first1,last1) such that @c comp(*i, @p *(i2)) is true and i2 is an
-<span class="lineNum">    3884 </span>                :    *  iterator in [first2,last2), or @p last1 if no such iterator exists.
-<span class="lineNum">    3885 </span>                :    *
-<span class="lineNum">    3886 </span>                : 
-<span class="lineNum">    3887 </span>                :    *  Searches the range @p [first1,last1) for an element that is
-<span class="lineNum">    3888 </span>                :    *  equal to some element in the range [first2,last2).  If found,
-<span class="lineNum">    3889 </span>                :    *  returns an iterator in the range [first1,last1), otherwise
-<span class="lineNum">    3890 </span>                :    *  returns @p last1.
-<span class="lineNum">    3891 </span>                :   */
-<span class="lineNum">    3892 </span>                :   template&lt;typename _InputIterator, typename _ForwardIterator,
-<span class="lineNum">    3893 </span>                :            typename _BinaryPredicate&gt;
-<span class="lineNum">    3894 </span>                :     _InputIterator
-<span class="lineNum">    3895 </span>                :     find_first_of(_InputIterator __first1, _InputIterator __last1,
-<span class="lineNum">    3896 </span>                :                   _ForwardIterator __first2, _ForwardIterator __last2,
-<span class="lineNum">    3897 </span>                :                   _BinaryPredicate __comp)
-<span class="lineNum">    3898 </span>                :     {
-<span class="lineNum">    3899 </span>                :       // concept requirements
-<span class="lineNum">    3900 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator&gt;)
-<span class="lineNum">    3901 </span>                :       __glibcxx_function_requires(_ForwardIteratorConcept&lt;_ForwardIterator&gt;)
-<span class="lineNum">    3902 </span>                :       __glibcxx_function_requires(_BinaryPredicateConcept&lt;_BinaryPredicate,
-<span class="lineNum">    3903 </span>                :             typename iterator_traits&lt;_InputIterator&gt;::value_type,
-<span class="lineNum">    3904 </span>                :             typename iterator_traits&lt;_ForwardIterator&gt;::value_type&gt;)
-<span class="lineNum">    3905 </span>                :       __glibcxx_requires_valid_range(__first1, __last1);
-<span class="lineNum">    3906 </span>                :       __glibcxx_requires_valid_range(__first2, __last2);
-<span class="lineNum">    3907 </span>                : 
-<span class="lineNum">    3908 </span>                :       for (; __first1 != __last1; ++__first1)
-<span class="lineNum">    3909 </span>                :         for (_ForwardIterator __iter = __first2; __iter != __last2; ++__iter)
-<span class="lineNum">    3910 </span>                :           if (__comp(*__first1, *__iter))
-<span class="lineNum">    3911 </span>                :             return __first1;
-<span class="lineNum">    3912 </span>                :       return __last1;
-<span class="lineNum">    3913 </span>                :     }
-<span class="lineNum">    3914 </span>                : 
-<span class="lineNum">    3915 </span>                :   /**
-<span class="lineNum">    3916 </span>                :    *  @brief Find two adjacent values in a sequence that are equal.
-<span class="lineNum">    3917 </span>                :    *  @param  first  A forward iterator.
-<span class="lineNum">    3918 </span>                :    *  @param  last   A forward iterator.
-<span class="lineNum">    3919 </span>                :    *  @return   The first iterator @c i such that @c i and @c i+1 are both
-<span class="lineNum">    3920 </span>                :    *  valid iterators in @p [first,last) and such that @c *i == @c *(i+1),
-<span class="lineNum">    3921 </span>                :    *  or @p last if no such iterator exists.
-<span class="lineNum">    3922 </span>                :   */
-<span class="lineNum">    3923 </span>                :   template&lt;typename _ForwardIterator&gt;
-<span class="lineNum">    3924 </span>                :     _ForwardIterator
-<span class="lineNum">    3925 </span>                :     adjacent_find(_ForwardIterator __first, _ForwardIterator __last)
-<span class="lineNum">    3926 </span>                :     {
-<span class="lineNum">    3927 </span>                :       // concept requirements
-<span class="lineNum">    3928 </span>                :       __glibcxx_function_requires(_ForwardIteratorConcept&lt;_ForwardIterator&gt;)
-<span class="lineNum">    3929 </span>                :       __glibcxx_function_requires(_EqualityComparableConcept&lt;
-<span class="lineNum">    3930 </span>                :             typename iterator_traits&lt;_ForwardIterator&gt;::value_type&gt;)
-<span class="lineNum">    3931 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    3932 </span>                :       if (__first == __last)
-<span class="lineNum">    3933 </span>                :         return __last;
-<span class="lineNum">    3934 </span>                :       _ForwardIterator __next = __first;
-<span class="lineNum">    3935 </span>                :       while(++__next != __last)
-<span class="lineNum">    3936 </span>                :         {
-<span class="lineNum">    3937 </span>                :           if (*__first == *__next)
-<span class="lineNum">    3938 </span>                :             return __first;
-<span class="lineNum">    3939 </span>                :           __first = __next;
-<span class="lineNum">    3940 </span>                :         }
-<span class="lineNum">    3941 </span>                :       return __last;
-<span class="lineNum">    3942 </span>                :     }
-<span class="lineNum">    3943 </span>                : 
-<span class="lineNum">    3944 </span>                :   /**
-<span class="lineNum">    3945 </span>                :    *  @brief Find two adjacent values in a sequence using a predicate.
-<span class="lineNum">    3946 </span>                :    *  @param  first         A forward iterator.
-<span class="lineNum">    3947 </span>                :    *  @param  last          A forward iterator.
-<span class="lineNum">    3948 </span>                :    *  @param  binary_pred   A binary predicate.
-<span class="lineNum">    3949 </span>                :    *  @return   The first iterator @c i such that @c i and @c i+1 are both
-<span class="lineNum">    3950 </span>                :    *  valid iterators in @p [first,last) and such that
-<span class="lineNum">    3951 </span>                :    *  @p binary_pred(*i,*(i+1)) is true, or @p last if no such iterator
-<span class="lineNum">    3952 </span>                :    *  exists.
-<span class="lineNum">    3953 </span>                :   */
-<span class="lineNum">    3954 </span>                :   template&lt;typename _ForwardIterator, typename _BinaryPredicate&gt;
-<span class="lineNum">    3955 </span>                :     _ForwardIterator
-<span class="lineNum">    3956 </span>                :     adjacent_find(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">    3957 </span>                :                   _BinaryPredicate __binary_pred)
-<span class="lineNum">    3958 </span>                :     {
-<span class="lineNum">    3959 </span>                :       // concept requirements
-<span class="lineNum">    3960 </span>                :       __glibcxx_function_requires(_ForwardIteratorConcept&lt;_ForwardIterator&gt;)
-<span class="lineNum">    3961 </span>                :       __glibcxx_function_requires(_BinaryPredicateConcept&lt;_BinaryPredicate,
-<span class="lineNum">    3962 </span>                :             typename iterator_traits&lt;_ForwardIterator&gt;::value_type,
-<span class="lineNum">    3963 </span>                :             typename iterator_traits&lt;_ForwardIterator&gt;::value_type&gt;)
-<span class="lineNum">    3964 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    3965 </span>                :       if (__first == __last)
-<span class="lineNum">    3966 </span>                :         return __last;
-<span class="lineNum">    3967 </span>                :       _ForwardIterator __next = __first;
-<span class="lineNum">    3968 </span>                :       while(++__next != __last)
-<span class="lineNum">    3969 </span>                :         {
-<span class="lineNum">    3970 </span>                :           if (__binary_pred(*__first, *__next))
-<span class="lineNum">    3971 </span>                :             return __first;
-<span class="lineNum">    3972 </span>                :           __first = __next;
-<span class="lineNum">    3973 </span>                :         }
-<span class="lineNum">    3974 </span>                :       return __last;
-<span class="lineNum">    3975 </span>                :     }
-<span class="lineNum">    3976 </span>                : 
-<span class="lineNum">    3977 </span>                :   /**
-<span class="lineNum">    3978 </span>                :    *  @brief Count the number of copies of a value in a sequence.
-<span class="lineNum">    3979 </span>                :    *  @param  first  An input iterator.
-<span class="lineNum">    3980 </span>                :    *  @param  last   An input iterator.
-<span class="lineNum">    3981 </span>                :    *  @param  value  The value to be counted.
-<span class="lineNum">    3982 </span>                :    *  @return   The number of iterators @c i in the range @p [first,last)
-<span class="lineNum">    3983 </span>                :    *  for which @c *i == @p value
-<span class="lineNum">    3984 </span>                :   */
-<span class="lineNum">    3985 </span>                :   template&lt;typename _InputIterator, typename _Tp&gt;
-<span class="lineNum">    3986 </span>                :     typename iterator_traits&lt;_InputIterator&gt;::difference_type
-<span class="lineNum">    3987 </span>                :     count(_InputIterator __first, _InputIterator __last, const _Tp&amp; __value)
-<span class="lineNum">    3988 </span>                :     {
-<span class="lineNum">    3989 </span>                :       // concept requirements
-<span class="lineNum">    3990 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator&gt;)
-<span class="lineNum">    3991 </span>                :       __glibcxx_function_requires(_EqualOpConcept&lt;
-<span class="lineNum">    3992 </span>                :         typename iterator_traits&lt;_InputIterator&gt;::value_type, _Tp&gt;)
-<span class="lineNum">    3993 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    3994 </span>                :       typename iterator_traits&lt;_InputIterator&gt;::difference_type __n = 0;
-<span class="lineNum">    3995 </span>                :       for (; __first != __last; ++__first)
-<span class="lineNum">    3996 </span>                :         if (*__first == __value)
-<span class="lineNum">    3997 </span>                :           ++__n;
-<span class="lineNum">    3998 </span>                :       return __n;
-<span class="lineNum">    3999 </span>                :     }
-<span class="lineNum">    4000 </span>                : 
-<span class="lineNum">    4001 </span>                :   /**
-<span class="lineNum">    4002 </span>                :    *  @brief Count the elements of a sequence for which a predicate is true.
-<span class="lineNum">    4003 </span>                :    *  @param  first  An input iterator.
-<span class="lineNum">    4004 </span>                :    *  @param  last   An input iterator.
-<span class="lineNum">    4005 </span>                :    *  @param  pred   A predicate.
-<span class="lineNum">    4006 </span>                :    *  @return   The number of iterators @c i in the range @p [first,last)
-<span class="lineNum">    4007 </span>                :    *  for which @p pred(*i) is true.
-<span class="lineNum">    4008 </span>                :   */
-<span class="lineNum">    4009 </span>                :   template&lt;typename _InputIterator, typename _Predicate&gt;
-<span class="lineNum">    4010 </span>                :     typename iterator_traits&lt;_InputIterator&gt;::difference_type
-<span class="lineNum">    4011 </span>                :     count_if(_InputIterator __first, _InputIterator __last, _Predicate __pred)
-<span class="lineNum">    4012 </span>                :     {
-<span class="lineNum">    4013 </span>                :       // concept requirements
-<span class="lineNum">    4014 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator&gt;)
-<span class="lineNum">    4015 </span>                :       __glibcxx_function_requires(_UnaryPredicateConcept&lt;_Predicate,
-<span class="lineNum">    4016 </span>                :             typename iterator_traits&lt;_InputIterator&gt;::value_type&gt;)
-<span class="lineNum">    4017 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    4018 </span>                :       typename iterator_traits&lt;_InputIterator&gt;::difference_type __n = 0;
-<span class="lineNum">    4019 </span>                :       for (; __first != __last; ++__first)
-<span class="lineNum">    4020 </span>                :         if (__pred(*__first))
-<span class="lineNum">    4021 </span>                :           ++__n;
-<span class="lineNum">    4022 </span>                :       return __n;
-<span class="lineNum">    4023 </span>                :     }
-<span class="lineNum">    4024 </span>                : 
-<span class="lineNum">    4025 </span>                :   /**
-<span class="lineNum">    4026 </span>                :    *  @brief Search a sequence for a matching sub-sequence.
-<span class="lineNum">    4027 </span>                :    *  @param  first1  A forward iterator.
-<span class="lineNum">    4028 </span>                :    *  @param  last1   A forward iterator.
-<span class="lineNum">    4029 </span>                :    *  @param  first2  A forward iterator.
-<span class="lineNum">    4030 </span>                :    *  @param  last2   A forward iterator.
-<span class="lineNum">    4031 </span>                :    *  @return   The first iterator @c i in the range
-<span class="lineNum">    4032 </span>                :    *  @p [first1,last1-(last2-first2)) such that @c *(i+N) == @p *(first2+N)
-<span class="lineNum">    4033 </span>                :    *  for each @c N in the range @p [0,last2-first2), or @p last1 if no
-<span class="lineNum">    4034 </span>                :    *  such iterator exists.
-<span class="lineNum">    4035 </span>                :    *
-<span class="lineNum">    4036 </span>                :    *  Searches the range @p [first1,last1) for a sub-sequence that compares
-<span class="lineNum">    4037 </span>                :    *  equal value-by-value with the sequence given by @p [first2,last2) and
-<span class="lineNum">    4038 </span>                :    *  returns an iterator to the first element of the sub-sequence, or
-<span class="lineNum">    4039 </span>                :    *  @p last1 if the sub-sequence is not found.
-<span class="lineNum">    4040 </span>                :    *
-<span class="lineNum">    4041 </span>                :    *  Because the sub-sequence must lie completely within the range
-<span class="lineNum">    4042 </span>                :    *  @p [first1,last1) it must start at a position less than
-<span class="lineNum">    4043 </span>                :    *  @p last1-(last2-first2) where @p last2-first2 is the length of the
-<span class="lineNum">    4044 </span>                :    *  sub-sequence.
-<span class="lineNum">    4045 </span>                :    *  This means that the returned iterator @c i will be in the range
-<span class="lineNum">    4046 </span>                :    *  @p [first1,last1-(last2-first2))
-<span class="lineNum">    4047 </span>                :   */
-<span class="lineNum">    4048 </span>                :   template&lt;typename _ForwardIterator1, typename _ForwardIterator2&gt;
-<span class="lineNum">    4049 </span>                :     _ForwardIterator1
-<span class="lineNum">    4050 </span>                :     search(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
-<span class="lineNum">    4051 </span>                :            _ForwardIterator2 __first2, _ForwardIterator2 __last2)
-<span class="lineNum">    4052 </span>                :     {
-<span class="lineNum">    4053 </span>                :       // concept requirements
-<span class="lineNum">    4054 </span>                :       __glibcxx_function_requires(_ForwardIteratorConcept&lt;_ForwardIterator1&gt;)
-<span class="lineNum">    4055 </span>                :       __glibcxx_function_requires(_ForwardIteratorConcept&lt;_ForwardIterator2&gt;)
-<span class="lineNum">    4056 </span>                :       __glibcxx_function_requires(_EqualOpConcept&lt;
-<span class="lineNum">    4057 </span>                :             typename iterator_traits&lt;_ForwardIterator1&gt;::value_type,
-<span class="lineNum">    4058 </span>                :             typename iterator_traits&lt;_ForwardIterator2&gt;::value_type&gt;)
-<span class="lineNum">    4059 </span>                :       __glibcxx_requires_valid_range(__first1, __last1);
-<span class="lineNum">    4060 </span>                :       __glibcxx_requires_valid_range(__first2, __last2);
-<span class="lineNum">    4061 </span>                : 
-<span class="lineNum">    4062 </span>                :       // Test for empty ranges
-<span class="lineNum">    4063 </span>                :       if (__first1 == __last1 || __first2 == __last2)
-<span class="lineNum">    4064 </span>                :         return __first1;
-<span class="lineNum">    4065 </span>                : 
-<span class="lineNum">    4066 </span>                :       // Test for a pattern of length 1.
-<span class="lineNum">    4067 </span>                :       _ForwardIterator2 __p1(__first2);
-<span class="lineNum">    4068 </span>                :       if (++__p1 == __last2)
-<span class="lineNum">    4069 </span>                :         return _GLIBCXX_STD_P::find(__first1, __last1, *__first2);
-<span class="lineNum">    4070 </span>                : 
-<span class="lineNum">    4071 </span>                :       // General case.
-<span class="lineNum">    4072 </span>                :       _ForwardIterator2 __p;
-<span class="lineNum">    4073 </span>                :       _ForwardIterator1 __current = __first1;
-<span class="lineNum">    4074 </span>                : 
-<span class="lineNum">    4075 </span>                :       for (;;)
-<span class="lineNum">    4076 </span>                :         {
-<span class="lineNum">    4077 </span>                :           __first1 = _GLIBCXX_STD_P::find(__first1, __last1, *__first2);
-<span class="lineNum">    4078 </span>                :           if (__first1 == __last1)
-<span class="lineNum">    4079 </span>                :             return __last1;
-<span class="lineNum">    4080 </span>                : 
-<span class="lineNum">    4081 </span>                :           __p = __p1;
-<span class="lineNum">    4082 </span>                :           __current = __first1;
-<span class="lineNum">    4083 </span>                :           if (++__current == __last1)
-<span class="lineNum">    4084 </span>                :             return __last1;
-<span class="lineNum">    4085 </span>                : 
-<span class="lineNum">    4086 </span>                :           while (*__current == *__p)
-<span class="lineNum">    4087 </span>                :             {
-<span class="lineNum">    4088 </span>                :               if (++__p == __last2)
-<span class="lineNum">    4089 </span>                :                 return __first1;
-<span class="lineNum">    4090 </span>                :               if (++__current == __last1)
-<span class="lineNum">    4091 </span>                :                 return __last1;
-<span class="lineNum">    4092 </span>                :             }
-<span class="lineNum">    4093 </span>                :           ++__first1;
-<span class="lineNum">    4094 </span>                :         }
-<span class="lineNum">    4095 </span>                :       return __first1;
-<span class="lineNum">    4096 </span>                :     }
-<span class="lineNum">    4097 </span>                : 
-<span class="lineNum">    4098 </span>                :   /**
-<span class="lineNum">    4099 </span>                :    *  @brief Search a sequence for a matching sub-sequence using a predicate.
-<span class="lineNum">    4100 </span>                :    *  @param  first1     A forward iterator.
-<span class="lineNum">    4101 </span>                :    *  @param  last1      A forward iterator.
-<span class="lineNum">    4102 </span>                :    *  @param  first2     A forward iterator.
-<span class="lineNum">    4103 </span>                :    *  @param  last2      A forward iterator.
-<span class="lineNum">    4104 </span>                :    *  @param  predicate  A binary predicate.
-<span class="lineNum">    4105 </span>                :    *  @return   The first iterator @c i in the range
-<span class="lineNum">    4106 </span>                :    *  @p [first1,last1-(last2-first2)) such that
-<span class="lineNum">    4107 </span>                :    *  @p predicate(*(i+N),*(first2+N)) is true for each @c N in the range
-<span class="lineNum">    4108 </span>                :    *  @p [0,last2-first2), or @p last1 if no such iterator exists.
-<span class="lineNum">    4109 </span>                :    *
-<span class="lineNum">    4110 </span>                :    *  Searches the range @p [first1,last1) for a sub-sequence that compares
-<span class="lineNum">    4111 </span>                :    *  equal value-by-value with the sequence given by @p [first2,last2),
-<span class="lineNum">    4112 </span>                :    *  using @p predicate to determine equality, and returns an iterator
-<span class="lineNum">    4113 </span>                :    *  to the first element of the sub-sequence, or @p last1 if no such
-<span class="lineNum">    4114 </span>                :    *  iterator exists.
-<span class="lineNum">    4115 </span>                :    *
-<span class="lineNum">    4116 </span>                :    *  @see search(_ForwardIter1, _ForwardIter1, _ForwardIter2, _ForwardIter2)
-<span class="lineNum">    4117 </span>                :   */
-<span class="lineNum">    4118 </span>                :   template&lt;typename _ForwardIterator1, typename _ForwardIterator2,
-<span class="lineNum">    4119 </span>                :            typename _BinaryPredicate&gt;
-<span class="lineNum">    4120 </span>                :     _ForwardIterator1
-<span class="lineNum">    4121 </span>                :     search(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
-<span class="lineNum">    4122 </span>                :            _ForwardIterator2 __first2, _ForwardIterator2 __last2,
-<span class="lineNum">    4123 </span>                :            _BinaryPredicate  __predicate)
-<span class="lineNum">    4124 </span>                :     {
-<span class="lineNum">    4125 </span>                :       // concept requirements
-<span class="lineNum">    4126 </span>                :       __glibcxx_function_requires(_ForwardIteratorConcept&lt;_ForwardIterator1&gt;)
-<span class="lineNum">    4127 </span>                :       __glibcxx_function_requires(_ForwardIteratorConcept&lt;_ForwardIterator2&gt;)
-<span class="lineNum">    4128 </span>                :       __glibcxx_function_requires(_BinaryPredicateConcept&lt;_BinaryPredicate,
-<span class="lineNum">    4129 </span>                :             typename iterator_traits&lt;_ForwardIterator1&gt;::value_type,
-<span class="lineNum">    4130 </span>                :             typename iterator_traits&lt;_ForwardIterator2&gt;::value_type&gt;)
-<span class="lineNum">    4131 </span>                :       __glibcxx_requires_valid_range(__first1, __last1);
-<span class="lineNum">    4132 </span>                :       __glibcxx_requires_valid_range(__first2, __last2);
-<span class="lineNum">    4133 </span>                : 
-<span class="lineNum">    4134 </span>                :       // Test for empty ranges
-<span class="lineNum">    4135 </span>                :       if (__first1 == __last1 || __first2 == __last2)
-<span class="lineNum">    4136 </span>                :         return __first1;
-<span class="lineNum">    4137 </span>                : 
-<span class="lineNum">    4138 </span>                :       // Test for a pattern of length 1.
-<span class="lineNum">    4139 </span>                :       _ForwardIterator2 __p1(__first2);
-<span class="lineNum">    4140 </span>                :       if (++__p1 == __last2)
-<span class="lineNum">    4141 </span>                :         {
-<span class="lineNum">    4142 </span>                :           while (__first1 != __last1
-<span class="lineNum">    4143 </span>                :                  &amp;&amp; !bool(__predicate(*__first1, *__first2)))
-<span class="lineNum">    4144 </span>                :             ++__first1;
-<span class="lineNum">    4145 </span>                :           return __first1;
-<span class="lineNum">    4146 </span>                :         }
-<span class="lineNum">    4147 </span>                : 
-<span class="lineNum">    4148 </span>                :       // General case.
-<span class="lineNum">    4149 </span>                :       _ForwardIterator2 __p;
-<span class="lineNum">    4150 </span>                :       _ForwardIterator1 __current = __first1;
-<span class="lineNum">    4151 </span>                : 
-<span class="lineNum">    4152 </span>                :       for (;;)
-<span class="lineNum">    4153 </span>                :         {
-<span class="lineNum">    4154 </span>                :           while (__first1 != __last1
-<span class="lineNum">    4155 </span>                :                  &amp;&amp; !bool(__predicate(*__first1, *__first2)))
-<span class="lineNum">    4156 </span>                :             ++__first1;
-<span class="lineNum">    4157 </span>                :           if (__first1 == __last1)
-<span class="lineNum">    4158 </span>                :             return __last1;
-<span class="lineNum">    4159 </span>                : 
-<span class="lineNum">    4160 </span>                :           __p = __p1;
-<span class="lineNum">    4161 </span>                :           __current = __first1;
-<span class="lineNum">    4162 </span>                :           if (++__current == __last1)
-<span class="lineNum">    4163 </span>                :             return __last1;
-<span class="lineNum">    4164 </span>                : 
-<span class="lineNum">    4165 </span>                :           while (__predicate(*__current, *__p))
-<span class="lineNum">    4166 </span>                :             {
-<span class="lineNum">    4167 </span>                :               if (++__p == __last2)
-<span class="lineNum">    4168 </span>                :                 return __first1;
-<span class="lineNum">    4169 </span>                :               if (++__current == __last1)
-<span class="lineNum">    4170 </span>                :                 return __last1;
-<span class="lineNum">    4171 </span>                :             }
-<span class="lineNum">    4172 </span>                :           ++__first1;
-<span class="lineNum">    4173 </span>                :         }
-<span class="lineNum">    4174 </span>                :       return __first1;
-<span class="lineNum">    4175 </span>                :     }
-<span class="lineNum">    4176 </span>                : 
-<span class="lineNum">    4177 </span>                : 
-<span class="lineNum">    4178 </span>                :   /**
-<span class="lineNum">    4179 </span>                :    *  @brief Search a sequence for a number of consecutive values.
-<span class="lineNum">    4180 </span>                :    *  @param  first  A forward iterator.
-<span class="lineNum">    4181 </span>                :    *  @param  last   A forward iterator.
-<span class="lineNum">    4182 </span>                :    *  @param  count  The number of consecutive values.
-<span class="lineNum">    4183 </span>                :    *  @param  val    The value to find.
-<span class="lineNum">    4184 </span>                :    *  @return   The first iterator @c i in the range @p [first,last-count)
-<span class="lineNum">    4185 </span>                :    *  such that @c *(i+N) == @p val for each @c N in the range @p [0,count),
-<span class="lineNum">    4186 </span>                :    *  or @p last if no such iterator exists.
-<span class="lineNum">    4187 </span>                :    *
-<span class="lineNum">    4188 </span>                :    *  Searches the range @p [first,last) for @p count consecutive elements
-<span class="lineNum">    4189 </span>                :    *  equal to @p val.
-<span class="lineNum">    4190 </span>                :   */
-<span class="lineNum">    4191 </span>                :   template&lt;typename _ForwardIterator, typename _Integer, typename _Tp&gt;
-<span class="lineNum">    4192 </span>                :     _ForwardIterator
-<span class="lineNum">    4193 </span>                :     search_n(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">    4194 </span>                :              _Integer __count, const _Tp&amp; __val)
-<span class="lineNum">    4195 </span>                :     {
-<span class="lineNum">    4196 </span>                :       // concept requirements
-<span class="lineNum">    4197 </span>                :       __glibcxx_function_requires(_ForwardIteratorConcept&lt;_ForwardIterator&gt;)
-<span class="lineNum">    4198 </span>                :       __glibcxx_function_requires(_EqualOpConcept&lt;
-<span class="lineNum">    4199 </span>                :         typename iterator_traits&lt;_ForwardIterator&gt;::value_type, _Tp&gt;)
-<span class="lineNum">    4200 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    4201 </span>                : 
-<span class="lineNum">    4202 </span>                :       if (__count &lt;= 0)
-<span class="lineNum">    4203 </span>                :         return __first;
-<span class="lineNum">    4204 </span>                :       if (__count == 1)
-<span class="lineNum">    4205 </span>                :         return _GLIBCXX_STD_P::find(__first, __last, __val);
-<span class="lineNum">    4206 </span>                :       return std::__search_n(__first, __last, __count, __val,
-<span class="lineNum">    4207 </span>                :                              std::__iterator_category(__first));
-<span class="lineNum">    4208 </span>                :     }
-<span class="lineNum">    4209 </span>                : 
-<span class="lineNum">    4210 </span>                : 
-<span class="lineNum">    4211 </span>                :   /**
-<span class="lineNum">    4212 </span>                :    *  @brief Search a sequence for a number of consecutive values using a
-<span class="lineNum">    4213 </span>                :    *         predicate.
-<span class="lineNum">    4214 </span>                :    *  @param  first        A forward iterator.
-<span class="lineNum">    4215 </span>                :    *  @param  last         A forward iterator.
-<span class="lineNum">    4216 </span>                :    *  @param  count        The number of consecutive values.
-<span class="lineNum">    4217 </span>                :    *  @param  val          The value to find.
-<span class="lineNum">    4218 </span>                :    *  @param  binary_pred  A binary predicate.
-<span class="lineNum">    4219 </span>                :    *  @return   The first iterator @c i in the range @p [first,last-count)
-<span class="lineNum">    4220 </span>                :    *  such that @p binary_pred(*(i+N),val) is true for each @c N in the
-<span class="lineNum">    4221 </span>                :    *  range @p [0,count), or @p last if no such iterator exists.
-<span class="lineNum">    4222 </span>                :    *
-<span class="lineNum">    4223 </span>                :    *  Searches the range @p [first,last) for @p count consecutive elements
-<span class="lineNum">    4224 </span>                :    *  for which the predicate returns true.
-<span class="lineNum">    4225 </span>                :   */
-<span class="lineNum">    4226 </span>                :   template&lt;typename _ForwardIterator, typename _Integer, typename _Tp,
-<span class="lineNum">    4227 </span>                :            typename _BinaryPredicate&gt;
-<span class="lineNum">    4228 </span>                :     _ForwardIterator
-<span class="lineNum">    4229 </span>                :     search_n(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">    4230 </span>                :              _Integer __count, const _Tp&amp; __val,
-<span class="lineNum">    4231 </span>                :              _BinaryPredicate __binary_pred)
-<span class="lineNum">    4232 </span>                :     {
-<span class="lineNum">    4233 </span>                :       // concept requirements
-<span class="lineNum">    4234 </span>                :       __glibcxx_function_requires(_ForwardIteratorConcept&lt;_ForwardIterator&gt;)
-<span class="lineNum">    4235 </span>                :       __glibcxx_function_requires(_BinaryPredicateConcept&lt;_BinaryPredicate,
-<span class="lineNum">    4236 </span>                :             typename iterator_traits&lt;_ForwardIterator&gt;::value_type, _Tp&gt;)
-<span class="lineNum">    4237 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    4238 </span>                : 
-<span class="lineNum">    4239 </span>                :       if (__count &lt;= 0)
-<span class="lineNum">    4240 </span>                :         return __first;
-<span class="lineNum">    4241 </span>                :       if (__count == 1)
-<span class="lineNum">    4242 </span>                :         {
-<span class="lineNum">    4243 </span>                :           while (__first != __last &amp;&amp; !bool(__binary_pred(*__first, __val)))
-<span class="lineNum">    4244 </span>                :             ++__first;
-<span class="lineNum">    4245 </span>                :           return __first;
-<span class="lineNum">    4246 </span>                :         }
-<span class="lineNum">    4247 </span>                :       return std::__search_n(__first, __last, __count, __val, __binary_pred,
-<span class="lineNum">    4248 </span>                :                              std::__iterator_category(__first));
-<span class="lineNum">    4249 </span>                :     }
-<span class="lineNum">    4250 </span>                : 
-<span class="lineNum">    4251 </span>                : 
-<span class="lineNum">    4252 </span>                :   /**
-<span class="lineNum">    4253 </span>                :    *  @brief Perform an operation on a sequence.
-<span class="lineNum">    4254 </span>                :    *  @param  first     An input iterator.
-<span class="lineNum">    4255 </span>                :    *  @param  last      An input iterator.
-<span class="lineNum">    4256 </span>                :    *  @param  result    An output iterator.
-<span class="lineNum">    4257 </span>                :    *  @param  unary_op  A unary operator.
-<span class="lineNum">    4258 </span>                :    *  @return   An output iterator equal to @p result+(last-first).
-<span class="lineNum">    4259 </span>                :    *
-<span class="lineNum">    4260 </span>                :    *  Applies the operator to each element in the input range and assigns
-<span class="lineNum">    4261 </span>                :    *  the results to successive elements of the output sequence.
-<span class="lineNum">    4262 </span>                :    *  Evaluates @p *(result+N)=unary_op(*(first+N)) for each @c N in the
-<span class="lineNum">    4263 </span>                :    *  range @p [0,last-first).
-<span class="lineNum">    4264 </span>                :    *
-<span class="lineNum">    4265 </span>                :    *  @p unary_op must not alter its argument.
-<span class="lineNum">    4266 </span>                :   */
-<span class="lineNum">    4267 </span>                :   template&lt;typename _InputIterator, typename _OutputIterator,
-<span class="lineNum">    4268 </span>                :            typename _UnaryOperation&gt;
-<span class="lineNum">    4269 </span>                :     _OutputIterator
-<span class="lineNum">    4270 </span>                :     transform(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">    4271 </span>                :               _OutputIterator __result, _UnaryOperation __unary_op)
-<span class="lineNum">    4272 </span>                :     {
-<span class="lineNum">    4273 </span>                :       // concept requirements
-<span class="lineNum">    4274 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator&gt;)
-<span class="lineNum">    4275 </span>                :       __glibcxx_function_requires(_OutputIteratorConcept&lt;_OutputIterator,
-<span class="lineNum">    4276 </span>                :             // &quot;the type returned by a _UnaryOperation&quot;
-<span class="lineNum">    4277 </span>                :             __typeof__(__unary_op(*__first))&gt;)
-<span class="lineNum">    4278 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    4279 </span>                : 
-<span class="lineNum">    4280 </span>                :       for (; __first != __last; ++__first, ++__result)
-<span class="lineNum">    4281 </span>                :         *__result = __unary_op(*__first);
-<span class="lineNum">    4282 </span>                :       return __result;
-<span class="lineNum">    4283 </span>                :     }
-<span class="lineNum">    4284 </span>                : 
-<span class="lineNum">    4285 </span>                :   /**
-<span class="lineNum">    4286 </span>                :    *  @brief Perform an operation on corresponding elements of two sequences.
-<span class="lineNum">    4287 </span>                :    *  @param  first1     An input iterator.
-<span class="lineNum">    4288 </span>                :    *  @param  last1      An input iterator.
-<span class="lineNum">    4289 </span>                :    *  @param  first2     An input iterator.
-<span class="lineNum">    4290 </span>                :    *  @param  result     An output iterator.
-<span class="lineNum">    4291 </span>                :    *  @param  binary_op  A binary operator.
-<span class="lineNum">    4292 </span>                :    *  @return   An output iterator equal to @p result+(last-first).
-<span class="lineNum">    4293 </span>                :    *
-<span class="lineNum">    4294 </span>                :    *  Applies the operator to the corresponding elements in the two
-<span class="lineNum">    4295 </span>                :    *  input ranges and assigns the results to successive elements of the
-<span class="lineNum">    4296 </span>                :    *  output sequence.
-<span class="lineNum">    4297 </span>                :    *  Evaluates @p *(result+N)=binary_op(*(first1+N),*(first2+N)) for each
-<span class="lineNum">    4298 </span>                :    *  @c N in the range @p [0,last1-first1).
-<span class="lineNum">    4299 </span>                :    *
-<span class="lineNum">    4300 </span>                :    *  @p binary_op must not alter either of its arguments.
-<span class="lineNum">    4301 </span>                :   */
-<span class="lineNum">    4302 </span>                :   template&lt;typename _InputIterator1, typename _InputIterator2,
-<span class="lineNum">    4303 </span>                :            typename _OutputIterator, typename _BinaryOperation&gt;
-<span class="lineNum">    4304 </span>                :     _OutputIterator
-<span class="lineNum">    4305 </span>                :     transform(_InputIterator1 __first1, _InputIterator1 __last1,
-<span class="lineNum">    4306 </span>                :               _InputIterator2 __first2, _OutputIterator __result,
-<span class="lineNum">    4307 </span>                :               _BinaryOperation __binary_op)
-<span class="lineNum">    4308 </span>                :     {
-<span class="lineNum">    4309 </span>                :       // concept requirements
-<span class="lineNum">    4310 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator1&gt;)
-<span class="lineNum">    4311 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator2&gt;)
-<span class="lineNum">    4312 </span>                :       __glibcxx_function_requires(_OutputIteratorConcept&lt;_OutputIterator,
-<span class="lineNum">    4313 </span>                :             // &quot;the type returned by a _BinaryOperation&quot;
-<span class="lineNum">    4314 </span>                :             __typeof__(__binary_op(*__first1,*__first2))&gt;)
-<span class="lineNum">    4315 </span>                :       __glibcxx_requires_valid_range(__first1, __last1);
-<span class="lineNum">    4316 </span>                : 
-<span class="lineNum">    4317 </span>                :       for (; __first1 != __last1; ++__first1, ++__first2, ++__result)
-<span class="lineNum">    4318 </span>                :         *__result = __binary_op(*__first1, *__first2);
-<span class="lineNum">    4319 </span>                :       return __result;
-<span class="lineNum">    4320 </span>                :     }
-<span class="lineNum">    4321 </span>                : 
-<span class="lineNum">    4322 </span>                :   /**
-<span class="lineNum">    4323 </span>                :    *  @brief Replace each occurrence of one value in a sequence with another
-<span class="lineNum">    4324 </span>                :    *         value.
-<span class="lineNum">    4325 </span>                :    *  @param  first      A forward iterator.
-<span class="lineNum">    4326 </span>                :    *  @param  last       A forward iterator.
-<span class="lineNum">    4327 </span>                :    *  @param  old_value  The value to be replaced.
-<span class="lineNum">    4328 </span>                :    *  @param  new_value  The replacement value.
-<span class="lineNum">    4329 </span>                :    *  @return   replace() returns no value.
-<span class="lineNum">    4330 </span>                :    *
-<span class="lineNum">    4331 </span>                :    *  For each iterator @c i in the range @p [first,last) if @c *i ==
-<span class="lineNum">    4332 </span>                :    *  @p old_value then the assignment @c *i = @p new_value is performed.
-<span class="lineNum">    4333 </span>                :   */
-<span class="lineNum">    4334 </span>                :   template&lt;typename _ForwardIterator, typename _Tp&gt;
-<span class="lineNum">    4335 </span>                :     void
-<span class="lineNum">    4336 </span>                :     replace(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">    4337 </span>                :             const _Tp&amp; __old_value, const _Tp&amp; __new_value)
-<span class="lineNum">    4338 </span>                :     {
-<span class="lineNum">    4339 </span>                :       // concept requirements
-<span class="lineNum">    4340 </span>                :       __glibcxx_function_requires(_Mutable_ForwardIteratorConcept&lt;
-<span class="lineNum">    4341 </span>                :                                   _ForwardIterator&gt;)
-<span class="lineNum">    4342 </span>                :       __glibcxx_function_requires(_EqualOpConcept&lt;
-<span class="lineNum">    4343 </span>                :             typename iterator_traits&lt;_ForwardIterator&gt;::value_type, _Tp&gt;)
-<span class="lineNum">    4344 </span>                :       __glibcxx_function_requires(_ConvertibleConcept&lt;_Tp,
-<span class="lineNum">    4345 </span>                :             typename iterator_traits&lt;_ForwardIterator&gt;::value_type&gt;)
-<span class="lineNum">    4346 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    4347 </span>                : 
-<span class="lineNum">    4348 </span>                :       for (; __first != __last; ++__first)
-<span class="lineNum">    4349 </span>                :         if (*__first == __old_value)
-<span class="lineNum">    4350 </span>                :           *__first = __new_value;
-<span class="lineNum">    4351 </span>                :     }
-<span class="lineNum">    4352 </span>                : 
-<span class="lineNum">    4353 </span>                :   /**
-<span class="lineNum">    4354 </span>                :    *  @brief Replace each value in a sequence for which a predicate returns
-<span class="lineNum">    4355 </span>                :    *         true with another value.
-<span class="lineNum">    4356 </span>                :    *  @param  first      A forward iterator.
-<span class="lineNum">    4357 </span>                :    *  @param  last       A forward iterator.
-<span class="lineNum">    4358 </span>                :    *  @param  pred       A predicate.
-<span class="lineNum">    4359 </span>                :    *  @param  new_value  The replacement value.
-<span class="lineNum">    4360 </span>                :    *  @return   replace_if() returns no value.
-<span class="lineNum">    4361 </span>                :    *
-<span class="lineNum">    4362 </span>                :    *  For each iterator @c i in the range @p [first,last) if @p pred(*i)
-<span class="lineNum">    4363 </span>                :    *  is true then the assignment @c *i = @p new_value is performed.
-<span class="lineNum">    4364 </span>                :   */
-<span class="lineNum">    4365 </span>                :   template&lt;typename _ForwardIterator, typename _Predicate, typename _Tp&gt;
-<span class="lineNum">    4366 </span>                :     void
-<span class="lineNum">    4367 </span>                :     replace_if(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">    4368 </span>                :                _Predicate __pred, const _Tp&amp; __new_value)
-<span class="lineNum">    4369 </span>                :     {
-<span class="lineNum">    4370 </span>                :       // concept requirements
-<span class="lineNum">    4371 </span>                :       __glibcxx_function_requires(_Mutable_ForwardIteratorConcept&lt;
-<span class="lineNum">    4372 </span>                :                                   _ForwardIterator&gt;)
-<span class="lineNum">    4373 </span>                :       __glibcxx_function_requires(_ConvertibleConcept&lt;_Tp,
-<span class="lineNum">    4374 </span>                :             typename iterator_traits&lt;_ForwardIterator&gt;::value_type&gt;)
-<span class="lineNum">    4375 </span>                :       __glibcxx_function_requires(_UnaryPredicateConcept&lt;_Predicate,
-<span class="lineNum">    4376 </span>                :             typename iterator_traits&lt;_ForwardIterator&gt;::value_type&gt;)
-<span class="lineNum">    4377 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    4378 </span>                : 
-<span class="lineNum">    4379 </span>                :       for (; __first != __last; ++__first)
-<span class="lineNum">    4380 </span>                :         if (__pred(*__first))
-<span class="lineNum">    4381 </span>                :           *__first = __new_value;
-<span class="lineNum">    4382 </span>                :     }
-<span class="lineNum">    4383 </span>                : 
-<span class="lineNum">    4384 </span>                :   /**
-<span class="lineNum">    4385 </span>                :    *  @brief Assign the result of a function object to each value in a
-<span class="lineNum">    4386 </span>                :    *         sequence.
-<span class="lineNum">    4387 </span>                :    *  @param  first  A forward iterator.
-<span class="lineNum">    4388 </span>                :    *  @param  last   A forward iterator.
-<span class="lineNum">    4389 </span>                :    *  @param  gen    A function object taking no arguments and returning
-<span class="lineNum">    4390 </span>                :    *                 std::iterator_traits&lt;_ForwardIterator&gt;::value_type
-<span class="lineNum">    4391 </span>                :    *  @return   generate() returns no value.
-<span class="lineNum">    4392 </span>                :    *
-<span class="lineNum">    4393 </span>                :    *  Performs the assignment @c *i = @p gen() for each @c i in the range
-<span class="lineNum">    4394 </span>                :    *  @p [first,last).
-<span class="lineNum">    4395 </span>                :   */
-<span class="lineNum">    4396 </span>                :   template&lt;typename _ForwardIterator, typename _Generator&gt;
-<span class="lineNum">    4397 </span>                :     void
-<span class="lineNum">    4398 </span>                :     generate(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">    4399 </span>                :              _Generator __gen)
-<span class="lineNum">    4400 </span>                :     {
-<span class="lineNum">    4401 </span>                :       // concept requirements
-<span class="lineNum">    4402 </span>                :       __glibcxx_function_requires(_ForwardIteratorConcept&lt;_ForwardIterator&gt;)
-<span class="lineNum">    4403 </span>                :       __glibcxx_function_requires(_GeneratorConcept&lt;_Generator,
-<span class="lineNum">    4404 </span>                :             typename iterator_traits&lt;_ForwardIterator&gt;::value_type&gt;)
-<span class="lineNum">    4405 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    4406 </span>                : 
-<span class="lineNum">    4407 </span>                :       for (; __first != __last; ++__first)
-<span class="lineNum">    4408 </span>                :         *__first = __gen();
-<span class="lineNum">    4409 </span>                :     }
-<span class="lineNum">    4410 </span>                : 
-<span class="lineNum">    4411 </span>                :   /**
-<span class="lineNum">    4412 </span>                :    *  @brief Assign the result of a function object to each value in a
-<span class="lineNum">    4413 </span>                :    *         sequence.
-<span class="lineNum">    4414 </span>                :    *  @param  first  A forward iterator.
-<span class="lineNum">    4415 </span>                :    *  @param  n      The length of the sequence.
-<span class="lineNum">    4416 </span>                :    *  @param  gen    A function object taking no arguments and returning
-<span class="lineNum">    4417 </span>                :    *                 std::iterator_traits&lt;_ForwardIterator&gt;::value_type
-<span class="lineNum">    4418 </span>                :    *  @return   The end of the sequence, @p first+n
-<span class="lineNum">    4419 </span>                :    *
-<span class="lineNum">    4420 </span>                :    *  Performs the assignment @c *i = @p gen() for each @c i in the range
-<span class="lineNum">    4421 </span>                :    *  @p [first,first+n).
-<span class="lineNum">    4422 </span>                :   */
-<span class="lineNum">    4423 </span>                :   template&lt;typename _OutputIterator, typename _Size, typename _Generator&gt;
-<span class="lineNum">    4424 </span>                :     _OutputIterator
-<span class="lineNum">    4425 </span>                :     generate_n(_OutputIterator __first, _Size __n, _Generator __gen)
-<span class="lineNum">    4426 </span>                :     {
-<span class="lineNum">    4427 </span>                :       // concept requirements
-<span class="lineNum">    4428 </span>                :       __glibcxx_function_requires(_OutputIteratorConcept&lt;_OutputIterator,
-<span class="lineNum">    4429 </span>                :             // &quot;the type returned by a _Generator&quot;
-<span class="lineNum">    4430 </span>                :             __typeof__(__gen())&gt;)
-<span class="lineNum">    4431 </span>                : 
-<span class="lineNum">    4432 </span>                :       for (; __n &gt; 0; --__n, ++__first)
-<span class="lineNum">    4433 </span>                :         *__first = __gen();
-<span class="lineNum">    4434 </span>                :       return __first;
-<span class="lineNum">    4435 </span>                :     }
-<span class="lineNum">    4436 </span>                : 
-<span class="lineNum">    4437 </span>                : 
-<span class="lineNum">    4438 </span>                :   /**
-<span class="lineNum">    4439 </span>                :    *  @brief Copy a sequence, removing consecutive duplicate values.
-<span class="lineNum">    4440 </span>                :    *  @param  first   An input iterator.
-<span class="lineNum">    4441 </span>                :    *  @param  last    An input iterator.
-<span class="lineNum">    4442 </span>                :    *  @param  result  An output iterator.
-<span class="lineNum">    4443 </span>                :    *  @return   An iterator designating the end of the resulting sequence.
-<span class="lineNum">    4444 </span>                :    *
-<span class="lineNum">    4445 </span>                :    *  Copies each element in the range @p [first,last) to the range
-<span class="lineNum">    4446 </span>                :    *  beginning at @p result, except that only the first element is copied
-<span class="lineNum">    4447 </span>                :    *  from groups of consecutive elements that compare equal.
-<span class="lineNum">    4448 </span>                :    *  unique_copy() is stable, so the relative order of elements that are
-<span class="lineNum">    4449 </span>                :    *  copied is unchanged.
-<span class="lineNum">    4450 </span>                :    *
-<span class="lineNum">    4451 </span>                :    *  _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">    4452 </span>                :    *  DR 241. Does unique_copy() require CopyConstructible and Assignable?
-<span class="lineNum">    4453 </span>                :    *  
-<span class="lineNum">    4454 </span>                :    *  _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">    4455 </span>                :    *  DR 538. 241 again: Does unique_copy() require CopyConstructible and 
-<span class="lineNum">    4456 </span>                :    *  Assignable?
-<span class="lineNum">    4457 </span>                :   */
-<span class="lineNum">    4458 </span>                :   template&lt;typename _InputIterator, typename _OutputIterator&gt;
-<span class="lineNum">    4459 </span>                :     inline _OutputIterator
-<span class="lineNum">    4460 </span>                :     unique_copy(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">    4461 </span>                :                 _OutputIterator __result)
-<span class="lineNum">    4462 </span>                :     {
-<span class="lineNum">    4463 </span>                :       // concept requirements
-<span class="lineNum">    4464 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator&gt;)
-<span class="lineNum">    4465 </span>                :       __glibcxx_function_requires(_OutputIteratorConcept&lt;_OutputIterator,
-<span class="lineNum">    4466 </span>                :             typename iterator_traits&lt;_InputIterator&gt;::value_type&gt;)
-<span class="lineNum">    4467 </span>                :       __glibcxx_function_requires(_EqualityComparableConcept&lt;
-<span class="lineNum">    4468 </span>                :             typename iterator_traits&lt;_InputIterator&gt;::value_type&gt;)
-<span class="lineNum">    4469 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    4470 </span>                : 
-<span class="lineNum">    4471 </span>                :       if (__first == __last)
-<span class="lineNum">    4472 </span>                :         return __result;
-<span class="lineNum">    4473 </span>                :       return std::__unique_copy(__first, __last, __result,
-<span class="lineNum">    4474 </span>                :                                 std::__iterator_category(__first),
-<span class="lineNum">    4475 </span>                :                                 std::__iterator_category(__result));
-<span class="lineNum">    4476 </span>                :     }
-<span class="lineNum">    4477 </span>                : 
-<span class="lineNum">    4478 </span>                :   /**
-<span class="lineNum">    4479 </span>                :    *  @brief Copy a sequence, removing consecutive values using a predicate.
-<span class="lineNum">    4480 </span>                :    *  @param  first        An input iterator.
-<span class="lineNum">    4481 </span>                :    *  @param  last         An input iterator.
-<span class="lineNum">    4482 </span>                :    *  @param  result       An output iterator.
-<span class="lineNum">    4483 </span>                :    *  @param  binary_pred  A binary predicate.
-<span class="lineNum">    4484 </span>                :    *  @return   An iterator designating the end of the resulting sequence.
-<span class="lineNum">    4485 </span>                :    *
-<span class="lineNum">    4486 </span>                :    *  Copies each element in the range @p [first,last) to the range
-<span class="lineNum">    4487 </span>                :    *  beginning at @p result, except that only the first element is copied
-<span class="lineNum">    4488 </span>                :    *  from groups of consecutive elements for which @p binary_pred returns
-<span class="lineNum">    4489 </span>                :    *  true.
-<span class="lineNum">    4490 </span>                :    *  unique_copy() is stable, so the relative order of elements that are
-<span class="lineNum">    4491 </span>                :    *  copied is unchanged.
-<span class="lineNum">    4492 </span>                :    *
-<span class="lineNum">    4493 </span>                :    *  _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">    4494 </span>                :    *  DR 241. Does unique_copy() require CopyConstructible and Assignable?
-<span class="lineNum">    4495 </span>                :   */
-<span class="lineNum">    4496 </span>                :   template&lt;typename _InputIterator, typename _OutputIterator,
-<span class="lineNum">    4497 </span>                :            typename _BinaryPredicate&gt;
-<span class="lineNum">    4498 </span>                :     inline _OutputIterator
-<span class="lineNum">    4499 </span>                :     unique_copy(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">    4500 </span>                :                 _OutputIterator __result,
-<span class="lineNum">    4501 </span>                :                 _BinaryPredicate __binary_pred)
-<span class="lineNum">    4502 </span>                :     {
-<span class="lineNum">    4503 </span>                :       // concept requirements -- predicates checked later
-<span class="lineNum">    4504 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator&gt;)
-<span class="lineNum">    4505 </span>                :       __glibcxx_function_requires(_OutputIteratorConcept&lt;_OutputIterator,
-<span class="lineNum">    4506 </span>                :             typename iterator_traits&lt;_InputIterator&gt;::value_type&gt;)
-<span class="lineNum">    4507 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    4508 </span>                : 
-<span class="lineNum">    4509 </span>                :       if (__first == __last)
-<span class="lineNum">    4510 </span>                :         return __result;
-<span class="lineNum">    4511 </span>                :       return std::__unique_copy(__first, __last, __result, __binary_pred,
-<span class="lineNum">    4512 </span>                :                                 std::__iterator_category(__first),
-<span class="lineNum">    4513 </span>                :                                 std::__iterator_category(__result));
-<span class="lineNum">    4514 </span>                :     }
-<span class="lineNum">    4515 </span>                : 
-<span class="lineNum">    4516 </span>                : 
-<span class="lineNum">    4517 </span>                :   /**
-<span class="lineNum">    4518 </span>                :    *  @brief Randomly shuffle the elements of a sequence.
-<span class="lineNum">    4519 </span>                :    *  @param  first   A forward iterator.
-<span class="lineNum">    4520 </span>                :    *  @param  last    A forward iterator.
-<span class="lineNum">    4521 </span>                :    *  @return  Nothing.
-<span class="lineNum">    4522 </span>                :    *
-<span class="lineNum">    4523 </span>                :    *  Reorder the elements in the range @p [first,last) using a random
-<span class="lineNum">    4524 </span>                :    *  distribution, so that every possible ordering of the sequence is
-<span class="lineNum">    4525 </span>                :    *  equally likely.
-<span class="lineNum">    4526 </span>                :   */
-<span class="lineNum">    4527 </span>                :   template&lt;typename _RandomAccessIterator&gt;
-<span class="lineNum">    4528 </span>                :     inline void
-<span class="lineNum">    4529 </span>                :     random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last)
-<span class="lineNum">    4530 </span>                :     {
-<span class="lineNum">    4531 </span>                :       // concept requirements
-<span class="lineNum">    4532 </span>                :       __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept&lt;
-<span class="lineNum">    4533 </span>                :             _RandomAccessIterator&gt;)
-<span class="lineNum">    4534 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    4535 </span>                : 
-<span class="lineNum">    4536 </span>                :       if (__first != __last)
-<span class="lineNum">    4537 </span>                :         for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)
-<span class="lineNum">    4538 </span>                :           std::iter_swap(__i, __first + (std::rand() % ((__i - __first) + 1)));
-<span class="lineNum">    4539 </span>                :     }
-<span class="lineNum">    4540 </span>                : 
-<span class="lineNum">    4541 </span>                :   /**
-<span class="lineNum">    4542 </span>                :    *  @brief Shuffle the elements of a sequence using a random number
-<span class="lineNum">    4543 </span>                :    *         generator.
-<span class="lineNum">    4544 </span>                :    *  @param  first   A forward iterator.
-<span class="lineNum">    4545 </span>                :    *  @param  last    A forward iterator.
-<span class="lineNum">    4546 </span>                :    *  @param  rand    The RNG functor or function.
-<span class="lineNum">    4547 </span>                :    *  @return  Nothing.
-<span class="lineNum">    4548 </span>                :    *
-<span class="lineNum">    4549 </span>                :    *  Reorders the elements in the range @p [first,last) using @p rand to
-<span class="lineNum">    4550 </span>                :    *  provide a random distribution. Calling @p rand(N) for a positive
-<span class="lineNum">    4551 </span>                :    *  integer @p N should return a randomly chosen integer from the
-<span class="lineNum">    4552 </span>                :    *  range [0,N).
-<span class="lineNum">    4553 </span>                :   */
-<span class="lineNum">    4554 </span>                :   template&lt;typename _RandomAccessIterator, typename _RandomNumberGenerator&gt;
-<span class="lineNum">    4555 </span>                :     void
-<span class="lineNum">    4556 </span>                :     random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last,
-<span class="lineNum">    4557 </span>                :                    _RandomNumberGenerator&amp; __rand)
-<span class="lineNum">    4558 </span>                :     {
-<span class="lineNum">    4559 </span>                :       // concept requirements
-<span class="lineNum">    4560 </span>                :       __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept&lt;
-<span class="lineNum">    4561 </span>                :             _RandomAccessIterator&gt;)
-<span class="lineNum">    4562 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    4563 </span>                : 
-<span class="lineNum">    4564 </span>                :       if (__first == __last)
-<span class="lineNum">    4565 </span>                :         return;
-<span class="lineNum">    4566 </span>                :       for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)
-<span class="lineNum">    4567 </span>                :         std::iter_swap(__i, __first + __rand((__i - __first) + 1));
-<span class="lineNum">    4568 </span>                :     }
-<span class="lineNum">    4569 </span>                : 
-<span class="lineNum">    4570 </span>                : 
-<span class="lineNum">    4571 </span>                :   /**
-<span class="lineNum">    4572 </span>                :    *  @brief Move elements for which a predicate is true to the beginning
-<span class="lineNum">    4573 </span>                :    *         of a sequence.
-<span class="lineNum">    4574 </span>                :    *  @param  first   A forward iterator.
-<span class="lineNum">    4575 </span>                :    *  @param  last    A forward iterator.
-<span class="lineNum">    4576 </span>                :    *  @param  pred    A predicate functor.
-<span class="lineNum">    4577 </span>                :    *  @return  An iterator @p middle such that @p pred(i) is true for each
-<span class="lineNum">    4578 </span>                :    *  iterator @p i in the range @p [first,middle) and false for each @p i
-<span class="lineNum">    4579 </span>                :    *  in the range @p [middle,last).
-<span class="lineNum">    4580 </span>                :    *
-<span class="lineNum">    4581 </span>                :    *  @p pred must not modify its operand. @p partition() does not preserve
-<span class="lineNum">    4582 </span>                :    *  the relative ordering of elements in each group, use
-<span class="lineNum">    4583 </span>                :    *  @p stable_partition() if this is needed.
-<span class="lineNum">    4584 </span>                :   */
-<span class="lineNum">    4585 </span>                :   template&lt;typename _ForwardIterator, typename _Predicate&gt;
-<span class="lineNum">    4586 </span>                :     inline _ForwardIterator
-<span class="lineNum">    4587 </span>                :     partition(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">    4588 </span>                :               _Predicate   __pred)
-<span class="lineNum">    4589 </span>                :     {
-<span class="lineNum">    4590 </span>                :       // concept requirements
-<span class="lineNum">    4591 </span>                :       __glibcxx_function_requires(_Mutable_ForwardIteratorConcept&lt;
-<span class="lineNum">    4592 </span>                :                                   _ForwardIterator&gt;)
-<span class="lineNum">    4593 </span>                :       __glibcxx_function_requires(_UnaryPredicateConcept&lt;_Predicate,
-<span class="lineNum">    4594 </span>                :             typename iterator_traits&lt;_ForwardIterator&gt;::value_type&gt;)
-<span class="lineNum">    4595 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    4596 </span>                : 
-<span class="lineNum">    4597 </span>                :       return std::__partition(__first, __last, __pred,
-<span class="lineNum">    4598 </span>                :                               std::__iterator_category(__first));
-<span class="lineNum">    4599 </span>                :     }
-<span class="lineNum">    4600 </span>                : 
-<span class="lineNum">    4601 </span>                : 
-<span class="lineNum">    4602 </span>                : 
-<span class="lineNum">    4603 </span>                :   /**
-<span class="lineNum">    4604 </span>                :    *  @brief Sort the smallest elements of a sequence.
-<span class="lineNum">    4605 </span>                :    *  @param  first   An iterator.
-<span class="lineNum">    4606 </span>                :    *  @param  middle  Another iterator.
-<span class="lineNum">    4607 </span>                :    *  @param  last    Another iterator.
-<span class="lineNum">    4608 </span>                :    *  @return  Nothing.
-<span class="lineNum">    4609 </span>                :    *
-<span class="lineNum">    4610 </span>                :    *  Sorts the smallest @p (middle-first) elements in the range
-<span class="lineNum">    4611 </span>                :    *  @p [first,last) and moves them to the range @p [first,middle). The
-<span class="lineNum">    4612 </span>                :    *  order of the remaining elements in the range @p [middle,last) is
-<span class="lineNum">    4613 </span>                :    *  undefined.
-<span class="lineNum">    4614 </span>                :    *  After the sort if @p i and @j are iterators in the range
-<span class="lineNum">    4615 </span>                :    *  @p [first,middle) such that @i precedes @j and @k is an iterator in
-<span class="lineNum">    4616 </span>                :    *  the range @p [middle,last) then @p *j&lt;*i and @p *k&lt;*i are both false.
-<span class="lineNum">    4617 </span>                :   */
-<span class="lineNum">    4618 </span>                :   template&lt;typename _RandomAccessIterator&gt;
-<span class="lineNum">    4619 </span>                :     inline void
-<span class="lineNum">    4620 </span>                :     partial_sort(_RandomAccessIterator __first,
-<span class="lineNum">    4621 </span>                :                  _RandomAccessIterator __middle,
-<span class="lineNum">    4622 </span><span class="lineNoCov">              0 :                  _RandomAccessIterator __last)</span>
-<span class="lineNum">    4623 </span>                :     {
-<span class="lineNum">    4624 </span>                :       typedef typename iterator_traits&lt;_RandomAccessIterator&gt;::value_type
-<span class="lineNum">    4625 </span>                :         _ValueType;
-<span class="lineNum">    4626 </span>                : 
-<span class="lineNum">    4627 </span>                :       // concept requirements
-<span class="lineNum">    4628 </span>                :       __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept&lt;
-<span class="lineNum">    4629 </span>                :             _RandomAccessIterator&gt;)
-<span class="lineNum">    4630 </span>                :       __glibcxx_function_requires(_LessThanComparableConcept&lt;_ValueType&gt;)
-<span class="lineNum">    4631 </span>                :       __glibcxx_requires_valid_range(__first, __middle);
-<span class="lineNum">    4632 </span>                :       __glibcxx_requires_valid_range(__middle, __last);
-<span class="lineNum">    4633 </span>                : 
-<span class="lineNum">    4634 </span><span class="lineNoCov">              0 :       std::__heap_select(__first, __middle, __last);</span>
-<span class="lineNum">    4635 </span><span class="lineNoCov">              0 :       std::sort_heap(__first, __middle);</span>
-<span class="lineNum">    4636 </span><span class="lineNoCov">              0 :     }</span>
-<span class="lineNum">    4637 </span>                : 
-<span class="lineNum">    4638 </span>                :   /**
-<span class="lineNum">    4639 </span>                :    *  @brief Sort the smallest elements of a sequence using a predicate
-<span class="lineNum">    4640 </span>                :    *         for comparison.
-<span class="lineNum">    4641 </span>                :    *  @param  first   An iterator.
-<span class="lineNum">    4642 </span>                :    *  @param  middle  Another iterator.
-<span class="lineNum">    4643 </span>                :    *  @param  last    Another iterator.
-<span class="lineNum">    4644 </span>                :    *  @param  comp    A comparison functor.
-<span class="lineNum">    4645 </span>                :    *  @return  Nothing.
-<span class="lineNum">    4646 </span>                :    *
-<span class="lineNum">    4647 </span>                :    *  Sorts the smallest @p (middle-first) elements in the range
-<span class="lineNum">    4648 </span>                :    *  @p [first,last) and moves them to the range @p [first,middle). The
-<span class="lineNum">    4649 </span>                :    *  order of the remaining elements in the range @p [middle,last) is
-<span class="lineNum">    4650 </span>                :    *  undefined.
-<span class="lineNum">    4651 </span>                :    *  After the sort if @p i and @j are iterators in the range
-<span class="lineNum">    4652 </span>                :    *  @p [first,middle) such that @i precedes @j and @k is an iterator in
-<span class="lineNum">    4653 </span>                :    *  the range @p [middle,last) then @p *comp(j,*i) and @p comp(*k,*i)
-<span class="lineNum">    4654 </span>                :    *  are both false.
-<span class="lineNum">    4655 </span>                :   */
-<span class="lineNum">    4656 </span>                :   template&lt;typename _RandomAccessIterator, typename _Compare&gt;
-<span class="lineNum">    4657 </span>                :     inline void
-<span class="lineNum">    4658 </span>                :     partial_sort(_RandomAccessIterator __first,
-<span class="lineNum">    4659 </span>                :                  _RandomAccessIterator __middle,
-<span class="lineNum">    4660 </span>                :                  _RandomAccessIterator __last,
-<span class="lineNum">    4661 </span><span class="lineNoCov">              0 :                  _Compare __comp)</span>
-<span class="lineNum">    4662 </span>                :     {
-<span class="lineNum">    4663 </span>                :       typedef typename iterator_traits&lt;_RandomAccessIterator&gt;::value_type
-<span class="lineNum">    4664 </span>                :         _ValueType;
-<span class="lineNum">    4665 </span>                : 
-<span class="lineNum">    4666 </span>                :       // concept requirements
-<span class="lineNum">    4667 </span>                :       __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept&lt;
-<span class="lineNum">    4668 </span>                :             _RandomAccessIterator&gt;)
-<span class="lineNum">    4669 </span>                :       __glibcxx_function_requires(_BinaryPredicateConcept&lt;_Compare,
-<span class="lineNum">    4670 </span>                :                                   _ValueType, _ValueType&gt;)
-<span class="lineNum">    4671 </span>                :       __glibcxx_requires_valid_range(__first, __middle);
-<span class="lineNum">    4672 </span>                :       __glibcxx_requires_valid_range(__middle, __last);
-<span class="lineNum">    4673 </span>                : 
-<span class="lineNum">    4674 </span><span class="lineNoCov">              0 :       std::__heap_select(__first, __middle, __last, __comp);</span>
-<span class="lineNum">    4675 </span><span class="lineNoCov">              0 :       std::sort_heap(__first, __middle, __comp);</span>
-<span class="lineNum">    4676 </span><span class="lineNoCov">              0 :     }</span>
-<span class="lineNum">    4677 </span>                : 
-<span class="lineNum">    4678 </span>                :   /**
-<span class="lineNum">    4679 </span>                :    *  @brief Sort a sequence just enough to find a particular position.
-<span class="lineNum">    4680 </span>                :    *  @param  first   An iterator.
-<span class="lineNum">    4681 </span>                :    *  @param  nth     Another iterator.
-<span class="lineNum">    4682 </span>                :    *  @param  last    Another iterator.
-<span class="lineNum">    4683 </span>                :    *  @return  Nothing.
-<span class="lineNum">    4684 </span>                :    *
-<span class="lineNum">    4685 </span>                :    *  Rearranges the elements in the range @p [first,last) so that @p *nth
-<span class="lineNum">    4686 </span>                :    *  is the same element that would have been in that position had the
-<span class="lineNum">    4687 </span>                :    *  whole sequence been sorted.
-<span class="lineNum">    4688 </span>                :    *  whole sequence been sorted. The elements either side of @p *nth are
-<span class="lineNum">    4689 </span>                :    *  not completely sorted, but for any iterator @i in the range
-<span class="lineNum">    4690 </span>                :    *  @p [first,nth) and any iterator @j in the range @p [nth,last) it
-<span class="lineNum">    4691 </span>                :    *  holds that @p *j&lt;*i is false.
-<span class="lineNum">    4692 </span>                :   */
-<span class="lineNum">    4693 </span>                :   template&lt;typename _RandomAccessIterator&gt;
-<span class="lineNum">    4694 </span>                :     inline void
-<span class="lineNum">    4695 </span>                :     nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth,
-<span class="lineNum">    4696 </span>                :                 _RandomAccessIterator __last)
-<span class="lineNum">    4697 </span>                :     {
-<span class="lineNum">    4698 </span>                :       typedef typename iterator_traits&lt;_RandomAccessIterator&gt;::value_type
-<span class="lineNum">    4699 </span>                :         _ValueType;
-<span class="lineNum">    4700 </span>                : 
-<span class="lineNum">    4701 </span>                :       // concept requirements
-<span class="lineNum">    4702 </span>                :       __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept&lt;
-<span class="lineNum">    4703 </span>                :                                   _RandomAccessIterator&gt;)
-<span class="lineNum">    4704 </span>                :       __glibcxx_function_requires(_LessThanComparableConcept&lt;_ValueType&gt;)
-<span class="lineNum">    4705 </span>                :       __glibcxx_requires_valid_range(__first, __nth);
-<span class="lineNum">    4706 </span>                :       __glibcxx_requires_valid_range(__nth, __last);
-<span class="lineNum">    4707 </span>                : 
-<span class="lineNum">    4708 </span>                :       if (__first == __last || __nth == __last)
-<span class="lineNum">    4709 </span>                :         return;
-<span class="lineNum">    4710 </span>                : 
-<span class="lineNum">    4711 </span>                :       std::__introselect(__first, __nth, __last,
-<span class="lineNum">    4712 </span>                :                          std::__lg(__last - __first) * 2);
-<span class="lineNum">    4713 </span>                :     }
-<span class="lineNum">    4714 </span>                : 
-<span class="lineNum">    4715 </span>                :   /**
-<span class="lineNum">    4716 </span>                :    *  @brief Sort a sequence just enough to find a particular position
-<span class="lineNum">    4717 </span>                :    *         using a predicate for comparison.
-<span class="lineNum">    4718 </span>                :    *  @param  first   An iterator.
-<span class="lineNum">    4719 </span>                :    *  @param  nth     Another iterator.
-<span class="lineNum">    4720 </span>                :    *  @param  last    Another iterator.
-<span class="lineNum">    4721 </span>                :    *  @param  comp    A comparison functor.
-<span class="lineNum">    4722 </span>                :    *  @return  Nothing.
-<span class="lineNum">    4723 </span>                :    *
-<span class="lineNum">    4724 </span>                :    *  Rearranges the elements in the range @p [first,last) so that @p *nth
-<span class="lineNum">    4725 </span>                :    *  is the same element that would have been in that position had the
-<span class="lineNum">    4726 </span>                :    *  whole sequence been sorted. The elements either side of @p *nth are
-<span class="lineNum">    4727 </span>                :    *  not completely sorted, but for any iterator @i in the range
-<span class="lineNum">    4728 </span>                :    *  @p [first,nth) and any iterator @j in the range @p [nth,last) it
-<span class="lineNum">    4729 </span>                :    *  holds that @p comp(*j,*i) is false.
-<span class="lineNum">    4730 </span>                :   */
-<span class="lineNum">    4731 </span>                :   template&lt;typename _RandomAccessIterator, typename _Compare&gt;
-<span class="lineNum">    4732 </span>                :     inline void
-<span class="lineNum">    4733 </span>                :     nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth,
-<span class="lineNum">    4734 </span>                :                 _RandomAccessIterator __last, _Compare __comp)
-<span class="lineNum">    4735 </span>                :     {
-<span class="lineNum">    4736 </span>                :       typedef typename iterator_traits&lt;_RandomAccessIterator&gt;::value_type
-<span class="lineNum">    4737 </span>                :         _ValueType;
-<span class="lineNum">    4738 </span>                : 
-<span class="lineNum">    4739 </span>                :       // concept requirements
-<span class="lineNum">    4740 </span>                :       __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept&lt;
-<span class="lineNum">    4741 </span>                :                                   _RandomAccessIterator&gt;)
-<span class="lineNum">    4742 </span>                :       __glibcxx_function_requires(_BinaryPredicateConcept&lt;_Compare,
-<span class="lineNum">    4743 </span>                :                                   _ValueType, _ValueType&gt;)
-<span class="lineNum">    4744 </span>                :       __glibcxx_requires_valid_range(__first, __nth);
-<span class="lineNum">    4745 </span>                :       __glibcxx_requires_valid_range(__nth, __last);
-<span class="lineNum">    4746 </span>                : 
-<span class="lineNum">    4747 </span>                :       if (__first == __last || __nth == __last)
-<span class="lineNum">    4748 </span>                :         return;
-<span class="lineNum">    4749 </span>                : 
-<span class="lineNum">    4750 </span>                :       std::__introselect(__first, __nth, __last,
-<span class="lineNum">    4751 </span>                :                          std::__lg(__last - __first) * 2, __comp);
-<span class="lineNum">    4752 </span>                :     }
-<span class="lineNum">    4753 </span>                : 
-<span class="lineNum">    4754 </span>                : 
-<span class="lineNum">    4755 </span>                :   /**
-<span class="lineNum">    4756 </span>                :    *  @brief Sort the elements of a sequence.
-<span class="lineNum">    4757 </span>                :    *  @param  first   An iterator.
-<span class="lineNum">    4758 </span>                :    *  @param  last    Another iterator.
-<span class="lineNum">    4759 </span>                :    *  @return  Nothing.
-<span class="lineNum">    4760 </span>                :    *
-<span class="lineNum">    4761 </span>                :    *  Sorts the elements in the range @p [first,last) in ascending order,
-<span class="lineNum">    4762 </span>                :    *  such that @p *(i+1)&lt;*i is false for each iterator @p i in the range
-<span class="lineNum">    4763 </span>                :    *  @p [first,last-1).
-<span class="lineNum">    4764 </span>                :    *
-<span class="lineNum">    4765 </span>                :    *  The relative ordering of equivalent elements is not preserved, use
-<span class="lineNum">    4766 </span>                :    *  @p stable_sort() if this is needed.
-<span class="lineNum">    4767 </span>                :   */
-<span class="lineNum">    4768 </span>                :   template&lt;typename _RandomAccessIterator&gt;
-<span class="lineNum">    4769 </span>                :     inline void
-<span class="lineNum">    4770 </span><span class="lineCov">              8 :     sort(_RandomAccessIterator __first, _RandomAccessIterator __last)</span>
-<span class="lineNum">    4771 </span>                :     {
-<span class="lineNum">    4772 </span>                :       typedef typename iterator_traits&lt;_RandomAccessIterator&gt;::value_type
-<span class="lineNum">    4773 </span>                :         _ValueType;
-<span class="lineNum">    4774 </span>                : 
-<span class="lineNum">    4775 </span>                :       // concept requirements
-<span class="lineNum">    4776 </span>                :       __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept&lt;
-<span class="lineNum">    4777 </span>                :             _RandomAccessIterator&gt;)
-<span class="lineNum">    4778 </span>                :       __glibcxx_function_requires(_LessThanComparableConcept&lt;_ValueType&gt;)
-<span class="lineNum">    4779 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    4780 </span>                : 
-<span class="lineNum">    4781 </span><span class="lineCov">              8 :       if (__first != __last)</span>
-<span class="lineNum">    4782 </span>                :         {
-<span class="lineNum">    4783 </span><span class="lineCov">              8 :           std::__introsort_loop(__first, __last,</span>
-<span class="lineNum">    4784 </span>                :                                 std::__lg(__last - __first) * 2);
-<span class="lineNum">    4785 </span><span class="lineCov">              8 :           std::__final_insertion_sort(__first, __last);</span>
-<span class="lineNum">    4786 </span>                :         }
-<span class="lineNum">    4787 </span><span class="lineCov">              8 :     }</span>
-<span class="lineNum">    4788 </span>                : 
-<span class="lineNum">    4789 </span>                :   /**
-<span class="lineNum">    4790 </span>                :    *  @brief Sort the elements of a sequence using a predicate for comparison.
-<span class="lineNum">    4791 </span>                :    *  @param  first   An iterator.
-<span class="lineNum">    4792 </span>                :    *  @param  last    Another iterator.
-<span class="lineNum">    4793 </span>                :    *  @param  comp    A comparison functor.
-<span class="lineNum">    4794 </span>                :    *  @return  Nothing.
-<span class="lineNum">    4795 </span>                :    *
-<span class="lineNum">    4796 </span>                :    *  Sorts the elements in the range @p [first,last) in ascending order,
-<span class="lineNum">    4797 </span>                :    *  such that @p comp(*(i+1),*i) is false for every iterator @p i in the
-<span class="lineNum">    4798 </span>                :    *  range @p [first,last-1).
-<span class="lineNum">    4799 </span>                :    *
-<span class="lineNum">    4800 </span>                :    *  The relative ordering of equivalent elements is not preserved, use
-<span class="lineNum">    4801 </span>                :    *  @p stable_sort() if this is needed.
-<span class="lineNum">    4802 </span>                :   */
-<span class="lineNum">    4803 </span>                :   template&lt;typename _RandomAccessIterator, typename _Compare&gt;
-<span class="lineNum">    4804 </span>                :     inline void
-<span class="lineNum">    4805 </span>                :     sort(_RandomAccessIterator __first, _RandomAccessIterator __last,
-<span class="lineNum">    4806 </span><span class="lineCov">           3938 :          _Compare __comp)</span>
-<span class="lineNum">    4807 </span>                :     {
-<span class="lineNum">    4808 </span>                :       typedef typename iterator_traits&lt;_RandomAccessIterator&gt;::value_type
-<span class="lineNum">    4809 </span>                :         _ValueType;
-<span class="lineNum">    4810 </span>                : 
-<span class="lineNum">    4811 </span>                :       // concept requirements
-<span class="lineNum">    4812 </span>                :       __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept&lt;
-<span class="lineNum">    4813 </span>                :             _RandomAccessIterator&gt;)
-<span class="lineNum">    4814 </span>                :       __glibcxx_function_requires(_BinaryPredicateConcept&lt;_Compare, _ValueType,
-<span class="lineNum">    4815 </span>                :                                   _ValueType&gt;)
-<span class="lineNum">    4816 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    4817 </span>                : 
-<span class="lineNum">    4818 </span><span class="lineCov">           3938 :       if (__first != __last)</span>
-<span class="lineNum">    4819 </span>                :         {
-<span class="lineNum">    4820 </span><span class="lineCov">           3938 :           std::__introsort_loop(__first, __last,</span>
-<span class="lineNum">    4821 </span>                :                                 std::__lg(__last - __first) * 2, __comp);
-<span class="lineNum">    4822 </span><span class="lineCov">           3938 :           std::__final_insertion_sort(__first, __last, __comp);</span>
-<span class="lineNum">    4823 </span>                :         }
-<span class="lineNum">    4824 </span><span class="lineCov">           3938 :     }</span>
-<span class="lineNum">    4825 </span>                : 
-<span class="lineNum">    4826 </span>                :   /**
-<span class="lineNum">    4827 </span>                :    *  @brief Merges two sorted ranges.
-<span class="lineNum">    4828 </span>                :    *  @param  first1  An iterator.
-<span class="lineNum">    4829 </span>                :    *  @param  first2  Another iterator.
-<span class="lineNum">    4830 </span>                :    *  @param  last1   Another iterator.
-<span class="lineNum">    4831 </span>                :    *  @param  last2   Another iterator.
-<span class="lineNum">    4832 </span>                :    *  @param  result  An iterator pointing to the end of the merged range.
-<span class="lineNum">    4833 </span>                :    *  @return         An iterator pointing to the first element &quot;not less
-<span class="lineNum">    4834 </span>                :    *                  than&quot; @a val.
-<span class="lineNum">    4835 </span>                :    *
-<span class="lineNum">    4836 </span>                :    *  Merges the ranges [first1,last1) and [first2,last2) into the sorted range
-<span class="lineNum">    4837 </span>                :    *  [result, result + (last1-first1) + (last2-first2)).  Both input ranges
-<span class="lineNum">    4838 </span>                :    *  must be sorted, and the output range must not overlap with either of
-<span class="lineNum">    4839 </span>                :    *  the input ranges.  The sort is @e stable, that is, for equivalent
-<span class="lineNum">    4840 </span>                :    *  elements in the two ranges, elements from the first range will always
-<span class="lineNum">    4841 </span>                :    *  come before elements from the second.
-<span class="lineNum">    4842 </span>                :   */
-<span class="lineNum">    4843 </span>                :   template&lt;typename _InputIterator1, typename _InputIterator2,
-<span class="lineNum">    4844 </span>                :            typename _OutputIterator&gt;
-<span class="lineNum">    4845 </span>                :     _OutputIterator
-<span class="lineNum">    4846 </span>                :     merge(_InputIterator1 __first1, _InputIterator1 __last1,
-<span class="lineNum">    4847 </span>                :           _InputIterator2 __first2, _InputIterator2 __last2,
-<span class="lineNum">    4848 </span>                :           _OutputIterator __result)
-<span class="lineNum">    4849 </span>                :     {
-<span class="lineNum">    4850 </span>                :       typedef typename iterator_traits&lt;_InputIterator1&gt;::value_type
-<span class="lineNum">    4851 </span>                :         _ValueType1;
-<span class="lineNum">    4852 </span>                :       typedef typename iterator_traits&lt;_InputIterator2&gt;::value_type
-<span class="lineNum">    4853 </span>                :         _ValueType2;
-<span class="lineNum">    4854 </span>                : 
-<span class="lineNum">    4855 </span>                :       // concept requirements
-<span class="lineNum">    4856 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator1&gt;)
-<span class="lineNum">    4857 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator2&gt;)
-<span class="lineNum">    4858 </span>                :       __glibcxx_function_requires(_OutputIteratorConcept&lt;_OutputIterator,
-<span class="lineNum">    4859 </span>                :                                   _ValueType1&gt;)
-<span class="lineNum">    4860 </span>                :       __glibcxx_function_requires(_OutputIteratorConcept&lt;_OutputIterator,
-<span class="lineNum">    4861 </span>                :                                   _ValueType2&gt;)
-<span class="lineNum">    4862 </span>                :       __glibcxx_function_requires(_LessThanOpConcept&lt;_ValueType2, _ValueType1&gt;)   
-<span class="lineNum">    4863 </span>                :       __glibcxx_requires_sorted_set(__first1, __last1, __first2);
-<span class="lineNum">    4864 </span>                :       __glibcxx_requires_sorted_set(__first2, __last2, __first1);
-<span class="lineNum">    4865 </span>                : 
-<span class="lineNum">    4866 </span>                :       while (__first1 != __last1 &amp;&amp; __first2 != __last2)
-<span class="lineNum">    4867 </span>                :         {
-<span class="lineNum">    4868 </span>                :           if (*__first2 &lt; *__first1)
-<span class="lineNum">    4869 </span>                :             {
-<span class="lineNum">    4870 </span>                :               *__result = *__first2;
-<span class="lineNum">    4871 </span>                :               ++__first2;
-<span class="lineNum">    4872 </span>                :             }
-<span class="lineNum">    4873 </span>                :           else
-<span class="lineNum">    4874 </span>                :             {
-<span class="lineNum">    4875 </span>                :               *__result = *__first1;
-<span class="lineNum">    4876 </span>                :               ++__first1;
-<span class="lineNum">    4877 </span>                :             }
-<span class="lineNum">    4878 </span>                :           ++__result;
-<span class="lineNum">    4879 </span>                :         }
-<span class="lineNum">    4880 </span>                :       return std::copy(__first2, __last2, std::copy(__first1, __last1,
-<span class="lineNum">    4881 </span>                :                                                     __result));
-<span class="lineNum">    4882 </span>                :     }
-<span class="lineNum">    4883 </span>                : 
-<span class="lineNum">    4884 </span>                :   /**
-<span class="lineNum">    4885 </span>                :    *  @brief Merges two sorted ranges.
-<span class="lineNum">    4886 </span>                :    *  @param  first1  An iterator.
-<span class="lineNum">    4887 </span>                :    *  @param  first2  Another iterator.
-<span class="lineNum">    4888 </span>                :    *  @param  last1   Another iterator.
-<span class="lineNum">    4889 </span>                :    *  @param  last2   Another iterator.
-<span class="lineNum">    4890 </span>                :    *  @param  result  An iterator pointing to the end of the merged range.
-<span class="lineNum">    4891 </span>                :    *  @param  comp    A functor to use for comparisons.
-<span class="lineNum">    4892 </span>                :    *  @return         An iterator pointing to the first element &quot;not less
-<span class="lineNum">    4893 </span>                :    *                  than&quot; @a val.
-<span class="lineNum">    4894 </span>                :    *
-<span class="lineNum">    4895 </span>                :    *  Merges the ranges [first1,last1) and [first2,last2) into the sorted range
-<span class="lineNum">    4896 </span>                :    *  [result, result + (last1-first1) + (last2-first2)).  Both input ranges
-<span class="lineNum">    4897 </span>                :    *  must be sorted, and the output range must not overlap with either of
-<span class="lineNum">    4898 </span>                :    *  the input ranges.  The sort is @e stable, that is, for equivalent
-<span class="lineNum">    4899 </span>                :    *  elements in the two ranges, elements from the first range will always
-<span class="lineNum">    4900 </span>                :    *  come before elements from the second.
-<span class="lineNum">    4901 </span>                :    *
-<span class="lineNum">    4902 </span>                :    *  The comparison function should have the same effects on ordering as
-<span class="lineNum">    4903 </span>                :    *  the function used for the initial sort.
-<span class="lineNum">    4904 </span>                :   */
-<span class="lineNum">    4905 </span>                :   template&lt;typename _InputIterator1, typename _InputIterator2,
-<span class="lineNum">    4906 </span>                :            typename _OutputIterator, typename _Compare&gt;
-<span class="lineNum">    4907 </span>                :     _OutputIterator
-<span class="lineNum">    4908 </span>                :     merge(_InputIterator1 __first1, _InputIterator1 __last1,
-<span class="lineNum">    4909 </span>                :           _InputIterator2 __first2, _InputIterator2 __last2,
-<span class="lineNum">    4910 </span>                :           _OutputIterator __result, _Compare __comp)
-<span class="lineNum">    4911 </span>                :     {
-<span class="lineNum">    4912 </span>                :       typedef typename iterator_traits&lt;_InputIterator1&gt;::value_type
-<span class="lineNum">    4913 </span>                :         _ValueType1;
-<span class="lineNum">    4914 </span>                :       typedef typename iterator_traits&lt;_InputIterator2&gt;::value_type
-<span class="lineNum">    4915 </span>                :         _ValueType2;
-<span class="lineNum">    4916 </span>                : 
-<span class="lineNum">    4917 </span>                :       // concept requirements
-<span class="lineNum">    4918 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator1&gt;)
-<span class="lineNum">    4919 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator2&gt;)
-<span class="lineNum">    4920 </span>                :       __glibcxx_function_requires(_OutputIteratorConcept&lt;_OutputIterator,
-<span class="lineNum">    4921 </span>                :                                   _ValueType1&gt;)
-<span class="lineNum">    4922 </span>                :       __glibcxx_function_requires(_OutputIteratorConcept&lt;_OutputIterator,
-<span class="lineNum">    4923 </span>                :                                   _ValueType2&gt;)
-<span class="lineNum">    4924 </span>                :       __glibcxx_function_requires(_BinaryPredicateConcept&lt;_Compare,
-<span class="lineNum">    4925 </span>                :                                   _ValueType2, _ValueType1&gt;)
-<span class="lineNum">    4926 </span>                :       __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp);
-<span class="lineNum">    4927 </span>                :       __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp);
-<span class="lineNum">    4928 </span>                : 
-<span class="lineNum">    4929 </span>                :       while (__first1 != __last1 &amp;&amp; __first2 != __last2)
-<span class="lineNum">    4930 </span>                :         {
-<span class="lineNum">    4931 </span>                :           if (__comp(*__first2, *__first1))
-<span class="lineNum">    4932 </span>                :             {
-<span class="lineNum">    4933 </span>                :               *__result = *__first2;
-<span class="lineNum">    4934 </span>                :               ++__first2;
-<span class="lineNum">    4935 </span>                :             }
-<span class="lineNum">    4936 </span>                :           else
-<span class="lineNum">    4937 </span>                :             {
-<span class="lineNum">    4938 </span>                :               *__result = *__first1;
-<span class="lineNum">    4939 </span>                :               ++__first1;
-<span class="lineNum">    4940 </span>                :             }
-<span class="lineNum">    4941 </span>                :           ++__result;
-<span class="lineNum">    4942 </span>                :         }
-<span class="lineNum">    4943 </span>                :       return std::copy(__first2, __last2, std::copy(__first1, __last1,
-<span class="lineNum">    4944 </span>                :                                                     __result));
-<span class="lineNum">    4945 </span>                :     }
-<span class="lineNum">    4946 </span>                : 
-<span class="lineNum">    4947 </span>                : 
-<span class="lineNum">    4948 </span>                :   /**
-<span class="lineNum">    4949 </span>                :    *  @brief Sort the elements of a sequence, preserving the relative order
-<span class="lineNum">    4950 </span>                :    *         of equivalent elements.
-<span class="lineNum">    4951 </span>                :    *  @param  first   An iterator.
-<span class="lineNum">    4952 </span>                :    *  @param  last    Another iterator.
-<span class="lineNum">    4953 </span>                :    *  @return  Nothing.
-<span class="lineNum">    4954 </span>                :    *
-<span class="lineNum">    4955 </span>                :    *  Sorts the elements in the range @p [first,last) in ascending order,
-<span class="lineNum">    4956 </span>                :    *  such that @p *(i+1)&lt;*i is false for each iterator @p i in the range
-<span class="lineNum">    4957 </span>                :    *  @p [first,last-1).
-<span class="lineNum">    4958 </span>                :    *
-<span class="lineNum">    4959 </span>                :    *  The relative ordering of equivalent elements is preserved, so any two
-<span class="lineNum">    4960 </span>                :    *  elements @p x and @p y in the range @p [first,last) such that
-<span class="lineNum">    4961 </span>                :    *  @p x&lt;y is false and @p y&lt;x is false will have the same relative
-<span class="lineNum">    4962 </span>                :    *  ordering after calling @p stable_sort().
-<span class="lineNum">    4963 </span>                :   */
-<span class="lineNum">    4964 </span>                :   template&lt;typename _RandomAccessIterator&gt;
-<span class="lineNum">    4965 </span>                :     inline void
-<span class="lineNum">    4966 </span>                :     stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last)
-<span class="lineNum">    4967 </span>                :     {
-<span class="lineNum">    4968 </span>                :       typedef typename iterator_traits&lt;_RandomAccessIterator&gt;::value_type
-<span class="lineNum">    4969 </span>                :         _ValueType;
-<span class="lineNum">    4970 </span>                :       typedef typename iterator_traits&lt;_RandomAccessIterator&gt;::difference_type
-<span class="lineNum">    4971 </span>                :         _DistanceType;
-<span class="lineNum">    4972 </span>                : 
-<span class="lineNum">    4973 </span>                :       // concept requirements
-<span class="lineNum">    4974 </span>                :       __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept&lt;
-<span class="lineNum">    4975 </span>                :             _RandomAccessIterator&gt;)
-<span class="lineNum">    4976 </span>                :       __glibcxx_function_requires(_LessThanComparableConcept&lt;_ValueType&gt;)
-<span class="lineNum">    4977 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    4978 </span>                : 
-<span class="lineNum">    4979 </span>                :       _Temporary_buffer&lt;_RandomAccessIterator, _ValueType&gt; __buf(__first,
-<span class="lineNum">    4980 </span>                :                                                                  __last);
-<span class="lineNum">    4981 </span>                :       if (__buf.begin() == 0)
-<span class="lineNum">    4982 </span>                :         std::__inplace_stable_sort(__first, __last);
-<span class="lineNum">    4983 </span>                :       else
-<span class="lineNum">    4984 </span>                :         std::__stable_sort_adaptive(__first, __last, __buf.begin(),
-<span class="lineNum">    4985 </span>                :                                     _DistanceType(__buf.size()));
-<span class="lineNum">    4986 </span>                :     }
-<span class="lineNum">    4987 </span>                : 
-<span class="lineNum">    4988 </span>                :   /**
-<span class="lineNum">    4989 </span>                :    *  @brief Sort the elements of a sequence using a predicate for comparison,
-<span class="lineNum">    4990 </span>                :    *         preserving the relative order of equivalent elements.
-<span class="lineNum">    4991 </span>                :    *  @param  first   An iterator.
-<span class="lineNum">    4992 </span>                :    *  @param  last    Another iterator.
-<span class="lineNum">    4993 </span>                :    *  @param  comp    A comparison functor.
-<span class="lineNum">    4994 </span>                :    *  @return  Nothing.
-<span class="lineNum">    4995 </span>                :    *
-<span class="lineNum">    4996 </span>                :    *  Sorts the elements in the range @p [first,last) in ascending order,
-<span class="lineNum">    4997 </span>                :    *  such that @p comp(*(i+1),*i) is false for each iterator @p i in the
-<span class="lineNum">    4998 </span>                :    *  range @p [first,last-1).
-<span class="lineNum">    4999 </span>                :    *
-<span class="lineNum">    5000 </span>                :    *  The relative ordering of equivalent elements is preserved, so any two
-<span class="lineNum">    5001 </span>                :    *  elements @p x and @p y in the range @p [first,last) such that
-<span class="lineNum">    5002 </span>                :    *  @p comp(x,y) is false and @p comp(y,x) is false will have the same
-<span class="lineNum">    5003 </span>                :    *  relative ordering after calling @p stable_sort().
-<span class="lineNum">    5004 </span>                :   */
-<span class="lineNum">    5005 </span>                :   template&lt;typename _RandomAccessIterator, typename _Compare&gt;
-<span class="lineNum">    5006 </span>                :     inline void
-<span class="lineNum">    5007 </span>                :     stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last,
-<span class="lineNum">    5008 </span>                :                 _Compare __comp)
-<span class="lineNum">    5009 </span>                :     {
-<span class="lineNum">    5010 </span>                :       typedef typename iterator_traits&lt;_RandomAccessIterator&gt;::value_type
-<span class="lineNum">    5011 </span>                :         _ValueType;
-<span class="lineNum">    5012 </span>                :       typedef typename iterator_traits&lt;_RandomAccessIterator&gt;::difference_type
-<span class="lineNum">    5013 </span>                :         _DistanceType;
-<span class="lineNum">    5014 </span>                : 
-<span class="lineNum">    5015 </span>                :       // concept requirements
-<span class="lineNum">    5016 </span>                :       __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept&lt;
-<span class="lineNum">    5017 </span>                :             _RandomAccessIterator&gt;)
-<span class="lineNum">    5018 </span>                :       __glibcxx_function_requires(_BinaryPredicateConcept&lt;_Compare,
-<span class="lineNum">    5019 </span>                :                                   _ValueType,
-<span class="lineNum">    5020 </span>                :                                   _ValueType&gt;)
-<span class="lineNum">    5021 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    5022 </span>                : 
-<span class="lineNum">    5023 </span>                :       _Temporary_buffer&lt;_RandomAccessIterator, _ValueType&gt; __buf(__first,
-<span class="lineNum">    5024 </span>                :                                                                  __last);
-<span class="lineNum">    5025 </span>                :       if (__buf.begin() == 0)
-<span class="lineNum">    5026 </span>                :         std::__inplace_stable_sort(__first, __last, __comp);
-<span class="lineNum">    5027 </span>                :       else
-<span class="lineNum">    5028 </span>                :         std::__stable_sort_adaptive(__first, __last, __buf.begin(),
-<span class="lineNum">    5029 </span>                :                                     _DistanceType(__buf.size()), __comp);
-<span class="lineNum">    5030 </span>                :     }
-<span class="lineNum">    5031 </span>                : 
-<span class="lineNum">    5032 </span>                : 
-<span class="lineNum">    5033 </span>                :   /**
-<span class="lineNum">    5034 </span>                :    *  @brief Return the union of two sorted ranges.
-<span class="lineNum">    5035 </span>                :    *  @param  first1  Start of first range.
-<span class="lineNum">    5036 </span>                :    *  @param  last1   End of first range.
-<span class="lineNum">    5037 </span>                :    *  @param  first2  Start of second range.
-<span class="lineNum">    5038 </span>                :    *  @param  last2   End of second range.
-<span class="lineNum">    5039 </span>                :    *  @return  End of the output range.
-<span class="lineNum">    5040 </span>                :    *  @ingroup setoperations
-<span class="lineNum">    5041 </span>                :    *
-<span class="lineNum">    5042 </span>                :    *  This operation iterates over both ranges, copying elements present in
-<span class="lineNum">    5043 </span>                :    *  each range in order to the output range.  Iterators increment for each
-<span class="lineNum">    5044 </span>                :    *  range.  When the current element of one range is less than the other,
-<span class="lineNum">    5045 </span>                :    *  that element is copied and the iterator advanced.  If an element is
-<span class="lineNum">    5046 </span>                :    *  contained in both ranges, the element from the first range is copied and
-<span class="lineNum">    5047 </span>                :    *  both ranges advance.  The output range may not overlap either input
-<span class="lineNum">    5048 </span>                :    *  range.
-<span class="lineNum">    5049 </span>                :   */
-<span class="lineNum">    5050 </span>                :   template&lt;typename _InputIterator1, typename _InputIterator2,
-<span class="lineNum">    5051 </span>                :            typename _OutputIterator&gt;
-<span class="lineNum">    5052 </span>                :     _OutputIterator
-<span class="lineNum">    5053 </span>                :     set_union(_InputIterator1 __first1, _InputIterator1 __last1,
-<span class="lineNum">    5054 </span>                :               _InputIterator2 __first2, _InputIterator2 __last2,
-<span class="lineNum">    5055 </span><span class="lineCov">          21150 :               _OutputIterator __result)</span>
-<span class="lineNum">    5056 </span>                :     {
-<span class="lineNum">    5057 </span>                :       typedef typename iterator_traits&lt;_InputIterator1&gt;::value_type
-<span class="lineNum">    5058 </span>                :         _ValueType1;
-<span class="lineNum">    5059 </span>                :       typedef typename iterator_traits&lt;_InputIterator2&gt;::value_type
-<span class="lineNum">    5060 </span>                :         _ValueType2;
-<span class="lineNum">    5061 </span>                : 
-<span class="lineNum">    5062 </span>                :       // concept requirements
-<span class="lineNum">    5063 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator1&gt;)
-<span class="lineNum">    5064 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator2&gt;)
-<span class="lineNum">    5065 </span>                :       __glibcxx_function_requires(_OutputIteratorConcept&lt;_OutputIterator,
-<span class="lineNum">    5066 </span>                :                                   _ValueType1&gt;)
-<span class="lineNum">    5067 </span>                :       __glibcxx_function_requires(_OutputIteratorConcept&lt;_OutputIterator,
-<span class="lineNum">    5068 </span>                :                                   _ValueType2&gt;)
-<span class="lineNum">    5069 </span>                :       __glibcxx_function_requires(_LessThanOpConcept&lt;_ValueType1, _ValueType2&gt;)
-<span class="lineNum">    5070 </span>                :       __glibcxx_function_requires(_LessThanOpConcept&lt;_ValueType2, _ValueType1&gt;)
-<span class="lineNum">    5071 </span>                :       __glibcxx_requires_sorted_set(__first1, __last1, __first2);
-<span class="lineNum">    5072 </span>                :       __glibcxx_requires_sorted_set(__first2, __last2, __first1);
-<span class="lineNum">    5073 </span>                : 
-<span class="lineNum">    5074 </span><span class="lineCov">          42309 :       while (__first1 != __last1 &amp;&amp; __first2 != __last2)</span>
-<span class="lineNum">    5075 </span>                :         {
-<span class="lineNum">    5076 </span><span class="lineCov">              9 :           if (*__first1 &lt; *__first2)</span>
-<span class="lineNum">    5077 </span>                :             {
-<span class="lineNum">    5078 </span><span class="lineCov">              7 :               *__result = *__first1;</span>
-<span class="lineNum">    5079 </span><span class="lineCov">              7 :               ++__first1;</span>
-<span class="lineNum">    5080 </span>                :             }
-<span class="lineNum">    5081 </span><span class="lineCov">              2 :           else if (*__first2 &lt; *__first1)</span>
-<span class="lineNum">    5082 </span>                :             {
-<span class="lineNum">    5083 </span><span class="lineCov">              1 :               *__result = *__first2;</span>
-<span class="lineNum">    5084 </span><span class="lineCov">              1 :               ++__first2;</span>
-<span class="lineNum">    5085 </span>                :             }
-<span class="lineNum">    5086 </span>                :           else
-<span class="lineNum">    5087 </span>                :             {
-<span class="lineNum">    5088 </span><span class="lineCov">              1 :               *__result = *__first1;</span>
-<span class="lineNum">    5089 </span><span class="lineCov">              1 :               ++__first1;</span>
-<span class="lineNum">    5090 </span><span class="lineCov">              1 :               ++__first2;</span>
-<span class="lineNum">    5091 </span>                :             }
-<span class="lineNum">    5092 </span><span class="lineCov">              9 :           ++__result;</span>
-<span class="lineNum">    5093 </span>                :         }
-<span class="lineNum">    5094 </span>                :       return std::copy(__first2, __last2, std::copy(__first1, __last1,
-<span class="lineNum">    5095 </span><span class="lineCov">          21150 :                                                     __result));</span>
-<span class="lineNum">    5096 </span>                :     }
-<span class="lineNum">    5097 </span>                : 
-<span class="lineNum">    5098 </span>                :   /**
-<span class="lineNum">    5099 </span>                :    *  @brief Return the union of two sorted ranges using a comparison functor.
-<span class="lineNum">    5100 </span>                :    *  @param  first1  Start of first range.
-<span class="lineNum">    5101 </span>                :    *  @param  last1   End of first range.
-<span class="lineNum">    5102 </span>                :    *  @param  first2  Start of second range.
-<span class="lineNum">    5103 </span>                :    *  @param  last2   End of second range.
-<span class="lineNum">    5104 </span>                :    *  @param  comp    The comparison functor.
-<span class="lineNum">    5105 </span>                :    *  @return  End of the output range.
-<span class="lineNum">    5106 </span>                :    *  @ingroup setoperations
-<span class="lineNum">    5107 </span>                :    *
-<span class="lineNum">    5108 </span>                :    *  This operation iterates over both ranges, copying elements present in
-<span class="lineNum">    5109 </span>                :    *  each range in order to the output range.  Iterators increment for each
-<span class="lineNum">    5110 </span>                :    *  range.  When the current element of one range is less than the other
-<span class="lineNum">    5111 </span>                :    *  according to @a comp, that element is copied and the iterator advanced.
-<span class="lineNum">    5112 </span>                :    *  If an equivalent element according to @a comp is contained in both
-<span class="lineNum">    5113 </span>                :    *  ranges, the element from the first range is copied and both ranges
-<span class="lineNum">    5114 </span>                :    *  advance.  The output range may not overlap either input range.
-<span class="lineNum">    5115 </span>                :   */
-<span class="lineNum">    5116 </span>                :   template&lt;typename _InputIterator1, typename _InputIterator2,
-<span class="lineNum">    5117 </span>                :            typename _OutputIterator, typename _Compare&gt;
-<span class="lineNum">    5118 </span>                :     _OutputIterator
-<span class="lineNum">    5119 </span>                :     set_union(_InputIterator1 __first1, _InputIterator1 __last1,
-<span class="lineNum">    5120 </span>                :               _InputIterator2 __first2, _InputIterator2 __last2,
-<span class="lineNum">    5121 </span>                :               _OutputIterator __result, _Compare __comp)
-<span class="lineNum">    5122 </span>                :     {
-<span class="lineNum">    5123 </span>                :       typedef typename iterator_traits&lt;_InputIterator1&gt;::value_type
-<span class="lineNum">    5124 </span>                :         _ValueType1;
-<span class="lineNum">    5125 </span>                :       typedef typename iterator_traits&lt;_InputIterator2&gt;::value_type
-<span class="lineNum">    5126 </span>                :         _ValueType2;
-<span class="lineNum">    5127 </span>                : 
-<span class="lineNum">    5128 </span>                :       // concept requirements
-<span class="lineNum">    5129 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator1&gt;)
-<span class="lineNum">    5130 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator2&gt;)
-<span class="lineNum">    5131 </span>                :       __glibcxx_function_requires(_OutputIteratorConcept&lt;_OutputIterator,
-<span class="lineNum">    5132 </span>                :                                   _ValueType1&gt;)
-<span class="lineNum">    5133 </span>                :       __glibcxx_function_requires(_OutputIteratorConcept&lt;_OutputIterator,
-<span class="lineNum">    5134 </span>                :                                   _ValueType2&gt;)
-<span class="lineNum">    5135 </span>                :       __glibcxx_function_requires(_BinaryPredicateConcept&lt;_Compare,
-<span class="lineNum">    5136 </span>                :                                   _ValueType1, _ValueType2&gt;)
-<span class="lineNum">    5137 </span>                :       __glibcxx_function_requires(_BinaryPredicateConcept&lt;_Compare,
-<span class="lineNum">    5138 </span>                :                                   _ValueType2, _ValueType1&gt;)
-<span class="lineNum">    5139 </span>                :       __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp);
-<span class="lineNum">    5140 </span>                :       __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp);
-<span class="lineNum">    5141 </span>                : 
-<span class="lineNum">    5142 </span>                :       while (__first1 != __last1 &amp;&amp; __first2 != __last2)
-<span class="lineNum">    5143 </span>                :         {
-<span class="lineNum">    5144 </span>                :           if (__comp(*__first1, *__first2))
-<span class="lineNum">    5145 </span>                :             {
-<span class="lineNum">    5146 </span>                :               *__result = *__first1;
-<span class="lineNum">    5147 </span>                :               ++__first1;
-<span class="lineNum">    5148 </span>                :             }
-<span class="lineNum">    5149 </span>                :           else if (__comp(*__first2, *__first1))
-<span class="lineNum">    5150 </span>                :             {
-<span class="lineNum">    5151 </span>                :               *__result = *__first2;
-<span class="lineNum">    5152 </span>                :               ++__first2;
-<span class="lineNum">    5153 </span>                :             }
-<span class="lineNum">    5154 </span>                :           else
-<span class="lineNum">    5155 </span>                :             {
-<span class="lineNum">    5156 </span>                :               *__result = *__first1;
-<span class="lineNum">    5157 </span>                :               ++__first1;
-<span class="lineNum">    5158 </span>                :               ++__first2;
-<span class="lineNum">    5159 </span>                :             }
-<span class="lineNum">    5160 </span>                :           ++__result;
-<span class="lineNum">    5161 </span>                :         }
-<span class="lineNum">    5162 </span>                :       return std::copy(__first2, __last2, std::copy(__first1, __last1,
-<span class="lineNum">    5163 </span>                :                                                     __result));
-<span class="lineNum">    5164 </span>                :     }
-<span class="lineNum">    5165 </span>                : 
-<span class="lineNum">    5166 </span>                :   /**
-<span class="lineNum">    5167 </span>                :    *  @brief Return the intersection of two sorted ranges.
-<span class="lineNum">    5168 </span>                :    *  @param  first1  Start of first range.
-<span class="lineNum">    5169 </span>                :    *  @param  last1   End of first range.
-<span class="lineNum">    5170 </span>                :    *  @param  first2  Start of second range.
-<span class="lineNum">    5171 </span>                :    *  @param  last2   End of second range.
-<span class="lineNum">    5172 </span>                :    *  @return  End of the output range.
-<span class="lineNum">    5173 </span>                :    *  @ingroup setoperations
-<span class="lineNum">    5174 </span>                :    *
-<span class="lineNum">    5175 </span>                :    *  This operation iterates over both ranges, copying elements present in
-<span class="lineNum">    5176 </span>                :    *  both ranges in order to the output range.  Iterators increment for each
-<span class="lineNum">    5177 </span>                :    *  range.  When the current element of one range is less than the other,
-<span class="lineNum">    5178 </span>                :    *  that iterator advances.  If an element is contained in both ranges, the
-<span class="lineNum">    5179 </span>                :    *  element from the first range is copied and both ranges advance.  The
-<span class="lineNum">    5180 </span>                :    *  output range may not overlap either input range.
-<span class="lineNum">    5181 </span>                :   */
-<span class="lineNum">    5182 </span>                :   template&lt;typename _InputIterator1, typename _InputIterator2,
-<span class="lineNum">    5183 </span>                :            typename _OutputIterator&gt;
-<span class="lineNum">    5184 </span>                :     _OutputIterator
-<span class="lineNum">    5185 </span>                :     set_intersection(_InputIterator1 __first1, _InputIterator1 __last1,
-<span class="lineNum">    5186 </span>                :                      _InputIterator2 __first2, _InputIterator2 __last2,
-<span class="lineNum">    5187 </span><span class="lineCov">              2 :                      _OutputIterator __result)</span>
-<span class="lineNum">    5188 </span>                :     {
-<span class="lineNum">    5189 </span>                :       typedef typename iterator_traits&lt;_InputIterator1&gt;::value_type
-<span class="lineNum">    5190 </span>                :         _ValueType1;
-<span class="lineNum">    5191 </span>                :       typedef typename iterator_traits&lt;_InputIterator2&gt;::value_type
-<span class="lineNum">    5192 </span>                :         _ValueType2;
-<span class="lineNum">    5193 </span>                : 
-<span class="lineNum">    5194 </span>                :       // concept requirements
-<span class="lineNum">    5195 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator1&gt;)
-<span class="lineNum">    5196 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator2&gt;)
-<span class="lineNum">    5197 </span>                :       __glibcxx_function_requires(_OutputIteratorConcept&lt;_OutputIterator,
-<span class="lineNum">    5198 </span>                :                                   _ValueType1&gt;)
-<span class="lineNum">    5199 </span>                :       __glibcxx_function_requires(_LessThanOpConcept&lt;_ValueType1, _ValueType2&gt;)
-<span class="lineNum">    5200 </span>                :       __glibcxx_function_requires(_LessThanOpConcept&lt;_ValueType2, _ValueType1&gt;)
-<span class="lineNum">    5201 </span>                :       __glibcxx_requires_sorted_set(__first1, __last1, __first2);
-<span class="lineNum">    5202 </span>                :       __glibcxx_requires_sorted_set(__first2, __last2, __first1);
-<span class="lineNum">    5203 </span>                : 
-<span class="lineNum">    5204 </span><span class="lineCov">              8 :       while (__first1 != __last1 &amp;&amp; __first2 != __last2)</span>
-<span class="lineNum">    5205 </span><span class="lineCov">              4 :         if (*__first1 &lt; *__first2)</span>
-<span class="lineNum">    5206 </span><span class="lineCov">              1 :           ++__first1;</span>
-<span class="lineNum">    5207 </span><span class="lineCov">              3 :         else if (*__first2 &lt; *__first1)</span>
-<span class="lineNum">    5208 </span><span class="lineCov">              1 :           ++__first2;</span>
-<span class="lineNum">    5209 </span>                :         else
-<span class="lineNum">    5210 </span>                :           {
-<span class="lineNum">    5211 </span><span class="lineCov">              2 :             *__result = *__first1;</span>
-<span class="lineNum">    5212 </span><span class="lineCov">              2 :             ++__first1;</span>
-<span class="lineNum">    5213 </span><span class="lineCov">              2 :             ++__first2;</span>
-<span class="lineNum">    5214 </span><span class="lineCov">              2 :             ++__result;</span>
-<span class="lineNum">    5215 </span>                :           }
-<span class="lineNum">    5216 </span><span class="lineCov">              2 :       return __result;</span>
-<span class="lineNum">    5217 </span>                :     }
-<span class="lineNum">    5218 </span>                : 
-<span class="lineNum">    5219 </span>                :   /**
-<span class="lineNum">    5220 </span>                :    *  @brief Return the intersection of two sorted ranges using comparison
-<span class="lineNum">    5221 </span>                :    *  functor.
-<span class="lineNum">    5222 </span>                :    *  @param  first1  Start of first range.
-<span class="lineNum">    5223 </span>                :    *  @param  last1   End of first range.
-<span class="lineNum">    5224 </span>                :    *  @param  first2  Start of second range.
-<span class="lineNum">    5225 </span>                :    *  @param  last2   End of second range.
-<span class="lineNum">    5226 </span>                :    *  @param  comp    The comparison functor.
-<span class="lineNum">    5227 </span>                :    *  @return  End of the output range.
-<span class="lineNum">    5228 </span>                :    *  @ingroup setoperations
-<span class="lineNum">    5229 </span>                :    *
-<span class="lineNum">    5230 </span>                :    *  This operation iterates over both ranges, copying elements present in
-<span class="lineNum">    5231 </span>                :    *  both ranges in order to the output range.  Iterators increment for each
-<span class="lineNum">    5232 </span>                :    *  range.  When the current element of one range is less than the other
-<span class="lineNum">    5233 </span>                :    *  according to @a comp, that iterator advances.  If an element is
-<span class="lineNum">    5234 </span>                :    *  contained in both ranges according to @a comp, the element from the
-<span class="lineNum">    5235 </span>                :    *  first range is copied and both ranges advance.  The output range may not
-<span class="lineNum">    5236 </span>                :    *  overlap either input range.
-<span class="lineNum">    5237 </span>                :   */
-<span class="lineNum">    5238 </span>                :   template&lt;typename _InputIterator1, typename _InputIterator2,
-<span class="lineNum">    5239 </span>                :            typename _OutputIterator, typename _Compare&gt;
-<span class="lineNum">    5240 </span>                :     _OutputIterator
-<span class="lineNum">    5241 </span>                :     set_intersection(_InputIterator1 __first1, _InputIterator1 __last1,
-<span class="lineNum">    5242 </span>                :                      _InputIterator2 __first2, _InputIterator2 __last2,
-<span class="lineNum">    5243 </span>                :                      _OutputIterator __result, _Compare __comp)
-<span class="lineNum">    5244 </span>                :     {
-<span class="lineNum">    5245 </span>                :       typedef typename iterator_traits&lt;_InputIterator1&gt;::value_type
-<span class="lineNum">    5246 </span>                :         _ValueType1;
-<span class="lineNum">    5247 </span>                :       typedef typename iterator_traits&lt;_InputIterator2&gt;::value_type
-<span class="lineNum">    5248 </span>                :         _ValueType2;
-<span class="lineNum">    5249 </span>                : 
-<span class="lineNum">    5250 </span>                :       // concept requirements
-<span class="lineNum">    5251 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator1&gt;)
-<span class="lineNum">    5252 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator2&gt;)
-<span class="lineNum">    5253 </span>                :       __glibcxx_function_requires(_OutputIteratorConcept&lt;_OutputIterator,
-<span class="lineNum">    5254 </span>                :                                   _ValueType1&gt;)
-<span class="lineNum">    5255 </span>                :       __glibcxx_function_requires(_BinaryPredicateConcept&lt;_Compare,
-<span class="lineNum">    5256 </span>                :                                   _ValueType1, _ValueType2&gt;)
-<span class="lineNum">    5257 </span>                :       __glibcxx_function_requires(_BinaryPredicateConcept&lt;_Compare,
-<span class="lineNum">    5258 </span>                :                                   _ValueType2, _ValueType1&gt;)
-<span class="lineNum">    5259 </span>                :       __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp);
-<span class="lineNum">    5260 </span>                :       __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp);
-<span class="lineNum">    5261 </span>                : 
-<span class="lineNum">    5262 </span>                :       while (__first1 != __last1 &amp;&amp; __first2 != __last2)
-<span class="lineNum">    5263 </span>                :         if (__comp(*__first1, *__first2))
-<span class="lineNum">    5264 </span>                :           ++__first1;
-<span class="lineNum">    5265 </span>                :         else if (__comp(*__first2, *__first1))
-<span class="lineNum">    5266 </span>                :           ++__first2;
-<span class="lineNum">    5267 </span>                :         else
-<span class="lineNum">    5268 </span>                :           {
-<span class="lineNum">    5269 </span>                :             *__result = *__first1;
-<span class="lineNum">    5270 </span>                :             ++__first1;
-<span class="lineNum">    5271 </span>                :             ++__first2;
-<span class="lineNum">    5272 </span>                :             ++__result;
-<span class="lineNum">    5273 </span>                :           }
-<span class="lineNum">    5274 </span>                :       return __result;
-<span class="lineNum">    5275 </span>                :     }
-<span class="lineNum">    5276 </span>                : 
-<span class="lineNum">    5277 </span>                :   /**
-<span class="lineNum">    5278 </span>                :    *  @brief Return the difference of two sorted ranges.
-<span class="lineNum">    5279 </span>                :    *  @param  first1  Start of first range.
-<span class="lineNum">    5280 </span>                :    *  @param  last1   End of first range.
-<span class="lineNum">    5281 </span>                :    *  @param  first2  Start of second range.
-<span class="lineNum">    5282 </span>                :    *  @param  last2   End of second range.
-<span class="lineNum">    5283 </span>                :    *  @return  End of the output range.
-<span class="lineNum">    5284 </span>                :    *  @ingroup setoperations
-<span class="lineNum">    5285 </span>                :    *
-<span class="lineNum">    5286 </span>                :    *  This operation iterates over both ranges, copying elements present in
-<span class="lineNum">    5287 </span>                :    *  the first range but not the second in order to the output range.
-<span class="lineNum">    5288 </span>                :    *  Iterators increment for each range.  When the current element of the
-<span class="lineNum">    5289 </span>                :    *  first range is less than the second, that element is copied and the
-<span class="lineNum">    5290 </span>                :    *  iterator advances.  If the current element of the second range is less,
-<span class="lineNum">    5291 </span>                :    *  the iterator advances, but no element is copied.  If an element is
-<span class="lineNum">    5292 </span>                :    *  contained in both ranges, no elements are copied and both ranges
-<span class="lineNum">    5293 </span>                :    *  advance.  The output range may not overlap either input range.
-<span class="lineNum">    5294 </span>                :   */
-<span class="lineNum">    5295 </span>                :   template&lt;typename _InputIterator1, typename _InputIterator2,
-<span class="lineNum">    5296 </span>                :            typename _OutputIterator&gt;
-<span class="lineNum">    5297 </span>                :     _OutputIterator
-<span class="lineNum">    5298 </span>                :     set_difference(_InputIterator1 __first1, _InputIterator1 __last1,
-<span class="lineNum">    5299 </span>                :                    _InputIterator2 __first2, _InputIterator2 __last2,
-<span class="lineNum">    5300 </span><span class="lineCov">             10 :                    _OutputIterator __result)</span>
-<span class="lineNum">    5301 </span>                :     {
-<span class="lineNum">    5302 </span>                :       typedef typename iterator_traits&lt;_InputIterator1&gt;::value_type
-<span class="lineNum">    5303 </span>                :         _ValueType1;
-<span class="lineNum">    5304 </span>                :       typedef typename iterator_traits&lt;_InputIterator2&gt;::value_type
-<span class="lineNum">    5305 </span>                :         _ValueType2;
-<span class="lineNum">    5306 </span>                : 
-<span class="lineNum">    5307 </span>                :       // concept requirements
-<span class="lineNum">    5308 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator1&gt;)
-<span class="lineNum">    5309 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator2&gt;)
-<span class="lineNum">    5310 </span>                :       __glibcxx_function_requires(_OutputIteratorConcept&lt;_OutputIterator,
-<span class="lineNum">    5311 </span>                :                                   _ValueType1&gt;)
-<span class="lineNum">    5312 </span>                :       __glibcxx_function_requires(_LessThanOpConcept&lt;_ValueType1, _ValueType2&gt;)
-<span class="lineNum">    5313 </span>                :       __glibcxx_function_requires(_LessThanOpConcept&lt;_ValueType2, _ValueType1&gt;)   
-<span class="lineNum">    5314 </span>                :       __glibcxx_requires_sorted_set(__first1, __last1, __first2);
-<span class="lineNum">    5315 </span>                :       __glibcxx_requires_sorted_set(__first2, __last2, __first1);
-<span class="lineNum">    5316 </span>                : 
-<span class="lineNum">    5317 </span><span class="lineCov">             22 :       while (__first1 != __last1 &amp;&amp; __first2 != __last2)</span>
-<span class="lineNum">    5318 </span><span class="lineCov">              2 :         if (*__first1 &lt; *__first2)</span>
-<span class="lineNum">    5319 </span>                :           {
-<span class="lineNum">    5320 </span><span class="lineCov">              1 :             *__result = *__first1;</span>
-<span class="lineNum">    5321 </span><span class="lineCov">              1 :             ++__first1;</span>
-<span class="lineNum">    5322 </span><span class="lineCov">              1 :             ++__result;</span>
-<span class="lineNum">    5323 </span>                :           }
-<span class="lineNum">    5324 </span><span class="lineCov">              1 :         else if (*__first2 &lt; *__first1)</span>
-<span class="lineNum">    5325 </span><span class="lineNoCov">              0 :           ++__first2;</span>
-<span class="lineNum">    5326 </span>                :         else
-<span class="lineNum">    5327 </span>                :           {
-<span class="lineNum">    5328 </span><span class="lineCov">              1 :             ++__first1;</span>
-<span class="lineNum">    5329 </span><span class="lineCov">              1 :             ++__first2;</span>
-<span class="lineNum">    5330 </span>                :           }
-<span class="lineNum">    5331 </span><span class="lineCov">             10 :       return std::copy(__first1, __last1, __result);</span>
-<span class="lineNum">    5332 </span>                :     }
-<span class="lineNum">    5333 </span>                : 
-<span class="lineNum">    5334 </span>                :   /**
-<span class="lineNum">    5335 </span>                :    *  @brief  Return the difference of two sorted ranges using comparison
-<span class="lineNum">    5336 </span>                :    *  functor.
-<span class="lineNum">    5337 </span>                :    *  @param  first1  Start of first range.
-<span class="lineNum">    5338 </span>                :    *  @param  last1   End of first range.
-<span class="lineNum">    5339 </span>                :    *  @param  first2  Start of second range.
-<span class="lineNum">    5340 </span>                :    *  @param  last2   End of second range.
-<span class="lineNum">    5341 </span>                :    *  @param  comp    The comparison functor.
-<span class="lineNum">    5342 </span>                :    *  @return  End of the output range.
-<span class="lineNum">    5343 </span>                :    *  @ingroup setoperations
-<span class="lineNum">    5344 </span>                :    *
-<span class="lineNum">    5345 </span>                :    *  This operation iterates over both ranges, copying elements present in
-<span class="lineNum">    5346 </span>                :    *  the first range but not the second in order to the output range.
-<span class="lineNum">    5347 </span>                :    *  Iterators increment for each range.  When the current element of the
-<span class="lineNum">    5348 </span>                :    *  first range is less than the second according to @a comp, that element
-<span class="lineNum">    5349 </span>                :    *  is copied and the iterator advances.  If the current element of the
-<span class="lineNum">    5350 </span>                :    *  second range is less, no element is copied and the iterator advances.
-<span class="lineNum">    5351 </span>                :    *  If an element is contained in both ranges according to @a comp, no
-<span class="lineNum">    5352 </span>                :    *  elements are copied and both ranges advance.  The output range may not
-<span class="lineNum">    5353 </span>                :    *  overlap either input range.
-<span class="lineNum">    5354 </span>                :   */
-<span class="lineNum">    5355 </span>                :   template&lt;typename _InputIterator1, typename _InputIterator2,
-<span class="lineNum">    5356 </span>                :            typename _OutputIterator, typename _Compare&gt;
-<span class="lineNum">    5357 </span>                :     _OutputIterator
-<span class="lineNum">    5358 </span>                :     set_difference(_InputIterator1 __first1, _InputIterator1 __last1,
-<span class="lineNum">    5359 </span>                :                    _InputIterator2 __first2, _InputIterator2 __last2,
-<span class="lineNum">    5360 </span>                :                    _OutputIterator __result, _Compare __comp)
-<span class="lineNum">    5361 </span>                :     {
-<span class="lineNum">    5362 </span>                :       typedef typename iterator_traits&lt;_InputIterator1&gt;::value_type
-<span class="lineNum">    5363 </span>                :         _ValueType1;
-<span class="lineNum">    5364 </span>                :       typedef typename iterator_traits&lt;_InputIterator2&gt;::value_type
-<span class="lineNum">    5365 </span>                :         _ValueType2;
-<span class="lineNum">    5366 </span>                : 
-<span class="lineNum">    5367 </span>                :       // concept requirements
-<span class="lineNum">    5368 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator1&gt;)
-<span class="lineNum">    5369 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator2&gt;)
-<span class="lineNum">    5370 </span>                :       __glibcxx_function_requires(_OutputIteratorConcept&lt;_OutputIterator,
-<span class="lineNum">    5371 </span>                :                                   _ValueType1&gt;)
-<span class="lineNum">    5372 </span>                :       __glibcxx_function_requires(_BinaryPredicateConcept&lt;_Compare,
-<span class="lineNum">    5373 </span>                :                                   _ValueType1, _ValueType2&gt;)
-<span class="lineNum">    5374 </span>                :       __glibcxx_function_requires(_BinaryPredicateConcept&lt;_Compare,
-<span class="lineNum">    5375 </span>                :                                   _ValueType2, _ValueType1&gt;)
-<span class="lineNum">    5376 </span>                :       __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp);
-<span class="lineNum">    5377 </span>                :       __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp);
-<span class="lineNum">    5378 </span>                : 
-<span class="lineNum">    5379 </span>                :       while (__first1 != __last1 &amp;&amp; __first2 != __last2)
-<span class="lineNum">    5380 </span>                :         if (__comp(*__first1, *__first2))
-<span class="lineNum">    5381 </span>                :           {
-<span class="lineNum">    5382 </span>                :             *__result = *__first1;
-<span class="lineNum">    5383 </span>                :             ++__first1;
-<span class="lineNum">    5384 </span>                :             ++__result;
-<span class="lineNum">    5385 </span>                :           }
-<span class="lineNum">    5386 </span>                :         else if (__comp(*__first2, *__first1))
-<span class="lineNum">    5387 </span>                :           ++__first2;
-<span class="lineNum">    5388 </span>                :         else
-<span class="lineNum">    5389 </span>                :           {
-<span class="lineNum">    5390 </span>                :             ++__first1;
-<span class="lineNum">    5391 </span>                :             ++__first2;
-<span class="lineNum">    5392 </span>                :           }
-<span class="lineNum">    5393 </span>                :       return std::copy(__first1, __last1, __result);
-<span class="lineNum">    5394 </span>                :     }
-<span class="lineNum">    5395 </span>                : 
-<span class="lineNum">    5396 </span>                :   /**
-<span class="lineNum">    5397 </span>                :    *  @brief  Return the symmetric difference of two sorted ranges.
-<span class="lineNum">    5398 </span>                :    *  @param  first1  Start of first range.
-<span class="lineNum">    5399 </span>                :    *  @param  last1   End of first range.
-<span class="lineNum">    5400 </span>                :    *  @param  first2  Start of second range.
-<span class="lineNum">    5401 </span>                :    *  @param  last2   End of second range.
-<span class="lineNum">    5402 </span>                :    *  @return  End of the output range.
-<span class="lineNum">    5403 </span>                :    *  @ingroup setoperations
-<span class="lineNum">    5404 </span>                :    *
-<span class="lineNum">    5405 </span>                :    *  This operation iterates over both ranges, copying elements present in
-<span class="lineNum">    5406 </span>                :    *  one range but not the other in order to the output range.  Iterators
-<span class="lineNum">    5407 </span>                :    *  increment for each range.  When the current element of one range is less
-<span class="lineNum">    5408 </span>                :    *  than the other, that element is copied and the iterator advances.  If an
-<span class="lineNum">    5409 </span>                :    *  element is contained in both ranges, no elements are copied and both
-<span class="lineNum">    5410 </span>                :    *  ranges advance.  The output range may not overlap either input range.
-<span class="lineNum">    5411 </span>                :   */
-<span class="lineNum">    5412 </span>                :   template&lt;typename _InputIterator1, typename _InputIterator2,
-<span class="lineNum">    5413 </span>                :            typename _OutputIterator&gt;
-<span class="lineNum">    5414 </span>                :     _OutputIterator
-<span class="lineNum">    5415 </span>                :     set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1,
-<span class="lineNum">    5416 </span>                :                              _InputIterator2 __first2, _InputIterator2 __last2,
-<span class="lineNum">    5417 </span>                :                              _OutputIterator __result)
-<span class="lineNum">    5418 </span>                :     {
-<span class="lineNum">    5419 </span>                :       typedef typename iterator_traits&lt;_InputIterator1&gt;::value_type
-<span class="lineNum">    5420 </span>                :         _ValueType1;
-<span class="lineNum">    5421 </span>                :       typedef typename iterator_traits&lt;_InputIterator2&gt;::value_type
-<span class="lineNum">    5422 </span>                :         _ValueType2;
-<span class="lineNum">    5423 </span>                : 
-<span class="lineNum">    5424 </span>                :       // concept requirements
-<span class="lineNum">    5425 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator1&gt;)
-<span class="lineNum">    5426 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator2&gt;)
-<span class="lineNum">    5427 </span>                :       __glibcxx_function_requires(_OutputIteratorConcept&lt;_OutputIterator,
-<span class="lineNum">    5428 </span>                :                                   _ValueType1&gt;)
-<span class="lineNum">    5429 </span>                :       __glibcxx_function_requires(_OutputIteratorConcept&lt;_OutputIterator,
-<span class="lineNum">    5430 </span>                :                                   _ValueType2&gt;)
-<span class="lineNum">    5431 </span>                :       __glibcxx_function_requires(_LessThanOpConcept&lt;_ValueType1, _ValueType2&gt;)
-<span class="lineNum">    5432 </span>                :       __glibcxx_function_requires(_LessThanOpConcept&lt;_ValueType2, _ValueType1&gt;)   
-<span class="lineNum">    5433 </span>                :       __glibcxx_requires_sorted_set(__first1, __last1, __first2);
-<span class="lineNum">    5434 </span>                :       __glibcxx_requires_sorted_set(__first2, __last2, __first1);
-<span class="lineNum">    5435 </span>                : 
-<span class="lineNum">    5436 </span>                :       while (__first1 != __last1 &amp;&amp; __first2 != __last2)
-<span class="lineNum">    5437 </span>                :         if (*__first1 &lt; *__first2)
-<span class="lineNum">    5438 </span>                :           {
-<span class="lineNum">    5439 </span>                :             *__result = *__first1;
-<span class="lineNum">    5440 </span>                :             ++__first1;
-<span class="lineNum">    5441 </span>                :             ++__result;
-<span class="lineNum">    5442 </span>                :           }
-<span class="lineNum">    5443 </span>                :         else if (*__first2 &lt; *__first1)
-<span class="lineNum">    5444 </span>                :           {
-<span class="lineNum">    5445 </span>                :             *__result = *__first2;
-<span class="lineNum">    5446 </span>                :             ++__first2;
-<span class="lineNum">    5447 </span>                :             ++__result;
-<span class="lineNum">    5448 </span>                :           }
-<span class="lineNum">    5449 </span>                :         else
-<span class="lineNum">    5450 </span>                :           {
-<span class="lineNum">    5451 </span>                :             ++__first1;
-<span class="lineNum">    5452 </span>                :             ++__first2;
-<span class="lineNum">    5453 </span>                :           }
-<span class="lineNum">    5454 </span>                :       return std::copy(__first2, __last2, std::copy(__first1,
-<span class="lineNum">    5455 </span>                :                                                     __last1, __result));
-<span class="lineNum">    5456 </span>                :     }
-<span class="lineNum">    5457 </span>                : 
-<span class="lineNum">    5458 </span>                :   /**
-<span class="lineNum">    5459 </span>                :    *  @brief  Return the symmetric difference of two sorted ranges using
-<span class="lineNum">    5460 </span>                :    *  comparison functor.
-<span class="lineNum">    5461 </span>                :    *  @param  first1  Start of first range.
-<span class="lineNum">    5462 </span>                :    *  @param  last1   End of first range.
-<span class="lineNum">    5463 </span>                :    *  @param  first2  Start of second range.
-<span class="lineNum">    5464 </span>                :    *  @param  last2   End of second range.
-<span class="lineNum">    5465 </span>                :    *  @param  comp    The comparison functor.
-<span class="lineNum">    5466 </span>                :    *  @return  End of the output range.
-<span class="lineNum">    5467 </span>                :    *  @ingroup setoperations
-<span class="lineNum">    5468 </span>                :    *
-<span class="lineNum">    5469 </span>                :    *  This operation iterates over both ranges, copying elements present in
-<span class="lineNum">    5470 </span>                :    *  one range but not the other in order to the output range.  Iterators
-<span class="lineNum">    5471 </span>                :    *  increment for each range.  When the current element of one range is less
-<span class="lineNum">    5472 </span>                :    *  than the other according to @a comp, that element is copied and the
-<span class="lineNum">    5473 </span>                :    *  iterator advances.  If an element is contained in both ranges according
-<span class="lineNum">    5474 </span>                :    *  to @a comp, no elements are copied and both ranges advance.  The output
-<span class="lineNum">    5475 </span>                :    *  range may not overlap either input range.
-<span class="lineNum">    5476 </span>                :   */
-<span class="lineNum">    5477 </span>                :   template&lt;typename _InputIterator1, typename _InputIterator2,
-<span class="lineNum">    5478 </span>                :            typename _OutputIterator, typename _Compare&gt;
-<span class="lineNum">    5479 </span>                :     _OutputIterator
-<span class="lineNum">    5480 </span>                :     set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1,
-<span class="lineNum">    5481 </span>                :                              _InputIterator2 __first2, _InputIterator2 __last2,
-<span class="lineNum">    5482 </span>                :                              _OutputIterator __result,
-<span class="lineNum">    5483 </span>                :                              _Compare __comp)
-<span class="lineNum">    5484 </span>                :     {
-<span class="lineNum">    5485 </span>                :       typedef typename iterator_traits&lt;_InputIterator1&gt;::value_type
-<span class="lineNum">    5486 </span>                :         _ValueType1;
-<span class="lineNum">    5487 </span>                :       typedef typename iterator_traits&lt;_InputIterator2&gt;::value_type
-<span class="lineNum">    5488 </span>                :         _ValueType2;
-<span class="lineNum">    5489 </span>                : 
-<span class="lineNum">    5490 </span>                :       // concept requirements
-<span class="lineNum">    5491 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator1&gt;)
-<span class="lineNum">    5492 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator2&gt;)
-<span class="lineNum">    5493 </span>                :       __glibcxx_function_requires(_OutputIteratorConcept&lt;_OutputIterator,
-<span class="lineNum">    5494 </span>                :                                   _ValueType1&gt;)
-<span class="lineNum">    5495 </span>                :       __glibcxx_function_requires(_OutputIteratorConcept&lt;_OutputIterator,
-<span class="lineNum">    5496 </span>                :                                   _ValueType2&gt;)
-<span class="lineNum">    5497 </span>                :       __glibcxx_function_requires(_BinaryPredicateConcept&lt;_Compare,
-<span class="lineNum">    5498 </span>                :                                   _ValueType1, _ValueType2&gt;)
-<span class="lineNum">    5499 </span>                :       __glibcxx_function_requires(_BinaryPredicateConcept&lt;_Compare,
-<span class="lineNum">    5500 </span>                :                                   _ValueType2, _ValueType1&gt;)
-<span class="lineNum">    5501 </span>                :       __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp);
-<span class="lineNum">    5502 </span>                :       __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp);
-<span class="lineNum">    5503 </span>                : 
-<span class="lineNum">    5504 </span>                :       while (__first1 != __last1 &amp;&amp; __first2 != __last2)
-<span class="lineNum">    5505 </span>                :         if (__comp(*__first1, *__first2))
-<span class="lineNum">    5506 </span>                :           {
-<span class="lineNum">    5507 </span>                :             *__result = *__first1;
-<span class="lineNum">    5508 </span>                :             ++__first1;
-<span class="lineNum">    5509 </span>                :             ++__result;
-<span class="lineNum">    5510 </span>                :           }
-<span class="lineNum">    5511 </span>                :         else if (__comp(*__first2, *__first1))
-<span class="lineNum">    5512 </span>                :           {
-<span class="lineNum">    5513 </span>                :             *__result = *__first2;
-<span class="lineNum">    5514 </span>                :             ++__first2;
-<span class="lineNum">    5515 </span>                :             ++__result;
-<span class="lineNum">    5516 </span>                :           }
-<span class="lineNum">    5517 </span>                :         else
-<span class="lineNum">    5518 </span>                :           {
-<span class="lineNum">    5519 </span>                :             ++__first1;
-<span class="lineNum">    5520 </span>                :             ++__first2;
-<span class="lineNum">    5521 </span>                :           }
-<span class="lineNum">    5522 </span>                :       return std::copy(__first2, __last2, 
-<span class="lineNum">    5523 </span>                :                        std::copy(__first1, __last1, __result));
-<span class="lineNum">    5524 </span>                :     }
-<span class="lineNum">    5525 </span>                : 
-<span class="lineNum">    5526 </span>                : 
-<span class="lineNum">    5527 </span>                :   /**
-<span class="lineNum">    5528 </span>                :    *  @brief  Return the minimum element in a range.
-<span class="lineNum">    5529 </span>                :    *  @param  first  Start of range.
-<span class="lineNum">    5530 </span>                :    *  @param  last   End of range.
-<span class="lineNum">    5531 </span>                :    *  @return  Iterator referencing the first instance of the smallest value.
-<span class="lineNum">    5532 </span>                :   */
-<span class="lineNum">    5533 </span>                :   template&lt;typename _ForwardIterator&gt;
-<span class="lineNum">    5534 </span>                :     _ForwardIterator
-<span class="lineNum">    5535 </span>                :     min_element(_ForwardIterator __first, _ForwardIterator __last)
-<span class="lineNum">    5536 </span>                :     {
-<span class="lineNum">    5537 </span>                :       // concept requirements
-<span class="lineNum">    5538 </span>                :       __glibcxx_function_requires(_ForwardIteratorConcept&lt;_ForwardIterator&gt;)
-<span class="lineNum">    5539 </span>                :       __glibcxx_function_requires(_LessThanComparableConcept&lt;
-<span class="lineNum">    5540 </span>                :             typename iterator_traits&lt;_ForwardIterator&gt;::value_type&gt;)
-<span class="lineNum">    5541 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    5542 </span>                : 
-<span class="lineNum">    5543 </span>                :       if (__first == __last)
-<span class="lineNum">    5544 </span>                :         return __first;
-<span class="lineNum">    5545 </span>                :       _ForwardIterator __result = __first;
-<span class="lineNum">    5546 </span>                :       while (++__first != __last)
-<span class="lineNum">    5547 </span>                :         if (*__first &lt; *__result)
-<span class="lineNum">    5548 </span>                :           __result = __first;
-<span class="lineNum">    5549 </span>                :       return __result;
-<span class="lineNum">    5550 </span>                :     }
-<span class="lineNum">    5551 </span>                : 
-<span class="lineNum">    5552 </span>                :   /**
-<span class="lineNum">    5553 </span>                :    *  @brief  Return the minimum element in a range using comparison functor.
-<span class="lineNum">    5554 </span>                :    *  @param  first  Start of range.
-<span class="lineNum">    5555 </span>                :    *  @param  last   End of range.
-<span class="lineNum">    5556 </span>                :    *  @param  comp   Comparison functor.
-<span class="lineNum">    5557 </span>                :    *  @return  Iterator referencing the first instance of the smallest value
-<span class="lineNum">    5558 </span>                :    *  according to comp.
-<span class="lineNum">    5559 </span>                :   */
-<span class="lineNum">    5560 </span>                :   template&lt;typename _ForwardIterator, typename _Compare&gt;
-<span class="lineNum">    5561 </span>                :     _ForwardIterator
-<span class="lineNum">    5562 </span>                :     min_element(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">    5563 </span>                :                 _Compare __comp)
-<span class="lineNum">    5564 </span>                :     {
-<span class="lineNum">    5565 </span>                :       // concept requirements
-<span class="lineNum">    5566 </span>                :       __glibcxx_function_requires(_ForwardIteratorConcept&lt;_ForwardIterator&gt;)
-<span class="lineNum">    5567 </span>                :       __glibcxx_function_requires(_BinaryPredicateConcept&lt;_Compare,
-<span class="lineNum">    5568 </span>                :             typename iterator_traits&lt;_ForwardIterator&gt;::value_type,
-<span class="lineNum">    5569 </span>                :             typename iterator_traits&lt;_ForwardIterator&gt;::value_type&gt;)
-<span class="lineNum">    5570 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    5571 </span>                : 
-<span class="lineNum">    5572 </span>                :       if (__first == __last)
-<span class="lineNum">    5573 </span>                :         return __first;
-<span class="lineNum">    5574 </span>                :       _ForwardIterator __result = __first;
-<span class="lineNum">    5575 </span>                :       while (++__first != __last)
-<span class="lineNum">    5576 </span>                :         if (__comp(*__first, *__result))
-<span class="lineNum">    5577 </span>                :           __result = __first;
-<span class="lineNum">    5578 </span>                :       return __result;
-<span class="lineNum">    5579 </span>                :     }
-<span class="lineNum">    5580 </span>                : 
-<span class="lineNum">    5581 </span>                :   /**
-<span class="lineNum">    5582 </span>                :    *  @brief  Return the maximum element in a range.
-<span class="lineNum">    5583 </span>                :    *  @param  first  Start of range.
-<span class="lineNum">    5584 </span>                :    *  @param  last   End of range.
-<span class="lineNum">    5585 </span>                :    *  @return  Iterator referencing the first instance of the largest value.
-<span class="lineNum">    5586 </span>                :   */
-<span class="lineNum">    5587 </span>                :   template&lt;typename _ForwardIterator&gt;
-<span class="lineNum">    5588 </span>                :     _ForwardIterator
-<span class="lineNum">    5589 </span>                :     max_element(_ForwardIterator __first, _ForwardIterator __last)
-<span class="lineNum">    5590 </span>                :     {
-<span class="lineNum">    5591 </span>                :       // concept requirements
-<span class="lineNum">    5592 </span>                :       __glibcxx_function_requires(_ForwardIteratorConcept&lt;_ForwardIterator&gt;)
-<span class="lineNum">    5593 </span>                :       __glibcxx_function_requires(_LessThanComparableConcept&lt;
-<span class="lineNum">    5594 </span>                :             typename iterator_traits&lt;_ForwardIterator&gt;::value_type&gt;)
-<span class="lineNum">    5595 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    5596 </span>                : 
-<span class="lineNum">    5597 </span>                :       if (__first == __last)
-<span class="lineNum">    5598 </span>                :         return __first;
-<span class="lineNum">    5599 </span>                :       _ForwardIterator __result = __first;
-<span class="lineNum">    5600 </span>                :       while (++__first != __last)
-<span class="lineNum">    5601 </span>                :         if (*__result &lt; *__first)
-<span class="lineNum">    5602 </span>                :           __result = __first;
-<span class="lineNum">    5603 </span>                :       return __result;
-<span class="lineNum">    5604 </span>                :     }
-<span class="lineNum">    5605 </span>                : 
-<span class="lineNum">    5606 </span>                :   /**
-<span class="lineNum">    5607 </span>                :    *  @brief  Return the maximum element in a range using comparison functor.
-<span class="lineNum">    5608 </span>                :    *  @param  first  Start of range.
-<span class="lineNum">    5609 </span>                :    *  @param  last   End of range.
-<span class="lineNum">    5610 </span>                :    *  @param  comp   Comparison functor.
-<span class="lineNum">    5611 </span>                :    *  @return  Iterator referencing the first instance of the largest value
-<span class="lineNum">    5612 </span>                :    *  according to comp.
-<span class="lineNum">    5613 </span>                :   */
-<span class="lineNum">    5614 </span>                :   template&lt;typename _ForwardIterator, typename _Compare&gt;
-<span class="lineNum">    5615 </span>                :     _ForwardIterator
-<span class="lineNum">    5616 </span>                :     max_element(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">    5617 </span>                :                 _Compare __comp)
-<span class="lineNum">    5618 </span>                :     {
-<span class="lineNum">    5619 </span>                :       // concept requirements
-<span class="lineNum">    5620 </span>                :       __glibcxx_function_requires(_ForwardIteratorConcept&lt;_ForwardIterator&gt;)
-<span class="lineNum">    5621 </span>                :       __glibcxx_function_requires(_BinaryPredicateConcept&lt;_Compare,
-<span class="lineNum">    5622 </span>                :             typename iterator_traits&lt;_ForwardIterator&gt;::value_type,
-<span class="lineNum">    5623 </span>                :             typename iterator_traits&lt;_ForwardIterator&gt;::value_type&gt;)
-<span class="lineNum">    5624 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">    5625 </span>                : 
-<span class="lineNum">    5626 </span>                :       if (__first == __last) return __first;
-<span class="lineNum">    5627 </span>                :       _ForwardIterator __result = __first;
-<span class="lineNum">    5628 </span>                :       while (++__first != __last)
-<span class="lineNum">    5629 </span>                :         if (__comp(*__result, *__first))
-<span class="lineNum">    5630 </span>                :           __result = __first;
-<span class="lineNum">    5631 </span>                :       return __result;
-<span class="lineNum">    5632 </span>                :     }
-<span class="lineNum">    5633 </span>                : 
-<span class="lineNum">    5634 </span>                : _GLIBCXX_END_NESTED_NAMESPACE
-<span class="lineNum">    5635 </span>                : 
-<span class="lineNum">    5636 </span>                : #endif /* _STL_ALGO_H */
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/bits/stl_algobase.h.gcov.html b/rep/usr/include/c++/4.3/bits/stl_algobase.h.gcov.html
deleted file mode 100644
index 3535447..0000000
--- a/rep/usr/include/c++/4.3/bits/stl_algobase.h.gcov.html
+++ /dev/null
@@ -1,1207 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_algobase.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_algobase.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">79</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">91.1 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">72</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // Core algorithmic facilities -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
-<span class="lineNum">       4 </span>                : // Free Software Foundation, Inc.
-<span class="lineNum">       5 </span>                : //
-<span class="lineNum">       6 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       7 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       8 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">       9 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      10 </span>                : // any later version.
-<span class="lineNum">      11 </span>                : 
-<span class="lineNum">      12 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      13 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      14 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      15 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      16 </span>                : 
-<span class="lineNum">      17 </span>                : // You should have received a copy of the GNU General Public License along
-<span class="lineNum">      18 </span>                : // with this library; see the file COPYING.  If not, write to the Free
-<span class="lineNum">      19 </span>                : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-<span class="lineNum">      20 </span>                : // USA.
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      23 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      24 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      25 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      26 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      27 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      28 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      29 </span>                : // the GNU General Public License.
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : /*
-<span class="lineNum">      32 </span>                :  *
-<span class="lineNum">      33 </span>                :  * Copyright (c) 1994
-<span class="lineNum">      34 </span>                :  * Hewlett-Packard Company
-<span class="lineNum">      35 </span>                :  *
-<span class="lineNum">      36 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      37 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      38 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      39 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      40 </span>                :  * in supporting documentation.  Hewlett-Packard Company makes no
-<span class="lineNum">      41 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      42 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      43 </span>                :  *
-<span class="lineNum">      44 </span>                :  *
-<span class="lineNum">      45 </span>                :  * Copyright (c) 1996-1998
-<span class="lineNum">      46 </span>                :  * Silicon Graphics Computer Systems, Inc.
-<span class="lineNum">      47 </span>                :  *
-<span class="lineNum">      48 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      49 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      50 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      51 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      52 </span>                :  * in supporting documentation.  Silicon Graphics makes no
-<span class="lineNum">      53 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      54 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      55 </span>                :  */
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span>                : /** @file stl_algobase.h
-<span class="lineNum">      58 </span>                :  *  This is an internal header file, included by other library headers.
-<span class="lineNum">      59 </span>                :  *  You should not attempt to use it directly.
-<span class="lineNum">      60 </span>                :  */
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span>                : #ifndef _STL_ALGOBASE_H
-<span class="lineNum">      63 </span>                : #define _STL_ALGOBASE_H 1
-<span class="lineNum">      64 </span>                : 
-<span class="lineNum">      65 </span>                : #include &lt;bits/c++config.h&gt;
-<span class="lineNum">      66 </span>                : #include &lt;cstddef&gt;
-<span class="lineNum">      67 </span>                : #include &lt;bits/functexcept.h&gt;
-<span class="lineNum">      68 </span>                : #include &lt;bits/cpp_type_traits.h&gt;
-<span class="lineNum">      69 </span>                : #include &lt;ext/type_traits.h&gt;
-<span class="lineNum">      70 </span>                : #include &lt;ext/numeric_traits.h&gt;
-<span class="lineNum">      71 </span>                : #include &lt;bits/stl_pair.h&gt;
-<span class="lineNum">      72 </span>                : #include &lt;bits/stl_iterator_base_types.h&gt;
-<span class="lineNum">      73 </span>                : #include &lt;bits/stl_iterator_base_funcs.h&gt;
-<span class="lineNum">      74 </span>                : #include &lt;bits/stl_iterator.h&gt;
-<span class="lineNum">      75 </span>                : #include &lt;bits/concept_check.h&gt;
-<span class="lineNum">      76 </span>                : #include &lt;debug/debug.h&gt;
-<span class="lineNum">      77 </span>                : #include &lt;bits/stl_move.h&gt; // For std::swap and _GLIBCXX_MOVE
-<span class="lineNum">      78 </span>                : 
-<span class="lineNum">      79 </span>                : _GLIBCXX_BEGIN_NAMESPACE(std)
-<span class="lineNum">      80 </span>                : 
-<span class="lineNum">      81 </span>                :   // See http://gcc.gnu.org/ml/libstdc++/2004-08/msg00167.html: in a
-<span class="lineNum">      82 </span>                :   // nutshell, we are partially implementing the resolution of DR 187,
-<span class="lineNum">      83 </span>                :   // when it's safe, i.e., the value_types are equal.
-<span class="lineNum">      84 </span>                :   template&lt;bool _BoolType&gt;
-<span class="lineNum">      85 </span>                :     struct __iter_swap
-<span class="lineNum">      86 </span>                :     {
-<span class="lineNum">      87 </span>                :       template&lt;typename _ForwardIterator1, typename _ForwardIterator2&gt;
-<span class="lineNum">      88 </span>                :         static void
-<span class="lineNum">      89 </span>                :         iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b)
-<span class="lineNum">      90 </span>                :         {
-<span class="lineNum">      91 </span>                :           typedef typename iterator_traits&lt;_ForwardIterator1&gt;::value_type
-<span class="lineNum">      92 </span>                :             _ValueType1;
-<span class="lineNum">      93 </span>                :           _ValueType1 __tmp = _GLIBCXX_MOVE(*__a);
-<span class="lineNum">      94 </span>                :           *__a = _GLIBCXX_MOVE(*__b);
-<span class="lineNum">      95 </span>                :           *__b = _GLIBCXX_MOVE(__tmp);
-<span class="lineNum">      96 </span>                :         }
-<span class="lineNum">      97 </span>                :     };
-<span class="lineNum">      98 </span>                : 
-<span class="lineNum">      99 </span>                :   template&lt;&gt;
-<span class="lineNum">     100 </span>                :     struct __iter_swap&lt;true&gt;
-<span class="lineNum">     101 </span>                :     {
-<span class="lineNum">     102 </span>                :       template&lt;typename _ForwardIterator1, typename _ForwardIterator2&gt;
-<span class="lineNum">     103 </span>                :         static void 
-<span class="lineNum">     104 </span><span class="lineCov">           7080 :         iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b)</span>
-<span class="lineNum">     105 </span>                :         {
-<span class="lineNum">     106 </span><span class="lineCov">           7080 :           swap(*__a, *__b);</span>
-<span class="lineNum">     107 </span><span class="lineCov">           7080 :         }</span>
-<span class="lineNum">     108 </span>                :     };
-<span class="lineNum">     109 </span>                : 
-<span class="lineNum">     110 </span>                :   /**
-<span class="lineNum">     111 </span>                :    *  @brief Swaps the contents of two iterators.
-<span class="lineNum">     112 </span>                :    *  @param  a  An iterator.
-<span class="lineNum">     113 </span>                :    *  @param  b  Another iterator.
-<span class="lineNum">     114 </span>                :    *  @return   Nothing.
-<span class="lineNum">     115 </span>                :    *
-<span class="lineNum">     116 </span>                :    *  This function swaps the values pointed to by two iterators, not the
-<span class="lineNum">     117 </span>                :    *  iterators themselves.
-<span class="lineNum">     118 </span>                :   */
-<span class="lineNum">     119 </span>                :   template&lt;typename _ForwardIterator1, typename _ForwardIterator2&gt;
-<span class="lineNum">     120 </span>                :     inline void
-<span class="lineNum">     121 </span><span class="lineCov">           7080 :     iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b)</span>
-<span class="lineNum">     122 </span>                :     {
-<span class="lineNum">     123 </span>                :       typedef typename iterator_traits&lt;_ForwardIterator1&gt;::value_type
-<span class="lineNum">     124 </span>                :         _ValueType1;
-<span class="lineNum">     125 </span>                :       typedef typename iterator_traits&lt;_ForwardIterator2&gt;::value_type
-<span class="lineNum">     126 </span>                :         _ValueType2;
-<span class="lineNum">     127 </span>                : 
-<span class="lineNum">     128 </span>                :       // concept requirements
-<span class="lineNum">     129 </span>                :       __glibcxx_function_requires(_Mutable_ForwardIteratorConcept&lt;
-<span class="lineNum">     130 </span>                :                                   _ForwardIterator1&gt;)
-<span class="lineNum">     131 </span>                :       __glibcxx_function_requires(_Mutable_ForwardIteratorConcept&lt;
-<span class="lineNum">     132 </span>                :                                   _ForwardIterator2&gt;)
-<span class="lineNum">     133 </span>                :       __glibcxx_function_requires(_ConvertibleConcept&lt;_ValueType1,
-<span class="lineNum">     134 </span>                :                                   _ValueType2&gt;)
-<span class="lineNum">     135 </span>                :       __glibcxx_function_requires(_ConvertibleConcept&lt;_ValueType2,
-<span class="lineNum">     136 </span>                :                                   _ValueType1&gt;)
-<span class="lineNum">     137 </span>                : 
-<span class="lineNum">     138 </span>                :       typedef typename iterator_traits&lt;_ForwardIterator1&gt;::reference
-<span class="lineNum">     139 </span>                :         _ReferenceType1;
-<span class="lineNum">     140 </span>                :       typedef typename iterator_traits&lt;_ForwardIterator2&gt;::reference
-<span class="lineNum">     141 </span>                :         _ReferenceType2;
-<span class="lineNum">     142 </span><span class="lineCov">           7080 :       std::__iter_swap&lt;__are_same&lt;_ValueType1, _ValueType2&gt;::__value</span>
-<span class="lineNum">     143 </span>                :         &amp;&amp; __are_same&lt;_ValueType1&amp;, _ReferenceType1&gt;::__value
-<span class="lineNum">     144 </span>                :         &amp;&amp; __are_same&lt;_ValueType2&amp;, _ReferenceType2&gt;::__value&gt;::
-<span class="lineNum">     145 </span>                :         iter_swap(__a, __b);
-<span class="lineNum">     146 </span><span class="lineCov">           7080 :     }</span>
-<span class="lineNum">     147 </span>                : 
-<span class="lineNum">     148 </span>                :   /**
-<span class="lineNum">     149 </span>                :    *  @brief Swap the elements of two sequences.
-<span class="lineNum">     150 </span>                :    *  @param  first1  A forward iterator.
-<span class="lineNum">     151 </span>                :    *  @param  last1   A forward iterator.
-<span class="lineNum">     152 </span>                :    *  @param  first2  A forward iterator.
-<span class="lineNum">     153 </span>                :    *  @return   An iterator equal to @p first2+(last1-first1).
-<span class="lineNum">     154 </span>                :    *
-<span class="lineNum">     155 </span>                :    *  Swaps each element in the range @p [first1,last1) with the
-<span class="lineNum">     156 </span>                :    *  corresponding element in the range @p [first2,(last1-first1)).
-<span class="lineNum">     157 </span>                :    *  The ranges must not overlap.
-<span class="lineNum">     158 </span>                :   */
-<span class="lineNum">     159 </span>                :   template&lt;typename _ForwardIterator1, typename _ForwardIterator2&gt;
-<span class="lineNum">     160 </span>                :     _ForwardIterator2
-<span class="lineNum">     161 </span>                :     swap_ranges(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
-<span class="lineNum">     162 </span>                :                 _ForwardIterator2 __first2)
-<span class="lineNum">     163 </span>                :     {
-<span class="lineNum">     164 </span>                :       // concept requirements
-<span class="lineNum">     165 </span>                :       __glibcxx_function_requires(_Mutable_ForwardIteratorConcept&lt;
-<span class="lineNum">     166 </span>                :                                   _ForwardIterator1&gt;)
-<span class="lineNum">     167 </span>                :       __glibcxx_function_requires(_Mutable_ForwardIteratorConcept&lt;
-<span class="lineNum">     168 </span>                :                                   _ForwardIterator2&gt;)
-<span class="lineNum">     169 </span>                :       __glibcxx_requires_valid_range(__first1, __last1);
-<span class="lineNum">     170 </span>                : 
-<span class="lineNum">     171 </span>                :       for (; __first1 != __last1; ++__first1, ++__first2)
-<span class="lineNum">     172 </span>                :         std::iter_swap(__first1, __first2);
-<span class="lineNum">     173 </span>                :       return __first2;
-<span class="lineNum">     174 </span>                :     }
-<span class="lineNum">     175 </span>                : 
-<span class="lineNum">     176 </span>                :   /**
-<span class="lineNum">     177 </span>                :    *  @brief This does what you think it does.
-<span class="lineNum">     178 </span>                :    *  @param  a  A thing of arbitrary type.
-<span class="lineNum">     179 </span>                :    *  @param  b  Another thing of arbitrary type.
-<span class="lineNum">     180 </span>                :    *  @return   The lesser of the parameters.
-<span class="lineNum">     181 </span>                :    *
-<span class="lineNum">     182 </span>                :    *  This is the simple classic generic implementation.  It will work on
-<span class="lineNum">     183 </span>                :    *  temporary expressions, since they are only evaluated once, unlike a
-<span class="lineNum">     184 </span>                :    *  preprocessor macro.
-<span class="lineNum">     185 </span>                :   */
-<span class="lineNum">     186 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     187 </span>                :     inline const _Tp&amp;
-<span class="lineNum">     188 </span><span class="lineNoCov">              0 :     min(const _Tp&amp; __a, const _Tp&amp; __b)</span>
-<span class="lineNum">     189 </span>                :     {
-<span class="lineNum">     190 </span>                :       // concept requirements
-<span class="lineNum">     191 </span>                :       __glibcxx_function_requires(_LessThanComparableConcept&lt;_Tp&gt;)
-<span class="lineNum">     192 </span>                :       //return __b &lt; __a ? __b : __a;
-<span class="lineNum">     193 </span><span class="lineNoCov">              0 :       if (__b &lt; __a)</span>
-<span class="lineNum">     194 </span><span class="lineNoCov">              0 :         return __b;</span>
-<span class="lineNum">     195 </span><span class="lineNoCov">              0 :       return __a;</span>
-<span class="lineNum">     196 </span>                :     }
-<span class="lineNum">     197 </span>                : 
-<span class="lineNum">     198 </span>                :   /**
-<span class="lineNum">     199 </span>                :    *  @brief This does what you think it does.
-<span class="lineNum">     200 </span>                :    *  @param  a  A thing of arbitrary type.
-<span class="lineNum">     201 </span>                :    *  @param  b  Another thing of arbitrary type.
-<span class="lineNum">     202 </span>                :    *  @return   The greater of the parameters.
-<span class="lineNum">     203 </span>                :    *
-<span class="lineNum">     204 </span>                :    *  This is the simple classic generic implementation.  It will work on
-<span class="lineNum">     205 </span>                :    *  temporary expressions, since they are only evaluated once, unlike a
-<span class="lineNum">     206 </span>                :    *  preprocessor macro.
-<span class="lineNum">     207 </span>                :   */
-<span class="lineNum">     208 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     209 </span>                :     inline const _Tp&amp;
-<span class="lineNum">     210 </span><span class="lineCov">          20743 :     max(const _Tp&amp; __a, const _Tp&amp; __b)</span>
-<span class="lineNum">     211 </span>                :     {
-<span class="lineNum">     212 </span>                :       // concept requirements
-<span class="lineNum">     213 </span>                :       __glibcxx_function_requires(_LessThanComparableConcept&lt;_Tp&gt;)
-<span class="lineNum">     214 </span>                :       //return  __a &lt; __b ? __b : __a;
-<span class="lineNum">     215 </span><span class="lineCov">          20743 :       if (__a &lt; __b)</span>
-<span class="lineNum">     216 </span><span class="lineCov">           4790 :         return __b;</span>
-<span class="lineNum">     217 </span><span class="lineCov">          15953 :       return __a;</span>
-<span class="lineNum">     218 </span>                :     }
-<span class="lineNum">     219 </span>                : 
-<span class="lineNum">     220 </span>                :   /**
-<span class="lineNum">     221 </span>                :    *  @brief This does what you think it does.
-<span class="lineNum">     222 </span>                :    *  @param  a  A thing of arbitrary type.
-<span class="lineNum">     223 </span>                :    *  @param  b  Another thing of arbitrary type.
-<span class="lineNum">     224 </span>                :    *  @param  comp  A @link s20_3_3_comparisons comparison functor@endlink.
-<span class="lineNum">     225 </span>                :    *  @return   The lesser of the parameters.
-<span class="lineNum">     226 </span>                :    *
-<span class="lineNum">     227 </span>                :    *  This will work on temporary expressions, since they are only evaluated
-<span class="lineNum">     228 </span>                :    *  once, unlike a preprocessor macro.
-<span class="lineNum">     229 </span>                :   */
-<span class="lineNum">     230 </span>                :   template&lt;typename _Tp, typename _Compare&gt;
-<span class="lineNum">     231 </span>                :     inline const _Tp&amp;
-<span class="lineNum">     232 </span>                :     min(const _Tp&amp; __a, const _Tp&amp; __b, _Compare __comp)
-<span class="lineNum">     233 </span>                :     {
-<span class="lineNum">     234 </span>                :       //return __comp(__b, __a) ? __b : __a;
-<span class="lineNum">     235 </span>                :       if (__comp(__b, __a))
-<span class="lineNum">     236 </span>                :         return __b;
-<span class="lineNum">     237 </span>                :       return __a;
-<span class="lineNum">     238 </span>                :     }
-<span class="lineNum">     239 </span>                : 
-<span class="lineNum">     240 </span>                :   /**
-<span class="lineNum">     241 </span>                :    *  @brief This does what you think it does.
-<span class="lineNum">     242 </span>                :    *  @param  a  A thing of arbitrary type.
-<span class="lineNum">     243 </span>                :    *  @param  b  Another thing of arbitrary type.
-<span class="lineNum">     244 </span>                :    *  @param  comp  A @link s20_3_3_comparisons comparison functor@endlink.
-<span class="lineNum">     245 </span>                :    *  @return   The greater of the parameters.
-<span class="lineNum">     246 </span>                :    *
-<span class="lineNum">     247 </span>                :    *  This will work on temporary expressions, since they are only evaluated
-<span class="lineNum">     248 </span>                :    *  once, unlike a preprocessor macro.
-<span class="lineNum">     249 </span>                :   */
-<span class="lineNum">     250 </span>                :   template&lt;typename _Tp, typename _Compare&gt;
-<span class="lineNum">     251 </span>                :     inline const _Tp&amp;
-<span class="lineNum">     252 </span>                :     max(const _Tp&amp; __a, const _Tp&amp; __b, _Compare __comp)
-<span class="lineNum">     253 </span>                :     {
-<span class="lineNum">     254 </span>                :       //return __comp(__a, __b) ? __b : __a;
-<span class="lineNum">     255 </span>                :       if (__comp(__a, __b))
-<span class="lineNum">     256 </span>                :         return __b;
-<span class="lineNum">     257 </span>                :       return __a;
-<span class="lineNum">     258 </span>                :     }
-<span class="lineNum">     259 </span>                : 
-<span class="lineNum">     260 </span>                : 
-<span class="lineNum">     261 </span>                :   // If _Iterator is a __normal_iterator return its base (a plain pointer,
-<span class="lineNum">     262 </span>                :   // normally) otherwise return it untouched.  See copy, fill, ... 
-<span class="lineNum">     263 </span>                :   template&lt;typename _Iterator,
-<span class="lineNum">     264 </span>                :            bool _IsNormal = __is_normal_iterator&lt;_Iterator&gt;::__value&gt;
-<span class="lineNum">     265 </span>                :     struct __niter_base
-<span class="lineNum">     266 </span>                :     {
-<span class="lineNum">     267 </span>                :       static _Iterator
-<span class="lineNum">     268 </span><span class="lineCov">         256058 :       __b(_Iterator __it)</span>
-<span class="lineNum">     269 </span><span class="lineCov">         256058 :       { return __it; }</span>
-<span class="lineNum">     270 </span>                :     };
-<span class="lineNum">     271 </span>                : 
-<span class="lineNum">     272 </span>                :   template&lt;typename _Iterator&gt;
-<span class="lineNum">     273 </span>                :     struct __niter_base&lt;_Iterator, true&gt;
-<span class="lineNum">     274 </span>                :     {
-<span class="lineNum">     275 </span>                :       static typename _Iterator::iterator_type
-<span class="lineNum">     276 </span><span class="lineCov">          23362 :       __b(_Iterator __it)</span>
-<span class="lineNum">     277 </span><span class="lineCov">          23362 :       { return __it.base(); }</span>
-<span class="lineNum">     278 </span>                :     };
-<span class="lineNum">     279 </span>                : 
-<span class="lineNum">     280 </span>                :   // Likewise, for move_iterator.
-<span class="lineNum">     281 </span>                :   template&lt;typename _Iterator,
-<span class="lineNum">     282 </span>                :            bool _IsMove = __is_move_iterator&lt;_Iterator&gt;::__value&gt;
-<span class="lineNum">     283 </span>                :     struct __miter_base
-<span class="lineNum">     284 </span>                :     {
-<span class="lineNum">     285 </span>                :       static _Iterator
-<span class="lineNum">     286 </span><span class="lineCov">         156418 :       __b(_Iterator __it)</span>
-<span class="lineNum">     287 </span><span class="lineCov">         156418 :       { return __it; }</span>
-<span class="lineNum">     288 </span>                :     };
-<span class="lineNum">     289 </span>                : 
-<span class="lineNum">     290 </span>                :   template&lt;typename _Iterator&gt;
-<span class="lineNum">     291 </span>                :     struct __miter_base&lt;_Iterator, true&gt;
-<span class="lineNum">     292 </span>                :     {
-<span class="lineNum">     293 </span>                :       static typename _Iterator::iterator_type
-<span class="lineNum">     294 </span>                :       __b(_Iterator __it)
-<span class="lineNum">     295 </span>                :       { return __it.base(); }
-<span class="lineNum">     296 </span>                :     };
-<span class="lineNum">     297 </span>                : 
-<span class="lineNum">     298 </span>                :   // All of these auxiliary structs serve two purposes.  (1) Replace
-<span class="lineNum">     299 </span>                :   // calls to copy with memmove whenever possible.  (Memmove, not memcpy,
-<span class="lineNum">     300 </span>                :   // because the input and output ranges are permitted to overlap.)
-<span class="lineNum">     301 </span>                :   // (2) If we're using random access iterators, then write the loop as
-<span class="lineNum">     302 </span>                :   // a for loop with an explicit count.
-<span class="lineNum">     303 </span>                : 
-<span class="lineNum">     304 </span>                :   template&lt;bool, bool, typename&gt;
-<span class="lineNum">     305 </span>                :     struct __copy_move
-<span class="lineNum">     306 </span>                :     {
-<span class="lineNum">     307 </span>                :       template&lt;typename _II, typename _OI&gt;
-<span class="lineNum">     308 </span>                :         static _OI
-<span class="lineNum">     309 </span><span class="lineCov">          42335 :         __copy_m(_II __first, _II __last, _OI __result)</span>
-<span class="lineNum">     310 </span>                :         {
-<span class="lineNum">     311 </span><span class="lineCov">         159330 :           for (; __first != __last; ++__result, ++__first)</span>
-<span class="lineNum">     312 </span><span class="lineCov">         112959 :             *__result = *__first;</span>
-<span class="lineNum">     313 </span><span class="lineCov">          42335 :           return __result;</span>
-<span class="lineNum">     314 </span>                :         }
-<span class="lineNum">     315 </span>                :     };
-<span class="lineNum">     316 </span>                : 
-<span class="lineNum">     317 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     318 </span>                :   template&lt;typename _Category&gt;
-<span class="lineNum">     319 </span>                :     struct __copy_move&lt;true, false, _Category&gt;
-<span class="lineNum">     320 </span>                :     {
-<span class="lineNum">     321 </span>                :       template&lt;typename _II, typename _OI&gt;
-<span class="lineNum">     322 </span>                :         static _OI
-<span class="lineNum">     323 </span>                :         __copy_m(_II __first, _II __last, _OI __result)
-<span class="lineNum">     324 </span>                :         {
-<span class="lineNum">     325 </span>                :           for (; __first != __last; ++__result, ++__first)
-<span class="lineNum">     326 </span>                :             *__result = std::move(*__first);
-<span class="lineNum">     327 </span>                :           return __result;
-<span class="lineNum">     328 </span>                :         }
-<span class="lineNum">     329 </span>                :     };
-<span class="lineNum">     330 </span>                : #endif
-<span class="lineNum">     331 </span>                : 
-<span class="lineNum">     332 </span>                :   template&lt;&gt;
-<span class="lineNum">     333 </span>                :     struct __copy_move&lt;false, false, random_access_iterator_tag&gt;
-<span class="lineNum">     334 </span>                :     {
-<span class="lineNum">     335 </span>                :       template&lt;typename _II, typename _OI&gt;
-<span class="lineNum">     336 </span>                :         static _OI
-<span class="lineNum">     337 </span><span class="lineCov">            945 :         __copy_m(_II __first, _II __last, _OI __result)</span>
-<span class="lineNum">     338 </span>                :         { 
-<span class="lineNum">     339 </span>                :           typedef typename iterator_traits&lt;_II&gt;::difference_type _Distance;
-<span class="lineNum">     340 </span><span class="lineCov">          12957 :           for(_Distance __n = __last - __first; __n &gt; 0; --__n)</span>
-<span class="lineNum">     341 </span>                :             {
-<span class="lineNum">     342 </span><span class="lineCov">          12012 :               *__result = *__first;</span>
-<span class="lineNum">     343 </span><span class="lineCov">          12012 :               ++__first;</span>
-<span class="lineNum">     344 </span><span class="lineCov">          12012 :               ++__result;</span>
-<span class="lineNum">     345 </span>                :             }
-<span class="lineNum">     346 </span><span class="lineCov">            945 :           return __result;</span>
-<span class="lineNum">     347 </span>                :         }
-<span class="lineNum">     348 </span>                :     };
-<span class="lineNum">     349 </span>                : 
-<span class="lineNum">     350 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     351 </span>                :   template&lt;&gt;
-<span class="lineNum">     352 </span>                :     struct __copy_move&lt;true, false, random_access_iterator_tag&gt;
-<span class="lineNum">     353 </span>                :     {
-<span class="lineNum">     354 </span>                :       template&lt;typename _II, typename _OI&gt;
-<span class="lineNum">     355 </span>                :         static _OI
-<span class="lineNum">     356 </span>                :         __copy_m(_II __first, _II __last, _OI __result)
-<span class="lineNum">     357 </span>                :         { 
-<span class="lineNum">     358 </span>                :           typedef typename iterator_traits&lt;_II&gt;::difference_type _Distance;
-<span class="lineNum">     359 </span>                :           for(_Distance __n = __last - __first; __n &gt; 0; --__n)
-<span class="lineNum">     360 </span>                :             {
-<span class="lineNum">     361 </span>                :               *__result = std::move(*__first);
-<span class="lineNum">     362 </span>                :               ++__first;
-<span class="lineNum">     363 </span>                :               ++__result;
-<span class="lineNum">     364 </span>                :             }
-<span class="lineNum">     365 </span>                :           return __result;
-<span class="lineNum">     366 </span>                :         }
-<span class="lineNum">     367 </span>                :     };
-<span class="lineNum">     368 </span>                : #endif
-<span class="lineNum">     369 </span>                : 
-<span class="lineNum">     370 </span>                :   template&lt;bool _IsMove&gt;
-<span class="lineNum">     371 </span>                :     struct __copy_move&lt;_IsMove, true, random_access_iterator_tag&gt;
-<span class="lineNum">     372 </span>                :     {
-<span class="lineNum">     373 </span>                :       template&lt;typename _Tp&gt;
-<span class="lineNum">     374 </span>                :         static _Tp*
-<span class="lineNum">     375 </span><span class="lineCov">          27153 :         __copy_m(const _Tp* __first, const _Tp* __last, _Tp* __result)</span>
-<span class="lineNum">     376 </span>                :         {
-<span class="lineNum">     377 </span><span class="lineCov">          27153 :           __builtin_memmove(__result, __first,</span>
-<span class="lineNum">     378 </span>                :                             sizeof(_Tp) * (__last - __first));
-<span class="lineNum">     379 </span><span class="lineCov">          27153 :           return __result + (__last - __first);</span>
-<span class="lineNum">     380 </span>                :         }
-<span class="lineNum">     381 </span>                :     };
-<span class="lineNum">     382 </span>                : 
-<span class="lineNum">     383 </span>                :   template&lt;bool _IsMove, typename _II, typename _OI&gt;
-<span class="lineNum">     384 </span>                :     inline _OI
-<span class="lineNum">     385 </span><span class="lineCov">          70433 :     __copy_move_a(_II __first, _II __last, _OI __result)</span>
-<span class="lineNum">     386 </span>                :     {
-<span class="lineNum">     387 </span>                :       typedef typename iterator_traits&lt;_II&gt;::value_type _ValueTypeI;
-<span class="lineNum">     388 </span>                :       typedef typename iterator_traits&lt;_OI&gt;::value_type _ValueTypeO;
-<span class="lineNum">     389 </span>                :       typedef typename iterator_traits&lt;_II&gt;::iterator_category _Category;
-<span class="lineNum">     390 </span>                :       const bool __simple = (__is_pod(_ValueTypeI)
-<span class="lineNum">     391 </span>                :                              &amp;&amp; __is_pointer&lt;_II&gt;::__value
-<span class="lineNum">     392 </span>                :                              &amp;&amp; __is_pointer&lt;_OI&gt;::__value
-<span class="lineNum">     393 </span><span class="lineCov">          70433 :                              &amp;&amp; __are_same&lt;_ValueTypeI, _ValueTypeO&gt;::__value);</span>
-<span class="lineNum">     394 </span>                : 
-<span class="lineNum">     395 </span>                :       return std::__copy_move&lt;_IsMove, __simple,
-<span class="lineNum">     396 </span><span class="lineCov">          70433 :                               _Category&gt;::__copy_m(__first, __last, __result);</span>
-<span class="lineNum">     397 </span>                :     }
-<span class="lineNum">     398 </span>                : 
-<span class="lineNum">     399 </span>                :   // Helpers for streambuf iterators (either istream or ostream).
-<span class="lineNum">     400 </span>                :   // NB: avoid including &lt;iosfwd&gt;, relatively large.
-<span class="lineNum">     401 </span>                :   template&lt;typename _CharT&gt;
-<span class="lineNum">     402 </span>                :     struct char_traits;
-<span class="lineNum">     403 </span>                : 
-<span class="lineNum">     404 </span>                :   template&lt;typename _CharT, typename _Traits&gt;
-<span class="lineNum">     405 </span>                :     class istreambuf_iterator;
-<span class="lineNum">     406 </span>                : 
-<span class="lineNum">     407 </span>                :   template&lt;typename _CharT, typename _Traits&gt;
-<span class="lineNum">     408 </span>                :     class ostreambuf_iterator;
-<span class="lineNum">     409 </span>                : 
-<span class="lineNum">     410 </span>                :   template&lt;bool _IsMove, typename _CharT&gt;
-<span class="lineNum">     411 </span>                :     typename __gnu_cxx::__enable_if&lt;__is_char&lt;_CharT&gt;::__value, 
-<span class="lineNum">     412 </span>                :              ostreambuf_iterator&lt;_CharT, char_traits&lt;_CharT&gt; &gt; &gt;::__type
-<span class="lineNum">     413 </span>                :     __copy_move_a2(_CharT*, _CharT*,
-<span class="lineNum">     414 </span>                :                    ostreambuf_iterator&lt;_CharT, char_traits&lt;_CharT&gt; &gt;);
-<span class="lineNum">     415 </span>                : 
-<span class="lineNum">     416 </span>                :   template&lt;bool _IsMove, typename _CharT&gt;
-<span class="lineNum">     417 </span>                :     typename __gnu_cxx::__enable_if&lt;__is_char&lt;_CharT&gt;::__value, 
-<span class="lineNum">     418 </span>                :              ostreambuf_iterator&lt;_CharT, char_traits&lt;_CharT&gt; &gt; &gt;::__type
-<span class="lineNum">     419 </span>                :     __copy_move_a2(const _CharT*, const _CharT*,
-<span class="lineNum">     420 </span>                :                    ostreambuf_iterator&lt;_CharT, char_traits&lt;_CharT&gt; &gt;);
-<span class="lineNum">     421 </span>                : 
-<span class="lineNum">     422 </span>                :   template&lt;bool _IsMove, typename _CharT&gt;
-<span class="lineNum">     423 </span>                :     typename __gnu_cxx::__enable_if&lt;__is_char&lt;_CharT&gt;::__value,
-<span class="lineNum">     424 </span>                :                                     _CharT*&gt;::__type
-<span class="lineNum">     425 </span>                :     __copy_move_a2(istreambuf_iterator&lt;_CharT, char_traits&lt;_CharT&gt; &gt;,
-<span class="lineNum">     426 </span>                :                    istreambuf_iterator&lt;_CharT, char_traits&lt;_CharT&gt; &gt;, _CharT*);
-<span class="lineNum">     427 </span>                : 
-<span class="lineNum">     428 </span>                :   template&lt;bool _IsMove, typename _II, typename _OI&gt;
-<span class="lineNum">     429 </span>                :     inline _OI
-<span class="lineNum">     430 </span><span class="lineCov">          70433 :     __copy_move_a2(_II __first, _II __last, _OI __result)</span>
-<span class="lineNum">     431 </span>                :     {
-<span class="lineNum">     432 </span>                :       return _OI(std::__copy_move_a&lt;_IsMove&gt;
-<span class="lineNum">     433 </span>                :                  (std::__niter_base&lt;_II&gt;::__b(__first),
-<span class="lineNum">     434 </span>                :                   std::__niter_base&lt;_II&gt;::__b(__last),
-<span class="lineNum">     435 </span><span class="lineCov">          70433 :                   std::__niter_base&lt;_OI&gt;::__b(__result)));</span>
-<span class="lineNum">     436 </span>                :     }
-<span class="lineNum">     437 </span>                : 
-<span class="lineNum">     438 </span>                :   /**
-<span class="lineNum">     439 </span>                :    *  @brief Copies the range [first,last) into result.
-<span class="lineNum">     440 </span>                :    *  @param  first  An input iterator.
-<span class="lineNum">     441 </span>                :    *  @param  last   An input iterator.
-<span class="lineNum">     442 </span>                :    *  @param  result An output iterator.
-<span class="lineNum">     443 </span>                :    *  @return   result + (first - last)
-<span class="lineNum">     444 </span>                :    *
-<span class="lineNum">     445 </span>                :    *  This inline function will boil down to a call to @c memmove whenever
-<span class="lineNum">     446 </span>                :    *  possible.  Failing that, if random access iterators are passed, then the
-<span class="lineNum">     447 </span>                :    *  loop count will be known (and therefore a candidate for compiler
-<span class="lineNum">     448 </span>                :    *  optimizations such as unrolling).  Result may not be contained within
-<span class="lineNum">     449 </span>                :    *  [first,last); the copy_backward function should be used instead.
-<span class="lineNum">     450 </span>                :    *
-<span class="lineNum">     451 </span>                :    *  Note that the end of the output range is permitted to be contained
-<span class="lineNum">     452 </span>                :    *  within [first,last).
-<span class="lineNum">     453 </span>                :   */
-<span class="lineNum">     454 </span>                :   template&lt;typename _II, typename _OI&gt;
-<span class="lineNum">     455 </span>                :     inline _OI
-<span class="lineNum">     456 </span><span class="lineCov">          70433 :     copy(_II __first, _II __last, _OI __result)</span>
-<span class="lineNum">     457 </span>                :     {
-<span class="lineNum">     458 </span>                :       // concept requirements
-<span class="lineNum">     459 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_II&gt;)
-<span class="lineNum">     460 </span>                :       __glibcxx_function_requires(_OutputIteratorConcept&lt;_OI,
-<span class="lineNum">     461 </span>                :             typename iterator_traits&lt;_II&gt;::value_type&gt;)
-<span class="lineNum">     462 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">     463 </span>                : 
-<span class="lineNum">     464 </span>                :       return (std::__copy_move_a2&lt;__is_move_iterator&lt;_II&gt;::__value&gt;
-<span class="lineNum">     465 </span>                :               (std::__miter_base&lt;_II&gt;::__b(__first),
-<span class="lineNum">     466 </span><span class="lineCov">          70433 :                std::__miter_base&lt;_II&gt;::__b(__last), __result));</span>
-<span class="lineNum">     467 </span>                :     }
-<span class="lineNum">     468 </span>                : 
-<span class="lineNum">     469 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     470 </span>                :   /**
-<span class="lineNum">     471 </span>                :    *  @brief Moves the range [first,last) into result.
-<span class="lineNum">     472 </span>                :    *  @param  first  An input iterator.
-<span class="lineNum">     473 </span>                :    *  @param  last   An input iterator.
-<span class="lineNum">     474 </span>                :    *  @param  result An output iterator.
-<span class="lineNum">     475 </span>                :    *  @return   result + (first - last)
-<span class="lineNum">     476 </span>                :    *
-<span class="lineNum">     477 </span>                :    *  This inline function will boil down to a call to @c memmove whenever
-<span class="lineNum">     478 </span>                :    *  possible.  Failing that, if random access iterators are passed, then the
-<span class="lineNum">     479 </span>                :    *  loop count will be known (and therefore a candidate for compiler
-<span class="lineNum">     480 </span>                :    *  optimizations such as unrolling).  Result may not be contained within
-<span class="lineNum">     481 </span>                :    *  [first,last); the move_backward function should be used instead.
-<span class="lineNum">     482 </span>                :    *
-<span class="lineNum">     483 </span>                :    *  Note that the end of the output range is permitted to be contained
-<span class="lineNum">     484 </span>                :    *  within [first,last).
-<span class="lineNum">     485 </span>                :   */
-<span class="lineNum">     486 </span>                :   template&lt;typename _II, typename _OI&gt;
-<span class="lineNum">     487 </span>                :     inline _OI
-<span class="lineNum">     488 </span>                :     move(_II __first, _II __last, _OI __result)
-<span class="lineNum">     489 </span>                :     {
-<span class="lineNum">     490 </span>                :       // concept requirements
-<span class="lineNum">     491 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_II&gt;)
-<span class="lineNum">     492 </span>                :       __glibcxx_function_requires(_OutputIteratorConcept&lt;_OI,
-<span class="lineNum">     493 </span>                :             typename iterator_traits&lt;_II&gt;::value_type&gt;)
-<span class="lineNum">     494 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">     495 </span>                : 
-<span class="lineNum">     496 </span>                :       return (std::__copy_move_a2&lt;true&gt;
-<span class="lineNum">     497 </span>                :               (std::__miter_base&lt;_II&gt;::__b(__first),
-<span class="lineNum">     498 </span>                :                std::__miter_base&lt;_II&gt;::__b(__last), __result));
-<span class="lineNum">     499 </span>                :     }
-<span class="lineNum">     500 </span>                : 
-<span class="lineNum">     501 </span>                : #define _GLIBCXX_MOVE3(_Tp, _Up, _Vp) std::move(_Tp, _Up, _Vp)
-<span class="lineNum">     502 </span>                : #else
-<span class="lineNum">     503 </span>                : #define _GLIBCXX_MOVE3(_Tp, _Up, _Vp) std::copy(_Tp, _Up, _Vp)
-<span class="lineNum">     504 </span>                : #endif
-<span class="lineNum">     505 </span>                : 
-<span class="lineNum">     506 </span>                :   template&lt;bool, bool, typename&gt;
-<span class="lineNum">     507 </span>                :     struct __copy_move_backward
-<span class="lineNum">     508 </span>                :     {
-<span class="lineNum">     509 </span>                :       template&lt;typename _BI1, typename _BI2&gt;
-<span class="lineNum">     510 </span>                :         static _BI2
-<span class="lineNum">     511 </span>                :         __copy_move_b(_BI1 __first, _BI1 __last, _BI2 __result)
-<span class="lineNum">     512 </span>                :         {
-<span class="lineNum">     513 </span>                :           while (__first != __last)
-<span class="lineNum">     514 </span>                :             *--__result = *--__last;
-<span class="lineNum">     515 </span>                :           return __result;
-<span class="lineNum">     516 </span>                :         }
-<span class="lineNum">     517 </span>                :     };
-<span class="lineNum">     518 </span>                : 
-<span class="lineNum">     519 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     520 </span>                :   template&lt;typename _Category&gt;
-<span class="lineNum">     521 </span>                :     struct __copy_move_backward&lt;true, false, _Category&gt;
-<span class="lineNum">     522 </span>                :     {
-<span class="lineNum">     523 </span>                :       template&lt;typename _BI1, typename _BI2&gt;
-<span class="lineNum">     524 </span>                :         static _BI2
-<span class="lineNum">     525 </span>                :         __copy_move_b(_BI1 __first, _BI1 __last, _BI2 __result)
-<span class="lineNum">     526 </span>                :         {
-<span class="lineNum">     527 </span>                :           while (__first != __last)
-<span class="lineNum">     528 </span>                :             *--__result = std::move(*--__last);
-<span class="lineNum">     529 </span>                :           return __result;
-<span class="lineNum">     530 </span>                :         }
-<span class="lineNum">     531 </span>                :     };
-<span class="lineNum">     532 </span>                : #endif
-<span class="lineNum">     533 </span>                : 
-<span class="lineNum">     534 </span>                :   template&lt;&gt;
-<span class="lineNum">     535 </span>                :     struct __copy_move_backward&lt;false, false, random_access_iterator_tag&gt;
-<span class="lineNum">     536 </span>                :     {
-<span class="lineNum">     537 </span>                :       template&lt;typename _BI1, typename _BI2&gt;
-<span class="lineNum">     538 </span>                :         static _BI2
-<span class="lineNum">     539 </span><span class="lineCov">            150 :         __copy_move_b(_BI1 __first, _BI1 __last, _BI2 __result)</span>
-<span class="lineNum">     540 </span>                :         {
-<span class="lineNum">     541 </span>                :           typename iterator_traits&lt;_BI1&gt;::difference_type __n;
-<span class="lineNum">     542 </span><span class="lineCov">            524 :           for (__n = __last - __first; __n &gt; 0; --__n)</span>
-<span class="lineNum">     543 </span><span class="lineCov">            374 :             *--__result = *--__last;</span>
-<span class="lineNum">     544 </span><span class="lineCov">            150 :           return __result;</span>
-<span class="lineNum">     545 </span>                :         }
-<span class="lineNum">     546 </span>                :     };
-<span class="lineNum">     547 </span>                : 
-<span class="lineNum">     548 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     549 </span>                :   template&lt;&gt;
-<span class="lineNum">     550 </span>                :     struct __copy_move_backward&lt;true, false, random_access_iterator_tag&gt;
-<span class="lineNum">     551 </span>                :     {
-<span class="lineNum">     552 </span>                :       template&lt;typename _BI1, typename _BI2&gt;
-<span class="lineNum">     553 </span>                :         static _BI2
-<span class="lineNum">     554 </span>                :         __copy_move_b(_BI1 __first, _BI1 __last, _BI2 __result)
-<span class="lineNum">     555 </span>                :         {
-<span class="lineNum">     556 </span>                :           typename iterator_traits&lt;_BI1&gt;::difference_type __n;
-<span class="lineNum">     557 </span>                :           for (__n = __last - __first; __n &gt; 0; --__n)
-<span class="lineNum">     558 </span>                :             *--__result = std::move(*--__last);
-<span class="lineNum">     559 </span>                :           return __result;
-<span class="lineNum">     560 </span>                :         }
-<span class="lineNum">     561 </span>                :     };
-<span class="lineNum">     562 </span>                : #endif
-<span class="lineNum">     563 </span>                : 
-<span class="lineNum">     564 </span>                :   template&lt;bool _IsMove&gt;
-<span class="lineNum">     565 </span>                :     struct __copy_move_backward&lt;_IsMove, true, random_access_iterator_tag&gt;
-<span class="lineNum">     566 </span>                :     {
-<span class="lineNum">     567 </span>                :       template&lt;typename _Tp&gt;
-<span class="lineNum">     568 </span>                :         static _Tp*
-<span class="lineNum">     569 </span><span class="lineCov">           7626 :         __copy_move_b(const _Tp* __first, const _Tp* __last, _Tp* __result)</span>
-<span class="lineNum">     570 </span>                :         {
-<span class="lineNum">     571 </span><span class="lineCov">           7626 :           const ptrdiff_t _Num = __last - __first;</span>
-<span class="lineNum">     572 </span><span class="lineCov">           7626 :           __builtin_memmove(__result - _Num, __first, sizeof(_Tp) * _Num);</span>
-<span class="lineNum">     573 </span><span class="lineCov">           7626 :           return __result - _Num;</span>
-<span class="lineNum">     574 </span>                :         }
-<span class="lineNum">     575 </span>                :     };
-<span class="lineNum">     576 </span>                : 
-<span class="lineNum">     577 </span>                :   template&lt;bool _IsMove, typename _BI1, typename _BI2&gt;
-<span class="lineNum">     578 </span>                :     inline _BI2
-<span class="lineNum">     579 </span><span class="lineCov">           7776 :     __copy_move_backward_a(_BI1 __first, _BI1 __last, _BI2 __result)</span>
-<span class="lineNum">     580 </span>                :     {
-<span class="lineNum">     581 </span>                :       typedef typename iterator_traits&lt;_BI1&gt;::value_type _ValueType1;
-<span class="lineNum">     582 </span>                :       typedef typename iterator_traits&lt;_BI2&gt;::value_type _ValueType2;
-<span class="lineNum">     583 </span>                :       typedef typename iterator_traits&lt;_BI1&gt;::iterator_category _Category;
-<span class="lineNum">     584 </span>                :       const bool __simple = (__is_pod(_ValueType1)
-<span class="lineNum">     585 </span>                :                              &amp;&amp; __is_pointer&lt;_BI1&gt;::__value
-<span class="lineNum">     586 </span>                :                              &amp;&amp; __is_pointer&lt;_BI2&gt;::__value
-<span class="lineNum">     587 </span><span class="lineCov">           7776 :                              &amp;&amp; __are_same&lt;_ValueType1, _ValueType2&gt;::__value);</span>
-<span class="lineNum">     588 </span>                : 
-<span class="lineNum">     589 </span>                :       return std::__copy_move_backward&lt;_IsMove, __simple,
-<span class="lineNum">     590 </span>                :                                        _Category&gt;::__copy_move_b(__first,
-<span class="lineNum">     591 </span>                :                                                                  __last,
-<span class="lineNum">     592 </span><span class="lineCov">           7776 :                                                                  __result);</span>
-<span class="lineNum">     593 </span>                :     }
-<span class="lineNum">     594 </span>                : 
-<span class="lineNum">     595 </span>                :   template&lt;bool _IsMove, typename _BI1, typename _BI2&gt;
-<span class="lineNum">     596 </span>                :     inline _BI2
-<span class="lineNum">     597 </span><span class="lineCov">           7776 :     __copy_move_backward_a2(_BI1 __first, _BI1 __last, _BI2 __result)</span>
-<span class="lineNum">     598 </span>                :     {
-<span class="lineNum">     599 </span>                :       return _BI2(std::__copy_move_backward_a&lt;_IsMove&gt;
-<span class="lineNum">     600 </span>                :                   (std::__niter_base&lt;_BI1&gt;::__b(__first),
-<span class="lineNum">     601 </span>                :                    std::__niter_base&lt;_BI1&gt;::__b(__last),
-<span class="lineNum">     602 </span><span class="lineCov">           7776 :                    std::__niter_base&lt;_BI2&gt;::__b(__result)));</span>
-<span class="lineNum">     603 </span>                :     }
-<span class="lineNum">     604 </span>                : 
-<span class="lineNum">     605 </span>                :   /**
-<span class="lineNum">     606 </span>                :    *  @brief Copies the range [first,last) into result.
-<span class="lineNum">     607 </span>                :    *  @param  first  A bidirectional iterator.
-<span class="lineNum">     608 </span>                :    *  @param  last   A bidirectional iterator.
-<span class="lineNum">     609 </span>                :    *  @param  result A bidirectional iterator.
-<span class="lineNum">     610 </span>                :    *  @return   result - (first - last)
-<span class="lineNum">     611 </span>                :    *
-<span class="lineNum">     612 </span>                :    *  The function has the same effect as copy, but starts at the end of the
-<span class="lineNum">     613 </span>                :    *  range and works its way to the start, returning the start of the result.
-<span class="lineNum">     614 </span>                :    *  This inline function will boil down to a call to @c memmove whenever
-<span class="lineNum">     615 </span>                :    *  possible.  Failing that, if random access iterators are passed, then the
-<span class="lineNum">     616 </span>                :    *  loop count will be known (and therefore a candidate for compiler
-<span class="lineNum">     617 </span>                :    *  optimizations such as unrolling).
-<span class="lineNum">     618 </span>                :    *
-<span class="lineNum">     619 </span>                :    *  Result may not be in the range [first,last).  Use copy instead.  Note
-<span class="lineNum">     620 </span>                :    *  that the start of the output range may overlap [first,last).
-<span class="lineNum">     621 </span>                :   */
-<span class="lineNum">     622 </span>                :   template&lt;typename _BI1, typename _BI2&gt;
-<span class="lineNum">     623 </span>                :     inline _BI2
-<span class="lineNum">     624 </span><span class="lineCov">           7776 :     copy_backward(_BI1 __first, _BI1 __last, _BI2 __result)</span>
-<span class="lineNum">     625 </span>                :     {
-<span class="lineNum">     626 </span>                :       // concept requirements
-<span class="lineNum">     627 </span>                :       __glibcxx_function_requires(_BidirectionalIteratorConcept&lt;_BI1&gt;)
-<span class="lineNum">     628 </span>                :       __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept&lt;_BI2&gt;)
-<span class="lineNum">     629 </span>                :       __glibcxx_function_requires(_ConvertibleConcept&lt;
-<span class="lineNum">     630 </span>                :             typename iterator_traits&lt;_BI1&gt;::value_type,
-<span class="lineNum">     631 </span>                :             typename iterator_traits&lt;_BI2&gt;::value_type&gt;)
-<span class="lineNum">     632 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">     633 </span>                : 
-<span class="lineNum">     634 </span>                :       return (std::__copy_move_backward_a2&lt;__is_move_iterator&lt;_BI1&gt;::__value&gt;
-<span class="lineNum">     635 </span>                :               (std::__miter_base&lt;_BI1&gt;::__b(__first),
-<span class="lineNum">     636 </span><span class="lineCov">           7776 :                std::__miter_base&lt;_BI1&gt;::__b(__last), __result));</span>
-<span class="lineNum">     637 </span>                :     }
-<span class="lineNum">     638 </span>                : 
-<span class="lineNum">     639 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     640 </span>                :   /**
-<span class="lineNum">     641 </span>                :    *  @brief Moves the range [first,last) into result.
-<span class="lineNum">     642 </span>                :    *  @param  first  A bidirectional iterator.
-<span class="lineNum">     643 </span>                :    *  @param  last   A bidirectional iterator.
-<span class="lineNum">     644 </span>                :    *  @param  result A bidirectional iterator.
-<span class="lineNum">     645 </span>                :    *  @return   result - (first - last)
-<span class="lineNum">     646 </span>                :    *
-<span class="lineNum">     647 </span>                :    *  The function has the same effect as move, but starts at the end of the
-<span class="lineNum">     648 </span>                :    *  range and works its way to the start, returning the start of the result.
-<span class="lineNum">     649 </span>                :    *  This inline function will boil down to a call to @c memmove whenever
-<span class="lineNum">     650 </span>                :    *  possible.  Failing that, if random access iterators are passed, then the
-<span class="lineNum">     651 </span>                :    *  loop count will be known (and therefore a candidate for compiler
-<span class="lineNum">     652 </span>                :    *  optimizations such as unrolling).
-<span class="lineNum">     653 </span>                :    *
-<span class="lineNum">     654 </span>                :    *  Result may not be in the range [first,last).  Use move instead.  Note
-<span class="lineNum">     655 </span>                :    *  that the start of the output range may overlap [first,last).
-<span class="lineNum">     656 </span>                :   */
-<span class="lineNum">     657 </span>                :   template&lt;typename _BI1, typename _BI2&gt;
-<span class="lineNum">     658 </span>                :     inline _BI2
-<span class="lineNum">     659 </span>                :     move_backward(_BI1 __first, _BI1 __last, _BI2 __result)
-<span class="lineNum">     660 </span>                :     {
-<span class="lineNum">     661 </span>                :       // concept requirements
-<span class="lineNum">     662 </span>                :       __glibcxx_function_requires(_BidirectionalIteratorConcept&lt;_BI1&gt;)
-<span class="lineNum">     663 </span>                :       __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept&lt;_BI2&gt;)
-<span class="lineNum">     664 </span>                :       __glibcxx_function_requires(_ConvertibleConcept&lt;
-<span class="lineNum">     665 </span>                :             typename iterator_traits&lt;_BI1&gt;::value_type,
-<span class="lineNum">     666 </span>                :             typename iterator_traits&lt;_BI2&gt;::value_type&gt;)
-<span class="lineNum">     667 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">     668 </span>                : 
-<span class="lineNum">     669 </span>                :       return (std::__copy_move_backward_a2&lt;true&gt;
-<span class="lineNum">     670 </span>                :               (std::__miter_base&lt;_BI1&gt;::__b(__first),
-<span class="lineNum">     671 </span>                :                std::__miter_base&lt;_BI1&gt;::__b(__last), __result));
-<span class="lineNum">     672 </span>                :     }
-<span class="lineNum">     673 </span>                : 
-<span class="lineNum">     674 </span>                : #define _GLIBCXX_MOVE_BACKWARD3(_Tp, _Up, _Vp) std::move_backward(_Tp, _Up, _Vp)
-<span class="lineNum">     675 </span>                : #else
-<span class="lineNum">     676 </span>                : #define _GLIBCXX_MOVE_BACKWARD3(_Tp, _Up, _Vp) std::copy_backward(_Tp, _Up, _Vp)
-<span class="lineNum">     677 </span>                : #endif
-<span class="lineNum">     678 </span>                : 
-<span class="lineNum">     679 </span>                :   template&lt;typename _ForwardIterator, typename _Tp&gt;
-<span class="lineNum">     680 </span>                :     inline typename
-<span class="lineNum">     681 </span>                :     __gnu_cxx::__enable_if&lt;!__is_scalar&lt;_Tp&gt;::__value, void&gt;::__type
-<span class="lineNum">     682 </span>                :     __fill_a(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">     683 </span><span class="lineCov">          22386 :              const _Tp&amp; __value)</span>
-<span class="lineNum">     684 </span>                :     {
-<span class="lineNum">     685 </span><span class="lineCov">          22386 :       for (; __first != __last; ++__first)</span>
-<span class="lineNum">     686 </span><span class="lineNoCov">              0 :         *__first = __value;</span>
-<span class="lineNum">     687 </span><span class="lineCov">          22386 :     }</span>
-<span class="lineNum">     688 </span>                :     
-<span class="lineNum">     689 </span>                :   template&lt;typename _ForwardIterator, typename _Tp&gt;
-<span class="lineNum">     690 </span>                :     inline typename
-<span class="lineNum">     691 </span>                :     __gnu_cxx::__enable_if&lt;__is_scalar&lt;_Tp&gt;::__value, void&gt;::__type
-<span class="lineNum">     692 </span>                :     __fill_a(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">     693 </span>                :              const _Tp&amp; __value)
-<span class="lineNum">     694 </span>                :     {
-<span class="lineNum">     695 </span>                :       const _Tp __tmp = __value;
-<span class="lineNum">     696 </span>                :       for (; __first != __last; ++__first)
-<span class="lineNum">     697 </span>                :         *__first = __tmp;
-<span class="lineNum">     698 </span>                :     }
-<span class="lineNum">     699 </span>                : 
-<span class="lineNum">     700 </span>                :   // Specialization: for char types we can use memset.
-<span class="lineNum">     701 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     702 </span>                :     inline typename
-<span class="lineNum">     703 </span>                :     __gnu_cxx::__enable_if&lt;__is_byte&lt;_Tp&gt;::__value, void&gt;::__type
-<span class="lineNum">     704 </span>                :     __fill_a(_Tp* __first, _Tp* __last, const _Tp&amp; __c)
-<span class="lineNum">     705 </span>                :     {
-<span class="lineNum">     706 </span>                :       const _Tp __tmp = __c;
-<span class="lineNum">     707 </span>                :       __builtin_memset(__first, static_cast&lt;unsigned char&gt;(__tmp),
-<span class="lineNum">     708 </span>                :                        __last - __first);
-<span class="lineNum">     709 </span>                :     }
-<span class="lineNum">     710 </span>                : 
-<span class="lineNum">     711 </span>                :   /**
-<span class="lineNum">     712 </span>                :    *  @brief Fills the range [first,last) with copies of value.
-<span class="lineNum">     713 </span>                :    *  @param  first  A forward iterator.
-<span class="lineNum">     714 </span>                :    *  @param  last   A forward iterator.
-<span class="lineNum">     715 </span>                :    *  @param  value  A reference-to-const of arbitrary type.
-<span class="lineNum">     716 </span>                :    *  @return   Nothing.
-<span class="lineNum">     717 </span>                :    *
-<span class="lineNum">     718 </span>                :    *  This function fills a range with copies of the same value.  For char
-<span class="lineNum">     719 </span>                :    *  types filling contiguous areas of memory, this becomes an inline call
-<span class="lineNum">     720 </span>                :    *  to @c memset or @c wmemset.
-<span class="lineNum">     721 </span>                :   */
-<span class="lineNum">     722 </span>                :   template&lt;typename _ForwardIterator, typename _Tp&gt;
-<span class="lineNum">     723 </span>                :     inline void
-<span class="lineNum">     724 </span><span class="lineCov">          22386 :     fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp&amp; __value)</span>
-<span class="lineNum">     725 </span>                :     {
-<span class="lineNum">     726 </span>                :       // concept requirements
-<span class="lineNum">     727 </span>                :       __glibcxx_function_requires(_Mutable_ForwardIteratorConcept&lt;
-<span class="lineNum">     728 </span>                :                                   _ForwardIterator&gt;)
-<span class="lineNum">     729 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">     730 </span>                : 
-<span class="lineNum">     731 </span><span class="lineCov">          22386 :       std::__fill_a(std::__niter_base&lt;_ForwardIterator&gt;::__b(__first),</span>
-<span class="lineNum">     732 </span>                :                     std::__niter_base&lt;_ForwardIterator&gt;::__b(__last), __value);
-<span class="lineNum">     733 </span><span class="lineCov">          22386 :     }</span>
-<span class="lineNum">     734 </span>                : 
-<span class="lineNum">     735 </span>                :   template&lt;typename _OutputIterator, typename _Size, typename _Tp&gt;
-<span class="lineNum">     736 </span>                :     inline typename
-<span class="lineNum">     737 </span>                :     __gnu_cxx::__enable_if&lt;!__is_scalar&lt;_Tp&gt;::__value, _OutputIterator&gt;::__type
-<span class="lineNum">     738 </span>                :     __fill_n_a(_OutputIterator __first, _Size __n, const _Tp&amp; __value)
-<span class="lineNum">     739 </span>                :     {
-<span class="lineNum">     740 </span>                :       for (; __n &gt; 0; --__n, ++__first)
-<span class="lineNum">     741 </span>                :         *__first = __value;
-<span class="lineNum">     742 </span>                :       return __first;
-<span class="lineNum">     743 </span>                :     }
-<span class="lineNum">     744 </span>                : 
-<span class="lineNum">     745 </span>                :   template&lt;typename _OutputIterator, typename _Size, typename _Tp&gt;
-<span class="lineNum">     746 </span>                :     inline typename
-<span class="lineNum">     747 </span>                :     __gnu_cxx::__enable_if&lt;__is_scalar&lt;_Tp&gt;::__value, _OutputIterator&gt;::__type
-<span class="lineNum">     748 </span><span class="lineCov">              9 :     __fill_n_a(_OutputIterator __first, _Size __n, const _Tp&amp; __value)</span>
-<span class="lineNum">     749 </span>                :     {
-<span class="lineNum">     750 </span><span class="lineCov">              9 :       const _Tp __tmp = __value;</span>
-<span class="lineNum">     751 </span><span class="lineCov">              9 :       for (; __n &gt; 0; --__n, ++__first)</span>
-<span class="lineNum">     752 </span><span class="lineNoCov">              0 :         *__first = __tmp;</span>
-<span class="lineNum">     753 </span><span class="lineCov">              9 :       return __first;</span>
-<span class="lineNum">     754 </span>                :     }
-<span class="lineNum">     755 </span>                : 
-<span class="lineNum">     756 </span>                :   template&lt;typename _Size, typename _Tp&gt;
-<span class="lineNum">     757 </span>                :     inline typename
-<span class="lineNum">     758 </span>                :     __gnu_cxx::__enable_if&lt;__is_byte&lt;_Tp&gt;::__value, _Tp*&gt;::__type
-<span class="lineNum">     759 </span>                :     __fill_n_a(_Tp* __first, _Size __n, const _Tp&amp; __c)
-<span class="lineNum">     760 </span>                :     {
-<span class="lineNum">     761 </span>                :       std::__fill_a(__first, __first + __n, __c);
-<span class="lineNum">     762 </span>                :       return __first + __n;
-<span class="lineNum">     763 </span>                :     }
-<span class="lineNum">     764 </span>                : 
-<span class="lineNum">     765 </span>                :   /**
-<span class="lineNum">     766 </span>                :    *  @brief Fills the range [first,first+n) with copies of value.
-<span class="lineNum">     767 </span>                :    *  @param  first  An output iterator.
-<span class="lineNum">     768 </span>                :    *  @param  n      The count of copies to perform.
-<span class="lineNum">     769 </span>                :    *  @param  value  A reference-to-const of arbitrary type.
-<span class="lineNum">     770 </span>                :    *  @return   The iterator at first+n.
-<span class="lineNum">     771 </span>                :    *
-<span class="lineNum">     772 </span>                :    *  This function fills a range with copies of the same value.  For char
-<span class="lineNum">     773 </span>                :    *  types filling contiguous areas of memory, this becomes an inline call
-<span class="lineNum">     774 </span>                :    *  to @c memset or @ wmemset.
-<span class="lineNum">     775 </span>                :   */
-<span class="lineNum">     776 </span>                :   template&lt;typename _OI, typename _Size, typename _Tp&gt;
-<span class="lineNum">     777 </span>                :     inline _OI
-<span class="lineNum">     778 </span><span class="lineCov">              9 :     fill_n(_OI __first, _Size __n, const _Tp&amp; __value)</span>
-<span class="lineNum">     779 </span>                :     {
-<span class="lineNum">     780 </span>                :       // concept requirements
-<span class="lineNum">     781 </span>                :       __glibcxx_function_requires(_OutputIteratorConcept&lt;_OI, _Tp&gt;)
-<span class="lineNum">     782 </span>                : 
-<span class="lineNum">     783 </span>                :       return _OI(std::__fill_n_a(std::__niter_base&lt;_OI&gt;::__b(__first),
-<span class="lineNum">     784 </span><span class="lineCov">              9 :                                  __n, __value));</span>
-<span class="lineNum">     785 </span>                :     }
-<span class="lineNum">     786 </span>                : 
-<span class="lineNum">     787 </span>                :   template&lt;bool _BoolType&gt;
-<span class="lineNum">     788 </span>                :     struct __equal
-<span class="lineNum">     789 </span>                :     {
-<span class="lineNum">     790 </span>                :       template&lt;typename _II1, typename _II2&gt;
-<span class="lineNum">     791 </span>                :         static bool
-<span class="lineNum">     792 </span><span class="lineCov">              4 :         equal(_II1 __first1, _II1 __last1, _II2 __first2)</span>
-<span class="lineNum">     793 </span>                :         {
-<span class="lineNum">     794 </span><span class="lineCov">             51 :           for (; __first1 != __last1; ++__first1, ++__first2)</span>
-<span class="lineNum">     795 </span><span class="lineCov">             47 :             if (!(*__first1 == *__first2))</span>
-<span class="lineNum">     796 </span><span class="lineNoCov">              0 :               return false;</span>
-<span class="lineNum">     797 </span><span class="lineCov">              4 :           return true;</span>
-<span class="lineNum">     798 </span>                :         }
-<span class="lineNum">     799 </span>                :     };
-<span class="lineNum">     800 </span>                : 
-<span class="lineNum">     801 </span>                :   template&lt;&gt;
-<span class="lineNum">     802 </span>                :     struct __equal&lt;true&gt;
-<span class="lineNum">     803 </span>                :     {
-<span class="lineNum">     804 </span>                :       template&lt;typename _Tp&gt;
-<span class="lineNum">     805 </span>                :         static bool
-<span class="lineNum">     806 </span>                :         equal(const _Tp* __first1, const _Tp* __last1, const _Tp* __first2)
-<span class="lineNum">     807 </span>                :         {
-<span class="lineNum">     808 </span>                :           return !__builtin_memcmp(__first1, __first2, sizeof(_Tp)
-<span class="lineNum">     809 </span>                :                                    * (__last1 - __first1));
-<span class="lineNum">     810 </span>                :         }
-<span class="lineNum">     811 </span>                :     };
-<span class="lineNum">     812 </span>                : 
-<span class="lineNum">     813 </span>                :   template&lt;typename _II1, typename _II2&gt;
-<span class="lineNum">     814 </span>                :     inline bool
-<span class="lineNum">     815 </span><span class="lineCov">              4 :     __equal_aux(_II1 __first1, _II1 __last1, _II2 __first2)</span>
-<span class="lineNum">     816 </span>                :     {
-<span class="lineNum">     817 </span>                :       typedef typename iterator_traits&lt;_II1&gt;::value_type _ValueType1;
-<span class="lineNum">     818 </span>                :       typedef typename iterator_traits&lt;_II2&gt;::value_type _ValueType2;
-<span class="lineNum">     819 </span>                :       const bool __simple = (__is_integer&lt;_ValueType1&gt;::__value
-<span class="lineNum">     820 </span>                :                              &amp;&amp; __is_pointer&lt;_II1&gt;::__value
-<span class="lineNum">     821 </span>                :                              &amp;&amp; __is_pointer&lt;_II2&gt;::__value
-<span class="lineNum">     822 </span><span class="lineCov">              4 :                              &amp;&amp; __are_same&lt;_ValueType1, _ValueType2&gt;::__value);</span>
-<span class="lineNum">     823 </span>                : 
-<span class="lineNum">     824 </span><span class="lineCov">              4 :       return std::__equal&lt;__simple&gt;::equal(__first1, __last1, __first2);</span>
-<span class="lineNum">     825 </span>                :     }
-<span class="lineNum">     826 </span>                : 
-<span class="lineNum">     827 </span>                : 
-<span class="lineNum">     828 </span>                :   template&lt;typename, typename&gt;
-<span class="lineNum">     829 </span>                :     struct __lc_rai
-<span class="lineNum">     830 </span>                :     {
-<span class="lineNum">     831 </span>                :       template&lt;typename _II1, typename _II2&gt;
-<span class="lineNum">     832 </span>                :         static _II1
-<span class="lineNum">     833 </span>                :         __newlast1(_II1, _II1 __last1, _II2, _II2)
-<span class="lineNum">     834 </span>                :         { return __last1; }
-<span class="lineNum">     835 </span>                : 
-<span class="lineNum">     836 </span>                :       template&lt;typename _II&gt;
-<span class="lineNum">     837 </span>                :         static bool
-<span class="lineNum">     838 </span>                :         __cnd2(_II __first, _II __last)
-<span class="lineNum">     839 </span>                :         { return __first != __last; }
-<span class="lineNum">     840 </span>                :     };
-<span class="lineNum">     841 </span>                : 
-<span class="lineNum">     842 </span>                :   template&lt;&gt;
-<span class="lineNum">     843 </span>                :     struct __lc_rai&lt;random_access_iterator_tag, random_access_iterator_tag&gt;
-<span class="lineNum">     844 </span>                :     {
-<span class="lineNum">     845 </span>                :       template&lt;typename _RAI1, typename _RAI2&gt;
-<span class="lineNum">     846 </span>                :         static _RAI1
-<span class="lineNum">     847 </span>                :         __newlast1(_RAI1 __first1, _RAI1 __last1,
-<span class="lineNum">     848 </span>                :                    _RAI2 __first2, _RAI2 __last2)
-<span class="lineNum">     849 </span>                :         {
-<span class="lineNum">     850 </span>                :           const typename iterator_traits&lt;_RAI1&gt;::difference_type
-<span class="lineNum">     851 </span>                :             __diff1 = __last1 - __first1;
-<span class="lineNum">     852 </span>                :           const typename iterator_traits&lt;_RAI2&gt;::difference_type
-<span class="lineNum">     853 </span>                :             __diff2 = __last2 - __first2;
-<span class="lineNum">     854 </span>                :           return __diff2 &lt; __diff1 ? __first1 + __diff2 : __last1;
-<span class="lineNum">     855 </span>                :         }
-<span class="lineNum">     856 </span>                : 
-<span class="lineNum">     857 </span>                :       template&lt;typename _RAI&gt;
-<span class="lineNum">     858 </span>                :         static bool
-<span class="lineNum">     859 </span>                :         __cnd2(_RAI, _RAI)
-<span class="lineNum">     860 </span>                :         { return true; }
-<span class="lineNum">     861 </span>                :     };
-<span class="lineNum">     862 </span>                : 
-<span class="lineNum">     863 </span>                :   template&lt;bool _BoolType&gt;
-<span class="lineNum">     864 </span>                :     struct __lexicographical_compare
-<span class="lineNum">     865 </span>                :     {
-<span class="lineNum">     866 </span>                :       template&lt;typename _II1, typename _II2&gt;
-<span class="lineNum">     867 </span>                :         static bool __lc(_II1, _II1, _II2, _II2);
-<span class="lineNum">     868 </span>                :     };
-<span class="lineNum">     869 </span>                : 
-<span class="lineNum">     870 </span>                :   template&lt;bool _BoolType&gt;
-<span class="lineNum">     871 </span>                :     template&lt;typename _II1, typename _II2&gt;
-<span class="lineNum">     872 </span>                :       bool
-<span class="lineNum">     873 </span>                :       __lexicographical_compare&lt;_BoolType&gt;::
-<span class="lineNum">     874 </span>                :       __lc(_II1 __first1, _II1 __last1, _II2 __first2, _II2 __last2)
-<span class="lineNum">     875 </span>                :       {
-<span class="lineNum">     876 </span>                :         typedef typename iterator_traits&lt;_II1&gt;::iterator_category _Category1;
-<span class="lineNum">     877 </span>                :         typedef typename iterator_traits&lt;_II2&gt;::iterator_category _Category2;
-<span class="lineNum">     878 </span>                :         typedef std::__lc_rai&lt;_Category1, _Category2&gt;     __rai_type;
-<span class="lineNum">     879 </span>                :         
-<span class="lineNum">     880 </span>                :         __last1 = __rai_type::__newlast1(__first1, __last1,
-<span class="lineNum">     881 </span>                :                                          __first2, __last2);
-<span class="lineNum">     882 </span>                :         for (; __first1 != __last1 &amp;&amp; __rai_type::__cnd2(__first2, __last2);
-<span class="lineNum">     883 </span>                :              ++__first1, ++__first2)
-<span class="lineNum">     884 </span>                :           {
-<span class="lineNum">     885 </span>                :             if (*__first1 &lt; *__first2)
-<span class="lineNum">     886 </span>                :               return true;
-<span class="lineNum">     887 </span>                :             if (*__first2 &lt; *__first1)
-<span class="lineNum">     888 </span>                :               return false;
-<span class="lineNum">     889 </span>                :           }
-<span class="lineNum">     890 </span>                :         return __first1 == __last1 &amp;&amp; __first2 != __last2;
-<span class="lineNum">     891 </span>                :       }
-<span class="lineNum">     892 </span>                : 
-<span class="lineNum">     893 </span>                :   template&lt;&gt;
-<span class="lineNum">     894 </span>                :     struct __lexicographical_compare&lt;true&gt;
-<span class="lineNum">     895 </span>                :     {
-<span class="lineNum">     896 </span>                :       template&lt;typename _Tp, typename _Up&gt;
-<span class="lineNum">     897 </span>                :         static bool
-<span class="lineNum">     898 </span>                :         __lc(const _Tp* __first1, const _Tp* __last1,
-<span class="lineNum">     899 </span>                :              const _Up* __first2, const _Up* __last2)
-<span class="lineNum">     900 </span>                :         {
-<span class="lineNum">     901 </span>                :           const size_t __len1 = __last1 - __first1;
-<span class="lineNum">     902 </span>                :           const size_t __len2 = __last2 - __first2;
-<span class="lineNum">     903 </span>                :           const int __result = __builtin_memcmp(__first1, __first2,
-<span class="lineNum">     904 </span>                :                                                 std::min(__len1, __len2));
-<span class="lineNum">     905 </span>                :           return __result != 0 ? __result &lt; 0 : __len1 &lt; __len2;
-<span class="lineNum">     906 </span>                :         }
-<span class="lineNum">     907 </span>                :     };
-<span class="lineNum">     908 </span>                : 
-<span class="lineNum">     909 </span>                :   template&lt;typename _II1, typename _II2&gt;
-<span class="lineNum">     910 </span>                :     inline bool
-<span class="lineNum">     911 </span>                :     __lexicographical_compare_aux(_II1 __first1, _II1 __last1,
-<span class="lineNum">     912 </span>                :                                   _II2 __first2, _II2 __last2)
-<span class="lineNum">     913 </span>                :     {
-<span class="lineNum">     914 </span>                :       typedef typename iterator_traits&lt;_II1&gt;::value_type _ValueType1;
-<span class="lineNum">     915 </span>                :       typedef typename iterator_traits&lt;_II2&gt;::value_type _ValueType2;
-<span class="lineNum">     916 </span>                :       const bool __simple =
-<span class="lineNum">     917 </span>                :         (__is_byte&lt;_ValueType1&gt;::__value &amp;&amp; __is_byte&lt;_ValueType2&gt;::__value
-<span class="lineNum">     918 </span>                :          &amp;&amp; !__gnu_cxx::__numeric_traits&lt;_ValueType1&gt;::__is_signed
-<span class="lineNum">     919 </span>                :          &amp;&amp; !__gnu_cxx::__numeric_traits&lt;_ValueType2&gt;::__is_signed
-<span class="lineNum">     920 </span>                :          &amp;&amp; __is_pointer&lt;_II1&gt;::__value
-<span class="lineNum">     921 </span>                :          &amp;&amp; __is_pointer&lt;_II2&gt;::__value);
-<span class="lineNum">     922 </span>                : 
-<span class="lineNum">     923 </span>                :       return std::__lexicographical_compare&lt;__simple&gt;::__lc(__first1, __last1,
-<span class="lineNum">     924 </span>                :                                                             __first2, __last2);
-<span class="lineNum">     925 </span>                :     }
-<span class="lineNum">     926 </span>                : 
-<span class="lineNum">     927 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">     928 </span>                : 
-<span class="lineNum">     929 </span>                : _GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_P)
-<span class="lineNum">     930 </span>                : 
-<span class="lineNum">     931 </span>                :   /**
-<span class="lineNum">     932 </span>                :    *  @brief Tests a range for element-wise equality.
-<span class="lineNum">     933 </span>                :    *  @param  first1  An input iterator.
-<span class="lineNum">     934 </span>                :    *  @param  last1   An input iterator.
-<span class="lineNum">     935 </span>                :    *  @param  first2  An input iterator.
-<span class="lineNum">     936 </span>                :    *  @return   A boolean true or false.
-<span class="lineNum">     937 </span>                :    *
-<span class="lineNum">     938 </span>                :    *  This compares the elements of two ranges using @c == and returns true or
-<span class="lineNum">     939 </span>                :    *  false depending on whether all of the corresponding elements of the
-<span class="lineNum">     940 </span>                :    *  ranges are equal.
-<span class="lineNum">     941 </span>                :   */
-<span class="lineNum">     942 </span>                :   template&lt;typename _II1, typename _II2&gt;
-<span class="lineNum">     943 </span>                :     inline bool
-<span class="lineNum">     944 </span><span class="lineCov">              4 :     equal(_II1 __first1, _II1 __last1, _II2 __first2)</span>
-<span class="lineNum">     945 </span>                :     {
-<span class="lineNum">     946 </span>                :       // concept requirements
-<span class="lineNum">     947 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_II1&gt;)
-<span class="lineNum">     948 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_II2&gt;)
-<span class="lineNum">     949 </span>                :       __glibcxx_function_requires(_EqualOpConcept&lt;
-<span class="lineNum">     950 </span>                :             typename iterator_traits&lt;_II1&gt;::value_type,
-<span class="lineNum">     951 </span>                :             typename iterator_traits&lt;_II2&gt;::value_type&gt;)
-<span class="lineNum">     952 </span>                :       __glibcxx_requires_valid_range(__first1, __last1);
-<span class="lineNum">     953 </span>                : 
-<span class="lineNum">     954 </span>                :       return std::__equal_aux(std::__niter_base&lt;_II1&gt;::__b(__first1),
-<span class="lineNum">     955 </span>                :                               std::__niter_base&lt;_II1&gt;::__b(__last1),
-<span class="lineNum">     956 </span><span class="lineCov">              4 :                               std::__niter_base&lt;_II2&gt;::__b(__first2));</span>
-<span class="lineNum">     957 </span>                :     }
-<span class="lineNum">     958 </span>                : 
-<span class="lineNum">     959 </span>                :   /**
-<span class="lineNum">     960 </span>                :    *  @brief Tests a range for element-wise equality.
-<span class="lineNum">     961 </span>                :    *  @param  first1  An input iterator.
-<span class="lineNum">     962 </span>                :    *  @param  last1   An input iterator.
-<span class="lineNum">     963 </span>                :    *  @param  first2  An input iterator.
-<span class="lineNum">     964 </span>                :    *  @param binary_pred A binary predicate @link s20_3_1_base
-<span class="lineNum">     965 </span>                :    *                  functor@endlink.
-<span class="lineNum">     966 </span>                :    *  @return         A boolean true or false.
-<span class="lineNum">     967 </span>                :    *
-<span class="lineNum">     968 </span>                :    *  This compares the elements of two ranges using the binary_pred
-<span class="lineNum">     969 </span>                :    *  parameter, and returns true or
-<span class="lineNum">     970 </span>                :    *  false depending on whether all of the corresponding elements of the
-<span class="lineNum">     971 </span>                :    *  ranges are equal.
-<span class="lineNum">     972 </span>                :   */
-<span class="lineNum">     973 </span>                :   template&lt;typename _IIter1, typename _IIter2, typename _BinaryPredicate&gt;
-<span class="lineNum">     974 </span>                :     inline bool
-<span class="lineNum">     975 </span>                :     equal(_IIter1 __first1, _IIter1 __last1,
-<span class="lineNum">     976 </span>                :           _IIter2 __first2, _BinaryPredicate __binary_pred)
-<span class="lineNum">     977 </span>                :     {
-<span class="lineNum">     978 </span>                :       // concept requirements
-<span class="lineNum">     979 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_IIter1&gt;)
-<span class="lineNum">     980 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_IIter2&gt;)
-<span class="lineNum">     981 </span>                :       __glibcxx_requires_valid_range(__first1, __last1);
-<span class="lineNum">     982 </span>                : 
-<span class="lineNum">     983 </span>                :       for (; __first1 != __last1; ++__first1, ++__first2)
-<span class="lineNum">     984 </span>                :         if (!bool(__binary_pred(*__first1, *__first2)))
-<span class="lineNum">     985 </span>                :           return false;
-<span class="lineNum">     986 </span>                :       return true;
-<span class="lineNum">     987 </span>                :     }
-<span class="lineNum">     988 </span>                : 
-<span class="lineNum">     989 </span>                :   /**
-<span class="lineNum">     990 </span>                :    *  @brief Performs &quot;dictionary&quot; comparison on ranges.
-<span class="lineNum">     991 </span>                :    *  @param  first1  An input iterator.
-<span class="lineNum">     992 </span>                :    *  @param  last1   An input iterator.
-<span class="lineNum">     993 </span>                :    *  @param  first2  An input iterator.
-<span class="lineNum">     994 </span>                :    *  @param  last2   An input iterator.
-<span class="lineNum">     995 </span>                :    *  @return   A boolean true or false.
-<span class="lineNum">     996 </span>                :    *
-<span class="lineNum">     997 </span>                :    *  &quot;Returns true if the sequence of elements defined by the range
-<span class="lineNum">     998 </span>                :    *  [first1,last1) is lexicographically less than the sequence of elements
-<span class="lineNum">     999 </span>                :    *  defined by the range [first2,last2).  Returns false otherwise.&quot;
-<span class="lineNum">    1000 </span>                :    *  (Quoted from [25.3.8]/1.)  If the iterators are all character pointers,
-<span class="lineNum">    1001 </span>                :    *  then this is an inline call to @c memcmp.
-<span class="lineNum">    1002 </span>                :   */
-<span class="lineNum">    1003 </span>                :   template&lt;typename _II1, typename _II2&gt;
-<span class="lineNum">    1004 </span>                :     inline bool
-<span class="lineNum">    1005 </span>                :     lexicographical_compare(_II1 __first1, _II1 __last1,
-<span class="lineNum">    1006 </span>                :                             _II2 __first2, _II2 __last2)
-<span class="lineNum">    1007 </span>                :     {
-<span class="lineNum">    1008 </span>                :       // concept requirements
-<span class="lineNum">    1009 </span>                :       typedef typename iterator_traits&lt;_II1&gt;::value_type _ValueType1;
-<span class="lineNum">    1010 </span>                :       typedef typename iterator_traits&lt;_II2&gt;::value_type _ValueType2;
-<span class="lineNum">    1011 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_II1&gt;)
-<span class="lineNum">    1012 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_II2&gt;)
-<span class="lineNum">    1013 </span>                :       __glibcxx_function_requires(_LessThanOpConcept&lt;_ValueType1, _ValueType2&gt;)
-<span class="lineNum">    1014 </span>                :       __glibcxx_function_requires(_LessThanOpConcept&lt;_ValueType2, _ValueType1&gt;)
-<span class="lineNum">    1015 </span>                :       __glibcxx_requires_valid_range(__first1, __last1);
-<span class="lineNum">    1016 </span>                :       __glibcxx_requires_valid_range(__first2, __last2);
-<span class="lineNum">    1017 </span>                : 
-<span class="lineNum">    1018 </span>                :       return std::__lexicographical_compare_aux
-<span class="lineNum">    1019 </span>                :         (std::__niter_base&lt;_II1&gt;::__b(__first1),
-<span class="lineNum">    1020 </span>                :          std::__niter_base&lt;_II1&gt;::__b(__last1),
-<span class="lineNum">    1021 </span>                :          std::__niter_base&lt;_II2&gt;::__b(__first2),
-<span class="lineNum">    1022 </span>                :          std::__niter_base&lt;_II2&gt;::__b(__last2));
-<span class="lineNum">    1023 </span>                :     }
-<span class="lineNum">    1024 </span>                : 
-<span class="lineNum">    1025 </span>                :   /**
-<span class="lineNum">    1026 </span>                :    *  @brief Performs &quot;dictionary&quot; comparison on ranges.
-<span class="lineNum">    1027 </span>                :    *  @param  first1  An input iterator.
-<span class="lineNum">    1028 </span>                :    *  @param  last1   An input iterator.
-<span class="lineNum">    1029 </span>                :    *  @param  first2  An input iterator.
-<span class="lineNum">    1030 </span>                :    *  @param  last2   An input iterator.
-<span class="lineNum">    1031 </span>                :    *  @param  comp  A @link s20_3_3_comparisons comparison functor@endlink.
-<span class="lineNum">    1032 </span>                :    *  @return   A boolean true or false.
-<span class="lineNum">    1033 </span>                :    *
-<span class="lineNum">    1034 </span>                :    *  The same as the four-parameter @c lexicographical_compare, but uses the
-<span class="lineNum">    1035 </span>                :    *  comp parameter instead of @c &lt;.
-<span class="lineNum">    1036 </span>                :   */
-<span class="lineNum">    1037 </span>                :   template&lt;typename _II1, typename _II2, typename _Compare&gt;
-<span class="lineNum">    1038 </span>                :     bool
-<span class="lineNum">    1039 </span>                :     lexicographical_compare(_II1 __first1, _II1 __last1,
-<span class="lineNum">    1040 </span>                :                             _II2 __first2, _II2 __last2, _Compare __comp)
-<span class="lineNum">    1041 </span>                :     {
-<span class="lineNum">    1042 </span>                :       typedef typename iterator_traits&lt;_II1&gt;::iterator_category _Category1;
-<span class="lineNum">    1043 </span>                :       typedef typename iterator_traits&lt;_II2&gt;::iterator_category _Category2;
-<span class="lineNum">    1044 </span>                :       typedef std::__lc_rai&lt;_Category1, _Category2&gt;       __rai_type;
-<span class="lineNum">    1045 </span>                : 
-<span class="lineNum">    1046 </span>                :       // concept requirements
-<span class="lineNum">    1047 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_II1&gt;)
-<span class="lineNum">    1048 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_II2&gt;)
-<span class="lineNum">    1049 </span>                :       __glibcxx_requires_valid_range(__first1, __last1);
-<span class="lineNum">    1050 </span>                :       __glibcxx_requires_valid_range(__first2, __last2);
-<span class="lineNum">    1051 </span>                : 
-<span class="lineNum">    1052 </span>                :       __last1 = __rai_type::__newlast1(__first1, __last1, __first2, __last2);
-<span class="lineNum">    1053 </span>                :       for (; __first1 != __last1 &amp;&amp; __rai_type::__cnd2(__first2, __last2);
-<span class="lineNum">    1054 </span>                :            ++__first1, ++__first2)
-<span class="lineNum">    1055 </span>                :         {
-<span class="lineNum">    1056 </span>                :           if (__comp(*__first1, *__first2))
-<span class="lineNum">    1057 </span>                :             return true;
-<span class="lineNum">    1058 </span>                :           if (__comp(*__first2, *__first1))
-<span class="lineNum">    1059 </span>                :             return false;
-<span class="lineNum">    1060 </span>                :         }
-<span class="lineNum">    1061 </span>                :       return __first1 == __last1 &amp;&amp; __first2 != __last2;
-<span class="lineNum">    1062 </span>                :     }
-<span class="lineNum">    1063 </span>                : 
-<span class="lineNum">    1064 </span>                :   /**
-<span class="lineNum">    1065 </span>                :    *  @brief Finds the places in ranges which don't match.
-<span class="lineNum">    1066 </span>                :    *  @param  first1  An input iterator.
-<span class="lineNum">    1067 </span>                :    *  @param  last1   An input iterator.
-<span class="lineNum">    1068 </span>                :    *  @param  first2  An input iterator.
-<span class="lineNum">    1069 </span>                :    *  @return   A pair of iterators pointing to the first mismatch.
-<span class="lineNum">    1070 </span>                :    *
-<span class="lineNum">    1071 </span>                :    *  This compares the elements of two ranges using @c == and returns a pair
-<span class="lineNum">    1072 </span>                :    *  of iterators.  The first iterator points into the first range, the
-<span class="lineNum">    1073 </span>                :    *  second iterator points into the second range, and the elements pointed
-<span class="lineNum">    1074 </span>                :    *  to by the iterators are not equal.
-<span class="lineNum">    1075 </span>                :   */
-<span class="lineNum">    1076 </span>                :   template&lt;typename _InputIterator1, typename _InputIterator2&gt;
-<span class="lineNum">    1077 </span>                :     pair&lt;_InputIterator1, _InputIterator2&gt;
-<span class="lineNum">    1078 </span>                :     mismatch(_InputIterator1 __first1, _InputIterator1 __last1,
-<span class="lineNum">    1079 </span>                :              _InputIterator2 __first2)
-<span class="lineNum">    1080 </span>                :     {
-<span class="lineNum">    1081 </span>                :       // concept requirements
-<span class="lineNum">    1082 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator1&gt;)
-<span class="lineNum">    1083 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator2&gt;)
-<span class="lineNum">    1084 </span>                :       __glibcxx_function_requires(_EqualOpConcept&lt;
-<span class="lineNum">    1085 </span>                :             typename iterator_traits&lt;_InputIterator1&gt;::value_type,
-<span class="lineNum">    1086 </span>                :             typename iterator_traits&lt;_InputIterator2&gt;::value_type&gt;)
-<span class="lineNum">    1087 </span>                :       __glibcxx_requires_valid_range(__first1, __last1);
-<span class="lineNum">    1088 </span>                : 
-<span class="lineNum">    1089 </span>                :       while (__first1 != __last1 &amp;&amp; *__first1 == *__first2)
-<span class="lineNum">    1090 </span>                :         {
-<span class="lineNum">    1091 </span>                :           ++__first1;
-<span class="lineNum">    1092 </span>                :           ++__first2;
-<span class="lineNum">    1093 </span>                :         }
-<span class="lineNum">    1094 </span>                :       return pair&lt;_InputIterator1, _InputIterator2&gt;(__first1, __first2);
-<span class="lineNum">    1095 </span>                :     }
-<span class="lineNum">    1096 </span>                : 
-<span class="lineNum">    1097 </span>                :   /**
-<span class="lineNum">    1098 </span>                :    *  @brief Finds the places in ranges which don't match.
-<span class="lineNum">    1099 </span>                :    *  @param  first1  An input iterator.
-<span class="lineNum">    1100 </span>                :    *  @param  last1   An input iterator.
-<span class="lineNum">    1101 </span>                :    *  @param  first2  An input iterator.
-<span class="lineNum">    1102 </span>                :    *  @param binary_pred A binary predicate @link s20_3_1_base
-<span class="lineNum">    1103 </span>                :    *         functor@endlink.
-<span class="lineNum">    1104 </span>                :    *  @return   A pair of iterators pointing to the first mismatch.
-<span class="lineNum">    1105 </span>                :    *
-<span class="lineNum">    1106 </span>                :    *  This compares the elements of two ranges using the binary_pred
-<span class="lineNum">    1107 </span>                :    *  parameter, and returns a pair
-<span class="lineNum">    1108 </span>                :    *  of iterators.  The first iterator points into the first range, the
-<span class="lineNum">    1109 </span>                :    *  second iterator points into the second range, and the elements pointed
-<span class="lineNum">    1110 </span>                :    *  to by the iterators are not equal.
-<span class="lineNum">    1111 </span>                :   */
-<span class="lineNum">    1112 </span>                :   template&lt;typename _InputIterator1, typename _InputIterator2,
-<span class="lineNum">    1113 </span>                :            typename _BinaryPredicate&gt;
-<span class="lineNum">    1114 </span>                :     pair&lt;_InputIterator1, _InputIterator2&gt;
-<span class="lineNum">    1115 </span>                :     mismatch(_InputIterator1 __first1, _InputIterator1 __last1,
-<span class="lineNum">    1116 </span>                :              _InputIterator2 __first2, _BinaryPredicate __binary_pred)
-<span class="lineNum">    1117 </span>                :     {
-<span class="lineNum">    1118 </span>                :       // concept requirements
-<span class="lineNum">    1119 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator1&gt;)
-<span class="lineNum">    1120 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator2&gt;)
-<span class="lineNum">    1121 </span>                :       __glibcxx_requires_valid_range(__first1, __last1);
-<span class="lineNum">    1122 </span>                : 
-<span class="lineNum">    1123 </span>                :       while (__first1 != __last1 &amp;&amp; bool(__binary_pred(*__first1, *__first2)))
-<span class="lineNum">    1124 </span>                :         {
-<span class="lineNum">    1125 </span>                :           ++__first1;
-<span class="lineNum">    1126 </span>                :           ++__first2;
-<span class="lineNum">    1127 </span>                :         }
-<span class="lineNum">    1128 </span>                :       return pair&lt;_InputIterator1, _InputIterator2&gt;(__first1, __first2);
-<span class="lineNum">    1129 </span>                :     }
-<span class="lineNum">    1130 </span>                : 
-<span class="lineNum">    1131 </span>                : _GLIBCXX_END_NESTED_NAMESPACE
-<span class="lineNum">    1132 </span>                : 
-<span class="lineNum">    1133 </span>                : // NB: This file is included within many other C++ includes, as a way
-<span class="lineNum">    1134 </span>                : // of getting the base algorithms. So, make sure that parallel bits
-<span class="lineNum">    1135 </span>                : // come in too if requested. 
-<span class="lineNum">    1136 </span>                : #ifdef _GLIBCXX_PARALLEL
-<span class="lineNum">    1137 </span>                : # include &lt;parallel/algobase.h&gt;
-<span class="lineNum">    1138 </span>                : #endif
-<span class="lineNum">    1139 </span>                : 
-<span class="lineNum">    1140 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/bits/stl_bvector.h.gcov.html b/rep/usr/include/c++/4.3/bits/stl_bvector.h.gcov.html
deleted file mode 100644
index 3930b85..0000000
--- a/rep/usr/include/c++/4.3/bits/stl_bvector.h.gcov.html
+++ /dev/null
@@ -1,1069 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_bvector.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_bvector.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">115</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">70.4 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">81</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // vector&lt;bool&gt; specialization -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007
-<span class="lineNum">       4 </span>                : // Free Software Foundation, Inc.
-<span class="lineNum">       5 </span>                : //
-<span class="lineNum">       6 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       7 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       8 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">       9 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      10 </span>                : // any later version.
-<span class="lineNum">      11 </span>                : 
-<span class="lineNum">      12 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      13 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      14 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      15 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      16 </span>                : 
-<span class="lineNum">      17 </span>                : // You should have received a copy of the GNU General Public License along
-<span class="lineNum">      18 </span>                : // with this library; see the file COPYING.  If not, write to the Free
-<span class="lineNum">      19 </span>                : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-<span class="lineNum">      20 </span>                : // USA.
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      23 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      24 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      25 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      26 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      27 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      28 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      29 </span>                : // the GNU General Public License.
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : /*
-<span class="lineNum">      32 </span>                :  *
-<span class="lineNum">      33 </span>                :  * Copyright (c) 1994
-<span class="lineNum">      34 </span>                :  * Hewlett-Packard Company
-<span class="lineNum">      35 </span>                :  *
-<span class="lineNum">      36 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      37 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      38 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      39 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      40 </span>                :  * in supporting documentation.  Hewlett-Packard Company makes no
-<span class="lineNum">      41 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      42 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      43 </span>                :  *
-<span class="lineNum">      44 </span>                :  *
-<span class="lineNum">      45 </span>                :  * Copyright (c) 1996-1999
-<span class="lineNum">      46 </span>                :  * Silicon Graphics Computer Systems, Inc.
-<span class="lineNum">      47 </span>                :  *
-<span class="lineNum">      48 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      49 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      50 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      51 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      52 </span>                :  * in supporting documentation.  Silicon Graphics makes no
-<span class="lineNum">      53 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      54 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      55 </span>                :  */
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span>                : /** @file stl_bvector.h
-<span class="lineNum">      58 </span>                :  *  This is an internal header file, included by other library headers.
-<span class="lineNum">      59 </span>                :  *  You should not attempt to use it directly.
-<span class="lineNum">      60 </span>                :  */
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span>                : #ifndef _STL_BVECTOR_H
-<span class="lineNum">      63 </span>                : #define _STL_BVECTOR_H 1
-<span class="lineNum">      64 </span>                : 
-<span class="lineNum">      65 </span>                : _GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D)
-<span class="lineNum">      66 </span>                : 
-<span class="lineNum">      67 </span>                :   typedef unsigned long _Bit_type;
-<span class="lineNum">      68 </span>                :   enum { _S_word_bit = int(__CHAR_BIT__ * sizeof(_Bit_type)) };
-<span class="lineNum">      69 </span>                : 
-<span class="lineNum">      70 </span>                :   struct _Bit_reference
-<span class="lineNum">      71 </span>                :   {
-<span class="lineNum">      72 </span>                :     _Bit_type * _M_p;
-<span class="lineNum">      73 </span>                :     _Bit_type _M_mask;
-<span class="lineNum">      74 </span>                : 
-<span class="lineNum">      75 </span><span class="lineCov">              5 :     _Bit_reference(_Bit_type * __x, _Bit_type __y)</span>
-<span class="lineNum">      76 </span><span class="lineCov">              5 :     : _M_p(__x), _M_mask(__y) { }</span>
-<span class="lineNum">      77 </span>                : 
-<span class="lineNum">      78 </span>                :     _Bit_reference() : _M_p(0), _M_mask(0) { }
-<span class="lineNum">      79 </span>                : 
-<span class="lineNum">      80 </span><span class="lineCov">              3 :     operator bool() const</span>
-<span class="lineNum">      81 </span><span class="lineCov">              3 :     { return !!(*_M_p &amp; _M_mask); }</span>
-<span class="lineNum">      82 </span>                : 
-<span class="lineNum">      83 </span>                :     _Bit_reference&amp;
-<span class="lineNum">      84 </span><span class="lineCov">              2 :     operator=(bool __x)</span>
-<span class="lineNum">      85 </span>                :     {
-<span class="lineNum">      86 </span><span class="lineCov">              2 :       if (__x)</span>
-<span class="lineNum">      87 </span><span class="lineCov">              1 :         *_M_p |= _M_mask;</span>
-<span class="lineNum">      88 </span>                :       else
-<span class="lineNum">      89 </span><span class="lineCov">              1 :         *_M_p &amp;= ~_M_mask;</span>
-<span class="lineNum">      90 </span><span class="lineCov">              2 :       return *this;</span>
-<span class="lineNum">      91 </span>                :     }
-<span class="lineNum">      92 </span>                : 
-<span class="lineNum">      93 </span>                :     _Bit_reference&amp;
-<span class="lineNum">      94 </span><span class="lineNoCov">              0 :     operator=(const _Bit_reference&amp; __x)</span>
-<span class="lineNum">      95 </span><span class="lineNoCov">              0 :     { return *this = bool(__x); }</span>
-<span class="lineNum">      96 </span>                : 
-<span class="lineNum">      97 </span>                :     bool
-<span class="lineNum">      98 </span>                :     operator==(const _Bit_reference&amp; __x) const
-<span class="lineNum">      99 </span>                :     { return bool(*this) == bool(__x); }
-<span class="lineNum">     100 </span>                : 
-<span class="lineNum">     101 </span>                :     bool
-<span class="lineNum">     102 </span>                :     operator&lt;(const _Bit_reference&amp; __x) const
-<span class="lineNum">     103 </span>                :     { return !bool(*this) &amp;&amp; bool(__x); }
-<span class="lineNum">     104 </span>                : 
-<span class="lineNum">     105 </span>                :     void
-<span class="lineNum">     106 </span>                :     flip()
-<span class="lineNum">     107 </span>                :     { *_M_p ^= _M_mask; }
-<span class="lineNum">     108 </span>                :   };
-<span class="lineNum">     109 </span>                : 
-<span class="lineNum">     110 </span>                :   struct _Bit_iterator_base
-<span class="lineNum">     111 </span>                :   : public std::iterator&lt;std::random_access_iterator_tag, bool&gt;
-<span class="lineNum">     112 </span>                :   {
-<span class="lineNum">     113 </span>                :     _Bit_type * _M_p;
-<span class="lineNum">     114 </span>                :     unsigned int _M_offset;
-<span class="lineNum">     115 </span>                : 
-<span class="lineNum">     116 </span><span class="lineCov">             31 :     _Bit_iterator_base(_Bit_type * __x, unsigned int __y)</span>
-<span class="lineNum">     117 </span><span class="lineCov">             31 :     : _M_p(__x), _M_offset(__y) { }</span>
-<span class="lineNum">     118 </span>                : 
-<span class="lineNum">     119 </span>                :     void
-<span class="lineNum">     120 </span><span class="lineCov">              2 :     _M_bump_up()</span>
-<span class="lineNum">     121 </span>                :     {
-<span class="lineNum">     122 </span><span class="lineCov">              2 :       if (_M_offset++ == int(_S_word_bit) - 1)</span>
-<span class="lineNum">     123 </span>                :         {
-<span class="lineNum">     124 </span><span class="lineNoCov">              0 :           _M_offset = 0;</span>
-<span class="lineNum">     125 </span><span class="lineNoCov">              0 :           ++_M_p;</span>
-<span class="lineNum">     126 </span>                :         }
-<span class="lineNum">     127 </span><span class="lineCov">              2 :     }</span>
-<span class="lineNum">     128 </span>                : 
-<span class="lineNum">     129 </span>                :     void
-<span class="lineNum">     130 </span><span class="lineNoCov">              0 :     _M_bump_down()</span>
-<span class="lineNum">     131 </span>                :     {
-<span class="lineNum">     132 </span><span class="lineNoCov">              0 :       if (_M_offset-- == 0)</span>
-<span class="lineNum">     133 </span>                :         {
-<span class="lineNum">     134 </span><span class="lineNoCov">              0 :           _M_offset = int(_S_word_bit) - 1;</span>
-<span class="lineNum">     135 </span><span class="lineNoCov">              0 :           --_M_p;</span>
-<span class="lineNum">     136 </span>                :         }
-<span class="lineNum">     137 </span><span class="lineNoCov">              0 :     }</span>
-<span class="lineNum">     138 </span>                : 
-<span class="lineNum">     139 </span>                :     void
-<span class="lineNum">     140 </span><span class="lineNoCov">              0 :     _M_incr(ptrdiff_t __i)</span>
-<span class="lineNum">     141 </span>                :     {
-<span class="lineNum">     142 </span><span class="lineNoCov">              0 :       difference_type __n = __i + _M_offset;</span>
-<span class="lineNum">     143 </span><span class="lineNoCov">              0 :       _M_p += __n / int(_S_word_bit);</span>
-<span class="lineNum">     144 </span><span class="lineNoCov">              0 :       __n = __n % int(_S_word_bit);</span>
-<span class="lineNum">     145 </span><span class="lineNoCov">              0 :       if (__n &lt; 0)</span>
-<span class="lineNum">     146 </span>                :         {
-<span class="lineNum">     147 </span><span class="lineNoCov">              0 :           __n += int(_S_word_bit);</span>
-<span class="lineNum">     148 </span><span class="lineNoCov">              0 :           --_M_p;</span>
-<span class="lineNum">     149 </span>                :         }
-<span class="lineNum">     150 </span><span class="lineNoCov">              0 :       _M_offset = static_cast&lt;unsigned int&gt;(__n);</span>
-<span class="lineNum">     151 </span><span class="lineNoCov">              0 :     }</span>
-<span class="lineNum">     152 </span>                : 
-<span class="lineNum">     153 </span>                :     bool
-<span class="lineNum">     154 </span><span class="lineCov">              3 :     operator==(const _Bit_iterator_base&amp; __i) const</span>
-<span class="lineNum">     155 </span><span class="lineCov">              3 :     { return _M_p == __i._M_p &amp;&amp; _M_offset == __i._M_offset; }</span>
-<span class="lineNum">     156 </span>                : 
-<span class="lineNum">     157 </span>                :     bool
-<span class="lineNum">     158 </span>                :     operator&lt;(const _Bit_iterator_base&amp; __i) const
-<span class="lineNum">     159 </span>                :     {
-<span class="lineNum">     160 </span>                :       return _M_p &lt; __i._M_p
-<span class="lineNum">     161 </span>                :              || (_M_p == __i._M_p &amp;&amp; _M_offset &lt; __i._M_offset);
-<span class="lineNum">     162 </span>                :     }
-<span class="lineNum">     163 </span>                : 
-<span class="lineNum">     164 </span>                :     bool
-<span class="lineNum">     165 </span>                :     operator!=(const _Bit_iterator_base&amp; __i) const
-<span class="lineNum">     166 </span>                :     { return !(*this == __i); }
-<span class="lineNum">     167 </span>                : 
-<span class="lineNum">     168 </span>                :     bool
-<span class="lineNum">     169 </span>                :     operator&gt;(const _Bit_iterator_base&amp; __i) const
-<span class="lineNum">     170 </span>                :     { return __i &lt; *this; }
-<span class="lineNum">     171 </span>                : 
-<span class="lineNum">     172 </span>                :     bool
-<span class="lineNum">     173 </span>                :     operator&lt;=(const _Bit_iterator_base&amp; __i) const
-<span class="lineNum">     174 </span>                :     { return !(__i &lt; *this); }
-<span class="lineNum">     175 </span>                : 
-<span class="lineNum">     176 </span>                :     bool
-<span class="lineNum">     177 </span>                :     operator&gt;=(const _Bit_iterator_base&amp; __i) const
-<span class="lineNum">     178 </span>                :     { return !(*this &lt; __i); }
-<span class="lineNum">     179 </span>                :   };
-<span class="lineNum">     180 </span>                : 
-<span class="lineNum">     181 </span>                :   inline ptrdiff_t
-<span class="lineNum">     182 </span><span class="lineCov">              9 :   operator-(const _Bit_iterator_base&amp; __x, const _Bit_iterator_base&amp; __y)</span>
-<span class="lineNum">     183 </span>                :   {
-<span class="lineNum">     184 </span>                :     return (int(_S_word_bit) * (__x._M_p - __y._M_p)
-<span class="lineNum">     185 </span><span class="lineCov">              9 :             + __x._M_offset - __y._M_offset);</span>
-<span class="lineNum">     186 </span>                :   }
-<span class="lineNum">     187 </span>                : 
-<span class="lineNum">     188 </span>                :   struct _Bit_iterator : public _Bit_iterator_base
-<span class="lineNum">     189 </span>                :   {
-<span class="lineNum">     190 </span>                :     typedef _Bit_reference  reference;
-<span class="lineNum">     191 </span>                :     typedef _Bit_reference* pointer;
-<span class="lineNum">     192 </span>                :     typedef _Bit_iterator   iterator;
-<span class="lineNum">     193 </span>                : 
-<span class="lineNum">     194 </span><span class="lineCov">              2 :     _Bit_iterator() : _Bit_iterator_base(0, 0) { }</span>
-<span class="lineNum">     195 </span>                : 
-<span class="lineNum">     196 </span><span class="lineCov">              3 :     _Bit_iterator(_Bit_type * __x, unsigned int __y)</span>
-<span class="lineNum">     197 </span><span class="lineCov">              3 :     : _Bit_iterator_base(__x, __y) { }</span>
-<span class="lineNum">     198 </span>                : 
-<span class="lineNum">     199 </span>                :     reference
-<span class="lineNum">     200 </span><span class="lineCov">              2 :     operator*() const</span>
-<span class="lineNum">     201 </span><span class="lineCov">              2 :     { return reference(_M_p, 1UL &lt;&lt; _M_offset); }</span>
-<span class="lineNum">     202 </span>                : 
-<span class="lineNum">     203 </span>                :     iterator&amp;
-<span class="lineNum">     204 </span><span class="lineNoCov">              0 :     operator++()</span>
-<span class="lineNum">     205 </span>                :     {
-<span class="lineNum">     206 </span><span class="lineNoCov">              0 :       _M_bump_up();</span>
-<span class="lineNum">     207 </span><span class="lineNoCov">              0 :       return *this;</span>
-<span class="lineNum">     208 </span>                :     }
-<span class="lineNum">     209 </span>                : 
-<span class="lineNum">     210 </span>                :     iterator
-<span class="lineNum">     211 </span><span class="lineCov">              2 :     operator++(int)</span>
-<span class="lineNum">     212 </span>                :     {
-<span class="lineNum">     213 </span><span class="lineCov">              2 :       iterator __tmp = *this;</span>
-<span class="lineNum">     214 </span><span class="lineCov">              2 :       _M_bump_up();</span>
-<span class="lineNum">     215 </span>                :       return __tmp;
-<span class="lineNum">     216 </span>                :     }
-<span class="lineNum">     217 </span>                : 
-<span class="lineNum">     218 </span>                :     iterator&amp;
-<span class="lineNum">     219 </span><span class="lineNoCov">              0 :     operator--()</span>
-<span class="lineNum">     220 </span>                :     {
-<span class="lineNum">     221 </span><span class="lineNoCov">              0 :       _M_bump_down();</span>
-<span class="lineNum">     222 </span><span class="lineNoCov">              0 :       return *this;</span>
-<span class="lineNum">     223 </span>                :     }
-<span class="lineNum">     224 </span>                : 
-<span class="lineNum">     225 </span>                :     iterator
-<span class="lineNum">     226 </span>                :     operator--(int)
-<span class="lineNum">     227 </span>                :     {
-<span class="lineNum">     228 </span>                :       iterator __tmp = *this;
-<span class="lineNum">     229 </span>                :       _M_bump_down();
-<span class="lineNum">     230 </span>                :       return __tmp;
-<span class="lineNum">     231 </span>                :     }
-<span class="lineNum">     232 </span>                : 
-<span class="lineNum">     233 </span>                :     iterator&amp;
-<span class="lineNum">     234 </span><span class="lineNoCov">              0 :     operator+=(difference_type __i)</span>
-<span class="lineNum">     235 </span>                :     {
-<span class="lineNum">     236 </span><span class="lineNoCov">              0 :       _M_incr(__i);</span>
-<span class="lineNum">     237 </span><span class="lineNoCov">              0 :       return *this;</span>
-<span class="lineNum">     238 </span>                :     }
-<span class="lineNum">     239 </span>                : 
-<span class="lineNum">     240 </span>                :     iterator&amp;
-<span class="lineNum">     241 </span>                :     operator-=(difference_type __i)
-<span class="lineNum">     242 </span>                :     {
-<span class="lineNum">     243 </span>                :       *this += -__i;
-<span class="lineNum">     244 </span>                :       return *this;
-<span class="lineNum">     245 </span>                :     }
-<span class="lineNum">     246 </span>                : 
-<span class="lineNum">     247 </span>                :     iterator
-<span class="lineNum">     248 </span><span class="lineNoCov">              0 :     operator+(difference_type __i) const</span>
-<span class="lineNum">     249 </span>                :     {
-<span class="lineNum">     250 </span><span class="lineNoCov">              0 :       iterator __tmp = *this;</span>
-<span class="lineNum">     251 </span><span class="lineNoCov">              0 :       return __tmp += __i;</span>
-<span class="lineNum">     252 </span>                :     }
-<span class="lineNum">     253 </span>                : 
-<span class="lineNum">     254 </span>                :     iterator
-<span class="lineNum">     255 </span>                :     operator-(difference_type __i) const
-<span class="lineNum">     256 </span>                :     {
-<span class="lineNum">     257 </span>                :       iterator __tmp = *this;
-<span class="lineNum">     258 </span>                :       return __tmp -= __i;
-<span class="lineNum">     259 </span>                :     }
-<span class="lineNum">     260 </span>                : 
-<span class="lineNum">     261 </span>                :     reference
-<span class="lineNum">     262 </span>                :     operator[](difference_type __i) const
-<span class="lineNum">     263 </span>                :     { return *(*this + __i); }
-<span class="lineNum">     264 </span>                :   };
-<span class="lineNum">     265 </span>                : 
-<span class="lineNum">     266 </span>                :   inline _Bit_iterator
-<span class="lineNum">     267 </span>                :   operator+(ptrdiff_t __n, const _Bit_iterator&amp; __x)
-<span class="lineNum">     268 </span>                :   { return __x + __n; }
-<span class="lineNum">     269 </span>                : 
-<span class="lineNum">     270 </span>                :   struct _Bit_const_iterator : public _Bit_iterator_base
-<span class="lineNum">     271 </span>                :   {
-<span class="lineNum">     272 </span>                :     typedef bool                 reference;
-<span class="lineNum">     273 </span>                :     typedef bool                 const_reference;
-<span class="lineNum">     274 </span>                :     typedef const bool*          pointer;
-<span class="lineNum">     275 </span>                :     typedef _Bit_const_iterator  const_iterator;
-<span class="lineNum">     276 </span>                : 
-<span class="lineNum">     277 </span>                :     _Bit_const_iterator() : _Bit_iterator_base(0, 0) { }
-<span class="lineNum">     278 </span>                : 
-<span class="lineNum">     279 </span><span class="lineCov">              4 :     _Bit_const_iterator(_Bit_type * __x, unsigned int __y)</span>
-<span class="lineNum">     280 </span><span class="lineCov">              4 :     : _Bit_iterator_base(__x, __y) { }</span>
-<span class="lineNum">     281 </span>                : 
-<span class="lineNum">     282 </span><span class="lineCov">             22 :     _Bit_const_iterator(const _Bit_iterator&amp; __x)</span>
-<span class="lineNum">     283 </span><span class="lineCov">             22 :     : _Bit_iterator_base(__x._M_p, __x._M_offset) { }</span>
-<span class="lineNum">     284 </span>                : 
-<span class="lineNum">     285 </span>                :     const_reference
-<span class="lineNum">     286 </span><span class="lineCov">              3 :     operator*() const</span>
-<span class="lineNum">     287 </span><span class="lineCov">              3 :     { return _Bit_reference(_M_p, 1UL &lt;&lt; _M_offset); }</span>
-<span class="lineNum">     288 </span>                : 
-<span class="lineNum">     289 </span>                :     const_iterator&amp;
-<span class="lineNum">     290 </span><span class="lineNoCov">              0 :     operator++()</span>
-<span class="lineNum">     291 </span>                :     {
-<span class="lineNum">     292 </span><span class="lineNoCov">              0 :       _M_bump_up();</span>
-<span class="lineNum">     293 </span><span class="lineNoCov">              0 :       return *this;</span>
-<span class="lineNum">     294 </span>                :     }
-<span class="lineNum">     295 </span>                : 
-<span class="lineNum">     296 </span>                :     const_iterator
-<span class="lineNum">     297 </span>                :     operator++(int)
-<span class="lineNum">     298 </span>                :     {
-<span class="lineNum">     299 </span>                :       const_iterator __tmp = *this;
-<span class="lineNum">     300 </span>                :       _M_bump_up();
-<span class="lineNum">     301 </span>                :       return __tmp;
-<span class="lineNum">     302 </span>                :     }
-<span class="lineNum">     303 </span>                : 
-<span class="lineNum">     304 </span>                :     const_iterator&amp;
-<span class="lineNum">     305 </span>                :     operator--()
-<span class="lineNum">     306 </span>                :     {
-<span class="lineNum">     307 </span>                :       _M_bump_down();
-<span class="lineNum">     308 </span>                :       return *this;
-<span class="lineNum">     309 </span>                :     }
-<span class="lineNum">     310 </span>                : 
-<span class="lineNum">     311 </span>                :     const_iterator
-<span class="lineNum">     312 </span>                :     operator--(int)
-<span class="lineNum">     313 </span>                :     {
-<span class="lineNum">     314 </span>                :       const_iterator __tmp = *this;
-<span class="lineNum">     315 </span>                :       _M_bump_down();
-<span class="lineNum">     316 </span>                :       return __tmp;
-<span class="lineNum">     317 </span>                :     }
-<span class="lineNum">     318 </span>                : 
-<span class="lineNum">     319 </span>                :     const_iterator&amp;
-<span class="lineNum">     320 </span>                :     operator+=(difference_type __i)
-<span class="lineNum">     321 </span>                :     {
-<span class="lineNum">     322 </span>                :       _M_incr(__i);
-<span class="lineNum">     323 </span>                :       return *this;
-<span class="lineNum">     324 </span>                :     }
-<span class="lineNum">     325 </span>                : 
-<span class="lineNum">     326 </span>                :     const_iterator&amp;
-<span class="lineNum">     327 </span>                :     operator-=(difference_type __i)
-<span class="lineNum">     328 </span>                :     {
-<span class="lineNum">     329 </span>                :       *this += -__i;
-<span class="lineNum">     330 </span>                :       return *this;
-<span class="lineNum">     331 </span>                :     }
-<span class="lineNum">     332 </span>                : 
-<span class="lineNum">     333 </span>                :     const_iterator 
-<span class="lineNum">     334 </span>                :     operator+(difference_type __i) const
-<span class="lineNum">     335 </span>                :     {
-<span class="lineNum">     336 </span>                :       const_iterator __tmp = *this;
-<span class="lineNum">     337 </span>                :       return __tmp += __i;
-<span class="lineNum">     338 </span>                :     }
-<span class="lineNum">     339 </span>                : 
-<span class="lineNum">     340 </span>                :     const_iterator
-<span class="lineNum">     341 </span>                :     operator-(difference_type __i) const
-<span class="lineNum">     342 </span>                :     {
-<span class="lineNum">     343 </span>                :       const_iterator __tmp = *this;
-<span class="lineNum">     344 </span>                :       return __tmp -= __i;
-<span class="lineNum">     345 </span>                :     }
-<span class="lineNum">     346 </span>                : 
-<span class="lineNum">     347 </span>                :     const_reference
-<span class="lineNum">     348 </span>                :     operator[](difference_type __i) const
-<span class="lineNum">     349 </span>                :     { return *(*this + __i); }
-<span class="lineNum">     350 </span>                :   };
-<span class="lineNum">     351 </span>                : 
-<span class="lineNum">     352 </span>                :   inline _Bit_const_iterator
-<span class="lineNum">     353 </span>                :   operator+(ptrdiff_t __n, const _Bit_const_iterator&amp; __x)
-<span class="lineNum">     354 </span>                :   { return __x + __n; }
-<span class="lineNum">     355 </span>                : 
-<span class="lineNum">     356 </span>                :   inline void
-<span class="lineNum">     357 </span>                :   __fill_bvector(_Bit_iterator __first, _Bit_iterator __last, bool __x)
-<span class="lineNum">     358 </span>                :   {
-<span class="lineNum">     359 </span>                :     for (; __first != __last; ++__first)
-<span class="lineNum">     360 </span>                :       *__first = __x;
-<span class="lineNum">     361 </span>                :   }
-<span class="lineNum">     362 </span>                : 
-<span class="lineNum">     363 </span>                :   inline void
-<span class="lineNum">     364 </span>                :   fill(_Bit_iterator __first, _Bit_iterator __last, const bool&amp; __x)
-<span class="lineNum">     365 </span>                :   {
-<span class="lineNum">     366 </span>                :     if (__first._M_p != __last._M_p)
-<span class="lineNum">     367 </span>                :       {
-<span class="lineNum">     368 </span>                :         std::fill(__first._M_p + 1, __last._M_p, __x ? ~0 : 0);
-<span class="lineNum">     369 </span>                :         __fill_bvector(__first, _Bit_iterator(__first._M_p + 1, 0), __x);
-<span class="lineNum">     370 </span>                :         __fill_bvector(_Bit_iterator(__last._M_p, 0), __last, __x);
-<span class="lineNum">     371 </span>                :       }
-<span class="lineNum">     372 </span>                :     else
-<span class="lineNum">     373 </span>                :       __fill_bvector(__first, __last, __x);
-<span class="lineNum">     374 </span>                :   }
-<span class="lineNum">     375 </span>                : 
-<span class="lineNum">     376 </span>                :   template&lt;typename _Alloc&gt;
-<span class="lineNum">     377 </span>                :     struct _Bvector_base
-<span class="lineNum">     378 </span>                :     {
-<span class="lineNum">     379 </span>                :       typedef typename _Alloc::template rebind&lt;_Bit_type&gt;::other
-<span class="lineNum">     380 </span>                :         _Bit_alloc_type;
-<span class="lineNum">     381 </span>                :       
-<span class="lineNum">     382 </span>                :       struct _Bvector_impl
-<span class="lineNum">     383 </span>                :       : public _Bit_alloc_type
-<span class="lineNum">     384 </span><span class="lineCov">              1 :       {</span>
-<span class="lineNum">     385 </span>                :         _Bit_iterator   _M_start;
-<span class="lineNum">     386 </span>                :         _Bit_iterator   _M_finish;
-<span class="lineNum">     387 </span>                :         _Bit_type*      _M_end_of_storage;
-<span class="lineNum">     388 </span>                : 
-<span class="lineNum">     389 </span><span class="lineCov">              1 :         _Bvector_impl()</span>
-<span class="lineNum">     390 </span><span class="lineCov">              1 :         : _Bit_alloc_type(), _M_start(), _M_finish(), _M_end_of_storage(0)</span>
-<span class="lineNum">     391 </span><span class="lineCov">              1 :         { }</span>
-<span class="lineNum">     392 </span>                :  
-<span class="lineNum">     393 </span>                :         _Bvector_impl(const _Bit_alloc_type&amp; __a)
-<span class="lineNum">     394 </span>                :         : _Bit_alloc_type(__a), _M_start(), _M_finish(), _M_end_of_storage(0)
-<span class="lineNum">     395 </span>                :         { }
-<span class="lineNum">     396 </span>                :       };
-<span class="lineNum">     397 </span>                : 
-<span class="lineNum">     398 </span>                :     public:
-<span class="lineNum">     399 </span>                :       typedef _Alloc allocator_type;
-<span class="lineNum">     400 </span>                : 
-<span class="lineNum">     401 </span>                :       _Bit_alloc_type&amp;
-<span class="lineNum">     402 </span>                :       _M_get_Bit_allocator()
-<span class="lineNum">     403 </span>                :       { return *static_cast&lt;_Bit_alloc_type*&gt;(&amp;this-&gt;_M_impl); }
-<span class="lineNum">     404 </span>                : 
-<span class="lineNum">     405 </span>                :       const _Bit_alloc_type&amp;
-<span class="lineNum">     406 </span><span class="lineCov">              2 :       _M_get_Bit_allocator() const</span>
-<span class="lineNum">     407 </span><span class="lineCov">              2 :       { return *static_cast&lt;const _Bit_alloc_type*&gt;(&amp;this-&gt;_M_impl); }</span>
-<span class="lineNum">     408 </span>                : 
-<span class="lineNum">     409 </span>                :       allocator_type
-<span class="lineNum">     410 </span>                :       get_allocator() const
-<span class="lineNum">     411 </span>                :       { return allocator_type(_M_get_Bit_allocator()); }
-<span class="lineNum">     412 </span>                : 
-<span class="lineNum">     413 </span><span class="lineCov">              1 :       _Bvector_base()</span>
-<span class="lineNum">     414 </span><span class="lineCov">              1 :       : _M_impl() { }</span>
-<span class="lineNum">     415 </span>                :       
-<span class="lineNum">     416 </span>                :       _Bvector_base(const allocator_type&amp; __a)
-<span class="lineNum">     417 </span>                :       : _M_impl(__a) { }
-<span class="lineNum">     418 </span>                : 
-<span class="lineNum">     419 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     420 </span>                :       _Bvector_base(_Bvector_base&amp;&amp; __x)
-<span class="lineNum">     421 </span>                :       : _M_impl(__x._M_get_Bit_allocator())
-<span class="lineNum">     422 </span>                :       {
-<span class="lineNum">     423 </span>                :         this-&gt;_M_impl._M_start = __x._M_impl._M_start;
-<span class="lineNum">     424 </span>                :         this-&gt;_M_impl._M_finish = __x._M_impl._M_finish;
-<span class="lineNum">     425 </span>                :         this-&gt;_M_impl._M_end_of_storage = __x._M_impl._M_end_of_storage;
-<span class="lineNum">     426 </span>                :         __x._M_impl._M_start = _Bit_iterator();
-<span class="lineNum">     427 </span>                :         __x._M_impl._M_finish = _Bit_iterator();
-<span class="lineNum">     428 </span>                :         __x._M_impl._M_end_of_storage = 0;
-<span class="lineNum">     429 </span>                :       }
-<span class="lineNum">     430 </span>                : #endif
-<span class="lineNum">     431 </span>                : 
-<span class="lineNum">     432 </span><span class="lineCov">              1 :       ~_Bvector_base()</span>
-<span class="lineNum">     433 </span><span class="lineCov">              1 :       { this-&gt;_M_deallocate(); }</span>
-<span class="lineNum">     434 </span>                : 
-<span class="lineNum">     435 </span>                :     protected:
-<span class="lineNum">     436 </span>                :       _Bvector_impl _M_impl;
-<span class="lineNum">     437 </span>                : 
-<span class="lineNum">     438 </span>                :       _Bit_type*
-<span class="lineNum">     439 </span><span class="lineCov">              1 :       _M_allocate(size_t __n)</span>
-<span class="lineNum">     440 </span>                :       { return _M_impl.allocate((__n + int(_S_word_bit) - 1)
-<span class="lineNum">     441 </span><span class="lineCov">              1 :                                 / int(_S_word_bit)); }</span>
-<span class="lineNum">     442 </span>                : 
-<span class="lineNum">     443 </span>                :       void
-<span class="lineNum">     444 </span><span class="lineCov">              2 :       _M_deallocate()</span>
-<span class="lineNum">     445 </span>                :       {
-<span class="lineNum">     446 </span><span class="lineCov">              2 :         if (_M_impl._M_start._M_p)</span>
-<span class="lineNum">     447 </span><span class="lineCov">              1 :           _M_impl.deallocate(_M_impl._M_start._M_p,</span>
-<span class="lineNum">     448 </span>                :                              _M_impl._M_end_of_storage - _M_impl._M_start._M_p);
-<span class="lineNum">     449 </span><span class="lineCov">              2 :       }</span>
-<span class="lineNum">     450 </span>                :     };
-<span class="lineNum">     451 </span>                : 
-<span class="lineNum">     452 </span>                : _GLIBCXX_END_NESTED_NAMESPACE
-<span class="lineNum">     453 </span>                : 
-<span class="lineNum">     454 </span>                : // Declare a partial specialization of vector&lt;T, Alloc&gt;.
-<span class="lineNum">     455 </span>                : #include &lt;bits/stl_vector.h&gt;
-<span class="lineNum">     456 </span>                : 
-<span class="lineNum">     457 </span>                : _GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D)
-<span class="lineNum">     458 </span>                : 
-<span class="lineNum">     459 </span>                :   /**
-<span class="lineNum">     460 </span>                :    *  @brief  A specialization of vector for booleans which offers fixed time
-<span class="lineNum">     461 </span>                :    *  access to individual elements in any order.
-<span class="lineNum">     462 </span>                :    *
-<span class="lineNum">     463 </span>                :    *  Note that vector&lt;bool&gt; does not actually meet the requirements for being
-<span class="lineNum">     464 </span>                :    *  a container.  This is because the reference and pointer types are not
-<span class="lineNum">     465 </span>                :    *  really references and pointers to bool.  See DR96 for details.  @see
-<span class="lineNum">     466 </span>                :    *  vector for function documentation.
-<span class="lineNum">     467 </span>                :    *
-<span class="lineNum">     468 </span>                :    *  @ingroup Containers
-<span class="lineNum">     469 </span>                :    *  @ingroup Sequences
-<span class="lineNum">     470 </span>                :    *
-<span class="lineNum">     471 </span>                :    *  In some terminology a %vector can be described as a dynamic
-<span class="lineNum">     472 </span>                :    *  C-style array, it offers fast and efficient access to individual
-<span class="lineNum">     473 </span>                :    *  elements in any order and saves the user from worrying about
-<span class="lineNum">     474 </span>                :    *  memory and size allocation.  Subscripting ( @c [] ) access is
-<span class="lineNum">     475 </span>                :    *  also provided as with C-style arrays.
-<span class="lineNum">     476 </span>                :   */
-<span class="lineNum">     477 </span>                : template&lt;typename _Alloc&gt;
-<span class="lineNum">     478 </span>                :   class vector&lt;bool, _Alloc&gt; : protected _Bvector_base&lt;_Alloc&gt;
-<span class="lineNum">     479 </span>                :   {
-<span class="lineNum">     480 </span>                :     typedef _Bvector_base&lt;_Alloc&gt;                  _Base;
-<span class="lineNum">     481 </span>                : 
-<span class="lineNum">     482 </span>                :   public:
-<span class="lineNum">     483 </span>                :     typedef bool                                         value_type;
-<span class="lineNum">     484 </span>                :     typedef size_t                                       size_type;
-<span class="lineNum">     485 </span>                :     typedef ptrdiff_t                                    difference_type;
-<span class="lineNum">     486 </span>                :     typedef _Bit_reference                               reference;
-<span class="lineNum">     487 </span>                :     typedef bool                                         const_reference;
-<span class="lineNum">     488 </span>                :     typedef _Bit_reference*                              pointer;
-<span class="lineNum">     489 </span>                :     typedef const bool*                                  const_pointer;
-<span class="lineNum">     490 </span>                :     typedef _Bit_iterator                                iterator;
-<span class="lineNum">     491 </span>                :     typedef _Bit_const_iterator                          const_iterator;
-<span class="lineNum">     492 </span>                :     typedef std::reverse_iterator&lt;const_iterator&gt;        const_reverse_iterator;
-<span class="lineNum">     493 </span>                :     typedef std::reverse_iterator&lt;iterator&gt;              reverse_iterator;
-<span class="lineNum">     494 </span>                :     typedef _Alloc                                       allocator_type;
-<span class="lineNum">     495 </span>                : 
-<span class="lineNum">     496 </span>                :     allocator_type get_allocator() const
-<span class="lineNum">     497 </span>                :     { return _Base::get_allocator(); }
-<span class="lineNum">     498 </span>                : 
-<span class="lineNum">     499 </span>                :   protected:
-<span class="lineNum">     500 </span>                :     using _Base::_M_allocate;
-<span class="lineNum">     501 </span>                :     using _Base::_M_deallocate;
-<span class="lineNum">     502 </span>                :     using _Base::_M_get_Bit_allocator;
-<span class="lineNum">     503 </span>                : 
-<span class="lineNum">     504 </span>                :   public:
-<span class="lineNum">     505 </span><span class="lineCov">              1 :     vector()</span>
-<span class="lineNum">     506 </span><span class="lineCov">              1 :     : _Base() { }</span>
-<span class="lineNum">     507 </span>                : 
-<span class="lineNum">     508 </span>                :     explicit
-<span class="lineNum">     509 </span>                :     vector(const allocator_type&amp; __a)
-<span class="lineNum">     510 </span>                :     : _Base(__a) { }
-<span class="lineNum">     511 </span>                : 
-<span class="lineNum">     512 </span>                :     explicit
-<span class="lineNum">     513 </span>                :     vector(size_type __n, const bool&amp; __value = bool(), 
-<span class="lineNum">     514 </span>                :            const allocator_type&amp; __a = allocator_type())
-<span class="lineNum">     515 </span>                :     : _Base(__a)
-<span class="lineNum">     516 </span>                :     {
-<span class="lineNum">     517 </span>                :       _M_initialize(__n);
-<span class="lineNum">     518 </span>                :       std::fill(this-&gt;_M_impl._M_start._M_p, this-&gt;_M_impl._M_end_of_storage, 
-<span class="lineNum">     519 </span>                :                 __value ? ~0 : 0);
-<span class="lineNum">     520 </span>                :     }
-<span class="lineNum">     521 </span>                : 
-<span class="lineNum">     522 </span>                :     vector(const vector&amp; __x)
-<span class="lineNum">     523 </span>                :     : _Base(__x._M_get_Bit_allocator())
-<span class="lineNum">     524 </span>                :     {
-<span class="lineNum">     525 </span>                :       _M_initialize(__x.size());
-<span class="lineNum">     526 </span>                :       _M_copy_aligned(__x.begin(), __x.end(), this-&gt;_M_impl._M_start);
-<span class="lineNum">     527 </span>                :     }
-<span class="lineNum">     528 </span>                : 
-<span class="lineNum">     529 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     530 </span>                :     vector(vector&amp;&amp; __x)
-<span class="lineNum">     531 </span>                :     : _Base(std::forward&lt;_Base&gt;(__x)) { }
-<span class="lineNum">     532 </span>                : #endif
-<span class="lineNum">     533 </span>                : 
-<span class="lineNum">     534 </span>                :     template&lt;typename _InputIterator&gt;
-<span class="lineNum">     535 </span>                :       vector(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">     536 </span>                :              const allocator_type&amp; __a = allocator_type())
-<span class="lineNum">     537 </span>                :       : _Base(__a)
-<span class="lineNum">     538 </span>                :       {
-<span class="lineNum">     539 </span>                :         typedef typename std::__is_integer&lt;_InputIterator&gt;::__type _Integral;
-<span class="lineNum">     540 </span>                :         _M_initialize_dispatch(__first, __last, _Integral());
-<span class="lineNum">     541 </span>                :       }
-<span class="lineNum">     542 </span>                : 
-<span class="lineNum">     543 </span><span class="lineCov">              1 :     ~vector() { }</span>
-<span class="lineNum">     544 </span>                : 
-<span class="lineNum">     545 </span>                :     vector&amp;
-<span class="lineNum">     546 </span>                :     operator=(const vector&amp; __x)
-<span class="lineNum">     547 </span>                :     {
-<span class="lineNum">     548 </span>                :       if (&amp;__x == this)
-<span class="lineNum">     549 </span>                :         return *this;
-<span class="lineNum">     550 </span>                :       if (__x.size() &gt; capacity())
-<span class="lineNum">     551 </span>                :         {
-<span class="lineNum">     552 </span>                :           this-&gt;_M_deallocate();
-<span class="lineNum">     553 </span>                :           _M_initialize(__x.size());
-<span class="lineNum">     554 </span>                :         }
-<span class="lineNum">     555 </span>                :       this-&gt;_M_impl._M_finish = _M_copy_aligned(__x.begin(), __x.end(),
-<span class="lineNum">     556 </span>                :                                                 begin());
-<span class="lineNum">     557 </span>                :       return *this;
-<span class="lineNum">     558 </span>                :     }
-<span class="lineNum">     559 </span>                : 
-<span class="lineNum">     560 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     561 </span>                :     vector&amp;
-<span class="lineNum">     562 </span>                :     operator=(vector&amp;&amp; __x)
-<span class="lineNum">     563 </span>                :     {
-<span class="lineNum">     564 </span>                :       // NB: DR 675.
-<span class="lineNum">     565 </span>                :       this-&gt;clear();
-<span class="lineNum">     566 </span>                :       this-&gt;swap(__x); 
-<span class="lineNum">     567 </span>                :       return *this;
-<span class="lineNum">     568 </span>                :     }
-<span class="lineNum">     569 </span>                : #endif
-<span class="lineNum">     570 </span>                : 
-<span class="lineNum">     571 </span>                :     // assign(), a generalized assignment member function.  Two
-<span class="lineNum">     572 </span>                :     // versions: one that takes a count, and one that takes a range.
-<span class="lineNum">     573 </span>                :     // The range version is a member template, so we dispatch on whether
-<span class="lineNum">     574 </span>                :     // or not the type is an integer.
-<span class="lineNum">     575 </span>                :     void
-<span class="lineNum">     576 </span>                :     assign(size_type __n, const bool&amp; __x)
-<span class="lineNum">     577 </span>                :     { _M_fill_assign(__n, __x); }
-<span class="lineNum">     578 </span>                : 
-<span class="lineNum">     579 </span>                :     template&lt;typename _InputIterator&gt;
-<span class="lineNum">     580 </span>                :       void
-<span class="lineNum">     581 </span>                :       assign(_InputIterator __first, _InputIterator __last)
-<span class="lineNum">     582 </span>                :       {
-<span class="lineNum">     583 </span>                :         typedef typename std::__is_integer&lt;_InputIterator&gt;::__type _Integral;
-<span class="lineNum">     584 </span>                :         _M_assign_dispatch(__first, __last, _Integral());
-<span class="lineNum">     585 </span>                :       }
-<span class="lineNum">     586 </span>                : 
-<span class="lineNum">     587 </span>                :     iterator
-<span class="lineNum">     588 </span><span class="lineCov">              1 :     begin()</span>
-<span class="lineNum">     589 </span><span class="lineCov">              1 :     { return this-&gt;_M_impl._M_start; }</span>
-<span class="lineNum">     590 </span>                : 
-<span class="lineNum">     591 </span>                :     const_iterator
-<span class="lineNum">     592 </span><span class="lineCov">             10 :     begin() const</span>
-<span class="lineNum">     593 </span><span class="lineCov">             10 :     { return this-&gt;_M_impl._M_start; }</span>
-<span class="lineNum">     594 </span>                : 
-<span class="lineNum">     595 </span>                :     iterator
-<span class="lineNum">     596 </span><span class="lineCov">              2 :     end()</span>
-<span class="lineNum">     597 </span><span class="lineCov">              2 :     { return this-&gt;_M_impl._M_finish; }</span>
-<span class="lineNum">     598 </span>                : 
-<span class="lineNum">     599 </span>                :     const_iterator
-<span class="lineNum">     600 </span><span class="lineCov">             10 :     end() const</span>
-<span class="lineNum">     601 </span><span class="lineCov">             10 :     { return this-&gt;_M_impl._M_finish; }</span>
-<span class="lineNum">     602 </span>                : 
-<span class="lineNum">     603 </span>                :     reverse_iterator
-<span class="lineNum">     604 </span>                :     rbegin()
-<span class="lineNum">     605 </span>                :     { return reverse_iterator(end()); }
-<span class="lineNum">     606 </span>                : 
-<span class="lineNum">     607 </span>                :     const_reverse_iterator
-<span class="lineNum">     608 </span>                :     rbegin() const
-<span class="lineNum">     609 </span>                :     { return const_reverse_iterator(end()); }
-<span class="lineNum">     610 </span>                : 
-<span class="lineNum">     611 </span>                :     reverse_iterator
-<span class="lineNum">     612 </span>                :     rend()
-<span class="lineNum">     613 </span>                :     { return reverse_iterator(begin()); }
-<span class="lineNum">     614 </span>                : 
-<span class="lineNum">     615 </span>                :     const_reverse_iterator
-<span class="lineNum">     616 </span>                :     rend() const
-<span class="lineNum">     617 </span>                :     { return const_reverse_iterator(begin()); }
-<span class="lineNum">     618 </span>                : 
-<span class="lineNum">     619 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     620 </span>                :     const_iterator
-<span class="lineNum">     621 </span>                :     cbegin() const
-<span class="lineNum">     622 </span>                :     { return this-&gt;_M_impl._M_start; }
-<span class="lineNum">     623 </span>                : 
-<span class="lineNum">     624 </span>                :     const_iterator
-<span class="lineNum">     625 </span>                :     cend() const
-<span class="lineNum">     626 </span>                :     { return this-&gt;_M_impl._M_finish; }
-<span class="lineNum">     627 </span>                : 
-<span class="lineNum">     628 </span>                :     const_reverse_iterator
-<span class="lineNum">     629 </span>                :     crbegin() const
-<span class="lineNum">     630 </span>                :     { return const_reverse_iterator(end()); }
-<span class="lineNum">     631 </span>                : 
-<span class="lineNum">     632 </span>                :     const_reverse_iterator
-<span class="lineNum">     633 </span>                :     crend() const
-<span class="lineNum">     634 </span>                :     { return const_reverse_iterator(begin()); }
-<span class="lineNum">     635 </span>                : #endif
-<span class="lineNum">     636 </span>                : 
-<span class="lineNum">     637 </span>                :     size_type
-<span class="lineNum">     638 </span><span class="lineCov">              7 :     size() const</span>
-<span class="lineNum">     639 </span><span class="lineCov">              7 :     { return size_type(end() - begin()); }</span>
-<span class="lineNum">     640 </span>                : 
-<span class="lineNum">     641 </span>                :     size_type
-<span class="lineNum">     642 </span><span class="lineCov">              2 :     max_size() const</span>
-<span class="lineNum">     643 </span>                :     {
-<span class="lineNum">     644 </span>                :       const size_type __isize =
-<span class="lineNum">     645 </span>                :         __gnu_cxx::__numeric_traits&lt;difference_type&gt;::__max
-<span class="lineNum">     646 </span><span class="lineCov">              2 :         - int(_S_word_bit) + 1;</span>
-<span class="lineNum">     647 </span><span class="lineCov">              2 :       const size_type __asize = _M_get_Bit_allocator().max_size();</span>
-<span class="lineNum">     648 </span>                :       return (__asize &lt;= __isize / int(_S_word_bit)
-<span class="lineNum">     649 </span><span class="lineCov">              2 :               ? __asize * int(_S_word_bit) : __isize);</span>
-<span class="lineNum">     650 </span>                :     }
-<span class="lineNum">     651 </span>                : 
-<span class="lineNum">     652 </span>                :     size_type
-<span class="lineNum">     653 </span>                :     capacity() const
-<span class="lineNum">     654 </span>                :     { return size_type(const_iterator(this-&gt;_M_impl._M_end_of_storage, 0)
-<span class="lineNum">     655 </span>                :                        - begin()); }
-<span class="lineNum">     656 </span>                : 
-<span class="lineNum">     657 </span>                :     bool
-<span class="lineNum">     658 </span><span class="lineCov">              3 :     empty() const</span>
-<span class="lineNum">     659 </span><span class="lineCov">              3 :     { return begin() == end(); }</span>
-<span class="lineNum">     660 </span>                : 
-<span class="lineNum">     661 </span>                :     reference
-<span class="lineNum">     662 </span>                :     operator[](size_type __n)
-<span class="lineNum">     663 </span>                :     {
-<span class="lineNum">     664 </span>                :       return *iterator(this-&gt;_M_impl._M_start._M_p
-<span class="lineNum">     665 </span>                :                        + __n / int(_S_word_bit), __n % int(_S_word_bit));
-<span class="lineNum">     666 </span>                :     }
-<span class="lineNum">     667 </span>                : 
-<span class="lineNum">     668 </span>                :     const_reference
-<span class="lineNum">     669 </span><span class="lineCov">              3 :     operator[](size_type __n) const</span>
-<span class="lineNum">     670 </span>                :     {
-<span class="lineNum">     671 </span>                :       return *const_iterator(this-&gt;_M_impl._M_start._M_p
-<span class="lineNum">     672 </span><span class="lineCov">              3 :                              + __n / int(_S_word_bit), __n % int(_S_word_bit));</span>
-<span class="lineNum">     673 </span>                :     }
-<span class="lineNum">     674 </span>                : 
-<span class="lineNum">     675 </span>                :   protected:
-<span class="lineNum">     676 </span>                :     void
-<span class="lineNum">     677 </span>                :     _M_range_check(size_type __n) const
-<span class="lineNum">     678 </span>                :     {
-<span class="lineNum">     679 </span>                :       if (__n &gt;= this-&gt;size())
-<span class="lineNum">     680 </span>                :         __throw_out_of_range(__N(&quot;vector&lt;bool&gt;::_M_range_check&quot;));
-<span class="lineNum">     681 </span>                :     }
-<span class="lineNum">     682 </span>                : 
-<span class="lineNum">     683 </span>                :   public:
-<span class="lineNum">     684 </span>                :     reference
-<span class="lineNum">     685 </span>                :     at(size_type __n)
-<span class="lineNum">     686 </span>                :     { _M_range_check(__n); return (*this)[__n]; }
-<span class="lineNum">     687 </span>                : 
-<span class="lineNum">     688 </span>                :     const_reference
-<span class="lineNum">     689 </span>                :     at(size_type __n) const
-<span class="lineNum">     690 </span>                :     { _M_range_check(__n); return (*this)[__n]; }
-<span class="lineNum">     691 </span>                : 
-<span class="lineNum">     692 </span>                :     void
-<span class="lineNum">     693 </span>                :     reserve(size_type __n);
-<span class="lineNum">     694 </span>                : 
-<span class="lineNum">     695 </span>                :     reference
-<span class="lineNum">     696 </span>                :     front()
-<span class="lineNum">     697 </span>                :     { return *begin(); }
-<span class="lineNum">     698 </span>                : 
-<span class="lineNum">     699 </span>                :     const_reference
-<span class="lineNum">     700 </span>                :     front() const
-<span class="lineNum">     701 </span>                :     { return *begin(); }
-<span class="lineNum">     702 </span>                : 
-<span class="lineNum">     703 </span>                :     reference
-<span class="lineNum">     704 </span>                :     back()
-<span class="lineNum">     705 </span>                :     { return *(end() - 1); }
-<span class="lineNum">     706 </span>                : 
-<span class="lineNum">     707 </span>                :     const_reference
-<span class="lineNum">     708 </span>                :     back() const
-<span class="lineNum">     709 </span>                :     { return *(end() - 1); }
-<span class="lineNum">     710 </span>                : 
-<span class="lineNum">     711 </span>                :     // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     712 </span>                :     // DR 464. Suggestion for new member functions in standard containers.
-<span class="lineNum">     713 </span>                :     // N.B. DR 464 says nothing about vector&lt;bool&gt; but we need something
-<span class="lineNum">     714 </span>                :     // here due to the way we are implementing DR 464 in the debug-mode
-<span class="lineNum">     715 </span>                :     // vector class.
-<span class="lineNum">     716 </span>                :     void
-<span class="lineNum">     717 </span>                :     data() { }
-<span class="lineNum">     718 </span>                : 
-<span class="lineNum">     719 </span>                :     void
-<span class="lineNum">     720 </span><span class="lineCov">              2 :     push_back(bool __x)</span>
-<span class="lineNum">     721 </span>                :     {
-<span class="lineNum">     722 </span><span class="lineCov">              2 :       if (this-&gt;_M_impl._M_finish._M_p != this-&gt;_M_impl._M_end_of_storage)</span>
-<span class="lineNum">     723 </span><span class="lineCov">              1 :         *this-&gt;_M_impl._M_finish++ = __x;</span>
-<span class="lineNum">     724 </span>                :       else
-<span class="lineNum">     725 </span><span class="lineCov">              1 :         _M_insert_aux(end(), __x);</span>
-<span class="lineNum">     726 </span><span class="lineCov">              2 :     }</span>
-<span class="lineNum">     727 </span>                : 
-<span class="lineNum">     728 </span>                :     void
-<span class="lineNum">     729 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     730 </span>                :     swap(vector&amp;&amp; __x)
-<span class="lineNum">     731 </span>                : #else
-<span class="lineNum">     732 </span>                :     swap(vector&amp; __x)
-<span class="lineNum">     733 </span>                : #endif
-<span class="lineNum">     734 </span>                :     {
-<span class="lineNum">     735 </span>                :       std::swap(this-&gt;_M_impl._M_start, __x._M_impl._M_start);
-<span class="lineNum">     736 </span>                :       std::swap(this-&gt;_M_impl._M_finish, __x._M_impl._M_finish);
-<span class="lineNum">     737 </span>                :       std::swap(this-&gt;_M_impl._M_end_of_storage, 
-<span class="lineNum">     738 </span>                :                 __x._M_impl._M_end_of_storage);
-<span class="lineNum">     739 </span>                : 
-<span class="lineNum">     740 </span>                :       // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     741 </span>                :       // 431. Swapping containers with unequal allocators.
-<span class="lineNum">     742 </span>                :       std::__alloc_swap&lt;typename _Base::_Bit_alloc_type&gt;::
-<span class="lineNum">     743 </span>                :         _S_do_it(_M_get_Bit_allocator(), __x._M_get_Bit_allocator());
-<span class="lineNum">     744 </span>                :     }
-<span class="lineNum">     745 </span>                : 
-<span class="lineNum">     746 </span>                :     // [23.2.5]/1, third-to-last entry in synopsis listing
-<span class="lineNum">     747 </span>                :     static void
-<span class="lineNum">     748 </span>                :     swap(reference __x, reference __y)
-<span class="lineNum">     749 </span>                :     {
-<span class="lineNum">     750 </span>                :       bool __tmp = __x;
-<span class="lineNum">     751 </span>                :       __x = __y;
-<span class="lineNum">     752 </span>                :       __y = __tmp;
-<span class="lineNum">     753 </span>                :     }
-<span class="lineNum">     754 </span>                : 
-<span class="lineNum">     755 </span>                :     iterator
-<span class="lineNum">     756 </span>                :     insert(iterator __position, const bool&amp; __x = bool())
-<span class="lineNum">     757 </span>                :     {
-<span class="lineNum">     758 </span>                :       const difference_type __n = __position - begin();
-<span class="lineNum">     759 </span>                :       if (this-&gt;_M_impl._M_finish._M_p != this-&gt;_M_impl._M_end_of_storage
-<span class="lineNum">     760 </span>                :           &amp;&amp; __position == end())
-<span class="lineNum">     761 </span>                :         *this-&gt;_M_impl._M_finish++ = __x;
-<span class="lineNum">     762 </span>                :       else
-<span class="lineNum">     763 </span>                :         _M_insert_aux(__position, __x);
-<span class="lineNum">     764 </span>                :       return begin() + __n;
-<span class="lineNum">     765 </span>                :     }
-<span class="lineNum">     766 </span>                : 
-<span class="lineNum">     767 </span>                :     template&lt;typename _InputIterator&gt;
-<span class="lineNum">     768 </span>                :       void
-<span class="lineNum">     769 </span>                :       insert(iterator __position,
-<span class="lineNum">     770 </span>                :              _InputIterator __first, _InputIterator __last)
-<span class="lineNum">     771 </span>                :       {
-<span class="lineNum">     772 </span>                :         typedef typename std::__is_integer&lt;_InputIterator&gt;::__type _Integral;
-<span class="lineNum">     773 </span>                :         _M_insert_dispatch(__position, __first, __last, _Integral());
-<span class="lineNum">     774 </span>                :       }
-<span class="lineNum">     775 </span>                : 
-<span class="lineNum">     776 </span>                :     void
-<span class="lineNum">     777 </span>                :     insert(iterator __position, size_type __n, const bool&amp; __x)
-<span class="lineNum">     778 </span>                :     { _M_fill_insert(__position, __n, __x); }
-<span class="lineNum">     779 </span>                : 
-<span class="lineNum">     780 </span>                :     void
-<span class="lineNum">     781 </span>                :     pop_back()
-<span class="lineNum">     782 </span>                :     { --this-&gt;_M_impl._M_finish; }
-<span class="lineNum">     783 </span>                : 
-<span class="lineNum">     784 </span>                :     iterator
-<span class="lineNum">     785 </span>                :     erase(iterator __position)
-<span class="lineNum">     786 </span>                :     {
-<span class="lineNum">     787 </span>                :       if (__position + 1 != end())
-<span class="lineNum">     788 </span>                :         std::copy(__position + 1, end(), __position);
-<span class="lineNum">     789 </span>                :       --this-&gt;_M_impl._M_finish;
-<span class="lineNum">     790 </span>                :       return __position;
-<span class="lineNum">     791 </span>                :     }
-<span class="lineNum">     792 </span>                : 
-<span class="lineNum">     793 </span>                :     iterator
-<span class="lineNum">     794 </span>                :     erase(iterator __first, iterator __last)
-<span class="lineNum">     795 </span>                :     {
-<span class="lineNum">     796 </span>                :       _M_erase_at_end(std::copy(__last, end(), __first));
-<span class="lineNum">     797 </span>                :       return __first;
-<span class="lineNum">     798 </span>                :     }
-<span class="lineNum">     799 </span>                : 
-<span class="lineNum">     800 </span>                :     void
-<span class="lineNum">     801 </span>                :     resize(size_type __new_size, bool __x = bool())
-<span class="lineNum">     802 </span>                :     {
-<span class="lineNum">     803 </span>                :       if (__new_size &lt; size())
-<span class="lineNum">     804 </span>                :         _M_erase_at_end(begin() + difference_type(__new_size));
-<span class="lineNum">     805 </span>                :       else
-<span class="lineNum">     806 </span>                :         insert(end(), __new_size - size(), __x);
-<span class="lineNum">     807 </span>                :     }
-<span class="lineNum">     808 </span>                : 
-<span class="lineNum">     809 </span>                :     void
-<span class="lineNum">     810 </span>                :     flip()
-<span class="lineNum">     811 </span>                :     {
-<span class="lineNum">     812 </span>                :       for (_Bit_type * __p = this-&gt;_M_impl._M_start._M_p;
-<span class="lineNum">     813 </span>                :            __p != this-&gt;_M_impl._M_end_of_storage; ++__p)
-<span class="lineNum">     814 </span>                :         *__p = ~*__p;
-<span class="lineNum">     815 </span>                :     }
-<span class="lineNum">     816 </span>                : 
-<span class="lineNum">     817 </span>                :     void
-<span class="lineNum">     818 </span>                :     clear()
-<span class="lineNum">     819 </span>                :     { _M_erase_at_end(begin()); }
-<span class="lineNum">     820 </span>                : 
-<span class="lineNum">     821 </span>                :    
-<span class="lineNum">     822 </span>                :   protected:
-<span class="lineNum">     823 </span>                :     // Precondition: __first._M_offset == 0 &amp;&amp; __result._M_offset == 0.
-<span class="lineNum">     824 </span>                :     iterator
-<span class="lineNum">     825 </span>                :     _M_copy_aligned(const_iterator __first, const_iterator __last,
-<span class="lineNum">     826 </span><span class="lineCov">              1 :                     iterator __result)</span>
-<span class="lineNum">     827 </span>                :     {
-<span class="lineNum">     828 </span><span class="lineCov">              1 :       _Bit_type* __q = std::copy(__first._M_p, __last._M_p, __result._M_p);</span>
-<span class="lineNum">     829 </span>                :       return std::copy(const_iterator(__last._M_p, 0), __last,
-<span class="lineNum">     830 </span><span class="lineCov">              1 :                        iterator(__q, 0));</span>
-<span class="lineNum">     831 </span>                :     }
-<span class="lineNum">     832 </span>                : 
-<span class="lineNum">     833 </span>                :     void
-<span class="lineNum">     834 </span>                :     _M_initialize(size_type __n)
-<span class="lineNum">     835 </span>                :     {
-<span class="lineNum">     836 </span>                :       _Bit_type* __q = this-&gt;_M_allocate(__n);
-<span class="lineNum">     837 </span>                :       this-&gt;_M_impl._M_end_of_storage = (__q
-<span class="lineNum">     838 </span>                :                                          + ((__n + int(_S_word_bit) - 1)
-<span class="lineNum">     839 </span>                :                                             / int(_S_word_bit)));
-<span class="lineNum">     840 </span>                :       this-&gt;_M_impl._M_start = iterator(__q, 0);
-<span class="lineNum">     841 </span>                :       this-&gt;_M_impl._M_finish = this-&gt;_M_impl._M_start + difference_type(__n);
-<span class="lineNum">     842 </span>                :     }
-<span class="lineNum">     843 </span>                : 
-<span class="lineNum">     844 </span>                :     // Check whether it's an integral type.  If so, it's not an iterator.
-<span class="lineNum">     845 </span>                : 
-<span class="lineNum">     846 </span>                :     // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     847 </span>                :     // 438. Ambiguity in the &quot;do the right thing&quot; clause
-<span class="lineNum">     848 </span>                :     template&lt;typename _Integer&gt;
-<span class="lineNum">     849 </span>                :       void
-<span class="lineNum">     850 </span>                :       _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type)
-<span class="lineNum">     851 </span>                :       {
-<span class="lineNum">     852 </span>                :         _M_initialize(static_cast&lt;size_type&gt;(__n));
-<span class="lineNum">     853 </span>                :         std::fill(this-&gt;_M_impl._M_start._M_p, 
-<span class="lineNum">     854 </span>                :                   this-&gt;_M_impl._M_end_of_storage, __x ? ~0 : 0);
-<span class="lineNum">     855 </span>                :       }
-<span class="lineNum">     856 </span>                : 
-<span class="lineNum">     857 </span>                :     template&lt;typename _InputIterator&gt;
-<span class="lineNum">     858 </span>                :       void 
-<span class="lineNum">     859 </span>                :       _M_initialize_dispatch(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">     860 </span>                :                              __false_type)
-<span class="lineNum">     861 </span>                :       { _M_initialize_range(__first, __last, 
-<span class="lineNum">     862 </span>                :                             std::__iterator_category(__first)); }
-<span class="lineNum">     863 </span>                : 
-<span class="lineNum">     864 </span>                :     template&lt;typename _InputIterator&gt;
-<span class="lineNum">     865 </span>                :       void
-<span class="lineNum">     866 </span>                :       _M_initialize_range(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">     867 </span>                :                           std::input_iterator_tag)
-<span class="lineNum">     868 </span>                :       {
-<span class="lineNum">     869 </span>                :         for (; __first != __last; ++__first)
-<span class="lineNum">     870 </span>                :           push_back(*__first);
-<span class="lineNum">     871 </span>                :       }
-<span class="lineNum">     872 </span>                : 
-<span class="lineNum">     873 </span>                :     template&lt;typename _ForwardIterator&gt;
-<span class="lineNum">     874 </span>                :       void
-<span class="lineNum">     875 </span>                :       _M_initialize_range(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">     876 </span>                :                           std::forward_iterator_tag)
-<span class="lineNum">     877 </span>                :       {
-<span class="lineNum">     878 </span>                :         const size_type __n = std::distance(__first, __last);
-<span class="lineNum">     879 </span>                :         _M_initialize(__n);
-<span class="lineNum">     880 </span>                :         std::copy(__first, __last, this-&gt;_M_impl._M_start);
-<span class="lineNum">     881 </span>                :       }
-<span class="lineNum">     882 </span>                : 
-<span class="lineNum">     883 </span>                :     // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     884 </span>                :     // 438. Ambiguity in the &quot;do the right thing&quot; clause
-<span class="lineNum">     885 </span>                :     template&lt;typename _Integer&gt;
-<span class="lineNum">     886 </span>                :       void
-<span class="lineNum">     887 </span>                :       _M_assign_dispatch(_Integer __n, _Integer __val, __true_type)
-<span class="lineNum">     888 </span>                :       { _M_fill_assign(__n, __val); }
-<span class="lineNum">     889 </span>                : 
-<span class="lineNum">     890 </span>                :     template&lt;class _InputIterator&gt;
-<span class="lineNum">     891 </span>                :       void
-<span class="lineNum">     892 </span>                :       _M_assign_dispatch(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">     893 </span>                :                          __false_type)
-<span class="lineNum">     894 </span>                :       { _M_assign_aux(__first, __last, std::__iterator_category(__first)); }
-<span class="lineNum">     895 </span>                : 
-<span class="lineNum">     896 </span>                :     void
-<span class="lineNum">     897 </span>                :     _M_fill_assign(size_t __n, bool __x)
-<span class="lineNum">     898 </span>                :     {
-<span class="lineNum">     899 </span>                :       if (__n &gt; size())
-<span class="lineNum">     900 </span>                :         {
-<span class="lineNum">     901 </span>                :           std::fill(this-&gt;_M_impl._M_start._M_p, 
-<span class="lineNum">     902 </span>                :                     this-&gt;_M_impl._M_end_of_storage, __x ? ~0 : 0);
-<span class="lineNum">     903 </span>                :           insert(end(), __n - size(), __x);
-<span class="lineNum">     904 </span>                :         }
-<span class="lineNum">     905 </span>                :       else
-<span class="lineNum">     906 </span>                :         {
-<span class="lineNum">     907 </span>                :           _M_erase_at_end(begin() + __n);
-<span class="lineNum">     908 </span>                :           std::fill(this-&gt;_M_impl._M_start._M_p, 
-<span class="lineNum">     909 </span>                :                     this-&gt;_M_impl._M_end_of_storage, __x ? ~0 : 0);
-<span class="lineNum">     910 </span>                :         }
-<span class="lineNum">     911 </span>                :     }
-<span class="lineNum">     912 </span>                : 
-<span class="lineNum">     913 </span>                :     template&lt;typename _InputIterator&gt;
-<span class="lineNum">     914 </span>                :       void
-<span class="lineNum">     915 </span>                :       _M_assign_aux(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">     916 </span>                :                     std::input_iterator_tag)
-<span class="lineNum">     917 </span>                :       {
-<span class="lineNum">     918 </span>                :         iterator __cur = begin();
-<span class="lineNum">     919 </span>                :         for (; __first != __last &amp;&amp; __cur != end(); ++__cur, ++__first)
-<span class="lineNum">     920 </span>                :           *__cur = *__first;
-<span class="lineNum">     921 </span>                :         if (__first == __last)
-<span class="lineNum">     922 </span>                :           _M_erase_at_end(__cur);
-<span class="lineNum">     923 </span>                :         else
-<span class="lineNum">     924 </span>                :           insert(end(), __first, __last);
-<span class="lineNum">     925 </span>                :       }
-<span class="lineNum">     926 </span>                :     
-<span class="lineNum">     927 </span>                :     template&lt;typename _ForwardIterator&gt;
-<span class="lineNum">     928 </span>                :       void
-<span class="lineNum">     929 </span>                :       _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">     930 </span>                :                     std::forward_iterator_tag)
-<span class="lineNum">     931 </span>                :       {
-<span class="lineNum">     932 </span>                :         const size_type __len = std::distance(__first, __last);
-<span class="lineNum">     933 </span>                :         if (__len &lt; size())
-<span class="lineNum">     934 </span>                :           _M_erase_at_end(std::copy(__first, __last, begin()));
-<span class="lineNum">     935 </span>                :         else
-<span class="lineNum">     936 </span>                :           {
-<span class="lineNum">     937 </span>                :             _ForwardIterator __mid = __first;
-<span class="lineNum">     938 </span>                :             std::advance(__mid, size());
-<span class="lineNum">     939 </span>                :             std::copy(__first, __mid, begin());
-<span class="lineNum">     940 </span>                :             insert(end(), __mid, __last);
-<span class="lineNum">     941 </span>                :           }
-<span class="lineNum">     942 </span>                :       }
-<span class="lineNum">     943 </span>                : 
-<span class="lineNum">     944 </span>                :     // Check whether it's an integral type.  If so, it's not an iterator.
-<span class="lineNum">     945 </span>                : 
-<span class="lineNum">     946 </span>                :     // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     947 </span>                :     // 438. Ambiguity in the &quot;do the right thing&quot; clause
-<span class="lineNum">     948 </span>                :     template&lt;typename _Integer&gt;
-<span class="lineNum">     949 </span>                :       void
-<span class="lineNum">     950 </span>                :       _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x,
-<span class="lineNum">     951 </span>                :                          __true_type)
-<span class="lineNum">     952 </span>                :       { _M_fill_insert(__pos, __n, __x); }
-<span class="lineNum">     953 </span>                : 
-<span class="lineNum">     954 </span>                :     template&lt;typename _InputIterator&gt;
-<span class="lineNum">     955 </span>                :       void
-<span class="lineNum">     956 </span>                :       _M_insert_dispatch(iterator __pos,
-<span class="lineNum">     957 </span>                :                          _InputIterator __first, _InputIterator __last,
-<span class="lineNum">     958 </span>                :                          __false_type)
-<span class="lineNum">     959 </span>                :       { _M_insert_range(__pos, __first, __last,
-<span class="lineNum">     960 </span>                :                         std::__iterator_category(__first)); }
-<span class="lineNum">     961 </span>                : 
-<span class="lineNum">     962 </span>                :     void
-<span class="lineNum">     963 </span>                :     _M_fill_insert(iterator __position, size_type __n, bool __x);
-<span class="lineNum">     964 </span>                : 
-<span class="lineNum">     965 </span>                :     template&lt;typename _InputIterator&gt;
-<span class="lineNum">     966 </span>                :       void
-<span class="lineNum">     967 </span>                :       _M_insert_range(iterator __pos, _InputIterator __first, 
-<span class="lineNum">     968 </span>                :                       _InputIterator __last, std::input_iterator_tag)
-<span class="lineNum">     969 </span>                :       {
-<span class="lineNum">     970 </span>                :         for (; __first != __last; ++__first)
-<span class="lineNum">     971 </span>                :           {
-<span class="lineNum">     972 </span>                :             __pos = insert(__pos, *__first);
-<span class="lineNum">     973 </span>                :             ++__pos;
-<span class="lineNum">     974 </span>                :           }
-<span class="lineNum">     975 </span>                :       }
-<span class="lineNum">     976 </span>                : 
-<span class="lineNum">     977 </span>                :     template&lt;typename _ForwardIterator&gt;
-<span class="lineNum">     978 </span>                :       void
-<span class="lineNum">     979 </span>                :       _M_insert_range(iterator __position, _ForwardIterator __first, 
-<span class="lineNum">     980 </span>                :                       _ForwardIterator __last, std::forward_iterator_tag);
-<span class="lineNum">     981 </span>                : 
-<span class="lineNum">     982 </span>                :     void
-<span class="lineNum">     983 </span>                :     _M_insert_aux(iterator __position, bool __x);
-<span class="lineNum">     984 </span>                : 
-<span class="lineNum">     985 </span>                :     size_type
-<span class="lineNum">     986 </span><span class="lineCov">              1 :     _M_check_len(size_type __n, const char* __s) const</span>
-<span class="lineNum">     987 </span>                :     {
-<span class="lineNum">     988 </span><span class="lineCov">              1 :       if (max_size() - size() &lt; __n)</span>
-<span class="lineNum">     989 </span><span class="lineNoCov">              0 :         __throw_length_error(__N(__s));</span>
-<span class="lineNum">     990 </span>                : 
-<span class="lineNum">     991 </span><span class="lineCov">              1 :       const size_type __len = size() + std::max(size(), __n);</span>
-<span class="lineNum">     992 </span><span class="lineCov">              1 :       return (__len &lt; size() || __len &gt; max_size()) ? max_size() : __len;</span>
-<span class="lineNum">     993 </span>                :     }
-<span class="lineNum">     994 </span>                : 
-<span class="lineNum">     995 </span>                :     void
-<span class="lineNum">     996 </span>                :     _M_erase_at_end(iterator __pos)
-<span class="lineNum">     997 </span>                :     { this-&gt;_M_impl._M_finish = __pos; }
-<span class="lineNum">     998 </span>                :   };
-<span class="lineNum">     999 </span>                : 
-<span class="lineNum">    1000 </span>                : _GLIBCXX_END_NESTED_NAMESPACE
-<span class="lineNum">    1001 </span>                : 
-<span class="lineNum">    1002 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/bits/stl_construct.h.gcov.html b/rep/usr/include/c++/4.3/bits/stl_construct.h.gcov.html
deleted file mode 100644
index 82847c7..0000000
--- a/rep/usr/include/c++/4.3/bits/stl_construct.h.gcov.html
+++ /dev/null
@@ -1,201 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_construct.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_construct.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">12</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">12</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // nonstandard construct and destroy functions -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
-<span class="lineNum">       4 </span>                : // Free Software Foundation, Inc.
-<span class="lineNum">       5 </span>                : //
-<span class="lineNum">       6 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       7 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       8 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">       9 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      10 </span>                : // any later version.
-<span class="lineNum">      11 </span>                : 
-<span class="lineNum">      12 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      13 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      14 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      15 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      16 </span>                : 
-<span class="lineNum">      17 </span>                : // You should have received a copy of the GNU General Public License along
-<span class="lineNum">      18 </span>                : // with this library; see the file COPYING.  If not, write to the Free
-<span class="lineNum">      19 </span>                : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-<span class="lineNum">      20 </span>                : // USA.
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      23 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      24 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      25 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      26 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      27 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      28 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      29 </span>                : // the GNU General Public License.
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : /*
-<span class="lineNum">      32 </span>                :  *
-<span class="lineNum">      33 </span>                :  * Copyright (c) 1994
-<span class="lineNum">      34 </span>                :  * Hewlett-Packard Company
-<span class="lineNum">      35 </span>                :  *
-<span class="lineNum">      36 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      37 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      38 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      39 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      40 </span>                :  * in supporting documentation.  Hewlett-Packard Company makes no
-<span class="lineNum">      41 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      42 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      43 </span>                :  *
-<span class="lineNum">      44 </span>                :  *
-<span class="lineNum">      45 </span>                :  * Copyright (c) 1996,1997
-<span class="lineNum">      46 </span>                :  * Silicon Graphics Computer Systems, Inc.
-<span class="lineNum">      47 </span>                :  *
-<span class="lineNum">      48 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      49 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      50 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      51 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      52 </span>                :  * in supporting documentation.  Silicon Graphics makes no
-<span class="lineNum">      53 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      54 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      55 </span>                :  */
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span>                : /** @file stl_construct.h
-<span class="lineNum">      58 </span>                :  *  This is an internal header file, included by other library headers.
-<span class="lineNum">      59 </span>                :  *  You should not attempt to use it directly.
-<span class="lineNum">      60 </span>                :  */
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span>                : #ifndef _STL_CONSTRUCT_H
-<span class="lineNum">      63 </span>                : #define _STL_CONSTRUCT_H 1
-<span class="lineNum">      64 </span>                : 
-<span class="lineNum">      65 </span>                : #include &lt;new&gt;
-<span class="lineNum">      66 </span>                : 
-<span class="lineNum">      67 </span>                : _GLIBCXX_BEGIN_NAMESPACE(std)
-<span class="lineNum">      68 </span>                : 
-<span class="lineNum">      69 </span>                :   /**
-<span class="lineNum">      70 </span>                :    * Constructs an object in existing memory by invoking an allocated
-<span class="lineNum">      71 </span>                :    * object's constructor with an initializer.
-<span class="lineNum">      72 </span>                :    */
-<span class="lineNum">      73 </span>                :   template&lt;typename _T1, typename _T2&gt;
-<span class="lineNum">      74 </span>                :     inline void
-<span class="lineNum">      75 </span><span class="lineCov">          23695 :     _Construct(_T1* __p, const _T2&amp; __value)</span>
-<span class="lineNum">      76 </span>                :     {
-<span class="lineNum">      77 </span>                :       // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">      78 </span>                :       // 402. wrong new expression in [some_]allocator::construct
-<span class="lineNum">      79 </span><span class="lineCov">          23695 :       ::new(static_cast&lt;void*&gt;(__p)) _T1(__value);</span>
-<span class="lineNum">      80 </span><span class="lineCov">          23695 :     }</span>
-<span class="lineNum">      81 </span>                : 
-<span class="lineNum">      82 </span>                :   /**
-<span class="lineNum">      83 </span>                :    * Destroy the object pointed to by a pointer type.
-<span class="lineNum">      84 </span>                :    */
-<span class="lineNum">      85 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">      86 </span>                :     inline void
-<span class="lineNum">      87 </span><span class="lineCov">          82748 :     _Destroy(_Tp* __pointer)</span>
-<span class="lineNum">      88 </span><span class="lineCov">          82748 :     { __pointer-&gt;~_Tp(); }</span>
-<span class="lineNum">      89 </span>                : 
-<span class="lineNum">      90 </span>                :   /**
-<span class="lineNum">      91 </span>                :    * Destroy a range of objects.  If the value_type of the object has
-<span class="lineNum">      92 </span>                :    * a trivial destructor, the compiler should optimize all of this
-<span class="lineNum">      93 </span>                :    * away, otherwise the objects' destructors must be invoked.
-<span class="lineNum">      94 </span>                :    */
-<span class="lineNum">      95 </span>                :   template&lt;typename _ForwardIterator&gt;
-<span class="lineNum">      96 </span>                :     inline void
-<span class="lineNum">      97 </span><span class="lineCov">          33441 :     _Destroy(_ForwardIterator __first, _ForwardIterator __last)</span>
-<span class="lineNum">      98 </span>                :     {
-<span class="lineNum">      99 </span>                :       typedef typename iterator_traits&lt;_ForwardIterator&gt;::value_type
-<span class="lineNum">     100 </span>                :                        _Value_type;
-<span class="lineNum">     101 </span><span class="lineCov">          91960 :       if (!__has_trivial_destructor(_Value_type))</span>
-<span class="lineNum">     102 </span>                :         for (; __first != __last; ++__first)
-<span class="lineNum">     103 </span><span class="lineCov">          82748 :           std::_Destroy(&amp;*__first);</span>
-<span class="lineNum">     104 </span><span class="lineCov">          33441 :     }</span>
-<span class="lineNum">     105 </span>                : 
-<span class="lineNum">     106 </span>                :   /**
-<span class="lineNum">     107 </span>                :    * Destroy a range of objects using the supplied allocator.  For
-<span class="lineNum">     108 </span>                :    * nondefault allocators we do not optimize away invocation of 
-<span class="lineNum">     109 </span>                :    * destroy() even if _Tp has a trivial destructor.
-<span class="lineNum">     110 </span>                :    */
-<span class="lineNum">     111 </span>                : 
-<span class="lineNum">     112 </span>                :   template &lt;typename _Tp&gt; class allocator;
-<span class="lineNum">     113 </span>                : 
-<span class="lineNum">     114 </span>                :   template&lt;typename _ForwardIterator, typename _Allocator&gt;
-<span class="lineNum">     115 </span>                :     void
-<span class="lineNum">     116 </span>                :     _Destroy(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">     117 </span>                :              _Allocator&amp; __alloc)
-<span class="lineNum">     118 </span>                :     {
-<span class="lineNum">     119 </span>                :       for (; __first != __last; ++__first)
-<span class="lineNum">     120 </span>                :         __alloc.destroy(&amp;*__first);
-<span class="lineNum">     121 </span>                :     }
-<span class="lineNum">     122 </span>                : 
-<span class="lineNum">     123 </span>                :   template&lt;typename _ForwardIterator, typename _Tp&gt;
-<span class="lineNum">     124 </span>                :     inline void
-<span class="lineNum">     125 </span>                :     _Destroy(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">     126 </span><span class="lineCov">          33441 :              allocator&lt;_Tp&gt;&amp;)</span>
-<span class="lineNum">     127 </span>                :     {
-<span class="lineNum">     128 </span><span class="lineCov">          33441 :       _Destroy(__first, __last);</span>
-<span class="lineNum">     129 </span><span class="lineCov">          33441 :     }</span>
-<span class="lineNum">     130 </span>                : 
-<span class="lineNum">     131 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">     132 </span>                : 
-<span class="lineNum">     133 </span>                : #endif /* _STL_CONSTRUCT_H */
-<span class="lineNum">     134 </span>                : 
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/bits/stl_deque.h.gcov.html b/rep/usr/include/c++/4.3/bits/stl_deque.h.gcov.html
deleted file mode 100644
index 6fe09f3..0000000
--- a/rep/usr/include/c++/4.3/bits/stl_deque.h.gcov.html
+++ /dev/null
@@ -1,1837 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_deque.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_deque.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">189</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">78.3 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">148</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // Deque implementation -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
-<span class="lineNum">       4 </span>                : // Free Software Foundation, Inc.
-<span class="lineNum">       5 </span>                : //
-<span class="lineNum">       6 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       7 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       8 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">       9 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      10 </span>                : // any later version.
-<span class="lineNum">      11 </span>                : 
-<span class="lineNum">      12 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      13 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      14 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      15 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      16 </span>                : 
-<span class="lineNum">      17 </span>                : // You should have received a copy of the GNU General Public License along
-<span class="lineNum">      18 </span>                : // with this library; see the file COPYING.  If not, write to the Free
-<span class="lineNum">      19 </span>                : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-<span class="lineNum">      20 </span>                : // USA.
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      23 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      24 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      25 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      26 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      27 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      28 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      29 </span>                : // the GNU General Public License.
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : /*
-<span class="lineNum">      32 </span>                :  *
-<span class="lineNum">      33 </span>                :  * Copyright (c) 1994
-<span class="lineNum">      34 </span>                :  * Hewlett-Packard Company
-<span class="lineNum">      35 </span>                :  *
-<span class="lineNum">      36 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      37 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      38 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      39 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      40 </span>                :  * in supporting documentation.  Hewlett-Packard Company makes no
-<span class="lineNum">      41 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      42 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      43 </span>                :  *
-<span class="lineNum">      44 </span>                :  *
-<span class="lineNum">      45 </span>                :  * Copyright (c) 1997
-<span class="lineNum">      46 </span>                :  * Silicon Graphics Computer Systems, Inc.
-<span class="lineNum">      47 </span>                :  *
-<span class="lineNum">      48 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      49 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      50 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      51 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      52 </span>                :  * in supporting documentation.  Silicon Graphics makes no
-<span class="lineNum">      53 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      54 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      55 </span>                :  */
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span>                : /** @file stl_deque.h
-<span class="lineNum">      58 </span>                :  *  This is an internal header file, included by other library headers.
-<span class="lineNum">      59 </span>                :  *  You should not attempt to use it directly.
-<span class="lineNum">      60 </span>                :  */
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span>                : #ifndef _STL_DEQUE_H
-<span class="lineNum">      63 </span>                : #define _STL_DEQUE_H 1
-<span class="lineNum">      64 </span>                : 
-<span class="lineNum">      65 </span>                : #include &lt;bits/concept_check.h&gt;
-<span class="lineNum">      66 </span>                : #include &lt;bits/stl_iterator_base_types.h&gt;
-<span class="lineNum">      67 </span>                : #include &lt;bits/stl_iterator_base_funcs.h&gt;
-<span class="lineNum">      68 </span>                : 
-<span class="lineNum">      69 </span>                : _GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D)
-<span class="lineNum">      70 </span>                : 
-<span class="lineNum">      71 </span>                :   /**
-<span class="lineNum">      72 </span>                :    *  @brief This function controls the size of memory nodes.
-<span class="lineNum">      73 </span>                :    *  @param  size  The size of an element.
-<span class="lineNum">      74 </span>                :    *  @return   The number (not byte size) of elements per node.
-<span class="lineNum">      75 </span>                :    *
-<span class="lineNum">      76 </span>                :    *  This function started off as a compiler kludge from SGI, but seems to
-<span class="lineNum">      77 </span>                :    *  be a useful wrapper around a repeated constant expression.  The '512' is
-<span class="lineNum">      78 </span>                :    *  tunable (and no other code needs to change), but no investigation has
-<span class="lineNum">      79 </span>                :    *  been done since inheriting the SGI code.
-<span class="lineNum">      80 </span>                :   */
-<span class="lineNum">      81 </span>                :   inline size_t
-<span class="lineNum">      82 </span><span class="lineCov">           7753 :   __deque_buf_size(size_t __size)</span>
-<span class="lineNum">      83 </span><span class="lineCov">           7753 :   { return __size &lt; 512 ? size_t(512 / __size) : size_t(1); }</span>
-<span class="lineNum">      84 </span>                : 
-<span class="lineNum">      85 </span>                : 
-<span class="lineNum">      86 </span>                :   /**
-<span class="lineNum">      87 </span>                :    *  @brief A deque::iterator.
-<span class="lineNum">      88 </span>                :    *
-<span class="lineNum">      89 </span>                :    *  Quite a bit of intelligence here.  Much of the functionality of
-<span class="lineNum">      90 </span>                :    *  deque is actually passed off to this class.  A deque holds two
-<span class="lineNum">      91 </span>                :    *  of these internally, marking its valid range.  Access to
-<span class="lineNum">      92 </span>                :    *  elements is done as offsets of either of those two, relying on
-<span class="lineNum">      93 </span>                :    *  operator overloading in this class.
-<span class="lineNum">      94 </span>                :    *
-<span class="lineNum">      95 </span>                :    *  All the functions are op overloads except for _M_set_node.
-<span class="lineNum">      96 </span>                :   */
-<span class="lineNum">      97 </span>                :   template&lt;typename _Tp, typename _Ref, typename _Ptr&gt;
-<span class="lineNum">      98 </span>                :     struct _Deque_iterator
-<span class="lineNum">      99 </span>                :     {
-<span class="lineNum">     100 </span>                :       typedef _Deque_iterator&lt;_Tp, _Tp&amp;, _Tp*&gt;             iterator;
-<span class="lineNum">     101 </span>                :       typedef _Deque_iterator&lt;_Tp, const _Tp&amp;, const _Tp*&gt; const_iterator;
-<span class="lineNum">     102 </span>                : 
-<span class="lineNum">     103 </span><span class="lineCov">           7595 :       static size_t _S_buffer_size()</span>
-<span class="lineNum">     104 </span><span class="lineCov">           7595 :       { return __deque_buf_size(sizeof(_Tp)); }</span>
-<span class="lineNum">     105 </span>                : 
-<span class="lineNum">     106 </span>                :       typedef std::random_access_iterator_tag iterator_category;
-<span class="lineNum">     107 </span>                :       typedef _Tp                             value_type;
-<span class="lineNum">     108 </span>                :       typedef _Ptr                            pointer;
-<span class="lineNum">     109 </span>                :       typedef _Ref                            reference;
-<span class="lineNum">     110 </span>                :       typedef size_t                          size_type;
-<span class="lineNum">     111 </span>                :       typedef ptrdiff_t                       difference_type;
-<span class="lineNum">     112 </span>                :       typedef _Tp**                           _Map_pointer;
-<span class="lineNum">     113 </span>                :       typedef _Deque_iterator                 _Self;
-<span class="lineNum">     114 </span>                : 
-<span class="lineNum">     115 </span>                :       _Tp* _M_cur;
-<span class="lineNum">     116 </span>                :       _Tp* _M_first;
-<span class="lineNum">     117 </span>                :       _Tp* _M_last;
-<span class="lineNum">     118 </span>                :       _Map_pointer _M_node;
-<span class="lineNum">     119 </span>                : 
-<span class="lineNum">     120 </span>                :       _Deque_iterator(_Tp* __x, _Map_pointer __y)
-<span class="lineNum">     121 </span>                :       : _M_cur(__x), _M_first(*__y),
-<span class="lineNum">     122 </span>                :         _M_last(*__y + _S_buffer_size()), _M_node(__y) { }
-<span class="lineNum">     123 </span>                : 
-<span class="lineNum">     124 </span><span class="lineCov">             68 :       _Deque_iterator()</span>
-<span class="lineNum">     125 </span><span class="lineCov">             68 :       : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) { }</span>
-<span class="lineNum">     126 </span>                : 
-<span class="lineNum">     127 </span><span class="lineCov">          45179 :       _Deque_iterator(const iterator&amp; __x)</span>
-<span class="lineNum">     128 </span>                :       : _M_cur(__x._M_cur), _M_first(__x._M_first),
-<span class="lineNum">     129 </span><span class="lineCov">          45179 :         _M_last(__x._M_last), _M_node(__x._M_node) { }</span>
-<span class="lineNum">     130 </span>                : 
-<span class="lineNum">     131 </span>                :       reference
-<span class="lineNum">     132 </span><span class="lineCov">          24883 :       operator*() const</span>
-<span class="lineNum">     133 </span><span class="lineCov">          24883 :       { return *_M_cur; }</span>
-<span class="lineNum">     134 </span>                : 
-<span class="lineNum">     135 </span>                :       pointer
-<span class="lineNum">     136 </span>                :       operator-&gt;() const
-<span class="lineNum">     137 </span>                :       { return _M_cur; }
-<span class="lineNum">     138 </span>                : 
-<span class="lineNum">     139 </span>                :       _Self&amp;
-<span class="lineNum">     140 </span><span class="lineCov">          24754 :       operator++()</span>
-<span class="lineNum">     141 </span>                :       {
-<span class="lineNum">     142 </span><span class="lineCov">          24754 :         ++_M_cur;</span>
-<span class="lineNum">     143 </span><span class="lineCov">          24754 :         if (_M_cur == _M_last)</span>
-<span class="lineNum">     144 </span>                :           {
-<span class="lineNum">     145 </span><span class="lineCov">             29 :             _M_set_node(_M_node + 1);</span>
-<span class="lineNum">     146 </span><span class="lineCov">             29 :             _M_cur = _M_first;</span>
-<span class="lineNum">     147 </span>                :           }
-<span class="lineNum">     148 </span><span class="lineCov">          24754 :         return *this;</span>
-<span class="lineNum">     149 </span>                :       }
-<span class="lineNum">     150 </span>                : 
-<span class="lineNum">     151 </span>                :       _Self
-<span class="lineNum">     152 </span>                :       operator++(int)
-<span class="lineNum">     153 </span>                :       {
-<span class="lineNum">     154 </span>                :         _Self __tmp = *this;
-<span class="lineNum">     155 </span>                :         ++*this;
-<span class="lineNum">     156 </span>                :         return __tmp;
-<span class="lineNum">     157 </span>                :       }
-<span class="lineNum">     158 </span>                : 
-<span class="lineNum">     159 </span>                :       _Self&amp;
-<span class="lineNum">     160 </span><span class="lineCov">             39 :       operator--()</span>
-<span class="lineNum">     161 </span>                :       {
-<span class="lineNum">     162 </span><span class="lineCov">             39 :         if (_M_cur == _M_first)</span>
-<span class="lineNum">     163 </span>                :           {
-<span class="lineNum">     164 </span><span class="lineNoCov">              0 :             _M_set_node(_M_node - 1);</span>
-<span class="lineNum">     165 </span><span class="lineNoCov">              0 :             _M_cur = _M_last;</span>
-<span class="lineNum">     166 </span>                :           }
-<span class="lineNum">     167 </span><span class="lineCov">             39 :         --_M_cur;</span>
-<span class="lineNum">     168 </span><span class="lineCov">             39 :         return *this;</span>
-<span class="lineNum">     169 </span>                :       }
-<span class="lineNum">     170 </span>                : 
-<span class="lineNum">     171 </span>                :       _Self
-<span class="lineNum">     172 </span>                :       operator--(int)
-<span class="lineNum">     173 </span>                :       {
-<span class="lineNum">     174 </span>                :         _Self __tmp = *this;
-<span class="lineNum">     175 </span>                :         --*this;
-<span class="lineNum">     176 </span>                :         return __tmp;
-<span class="lineNum">     177 </span>                :       }
-<span class="lineNum">     178 </span>                : 
-<span class="lineNum">     179 </span>                :       _Self&amp;
-<span class="lineNum">     180 </span><span class="lineCov">            180 :       operator+=(difference_type __n)</span>
-<span class="lineNum">     181 </span>                :       {
-<span class="lineNum">     182 </span><span class="lineCov">            180 :         const difference_type __offset = __n + (_M_cur - _M_first);</span>
-<span class="lineNum">     183 </span><span class="lineCov">            180 :         if (__offset &gt;= 0 &amp;&amp; __offset &lt; difference_type(_S_buffer_size()))</span>
-<span class="lineNum">     184 </span><span class="lineCov">            178 :           _M_cur += __n;</span>
-<span class="lineNum">     185 </span>                :         else
-<span class="lineNum">     186 </span>                :           {
-<span class="lineNum">     187 </span>                :             const difference_type __node_offset =
-<span class="lineNum">     188 </span>                :               __offset &gt; 0 ? __offset / difference_type(_S_buffer_size())
-<span class="lineNum">     189 </span>                :                            : -difference_type((-__offset - 1)
-<span class="lineNum">     190 </span><span class="lineCov">              2 :                                               / _S_buffer_size()) - 1;</span>
-<span class="lineNum">     191 </span><span class="lineCov">              2 :             _M_set_node(_M_node + __node_offset);</span>
-<span class="lineNum">     192 </span><span class="lineCov">              2 :             _M_cur = _M_first + (__offset - __node_offset</span>
-<span class="lineNum">     193 </span>                :                                  * difference_type(_S_buffer_size()));
-<span class="lineNum">     194 </span>                :           }
-<span class="lineNum">     195 </span><span class="lineCov">            180 :         return *this;</span>
-<span class="lineNum">     196 </span>                :       }
-<span class="lineNum">     197 </span>                : 
-<span class="lineNum">     198 </span>                :       _Self
-<span class="lineNum">     199 </span><span class="lineCov">            180 :       operator+(difference_type __n) const</span>
-<span class="lineNum">     200 </span>                :       {
-<span class="lineNum">     201 </span><span class="lineCov">            180 :         _Self __tmp = *this;</span>
-<span class="lineNum">     202 </span><span class="lineCov">            180 :         return __tmp += __n;</span>
-<span class="lineNum">     203 </span>                :       }
-<span class="lineNum">     204 </span>                : 
-<span class="lineNum">     205 </span>                :       _Self&amp;
-<span class="lineNum">     206 </span><span class="lineNoCov">              0 :       operator-=(difference_type __n)</span>
-<span class="lineNum">     207 </span><span class="lineNoCov">              0 :       { return *this += -__n; }</span>
-<span class="lineNum">     208 </span>                : 
-<span class="lineNum">     209 </span>                :       _Self
-<span class="lineNum">     210 </span><span class="lineNoCov">              0 :       operator-(difference_type __n) const</span>
-<span class="lineNum">     211 </span>                :       {
-<span class="lineNum">     212 </span><span class="lineNoCov">              0 :         _Self __tmp = *this;</span>
-<span class="lineNum">     213 </span><span class="lineNoCov">              0 :         return __tmp -= __n;</span>
-<span class="lineNum">     214 </span>                :       }
-<span class="lineNum">     215 </span>                : 
-<span class="lineNum">     216 </span>                :       reference
-<span class="lineNum">     217 </span>                :       operator[](difference_type __n) const
-<span class="lineNum">     218 </span>                :       { return *(*this + __n); }
-<span class="lineNum">     219 </span>                : 
-<span class="lineNum">     220 </span>                :       /** 
-<span class="lineNum">     221 </span>                :        *  Prepares to traverse new_node.  Sets everything except
-<span class="lineNum">     222 </span>                :        *  _M_cur, which should therefore be set by the caller
-<span class="lineNum">     223 </span>                :        *  immediately afterwards, based on _M_first and _M_last.
-<span class="lineNum">     224 </span>                :        */
-<span class="lineNum">     225 </span>                :       void
-<span class="lineNum">     226 </span><span class="lineCov">            112 :       _M_set_node(_Map_pointer __new_node)</span>
-<span class="lineNum">     227 </span>                :       {
-<span class="lineNum">     228 </span><span class="lineCov">            112 :         _M_node = __new_node;</span>
-<span class="lineNum">     229 </span><span class="lineCov">            112 :         _M_first = *__new_node;</span>
-<span class="lineNum">     230 </span><span class="lineCov">            112 :         _M_last = _M_first + difference_type(_S_buffer_size());</span>
-<span class="lineNum">     231 </span><span class="lineCov">            112 :       }</span>
-<span class="lineNum">     232 </span>                :     };
-<span class="lineNum">     233 </span>                : 
-<span class="lineNum">     234 </span>                :   // Note: we also provide overloads whose operands are of the same type in
-<span class="lineNum">     235 </span>                :   // order to avoid ambiguous overload resolution when std::rel_ops operators
-<span class="lineNum">     236 </span>                :   // are in scope (for additional details, see libstdc++/3628)
-<span class="lineNum">     237 </span>                :   template&lt;typename _Tp, typename _Ref, typename _Ptr&gt;
-<span class="lineNum">     238 </span>                :     inline bool
-<span class="lineNum">     239 </span>                :     operator==(const _Deque_iterator&lt;_Tp, _Ref, _Ptr&gt;&amp; __x,
-<span class="lineNum">     240 </span><span class="lineCov">          19443 :                const _Deque_iterator&lt;_Tp, _Ref, _Ptr&gt;&amp; __y)</span>
-<span class="lineNum">     241 </span><span class="lineCov">          19443 :     { return __x._M_cur == __y._M_cur; }</span>
-<span class="lineNum">     242 </span>                : 
-<span class="lineNum">     243 </span>                :   template&lt;typename _Tp, typename _RefL, typename _PtrL,
-<span class="lineNum">     244 </span>                :            typename _RefR, typename _PtrR&gt;
-<span class="lineNum">     245 </span>                :     inline bool
-<span class="lineNum">     246 </span>                :     operator==(const _Deque_iterator&lt;_Tp, _RefL, _PtrL&gt;&amp; __x,
-<span class="lineNum">     247 </span>                :                const _Deque_iterator&lt;_Tp, _RefR, _PtrR&gt;&amp; __y)
-<span class="lineNum">     248 </span>                :     { return __x._M_cur == __y._M_cur; }
-<span class="lineNum">     249 </span>                : 
-<span class="lineNum">     250 </span>                :   template&lt;typename _Tp, typename _Ref, typename _Ptr&gt;
-<span class="lineNum">     251 </span>                :     inline bool
-<span class="lineNum">     252 </span>                :     operator!=(const _Deque_iterator&lt;_Tp, _Ref, _Ptr&gt;&amp; __x,
-<span class="lineNum">     253 </span><span class="lineCov">          12091 :                const _Deque_iterator&lt;_Tp, _Ref, _Ptr&gt;&amp; __y)</span>
-<span class="lineNum">     254 </span><span class="lineCov">          12091 :     { return !(__x == __y); }</span>
-<span class="lineNum">     255 </span>                : 
-<span class="lineNum">     256 </span>                :   template&lt;typename _Tp, typename _RefL, typename _PtrL,
-<span class="lineNum">     257 </span>                :            typename _RefR, typename _PtrR&gt;
-<span class="lineNum">     258 </span>                :     inline bool
-<span class="lineNum">     259 </span>                :     operator!=(const _Deque_iterator&lt;_Tp, _RefL, _PtrL&gt;&amp; __x,
-<span class="lineNum">     260 </span>                :                const _Deque_iterator&lt;_Tp, _RefR, _PtrR&gt;&amp; __y)
-<span class="lineNum">     261 </span>                :     { return !(__x == __y); }
-<span class="lineNum">     262 </span>                : 
-<span class="lineNum">     263 </span>                :   template&lt;typename _Tp, typename _Ref, typename _Ptr&gt;
-<span class="lineNum">     264 </span>                :     inline bool
-<span class="lineNum">     265 </span>                :     operator&lt;(const _Deque_iterator&lt;_Tp, _Ref, _Ptr&gt;&amp; __x,
-<span class="lineNum">     266 </span>                :               const _Deque_iterator&lt;_Tp, _Ref, _Ptr&gt;&amp; __y)
-<span class="lineNum">     267 </span>                :     { return (__x._M_node == __y._M_node) ? (__x._M_cur &lt; __y._M_cur)
-<span class="lineNum">     268 </span>                :                                           : (__x._M_node &lt; __y._M_node); }
-<span class="lineNum">     269 </span>                : 
-<span class="lineNum">     270 </span>                :   template&lt;typename _Tp, typename _RefL, typename _PtrL,
-<span class="lineNum">     271 </span>                :            typename _RefR, typename _PtrR&gt;
-<span class="lineNum">     272 </span>                :     inline bool
-<span class="lineNum">     273 </span>                :     operator&lt;(const _Deque_iterator&lt;_Tp, _RefL, _PtrL&gt;&amp; __x,
-<span class="lineNum">     274 </span>                :               const _Deque_iterator&lt;_Tp, _RefR, _PtrR&gt;&amp; __y)
-<span class="lineNum">     275 </span>                :     { return (__x._M_node == __y._M_node) ? (__x._M_cur &lt; __y._M_cur)
-<span class="lineNum">     276 </span>                :                                           : (__x._M_node &lt; __y._M_node); }
-<span class="lineNum">     277 </span>                : 
-<span class="lineNum">     278 </span>                :   template&lt;typename _Tp, typename _Ref, typename _Ptr&gt;
-<span class="lineNum">     279 </span>                :     inline bool
-<span class="lineNum">     280 </span>                :     operator&gt;(const _Deque_iterator&lt;_Tp, _Ref, _Ptr&gt;&amp; __x,
-<span class="lineNum">     281 </span>                :               const _Deque_iterator&lt;_Tp, _Ref, _Ptr&gt;&amp; __y)
-<span class="lineNum">     282 </span>                :     { return __y &lt; __x; }
-<span class="lineNum">     283 </span>                : 
-<span class="lineNum">     284 </span>                :   template&lt;typename _Tp, typename _RefL, typename _PtrL,
-<span class="lineNum">     285 </span>                :            typename _RefR, typename _PtrR&gt;
-<span class="lineNum">     286 </span>                :     inline bool
-<span class="lineNum">     287 </span>                :     operator&gt;(const _Deque_iterator&lt;_Tp, _RefL, _PtrL&gt;&amp; __x,
-<span class="lineNum">     288 </span>                :               const _Deque_iterator&lt;_Tp, _RefR, _PtrR&gt;&amp; __y)
-<span class="lineNum">     289 </span>                :     { return __y &lt; __x; }
-<span class="lineNum">     290 </span>                : 
-<span class="lineNum">     291 </span>                :   template&lt;typename _Tp, typename _Ref, typename _Ptr&gt;
-<span class="lineNum">     292 </span>                :     inline bool
-<span class="lineNum">     293 </span>                :     operator&lt;=(const _Deque_iterator&lt;_Tp, _Ref, _Ptr&gt;&amp; __x,
-<span class="lineNum">     294 </span>                :                const _Deque_iterator&lt;_Tp, _Ref, _Ptr&gt;&amp; __y)
-<span class="lineNum">     295 </span>                :     { return !(__y &lt; __x); }
-<span class="lineNum">     296 </span>                : 
-<span class="lineNum">     297 </span>                :   template&lt;typename _Tp, typename _RefL, typename _PtrL,
-<span class="lineNum">     298 </span>                :            typename _RefR, typename _PtrR&gt;
-<span class="lineNum">     299 </span>                :     inline bool
-<span class="lineNum">     300 </span>                :     operator&lt;=(const _Deque_iterator&lt;_Tp, _RefL, _PtrL&gt;&amp; __x,
-<span class="lineNum">     301 </span>                :                const _Deque_iterator&lt;_Tp, _RefR, _PtrR&gt;&amp; __y)
-<span class="lineNum">     302 </span>                :     { return !(__y &lt; __x); }
-<span class="lineNum">     303 </span>                : 
-<span class="lineNum">     304 </span>                :   template&lt;typename _Tp, typename _Ref, typename _Ptr&gt;
-<span class="lineNum">     305 </span>                :     inline bool
-<span class="lineNum">     306 </span>                :     operator&gt;=(const _Deque_iterator&lt;_Tp, _Ref, _Ptr&gt;&amp; __x,
-<span class="lineNum">     307 </span>                :                const _Deque_iterator&lt;_Tp, _Ref, _Ptr&gt;&amp; __y)
-<span class="lineNum">     308 </span>                :     { return !(__x &lt; __y); }
-<span class="lineNum">     309 </span>                : 
-<span class="lineNum">     310 </span>                :   template&lt;typename _Tp, typename _RefL, typename _PtrL,
-<span class="lineNum">     311 </span>                :            typename _RefR, typename _PtrR&gt;
-<span class="lineNum">     312 </span>                :     inline bool
-<span class="lineNum">     313 </span>                :     operator&gt;=(const _Deque_iterator&lt;_Tp, _RefL, _PtrL&gt;&amp; __x,
-<span class="lineNum">     314 </span>                :                const _Deque_iterator&lt;_Tp, _RefR, _PtrR&gt;&amp; __y)
-<span class="lineNum">     315 </span>                :     { return !(__x &lt; __y); }
-<span class="lineNum">     316 </span>                : 
-<span class="lineNum">     317 </span>                :   // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     318 </span>                :   // According to the resolution of DR179 not only the various comparison
-<span class="lineNum">     319 </span>                :   // operators but also operator- must accept mixed iterator/const_iterator
-<span class="lineNum">     320 </span>                :   // parameters.
-<span class="lineNum">     321 </span>                :   template&lt;typename _Tp, typename _Ref, typename _Ptr&gt;
-<span class="lineNum">     322 </span>                :     inline typename _Deque_iterator&lt;_Tp, _Ref, _Ptr&gt;::difference_type
-<span class="lineNum">     323 </span>                :     operator-(const _Deque_iterator&lt;_Tp, _Ref, _Ptr&gt;&amp; __x,
-<span class="lineNum">     324 </span><span class="lineCov">           7299 :               const _Deque_iterator&lt;_Tp, _Ref, _Ptr&gt;&amp; __y)</span>
-<span class="lineNum">     325 </span>                :     {
-<span class="lineNum">     326 </span>                :       return typename _Deque_iterator&lt;_Tp, _Ref, _Ptr&gt;::difference_type
-<span class="lineNum">     327 </span>                :         (_Deque_iterator&lt;_Tp, _Ref, _Ptr&gt;::_S_buffer_size())
-<span class="lineNum">     328 </span>                :         * (__x._M_node - __y._M_node - 1) + (__x._M_cur - __x._M_first)
-<span class="lineNum">     329 </span><span class="lineCov">           7299 :         + (__y._M_last - __y._M_cur);</span>
-<span class="lineNum">     330 </span>                :     }
-<span class="lineNum">     331 </span>                : 
-<span class="lineNum">     332 </span>                :   template&lt;typename _Tp, typename _RefL, typename _PtrL,
-<span class="lineNum">     333 </span>                :            typename _RefR, typename _PtrR&gt;
-<span class="lineNum">     334 </span>                :     inline typename _Deque_iterator&lt;_Tp, _RefL, _PtrL&gt;::difference_type
-<span class="lineNum">     335 </span>                :     operator-(const _Deque_iterator&lt;_Tp, _RefL, _PtrL&gt;&amp; __x,
-<span class="lineNum">     336 </span>                :               const _Deque_iterator&lt;_Tp, _RefR, _PtrR&gt;&amp; __y)
-<span class="lineNum">     337 </span>                :     {
-<span class="lineNum">     338 </span>                :       return typename _Deque_iterator&lt;_Tp, _RefL, _PtrL&gt;::difference_type
-<span class="lineNum">     339 </span>                :         (_Deque_iterator&lt;_Tp, _RefL, _PtrL&gt;::_S_buffer_size())
-<span class="lineNum">     340 </span>                :         * (__x._M_node - __y._M_node - 1) + (__x._M_cur - __x._M_first)
-<span class="lineNum">     341 </span>                :         + (__y._M_last - __y._M_cur);
-<span class="lineNum">     342 </span>                :     }
-<span class="lineNum">     343 </span>                : 
-<span class="lineNum">     344 </span>                :   template&lt;typename _Tp, typename _Ref, typename _Ptr&gt;
-<span class="lineNum">     345 </span>                :     inline _Deque_iterator&lt;_Tp, _Ref, _Ptr&gt;
-<span class="lineNum">     346 </span>                :     operator+(ptrdiff_t __n, const _Deque_iterator&lt;_Tp, _Ref, _Ptr&gt;&amp; __x)
-<span class="lineNum">     347 </span>                :     { return __x + __n; }
-<span class="lineNum">     348 </span>                : 
-<span class="lineNum">     349 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     350 </span>                :     void
-<span class="lineNum">     351 </span>                :     fill(const _Deque_iterator&lt;_Tp, _Tp&amp;, _Tp*&gt;&amp; __first,
-<span class="lineNum">     352 </span>                :          const _Deque_iterator&lt;_Tp, _Tp&amp;, _Tp*&gt;&amp; __last, const _Tp&amp; __value);
-<span class="lineNum">     353 </span>                : 
-<span class="lineNum">     354 </span>                :   /**
-<span class="lineNum">     355 </span>                :    *  Deque base class.  This class provides the unified face for %deque's
-<span class="lineNum">     356 </span>                :    *  allocation.  This class's constructor and destructor allocate and
-<span class="lineNum">     357 </span>                :    *  deallocate (but do not initialize) storage.  This makes %exception
-<span class="lineNum">     358 </span>                :    *  safety easier.
-<span class="lineNum">     359 </span>                :    *
-<span class="lineNum">     360 </span>                :    *  Nothing in this class ever constructs or destroys an actual Tp element.
-<span class="lineNum">     361 </span>                :    *  (Deque handles that itself.)  Only/All memory management is performed
-<span class="lineNum">     362 </span>                :    *  here.
-<span class="lineNum">     363 </span>                :   */
-<span class="lineNum">     364 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     365 </span>                :     class _Deque_base
-<span class="lineNum">     366 </span>                :     {
-<span class="lineNum">     367 </span>                :     public:
-<span class="lineNum">     368 </span>                :       typedef _Alloc                  allocator_type;
-<span class="lineNum">     369 </span>                : 
-<span class="lineNum">     370 </span>                :       allocator_type
-<span class="lineNum">     371 </span>                :       get_allocator() const
-<span class="lineNum">     372 </span>                :       { return allocator_type(_M_get_Tp_allocator()); }
-<span class="lineNum">     373 </span>                : 
-<span class="lineNum">     374 </span>                :       typedef _Deque_iterator&lt;_Tp, _Tp&amp;, _Tp*&gt;             iterator;
-<span class="lineNum">     375 </span>                :       typedef _Deque_iterator&lt;_Tp, const _Tp&amp;, const _Tp*&gt; const_iterator;
-<span class="lineNum">     376 </span>                : 
-<span class="lineNum">     377 </span><span class="lineCov">             21 :       _Deque_base()</span>
-<span class="lineNum">     378 </span><span class="lineCov">             21 :       : _M_impl()</span>
-<span class="lineNum">     379 </span><span class="lineCov">             21 :       { _M_initialize_map(0); }</span>
-<span class="lineNum">     380 </span>                : 
-<span class="lineNum">     381 </span><span class="lineCov">             13 :       _Deque_base(const allocator_type&amp; __a, size_t __num_elements)</span>
-<span class="lineNum">     382 </span><span class="lineCov">             13 :       : _M_impl(__a)</span>
-<span class="lineNum">     383 </span><span class="lineCov">             13 :       { _M_initialize_map(__num_elements); }</span>
-<span class="lineNum">     384 </span>                : 
-<span class="lineNum">     385 </span>                :       _Deque_base(const allocator_type&amp; __a)
-<span class="lineNum">     386 </span>                :       : _M_impl(__a)
-<span class="lineNum">     387 </span>                :       { }
-<span class="lineNum">     388 </span>                : 
-<span class="lineNum">     389 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     390 </span>                :       _Deque_base(_Deque_base&amp;&amp; __x)
-<span class="lineNum">     391 </span>                :       : _M_impl(__x._M_get_Tp_allocator())
-<span class="lineNum">     392 </span>                :       {
-<span class="lineNum">     393 </span>                :         _M_initialize_map(0);
-<span class="lineNum">     394 </span>                :         if (__x._M_impl._M_map)
-<span class="lineNum">     395 </span>                :           {
-<span class="lineNum">     396 </span>                :             std::swap(this-&gt;_M_impl._M_start, __x._M_impl._M_start);
-<span class="lineNum">     397 </span>                :             std::swap(this-&gt;_M_impl._M_finish, __x._M_impl._M_finish);
-<span class="lineNum">     398 </span>                :             std::swap(this-&gt;_M_impl._M_map, __x._M_impl._M_map);
-<span class="lineNum">     399 </span>                :             std::swap(this-&gt;_M_impl._M_map_size, __x._M_impl._M_map_size);
-<span class="lineNum">     400 </span>                :           }
-<span class="lineNum">     401 </span>                :       }
-<span class="lineNum">     402 </span>                : #endif
-<span class="lineNum">     403 </span>                : 
-<span class="lineNum">     404 </span>                :       ~_Deque_base();
-<span class="lineNum">     405 </span>                : 
-<span class="lineNum">     406 </span>                :     protected:
-<span class="lineNum">     407 </span>                :       //This struct encapsulates the implementation of the std::deque
-<span class="lineNum">     408 </span>                :       //standard container and at the same time makes use of the EBO
-<span class="lineNum">     409 </span>                :       //for empty allocators.
-<span class="lineNum">     410 </span>                :       typedef typename _Alloc::template rebind&lt;_Tp*&gt;::other _Map_alloc_type;
-<span class="lineNum">     411 </span>                : 
-<span class="lineNum">     412 </span>                :       typedef typename _Alloc::template rebind&lt;_Tp&gt;::other  _Tp_alloc_type;
-<span class="lineNum">     413 </span>                : 
-<span class="lineNum">     414 </span>                :       struct _Deque_impl
-<span class="lineNum">     415 </span>                :       : public _Tp_alloc_type
-<span class="lineNum">     416 </span><span class="lineCov">             30 :       {</span>
-<span class="lineNum">     417 </span>                :         _Tp** _M_map;
-<span class="lineNum">     418 </span>                :         size_t _M_map_size;
-<span class="lineNum">     419 </span>                :         iterator _M_start;
-<span class="lineNum">     420 </span>                :         iterator _M_finish;
-<span class="lineNum">     421 </span>                : 
-<span class="lineNum">     422 </span><span class="lineCov">             21 :         _Deque_impl()</span>
-<span class="lineNum">     423 </span>                :         : _Tp_alloc_type(), _M_map(0), _M_map_size(0),
-<span class="lineNum">     424 </span><span class="lineCov">             21 :           _M_start(), _M_finish()</span>
-<span class="lineNum">     425 </span><span class="lineCov">             21 :         { }</span>
-<span class="lineNum">     426 </span>                : 
-<span class="lineNum">     427 </span><span class="lineCov">             13 :         _Deque_impl(const _Tp_alloc_type&amp; __a)</span>
-<span class="lineNum">     428 </span>                :         : _Tp_alloc_type(__a), _M_map(0), _M_map_size(0),
-<span class="lineNum">     429 </span><span class="lineCov">             13 :           _M_start(), _M_finish()</span>
-<span class="lineNum">     430 </span><span class="lineCov">             13 :         { }</span>
-<span class="lineNum">     431 </span>                :       };
-<span class="lineNum">     432 </span>                : 
-<span class="lineNum">     433 </span>                :       _Tp_alloc_type&amp;
-<span class="lineNum">     434 </span><span class="lineCov">           1085 :       _M_get_Tp_allocator()</span>
-<span class="lineNum">     435 </span><span class="lineCov">           1085 :       { return *static_cast&lt;_Tp_alloc_type*&gt;(&amp;this-&gt;_M_impl); }</span>
-<span class="lineNum">     436 </span>                : 
-<span class="lineNum">     437 </span>                :       const _Tp_alloc_type&amp;
-<span class="lineNum">     438 </span><span class="lineCov">             77 :       _M_get_Tp_allocator() const</span>
-<span class="lineNum">     439 </span><span class="lineCov">             77 :       { return *static_cast&lt;const _Tp_alloc_type*&gt;(&amp;this-&gt;_M_impl); }</span>
-<span class="lineNum">     440 </span>                : 
-<span class="lineNum">     441 </span>                :       _Map_alloc_type
-<span class="lineNum">     442 </span><span class="lineCov">             64 :       _M_get_map_allocator() const</span>
-<span class="lineNum">     443 </span><span class="lineCov">             64 :       { return _Map_alloc_type(_M_get_Tp_allocator()); }</span>
-<span class="lineNum">     444 </span>                : 
-<span class="lineNum">     445 </span>                :       _Tp*
-<span class="lineNum">     446 </span><span class="lineCov">             47 :       _M_allocate_node()</span>
-<span class="lineNum">     447 </span>                :       { 
-<span class="lineNum">     448 </span><span class="lineCov">             47 :         return _M_impl._Tp_alloc_type::allocate(__deque_buf_size(sizeof(_Tp)));</span>
-<span class="lineNum">     449 </span>                :       }
-<span class="lineNum">     450 </span>                : 
-<span class="lineNum">     451 </span>                :       void
-<span class="lineNum">     452 </span><span class="lineCov">             43 :       _M_deallocate_node(_Tp* __p)</span>
-<span class="lineNum">     453 </span>                :       {
-<span class="lineNum">     454 </span><span class="lineCov">             43 :         _M_impl._Tp_alloc_type::deallocate(__p, __deque_buf_size(sizeof(_Tp)));</span>
-<span class="lineNum">     455 </span><span class="lineCov">             43 :       }</span>
-<span class="lineNum">     456 </span>                : 
-<span class="lineNum">     457 </span>                :       _Tp**
-<span class="lineNum">     458 </span><span class="lineCov">             34 :       _M_allocate_map(size_t __n)</span>
-<span class="lineNum">     459 </span><span class="lineCov">             34 :       { return _M_get_map_allocator().allocate(__n); }</span>
-<span class="lineNum">     460 </span>                : 
-<span class="lineNum">     461 </span>                :       void
-<span class="lineNum">     462 </span><span class="lineCov">             30 :       _M_deallocate_map(_Tp** __p, size_t __n)</span>
-<span class="lineNum">     463 </span><span class="lineCov">             30 :       { _M_get_map_allocator().deallocate(__p, __n); }</span>
-<span class="lineNum">     464 </span>                : 
-<span class="lineNum">     465 </span>                :     protected:
-<span class="lineNum">     466 </span>                :       void _M_initialize_map(size_t);
-<span class="lineNum">     467 </span>                :       void _M_create_nodes(_Tp** __nstart, _Tp** __nfinish);
-<span class="lineNum">     468 </span>                :       void _M_destroy_nodes(_Tp** __nstart, _Tp** __nfinish);
-<span class="lineNum">     469 </span>                :       enum { _S_initial_map_size = 8 };
-<span class="lineNum">     470 </span>                : 
-<span class="lineNum">     471 </span>                :       _Deque_impl _M_impl;
-<span class="lineNum">     472 </span>                :     };
-<span class="lineNum">     473 </span>                : 
-<span class="lineNum">     474 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     475 </span>                :     _Deque_base&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     476 </span><span class="lineCov">             30 :     ~_Deque_base()</span>
-<span class="lineNum">     477 </span>                :     {
-<span class="lineNum">     478 </span><span class="lineCov">             30 :       if (this-&gt;_M_impl._M_map)</span>
-<span class="lineNum">     479 </span>                :         {
-<span class="lineNum">     480 </span><span class="lineCov">             30 :           _M_destroy_nodes(this-&gt;_M_impl._M_start._M_node,</span>
-<span class="lineNum">     481 </span>                :                            this-&gt;_M_impl._M_finish._M_node + 1);
-<span class="lineNum">     482 </span><span class="lineCov">             30 :           _M_deallocate_map(this-&gt;_M_impl._M_map, this-&gt;_M_impl._M_map_size);</span>
-<span class="lineNum">     483 </span>                :         }
-<span class="lineNum">     484 </span><span class="lineCov">             30 :     }</span>
-<span class="lineNum">     485 </span>                : 
-<span class="lineNum">     486 </span>                :   /**
-<span class="lineNum">     487 </span>                :    *  @brief Layout storage.
-<span class="lineNum">     488 </span>                :    *  @param  num_elements  The count of T's for which to allocate space
-<span class="lineNum">     489 </span>                :    *                        at first.
-<span class="lineNum">     490 </span>                :    *  @return   Nothing.
-<span class="lineNum">     491 </span>                :    *
-<span class="lineNum">     492 </span>                :    *  The initial underlying memory layout is a bit complicated...
-<span class="lineNum">     493 </span>                :   */
-<span class="lineNum">     494 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     495 </span>                :     void
-<span class="lineNum">     496 </span>                :     _Deque_base&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     497 </span><span class="lineCov">             34 :     _M_initialize_map(size_t __num_elements)</span>
-<span class="lineNum">     498 </span>                :     {
-<span class="lineNum">     499 </span>                :       const size_t __num_nodes = (__num_elements/ __deque_buf_size(sizeof(_Tp))
-<span class="lineNum">     500 </span><span class="lineCov">             34 :                                   + 1);</span>
-<span class="lineNum">     501 </span>                : 
-<span class="lineNum">     502 </span><span class="lineCov">             34 :       this-&gt;_M_impl._M_map_size = std::max((size_t) _S_initial_map_size,</span>
-<span class="lineNum">     503 </span>                :                                            size_t(__num_nodes + 2));
-<span class="lineNum">     504 </span><span class="lineCov">             34 :       this-&gt;_M_impl._M_map = _M_allocate_map(this-&gt;_M_impl._M_map_size);</span>
-<span class="lineNum">     505 </span>                : 
-<span class="lineNum">     506 </span>                :       // For &quot;small&quot; maps (needing less than _M_map_size nodes), allocation
-<span class="lineNum">     507 </span>                :       // starts in the middle elements and grows outwards.  So nstart may be
-<span class="lineNum">     508 </span>                :       // the beginning of _M_map, but for small maps it may be as far in as
-<span class="lineNum">     509 </span>                :       // _M_map+3.
-<span class="lineNum">     510 </span>                : 
-<span class="lineNum">     511 </span>                :       _Tp** __nstart = (this-&gt;_M_impl._M_map
-<span class="lineNum">     512 </span><span class="lineCov">             34 :                         + (this-&gt;_M_impl._M_map_size - __num_nodes) / 2);</span>
-<span class="lineNum">     513 </span><span class="lineCov">             34 :       _Tp** __nfinish = __nstart + __num_nodes;</span>
-<span class="lineNum">     514 </span>                : 
-<span class="lineNum">     515 </span>                :       try
-<span class="lineNum">     516 </span><span class="lineCov">             34 :         { _M_create_nodes(__nstart, __nfinish); }</span>
-<span class="lineNum">     517 </span><span class="lineNoCov">              0 :       catch(...)</span>
-<span class="lineNum">     518 </span>                :         {
-<span class="lineNum">     519 </span><span class="lineNoCov">              0 :           _M_deallocate_map(this-&gt;_M_impl._M_map, this-&gt;_M_impl._M_map_size);</span>
-<span class="lineNum">     520 </span><span class="lineNoCov">              0 :           this-&gt;_M_impl._M_map = 0;</span>
-<span class="lineNum">     521 </span><span class="lineNoCov">              0 :           this-&gt;_M_impl._M_map_size = 0;</span>
-<span class="lineNum">     522 </span><span class="lineNoCov">              0 :           __throw_exception_again;</span>
-<span class="lineNum">     523 </span>                :         }
-<span class="lineNum">     524 </span>                : 
-<span class="lineNum">     525 </span><span class="lineCov">             34 :       this-&gt;_M_impl._M_start._M_set_node(__nstart);</span>
-<span class="lineNum">     526 </span><span class="lineCov">             34 :       this-&gt;_M_impl._M_finish._M_set_node(__nfinish - 1);</span>
-<span class="lineNum">     527 </span><span class="lineCov">             34 :       this-&gt;_M_impl._M_start._M_cur = _M_impl._M_start._M_first;</span>
-<span class="lineNum">     528 </span><span class="lineCov">             34 :       this-&gt;_M_impl._M_finish._M_cur = (this-&gt;_M_impl._M_finish._M_first</span>
-<span class="lineNum">     529 </span>                :                                         + __num_elements
-<span class="lineNum">     530 </span>                :                                         % __deque_buf_size(sizeof(_Tp)));
-<span class="lineNum">     531 </span><span class="lineCov">             34 :     }</span>
-<span class="lineNum">     532 </span>                : 
-<span class="lineNum">     533 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     534 </span>                :     void
-<span class="lineNum">     535 </span>                :     _Deque_base&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     536 </span><span class="lineCov">             34 :     _M_create_nodes(_Tp** __nstart, _Tp** __nfinish)</span>
-<span class="lineNum">     537 </span>                :     {
-<span class="lineNum">     538 </span>                :       _Tp** __cur;
-<span class="lineNum">     539 </span>                :       try
-<span class="lineNum">     540 </span>                :         {
-<span class="lineNum">     541 </span><span class="lineCov">             68 :           for (__cur = __nstart; __cur &lt; __nfinish; ++__cur)</span>
-<span class="lineNum">     542 </span><span class="lineCov">             34 :             *__cur = this-&gt;_M_allocate_node();</span>
-<span class="lineNum">     543 </span>                :         }
-<span class="lineNum">     544 </span><span class="lineNoCov">              0 :       catch(...)</span>
-<span class="lineNum">     545 </span>                :         {
-<span class="lineNum">     546 </span><span class="lineNoCov">              0 :           _M_destroy_nodes(__nstart, __cur);</span>
-<span class="lineNum">     547 </span><span class="lineNoCov">              0 :           __throw_exception_again;</span>
-<span class="lineNum">     548 </span>                :         }
-<span class="lineNum">     549 </span><span class="lineCov">             34 :     }</span>
-<span class="lineNum">     550 </span>                : 
-<span class="lineNum">     551 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     552 </span>                :     void
-<span class="lineNum">     553 </span>                :     _Deque_base&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     554 </span><span class="lineCov">           1046 :     _M_destroy_nodes(_Tp** __nstart, _Tp** __nfinish)</span>
-<span class="lineNum">     555 </span>                :     {
-<span class="lineNum">     556 </span><span class="lineCov">           1089 :       for (_Tp** __n = __nstart; __n &lt; __nfinish; ++__n)</span>
-<span class="lineNum">     557 </span><span class="lineCov">             43 :         _M_deallocate_node(*__n);</span>
-<span class="lineNum">     558 </span><span class="lineCov">           1046 :     }</span>
-<span class="lineNum">     559 </span>                : 
-<span class="lineNum">     560 </span>                :   /**
-<span class="lineNum">     561 </span>                :    *  @brief  A standard container using fixed-size memory allocation and
-<span class="lineNum">     562 </span>                :    *  constant-time manipulation of elements at either end.
-<span class="lineNum">     563 </span>                :    *
-<span class="lineNum">     564 </span>                :    *  @ingroup Containers
-<span class="lineNum">     565 </span>                :    *  @ingroup Sequences
-<span class="lineNum">     566 </span>                :    *
-<span class="lineNum">     567 </span>                :    *  Meets the requirements of a &lt;a href=&quot;tables.html#65&quot;&gt;container&lt;/a&gt;, a
-<span class="lineNum">     568 </span>                :    *  &lt;a href=&quot;tables.html#66&quot;&gt;reversible container&lt;/a&gt;, and a
-<span class="lineNum">     569 </span>                :    *  &lt;a href=&quot;tables.html#67&quot;&gt;sequence&lt;/a&gt;, including the
-<span class="lineNum">     570 </span>                :    *  &lt;a href=&quot;tables.html#68&quot;&gt;optional sequence requirements&lt;/a&gt;.
-<span class="lineNum">     571 </span>                :    *
-<span class="lineNum">     572 </span>                :    *  In previous HP/SGI versions of deque, there was an extra template
-<span class="lineNum">     573 </span>                :    *  parameter so users could control the node size.  This extension turned
-<span class="lineNum">     574 </span>                :    *  out to violate the C++ standard (it can be detected using template
-<span class="lineNum">     575 </span>                :    *  template parameters), and it was removed.
-<span class="lineNum">     576 </span>                :    *
-<span class="lineNum">     577 </span>                :    *  Here's how a deque&lt;Tp&gt; manages memory.  Each deque has 4 members:
-<span class="lineNum">     578 </span>                :    *
-<span class="lineNum">     579 </span>                :    *  - Tp**        _M_map
-<span class="lineNum">     580 </span>                :    *  - size_t      _M_map_size
-<span class="lineNum">     581 </span>                :    *  - iterator    _M_start, _M_finish
-<span class="lineNum">     582 </span>                :    *
-<span class="lineNum">     583 </span>                :    *  map_size is at least 8.  %map is an array of map_size
-<span class="lineNum">     584 </span>                :    *  pointers-to-&quot;nodes&quot;.  (The name %map has nothing to do with the
-<span class="lineNum">     585 </span>                :    *  std::map class, and &quot;nodes&quot; should not be confused with
-<span class="lineNum">     586 </span>                :    *  std::list's usage of &quot;node&quot;.)
-<span class="lineNum">     587 </span>                :    *
-<span class="lineNum">     588 </span>                :    *  A &quot;node&quot; has no specific type name as such, but it is referred
-<span class="lineNum">     589 </span>                :    *  to as &quot;node&quot; in this file.  It is a simple array-of-Tp.  If Tp
-<span class="lineNum">     590 </span>                :    *  is very large, there will be one Tp element per node (i.e., an
-<span class="lineNum">     591 </span>                :    *  &quot;array&quot; of one).  For non-huge Tp's, node size is inversely
-<span class="lineNum">     592 </span>                :    *  related to Tp size: the larger the Tp, the fewer Tp's will fit
-<span class="lineNum">     593 </span>                :    *  in a node.  The goal here is to keep the total size of a node
-<span class="lineNum">     594 </span>                :    *  relatively small and constant over different Tp's, to improve
-<span class="lineNum">     595 </span>                :    *  allocator efficiency.
-<span class="lineNum">     596 </span>                :    *
-<span class="lineNum">     597 </span>                :    *  Not every pointer in the %map array will point to a node.  If
-<span class="lineNum">     598 </span>                :    *  the initial number of elements in the deque is small, the
-<span class="lineNum">     599 </span>                :    *  /middle/ %map pointers will be valid, and the ones at the edges
-<span class="lineNum">     600 </span>                :    *  will be unused.  This same situation will arise as the %map
-<span class="lineNum">     601 </span>                :    *  grows: available %map pointers, if any, will be on the ends.  As
-<span class="lineNum">     602 </span>                :    *  new nodes are created, only a subset of the %map's pointers need
-<span class="lineNum">     603 </span>                :    *  to be copied &quot;outward&quot;.
-<span class="lineNum">     604 </span>                :    *
-<span class="lineNum">     605 </span>                :    *  Class invariants:
-<span class="lineNum">     606 </span>                :    * - For any nonsingular iterator i:
-<span class="lineNum">     607 </span>                :    *    - i.node points to a member of the %map array.  (Yes, you read that
-<span class="lineNum">     608 </span>                :    *      correctly:  i.node does not actually point to a node.)  The member of
-<span class="lineNum">     609 </span>                :    *      the %map array is what actually points to the node.
-<span class="lineNum">     610 </span>                :    *    - i.first == *(i.node)    (This points to the node (first Tp element).)
-<span class="lineNum">     611 </span>                :    *    - i.last  == i.first + node_size
-<span class="lineNum">     612 </span>                :    *    - i.cur is a pointer in the range [i.first, i.last).  NOTE:
-<span class="lineNum">     613 </span>                :    *      the implication of this is that i.cur is always a dereferenceable
-<span class="lineNum">     614 </span>                :    *      pointer, even if i is a past-the-end iterator.
-<span class="lineNum">     615 </span>                :    * - Start and Finish are always nonsingular iterators.  NOTE: this
-<span class="lineNum">     616 </span>                :    * means that an empty deque must have one node, a deque with &lt;N
-<span class="lineNum">     617 </span>                :    * elements (where N is the node buffer size) must have one node, a
-<span class="lineNum">     618 </span>                :    * deque with N through (2N-1) elements must have two nodes, etc.
-<span class="lineNum">     619 </span>                :    * - For every node other than start.node and finish.node, every
-<span class="lineNum">     620 </span>                :    * element in the node is an initialized object.  If start.node ==
-<span class="lineNum">     621 </span>                :    * finish.node, then [start.cur, finish.cur) are initialized
-<span class="lineNum">     622 </span>                :    * objects, and the elements outside that range are uninitialized
-<span class="lineNum">     623 </span>                :    * storage.  Otherwise, [start.cur, start.last) and [finish.first,
-<span class="lineNum">     624 </span>                :    * finish.cur) are initialized objects, and [start.first, start.cur)
-<span class="lineNum">     625 </span>                :    * and [finish.cur, finish.last) are uninitialized storage.
-<span class="lineNum">     626 </span>                :    * - [%map, %map + map_size) is a valid, non-empty range.
-<span class="lineNum">     627 </span>                :    * - [start.node, finish.node] is a valid range contained within
-<span class="lineNum">     628 </span>                :    *   [%map, %map + map_size).
-<span class="lineNum">     629 </span>                :    * - A pointer in the range [%map, %map + map_size) points to an allocated
-<span class="lineNum">     630 </span>                :    *   node if and only if the pointer is in the range
-<span class="lineNum">     631 </span>                :    *   [start.node, finish.node].
-<span class="lineNum">     632 </span>                :    *
-<span class="lineNum">     633 </span>                :    *  Here's the magic:  nothing in deque is &quot;aware&quot; of the discontiguous
-<span class="lineNum">     634 </span>                :    *  storage!
-<span class="lineNum">     635 </span>                :    *
-<span class="lineNum">     636 </span>                :    *  The memory setup and layout occurs in the parent, _Base, and the iterator
-<span class="lineNum">     637 </span>                :    *  class is entirely responsible for &quot;leaping&quot; from one node to the next.
-<span class="lineNum">     638 </span>                :    *  All the implementation routines for deque itself work only through the
-<span class="lineNum">     639 </span>                :    *  start and finish iterators.  This keeps the routines simple and sane,
-<span class="lineNum">     640 </span>                :    *  and we can use other standard algorithms as well.
-<span class="lineNum">     641 </span>                :   */
-<span class="lineNum">     642 </span>                :   template&lt;typename _Tp, typename _Alloc = std::allocator&lt;_Tp&gt; &gt;
-<span class="lineNum">     643 </span>                :     class deque : protected _Deque_base&lt;_Tp, _Alloc&gt;
-<span class="lineNum">     644 </span>                :     {
-<span class="lineNum">     645 </span>                :       // concept requirements
-<span class="lineNum">     646 </span>                :       typedef typename _Alloc::value_type        _Alloc_value_type;
-<span class="lineNum">     647 </span>                :       __glibcxx_class_requires(_Tp, _SGIAssignableConcept)
-<span class="lineNum">     648 </span>                :       __glibcxx_class_requires2(_Tp, _Alloc_value_type, _SameTypeConcept)
-<span class="lineNum">     649 </span>                : 
-<span class="lineNum">     650 </span>                :       typedef _Deque_base&lt;_Tp, _Alloc&gt;           _Base;
-<span class="lineNum">     651 </span>                :       typedef typename _Base::_Tp_alloc_type     _Tp_alloc_type;
-<span class="lineNum">     652 </span>                : 
-<span class="lineNum">     653 </span>                :     public:
-<span class="lineNum">     654 </span>                :       typedef _Tp                                        value_type;
-<span class="lineNum">     655 </span>                :       typedef typename _Tp_alloc_type::pointer           pointer;
-<span class="lineNum">     656 </span>                :       typedef typename _Tp_alloc_type::const_pointer     const_pointer;
-<span class="lineNum">     657 </span>                :       typedef typename _Tp_alloc_type::reference         reference;
-<span class="lineNum">     658 </span>                :       typedef typename _Tp_alloc_type::const_reference   const_reference;
-<span class="lineNum">     659 </span>                :       typedef typename _Base::iterator                   iterator;
-<span class="lineNum">     660 </span>                :       typedef typename _Base::const_iterator             const_iterator;
-<span class="lineNum">     661 </span>                :       typedef std::reverse_iterator&lt;const_iterator&gt;      const_reverse_iterator;
-<span class="lineNum">     662 </span>                :       typedef std::reverse_iterator&lt;iterator&gt;            reverse_iterator;
-<span class="lineNum">     663 </span>                :       typedef size_t                             size_type;
-<span class="lineNum">     664 </span>                :       typedef ptrdiff_t                          difference_type;
-<span class="lineNum">     665 </span>                :       typedef _Alloc                             allocator_type;
-<span class="lineNum">     666 </span>                : 
-<span class="lineNum">     667 </span>                :     protected:
-<span class="lineNum">     668 </span>                :       typedef pointer*                           _Map_pointer;
-<span class="lineNum">     669 </span>                : 
-<span class="lineNum">     670 </span><span class="lineNoCov">              0 :       static size_t _S_buffer_size()</span>
-<span class="lineNum">     671 </span><span class="lineNoCov">              0 :       { return __deque_buf_size(sizeof(_Tp)); }</span>
-<span class="lineNum">     672 </span>                : 
-<span class="lineNum">     673 </span>                :       // Functions controlling memory layout, and nothing else.
-<span class="lineNum">     674 </span>                :       using _Base::_M_initialize_map;
-<span class="lineNum">     675 </span>                :       using _Base::_M_create_nodes;
-<span class="lineNum">     676 </span>                :       using _Base::_M_destroy_nodes;
-<span class="lineNum">     677 </span>                :       using _Base::_M_allocate_node;
-<span class="lineNum">     678 </span>                :       using _Base::_M_deallocate_node;
-<span class="lineNum">     679 </span>                :       using _Base::_M_allocate_map;
-<span class="lineNum">     680 </span>                :       using _Base::_M_deallocate_map;
-<span class="lineNum">     681 </span>                :       using _Base::_M_get_Tp_allocator;
-<span class="lineNum">     682 </span>                : 
-<span class="lineNum">     683 </span>                :       /** 
-<span class="lineNum">     684 </span>                :        *  A total of four data members accumulated down the hierarchy.
-<span class="lineNum">     685 </span>                :        *  May be accessed via _M_impl.*
-<span class="lineNum">     686 </span>                :        */
-<span class="lineNum">     687 </span>                :       using _Base::_M_impl;
-<span class="lineNum">     688 </span>                : 
-<span class="lineNum">     689 </span>                :     public:
-<span class="lineNum">     690 </span>                :       // [23.2.1.1] construct/copy/destroy
-<span class="lineNum">     691 </span>                :       // (assign() and get_allocator() are also listed in this section)
-<span class="lineNum">     692 </span>                :       /**
-<span class="lineNum">     693 </span>                :        *  @brief  Default constructor creates no elements.
-<span class="lineNum">     694 </span>                :        */
-<span class="lineNum">     695 </span><span class="lineCov">             21 :       deque()</span>
-<span class="lineNum">     696 </span><span class="lineCov">             21 :       : _Base() { }</span>
-<span class="lineNum">     697 </span>                : 
-<span class="lineNum">     698 </span>                :       /**
-<span class="lineNum">     699 </span>                :        *  @brief  Creates a %deque with no elements.
-<span class="lineNum">     700 </span>                :        *  @param  a  An allocator object.
-<span class="lineNum">     701 </span>                :        */
-<span class="lineNum">     702 </span>                :       explicit
-<span class="lineNum">     703 </span>                :       deque(const allocator_type&amp; __a)
-<span class="lineNum">     704 </span>                :       : _Base(__a, 0) { }
-<span class="lineNum">     705 </span>                : 
-<span class="lineNum">     706 </span>                :       /**
-<span class="lineNum">     707 </span>                :        *  @brief  Creates a %deque with copies of an exemplar element.
-<span class="lineNum">     708 </span>                :        *  @param  n  The number of elements to initially create.
-<span class="lineNum">     709 </span>                :        *  @param  value  An element to copy.
-<span class="lineNum">     710 </span>                :        *  @param  a  An allocator.
-<span class="lineNum">     711 </span>                :        *
-<span class="lineNum">     712 </span>                :        *  This constructor fills the %deque with @a n copies of @a value.
-<span class="lineNum">     713 </span>                :        */
-<span class="lineNum">     714 </span>                :       explicit
-<span class="lineNum">     715 </span>                :       deque(size_type __n, const value_type&amp; __value = value_type(),
-<span class="lineNum">     716 </span>                :             const allocator_type&amp; __a = allocator_type())
-<span class="lineNum">     717 </span>                :       : _Base(__a, __n)
-<span class="lineNum">     718 </span>                :       { _M_fill_initialize(__value); }
-<span class="lineNum">     719 </span>                : 
-<span class="lineNum">     720 </span>                :       /**
-<span class="lineNum">     721 </span>                :        *  @brief  %Deque copy constructor.
-<span class="lineNum">     722 </span>                :        *  @param  x  A %deque of identical element and allocator types.
-<span class="lineNum">     723 </span>                :        *
-<span class="lineNum">     724 </span>                :        *  The newly-created %deque uses a copy of the allocation object used
-<span class="lineNum">     725 </span>                :        *  by @a x.
-<span class="lineNum">     726 </span>                :        */
-<span class="lineNum">     727 </span><span class="lineCov">             13 :       deque(const deque&amp; __x)</span>
-<span class="lineNum">     728 </span><span class="lineCov">             13 :       : _Base(__x._M_get_Tp_allocator(), __x.size())</span>
-<span class="lineNum">     729 </span><span class="lineCov">             13 :       { std::__uninitialized_copy_a(__x.begin(), __x.end(), </span>
-<span class="lineNum">     730 </span>                :                                     this-&gt;_M_impl._M_start,
-<span class="lineNum">     731 </span><span class="lineCov">             13 :                                     _M_get_Tp_allocator()); }</span>
-<span class="lineNum">     732 </span>                : 
-<span class="lineNum">     733 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     734 </span>                :       /**
-<span class="lineNum">     735 </span>                :        *  @brief  %Deque move constructor.
-<span class="lineNum">     736 </span>                :        *  @param  x  A %deque of identical element and allocator types.
-<span class="lineNum">     737 </span>                :        *
-<span class="lineNum">     738 </span>                :        *  The newly-created %deque contains the exact contents of @a x.
-<span class="lineNum">     739 </span>                :        *  The contents of @a x are a valid, but unspecified %deque.
-<span class="lineNum">     740 </span>                :        */
-<span class="lineNum">     741 </span>                :       deque(deque&amp;&amp;  __x)
-<span class="lineNum">     742 </span>                :       : _Base(std::forward&lt;_Base&gt;(__x)) { }
-<span class="lineNum">     743 </span>                : #endif
-<span class="lineNum">     744 </span>                : 
-<span class="lineNum">     745 </span>                :       /**
-<span class="lineNum">     746 </span>                :        *  @brief  Builds a %deque from a range.
-<span class="lineNum">     747 </span>                :        *  @param  first  An input iterator.
-<span class="lineNum">     748 </span>                :        *  @param  last  An input iterator.
-<span class="lineNum">     749 </span>                :        *  @param  a  An allocator object.
-<span class="lineNum">     750 </span>                :        *
-<span class="lineNum">     751 </span>                :        *  Create a %deque consisting of copies of the elements from [first,
-<span class="lineNum">     752 </span>                :        *  last).
-<span class="lineNum">     753 </span>                :        *
-<span class="lineNum">     754 </span>                :        *  If the iterators are forward, bidirectional, or random-access, then
-<span class="lineNum">     755 </span>                :        *  this will call the elements' copy constructor N times (where N is
-<span class="lineNum">     756 </span>                :        *  distance(first,last)) and do no memory reallocation.  But if only
-<span class="lineNum">     757 </span>                :        *  input iterators are used, then this will do at most 2N calls to the
-<span class="lineNum">     758 </span>                :        *  copy constructor, and logN memory reallocations.
-<span class="lineNum">     759 </span>                :        */
-<span class="lineNum">     760 </span>                :       template&lt;typename _InputIterator&gt;
-<span class="lineNum">     761 </span>                :         deque(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">     762 </span>                :               const allocator_type&amp; __a = allocator_type())
-<span class="lineNum">     763 </span>                :         : _Base(__a)
-<span class="lineNum">     764 </span>                :         {
-<span class="lineNum">     765 </span>                :           // Check whether it's an integral type.  If so, it's not an iterator.
-<span class="lineNum">     766 </span>                :           typedef typename std::__is_integer&lt;_InputIterator&gt;::__type _Integral;
-<span class="lineNum">     767 </span>                :           _M_initialize_dispatch(__first, __last, _Integral());
-<span class="lineNum">     768 </span>                :         }
-<span class="lineNum">     769 </span>                : 
-<span class="lineNum">     770 </span>                :       /**
-<span class="lineNum">     771 </span>                :        *  The dtor only erases the elements, and note that if the elements
-<span class="lineNum">     772 </span>                :        *  themselves are pointers, the pointed-to memory is not touched in any
-<span class="lineNum">     773 </span>                :        *  way.  Managing the pointer is the user's responsibility.
-<span class="lineNum">     774 </span>                :        */
-<span class="lineNum">     775 </span><span class="lineCov">             30 :       ~deque()</span>
-<span class="lineNum">     776 </span><span class="lineCov">             30 :       { _M_destroy_data(begin(), end(), _M_get_Tp_allocator()); }</span>
-<span class="lineNum">     777 </span>                : 
-<span class="lineNum">     778 </span>                :       /**
-<span class="lineNum">     779 </span>                :        *  @brief  %Deque assignment operator.
-<span class="lineNum">     780 </span>                :        *  @param  x  A %deque of identical element and allocator types.
-<span class="lineNum">     781 </span>                :        *
-<span class="lineNum">     782 </span>                :        *  All the elements of @a x are copied, but unlike the copy constructor,
-<span class="lineNum">     783 </span>                :        *  the allocator object is not copied.
-<span class="lineNum">     784 </span>                :        */
-<span class="lineNum">     785 </span>                :       deque&amp;
-<span class="lineNum">     786 </span>                :       operator=(const deque&amp; __x);
-<span class="lineNum">     787 </span>                : 
-<span class="lineNum">     788 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     789 </span>                :       /**
-<span class="lineNum">     790 </span>                :        *  @brief  %Deque move assignment operator.
-<span class="lineNum">     791 </span>                :        *  @param  x  A %deque of identical element and allocator types.
-<span class="lineNum">     792 </span>                :        *
-<span class="lineNum">     793 </span>                :        *  The contents of @a x are moved into this deque (without copying).
-<span class="lineNum">     794 </span>                :        *  @a x is a valid, but unspecified %deque.
-<span class="lineNum">     795 </span>                :        */
-<span class="lineNum">     796 </span>                :       deque&amp;
-<span class="lineNum">     797 </span>                :       operator=(deque&amp;&amp; __x)
-<span class="lineNum">     798 </span>                :       {
-<span class="lineNum">     799 </span>                :         // NB: DR 675.
-<span class="lineNum">     800 </span>                :         this-&gt;clear();
-<span class="lineNum">     801 </span>                :         this-&gt;swap(__x); 
-<span class="lineNum">     802 </span>                :         return *this;
-<span class="lineNum">     803 </span>                :       }
-<span class="lineNum">     804 </span>                : #endif
-<span class="lineNum">     805 </span>                : 
-<span class="lineNum">     806 </span>                :       /**
-<span class="lineNum">     807 </span>                :        *  @brief  Assigns a given value to a %deque.
-<span class="lineNum">     808 </span>                :        *  @param  n  Number of elements to be assigned.
-<span class="lineNum">     809 </span>                :        *  @param  val  Value to be assigned.
-<span class="lineNum">     810 </span>                :        *
-<span class="lineNum">     811 </span>                :        *  This function fills a %deque with @a n copies of the given
-<span class="lineNum">     812 </span>                :        *  value.  Note that the assignment completely changes the
-<span class="lineNum">     813 </span>                :        *  %deque and that the resulting %deque's size is the same as
-<span class="lineNum">     814 </span>                :        *  the number of elements assigned.  Old data may be lost.
-<span class="lineNum">     815 </span>                :        */
-<span class="lineNum">     816 </span>                :       void
-<span class="lineNum">     817 </span>                :       assign(size_type __n, const value_type&amp; __val)
-<span class="lineNum">     818 </span>                :       { _M_fill_assign(__n, __val); }
-<span class="lineNum">     819 </span>                : 
-<span class="lineNum">     820 </span>                :       /**
-<span class="lineNum">     821 </span>                :        *  @brief  Assigns a range to a %deque.
-<span class="lineNum">     822 </span>                :        *  @param  first  An input iterator.
-<span class="lineNum">     823 </span>                :        *  @param  last   An input iterator.
-<span class="lineNum">     824 </span>                :        *
-<span class="lineNum">     825 </span>                :        *  This function fills a %deque with copies of the elements in the
-<span class="lineNum">     826 </span>                :        *  range [first,last).
-<span class="lineNum">     827 </span>                :        *
-<span class="lineNum">     828 </span>                :        *  Note that the assignment completely changes the %deque and that the
-<span class="lineNum">     829 </span>                :        *  resulting %deque's size is the same as the number of elements
-<span class="lineNum">     830 </span>                :        *  assigned.  Old data may be lost.
-<span class="lineNum">     831 </span>                :        */
-<span class="lineNum">     832 </span>                :       template&lt;typename _InputIterator&gt;
-<span class="lineNum">     833 </span>                :         void
-<span class="lineNum">     834 </span>                :         assign(_InputIterator __first, _InputIterator __last)
-<span class="lineNum">     835 </span>                :         {
-<span class="lineNum">     836 </span>                :           typedef typename std::__is_integer&lt;_InputIterator&gt;::__type _Integral;
-<span class="lineNum">     837 </span>                :           _M_assign_dispatch(__first, __last, _Integral());
-<span class="lineNum">     838 </span>                :         }
-<span class="lineNum">     839 </span>                : 
-<span class="lineNum">     840 </span>                :       /// Get a copy of the memory allocation object.
-<span class="lineNum">     841 </span>                :       allocator_type
-<span class="lineNum">     842 </span>                :       get_allocator() const
-<span class="lineNum">     843 </span>                :       { return _Base::get_allocator(); }
-<span class="lineNum">     844 </span>                : 
-<span class="lineNum">     845 </span>                :       // iterators
-<span class="lineNum">     846 </span>                :       /**
-<span class="lineNum">     847 </span>                :        *  Returns a read/write iterator that points to the first element in the
-<span class="lineNum">     848 </span>                :        *  %deque.  Iteration is done in ordinary element order.
-<span class="lineNum">     849 </span>                :        */
-<span class="lineNum">     850 </span>                :       iterator
-<span class="lineNum">     851 </span><span class="lineCov">           7800 :       begin()</span>
-<span class="lineNum">     852 </span><span class="lineCov">           7800 :       { return this-&gt;_M_impl._M_start; }</span>
-<span class="lineNum">     853 </span>                : 
-<span class="lineNum">     854 </span>                :       /**
-<span class="lineNum">     855 </span>                :        *  Returns a read-only (constant) iterator that points to the first
-<span class="lineNum">     856 </span>                :        *  element in the %deque.  Iteration is done in ordinary element order.
-<span class="lineNum">     857 </span>                :        */
-<span class="lineNum">     858 </span>                :       const_iterator
-<span class="lineNum">     859 </span><span class="lineCov">             17 :       begin() const</span>
-<span class="lineNum">     860 </span><span class="lineCov">             17 :       { return this-&gt;_M_impl._M_start; }</span>
-<span class="lineNum">     861 </span>                : 
-<span class="lineNum">     862 </span>                :       /**
-<span class="lineNum">     863 </span>                :        *  Returns a read/write iterator that points one past the last
-<span class="lineNum">     864 </span>                :        *  element in the %deque.  Iteration is done in ordinary
-<span class="lineNum">     865 </span>                :        *  element order.
-<span class="lineNum">     866 </span>                :        */
-<span class="lineNum">     867 </span>                :       iterator
-<span class="lineNum">     868 </span><span class="lineCov">          10575 :       end()</span>
-<span class="lineNum">     869 </span><span class="lineCov">          10575 :       { return this-&gt;_M_impl._M_finish; }</span>
-<span class="lineNum">     870 </span>                : 
-<span class="lineNum">     871 </span>                :       /**
-<span class="lineNum">     872 </span>                :        *  Returns a read-only (constant) iterator that points one past
-<span class="lineNum">     873 </span>                :        *  the last element in the %deque.  Iteration is done in
-<span class="lineNum">     874 </span>                :        *  ordinary element order.
-<span class="lineNum">     875 </span>                :        */
-<span class="lineNum">     876 </span>                :       const_iterator
-<span class="lineNum">     877 </span><span class="lineCov">             17 :       end() const</span>
-<span class="lineNum">     878 </span><span class="lineCov">             17 :       { return this-&gt;_M_impl._M_finish; }</span>
-<span class="lineNum">     879 </span>                : 
-<span class="lineNum">     880 </span>                :       /**
-<span class="lineNum">     881 </span>                :        *  Returns a read/write reverse iterator that points to the
-<span class="lineNum">     882 </span>                :        *  last element in the %deque.  Iteration is done in reverse
-<span class="lineNum">     883 </span>                :        *  element order.
-<span class="lineNum">     884 </span>                :        */
-<span class="lineNum">     885 </span>                :       reverse_iterator
-<span class="lineNum">     886 </span>                :       rbegin()
-<span class="lineNum">     887 </span>                :       { return reverse_iterator(this-&gt;_M_impl._M_finish); }
-<span class="lineNum">     888 </span>                : 
-<span class="lineNum">     889 </span>                :       /**
-<span class="lineNum">     890 </span>                :        *  Returns a read-only (constant) reverse iterator that points
-<span class="lineNum">     891 </span>                :        *  to the last element in the %deque.  Iteration is done in
-<span class="lineNum">     892 </span>                :        *  reverse element order.
-<span class="lineNum">     893 </span>                :        */
-<span class="lineNum">     894 </span>                :       const_reverse_iterator
-<span class="lineNum">     895 </span>                :       rbegin() const
-<span class="lineNum">     896 </span>                :       { return const_reverse_iterator(this-&gt;_M_impl._M_finish); }
-<span class="lineNum">     897 </span>                : 
-<span class="lineNum">     898 </span>                :       /**
-<span class="lineNum">     899 </span>                :        *  Returns a read/write reverse iterator that points to one
-<span class="lineNum">     900 </span>                :        *  before the first element in the %deque.  Iteration is done
-<span class="lineNum">     901 </span>                :        *  in reverse element order.
-<span class="lineNum">     902 </span>                :        */
-<span class="lineNum">     903 </span>                :       reverse_iterator
-<span class="lineNum">     904 </span>                :       rend()
-<span class="lineNum">     905 </span>                :       { return reverse_iterator(this-&gt;_M_impl._M_start); }
-<span class="lineNum">     906 </span>                : 
-<span class="lineNum">     907 </span>                :       /**
-<span class="lineNum">     908 </span>                :        *  Returns a read-only (constant) reverse iterator that points
-<span class="lineNum">     909 </span>                :        *  to one before the first element in the %deque.  Iteration is
-<span class="lineNum">     910 </span>                :        *  done in reverse element order.
-<span class="lineNum">     911 </span>                :        */
-<span class="lineNum">     912 </span>                :       const_reverse_iterator
-<span class="lineNum">     913 </span>                :       rend() const
-<span class="lineNum">     914 </span>                :       { return const_reverse_iterator(this-&gt;_M_impl._M_start); }
-<span class="lineNum">     915 </span>                : 
-<span class="lineNum">     916 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     917 </span>                :       /**
-<span class="lineNum">     918 </span>                :        *  Returns a read-only (constant) iterator that points to the first
-<span class="lineNum">     919 </span>                :        *  element in the %deque.  Iteration is done in ordinary element order.
-<span class="lineNum">     920 </span>                :        */
-<span class="lineNum">     921 </span>                :       const_iterator
-<span class="lineNum">     922 </span>                :       cbegin() const
-<span class="lineNum">     923 </span>                :       { return this-&gt;_M_impl._M_start; }
-<span class="lineNum">     924 </span>                : 
-<span class="lineNum">     925 </span>                :       /**
-<span class="lineNum">     926 </span>                :        *  Returns a read-only (constant) iterator that points one past
-<span class="lineNum">     927 </span>                :        *  the last element in the %deque.  Iteration is done in
-<span class="lineNum">     928 </span>                :        *  ordinary element order.
-<span class="lineNum">     929 </span>                :        */
-<span class="lineNum">     930 </span>                :       const_iterator
-<span class="lineNum">     931 </span>                :       cend() const
-<span class="lineNum">     932 </span>                :       { return this-&gt;_M_impl._M_finish; }
-<span class="lineNum">     933 </span>                : 
-<span class="lineNum">     934 </span>                :       /**
-<span class="lineNum">     935 </span>                :        *  Returns a read-only (constant) reverse iterator that points
-<span class="lineNum">     936 </span>                :        *  to the last element in the %deque.  Iteration is done in
-<span class="lineNum">     937 </span>                :        *  reverse element order.
-<span class="lineNum">     938 </span>                :        */
-<span class="lineNum">     939 </span>                :       const_reverse_iterator
-<span class="lineNum">     940 </span>                :       crbegin() const
-<span class="lineNum">     941 </span>                :       { return const_reverse_iterator(this-&gt;_M_impl._M_finish); }
-<span class="lineNum">     942 </span>                : 
-<span class="lineNum">     943 </span>                :       /**
-<span class="lineNum">     944 </span>                :        *  Returns a read-only (constant) reverse iterator that points
-<span class="lineNum">     945 </span>                :        *  to one before the first element in the %deque.  Iteration is
-<span class="lineNum">     946 </span>                :        *  done in reverse element order.
-<span class="lineNum">     947 </span>                :        */
-<span class="lineNum">     948 </span>                :       const_reverse_iterator
-<span class="lineNum">     949 </span>                :       crend() const
-<span class="lineNum">     950 </span>                :       { return const_reverse_iterator(this-&gt;_M_impl._M_start); }
-<span class="lineNum">     951 </span>                : #endif
-<span class="lineNum">     952 </span>                : 
-<span class="lineNum">     953 </span>                :       // [23.2.1.2] capacity
-<span class="lineNum">     954 </span>                :       /**  Returns the number of elements in the %deque.  */
-<span class="lineNum">     955 </span>                :       size_type
-<span class="lineNum">     956 </span><span class="lineCov">            111 :       size() const</span>
-<span class="lineNum">     957 </span><span class="lineCov">            111 :       { return this-&gt;_M_impl._M_finish - this-&gt;_M_impl._M_start; }</span>
-<span class="lineNum">     958 </span>                : 
-<span class="lineNum">     959 </span>                :       /**  Returns the size() of the largest possible %deque.  */
-<span class="lineNum">     960 </span>                :       size_type
-<span class="lineNum">     961 </span><span class="lineNoCov">              0 :       max_size() const</span>
-<span class="lineNum">     962 </span><span class="lineNoCov">              0 :       { return _M_get_Tp_allocator().max_size(); }</span>
-<span class="lineNum">     963 </span>                : 
-<span class="lineNum">     964 </span>                :       /**
-<span class="lineNum">     965 </span>                :        *  @brief  Resizes the %deque to the specified number of elements.
-<span class="lineNum">     966 </span>                :        *  @param  new_size  Number of elements the %deque should contain.
-<span class="lineNum">     967 </span>                :        *  @param  x  Data with which new elements should be populated.
-<span class="lineNum">     968 </span>                :        *
-<span class="lineNum">     969 </span>                :        *  This function will %resize the %deque to the specified
-<span class="lineNum">     970 </span>                :        *  number of elements.  If the number is smaller than the
-<span class="lineNum">     971 </span>                :        *  %deque's current size the %deque is truncated, otherwise the
-<span class="lineNum">     972 </span>                :        *  %deque is extended and new elements are populated with given
-<span class="lineNum">     973 </span>                :        *  data.
-<span class="lineNum">     974 </span>                :        */
-<span class="lineNum">     975 </span>                :       void
-<span class="lineNum">     976 </span>                :       resize(size_type __new_size, value_type __x = value_type())
-<span class="lineNum">     977 </span>                :       {
-<span class="lineNum">     978 </span>                :         const size_type __len = size();
-<span class="lineNum">     979 </span>                :         if (__new_size &lt; __len)
-<span class="lineNum">     980 </span>                :           _M_erase_at_end(this-&gt;_M_impl._M_start + difference_type(__new_size));
-<span class="lineNum">     981 </span>                :         else
-<span class="lineNum">     982 </span>                :           insert(this-&gt;_M_impl._M_finish, __new_size - __len, __x);
-<span class="lineNum">     983 </span>                :       }
-<span class="lineNum">     984 </span>                : 
-<span class="lineNum">     985 </span>                :       /**
-<span class="lineNum">     986 </span>                :        *  Returns true if the %deque is empty.  (Thus begin() would
-<span class="lineNum">     987 </span>                :        *  equal end().)
-<span class="lineNum">     988 </span>                :        */
-<span class="lineNum">     989 </span>                :       bool
-<span class="lineNum">     990 </span><span class="lineCov">             32 :       empty() const</span>
-<span class="lineNum">     991 </span><span class="lineCov">             32 :       { return this-&gt;_M_impl._M_finish == this-&gt;_M_impl._M_start; }</span>
-<span class="lineNum">     992 </span>                : 
-<span class="lineNum">     993 </span>                :       // element access
-<span class="lineNum">     994 </span>                :       /**
-<span class="lineNum">     995 </span>                :        *  @brief Subscript access to the data contained in the %deque.
-<span class="lineNum">     996 </span>                :        *  @param n The index of the element for which data should be
-<span class="lineNum">     997 </span>                :        *  accessed.
-<span class="lineNum">     998 </span>                :        *  @return  Read/write reference to data.
-<span class="lineNum">     999 </span>                :        *
-<span class="lineNum">    1000 </span>                :        *  This operator allows for easy, array-style, data access.
-<span class="lineNum">    1001 </span>                :        *  Note that data access with this operator is unchecked and
-<span class="lineNum">    1002 </span>                :        *  out_of_range lookups are not defined. (For checked lookups
-<span class="lineNum">    1003 </span>                :        *  see at().)
-<span class="lineNum">    1004 </span>                :        */
-<span class="lineNum">    1005 </span>                :       reference
-<span class="lineNum">    1006 </span>                :       operator[](size_type __n)
-<span class="lineNum">    1007 </span>                :       { return this-&gt;_M_impl._M_start[difference_type(__n)]; }
-<span class="lineNum">    1008 </span>                : 
-<span class="lineNum">    1009 </span>                :       /**
-<span class="lineNum">    1010 </span>                :        *  @brief Subscript access to the data contained in the %deque.
-<span class="lineNum">    1011 </span>                :        *  @param n The index of the element for which data should be
-<span class="lineNum">    1012 </span>                :        *  accessed.
-<span class="lineNum">    1013 </span>                :        *  @return  Read-only (constant) reference to data.
-<span class="lineNum">    1014 </span>                :        *
-<span class="lineNum">    1015 </span>                :        *  This operator allows for easy, array-style, data access.
-<span class="lineNum">    1016 </span>                :        *  Note that data access with this operator is unchecked and
-<span class="lineNum">    1017 </span>                :        *  out_of_range lookups are not defined. (For checked lookups
-<span class="lineNum">    1018 </span>                :        *  see at().)
-<span class="lineNum">    1019 </span>                :        */
-<span class="lineNum">    1020 </span>                :       const_reference
-<span class="lineNum">    1021 </span>                :       operator[](size_type __n) const
-<span class="lineNum">    1022 </span>                :       { return this-&gt;_M_impl._M_start[difference_type(__n)]; }
-<span class="lineNum">    1023 </span>                : 
-<span class="lineNum">    1024 </span>                :     protected:
-<span class="lineNum">    1025 </span>                :       /// Safety check used only from at().
-<span class="lineNum">    1026 </span>                :       void
-<span class="lineNum">    1027 </span>                :       _M_range_check(size_type __n) const
-<span class="lineNum">    1028 </span>                :       {
-<span class="lineNum">    1029 </span>                :         if (__n &gt;= this-&gt;size())
-<span class="lineNum">    1030 </span>                :           __throw_out_of_range(__N(&quot;deque::_M_range_check&quot;));
-<span class="lineNum">    1031 </span>                :       }
-<span class="lineNum">    1032 </span>                : 
-<span class="lineNum">    1033 </span>                :     public:
-<span class="lineNum">    1034 </span>                :       /**
-<span class="lineNum">    1035 </span>                :        *  @brief  Provides access to the data contained in the %deque.
-<span class="lineNum">    1036 </span>                :        *  @param n The index of the element for which data should be
-<span class="lineNum">    1037 </span>                :        *  accessed.
-<span class="lineNum">    1038 </span>                :        *  @return  Read/write reference to data.
-<span class="lineNum">    1039 </span>                :        *  @throw  std::out_of_range  If @a n is an invalid index.
-<span class="lineNum">    1040 </span>                :        *
-<span class="lineNum">    1041 </span>                :        *  This function provides for safer data access.  The parameter
-<span class="lineNum">    1042 </span>                :        *  is first checked that it is in the range of the deque.  The
-<span class="lineNum">    1043 </span>                :        *  function throws out_of_range if the check fails.
-<span class="lineNum">    1044 </span>                :        */
-<span class="lineNum">    1045 </span>                :       reference
-<span class="lineNum">    1046 </span>                :       at(size_type __n)
-<span class="lineNum">    1047 </span>                :       {
-<span class="lineNum">    1048 </span>                :         _M_range_check(__n);
-<span class="lineNum">    1049 </span>                :         return (*this)[__n];
-<span class="lineNum">    1050 </span>                :       }
-<span class="lineNum">    1051 </span>                : 
-<span class="lineNum">    1052 </span>                :       /**
-<span class="lineNum">    1053 </span>                :        *  @brief  Provides access to the data contained in the %deque.
-<span class="lineNum">    1054 </span>                :        *  @param n The index of the element for which data should be
-<span class="lineNum">    1055 </span>                :        *  accessed.
-<span class="lineNum">    1056 </span>                :        *  @return  Read-only (constant) reference to data.
-<span class="lineNum">    1057 </span>                :        *  @throw  std::out_of_range  If @a n is an invalid index.
-<span class="lineNum">    1058 </span>                :        *
-<span class="lineNum">    1059 </span>                :        *  This function provides for safer data access.  The parameter is first
-<span class="lineNum">    1060 </span>                :        *  checked that it is in the range of the deque.  The function throws
-<span class="lineNum">    1061 </span>                :        *  out_of_range if the check fails.
-<span class="lineNum">    1062 </span>                :        */
-<span class="lineNum">    1063 </span>                :       const_reference
-<span class="lineNum">    1064 </span>                :       at(size_type __n) const
-<span class="lineNum">    1065 </span>                :       {
-<span class="lineNum">    1066 </span>                :         _M_range_check(__n);
-<span class="lineNum">    1067 </span>                :         return (*this)[__n];
-<span class="lineNum">    1068 </span>                :       }
-<span class="lineNum">    1069 </span>                : 
-<span class="lineNum">    1070 </span>                :       /**
-<span class="lineNum">    1071 </span>                :        *  Returns a read/write reference to the data at the first
-<span class="lineNum">    1072 </span>                :        *  element of the %deque.
-<span class="lineNum">    1073 </span>                :        */
-<span class="lineNum">    1074 </span>                :       reference
-<span class="lineNum">    1075 </span>                :       front()
-<span class="lineNum">    1076 </span>                :       { return *begin(); }
-<span class="lineNum">    1077 </span>                : 
-<span class="lineNum">    1078 </span>                :       /**
-<span class="lineNum">    1079 </span>                :        *  Returns a read-only (constant) reference to the data at the first
-<span class="lineNum">    1080 </span>                :        *  element of the %deque.
-<span class="lineNum">    1081 </span>                :        */
-<span class="lineNum">    1082 </span>                :       const_reference
-<span class="lineNum">    1083 </span>                :       front() const
-<span class="lineNum">    1084 </span>                :       { return *begin(); }
-<span class="lineNum">    1085 </span>                : 
-<span class="lineNum">    1086 </span>                :       /**
-<span class="lineNum">    1087 </span>                :        *  Returns a read/write reference to the data at the last element of the
-<span class="lineNum">    1088 </span>                :        *  %deque.
-<span class="lineNum">    1089 </span>                :        */
-<span class="lineNum">    1090 </span>                :       reference
-<span class="lineNum">    1091 </span><span class="lineCov">             39 :       back()</span>
-<span class="lineNum">    1092 </span>                :       {
-<span class="lineNum">    1093 </span><span class="lineCov">             39 :         iterator __tmp = end();</span>
-<span class="lineNum">    1094 </span><span class="lineCov">             39 :         --__tmp;</span>
-<span class="lineNum">    1095 </span><span class="lineCov">             39 :         return *__tmp;</span>
-<span class="lineNum">    1096 </span>                :       }
-<span class="lineNum">    1097 </span>                : 
-<span class="lineNum">    1098 </span>                :       /**
-<span class="lineNum">    1099 </span>                :        *  Returns a read-only (constant) reference to the data at the last
-<span class="lineNum">    1100 </span>                :        *  element of the %deque.
-<span class="lineNum">    1101 </span>                :        */
-<span class="lineNum">    1102 </span>                :       const_reference
-<span class="lineNum">    1103 </span>                :       back() const
-<span class="lineNum">    1104 </span>                :       {
-<span class="lineNum">    1105 </span>                :         const_iterator __tmp = end();
-<span class="lineNum">    1106 </span>                :         --__tmp;
-<span class="lineNum">    1107 </span>                :         return *__tmp;
-<span class="lineNum">    1108 </span>                :       }
-<span class="lineNum">    1109 </span>                : 
-<span class="lineNum">    1110 </span>                :       // [23.2.1.2] modifiers
-<span class="lineNum">    1111 </span>                :       /**
-<span class="lineNum">    1112 </span>                :        *  @brief  Add data to the front of the %deque.
-<span class="lineNum">    1113 </span>                :        *  @param  x  Data to be added.
-<span class="lineNum">    1114 </span>                :        *
-<span class="lineNum">    1115 </span>                :        *  This is a typical stack operation.  The function creates an
-<span class="lineNum">    1116 </span>                :        *  element at the front of the %deque and assigns the given
-<span class="lineNum">    1117 </span>                :        *  data to it.  Due to the nature of a %deque this operation
-<span class="lineNum">    1118 </span>                :        *  can be done in constant time.
-<span class="lineNum">    1119 </span>                :        */
-<span class="lineNum">    1120 </span>                : #ifndef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">    1121 </span>                :       void
-<span class="lineNum">    1122 </span>                :       push_front(const value_type&amp; __x)
-<span class="lineNum">    1123 </span>                :       {
-<span class="lineNum">    1124 </span>                :         if (this-&gt;_M_impl._M_start._M_cur != this-&gt;_M_impl._M_start._M_first)
-<span class="lineNum">    1125 </span>                :           {
-<span class="lineNum">    1126 </span>                :             this-&gt;_M_impl.construct(this-&gt;_M_impl._M_start._M_cur - 1, __x);
-<span class="lineNum">    1127 </span>                :             --this-&gt;_M_impl._M_start._M_cur;
-<span class="lineNum">    1128 </span>                :           }
-<span class="lineNum">    1129 </span>                :         else
-<span class="lineNum">    1130 </span>                :           _M_push_front_aux(__x);
-<span class="lineNum">    1131 </span>                :       }
-<span class="lineNum">    1132 </span>                : #else
-<span class="lineNum">    1133 </span>                :       template&lt;typename... _Args&gt;
-<span class="lineNum">    1134 </span>                :         void
-<span class="lineNum">    1135 </span>                :         push_front(_Args&amp;&amp;... __args)
-<span class="lineNum">    1136 </span>                :         {
-<span class="lineNum">    1137 </span>                :           if (this-&gt;_M_impl._M_start._M_cur != this-&gt;_M_impl._M_start._M_first)
-<span class="lineNum">    1138 </span>                :             {
-<span class="lineNum">    1139 </span>                :               this-&gt;_M_impl.construct(this-&gt;_M_impl._M_start._M_cur - 1,
-<span class="lineNum">    1140 </span>                :                                       std::forward&lt;_Args&gt;(__args)...);
-<span class="lineNum">    1141 </span>                :               --this-&gt;_M_impl._M_start._M_cur;
-<span class="lineNum">    1142 </span>                :             }
-<span class="lineNum">    1143 </span>                :           else
-<span class="lineNum">    1144 </span>                :             _M_push_front_aux(std::forward&lt;_Args&gt;(__args)...);
-<span class="lineNum">    1145 </span>                :         }
-<span class="lineNum">    1146 </span>                : #endif
-<span class="lineNum">    1147 </span>                : 
-<span class="lineNum">    1148 </span>                :       /**
-<span class="lineNum">    1149 </span>                :        *  @brief  Add data to the end of the %deque.
-<span class="lineNum">    1150 </span>                :        *  @param  x  Data to be added.
-<span class="lineNum">    1151 </span>                :        *
-<span class="lineNum">    1152 </span>                :        *  This is a typical stack operation.  The function creates an
-<span class="lineNum">    1153 </span>                :        *  element at the end of the %deque and assigns the given data
-<span class="lineNum">    1154 </span>                :        *  to it.  Due to the nature of a %deque this operation can be
-<span class="lineNum">    1155 </span>                :        *  done in constant time.
-<span class="lineNum">    1156 </span>                :        */
-<span class="lineNum">    1157 </span>                : #ifndef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">    1158 </span>                :       void
-<span class="lineNum">    1159 </span><span class="lineCov">          12012 :       push_back(const value_type&amp; __x)</span>
-<span class="lineNum">    1160 </span>                :       {
-<span class="lineNum">    1161 </span><span class="lineCov">          12012 :         if (this-&gt;_M_impl._M_finish._M_cur</span>
-<span class="lineNum">    1162 </span>                :             != this-&gt;_M_impl._M_finish._M_last - 1)
-<span class="lineNum">    1163 </span>                :           {
-<span class="lineNum">    1164 </span><span class="lineCov">          11999 :             this-&gt;_M_impl.construct(this-&gt;_M_impl._M_finish._M_cur, __x);</span>
-<span class="lineNum">    1165 </span><span class="lineCov">          11999 :             ++this-&gt;_M_impl._M_finish._M_cur;</span>
-<span class="lineNum">    1166 </span>                :           }
-<span class="lineNum">    1167 </span>                :         else
-<span class="lineNum">    1168 </span><span class="lineCov">             13 :           _M_push_back_aux(__x);</span>
-<span class="lineNum">    1169 </span><span class="lineCov">          12012 :       }</span>
-<span class="lineNum">    1170 </span>                : #else
-<span class="lineNum">    1171 </span>                :       template&lt;typename... _Args&gt;
-<span class="lineNum">    1172 </span>                :         void
-<span class="lineNum">    1173 </span>                :         push_back(_Args&amp;&amp;... __args)
-<span class="lineNum">    1174 </span>                :         {
-<span class="lineNum">    1175 </span>                :           if (this-&gt;_M_impl._M_finish._M_cur
-<span class="lineNum">    1176 </span>                :               != this-&gt;_M_impl._M_finish._M_last - 1)
-<span class="lineNum">    1177 </span>                :             {
-<span class="lineNum">    1178 </span>                :               this-&gt;_M_impl.construct(this-&gt;_M_impl._M_finish._M_cur,
-<span class="lineNum">    1179 </span>                :                                       std::forward&lt;_Args&gt;(__args)...);
-<span class="lineNum">    1180 </span>                :               ++this-&gt;_M_impl._M_finish._M_cur;
-<span class="lineNum">    1181 </span>                :             }
-<span class="lineNum">    1182 </span>                :           else
-<span class="lineNum">    1183 </span>                :             _M_push_back_aux(std::forward&lt;_Args&gt;(__args)...);
-<span class="lineNum">    1184 </span>                :         }
-<span class="lineNum">    1185 </span>                : #endif
-<span class="lineNum">    1186 </span>                : 
-<span class="lineNum">    1187 </span>                :       /**
-<span class="lineNum">    1188 </span>                :        *  @brief  Removes first element.
-<span class="lineNum">    1189 </span>                :        *
-<span class="lineNum">    1190 </span>                :        *  This is a typical stack operation.  It shrinks the %deque by one.
-<span class="lineNum">    1191 </span>                :        *
-<span class="lineNum">    1192 </span>                :        *  Note that no data is returned, and if the first element's data is
-<span class="lineNum">    1193 </span>                :        *  needed, it should be retrieved before pop_front() is called.
-<span class="lineNum">    1194 </span>                :        */
-<span class="lineNum">    1195 </span>                :       void
-<span class="lineNum">    1196 </span>                :       pop_front()
-<span class="lineNum">    1197 </span>                :       {
-<span class="lineNum">    1198 </span>                :         if (this-&gt;_M_impl._M_start._M_cur
-<span class="lineNum">    1199 </span>                :             != this-&gt;_M_impl._M_start._M_last - 1)
-<span class="lineNum">    1200 </span>                :           {
-<span class="lineNum">    1201 </span>                :             this-&gt;_M_impl.destroy(this-&gt;_M_impl._M_start._M_cur);
-<span class="lineNum">    1202 </span>                :             ++this-&gt;_M_impl._M_start._M_cur;
-<span class="lineNum">    1203 </span>                :           }
-<span class="lineNum">    1204 </span>                :         else
-<span class="lineNum">    1205 </span>                :           _M_pop_front_aux();
-<span class="lineNum">    1206 </span>                :       }
-<span class="lineNum">    1207 </span>                : 
-<span class="lineNum">    1208 </span>                :       /**
-<span class="lineNum">    1209 </span>                :        *  @brief  Removes last element.
-<span class="lineNum">    1210 </span>                :        *
-<span class="lineNum">    1211 </span>                :        *  This is a typical stack operation.  It shrinks the %deque by one.
-<span class="lineNum">    1212 </span>                :        *
-<span class="lineNum">    1213 </span>                :        *  Note that no data is returned, and if the last element's data is
-<span class="lineNum">    1214 </span>                :        *  needed, it should be retrieved before pop_back() is called.
-<span class="lineNum">    1215 </span>                :        */
-<span class="lineNum">    1216 </span>                :       void
-<span class="lineNum">    1217 </span><span class="lineCov">             24 :       pop_back()</span>
-<span class="lineNum">    1218 </span>                :       {
-<span class="lineNum">    1219 </span><span class="lineCov">             24 :         if (this-&gt;_M_impl._M_finish._M_cur</span>
-<span class="lineNum">    1220 </span>                :             != this-&gt;_M_impl._M_finish._M_first)
-<span class="lineNum">    1221 </span>                :           {
-<span class="lineNum">    1222 </span><span class="lineCov">             24 :             --this-&gt;_M_impl._M_finish._M_cur;</span>
-<span class="lineNum">    1223 </span><span class="lineCov">             24 :             this-&gt;_M_impl.destroy(this-&gt;_M_impl._M_finish._M_cur);</span>
-<span class="lineNum">    1224 </span>                :           }
-<span class="lineNum">    1225 </span>                :         else
-<span class="lineNum">    1226 </span><span class="lineNoCov">              0 :           _M_pop_back_aux();</span>
-<span class="lineNum">    1227 </span><span class="lineCov">             24 :       }</span>
-<span class="lineNum">    1228 </span>                : 
-<span class="lineNum">    1229 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">    1230 </span>                :       /**
-<span class="lineNum">    1231 </span>                :        *  @brief  Inserts an object in %deque before specified iterator.
-<span class="lineNum">    1232 </span>                :        *  @param  position  An iterator into the %deque.
-<span class="lineNum">    1233 </span>                :        *  @param  args  Arguments.
-<span class="lineNum">    1234 </span>                :        *  @return  An iterator that points to the inserted data.
-<span class="lineNum">    1235 </span>                :        *
-<span class="lineNum">    1236 </span>                :        *  This function will insert an object of type T constructed
-<span class="lineNum">    1237 </span>                :        *  with T(std::forward&lt;Args&gt;(args)...) before the specified location.
-<span class="lineNum">    1238 </span>                :        */
-<span class="lineNum">    1239 </span>                :       template&lt;typename... _Args&gt;
-<span class="lineNum">    1240 </span>                :         iterator
-<span class="lineNum">    1241 </span>                :         emplace(iterator __position, _Args&amp;&amp;... __args);
-<span class="lineNum">    1242 </span>                : #endif
-<span class="lineNum">    1243 </span>                : 
-<span class="lineNum">    1244 </span>                :       /**
-<span class="lineNum">    1245 </span>                :        *  @brief  Inserts given value into %deque before specified iterator.
-<span class="lineNum">    1246 </span>                :        *  @param  position  An iterator into the %deque.
-<span class="lineNum">    1247 </span>                :        *  @param  x  Data to be inserted.
-<span class="lineNum">    1248 </span>                :        *  @return  An iterator that points to the inserted data.
-<span class="lineNum">    1249 </span>                :        *
-<span class="lineNum">    1250 </span>                :        *  This function will insert a copy of the given value before the
-<span class="lineNum">    1251 </span>                :        *  specified location.
-<span class="lineNum">    1252 </span>                :        */
-<span class="lineNum">    1253 </span>                :       iterator
-<span class="lineNum">    1254 </span>                :       insert(iterator __position, const value_type&amp; __x);
-<span class="lineNum">    1255 </span>                : 
-<span class="lineNum">    1256 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">    1257 </span>                :       /**
-<span class="lineNum">    1258 </span>                :        *  @brief  Inserts given rvalue into %deque before specified iterator.
-<span class="lineNum">    1259 </span>                :        *  @param  position  An iterator into the %deque.
-<span class="lineNum">    1260 </span>                :        *  @param  x  Data to be inserted.
-<span class="lineNum">    1261 </span>                :        *  @return  An iterator that points to the inserted data.
-<span class="lineNum">    1262 </span>                :        *
-<span class="lineNum">    1263 </span>                :        *  This function will insert a copy of the given rvalue before the
-<span class="lineNum">    1264 </span>                :        *  specified location.
-<span class="lineNum">    1265 </span>                :        */
-<span class="lineNum">    1266 </span>                :       iterator
-<span class="lineNum">    1267 </span>                :       insert(iterator __position, value_type&amp;&amp; __x)
-<span class="lineNum">    1268 </span>                :       { return emplace(__position, std::move(__x)); }
-<span class="lineNum">    1269 </span>                : #endif
-<span class="lineNum">    1270 </span>                : 
-<span class="lineNum">    1271 </span>                :       /**
-<span class="lineNum">    1272 </span>                :        *  @brief  Inserts a number of copies of given data into the %deque.
-<span class="lineNum">    1273 </span>                :        *  @param  position  An iterator into the %deque.
-<span class="lineNum">    1274 </span>                :        *  @param  n  Number of elements to be inserted.
-<span class="lineNum">    1275 </span>                :        *  @param  x  Data to be inserted.
-<span class="lineNum">    1276 </span>                :        *
-<span class="lineNum">    1277 </span>                :        *  This function will insert a specified number of copies of the given
-<span class="lineNum">    1278 </span>                :        *  data before the location specified by @a position.
-<span class="lineNum">    1279 </span>                :        */
-<span class="lineNum">    1280 </span>                :       void
-<span class="lineNum">    1281 </span>                :       insert(iterator __position, size_type __n, const value_type&amp; __x)
-<span class="lineNum">    1282 </span>                :       { _M_fill_insert(__position, __n, __x); }
-<span class="lineNum">    1283 </span>                : 
-<span class="lineNum">    1284 </span>                :       /**
-<span class="lineNum">    1285 </span>                :        *  @brief  Inserts a range into the %deque.
-<span class="lineNum">    1286 </span>                :        *  @param  position  An iterator into the %deque.
-<span class="lineNum">    1287 </span>                :        *  @param  first  An input iterator.
-<span class="lineNum">    1288 </span>                :        *  @param  last   An input iterator.
-<span class="lineNum">    1289 </span>                :        *
-<span class="lineNum">    1290 </span>                :        *  This function will insert copies of the data in the range
-<span class="lineNum">    1291 </span>                :        *  [first,last) into the %deque before the location specified
-<span class="lineNum">    1292 </span>                :        *  by @a pos.  This is known as &quot;range insert.&quot;
-<span class="lineNum">    1293 </span>                :        */
-<span class="lineNum">    1294 </span>                :       template&lt;typename _InputIterator&gt;
-<span class="lineNum">    1295 </span>                :         void
-<span class="lineNum">    1296 </span>                :         insert(iterator __position, _InputIterator __first,
-<span class="lineNum">    1297 </span><span class="lineNoCov">              0 :                _InputIterator __last)</span>
-<span class="lineNum">    1298 </span>                :         {
-<span class="lineNum">    1299 </span>                :           // Check whether it's an integral type.  If so, it's not an iterator.
-<span class="lineNum">    1300 </span>                :           typedef typename std::__is_integer&lt;_InputIterator&gt;::__type _Integral;
-<span class="lineNum">    1301 </span><span class="lineNoCov">              0 :           _M_insert_dispatch(__position, __first, __last, _Integral());</span>
-<span class="lineNum">    1302 </span><span class="lineNoCov">              0 :         }</span>
-<span class="lineNum">    1303 </span>                : 
-<span class="lineNum">    1304 </span>                :       /**
-<span class="lineNum">    1305 </span>                :        *  @brief  Remove element at given position.
-<span class="lineNum">    1306 </span>                :        *  @param  position  Iterator pointing to element to be erased.
-<span class="lineNum">    1307 </span>                :        *  @return  An iterator pointing to the next element (or end()).
-<span class="lineNum">    1308 </span>                :        *
-<span class="lineNum">    1309 </span>                :        *  This function will erase the element at the given position and thus
-<span class="lineNum">    1310 </span>                :        *  shorten the %deque by one.
-<span class="lineNum">    1311 </span>                :        *
-<span class="lineNum">    1312 </span>                :        *  The user is cautioned that
-<span class="lineNum">    1313 </span>                :        *  this function only erases the element, and that if the element is
-<span class="lineNum">    1314 </span>                :        *  itself a pointer, the pointed-to memory is not touched in any way.
-<span class="lineNum">    1315 </span>                :        *  Managing the pointer is the user's responsibility.
-<span class="lineNum">    1316 </span>                :        */
-<span class="lineNum">    1317 </span>                :       iterator
-<span class="lineNum">    1318 </span>                :       erase(iterator __position);
-<span class="lineNum">    1319 </span>                : 
-<span class="lineNum">    1320 </span>                :       /**
-<span class="lineNum">    1321 </span>                :        *  @brief  Remove a range of elements.
-<span class="lineNum">    1322 </span>                :        *  @param  first  Iterator pointing to the first element to be erased.
-<span class="lineNum">    1323 </span>                :        *  @param  last  Iterator pointing to one past the last element to be
-<span class="lineNum">    1324 </span>                :        *                erased.
-<span class="lineNum">    1325 </span>                :        *  @return  An iterator pointing to the element pointed to by @a last
-<span class="lineNum">    1326 </span>                :        *           prior to erasing (or end()).
-<span class="lineNum">    1327 </span>                :        *
-<span class="lineNum">    1328 </span>                :        *  This function will erase the elements in the range [first,last) and
-<span class="lineNum">    1329 </span>                :        *  shorten the %deque accordingly.
-<span class="lineNum">    1330 </span>                :        *
-<span class="lineNum">    1331 </span>                :        *  The user is cautioned that
-<span class="lineNum">    1332 </span>                :        *  this function only erases the elements, and that if the elements
-<span class="lineNum">    1333 </span>                :        *  themselves are pointers, the pointed-to memory is not touched in any
-<span class="lineNum">    1334 </span>                :        *  way.  Managing the pointer is the user's responsibility.
-<span class="lineNum">    1335 </span>                :        */
-<span class="lineNum">    1336 </span>                :       iterator
-<span class="lineNum">    1337 </span>                :       erase(iterator __first, iterator __last);
-<span class="lineNum">    1338 </span>                : 
-<span class="lineNum">    1339 </span>                :       /**
-<span class="lineNum">    1340 </span>                :        *  @brief  Swaps data with another %deque.
-<span class="lineNum">    1341 </span>                :        *  @param  x  A %deque of the same element and allocator types.
-<span class="lineNum">    1342 </span>                :        *
-<span class="lineNum">    1343 </span>                :        *  This exchanges the elements between two deques in constant time.
-<span class="lineNum">    1344 </span>                :        *  (Four pointers, so it should be quite fast.)
-<span class="lineNum">    1345 </span>                :        *  Note that the global std::swap() function is specialized such that
-<span class="lineNum">    1346 </span>                :        *  std::swap(d1,d2) will feed to this function.
-<span class="lineNum">    1347 </span>                :        */
-<span class="lineNum">    1348 </span>                :       void
-<span class="lineNum">    1349 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">    1350 </span>                :       swap(deque&amp;&amp; __x)
-<span class="lineNum">    1351 </span>                : #else
-<span class="lineNum">    1352 </span>                :       swap(deque&amp; __x)
-<span class="lineNum">    1353 </span>                : #endif
-<span class="lineNum">    1354 </span>                :       {
-<span class="lineNum">    1355 </span>                :         std::swap(this-&gt;_M_impl._M_start, __x._M_impl._M_start);
-<span class="lineNum">    1356 </span>                :         std::swap(this-&gt;_M_impl._M_finish, __x._M_impl._M_finish);
-<span class="lineNum">    1357 </span>                :         std::swap(this-&gt;_M_impl._M_map, __x._M_impl._M_map);
-<span class="lineNum">    1358 </span>                :         std::swap(this-&gt;_M_impl._M_map_size, __x._M_impl._M_map_size);
-<span class="lineNum">    1359 </span>                : 
-<span class="lineNum">    1360 </span>                :         // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">    1361 </span>                :         // 431. Swapping containers with unequal allocators.
-<span class="lineNum">    1362 </span>                :         std::__alloc_swap&lt;_Tp_alloc_type&gt;::_S_do_it(_M_get_Tp_allocator(),
-<span class="lineNum">    1363 </span>                :                                                     __x._M_get_Tp_allocator());
-<span class="lineNum">    1364 </span>                :       }
-<span class="lineNum">    1365 </span>                : 
-<span class="lineNum">    1366 </span>                :       /**
-<span class="lineNum">    1367 </span>                :        *  Erases all the elements.  Note that this function only erases the
-<span class="lineNum">    1368 </span>                :        *  elements, and that if the elements themselves are pointers, the
-<span class="lineNum">    1369 </span>                :        *  pointed-to memory is not touched in any way.  Managing the pointer is
-<span class="lineNum">    1370 </span>                :        *  the user's responsibility.
-<span class="lineNum">    1371 </span>                :        */
-<span class="lineNum">    1372 </span>                :       void
-<span class="lineNum">    1373 </span><span class="lineCov">            922 :       clear()</span>
-<span class="lineNum">    1374 </span><span class="lineCov">            922 :       { _M_erase_at_end(begin()); }</span>
-<span class="lineNum">    1375 </span>                : 
-<span class="lineNum">    1376 </span>                :     protected:
-<span class="lineNum">    1377 </span>                :       // Internal constructor functions follow.
-<span class="lineNum">    1378 </span>                : 
-<span class="lineNum">    1379 </span>                :       // called by the range constructor to implement [23.1.1]/9
-<span class="lineNum">    1380 </span>                : 
-<span class="lineNum">    1381 </span>                :       // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">    1382 </span>                :       // 438. Ambiguity in the &quot;do the right thing&quot; clause
-<span class="lineNum">    1383 </span>                :       template&lt;typename _Integer&gt;
-<span class="lineNum">    1384 </span>                :         void
-<span class="lineNum">    1385 </span>                :         _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type)
-<span class="lineNum">    1386 </span>                :         {
-<span class="lineNum">    1387 </span>                :           _M_initialize_map(static_cast&lt;size_type&gt;(__n));
-<span class="lineNum">    1388 </span>                :           _M_fill_initialize(__x);
-<span class="lineNum">    1389 </span>                :         }
-<span class="lineNum">    1390 </span>                : 
-<span class="lineNum">    1391 </span>                :       // called by the range constructor to implement [23.1.1]/9
-<span class="lineNum">    1392 </span>                :       template&lt;typename _InputIterator&gt;
-<span class="lineNum">    1393 </span>                :         void
-<span class="lineNum">    1394 </span>                :         _M_initialize_dispatch(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">    1395 </span>                :                                __false_type)
-<span class="lineNum">    1396 </span>                :         {
-<span class="lineNum">    1397 </span>                :           typedef typename std::iterator_traits&lt;_InputIterator&gt;::
-<span class="lineNum">    1398 </span>                :             iterator_category _IterCategory;
-<span class="lineNum">    1399 </span>                :           _M_range_initialize(__first, __last, _IterCategory());
-<span class="lineNum">    1400 </span>                :         }
-<span class="lineNum">    1401 </span>                : 
-<span class="lineNum">    1402 </span>                :       // called by the second initialize_dispatch above
-<span class="lineNum">    1403 </span>                :       //@{
-<span class="lineNum">    1404 </span>                :       /**
-<span class="lineNum">    1405 </span>                :        *  @brief Fills the deque with whatever is in [first,last).
-<span class="lineNum">    1406 </span>                :        *  @param  first  An input iterator.
-<span class="lineNum">    1407 </span>                :        *  @param  last  An input iterator.
-<span class="lineNum">    1408 </span>                :        *  @return   Nothing.
-<span class="lineNum">    1409 </span>                :        *
-<span class="lineNum">    1410 </span>                :        *  If the iterators are actually forward iterators (or better), then the
-<span class="lineNum">    1411 </span>                :        *  memory layout can be done all at once.  Else we move forward using
-<span class="lineNum">    1412 </span>                :        *  push_back on each value from the iterator.
-<span class="lineNum">    1413 </span>                :        */
-<span class="lineNum">    1414 </span>                :       template&lt;typename _InputIterator&gt;
-<span class="lineNum">    1415 </span>                :         void
-<span class="lineNum">    1416 </span>                :         _M_range_initialize(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">    1417 </span>                :                             std::input_iterator_tag);
-<span class="lineNum">    1418 </span>                : 
-<span class="lineNum">    1419 </span>                :       // called by the second initialize_dispatch above
-<span class="lineNum">    1420 </span>                :       template&lt;typename _ForwardIterator&gt;
-<span class="lineNum">    1421 </span>                :         void
-<span class="lineNum">    1422 </span>                :         _M_range_initialize(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">    1423 </span>                :                             std::forward_iterator_tag);
-<span class="lineNum">    1424 </span>                :       //@}
-<span class="lineNum">    1425 </span>                : 
-<span class="lineNum">    1426 </span>                :       /**
-<span class="lineNum">    1427 </span>                :        *  @brief Fills the %deque with copies of value.
-<span class="lineNum">    1428 </span>                :        *  @param  value  Initial value.
-<span class="lineNum">    1429 </span>                :        *  @return   Nothing.
-<span class="lineNum">    1430 </span>                :        *  @pre _M_start and _M_finish have already been initialized,
-<span class="lineNum">    1431 </span>                :        *  but none of the %deque's elements have yet been constructed.
-<span class="lineNum">    1432 </span>                :        *
-<span class="lineNum">    1433 </span>                :        *  This function is called only when the user provides an explicit size
-<span class="lineNum">    1434 </span>                :        *  (with or without an explicit exemplar value).
-<span class="lineNum">    1435 </span>                :        */
-<span class="lineNum">    1436 </span>                :       void
-<span class="lineNum">    1437 </span>                :       _M_fill_initialize(const value_type&amp; __value);
-<span class="lineNum">    1438 </span>                : 
-<span class="lineNum">    1439 </span>                :       // Internal assign functions follow.  The *_aux functions do the actual
-<span class="lineNum">    1440 </span>                :       // assignment work for the range versions.
-<span class="lineNum">    1441 </span>                : 
-<span class="lineNum">    1442 </span>                :       // called by the range assign to implement [23.1.1]/9
-<span class="lineNum">    1443 </span>                : 
-<span class="lineNum">    1444 </span>                :       // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">    1445 </span>                :       // 438. Ambiguity in the &quot;do the right thing&quot; clause
-<span class="lineNum">    1446 </span>                :       template&lt;typename _Integer&gt;
-<span class="lineNum">    1447 </span>                :         void
-<span class="lineNum">    1448 </span>                :         _M_assign_dispatch(_Integer __n, _Integer __val, __true_type)
-<span class="lineNum">    1449 </span>                :         { _M_fill_assign(__n, __val); }
-<span class="lineNum">    1450 </span>                : 
-<span class="lineNum">    1451 </span>                :       // called by the range assign to implement [23.1.1]/9
-<span class="lineNum">    1452 </span>                :       template&lt;typename _InputIterator&gt;
-<span class="lineNum">    1453 </span>                :         void
-<span class="lineNum">    1454 </span>                :         _M_assign_dispatch(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">    1455 </span>                :                            __false_type)
-<span class="lineNum">    1456 </span>                :         {
-<span class="lineNum">    1457 </span>                :           typedef typename std::iterator_traits&lt;_InputIterator&gt;::
-<span class="lineNum">    1458 </span>                :             iterator_category _IterCategory;
-<span class="lineNum">    1459 </span>                :           _M_assign_aux(__first, __last, _IterCategory());
-<span class="lineNum">    1460 </span>                :         }
-<span class="lineNum">    1461 </span>                : 
-<span class="lineNum">    1462 </span>                :       // called by the second assign_dispatch above
-<span class="lineNum">    1463 </span>                :       template&lt;typename _InputIterator&gt;
-<span class="lineNum">    1464 </span>                :         void
-<span class="lineNum">    1465 </span>                :         _M_assign_aux(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">    1466 </span>                :                       std::input_iterator_tag);
-<span class="lineNum">    1467 </span>                : 
-<span class="lineNum">    1468 </span>                :       // called by the second assign_dispatch above
-<span class="lineNum">    1469 </span>                :       template&lt;typename _ForwardIterator&gt;
-<span class="lineNum">    1470 </span>                :         void
-<span class="lineNum">    1471 </span>                :         _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">    1472 </span>                :                       std::forward_iterator_tag)
-<span class="lineNum">    1473 </span>                :         {
-<span class="lineNum">    1474 </span>                :           const size_type __len = std::distance(__first, __last);
-<span class="lineNum">    1475 </span>                :           if (__len &gt; size())
-<span class="lineNum">    1476 </span>                :             {
-<span class="lineNum">    1477 </span>                :               _ForwardIterator __mid = __first;
-<span class="lineNum">    1478 </span>                :               std::advance(__mid, size());
-<span class="lineNum">    1479 </span>                :               std::copy(__first, __mid, begin());
-<span class="lineNum">    1480 </span>                :               insert(end(), __mid, __last);
-<span class="lineNum">    1481 </span>                :             }
-<span class="lineNum">    1482 </span>                :           else
-<span class="lineNum">    1483 </span>                :             _M_erase_at_end(std::copy(__first, __last, begin()));
-<span class="lineNum">    1484 </span>                :         }
-<span class="lineNum">    1485 </span>                : 
-<span class="lineNum">    1486 </span>                :       // Called by assign(n,t), and the range assign when it turns out
-<span class="lineNum">    1487 </span>                :       // to be the same thing.
-<span class="lineNum">    1488 </span>                :       void
-<span class="lineNum">    1489 </span>                :       _M_fill_assign(size_type __n, const value_type&amp; __val)
-<span class="lineNum">    1490 </span>                :       {
-<span class="lineNum">    1491 </span>                :         if (__n &gt; size())
-<span class="lineNum">    1492 </span>                :           {
-<span class="lineNum">    1493 </span>                :             std::fill(begin(), end(), __val);
-<span class="lineNum">    1494 </span>                :             insert(end(), __n - size(), __val);
-<span class="lineNum">    1495 </span>                :           }
-<span class="lineNum">    1496 </span>                :         else
-<span class="lineNum">    1497 </span>                :           {
-<span class="lineNum">    1498 </span>                :             _M_erase_at_end(begin() + difference_type(__n));
-<span class="lineNum">    1499 </span>                :             std::fill(begin(), end(), __val);
-<span class="lineNum">    1500 </span>                :           }
-<span class="lineNum">    1501 </span>                :       }
-<span class="lineNum">    1502 </span>                : 
-<span class="lineNum">    1503 </span>                :       //@{
-<span class="lineNum">    1504 </span>                :       /// Helper functions for push_* and pop_*.
-<span class="lineNum">    1505 </span>                : #ifndef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">    1506 </span>                :       void _M_push_back_aux(const value_type&amp;);
-<span class="lineNum">    1507 </span>                : 
-<span class="lineNum">    1508 </span>                :       void _M_push_front_aux(const value_type&amp;);
-<span class="lineNum">    1509 </span>                : #else
-<span class="lineNum">    1510 </span>                :       template&lt;typename... _Args&gt;
-<span class="lineNum">    1511 </span>                :         void _M_push_back_aux(_Args&amp;&amp;... __args);
-<span class="lineNum">    1512 </span>                : 
-<span class="lineNum">    1513 </span>                :       template&lt;typename... _Args&gt;
-<span class="lineNum">    1514 </span>                :         void _M_push_front_aux(_Args&amp;&amp;... __args);
-<span class="lineNum">    1515 </span>                : #endif
-<span class="lineNum">    1516 </span>                : 
-<span class="lineNum">    1517 </span>                :       void _M_pop_back_aux();
-<span class="lineNum">    1518 </span>                : 
-<span class="lineNum">    1519 </span>                :       void _M_pop_front_aux();
-<span class="lineNum">    1520 </span>                :       //@}
-<span class="lineNum">    1521 </span>                : 
-<span class="lineNum">    1522 </span>                :       // Internal insert functions follow.  The *_aux functions do the actual
-<span class="lineNum">    1523 </span>                :       // insertion work when all shortcuts fail.
-<span class="lineNum">    1524 </span>                : 
-<span class="lineNum">    1525 </span>                :       // called by the range insert to implement [23.1.1]/9
-<span class="lineNum">    1526 </span>                : 
-<span class="lineNum">    1527 </span>                :       // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">    1528 </span>                :       // 438. Ambiguity in the &quot;do the right thing&quot; clause
-<span class="lineNum">    1529 </span>                :       template&lt;typename _Integer&gt;
-<span class="lineNum">    1530 </span>                :         void
-<span class="lineNum">    1531 </span>                :         _M_insert_dispatch(iterator __pos,
-<span class="lineNum">    1532 </span>                :                            _Integer __n, _Integer __x, __true_type)
-<span class="lineNum">    1533 </span>                :         { _M_fill_insert(__pos, __n, __x); }
-<span class="lineNum">    1534 </span>                : 
-<span class="lineNum">    1535 </span>                :       // called by the range insert to implement [23.1.1]/9
-<span class="lineNum">    1536 </span>                :       template&lt;typename _InputIterator&gt;
-<span class="lineNum">    1537 </span>                :         void
-<span class="lineNum">    1538 </span>                :         _M_insert_dispatch(iterator __pos,
-<span class="lineNum">    1539 </span>                :                            _InputIterator __first, _InputIterator __last,
-<span class="lineNum">    1540 </span><span class="lineNoCov">              0 :                            __false_type)</span>
-<span class="lineNum">    1541 </span>                :         {
-<span class="lineNum">    1542 </span>                :           typedef typename std::iterator_traits&lt;_InputIterator&gt;::
-<span class="lineNum">    1543 </span>                :             iterator_category _IterCategory;
-<span class="lineNum">    1544 </span><span class="lineNoCov">              0 :           _M_range_insert_aux(__pos, __first, __last, _IterCategory());</span>
-<span class="lineNum">    1545 </span><span class="lineNoCov">              0 :         }</span>
-<span class="lineNum">    1546 </span>                : 
-<span class="lineNum">    1547 </span>                :       // called by the second insert_dispatch above
-<span class="lineNum">    1548 </span>                :       template&lt;typename _InputIterator&gt;
-<span class="lineNum">    1549 </span>                :         void
-<span class="lineNum">    1550 </span>                :         _M_range_insert_aux(iterator __pos, _InputIterator __first,
-<span class="lineNum">    1551 </span>                :                             _InputIterator __last, std::input_iterator_tag);
-<span class="lineNum">    1552 </span>                : 
-<span class="lineNum">    1553 </span>                :       // called by the second insert_dispatch above
-<span class="lineNum">    1554 </span>                :       template&lt;typename _ForwardIterator&gt;
-<span class="lineNum">    1555 </span>                :         void
-<span class="lineNum">    1556 </span>                :         _M_range_insert_aux(iterator __pos, _ForwardIterator __first,
-<span class="lineNum">    1557 </span>                :                             _ForwardIterator __last, std::forward_iterator_tag);
-<span class="lineNum">    1558 </span>                : 
-<span class="lineNum">    1559 </span>                :       // Called by insert(p,n,x), and the range insert when it turns out to be
-<span class="lineNum">    1560 </span>                :       // the same thing.  Can use fill functions in optimal situations,
-<span class="lineNum">    1561 </span>                :       // otherwise passes off to insert_aux(p,n,x).
-<span class="lineNum">    1562 </span>                :       void
-<span class="lineNum">    1563 </span>                :       _M_fill_insert(iterator __pos, size_type __n, const value_type&amp; __x);
-<span class="lineNum">    1564 </span>                : 
-<span class="lineNum">    1565 </span>                :       // called by insert(p,x)
-<span class="lineNum">    1566 </span>                : #ifndef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">    1567 </span>                :       iterator
-<span class="lineNum">    1568 </span>                :       _M_insert_aux(iterator __pos, const value_type&amp; __x);
-<span class="lineNum">    1569 </span>                : #else
-<span class="lineNum">    1570 </span>                :       template&lt;typename... _Args&gt;
-<span class="lineNum">    1571 </span>                :         iterator
-<span class="lineNum">    1572 </span>                :         _M_insert_aux(iterator __pos, _Args&amp;&amp;... __args);
-<span class="lineNum">    1573 </span>                : #endif
-<span class="lineNum">    1574 </span>                : 
-<span class="lineNum">    1575 </span>                :       // called by insert(p,n,x) via fill_insert
-<span class="lineNum">    1576 </span>                :       void
-<span class="lineNum">    1577 </span>                :       _M_insert_aux(iterator __pos, size_type __n, const value_type&amp; __x);
-<span class="lineNum">    1578 </span>                : 
-<span class="lineNum">    1579 </span>                :       // called by range_insert_aux for forward iterators
-<span class="lineNum">    1580 </span>                :       template&lt;typename _ForwardIterator&gt;
-<span class="lineNum">    1581 </span>                :         void
-<span class="lineNum">    1582 </span>                :         _M_insert_aux(iterator __pos,
-<span class="lineNum">    1583 </span>                :                       _ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">    1584 </span>                :                       size_type __n);
-<span class="lineNum">    1585 </span>                : 
-<span class="lineNum">    1586 </span>                : 
-<span class="lineNum">    1587 </span>                :       // Internal erase functions follow.
-<span class="lineNum">    1588 </span>                : 
-<span class="lineNum">    1589 </span>                :       void
-<span class="lineNum">    1590 </span>                :       _M_destroy_data_aux(iterator __first, iterator __last);
-<span class="lineNum">    1591 </span>                : 
-<span class="lineNum">    1592 </span>                :       // Called by ~deque().
-<span class="lineNum">    1593 </span>                :       // NB: Doesn't deallocate the nodes.
-<span class="lineNum">    1594 </span>                :       template&lt;typename _Alloc1&gt;
-<span class="lineNum">    1595 </span>                :         void
-<span class="lineNum">    1596 </span>                :         _M_destroy_data(iterator __first, iterator __last, const _Alloc1&amp;)
-<span class="lineNum">    1597 </span>                :         { _M_destroy_data_aux(__first, __last); }
-<span class="lineNum">    1598 </span>                : 
-<span class="lineNum">    1599 </span>                :       void
-<span class="lineNum">    1600 </span>                :       _M_destroy_data(iterator __first, iterator __last,
-<span class="lineNum">    1601 </span><span class="lineCov">           1046 :                       const std::allocator&lt;_Tp&gt;&amp;)</span>
-<span class="lineNum">    1602 </span>                :       {
-<span class="lineNum">    1603 </span>                :         if (!__has_trivial_destructor(value_type))
-<span class="lineNum">    1604 </span><span class="lineCov">             26 :           _M_destroy_data_aux(__first, __last);</span>
-<span class="lineNum">    1605 </span><span class="lineCov">           1046 :       }</span>
-<span class="lineNum">    1606 </span>                : 
-<span class="lineNum">    1607 </span>                :       // Called by erase(q1, q2).
-<span class="lineNum">    1608 </span>                :       void
-<span class="lineNum">    1609 </span><span class="lineCov">             90 :       _M_erase_at_begin(iterator __pos)</span>
-<span class="lineNum">    1610 </span>                :       {
-<span class="lineNum">    1611 </span><span class="lineCov">             90 :         _M_destroy_data(begin(), __pos, _M_get_Tp_allocator());</span>
-<span class="lineNum">    1612 </span><span class="lineCov">             90 :         _M_destroy_nodes(this-&gt;_M_impl._M_start._M_node, __pos._M_node);</span>
-<span class="lineNum">    1613 </span><span class="lineCov">             90 :         this-&gt;_M_impl._M_start = __pos;</span>
-<span class="lineNum">    1614 </span><span class="lineCov">             90 :       }</span>
-<span class="lineNum">    1615 </span>                : 
-<span class="lineNum">    1616 </span>                :       // Called by erase(q1, q2), resize(), clear(), _M_assign_aux,
-<span class="lineNum">    1617 </span>                :       // _M_fill_assign, operator=.
-<span class="lineNum">    1618 </span>                :       void
-<span class="lineNum">    1619 </span><span class="lineCov">            926 :       _M_erase_at_end(iterator __pos)</span>
-<span class="lineNum">    1620 </span>                :       {
-<span class="lineNum">    1621 </span><span class="lineCov">            926 :         _M_destroy_data(__pos, end(), _M_get_Tp_allocator());</span>
-<span class="lineNum">    1622 </span><span class="lineCov">            926 :         _M_destroy_nodes(__pos._M_node + 1,</span>
-<span class="lineNum">    1623 </span>                :                          this-&gt;_M_impl._M_finish._M_node + 1);
-<span class="lineNum">    1624 </span><span class="lineCov">            926 :         this-&gt;_M_impl._M_finish = __pos;</span>
-<span class="lineNum">    1625 </span><span class="lineCov">            926 :       }</span>
-<span class="lineNum">    1626 </span>                : 
-<span class="lineNum">    1627 </span>                :       //@{
-<span class="lineNum">    1628 </span>                :       /// Memory-handling helpers for the previous internal insert functions.
-<span class="lineNum">    1629 </span>                :       iterator
-<span class="lineNum">    1630 </span><span class="lineNoCov">              0 :       _M_reserve_elements_at_front(size_type __n)</span>
-<span class="lineNum">    1631 </span>                :       {
-<span class="lineNum">    1632 </span>                :         const size_type __vacancies = this-&gt;_M_impl._M_start._M_cur
-<span class="lineNum">    1633 </span><span class="lineNoCov">              0 :                                       - this-&gt;_M_impl._M_start._M_first;</span>
-<span class="lineNum">    1634 </span><span class="lineNoCov">              0 :         if (__n &gt; __vacancies)</span>
-<span class="lineNum">    1635 </span><span class="lineNoCov">              0 :           _M_new_elements_at_front(__n - __vacancies);</span>
-<span class="lineNum">    1636 </span><span class="lineNoCov">              0 :         return this-&gt;_M_impl._M_start - difference_type(__n);</span>
-<span class="lineNum">    1637 </span>                :       }
-<span class="lineNum">    1638 </span>                : 
-<span class="lineNum">    1639 </span>                :       iterator
-<span class="lineNum">    1640 </span><span class="lineNoCov">              0 :       _M_reserve_elements_at_back(size_type __n)</span>
-<span class="lineNum">    1641 </span>                :       {
-<span class="lineNum">    1642 </span>                :         const size_type __vacancies = (this-&gt;_M_impl._M_finish._M_last
-<span class="lineNum">    1643 </span><span class="lineNoCov">              0 :                                        - this-&gt;_M_impl._M_finish._M_cur) - 1;</span>
-<span class="lineNum">    1644 </span><span class="lineNoCov">              0 :         if (__n &gt; __vacancies)</span>
-<span class="lineNum">    1645 </span><span class="lineNoCov">              0 :           _M_new_elements_at_back(__n - __vacancies);</span>
-<span class="lineNum">    1646 </span><span class="lineNoCov">              0 :         return this-&gt;_M_impl._M_finish + difference_type(__n);</span>
-<span class="lineNum">    1647 </span>                :       }
-<span class="lineNum">    1648 </span>                : 
-<span class="lineNum">    1649 </span>                :       void
-<span class="lineNum">    1650 </span>                :       _M_new_elements_at_front(size_type __new_elements);
-<span class="lineNum">    1651 </span>                : 
-<span class="lineNum">    1652 </span>                :       void
-<span class="lineNum">    1653 </span>                :       _M_new_elements_at_back(size_type __new_elements);
-<span class="lineNum">    1654 </span>                :       //@}
-<span class="lineNum">    1655 </span>                : 
-<span class="lineNum">    1656 </span>                : 
-<span class="lineNum">    1657 </span>                :       //@{
-<span class="lineNum">    1658 </span>                :       /**
-<span class="lineNum">    1659 </span>                :        *  @brief Memory-handling helpers for the major %map.
-<span class="lineNum">    1660 </span>                :        *
-<span class="lineNum">    1661 </span>                :        *  Makes sure the _M_map has space for new nodes.  Does not
-<span class="lineNum">    1662 </span>                :        *  actually add the nodes.  Can invalidate _M_map pointers.
-<span class="lineNum">    1663 </span>                :        *  (And consequently, %deque iterators.)
-<span class="lineNum">    1664 </span>                :        */
-<span class="lineNum">    1665 </span>                :       void
-<span class="lineNum">    1666 </span><span class="lineCov">             13 :       _M_reserve_map_at_back(size_type __nodes_to_add = 1)</span>
-<span class="lineNum">    1667 </span>                :       {
-<span class="lineNum">    1668 </span><span class="lineCov">             13 :         if (__nodes_to_add + 1 &gt; this-&gt;_M_impl._M_map_size</span>
-<span class="lineNum">    1669 </span>                :             - (this-&gt;_M_impl._M_finish._M_node - this-&gt;_M_impl._M_map))
-<span class="lineNum">    1670 </span><span class="lineNoCov">              0 :           _M_reallocate_map(__nodes_to_add, false);</span>
-<span class="lineNum">    1671 </span><span class="lineCov">             13 :       }</span>
-<span class="lineNum">    1672 </span>                : 
-<span class="lineNum">    1673 </span>                :       void
-<span class="lineNum">    1674 </span><span class="lineNoCov">              0 :       _M_reserve_map_at_front(size_type __nodes_to_add = 1)</span>
-<span class="lineNum">    1675 </span>                :       {
-<span class="lineNum">    1676 </span><span class="lineNoCov">              0 :         if (__nodes_to_add &gt; size_type(this-&gt;_M_impl._M_start._M_node</span>
-<span class="lineNum">    1677 </span>                :                                        - this-&gt;_M_impl._M_map))
-<span class="lineNum">    1678 </span><span class="lineNoCov">              0 :           _M_reallocate_map(__nodes_to_add, true);</span>
-<span class="lineNum">    1679 </span><span class="lineNoCov">              0 :       }</span>
-<span class="lineNum">    1680 </span>                : 
-<span class="lineNum">    1681 </span>                :       void
-<span class="lineNum">    1682 </span>                :       _M_reallocate_map(size_type __nodes_to_add, bool __add_at_front);
-<span class="lineNum">    1683 </span>                :       //@}
-<span class="lineNum">    1684 </span>                :     };
-<span class="lineNum">    1685 </span>                : 
-<span class="lineNum">    1686 </span>                : 
-<span class="lineNum">    1687 </span>                :   /**
-<span class="lineNum">    1688 </span>                :    *  @brief  Deque equality comparison.
-<span class="lineNum">    1689 </span>                :    *  @param  x  A %deque.
-<span class="lineNum">    1690 </span>                :    *  @param  y  A %deque of the same type as @a x.
-<span class="lineNum">    1691 </span>                :    *  @return  True iff the size and elements of the deques are equal.
-<span class="lineNum">    1692 </span>                :    *
-<span class="lineNum">    1693 </span>                :    *  This is an equivalence relation.  It is linear in the size of the
-<span class="lineNum">    1694 </span>                :    *  deques.  Deques are considered equivalent if their sizes are equal,
-<span class="lineNum">    1695 </span>                :    *  and if corresponding elements compare equal.
-<span class="lineNum">    1696 </span>                :   */
-<span class="lineNum">    1697 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">    1698 </span>                :     inline bool
-<span class="lineNum">    1699 </span>                :     operator==(const deque&lt;_Tp, _Alloc&gt;&amp; __x,
-<span class="lineNum">    1700 </span>                :                          const deque&lt;_Tp, _Alloc&gt;&amp; __y)
-<span class="lineNum">    1701 </span>                :     { return __x.size() == __y.size()
-<span class="lineNum">    1702 </span>                :              &amp;&amp; std::equal(__x.begin(), __x.end(), __y.begin()); }
-<span class="lineNum">    1703 </span>                : 
-<span class="lineNum">    1704 </span>                :   /**
-<span class="lineNum">    1705 </span>                :    *  @brief  Deque ordering relation.
-<span class="lineNum">    1706 </span>                :    *  @param  x  A %deque.
-<span class="lineNum">    1707 </span>                :    *  @param  y  A %deque of the same type as @a x.
-<span class="lineNum">    1708 </span>                :    *  @return  True iff @a x is lexicographically less than @a y.
-<span class="lineNum">    1709 </span>                :    *
-<span class="lineNum">    1710 </span>                :    *  This is a total ordering relation.  It is linear in the size of the
-<span class="lineNum">    1711 </span>                :    *  deques.  The elements must be comparable with @c &lt;.
-<span class="lineNum">    1712 </span>                :    *
-<span class="lineNum">    1713 </span>                :    *  See std::lexicographical_compare() for how the determination is made.
-<span class="lineNum">    1714 </span>                :   */
-<span class="lineNum">    1715 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">    1716 </span>                :     inline bool
-<span class="lineNum">    1717 </span>                :     operator&lt;(const deque&lt;_Tp, _Alloc&gt;&amp; __x,
-<span class="lineNum">    1718 </span>                :               const deque&lt;_Tp, _Alloc&gt;&amp; __y)
-<span class="lineNum">    1719 </span>                :     { return std::lexicographical_compare(__x.begin(), __x.end(),
-<span class="lineNum">    1720 </span>                :                                           __y.begin(), __y.end()); }
-<span class="lineNum">    1721 </span>                : 
-<span class="lineNum">    1722 </span>                :   /// Based on operator==
-<span class="lineNum">    1723 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">    1724 </span>                :     inline bool
-<span class="lineNum">    1725 </span>                :     operator!=(const deque&lt;_Tp, _Alloc&gt;&amp; __x,
-<span class="lineNum">    1726 </span>                :                const deque&lt;_Tp, _Alloc&gt;&amp; __y)
-<span class="lineNum">    1727 </span>                :     { return !(__x == __y); }
-<span class="lineNum">    1728 </span>                : 
-<span class="lineNum">    1729 </span>                :   /// Based on operator&lt;
-<span class="lineNum">    1730 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">    1731 </span>                :     inline bool
-<span class="lineNum">    1732 </span>                :     operator&gt;(const deque&lt;_Tp, _Alloc&gt;&amp; __x,
-<span class="lineNum">    1733 </span>                :               const deque&lt;_Tp, _Alloc&gt;&amp; __y)
-<span class="lineNum">    1734 </span>                :     { return __y &lt; __x; }
-<span class="lineNum">    1735 </span>                : 
-<span class="lineNum">    1736 </span>                :   /// Based on operator&lt;
-<span class="lineNum">    1737 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">    1738 </span>                :     inline bool
-<span class="lineNum">    1739 </span>                :     operator&lt;=(const deque&lt;_Tp, _Alloc&gt;&amp; __x,
-<span class="lineNum">    1740 </span>                :                const deque&lt;_Tp, _Alloc&gt;&amp; __y)
-<span class="lineNum">    1741 </span>                :     { return !(__y &lt; __x); }
-<span class="lineNum">    1742 </span>                : 
-<span class="lineNum">    1743 </span>                :   /// Based on operator&lt;
-<span class="lineNum">    1744 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">    1745 </span>                :     inline bool
-<span class="lineNum">    1746 </span>                :     operator&gt;=(const deque&lt;_Tp, _Alloc&gt;&amp; __x,
-<span class="lineNum">    1747 </span>                :                const deque&lt;_Tp, _Alloc&gt;&amp; __y)
-<span class="lineNum">    1748 </span>                :     { return !(__x &lt; __y); }
-<span class="lineNum">    1749 </span>                : 
-<span class="lineNum">    1750 </span>                :   /// See std::deque::swap().
-<span class="lineNum">    1751 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">    1752 </span>                :     inline void
-<span class="lineNum">    1753 </span>                :     swap(deque&lt;_Tp,_Alloc&gt;&amp; __x, deque&lt;_Tp,_Alloc&gt;&amp; __y)
-<span class="lineNum">    1754 </span>                :     { __x.swap(__y); }
-<span class="lineNum">    1755 </span>                : 
-<span class="lineNum">    1756 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">    1757 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">    1758 </span>                :     inline void
-<span class="lineNum">    1759 </span>                :     swap(deque&lt;_Tp,_Alloc&gt;&amp;&amp; __x, deque&lt;_Tp,_Alloc&gt;&amp; __y)
-<span class="lineNum">    1760 </span>                :     { __x.swap(__y); }
-<span class="lineNum">    1761 </span>                : 
-<span class="lineNum">    1762 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">    1763 </span>                :     inline void
-<span class="lineNum">    1764 </span>                :     swap(deque&lt;_Tp,_Alloc&gt;&amp; __x, deque&lt;_Tp,_Alloc&gt;&amp;&amp; __y)
-<span class="lineNum">    1765 </span>                :     { __x.swap(__y); }
-<span class="lineNum">    1766 </span>                : #endif
-<span class="lineNum">    1767 </span>                : 
-<span class="lineNum">    1768 </span>                : _GLIBCXX_END_NESTED_NAMESPACE
-<span class="lineNum">    1769 </span>                : 
-<span class="lineNum">    1770 </span>                : #endif /* _STL_DEQUE_H */
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/bits/stl_function.h.gcov.html b/rep/usr/include/c++/4.3/bits/stl_function.h.gcov.html
deleted file mode 100644
index 7615b65..0000000
--- a/rep/usr/include/c++/4.3/bits/stl_function.h.gcov.html
+++ /dev/null
@@ -1,774 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_function.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_function.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">17</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">17</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // Functor implementations -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007
-<span class="lineNum">       4 </span>                : // Free Software Foundation, Inc.
-<span class="lineNum">       5 </span>                : //
-<span class="lineNum">       6 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       7 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       8 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">       9 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      10 </span>                : // any later version.
-<span class="lineNum">      11 </span>                : 
-<span class="lineNum">      12 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      13 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      14 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      15 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      16 </span>                : 
-<span class="lineNum">      17 </span>                : // You should have received a copy of the GNU General Public License along
-<span class="lineNum">      18 </span>                : // with this library; see the file COPYING.  If not, write to the Free
-<span class="lineNum">      19 </span>                : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-<span class="lineNum">      20 </span>                : // USA.
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      23 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      24 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      25 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      26 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      27 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      28 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      29 </span>                : // the GNU General Public License.
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : /*
-<span class="lineNum">      32 </span>                :  *
-<span class="lineNum">      33 </span>                :  * Copyright (c) 1994
-<span class="lineNum">      34 </span>                :  * Hewlett-Packard Company
-<span class="lineNum">      35 </span>                :  *
-<span class="lineNum">      36 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      37 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      38 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      39 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      40 </span>                :  * in supporting documentation.  Hewlett-Packard Company makes no
-<span class="lineNum">      41 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      42 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      43 </span>                :  *
-<span class="lineNum">      44 </span>                :  *
-<span class="lineNum">      45 </span>                :  * Copyright (c) 1996-1998
-<span class="lineNum">      46 </span>                :  * Silicon Graphics Computer Systems, Inc.
-<span class="lineNum">      47 </span>                :  *
-<span class="lineNum">      48 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      49 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      50 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      51 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      52 </span>                :  * in supporting documentation.  Silicon Graphics makes no
-<span class="lineNum">      53 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      54 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      55 </span>                :  */
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span>                : /** @file stl_function.h
-<span class="lineNum">      58 </span>                :  *  This is an internal header file, included by other library headers.
-<span class="lineNum">      59 </span>                :  *  You should not attempt to use it directly.
-<span class="lineNum">      60 </span>                :  */
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span>                : #ifndef _STL_FUNCTION_H
-<span class="lineNum">      63 </span>                : #define _STL_FUNCTION_H 1
-<span class="lineNum">      64 </span>                : 
-<span class="lineNum">      65 </span>                : _GLIBCXX_BEGIN_NAMESPACE(std)
-<span class="lineNum">      66 </span>                : 
-<span class="lineNum">      67 </span>                :   // 20.3.1 base classes
-<span class="lineNum">      68 </span>                :   /** @defgroup s20_3_1_base Functor Base Classes
-<span class="lineNum">      69 </span>                :    *  Function objects, or @e functors, are objects with an @c operator()
-<span class="lineNum">      70 </span>                :    *  defined and accessible.  They can be passed as arguments to algorithm
-<span class="lineNum">      71 </span>                :    *  templates and used in place of a function pointer.  Not only is the
-<span class="lineNum">      72 </span>                :    *  resulting expressiveness of the library increased, but the generated
-<span class="lineNum">      73 </span>                :    *  code can be more efficient than what you might write by hand.  When we
-<span class="lineNum">      74 </span>                :    *  refer to &quot;functors,&quot; then, generally we include function pointers in
-<span class="lineNum">      75 </span>                :    *  the description as well.
-<span class="lineNum">      76 </span>                :    *
-<span class="lineNum">      77 </span>                :    *  Often, functors are only created as temporaries passed to algorithm
-<span class="lineNum">      78 </span>                :    *  calls, rather than being created as named variables.
-<span class="lineNum">      79 </span>                :    *
-<span class="lineNum">      80 </span>                :    *  Two examples taken from the standard itself follow.  To perform a
-<span class="lineNum">      81 </span>                :    *  by-element addition of two vectors @c a and @c b containing @c double,
-<span class="lineNum">      82 </span>                :    *  and put the result in @c a, use
-<span class="lineNum">      83 </span>                :    *  \code
-<span class="lineNum">      84 </span>                :    *  transform (a.begin(), a.end(), b.begin(), a.begin(), plus&lt;double&gt;());
-<span class="lineNum">      85 </span>                :    *  \endcode
-<span class="lineNum">      86 </span>                :    *  To negate every element in @c a, use
-<span class="lineNum">      87 </span>                :    *  \code
-<span class="lineNum">      88 </span>                :    *  transform(a.begin(), a.end(), a.begin(), negate&lt;double&gt;());
-<span class="lineNum">      89 </span>                :    *  \endcode
-<span class="lineNum">      90 </span>                :    *  The addition and negation functions will be inlined directly.
-<span class="lineNum">      91 </span>                :    *
-<span class="lineNum">      92 </span>                :    *  The standard functors are derived from structs named @c unary_function
-<span class="lineNum">      93 </span>                :    *  and @c binary_function.  These two classes contain nothing but typedefs,
-<span class="lineNum">      94 </span>                :    *  to aid in generic (template) programming.  If you write your own
-<span class="lineNum">      95 </span>                :    *  functors, you might consider doing the same.
-<span class="lineNum">      96 </span>                :    *
-<span class="lineNum">      97 </span>                :    *  @{
-<span class="lineNum">      98 </span>                :    */
-<span class="lineNum">      99 </span>                :   /**
-<span class="lineNum">     100 </span>                :    *  This is one of the @link s20_3_1_base functor base classes@endlink.
-<span class="lineNum">     101 </span>                :    */
-<span class="lineNum">     102 </span>                :   template&lt;typename _Arg, typename _Result&gt;
-<span class="lineNum">     103 </span>                :     struct unary_function
-<span class="lineNum">     104 </span><span class="lineCov">             21 :     {</span>
-<span class="lineNum">     105 </span>                :       typedef _Arg argument_type;   ///&lt; @c argument_type is the type of the
-<span class="lineNum">     106 </span>                :                                     ///     argument (no surprises here)
-<span class="lineNum">     107 </span>                : 
-<span class="lineNum">     108 </span>                :       typedef _Result result_type;  ///&lt; @c result_type is the return type
-<span class="lineNum">     109 </span>                :     };
-<span class="lineNum">     110 </span>                : 
-<span class="lineNum">     111 </span>                :   /**
-<span class="lineNum">     112 </span>                :    *  This is one of the @link s20_3_1_base functor base classes@endlink.
-<span class="lineNum">     113 </span>                :    */
-<span class="lineNum">     114 </span>                :   template&lt;typename _Arg1, typename _Arg2, typename _Result&gt;
-<span class="lineNum">     115 </span>                :     struct binary_function
-<span class="lineNum">     116 </span>                :     {
-<span class="lineNum">     117 </span>                :       typedef _Arg1 first_argument_type;   ///&lt; the type of the first argument
-<span class="lineNum">     118 </span>                :                                            ///  (no surprises here)
-<span class="lineNum">     119 </span>                : 
-<span class="lineNum">     120 </span>                :       typedef _Arg2 second_argument_type;  ///&lt; the type of the second argument
-<span class="lineNum">     121 </span>                :       typedef _Result result_type;         ///&lt; type of the return type
-<span class="lineNum">     122 </span>                :     };
-<span class="lineNum">     123 </span>                :   /** @}  */
-<span class="lineNum">     124 </span>                : 
-<span class="lineNum">     125 </span>                :   // 20.3.2 arithmetic
-<span class="lineNum">     126 </span>                :   /** @defgroup s20_3_2_arithmetic Arithmetic Classes
-<span class="lineNum">     127 </span>                : 
-<span class="lineNum">     128 </span>                :    *  Because basic math often needs to be done during an algorithm,
-<span class="lineNum">     129 </span>                :    *  the library provides functors for those operations.  See the
-<span class="lineNum">     130 </span>                :    *  documentation for @link s20_3_1_base the base classes@endlink
-<span class="lineNum">     131 </span>                :    *  for examples of their use.
-<span class="lineNum">     132 </span>                :    *
-<span class="lineNum">     133 </span>                :    *  @{
-<span class="lineNum">     134 </span>                :    */
-<span class="lineNum">     135 </span>                :   /// One of the @link s20_3_2_arithmetic math functors@endlink.
-<span class="lineNum">     136 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     137 </span>                :     struct plus : public binary_function&lt;_Tp, _Tp, _Tp&gt;
-<span class="lineNum">     138 </span>                :     {
-<span class="lineNum">     139 </span>                :       _Tp
-<span class="lineNum">     140 </span><span class="lineCov">              4 :       operator()(const _Tp&amp; __x, const _Tp&amp; __y) const</span>
-<span class="lineNum">     141 </span><span class="lineCov">              4 :       { return __x + __y; }</span>
-<span class="lineNum">     142 </span>                :     };
-<span class="lineNum">     143 </span>                : 
-<span class="lineNum">     144 </span>                :   /// One of the @link s20_3_2_arithmetic math functors@endlink.
-<span class="lineNum">     145 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     146 </span>                :     struct minus : public binary_function&lt;_Tp, _Tp, _Tp&gt;
-<span class="lineNum">     147 </span>                :     {
-<span class="lineNum">     148 </span>                :       _Tp
-<span class="lineNum">     149 </span>                :       operator()(const _Tp&amp; __x, const _Tp&amp; __y) const
-<span class="lineNum">     150 </span>                :       { return __x - __y; }
-<span class="lineNum">     151 </span>                :     };
-<span class="lineNum">     152 </span>                : 
-<span class="lineNum">     153 </span>                :   /// One of the @link s20_3_2_arithmetic math functors@endlink.
-<span class="lineNum">     154 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     155 </span>                :     struct multiplies : public binary_function&lt;_Tp, _Tp, _Tp&gt;
-<span class="lineNum">     156 </span>                :     {
-<span class="lineNum">     157 </span>                :       _Tp
-<span class="lineNum">     158 </span>                :       operator()(const _Tp&amp; __x, const _Tp&amp; __y) const
-<span class="lineNum">     159 </span>                :       { return __x * __y; }
-<span class="lineNum">     160 </span>                :     };
-<span class="lineNum">     161 </span>                : 
-<span class="lineNum">     162 </span>                :   /// One of the @link s20_3_2_arithmetic math functors@endlink.
-<span class="lineNum">     163 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     164 </span>                :     struct divides : public binary_function&lt;_Tp, _Tp, _Tp&gt;
-<span class="lineNum">     165 </span>                :     {
-<span class="lineNum">     166 </span>                :       _Tp
-<span class="lineNum">     167 </span>                :       operator()(const _Tp&amp; __x, const _Tp&amp; __y) const
-<span class="lineNum">     168 </span>                :       { return __x / __y; }
-<span class="lineNum">     169 </span>                :     };
-<span class="lineNum">     170 </span>                : 
-<span class="lineNum">     171 </span>                :   /// One of the @link s20_3_2_arithmetic math functors@endlink.
-<span class="lineNum">     172 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     173 </span>                :     struct modulus : public binary_function&lt;_Tp, _Tp, _Tp&gt;
-<span class="lineNum">     174 </span>                :     {
-<span class="lineNum">     175 </span>                :       _Tp
-<span class="lineNum">     176 </span>                :       operator()(const _Tp&amp; __x, const _Tp&amp; __y) const
-<span class="lineNum">     177 </span>                :       { return __x % __y; }
-<span class="lineNum">     178 </span>                :     };
-<span class="lineNum">     179 </span>                : 
-<span class="lineNum">     180 </span>                :   /// One of the @link s20_3_2_arithmetic math functors@endlink.
-<span class="lineNum">     181 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     182 </span>                :     struct negate : public unary_function&lt;_Tp, _Tp&gt;
-<span class="lineNum">     183 </span>                :     {
-<span class="lineNum">     184 </span>                :       _Tp
-<span class="lineNum">     185 </span>                :       operator()(const _Tp&amp; __x) const
-<span class="lineNum">     186 </span>                :       { return -__x; }
-<span class="lineNum">     187 </span>                :     };
-<span class="lineNum">     188 </span>                :   /** @}  */
-<span class="lineNum">     189 </span>                : 
-<span class="lineNum">     190 </span>                :   // 20.3.3 comparisons
-<span class="lineNum">     191 </span>                :   /** @defgroup s20_3_3_comparisons Comparison Classes
-<span class="lineNum">     192 </span>                :    *  The library provides six wrapper functors for all the basic comparisons
-<span class="lineNum">     193 </span>                :    *  in C++, like @c &lt;.
-<span class="lineNum">     194 </span>                :    *
-<span class="lineNum">     195 </span>                :    *  @{
-<span class="lineNum">     196 </span>                :    */
-<span class="lineNum">     197 </span>                :   /// One of the @link s20_3_3_comparisons comparison functors@endlink.
-<span class="lineNum">     198 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     199 </span>                :     struct equal_to : public binary_function&lt;_Tp, _Tp, bool&gt;
-<span class="lineNum">     200 </span>                :     {
-<span class="lineNum">     201 </span>                :       bool
-<span class="lineNum">     202 </span><span class="lineCov">             66 :       operator()(const _Tp&amp; __x, const _Tp&amp; __y) const</span>
-<span class="lineNum">     203 </span><span class="lineCov">             66 :       { return __x == __y; }</span>
-<span class="lineNum">     204 </span>                :     };
-<span class="lineNum">     205 </span>                : 
-<span class="lineNum">     206 </span>                :   /// One of the @link s20_3_3_comparisons comparison functors@endlink.
-<span class="lineNum">     207 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     208 </span>                :     struct not_equal_to : public binary_function&lt;_Tp, _Tp, bool&gt;
-<span class="lineNum">     209 </span>                :     {
-<span class="lineNum">     210 </span>                :       bool
-<span class="lineNum">     211 </span>                :       operator()(const _Tp&amp; __x, const _Tp&amp; __y) const
-<span class="lineNum">     212 </span>                :       { return __x != __y; }
-<span class="lineNum">     213 </span>                :     };
-<span class="lineNum">     214 </span>                : 
-<span class="lineNum">     215 </span>                :   /// One of the @link s20_3_3_comparisons comparison functors@endlink.
-<span class="lineNum">     216 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     217 </span>                :     struct greater : public binary_function&lt;_Tp, _Tp, bool&gt;
-<span class="lineNum">     218 </span>                :     {
-<span class="lineNum">     219 </span>                :       bool
-<span class="lineNum">     220 </span>                :       operator()(const _Tp&amp; __x, const _Tp&amp; __y) const
-<span class="lineNum">     221 </span>                :       { return __x &gt; __y; }
-<span class="lineNum">     222 </span>                :     };
-<span class="lineNum">     223 </span>                : 
-<span class="lineNum">     224 </span>                :   /// One of the @link s20_3_3_comparisons comparison functors@endlink.
-<span class="lineNum">     225 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     226 </span>                :     struct less : public binary_function&lt;_Tp, _Tp, bool&gt;
-<span class="lineNum">     227 </span>                :     {
-<span class="lineNum">     228 </span>                :       bool
-<span class="lineNum">     229 </span><span class="lineCov">       10727242 :       operator()(const _Tp&amp; __x, const _Tp&amp; __y) const</span>
-<span class="lineNum">     230 </span><span class="lineCov">       10727242 :       { return __x &lt; __y; }</span>
-<span class="lineNum">     231 </span>                :     };
-<span class="lineNum">     232 </span>                : 
-<span class="lineNum">     233 </span>                :   /// One of the @link s20_3_3_comparisons comparison functors@endlink.
-<span class="lineNum">     234 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     235 </span>                :     struct greater_equal : public binary_function&lt;_Tp, _Tp, bool&gt;
-<span class="lineNum">     236 </span>                :     {
-<span class="lineNum">     237 </span>                :       bool
-<span class="lineNum">     238 </span>                :       operator()(const _Tp&amp; __x, const _Tp&amp; __y) const
-<span class="lineNum">     239 </span>                :       { return __x &gt;= __y; }
-<span class="lineNum">     240 </span>                :     };
-<span class="lineNum">     241 </span>                : 
-<span class="lineNum">     242 </span>                :   /// One of the @link s20_3_3_comparisons comparison functors@endlink.
-<span class="lineNum">     243 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     244 </span>                :     struct less_equal : public binary_function&lt;_Tp, _Tp, bool&gt;
-<span class="lineNum">     245 </span>                :     {
-<span class="lineNum">     246 </span>                :       bool
-<span class="lineNum">     247 </span>                :       operator()(const _Tp&amp; __x, const _Tp&amp; __y) const
-<span class="lineNum">     248 </span>                :       { return __x &lt;= __y; }
-<span class="lineNum">     249 </span>                :     };
-<span class="lineNum">     250 </span>                :   /** @}  */
-<span class="lineNum">     251 </span>                : 
-<span class="lineNum">     252 </span>                :   // 20.3.4 logical operations
-<span class="lineNum">     253 </span>                :   /** @defgroup s20_3_4_logical Boolean Operations Classes
-<span class="lineNum">     254 </span>                :    *  Here are wrapper functors for Boolean operations: @c &amp;&amp;, @c ||,
-<span class="lineNum">     255 </span>                :    *  and @c !.
-<span class="lineNum">     256 </span>                :    *
-<span class="lineNum">     257 </span>                :    *  @{
-<span class="lineNum">     258 </span>                :    */
-<span class="lineNum">     259 </span>                :   /// One of the @link s20_3_4_logical Boolean operations functors@endlink.
-<span class="lineNum">     260 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     261 </span>                :     struct logical_and : public binary_function&lt;_Tp, _Tp, bool&gt;
-<span class="lineNum">     262 </span>                :     {
-<span class="lineNum">     263 </span>                :       bool
-<span class="lineNum">     264 </span>                :       operator()(const _Tp&amp; __x, const _Tp&amp; __y) const
-<span class="lineNum">     265 </span>                :       { return __x &amp;&amp; __y; }
-<span class="lineNum">     266 </span>                :     };
-<span class="lineNum">     267 </span>                : 
-<span class="lineNum">     268 </span>                :   /// One of the @link s20_3_4_logical Boolean operations functors@endlink.
-<span class="lineNum">     269 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     270 </span>                :     struct logical_or : public binary_function&lt;_Tp, _Tp, bool&gt;
-<span class="lineNum">     271 </span>                :     {
-<span class="lineNum">     272 </span>                :       bool
-<span class="lineNum">     273 </span>                :       operator()(const _Tp&amp; __x, const _Tp&amp; __y) const
-<span class="lineNum">     274 </span>                :       { return __x || __y; }
-<span class="lineNum">     275 </span>                :     };
-<span class="lineNum">     276 </span>                : 
-<span class="lineNum">     277 </span>                :   /// One of the @link s20_3_4_logical Boolean operations functors@endlink.
-<span class="lineNum">     278 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     279 </span>                :     struct logical_not : public unary_function&lt;_Tp, bool&gt;
-<span class="lineNum">     280 </span>                :     {
-<span class="lineNum">     281 </span>                :       bool
-<span class="lineNum">     282 </span>                :       operator()(const _Tp&amp; __x) const
-<span class="lineNum">     283 </span>                :       { return !__x; }
-<span class="lineNum">     284 </span>                :     };
-<span class="lineNum">     285 </span>                :   /** @}  */
-<span class="lineNum">     286 </span>                : 
-<span class="lineNum">     287 </span>                :   // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     288 </span>                :   // DR 660. Missing Bitwise Operations.
-<span class="lineNum">     289 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     290 </span>                :     struct bit_and : public binary_function&lt;_Tp, _Tp, _Tp&gt;
-<span class="lineNum">     291 </span>                :     {
-<span class="lineNum">     292 </span>                :       _Tp
-<span class="lineNum">     293 </span>                :       operator()(const _Tp&amp; __x, const _Tp&amp; __y) const
-<span class="lineNum">     294 </span>                :       { return __x &amp; __y; }
-<span class="lineNum">     295 </span>                :     };
-<span class="lineNum">     296 </span>                : 
-<span class="lineNum">     297 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     298 </span>                :     struct bit_or : public binary_function&lt;_Tp, _Tp, _Tp&gt;
-<span class="lineNum">     299 </span>                :     {
-<span class="lineNum">     300 </span>                :       _Tp
-<span class="lineNum">     301 </span>                :       operator()(const _Tp&amp; __x, const _Tp&amp; __y) const
-<span class="lineNum">     302 </span>                :       { return __x | __y; }
-<span class="lineNum">     303 </span>                :     };
-<span class="lineNum">     304 </span>                : 
-<span class="lineNum">     305 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     306 </span>                :     struct bit_xor : public binary_function&lt;_Tp, _Tp, _Tp&gt;
-<span class="lineNum">     307 </span>                :     {
-<span class="lineNum">     308 </span>                :       _Tp
-<span class="lineNum">     309 </span>                :       operator()(const _Tp&amp; __x, const _Tp&amp; __y) const
-<span class="lineNum">     310 </span>                :       { return __x ^ __y; }
-<span class="lineNum">     311 </span>                :     };
-<span class="lineNum">     312 </span>                : 
-<span class="lineNum">     313 </span>                :   // 20.3.5 negators
-<span class="lineNum">     314 </span>                :   /** @defgroup s20_3_5_negators Negators
-<span class="lineNum">     315 </span>                :    *  The functions @c not1 and @c not2 each take a predicate functor
-<span class="lineNum">     316 </span>                :    *  and return an instance of @c unary_negate or
-<span class="lineNum">     317 </span>                :    *  @c binary_negate, respectively.  These classes are functors whose
-<span class="lineNum">     318 </span>                :    *  @c operator() performs the stored predicate function and then returns
-<span class="lineNum">     319 </span>                :    *  the negation of the result.
-<span class="lineNum">     320 </span>                :    *
-<span class="lineNum">     321 </span>                :    *  For example, given a vector of integers and a trivial predicate,
-<span class="lineNum">     322 </span>                :    *  \code
-<span class="lineNum">     323 </span>                :    *  struct IntGreaterThanThree
-<span class="lineNum">     324 </span>                :    *    : public std::unary_function&lt;int, bool&gt;
-<span class="lineNum">     325 </span>                :    *  {
-<span class="lineNum">     326 </span>                :    *      bool operator() (int x) { return x &gt; 3; }
-<span class="lineNum">     327 </span>                :    *  };
-<span class="lineNum">     328 </span>                :    *
-<span class="lineNum">     329 </span>                :    *  std::find_if (v.begin(), v.end(), not1(IntGreaterThanThree()));
-<span class="lineNum">     330 </span>                :    *  \endcode
-<span class="lineNum">     331 </span>                :    *  The call to @c find_if will locate the first index (i) of @c v for which
-<span class="lineNum">     332 </span>                :    *  &quot;!(v[i] &gt; 3)&quot; is true.
-<span class="lineNum">     333 </span>                :    *
-<span class="lineNum">     334 </span>                :    *  The not1/unary_negate combination works on predicates taking a single
-<span class="lineNum">     335 </span>                :    *  argument.  The not2/binary_negate combination works on predicates which
-<span class="lineNum">     336 </span>                :    *  take two arguments.
-<span class="lineNum">     337 </span>                :    *
-<span class="lineNum">     338 </span>                :    *  @{
-<span class="lineNum">     339 </span>                :    */
-<span class="lineNum">     340 </span>                :   /// One of the @link s20_3_5_negators negation functors@endlink.
-<span class="lineNum">     341 </span>                :   template&lt;typename _Predicate&gt;
-<span class="lineNum">     342 </span>                :     class unary_negate
-<span class="lineNum">     343 </span>                :     : public unary_function&lt;typename _Predicate::argument_type, bool&gt;
-<span class="lineNum">     344 </span>                :     {
-<span class="lineNum">     345 </span>                :     protected:
-<span class="lineNum">     346 </span>                :       _Predicate _M_pred;
-<span class="lineNum">     347 </span>                : 
-<span class="lineNum">     348 </span>                :     public:
-<span class="lineNum">     349 </span>                :       explicit
-<span class="lineNum">     350 </span>                :       unary_negate(const _Predicate&amp; __x) : _M_pred(__x) { }
-<span class="lineNum">     351 </span>                : 
-<span class="lineNum">     352 </span>                :       bool
-<span class="lineNum">     353 </span>                :       operator()(const typename _Predicate::argument_type&amp; __x) const
-<span class="lineNum">     354 </span>                :       { return !_M_pred(__x); }
-<span class="lineNum">     355 </span>                :     };
-<span class="lineNum">     356 </span>                : 
-<span class="lineNum">     357 </span>                :   /// One of the @link s20_3_5_negators negation functors@endlink.
-<span class="lineNum">     358 </span>                :   template&lt;typename _Predicate&gt;
-<span class="lineNum">     359 </span>                :     inline unary_negate&lt;_Predicate&gt;
-<span class="lineNum">     360 </span>                :     not1(const _Predicate&amp; __pred)
-<span class="lineNum">     361 </span>                :     { return unary_negate&lt;_Predicate&gt;(__pred); }
-<span class="lineNum">     362 </span>                : 
-<span class="lineNum">     363 </span>                :   /// One of the @link s20_3_5_negators negation functors@endlink.
-<span class="lineNum">     364 </span>                :   template&lt;typename _Predicate&gt;
-<span class="lineNum">     365 </span>                :     class binary_negate
-<span class="lineNum">     366 </span>                :     : public binary_function&lt;typename _Predicate::first_argument_type,
-<span class="lineNum">     367 </span>                :                              typename _Predicate::second_argument_type, bool&gt;
-<span class="lineNum">     368 </span>                :     {
-<span class="lineNum">     369 </span>                :     protected:
-<span class="lineNum">     370 </span>                :       _Predicate _M_pred;
-<span class="lineNum">     371 </span>                : 
-<span class="lineNum">     372 </span>                :     public:
-<span class="lineNum">     373 </span>                :       explicit
-<span class="lineNum">     374 </span>                :       binary_negate(const _Predicate&amp; __x) : _M_pred(__x) { }
-<span class="lineNum">     375 </span>                : 
-<span class="lineNum">     376 </span>                :       bool
-<span class="lineNum">     377 </span>                :       operator()(const typename _Predicate::first_argument_type&amp; __x,
-<span class="lineNum">     378 </span>                :                  const typename _Predicate::second_argument_type&amp; __y) const
-<span class="lineNum">     379 </span>                :       { return !_M_pred(__x, __y); }
-<span class="lineNum">     380 </span>                :     };
-<span class="lineNum">     381 </span>                : 
-<span class="lineNum">     382 </span>                :   /// One of the @link s20_3_5_negators negation functors@endlink.
-<span class="lineNum">     383 </span>                :   template&lt;typename _Predicate&gt;
-<span class="lineNum">     384 </span>                :     inline binary_negate&lt;_Predicate&gt;
-<span class="lineNum">     385 </span>                :     not2(const _Predicate&amp; __pred)
-<span class="lineNum">     386 </span>                :     { return binary_negate&lt;_Predicate&gt;(__pred); }
-<span class="lineNum">     387 </span>                :   /** @}  */
-<span class="lineNum">     388 </span>                : 
-<span class="lineNum">     389 </span>                :   // 20.3.7 adaptors pointers functions
-<span class="lineNum">     390 </span>                :   /** @defgroup s20_3_7_adaptors Adaptors for pointers to functions
-<span class="lineNum">     391 </span>                :    *  The advantage of function objects over pointers to functions is that
-<span class="lineNum">     392 </span>                :    *  the objects in the standard library declare nested typedefs describing
-<span class="lineNum">     393 </span>                :    *  their argument and result types with uniform names (e.g., @c result_type
-<span class="lineNum">     394 </span>                :    *  from the base classes @c unary_function and @c binary_function).
-<span class="lineNum">     395 </span>                :    *  Sometimes those typedefs are required, not just optional.
-<span class="lineNum">     396 </span>                :    *
-<span class="lineNum">     397 </span>                :    *  Adaptors are provided to turn pointers to unary (single-argument) and
-<span class="lineNum">     398 </span>                :    *  binary (double-argument) functions into function objects.  The
-<span class="lineNum">     399 </span>                :    *  long-winded functor @c pointer_to_unary_function is constructed with a
-<span class="lineNum">     400 </span>                :    *  function pointer @c f, and its @c operator() called with argument @c x
-<span class="lineNum">     401 </span>                :    *  returns @c f(x).  The functor @c pointer_to_binary_function does the same
-<span class="lineNum">     402 </span>                :    *  thing, but with a double-argument @c f and @c operator().
-<span class="lineNum">     403 </span>                :    *
-<span class="lineNum">     404 </span>                :    *  The function @c ptr_fun takes a pointer-to-function @c f and constructs
-<span class="lineNum">     405 </span>                :    *  an instance of the appropriate functor.
-<span class="lineNum">     406 </span>                :    *
-<span class="lineNum">     407 </span>                :    *  @{
-<span class="lineNum">     408 </span>                :    */
-<span class="lineNum">     409 </span>                :   /// One of the @link s20_3_7_adaptors adaptors for function pointers@endlink.
-<span class="lineNum">     410 </span>                :   template&lt;typename _Arg, typename _Result&gt;
-<span class="lineNum">     411 </span>                :     class pointer_to_unary_function : public unary_function&lt;_Arg, _Result&gt;
-<span class="lineNum">     412 </span>                :     {
-<span class="lineNum">     413 </span>                :     protected:
-<span class="lineNum">     414 </span>                :       _Result (*_M_ptr)(_Arg);
-<span class="lineNum">     415 </span>                : 
-<span class="lineNum">     416 </span>                :     public:
-<span class="lineNum">     417 </span>                :       pointer_to_unary_function() { }
-<span class="lineNum">     418 </span>                : 
-<span class="lineNum">     419 </span>                :       explicit
-<span class="lineNum">     420 </span><span class="lineCov">              2 :       pointer_to_unary_function(_Result (*__x)(_Arg))</span>
-<span class="lineNum">     421 </span><span class="lineCov">              2 :       : _M_ptr(__x) { }</span>
-<span class="lineNum">     422 </span>                : 
-<span class="lineNum">     423 </span>                :       _Result
-<span class="lineNum">     424 </span><span class="lineCov">            516 :       operator()(_Arg __x) const</span>
-<span class="lineNum">     425 </span><span class="lineCov">            516 :       { return _M_ptr(__x); }</span>
-<span class="lineNum">     426 </span>                :     };
-<span class="lineNum">     427 </span>                : 
-<span class="lineNum">     428 </span>                :   /// One of the @link s20_3_7_adaptors adaptors for function pointers@endlink.
-<span class="lineNum">     429 </span>                :   template&lt;typename _Arg, typename _Result&gt;
-<span class="lineNum">     430 </span>                :     inline pointer_to_unary_function&lt;_Arg, _Result&gt;
-<span class="lineNum">     431 </span><span class="lineCov">              2 :     ptr_fun(_Result (*__x)(_Arg))</span>
-<span class="lineNum">     432 </span><span class="lineCov">              2 :     { return pointer_to_unary_function&lt;_Arg, _Result&gt;(__x); }</span>
-<span class="lineNum">     433 </span>                : 
-<span class="lineNum">     434 </span>                :   /// One of the @link s20_3_7_adaptors adaptors for function pointers@endlink.
-<span class="lineNum">     435 </span>                :   template&lt;typename _Arg1, typename _Arg2, typename _Result&gt;
-<span class="lineNum">     436 </span>                :     class pointer_to_binary_function
-<span class="lineNum">     437 </span>                :     : public binary_function&lt;_Arg1, _Arg2, _Result&gt;
-<span class="lineNum">     438 </span>                :     {
-<span class="lineNum">     439 </span>                :     protected:
-<span class="lineNum">     440 </span>                :       _Result (*_M_ptr)(_Arg1, _Arg2);
-<span class="lineNum">     441 </span>                : 
-<span class="lineNum">     442 </span>                :     public:
-<span class="lineNum">     443 </span>                :       pointer_to_binary_function() { }
-<span class="lineNum">     444 </span>                : 
-<span class="lineNum">     445 </span>                :       explicit
-<span class="lineNum">     446 </span>                :       pointer_to_binary_function(_Result (*__x)(_Arg1, _Arg2))
-<span class="lineNum">     447 </span>                :       : _M_ptr(__x) { }
-<span class="lineNum">     448 </span>                : 
-<span class="lineNum">     449 </span>                :       _Result
-<span class="lineNum">     450 </span>                :       operator()(_Arg1 __x, _Arg2 __y) const
-<span class="lineNum">     451 </span>                :       { return _M_ptr(__x, __y); }
-<span class="lineNum">     452 </span>                :     };
-<span class="lineNum">     453 </span>                : 
-<span class="lineNum">     454 </span>                :   /// One of the @link s20_3_7_adaptors adaptors for function pointers@endlink.
-<span class="lineNum">     455 </span>                :   template&lt;typename _Arg1, typename _Arg2, typename _Result&gt;
-<span class="lineNum">     456 </span>                :     inline pointer_to_binary_function&lt;_Arg1, _Arg2, _Result&gt;
-<span class="lineNum">     457 </span>                :     ptr_fun(_Result (*__x)(_Arg1, _Arg2))
-<span class="lineNum">     458 </span>                :     { return pointer_to_binary_function&lt;_Arg1, _Arg2, _Result&gt;(__x); }
-<span class="lineNum">     459 </span>                :   /** @}  */
-<span class="lineNum">     460 </span>                : 
-<span class="lineNum">     461 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     462 </span>                :     struct _Identity : public unary_function&lt;_Tp,_Tp&gt;
-<span class="lineNum">     463 </span>                :     {
-<span class="lineNum">     464 </span>                :       _Tp&amp;
-<span class="lineNum">     465 </span>                :       operator()(_Tp&amp; __x) const
-<span class="lineNum">     466 </span>                :       { return __x; }
-<span class="lineNum">     467 </span>                : 
-<span class="lineNum">     468 </span>                :       const _Tp&amp;
-<span class="lineNum">     469 </span><span class="lineCov">       16055496 :       operator()(const _Tp&amp; __x) const</span>
-<span class="lineNum">     470 </span><span class="lineCov">       16055496 :       { return __x; }</span>
-<span class="lineNum">     471 </span>                :     };
-<span class="lineNum">     472 </span>                : 
-<span class="lineNum">     473 </span>                :   template&lt;typename _Pair&gt;
-<span class="lineNum">     474 </span>                :     struct _Select1st : public unary_function&lt;_Pair,
-<span class="lineNum">     475 </span>                :                                               typename _Pair::first_type&gt;
-<span class="lineNum">     476 </span>                :     {
-<span class="lineNum">     477 </span>                :       typename _Pair::first_type&amp;
-<span class="lineNum">     478 </span>                :       operator()(_Pair&amp; __x) const
-<span class="lineNum">     479 </span>                :       { return __x.first; }
-<span class="lineNum">     480 </span>                : 
-<span class="lineNum">     481 </span>                :       const typename _Pair::first_type&amp;
-<span class="lineNum">     482 </span><span class="lineCov">        4509167 :       operator()(const _Pair&amp; __x) const</span>
-<span class="lineNum">     483 </span><span class="lineCov">        4509167 :       { return __x.first; }</span>
-<span class="lineNum">     484 </span>                :     };
-<span class="lineNum">     485 </span>                : 
-<span class="lineNum">     486 </span>                :   template&lt;typename _Pair&gt;
-<span class="lineNum">     487 </span>                :     struct _Select2nd : public unary_function&lt;_Pair,
-<span class="lineNum">     488 </span>                :                                               typename _Pair::second_type&gt;
-<span class="lineNum">     489 </span>                :     {
-<span class="lineNum">     490 </span>                :       typename _Pair::second_type&amp;
-<span class="lineNum">     491 </span>                :       operator()(_Pair&amp; __x) const
-<span class="lineNum">     492 </span>                :       { return __x.second; }
-<span class="lineNum">     493 </span>                : 
-<span class="lineNum">     494 </span>                :       const typename _Pair::second_type&amp;
-<span class="lineNum">     495 </span>                :       operator()(const _Pair&amp; __x) const
-<span class="lineNum">     496 </span>                :       { return __x.second; }
-<span class="lineNum">     497 </span>                :     };
-<span class="lineNum">     498 </span>                : 
-<span class="lineNum">     499 </span>                :   // 20.3.8 adaptors pointers members
-<span class="lineNum">     500 </span>                :   /** @defgroup s20_3_8_memadaptors Adaptors for pointers to members
-<span class="lineNum">     501 </span>                :    *  There are a total of 8 = 2^3 function objects in this family.
-<span class="lineNum">     502 </span>                :    *   (1) Member functions taking no arguments vs member functions taking
-<span class="lineNum">     503 </span>                :    *        one argument.
-<span class="lineNum">     504 </span>                :    *   (2) Call through pointer vs call through reference.
-<span class="lineNum">     505 </span>                :    *   (3) Const vs non-const member function.
-<span class="lineNum">     506 </span>                :    *
-<span class="lineNum">     507 </span>                :    *  All of this complexity is in the function objects themselves.  You can
-<span class="lineNum">     508 </span>                :    *   ignore it by using the helper function mem_fun and mem_fun_ref,
-<span class="lineNum">     509 </span>                :    *   which create whichever type of adaptor is appropriate.
-<span class="lineNum">     510 </span>                :    *
-<span class="lineNum">     511 </span>                :    *  @{
-<span class="lineNum">     512 </span>                :    */
-<span class="lineNum">     513 </span>                :   /// One of the @link s20_3_8_memadaptors adaptors for member
-<span class="lineNum">     514 </span>                :   /// pointers@endlink.
-<span class="lineNum">     515 </span>                :   template&lt;typename _Ret, typename _Tp&gt;
-<span class="lineNum">     516 </span>                :     class mem_fun_t : public unary_function&lt;_Tp*, _Ret&gt;
-<span class="lineNum">     517 </span>                :     {
-<span class="lineNum">     518 </span>                :     public:
-<span class="lineNum">     519 </span>                :       explicit
-<span class="lineNum">     520 </span>                :       mem_fun_t(_Ret (_Tp::*__pf)())
-<span class="lineNum">     521 </span>                :       : _M_f(__pf) { }
-<span class="lineNum">     522 </span>                : 
-<span class="lineNum">     523 </span>                :       _Ret
-<span class="lineNum">     524 </span>                :       operator()(_Tp* __p) const
-<span class="lineNum">     525 </span>                :       { return (__p-&gt;*_M_f)(); }
-<span class="lineNum">     526 </span>                : 
-<span class="lineNum">     527 </span>                :     private:
-<span class="lineNum">     528 </span>                :       _Ret (_Tp::*_M_f)();
-<span class="lineNum">     529 </span>                :     };
-<span class="lineNum">     530 </span>                : 
-<span class="lineNum">     531 </span>                :   /// One of the @link s20_3_8_memadaptors adaptors for member
-<span class="lineNum">     532 </span>                :   /// pointers@endlink.
-<span class="lineNum">     533 </span>                :   template&lt;typename _Ret, typename _Tp&gt;
-<span class="lineNum">     534 </span>                :     class const_mem_fun_t : public unary_function&lt;const _Tp*, _Ret&gt;
-<span class="lineNum">     535 </span>                :     {
-<span class="lineNum">     536 </span>                :     public:
-<span class="lineNum">     537 </span>                :       explicit
-<span class="lineNum">     538 </span>                :       const_mem_fun_t(_Ret (_Tp::*__pf)() const)
-<span class="lineNum">     539 </span>                :       : _M_f(__pf) { }
-<span class="lineNum">     540 </span>                : 
-<span class="lineNum">     541 </span>                :       _Ret
-<span class="lineNum">     542 </span>                :       operator()(const _Tp* __p) const
-<span class="lineNum">     543 </span>                :       { return (__p-&gt;*_M_f)(); }
-<span class="lineNum">     544 </span>                : 
-<span class="lineNum">     545 </span>                :     private:
-<span class="lineNum">     546 </span>                :       _Ret (_Tp::*_M_f)() const;
-<span class="lineNum">     547 </span>                :     };
-<span class="lineNum">     548 </span>                : 
-<span class="lineNum">     549 </span>                :   /// One of the @link s20_3_8_memadaptors adaptors for member
-<span class="lineNum">     550 </span>                :   /// pointers@endlink.
-<span class="lineNum">     551 </span>                :   template&lt;typename _Ret, typename _Tp&gt;
-<span class="lineNum">     552 </span>                :     class mem_fun_ref_t : public unary_function&lt;_Tp, _Ret&gt;
-<span class="lineNum">     553 </span>                :     {
-<span class="lineNum">     554 </span>                :     public:
-<span class="lineNum">     555 </span>                :       explicit
-<span class="lineNum">     556 </span>                :       mem_fun_ref_t(_Ret (_Tp::*__pf)())
-<span class="lineNum">     557 </span>                :       : _M_f(__pf) { }
-<span class="lineNum">     558 </span>                : 
-<span class="lineNum">     559 </span>                :       _Ret
-<span class="lineNum">     560 </span>                :       operator()(_Tp&amp; __r) const
-<span class="lineNum">     561 </span>                :       { return (__r.*_M_f)(); }
-<span class="lineNum">     562 </span>                : 
-<span class="lineNum">     563 </span>                :     private:
-<span class="lineNum">     564 </span>                :       _Ret (_Tp::*_M_f)();
-<span class="lineNum">     565 </span>                :   };
-<span class="lineNum">     566 </span>                : 
-<span class="lineNum">     567 </span>                :   /// One of the @link s20_3_8_memadaptors adaptors for member
-<span class="lineNum">     568 </span>                :   /// pointers@endlink.
-<span class="lineNum">     569 </span>                :   template&lt;typename _Ret, typename _Tp&gt;
-<span class="lineNum">     570 </span>                :     class const_mem_fun_ref_t : public unary_function&lt;_Tp, _Ret&gt;
-<span class="lineNum">     571 </span>                :     {
-<span class="lineNum">     572 </span>                :     public:
-<span class="lineNum">     573 </span>                :       explicit
-<span class="lineNum">     574 </span>                :       const_mem_fun_ref_t(_Ret (_Tp::*__pf)() const)
-<span class="lineNum">     575 </span>                :       : _M_f(__pf) { }
-<span class="lineNum">     576 </span>                : 
-<span class="lineNum">     577 </span>                :       _Ret
-<span class="lineNum">     578 </span>                :       operator()(const _Tp&amp; __r) const
-<span class="lineNum">     579 </span>                :       { return (__r.*_M_f)(); }
-<span class="lineNum">     580 </span>                : 
-<span class="lineNum">     581 </span>                :     private:
-<span class="lineNum">     582 </span>                :       _Ret (_Tp::*_M_f)() const;
-<span class="lineNum">     583 </span>                :     };
-<span class="lineNum">     584 </span>                : 
-<span class="lineNum">     585 </span>                :   /// One of the @link s20_3_8_memadaptors adaptors for member
-<span class="lineNum">     586 </span>                :   /// pointers@endlink.
-<span class="lineNum">     587 </span>                :   template&lt;typename _Ret, typename _Tp, typename _Arg&gt;
-<span class="lineNum">     588 </span>                :     class mem_fun1_t : public binary_function&lt;_Tp*, _Arg, _Ret&gt;
-<span class="lineNum">     589 </span>                :     {
-<span class="lineNum">     590 </span>                :     public:
-<span class="lineNum">     591 </span>                :       explicit
-<span class="lineNum">     592 </span>                :       mem_fun1_t(_Ret (_Tp::*__pf)(_Arg))
-<span class="lineNum">     593 </span>                :       : _M_f(__pf) { }
-<span class="lineNum">     594 </span>                : 
-<span class="lineNum">     595 </span>                :       _Ret
-<span class="lineNum">     596 </span>                :       operator()(_Tp* __p, _Arg __x) const
-<span class="lineNum">     597 </span>                :       { return (__p-&gt;*_M_f)(__x); }
-<span class="lineNum">     598 </span>                : 
-<span class="lineNum">     599 </span>                :     private:
-<span class="lineNum">     600 </span>                :       _Ret (_Tp::*_M_f)(_Arg);
-<span class="lineNum">     601 </span>                :     };
-<span class="lineNum">     602 </span>                : 
-<span class="lineNum">     603 </span>                :   /// One of the @link s20_3_8_memadaptors adaptors for member
-<span class="lineNum">     604 </span>                :   /// pointers@endlink.
-<span class="lineNum">     605 </span>                :   template&lt;typename _Ret, typename _Tp, typename _Arg&gt;
-<span class="lineNum">     606 </span>                :     class const_mem_fun1_t : public binary_function&lt;const _Tp*, _Arg, _Ret&gt;
-<span class="lineNum">     607 </span>                :     {
-<span class="lineNum">     608 </span>                :     public:
-<span class="lineNum">     609 </span>                :       explicit
-<span class="lineNum">     610 </span>                :       const_mem_fun1_t(_Ret (_Tp::*__pf)(_Arg) const)
-<span class="lineNum">     611 </span>                :       : _M_f(__pf) { }
-<span class="lineNum">     612 </span>                : 
-<span class="lineNum">     613 </span>                :       _Ret
-<span class="lineNum">     614 </span>                :       operator()(const _Tp* __p, _Arg __x) const
-<span class="lineNum">     615 </span>                :       { return (__p-&gt;*_M_f)(__x); }
-<span class="lineNum">     616 </span>                : 
-<span class="lineNum">     617 </span>                :     private:
-<span class="lineNum">     618 </span>                :       _Ret (_Tp::*_M_f)(_Arg) const;
-<span class="lineNum">     619 </span>                :     };
-<span class="lineNum">     620 </span>                : 
-<span class="lineNum">     621 </span>                :   /// One of the @link s20_3_8_memadaptors adaptors for member
-<span class="lineNum">     622 </span>                :   /// pointers@endlink.
-<span class="lineNum">     623 </span>                :   template&lt;typename _Ret, typename _Tp, typename _Arg&gt;
-<span class="lineNum">     624 </span>                :     class mem_fun1_ref_t : public binary_function&lt;_Tp, _Arg, _Ret&gt;
-<span class="lineNum">     625 </span>                :     {
-<span class="lineNum">     626 </span>                :     public:
-<span class="lineNum">     627 </span>                :       explicit
-<span class="lineNum">     628 </span>                :       mem_fun1_ref_t(_Ret (_Tp::*__pf)(_Arg))
-<span class="lineNum">     629 </span>                :       : _M_f(__pf) { }
-<span class="lineNum">     630 </span>                : 
-<span class="lineNum">     631 </span>                :       _Ret
-<span class="lineNum">     632 </span>                :       operator()(_Tp&amp; __r, _Arg __x) const
-<span class="lineNum">     633 </span>                :       { return (__r.*_M_f)(__x); }
-<span class="lineNum">     634 </span>                : 
-<span class="lineNum">     635 </span>                :     private:
-<span class="lineNum">     636 </span>                :       _Ret (_Tp::*_M_f)(_Arg);
-<span class="lineNum">     637 </span>                :     };
-<span class="lineNum">     638 </span>                : 
-<span class="lineNum">     639 </span>                :   /// One of the @link s20_3_8_memadaptors adaptors for member
-<span class="lineNum">     640 </span>                :   /// pointers@endlink.
-<span class="lineNum">     641 </span>                :   template&lt;typename _Ret, typename _Tp, typename _Arg&gt;
-<span class="lineNum">     642 </span>                :     class const_mem_fun1_ref_t : public binary_function&lt;_Tp, _Arg, _Ret&gt;
-<span class="lineNum">     643 </span>                :     {
-<span class="lineNum">     644 </span>                :     public:
-<span class="lineNum">     645 </span>                :       explicit
-<span class="lineNum">     646 </span>                :       const_mem_fun1_ref_t(_Ret (_Tp::*__pf)(_Arg) const)
-<span class="lineNum">     647 </span>                :       : _M_f(__pf) { }
-<span class="lineNum">     648 </span>                : 
-<span class="lineNum">     649 </span>                :       _Ret
-<span class="lineNum">     650 </span>                :       operator()(const _Tp&amp; __r, _Arg __x) const
-<span class="lineNum">     651 </span>                :       { return (__r.*_M_f)(__x); }
-<span class="lineNum">     652 </span>                : 
-<span class="lineNum">     653 </span>                :     private:
-<span class="lineNum">     654 </span>                :       _Ret (_Tp::*_M_f)(_Arg) const;
-<span class="lineNum">     655 </span>                :     };
-<span class="lineNum">     656 </span>                : 
-<span class="lineNum">     657 </span>                :   // Mem_fun adaptor helper functions.  There are only two:
-<span class="lineNum">     658 </span>                :   // mem_fun and mem_fun_ref.
-<span class="lineNum">     659 </span>                :   template&lt;typename _Ret, typename _Tp&gt;
-<span class="lineNum">     660 </span>                :     inline mem_fun_t&lt;_Ret, _Tp&gt;
-<span class="lineNum">     661 </span>                :     mem_fun(_Ret (_Tp::*__f)())
-<span class="lineNum">     662 </span>                :     { return mem_fun_t&lt;_Ret, _Tp&gt;(__f); }
-<span class="lineNum">     663 </span>                : 
-<span class="lineNum">     664 </span>                :   template&lt;typename _Ret, typename _Tp&gt;
-<span class="lineNum">     665 </span>                :     inline const_mem_fun_t&lt;_Ret, _Tp&gt;
-<span class="lineNum">     666 </span>                :     mem_fun(_Ret (_Tp::*__f)() const)
-<span class="lineNum">     667 </span>                :     { return const_mem_fun_t&lt;_Ret, _Tp&gt;(__f); }
-<span class="lineNum">     668 </span>                : 
-<span class="lineNum">     669 </span>                :   template&lt;typename _Ret, typename _Tp&gt;
-<span class="lineNum">     670 </span>                :     inline mem_fun_ref_t&lt;_Ret, _Tp&gt;
-<span class="lineNum">     671 </span>                :     mem_fun_ref(_Ret (_Tp::*__f)())
-<span class="lineNum">     672 </span>                :     { return mem_fun_ref_t&lt;_Ret, _Tp&gt;(__f); }
-<span class="lineNum">     673 </span>                : 
-<span class="lineNum">     674 </span>                :   template&lt;typename _Ret, typename _Tp&gt;
-<span class="lineNum">     675 </span>                :     inline const_mem_fun_ref_t&lt;_Ret, _Tp&gt;
-<span class="lineNum">     676 </span>                :     mem_fun_ref(_Ret (_Tp::*__f)() const)
-<span class="lineNum">     677 </span>                :     { return const_mem_fun_ref_t&lt;_Ret, _Tp&gt;(__f); }
-<span class="lineNum">     678 </span>                : 
-<span class="lineNum">     679 </span>                :   template&lt;typename _Ret, typename _Tp, typename _Arg&gt;
-<span class="lineNum">     680 </span>                :     inline mem_fun1_t&lt;_Ret, _Tp, _Arg&gt;
-<span class="lineNum">     681 </span>                :     mem_fun(_Ret (_Tp::*__f)(_Arg))
-<span class="lineNum">     682 </span>                :     { return mem_fun1_t&lt;_Ret, _Tp, _Arg&gt;(__f); }
-<span class="lineNum">     683 </span>                : 
-<span class="lineNum">     684 </span>                :   template&lt;typename _Ret, typename _Tp, typename _Arg&gt;
-<span class="lineNum">     685 </span>                :     inline const_mem_fun1_t&lt;_Ret, _Tp, _Arg&gt;
-<span class="lineNum">     686 </span>                :     mem_fun(_Ret (_Tp::*__f)(_Arg) const)
-<span class="lineNum">     687 </span>                :     { return const_mem_fun1_t&lt;_Ret, _Tp, _Arg&gt;(__f); }
-<span class="lineNum">     688 </span>                : 
-<span class="lineNum">     689 </span>                :   template&lt;typename _Ret, typename _Tp, typename _Arg&gt;
-<span class="lineNum">     690 </span>                :     inline mem_fun1_ref_t&lt;_Ret, _Tp, _Arg&gt;
-<span class="lineNum">     691 </span>                :     mem_fun_ref(_Ret (_Tp::*__f)(_Arg))
-<span class="lineNum">     692 </span>                :     { return mem_fun1_ref_t&lt;_Ret, _Tp, _Arg&gt;(__f); }
-<span class="lineNum">     693 </span>                : 
-<span class="lineNum">     694 </span>                :   template&lt;typename _Ret, typename _Tp, typename _Arg&gt;
-<span class="lineNum">     695 </span>                :     inline const_mem_fun1_ref_t&lt;_Ret, _Tp, _Arg&gt;
-<span class="lineNum">     696 </span>                :     mem_fun_ref(_Ret (_Tp::*__f)(_Arg) const)
-<span class="lineNum">     697 </span>                :     { return const_mem_fun1_ref_t&lt;_Ret, _Tp, _Arg&gt;(__f); }
-<span class="lineNum">     698 </span>                : 
-<span class="lineNum">     699 </span>                :   /** @}  */
-<span class="lineNum">     700 </span>                : 
-<span class="lineNum">     701 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">     702 </span>                : 
-<span class="lineNum">     703 </span>                : #if !defined(__GXX_EXPERIMENTAL_CXX0X__) || _GLIBCXX_DEPRECATED
-<span class="lineNum">     704 </span>                : # include &lt;backward/binders.h&gt;
-<span class="lineNum">     705 </span>                : #endif
-<span class="lineNum">     706 </span>                : 
-<span class="lineNum">     707 </span>                : #endif /* _STL_FUNCTION_H */
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/bits/stl_heap.h.gcov.html b/rep/usr/include/c++/4.3/bits/stl_heap.h.gcov.html
deleted file mode 100644
index c9d582a..0000000
--- a/rep/usr/include/c++/4.3/bits/stl_heap.h.gcov.html
+++ /dev/null
@@ -1,637 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_heap.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_heap.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">92</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">0.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">0</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // Heap implementation -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007
-<span class="lineNum">       4 </span>                : // Free Software Foundation, Inc.
-<span class="lineNum">       5 </span>                : //
-<span class="lineNum">       6 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       7 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       8 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">       9 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      10 </span>                : // any later version.
-<span class="lineNum">      11 </span>                : 
-<span class="lineNum">      12 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      13 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      14 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      15 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      16 </span>                : 
-<span class="lineNum">      17 </span>                : // You should have received a copy of the GNU General Public License along
-<span class="lineNum">      18 </span>                : // with this library; see the file COPYING.  If not, write to the Free
-<span class="lineNum">      19 </span>                : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-<span class="lineNum">      20 </span>                : // USA.
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      23 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      24 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      25 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      26 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      27 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      28 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      29 </span>                : // the GNU General Public License.
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : /*
-<span class="lineNum">      32 </span>                :  *
-<span class="lineNum">      33 </span>                :  * Copyright (c) 1994
-<span class="lineNum">      34 </span>                :  * Hewlett-Packard Company
-<span class="lineNum">      35 </span>                :  *
-<span class="lineNum">      36 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      37 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      38 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      39 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      40 </span>                :  * in supporting documentation.  Hewlett-Packard Company makes no
-<span class="lineNum">      41 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      42 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      43 </span>                :  *
-<span class="lineNum">      44 </span>                :  * Copyright (c) 1997
-<span class="lineNum">      45 </span>                :  * Silicon Graphics Computer Systems, Inc.
-<span class="lineNum">      46 </span>                :  *
-<span class="lineNum">      47 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      48 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      49 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      50 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      51 </span>                :  * in supporting documentation.  Silicon Graphics makes no
-<span class="lineNum">      52 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      53 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      54 </span>                :  */
-<span class="lineNum">      55 </span>                : 
-<span class="lineNum">      56 </span>                : /** @file stl_heap.h
-<span class="lineNum">      57 </span>                :  *  This is an internal header file, included by other library headers.
-<span class="lineNum">      58 </span>                :  *  You should not attempt to use it directly.
-<span class="lineNum">      59 </span>                :  */
-<span class="lineNum">      60 </span>                : 
-<span class="lineNum">      61 </span>                : #ifndef _STL_HEAP_H
-<span class="lineNum">      62 </span>                : #define _STL_HEAP_H 1
-<span class="lineNum">      63 </span>                : 
-<span class="lineNum">      64 </span>                : #include &lt;debug/debug.h&gt;
-<span class="lineNum">      65 </span>                : #include &lt;bits/stl_move.h&gt;
-<span class="lineNum">      66 </span>                : 
-<span class="lineNum">      67 </span>                : _GLIBCXX_BEGIN_NAMESPACE(std)
-<span class="lineNum">      68 </span>                : 
-<span class="lineNum">      69 </span>                :   template&lt;typename _RandomAccessIterator, typename _Distance&gt;
-<span class="lineNum">      70 </span>                :     _Distance
-<span class="lineNum">      71 </span>                :     __is_heap_until(_RandomAccessIterator __first, _Distance __n)
-<span class="lineNum">      72 </span>                :     {
-<span class="lineNum">      73 </span>                :       _Distance __parent = 0;
-<span class="lineNum">      74 </span>                :       for (_Distance __child = 1; __child &lt; __n; ++__child)
-<span class="lineNum">      75 </span>                :         {
-<span class="lineNum">      76 </span>                :           if (__first[__parent] &lt; __first[__child])
-<span class="lineNum">      77 </span>                :             return __child;
-<span class="lineNum">      78 </span>                :           if ((__child &amp; 1) == 0)
-<span class="lineNum">      79 </span>                :             ++__parent;
-<span class="lineNum">      80 </span>                :         }
-<span class="lineNum">      81 </span>                :       return __n;
-<span class="lineNum">      82 </span>                :     }
-<span class="lineNum">      83 </span>                : 
-<span class="lineNum">      84 </span>                :   template&lt;typename _RandomAccessIterator, typename _Distance,
-<span class="lineNum">      85 </span>                :            typename _Compare&gt;
-<span class="lineNum">      86 </span>                :     _Distance
-<span class="lineNum">      87 </span>                :     __is_heap_until(_RandomAccessIterator __first, _Distance __n,
-<span class="lineNum">      88 </span>                :                     _Compare __comp)
-<span class="lineNum">      89 </span>                :     {
-<span class="lineNum">      90 </span>                :       _Distance __parent = 0;
-<span class="lineNum">      91 </span>                :       for (_Distance __child = 1; __child &lt; __n; ++__child)
-<span class="lineNum">      92 </span>                :         {
-<span class="lineNum">      93 </span>                :           if (__comp(__first[__parent], __first[__child]))
-<span class="lineNum">      94 </span>                :             return __child;
-<span class="lineNum">      95 </span>                :           if ((__child &amp; 1) == 0)
-<span class="lineNum">      96 </span>                :             ++__parent;
-<span class="lineNum">      97 </span>                :         }
-<span class="lineNum">      98 </span>                :       return __n;
-<span class="lineNum">      99 </span>                :     }
-<span class="lineNum">     100 </span>                : 
-<span class="lineNum">     101 </span>                :   // __is_heap, a predicate testing whether or not a range is a heap.
-<span class="lineNum">     102 </span>                :   // This function is an extension, not part of the C++ standard.
-<span class="lineNum">     103 </span>                :   template&lt;typename _RandomAccessIterator, typename _Distance&gt;
-<span class="lineNum">     104 </span>                :     inline bool
-<span class="lineNum">     105 </span>                :     __is_heap(_RandomAccessIterator __first, _Distance __n)
-<span class="lineNum">     106 </span>                :     { return std::__is_heap_until(__first, __n) == __n; }
-<span class="lineNum">     107 </span>                : 
-<span class="lineNum">     108 </span>                :   template&lt;typename _RandomAccessIterator, typename _Compare,
-<span class="lineNum">     109 </span>                :            typename _Distance&gt;
-<span class="lineNum">     110 </span>                :     inline bool
-<span class="lineNum">     111 </span>                :     __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n)
-<span class="lineNum">     112 </span>                :     { return std::__is_heap_until(__first, __n, __comp) == __n; }
-<span class="lineNum">     113 </span>                : 
-<span class="lineNum">     114 </span>                :   template&lt;typename _RandomAccessIterator&gt;
-<span class="lineNum">     115 </span>                :     inline bool
-<span class="lineNum">     116 </span>                :     __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
-<span class="lineNum">     117 </span>                :     { return std::__is_heap(__first, std::distance(__first, __last)); }
-<span class="lineNum">     118 </span>                : 
-<span class="lineNum">     119 </span>                :   template&lt;typename _RandomAccessIterator, typename _Compare&gt;
-<span class="lineNum">     120 </span>                :     inline bool
-<span class="lineNum">     121 </span>                :     __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
-<span class="lineNum">     122 </span>                :               _Compare __comp)
-<span class="lineNum">     123 </span>                :     { return std::__is_heap(__first, __comp, std::distance(__first, __last)); }
-<span class="lineNum">     124 </span>                : 
-<span class="lineNum">     125 </span>                :   // Heap-manipulation functions: push_heap, pop_heap, make_heap, sort_heap,
-<span class="lineNum">     126 </span>                :   // + is_heap and is_heap_until in C++0x.
-<span class="lineNum">     127 </span>                : 
-<span class="lineNum">     128 </span>                :   template&lt;typename _RandomAccessIterator, typename _Distance, typename _Tp&gt;
-<span class="lineNum">     129 </span>                :     void
-<span class="lineNum">     130 </span>                :     __push_heap(_RandomAccessIterator __first,
-<span class="lineNum">     131 </span><span class="lineNoCov">              0 :                 _Distance __holeIndex, _Distance __topIndex, _Tp __value)</span>
-<span class="lineNum">     132 </span>                :     {
-<span class="lineNum">     133 </span><span class="lineNoCov">              0 :       _Distance __parent = (__holeIndex - 1) / 2;</span>
-<span class="lineNum">     134 </span><span class="lineNoCov">              0 :       while (__holeIndex &gt; __topIndex &amp;&amp; *(__first + __parent) &lt; __value)</span>
-<span class="lineNum">     135 </span>                :         {
-<span class="lineNum">     136 </span><span class="lineNoCov">              0 :           *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first + __parent));</span>
-<span class="lineNum">     137 </span><span class="lineNoCov">              0 :           __holeIndex = __parent;</span>
-<span class="lineNum">     138 </span><span class="lineNoCov">              0 :           __parent = (__holeIndex - 1) / 2;</span>
-<span class="lineNum">     139 </span>                :         }
-<span class="lineNum">     140 </span><span class="lineNoCov">              0 :       *(__first + __holeIndex) = _GLIBCXX_MOVE(__value);</span>
-<span class="lineNum">     141 </span><span class="lineNoCov">              0 :     }</span>
-<span class="lineNum">     142 </span>                : 
-<span class="lineNum">     143 </span>                :   /**
-<span class="lineNum">     144 </span>                :    *  @brief  Push an element onto a heap.
-<span class="lineNum">     145 </span>                :    *  @param  first  Start of heap.
-<span class="lineNum">     146 </span>                :    *  @param  last   End of heap + element.
-<span class="lineNum">     147 </span>                :    *  @ingroup heap
-<span class="lineNum">     148 </span>                :    *
-<span class="lineNum">     149 </span>                :    *  This operation pushes the element at last-1 onto the valid heap over the
-<span class="lineNum">     150 </span>                :    *  range [first,last-1).  After completion, [first,last) is a valid heap.
-<span class="lineNum">     151 </span>                :   */
-<span class="lineNum">     152 </span>                :   template&lt;typename _RandomAccessIterator&gt;
-<span class="lineNum">     153 </span>                :     inline void
-<span class="lineNum">     154 </span>                :     push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
-<span class="lineNum">     155 </span>                :     {
-<span class="lineNum">     156 </span>                :       typedef typename iterator_traits&lt;_RandomAccessIterator&gt;::value_type
-<span class="lineNum">     157 </span>                :           _ValueType;
-<span class="lineNum">     158 </span>                :       typedef typename iterator_traits&lt;_RandomAccessIterator&gt;::difference_type
-<span class="lineNum">     159 </span>                :           _DistanceType;
-<span class="lineNum">     160 </span>                : 
-<span class="lineNum">     161 </span>                :       // concept requirements
-<span class="lineNum">     162 </span>                :       __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept&lt;
-<span class="lineNum">     163 </span>                :             _RandomAccessIterator&gt;)
-<span class="lineNum">     164 </span>                :       __glibcxx_function_requires(_LessThanComparableConcept&lt;_ValueType&gt;)
-<span class="lineNum">     165 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">     166 </span>                :       __glibcxx_requires_heap(__first, __last - 1);
-<span class="lineNum">     167 </span>                : 
-<span class="lineNum">     168 </span>                :       _ValueType __value = _GLIBCXX_MOVE(*(__last - 1));
-<span class="lineNum">     169 </span>                :       std::__push_heap(__first, _DistanceType((__last - __first) - 1),
-<span class="lineNum">     170 </span>                :                        _DistanceType(0), _GLIBCXX_MOVE(__value));
-<span class="lineNum">     171 </span>                :     }
-<span class="lineNum">     172 </span>                : 
-<span class="lineNum">     173 </span>                :   template&lt;typename _RandomAccessIterator, typename _Distance, typename _Tp,
-<span class="lineNum">     174 </span>                :            typename _Compare&gt;
-<span class="lineNum">     175 </span>                :     void
-<span class="lineNum">     176 </span>                :     __push_heap(_RandomAccessIterator __first, _Distance __holeIndex,
-<span class="lineNum">     177 </span><span class="lineNoCov">              0 :                 _Distance __topIndex, _Tp __value, _Compare __comp)</span>
-<span class="lineNum">     178 </span>                :     {
-<span class="lineNum">     179 </span><span class="lineNoCov">              0 :       _Distance __parent = (__holeIndex - 1) / 2;</span>
-<span class="lineNum">     180 </span><span class="lineNoCov">              0 :       while (__holeIndex &gt; __topIndex</span>
-<span class="lineNum">     181 </span>                :              &amp;&amp; __comp(*(__first + __parent), __value))
-<span class="lineNum">     182 </span>                :         {
-<span class="lineNum">     183 </span><span class="lineNoCov">              0 :           *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first + __parent));</span>
-<span class="lineNum">     184 </span><span class="lineNoCov">              0 :           __holeIndex = __parent;</span>
-<span class="lineNum">     185 </span><span class="lineNoCov">              0 :           __parent = (__holeIndex - 1) / 2;</span>
-<span class="lineNum">     186 </span>                :         }
-<span class="lineNum">     187 </span><span class="lineNoCov">              0 :       *(__first + __holeIndex) = _GLIBCXX_MOVE(__value);</span>
-<span class="lineNum">     188 </span><span class="lineNoCov">              0 :     }</span>
-<span class="lineNum">     189 </span>                : 
-<span class="lineNum">     190 </span>                :   /**
-<span class="lineNum">     191 </span>                :    *  @brief  Push an element onto a heap using comparison functor.
-<span class="lineNum">     192 </span>                :    *  @param  first  Start of heap.
-<span class="lineNum">     193 </span>                :    *  @param  last   End of heap + element.
-<span class="lineNum">     194 </span>                :    *  @param  comp   Comparison functor.
-<span class="lineNum">     195 </span>                :    *  @ingroup heap
-<span class="lineNum">     196 </span>                :    *
-<span class="lineNum">     197 </span>                :    *  This operation pushes the element at last-1 onto the valid heap over the
-<span class="lineNum">     198 </span>                :    *  range [first,last-1).  After completion, [first,last) is a valid heap.
-<span class="lineNum">     199 </span>                :    *  Compare operations are performed using comp.
-<span class="lineNum">     200 </span>                :   */
-<span class="lineNum">     201 </span>                :   template&lt;typename _RandomAccessIterator, typename _Compare&gt;
-<span class="lineNum">     202 </span>                :     inline void
-<span class="lineNum">     203 </span>                :     push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
-<span class="lineNum">     204 </span>                :               _Compare __comp)
-<span class="lineNum">     205 </span>                :     {
-<span class="lineNum">     206 </span>                :       typedef typename iterator_traits&lt;_RandomAccessIterator&gt;::value_type
-<span class="lineNum">     207 </span>                :           _ValueType;
-<span class="lineNum">     208 </span>                :       typedef typename iterator_traits&lt;_RandomAccessIterator&gt;::difference_type
-<span class="lineNum">     209 </span>                :           _DistanceType;
-<span class="lineNum">     210 </span>                : 
-<span class="lineNum">     211 </span>                :       // concept requirements
-<span class="lineNum">     212 </span>                :       __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept&lt;
-<span class="lineNum">     213 </span>                :             _RandomAccessIterator&gt;)
-<span class="lineNum">     214 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">     215 </span>                :       __glibcxx_requires_heap_pred(__first, __last - 1, __comp);
-<span class="lineNum">     216 </span>                : 
-<span class="lineNum">     217 </span>                :       _ValueType __value = _GLIBCXX_MOVE(*(__last - 1));
-<span class="lineNum">     218 </span>                :       std::__push_heap(__first, _DistanceType((__last - __first) - 1),
-<span class="lineNum">     219 </span>                :                        _DistanceType(0), _GLIBCXX_MOVE(__value), __comp);
-<span class="lineNum">     220 </span>                :     }
-<span class="lineNum">     221 </span>                : 
-<span class="lineNum">     222 </span>                :   template&lt;typename _RandomAccessIterator, typename _Distance, typename _Tp&gt;
-<span class="lineNum">     223 </span>                :     void
-<span class="lineNum">     224 </span>                :     __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
-<span class="lineNum">     225 </span><span class="lineNoCov">              0 :                   _Distance __len, _Tp __value)</span>
-<span class="lineNum">     226 </span>                :     {
-<span class="lineNum">     227 </span><span class="lineNoCov">              0 :       const _Distance __topIndex = __holeIndex;</span>
-<span class="lineNum">     228 </span><span class="lineNoCov">              0 :       _Distance __secondChild = __holeIndex;</span>
-<span class="lineNum">     229 </span><span class="lineNoCov">              0 :       while (__secondChild &lt; (__len - 1) / 2)</span>
-<span class="lineNum">     230 </span>                :         {
-<span class="lineNum">     231 </span><span class="lineNoCov">              0 :           __secondChild = 2 * (__secondChild + 1);</span>
-<span class="lineNum">     232 </span><span class="lineNoCov">              0 :           if (*(__first + __secondChild) &lt; *(__first + (__secondChild - 1)))</span>
-<span class="lineNum">     233 </span><span class="lineNoCov">              0 :             __secondChild--;</span>
-<span class="lineNum">     234 </span><span class="lineNoCov">              0 :           *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first + __secondChild));</span>
-<span class="lineNum">     235 </span><span class="lineNoCov">              0 :           __holeIndex = __secondChild;</span>
-<span class="lineNum">     236 </span>                :         }
-<span class="lineNum">     237 </span><span class="lineNoCov">              0 :       if ((__len &amp; 1) == 0 &amp;&amp; __secondChild == (__len - 2) / 2)</span>
-<span class="lineNum">     238 </span>                :         {
-<span class="lineNum">     239 </span><span class="lineNoCov">              0 :           __secondChild = 2 * (__secondChild + 1);</span>
-<span class="lineNum">     240 </span><span class="lineNoCov">              0 :           *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first</span>
-<span class="lineNum">     241 </span>                :                                                      + (__secondChild - 1)));
-<span class="lineNum">     242 </span><span class="lineNoCov">              0 :           __holeIndex = __secondChild - 1;</span>
-<span class="lineNum">     243 </span>                :         }
-<span class="lineNum">     244 </span><span class="lineNoCov">              0 :       std::__push_heap(__first, __holeIndex, __topIndex,</span>
-<span class="lineNum">     245 </span>                :                        _GLIBCXX_MOVE(__value));
-<span class="lineNum">     246 </span><span class="lineNoCov">              0 :     }</span>
-<span class="lineNum">     247 </span>                : 
-<span class="lineNum">     248 </span>                :   template&lt;typename _RandomAccessIterator&gt;
-<span class="lineNum">     249 </span>                :     inline void
-<span class="lineNum">     250 </span>                :     __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
-<span class="lineNum">     251 </span><span class="lineNoCov">              0 :                _RandomAccessIterator __result)</span>
-<span class="lineNum">     252 </span>                :     {
-<span class="lineNum">     253 </span>                :       typedef typename iterator_traits&lt;_RandomAccessIterator&gt;::value_type
-<span class="lineNum">     254 </span>                :         _ValueType;
-<span class="lineNum">     255 </span>                :       typedef typename iterator_traits&lt;_RandomAccessIterator&gt;::difference_type
-<span class="lineNum">     256 </span>                :         _DistanceType;
-<span class="lineNum">     257 </span>                : 
-<span class="lineNum">     258 </span><span class="lineNoCov">              0 :       _ValueType __value = _GLIBCXX_MOVE(*__result);</span>
-<span class="lineNum">     259 </span><span class="lineNoCov">              0 :       *__result = _GLIBCXX_MOVE(*__first);</span>
-<span class="lineNum">     260 </span><span class="lineNoCov">              0 :       std::__adjust_heap(__first, _DistanceType(0),</span>
-<span class="lineNum">     261 </span>                :                          _DistanceType(__last - __first),
-<span class="lineNum">     262 </span>                :                          _GLIBCXX_MOVE(__value));
-<span class="lineNum">     263 </span><span class="lineNoCov">              0 :     }</span>
-<span class="lineNum">     264 </span>                : 
-<span class="lineNum">     265 </span>                :   /**
-<span class="lineNum">     266 </span>                :    *  @brief  Pop an element off a heap.
-<span class="lineNum">     267 </span>                :    *  @param  first  Start of heap.
-<span class="lineNum">     268 </span>                :    *  @param  last   End of heap.
-<span class="lineNum">     269 </span>                :    *  @ingroup heap
-<span class="lineNum">     270 </span>                :    *
-<span class="lineNum">     271 </span>                :    *  This operation pops the top of the heap.  The elements first and last-1
-<span class="lineNum">     272 </span>                :    *  are swapped and [first,last-1) is made into a heap.
-<span class="lineNum">     273 </span>                :   */
-<span class="lineNum">     274 </span>                :   template&lt;typename _RandomAccessIterator&gt;
-<span class="lineNum">     275 </span>                :     inline void
-<span class="lineNum">     276 </span><span class="lineNoCov">              0 :     pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)</span>
-<span class="lineNum">     277 </span>                :     {
-<span class="lineNum">     278 </span>                :       typedef typename iterator_traits&lt;_RandomAccessIterator&gt;::value_type
-<span class="lineNum">     279 </span>                :         _ValueType;
-<span class="lineNum">     280 </span>                : 
-<span class="lineNum">     281 </span>                :       // concept requirements
-<span class="lineNum">     282 </span>                :       __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept&lt;
-<span class="lineNum">     283 </span>                :             _RandomAccessIterator&gt;)
-<span class="lineNum">     284 </span>                :       __glibcxx_function_requires(_LessThanComparableConcept&lt;_ValueType&gt;)
-<span class="lineNum">     285 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">     286 </span>                :       __glibcxx_requires_heap(__first, __last);
-<span class="lineNum">     287 </span>                : 
-<span class="lineNum">     288 </span><span class="lineNoCov">              0 :       std::__pop_heap(__first, __last - 1, __last - 1);</span>
-<span class="lineNum">     289 </span><span class="lineNoCov">              0 :     }</span>
-<span class="lineNum">     290 </span>                : 
-<span class="lineNum">     291 </span>                :   template&lt;typename _RandomAccessIterator, typename _Distance,
-<span class="lineNum">     292 </span>                :            typename _Tp, typename _Compare&gt;
-<span class="lineNum">     293 </span>                :     void
-<span class="lineNum">     294 </span>                :     __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
-<span class="lineNum">     295 </span><span class="lineNoCov">              0 :                   _Distance __len, _Tp __value, _Compare __comp)</span>
-<span class="lineNum">     296 </span>                :     {
-<span class="lineNum">     297 </span><span class="lineNoCov">              0 :       const _Distance __topIndex = __holeIndex;</span>
-<span class="lineNum">     298 </span><span class="lineNoCov">              0 :       _Distance __secondChild = __holeIndex;</span>
-<span class="lineNum">     299 </span><span class="lineNoCov">              0 :       while (__secondChild &lt; (__len - 1) / 2)</span>
-<span class="lineNum">     300 </span>                :         {
-<span class="lineNum">     301 </span><span class="lineNoCov">              0 :           __secondChild = 2 * (__secondChild + 1);</span>
-<span class="lineNum">     302 </span><span class="lineNoCov">              0 :           if (__comp(*(__first + __secondChild),</span>
-<span class="lineNum">     303 </span>                :                      *(__first + (__secondChild - 1))))
-<span class="lineNum">     304 </span><span class="lineNoCov">              0 :             __secondChild--;</span>
-<span class="lineNum">     305 </span><span class="lineNoCov">              0 :           *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first + __secondChild));</span>
-<span class="lineNum">     306 </span><span class="lineNoCov">              0 :           __holeIndex = __secondChild;</span>
-<span class="lineNum">     307 </span>                :         }
-<span class="lineNum">     308 </span><span class="lineNoCov">              0 :       if ((__len &amp; 1) == 0 &amp;&amp; __secondChild == (__len - 2) / 2)</span>
-<span class="lineNum">     309 </span>                :         {
-<span class="lineNum">     310 </span><span class="lineNoCov">              0 :           __secondChild = 2 * (__secondChild + 1);</span>
-<span class="lineNum">     311 </span><span class="lineNoCov">              0 :           *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first</span>
-<span class="lineNum">     312 </span>                :                                                      + (__secondChild - 1)));
-<span class="lineNum">     313 </span><span class="lineNoCov">              0 :           __holeIndex = __secondChild - 1;</span>
-<span class="lineNum">     314 </span>                :         }
-<span class="lineNum">     315 </span><span class="lineNoCov">              0 :       std::__push_heap(__first, __holeIndex, __topIndex, </span>
-<span class="lineNum">     316 </span>                :                        _GLIBCXX_MOVE(__value), __comp);      
-<span class="lineNum">     317 </span><span class="lineNoCov">              0 :     }</span>
-<span class="lineNum">     318 </span>                : 
-<span class="lineNum">     319 </span>                :   template&lt;typename _RandomAccessIterator, typename _Compare&gt;
-<span class="lineNum">     320 </span>                :     inline void
-<span class="lineNum">     321 </span>                :     __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
-<span class="lineNum">     322 </span><span class="lineNoCov">              0 :                _RandomAccessIterator __result, _Compare __comp)</span>
-<span class="lineNum">     323 </span>                :     {
-<span class="lineNum">     324 </span>                :       typedef typename iterator_traits&lt;_RandomAccessIterator&gt;::value_type
-<span class="lineNum">     325 </span>                :         _ValueType;
-<span class="lineNum">     326 </span>                :       typedef typename iterator_traits&lt;_RandomAccessIterator&gt;::difference_type
-<span class="lineNum">     327 </span>                :         _DistanceType;
-<span class="lineNum">     328 </span>                : 
-<span class="lineNum">     329 </span><span class="lineNoCov">              0 :       _ValueType __value = _GLIBCXX_MOVE(*__result);</span>
-<span class="lineNum">     330 </span><span class="lineNoCov">              0 :       *__result = _GLIBCXX_MOVE(*__first);</span>
-<span class="lineNum">     331 </span><span class="lineNoCov">              0 :       std::__adjust_heap(__first, _DistanceType(0),</span>
-<span class="lineNum">     332 </span>                :                          _DistanceType(__last - __first),
-<span class="lineNum">     333 </span>                :                          _GLIBCXX_MOVE(__value), __comp);
-<span class="lineNum">     334 </span><span class="lineNoCov">              0 :     }</span>
-<span class="lineNum">     335 </span>                : 
-<span class="lineNum">     336 </span>                :   /**
-<span class="lineNum">     337 </span>                :    *  @brief  Pop an element off a heap using comparison functor.
-<span class="lineNum">     338 </span>                :    *  @param  first  Start of heap.
-<span class="lineNum">     339 </span>                :    *  @param  last   End of heap.
-<span class="lineNum">     340 </span>                :    *  @param  comp   Comparison functor to use.
-<span class="lineNum">     341 </span>                :    *  @ingroup heap
-<span class="lineNum">     342 </span>                :    *
-<span class="lineNum">     343 </span>                :    *  This operation pops the top of the heap.  The elements first and last-1
-<span class="lineNum">     344 </span>                :    *  are swapped and [first,last-1) is made into a heap.  Comparisons are
-<span class="lineNum">     345 </span>                :    *  made using comp.
-<span class="lineNum">     346 </span>                :   */
-<span class="lineNum">     347 </span>                :   template&lt;typename _RandomAccessIterator, typename _Compare&gt;
-<span class="lineNum">     348 </span>                :     inline void
-<span class="lineNum">     349 </span>                :     pop_heap(_RandomAccessIterator __first,
-<span class="lineNum">     350 </span><span class="lineNoCov">              0 :              _RandomAccessIterator __last, _Compare __comp)</span>
-<span class="lineNum">     351 </span>                :     {
-<span class="lineNum">     352 </span>                :       // concept requirements
-<span class="lineNum">     353 </span>                :       __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept&lt;
-<span class="lineNum">     354 </span>                :             _RandomAccessIterator&gt;)
-<span class="lineNum">     355 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">     356 </span>                :       __glibcxx_requires_heap_pred(__first, __last, __comp);
-<span class="lineNum">     357 </span>                : 
-<span class="lineNum">     358 </span><span class="lineNoCov">              0 :       std::__pop_heap(__first, __last - 1, __last - 1, __comp);</span>
-<span class="lineNum">     359 </span><span class="lineNoCov">              0 :     }</span>
-<span class="lineNum">     360 </span>                : 
-<span class="lineNum">     361 </span>                :   /**
-<span class="lineNum">     362 </span>                :    *  @brief  Construct a heap over a range.
-<span class="lineNum">     363 </span>                :    *  @param  first  Start of heap.
-<span class="lineNum">     364 </span>                :    *  @param  last   End of heap.
-<span class="lineNum">     365 </span>                :    *  @ingroup heap
-<span class="lineNum">     366 </span>                :    *
-<span class="lineNum">     367 </span>                :    *  This operation makes the elements in [first,last) into a heap.
-<span class="lineNum">     368 </span>                :   */
-<span class="lineNum">     369 </span>                :   template&lt;typename _RandomAccessIterator&gt;
-<span class="lineNum">     370 </span>                :     void
-<span class="lineNum">     371 </span><span class="lineNoCov">              0 :     make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)</span>
-<span class="lineNum">     372 </span>                :     {
-<span class="lineNum">     373 </span>                :       typedef typename iterator_traits&lt;_RandomAccessIterator&gt;::value_type
-<span class="lineNum">     374 </span>                :           _ValueType;
-<span class="lineNum">     375 </span>                :       typedef typename iterator_traits&lt;_RandomAccessIterator&gt;::difference_type
-<span class="lineNum">     376 </span>                :           _DistanceType;
-<span class="lineNum">     377 </span>                : 
-<span class="lineNum">     378 </span>                :       // concept requirements
-<span class="lineNum">     379 </span>                :       __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept&lt;
-<span class="lineNum">     380 </span>                :             _RandomAccessIterator&gt;)
-<span class="lineNum">     381 </span>                :       __glibcxx_function_requires(_LessThanComparableConcept&lt;_ValueType&gt;)
-<span class="lineNum">     382 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">     383 </span>                : 
-<span class="lineNum">     384 </span><span class="lineNoCov">              0 :       if (__last - __first &lt; 2)</span>
-<span class="lineNum">     385 </span><span class="lineNoCov">              0 :         return;</span>
-<span class="lineNum">     386 </span>                : 
-<span class="lineNum">     387 </span><span class="lineNoCov">              0 :       const _DistanceType __len = __last - __first;</span>
-<span class="lineNum">     388 </span><span class="lineNoCov">              0 :       _DistanceType __parent = (__len - 2) / 2;</span>
-<span class="lineNum">     389 </span><span class="lineNoCov">              0 :       while (true)</span>
-<span class="lineNum">     390 </span>                :         {
-<span class="lineNum">     391 </span><span class="lineNoCov">              0 :           _ValueType __value = _GLIBCXX_MOVE(*(__first + __parent));</span>
-<span class="lineNum">     392 </span><span class="lineNoCov">              0 :           std::__adjust_heap(__first, __parent, __len, _GLIBCXX_MOVE(__value));</span>
-<span class="lineNum">     393 </span><span class="lineNoCov">              0 :           if (__parent == 0)</span>
-<span class="lineNum">     394 </span><span class="lineNoCov">              0 :             return;</span>
-<span class="lineNum">     395 </span><span class="lineNoCov">              0 :           __parent--;</span>
-<span class="lineNum">     396 </span>                :         }
-<span class="lineNum">     397 </span>                :     }
-<span class="lineNum">     398 </span>                : 
-<span class="lineNum">     399 </span>                :   /**
-<span class="lineNum">     400 </span>                :    *  @brief  Construct a heap over a range using comparison functor.
-<span class="lineNum">     401 </span>                :    *  @param  first  Start of heap.
-<span class="lineNum">     402 </span>                :    *  @param  last   End of heap.
-<span class="lineNum">     403 </span>                :    *  @param  comp   Comparison functor to use.
-<span class="lineNum">     404 </span>                :    *  @ingroup heap
-<span class="lineNum">     405 </span>                :    *
-<span class="lineNum">     406 </span>                :    *  This operation makes the elements in [first,last) into a heap.
-<span class="lineNum">     407 </span>                :    *  Comparisons are made using comp.
-<span class="lineNum">     408 </span>                :   */
-<span class="lineNum">     409 </span>                :   template&lt;typename _RandomAccessIterator, typename _Compare&gt;
-<span class="lineNum">     410 </span>                :     void
-<span class="lineNum">     411 </span>                :     make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
-<span class="lineNum">     412 </span><span class="lineNoCov">              0 :               _Compare __comp)</span>
-<span class="lineNum">     413 </span>                :     {
-<span class="lineNum">     414 </span>                :       typedef typename iterator_traits&lt;_RandomAccessIterator&gt;::value_type
-<span class="lineNum">     415 </span>                :           _ValueType;
-<span class="lineNum">     416 </span>                :       typedef typename iterator_traits&lt;_RandomAccessIterator&gt;::difference_type
-<span class="lineNum">     417 </span>                :           _DistanceType;
-<span class="lineNum">     418 </span>                : 
-<span class="lineNum">     419 </span>                :       // concept requirements
-<span class="lineNum">     420 </span>                :       __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept&lt;
-<span class="lineNum">     421 </span>                :             _RandomAccessIterator&gt;)
-<span class="lineNum">     422 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">     423 </span>                : 
-<span class="lineNum">     424 </span><span class="lineNoCov">              0 :       if (__last - __first &lt; 2)</span>
-<span class="lineNum">     425 </span><span class="lineNoCov">              0 :         return;</span>
-<span class="lineNum">     426 </span>                : 
-<span class="lineNum">     427 </span><span class="lineNoCov">              0 :       const _DistanceType __len = __last - __first;</span>
-<span class="lineNum">     428 </span><span class="lineNoCov">              0 :       _DistanceType __parent = (__len - 2) / 2;</span>
-<span class="lineNum">     429 </span><span class="lineNoCov">              0 :       while (true)</span>
-<span class="lineNum">     430 </span>                :         {
-<span class="lineNum">     431 </span><span class="lineNoCov">              0 :           _ValueType __value = _GLIBCXX_MOVE(*(__first + __parent));</span>
-<span class="lineNum">     432 </span><span class="lineNoCov">              0 :           std::__adjust_heap(__first, __parent, __len, _GLIBCXX_MOVE(__value),</span>
-<span class="lineNum">     433 </span>                :                              __comp);
-<span class="lineNum">     434 </span><span class="lineNoCov">              0 :           if (__parent == 0)</span>
-<span class="lineNum">     435 </span><span class="lineNoCov">              0 :             return;</span>
-<span class="lineNum">     436 </span><span class="lineNoCov">              0 :           __parent--;</span>
-<span class="lineNum">     437 </span>                :         }
-<span class="lineNum">     438 </span>                :     }
-<span class="lineNum">     439 </span>                : 
-<span class="lineNum">     440 </span>                :   /**
-<span class="lineNum">     441 </span>                :    *  @brief  Sort a heap.
-<span class="lineNum">     442 </span>                :    *  @param  first  Start of heap.
-<span class="lineNum">     443 </span>                :    *  @param  last   End of heap.
-<span class="lineNum">     444 </span>                :    *  @ingroup heap
-<span class="lineNum">     445 </span>                :    *
-<span class="lineNum">     446 </span>                :    *  This operation sorts the valid heap in the range [first,last).
-<span class="lineNum">     447 </span>                :   */
-<span class="lineNum">     448 </span>                :   template&lt;typename _RandomAccessIterator&gt;
-<span class="lineNum">     449 </span>                :     void
-<span class="lineNum">     450 </span><span class="lineNoCov">              0 :     sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)</span>
-<span class="lineNum">     451 </span>                :     {
-<span class="lineNum">     452 </span>                :       // concept requirements
-<span class="lineNum">     453 </span>                :       __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept&lt;
-<span class="lineNum">     454 </span>                :             _RandomAccessIterator&gt;)
-<span class="lineNum">     455 </span>                :       __glibcxx_function_requires(_LessThanComparableConcept&lt;
-<span class="lineNum">     456 </span>                :             typename iterator_traits&lt;_RandomAccessIterator&gt;::value_type&gt;)
-<span class="lineNum">     457 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">     458 </span>                :       __glibcxx_requires_heap(__first, __last);
-<span class="lineNum">     459 </span>                : 
-<span class="lineNum">     460 </span><span class="lineNoCov">              0 :       while (__last - __first &gt; 1)</span>
-<span class="lineNum">     461 </span><span class="lineNoCov">              0 :         std::pop_heap(__first, _RandomAccessIterator(__last--));</span>
-<span class="lineNum">     462 </span><span class="lineNoCov">              0 :     }</span>
-<span class="lineNum">     463 </span>                : 
-<span class="lineNum">     464 </span>                :   /**
-<span class="lineNum">     465 </span>                :    *  @brief  Sort a heap using comparison functor.
-<span class="lineNum">     466 </span>                :    *  @param  first  Start of heap.
-<span class="lineNum">     467 </span>                :    *  @param  last   End of heap.
-<span class="lineNum">     468 </span>                :    *  @param  comp   Comparison functor to use.
-<span class="lineNum">     469 </span>                :    *  @ingroup heap
-<span class="lineNum">     470 </span>                :    *
-<span class="lineNum">     471 </span>                :    *  This operation sorts the valid heap in the range [first,last).
-<span class="lineNum">     472 </span>                :    *  Comparisons are made using comp.
-<span class="lineNum">     473 </span>                :   */
-<span class="lineNum">     474 </span>                :   template&lt;typename _RandomAccessIterator, typename _Compare&gt;
-<span class="lineNum">     475 </span>                :     void
-<span class="lineNum">     476 </span>                :     sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
-<span class="lineNum">     477 </span><span class="lineNoCov">              0 :               _Compare __comp)</span>
-<span class="lineNum">     478 </span>                :     {
-<span class="lineNum">     479 </span>                :       // concept requirements
-<span class="lineNum">     480 </span>                :       __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept&lt;
-<span class="lineNum">     481 </span>                :             _RandomAccessIterator&gt;)
-<span class="lineNum">     482 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">     483 </span>                :       __glibcxx_requires_heap_pred(__first, __last, __comp);
-<span class="lineNum">     484 </span>                : 
-<span class="lineNum">     485 </span><span class="lineNoCov">              0 :       while (__last - __first &gt; 1)</span>
-<span class="lineNum">     486 </span><span class="lineNoCov">              0 :         std::pop_heap(__first, _RandomAccessIterator(__last--), __comp);</span>
-<span class="lineNum">     487 </span><span class="lineNoCov">              0 :     }</span>
-<span class="lineNum">     488 </span>                : 
-<span class="lineNum">     489 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     490 </span>                :   /**
-<span class="lineNum">     491 </span>                :    *  @brief  Search the end of a heap.
-<span class="lineNum">     492 </span>                :    *  @param  first  Start of range.
-<span class="lineNum">     493 </span>                :    *  @param  last   End of range.
-<span class="lineNum">     494 </span>                :    *  @return  An iterator pointing to the first element not in the heap.
-<span class="lineNum">     495 </span>                :    *  @ingroup heap
-<span class="lineNum">     496 </span>                :    *
-<span class="lineNum">     497 </span>                :    *  This operation returns the last iterator i in [first, last) for which
-<span class="lineNum">     498 </span>                :    *  the range [first, i) is a heap.
-<span class="lineNum">     499 </span>                :   */
-<span class="lineNum">     500 </span>                :   template&lt;typename _RandomAccessIterator&gt;
-<span class="lineNum">     501 </span>                :     inline _RandomAccessIterator
-<span class="lineNum">     502 </span>                :     is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last)
-<span class="lineNum">     503 </span>                :     {
-<span class="lineNum">     504 </span>                :       // concept requirements
-<span class="lineNum">     505 </span>                :       __glibcxx_function_requires(_RandomAccessIteratorConcept&lt;
-<span class="lineNum">     506 </span>                :             _RandomAccessIterator&gt;)
-<span class="lineNum">     507 </span>                :       __glibcxx_function_requires(_LessThanComparableConcept&lt;
-<span class="lineNum">     508 </span>                :             typename iterator_traits&lt;_RandomAccessIterator&gt;::value_type&gt;)
-<span class="lineNum">     509 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">     510 </span>                : 
-<span class="lineNum">     511 </span>                :       return __first + std::__is_heap_until(__first, std::distance(__first,
-<span class="lineNum">     512 </span>                :                                                                    __last));
-<span class="lineNum">     513 </span>                :     }
-<span class="lineNum">     514 </span>                : 
-<span class="lineNum">     515 </span>                :   /**
-<span class="lineNum">     516 </span>                :    *  @brief  Search the end of a heap using comparison functor.
-<span class="lineNum">     517 </span>                :    *  @param  first  Start of range.
-<span class="lineNum">     518 </span>                :    *  @param  last   End of range.
-<span class="lineNum">     519 </span>                :    *  @param  comp   Comparison functor to use.
-<span class="lineNum">     520 </span>                :    *  @return  An iterator pointing to the first element not in the heap.
-<span class="lineNum">     521 </span>                :    *  @ingroup heap
-<span class="lineNum">     522 </span>                :    *
-<span class="lineNum">     523 </span>                :    *  This operation returns the last iterator i in [first, last) for which
-<span class="lineNum">     524 </span>                :    *  the range [first, i) is a heap.  Comparisons are made using comp.
-<span class="lineNum">     525 </span>                :   */
-<span class="lineNum">     526 </span>                :   template&lt;typename _RandomAccessIterator, typename _Compare&gt;
-<span class="lineNum">     527 </span>                :     inline _RandomAccessIterator
-<span class="lineNum">     528 </span>                :     is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last,
-<span class="lineNum">     529 </span>                :                   _Compare __comp)
-<span class="lineNum">     530 </span>                :     {
-<span class="lineNum">     531 </span>                :       // concept requirements
-<span class="lineNum">     532 </span>                :       __glibcxx_function_requires(_RandomAccessIteratorConcept&lt;
-<span class="lineNum">     533 </span>                :             _RandomAccessIterator&gt;)
-<span class="lineNum">     534 </span>                :       __glibcxx_requires_valid_range(__first, __last);
-<span class="lineNum">     535 </span>                : 
-<span class="lineNum">     536 </span>                :       return __first + std::__is_heap_until(__first, std::distance(__first,
-<span class="lineNum">     537 </span>                :                                                                    __last),
-<span class="lineNum">     538 </span>                :                                             __comp);
-<span class="lineNum">     539 </span>                :     }
-<span class="lineNum">     540 </span>                : 
-<span class="lineNum">     541 </span>                :   /**
-<span class="lineNum">     542 </span>                :    *  @brief  Determines whether a range is a heap.
-<span class="lineNum">     543 </span>                :    *  @param  first  Start of range.
-<span class="lineNum">     544 </span>                :    *  @param  last   End of range.
-<span class="lineNum">     545 </span>                :    *  @return  True if range is a heap, false otherwise.
-<span class="lineNum">     546 </span>                :    *  @ingroup heap
-<span class="lineNum">     547 </span>                :   */
-<span class="lineNum">     548 </span>                :   template&lt;typename _RandomAccessIterator&gt;
-<span class="lineNum">     549 </span>                :     inline bool
-<span class="lineNum">     550 </span>                :     is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
-<span class="lineNum">     551 </span>                :     { return std::is_heap_until(__first, __last) == __last; }
-<span class="lineNum">     552 </span>                : 
-<span class="lineNum">     553 </span>                :   /**
-<span class="lineNum">     554 </span>                :    *  @brief  Determines whether a range is a heap using comparison functor.
-<span class="lineNum">     555 </span>                :    *  @param  first  Start of range.
-<span class="lineNum">     556 </span>                :    *  @param  last   End of range.
-<span class="lineNum">     557 </span>                :    *  @param  comp   Comparison functor to use.
-<span class="lineNum">     558 </span>                :    *  @return  True if range is a heap, false otherwise.
-<span class="lineNum">     559 </span>                :    *  @ingroup heap
-<span class="lineNum">     560 </span>                :   */
-<span class="lineNum">     561 </span>                :   template&lt;typename _RandomAccessIterator, typename _Compare&gt;
-<span class="lineNum">     562 </span>                :     inline bool
-<span class="lineNum">     563 </span>                :     is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
-<span class="lineNum">     564 </span>                :             _Compare __comp)
-<span class="lineNum">     565 </span>                :     { return std::is_heap_until(__first, __last, __comp) == __last; }
-<span class="lineNum">     566 </span>                : #endif
-<span class="lineNum">     567 </span>                : 
-<span class="lineNum">     568 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">     569 </span>                : 
-<span class="lineNum">     570 </span>                : #endif /* _STL_HEAP_H */
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/bits/stl_iterator.h.gcov.html b/rep/usr/include/c++/4.3/bits/stl_iterator.h.gcov.html
deleted file mode 100644
index 20e1312..0000000
--- a/rep/usr/include/c++/4.3/bits/stl_iterator.h.gcov.html
+++ /dev/null
@@ -1,1095 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_iterator.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_iterator.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">66</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">93.9 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">62</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // Iterators -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
-<span class="lineNum">       4 </span>                : // Free Software Foundation, Inc.
-<span class="lineNum">       5 </span>                : //
-<span class="lineNum">       6 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       7 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       8 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">       9 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      10 </span>                : // any later version.
-<span class="lineNum">      11 </span>                : 
-<span class="lineNum">      12 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      13 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      14 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      15 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      16 </span>                : 
-<span class="lineNum">      17 </span>                : // You should have received a copy of the GNU General Public License along
-<span class="lineNum">      18 </span>                : // with this library; see the file COPYING.  If not, write to the Free
-<span class="lineNum">      19 </span>                : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-<span class="lineNum">      20 </span>                : // USA.
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      23 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      24 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      25 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      26 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      27 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      28 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      29 </span>                : // the GNU General Public License.
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : /*
-<span class="lineNum">      32 </span>                :  *
-<span class="lineNum">      33 </span>                :  * Copyright (c) 1994
-<span class="lineNum">      34 </span>                :  * Hewlett-Packard Company
-<span class="lineNum">      35 </span>                :  *
-<span class="lineNum">      36 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      37 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      38 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      39 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      40 </span>                :  * in supporting documentation.  Hewlett-Packard Company makes no
-<span class="lineNum">      41 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      42 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      43 </span>                :  *
-<span class="lineNum">      44 </span>                :  *
-<span class="lineNum">      45 </span>                :  * Copyright (c) 1996-1998
-<span class="lineNum">      46 </span>                :  * Silicon Graphics Computer Systems, Inc.
-<span class="lineNum">      47 </span>                :  *
-<span class="lineNum">      48 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      49 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      50 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      51 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      52 </span>                :  * in supporting documentation.  Silicon Graphics makes no
-<span class="lineNum">      53 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      54 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      55 </span>                :  */
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span>                : /** @file stl_iterator.h
-<span class="lineNum">      58 </span>                :  *  This is an internal header file, included by other library headers.
-<span class="lineNum">      59 </span>                :  *  You should not attempt to use it directly.
-<span class="lineNum">      60 </span>                :  *
-<span class="lineNum">      61 </span>                :  *  This file implements reverse_iterator, back_insert_iterator,
-<span class="lineNum">      62 </span>                :  *  front_insert_iterator, insert_iterator, __normal_iterator, and their
-<span class="lineNum">      63 </span>                :  *  supporting functions and overloaded operators.
-<span class="lineNum">      64 </span>                :  */
-<span class="lineNum">      65 </span>                : 
-<span class="lineNum">      66 </span>                : #ifndef _STL_ITERATOR_H
-<span class="lineNum">      67 </span>                : #define _STL_ITERATOR_H 1
-<span class="lineNum">      68 </span>                : 
-<span class="lineNum">      69 </span>                : #include &lt;bits/cpp_type_traits.h&gt;
-<span class="lineNum">      70 </span>                : #include &lt;ext/type_traits.h&gt;
-<span class="lineNum">      71 </span>                : #include &lt;bits/stl_move.h&gt;
-<span class="lineNum">      72 </span>                : 
-<span class="lineNum">      73 </span>                : _GLIBCXX_BEGIN_NAMESPACE(std)
-<span class="lineNum">      74 </span>                : 
-<span class="lineNum">      75 </span>                :   // 24.4.1 Reverse iterators
-<span class="lineNum">      76 </span>                :   /**
-<span class="lineNum">      77 </span>                :    *  &quot;Bidirectional and random access iterators have corresponding reverse
-<span class="lineNum">      78 </span>                :    *  %iterator adaptors that iterate through the data structure in the
-<span class="lineNum">      79 </span>                :    *  opposite direction.  They have the same signatures as the corresponding
-<span class="lineNum">      80 </span>                :    *  iterators.  The fundamental relation between a reverse %iterator and its
-<span class="lineNum">      81 </span>                :    *  corresponding %iterator @c i is established by the identity:
-<span class="lineNum">      82 </span>                :    *  @code
-<span class="lineNum">      83 </span>                :    *      &amp;*(reverse_iterator(i)) == &amp;*(i - 1)
-<span class="lineNum">      84 </span>                :    *  @endcode
-<span class="lineNum">      85 </span>                :    *
-<span class="lineNum">      86 </span>                :    *  This mapping is dictated by the fact that while there is always a
-<span class="lineNum">      87 </span>                :    *  pointer past the end of an array, there might not be a valid pointer
-<span class="lineNum">      88 </span>                :    *  before the beginning of an array.&quot; [24.4.1]/1,2
-<span class="lineNum">      89 </span>                :    *
-<span class="lineNum">      90 </span>                :    *  Reverse iterators can be tricky and surprising at first.  Their
-<span class="lineNum">      91 </span>                :    *  semantics make sense, however, and the trickiness is a side effect of
-<span class="lineNum">      92 </span>                :    *  the requirement that the iterators must be safe.
-<span class="lineNum">      93 </span>                :   */
-<span class="lineNum">      94 </span>                :   template&lt;typename _Iterator&gt;
-<span class="lineNum">      95 </span>                :     class reverse_iterator
-<span class="lineNum">      96 </span>                :     : public iterator&lt;typename iterator_traits&lt;_Iterator&gt;::iterator_category,
-<span class="lineNum">      97 </span>                :                       typename iterator_traits&lt;_Iterator&gt;::value_type,
-<span class="lineNum">      98 </span>                :                       typename iterator_traits&lt;_Iterator&gt;::difference_type,
-<span class="lineNum">      99 </span>                :                       typename iterator_traits&lt;_Iterator&gt;::pointer,
-<span class="lineNum">     100 </span>                :                       typename iterator_traits&lt;_Iterator&gt;::reference&gt;
-<span class="lineNum">     101 </span>                :     {
-<span class="lineNum">     102 </span>                :     protected:
-<span class="lineNum">     103 </span>                :       _Iterator current;
-<span class="lineNum">     104 </span>                : 
-<span class="lineNum">     105 </span>                :     public:
-<span class="lineNum">     106 </span>                :       typedef _Iterator                                        iterator_type;
-<span class="lineNum">     107 </span>                :       typedef typename iterator_traits&lt;_Iterator&gt;::difference_type
-<span class="lineNum">     108 </span>                :                                                                difference_type;
-<span class="lineNum">     109 </span>                :       typedef typename iterator_traits&lt;_Iterator&gt;::reference   reference;
-<span class="lineNum">     110 </span>                :       typedef typename iterator_traits&lt;_Iterator&gt;::pointer     pointer;
-<span class="lineNum">     111 </span>                : 
-<span class="lineNum">     112 </span>                :     public:
-<span class="lineNum">     113 </span>                :       /**
-<span class="lineNum">     114 </span>                :        *  The default constructor default-initializes member @p current.
-<span class="lineNum">     115 </span>                :        *  If it is a pointer, that means it is zero-initialized.
-<span class="lineNum">     116 </span>                :       */
-<span class="lineNum">     117 </span>                :       // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     118 </span>                :       // 235 No specification of default ctor for reverse_iterator
-<span class="lineNum">     119 </span>                :       reverse_iterator() : current() { }
-<span class="lineNum">     120 </span>                : 
-<span class="lineNum">     121 </span>                :       /**
-<span class="lineNum">     122 </span>                :        *  This %iterator will move in the opposite direction that @p x does.
-<span class="lineNum">     123 </span>                :       */
-<span class="lineNum">     124 </span>                :       explicit
-<span class="lineNum">     125 </span><span class="lineCov">             34 :       reverse_iterator(iterator_type __x) : current(__x) { }</span>
-<span class="lineNum">     126 </span>                : 
-<span class="lineNum">     127 </span>                :       /**
-<span class="lineNum">     128 </span>                :        *  The copy constructor is normal.
-<span class="lineNum">     129 </span>                :       */
-<span class="lineNum">     130 </span>                :       reverse_iterator(const reverse_iterator&amp; __x)
-<span class="lineNum">     131 </span>                :       : current(__x.current) { }
-<span class="lineNum">     132 </span>                : 
-<span class="lineNum">     133 </span>                :       /**
-<span class="lineNum">     134 </span>                :        *  A reverse_iterator across other types can be copied in the normal
-<span class="lineNum">     135 </span>                :        *  fashion.
-<span class="lineNum">     136 </span>                :       */
-<span class="lineNum">     137 </span>                :       template&lt;typename _Iter&gt;
-<span class="lineNum">     138 </span>                :         reverse_iterator(const reverse_iterator&lt;_Iter&gt;&amp; __x)
-<span class="lineNum">     139 </span>                :         : current(__x.base()) { }
-<span class="lineNum">     140 </span>                : 
-<span class="lineNum">     141 </span>                :       /**
-<span class="lineNum">     142 </span>                :        *  @return  @c current, the %iterator used for underlying work.
-<span class="lineNum">     143 </span>                :       */
-<span class="lineNum">     144 </span>                :       iterator_type
-<span class="lineNum">     145 </span>                :       base() const
-<span class="lineNum">     146 </span>                :       { return current; }
-<span class="lineNum">     147 </span>                : 
-<span class="lineNum">     148 </span>                :       /**
-<span class="lineNum">     149 </span>                :        *  @return  TODO
-<span class="lineNum">     150 </span>                :        *
-<span class="lineNum">     151 </span>                :        *  @doctodo
-<span class="lineNum">     152 </span>                :       */
-<span class="lineNum">     153 </span>                :       reference
-<span class="lineNum">     154 </span><span class="lineCov">             34 :       operator*() const</span>
-<span class="lineNum">     155 </span>                :       {
-<span class="lineNum">     156 </span><span class="lineCov">             34 :         _Iterator __tmp = current;</span>
-<span class="lineNum">     157 </span><span class="lineCov">             34 :         return *--__tmp;</span>
-<span class="lineNum">     158 </span>                :       }
-<span class="lineNum">     159 </span>                : 
-<span class="lineNum">     160 </span>                :       /**
-<span class="lineNum">     161 </span>                :        *  @return  TODO
-<span class="lineNum">     162 </span>                :        *
-<span class="lineNum">     163 </span>                :        *  @doctodo
-<span class="lineNum">     164 </span>                :       */
-<span class="lineNum">     165 </span>                :       pointer
-<span class="lineNum">     166 </span><span class="lineCov">             32 :       operator-&gt;() const</span>
-<span class="lineNum">     167 </span><span class="lineCov">             32 :       { return &amp;(operator*()); }</span>
-<span class="lineNum">     168 </span>                : 
-<span class="lineNum">     169 </span>                :       /**
-<span class="lineNum">     170 </span>                :        *  @return  TODO
-<span class="lineNum">     171 </span>                :        *
-<span class="lineNum">     172 </span>                :        *  @doctodo
-<span class="lineNum">     173 </span>                :       */
-<span class="lineNum">     174 </span>                :       reverse_iterator&amp;
-<span class="lineNum">     175 </span>                :       operator++()
-<span class="lineNum">     176 </span>                :       {
-<span class="lineNum">     177 </span>                :         --current;
-<span class="lineNum">     178 </span>                :         return *this;
-<span class="lineNum">     179 </span>                :       }
-<span class="lineNum">     180 </span>                : 
-<span class="lineNum">     181 </span>                :       /**
-<span class="lineNum">     182 </span>                :        *  @return  TODO
-<span class="lineNum">     183 </span>                :        *
-<span class="lineNum">     184 </span>                :        *  @doctodo
-<span class="lineNum">     185 </span>                :       */
-<span class="lineNum">     186 </span>                :       reverse_iterator
-<span class="lineNum">     187 </span>                :       operator++(int)
-<span class="lineNum">     188 </span>                :       {
-<span class="lineNum">     189 </span>                :         reverse_iterator __tmp = *this;
-<span class="lineNum">     190 </span>                :         --current;
-<span class="lineNum">     191 </span>                :         return __tmp;
-<span class="lineNum">     192 </span>                :       }
-<span class="lineNum">     193 </span>                : 
-<span class="lineNum">     194 </span>                :       /**
-<span class="lineNum">     195 </span>                :        *  @return  TODO
-<span class="lineNum">     196 </span>                :        *
-<span class="lineNum">     197 </span>                :        *  @doctodo
-<span class="lineNum">     198 </span>                :       */
-<span class="lineNum">     199 </span>                :       reverse_iterator&amp;
-<span class="lineNum">     200 </span>                :       operator--()
-<span class="lineNum">     201 </span>                :       {
-<span class="lineNum">     202 </span>                :         ++current;
-<span class="lineNum">     203 </span>                :         return *this;
-<span class="lineNum">     204 </span>                :       }
-<span class="lineNum">     205 </span>                : 
-<span class="lineNum">     206 </span>                :       /**
-<span class="lineNum">     207 </span>                :        *  @return  TODO
-<span class="lineNum">     208 </span>                :        *
-<span class="lineNum">     209 </span>                :        *  @doctodo
-<span class="lineNum">     210 </span>                :       */
-<span class="lineNum">     211 </span>                :       reverse_iterator
-<span class="lineNum">     212 </span>                :       operator--(int)
-<span class="lineNum">     213 </span>                :       {
-<span class="lineNum">     214 </span>                :         reverse_iterator __tmp = *this;
-<span class="lineNum">     215 </span>                :         ++current;
-<span class="lineNum">     216 </span>                :         return __tmp;
-<span class="lineNum">     217 </span>                :       }
-<span class="lineNum">     218 </span>                : 
-<span class="lineNum">     219 </span>                :       /**
-<span class="lineNum">     220 </span>                :        *  @return  TODO
-<span class="lineNum">     221 </span>                :        *
-<span class="lineNum">     222 </span>                :        *  @doctodo
-<span class="lineNum">     223 </span>                :       */
-<span class="lineNum">     224 </span>                :       reverse_iterator
-<span class="lineNum">     225 </span>                :       operator+(difference_type __n) const
-<span class="lineNum">     226 </span>                :       { return reverse_iterator(current - __n); }
-<span class="lineNum">     227 </span>                : 
-<span class="lineNum">     228 </span>                :       /**
-<span class="lineNum">     229 </span>                :        *  @return  TODO
-<span class="lineNum">     230 </span>                :        *
-<span class="lineNum">     231 </span>                :        *  @doctodo
-<span class="lineNum">     232 </span>                :       */
-<span class="lineNum">     233 </span>                :       reverse_iterator&amp;
-<span class="lineNum">     234 </span>                :       operator+=(difference_type __n)
-<span class="lineNum">     235 </span>                :       {
-<span class="lineNum">     236 </span>                :         current -= __n;
-<span class="lineNum">     237 </span>                :         return *this;
-<span class="lineNum">     238 </span>                :       }
-<span class="lineNum">     239 </span>                : 
-<span class="lineNum">     240 </span>                :       /**
-<span class="lineNum">     241 </span>                :        *  @return  TODO
-<span class="lineNum">     242 </span>                :        *
-<span class="lineNum">     243 </span>                :        *  @doctodo
-<span class="lineNum">     244 </span>                :       */
-<span class="lineNum">     245 </span>                :       reverse_iterator
-<span class="lineNum">     246 </span>                :       operator-(difference_type __n) const
-<span class="lineNum">     247 </span>                :       { return reverse_iterator(current + __n); }
-<span class="lineNum">     248 </span>                : 
-<span class="lineNum">     249 </span>                :       /**
-<span class="lineNum">     250 </span>                :        *  @return  TODO
-<span class="lineNum">     251 </span>                :        *
-<span class="lineNum">     252 </span>                :        *  @doctodo
-<span class="lineNum">     253 </span>                :       */
-<span class="lineNum">     254 </span>                :       reverse_iterator&amp;
-<span class="lineNum">     255 </span>                :       operator-=(difference_type __n)
-<span class="lineNum">     256 </span>                :       {
-<span class="lineNum">     257 </span>                :         current += __n;
-<span class="lineNum">     258 </span>                :         return *this;
-<span class="lineNum">     259 </span>                :       }
-<span class="lineNum">     260 </span>                : 
-<span class="lineNum">     261 </span>                :       /**
-<span class="lineNum">     262 </span>                :        *  @return  TODO
-<span class="lineNum">     263 </span>                :        *
-<span class="lineNum">     264 </span>                :        *  @doctodo
-<span class="lineNum">     265 </span>                :       */
-<span class="lineNum">     266 </span>                :       reference
-<span class="lineNum">     267 </span>                :       operator[](difference_type __n) const
-<span class="lineNum">     268 </span>                :       { return *(*this + __n); }
-<span class="lineNum">     269 </span>                :     };
-<span class="lineNum">     270 </span>                : 
-<span class="lineNum">     271 </span>                :   //@{
-<span class="lineNum">     272 </span>                :   /**
-<span class="lineNum">     273 </span>                :    *  @param  x  A %reverse_iterator.
-<span class="lineNum">     274 </span>                :    *  @param  y  A %reverse_iterator.
-<span class="lineNum">     275 </span>                :    *  @return  A simple bool.
-<span class="lineNum">     276 </span>                :    *
-<span class="lineNum">     277 </span>                :    *  Reverse iterators forward many operations to their underlying base()
-<span class="lineNum">     278 </span>                :    *  iterators.  Others are implemented in terms of one another.
-<span class="lineNum">     279 </span>                :    *
-<span class="lineNum">     280 </span>                :   */
-<span class="lineNum">     281 </span>                :   template&lt;typename _Iterator&gt;
-<span class="lineNum">     282 </span>                :     inline bool
-<span class="lineNum">     283 </span>                :     operator==(const reverse_iterator&lt;_Iterator&gt;&amp; __x,
-<span class="lineNum">     284 </span>                :                const reverse_iterator&lt;_Iterator&gt;&amp; __y)
-<span class="lineNum">     285 </span>                :     { return __x.base() == __y.base(); }
-<span class="lineNum">     286 </span>                : 
-<span class="lineNum">     287 </span>                :   template&lt;typename _Iterator&gt;
-<span class="lineNum">     288 </span>                :     inline bool
-<span class="lineNum">     289 </span>                :     operator&lt;(const reverse_iterator&lt;_Iterator&gt;&amp; __x,
-<span class="lineNum">     290 </span>                :               const reverse_iterator&lt;_Iterator&gt;&amp; __y)
-<span class="lineNum">     291 </span>                :     { return __y.base() &lt; __x.base(); }
-<span class="lineNum">     292 </span>                : 
-<span class="lineNum">     293 </span>                :   template&lt;typename _Iterator&gt;
-<span class="lineNum">     294 </span>                :     inline bool
-<span class="lineNum">     295 </span>                :     operator!=(const reverse_iterator&lt;_Iterator&gt;&amp; __x,
-<span class="lineNum">     296 </span>                :                const reverse_iterator&lt;_Iterator&gt;&amp; __y)
-<span class="lineNum">     297 </span>                :     { return !(__x == __y); }
-<span class="lineNum">     298 </span>                : 
-<span class="lineNum">     299 </span>                :   template&lt;typename _Iterator&gt;
-<span class="lineNum">     300 </span>                :     inline bool
-<span class="lineNum">     301 </span>                :     operator&gt;(const reverse_iterator&lt;_Iterator&gt;&amp; __x,
-<span class="lineNum">     302 </span>                :               const reverse_iterator&lt;_Iterator&gt;&amp; __y)
-<span class="lineNum">     303 </span>                :     { return __y &lt; __x; }
-<span class="lineNum">     304 </span>                : 
-<span class="lineNum">     305 </span>                :   template&lt;typename _Iterator&gt;
-<span class="lineNum">     306 </span>                :     inline bool
-<span class="lineNum">     307 </span>                :     operator&lt;=(const reverse_iterator&lt;_Iterator&gt;&amp; __x,
-<span class="lineNum">     308 </span>                :                const reverse_iterator&lt;_Iterator&gt;&amp; __y)
-<span class="lineNum">     309 </span>                :     { return !(__y &lt; __x); }
-<span class="lineNum">     310 </span>                : 
-<span class="lineNum">     311 </span>                :   template&lt;typename _Iterator&gt;
-<span class="lineNum">     312 </span>                :     inline bool
-<span class="lineNum">     313 </span>                :     operator&gt;=(const reverse_iterator&lt;_Iterator&gt;&amp; __x,
-<span class="lineNum">     314 </span>                :                const reverse_iterator&lt;_Iterator&gt;&amp; __y)
-<span class="lineNum">     315 </span>                :     { return !(__x &lt; __y); }
-<span class="lineNum">     316 </span>                : 
-<span class="lineNum">     317 </span>                :   template&lt;typename _Iterator&gt;
-<span class="lineNum">     318 </span>                :     inline typename reverse_iterator&lt;_Iterator&gt;::difference_type
-<span class="lineNum">     319 </span>                :     operator-(const reverse_iterator&lt;_Iterator&gt;&amp; __x,
-<span class="lineNum">     320 </span>                :               const reverse_iterator&lt;_Iterator&gt;&amp; __y)
-<span class="lineNum">     321 </span>                :     { return __y.base() - __x.base(); }
-<span class="lineNum">     322 </span>                : 
-<span class="lineNum">     323 </span>                :   template&lt;typename _Iterator&gt;
-<span class="lineNum">     324 </span>                :     inline reverse_iterator&lt;_Iterator&gt;
-<span class="lineNum">     325 </span>                :     operator+(typename reverse_iterator&lt;_Iterator&gt;::difference_type __n,
-<span class="lineNum">     326 </span>                :               const reverse_iterator&lt;_Iterator&gt;&amp; __x)
-<span class="lineNum">     327 </span>                :     { return reverse_iterator&lt;_Iterator&gt;(__x.base() - __n); }
-<span class="lineNum">     328 </span>                : 
-<span class="lineNum">     329 </span>                :   // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     330 </span>                :   // DR 280. Comparison of reverse_iterator to const reverse_iterator.
-<span class="lineNum">     331 </span>                :   template&lt;typename _IteratorL, typename _IteratorR&gt;
-<span class="lineNum">     332 </span>                :     inline bool
-<span class="lineNum">     333 </span>                :     operator==(const reverse_iterator&lt;_IteratorL&gt;&amp; __x,
-<span class="lineNum">     334 </span>                :                const reverse_iterator&lt;_IteratorR&gt;&amp; __y)
-<span class="lineNum">     335 </span>                :     { return __x.base() == __y.base(); }
-<span class="lineNum">     336 </span>                : 
-<span class="lineNum">     337 </span>                :   template&lt;typename _IteratorL, typename _IteratorR&gt;
-<span class="lineNum">     338 </span>                :     inline bool
-<span class="lineNum">     339 </span>                :     operator&lt;(const reverse_iterator&lt;_IteratorL&gt;&amp; __x,
-<span class="lineNum">     340 </span>                :               const reverse_iterator&lt;_IteratorR&gt;&amp; __y)
-<span class="lineNum">     341 </span>                :     { return __y.base() &lt; __x.base(); }
-<span class="lineNum">     342 </span>                : 
-<span class="lineNum">     343 </span>                :   template&lt;typename _IteratorL, typename _IteratorR&gt;
-<span class="lineNum">     344 </span>                :     inline bool
-<span class="lineNum">     345 </span>                :     operator!=(const reverse_iterator&lt;_IteratorL&gt;&amp; __x,
-<span class="lineNum">     346 </span>                :                const reverse_iterator&lt;_IteratorR&gt;&amp; __y)
-<span class="lineNum">     347 </span>                :     { return !(__x == __y); }
-<span class="lineNum">     348 </span>                : 
-<span class="lineNum">     349 </span>                :   template&lt;typename _IteratorL, typename _IteratorR&gt;
-<span class="lineNum">     350 </span>                :     inline bool
-<span class="lineNum">     351 </span>                :     operator&gt;(const reverse_iterator&lt;_IteratorL&gt;&amp; __x,
-<span class="lineNum">     352 </span>                :               const reverse_iterator&lt;_IteratorR&gt;&amp; __y)
-<span class="lineNum">     353 </span>                :     { return __y &lt; __x; }
-<span class="lineNum">     354 </span>                : 
-<span class="lineNum">     355 </span>                :   template&lt;typename _IteratorL, typename _IteratorR&gt;
-<span class="lineNum">     356 </span>                :     inline bool
-<span class="lineNum">     357 </span>                :     operator&lt;=(const reverse_iterator&lt;_IteratorL&gt;&amp; __x,
-<span class="lineNum">     358 </span>                :                const reverse_iterator&lt;_IteratorR&gt;&amp; __y)
-<span class="lineNum">     359 </span>                :     { return !(__y &lt; __x); }
-<span class="lineNum">     360 </span>                : 
-<span class="lineNum">     361 </span>                :   template&lt;typename _IteratorL, typename _IteratorR&gt;
-<span class="lineNum">     362 </span>                :     inline bool
-<span class="lineNum">     363 </span>                :     operator&gt;=(const reverse_iterator&lt;_IteratorL&gt;&amp; __x,
-<span class="lineNum">     364 </span>                :                const reverse_iterator&lt;_IteratorR&gt;&amp; __y)
-<span class="lineNum">     365 </span>                :     { return !(__x &lt; __y); }
-<span class="lineNum">     366 </span>                : 
-<span class="lineNum">     367 </span>                :   template&lt;typename _IteratorL, typename _IteratorR&gt;
-<span class="lineNum">     368 </span>                :     inline typename reverse_iterator&lt;_IteratorL&gt;::difference_type
-<span class="lineNum">     369 </span>                :     operator-(const reverse_iterator&lt;_IteratorL&gt;&amp; __x,
-<span class="lineNum">     370 </span>                :               const reverse_iterator&lt;_IteratorR&gt;&amp; __y)
-<span class="lineNum">     371 </span>                :     { return __y.base() - __x.base(); }
-<span class="lineNum">     372 </span>                :   //@}
-<span class="lineNum">     373 </span>                : 
-<span class="lineNum">     374 </span>                :   // 24.4.2.2.1 back_insert_iterator
-<span class="lineNum">     375 </span>                :   /**
-<span class="lineNum">     376 </span>                :    *  @brief  Turns assignment into insertion.
-<span class="lineNum">     377 </span>                :    *
-<span class="lineNum">     378 </span>                :    *  These are output iterators, constructed from a container-of-T.
-<span class="lineNum">     379 </span>                :    *  Assigning a T to the iterator appends it to the container using
-<span class="lineNum">     380 </span>                :    *  push_back.
-<span class="lineNum">     381 </span>                :    *
-<span class="lineNum">     382 </span>                :    *  Tip:  Using the back_inserter function to create these iterators can
-<span class="lineNum">     383 </span>                :    *  save typing.
-<span class="lineNum">     384 </span>                :   */
-<span class="lineNum">     385 </span>                :   template&lt;typename _Container&gt;
-<span class="lineNum">     386 </span>                :     class back_insert_iterator
-<span class="lineNum">     387 </span>                :     : public iterator&lt;output_iterator_tag, void, void, void, void&gt;
-<span class="lineNum">     388 </span>                :     {
-<span class="lineNum">     389 </span>                :     protected:
-<span class="lineNum">     390 </span>                :       _Container* container;
-<span class="lineNum">     391 </span>                : 
-<span class="lineNum">     392 </span>                :     public:
-<span class="lineNum">     393 </span>                :       /// A nested typedef for the type of whatever container you used.
-<span class="lineNum">     394 </span>                :       typedef _Container          container_type;
-<span class="lineNum">     395 </span>                : 
-<span class="lineNum">     396 </span>                :       /// The only way to create this %iterator is with a container.
-<span class="lineNum">     397 </span>                :       explicit
-<span class="lineNum">     398 </span><span class="lineCov">            946 :       back_insert_iterator(_Container&amp; __x) : container(&amp;__x) { }</span>
-<span class="lineNum">     399 </span>                : 
-<span class="lineNum">     400 </span>                :       /**
-<span class="lineNum">     401 </span>                :        *  @param  value  An instance of whatever type
-<span class="lineNum">     402 </span>                :        *                 container_type::const_reference is; presumably a
-<span class="lineNum">     403 </span>                :        *                 reference-to-const T for container&lt;T&gt;.
-<span class="lineNum">     404 </span>                :        *  @return  This %iterator, for chained operations.
-<span class="lineNum">     405 </span>                :        *
-<span class="lineNum">     406 </span>                :        *  This kind of %iterator doesn't really have a &quot;position&quot; in the
-<span class="lineNum">     407 </span>                :        *  container (you can think of the position as being permanently at
-<span class="lineNum">     408 </span>                :        *  the end, if you like).  Assigning a value to the %iterator will
-<span class="lineNum">     409 </span>                :        *  always append the value to the end of the container.
-<span class="lineNum">     410 </span>                :       */
-<span class="lineNum">     411 </span>                :       back_insert_iterator&amp;
-<span class="lineNum">     412 </span><span class="lineCov">          17415 :       operator=(typename _Container::const_reference __value)</span>
-<span class="lineNum">     413 </span>                :       {
-<span class="lineNum">     414 </span><span class="lineCov">          17415 :         container-&gt;push_back(__value);</span>
-<span class="lineNum">     415 </span><span class="lineCov">          17415 :         return *this;</span>
-<span class="lineNum">     416 </span>                :       }
-<span class="lineNum">     417 </span>                : 
-<span class="lineNum">     418 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     419 </span>                :       back_insert_iterator&amp;
-<span class="lineNum">     420 </span>                :       operator=(typename _Container::value_type&amp;&amp; __value)
-<span class="lineNum">     421 </span>                :       {
-<span class="lineNum">     422 </span>                :         container-&gt;push_back(std::move(__value));
-<span class="lineNum">     423 </span>                :         return *this;
-<span class="lineNum">     424 </span>                :       }
-<span class="lineNum">     425 </span>                : #endif
-<span class="lineNum">     426 </span>                : 
-<span class="lineNum">     427 </span>                :       /// Simply returns *this.
-<span class="lineNum">     428 </span>                :       back_insert_iterator&amp;
-<span class="lineNum">     429 </span><span class="lineCov">          17419 :       operator*()</span>
-<span class="lineNum">     430 </span><span class="lineCov">          17419 :       { return *this; }</span>
-<span class="lineNum">     431 </span>                : 
-<span class="lineNum">     432 </span>                :       /// Simply returns *this.  (This %iterator does not &quot;move&quot;.)
-<span class="lineNum">     433 </span>                :       back_insert_iterator&amp;
-<span class="lineNum">     434 </span><span class="lineCov">          17405 :       operator++()</span>
-<span class="lineNum">     435 </span><span class="lineCov">          17405 :       { return *this; }</span>
-<span class="lineNum">     436 </span>                : 
-<span class="lineNum">     437 </span>                :       /// Simply returns *this.  (This %iterator does not &quot;move&quot;.)
-<span class="lineNum">     438 </span>                :       back_insert_iterator
-<span class="lineNum">     439 </span><span class="lineCov">             10 :       operator++(int)</span>
-<span class="lineNum">     440 </span><span class="lineCov">             10 :       { return *this; }</span>
-<span class="lineNum">     441 </span>                :     };
-<span class="lineNum">     442 </span>                : 
-<span class="lineNum">     443 </span>                :   /**
-<span class="lineNum">     444 </span>                :    *  @param  x  A container of arbitrary type.
-<span class="lineNum">     445 </span>                :    *  @return  An instance of back_insert_iterator working on @p x.
-<span class="lineNum">     446 </span>                :    *
-<span class="lineNum">     447 </span>                :    *  This wrapper function helps in creating back_insert_iterator instances.
-<span class="lineNum">     448 </span>                :    *  Typing the name of the %iterator requires knowing the precise full
-<span class="lineNum">     449 </span>                :    *  type of the container, which can be tedious and impedes generic
-<span class="lineNum">     450 </span>                :    *  programming.  Using this function lets you take advantage of automatic
-<span class="lineNum">     451 </span>                :    *  template parameter deduction, making the compiler match the correct
-<span class="lineNum">     452 </span>                :    *  types for you.
-<span class="lineNum">     453 </span>                :   */
-<span class="lineNum">     454 </span>                :   template&lt;typename _Container&gt;
-<span class="lineNum">     455 </span>                :     inline back_insert_iterator&lt;_Container&gt;
-<span class="lineNum">     456 </span><span class="lineCov">            946 :     back_inserter(_Container&amp; __x)</span>
-<span class="lineNum">     457 </span><span class="lineCov">            946 :     { return back_insert_iterator&lt;_Container&gt;(__x); }</span>
-<span class="lineNum">     458 </span>                : 
-<span class="lineNum">     459 </span>                :   /**
-<span class="lineNum">     460 </span>                :    *  @brief  Turns assignment into insertion.
-<span class="lineNum">     461 </span>                :    *
-<span class="lineNum">     462 </span>                :    *  These are output iterators, constructed from a container-of-T.
-<span class="lineNum">     463 </span>                :    *  Assigning a T to the iterator prepends it to the container using
-<span class="lineNum">     464 </span>                :    *  push_front.
-<span class="lineNum">     465 </span>                :    *
-<span class="lineNum">     466 </span>                :    *  Tip:  Using the front_inserter function to create these iterators can
-<span class="lineNum">     467 </span>                :    *  save typing.
-<span class="lineNum">     468 </span>                :   */
-<span class="lineNum">     469 </span>                :   template&lt;typename _Container&gt;
-<span class="lineNum">     470 </span>                :     class front_insert_iterator
-<span class="lineNum">     471 </span>                :     : public iterator&lt;output_iterator_tag, void, void, void, void&gt;
-<span class="lineNum">     472 </span>                :     {
-<span class="lineNum">     473 </span>                :     protected:
-<span class="lineNum">     474 </span>                :       _Container* container;
-<span class="lineNum">     475 </span>                : 
-<span class="lineNum">     476 </span>                :     public:
-<span class="lineNum">     477 </span>                :       /// A nested typedef for the type of whatever container you used.
-<span class="lineNum">     478 </span>                :       typedef _Container          container_type;
-<span class="lineNum">     479 </span>                : 
-<span class="lineNum">     480 </span>                :       /// The only way to create this %iterator is with a container.
-<span class="lineNum">     481 </span>                :       explicit front_insert_iterator(_Container&amp; __x) : container(&amp;__x) { }
-<span class="lineNum">     482 </span>                : 
-<span class="lineNum">     483 </span>                :       /**
-<span class="lineNum">     484 </span>                :        *  @param  value  An instance of whatever type
-<span class="lineNum">     485 </span>                :        *                 container_type::const_reference is; presumably a
-<span class="lineNum">     486 </span>                :        *                 reference-to-const T for container&lt;T&gt;.
-<span class="lineNum">     487 </span>                :        *  @return  This %iterator, for chained operations.
-<span class="lineNum">     488 </span>                :        *
-<span class="lineNum">     489 </span>                :        *  This kind of %iterator doesn't really have a &quot;position&quot; in the
-<span class="lineNum">     490 </span>                :        *  container (you can think of the position as being permanently at
-<span class="lineNum">     491 </span>                :        *  the front, if you like).  Assigning a value to the %iterator will
-<span class="lineNum">     492 </span>                :        *  always prepend the value to the front of the container.
-<span class="lineNum">     493 </span>                :       */
-<span class="lineNum">     494 </span>                :       front_insert_iterator&amp;
-<span class="lineNum">     495 </span>                :       operator=(typename _Container::const_reference __value)
-<span class="lineNum">     496 </span>                :       {
-<span class="lineNum">     497 </span>                :         container-&gt;push_front(__value);
-<span class="lineNum">     498 </span>                :         return *this;
-<span class="lineNum">     499 </span>                :       }
-<span class="lineNum">     500 </span>                : 
-<span class="lineNum">     501 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     502 </span>                :       front_insert_iterator&amp;
-<span class="lineNum">     503 </span>                :       operator=(typename _Container::value_type&amp;&amp; __value)
-<span class="lineNum">     504 </span>                :       {
-<span class="lineNum">     505 </span>                :         container-&gt;push_front(std::move(__value));
-<span class="lineNum">     506 </span>                :         return *this;
-<span class="lineNum">     507 </span>                :       }
-<span class="lineNum">     508 </span>                : #endif
-<span class="lineNum">     509 </span>                : 
-<span class="lineNum">     510 </span>                :       /// Simply returns *this.
-<span class="lineNum">     511 </span>                :       front_insert_iterator&amp;
-<span class="lineNum">     512 </span>                :       operator*()
-<span class="lineNum">     513 </span>                :       { return *this; }
-<span class="lineNum">     514 </span>                : 
-<span class="lineNum">     515 </span>                :       /// Simply returns *this.  (This %iterator does not &quot;move&quot;.)
-<span class="lineNum">     516 </span>                :       front_insert_iterator&amp;
-<span class="lineNum">     517 </span>                :       operator++()
-<span class="lineNum">     518 </span>                :       { return *this; }
-<span class="lineNum">     519 </span>                : 
-<span class="lineNum">     520 </span>                :       /// Simply returns *this.  (This %iterator does not &quot;move&quot;.)
-<span class="lineNum">     521 </span>                :       front_insert_iterator
-<span class="lineNum">     522 </span>                :       operator++(int)
-<span class="lineNum">     523 </span>                :       { return *this; }
-<span class="lineNum">     524 </span>                :     };
-<span class="lineNum">     525 </span>                : 
-<span class="lineNum">     526 </span>                :   /**
-<span class="lineNum">     527 </span>                :    *  @param  x  A container of arbitrary type.
-<span class="lineNum">     528 </span>                :    *  @return  An instance of front_insert_iterator working on @p x.
-<span class="lineNum">     529 </span>                :    *
-<span class="lineNum">     530 </span>                :    *  This wrapper function helps in creating front_insert_iterator instances.
-<span class="lineNum">     531 </span>                :    *  Typing the name of the %iterator requires knowing the precise full
-<span class="lineNum">     532 </span>                :    *  type of the container, which can be tedious and impedes generic
-<span class="lineNum">     533 </span>                :    *  programming.  Using this function lets you take advantage of automatic
-<span class="lineNum">     534 </span>                :    *  template parameter deduction, making the compiler match the correct
-<span class="lineNum">     535 </span>                :    *  types for you.
-<span class="lineNum">     536 </span>                :   */
-<span class="lineNum">     537 </span>                :   template&lt;typename _Container&gt;
-<span class="lineNum">     538 </span>                :     inline front_insert_iterator&lt;_Container&gt;
-<span class="lineNum">     539 </span>                :     front_inserter(_Container&amp; __x)
-<span class="lineNum">     540 </span>                :     { return front_insert_iterator&lt;_Container&gt;(__x); }
-<span class="lineNum">     541 </span>                : 
-<span class="lineNum">     542 </span>                :   /**
-<span class="lineNum">     543 </span>                :    *  @brief  Turns assignment into insertion.
-<span class="lineNum">     544 </span>                :    *
-<span class="lineNum">     545 </span>                :    *  These are output iterators, constructed from a container-of-T.
-<span class="lineNum">     546 </span>                :    *  Assigning a T to the iterator inserts it in the container at the
-<span class="lineNum">     547 </span>                :    *  %iterator's position, rather than overwriting the value at that
-<span class="lineNum">     548 </span>                :    *  position.
-<span class="lineNum">     549 </span>                :    *
-<span class="lineNum">     550 </span>                :    *  (Sequences will actually insert a @e copy of the value before the
-<span class="lineNum">     551 </span>                :    *  %iterator's position.)
-<span class="lineNum">     552 </span>                :    *
-<span class="lineNum">     553 </span>                :    *  Tip:  Using the inserter function to create these iterators can
-<span class="lineNum">     554 </span>                :    *  save typing.
-<span class="lineNum">     555 </span>                :   */
-<span class="lineNum">     556 </span>                :   template&lt;typename _Container&gt;
-<span class="lineNum">     557 </span>                :     class insert_iterator
-<span class="lineNum">     558 </span>                :     : public iterator&lt;output_iterator_tag, void, void, void, void&gt;
-<span class="lineNum">     559 </span>                :     {
-<span class="lineNum">     560 </span>                :     protected:
-<span class="lineNum">     561 </span>                :       _Container* container;
-<span class="lineNum">     562 </span>                :       typename _Container::iterator iter;
-<span class="lineNum">     563 </span>                : 
-<span class="lineNum">     564 </span>                :     public:
-<span class="lineNum">     565 </span>                :       /// A nested typedef for the type of whatever container you used.
-<span class="lineNum">     566 </span>                :       typedef _Container          container_type;
-<span class="lineNum">     567 </span>                : 
-<span class="lineNum">     568 </span>                :       /**
-<span class="lineNum">     569 </span>                :        *  The only way to create this %iterator is with a container and an
-<span class="lineNum">     570 </span>                :        *  initial position (a normal %iterator into the container).
-<span class="lineNum">     571 </span>                :       */
-<span class="lineNum">     572 </span><span class="lineCov">          21203 :       insert_iterator(_Container&amp; __x, typename _Container::iterator __i)</span>
-<span class="lineNum">     573 </span><span class="lineCov">          21203 :       : container(&amp;__x), iter(__i) {}</span>
-<span class="lineNum">     574 </span>                : 
-<span class="lineNum">     575 </span>                :       /**
-<span class="lineNum">     576 </span>                :        *  @param  value  An instance of whatever type
-<span class="lineNum">     577 </span>                :        *                 container_type::const_reference is; presumably a
-<span class="lineNum">     578 </span>                :        *                 reference-to-const T for container&lt;T&gt;.
-<span class="lineNum">     579 </span>                :        *  @return  This %iterator, for chained operations.
-<span class="lineNum">     580 </span>                :        *
-<span class="lineNum">     581 </span>                :        *  This kind of %iterator maintains its own position in the
-<span class="lineNum">     582 </span>                :        *  container.  Assigning a value to the %iterator will insert the
-<span class="lineNum">     583 </span>                :        *  value into the container at the place before the %iterator.
-<span class="lineNum">     584 </span>                :        *
-<span class="lineNum">     585 </span>                :        *  The position is maintained such that subsequent assignments will
-<span class="lineNum">     586 </span>                :        *  insert values immediately after one another.  For example,
-<span class="lineNum">     587 </span>                :        *  @code
-<span class="lineNum">     588 </span>                :        *     // vector v contains A and Z
-<span class="lineNum">     589 </span>                :        *
-<span class="lineNum">     590 </span>                :        *     insert_iterator i (v, ++v.begin());
-<span class="lineNum">     591 </span>                :        *     i = 1;
-<span class="lineNum">     592 </span>                :        *     i = 2;
-<span class="lineNum">     593 </span>                :        *     i = 3;
-<span class="lineNum">     594 </span>                :        *
-<span class="lineNum">     595 </span>                :        *     // vector v contains A, 1, 2, 3, and Z
-<span class="lineNum">     596 </span>                :        *  @endcode
-<span class="lineNum">     597 </span>                :       */
-<span class="lineNum">     598 </span>                :       insert_iterator&amp;
-<span class="lineNum">     599 </span><span class="lineCov">         107622 :       operator=(typename _Container::const_reference __value)</span>
-<span class="lineNum">     600 </span>                :       {
-<span class="lineNum">     601 </span><span class="lineCov">         107622 :         iter = container-&gt;insert(iter, __value);</span>
-<span class="lineNum">     602 </span><span class="lineCov">         107622 :         ++iter;</span>
-<span class="lineNum">     603 </span><span class="lineCov">         107622 :         return *this;</span>
-<span class="lineNum">     604 </span>                :       }
-<span class="lineNum">     605 </span>                : 
-<span class="lineNum">     606 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     607 </span>                :       insert_iterator&amp;
-<span class="lineNum">     608 </span>                :       operator=(typename _Container::value_type&amp;&amp; __value)
-<span class="lineNum">     609 </span>                :       {
-<span class="lineNum">     610 </span>                :         iter = container-&gt;insert(iter, std::move(__value));
-<span class="lineNum">     611 </span>                :         ++iter;
-<span class="lineNum">     612 </span>                :         return *this;
-<span class="lineNum">     613 </span>                :       }
-<span class="lineNum">     614 </span>                : #endif
-<span class="lineNum">     615 </span>                : 
-<span class="lineNum">     616 </span>                :       /// Simply returns *this.
-<span class="lineNum">     617 </span>                :       insert_iterator&amp;
-<span class="lineNum">     618 </span><span class="lineCov">         107650 :       operator*()</span>
-<span class="lineNum">     619 </span><span class="lineCov">         107650 :       { return *this; }</span>
-<span class="lineNum">     620 </span>                : 
-<span class="lineNum">     621 </span>                :       /// Simply returns *this.  (This %iterator does not &quot;move&quot;.)
-<span class="lineNum">     622 </span>                :       insert_iterator&amp;
-<span class="lineNum">     623 </span><span class="lineCov">         107622 :       operator++()</span>
-<span class="lineNum">     624 </span><span class="lineCov">         107622 :       { return *this; }</span>
-<span class="lineNum">     625 </span>                : 
-<span class="lineNum">     626 </span>                :       /// Simply returns *this.  (This %iterator does not &quot;move&quot;.)
-<span class="lineNum">     627 </span>                :       insert_iterator&amp;
-<span class="lineNum">     628 </span><span class="lineNoCov">              0 :       operator++(int)</span>
-<span class="lineNum">     629 </span><span class="lineNoCov">              0 :       { return *this; }</span>
-<span class="lineNum">     630 </span>                :     };
-<span class="lineNum">     631 </span>                : 
-<span class="lineNum">     632 </span>                :   /**
-<span class="lineNum">     633 </span>                :    *  @param  x  A container of arbitrary type.
-<span class="lineNum">     634 </span>                :    *  @return  An instance of insert_iterator working on @p x.
-<span class="lineNum">     635 </span>                :    *
-<span class="lineNum">     636 </span>                :    *  This wrapper function helps in creating insert_iterator instances.
-<span class="lineNum">     637 </span>                :    *  Typing the name of the %iterator requires knowing the precise full
-<span class="lineNum">     638 </span>                :    *  type of the container, which can be tedious and impedes generic
-<span class="lineNum">     639 </span>                :    *  programming.  Using this function lets you take advantage of automatic
-<span class="lineNum">     640 </span>                :    *  template parameter deduction, making the compiler match the correct
-<span class="lineNum">     641 </span>                :    *  types for you.
-<span class="lineNum">     642 </span>                :   */
-<span class="lineNum">     643 </span>                :   template&lt;typename _Container, typename _Iterator&gt;
-<span class="lineNum">     644 </span>                :     inline insert_iterator&lt;_Container&gt;
-<span class="lineNum">     645 </span><span class="lineCov">          21203 :     inserter(_Container&amp; __x, _Iterator __i)</span>
-<span class="lineNum">     646 </span>                :     {
-<span class="lineNum">     647 </span>                :       return insert_iterator&lt;_Container&gt;(__x,
-<span class="lineNum">     648 </span><span class="lineCov">          21203 :                                          typename _Container::iterator(__i));</span>
-<span class="lineNum">     649 </span>                :     }
-<span class="lineNum">     650 </span>                : 
-<span class="lineNum">     651 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">     652 </span>                : 
-<span class="lineNum">     653 </span>                : _GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx)
-<span class="lineNum">     654 </span>                : 
-<span class="lineNum">     655 </span>                :   // This iterator adapter is 'normal' in the sense that it does not
-<span class="lineNum">     656 </span>                :   // change the semantics of any of the operators of its iterator
-<span class="lineNum">     657 </span>                :   // parameter.  Its primary purpose is to convert an iterator that is
-<span class="lineNum">     658 </span>                :   // not a class, e.g. a pointer, into an iterator that is a class.
-<span class="lineNum">     659 </span>                :   // The _Container parameter exists solely so that different containers
-<span class="lineNum">     660 </span>                :   // using this template can instantiate different types, even if the
-<span class="lineNum">     661 </span>                :   // _Iterator parameter is the same.
-<span class="lineNum">     662 </span>                :   using std::iterator_traits;
-<span class="lineNum">     663 </span>                :   using std::iterator;
-<span class="lineNum">     664 </span>                :   template&lt;typename _Iterator, typename _Container&gt;
-<span class="lineNum">     665 </span>                :     class __normal_iterator
-<span class="lineNum">     666 </span>                :     {
-<span class="lineNum">     667 </span>                :     protected:
-<span class="lineNum">     668 </span>                :       _Iterator _M_current;
-<span class="lineNum">     669 </span>                : 
-<span class="lineNum">     670 </span>                :     public:
-<span class="lineNum">     671 </span>                :       typedef _Iterator                                      iterator_type;
-<span class="lineNum">     672 </span>                :       typedef typename iterator_traits&lt;_Iterator&gt;::iterator_category
-<span class="lineNum">     673 </span>                :                                                              iterator_category;
-<span class="lineNum">     674 </span>                :       typedef typename iterator_traits&lt;_Iterator&gt;::value_type  value_type;
-<span class="lineNum">     675 </span>                :       typedef typename iterator_traits&lt;_Iterator&gt;::difference_type
-<span class="lineNum">     676 </span>                :                                                              difference_type;
-<span class="lineNum">     677 </span>                :       typedef typename iterator_traits&lt;_Iterator&gt;::reference reference;
-<span class="lineNum">     678 </span>                :       typedef typename iterator_traits&lt;_Iterator&gt;::pointer   pointer;
-<span class="lineNum">     679 </span>                : 
-<span class="lineNum">     680 </span><span class="lineCov">              3 :       __normal_iterator() : _M_current(_Iterator()) { }</span>
-<span class="lineNum">     681 </span>                : 
-<span class="lineNum">     682 </span>                :       explicit
-<span class="lineNum">     683 </span><span class="lineCov">         150393 :       __normal_iterator(const _Iterator&amp; __i) : _M_current(__i) { }</span>
-<span class="lineNum">     684 </span>                : 
-<span class="lineNum">     685 </span>                :       // Allow iterator to const_iterator conversion
-<span class="lineNum">     686 </span>                :       template&lt;typename _Iter&gt;
-<span class="lineNum">     687 </span>                :         __normal_iterator(const __normal_iterator&lt;_Iter,
-<span class="lineNum">     688 </span>                :                           typename __enable_if&lt;
-<span class="lineNum">     689 </span>                :                (std::__are_same&lt;_Iter, typename _Container::pointer&gt;::__value),
-<span class="lineNum">     690 </span><span class="lineCov">             28 :                       _Container&gt;::__type&gt;&amp; __i)</span>
-<span class="lineNum">     691 </span><span class="lineCov">             28 :         : _M_current(__i.base()) { }</span>
-<span class="lineNum">     692 </span>                : 
-<span class="lineNum">     693 </span>                :       // Forward iterator requirements
-<span class="lineNum">     694 </span>                :       reference
-<span class="lineNum">     695 </span><span class="lineCov">         925025 :       operator*() const</span>
-<span class="lineNum">     696 </span><span class="lineCov">         925025 :       { return *_M_current; }</span>
-<span class="lineNum">     697 </span>                : 
-<span class="lineNum">     698 </span>                :       pointer
-<span class="lineNum">     699 </span><span class="lineCov">              3 :       operator-&gt;() const</span>
-<span class="lineNum">     700 </span><span class="lineCov">              3 :       { return _M_current; }</span>
-<span class="lineNum">     701 </span>                : 
-<span class="lineNum">     702 </span>                :       __normal_iterator&amp;
-<span class="lineNum">     703 </span><span class="lineCov">          81617 :       operator++()</span>
-<span class="lineNum">     704 </span>                :       {
-<span class="lineNum">     705 </span><span class="lineCov">          81617 :         ++_M_current;</span>
-<span class="lineNum">     706 </span><span class="lineCov">          81617 :         return *this;</span>
-<span class="lineNum">     707 </span>                :       }
-<span class="lineNum">     708 </span>                : 
-<span class="lineNum">     709 </span>                :       __normal_iterator
-<span class="lineNum">     710 </span><span class="lineCov">          54836 :       operator++(int)</span>
-<span class="lineNum">     711 </span><span class="lineCov">          54836 :       { return __normal_iterator(_M_current++); }</span>
-<span class="lineNum">     712 </span>                : 
-<span class="lineNum">     713 </span>                :       // Bidirectional iterator requirements
-<span class="lineNum">     714 </span>                :       __normal_iterator&amp;
-<span class="lineNum">     715 </span><span class="lineCov">         249605 :       operator--()</span>
-<span class="lineNum">     716 </span>                :       {
-<span class="lineNum">     717 </span><span class="lineCov">         249605 :         --_M_current;</span>
-<span class="lineNum">     718 </span><span class="lineCov">         249605 :         return *this;</span>
-<span class="lineNum">     719 </span>                :       }
-<span class="lineNum">     720 </span>                : 
-<span class="lineNum">     721 </span>                :       __normal_iterator
-<span class="lineNum">     722 </span><span class="lineNoCov">              0 :       operator--(int)</span>
-<span class="lineNum">     723 </span><span class="lineNoCov">              0 :       { return __normal_iterator(_M_current--); }</span>
-<span class="lineNum">     724 </span>                : 
-<span class="lineNum">     725 </span>                :       // Random access iterator requirements
-<span class="lineNum">     726 </span>                :       reference
-<span class="lineNum">     727 </span>                :       operator[](const difference_type&amp; __n) const
-<span class="lineNum">     728 </span>                :       { return _M_current[__n]; }
-<span class="lineNum">     729 </span>                : 
-<span class="lineNum">     730 </span>                :       __normal_iterator&amp;
-<span class="lineNum">     731 </span>                :       operator+=(const difference_type&amp; __n)
-<span class="lineNum">     732 </span>                :       { _M_current += __n; return *this; }
-<span class="lineNum">     733 </span>                : 
-<span class="lineNum">     734 </span>                :       __normal_iterator
-<span class="lineNum">     735 </span><span class="lineCov">          13455 :       operator+(const difference_type&amp; __n) const</span>
-<span class="lineNum">     736 </span><span class="lineCov">          13455 :       { return __normal_iterator(_M_current + __n); }</span>
-<span class="lineNum">     737 </span>                : 
-<span class="lineNum">     738 </span>                :       __normal_iterator&amp;
-<span class="lineNum">     739 </span>                :       operator-=(const difference_type&amp; __n)
-<span class="lineNum">     740 </span>                :       { _M_current -= __n; return *this; }
-<span class="lineNum">     741 </span>                : 
-<span class="lineNum">     742 </span>                :       __normal_iterator
-<span class="lineNum">     743 </span><span class="lineCov">            846 :       operator-(const difference_type&amp; __n) const</span>
-<span class="lineNum">     744 </span><span class="lineCov">            846 :       { return __normal_iterator(_M_current - __n); }</span>
-<span class="lineNum">     745 </span>                : 
-<span class="lineNum">     746 </span>                :       const _Iterator&amp;
-<span class="lineNum">     747 </span><span class="lineCov">         455202 :       base() const</span>
-<span class="lineNum">     748 </span><span class="lineCov">         455202 :       { return _M_current; }</span>
-<span class="lineNum">     749 </span>                :     };
-<span class="lineNum">     750 </span>                : 
-<span class="lineNum">     751 </span>                :   // Note: In what follows, the left- and right-hand-side iterators are
-<span class="lineNum">     752 </span>                :   // allowed to vary in types (conceptually in cv-qualification) so that
-<span class="lineNum">     753 </span>                :   // comparison between cv-qualified and non-cv-qualified iterators be
-<span class="lineNum">     754 </span>                :   // valid.  However, the greedy and unfriendly operators in std::rel_ops
-<span class="lineNum">     755 </span>                :   // will make overload resolution ambiguous (when in scope) if we don't
-<span class="lineNum">     756 </span>                :   // provide overloads whose operands are of the same type.  Can someone
-<span class="lineNum">     757 </span>                :   // remind me what generic programming is about? -- Gaby
-<span class="lineNum">     758 </span>                : 
-<span class="lineNum">     759 </span>                :   // Forward iterator requirements
-<span class="lineNum">     760 </span>                :   template&lt;typename _IteratorL, typename _IteratorR, typename _Container&gt;
-<span class="lineNum">     761 </span>                :     inline bool
-<span class="lineNum">     762 </span>                :     operator==(const __normal_iterator&lt;_IteratorL, _Container&gt;&amp; __lhs,
-<span class="lineNum">     763 </span>                :                const __normal_iterator&lt;_IteratorR, _Container&gt;&amp; __rhs)
-<span class="lineNum">     764 </span>                :     { return __lhs.base() == __rhs.base(); }
-<span class="lineNum">     765 </span>                : 
-<span class="lineNum">     766 </span>                :   template&lt;typename _Iterator, typename _Container&gt;
-<span class="lineNum">     767 </span>                :     inline bool
-<span class="lineNum">     768 </span>                :     operator==(const __normal_iterator&lt;_Iterator, _Container&gt;&amp; __lhs,
-<span class="lineNum">     769 </span><span class="lineCov">           4368 :                const __normal_iterator&lt;_Iterator, _Container&gt;&amp; __rhs)</span>
-<span class="lineNum">     770 </span><span class="lineCov">           4368 :     { return __lhs.base() == __rhs.base(); }</span>
-<span class="lineNum">     771 </span>                : 
-<span class="lineNum">     772 </span>                :   template&lt;typename _IteratorL, typename _IteratorR, typename _Container&gt;
-<span class="lineNum">     773 </span>                :     inline bool
-<span class="lineNum">     774 </span>                :     operator!=(const __normal_iterator&lt;_IteratorL, _Container&gt;&amp; __lhs,
-<span class="lineNum">     775 </span><span class="lineCov">             38 :                const __normal_iterator&lt;_IteratorR, _Container&gt;&amp; __rhs)</span>
-<span class="lineNum">     776 </span><span class="lineCov">             38 :     { return __lhs.base() != __rhs.base(); }</span>
-<span class="lineNum">     777 </span>                : 
-<span class="lineNum">     778 </span>                :   template&lt;typename _Iterator, typename _Container&gt;
-<span class="lineNum">     779 </span>                :     inline bool
-<span class="lineNum">     780 </span>                :     operator!=(const __normal_iterator&lt;_Iterator, _Container&gt;&amp; __lhs,
-<span class="lineNum">     781 </span><span class="lineCov">         123290 :                const __normal_iterator&lt;_Iterator, _Container&gt;&amp; __rhs)</span>
-<span class="lineNum">     782 </span><span class="lineCov">         123290 :     { return __lhs.base() != __rhs.base(); }</span>
-<span class="lineNum">     783 </span>                : 
-<span class="lineNum">     784 </span>                :   // Random access iterator requirements
-<span class="lineNum">     785 </span>                :   template&lt;typename _IteratorL, typename _IteratorR, typename _Container&gt;
-<span class="lineNum">     786 </span>                :     inline bool
-<span class="lineNum">     787 </span>                :     operator&lt;(const __normal_iterator&lt;_IteratorL, _Container&gt;&amp; __lhs,
-<span class="lineNum">     788 </span>                :               const __normal_iterator&lt;_IteratorR, _Container&gt;&amp; __rhs)
-<span class="lineNum">     789 </span>                :     { return __lhs.base() &lt; __rhs.base(); }
-<span class="lineNum">     790 </span>                : 
-<span class="lineNum">     791 </span>                :   template&lt;typename _Iterator, typename _Container&gt;
-<span class="lineNum">     792 </span>                :     inline bool
-<span class="lineNum">     793 </span>                :     operator&lt;(const __normal_iterator&lt;_Iterator, _Container&gt;&amp; __lhs,
-<span class="lineNum">     794 </span><span class="lineCov">           7923 :               const __normal_iterator&lt;_Iterator, _Container&gt;&amp; __rhs)</span>
-<span class="lineNum">     795 </span><span class="lineCov">           7923 :     { return __lhs.base() &lt; __rhs.base(); }</span>
-<span class="lineNum">     796 </span>                : 
-<span class="lineNum">     797 </span>                :   template&lt;typename _IteratorL, typename _IteratorR, typename _Container&gt;
-<span class="lineNum">     798 </span>                :     inline bool
-<span class="lineNum">     799 </span>                :     operator&gt;(const __normal_iterator&lt;_IteratorL, _Container&gt;&amp; __lhs,
-<span class="lineNum">     800 </span>                :               const __normal_iterator&lt;_IteratorR, _Container&gt;&amp; __rhs)
-<span class="lineNum">     801 </span>                :     { return __lhs.base() &gt; __rhs.base(); }
-<span class="lineNum">     802 </span>                : 
-<span class="lineNum">     803 </span>                :   template&lt;typename _Iterator, typename _Container&gt;
-<span class="lineNum">     804 </span>                :     inline bool
-<span class="lineNum">     805 </span>                :     operator&gt;(const __normal_iterator&lt;_Iterator, _Container&gt;&amp; __lhs,
-<span class="lineNum">     806 </span>                :               const __normal_iterator&lt;_Iterator, _Container&gt;&amp; __rhs)
-<span class="lineNum">     807 </span>                :     { return __lhs.base() &gt; __rhs.base(); }
-<span class="lineNum">     808 </span>                : 
-<span class="lineNum">     809 </span>                :   template&lt;typename _IteratorL, typename _IteratorR, typename _Container&gt;
-<span class="lineNum">     810 </span>                :     inline bool
-<span class="lineNum">     811 </span>                :     operator&lt;=(const __normal_iterator&lt;_IteratorL, _Container&gt;&amp; __lhs,
-<span class="lineNum">     812 </span>                :                const __normal_iterator&lt;_IteratorR, _Container&gt;&amp; __rhs)
-<span class="lineNum">     813 </span>                :     { return __lhs.base() &lt;= __rhs.base(); }
-<span class="lineNum">     814 </span>                : 
-<span class="lineNum">     815 </span>                :   template&lt;typename _Iterator, typename _Container&gt;
-<span class="lineNum">     816 </span>                :     inline bool
-<span class="lineNum">     817 </span>                :     operator&lt;=(const __normal_iterator&lt;_Iterator, _Container&gt;&amp; __lhs,
-<span class="lineNum">     818 </span>                :                const __normal_iterator&lt;_Iterator, _Container&gt;&amp; __rhs)
-<span class="lineNum">     819 </span>                :     { return __lhs.base() &lt;= __rhs.base(); }
-<span class="lineNum">     820 </span>                : 
-<span class="lineNum">     821 </span>                :   template&lt;typename _IteratorL, typename _IteratorR, typename _Container&gt;
-<span class="lineNum">     822 </span>                :     inline bool
-<span class="lineNum">     823 </span>                :     operator&gt;=(const __normal_iterator&lt;_IteratorL, _Container&gt;&amp; __lhs,
-<span class="lineNum">     824 </span>                :                const __normal_iterator&lt;_IteratorR, _Container&gt;&amp; __rhs)
-<span class="lineNum">     825 </span>                :     { return __lhs.base() &gt;= __rhs.base(); }
-<span class="lineNum">     826 </span>                : 
-<span class="lineNum">     827 </span>                :   template&lt;typename _Iterator, typename _Container&gt;
-<span class="lineNum">     828 </span>                :     inline bool
-<span class="lineNum">     829 </span>                :     operator&gt;=(const __normal_iterator&lt;_Iterator, _Container&gt;&amp; __lhs,
-<span class="lineNum">     830 </span>                :                const __normal_iterator&lt;_Iterator, _Container&gt;&amp; __rhs)
-<span class="lineNum">     831 </span>                :     { return __lhs.base() &gt;= __rhs.base(); }
-<span class="lineNum">     832 </span>                : 
-<span class="lineNum">     833 </span>                :   // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     834 </span>                :   // According to the resolution of DR179 not only the various comparison
-<span class="lineNum">     835 </span>                :   // operators but also operator- must accept mixed iterator/const_iterator
-<span class="lineNum">     836 </span>                :   // parameters.
-<span class="lineNum">     837 </span>                :   template&lt;typename _IteratorL, typename _IteratorR, typename _Container&gt;
-<span class="lineNum">     838 </span>                :     inline typename __normal_iterator&lt;_IteratorL, _Container&gt;::difference_type
-<span class="lineNum">     839 </span>                :     operator-(const __normal_iterator&lt;_IteratorL, _Container&gt;&amp; __lhs,
-<span class="lineNum">     840 </span>                :               const __normal_iterator&lt;_IteratorR, _Container&gt;&amp; __rhs)
-<span class="lineNum">     841 </span>                :     { return __lhs.base() - __rhs.base(); }
-<span class="lineNum">     842 </span>                : 
-<span class="lineNum">     843 </span>                :   template&lt;typename _Iterator, typename _Container&gt;
-<span class="lineNum">     844 </span>                :     inline typename __normal_iterator&lt;_Iterator, _Container&gt;::difference_type
-<span class="lineNum">     845 </span>                :     operator-(const __normal_iterator&lt;_Iterator, _Container&gt;&amp; __lhs,
-<span class="lineNum">     846 </span><span class="lineCov">          37193 :               const __normal_iterator&lt;_Iterator, _Container&gt;&amp; __rhs)</span>
-<span class="lineNum">     847 </span><span class="lineCov">          37193 :     { return __lhs.base() - __rhs.base(); }</span>
-<span class="lineNum">     848 </span>                : 
-<span class="lineNum">     849 </span>                :   template&lt;typename _Iterator, typename _Container&gt;
-<span class="lineNum">     850 </span>                :     inline __normal_iterator&lt;_Iterator, _Container&gt;
-<span class="lineNum">     851 </span>                :     operator+(typename __normal_iterator&lt;_Iterator, _Container&gt;::difference_type
-<span class="lineNum">     852 </span>                :               __n, const __normal_iterator&lt;_Iterator, _Container&gt;&amp; __i)
-<span class="lineNum">     853 </span>                :     { return __normal_iterator&lt;_Iterator, _Container&gt;(__i.base() + __n); }
-<span class="lineNum">     854 </span>                : 
-<span class="lineNum">     855 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">     856 </span>                : 
-<span class="lineNum">     857 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     858 </span>                : 
-<span class="lineNum">     859 </span>                : _GLIBCXX_BEGIN_NAMESPACE(std)
-<span class="lineNum">     860 </span>                : 
-<span class="lineNum">     861 </span>                :   // 24.4.3  Move iterators
-<span class="lineNum">     862 </span>                :   /**
-<span class="lineNum">     863 </span>                :    *  Class template move_iterator is an iterator adapter with the same
-<span class="lineNum">     864 </span>                :    *  behavior as the underlying iterator except that its dereference
-<span class="lineNum">     865 </span>                :    *  operator implicitly converts the value returned by the underlying
-<span class="lineNum">     866 </span>                :    *  iterator's dereference operator to an rvalue reference.  Some
-<span class="lineNum">     867 </span>                :    *  generic algorithms can be called with move iterators to replace
-<span class="lineNum">     868 </span>                :    *  copying with moving.
-<span class="lineNum">     869 </span>                :    */
-<span class="lineNum">     870 </span>                :   template&lt;typename _Iterator&gt;
-<span class="lineNum">     871 </span>                :     class move_iterator
-<span class="lineNum">     872 </span>                :     {
-<span class="lineNum">     873 </span>                :     protected:
-<span class="lineNum">     874 </span>                :       _Iterator _M_current;
-<span class="lineNum">     875 </span>                : 
-<span class="lineNum">     876 </span>                :     public:
-<span class="lineNum">     877 </span>                :       typedef _Iterator                                        iterator_type;
-<span class="lineNum">     878 </span>                :       typedef typename iterator_traits&lt;_Iterator&gt;::difference_type
-<span class="lineNum">     879 </span>                :                                                                difference_type;
-<span class="lineNum">     880 </span>                :       // NB: DR 680.
-<span class="lineNum">     881 </span>                :       typedef _Iterator                                        pointer;
-<span class="lineNum">     882 </span>                :       typedef typename iterator_traits&lt;_Iterator&gt;::value_type  value_type;
-<span class="lineNum">     883 </span>                :       typedef typename iterator_traits&lt;_Iterator&gt;::iterator_category
-<span class="lineNum">     884 </span>                :                                                                iterator_category;
-<span class="lineNum">     885 </span>                :       typedef value_type&amp;&amp;                                     reference;
-<span class="lineNum">     886 </span>                : 
-<span class="lineNum">     887 </span>                :     public:
-<span class="lineNum">     888 </span>                :       move_iterator()
-<span class="lineNum">     889 </span>                :       : _M_current() { }
-<span class="lineNum">     890 </span>                : 
-<span class="lineNum">     891 </span>                :       explicit
-<span class="lineNum">     892 </span>                :       move_iterator(iterator_type __i)
-<span class="lineNum">     893 </span>                :       : _M_current(__i) { }
-<span class="lineNum">     894 </span>                : 
-<span class="lineNum">     895 </span>                :       template&lt;typename _Iter&gt;
-<span class="lineNum">     896 </span>                :         move_iterator(const move_iterator&lt;_Iter&gt;&amp; __i)
-<span class="lineNum">     897 </span>                :         : _M_current(__i.base()) { }
-<span class="lineNum">     898 </span>                : 
-<span class="lineNum">     899 </span>                :       iterator_type
-<span class="lineNum">     900 </span>                :       base() const
-<span class="lineNum">     901 </span>                :       { return _M_current; }
-<span class="lineNum">     902 </span>                : 
-<span class="lineNum">     903 </span>                :       reference
-<span class="lineNum">     904 </span>                :       operator*() const
-<span class="lineNum">     905 </span>                :       { return *_M_current; }
-<span class="lineNum">     906 </span>                : 
-<span class="lineNum">     907 </span>                :       pointer
-<span class="lineNum">     908 </span>                :       operator-&gt;() const
-<span class="lineNum">     909 </span>                :       { return _M_current; }
-<span class="lineNum">     910 </span>                : 
-<span class="lineNum">     911 </span>                :       move_iterator&amp;
-<span class="lineNum">     912 </span>                :       operator++()
-<span class="lineNum">     913 </span>                :       {
-<span class="lineNum">     914 </span>                :         ++_M_current;
-<span class="lineNum">     915 </span>                :         return *this;
-<span class="lineNum">     916 </span>                :       }
-<span class="lineNum">     917 </span>                : 
-<span class="lineNum">     918 </span>                :       move_iterator
-<span class="lineNum">     919 </span>                :       operator++(int)
-<span class="lineNum">     920 </span>                :       {
-<span class="lineNum">     921 </span>                :         move_iterator __tmp = *this;
-<span class="lineNum">     922 </span>                :         ++_M_current;
-<span class="lineNum">     923 </span>                :         return __tmp;
-<span class="lineNum">     924 </span>                :       }
-<span class="lineNum">     925 </span>                : 
-<span class="lineNum">     926 </span>                :       move_iterator&amp;
-<span class="lineNum">     927 </span>                :       operator--()
-<span class="lineNum">     928 </span>                :       {
-<span class="lineNum">     929 </span>                :         --_M_current;
-<span class="lineNum">     930 </span>                :         return *this;
-<span class="lineNum">     931 </span>                :       }
-<span class="lineNum">     932 </span>                : 
-<span class="lineNum">     933 </span>                :       move_iterator
-<span class="lineNum">     934 </span>                :       operator--(int)
-<span class="lineNum">     935 </span>                :       {
-<span class="lineNum">     936 </span>                :         move_iterator __tmp = *this;
-<span class="lineNum">     937 </span>                :         --_M_current;
-<span class="lineNum">     938 </span>                :         return __tmp;
-<span class="lineNum">     939 </span>                :       }
-<span class="lineNum">     940 </span>                : 
-<span class="lineNum">     941 </span>                :       move_iterator
-<span class="lineNum">     942 </span>                :       operator+(difference_type __n) const
-<span class="lineNum">     943 </span>                :       { return move_iterator(_M_current + __n); }
-<span class="lineNum">     944 </span>                : 
-<span class="lineNum">     945 </span>                :       move_iterator&amp;
-<span class="lineNum">     946 </span>                :       operator+=(difference_type __n)
-<span class="lineNum">     947 </span>                :       {
-<span class="lineNum">     948 </span>                :         _M_current += __n;
-<span class="lineNum">     949 </span>                :         return *this;
-<span class="lineNum">     950 </span>                :       }
-<span class="lineNum">     951 </span>                : 
-<span class="lineNum">     952 </span>                :       move_iterator
-<span class="lineNum">     953 </span>                :       operator-(difference_type __n) const
-<span class="lineNum">     954 </span>                :       { return move_iterator(_M_current - __n); }
-<span class="lineNum">     955 </span>                :     
-<span class="lineNum">     956 </span>                :       move_iterator&amp;
-<span class="lineNum">     957 </span>                :       operator-=(difference_type __n)
-<span class="lineNum">     958 </span>                :       { 
-<span class="lineNum">     959 </span>                :         _M_current -= __n;
-<span class="lineNum">     960 </span>                :         return *this;
-<span class="lineNum">     961 </span>                :       }
-<span class="lineNum">     962 </span>                : 
-<span class="lineNum">     963 </span>                :       reference
-<span class="lineNum">     964 </span>                :       operator[](difference_type __n) const
-<span class="lineNum">     965 </span>                :       { return _M_current[__n]; }
-<span class="lineNum">     966 </span>                :     };
-<span class="lineNum">     967 </span>                : 
-<span class="lineNum">     968 </span>                :   template&lt;typename _IteratorL, typename _IteratorR&gt;
-<span class="lineNum">     969 </span>                :     inline bool
-<span class="lineNum">     970 </span>                :     operator==(const move_iterator&lt;_IteratorL&gt;&amp; __x,
-<span class="lineNum">     971 </span>                :                const move_iterator&lt;_IteratorR&gt;&amp; __y)
-<span class="lineNum">     972 </span>                :     { return __x.base() == __y.base(); }
-<span class="lineNum">     973 </span>                : 
-<span class="lineNum">     974 </span>                :   template&lt;typename _IteratorL, typename _IteratorR&gt;
-<span class="lineNum">     975 </span>                :     inline bool
-<span class="lineNum">     976 </span>                :     operator!=(const move_iterator&lt;_IteratorL&gt;&amp; __x,
-<span class="lineNum">     977 </span>                :                const move_iterator&lt;_IteratorR&gt;&amp; __y)
-<span class="lineNum">     978 </span>                :     { return !(__x == __y); }
-<span class="lineNum">     979 </span>                : 
-<span class="lineNum">     980 </span>                :   template&lt;typename _IteratorL, typename _IteratorR&gt;
-<span class="lineNum">     981 </span>                :     inline bool
-<span class="lineNum">     982 </span>                :     operator&lt;(const move_iterator&lt;_IteratorL&gt;&amp; __x,
-<span class="lineNum">     983 </span>                :               const move_iterator&lt;_IteratorR&gt;&amp; __y)
-<span class="lineNum">     984 </span>                :     { return __x.base() &lt; __y.base(); }
-<span class="lineNum">     985 </span>                : 
-<span class="lineNum">     986 </span>                :   template&lt;typename _IteratorL, typename _IteratorR&gt;
-<span class="lineNum">     987 </span>                :     inline bool
-<span class="lineNum">     988 </span>                :     operator&lt;=(const move_iterator&lt;_IteratorL&gt;&amp; __x,
-<span class="lineNum">     989 </span>                :                const move_iterator&lt;_IteratorR&gt;&amp; __y)
-<span class="lineNum">     990 </span>                :     { return !(__y &lt; __x); }
-<span class="lineNum">     991 </span>                : 
-<span class="lineNum">     992 </span>                :   template&lt;typename _IteratorL, typename _IteratorR&gt;
-<span class="lineNum">     993 </span>                :     inline bool
-<span class="lineNum">     994 </span>                :     operator&gt;(const move_iterator&lt;_IteratorL&gt;&amp; __x,
-<span class="lineNum">     995 </span>                :               const move_iterator&lt;_IteratorR&gt;&amp; __y)
-<span class="lineNum">     996 </span>                :     { return __y &lt; __x; }
-<span class="lineNum">     997 </span>                : 
-<span class="lineNum">     998 </span>                :   template&lt;typename _IteratorL, typename _IteratorR&gt;
-<span class="lineNum">     999 </span>                :     inline bool
-<span class="lineNum">    1000 </span>                :     operator&gt;=(const move_iterator&lt;_IteratorL&gt;&amp; __x,
-<span class="lineNum">    1001 </span>                :                const move_iterator&lt;_IteratorR&gt;&amp; __y)
-<span class="lineNum">    1002 </span>                :     { return !(__x &lt; __y); }
-<span class="lineNum">    1003 </span>                : 
-<span class="lineNum">    1004 </span>                :   template&lt;typename _IteratorL, typename _IteratorR&gt;
-<span class="lineNum">    1005 </span>                :     inline typename move_iterator&lt;_IteratorL&gt;::difference_type
-<span class="lineNum">    1006 </span>                :     operator-(const move_iterator&lt;_IteratorL&gt;&amp; __x,
-<span class="lineNum">    1007 </span>                :               const move_iterator&lt;_IteratorR&gt;&amp; __y)
-<span class="lineNum">    1008 </span>                :     { return __x.base() - __y.base(); }
-<span class="lineNum">    1009 </span>                : 
-<span class="lineNum">    1010 </span>                :   template&lt;typename _Iterator&gt;
-<span class="lineNum">    1011 </span>                :     inline move_iterator&lt;_Iterator&gt;
-<span class="lineNum">    1012 </span>                :     operator+(typename move_iterator&lt;_Iterator&gt;::difference_type __n,
-<span class="lineNum">    1013 </span>                :               const move_iterator&lt;_Iterator&gt;&amp; __x)
-<span class="lineNum">    1014 </span>                :     { return __x + __n; }
-<span class="lineNum">    1015 </span>                : 
-<span class="lineNum">    1016 </span>                :   template&lt;typename _Iterator&gt;
-<span class="lineNum">    1017 </span>                :     inline move_iterator&lt;_Iterator&gt;
-<span class="lineNum">    1018 </span>                :     make_move_iterator(const _Iterator&amp; __i)
-<span class="lineNum">    1019 </span>                :     { return move_iterator&lt;_Iterator&gt;(__i); }
-<span class="lineNum">    1020 </span>                : 
-<span class="lineNum">    1021 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">    1022 </span>                : 
-<span class="lineNum">    1023 </span>                : #define _GLIBCXX_MAKE_MOVE_ITERATOR(_Iter) std::make_move_iterator(_Iter)
-<span class="lineNum">    1024 </span>                : #else
-<span class="lineNum">    1025 </span>                : #define _GLIBCXX_MAKE_MOVE_ITERATOR(_Iter) (_Iter)
-<span class="lineNum">    1026 </span>                : #endif // __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">    1027 </span>                : 
-<span class="lineNum">    1028 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h.gcov.html b/rep/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h.gcov.html
deleted file mode 100644
index 8486f49..0000000
--- a/rep/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h.gcov.html
+++ /dev/null
@@ -1,249 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_iterator_base_funcs.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_iterator_base_funcs.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">28</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">82.1 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">23</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // Functions used by iterators -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007
-<span class="lineNum">       4 </span>                : // Free Software Foundation, Inc.
-<span class="lineNum">       5 </span>                : //
-<span class="lineNum">       6 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       7 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       8 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">       9 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      10 </span>                : // any later version.
-<span class="lineNum">      11 </span>                : 
-<span class="lineNum">      12 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      13 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      14 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      15 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      16 </span>                : 
-<span class="lineNum">      17 </span>                : // You should have received a copy of the GNU General Public License along
-<span class="lineNum">      18 </span>                : // with this library; see the file COPYING.  If not, write to the Free
-<span class="lineNum">      19 </span>                : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-<span class="lineNum">      20 </span>                : // USA.
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      23 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      24 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      25 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      26 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      27 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      28 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      29 </span>                : // the GNU General Public License.
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : /*
-<span class="lineNum">      32 </span>                :  *
-<span class="lineNum">      33 </span>                :  * Copyright (c) 1994
-<span class="lineNum">      34 </span>                :  * Hewlett-Packard Company
-<span class="lineNum">      35 </span>                :  *
-<span class="lineNum">      36 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      37 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      38 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      39 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      40 </span>                :  * in supporting documentation.  Hewlett-Packard Company makes no
-<span class="lineNum">      41 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      42 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      43 </span>                :  *
-<span class="lineNum">      44 </span>                :  *
-<span class="lineNum">      45 </span>                :  * Copyright (c) 1996-1998
-<span class="lineNum">      46 </span>                :  * Silicon Graphics Computer Systems, Inc.
-<span class="lineNum">      47 </span>                :  *
-<span class="lineNum">      48 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      49 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      50 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      51 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      52 </span>                :  * in supporting documentation.  Silicon Graphics makes no
-<span class="lineNum">      53 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      54 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      55 </span>                :  */
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span>                : /** @file stl_iterator_base_funcs.h
-<span class="lineNum">      58 </span>                :  *  This is an internal header file, included by other library headers.
-<span class="lineNum">      59 </span>                :  *  You should not attempt to use it directly.
-<span class="lineNum">      60 </span>                :  *
-<span class="lineNum">      61 </span>                :  *  This file contains all of the general iterator-related utility
-<span class="lineNum">      62 </span>                :  *  functions, such as distance() and advance().
-<span class="lineNum">      63 </span>                :  */
-<span class="lineNum">      64 </span>                : 
-<span class="lineNum">      65 </span>                : #ifndef _STL_ITERATOR_BASE_FUNCS_H
-<span class="lineNum">      66 </span>                : #define _STL_ITERATOR_BASE_FUNCS_H 1
-<span class="lineNum">      67 </span>                : 
-<span class="lineNum">      68 </span>                : #pragma GCC system_header
-<span class="lineNum">      69 </span>                : #include &lt;bits/concept_check.h&gt;
-<span class="lineNum">      70 </span>                : 
-<span class="lineNum">      71 </span>                : _GLIBCXX_BEGIN_NAMESPACE(std)
-<span class="lineNum">      72 </span>                : 
-<span class="lineNum">      73 </span>                :   template&lt;typename _InputIterator&gt;
-<span class="lineNum">      74 </span>                :     inline typename iterator_traits&lt;_InputIterator&gt;::difference_type
-<span class="lineNum">      75 </span>                :     __distance(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">      76 </span><span class="lineCov">             13 :                input_iterator_tag)</span>
-<span class="lineNum">      77 </span>                :     {
-<span class="lineNum">      78 </span>                :       // concept requirements
-<span class="lineNum">      79 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator&gt;)
-<span class="lineNum">      80 </span>                : 
-<span class="lineNum">      81 </span><span class="lineCov">             13 :       typename iterator_traits&lt;_InputIterator&gt;::difference_type __n = 0;</span>
-<span class="lineNum">      82 </span><span class="lineCov">             37 :       while (__first != __last)</span>
-<span class="lineNum">      83 </span>                :         {
-<span class="lineNum">      84 </span><span class="lineCov">             11 :           ++__first;</span>
-<span class="lineNum">      85 </span><span class="lineCov">             11 :           ++__n;</span>
-<span class="lineNum">      86 </span>                :         }
-<span class="lineNum">      87 </span><span class="lineCov">             13 :       return __n;</span>
-<span class="lineNum">      88 </span>                :     }
-<span class="lineNum">      89 </span>                : 
-<span class="lineNum">      90 </span>                :   template&lt;typename _RandomAccessIterator&gt;
-<span class="lineNum">      91 </span>                :     inline typename iterator_traits&lt;_RandomAccessIterator&gt;::difference_type
-<span class="lineNum">      92 </span>                :     __distance(_RandomAccessIterator __first, _RandomAccessIterator __last,
-<span class="lineNum">      93 </span><span class="lineCov">           1287 :                random_access_iterator_tag)</span>
-<span class="lineNum">      94 </span>                :     {
-<span class="lineNum">      95 </span>                :       // concept requirements
-<span class="lineNum">      96 </span>                :       __glibcxx_function_requires(_RandomAccessIteratorConcept&lt;
-<span class="lineNum">      97 </span>                :                                   _RandomAccessIterator&gt;)
-<span class="lineNum">      98 </span><span class="lineCov">           1287 :       return __last - __first;</span>
-<span class="lineNum">      99 </span>                :     }
-<span class="lineNum">     100 </span>                : 
-<span class="lineNum">     101 </span>                :   /**
-<span class="lineNum">     102 </span>                :    *  @brief A generalization of pointer arithmetic.
-<span class="lineNum">     103 </span>                :    *  @param  first  An input iterator.
-<span class="lineNum">     104 </span>                :    *  @param  last  An input iterator.
-<span class="lineNum">     105 </span>                :    *  @return  The distance between them.
-<span class="lineNum">     106 </span>                :    *
-<span class="lineNum">     107 </span>                :    *  Returns @c n such that first + n == last.  This requires that @p last
-<span class="lineNum">     108 </span>                :    *  must be reachable from @p first.  Note that @c n may be negative.
-<span class="lineNum">     109 </span>                :    *
-<span class="lineNum">     110 </span>                :    *  For random access iterators, this uses their @c + and @c - operations
-<span class="lineNum">     111 </span>                :    *  and are constant time.  For other %iterator classes they are linear time.
-<span class="lineNum">     112 </span>                :   */
-<span class="lineNum">     113 </span>                :   template&lt;typename _InputIterator&gt;
-<span class="lineNum">     114 </span>                :     inline typename iterator_traits&lt;_InputIterator&gt;::difference_type
-<span class="lineNum">     115 </span><span class="lineCov">           1300 :     distance(_InputIterator __first, _InputIterator __last)</span>
-<span class="lineNum">     116 </span>                :     {
-<span class="lineNum">     117 </span>                :       // concept requirements -- taken care of in __distance
-<span class="lineNum">     118 </span>                :       return std::__distance(__first, __last,
-<span class="lineNum">     119 </span><span class="lineCov">           1300 :                              std::__iterator_category(__first));</span>
-<span class="lineNum">     120 </span>                :     }
-<span class="lineNum">     121 </span>                : 
-<span class="lineNum">     122 </span>                :   template&lt;typename _InputIterator, typename _Distance&gt;
-<span class="lineNum">     123 </span>                :     inline void
-<span class="lineNum">     124 </span><span class="lineCov">             10 :     __advance(_InputIterator&amp; __i, _Distance __n, input_iterator_tag)</span>
-<span class="lineNum">     125 </span>                :     {
-<span class="lineNum">     126 </span>                :       // concept requirements
-<span class="lineNum">     127 </span>                :       __glibcxx_function_requires(_InputIteratorConcept&lt;_InputIterator&gt;)
-<span class="lineNum">     128 </span><span class="lineCov">             41 :       while (__n--)</span>
-<span class="lineNum">     129 </span><span class="lineCov">             21 :         ++__i;</span>
-<span class="lineNum">     130 </span><span class="lineCov">             10 :     }</span>
-<span class="lineNum">     131 </span>                : 
-<span class="lineNum">     132 </span>                :   template&lt;typename _BidirectionalIterator, typename _Distance&gt;
-<span class="lineNum">     133 </span>                :     inline void
-<span class="lineNum">     134 </span>                :     __advance(_BidirectionalIterator&amp; __i, _Distance __n,
-<span class="lineNum">     135 </span><span class="lineCov">             55 :               bidirectional_iterator_tag)</span>
-<span class="lineNum">     136 </span>                :     {
-<span class="lineNum">     137 </span>                :       // concept requirements
-<span class="lineNum">     138 </span>                :       __glibcxx_function_requires(_BidirectionalIteratorConcept&lt;
-<span class="lineNum">     139 </span>                :                                   _BidirectionalIterator&gt;)
-<span class="lineNum">     140 </span><span class="lineCov">             55 :       if (__n &gt; 0)</span>
-<span class="lineNum">     141 </span><span class="lineCov">            165 :         while (__n--)</span>
-<span class="lineNum">     142 </span><span class="lineCov">             55 :           ++__i;</span>
-<span class="lineNum">     143 </span>                :       else
-<span class="lineNum">     144 </span><span class="lineNoCov">              0 :         while (__n++)</span>
-<span class="lineNum">     145 </span><span class="lineNoCov">              0 :           --__i;</span>
-<span class="lineNum">     146 </span><span class="lineCov">             55 :     }</span>
-<span class="lineNum">     147 </span>                : 
-<span class="lineNum">     148 </span>                :   template&lt;typename _RandomAccessIterator, typename _Distance&gt;
-<span class="lineNum">     149 </span>                :     inline void
-<span class="lineNum">     150 </span>                :     __advance(_RandomAccessIterator&amp; __i, _Distance __n,
-<span class="lineNum">     151 </span><span class="lineNoCov">              0 :               random_access_iterator_tag)</span>
-<span class="lineNum">     152 </span>                :     {
-<span class="lineNum">     153 </span>                :       // concept requirements
-<span class="lineNum">     154 </span>                :       __glibcxx_function_requires(_RandomAccessIteratorConcept&lt;
-<span class="lineNum">     155 </span>                :                                   _RandomAccessIterator&gt;)
-<span class="lineNum">     156 </span><span class="lineNoCov">              0 :       __i += __n;</span>
-<span class="lineNum">     157 </span><span class="lineNoCov">              0 :     }</span>
-<span class="lineNum">     158 </span>                : 
-<span class="lineNum">     159 </span>                :   /**
-<span class="lineNum">     160 </span>                :    *  @brief A generalization of pointer arithmetic.
-<span class="lineNum">     161 </span>                :    *  @param  i  An input iterator.
-<span class="lineNum">     162 </span>                :    *  @param  n  The &quot;delta&quot; by which to change @p i.
-<span class="lineNum">     163 </span>                :    *  @return  Nothing.
-<span class="lineNum">     164 </span>                :    *
-<span class="lineNum">     165 </span>                :    *  This increments @p i by @p n.  For bidirectional and random access
-<span class="lineNum">     166 </span>                :    *  iterators, @p n may be negative, in which case @p i is decremented.
-<span class="lineNum">     167 </span>                :    *
-<span class="lineNum">     168 </span>                :    *  For random access iterators, this uses their @c + and @c - operations
-<span class="lineNum">     169 </span>                :    *  and are constant time.  For other %iterator classes they are linear time.
-<span class="lineNum">     170 </span>                :   */
-<span class="lineNum">     171 </span>                :   template&lt;typename _InputIterator, typename _Distance&gt;
-<span class="lineNum">     172 </span>                :     inline void
-<span class="lineNum">     173 </span><span class="lineCov">             65 :     advance(_InputIterator&amp; __i, _Distance __n)</span>
-<span class="lineNum">     174 </span>                :     {
-<span class="lineNum">     175 </span>                :       // concept requirements -- taken care of in __advance
-<span class="lineNum">     176 </span><span class="lineCov">             65 :       typename iterator_traits&lt;_InputIterator&gt;::difference_type __d = __n;</span>
-<span class="lineNum">     177 </span><span class="lineCov">             65 :       std::__advance(__i, __d, std::__iterator_category(__i));</span>
-<span class="lineNum">     178 </span><span class="lineCov">             65 :     }</span>
-<span class="lineNum">     179 </span>                : 
-<span class="lineNum">     180 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">     181 </span>                : 
-<span class="lineNum">     182 </span>                : #endif /* _STL_ITERATOR_BASE_FUNCS_H */
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/bits/stl_iterator_base_types.h.gcov.html b/rep/usr/include/c++/4.3/bits/stl_iterator_base_types.h.gcov.html
deleted file mode 100644
index fc03082..0000000
--- a/rep/usr/include/c++/4.3/bits/stl_iterator_base_types.h.gcov.html
+++ /dev/null
@@ -1,239 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_iterator_base_types.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_iterator_base_types.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">3</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">3</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // Types used in iterator implementation -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
-<span class="lineNum">       4 </span>                : // Free Software Foundation, Inc.
-<span class="lineNum">       5 </span>                : //
-<span class="lineNum">       6 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       7 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       8 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">       9 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      10 </span>                : // any later version.
-<span class="lineNum">      11 </span>                : 
-<span class="lineNum">      12 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      13 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      14 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      15 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      16 </span>                : 
-<span class="lineNum">      17 </span>                : // You should have received a copy of the GNU General Public License along
-<span class="lineNum">      18 </span>                : // with this library; see the file COPYING.  If not, write to the Free
-<span class="lineNum">      19 </span>                : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-<span class="lineNum">      20 </span>                : // USA.
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      23 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      24 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      25 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      26 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      27 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      28 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      29 </span>                : // the GNU General Public License.
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : /*
-<span class="lineNum">      32 </span>                :  *
-<span class="lineNum">      33 </span>                :  * Copyright (c) 1994
-<span class="lineNum">      34 </span>                :  * Hewlett-Packard Company
-<span class="lineNum">      35 </span>                :  *
-<span class="lineNum">      36 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      37 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      38 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      39 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      40 </span>                :  * in supporting documentation.  Hewlett-Packard Company makes no
-<span class="lineNum">      41 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      42 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      43 </span>                :  *
-<span class="lineNum">      44 </span>                :  *
-<span class="lineNum">      45 </span>                :  * Copyright (c) 1996-1998
-<span class="lineNum">      46 </span>                :  * Silicon Graphics Computer Systems, Inc.
-<span class="lineNum">      47 </span>                :  *
-<span class="lineNum">      48 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      49 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      50 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      51 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      52 </span>                :  * in supporting documentation.  Silicon Graphics makes no
-<span class="lineNum">      53 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      54 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      55 </span>                :  */
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span>                : /** @file stl_iterator_base_types.h
-<span class="lineNum">      58 </span>                :  *  This is an internal header file, included by other library headers.
-<span class="lineNum">      59 </span>                :  *  You should not attempt to use it directly.
-<span class="lineNum">      60 </span>                :  *
-<span class="lineNum">      61 </span>                :  *  This file contains all of the general iterator-related utility types,
-<span class="lineNum">      62 </span>                :  *  such as iterator_traits and struct iterator.
-<span class="lineNum">      63 </span>                :  */
-<span class="lineNum">      64 </span>                : 
-<span class="lineNum">      65 </span>                : #ifndef _STL_ITERATOR_BASE_TYPES_H
-<span class="lineNum">      66 </span>                : #define _STL_ITERATOR_BASE_TYPES_H 1
-<span class="lineNum">      67 </span>                : 
-<span class="lineNum">      68 </span>                : #pragma GCC system_header
-<span class="lineNum">      69 </span>                : 
-<span class="lineNum">      70 </span>                : #include &lt;bits/c++config.h&gt;
-<span class="lineNum">      71 </span>                : #include &lt;cstddef&gt;
-<span class="lineNum">      72 </span>                : 
-<span class="lineNum">      73 </span>                : _GLIBCXX_BEGIN_NAMESPACE(std)
-<span class="lineNum">      74 </span>                : 
-<span class="lineNum">      75 </span>                :   //@{
-<span class="lineNum">      76 </span>                :   /**
-<span class="lineNum">      77 </span>                :    *  @defgroup iterator_tags Iterator Tags
-<span class="lineNum">      78 </span>                :    *  These are empty types, used to distinguish different iterators.  The
-<span class="lineNum">      79 </span>                :    *  distinction is not made by what they contain, but simply by what they
-<span class="lineNum">      80 </span>                :    *  are.  Different underlying algorithms can then be used based on the
-<span class="lineNum">      81 </span>                :    *  different operations supported by different iterator types.
-<span class="lineNum">      82 </span>                :   */
-<span class="lineNum">      83 </span>                :   ///  Marking input iterators.
-<span class="lineNum">      84 </span>                :   struct input_iterator_tag {};
-<span class="lineNum">      85 </span>                :   ///  Marking output iterators.
-<span class="lineNum">      86 </span>                :   struct output_iterator_tag {};
-<span class="lineNum">      87 </span>                :   /// Forward iterators support a superset of input iterator operations.
-<span class="lineNum">      88 </span>                :   struct forward_iterator_tag : public input_iterator_tag {};
-<span class="lineNum">      89 </span>                :   /// Bidirectional iterators support a superset of forward iterator
-<span class="lineNum">      90 </span>                :   /// operations.
-<span class="lineNum">      91 </span>                :   struct bidirectional_iterator_tag : public forward_iterator_tag {};
-<span class="lineNum">      92 </span>                :   /// Random-access iterators support a superset of bidirectional iterator
-<span class="lineNum">      93 </span>                :   /// operations.
-<span class="lineNum">      94 </span>                :   struct random_access_iterator_tag : public bidirectional_iterator_tag {};
-<span class="lineNum">      95 </span>                :   //@}
-<span class="lineNum">      96 </span>                : 
-<span class="lineNum">      97 </span>                : 
-<span class="lineNum">      98 </span>                :   /**
-<span class="lineNum">      99 </span>                :    *  @brief  Common %iterator class.
-<span class="lineNum">     100 </span>                :    *
-<span class="lineNum">     101 </span>                :    *  This class does nothing but define nested typedefs.  %Iterator classes
-<span class="lineNum">     102 </span>                :    *  can inherit from this class to save some work.  The typedefs are then
-<span class="lineNum">     103 </span>                :    *  used in specializations and overloading.
-<span class="lineNum">     104 </span>                :    *
-<span class="lineNum">     105 </span>                :    *  In particular, there are no default implementations of requirements
-<span class="lineNum">     106 </span>                :    *  such as @c operator++ and the like.  (How could there be?)
-<span class="lineNum">     107 </span>                :   */
-<span class="lineNum">     108 </span>                :   template&lt;typename _Category, typename _Tp, typename _Distance = ptrdiff_t,
-<span class="lineNum">     109 </span>                :            typename _Pointer = _Tp*, typename _Reference = _Tp&amp;&gt;
-<span class="lineNum">     110 </span>                :     struct iterator
-<span class="lineNum">     111 </span><span class="lineCov">         304336 :     {</span>
-<span class="lineNum">     112 </span>                :       /// One of the @link iterator_tags tag types@endlink.
-<span class="lineNum">     113 </span>                :       typedef _Category  iterator_category;
-<span class="lineNum">     114 </span>                :       /// The type &quot;pointed to&quot; by the iterator.
-<span class="lineNum">     115 </span>                :       typedef _Tp        value_type;
-<span class="lineNum">     116 </span>                :       /// Distance between iterators is represented as this type.
-<span class="lineNum">     117 </span>                :       typedef _Distance  difference_type;
-<span class="lineNum">     118 </span>                :       /// This type represents a pointer-to-value_type.
-<span class="lineNum">     119 </span>                :       typedef _Pointer   pointer;
-<span class="lineNum">     120 </span>                :       /// This type represents a reference-to-value_type.
-<span class="lineNum">     121 </span>                :       typedef _Reference reference;
-<span class="lineNum">     122 </span>                :     };
-<span class="lineNum">     123 </span>                : 
-<span class="lineNum">     124 </span>                :   /**
-<span class="lineNum">     125 </span>                :    *  This class does nothing but define nested typedefs.  The general
-<span class="lineNum">     126 </span>                :    *  version simply &quot;forwards&quot; the nested typedefs from the Iterator
-<span class="lineNum">     127 </span>                :    *  argument.  Specialized versions for pointers and pointers-to-const
-<span class="lineNum">     128 </span>                :    *  provide tighter, more correct semantics.
-<span class="lineNum">     129 </span>                :   */
-<span class="lineNum">     130 </span>                :   template&lt;typename _Iterator&gt;
-<span class="lineNum">     131 </span>                :     struct iterator_traits
-<span class="lineNum">     132 </span>                :     {
-<span class="lineNum">     133 </span>                :       typedef typename _Iterator::iterator_category iterator_category;
-<span class="lineNum">     134 </span>                :       typedef typename _Iterator::value_type        value_type;
-<span class="lineNum">     135 </span>                :       typedef typename _Iterator::difference_type   difference_type;
-<span class="lineNum">     136 </span>                :       typedef typename _Iterator::pointer           pointer;
-<span class="lineNum">     137 </span>                :       typedef typename _Iterator::reference         reference;
-<span class="lineNum">     138 </span>                :     };
-<span class="lineNum">     139 </span>                : 
-<span class="lineNum">     140 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     141 </span>                :     struct iterator_traits&lt;_Tp*&gt;
-<span class="lineNum">     142 </span>                :     {
-<span class="lineNum">     143 </span>                :       typedef random_access_iterator_tag iterator_category;
-<span class="lineNum">     144 </span>                :       typedef _Tp                         value_type;
-<span class="lineNum">     145 </span>                :       typedef ptrdiff_t                   difference_type;
-<span class="lineNum">     146 </span>                :       typedef _Tp*                        pointer;
-<span class="lineNum">     147 </span>                :       typedef _Tp&amp;                        reference;
-<span class="lineNum">     148 </span>                :     };
-<span class="lineNum">     149 </span>                : 
-<span class="lineNum">     150 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     151 </span>                :     struct iterator_traits&lt;const _Tp*&gt;
-<span class="lineNum">     152 </span>                :     {
-<span class="lineNum">     153 </span>                :       typedef random_access_iterator_tag iterator_category;
-<span class="lineNum">     154 </span>                :       typedef _Tp                         value_type;
-<span class="lineNum">     155 </span>                :       typedef ptrdiff_t                   difference_type;
-<span class="lineNum">     156 </span>                :       typedef const _Tp*                  pointer;
-<span class="lineNum">     157 </span>                :       typedef const _Tp&amp;                  reference;
-<span class="lineNum">     158 </span>                :     };
-<span class="lineNum">     159 </span>                : 
-<span class="lineNum">     160 </span>                :   /**
-<span class="lineNum">     161 </span>                :    *  This function is not a part of the C++ standard but is syntactic
-<span class="lineNum">     162 </span>                :    *  sugar for internal library use only.
-<span class="lineNum">     163 </span>                :   */
-<span class="lineNum">     164 </span>                :   template&lt;typename _Iter&gt;
-<span class="lineNum">     165 </span>                :     inline typename iterator_traits&lt;_Iter&gt;::iterator_category
-<span class="lineNum">     166 </span><span class="lineCov">           4730 :     __iterator_category(const _Iter&amp;)</span>
-<span class="lineNum">     167 </span><span class="lineCov">           4730 :     { return typename iterator_traits&lt;_Iter&gt;::iterator_category(); }</span>
-<span class="lineNum">     168 </span>                : 
-<span class="lineNum">     169 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">     170 </span>                : 
-<span class="lineNum">     171 </span>                : #endif /* _STL_ITERATOR_BASE_TYPES_H */
-<span class="lineNum">     172 </span>                : 
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/bits/stl_list.h.gcov.html b/rep/usr/include/c++/4.3/bits/stl_list.h.gcov.html
deleted file mode 100644
index 9abdf8e..0000000
--- a/rep/usr/include/c++/4.3/bits/stl_list.h.gcov.html
+++ /dev/null
@@ -1,1530 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_list.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_list.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">94</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">93.6 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">88</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // List implementation -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
-<span class="lineNum">       4 </span>                : // Free Software Foundation, Inc.
-<span class="lineNum">       5 </span>                : //
-<span class="lineNum">       6 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       7 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       8 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">       9 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      10 </span>                : // any later version.
-<span class="lineNum">      11 </span>                : 
-<span class="lineNum">      12 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      13 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      14 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      15 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      16 </span>                : 
-<span class="lineNum">      17 </span>                : // You should have received a copy of the GNU General Public License along
-<span class="lineNum">      18 </span>                : // with this library; see the file COPYING.  If not, write to the Free
-<span class="lineNum">      19 </span>                : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-<span class="lineNum">      20 </span>                : // USA.
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      23 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      24 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      25 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      26 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      27 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      28 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      29 </span>                : // the GNU General Public License.
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : /*
-<span class="lineNum">      32 </span>                :  *
-<span class="lineNum">      33 </span>                :  * Copyright (c) 1994
-<span class="lineNum">      34 </span>                :  * Hewlett-Packard Company
-<span class="lineNum">      35 </span>                :  *
-<span class="lineNum">      36 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      37 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      38 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      39 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      40 </span>                :  * in supporting documentation.  Hewlett-Packard Company makes no
-<span class="lineNum">      41 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      42 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      43 </span>                :  *
-<span class="lineNum">      44 </span>                :  *
-<span class="lineNum">      45 </span>                :  * Copyright (c) 1996,1997
-<span class="lineNum">      46 </span>                :  * Silicon Graphics Computer Systems, Inc.
-<span class="lineNum">      47 </span>                :  *
-<span class="lineNum">      48 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      49 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      50 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      51 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      52 </span>                :  * in supporting documentation.  Silicon Graphics makes no
-<span class="lineNum">      53 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      54 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      55 </span>                :  */
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span>                : /** @file stl_list.h
-<span class="lineNum">      58 </span>                :  *  This is an internal header file, included by other library headers.
-<span class="lineNum">      59 </span>                :  *  You should not attempt to use it directly.
-<span class="lineNum">      60 </span>                :  */
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span>                : #ifndef _STL_LIST_H
-<span class="lineNum">      63 </span>                : #define _STL_LIST_H 1
-<span class="lineNum">      64 </span>                : 
-<span class="lineNum">      65 </span>                : #include &lt;bits/concept_check.h&gt;
-<span class="lineNum">      66 </span>                : 
-<span class="lineNum">      67 </span>                : _GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D)
-<span class="lineNum">      68 </span>                : 
-<span class="lineNum">      69 </span>                :   // Supporting structures are split into common and templated types; the
-<span class="lineNum">      70 </span>                :   // latter publicly inherits from the former in an effort to reduce code
-<span class="lineNum">      71 </span>                :   // duplication.  This results in some &quot;needless&quot; static_cast'ing later on,
-<span class="lineNum">      72 </span>                :   // but it's all safe downcasting.
-<span class="lineNum">      73 </span>                : 
-<span class="lineNum">      74 </span>                :   /// Common part of a node in the %list. 
-<span class="lineNum">      75 </span>                :   struct _List_node_base
-<span class="lineNum">      76 </span>                :   {
-<span class="lineNum">      77 </span>                :     _List_node_base* _M_next;
-<span class="lineNum">      78 </span>                :     _List_node_base* _M_prev;
-<span class="lineNum">      79 </span>                : 
-<span class="lineNum">      80 </span>                :     static void
-<span class="lineNum">      81 </span>                :     swap(_List_node_base&amp; __x, _List_node_base&amp; __y);
-<span class="lineNum">      82 </span>                : 
-<span class="lineNum">      83 </span>                :     void
-<span class="lineNum">      84 </span>                :     transfer(_List_node_base * const __first,
-<span class="lineNum">      85 </span>                :              _List_node_base * const __last);
-<span class="lineNum">      86 </span>                : 
-<span class="lineNum">      87 </span>                :     void
-<span class="lineNum">      88 </span>                :     reverse();
-<span class="lineNum">      89 </span>                : 
-<span class="lineNum">      90 </span>                :     void
-<span class="lineNum">      91 </span>                :     hook(_List_node_base * const __position);
-<span class="lineNum">      92 </span>                : 
-<span class="lineNum">      93 </span>                :     void
-<span class="lineNum">      94 </span>                :     unhook();
-<span class="lineNum">      95 </span>                :   };
-<span class="lineNum">      96 </span>                : 
-<span class="lineNum">      97 </span>                :   /// An actual node in the %list.
-<span class="lineNum">      98 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">      99 </span>                :     struct _List_node : public _List_node_base
-<span class="lineNum">     100 </span>                :     {
-<span class="lineNum">     101 </span>                :       ///&lt; User's data.
-<span class="lineNum">     102 </span>                :       _Tp _M_data;
-<span class="lineNum">     103 </span>                :     };
-<span class="lineNum">     104 </span>                : 
-<span class="lineNum">     105 </span>                :   /**
-<span class="lineNum">     106 </span>                :    *  @brief A list::iterator.
-<span class="lineNum">     107 </span>                :    *
-<span class="lineNum">     108 </span>                :    *  All the functions are op overloads.
-<span class="lineNum">     109 </span>                :   */
-<span class="lineNum">     110 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     111 </span>                :     struct _List_iterator
-<span class="lineNum">     112 </span>                :     {
-<span class="lineNum">     113 </span>                :       typedef _List_iterator&lt;_Tp&gt;                _Self;
-<span class="lineNum">     114 </span>                :       typedef _List_node&lt;_Tp&gt;                    _Node;
-<span class="lineNum">     115 </span>                : 
-<span class="lineNum">     116 </span>                :       typedef ptrdiff_t                          difference_type;
-<span class="lineNum">     117 </span>                :       typedef std::bidirectional_iterator_tag    iterator_category;
-<span class="lineNum">     118 </span>                :       typedef _Tp                                value_type;
-<span class="lineNum">     119 </span>                :       typedef _Tp*                               pointer;
-<span class="lineNum">     120 </span>                :       typedef _Tp&amp;                               reference;
-<span class="lineNum">     121 </span>                : 
-<span class="lineNum">     122 </span>                :       _List_iterator()
-<span class="lineNum">     123 </span>                :       : _M_node() { }
-<span class="lineNum">     124 </span>                : 
-<span class="lineNum">     125 </span>                :       explicit
-<span class="lineNum">     126 </span><span class="lineCov">            206 :       _List_iterator(_List_node_base* __x)</span>
-<span class="lineNum">     127 </span><span class="lineCov">            206 :       : _M_node(__x) { }</span>
-<span class="lineNum">     128 </span>                : 
-<span class="lineNum">     129 </span>                :       // Must downcast from List_node_base to _List_node to get to _M_data.
-<span class="lineNum">     130 </span>                :       reference
-<span class="lineNum">     131 </span><span class="lineCov">             99 :       operator*() const</span>
-<span class="lineNum">     132 </span><span class="lineCov">             99 :       { return static_cast&lt;_Node*&gt;(_M_node)-&gt;_M_data; }</span>
-<span class="lineNum">     133 </span>                : 
-<span class="lineNum">     134 </span>                :       pointer
-<span class="lineNum">     135 </span>                :       operator-&gt;() const
-<span class="lineNum">     136 </span>                :       { return &amp;static_cast&lt;_Node*&gt;(_M_node)-&gt;_M_data; }
-<span class="lineNum">     137 </span>                : 
-<span class="lineNum">     138 </span>                :       _Self&amp;
-<span class="lineNum">     139 </span><span class="lineCov">             63 :       operator++()</span>
-<span class="lineNum">     140 </span>                :       {
-<span class="lineNum">     141 </span><span class="lineCov">             63 :         _M_node = _M_node-&gt;_M_next;</span>
-<span class="lineNum">     142 </span><span class="lineCov">             63 :         return *this;</span>
-<span class="lineNum">     143 </span>                :       }
-<span class="lineNum">     144 </span>                : 
-<span class="lineNum">     145 </span>                :       _Self
-<span class="lineNum">     146 </span><span class="lineNoCov">              0 :       operator++(int)</span>
-<span class="lineNum">     147 </span>                :       {
-<span class="lineNum">     148 </span><span class="lineNoCov">              0 :         _Self __tmp = *this;</span>
-<span class="lineNum">     149 </span><span class="lineNoCov">              0 :         _M_node = _M_node-&gt;_M_next;</span>
-<span class="lineNum">     150 </span>                :         return __tmp;
-<span class="lineNum">     151 </span>                :       }
-<span class="lineNum">     152 </span>                : 
-<span class="lineNum">     153 </span>                :       _Self&amp;
-<span class="lineNum">     154 </span><span class="lineCov">              1 :       operator--()</span>
-<span class="lineNum">     155 </span>                :       {
-<span class="lineNum">     156 </span><span class="lineCov">              1 :         _M_node = _M_node-&gt;_M_prev;</span>
-<span class="lineNum">     157 </span><span class="lineCov">              1 :         return *this;</span>
-<span class="lineNum">     158 </span>                :       }
-<span class="lineNum">     159 </span>                : 
-<span class="lineNum">     160 </span>                :       _Self
-<span class="lineNum">     161 </span>                :       operator--(int)
-<span class="lineNum">     162 </span>                :       {
-<span class="lineNum">     163 </span>                :         _Self __tmp = *this;
-<span class="lineNum">     164 </span>                :         _M_node = _M_node-&gt;_M_prev;
-<span class="lineNum">     165 </span>                :         return __tmp;
-<span class="lineNum">     166 </span>                :       }
-<span class="lineNum">     167 </span>                : 
-<span class="lineNum">     168 </span>                :       bool
-<span class="lineNum">     169 </span><span class="lineCov">            108 :       operator==(const _Self&amp; __x) const</span>
-<span class="lineNum">     170 </span><span class="lineCov">            108 :       { return _M_node == __x._M_node; }</span>
-<span class="lineNum">     171 </span>                : 
-<span class="lineNum">     172 </span>                :       bool
-<span class="lineNum">     173 </span><span class="lineCov">             42 :       operator!=(const _Self&amp; __x) const</span>
-<span class="lineNum">     174 </span><span class="lineCov">             42 :       { return _M_node != __x._M_node; }</span>
-<span class="lineNum">     175 </span>                : 
-<span class="lineNum">     176 </span>                :       // The only member points to the %list element.
-<span class="lineNum">     177 </span>                :       _List_node_base* _M_node;
-<span class="lineNum">     178 </span>                :     };
-<span class="lineNum">     179 </span>                : 
-<span class="lineNum">     180 </span>                :   /**
-<span class="lineNum">     181 </span>                :    *  @brief A list::const_iterator.
-<span class="lineNum">     182 </span>                :    *
-<span class="lineNum">     183 </span>                :    *  All the functions are op overloads.
-<span class="lineNum">     184 </span>                :   */
-<span class="lineNum">     185 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     186 </span>                :     struct _List_const_iterator
-<span class="lineNum">     187 </span>                :     {
-<span class="lineNum">     188 </span>                :       typedef _List_const_iterator&lt;_Tp&gt;          _Self;
-<span class="lineNum">     189 </span>                :       typedef const _List_node&lt;_Tp&gt;              _Node;
-<span class="lineNum">     190 </span>                :       typedef _List_iterator&lt;_Tp&gt;                iterator;
-<span class="lineNum">     191 </span>                : 
-<span class="lineNum">     192 </span>                :       typedef ptrdiff_t                          difference_type;
-<span class="lineNum">     193 </span>                :       typedef std::bidirectional_iterator_tag    iterator_category;
-<span class="lineNum">     194 </span>                :       typedef _Tp                                value_type;
-<span class="lineNum">     195 </span>                :       typedef const _Tp*                         pointer;
-<span class="lineNum">     196 </span>                :       typedef const _Tp&amp;                         reference;
-<span class="lineNum">     197 </span>                : 
-<span class="lineNum">     198 </span>                :       _List_const_iterator()
-<span class="lineNum">     199 </span>                :       : _M_node() { }
-<span class="lineNum">     200 </span>                : 
-<span class="lineNum">     201 </span>                :       explicit
-<span class="lineNum">     202 </span><span class="lineCov">             42 :       _List_const_iterator(const _List_node_base* __x)</span>
-<span class="lineNum">     203 </span><span class="lineCov">             42 :       : _M_node(__x) { }</span>
-<span class="lineNum">     204 </span>                : 
-<span class="lineNum">     205 </span>                :       _List_const_iterator(const iterator&amp; __x)
-<span class="lineNum">     206 </span>                :       : _M_node(__x._M_node) { }
-<span class="lineNum">     207 </span>                : 
-<span class="lineNum">     208 </span>                :       // Must downcast from List_node_base to _List_node to get to
-<span class="lineNum">     209 </span>                :       // _M_data.
-<span class="lineNum">     210 </span>                :       reference
-<span class="lineNum">     211 </span><span class="lineCov">              8 :       operator*() const</span>
-<span class="lineNum">     212 </span><span class="lineCov">              8 :       { return static_cast&lt;_Node*&gt;(_M_node)-&gt;_M_data; }</span>
-<span class="lineNum">     213 </span>                : 
-<span class="lineNum">     214 </span>                :       pointer
-<span class="lineNum">     215 </span>                :       operator-&gt;() const
-<span class="lineNum">     216 </span>                :       { return &amp;static_cast&lt;_Node*&gt;(_M_node)-&gt;_M_data; }
-<span class="lineNum">     217 </span>                : 
-<span class="lineNum">     218 </span>                :       _Self&amp;
-<span class="lineNum">     219 </span><span class="lineCov">             19 :       operator++()</span>
-<span class="lineNum">     220 </span>                :       {
-<span class="lineNum">     221 </span><span class="lineCov">             19 :         _M_node = _M_node-&gt;_M_next;</span>
-<span class="lineNum">     222 </span><span class="lineCov">             19 :         return *this;</span>
-<span class="lineNum">     223 </span>                :       }
-<span class="lineNum">     224 </span>                : 
-<span class="lineNum">     225 </span>                :       _Self
-<span class="lineNum">     226 </span>                :       operator++(int)
-<span class="lineNum">     227 </span>                :       {
-<span class="lineNum">     228 </span>                :         _Self __tmp = *this;
-<span class="lineNum">     229 </span>                :         _M_node = _M_node-&gt;_M_next;
-<span class="lineNum">     230 </span>                :         return __tmp;
-<span class="lineNum">     231 </span>                :       }
-<span class="lineNum">     232 </span>                : 
-<span class="lineNum">     233 </span>                :       _Self&amp;
-<span class="lineNum">     234 </span>                :       operator--()
-<span class="lineNum">     235 </span>                :       {
-<span class="lineNum">     236 </span>                :         _M_node = _M_node-&gt;_M_prev;
-<span class="lineNum">     237 </span>                :         return *this;
-<span class="lineNum">     238 </span>                :       }
-<span class="lineNum">     239 </span>                : 
-<span class="lineNum">     240 </span>                :       _Self
-<span class="lineNum">     241 </span>                :       operator--(int)
-<span class="lineNum">     242 </span>                :       {
-<span class="lineNum">     243 </span>                :         _Self __tmp = *this;
-<span class="lineNum">     244 </span>                :         _M_node = _M_node-&gt;_M_prev;
-<span class="lineNum">     245 </span>                :         return __tmp;
-<span class="lineNum">     246 </span>                :       }
-<span class="lineNum">     247 </span>                : 
-<span class="lineNum">     248 </span>                :       bool
-<span class="lineNum">     249 </span><span class="lineCov">              6 :       operator==(const _Self&amp; __x) const</span>
-<span class="lineNum">     250 </span><span class="lineCov">              6 :       { return _M_node == __x._M_node; }</span>
-<span class="lineNum">     251 </span>                : 
-<span class="lineNum">     252 </span>                :       bool
-<span class="lineNum">     253 </span><span class="lineCov">             38 :       operator!=(const _Self&amp; __x) const</span>
-<span class="lineNum">     254 </span><span class="lineCov">             38 :       { return _M_node != __x._M_node; }</span>
-<span class="lineNum">     255 </span>                : 
-<span class="lineNum">     256 </span>                :       // The only member points to the %list element.
-<span class="lineNum">     257 </span>                :       const _List_node_base* _M_node;
-<span class="lineNum">     258 </span>                :     };
-<span class="lineNum">     259 </span>                : 
-<span class="lineNum">     260 </span>                :   template&lt;typename _Val&gt;
-<span class="lineNum">     261 </span>                :     inline bool
-<span class="lineNum">     262 </span>                :     operator==(const _List_iterator&lt;_Val&gt;&amp; __x,
-<span class="lineNum">     263 </span>                :                const _List_const_iterator&lt;_Val&gt;&amp; __y)
-<span class="lineNum">     264 </span>                :     { return __x._M_node == __y._M_node; }
-<span class="lineNum">     265 </span>                : 
-<span class="lineNum">     266 </span>                :   template&lt;typename _Val&gt;
-<span class="lineNum">     267 </span>                :     inline bool
-<span class="lineNum">     268 </span>                :     operator!=(const _List_iterator&lt;_Val&gt;&amp; __x,
-<span class="lineNum">     269 </span>                :                const _List_const_iterator&lt;_Val&gt;&amp; __y)
-<span class="lineNum">     270 </span>                :     { return __x._M_node != __y._M_node; }
-<span class="lineNum">     271 </span>                : 
-<span class="lineNum">     272 </span>                : 
-<span class="lineNum">     273 </span>                :   /// See bits/stl_deque.h's _Deque_base for an explanation.
-<span class="lineNum">     274 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     275 </span>                :     class _List_base
-<span class="lineNum">     276 </span>                :     {
-<span class="lineNum">     277 </span>                :     protected:
-<span class="lineNum">     278 </span>                :       // NOTA BENE
-<span class="lineNum">     279 </span>                :       // The stored instance is not actually of &quot;allocator_type&quot;'s
-<span class="lineNum">     280 </span>                :       // type.  Instead we rebind the type to
-<span class="lineNum">     281 </span>                :       // Allocator&lt;List_node&lt;Tp&gt;&gt;, which according to [20.1.5]/4
-<span class="lineNum">     282 </span>                :       // should probably be the same.  List_node&lt;Tp&gt; is not the same
-<span class="lineNum">     283 </span>                :       // size as Tp (it's two pointers larger), and specializations on
-<span class="lineNum">     284 </span>                :       // Tp may go unused because List_node&lt;Tp&gt; is being bound
-<span class="lineNum">     285 </span>                :       // instead.
-<span class="lineNum">     286 </span>                :       //
-<span class="lineNum">     287 </span>                :       // We put this to the test in the constructors and in
-<span class="lineNum">     288 </span>                :       // get_allocator, where we use conversions between
-<span class="lineNum">     289 </span>                :       // allocator_type and _Node_alloc_type. The conversion is
-<span class="lineNum">     290 </span>                :       // required by table 32 in [20.1.5].
-<span class="lineNum">     291 </span>                :       typedef typename _Alloc::template rebind&lt;_List_node&lt;_Tp&gt; &gt;::other
-<span class="lineNum">     292 </span>                :         _Node_alloc_type;
-<span class="lineNum">     293 </span>                : 
-<span class="lineNum">     294 </span>                :       typedef typename _Alloc::template rebind&lt;_Tp&gt;::other _Tp_alloc_type;
-<span class="lineNum">     295 </span>                : 
-<span class="lineNum">     296 </span>                :       struct _List_impl 
-<span class="lineNum">     297 </span>                :       : public _Node_alloc_type
-<span class="lineNum">     298 </span><span class="lineCov">             19 :       {</span>
-<span class="lineNum">     299 </span>                :         _List_node_base _M_node;
-<span class="lineNum">     300 </span>                : 
-<span class="lineNum">     301 </span><span class="lineCov">             19 :         _List_impl()</span>
-<span class="lineNum">     302 </span><span class="lineCov">             19 :         : _Node_alloc_type(), _M_node()</span>
-<span class="lineNum">     303 </span><span class="lineCov">             19 :         { }</span>
-<span class="lineNum">     304 </span>                : 
-<span class="lineNum">     305 </span>                :         _List_impl(const _Node_alloc_type&amp; __a)
-<span class="lineNum">     306 </span>                :         : _Node_alloc_type(__a), _M_node()
-<span class="lineNum">     307 </span>                :         { }
-<span class="lineNum">     308 </span>                :       };
-<span class="lineNum">     309 </span>                : 
-<span class="lineNum">     310 </span>                :       _List_impl _M_impl;
-<span class="lineNum">     311 </span>                : 
-<span class="lineNum">     312 </span>                :       _List_node&lt;_Tp&gt;*
-<span class="lineNum">     313 </span><span class="lineCov">             47 :       _M_get_node()</span>
-<span class="lineNum">     314 </span><span class="lineCov">             47 :       { return _M_impl._Node_alloc_type::allocate(1); }</span>
-<span class="lineNum">     315 </span>                :       
-<span class="lineNum">     316 </span>                :       void
-<span class="lineNum">     317 </span><span class="lineCov">             47 :       _M_put_node(_List_node&lt;_Tp&gt;* __p)</span>
-<span class="lineNum">     318 </span><span class="lineCov">             47 :       { _M_impl._Node_alloc_type::deallocate(__p, 1); }</span>
-<span class="lineNum">     319 </span>                :       
-<span class="lineNum">     320 </span>                :   public:
-<span class="lineNum">     321 </span>                :       typedef _Alloc allocator_type;
-<span class="lineNum">     322 </span>                : 
-<span class="lineNum">     323 </span>                :       _Node_alloc_type&amp;
-<span class="lineNum">     324 </span>                :       _M_get_Node_allocator()
-<span class="lineNum">     325 </span>                :       { return *static_cast&lt;_Node_alloc_type*&gt;(&amp;this-&gt;_M_impl); }
-<span class="lineNum">     326 </span>                : 
-<span class="lineNum">     327 </span>                :       const _Node_alloc_type&amp;
-<span class="lineNum">     328 </span><span class="lineCov">             94 :       _M_get_Node_allocator() const</span>
-<span class="lineNum">     329 </span><span class="lineCov">             94 :       { return *static_cast&lt;const _Node_alloc_type*&gt;(&amp;this-&gt;_M_impl); }</span>
-<span class="lineNum">     330 </span>                : 
-<span class="lineNum">     331 </span>                :       _Tp_alloc_type
-<span class="lineNum">     332 </span><span class="lineCov">             94 :       _M_get_Tp_allocator() const</span>
-<span class="lineNum">     333 </span><span class="lineCov">             94 :       { return _Tp_alloc_type(_M_get_Node_allocator()); }</span>
-<span class="lineNum">     334 </span>                : 
-<span class="lineNum">     335 </span>                :       allocator_type
-<span class="lineNum">     336 </span>                :       get_allocator() const
-<span class="lineNum">     337 </span>                :       { return allocator_type(_M_get_Node_allocator()); }
-<span class="lineNum">     338 </span>                : 
-<span class="lineNum">     339 </span><span class="lineCov">             19 :       _List_base()</span>
-<span class="lineNum">     340 </span><span class="lineCov">             19 :       : _M_impl()</span>
-<span class="lineNum">     341 </span><span class="lineCov">             19 :       { _M_init(); }</span>
-<span class="lineNum">     342 </span>                : 
-<span class="lineNum">     343 </span>                :       _List_base(const allocator_type&amp; __a)
-<span class="lineNum">     344 </span>                :       : _M_impl(__a)
-<span class="lineNum">     345 </span>                :       { _M_init(); }
-<span class="lineNum">     346 </span>                : 
-<span class="lineNum">     347 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     348 </span>                :       _List_base(_List_base&amp;&amp; __x)
-<span class="lineNum">     349 </span>                :       : _M_impl(__x._M_get_Node_allocator())
-<span class="lineNum">     350 </span>                :       {
-<span class="lineNum">     351 </span>                :         _M_init();
-<span class="lineNum">     352 </span>                :         _List_node_base::swap(this-&gt;_M_impl._M_node, __x._M_impl._M_node);   
-<span class="lineNum">     353 </span>                :       }
-<span class="lineNum">     354 </span>                : #endif
-<span class="lineNum">     355 </span>                : 
-<span class="lineNum">     356 </span>                :       // This is what actually destroys the list.
-<span class="lineNum">     357 </span><span class="lineCov">             19 :       ~_List_base()</span>
-<span class="lineNum">     358 </span><span class="lineCov">             19 :       { _M_clear(); }</span>
-<span class="lineNum">     359 </span>                : 
-<span class="lineNum">     360 </span>                :       void
-<span class="lineNum">     361 </span>                :       _M_clear();
-<span class="lineNum">     362 </span>                : 
-<span class="lineNum">     363 </span>                :       void
-<span class="lineNum">     364 </span><span class="lineCov">             19 :       _M_init()</span>
-<span class="lineNum">     365 </span>                :       {
-<span class="lineNum">     366 </span><span class="lineCov">             19 :         this-&gt;_M_impl._M_node._M_next = &amp;this-&gt;_M_impl._M_node;</span>
-<span class="lineNum">     367 </span><span class="lineCov">             19 :         this-&gt;_M_impl._M_node._M_prev = &amp;this-&gt;_M_impl._M_node;</span>
-<span class="lineNum">     368 </span><span class="lineCov">             19 :       }</span>
-<span class="lineNum">     369 </span>                :     };
-<span class="lineNum">     370 </span>                : 
-<span class="lineNum">     371 </span>                :   /**
-<span class="lineNum">     372 </span>                :    *  @brief A standard container with linear time access to elements,
-<span class="lineNum">     373 </span>                :    *  and fixed time insertion/deletion at any point in the sequence.
-<span class="lineNum">     374 </span>                :    *
-<span class="lineNum">     375 </span>                :    *  @ingroup Containers
-<span class="lineNum">     376 </span>                :    *  @ingroup Sequences
-<span class="lineNum">     377 </span>                :    *
-<span class="lineNum">     378 </span>                :    *  Meets the requirements of a &lt;a href=&quot;tables.html#65&quot;&gt;container&lt;/a&gt;, a
-<span class="lineNum">     379 </span>                :    *  &lt;a href=&quot;tables.html#66&quot;&gt;reversible container&lt;/a&gt;, and a
-<span class="lineNum">     380 </span>                :    *  &lt;a href=&quot;tables.html#67&quot;&gt;sequence&lt;/a&gt;, including the
-<span class="lineNum">     381 </span>                :    *  &lt;a href=&quot;tables.html#68&quot;&gt;optional sequence requirements&lt;/a&gt; with the
-<span class="lineNum">     382 </span>                :    *  %exception of @c at and @c operator[].
-<span class="lineNum">     383 </span>                :    *
-<span class="lineNum">     384 </span>                :    *  This is a @e doubly @e linked %list.  Traversal up and down the
-<span class="lineNum">     385 </span>                :    *  %list requires linear time, but adding and removing elements (or
-<span class="lineNum">     386 </span>                :    *  @e nodes) is done in constant time, regardless of where the
-<span class="lineNum">     387 </span>                :    *  change takes place.  Unlike std::vector and std::deque,
-<span class="lineNum">     388 </span>                :    *  random-access iterators are not provided, so subscripting ( @c
-<span class="lineNum">     389 </span>                :    *  [] ) access is not allowed.  For algorithms which only need
-<span class="lineNum">     390 </span>                :    *  sequential access, this lack makes no difference.
-<span class="lineNum">     391 </span>                :    *
-<span class="lineNum">     392 </span>                :    *  Also unlike the other standard containers, std::list provides
-<span class="lineNum">     393 </span>                :    *  specialized algorithms %unique to linked lists, such as
-<span class="lineNum">     394 </span>                :    *  splicing, sorting, and in-place reversal.
-<span class="lineNum">     395 </span>                :    *
-<span class="lineNum">     396 </span>                :    *  A couple points on memory allocation for list&lt;Tp&gt;:
-<span class="lineNum">     397 </span>                :    *
-<span class="lineNum">     398 </span>                :    *  First, we never actually allocate a Tp, we allocate
-<span class="lineNum">     399 </span>                :    *  List_node&lt;Tp&gt;'s and trust [20.1.5]/4 to DTRT.  This is to ensure
-<span class="lineNum">     400 </span>                :    *  that after elements from %list&lt;X,Alloc1&gt; are spliced into
-<span class="lineNum">     401 </span>                :    *  %list&lt;X,Alloc2&gt;, destroying the memory of the second %list is a
-<span class="lineNum">     402 </span>                :    *  valid operation, i.e., Alloc1 giveth and Alloc2 taketh away.
-<span class="lineNum">     403 </span>                :    *
-<span class="lineNum">     404 </span>                :    *  Second, a %list conceptually represented as
-<span class="lineNum">     405 </span>                :    *  @code
-<span class="lineNum">     406 </span>                :    *    A &lt;---&gt; B &lt;---&gt; C &lt;---&gt; D
-<span class="lineNum">     407 </span>                :    *  @endcode
-<span class="lineNum">     408 </span>                :    *  is actually circular; a link exists between A and D.  The %list
-<span class="lineNum">     409 </span>                :    *  class holds (as its only data member) a private list::iterator
-<span class="lineNum">     410 </span>                :    *  pointing to @e D, not to @e A!  To get to the head of the %list,
-<span class="lineNum">     411 </span>                :    *  we start at the tail and move forward by one.  When this member
-<span class="lineNum">     412 </span>                :    *  iterator's next/previous pointers refer to itself, the %list is
-<span class="lineNum">     413 </span>                :    *  %empty. 
-<span class="lineNum">     414 </span>                :   */
-<span class="lineNum">     415 </span>                :   template&lt;typename _Tp, typename _Alloc = std::allocator&lt;_Tp&gt; &gt;
-<span class="lineNum">     416 </span>                :     class list : protected _List_base&lt;_Tp, _Alloc&gt;
-<span class="lineNum">     417 </span><span class="lineCov">             19 :     {</span>
-<span class="lineNum">     418 </span>                :       // concept requirements
-<span class="lineNum">     419 </span>                :       typedef typename _Alloc::value_type                _Alloc_value_type;
-<span class="lineNum">     420 </span>                :       __glibcxx_class_requires(_Tp, _SGIAssignableConcept)
-<span class="lineNum">     421 </span>                :       __glibcxx_class_requires2(_Tp, _Alloc_value_type, _SameTypeConcept)
-<span class="lineNum">     422 </span>                : 
-<span class="lineNum">     423 </span>                :       typedef _List_base&lt;_Tp, _Alloc&gt;                    _Base;
-<span class="lineNum">     424 </span>                :       typedef typename _Base::_Tp_alloc_type             _Tp_alloc_type;
-<span class="lineNum">     425 </span>                : 
-<span class="lineNum">     426 </span>                :     public:
-<span class="lineNum">     427 </span>                :       typedef _Tp                                        value_type;
-<span class="lineNum">     428 </span>                :       typedef typename _Tp_alloc_type::pointer           pointer;
-<span class="lineNum">     429 </span>                :       typedef typename _Tp_alloc_type::const_pointer     const_pointer;
-<span class="lineNum">     430 </span>                :       typedef typename _Tp_alloc_type::reference         reference;
-<span class="lineNum">     431 </span>                :       typedef typename _Tp_alloc_type::const_reference   const_reference;
-<span class="lineNum">     432 </span>                :       typedef _List_iterator&lt;_Tp&gt;                        iterator;
-<span class="lineNum">     433 </span>                :       typedef _List_const_iterator&lt;_Tp&gt;                  const_iterator;
-<span class="lineNum">     434 </span>                :       typedef std::reverse_iterator&lt;const_iterator&gt;      const_reverse_iterator;
-<span class="lineNum">     435 </span>                :       typedef std::reverse_iterator&lt;iterator&gt;            reverse_iterator;
-<span class="lineNum">     436 </span>                :       typedef size_t                                     size_type;
-<span class="lineNum">     437 </span>                :       typedef ptrdiff_t                                  difference_type;
-<span class="lineNum">     438 </span>                :       typedef _Alloc                                     allocator_type;
-<span class="lineNum">     439 </span>                : 
-<span class="lineNum">     440 </span>                :     protected:
-<span class="lineNum">     441 </span>                :       // Note that pointers-to-_Node's can be ctor-converted to
-<span class="lineNum">     442 </span>                :       // iterator types.
-<span class="lineNum">     443 </span>                :       typedef _List_node&lt;_Tp&gt;                              _Node;
-<span class="lineNum">     444 </span>                : 
-<span class="lineNum">     445 </span>                :       using _Base::_M_impl;
-<span class="lineNum">     446 </span>                :       using _Base::_M_put_node;
-<span class="lineNum">     447 </span>                :       using _Base::_M_get_node;
-<span class="lineNum">     448 </span>                :       using _Base::_M_get_Tp_allocator;
-<span class="lineNum">     449 </span>                :       using _Base::_M_get_Node_allocator;
-<span class="lineNum">     450 </span>                : 
-<span class="lineNum">     451 </span>                :       /**
-<span class="lineNum">     452 </span>                :        *  @param  x  An instance of user data.
-<span class="lineNum">     453 </span>                :        *
-<span class="lineNum">     454 </span>                :        *  Allocates space for a new node and constructs a copy of @a x in it.
-<span class="lineNum">     455 </span>                :        */
-<span class="lineNum">     456 </span>                : #ifndef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     457 </span>                :       _Node*
-<span class="lineNum">     458 </span><span class="lineCov">             47 :       _M_create_node(const value_type&amp; __x)</span>
-<span class="lineNum">     459 </span>                :       {
-<span class="lineNum">     460 </span><span class="lineCov">             47 :         _Node* __p = this-&gt;_M_get_node();</span>
-<span class="lineNum">     461 </span>                :         try
-<span class="lineNum">     462 </span>                :           {
-<span class="lineNum">     463 </span><span class="lineCov">             47 :             _M_get_Tp_allocator().construct(&amp;__p-&gt;_M_data, __x);</span>
-<span class="lineNum">     464 </span>                :           }
-<span class="lineNum">     465 </span><span class="lineNoCov">              0 :         catch(...)</span>
-<span class="lineNum">     466 </span>                :           {
-<span class="lineNum">     467 </span><span class="lineNoCov">              0 :             _M_put_node(__p);</span>
-<span class="lineNum">     468 </span><span class="lineNoCov">              0 :             __throw_exception_again;</span>
-<span class="lineNum">     469 </span>                :           }
-<span class="lineNum">     470 </span><span class="lineCov">             47 :         return __p;</span>
-<span class="lineNum">     471 </span>                :       }
-<span class="lineNum">     472 </span>                : #else
-<span class="lineNum">     473 </span>                :       template&lt;typename... _Args&gt;
-<span class="lineNum">     474 </span>                :         _Node*
-<span class="lineNum">     475 </span>                :         _M_create_node(_Args&amp;&amp;... __args)
-<span class="lineNum">     476 </span>                :         {
-<span class="lineNum">     477 </span>                :           _Node* __p = this-&gt;_M_get_node();
-<span class="lineNum">     478 </span>                :           try
-<span class="lineNum">     479 </span>                :             {
-<span class="lineNum">     480 </span>                :               _M_get_Tp_allocator().construct(&amp;__p-&gt;_M_data,
-<span class="lineNum">     481 </span>                :                                               std::forward&lt;_Args&gt;(__args)...);
-<span class="lineNum">     482 </span>                :             }
-<span class="lineNum">     483 </span>                :           catch(...)
-<span class="lineNum">     484 </span>                :             {
-<span class="lineNum">     485 </span>                :               _M_put_node(__p);
-<span class="lineNum">     486 </span>                :               __throw_exception_again;
-<span class="lineNum">     487 </span>                :             }
-<span class="lineNum">     488 </span>                :           return __p;
-<span class="lineNum">     489 </span>                :         }
-<span class="lineNum">     490 </span>                : #endif
-<span class="lineNum">     491 </span>                : 
-<span class="lineNum">     492 </span>                :     public:
-<span class="lineNum">     493 </span>                :       // [23.2.2.1] construct/copy/destroy
-<span class="lineNum">     494 </span>                :       // (assign() and get_allocator() are also listed in this section)
-<span class="lineNum">     495 </span>                :       /**
-<span class="lineNum">     496 </span>                :        *  @brief  Default constructor creates no elements.
-<span class="lineNum">     497 </span>                :        */
-<span class="lineNum">     498 </span><span class="lineCov">             19 :       list()</span>
-<span class="lineNum">     499 </span><span class="lineCov">             19 :       : _Base() { }</span>
-<span class="lineNum">     500 </span>                : 
-<span class="lineNum">     501 </span>                :       /**
-<span class="lineNum">     502 </span>                :        *  @brief  Creates a %list with no elements.
-<span class="lineNum">     503 </span>                :        *  @param  a  An allocator object.
-<span class="lineNum">     504 </span>                :        */
-<span class="lineNum">     505 </span>                :       explicit
-<span class="lineNum">     506 </span>                :       list(const allocator_type&amp; __a)
-<span class="lineNum">     507 </span>                :       : _Base(__a) { }
-<span class="lineNum">     508 </span>                : 
-<span class="lineNum">     509 </span>                :       /**
-<span class="lineNum">     510 </span>                :        *  @brief  Creates a %list with copies of an exemplar element.
-<span class="lineNum">     511 </span>                :        *  @param  n  The number of elements to initially create.
-<span class="lineNum">     512 </span>                :        *  @param  value  An element to copy.
-<span class="lineNum">     513 </span>                :        *  @param  a  An allocator object.
-<span class="lineNum">     514 </span>                :        *
-<span class="lineNum">     515 </span>                :        *  This constructor fills the %list with @a n copies of @a value.
-<span class="lineNum">     516 </span>                :        */
-<span class="lineNum">     517 </span>                :       explicit
-<span class="lineNum">     518 </span>                :       list(size_type __n, const value_type&amp; __value = value_type(),
-<span class="lineNum">     519 </span>                :            const allocator_type&amp; __a = allocator_type())
-<span class="lineNum">     520 </span>                :       : _Base(__a)
-<span class="lineNum">     521 </span>                :       { _M_fill_initialize(__n, __value); }
-<span class="lineNum">     522 </span>                : 
-<span class="lineNum">     523 </span>                :       /**
-<span class="lineNum">     524 </span>                :        *  @brief  %List copy constructor.
-<span class="lineNum">     525 </span>                :        *  @param  x  A %list of identical element and allocator types.
-<span class="lineNum">     526 </span>                :        *
-<span class="lineNum">     527 </span>                :        *  The newly-created %list uses a copy of the allocation object used
-<span class="lineNum">     528 </span>                :        *  by @a x.
-<span class="lineNum">     529 </span>                :        */
-<span class="lineNum">     530 </span>                :       list(const list&amp; __x)
-<span class="lineNum">     531 </span>                :       : _Base(__x._M_get_Node_allocator())
-<span class="lineNum">     532 </span>                :       { _M_initialize_dispatch(__x.begin(), __x.end(), __false_type()); }
-<span class="lineNum">     533 </span>                : 
-<span class="lineNum">     534 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     535 </span>                :       /**
-<span class="lineNum">     536 </span>                :        *  @brief  %List move constructor.
-<span class="lineNum">     537 </span>                :        *  @param  x  A %list of identical element and allocator types.
-<span class="lineNum">     538 </span>                :        *
-<span class="lineNum">     539 </span>                :        *  The newly-created %list contains the exact contents of @a x.
-<span class="lineNum">     540 </span>                :        *  The contents of @a x are a valid, but unspecified %list.
-<span class="lineNum">     541 </span>                :        */
-<span class="lineNum">     542 </span>                :       list(list&amp;&amp; __x)
-<span class="lineNum">     543 </span>                :       : _Base(std::forward&lt;_Base&gt;(__x)) { }
-<span class="lineNum">     544 </span>                : #endif
-<span class="lineNum">     545 </span>                : 
-<span class="lineNum">     546 </span>                :       /**
-<span class="lineNum">     547 </span>                :        *  @brief  Builds a %list from a range.
-<span class="lineNum">     548 </span>                :        *  @param  first  An input iterator.
-<span class="lineNum">     549 </span>                :        *  @param  last  An input iterator.
-<span class="lineNum">     550 </span>                :        *  @param  a  An allocator object.
-<span class="lineNum">     551 </span>                :        *
-<span class="lineNum">     552 </span>                :        *  Create a %list consisting of copies of the elements from
-<span class="lineNum">     553 </span>                :        *  [@a first,@a last).  This is linear in N (where N is
-<span class="lineNum">     554 </span>                :        *  distance(@a first,@a last)).
-<span class="lineNum">     555 </span>                :        */
-<span class="lineNum">     556 </span>                :       template&lt;typename _InputIterator&gt;
-<span class="lineNum">     557 </span>                :         list(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">     558 </span>                :              const allocator_type&amp; __a = allocator_type())
-<span class="lineNum">     559 </span>                :         : _Base(__a)
-<span class="lineNum">     560 </span>                :         { 
-<span class="lineNum">     561 </span>                :           // Check whether it's an integral type.  If so, it's not an iterator.
-<span class="lineNum">     562 </span>                :           typedef typename std::__is_integer&lt;_InputIterator&gt;::__type _Integral;
-<span class="lineNum">     563 </span>                :           _M_initialize_dispatch(__first, __last, _Integral());
-<span class="lineNum">     564 </span>                :         }
-<span class="lineNum">     565 </span>                : 
-<span class="lineNum">     566 </span>                :       /**
-<span class="lineNum">     567 </span>                :        *  No explicit dtor needed as the _Base dtor takes care of
-<span class="lineNum">     568 </span>                :        *  things.  The _Base dtor only erases the elements, and note
-<span class="lineNum">     569 </span>                :        *  that if the elements themselves are pointers, the pointed-to
-<span class="lineNum">     570 </span>                :        *  memory is not touched in any way.  Managing the pointer is
-<span class="lineNum">     571 </span>                :        *  the user's responsibility.
-<span class="lineNum">     572 </span>                :        */
-<span class="lineNum">     573 </span>                : 
-<span class="lineNum">     574 </span>                :       /**
-<span class="lineNum">     575 </span>                :        *  @brief  %List assignment operator.
-<span class="lineNum">     576 </span>                :        *  @param  x  A %list of identical element and allocator types.
-<span class="lineNum">     577 </span>                :        *
-<span class="lineNum">     578 </span>                :        *  All the elements of @a x are copied, but unlike the copy
-<span class="lineNum">     579 </span>                :        *  constructor, the allocator object is not copied.
-<span class="lineNum">     580 </span>                :        */
-<span class="lineNum">     581 </span>                :       list&amp;
-<span class="lineNum">     582 </span>                :       operator=(const list&amp; __x);
-<span class="lineNum">     583 </span>                : 
-<span class="lineNum">     584 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     585 </span>                :       /**
-<span class="lineNum">     586 </span>                :        *  @brief  %List move assignment operator.
-<span class="lineNum">     587 </span>                :        *  @param  x  A %list of identical element and allocator types.
-<span class="lineNum">     588 </span>                :        *
-<span class="lineNum">     589 </span>                :        *  The contents of @a x are moved into this %list (without copying).
-<span class="lineNum">     590 </span>                :        *  @a x is a valid, but unspecified %list
-<span class="lineNum">     591 </span>                :        */
-<span class="lineNum">     592 </span>                :       list&amp;
-<span class="lineNum">     593 </span>                :       operator=(list&amp;&amp; __x)
-<span class="lineNum">     594 </span>                :       {
-<span class="lineNum">     595 </span>                :         // NB: DR 675.
-<span class="lineNum">     596 </span>                :         this-&gt;clear();
-<span class="lineNum">     597 </span>                :         this-&gt;swap(__x); 
-<span class="lineNum">     598 </span>                :         return *this;
-<span class="lineNum">     599 </span>                :       }
-<span class="lineNum">     600 </span>                : #endif
-<span class="lineNum">     601 </span>                : 
-<span class="lineNum">     602 </span>                :       /**
-<span class="lineNum">     603 </span>                :        *  @brief  Assigns a given value to a %list.
-<span class="lineNum">     604 </span>                :        *  @param  n  Number of elements to be assigned.
-<span class="lineNum">     605 </span>                :        *  @param  val  Value to be assigned.
-<span class="lineNum">     606 </span>                :        *
-<span class="lineNum">     607 </span>                :        *  This function fills a %list with @a n copies of the given
-<span class="lineNum">     608 </span>                :        *  value.  Note that the assignment completely changes the %list
-<span class="lineNum">     609 </span>                :        *  and that the resulting %list's size is the same as the number
-<span class="lineNum">     610 </span>                :        *  of elements assigned.  Old data may be lost.
-<span class="lineNum">     611 </span>                :        */
-<span class="lineNum">     612 </span>                :       void
-<span class="lineNum">     613 </span>                :       assign(size_type __n, const value_type&amp; __val)
-<span class="lineNum">     614 </span>                :       { _M_fill_assign(__n, __val); }
-<span class="lineNum">     615 </span>                : 
-<span class="lineNum">     616 </span>                :       /**
-<span class="lineNum">     617 </span>                :        *  @brief  Assigns a range to a %list.
-<span class="lineNum">     618 </span>                :        *  @param  first  An input iterator.
-<span class="lineNum">     619 </span>                :        *  @param  last   An input iterator.
-<span class="lineNum">     620 </span>                :        *
-<span class="lineNum">     621 </span>                :        *  This function fills a %list with copies of the elements in the
-<span class="lineNum">     622 </span>                :        *  range [@a first,@a last).
-<span class="lineNum">     623 </span>                :        *
-<span class="lineNum">     624 </span>                :        *  Note that the assignment completely changes the %list and
-<span class="lineNum">     625 </span>                :        *  that the resulting %list's size is the same as the number of
-<span class="lineNum">     626 </span>                :        *  elements assigned.  Old data may be lost.
-<span class="lineNum">     627 </span>                :        */
-<span class="lineNum">     628 </span>                :       template&lt;typename _InputIterator&gt;
-<span class="lineNum">     629 </span>                :         void
-<span class="lineNum">     630 </span>                :         assign(_InputIterator __first, _InputIterator __last)
-<span class="lineNum">     631 </span>                :         {
-<span class="lineNum">     632 </span>                :           // Check whether it's an integral type.  If so, it's not an iterator.
-<span class="lineNum">     633 </span>                :           typedef typename std::__is_integer&lt;_InputIterator&gt;::__type _Integral;
-<span class="lineNum">     634 </span>                :           _M_assign_dispatch(__first, __last, _Integral());
-<span class="lineNum">     635 </span>                :         }
-<span class="lineNum">     636 </span>                : 
-<span class="lineNum">     637 </span>                :       /// Get a copy of the memory allocation object.
-<span class="lineNum">     638 </span>                :       allocator_type
-<span class="lineNum">     639 </span>                :       get_allocator() const
-<span class="lineNum">     640 </span>                :       { return _Base::get_allocator(); }
-<span class="lineNum">     641 </span>                : 
-<span class="lineNum">     642 </span>                :       // iterators
-<span class="lineNum">     643 </span>                :       /**
-<span class="lineNum">     644 </span>                :        *  Returns a read/write iterator that points to the first element in the
-<span class="lineNum">     645 </span>                :        *  %list.  Iteration is done in ordinary element order.
-<span class="lineNum">     646 </span>                :        */
-<span class="lineNum">     647 </span>                :       iterator
-<span class="lineNum">     648 </span><span class="lineCov">             27 :       begin()</span>
-<span class="lineNum">     649 </span><span class="lineCov">             27 :       { return iterator(this-&gt;_M_impl._M_node._M_next); }</span>
-<span class="lineNum">     650 </span>                : 
-<span class="lineNum">     651 </span>                :       /**
-<span class="lineNum">     652 </span>                :        *  Returns a read-only (constant) iterator that points to the
-<span class="lineNum">     653 </span>                :        *  first element in the %list.  Iteration is done in ordinary
-<span class="lineNum">     654 </span>                :        *  element order.
-<span class="lineNum">     655 </span>                :        */
-<span class="lineNum">     656 </span>                :       const_iterator
-<span class="lineNum">     657 </span><span class="lineCov">             21 :       begin() const</span>
-<span class="lineNum">     658 </span><span class="lineCov">             21 :       { return const_iterator(this-&gt;_M_impl._M_node._M_next); }</span>
-<span class="lineNum">     659 </span>                : 
-<span class="lineNum">     660 </span>                :       /**
-<span class="lineNum">     661 </span>                :        *  Returns a read/write iterator that points one past the last
-<span class="lineNum">     662 </span>                :        *  element in the %list.  Iteration is done in ordinary element
-<span class="lineNum">     663 </span>                :        *  order.
-<span class="lineNum">     664 </span>                :        */
-<span class="lineNum">     665 </span>                :       iterator
-<span class="lineNum">     666 </span><span class="lineCov">            154 :       end()</span>
-<span class="lineNum">     667 </span><span class="lineCov">            154 :       { return iterator(&amp;this-&gt;_M_impl._M_node); }</span>
-<span class="lineNum">     668 </span>                : 
-<span class="lineNum">     669 </span>                :       /**
-<span class="lineNum">     670 </span>                :        *  Returns a read-only (constant) iterator that points one past
-<span class="lineNum">     671 </span>                :        *  the last element in the %list.  Iteration is done in ordinary
-<span class="lineNum">     672 </span>                :        *  element order.
-<span class="lineNum">     673 </span>                :        */
-<span class="lineNum">     674 </span>                :       const_iterator
-<span class="lineNum">     675 </span><span class="lineCov">             21 :       end() const</span>
-<span class="lineNum">     676 </span><span class="lineCov">             21 :       { return const_iterator(&amp;this-&gt;_M_impl._M_node); }</span>
-<span class="lineNum">     677 </span>                : 
-<span class="lineNum">     678 </span>                :       /**
-<span class="lineNum">     679 </span>                :        *  Returns a read/write reverse iterator that points to the last
-<span class="lineNum">     680 </span>                :        *  element in the %list.  Iteration is done in reverse element
-<span class="lineNum">     681 </span>                :        *  order.
-<span class="lineNum">     682 </span>                :        */
-<span class="lineNum">     683 </span>                :       reverse_iterator
-<span class="lineNum">     684 </span><span class="lineCov">              1 :       rbegin()</span>
-<span class="lineNum">     685 </span><span class="lineCov">              1 :       { return reverse_iterator(end()); }</span>
-<span class="lineNum">     686 </span>                : 
-<span class="lineNum">     687 </span>                :       /**
-<span class="lineNum">     688 </span>                :        *  Returns a read-only (constant) reverse iterator that points to
-<span class="lineNum">     689 </span>                :        *  the last element in the %list.  Iteration is done in reverse
-<span class="lineNum">     690 </span>                :        *  element order.
-<span class="lineNum">     691 </span>                :        */
-<span class="lineNum">     692 </span>                :       const_reverse_iterator
-<span class="lineNum">     693 </span>                :       rbegin() const
-<span class="lineNum">     694 </span>                :       { return const_reverse_iterator(end()); }
-<span class="lineNum">     695 </span>                : 
-<span class="lineNum">     696 </span>                :       /**
-<span class="lineNum">     697 </span>                :        *  Returns a read/write reverse iterator that points to one
-<span class="lineNum">     698 </span>                :        *  before the first element in the %list.  Iteration is done in
-<span class="lineNum">     699 </span>                :        *  reverse element order.
-<span class="lineNum">     700 </span>                :        */
-<span class="lineNum">     701 </span>                :       reverse_iterator
-<span class="lineNum">     702 </span>                :       rend()
-<span class="lineNum">     703 </span>                :       { return reverse_iterator(begin()); }
-<span class="lineNum">     704 </span>                : 
-<span class="lineNum">     705 </span>                :       /**
-<span class="lineNum">     706 </span>                :        *  Returns a read-only (constant) reverse iterator that points to one
-<span class="lineNum">     707 </span>                :        *  before the first element in the %list.  Iteration is done in reverse
-<span class="lineNum">     708 </span>                :        *  element order.
-<span class="lineNum">     709 </span>                :        */
-<span class="lineNum">     710 </span>                :       const_reverse_iterator
-<span class="lineNum">     711 </span>                :       rend() const
-<span class="lineNum">     712 </span>                :       { return const_reverse_iterator(begin()); }
-<span class="lineNum">     713 </span>                : 
-<span class="lineNum">     714 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     715 </span>                :       /**
-<span class="lineNum">     716 </span>                :        *  Returns a read-only (constant) iterator that points to the
-<span class="lineNum">     717 </span>                :        *  first element in the %list.  Iteration is done in ordinary
-<span class="lineNum">     718 </span>                :        *  element order.
-<span class="lineNum">     719 </span>                :        */
-<span class="lineNum">     720 </span>                :       const_iterator
-<span class="lineNum">     721 </span>                :       cbegin() const
-<span class="lineNum">     722 </span>                :       { return const_iterator(this-&gt;_M_impl._M_node._M_next); }
-<span class="lineNum">     723 </span>                : 
-<span class="lineNum">     724 </span>                :       /**
-<span class="lineNum">     725 </span>                :        *  Returns a read-only (constant) iterator that points one past
-<span class="lineNum">     726 </span>                :        *  the last element in the %list.  Iteration is done in ordinary
-<span class="lineNum">     727 </span>                :        *  element order.
-<span class="lineNum">     728 </span>                :        */
-<span class="lineNum">     729 </span>                :       const_iterator
-<span class="lineNum">     730 </span>                :       cend() const
-<span class="lineNum">     731 </span>                :       { return const_iterator(&amp;this-&gt;_M_impl._M_node); }
-<span class="lineNum">     732 </span>                : 
-<span class="lineNum">     733 </span>                :       /**
-<span class="lineNum">     734 </span>                :        *  Returns a read-only (constant) reverse iterator that points to
-<span class="lineNum">     735 </span>                :        *  the last element in the %list.  Iteration is done in reverse
-<span class="lineNum">     736 </span>                :        *  element order.
-<span class="lineNum">     737 </span>                :        */
-<span class="lineNum">     738 </span>                :       const_reverse_iterator
-<span class="lineNum">     739 </span>                :       crbegin() const
-<span class="lineNum">     740 </span>                :       { return const_reverse_iterator(end()); }
-<span class="lineNum">     741 </span>                : 
-<span class="lineNum">     742 </span>                :       /**
-<span class="lineNum">     743 </span>                :        *  Returns a read-only (constant) reverse iterator that points to one
-<span class="lineNum">     744 </span>                :        *  before the first element in the %list.  Iteration is done in reverse
-<span class="lineNum">     745 </span>                :        *  element order.
-<span class="lineNum">     746 </span>                :        */
-<span class="lineNum">     747 </span>                :       const_reverse_iterator
-<span class="lineNum">     748 </span>                :       crend() const
-<span class="lineNum">     749 </span>                :       { return const_reverse_iterator(begin()); }
-<span class="lineNum">     750 </span>                : #endif
-<span class="lineNum">     751 </span>                : 
-<span class="lineNum">     752 </span>                :       // [23.2.2.2] capacity
-<span class="lineNum">     753 </span>                :       /**
-<span class="lineNum">     754 </span>                :        *  Returns true if the %list is empty.  (Thus begin() would equal
-<span class="lineNum">     755 </span>                :        *  end().)
-<span class="lineNum">     756 </span>                :        */
-<span class="lineNum">     757 </span>                :       bool
-<span class="lineNum">     758 </span>                :       empty() const
-<span class="lineNum">     759 </span>                :       { return this-&gt;_M_impl._M_node._M_next == &amp;this-&gt;_M_impl._M_node; }
-<span class="lineNum">     760 </span>                : 
-<span class="lineNum">     761 </span>                :       /**  Returns the number of elements in the %list.  */
-<span class="lineNum">     762 </span>                :       size_type
-<span class="lineNum">     763 </span><span class="lineCov">             13 :       size() const</span>
-<span class="lineNum">     764 </span><span class="lineCov">             13 :       { return std::distance(begin(), end()); }</span>
-<span class="lineNum">     765 </span>                : 
-<span class="lineNum">     766 </span>                :       /**  Returns the size() of the largest possible %list.  */
-<span class="lineNum">     767 </span>                :       size_type
-<span class="lineNum">     768 </span>                :       max_size() const
-<span class="lineNum">     769 </span>                :       { return _M_get_Tp_allocator().max_size(); }
-<span class="lineNum">     770 </span>                : 
-<span class="lineNum">     771 </span>                :       /**
-<span class="lineNum">     772 </span>                :        *  @brief Resizes the %list to the specified number of elements.
-<span class="lineNum">     773 </span>                :        *  @param new_size Number of elements the %list should contain.
-<span class="lineNum">     774 </span>                :        *  @param x Data with which new elements should be populated.
-<span class="lineNum">     775 </span>                :        *
-<span class="lineNum">     776 </span>                :        *  This function will %resize the %list to the specified number
-<span class="lineNum">     777 </span>                :        *  of elements.  If the number is smaller than the %list's
-<span class="lineNum">     778 </span>                :        *  current size the %list is truncated, otherwise the %list is
-<span class="lineNum">     779 </span>                :        *  extended and new elements are populated with given data.
-<span class="lineNum">     780 </span>                :        */
-<span class="lineNum">     781 </span>                :       void
-<span class="lineNum">     782 </span>                :       resize(size_type __new_size, value_type __x = value_type());
-<span class="lineNum">     783 </span>                : 
-<span class="lineNum">     784 </span>                :       // element access
-<span class="lineNum">     785 </span>                :       /**
-<span class="lineNum">     786 </span>                :        *  Returns a read/write reference to the data at the first
-<span class="lineNum">     787 </span>                :        *  element of the %list.
-<span class="lineNum">     788 </span>                :        */
-<span class="lineNum">     789 </span>                :       reference
-<span class="lineNum">     790 </span>                :       front()
-<span class="lineNum">     791 </span>                :       { return *begin(); }
-<span class="lineNum">     792 </span>                : 
-<span class="lineNum">     793 </span>                :       /**
-<span class="lineNum">     794 </span>                :        *  Returns a read-only (constant) reference to the data at the first
-<span class="lineNum">     795 </span>                :        *  element of the %list.
-<span class="lineNum">     796 </span>                :        */
-<span class="lineNum">     797 </span>                :       const_reference
-<span class="lineNum">     798 </span>                :       front() const
-<span class="lineNum">     799 </span>                :       { return *begin(); }
-<span class="lineNum">     800 </span>                : 
-<span class="lineNum">     801 </span>                :       /**
-<span class="lineNum">     802 </span>                :        *  Returns a read/write reference to the data at the last element
-<span class="lineNum">     803 </span>                :        *  of the %list.
-<span class="lineNum">     804 </span>                :        */
-<span class="lineNum">     805 </span>                :       reference
-<span class="lineNum">     806 </span>                :       back()
-<span class="lineNum">     807 </span>                :       { 
-<span class="lineNum">     808 </span>                :         iterator __tmp = end();
-<span class="lineNum">     809 </span>                :         --__tmp;
-<span class="lineNum">     810 </span>                :         return *__tmp;
-<span class="lineNum">     811 </span>                :       }
-<span class="lineNum">     812 </span>                : 
-<span class="lineNum">     813 </span>                :       /**
-<span class="lineNum">     814 </span>                :        *  Returns a read-only (constant) reference to the data at the last
-<span class="lineNum">     815 </span>                :        *  element of the %list.
-<span class="lineNum">     816 </span>                :        */
-<span class="lineNum">     817 </span>                :       const_reference
-<span class="lineNum">     818 </span>                :       back() const
-<span class="lineNum">     819 </span>                :       { 
-<span class="lineNum">     820 </span>                :         const_iterator __tmp = end();
-<span class="lineNum">     821 </span>                :         --__tmp;
-<span class="lineNum">     822 </span>                :         return *__tmp;
-<span class="lineNum">     823 </span>                :       }
-<span class="lineNum">     824 </span>                : 
-<span class="lineNum">     825 </span>                :       // [23.2.2.3] modifiers
-<span class="lineNum">     826 </span>                :       /**
-<span class="lineNum">     827 </span>                :        *  @brief  Add data to the front of the %list.
-<span class="lineNum">     828 </span>                :        *  @param  x  Data to be added.
-<span class="lineNum">     829 </span>                :        *
-<span class="lineNum">     830 </span>                :        *  This is a typical stack operation.  The function creates an
-<span class="lineNum">     831 </span>                :        *  element at the front of the %list and assigns the given data
-<span class="lineNum">     832 </span>                :        *  to it.  Due to the nature of a %list this operation can be
-<span class="lineNum">     833 </span>                :        *  done in constant time, and does not invalidate iterators and
-<span class="lineNum">     834 </span>                :        *  references.
-<span class="lineNum">     835 </span>                :        */
-<span class="lineNum">     836 </span>                : #ifndef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     837 </span>                :       void
-<span class="lineNum">     838 </span>                :       push_front(const value_type&amp; __x)
-<span class="lineNum">     839 </span>                :       { this-&gt;_M_insert(begin(), __x); }
-<span class="lineNum">     840 </span>                : #else
-<span class="lineNum">     841 </span>                :       template&lt;typename... _Args&gt;
-<span class="lineNum">     842 </span>                :         void
-<span class="lineNum">     843 </span>                :         push_front(_Args&amp;&amp;... __args)
-<span class="lineNum">     844 </span>                :         { this-&gt;_M_insert(begin(), std::forward&lt;_Args&gt;(__args)...); }
-<span class="lineNum">     845 </span>                : #endif
-<span class="lineNum">     846 </span>                : 
-<span class="lineNum">     847 </span>                :       /**
-<span class="lineNum">     848 </span>                :        *  @brief  Removes first element.
-<span class="lineNum">     849 </span>                :        *
-<span class="lineNum">     850 </span>                :        *  This is a typical stack operation.  It shrinks the %list by
-<span class="lineNum">     851 </span>                :        *  one.  Due to the nature of a %list this operation can be done
-<span class="lineNum">     852 </span>                :        *  in constant time, and only invalidates iterators/references to
-<span class="lineNum">     853 </span>                :        *  the element being removed.
-<span class="lineNum">     854 </span>                :        *
-<span class="lineNum">     855 </span>                :        *  Note that no data is returned, and if the first element's data
-<span class="lineNum">     856 </span>                :        *  is needed, it should be retrieved before pop_front() is
-<span class="lineNum">     857 </span>                :        *  called.
-<span class="lineNum">     858 </span>                :        */
-<span class="lineNum">     859 </span>                :       void
-<span class="lineNum">     860 </span>                :       pop_front()
-<span class="lineNum">     861 </span>                :       { this-&gt;_M_erase(begin()); }
-<span class="lineNum">     862 </span>                : 
-<span class="lineNum">     863 </span>                :       /**
-<span class="lineNum">     864 </span>                :        *  @brief  Add data to the end of the %list.
-<span class="lineNum">     865 </span>                :        *  @param  x  Data to be added.
-<span class="lineNum">     866 </span>                :        *
-<span class="lineNum">     867 </span>                :        *  This is a typical stack operation.  The function creates an
-<span class="lineNum">     868 </span>                :        *  element at the end of the %list and assigns the given data to
-<span class="lineNum">     869 </span>                :        *  it.  Due to the nature of a %list this operation can be done
-<span class="lineNum">     870 </span>                :        *  in constant time, and does not invalidate iterators and
-<span class="lineNum">     871 </span>                :        *  references.
-<span class="lineNum">     872 </span>                :        */
-<span class="lineNum">     873 </span>                : #ifndef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     874 </span>                :       void
-<span class="lineNum">     875 </span><span class="lineCov">             47 :       push_back(const value_type&amp; __x)</span>
-<span class="lineNum">     876 </span><span class="lineCov">             47 :       { this-&gt;_M_insert(end(), __x); }</span>
-<span class="lineNum">     877 </span>                : #else
-<span class="lineNum">     878 </span>                :       template&lt;typename... _Args&gt;
-<span class="lineNum">     879 </span>                :         void
-<span class="lineNum">     880 </span>                :         push_back(_Args&amp;&amp;... __args)
-<span class="lineNum">     881 </span>                :         { this-&gt;_M_insert(end(), std::forward&lt;_Args&gt;(__args)...); }
-<span class="lineNum">     882 </span>                : #endif
-<span class="lineNum">     883 </span>                : 
-<span class="lineNum">     884 </span>                :       /**
-<span class="lineNum">     885 </span>                :        *  @brief  Removes last element.
-<span class="lineNum">     886 </span>                :        *
-<span class="lineNum">     887 </span>                :        *  This is a typical stack operation.  It shrinks the %list by
-<span class="lineNum">     888 </span>                :        *  one.  Due to the nature of a %list this operation can be done
-<span class="lineNum">     889 </span>                :        *  in constant time, and only invalidates iterators/references to
-<span class="lineNum">     890 </span>                :        *  the element being removed.
-<span class="lineNum">     891 </span>                :        *
-<span class="lineNum">     892 </span>                :        *  Note that no data is returned, and if the last element's data
-<span class="lineNum">     893 </span>                :        *  is needed, it should be retrieved before pop_back() is called.
-<span class="lineNum">     894 </span>                :        */
-<span class="lineNum">     895 </span>                :       void
-<span class="lineNum">     896 </span>                :       pop_back()
-<span class="lineNum">     897 </span>                :       { this-&gt;_M_erase(iterator(this-&gt;_M_impl._M_node._M_prev)); }
-<span class="lineNum">     898 </span>                : 
-<span class="lineNum">     899 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     900 </span>                :       /**
-<span class="lineNum">     901 </span>                :        *  @brief  Constructs object in %list before specified iterator.
-<span class="lineNum">     902 </span>                :        *  @param  position  A const_iterator into the %list.
-<span class="lineNum">     903 </span>                :        *  @param  args  Arguments.
-<span class="lineNum">     904 </span>                :        *  @return  An iterator that points to the inserted data.
-<span class="lineNum">     905 </span>                :        *
-<span class="lineNum">     906 </span>                :        *  This function will insert an object of type T constructed
-<span class="lineNum">     907 </span>                :        *  with T(std::forward&lt;Args&gt;(args)...) before the specified
-<span class="lineNum">     908 </span>                :        *  location.  Due to the nature of a %list this operation can
-<span class="lineNum">     909 </span>                :        *  be done in constant time, and does not invalidate iterators
-<span class="lineNum">     910 </span>                :        *  and references.
-<span class="lineNum">     911 </span>                :        */
-<span class="lineNum">     912 </span>                :       template&lt;typename... _Args&gt;
-<span class="lineNum">     913 </span>                :         iterator
-<span class="lineNum">     914 </span>                :         emplace(iterator __position, _Args&amp;&amp;... __args);
-<span class="lineNum">     915 </span>                : #endif
-<span class="lineNum">     916 </span>                : 
-<span class="lineNum">     917 </span>                :       /**
-<span class="lineNum">     918 </span>                :        *  @brief  Inserts given value into %list before specified iterator.
-<span class="lineNum">     919 </span>                :        *  @param  position  An iterator into the %list.
-<span class="lineNum">     920 </span>                :        *  @param  x  Data to be inserted.
-<span class="lineNum">     921 </span>                :        *  @return  An iterator that points to the inserted data.
-<span class="lineNum">     922 </span>                :        *
-<span class="lineNum">     923 </span>                :        *  This function will insert a copy of the given value before
-<span class="lineNum">     924 </span>                :        *  the specified location.  Due to the nature of a %list this
-<span class="lineNum">     925 </span>                :        *  operation can be done in constant time, and does not
-<span class="lineNum">     926 </span>                :        *  invalidate iterators and references.
-<span class="lineNum">     927 </span>                :        */
-<span class="lineNum">     928 </span>                :       iterator
-<span class="lineNum">     929 </span>                :       insert(iterator __position, const value_type&amp; __x);
-<span class="lineNum">     930 </span>                : 
-<span class="lineNum">     931 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     932 </span>                :       /**
-<span class="lineNum">     933 </span>                :        *  @brief  Inserts given rvalue into %list before specified iterator.
-<span class="lineNum">     934 </span>                :        *  @param  position  An iterator into the %list.
-<span class="lineNum">     935 </span>                :        *  @param  x  Data to be inserted.
-<span class="lineNum">     936 </span>                :        *  @return  An iterator that points to the inserted data.
-<span class="lineNum">     937 </span>                :        *
-<span class="lineNum">     938 </span>                :        *  This function will insert a copy of the given rvalue before
-<span class="lineNum">     939 </span>                :        *  the specified location.  Due to the nature of a %list this
-<span class="lineNum">     940 </span>                :        *  operation can be done in constant time, and does not
-<span class="lineNum">     941 </span>                :        *  invalidate iterators and references.
-<span class="lineNum">     942 </span>                :         */
-<span class="lineNum">     943 </span>                :       iterator
-<span class="lineNum">     944 </span>                :       insert(iterator __position, value_type&amp;&amp; __x)
-<span class="lineNum">     945 </span>                :       { return emplace(__position, std::move(__x)); }
-<span class="lineNum">     946 </span>                : #endif
-<span class="lineNum">     947 </span>                : 
-<span class="lineNum">     948 </span>                :       /**
-<span class="lineNum">     949 </span>                :        *  @brief  Inserts a number of copies of given data into the %list.
-<span class="lineNum">     950 </span>                :        *  @param  position  An iterator into the %list.
-<span class="lineNum">     951 </span>                :        *  @param  n  Number of elements to be inserted.
-<span class="lineNum">     952 </span>                :        *  @param  x  Data to be inserted.
-<span class="lineNum">     953 </span>                :        *
-<span class="lineNum">     954 </span>                :        *  This function will insert a specified number of copies of the
-<span class="lineNum">     955 </span>                :        *  given data before the location specified by @a position.
-<span class="lineNum">     956 </span>                :        *
-<span class="lineNum">     957 </span>                :        *  This operation is linear in the number of elements inserted and
-<span class="lineNum">     958 </span>                :        *  does not invalidate iterators and references.
-<span class="lineNum">     959 </span>                :        */
-<span class="lineNum">     960 </span>                :       void
-<span class="lineNum">     961 </span>                :       insert(iterator __position, size_type __n, const value_type&amp; __x)
-<span class="lineNum">     962 </span>                :       {  
-<span class="lineNum">     963 </span>                :         list __tmp(__n, __x, _M_get_Node_allocator());
-<span class="lineNum">     964 </span>                :         splice(__position, __tmp);
-<span class="lineNum">     965 </span>                :       }
-<span class="lineNum">     966 </span>                : 
-<span class="lineNum">     967 </span>                :       /**
-<span class="lineNum">     968 </span>                :        *  @brief  Inserts a range into the %list.
-<span class="lineNum">     969 </span>                :        *  @param  position  An iterator into the %list.
-<span class="lineNum">     970 </span>                :        *  @param  first  An input iterator.
-<span class="lineNum">     971 </span>                :        *  @param  last   An input iterator.
-<span class="lineNum">     972 </span>                :        *
-<span class="lineNum">     973 </span>                :        *  This function will insert copies of the data in the range [@a
-<span class="lineNum">     974 </span>                :        *  first,@a last) into the %list before the location specified by
-<span class="lineNum">     975 </span>                :        *  @a position.
-<span class="lineNum">     976 </span>                :        *
-<span class="lineNum">     977 </span>                :        *  This operation is linear in the number of elements inserted and
-<span class="lineNum">     978 </span>                :        *  does not invalidate iterators and references.
-<span class="lineNum">     979 </span>                :        */
-<span class="lineNum">     980 </span>                :       template&lt;typename _InputIterator&gt;
-<span class="lineNum">     981 </span>                :         void
-<span class="lineNum">     982 </span>                :         insert(iterator __position, _InputIterator __first,
-<span class="lineNum">     983 </span>                :                _InputIterator __last)
-<span class="lineNum">     984 </span>                :         {
-<span class="lineNum">     985 </span>                :           list __tmp(__first, __last, _M_get_Node_allocator());
-<span class="lineNum">     986 </span>                :           splice(__position, __tmp);
-<span class="lineNum">     987 </span>                :         }
-<span class="lineNum">     988 </span>                : 
-<span class="lineNum">     989 </span>                :       /**
-<span class="lineNum">     990 </span>                :        *  @brief  Remove element at given position.
-<span class="lineNum">     991 </span>                :        *  @param  position  Iterator pointing to element to be erased.
-<span class="lineNum">     992 </span>                :        *  @return  An iterator pointing to the next element (or end()).
-<span class="lineNum">     993 </span>                :        *
-<span class="lineNum">     994 </span>                :        *  This function will erase the element at the given position and thus
-<span class="lineNum">     995 </span>                :        *  shorten the %list by one.
-<span class="lineNum">     996 </span>                :        *
-<span class="lineNum">     997 </span>                :        *  Due to the nature of a %list this operation can be done in
-<span class="lineNum">     998 </span>                :        *  constant time, and only invalidates iterators/references to
-<span class="lineNum">     999 </span>                :        *  the element being removed.  The user is also cautioned that
-<span class="lineNum">    1000 </span>                :        *  this function only erases the element, and that if the element
-<span class="lineNum">    1001 </span>                :        *  is itself a pointer, the pointed-to memory is not touched in
-<span class="lineNum">    1002 </span>                :        *  any way.  Managing the pointer is the user's responsibility.
-<span class="lineNum">    1003 </span>                :        */
-<span class="lineNum">    1004 </span>                :       iterator
-<span class="lineNum">    1005 </span>                :       erase(iterator __position);
-<span class="lineNum">    1006 </span>                : 
-<span class="lineNum">    1007 </span>                :       /**
-<span class="lineNum">    1008 </span>                :        *  @brief  Remove a range of elements.
-<span class="lineNum">    1009 </span>                :        *  @param  first  Iterator pointing to the first element to be erased.
-<span class="lineNum">    1010 </span>                :        *  @param  last  Iterator pointing to one past the last element to be
-<span class="lineNum">    1011 </span>                :        *                erased.
-<span class="lineNum">    1012 </span>                :        *  @return  An iterator pointing to the element pointed to by @a last
-<span class="lineNum">    1013 </span>                :        *           prior to erasing (or end()).
-<span class="lineNum">    1014 </span>                :        *
-<span class="lineNum">    1015 </span>                :        *  This function will erase the elements in the range @a
-<span class="lineNum">    1016 </span>                :        *  [first,last) and shorten the %list accordingly.
-<span class="lineNum">    1017 </span>                :        *
-<span class="lineNum">    1018 </span>                :        *  This operation is linear time in the size of the range and only
-<span class="lineNum">    1019 </span>                :        *  invalidates iterators/references to the element being removed.
-<span class="lineNum">    1020 </span>                :        *  The user is also cautioned that this function only erases the
-<span class="lineNum">    1021 </span>                :        *  elements, and that if the elements themselves are pointers, the
-<span class="lineNum">    1022 </span>                :        *  pointed-to memory is not touched in any way.  Managing the pointer
-<span class="lineNum">    1023 </span>                :        *  is the user's responsibility.
-<span class="lineNum">    1024 </span>                :        */
-<span class="lineNum">    1025 </span>                :       iterator
-<span class="lineNum">    1026 </span>                :       erase(iterator __first, iterator __last)
-<span class="lineNum">    1027 </span>                :       {
-<span class="lineNum">    1028 </span>                :         while (__first != __last)
-<span class="lineNum">    1029 </span>                :           __first = erase(__first);
-<span class="lineNum">    1030 </span>                :         return __last;
-<span class="lineNum">    1031 </span>                :       }
-<span class="lineNum">    1032 </span>                : 
-<span class="lineNum">    1033 </span>                :       /**
-<span class="lineNum">    1034 </span>                :        *  @brief  Swaps data with another %list.
-<span class="lineNum">    1035 </span>                :        *  @param  x  A %list of the same element and allocator types.
-<span class="lineNum">    1036 </span>                :        *
-<span class="lineNum">    1037 </span>                :        *  This exchanges the elements between two lists in constant
-<span class="lineNum">    1038 </span>                :        *  time.  Note that the global std::swap() function is
-<span class="lineNum">    1039 </span>                :        *  specialized such that std::swap(l1,l2) will feed to this
-<span class="lineNum">    1040 </span>                :        *  function.
-<span class="lineNum">    1041 </span>                :        */
-<span class="lineNum">    1042 </span>                :       void
-<span class="lineNum">    1043 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">    1044 </span>                :       swap(list&amp;&amp; __x)
-<span class="lineNum">    1045 </span>                : #else
-<span class="lineNum">    1046 </span>                :       swap(list&amp; __x)
-<span class="lineNum">    1047 </span>                : #endif
-<span class="lineNum">    1048 </span>                :       {
-<span class="lineNum">    1049 </span>                :         _List_node_base::swap(this-&gt;_M_impl._M_node, __x._M_impl._M_node);
-<span class="lineNum">    1050 </span>                : 
-<span class="lineNum">    1051 </span>                :         // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">    1052 </span>                :         // 431. Swapping containers with unequal allocators.
-<span class="lineNum">    1053 </span>                :         std::__alloc_swap&lt;typename _Base::_Node_alloc_type&gt;::
-<span class="lineNum">    1054 </span>                :           _S_do_it(_M_get_Node_allocator(), __x._M_get_Node_allocator());
-<span class="lineNum">    1055 </span>                :       }
-<span class="lineNum">    1056 </span>                : 
-<span class="lineNum">    1057 </span>                :       /**
-<span class="lineNum">    1058 </span>                :        *  Erases all the elements.  Note that this function only erases
-<span class="lineNum">    1059 </span>                :        *  the elements, and that if the elements themselves are
-<span class="lineNum">    1060 </span>                :        *  pointers, the pointed-to memory is not touched in any way.
-<span class="lineNum">    1061 </span>                :        *  Managing the pointer is the user's responsibility.
-<span class="lineNum">    1062 </span>                :        */
-<span class="lineNum">    1063 </span>                :       void
-<span class="lineNum">    1064 </span>                :       clear()
-<span class="lineNum">    1065 </span>                :       {
-<span class="lineNum">    1066 </span>                :         _Base::_M_clear();
-<span class="lineNum">    1067 </span>                :         _Base::_M_init();
-<span class="lineNum">    1068 </span>                :       }
-<span class="lineNum">    1069 </span>                : 
-<span class="lineNum">    1070 </span>                :       // [23.2.2.4] list operations
-<span class="lineNum">    1071 </span>                :       /**
-<span class="lineNum">    1072 </span>                :        *  @brief  Insert contents of another %list.
-<span class="lineNum">    1073 </span>                :        *  @param  position  Iterator referencing the element to insert before.
-<span class="lineNum">    1074 </span>                :        *  @param  x  Source list.
-<span class="lineNum">    1075 </span>                :        *
-<span class="lineNum">    1076 </span>                :        *  The elements of @a x are inserted in constant time in front of
-<span class="lineNum">    1077 </span>                :        *  the element referenced by @a position.  @a x becomes an empty
-<span class="lineNum">    1078 </span>                :        *  list.
-<span class="lineNum">    1079 </span>                :        *
-<span class="lineNum">    1080 </span>                :        *  Requires this != @a x.
-<span class="lineNum">    1081 </span>                :        */
-<span class="lineNum">    1082 </span>                :       void
-<span class="lineNum">    1083 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">    1084 </span>                :       splice(iterator __position, list&amp;&amp; __x)
-<span class="lineNum">    1085 </span>                : #else
-<span class="lineNum">    1086 </span>                :       splice(iterator __position, list&amp; __x)
-<span class="lineNum">    1087 </span>                : #endif
-<span class="lineNum">    1088 </span>                :       {
-<span class="lineNum">    1089 </span>                :         if (!__x.empty())
-<span class="lineNum">    1090 </span>                :           {
-<span class="lineNum">    1091 </span>                :             _M_check_equal_allocators(__x);
-<span class="lineNum">    1092 </span>                : 
-<span class="lineNum">    1093 </span>                :             this-&gt;_M_transfer(__position, __x.begin(), __x.end());
-<span class="lineNum">    1094 </span>                :           }
-<span class="lineNum">    1095 </span>                :       }
-<span class="lineNum">    1096 </span>                : 
-<span class="lineNum">    1097 </span>                :       /**
-<span class="lineNum">    1098 </span>                :        *  @brief  Insert element from another %list.
-<span class="lineNum">    1099 </span>                :        *  @param  position  Iterator referencing the element to insert before.
-<span class="lineNum">    1100 </span>                :        *  @param  x  Source list.
-<span class="lineNum">    1101 </span>                :        *  @param  i  Iterator referencing the element to move.
-<span class="lineNum">    1102 </span>                :        *
-<span class="lineNum">    1103 </span>                :        *  Removes the element in list @a x referenced by @a i and
-<span class="lineNum">    1104 </span>                :        *  inserts it into the current list before @a position.
-<span class="lineNum">    1105 </span>                :        */
-<span class="lineNum">    1106 </span>                :       void
-<span class="lineNum">    1107 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">    1108 </span>                :       splice(iterator __position, list&amp;&amp; __x, iterator __i)
-<span class="lineNum">    1109 </span>                : #else
-<span class="lineNum">    1110 </span>                :       splice(iterator __position, list&amp; __x, iterator __i)
-<span class="lineNum">    1111 </span>                : #endif
-<span class="lineNum">    1112 </span>                :       {
-<span class="lineNum">    1113 </span>                :         iterator __j = __i;
-<span class="lineNum">    1114 </span>                :         ++__j;
-<span class="lineNum">    1115 </span>                :         if (__position == __i || __position == __j)
-<span class="lineNum">    1116 </span>                :           return;
-<span class="lineNum">    1117 </span>                : 
-<span class="lineNum">    1118 </span>                :         if (this != &amp;__x)
-<span class="lineNum">    1119 </span>                :           _M_check_equal_allocators(__x);
-<span class="lineNum">    1120 </span>                : 
-<span class="lineNum">    1121 </span>                :         this-&gt;_M_transfer(__position, __i, __j);
-<span class="lineNum">    1122 </span>                :       }
-<span class="lineNum">    1123 </span>                : 
-<span class="lineNum">    1124 </span>                :       /**
-<span class="lineNum">    1125 </span>                :        *  @brief  Insert range from another %list.
-<span class="lineNum">    1126 </span>                :        *  @param  position  Iterator referencing the element to insert before.
-<span class="lineNum">    1127 </span>                :        *  @param  x  Source list.
-<span class="lineNum">    1128 </span>                :        *  @param  first  Iterator referencing the start of range in x.
-<span class="lineNum">    1129 </span>                :        *  @param  last  Iterator referencing the end of range in x.
-<span class="lineNum">    1130 </span>                :        *
-<span class="lineNum">    1131 </span>                :        *  Removes elements in the range [first,last) and inserts them
-<span class="lineNum">    1132 </span>                :        *  before @a position in constant time.
-<span class="lineNum">    1133 </span>                :        *
-<span class="lineNum">    1134 </span>                :        *  Undefined if @a position is in [first,last).
-<span class="lineNum">    1135 </span>                :        */
-<span class="lineNum">    1136 </span>                :       void
-<span class="lineNum">    1137 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">    1138 </span>                :       splice(iterator __position, list&amp;&amp; __x, iterator __first,
-<span class="lineNum">    1139 </span>                :              iterator __last)
-<span class="lineNum">    1140 </span>                : #else
-<span class="lineNum">    1141 </span>                :       splice(iterator __position, list&amp; __x, iterator __first,
-<span class="lineNum">    1142 </span>                :              iterator __last)
-<span class="lineNum">    1143 </span>                : #endif
-<span class="lineNum">    1144 </span>                :       {
-<span class="lineNum">    1145 </span>                :         if (__first != __last)
-<span class="lineNum">    1146 </span>                :           {
-<span class="lineNum">    1147 </span>                :             if (this != &amp;__x)
-<span class="lineNum">    1148 </span>                :               _M_check_equal_allocators(__x);
-<span class="lineNum">    1149 </span>                : 
-<span class="lineNum">    1150 </span>                :             this-&gt;_M_transfer(__position, __first, __last);
-<span class="lineNum">    1151 </span>                :           }
-<span class="lineNum">    1152 </span>                :       }
-<span class="lineNum">    1153 </span>                : 
-<span class="lineNum">    1154 </span>                :       /**
-<span class="lineNum">    1155 </span>                :        *  @brief  Remove all elements equal to value.
-<span class="lineNum">    1156 </span>                :        *  @param  value  The value to remove.
-<span class="lineNum">    1157 </span>                :        *
-<span class="lineNum">    1158 </span>                :        *  Removes every element in the list equal to @a value.
-<span class="lineNum">    1159 </span>                :        *  Remaining elements stay in list order.  Note that this
-<span class="lineNum">    1160 </span>                :        *  function only erases the elements, and that if the elements
-<span class="lineNum">    1161 </span>                :        *  themselves are pointers, the pointed-to memory is not
-<span class="lineNum">    1162 </span>                :        *  touched in any way.  Managing the pointer is the user's
-<span class="lineNum">    1163 </span>                :        *  responsibility.
-<span class="lineNum">    1164 </span>                :        */
-<span class="lineNum">    1165 </span>                :       void
-<span class="lineNum">    1166 </span>                :       remove(const _Tp&amp; __value);
-<span class="lineNum">    1167 </span>                : 
-<span class="lineNum">    1168 </span>                :       /**
-<span class="lineNum">    1169 </span>                :        *  @brief  Remove all elements satisfying a predicate.
-<span class="lineNum">    1170 </span>                :        *  @param  Predicate  Unary predicate function or object.
-<span class="lineNum">    1171 </span>                :        *
-<span class="lineNum">    1172 </span>                :        *  Removes every element in the list for which the predicate
-<span class="lineNum">    1173 </span>                :        *  returns true.  Remaining elements stay in list order.  Note
-<span class="lineNum">    1174 </span>                :        *  that this function only erases the elements, and that if the
-<span class="lineNum">    1175 </span>                :        *  elements themselves are pointers, the pointed-to memory is
-<span class="lineNum">    1176 </span>                :        *  not touched in any way.  Managing the pointer is the user's
-<span class="lineNum">    1177 </span>                :        *  responsibility.
-<span class="lineNum">    1178 </span>                :        */
-<span class="lineNum">    1179 </span>                :       template&lt;typename _Predicate&gt;
-<span class="lineNum">    1180 </span>                :         void
-<span class="lineNum">    1181 </span>                :         remove_if(_Predicate);
-<span class="lineNum">    1182 </span>                : 
-<span class="lineNum">    1183 </span>                :       /**
-<span class="lineNum">    1184 </span>                :        *  @brief  Remove consecutive duplicate elements.
-<span class="lineNum">    1185 </span>                :        *
-<span class="lineNum">    1186 </span>                :        *  For each consecutive set of elements with the same value,
-<span class="lineNum">    1187 </span>                :        *  remove all but the first one.  Remaining elements stay in
-<span class="lineNum">    1188 </span>                :        *  list order.  Note that this function only erases the
-<span class="lineNum">    1189 </span>                :        *  elements, and that if the elements themselves are pointers,
-<span class="lineNum">    1190 </span>                :        *  the pointed-to memory is not touched in any way.  Managing
-<span class="lineNum">    1191 </span>                :        *  the pointer is the user's responsibility.
-<span class="lineNum">    1192 </span>                :        */
-<span class="lineNum">    1193 </span>                :       void
-<span class="lineNum">    1194 </span>                :       unique();
-<span class="lineNum">    1195 </span>                : 
-<span class="lineNum">    1196 </span>                :       /**
-<span class="lineNum">    1197 </span>                :        *  @brief  Remove consecutive elements satisfying a predicate.
-<span class="lineNum">    1198 </span>                :        *  @param  BinaryPredicate  Binary predicate function or object.
-<span class="lineNum">    1199 </span>                :        *
-<span class="lineNum">    1200 </span>                :        *  For each consecutive set of elements [first,last) that
-<span class="lineNum">    1201 </span>                :        *  satisfy predicate(first,i) where i is an iterator in
-<span class="lineNum">    1202 </span>                :        *  [first,last), remove all but the first one.  Remaining
-<span class="lineNum">    1203 </span>                :        *  elements stay in list order.  Note that this function only
-<span class="lineNum">    1204 </span>                :        *  erases the elements, and that if the elements themselves are
-<span class="lineNum">    1205 </span>                :        *  pointers, the pointed-to memory is not touched in any way.
-<span class="lineNum">    1206 </span>                :        *  Managing the pointer is the user's responsibility.
-<span class="lineNum">    1207 </span>                :        */
-<span class="lineNum">    1208 </span>                :       template&lt;typename _BinaryPredicate&gt;
-<span class="lineNum">    1209 </span>                :         void
-<span class="lineNum">    1210 </span>                :         unique(_BinaryPredicate);
-<span class="lineNum">    1211 </span>                : 
-<span class="lineNum">    1212 </span>                :       /**
-<span class="lineNum">    1213 </span>                :        *  @brief  Merge sorted lists.
-<span class="lineNum">    1214 </span>                :        *  @param  x  Sorted list to merge.
-<span class="lineNum">    1215 </span>                :        *
-<span class="lineNum">    1216 </span>                :        *  Assumes that both @a x and this list are sorted according to
-<span class="lineNum">    1217 </span>                :        *  operator&lt;().  Merges elements of @a x into this list in
-<span class="lineNum">    1218 </span>                :        *  sorted order, leaving @a x empty when complete.  Elements in
-<span class="lineNum">    1219 </span>                :        *  this list precede elements in @a x that are equal.
-<span class="lineNum">    1220 </span>                :        */
-<span class="lineNum">    1221 </span>                :       void
-<span class="lineNum">    1222 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">    1223 </span>                :       merge(list&amp;&amp; __x);
-<span class="lineNum">    1224 </span>                : #else
-<span class="lineNum">    1225 </span>                :       merge(list&amp; __x);
-<span class="lineNum">    1226 </span>                : #endif
-<span class="lineNum">    1227 </span>                : 
-<span class="lineNum">    1228 </span>                :       /**
-<span class="lineNum">    1229 </span>                :        *  @brief  Merge sorted lists according to comparison function.
-<span class="lineNum">    1230 </span>                :        *  @param  x  Sorted list to merge.
-<span class="lineNum">    1231 </span>                :        *  @param StrictWeakOrdering Comparison function defining
-<span class="lineNum">    1232 </span>                :        *  sort order.
-<span class="lineNum">    1233 </span>                :        *
-<span class="lineNum">    1234 </span>                :        *  Assumes that both @a x and this list are sorted according to
-<span class="lineNum">    1235 </span>                :        *  StrictWeakOrdering.  Merges elements of @a x into this list
-<span class="lineNum">    1236 </span>                :        *  in sorted order, leaving @a x empty when complete.  Elements
-<span class="lineNum">    1237 </span>                :        *  in this list precede elements in @a x that are equivalent
-<span class="lineNum">    1238 </span>                :        *  according to StrictWeakOrdering().
-<span class="lineNum">    1239 </span>                :        */
-<span class="lineNum">    1240 </span>                :       template&lt;typename _StrictWeakOrdering&gt;
-<span class="lineNum">    1241 </span>                :         void
-<span class="lineNum">    1242 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">    1243 </span>                :         merge(list&amp;&amp;, _StrictWeakOrdering);
-<span class="lineNum">    1244 </span>                : #else
-<span class="lineNum">    1245 </span>                :         merge(list&amp;, _StrictWeakOrdering);
-<span class="lineNum">    1246 </span>                : #endif
-<span class="lineNum">    1247 </span>                : 
-<span class="lineNum">    1248 </span>                :       /**
-<span class="lineNum">    1249 </span>                :        *  @brief  Reverse the elements in list.
-<span class="lineNum">    1250 </span>                :        *
-<span class="lineNum">    1251 </span>                :        *  Reverse the order of elements in the list in linear time.
-<span class="lineNum">    1252 </span>                :        */
-<span class="lineNum">    1253 </span>                :       void
-<span class="lineNum">    1254 </span>                :       reverse()
-<span class="lineNum">    1255 </span>                :       { this-&gt;_M_impl._M_node.reverse(); }
-<span class="lineNum">    1256 </span>                : 
-<span class="lineNum">    1257 </span>                :       /**
-<span class="lineNum">    1258 </span>                :        *  @brief  Sort the elements.
-<span class="lineNum">    1259 </span>                :        *
-<span class="lineNum">    1260 </span>                :        *  Sorts the elements of this list in NlogN time.  Equivalent
-<span class="lineNum">    1261 </span>                :        *  elements remain in list order.
-<span class="lineNum">    1262 </span>                :        */
-<span class="lineNum">    1263 </span>                :       void
-<span class="lineNum">    1264 </span>                :       sort();
-<span class="lineNum">    1265 </span>                : 
-<span class="lineNum">    1266 </span>                :       /**
-<span class="lineNum">    1267 </span>                :        *  @brief  Sort the elements according to comparison function.
-<span class="lineNum">    1268 </span>                :        *
-<span class="lineNum">    1269 </span>                :        *  Sorts the elements of this list in NlogN time.  Equivalent
-<span class="lineNum">    1270 </span>                :        *  elements remain in list order.
-<span class="lineNum">    1271 </span>                :        */
-<span class="lineNum">    1272 </span>                :       template&lt;typename _StrictWeakOrdering&gt;
-<span class="lineNum">    1273 </span>                :         void
-<span class="lineNum">    1274 </span>                :         sort(_StrictWeakOrdering);
-<span class="lineNum">    1275 </span>                : 
-<span class="lineNum">    1276 </span>                :     protected:
-<span class="lineNum">    1277 </span>                :       // Internal constructor functions follow.
-<span class="lineNum">    1278 </span>                : 
-<span class="lineNum">    1279 </span>                :       // Called by the range constructor to implement [23.1.1]/9
-<span class="lineNum">    1280 </span>                : 
-<span class="lineNum">    1281 </span>                :       // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">    1282 </span>                :       // 438. Ambiguity in the &quot;do the right thing&quot; clause
-<span class="lineNum">    1283 </span>                :       template&lt;typename _Integer&gt;
-<span class="lineNum">    1284 </span>                :         void
-<span class="lineNum">    1285 </span>                :         _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type)
-<span class="lineNum">    1286 </span>                :         { _M_fill_initialize(static_cast&lt;size_type&gt;(__n), __x); }
-<span class="lineNum">    1287 </span>                : 
-<span class="lineNum">    1288 </span>                :       // Called by the range constructor to implement [23.1.1]/9
-<span class="lineNum">    1289 </span>                :       template&lt;typename _InputIterator&gt;
-<span class="lineNum">    1290 </span>                :         void
-<span class="lineNum">    1291 </span>                :         _M_initialize_dispatch(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">    1292 </span>                :                                __false_type)
-<span class="lineNum">    1293 </span>                :         {
-<span class="lineNum">    1294 </span>                :           for (; __first != __last; ++__first)
-<span class="lineNum">    1295 </span>                :             push_back(*__first);
-<span class="lineNum">    1296 </span>                :         }
-<span class="lineNum">    1297 </span>                : 
-<span class="lineNum">    1298 </span>                :       // Called by list(n,v,a), and the range constructor when it turns out
-<span class="lineNum">    1299 </span>                :       // to be the same thing.
-<span class="lineNum">    1300 </span>                :       void
-<span class="lineNum">    1301 </span>                :       _M_fill_initialize(size_type __n, const value_type&amp; __x)
-<span class="lineNum">    1302 </span>                :       {
-<span class="lineNum">    1303 </span>                :         for (; __n &gt; 0; --__n)
-<span class="lineNum">    1304 </span>                :           push_back(__x);
-<span class="lineNum">    1305 </span>                :       }
-<span class="lineNum">    1306 </span>                : 
-<span class="lineNum">    1307 </span>                : 
-<span class="lineNum">    1308 </span>                :       // Internal assign functions follow.
-<span class="lineNum">    1309 </span>                : 
-<span class="lineNum">    1310 </span>                :       // Called by the range assign to implement [23.1.1]/9
-<span class="lineNum">    1311 </span>                : 
-<span class="lineNum">    1312 </span>                :       // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">    1313 </span>                :       // 438. Ambiguity in the &quot;do the right thing&quot; clause
-<span class="lineNum">    1314 </span>                :       template&lt;typename _Integer&gt;
-<span class="lineNum">    1315 </span>                :         void
-<span class="lineNum">    1316 </span>                :         _M_assign_dispatch(_Integer __n, _Integer __val, __true_type)
-<span class="lineNum">    1317 </span>                :         { _M_fill_assign(__n, __val); }
-<span class="lineNum">    1318 </span>                : 
-<span class="lineNum">    1319 </span>                :       // Called by the range assign to implement [23.1.1]/9
-<span class="lineNum">    1320 </span>                :       template&lt;typename _InputIterator&gt;
-<span class="lineNum">    1321 </span>                :         void
-<span class="lineNum">    1322 </span>                :         _M_assign_dispatch(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">    1323 </span>                :                            __false_type);
-<span class="lineNum">    1324 </span>                : 
-<span class="lineNum">    1325 </span>                :       // Called by assign(n,t), and the range assign when it turns out
-<span class="lineNum">    1326 </span>                :       // to be the same thing.
-<span class="lineNum">    1327 </span>                :       void
-<span class="lineNum">    1328 </span>                :       _M_fill_assign(size_type __n, const value_type&amp; __val);
-<span class="lineNum">    1329 </span>                : 
-<span class="lineNum">    1330 </span>                : 
-<span class="lineNum">    1331 </span>                :       // Moves the elements from [first,last) before position.
-<span class="lineNum">    1332 </span>                :       void
-<span class="lineNum">    1333 </span>                :       _M_transfer(iterator __position, iterator __first, iterator __last)
-<span class="lineNum">    1334 </span>                :       { __position._M_node-&gt;transfer(__first._M_node, __last._M_node); }
-<span class="lineNum">    1335 </span>                : 
-<span class="lineNum">    1336 </span>                :       // Inserts new element at position given and with value given.
-<span class="lineNum">    1337 </span>                : #ifndef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">    1338 </span>                :       void
-<span class="lineNum">    1339 </span><span class="lineCov">             47 :       _M_insert(iterator __position, const value_type&amp; __x)</span>
-<span class="lineNum">    1340 </span>                :       {
-<span class="lineNum">    1341 </span><span class="lineCov">             47 :         _Node* __tmp = _M_create_node(__x);</span>
-<span class="lineNum">    1342 </span><span class="lineCov">             47 :         __tmp-&gt;hook(__position._M_node);</span>
-<span class="lineNum">    1343 </span><span class="lineCov">             47 :       }</span>
-<span class="lineNum">    1344 </span>                : #else
-<span class="lineNum">    1345 </span>                :      template&lt;typename... _Args&gt;
-<span class="lineNum">    1346 </span>                :        void
-<span class="lineNum">    1347 </span>                :        _M_insert(iterator __position, _Args&amp;&amp;... __args)
-<span class="lineNum">    1348 </span>                :        {
-<span class="lineNum">    1349 </span>                :          _Node* __tmp = _M_create_node(std::forward&lt;_Args&gt;(__args)...);
-<span class="lineNum">    1350 </span>                :          __tmp-&gt;hook(__position._M_node);
-<span class="lineNum">    1351 </span>                :        }
-<span class="lineNum">    1352 </span>                : #endif
-<span class="lineNum">    1353 </span>                : 
-<span class="lineNum">    1354 </span>                :       // Erases element at position given.
-<span class="lineNum">    1355 </span>                :       void
-<span class="lineNum">    1356 </span><span class="lineCov">             25 :       _M_erase(iterator __position)</span>
-<span class="lineNum">    1357 </span>                :       {
-<span class="lineNum">    1358 </span><span class="lineCov">             25 :         __position._M_node-&gt;unhook();</span>
-<span class="lineNum">    1359 </span><span class="lineCov">             25 :         _Node* __n = static_cast&lt;_Node*&gt;(__position._M_node);</span>
-<span class="lineNum">    1360 </span><span class="lineCov">             25 :         _M_get_Tp_allocator().destroy(&amp;__n-&gt;_M_data);</span>
-<span class="lineNum">    1361 </span><span class="lineCov">             25 :         _M_put_node(__n);</span>
-<span class="lineNum">    1362 </span><span class="lineCov">             25 :       }</span>
-<span class="lineNum">    1363 </span>                : 
-<span class="lineNum">    1364 </span>                :       // To implement the splice (and merge) bits of N1599.
-<span class="lineNum">    1365 </span>                :       void
-<span class="lineNum">    1366 </span>                :       _M_check_equal_allocators(list&amp; __x)
-<span class="lineNum">    1367 </span>                :       {
-<span class="lineNum">    1368 </span>                :         if (std::__alloc_neq&lt;typename _Base::_Node_alloc_type&gt;::
-<span class="lineNum">    1369 </span>                :             _S_do_it(_M_get_Node_allocator(), __x._M_get_Node_allocator()))
-<span class="lineNum">    1370 </span>                :           __throw_runtime_error(__N(&quot;list::_M_check_equal_allocators&quot;));
-<span class="lineNum">    1371 </span>                :       }
-<span class="lineNum">    1372 </span>                :     };
-<span class="lineNum">    1373 </span>                : 
-<span class="lineNum">    1374 </span>                :   /**
-<span class="lineNum">    1375 </span>                :    *  @brief  List equality comparison.
-<span class="lineNum">    1376 </span>                :    *  @param  x  A %list.
-<span class="lineNum">    1377 </span>                :    *  @param  y  A %list of the same type as @a x.
-<span class="lineNum">    1378 </span>                :    *  @return  True iff the size and elements of the lists are equal.
-<span class="lineNum">    1379 </span>                :    *
-<span class="lineNum">    1380 </span>                :    *  This is an equivalence relation.  It is linear in the size of
-<span class="lineNum">    1381 </span>                :    *  the lists.  Lists are considered equivalent if their sizes are
-<span class="lineNum">    1382 </span>                :    *  equal, and if corresponding elements compare equal.
-<span class="lineNum">    1383 </span>                :   */
-<span class="lineNum">    1384 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">    1385 </span>                :     inline bool
-<span class="lineNum">    1386 </span><span class="lineCov">              4 :     operator==(const list&lt;_Tp, _Alloc&gt;&amp; __x, const list&lt;_Tp, _Alloc&gt;&amp; __y)</span>
-<span class="lineNum">    1387 </span>                :     {
-<span class="lineNum">    1388 </span>                :       typedef typename list&lt;_Tp, _Alloc&gt;::const_iterator const_iterator;
-<span class="lineNum">    1389 </span><span class="lineCov">              4 :       const_iterator __end1 = __x.end();</span>
-<span class="lineNum">    1390 </span><span class="lineCov">              4 :       const_iterator __end2 = __y.end();</span>
-<span class="lineNum">    1391 </span>                : 
-<span class="lineNum">    1392 </span><span class="lineCov">              4 :       const_iterator __i1 = __x.begin();</span>
-<span class="lineNum">    1393 </span><span class="lineCov">              4 :       const_iterator __i2 = __y.begin();</span>
-<span class="lineNum">    1394 </span><span class="lineCov">             12 :       while (__i1 != __end1 &amp;&amp; __i2 != __end2 &amp;&amp; *__i1 == *__i2)</span>
-<span class="lineNum">    1395 </span>                :         {
-<span class="lineNum">    1396 </span><span class="lineCov">              4 :           ++__i1;</span>
-<span class="lineNum">    1397 </span><span class="lineCov">              4 :           ++__i2;</span>
-<span class="lineNum">    1398 </span>                :         }
-<span class="lineNum">    1399 </span><span class="lineCov">              4 :       return __i1 == __end1 &amp;&amp; __i2 == __end2;</span>
-<span class="lineNum">    1400 </span>                :     }
-<span class="lineNum">    1401 </span>                : 
-<span class="lineNum">    1402 </span>                :   /**
-<span class="lineNum">    1403 </span>                :    *  @brief  List ordering relation.
-<span class="lineNum">    1404 </span>                :    *  @param  x  A %list.
-<span class="lineNum">    1405 </span>                :    *  @param  y  A %list of the same type as @a x.
-<span class="lineNum">    1406 </span>                :    *  @return  True iff @a x is lexicographically less than @a y.
-<span class="lineNum">    1407 </span>                :    *
-<span class="lineNum">    1408 </span>                :    *  This is a total ordering relation.  It is linear in the size of the
-<span class="lineNum">    1409 </span>                :    *  lists.  The elements must be comparable with @c &lt;.
-<span class="lineNum">    1410 </span>                :    *
-<span class="lineNum">    1411 </span>                :    *  See std::lexicographical_compare() for how the determination is made.
-<span class="lineNum">    1412 </span>                :   */
-<span class="lineNum">    1413 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">    1414 </span>                :     inline bool
-<span class="lineNum">    1415 </span>                :     operator&lt;(const list&lt;_Tp, _Alloc&gt;&amp; __x, const list&lt;_Tp, _Alloc&gt;&amp; __y)
-<span class="lineNum">    1416 </span>                :     { return std::lexicographical_compare(__x.begin(), __x.end(),
-<span class="lineNum">    1417 </span>                :                                           __y.begin(), __y.end()); }
-<span class="lineNum">    1418 </span>                : 
-<span class="lineNum">    1419 </span>                :   /// Based on operator==
-<span class="lineNum">    1420 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">    1421 </span>                :     inline bool
-<span class="lineNum">    1422 </span><span class="lineCov">              2 :     operator!=(const list&lt;_Tp, _Alloc&gt;&amp; __x, const list&lt;_Tp, _Alloc&gt;&amp; __y)</span>
-<span class="lineNum">    1423 </span><span class="lineCov">              2 :     { return !(__x == __y); }</span>
-<span class="lineNum">    1424 </span>                : 
-<span class="lineNum">    1425 </span>                :   /// Based on operator&lt;
-<span class="lineNum">    1426 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">    1427 </span>                :     inline bool
-<span class="lineNum">    1428 </span>                :     operator&gt;(const list&lt;_Tp, _Alloc&gt;&amp; __x, const list&lt;_Tp, _Alloc&gt;&amp; __y)
-<span class="lineNum">    1429 </span>                :     { return __y &lt; __x; }
-<span class="lineNum">    1430 </span>                : 
-<span class="lineNum">    1431 </span>                :   /// Based on operator&lt;
-<span class="lineNum">    1432 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">    1433 </span>                :     inline bool
-<span class="lineNum">    1434 </span>                :     operator&lt;=(const list&lt;_Tp, _Alloc&gt;&amp; __x, const list&lt;_Tp, _Alloc&gt;&amp; __y)
-<span class="lineNum">    1435 </span>                :     { return !(__y &lt; __x); }
-<span class="lineNum">    1436 </span>                : 
-<span class="lineNum">    1437 </span>                :   /// Based on operator&lt;
-<span class="lineNum">    1438 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">    1439 </span>                :     inline bool
-<span class="lineNum">    1440 </span>                :     operator&gt;=(const list&lt;_Tp, _Alloc&gt;&amp; __x, const list&lt;_Tp, _Alloc&gt;&amp; __y)
-<span class="lineNum">    1441 </span>                :     { return !(__x &lt; __y); }
-<span class="lineNum">    1442 </span>                : 
-<span class="lineNum">    1443 </span>                :   /// See std::list::swap().
-<span class="lineNum">    1444 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">    1445 </span>                :     inline void
-<span class="lineNum">    1446 </span>                :     swap(list&lt;_Tp, _Alloc&gt;&amp; __x, list&lt;_Tp, _Alloc&gt;&amp; __y)
-<span class="lineNum">    1447 </span>                :     { __x.swap(__y); }
-<span class="lineNum">    1448 </span>                : 
-<span class="lineNum">    1449 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">    1450 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">    1451 </span>                :     inline void
-<span class="lineNum">    1452 </span>                :     swap(list&lt;_Tp, _Alloc&gt;&amp;&amp; __x, list&lt;_Tp, _Alloc&gt;&amp; __y)
-<span class="lineNum">    1453 </span>                :     { __x.swap(__y); }
-<span class="lineNum">    1454 </span>                : 
-<span class="lineNum">    1455 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">    1456 </span>                :     inline void
-<span class="lineNum">    1457 </span>                :     swap(list&lt;_Tp, _Alloc&gt;&amp; __x, list&lt;_Tp, _Alloc&gt;&amp;&amp; __y)
-<span class="lineNum">    1458 </span>                :     { __x.swap(__y); }
-<span class="lineNum">    1459 </span>                : #endif
-<span class="lineNum">    1460 </span>                : 
-<span class="lineNum">    1461 </span>                : _GLIBCXX_END_NESTED_NAMESPACE
-<span class="lineNum">    1462 </span>                : 
-<span class="lineNum">    1463 </span>                : #endif /* _STL_LIST_H */
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/bits/stl_map.h.gcov.html b/rep/usr/include/c++/4.3/bits/stl_map.h.gcov.html
deleted file mode 100644
index 6a8cb4e..0000000
--- a/rep/usr/include/c++/4.3/bits/stl_map.h.gcov.html
+++ /dev/null
@@ -1,894 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_map.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_map.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">41</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">41</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // Map implementation -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
-<span class="lineNum">       4 </span>                : // Free Software Foundation, Inc.
-<span class="lineNum">       5 </span>                : //
-<span class="lineNum">       6 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       7 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       8 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">       9 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      10 </span>                : // any later version.
-<span class="lineNum">      11 </span>                : 
-<span class="lineNum">      12 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      13 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      14 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      15 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      16 </span>                : 
-<span class="lineNum">      17 </span>                : // You should have received a copy of the GNU General Public License along
-<span class="lineNum">      18 </span>                : // with this library; see the file COPYING.  If not, write to the Free
-<span class="lineNum">      19 </span>                : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-<span class="lineNum">      20 </span>                : // USA.
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      23 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      24 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      25 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      26 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      27 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      28 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      29 </span>                : // the GNU General Public License.
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : /*
-<span class="lineNum">      32 </span>                :  *
-<span class="lineNum">      33 </span>                :  * Copyright (c) 1994
-<span class="lineNum">      34 </span>                :  * Hewlett-Packard Company
-<span class="lineNum">      35 </span>                :  *
-<span class="lineNum">      36 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      37 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      38 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      39 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      40 </span>                :  * in supporting documentation.  Hewlett-Packard Company makes no
-<span class="lineNum">      41 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      42 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      43 </span>                :  *
-<span class="lineNum">      44 </span>                :  *
-<span class="lineNum">      45 </span>                :  * Copyright (c) 1996,1997
-<span class="lineNum">      46 </span>                :  * Silicon Graphics Computer Systems, Inc.
-<span class="lineNum">      47 </span>                :  *
-<span class="lineNum">      48 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      49 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      50 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      51 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      52 </span>                :  * in supporting documentation.  Silicon Graphics makes no
-<span class="lineNum">      53 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      54 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      55 </span>                :  */
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span>                : /** @file stl_map.h
-<span class="lineNum">      58 </span>                :  *  This is an internal header file, included by other library headers.
-<span class="lineNum">      59 </span>                :  *  You should not attempt to use it directly.
-<span class="lineNum">      60 </span>                :  */
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span>                : #ifndef _STL_MAP_H
-<span class="lineNum">      63 </span>                : #define _STL_MAP_H 1
-<span class="lineNum">      64 </span>                : 
-<span class="lineNum">      65 </span>                : #include &lt;bits/functexcept.h&gt;
-<span class="lineNum">      66 </span>                : #include &lt;bits/concept_check.h&gt;
-<span class="lineNum">      67 </span>                : 
-<span class="lineNum">      68 </span>                : _GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D)
-<span class="lineNum">      69 </span>                : 
-<span class="lineNum">      70 </span>                :   /**
-<span class="lineNum">      71 </span>                :    *  @brief A standard container made up of (key,value) pairs, which can be
-<span class="lineNum">      72 </span>                :    *  retrieved based on a key, in logarithmic time.
-<span class="lineNum">      73 </span>                :    *
-<span class="lineNum">      74 </span>                :    *  @ingroup Containers
-<span class="lineNum">      75 </span>                :    *  @ingroup Assoc_containers
-<span class="lineNum">      76 </span>                :    *
-<span class="lineNum">      77 </span>                :    *  Meets the requirements of a &lt;a href=&quot;tables.html#65&quot;&gt;container&lt;/a&gt;, a
-<span class="lineNum">      78 </span>                :    *  &lt;a href=&quot;tables.html#66&quot;&gt;reversible container&lt;/a&gt;, and an
-<span class="lineNum">      79 </span>                :    *  &lt;a href=&quot;tables.html#69&quot;&gt;associative container&lt;/a&gt; (using unique keys).
-<span class="lineNum">      80 </span>                :    *  For a @c map&lt;Key,T&gt; the key_type is Key, the mapped_type is T, and the
-<span class="lineNum">      81 </span>                :    *  value_type is std::pair&lt;const Key,T&gt;.
-<span class="lineNum">      82 </span>                :    *
-<span class="lineNum">      83 </span>                :    *  Maps support bidirectional iterators.
-<span class="lineNum">      84 </span>                :    *
-<span class="lineNum">      85 </span>                :    *  The private tree data is declared exactly the same way for map and
-<span class="lineNum">      86 </span>                :    *  multimap; the distinction is made entirely in how the tree functions are
-<span class="lineNum">      87 </span>                :    *  called (*_unique versus *_equal, same as the standard).
-<span class="lineNum">      88 </span>                :   */
-<span class="lineNum">      89 </span>                :   template &lt;typename _Key, typename _Tp, typename _Compare = std::less&lt;_Key&gt;,
-<span class="lineNum">      90 </span>                :             typename _Alloc = std::allocator&lt;std::pair&lt;const _Key, _Tp&gt; &gt; &gt;
-<span class="lineNum">      91 </span>                :     class map
-<span class="lineNum">      92 </span><span class="lineCov">          12304 :     {</span>
-<span class="lineNum">      93 </span>                :     public:
-<span class="lineNum">      94 </span>                :       typedef _Key                                          key_type;
-<span class="lineNum">      95 </span>                :       typedef _Tp                                           mapped_type;
-<span class="lineNum">      96 </span>                :       typedef std::pair&lt;const _Key, _Tp&gt;                    value_type;
-<span class="lineNum">      97 </span>                :       typedef _Compare                                      key_compare;
-<span class="lineNum">      98 </span>                :       typedef _Alloc                                        allocator_type;
-<span class="lineNum">      99 </span>                : 
-<span class="lineNum">     100 </span>                :     private:
-<span class="lineNum">     101 </span>                :       // concept requirements
-<span class="lineNum">     102 </span>                :       typedef typename _Alloc::value_type                   _Alloc_value_type;
-<span class="lineNum">     103 </span>                :       __glibcxx_class_requires(_Tp, _SGIAssignableConcept)
-<span class="lineNum">     104 </span>                :       __glibcxx_class_requires4(_Compare, bool, _Key, _Key,
-<span class="lineNum">     105 </span>                :                                 _BinaryFunctionConcept)
-<span class="lineNum">     106 </span>                :       __glibcxx_class_requires2(value_type, _Alloc_value_type, _SameTypeConcept)
-<span class="lineNum">     107 </span>                : 
-<span class="lineNum">     108 </span>                :     public:
-<span class="lineNum">     109 </span>                :       class value_compare
-<span class="lineNum">     110 </span>                :       : public std::binary_function&lt;value_type, value_type, bool&gt;
-<span class="lineNum">     111 </span>                :       {
-<span class="lineNum">     112 </span>                :         friend class map&lt;_Key, _Tp, _Compare, _Alloc&gt;;
-<span class="lineNum">     113 </span>                :       protected:
-<span class="lineNum">     114 </span>                :         _Compare comp;
-<span class="lineNum">     115 </span>                : 
-<span class="lineNum">     116 </span>                :         value_compare(_Compare __c)
-<span class="lineNum">     117 </span>                :         : comp(__c) { }
-<span class="lineNum">     118 </span>                : 
-<span class="lineNum">     119 </span>                :       public:
-<span class="lineNum">     120 </span>                :         bool operator()(const value_type&amp; __x, const value_type&amp; __y) const
-<span class="lineNum">     121 </span>                :         { return comp(__x.first, __y.first); }
-<span class="lineNum">     122 </span>                :       };
-<span class="lineNum">     123 </span>                : 
-<span class="lineNum">     124 </span>                :     private:
-<span class="lineNum">     125 </span>                :       /// This turns a red-black tree into a [multi]map. 
-<span class="lineNum">     126 </span>                :       typedef typename _Alloc::template rebind&lt;value_type&gt;::other 
-<span class="lineNum">     127 </span>                :         _Pair_alloc_type;
-<span class="lineNum">     128 </span>                : 
-<span class="lineNum">     129 </span>                :       typedef _Rb_tree&lt;key_type, value_type, _Select1st&lt;value_type&gt;,
-<span class="lineNum">     130 </span>                :                        key_compare, _Pair_alloc_type&gt; _Rep_type;
-<span class="lineNum">     131 </span>                : 
-<span class="lineNum">     132 </span>                :       /// The actual tree structure.
-<span class="lineNum">     133 </span>                :       _Rep_type _M_t;
-<span class="lineNum">     134 </span>                : 
-<span class="lineNum">     135 </span>                :     public:
-<span class="lineNum">     136 </span>                :       // many of these are specified differently in ISO, but the following are
-<span class="lineNum">     137 </span>                :       // &quot;functionally equivalent&quot;
-<span class="lineNum">     138 </span>                :       typedef typename _Pair_alloc_type::pointer         pointer;
-<span class="lineNum">     139 </span>                :       typedef typename _Pair_alloc_type::const_pointer   const_pointer;
-<span class="lineNum">     140 </span>                :       typedef typename _Pair_alloc_type::reference       reference;
-<span class="lineNum">     141 </span>                :       typedef typename _Pair_alloc_type::const_reference const_reference;
-<span class="lineNum">     142 </span>                :       typedef typename _Rep_type::iterator               iterator;
-<span class="lineNum">     143 </span>                :       typedef typename _Rep_type::const_iterator         const_iterator;
-<span class="lineNum">     144 </span>                :       typedef typename _Rep_type::size_type              size_type;
-<span class="lineNum">     145 </span>                :       typedef typename _Rep_type::difference_type        difference_type;
-<span class="lineNum">     146 </span>                :       typedef typename _Rep_type::reverse_iterator       reverse_iterator;
-<span class="lineNum">     147 </span>                :       typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator;
-<span class="lineNum">     148 </span>                : 
-<span class="lineNum">     149 </span>                :       // [23.3.1.1] construct/copy/destroy
-<span class="lineNum">     150 </span>                :       // (get_allocator() is normally listed in this section, but seems to have
-<span class="lineNum">     151 </span>                :       // been accidentally omitted in the printed standard)
-<span class="lineNum">     152 </span>                :       /**
-<span class="lineNum">     153 </span>                :        *  @brief  Default constructor creates no elements.
-<span class="lineNum">     154 </span>                :        */
-<span class="lineNum">     155 </span><span class="lineCov">           2859 :       map()</span>
-<span class="lineNum">     156 </span><span class="lineCov">           2859 :       : _M_t() { }</span>
-<span class="lineNum">     157 </span>                : 
-<span class="lineNum">     158 </span>                :       /**
-<span class="lineNum">     159 </span>                :        *  @brief  Creates a %map with no elements.
-<span class="lineNum">     160 </span>                :        *  @param  comp  A comparison object.
-<span class="lineNum">     161 </span>                :        *  @param  a  An allocator object.
-<span class="lineNum">     162 </span>                :        */
-<span class="lineNum">     163 </span>                :       explicit
-<span class="lineNum">     164 </span>                :       map(const _Compare&amp; __comp,
-<span class="lineNum">     165 </span>                :           const allocator_type&amp; __a = allocator_type())
-<span class="lineNum">     166 </span>                :       : _M_t(__comp, __a) { }
-<span class="lineNum">     167 </span>                : 
-<span class="lineNum">     168 </span>                :       /**
-<span class="lineNum">     169 </span>                :        *  @brief  %Map copy constructor.
-<span class="lineNum">     170 </span>                :        *  @param  x  A %map of identical element and allocator types.
-<span class="lineNum">     171 </span>                :        *
-<span class="lineNum">     172 </span>                :        *  The newly-created %map uses a copy of the allocation object
-<span class="lineNum">     173 </span>                :        *  used by @a x.
-<span class="lineNum">     174 </span>                :        */
-<span class="lineNum">     175 </span><span class="lineCov">           9445 :       map(const map&amp; __x)</span>
-<span class="lineNum">     176 </span><span class="lineCov">           9445 :       : _M_t(__x._M_t) { }</span>
-<span class="lineNum">     177 </span>                : 
-<span class="lineNum">     178 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     179 </span>                :       /**
-<span class="lineNum">     180 </span>                :        *  @brief  %Map move constructor.
-<span class="lineNum">     181 </span>                :        *  @param  x  A %map of identical element and allocator types.
-<span class="lineNum">     182 </span>                :        *
-<span class="lineNum">     183 </span>                :        *  The newly-created %map contains the exact contents of @a x.
-<span class="lineNum">     184 </span>                :        *  The contents of @a x are a valid, but unspecified %map.
-<span class="lineNum">     185 </span>                :        */
-<span class="lineNum">     186 </span>                :       map(map&amp;&amp; __x)
-<span class="lineNum">     187 </span>                :       : _M_t(std::forward&lt;_Rep_type&gt;(__x._M_t)) { }
-<span class="lineNum">     188 </span>                : #endif
-<span class="lineNum">     189 </span>                : 
-<span class="lineNum">     190 </span>                :       /**
-<span class="lineNum">     191 </span>                :        *  @brief  Builds a %map from a range.
-<span class="lineNum">     192 </span>                :        *  @param  first  An input iterator.
-<span class="lineNum">     193 </span>                :        *  @param  last  An input iterator.
-<span class="lineNum">     194 </span>                :        *
-<span class="lineNum">     195 </span>                :        *  Create a %map consisting of copies of the elements from [first,last).
-<span class="lineNum">     196 </span>                :        *  This is linear in N if the range is already sorted, and NlogN
-<span class="lineNum">     197 </span>                :        *  otherwise (where N is distance(first,last)).
-<span class="lineNum">     198 </span>                :        */
-<span class="lineNum">     199 </span>                :       template&lt;typename _InputIterator&gt;
-<span class="lineNum">     200 </span>                :         map(_InputIterator __first, _InputIterator __last)
-<span class="lineNum">     201 </span>                :         : _M_t()
-<span class="lineNum">     202 </span>                :         { _M_t._M_insert_unique(__first, __last); }
-<span class="lineNum">     203 </span>                : 
-<span class="lineNum">     204 </span>                :       /**
-<span class="lineNum">     205 </span>                :        *  @brief  Builds a %map from a range.
-<span class="lineNum">     206 </span>                :        *  @param  first  An input iterator.
-<span class="lineNum">     207 </span>                :        *  @param  last  An input iterator.
-<span class="lineNum">     208 </span>                :        *  @param  comp  A comparison functor.
-<span class="lineNum">     209 </span>                :        *  @param  a  An allocator object.
-<span class="lineNum">     210 </span>                :        *
-<span class="lineNum">     211 </span>                :        *  Create a %map consisting of copies of the elements from [first,last).
-<span class="lineNum">     212 </span>                :        *  This is linear in N if the range is already sorted, and NlogN
-<span class="lineNum">     213 </span>                :        *  otherwise (where N is distance(first,last)).
-<span class="lineNum">     214 </span>                :        */
-<span class="lineNum">     215 </span>                :       template&lt;typename _InputIterator&gt;
-<span class="lineNum">     216 </span>                :         map(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">     217 </span>                :             const _Compare&amp; __comp,
-<span class="lineNum">     218 </span>                :             const allocator_type&amp; __a = allocator_type())
-<span class="lineNum">     219 </span>                :         : _M_t(__comp, __a)
-<span class="lineNum">     220 </span>                :         { _M_t._M_insert_unique(__first, __last); }
-<span class="lineNum">     221 </span>                : 
-<span class="lineNum">     222 </span>                :       // FIXME There is no dtor declared, but we should have something
-<span class="lineNum">     223 </span>                :       // generated by Doxygen.  I don't know what tags to add to this
-<span class="lineNum">     224 </span>                :       // paragraph to make that happen:
-<span class="lineNum">     225 </span>                :       /**
-<span class="lineNum">     226 </span>                :        *  The dtor only erases the elements, and note that if the elements
-<span class="lineNum">     227 </span>                :        *  themselves are pointers, the pointed-to memory is not touched in any
-<span class="lineNum">     228 </span>                :        *  way.  Managing the pointer is the user's responsibility.
-<span class="lineNum">     229 </span>                :        */
-<span class="lineNum">     230 </span>                : 
-<span class="lineNum">     231 </span>                :       /**
-<span class="lineNum">     232 </span>                :        *  @brief  %Map assignment operator.
-<span class="lineNum">     233 </span>                :        *  @param  x  A %map of identical element and allocator types.
-<span class="lineNum">     234 </span>                :        *
-<span class="lineNum">     235 </span>                :        *  All the elements of @a x are copied, but unlike the copy constructor,
-<span class="lineNum">     236 </span>                :        *  the allocator object is not copied.
-<span class="lineNum">     237 </span>                :        */
-<span class="lineNum">     238 </span>                :       map&amp;
-<span class="lineNum">     239 </span><span class="lineCov">             17 :       operator=(const map&amp; __x)</span>
-<span class="lineNum">     240 </span>                :       {
-<span class="lineNum">     241 </span><span class="lineCov">             17 :         _M_t = __x._M_t;</span>
-<span class="lineNum">     242 </span><span class="lineCov">             17 :         return *this;</span>
-<span class="lineNum">     243 </span>                :       }
-<span class="lineNum">     244 </span>                : 
-<span class="lineNum">     245 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     246 </span>                :       /**
-<span class="lineNum">     247 </span>                :        *  @brief  %Map move assignment operator.
-<span class="lineNum">     248 </span>                :        *  @param  x  A %map of identical element and allocator types.
-<span class="lineNum">     249 </span>                :        *
-<span class="lineNum">     250 </span>                :        *  The contents of @a x are moved into this map (without copying).
-<span class="lineNum">     251 </span>                :        *  @a x is a valid, but unspecified %map.
-<span class="lineNum">     252 </span>                :        */
-<span class="lineNum">     253 </span>                :       map&amp;
-<span class="lineNum">     254 </span>                :       operator=(map&amp;&amp; __x)
-<span class="lineNum">     255 </span>                :       {
-<span class="lineNum">     256 </span>                :         // NB: DR 675.
-<span class="lineNum">     257 </span>                :         this-&gt;clear();
-<span class="lineNum">     258 </span>                :         this-&gt;swap(__x); 
-<span class="lineNum">     259 </span>                :         return *this;
-<span class="lineNum">     260 </span>                :       }
-<span class="lineNum">     261 </span>                : #endif
-<span class="lineNum">     262 </span>                : 
-<span class="lineNum">     263 </span>                :       /// Get a copy of the memory allocation object.
-<span class="lineNum">     264 </span>                :       allocator_type
-<span class="lineNum">     265 </span>                :       get_allocator() const
-<span class="lineNum">     266 </span>                :       { return _M_t.get_allocator(); }
-<span class="lineNum">     267 </span>                : 
-<span class="lineNum">     268 </span>                :       // iterators
-<span class="lineNum">     269 </span>                :       /**
-<span class="lineNum">     270 </span>                :        *  Returns a read/write iterator that points to the first pair in the
-<span class="lineNum">     271 </span>                :        *  %map.
-<span class="lineNum">     272 </span>                :        *  Iteration is done in ascending order according to the keys.
-<span class="lineNum">     273 </span>                :        */
-<span class="lineNum">     274 </span>                :       iterator
-<span class="lineNum">     275 </span><span class="lineCov">           2681 :       begin()</span>
-<span class="lineNum">     276 </span><span class="lineCov">           2681 :       { return _M_t.begin(); }</span>
-<span class="lineNum">     277 </span>                : 
-<span class="lineNum">     278 </span>                :       /**
-<span class="lineNum">     279 </span>                :        *  Returns a read-only (constant) iterator that points to the first pair
-<span class="lineNum">     280 </span>                :        *  in the %map.  Iteration is done in ascending order according to the
-<span class="lineNum">     281 </span>                :        *  keys.
-<span class="lineNum">     282 </span>                :        */
-<span class="lineNum">     283 </span>                :       const_iterator
-<span class="lineNum">     284 </span><span class="lineCov">            154 :       begin() const</span>
-<span class="lineNum">     285 </span><span class="lineCov">            154 :       { return _M_t.begin(); }</span>
-<span class="lineNum">     286 </span>                : 
-<span class="lineNum">     287 </span>                :       /**
-<span class="lineNum">     288 </span>                :        *  Returns a read/write iterator that points one past the last
-<span class="lineNum">     289 </span>                :        *  pair in the %map.  Iteration is done in ascending order
-<span class="lineNum">     290 </span>                :        *  according to the keys.
-<span class="lineNum">     291 </span>                :        */
-<span class="lineNum">     292 </span>                :       iterator
-<span class="lineNum">     293 </span><span class="lineCov">         155879 :       end()</span>
-<span class="lineNum">     294 </span><span class="lineCov">         155879 :       { return _M_t.end(); }</span>
-<span class="lineNum">     295 </span>                : 
-<span class="lineNum">     296 </span>                :       /**
-<span class="lineNum">     297 </span>                :        *  Returns a read-only (constant) iterator that points one past the last
-<span class="lineNum">     298 </span>                :        *  pair in the %map.  Iteration is done in ascending order according to
-<span class="lineNum">     299 </span>                :        *  the keys.
-<span class="lineNum">     300 </span>                :        */
-<span class="lineNum">     301 </span>                :       const_iterator
-<span class="lineNum">     302 </span><span class="lineCov">         441802 :       end() const</span>
-<span class="lineNum">     303 </span><span class="lineCov">         441802 :       { return _M_t.end(); }</span>
-<span class="lineNum">     304 </span>                : 
-<span class="lineNum">     305 </span>                :       /**
-<span class="lineNum">     306 </span>                :        *  Returns a read/write reverse iterator that points to the last pair in
-<span class="lineNum">     307 </span>                :        *  the %map.  Iteration is done in descending order according to the
-<span class="lineNum">     308 </span>                :        *  keys.
-<span class="lineNum">     309 </span>                :        */
-<span class="lineNum">     310 </span>                :       reverse_iterator
-<span class="lineNum">     311 </span>                :       rbegin()
-<span class="lineNum">     312 </span>                :       { return _M_t.rbegin(); }
-<span class="lineNum">     313 </span>                : 
-<span class="lineNum">     314 </span>                :       /**
-<span class="lineNum">     315 </span>                :        *  Returns a read-only (constant) reverse iterator that points to the
-<span class="lineNum">     316 </span>                :        *  last pair in the %map.  Iteration is done in descending order
-<span class="lineNum">     317 </span>                :        *  according to the keys.
-<span class="lineNum">     318 </span>                :        */
-<span class="lineNum">     319 </span>                :       const_reverse_iterator
-<span class="lineNum">     320 </span><span class="lineCov">             32 :       rbegin() const</span>
-<span class="lineNum">     321 </span><span class="lineCov">             32 :       { return _M_t.rbegin(); }</span>
-<span class="lineNum">     322 </span>                : 
-<span class="lineNum">     323 </span>                :       /**
-<span class="lineNum">     324 </span>                :        *  Returns a read/write reverse iterator that points to one before the
-<span class="lineNum">     325 </span>                :        *  first pair in the %map.  Iteration is done in descending order
-<span class="lineNum">     326 </span>                :        *  according to the keys.
-<span class="lineNum">     327 </span>                :        */
-<span class="lineNum">     328 </span>                :       reverse_iterator
-<span class="lineNum">     329 </span>                :       rend()
-<span class="lineNum">     330 </span>                :       { return _M_t.rend(); }
-<span class="lineNum">     331 </span>                : 
-<span class="lineNum">     332 </span>                :       /**
-<span class="lineNum">     333 </span>                :        *  Returns a read-only (constant) reverse iterator that points to one
-<span class="lineNum">     334 </span>                :        *  before the first pair in the %map.  Iteration is done in descending
-<span class="lineNum">     335 </span>                :        *  order according to the keys.
-<span class="lineNum">     336 </span>                :        */
-<span class="lineNum">     337 </span>                :       const_reverse_iterator
-<span class="lineNum">     338 </span>                :       rend() const
-<span class="lineNum">     339 </span>                :       { return _M_t.rend(); }
-<span class="lineNum">     340 </span>                : 
-<span class="lineNum">     341 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     342 </span>                :       /**
-<span class="lineNum">     343 </span>                :        *  Returns a read-only (constant) iterator that points to the first pair
-<span class="lineNum">     344 </span>                :        *  in the %map.  Iteration is done in ascending order according to the
-<span class="lineNum">     345 </span>                :        *  keys.
-<span class="lineNum">     346 </span>                :        */
-<span class="lineNum">     347 </span>                :       const_iterator
-<span class="lineNum">     348 </span>                :       cbegin() const
-<span class="lineNum">     349 </span>                :       { return _M_t.begin(); }
-<span class="lineNum">     350 </span>                : 
-<span class="lineNum">     351 </span>                :       /**
-<span class="lineNum">     352 </span>                :        *  Returns a read-only (constant) iterator that points one past the last
-<span class="lineNum">     353 </span>                :        *  pair in the %map.  Iteration is done in ascending order according to
-<span class="lineNum">     354 </span>                :        *  the keys.
-<span class="lineNum">     355 </span>                :        */
-<span class="lineNum">     356 </span>                :       const_iterator
-<span class="lineNum">     357 </span>                :       cend() const
-<span class="lineNum">     358 </span>                :       { return _M_t.end(); }
-<span class="lineNum">     359 </span>                : 
-<span class="lineNum">     360 </span>                :       /**
-<span class="lineNum">     361 </span>                :        *  Returns a read-only (constant) reverse iterator that points to the
-<span class="lineNum">     362 </span>                :        *  last pair in the %map.  Iteration is done in descending order
-<span class="lineNum">     363 </span>                :        *  according to the keys.
-<span class="lineNum">     364 </span>                :        */
-<span class="lineNum">     365 </span>                :       const_reverse_iterator
-<span class="lineNum">     366 </span>                :       crbegin() const
-<span class="lineNum">     367 </span>                :       { return _M_t.rbegin(); }
-<span class="lineNum">     368 </span>                : 
-<span class="lineNum">     369 </span>                :       /**
-<span class="lineNum">     370 </span>                :        *  Returns a read-only (constant) reverse iterator that points to one
-<span class="lineNum">     371 </span>                :        *  before the first pair in the %map.  Iteration is done in descending
-<span class="lineNum">     372 </span>                :        *  order according to the keys.
-<span class="lineNum">     373 </span>                :        */
-<span class="lineNum">     374 </span>                :       const_reverse_iterator
-<span class="lineNum">     375 </span>                :       crend() const
-<span class="lineNum">     376 </span>                :       { return _M_t.rend(); }
-<span class="lineNum">     377 </span>                : #endif
-<span class="lineNum">     378 </span>                : 
-<span class="lineNum">     379 </span>                :       // capacity
-<span class="lineNum">     380 </span>                :       /** Returns true if the %map is empty.  (Thus begin() would equal
-<span class="lineNum">     381 </span>                :        *  end().)
-<span class="lineNum">     382 </span>                :       */
-<span class="lineNum">     383 </span>                :       bool
-<span class="lineNum">     384 </span><span class="lineCov">           3939 :       empty() const</span>
-<span class="lineNum">     385 </span><span class="lineCov">           3939 :       { return _M_t.empty(); }</span>
-<span class="lineNum">     386 </span>                : 
-<span class="lineNum">     387 </span>                :       /** Returns the size of the %map.  */
-<span class="lineNum">     388 </span>                :       size_type
-<span class="lineNum">     389 </span><span class="lineCov">             20 :       size() const</span>
-<span class="lineNum">     390 </span><span class="lineCov">             20 :       { return _M_t.size(); }</span>
-<span class="lineNum">     391 </span>                : 
-<span class="lineNum">     392 </span>                :       /** Returns the maximum size of the %map.  */
-<span class="lineNum">     393 </span>                :       size_type
-<span class="lineNum">     394 </span>                :       max_size() const
-<span class="lineNum">     395 </span>                :       { return _M_t.max_size(); }
-<span class="lineNum">     396 </span>                : 
-<span class="lineNum">     397 </span>                :       // [23.3.1.2] element access
-<span class="lineNum">     398 </span>                :       /**
-<span class="lineNum">     399 </span>                :        *  @brief  Subscript ( @c [] ) access to %map data.
-<span class="lineNum">     400 </span>                :        *  @param  k  The key for which data should be retrieved.
-<span class="lineNum">     401 </span>                :        *  @return  A reference to the data of the (key,data) %pair.
-<span class="lineNum">     402 </span>                :        *
-<span class="lineNum">     403 </span>                :        *  Allows for easy lookup with the subscript ( @c [] )
-<span class="lineNum">     404 </span>                :        *  operator.  Returns data associated with the key specified in
-<span class="lineNum">     405 </span>                :        *  subscript.  If the key does not exist, a pair with that key
-<span class="lineNum">     406 </span>                :        *  is created using default values, which is then returned.
-<span class="lineNum">     407 </span>                :        *
-<span class="lineNum">     408 </span>                :        *  Lookup requires logarithmic time.
-<span class="lineNum">     409 </span>                :        */
-<span class="lineNum">     410 </span>                :       mapped_type&amp;
-<span class="lineNum">     411 </span><span class="lineCov">           6297 :       operator[](const key_type&amp; __k)</span>
-<span class="lineNum">     412 </span>                :       {
-<span class="lineNum">     413 </span>                :         // concept requirements
-<span class="lineNum">     414 </span>                :         __glibcxx_function_requires(_DefaultConstructibleConcept&lt;mapped_type&gt;)
-<span class="lineNum">     415 </span>                : 
-<span class="lineNum">     416 </span><span class="lineCov">           6297 :         iterator __i = lower_bound(__k);</span>
-<span class="lineNum">     417 </span>                :         // __i-&gt;first is greater than or equivalent to __k.
-<span class="lineNum">     418 </span><span class="lineCov">           6297 :         if (__i == end() || key_comp()(__k, (*__i).first))</span>
-<span class="lineNum">     419 </span><span class="lineCov">           4149 :           __i = insert(__i, value_type(__k, mapped_type()));</span>
-<span class="lineNum">     420 </span><span class="lineCov">           6297 :         return (*__i).second;</span>
-<span class="lineNum">     421 </span>                :       }
-<span class="lineNum">     422 </span>                : 
-<span class="lineNum">     423 </span>                :       // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     424 </span>                :       // DR 464. Suggestion for new member functions in standard containers.
-<span class="lineNum">     425 </span>                :       /**
-<span class="lineNum">     426 </span>                :        *  @brief  Access to %map data.
-<span class="lineNum">     427 </span>                :        *  @param  k  The key for which data should be retrieved.
-<span class="lineNum">     428 </span>                :        *  @return  A reference to the data whose key is equivalent to @a k, if
-<span class="lineNum">     429 </span>                :        *           such a data is present in the %map.
-<span class="lineNum">     430 </span>                :        *  @throw  std::out_of_range  If no such data is present.
-<span class="lineNum">     431 </span>                :        */
-<span class="lineNum">     432 </span>                :       mapped_type&amp;
-<span class="lineNum">     433 </span>                :       at(const key_type&amp; __k)
-<span class="lineNum">     434 </span>                :       {
-<span class="lineNum">     435 </span>                :         iterator __i = lower_bound(__k);
-<span class="lineNum">     436 </span>                :         if (__i == end() || key_comp()(__k, (*__i).first))
-<span class="lineNum">     437 </span>                :           __throw_out_of_range(__N(&quot;map::at&quot;));
-<span class="lineNum">     438 </span>                :         return (*__i).second;
-<span class="lineNum">     439 </span>                :       }
-<span class="lineNum">     440 </span>                : 
-<span class="lineNum">     441 </span>                :       const mapped_type&amp;
-<span class="lineNum">     442 </span>                :       at(const key_type&amp; __k) const
-<span class="lineNum">     443 </span>                :       {
-<span class="lineNum">     444 </span>                :         const_iterator __i = lower_bound(__k);
-<span class="lineNum">     445 </span>                :         if (__i == end() || key_comp()(__k, (*__i).first))
-<span class="lineNum">     446 </span>                :           __throw_out_of_range(__N(&quot;map::at&quot;));
-<span class="lineNum">     447 </span>                :         return (*__i).second;
-<span class="lineNum">     448 </span>                :       }
-<span class="lineNum">     449 </span>                : 
-<span class="lineNum">     450 </span>                :       // modifiers
-<span class="lineNum">     451 </span>                :       /**
-<span class="lineNum">     452 </span>                :        *  @brief Attempts to insert a std::pair into the %map.
-<span class="lineNum">     453 </span>                : 
-<span class="lineNum">     454 </span>                :        *  @param  x  Pair to be inserted (see std::make_pair for easy creation 
-<span class="lineNum">     455 </span>                :        *             of pairs).
-<span class="lineNum">     456 </span>                : 
-<span class="lineNum">     457 </span>                :        *  @return  A pair, of which the first element is an iterator that 
-<span class="lineNum">     458 </span>                :        *           points to the possibly inserted pair, and the second is 
-<span class="lineNum">     459 </span>                :        *           a bool that is true if the pair was actually inserted.
-<span class="lineNum">     460 </span>                :        *
-<span class="lineNum">     461 </span>                :        *  This function attempts to insert a (key, value) %pair into the %map.
-<span class="lineNum">     462 </span>                :        *  A %map relies on unique keys and thus a %pair is only inserted if its
-<span class="lineNum">     463 </span>                :        *  first element (the key) is not already present in the %map.
-<span class="lineNum">     464 </span>                :        *
-<span class="lineNum">     465 </span>                :        *  Insertion requires logarithmic time.
-<span class="lineNum">     466 </span>                :        */
-<span class="lineNum">     467 </span>                :       std::pair&lt;iterator, bool&gt;
-<span class="lineNum">     468 </span><span class="lineCov">         101375 :       insert(const value_type&amp; __x)</span>
-<span class="lineNum">     469 </span><span class="lineCov">         101375 :       { return _M_t._M_insert_unique(__x); }</span>
-<span class="lineNum">     470 </span>                : 
-<span class="lineNum">     471 </span>                :       /**
-<span class="lineNum">     472 </span>                :        *  @brief Attempts to insert a std::pair into the %map.
-<span class="lineNum">     473 </span>                :        *  @param  position  An iterator that serves as a hint as to where the
-<span class="lineNum">     474 </span>                :        *                    pair should be inserted.
-<span class="lineNum">     475 </span>                :        *  @param  x  Pair to be inserted (see std::make_pair for easy creation
-<span class="lineNum">     476 </span>                :        *             of pairs).
-<span class="lineNum">     477 </span>                :        *  @return  An iterator that points to the element with key of @a x (may
-<span class="lineNum">     478 </span>                :        *           or may not be the %pair passed in).
-<span class="lineNum">     479 </span>                :        *
-<span class="lineNum">     480 </span>                : 
-<span class="lineNum">     481 </span>                :        *  This function is not concerned about whether the insertion
-<span class="lineNum">     482 </span>                :        *  took place, and thus does not return a boolean like the
-<span class="lineNum">     483 </span>                :        *  single-argument insert() does.  Note that the first
-<span class="lineNum">     484 </span>                :        *  parameter is only a hint and can potentially improve the
-<span class="lineNum">     485 </span>                :        *  performance of the insertion process.  A bad hint would
-<span class="lineNum">     486 </span>                :        *  cause no gains in efficiency.
-<span class="lineNum">     487 </span>                :        *
-<span class="lineNum">     488 </span>                :        *  See
-<span class="lineNum">     489 </span>                :        *  http://gcc.gnu.org/onlinedocs/libstdc++/23_containers/howto.html#4
-<span class="lineNum">     490 </span>                :        *  for more on &quot;hinting&quot;.
-<span class="lineNum">     491 </span>                :        *
-<span class="lineNum">     492 </span>                :        *  Insertion requires logarithmic time (if the hint is not taken).
-<span class="lineNum">     493 </span>                :        */
-<span class="lineNum">     494 </span>                :       iterator
-<span class="lineNum">     495 </span><span class="lineCov">           4149 :       insert(iterator __position, const value_type&amp; __x)</span>
-<span class="lineNum">     496 </span><span class="lineCov">           4149 :       { return _M_t._M_insert_unique_(__position, __x); }</span>
-<span class="lineNum">     497 </span>                : 
-<span class="lineNum">     498 </span>                :       /**
-<span class="lineNum">     499 </span>                :        *  @brief Template function that attempts to insert a range of elements.
-<span class="lineNum">     500 </span>                :        *  @param  first  Iterator pointing to the start of the range to be
-<span class="lineNum">     501 </span>                :        *                 inserted.
-<span class="lineNum">     502 </span>                :        *  @param  last  Iterator pointing to the end of the range.
-<span class="lineNum">     503 </span>                :        *
-<span class="lineNum">     504 </span>                :        *  Complexity similar to that of the range constructor.
-<span class="lineNum">     505 </span>                :        */
-<span class="lineNum">     506 </span>                :       template&lt;typename _InputIterator&gt;
-<span class="lineNum">     507 </span>                :         void
-<span class="lineNum">     508 </span>                :         insert(_InputIterator __first, _InputIterator __last)
-<span class="lineNum">     509 </span>                :         { _M_t._M_insert_unique(__first, __last); }
-<span class="lineNum">     510 </span>                : 
-<span class="lineNum">     511 </span>                :       /**
-<span class="lineNum">     512 </span>                :        *  @brief Erases an element from a %map.
-<span class="lineNum">     513 </span>                :        *  @param  position  An iterator pointing to the element to be erased.
-<span class="lineNum">     514 </span>                :        *
-<span class="lineNum">     515 </span>                :        *  This function erases an element, pointed to by the given
-<span class="lineNum">     516 </span>                :        *  iterator, from a %map.  Note that this function only erases
-<span class="lineNum">     517 </span>                :        *  the element, and that if the element is itself a pointer,
-<span class="lineNum">     518 </span>                :        *  the pointed-to memory is not touched in any way.  Managing
-<span class="lineNum">     519 </span>                :        *  the pointer is the user's responsibility.
-<span class="lineNum">     520 </span>                :        */
-<span class="lineNum">     521 </span>                :       void
-<span class="lineNum">     522 </span>                :       erase(iterator __position)
-<span class="lineNum">     523 </span>                :       { _M_t.erase(__position); }
-<span class="lineNum">     524 </span>                : 
-<span class="lineNum">     525 </span>                :       /**
-<span class="lineNum">     526 </span>                :        *  @brief Erases elements according to the provided key.
-<span class="lineNum">     527 </span>                :        *  @param  x  Key of element to be erased.
-<span class="lineNum">     528 </span>                :        *  @return  The number of elements erased.
-<span class="lineNum">     529 </span>                :        *
-<span class="lineNum">     530 </span>                :        *  This function erases all the elements located by the given key from
-<span class="lineNum">     531 </span>                :        *  a %map.
-<span class="lineNum">     532 </span>                :        *  Note that this function only erases the element, and that if
-<span class="lineNum">     533 </span>                :        *  the element is itself a pointer, the pointed-to memory is not touched
-<span class="lineNum">     534 </span>                :        *  in any way.  Managing the pointer is the user's responsibility.
-<span class="lineNum">     535 </span>                :        */
-<span class="lineNum">     536 </span>                :       size_type
-<span class="lineNum">     537 </span>                :       erase(const key_type&amp; __x)
-<span class="lineNum">     538 </span>                :       { return _M_t.erase(__x); }
-<span class="lineNum">     539 </span>                : 
-<span class="lineNum">     540 </span>                :       /**
-<span class="lineNum">     541 </span>                :        *  @brief Erases a [first,last) range of elements from a %map.
-<span class="lineNum">     542 </span>                :        *  @param  first  Iterator pointing to the start of the range to be
-<span class="lineNum">     543 </span>                :        *                 erased.
-<span class="lineNum">     544 </span>                :        *  @param  last  Iterator pointing to the end of the range to be erased.
-<span class="lineNum">     545 </span>                :        *
-<span class="lineNum">     546 </span>                :        *  This function erases a sequence of elements from a %map.
-<span class="lineNum">     547 </span>                :        *  Note that this function only erases the element, and that if
-<span class="lineNum">     548 </span>                :        *  the element is itself a pointer, the pointed-to memory is not touched
-<span class="lineNum">     549 </span>                :        *  in any way.  Managing the pointer is the user's responsibility.
-<span class="lineNum">     550 </span>                :        */
-<span class="lineNum">     551 </span>                :       void
-<span class="lineNum">     552 </span>                :       erase(iterator __first, iterator __last)
-<span class="lineNum">     553 </span>                :       { _M_t.erase(__first, __last); }
-<span class="lineNum">     554 </span>                : 
-<span class="lineNum">     555 </span>                :       /**
-<span class="lineNum">     556 </span>                :        *  @brief  Swaps data with another %map.
-<span class="lineNum">     557 </span>                :        *  @param  x  A %map of the same element and allocator types.
-<span class="lineNum">     558 </span>                :        *
-<span class="lineNum">     559 </span>                :        *  This exchanges the elements between two maps in constant
-<span class="lineNum">     560 </span>                :        *  time.  (It is only swapping a pointer, an integer, and an
-<span class="lineNum">     561 </span>                :        *  instance of the @c Compare type (which itself is often
-<span class="lineNum">     562 </span>                :        *  stateless and empty), so it should be quite fast.)  Note
-<span class="lineNum">     563 </span>                :        *  that the global std::swap() function is specialized such
-<span class="lineNum">     564 </span>                :        *  that std::swap(m1,m2) will feed to this function.
-<span class="lineNum">     565 </span>                :        */
-<span class="lineNum">     566 </span>                :       void
-<span class="lineNum">     567 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     568 </span>                :       swap(map&amp;&amp; __x)
-<span class="lineNum">     569 </span>                : #else
-<span class="lineNum">     570 </span>                :       swap(map&amp; __x)
-<span class="lineNum">     571 </span>                : #endif
-<span class="lineNum">     572 </span>                :       { _M_t.swap(__x._M_t); }
-<span class="lineNum">     573 </span>                : 
-<span class="lineNum">     574 </span>                :       /**
-<span class="lineNum">     575 </span>                :        *  Erases all elements in a %map.  Note that this function only
-<span class="lineNum">     576 </span>                :        *  erases the elements, and that if the elements themselves are
-<span class="lineNum">     577 </span>                :        *  pointers, the pointed-to memory is not touched in any way.
-<span class="lineNum">     578 </span>                :        *  Managing the pointer is the user's responsibility.
-<span class="lineNum">     579 </span>                :        */
-<span class="lineNum">     580 </span>                :       void
-<span class="lineNum">     581 </span><span class="lineCov">           3288 :       clear()</span>
-<span class="lineNum">     582 </span><span class="lineCov">           3288 :       { _M_t.clear(); }</span>
-<span class="lineNum">     583 </span>                : 
-<span class="lineNum">     584 </span>                :       // observers
-<span class="lineNum">     585 </span>                :       /**
-<span class="lineNum">     586 </span>                :        *  Returns the key comparison object out of which the %map was
-<span class="lineNum">     587 </span>                :        *  constructed.
-<span class="lineNum">     588 </span>                :        */
-<span class="lineNum">     589 </span>                :       key_compare
-<span class="lineNum">     590 </span><span class="lineCov">           3296 :       key_comp() const</span>
-<span class="lineNum">     591 </span><span class="lineCov">           3296 :       { return _M_t.key_comp(); }</span>
-<span class="lineNum">     592 </span>                : 
-<span class="lineNum">     593 </span>                :       /**
-<span class="lineNum">     594 </span>                :        *  Returns a value comparison object, built from the key comparison
-<span class="lineNum">     595 </span>                :        *  object out of which the %map was constructed.
-<span class="lineNum">     596 </span>                :        */
-<span class="lineNum">     597 </span>                :       value_compare
-<span class="lineNum">     598 </span>                :       value_comp() const
-<span class="lineNum">     599 </span>                :       { return value_compare(_M_t.key_comp()); }
-<span class="lineNum">     600 </span>                : 
-<span class="lineNum">     601 </span>                :       // [23.3.1.3] map operations
-<span class="lineNum">     602 </span>                :       /**
-<span class="lineNum">     603 </span>                :        *  @brief Tries to locate an element in a %map.
-<span class="lineNum">     604 </span>                :        *  @param  x  Key of (key, value) %pair to be located.
-<span class="lineNum">     605 </span>                :        *  @return  Iterator pointing to sought-after element, or end() if not
-<span class="lineNum">     606 </span>                :        *           found.
-<span class="lineNum">     607 </span>                :        *
-<span class="lineNum">     608 </span>                :        *  This function takes a key and tries to locate the element with which
-<span class="lineNum">     609 </span>                :        *  the key matches.  If successful the function returns an iterator
-<span class="lineNum">     610 </span>                :        *  pointing to the sought after %pair.  If unsuccessful it returns the
-<span class="lineNum">     611 </span>                :        *  past-the-end ( @c end() ) iterator.
-<span class="lineNum">     612 </span>                :        */
-<span class="lineNum">     613 </span>                :       iterator
-<span class="lineNum">     614 </span><span class="lineCov">          50117 :       find(const key_type&amp; __x)</span>
-<span class="lineNum">     615 </span><span class="lineCov">          50117 :       { return _M_t.find(__x); }</span>
-<span class="lineNum">     616 </span>                : 
-<span class="lineNum">     617 </span>                :       /**
-<span class="lineNum">     618 </span>                :        *  @brief Tries to locate an element in a %map.
-<span class="lineNum">     619 </span>                :        *  @param  x  Key of (key, value) %pair to be located.
-<span class="lineNum">     620 </span>                :        *  @return  Read-only (constant) iterator pointing to sought-after
-<span class="lineNum">     621 </span>                :        *           element, or end() if not found.
-<span class="lineNum">     622 </span>                :        *
-<span class="lineNum">     623 </span>                :        *  This function takes a key and tries to locate the element with which
-<span class="lineNum">     624 </span>                :        *  the key matches.  If successful the function returns a constant
-<span class="lineNum">     625 </span>                :        *  iterator pointing to the sought after %pair. If unsuccessful it
-<span class="lineNum">     626 </span>                :        *  returns the past-the-end ( @c end() ) iterator.
-<span class="lineNum">     627 </span>                :        */
-<span class="lineNum">     628 </span>                :       const_iterator
-<span class="lineNum">     629 </span><span class="lineCov">           3916 :       find(const key_type&amp; __x) const</span>
-<span class="lineNum">     630 </span><span class="lineCov">           3916 :       { return _M_t.find(__x); }</span>
-<span class="lineNum">     631 </span>                : 
-<span class="lineNum">     632 </span>                :       /**
-<span class="lineNum">     633 </span>                :        *  @brief  Finds the number of elements with given key.
-<span class="lineNum">     634 </span>                :        *  @param  x  Key of (key, value) pairs to be located.
-<span class="lineNum">     635 </span>                :        *  @return  Number of elements with specified key.
-<span class="lineNum">     636 </span>                :        *
-<span class="lineNum">     637 </span>                :        *  This function only makes sense for multimaps; for map the result will
-<span class="lineNum">     638 </span>                :        *  either be 0 (not present) or 1 (present).
-<span class="lineNum">     639 </span>                :        */
-<span class="lineNum">     640 </span>                :       size_type
-<span class="lineNum">     641 </span>                :       count(const key_type&amp; __x) const
-<span class="lineNum">     642 </span>                :       { return _M_t.find(__x) == _M_t.end() ? 0 : 1; }
-<span class="lineNum">     643 </span>                : 
-<span class="lineNum">     644 </span>                :       /**
-<span class="lineNum">     645 </span>                :        *  @brief Finds the beginning of a subsequence matching given key.
-<span class="lineNum">     646 </span>                :        *  @param  x  Key of (key, value) pair to be located.
-<span class="lineNum">     647 </span>                :        *  @return  Iterator pointing to first element equal to or greater
-<span class="lineNum">     648 </span>                :        *           than key, or end().
-<span class="lineNum">     649 </span>                :        *
-<span class="lineNum">     650 </span>                :        *  This function returns the first element of a subsequence of elements
-<span class="lineNum">     651 </span>                :        *  that matches the given key.  If unsuccessful it returns an iterator
-<span class="lineNum">     652 </span>                :        *  pointing to the first element that has a greater value than given key
-<span class="lineNum">     653 </span>                :        *  or end() if no such element exists.
-<span class="lineNum">     654 </span>                :        */
-<span class="lineNum">     655 </span>                :       iterator
-<span class="lineNum">     656 </span><span class="lineCov">           6297 :       lower_bound(const key_type&amp; __x)</span>
-<span class="lineNum">     657 </span><span class="lineCov">           6297 :       { return _M_t.lower_bound(__x); }</span>
-<span class="lineNum">     658 </span>                : 
-<span class="lineNum">     659 </span>                :       /**
-<span class="lineNum">     660 </span>                :        *  @brief Finds the beginning of a subsequence matching given key.
-<span class="lineNum">     661 </span>                :        *  @param  x  Key of (key, value) pair to be located.
-<span class="lineNum">     662 </span>                :        *  @return  Read-only (constant) iterator pointing to first element
-<span class="lineNum">     663 </span>                :        *           equal to or greater than key, or end().
-<span class="lineNum">     664 </span>                :        *
-<span class="lineNum">     665 </span>                :        *  This function returns the first element of a subsequence of elements
-<span class="lineNum">     666 </span>                :        *  that matches the given key.  If unsuccessful it returns an iterator
-<span class="lineNum">     667 </span>                :        *  pointing to the first element that has a greater value than given key
-<span class="lineNum">     668 </span>                :        *  or end() if no such element exists.
-<span class="lineNum">     669 </span>                :        */
-<span class="lineNum">     670 </span>                :       const_iterator
-<span class="lineNum">     671 </span>                :       lower_bound(const key_type&amp; __x) const
-<span class="lineNum">     672 </span>                :       { return _M_t.lower_bound(__x); }
-<span class="lineNum">     673 </span>                : 
-<span class="lineNum">     674 </span>                :       /**
-<span class="lineNum">     675 </span>                :        *  @brief Finds the end of a subsequence matching given key.
-<span class="lineNum">     676 </span>                :        *  @param  x  Key of (key, value) pair to be located.
-<span class="lineNum">     677 </span>                :        *  @return Iterator pointing to the first element
-<span class="lineNum">     678 </span>                :        *          greater than key, or end().
-<span class="lineNum">     679 </span>                :        */
-<span class="lineNum">     680 </span>                :       iterator
-<span class="lineNum">     681 </span>                :       upper_bound(const key_type&amp; __x)
-<span class="lineNum">     682 </span>                :       { return _M_t.upper_bound(__x); }
-<span class="lineNum">     683 </span>                : 
-<span class="lineNum">     684 </span>                :       /**
-<span class="lineNum">     685 </span>                :        *  @brief Finds the end of a subsequence matching given key.
-<span class="lineNum">     686 </span>                :        *  @param  x  Key of (key, value) pair to be located.
-<span class="lineNum">     687 </span>                :        *  @return  Read-only (constant) iterator pointing to first iterator
-<span class="lineNum">     688 </span>                :        *           greater than key, or end().
-<span class="lineNum">     689 </span>                :        */
-<span class="lineNum">     690 </span>                :       const_iterator
-<span class="lineNum">     691 </span>                :       upper_bound(const key_type&amp; __x) const
-<span class="lineNum">     692 </span>                :       { return _M_t.upper_bound(__x); }
-<span class="lineNum">     693 </span>                : 
-<span class="lineNum">     694 </span>                :       /**
-<span class="lineNum">     695 </span>                :        *  @brief Finds a subsequence matching given key.
-<span class="lineNum">     696 </span>                :        *  @param  x  Key of (key, value) pairs to be located.
-<span class="lineNum">     697 </span>                :        *  @return  Pair of iterators that possibly points to the subsequence
-<span class="lineNum">     698 </span>                :        *           matching given key.
-<span class="lineNum">     699 </span>                :        *
-<span class="lineNum">     700 </span>                :        *  This function is equivalent to
-<span class="lineNum">     701 </span>                :        *  @code
-<span class="lineNum">     702 </span>                :        *    std::make_pair(c.lower_bound(val),
-<span class="lineNum">     703 </span>                :        *                   c.upper_bound(val))
-<span class="lineNum">     704 </span>                :        *  @endcode
-<span class="lineNum">     705 </span>                :        *  (but is faster than making the calls separately).
-<span class="lineNum">     706 </span>                :        *
-<span class="lineNum">     707 </span>                :        *  This function probably only makes sense for multimaps.
-<span class="lineNum">     708 </span>                :        */
-<span class="lineNum">     709 </span>                :       std::pair&lt;iterator, iterator&gt;
-<span class="lineNum">     710 </span>                :       equal_range(const key_type&amp; __x)
-<span class="lineNum">     711 </span>                :       { return _M_t.equal_range(__x); }
-<span class="lineNum">     712 </span>                : 
-<span class="lineNum">     713 </span>                :       /**
-<span class="lineNum">     714 </span>                :        *  @brief Finds a subsequence matching given key.
-<span class="lineNum">     715 </span>                :        *  @param  x  Key of (key, value) pairs to be located.
-<span class="lineNum">     716 </span>                :        *  @return  Pair of read-only (constant) iterators that possibly points
-<span class="lineNum">     717 </span>                :        *           to the subsequence matching given key.
-<span class="lineNum">     718 </span>                :        *
-<span class="lineNum">     719 </span>                :        *  This function is equivalent to
-<span class="lineNum">     720 </span>                :        *  @code
-<span class="lineNum">     721 </span>                :        *    std::make_pair(c.lower_bound(val),
-<span class="lineNum">     722 </span>                :        *                   c.upper_bound(val))
-<span class="lineNum">     723 </span>                :        *  @endcode
-<span class="lineNum">     724 </span>                :        *  (but is faster than making the calls separately).
-<span class="lineNum">     725 </span>                :        *
-<span class="lineNum">     726 </span>                :        *  This function probably only makes sense for multimaps.
-<span class="lineNum">     727 </span>                :        */
-<span class="lineNum">     728 </span>                :       std::pair&lt;const_iterator, const_iterator&gt;
-<span class="lineNum">     729 </span>                :       equal_range(const key_type&amp; __x) const
-<span class="lineNum">     730 </span>                :       { return _M_t.equal_range(__x); }
-<span class="lineNum">     731 </span>                : 
-<span class="lineNum">     732 </span>                :       template&lt;typename _K1, typename _T1, typename _C1, typename _A1&gt;
-<span class="lineNum">     733 </span>                :         friend bool
-<span class="lineNum">     734 </span>                :         operator==(const map&lt;_K1, _T1, _C1, _A1&gt;&amp;,
-<span class="lineNum">     735 </span>                :                    const map&lt;_K1, _T1, _C1, _A1&gt;&amp;);
-<span class="lineNum">     736 </span>                : 
-<span class="lineNum">     737 </span>                :       template&lt;typename _K1, typename _T1, typename _C1, typename _A1&gt;
-<span class="lineNum">     738 </span>                :         friend bool
-<span class="lineNum">     739 </span>                :         operator&lt;(const map&lt;_K1, _T1, _C1, _A1&gt;&amp;,
-<span class="lineNum">     740 </span>                :                   const map&lt;_K1, _T1, _C1, _A1&gt;&amp;);
-<span class="lineNum">     741 </span>                :     };
-<span class="lineNum">     742 </span>                : 
-<span class="lineNum">     743 </span>                :   /**
-<span class="lineNum">     744 </span>                :    *  @brief  Map equality comparison.
-<span class="lineNum">     745 </span>                :    *  @param  x  A %map.
-<span class="lineNum">     746 </span>                :    *  @param  y  A %map of the same type as @a x.
-<span class="lineNum">     747 </span>                :    *  @return  True iff the size and elements of the maps are equal.
-<span class="lineNum">     748 </span>                :    *
-<span class="lineNum">     749 </span>                :    *  This is an equivalence relation.  It is linear in the size of the
-<span class="lineNum">     750 </span>                :    *  maps.  Maps are considered equivalent if their sizes are equal,
-<span class="lineNum">     751 </span>                :    *  and if corresponding elements compare equal.
-<span class="lineNum">     752 </span>                :   */
-<span class="lineNum">     753 </span>                :   template&lt;typename _Key, typename _Tp, typename _Compare, typename _Alloc&gt;
-<span class="lineNum">     754 </span>                :     inline bool
-<span class="lineNum">     755 </span>                :     operator==(const map&lt;_Key, _Tp, _Compare, _Alloc&gt;&amp; __x,
-<span class="lineNum">     756 </span>                :                const map&lt;_Key, _Tp, _Compare, _Alloc&gt;&amp; __y)
-<span class="lineNum">     757 </span>                :     { return __x._M_t == __y._M_t; }
-<span class="lineNum">     758 </span>                : 
-<span class="lineNum">     759 </span>                :   /**
-<span class="lineNum">     760 </span>                :    *  @brief  Map ordering relation.
-<span class="lineNum">     761 </span>                :    *  @param  x  A %map.
-<span class="lineNum">     762 </span>                :    *  @param  y  A %map of the same type as @a x.
-<span class="lineNum">     763 </span>                :    *  @return  True iff @a x is lexicographically less than @a y.
-<span class="lineNum">     764 </span>                :    *
-<span class="lineNum">     765 </span>                :    *  This is a total ordering relation.  It is linear in the size of the
-<span class="lineNum">     766 </span>                :    *  maps.  The elements must be comparable with @c &lt;.
-<span class="lineNum">     767 </span>                :    *
-<span class="lineNum">     768 </span>                :    *  See std::lexicographical_compare() for how the determination is made.
-<span class="lineNum">     769 </span>                :   */
-<span class="lineNum">     770 </span>                :   template&lt;typename _Key, typename _Tp, typename _Compare, typename _Alloc&gt;
-<span class="lineNum">     771 </span>                :     inline bool
-<span class="lineNum">     772 </span>                :     operator&lt;(const map&lt;_Key, _Tp, _Compare, _Alloc&gt;&amp; __x,
-<span class="lineNum">     773 </span>                :               const map&lt;_Key, _Tp, _Compare, _Alloc&gt;&amp; __y)
-<span class="lineNum">     774 </span>                :     { return __x._M_t &lt; __y._M_t; }
-<span class="lineNum">     775 </span>                : 
-<span class="lineNum">     776 </span>                :   /// Based on operator==
-<span class="lineNum">     777 </span>                :   template&lt;typename _Key, typename _Tp, typename _Compare, typename _Alloc&gt;
-<span class="lineNum">     778 </span>                :     inline bool
-<span class="lineNum">     779 </span>                :     operator!=(const map&lt;_Key, _Tp, _Compare, _Alloc&gt;&amp; __x,
-<span class="lineNum">     780 </span>                :                const map&lt;_Key, _Tp, _Compare, _Alloc&gt;&amp; __y)
-<span class="lineNum">     781 </span>                :     { return !(__x == __y); }
-<span class="lineNum">     782 </span>                : 
-<span class="lineNum">     783 </span>                :   /// Based on operator&lt;
-<span class="lineNum">     784 </span>                :   template&lt;typename _Key, typename _Tp, typename _Compare, typename _Alloc&gt;
-<span class="lineNum">     785 </span>                :     inline bool
-<span class="lineNum">     786 </span>                :     operator&gt;(const map&lt;_Key, _Tp, _Compare, _Alloc&gt;&amp; __x,
-<span class="lineNum">     787 </span>                :               const map&lt;_Key, _Tp, _Compare, _Alloc&gt;&amp; __y)
-<span class="lineNum">     788 </span>                :     { return __y &lt; __x; }
-<span class="lineNum">     789 </span>                : 
-<span class="lineNum">     790 </span>                :   /// Based on operator&lt;
-<span class="lineNum">     791 </span>                :   template&lt;typename _Key, typename _Tp, typename _Compare, typename _Alloc&gt;
-<span class="lineNum">     792 </span>                :     inline bool
-<span class="lineNum">     793 </span>                :     operator&lt;=(const map&lt;_Key, _Tp, _Compare, _Alloc&gt;&amp; __x,
-<span class="lineNum">     794 </span>                :                const map&lt;_Key, _Tp, _Compare, _Alloc&gt;&amp; __y)
-<span class="lineNum">     795 </span>                :     { return !(__y &lt; __x); }
-<span class="lineNum">     796 </span>                : 
-<span class="lineNum">     797 </span>                :   /// Based on operator&lt;
-<span class="lineNum">     798 </span>                :   template&lt;typename _Key, typename _Tp, typename _Compare, typename _Alloc&gt;
-<span class="lineNum">     799 </span>                :     inline bool
-<span class="lineNum">     800 </span>                :     operator&gt;=(const map&lt;_Key, _Tp, _Compare, _Alloc&gt;&amp; __x,
-<span class="lineNum">     801 </span>                :                const map&lt;_Key, _Tp, _Compare, _Alloc&gt;&amp; __y)
-<span class="lineNum">     802 </span>                :     { return !(__x &lt; __y); }
-<span class="lineNum">     803 </span>                : 
-<span class="lineNum">     804 </span>                :   /// See std::map::swap().
-<span class="lineNum">     805 </span>                :   template&lt;typename _Key, typename _Tp, typename _Compare, typename _Alloc&gt;
-<span class="lineNum">     806 </span>                :     inline void
-<span class="lineNum">     807 </span>                :     swap(map&lt;_Key, _Tp, _Compare, _Alloc&gt;&amp; __x,
-<span class="lineNum">     808 </span>                :          map&lt;_Key, _Tp, _Compare, _Alloc&gt;&amp; __y)
-<span class="lineNum">     809 </span>                :     { __x.swap(__y); }
-<span class="lineNum">     810 </span>                : 
-<span class="lineNum">     811 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     812 </span>                :   template&lt;typename _Key, typename _Tp, typename _Compare, typename _Alloc&gt;
-<span class="lineNum">     813 </span>                :     inline void
-<span class="lineNum">     814 </span>                :     swap(map&lt;_Key, _Tp, _Compare, _Alloc&gt;&amp;&amp; __x,
-<span class="lineNum">     815 </span>                :          map&lt;_Key, _Tp, _Compare, _Alloc&gt;&amp; __y)
-<span class="lineNum">     816 </span>                :     { __x.swap(__y); }
-<span class="lineNum">     817 </span>                : 
-<span class="lineNum">     818 </span>                :   template&lt;typename _Key, typename _Tp, typename _Compare, typename _Alloc&gt;
-<span class="lineNum">     819 </span>                :     inline void
-<span class="lineNum">     820 </span>                :     swap(map&lt;_Key, _Tp, _Compare, _Alloc&gt;&amp; __x,
-<span class="lineNum">     821 </span>                :          map&lt;_Key, _Tp, _Compare, _Alloc&gt;&amp;&amp; __y)
-<span class="lineNum">     822 </span>                :     { __x.swap(__y); }
-<span class="lineNum">     823 </span>                : #endif
-<span class="lineNum">     824 </span>                : 
-<span class="lineNum">     825 </span>                : _GLIBCXX_END_NESTED_NAMESPACE
-<span class="lineNum">     826 </span>                : 
-<span class="lineNum">     827 </span>                : #endif /* _STL_MAP_H */
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/bits/stl_move.h.gcov.html b/rep/usr/include/c++/4.3/bits/stl_move.h.gcov.html
deleted file mode 100644
index 93e7633..0000000
--- a/rep/usr/include/c++/4.3/bits/stl_move.h.gcov.html
+++ /dev/null
@@ -1,159 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_move.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_move.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">5</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">5</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // Move, forward and identity for C++0x + swap -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 2007 Free Software Foundation, Inc.
-<span class="lineNum">       4 </span>                : //
-<span class="lineNum">       5 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       6 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       7 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">       8 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">       9 </span>                : // any later version.
-<span class="lineNum">      10 </span>                : 
-<span class="lineNum">      11 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      12 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      13 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      14 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      15 </span>                : 
-<span class="lineNum">      16 </span>                : // You should have received a copy of the GNU General Public License along
-<span class="lineNum">      17 </span>                : // with this library; see the file COPYING.  If not, write to the Free
-<span class="lineNum">      18 </span>                : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-<span class="lineNum">      19 </span>                : // USA.
-<span class="lineNum">      20 </span>                : 
-<span class="lineNum">      21 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      22 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      23 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      24 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      25 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      26 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      27 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      28 </span>                : // the GNU General Public License.
-<span class="lineNum">      29 </span>                : 
-<span class="lineNum">      30 </span>                : /** @file stl_move.h
-<span class="lineNum">      31 </span>                :  *  This is an internal header file, included by other library headers.
-<span class="lineNum">      32 </span>                :  *  You should not attempt to use it directly.
-<span class="lineNum">      33 </span>                :  */
-<span class="lineNum">      34 </span>                : 
-<span class="lineNum">      35 </span>                : #ifndef _STL_MOVE_H
-<span class="lineNum">      36 </span>                : #define _STL_MOVE_H 1
-<span class="lineNum">      37 </span>                : 
-<span class="lineNum">      38 </span>                : #include &lt;bits/c++config.h&gt;
-<span class="lineNum">      39 </span>                : #include &lt;bits/concept_check.h&gt;
-<span class="lineNum">      40 </span>                : 
-<span class="lineNum">      41 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">      42 </span>                : #include &lt;type_traits&gt;
-<span class="lineNum">      43 </span>                : 
-<span class="lineNum">      44 </span>                : _GLIBCXX_BEGIN_NAMESPACE(std)
-<span class="lineNum">      45 </span>                : 
-<span class="lineNum">      46 </span>                :   // 20.2.2, forward/move
-<span class="lineNum">      47 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">      48 </span>                :     struct identity
-<span class="lineNum">      49 </span>                :     {
-<span class="lineNum">      50 </span>                :       typedef _Tp type;
-<span class="lineNum">      51 </span>                :     };
-<span class="lineNum">      52 </span>                : 
-<span class="lineNum">      53 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">      54 </span>                :     inline _Tp&amp;&amp;
-<span class="lineNum">      55 </span>                :     forward(typename std::identity&lt;_Tp&gt;::type&amp;&amp; __t)
-<span class="lineNum">      56 </span>                :     { return __t; }
-<span class="lineNum">      57 </span>                : 
-<span class="lineNum">      58 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">      59 </span>                :     inline typename std::remove_reference&lt;_Tp&gt;::type&amp;&amp;
-<span class="lineNum">      60 </span>                :     move(_Tp&amp;&amp; __t)
-<span class="lineNum">      61 </span>                :     { return __t; }
-<span class="lineNum">      62 </span>                : 
-<span class="lineNum">      63 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">      64 </span>                : 
-<span class="lineNum">      65 </span>                : #define _GLIBCXX_MOVE(_Tp) std::move(_Tp)
-<span class="lineNum">      66 </span>                : #else
-<span class="lineNum">      67 </span>                : #define _GLIBCXX_MOVE(_Tp) (_Tp)
-<span class="lineNum">      68 </span>                : #endif
-<span class="lineNum">      69 </span>                : 
-<span class="lineNum">      70 </span>                : _GLIBCXX_BEGIN_NAMESPACE(std)
-<span class="lineNum">      71 </span>                : 
-<span class="lineNum">      72 </span>                :   /**
-<span class="lineNum">      73 </span>                :    *  @brief Swaps two values.
-<span class="lineNum">      74 </span>                :    *  @param  a  A thing of arbitrary type.
-<span class="lineNum">      75 </span>                :    *  @param  b  Another thing of arbitrary type.
-<span class="lineNum">      76 </span>                :    *  @return   Nothing.
-<span class="lineNum">      77 </span>                :   */
-<span class="lineNum">      78 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">      79 </span>                :     inline void
-<span class="lineNum">      80 </span><span class="lineCov">           7080 :     swap(_Tp&amp; __a, _Tp&amp; __b)</span>
-<span class="lineNum">      81 </span>                :     {
-<span class="lineNum">      82 </span>                :       // concept requirements
-<span class="lineNum">      83 </span>                :       __glibcxx_function_requires(_SGIAssignableConcept&lt;_Tp&gt;)
-<span class="lineNum">      84 </span>                : 
-<span class="lineNum">      85 </span><span class="lineCov">           7080 :       _Tp __tmp = _GLIBCXX_MOVE(__a);</span>
-<span class="lineNum">      86 </span><span class="lineCov">           7080 :       __a = _GLIBCXX_MOVE(__b);</span>
-<span class="lineNum">      87 </span><span class="lineCov">           7080 :       __b = _GLIBCXX_MOVE(__tmp);</span>
-<span class="lineNum">      88 </span><span class="lineCov">           7080 :     }</span>
-<span class="lineNum">      89 </span>                : 
-<span class="lineNum">      90 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">      91 </span>                : 
-<span class="lineNum">      92 </span>                : #endif /* _STL_MOVE_H */
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/bits/stl_pair.h.gcov.html b/rep/usr/include/c++/4.3/bits/stl_pair.h.gcov.html
deleted file mode 100644
index 455afe5..0000000
--- a/rep/usr/include/c++/4.3/bits/stl_pair.h.gcov.html
+++ /dev/null
@@ -1,331 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_pair.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_pair.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">9</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">9</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // Pair implementation -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007
-<span class="lineNum">       4 </span>                : // Free Software Foundation, Inc.
-<span class="lineNum">       5 </span>                : //
-<span class="lineNum">       6 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       7 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       8 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">       9 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      10 </span>                : // any later version.
-<span class="lineNum">      11 </span>                : 
-<span class="lineNum">      12 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      13 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      14 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      15 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      16 </span>                : 
-<span class="lineNum">      17 </span>                : // You should have received a copy of the GNU General Public License along
-<span class="lineNum">      18 </span>                : // with this library; see the file COPYING.  If not, write to the Free
-<span class="lineNum">      19 </span>                : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-<span class="lineNum">      20 </span>                : // USA.
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      23 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      24 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      25 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      26 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      27 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      28 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      29 </span>                : // the GNU General Public License.
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : /*
-<span class="lineNum">      32 </span>                :  *
-<span class="lineNum">      33 </span>                :  * Copyright (c) 1994
-<span class="lineNum">      34 </span>                :  * Hewlett-Packard Company
-<span class="lineNum">      35 </span>                :  *
-<span class="lineNum">      36 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      37 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      38 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      39 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      40 </span>                :  * in supporting documentation.  Hewlett-Packard Company makes no
-<span class="lineNum">      41 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      42 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      43 </span>                :  *
-<span class="lineNum">      44 </span>                :  *
-<span class="lineNum">      45 </span>                :  * Copyright (c) 1996,1997
-<span class="lineNum">      46 </span>                :  * Silicon Graphics Computer Systems, Inc.
-<span class="lineNum">      47 </span>                :  *
-<span class="lineNum">      48 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      49 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      50 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      51 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      52 </span>                :  * in supporting documentation.  Silicon Graphics makes no
-<span class="lineNum">      53 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      54 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      55 </span>                :  */
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span>                : /** @file stl_pair.h
-<span class="lineNum">      58 </span>                :  *  This is an internal header file, included by other library headers.
-<span class="lineNum">      59 </span>                :  *  You should not attempt to use it directly.
-<span class="lineNum">      60 </span>                :  */
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span>                : #ifndef _STL_PAIR_H
-<span class="lineNum">      63 </span>                : #define _STL_PAIR_H 1
-<span class="lineNum">      64 </span>                : 
-<span class="lineNum">      65 </span>                : #include &lt;bits/stl_move.h&gt; // for std::move / std::forward, std::decay, and
-<span class="lineNum">      66 </span>                :                            // std::swap
-<span class="lineNum">      67 </span>                : 
-<span class="lineNum">      68 </span>                : _GLIBCXX_BEGIN_NAMESPACE(std)
-<span class="lineNum">      69 </span>                : 
-<span class="lineNum">      70 </span>                :   /// pair holds two objects of arbitrary type.
-<span class="lineNum">      71 </span>                :   template&lt;class _T1, class _T2&gt;
-<span class="lineNum">      72 </span>                :     struct pair
-<span class="lineNum">      73 </span><span class="lineCov">         814163 :     {</span>
-<span class="lineNum">      74 </span>                :       typedef _T1 first_type;    ///&lt;  @c first_type is the first bound type
-<span class="lineNum">      75 </span>                :       typedef _T2 second_type;   ///&lt;  @c second_type is the second bound type
-<span class="lineNum">      76 </span>                : 
-<span class="lineNum">      77 </span>                :       _T1 first;                 ///&lt; @c first is a copy of the first object
-<span class="lineNum">      78 </span>                :       _T2 second;                ///&lt; @c second is a copy of the second object
-<span class="lineNum">      79 </span>                : 
-<span class="lineNum">      80 </span>                :       // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">      81 </span>                :       // 265.  std::pair::pair() effects overly restrictive
-<span class="lineNum">      82 </span>                :       /** The default constructor creates @c first and @c second using their
-<span class="lineNum">      83 </span>                :        *  respective default constructors.  */
-<span class="lineNum">      84 </span><span class="lineCov">             19 :       pair()</span>
-<span class="lineNum">      85 </span><span class="lineCov">             19 :       : first(), second() { }</span>
-<span class="lineNum">      86 </span>                : 
-<span class="lineNum">      87 </span>                :       /** Two objects may be passed to a @c pair constructor to be copied.  */
-<span class="lineNum">      88 </span><span class="lineCov">        3562241 :       pair(const _T1&amp; __a, const _T2&amp; __b)</span>
-<span class="lineNum">      89 </span><span class="lineCov">        3562241 :       : first(__a), second(__b) { }</span>
-<span class="lineNum">      90 </span>                : 
-<span class="lineNum">      91 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">      92 </span>                :       template&lt;class _U1, class _U2&gt;
-<span class="lineNum">      93 </span>                :         pair(_U1&amp;&amp; __x, _U2&amp;&amp; __y)
-<span class="lineNum">      94 </span>                :         : first(std::forward&lt;_U1&gt;(__x)),
-<span class="lineNum">      95 </span>                :           second(std::forward&lt;_U2&gt;(__y)) { }
-<span class="lineNum">      96 </span>                : 
-<span class="lineNum">      97 </span>                :       pair(pair&amp;&amp; __p)
-<span class="lineNum">      98 </span>                :       : first(std::move(__p.first)),
-<span class="lineNum">      99 </span>                :         second(std::move(__p.second)) { }
-<span class="lineNum">     100 </span>                : #endif
-<span class="lineNum">     101 </span>                : 
-<span class="lineNum">     102 </span>                :       /** There is also a templated copy ctor for the @c pair class itself.  */
-<span class="lineNum">     103 </span>                :       template&lt;class _U1, class _U2&gt;
-<span class="lineNum">     104 </span><span class="lineCov">         101375 :         pair(const pair&lt;_U1, _U2&gt;&amp; __p)</span>
-<span class="lineNum">     105 </span>                :         : first(__p.first),
-<span class="lineNum">     106 </span><span class="lineCov">         101375 :           second(__p.second) { }</span>
-<span class="lineNum">     107 </span>                : 
-<span class="lineNum">     108 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     109 </span>                :       template&lt;class _U1, class _U2&gt;
-<span class="lineNum">     110 </span>                :         pair(pair&lt;_U1, _U2&gt;&amp;&amp; __p)
-<span class="lineNum">     111 </span>                :         : first(std::move(__p.first)),
-<span class="lineNum">     112 </span>                :           second(std::move(__p.second)) { }
-<span class="lineNum">     113 </span>                : 
-<span class="lineNum">     114 </span>                :       // http://gcc.gnu.org/ml/libstdc++/2007-08/msg00052.html
-<span class="lineNum">     115 </span>                :       template&lt;class _U1, class _Arg0, class... _Args&gt;
-<span class="lineNum">     116 </span>                :         pair(_U1&amp;&amp; __x, _Arg0&amp;&amp; __arg0, _Args&amp;&amp;... __args)
-<span class="lineNum">     117 </span>                :         : first(std::forward&lt;_U1&gt;(__x)),
-<span class="lineNum">     118 </span>                :           second(std::forward&lt;_Arg0&gt;(__arg0),
-<span class="lineNum">     119 </span>                :                  std::forward&lt;_Args&gt;(__args)...) { }
-<span class="lineNum">     120 </span>                : 
-<span class="lineNum">     121 </span>                :       pair&amp;
-<span class="lineNum">     122 </span>                :       operator=(pair&amp;&amp; __p)
-<span class="lineNum">     123 </span>                :       { 
-<span class="lineNum">     124 </span>                :         first = std::move(__p.first);
-<span class="lineNum">     125 </span>                :         second = std::move(__p.second);
-<span class="lineNum">     126 </span>                :         return *this;
-<span class="lineNum">     127 </span>                :       }
-<span class="lineNum">     128 </span>                : 
-<span class="lineNum">     129 </span>                :       template&lt;class _U1, class _U2&gt;
-<span class="lineNum">     130 </span>                :         pair&amp;
-<span class="lineNum">     131 </span>                :         operator=(pair&lt;_U1, _U2&gt;&amp;&amp; __p)
-<span class="lineNum">     132 </span>                :         {
-<span class="lineNum">     133 </span>                :           first = std::move(__p.first);
-<span class="lineNum">     134 </span>                :           second = std::move(__p.second);
-<span class="lineNum">     135 </span>                :           return *this;
-<span class="lineNum">     136 </span>                :         }
-<span class="lineNum">     137 </span>                : 
-<span class="lineNum">     138 </span>                :       void
-<span class="lineNum">     139 </span>                :       swap(pair&amp;&amp; __p)
-<span class="lineNum">     140 </span>                :       {
-<span class="lineNum">     141 </span>                :         using std::swap;
-<span class="lineNum">     142 </span>                :         swap(first, __p.first);
-<span class="lineNum">     143 </span>                :         swap(second, __p.second);       
-<span class="lineNum">     144 </span>                :       }
-<span class="lineNum">     145 </span>                : #endif
-<span class="lineNum">     146 </span>                :     };
-<span class="lineNum">     147 </span>                : 
-<span class="lineNum">     148 </span>                :   /// Two pairs of the same type are equal iff their members are equal.
-<span class="lineNum">     149 </span>                :   template&lt;class _T1, class _T2&gt;
-<span class="lineNum">     150 </span>                :     inline bool
-<span class="lineNum">     151 </span>                :     operator==(const pair&lt;_T1, _T2&gt;&amp; __x, const pair&lt;_T1, _T2&gt;&amp; __y)
-<span class="lineNum">     152 </span>                :     { return __x.first == __y.first &amp;&amp; __x.second == __y.second; }
-<span class="lineNum">     153 </span>                : 
-<span class="lineNum">     154 </span>                :   /// &lt;http://gcc.gnu.org/onlinedocs/libstdc++/20_util/howto.html#pairlt&gt;
-<span class="lineNum">     155 </span>                :   template&lt;class _T1, class _T2&gt;
-<span class="lineNum">     156 </span>                :     inline bool
-<span class="lineNum">     157 </span>                :     operator&lt;(const pair&lt;_T1, _T2&gt;&amp; __x, const pair&lt;_T1, _T2&gt;&amp; __y)
-<span class="lineNum">     158 </span>                :     { return __x.first &lt; __y.first
-<span class="lineNum">     159 </span>                :              || (!(__y.first &lt; __x.first) &amp;&amp; __x.second &lt; __y.second); }
-<span class="lineNum">     160 </span>                : 
-<span class="lineNum">     161 </span>                :   /// Uses @c operator== to find the result.
-<span class="lineNum">     162 </span>                :   template&lt;class _T1, class _T2&gt;
-<span class="lineNum">     163 </span>                :     inline bool
-<span class="lineNum">     164 </span>                :     operator!=(const pair&lt;_T1, _T2&gt;&amp; __x, const pair&lt;_T1, _T2&gt;&amp; __y)
-<span class="lineNum">     165 </span>                :     { return !(__x == __y); }
-<span class="lineNum">     166 </span>                : 
-<span class="lineNum">     167 </span>                :   /// Uses @c operator&lt; to find the result.
-<span class="lineNum">     168 </span>                :   template&lt;class _T1, class _T2&gt;
-<span class="lineNum">     169 </span>                :     inline bool
-<span class="lineNum">     170 </span>                :     operator&gt;(const pair&lt;_T1, _T2&gt;&amp; __x, const pair&lt;_T1, _T2&gt;&amp; __y)
-<span class="lineNum">     171 </span>                :     { return __y &lt; __x; }
-<span class="lineNum">     172 </span>                : 
-<span class="lineNum">     173 </span>                :   /// Uses @c operator&lt; to find the result.
-<span class="lineNum">     174 </span>                :   template&lt;class _T1, class _T2&gt;
-<span class="lineNum">     175 </span>                :     inline bool
-<span class="lineNum">     176 </span>                :     operator&lt;=(const pair&lt;_T1, _T2&gt;&amp; __x, const pair&lt;_T1, _T2&gt;&amp; __y)
-<span class="lineNum">     177 </span>                :     { return !(__y &lt; __x); }
-<span class="lineNum">     178 </span>                : 
-<span class="lineNum">     179 </span>                :   /// Uses @c operator&lt; to find the result.
-<span class="lineNum">     180 </span>                :   template&lt;class _T1, class _T2&gt;
-<span class="lineNum">     181 </span>                :     inline bool
-<span class="lineNum">     182 </span>                :     operator&gt;=(const pair&lt;_T1, _T2&gt;&amp; __x, const pair&lt;_T1, _T2&gt;&amp; __y)
-<span class="lineNum">     183 </span>                :     { return !(__x &lt; __y); }
-<span class="lineNum">     184 </span>                : 
-<span class="lineNum">     185 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     186 </span>                :   /// See std::pair::swap().
-<span class="lineNum">     187 </span>                :   template&lt;class _T1, class _T2&gt;
-<span class="lineNum">     188 </span>                :     inline void
-<span class="lineNum">     189 </span>                :     swap(pair&lt;_T1, _T2&gt;&amp; __x, pair&lt;_T1, _T2&gt;&amp; __y)
-<span class="lineNum">     190 </span>                :     { __x.swap(__y); }
-<span class="lineNum">     191 </span>                : 
-<span class="lineNum">     192 </span>                :   template&lt;class _T1, class _T2&gt;
-<span class="lineNum">     193 </span>                :     inline void
-<span class="lineNum">     194 </span>                :     swap(pair&lt;_T1, _T2&gt;&amp;&amp; __x, pair&lt;_T1, _T2&gt;&amp; __y)
-<span class="lineNum">     195 </span>                :     { __x.swap(__y); }
-<span class="lineNum">     196 </span>                : 
-<span class="lineNum">     197 </span>                :   template&lt;class _T1, class _T2&gt;
-<span class="lineNum">     198 </span>                :     inline void
-<span class="lineNum">     199 </span>                :     swap(pair&lt;_T1, _T2&gt;&amp; __x, pair&lt;_T1, _T2&gt;&amp;&amp; __y)
-<span class="lineNum">     200 </span>                :     { __x.swap(__y); }
-<span class="lineNum">     201 </span>                : #endif
-<span class="lineNum">     202 </span>                : 
-<span class="lineNum">     203 </span>                :   /**
-<span class="lineNum">     204 </span>                :    *  @brief A convenience wrapper for creating a pair from two objects.
-<span class="lineNum">     205 </span>                :    *  @param  x  The first object.
-<span class="lineNum">     206 </span>                :    *  @param  y  The second object.
-<span class="lineNum">     207 </span>                :    *  @return   A newly-constructed pair&lt;&gt; object of the appropriate type.
-<span class="lineNum">     208 </span>                :    *
-<span class="lineNum">     209 </span>                :    *  The standard requires that the objects be passed by reference-to-const,
-<span class="lineNum">     210 </span>                :    *  but LWG issue #181 says they should be passed by const value.  We follow
-<span class="lineNum">     211 </span>                :    *  the LWG by default.
-<span class="lineNum">     212 </span>                :    */
-<span class="lineNum">     213 </span>                :   // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     214 </span>                :   // 181.  make_pair() unintended behavior
-<span class="lineNum">     215 </span>                : #ifndef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     216 </span>                :   template&lt;class _T1, class _T2&gt;
-<span class="lineNum">     217 </span>                :     inline pair&lt;_T1, _T2&gt;
-<span class="lineNum">     218 </span><span class="lineCov">         474889 :     make_pair(_T1 __x, _T2 __y)</span>
-<span class="lineNum">     219 </span><span class="lineCov">         474889 :     { return pair&lt;_T1, _T2&gt;(__x, __y); }</span>
-<span class="lineNum">     220 </span>                : #else
-<span class="lineNum">     221 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     222 </span>                :     class reference_wrapper;
-<span class="lineNum">     223 </span>                : 
-<span class="lineNum">     224 </span>                :   // Helper which adds a reference to a type when given a reference_wrapper
-<span class="lineNum">     225 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     226 </span>                :     struct __strip_reference_wrapper
-<span class="lineNum">     227 </span>                :     {
-<span class="lineNum">     228 </span>                :       typedef _Tp __type;
-<span class="lineNum">     229 </span>                :     };
-<span class="lineNum">     230 </span>                : 
-<span class="lineNum">     231 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     232 </span>                :     struct __strip_reference_wrapper&lt;reference_wrapper&lt;_Tp&gt; &gt;
-<span class="lineNum">     233 </span>                :     {
-<span class="lineNum">     234 </span>                :       typedef _Tp&amp; __type;
-<span class="lineNum">     235 </span>                :     };
-<span class="lineNum">     236 </span>                : 
-<span class="lineNum">     237 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     238 </span>                :     struct __strip_reference_wrapper&lt;const reference_wrapper&lt;_Tp&gt; &gt;
-<span class="lineNum">     239 </span>                :     {
-<span class="lineNum">     240 </span>                :       typedef _Tp&amp; __type;
-<span class="lineNum">     241 </span>                :     };
-<span class="lineNum">     242 </span>                : 
-<span class="lineNum">     243 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     244 </span>                :     struct __decay_and_strip
-<span class="lineNum">     245 </span>                :     {
-<span class="lineNum">     246 </span>                :       typedef typename __strip_reference_wrapper&lt;
-<span class="lineNum">     247 </span>                :         typename decay&lt;_Tp&gt;::type&gt;::__type __type;
-<span class="lineNum">     248 </span>                :     };
-<span class="lineNum">     249 </span>                : 
-<span class="lineNum">     250 </span>                :   // NB: DR 706.
-<span class="lineNum">     251 </span>                :   template&lt;class _T1, class _T2&gt;
-<span class="lineNum">     252 </span>                :     inline pair&lt;typename __decay_and_strip&lt;_T1&gt;::__type,
-<span class="lineNum">     253 </span>                :                 typename __decay_and_strip&lt;_T2&gt;::__type&gt;
-<span class="lineNum">     254 </span>                :     make_pair(_T1&amp;&amp; __x, _T2&amp;&amp; __y)
-<span class="lineNum">     255 </span>                :     {
-<span class="lineNum">     256 </span>                :       return pair&lt;typename __decay_and_strip&lt;_T1&gt;::__type,
-<span class="lineNum">     257 </span>                :                   typename __decay_and_strip&lt;_T2&gt;::__type&gt;
-<span class="lineNum">     258 </span>                :         (std::forward&lt;_T1&gt;(__x), std::forward&lt;_T2&gt;(__y));
-<span class="lineNum">     259 </span>                :     }
-<span class="lineNum">     260 </span>                : #endif
-<span class="lineNum">     261 </span>                : 
-<span class="lineNum">     262 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">     263 </span>                : 
-<span class="lineNum">     264 </span>                : #endif /* _STL_PAIR_H */
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/bits/stl_set.h.gcov.html b/rep/usr/include/c++/4.3/bits/stl_set.h.gcov.html
deleted file mode 100644
index 3398416..0000000
--- a/rep/usr/include/c++/4.3/bits/stl_set.h.gcov.html
+++ /dev/null
@@ -1,731 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_set.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_set.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">33</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">33</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // Set implementation -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
-<span class="lineNum">       4 </span>                : // Free Software Foundation, Inc.
-<span class="lineNum">       5 </span>                : //
-<span class="lineNum">       6 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       7 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       8 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">       9 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      10 </span>                : // any later version.
-<span class="lineNum">      11 </span>                : 
-<span class="lineNum">      12 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      13 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      14 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      15 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      16 </span>                : 
-<span class="lineNum">      17 </span>                : // You should have received a copy of the GNU General Public License along
-<span class="lineNum">      18 </span>                : // with this library; see the file COPYING.  If not, write to the Free
-<span class="lineNum">      19 </span>                : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-<span class="lineNum">      20 </span>                : // USA.
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      23 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      24 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      25 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      26 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      27 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      28 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      29 </span>                : // the GNU General Public License.
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : /*
-<span class="lineNum">      32 </span>                :  *
-<span class="lineNum">      33 </span>                :  * Copyright (c) 1994
-<span class="lineNum">      34 </span>                :  * Hewlett-Packard Company
-<span class="lineNum">      35 </span>                :  *
-<span class="lineNum">      36 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      37 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      38 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      39 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      40 </span>                :  * in supporting documentation.  Hewlett-Packard Company makes no
-<span class="lineNum">      41 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      42 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      43 </span>                :  *
-<span class="lineNum">      44 </span>                :  *
-<span class="lineNum">      45 </span>                :  * Copyright (c) 1996,1997
-<span class="lineNum">      46 </span>                :  * Silicon Graphics Computer Systems, Inc.
-<span class="lineNum">      47 </span>                :  *
-<span class="lineNum">      48 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      49 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      50 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      51 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      52 </span>                :  * in supporting documentation.  Silicon Graphics makes no
-<span class="lineNum">      53 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      54 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      55 </span>                :  */
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span>                : /** @file stl_set.h
-<span class="lineNum">      58 </span>                :  *  This is an internal header file, included by other library headers.
-<span class="lineNum">      59 </span>                :  *  You should not attempt to use it directly.
-<span class="lineNum">      60 </span>                :  */
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span>                : #ifndef _STL_SET_H
-<span class="lineNum">      63 </span>                : #define _STL_SET_H 1
-<span class="lineNum">      64 </span>                : 
-<span class="lineNum">      65 </span>                : #include &lt;bits/concept_check.h&gt;
-<span class="lineNum">      66 </span>                : 
-<span class="lineNum">      67 </span>                : _GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D)
-<span class="lineNum">      68 </span>                : 
-<span class="lineNum">      69 </span>                :   /**
-<span class="lineNum">      70 </span>                :    *  @brief A standard container made up of unique keys, which can be
-<span class="lineNum">      71 </span>                :    *  retrieved in logarithmic time.
-<span class="lineNum">      72 </span>                :    *
-<span class="lineNum">      73 </span>                :    *  @ingroup Containers
-<span class="lineNum">      74 </span>                :    *  @ingroup Assoc_containers
-<span class="lineNum">      75 </span>                :    *
-<span class="lineNum">      76 </span>                :    *  Meets the requirements of a &lt;a href=&quot;tables.html#65&quot;&gt;container&lt;/a&gt;, a
-<span class="lineNum">      77 </span>                :    *  &lt;a href=&quot;tables.html#66&quot;&gt;reversible container&lt;/a&gt;, and an
-<span class="lineNum">      78 </span>                :    *  &lt;a href=&quot;tables.html#69&quot;&gt;associative container&lt;/a&gt; (using unique keys).
-<span class="lineNum">      79 </span>                :    *
-<span class="lineNum">      80 </span>                :    *  Sets support bidirectional iterators.
-<span class="lineNum">      81 </span>                :    *
-<span class="lineNum">      82 </span>                :    *  @param  Key  Type of key objects.
-<span class="lineNum">      83 </span>                :    *  @param  Compare  Comparison function object type, defaults to less&lt;Key&gt;.
-<span class="lineNum">      84 </span>                :    *  @param  Alloc  Allocator type, defaults to allocator&lt;Key&gt;.
-<span class="lineNum">      85 </span>                :    *
-<span class="lineNum">      86 </span>                :    *  The private tree data is declared exactly the same way for set and
-<span class="lineNum">      87 </span>                :    *  multiset; the distinction is made entirely in how the tree functions are
-<span class="lineNum">      88 </span>                :    *  called (*_unique versus *_equal, same as the standard).
-<span class="lineNum">      89 </span>                :   */
-<span class="lineNum">      90 </span>                :   template&lt;typename _Key, typename _Compare = std::less&lt;_Key&gt;,
-<span class="lineNum">      91 </span>                :            typename _Alloc = std::allocator&lt;_Key&gt; &gt;
-<span class="lineNum">      92 </span>                :     class set
-<span class="lineNum">      93 </span><span class="lineCov">        1308625 :     {</span>
-<span class="lineNum">      94 </span>                :       // concept requirements
-<span class="lineNum">      95 </span>                :       typedef typename _Alloc::value_type                   _Alloc_value_type;
-<span class="lineNum">      96 </span>                :       __glibcxx_class_requires(_Key, _SGIAssignableConcept)
-<span class="lineNum">      97 </span>                :       __glibcxx_class_requires4(_Compare, bool, _Key, _Key,
-<span class="lineNum">      98 </span>                :                                 _BinaryFunctionConcept)
-<span class="lineNum">      99 </span>                :       __glibcxx_class_requires2(_Key, _Alloc_value_type, _SameTypeConcept)      
-<span class="lineNum">     100 </span>                : 
-<span class="lineNum">     101 </span>                :     public:
-<span class="lineNum">     102 </span>                :       // typedefs:
-<span class="lineNum">     103 </span>                :       //@{
-<span class="lineNum">     104 </span>                :       /// Public typedefs.
-<span class="lineNum">     105 </span>                :       typedef _Key     key_type;
-<span class="lineNum">     106 </span>                :       typedef _Key     value_type;
-<span class="lineNum">     107 </span>                :       typedef _Compare key_compare;
-<span class="lineNum">     108 </span>                :       typedef _Compare value_compare;
-<span class="lineNum">     109 </span>                :       typedef _Alloc   allocator_type;
-<span class="lineNum">     110 </span>                :       //@}
-<span class="lineNum">     111 </span>                : 
-<span class="lineNum">     112 </span>                :     private:
-<span class="lineNum">     113 </span>                :       typedef typename _Alloc::template rebind&lt;_Key&gt;::other _Key_alloc_type;
-<span class="lineNum">     114 </span>                : 
-<span class="lineNum">     115 </span>                :       typedef _Rb_tree&lt;key_type, value_type, _Identity&lt;value_type&gt;,
-<span class="lineNum">     116 </span>                :                        key_compare, _Key_alloc_type&gt; _Rep_type;
-<span class="lineNum">     117 </span>                :       _Rep_type _M_t;  // Red-black tree representing set.
-<span class="lineNum">     118 </span>                : 
-<span class="lineNum">     119 </span>                :     public:
-<span class="lineNum">     120 </span>                :       //@{
-<span class="lineNum">     121 </span>                :       ///  Iterator-related typedefs.
-<span class="lineNum">     122 </span>                :       typedef typename _Key_alloc_type::pointer             pointer;
-<span class="lineNum">     123 </span>                :       typedef typename _Key_alloc_type::const_pointer       const_pointer;
-<span class="lineNum">     124 </span>                :       typedef typename _Key_alloc_type::reference           reference;
-<span class="lineNum">     125 </span>                :       typedef typename _Key_alloc_type::const_reference     const_reference;
-<span class="lineNum">     126 </span>                :       // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     127 </span>                :       // DR 103. set::iterator is required to be modifiable,
-<span class="lineNum">     128 </span>                :       // but this allows modification of keys.
-<span class="lineNum">     129 </span>                :       typedef typename _Rep_type::const_iterator            iterator;
-<span class="lineNum">     130 </span>                :       typedef typename _Rep_type::const_iterator            const_iterator;
-<span class="lineNum">     131 </span>                :       typedef typename _Rep_type::const_reverse_iterator    reverse_iterator;
-<span class="lineNum">     132 </span>                :       typedef typename _Rep_type::const_reverse_iterator    const_reverse_iterator;
-<span class="lineNum">     133 </span>                :       typedef typename _Rep_type::size_type                 size_type;
-<span class="lineNum">     134 </span>                :       typedef typename _Rep_type::difference_type           difference_type;
-<span class="lineNum">     135 </span>                :       //@}
-<span class="lineNum">     136 </span>                : 
-<span class="lineNum">     137 </span>                :       // allocation/deallocation
-<span class="lineNum">     138 </span>                :       /**
-<span class="lineNum">     139 </span>                :        *  @brief  Default constructor creates no elements.
-<span class="lineNum">     140 </span>                :        */
-<span class="lineNum">     141 </span><span class="lineCov">         277740 :       set()</span>
-<span class="lineNum">     142 </span><span class="lineCov">         277740 :       : _M_t() { }</span>
-<span class="lineNum">     143 </span>                : 
-<span class="lineNum">     144 </span>                :       /**
-<span class="lineNum">     145 </span>                :        *  @brief  Creates a %set with no elements.
-<span class="lineNum">     146 </span>                :        *  @param  comp  Comparator to use.
-<span class="lineNum">     147 </span>                :        *  @param  a  An allocator object.
-<span class="lineNum">     148 </span>                :        */
-<span class="lineNum">     149 </span>                :       explicit
-<span class="lineNum">     150 </span>                :       set(const _Compare&amp; __comp,
-<span class="lineNum">     151 </span>                :           const allocator_type&amp; __a = allocator_type())
-<span class="lineNum">     152 </span>                :       : _M_t(__comp, __a) { }
-<span class="lineNum">     153 </span>                : 
-<span class="lineNum">     154 </span>                :       /**
-<span class="lineNum">     155 </span>                :        *  @brief  Builds a %set from a range.
-<span class="lineNum">     156 </span>                :        *  @param  first  An input iterator.
-<span class="lineNum">     157 </span>                :        *  @param  last  An input iterator.
-<span class="lineNum">     158 </span>                :        *
-<span class="lineNum">     159 </span>                :        *  Create a %set consisting of copies of the elements from [first,last).
-<span class="lineNum">     160 </span>                :        *  This is linear in N if the range is already sorted, and NlogN
-<span class="lineNum">     161 </span>                :        *  otherwise (where N is distance(first,last)).
-<span class="lineNum">     162 </span>                :        */
-<span class="lineNum">     163 </span>                :       template&lt;typename _InputIterator&gt;
-<span class="lineNum">     164 </span>                :         set(_InputIterator __first, _InputIterator __last)
-<span class="lineNum">     165 </span>                :         : _M_t()
-<span class="lineNum">     166 </span>                :         { _M_t._M_insert_unique(__first, __last); }
-<span class="lineNum">     167 </span>                : 
-<span class="lineNum">     168 </span>                :       /**
-<span class="lineNum">     169 </span>                :        *  @brief  Builds a %set from a range.
-<span class="lineNum">     170 </span>                :        *  @param  first  An input iterator.
-<span class="lineNum">     171 </span>                :        *  @param  last  An input iterator.
-<span class="lineNum">     172 </span>                :        *  @param  comp  A comparison functor.
-<span class="lineNum">     173 </span>                :        *  @param  a  An allocator object.
-<span class="lineNum">     174 </span>                :        *
-<span class="lineNum">     175 </span>                :        *  Create a %set consisting of copies of the elements from [first,last).
-<span class="lineNum">     176 </span>                :        *  This is linear in N if the range is already sorted, and NlogN
-<span class="lineNum">     177 </span>                :        *  otherwise (where N is distance(first,last)).
-<span class="lineNum">     178 </span>                :        */
-<span class="lineNum">     179 </span>                :       template&lt;typename _InputIterator&gt;
-<span class="lineNum">     180 </span>                :         set(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">     181 </span>                :             const _Compare&amp; __comp,
-<span class="lineNum">     182 </span>                :             const allocator_type&amp; __a = allocator_type())
-<span class="lineNum">     183 </span>                :         : _M_t(__comp, __a)
-<span class="lineNum">     184 </span>                :         { _M_t._M_insert_unique(__first, __last); }
-<span class="lineNum">     185 </span>                : 
-<span class="lineNum">     186 </span>                :       /**
-<span class="lineNum">     187 </span>                :        *  @brief  %Set copy constructor.
-<span class="lineNum">     188 </span>                :        *  @param  x  A %set of identical element and allocator types.
-<span class="lineNum">     189 </span>                :        *
-<span class="lineNum">     190 </span>                :        *  The newly-created %set uses a copy of the allocation object used
-<span class="lineNum">     191 </span>                :        *  by @a x.
-<span class="lineNum">     192 </span>                :        */
-<span class="lineNum">     193 </span><span class="lineCov">         925151 :       set(const set&amp; __x)</span>
-<span class="lineNum">     194 </span><span class="lineCov">         925151 :       : _M_t(__x._M_t) { }</span>
-<span class="lineNum">     195 </span>                : 
-<span class="lineNum">     196 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     197 </span>                :      /**
-<span class="lineNum">     198 </span>                :        *  @brief %Set move constructor
-<span class="lineNum">     199 </span>                :        *  @param x  A %set of identical element and allocator types.
-<span class="lineNum">     200 </span>                :        *
-<span class="lineNum">     201 </span>                :        *  The newly-created %set contains the exact contents of @a x.
-<span class="lineNum">     202 </span>                :        *  The contents of @a x are a valid, but unspecified %set.
-<span class="lineNum">     203 </span>                :        */
-<span class="lineNum">     204 </span>                :       set(set&amp;&amp; __x)
-<span class="lineNum">     205 </span>                :       : _M_t(std::forward&lt;_Rep_type&gt;(__x._M_t)) { }
-<span class="lineNum">     206 </span>                : #endif
-<span class="lineNum">     207 </span>                : 
-<span class="lineNum">     208 </span>                :       /**
-<span class="lineNum">     209 </span>                :        *  @brief  %Set assignment operator.
-<span class="lineNum">     210 </span>                :        *  @param  x  A %set of identical element and allocator types.
-<span class="lineNum">     211 </span>                :        *
-<span class="lineNum">     212 </span>                :        *  All the elements of @a x are copied, but unlike the copy constructor,
-<span class="lineNum">     213 </span>                :        *  the allocator object is not copied.
-<span class="lineNum">     214 </span>                :        */
-<span class="lineNum">     215 </span>                :       set&amp;
-<span class="lineNum">     216 </span><span class="lineCov">             80 :       operator=(const set&amp; __x)</span>
-<span class="lineNum">     217 </span>                :       {
-<span class="lineNum">     218 </span><span class="lineCov">             80 :         _M_t = __x._M_t;</span>
-<span class="lineNum">     219 </span><span class="lineCov">             80 :         return *this;</span>
-<span class="lineNum">     220 </span>                :       }
-<span class="lineNum">     221 </span>                : 
-<span class="lineNum">     222 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     223 </span>                :       /**
-<span class="lineNum">     224 </span>                :        *  @brief %Set move assignment operator.
-<span class="lineNum">     225 </span>                :        *  @param x  A %set of identical element and allocator types.
-<span class="lineNum">     226 </span>                :        *
-<span class="lineNum">     227 </span>                :        *  The contents of @a x are moved into this %set (without copying).
-<span class="lineNum">     228 </span>                :        *  @a x is a valid, but unspecified %set.
-<span class="lineNum">     229 </span>                :        */
-<span class="lineNum">     230 </span>                :       set&amp;
-<span class="lineNum">     231 </span>                :       operator=(set&amp;&amp; __x)
-<span class="lineNum">     232 </span>                :       {
-<span class="lineNum">     233 </span>                :         // NB: DR 675.
-<span class="lineNum">     234 </span>                :         this-&gt;clear();
-<span class="lineNum">     235 </span>                :         this-&gt;swap(__x); 
-<span class="lineNum">     236 </span>                :         return *this;
-<span class="lineNum">     237 </span>                :       }
-<span class="lineNum">     238 </span>                : #endif
-<span class="lineNum">     239 </span>                : 
-<span class="lineNum">     240 </span>                :       // accessors:
-<span class="lineNum">     241 </span>                : 
-<span class="lineNum">     242 </span>                :       ///  Returns the comparison object with which the %set was constructed.
-<span class="lineNum">     243 </span>                :       key_compare
-<span class="lineNum">     244 </span>                :       key_comp() const
-<span class="lineNum">     245 </span>                :       { return _M_t.key_comp(); }
-<span class="lineNum">     246 </span>                :       ///  Returns the comparison object with which the %set was constructed.
-<span class="lineNum">     247 </span>                :       value_compare
-<span class="lineNum">     248 </span>                :       value_comp() const
-<span class="lineNum">     249 </span>                :       { return _M_t.key_comp(); }
-<span class="lineNum">     250 </span>                :       ///  Returns the allocator object with which the %set was constructed.
-<span class="lineNum">     251 </span>                :       allocator_type
-<span class="lineNum">     252 </span>                :       get_allocator() const
-<span class="lineNum">     253 </span>                :       { return _M_t.get_allocator(); }
-<span class="lineNum">     254 </span>                : 
-<span class="lineNum">     255 </span>                :       /**
-<span class="lineNum">     256 </span>                :        *  Returns a read-only (constant) iterator that points to the first
-<span class="lineNum">     257 </span>                :        *  element in the %set.  Iteration is done in ascending order according
-<span class="lineNum">     258 </span>                :        *  to the keys.
-<span class="lineNum">     259 </span>                :        */
-<span class="lineNum">     260 </span>                :       iterator
-<span class="lineNum">     261 </span><span class="lineCov">         468023 :       begin() const</span>
-<span class="lineNum">     262 </span><span class="lineCov">         468023 :       { return _M_t.begin(); }</span>
-<span class="lineNum">     263 </span>                : 
-<span class="lineNum">     264 </span>                :       /**
-<span class="lineNum">     265 </span>                :        *  Returns a read-only (constant) iterator that points one past the last
-<span class="lineNum">     266 </span>                :        *  element in the %set.  Iteration is done in ascending order according
-<span class="lineNum">     267 </span>                :        *  to the keys.
-<span class="lineNum">     268 </span>                :        */
-<span class="lineNum">     269 </span>                :       iterator
-<span class="lineNum">     270 </span><span class="lineCov">        1576796 :       end() const</span>
-<span class="lineNum">     271 </span><span class="lineCov">        1576796 :       { return _M_t.end(); }</span>
-<span class="lineNum">     272 </span>                : 
-<span class="lineNum">     273 </span>                :       /**
-<span class="lineNum">     274 </span>                :        *  Returns a read-only (constant) iterator that points to the last
-<span class="lineNum">     275 </span>                :        *  element in the %set.  Iteration is done in descending order according
-<span class="lineNum">     276 </span>                :        *  to the keys.
-<span class="lineNum">     277 </span>                :        */
-<span class="lineNum">     278 </span>                :       reverse_iterator
-<span class="lineNum">     279 </span>                :       rbegin() const
-<span class="lineNum">     280 </span>                :       { return _M_t.rbegin(); }
-<span class="lineNum">     281 </span>                : 
-<span class="lineNum">     282 </span>                :       /**
-<span class="lineNum">     283 </span>                :        *  Returns a read-only (constant) reverse iterator that points to the
-<span class="lineNum">     284 </span>                :        *  last pair in the %set.  Iteration is done in descending order
-<span class="lineNum">     285 </span>                :        *  according to the keys.
-<span class="lineNum">     286 </span>                :        */
-<span class="lineNum">     287 </span>                :       reverse_iterator
-<span class="lineNum">     288 </span>                :       rend() const
-<span class="lineNum">     289 </span>                :       { return _M_t.rend(); }
-<span class="lineNum">     290 </span>                : 
-<span class="lineNum">     291 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     292 </span>                :       /**
-<span class="lineNum">     293 </span>                :        *  Returns a read-only (constant) iterator that points to the first
-<span class="lineNum">     294 </span>                :        *  element in the %set.  Iteration is done in ascending order according
-<span class="lineNum">     295 </span>                :        *  to the keys.
-<span class="lineNum">     296 </span>                :        */
-<span class="lineNum">     297 </span>                :       iterator
-<span class="lineNum">     298 </span>                :       cbegin() const
-<span class="lineNum">     299 </span>                :       { return _M_t.begin(); }
-<span class="lineNum">     300 </span>                : 
-<span class="lineNum">     301 </span>                :       /**
-<span class="lineNum">     302 </span>                :        *  Returns a read-only (constant) iterator that points one past the last
-<span class="lineNum">     303 </span>                :        *  element in the %set.  Iteration is done in ascending order according
-<span class="lineNum">     304 </span>                :        *  to the keys.
-<span class="lineNum">     305 </span>                :        */
-<span class="lineNum">     306 </span>                :       iterator
-<span class="lineNum">     307 </span>                :       cend() const
-<span class="lineNum">     308 </span>                :       { return _M_t.end(); }
-<span class="lineNum">     309 </span>                : 
-<span class="lineNum">     310 </span>                :       /**
-<span class="lineNum">     311 </span>                :        *  Returns a read-only (constant) iterator that points to the last
-<span class="lineNum">     312 </span>                :        *  element in the %set.  Iteration is done in descending order according
-<span class="lineNum">     313 </span>                :        *  to the keys.
-<span class="lineNum">     314 </span>                :        */
-<span class="lineNum">     315 </span>                :       reverse_iterator
-<span class="lineNum">     316 </span>                :       crbegin() const
-<span class="lineNum">     317 </span>                :       { return _M_t.rbegin(); }
-<span class="lineNum">     318 </span>                : 
-<span class="lineNum">     319 </span>                :       /**
-<span class="lineNum">     320 </span>                :        *  Returns a read-only (constant) reverse iterator that points to the
-<span class="lineNum">     321 </span>                :        *  last pair in the %set.  Iteration is done in descending order
-<span class="lineNum">     322 </span>                :        *  according to the keys.
-<span class="lineNum">     323 </span>                :        */
-<span class="lineNum">     324 </span>                :       reverse_iterator
-<span class="lineNum">     325 </span>                :       crend() const
-<span class="lineNum">     326 </span>                :       { return _M_t.rend(); }
-<span class="lineNum">     327 </span>                : #endif
-<span class="lineNum">     328 </span>                : 
-<span class="lineNum">     329 </span>                :       ///  Returns true if the %set is empty.
-<span class="lineNum">     330 </span>                :       bool
-<span class="lineNum">     331 </span><span class="lineCov">         338386 :       empty() const</span>
-<span class="lineNum">     332 </span><span class="lineCov">         338386 :       { return _M_t.empty(); }</span>
-<span class="lineNum">     333 </span>                : 
-<span class="lineNum">     334 </span>                :       ///  Returns the size of the %set.
-<span class="lineNum">     335 </span>                :       size_type
-<span class="lineNum">     336 </span><span class="lineCov">          84631 :       size() const</span>
-<span class="lineNum">     337 </span><span class="lineCov">          84631 :       { return _M_t.size(); }</span>
-<span class="lineNum">     338 </span>                : 
-<span class="lineNum">     339 </span>                :       ///  Returns the maximum size of the %set.
-<span class="lineNum">     340 </span>                :       size_type
-<span class="lineNum">     341 </span>                :       max_size() const
-<span class="lineNum">     342 </span>                :       { return _M_t.max_size(); }
-<span class="lineNum">     343 </span>                : 
-<span class="lineNum">     344 </span>                :       /**
-<span class="lineNum">     345 </span>                :        *  @brief  Swaps data with another %set.
-<span class="lineNum">     346 </span>                :        *  @param  x  A %set of the same element and allocator types.
-<span class="lineNum">     347 </span>                :        *
-<span class="lineNum">     348 </span>                :        *  This exchanges the elements between two sets in constant time.
-<span class="lineNum">     349 </span>                :        *  (It is only swapping a pointer, an integer, and an instance of
-<span class="lineNum">     350 </span>                :        *  the @c Compare type (which itself is often stateless and empty), so it
-<span class="lineNum">     351 </span>                :        *  should be quite fast.)
-<span class="lineNum">     352 </span>                :        *  Note that the global std::swap() function is specialized such that
-<span class="lineNum">     353 </span>                :        *  std::swap(s1,s2) will feed to this function.
-<span class="lineNum">     354 </span>                :        */
-<span class="lineNum">     355 </span>                :       void
-<span class="lineNum">     356 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     357 </span>                :       swap(set&amp;&amp; __x)
-<span class="lineNum">     358 </span>                : #else
-<span class="lineNum">     359 </span>                :       swap(set&amp; __x)        
-<span class="lineNum">     360 </span>                : #endif
-<span class="lineNum">     361 </span>                :       { _M_t.swap(__x._M_t); }
-<span class="lineNum">     362 </span>                : 
-<span class="lineNum">     363 </span>                :       // insert/erase
-<span class="lineNum">     364 </span>                :       /**
-<span class="lineNum">     365 </span>                :        *  @brief Attempts to insert an element into the %set.
-<span class="lineNum">     366 </span>                :        *  @param  x  Element to be inserted.
-<span class="lineNum">     367 </span>                :        *  @return  A pair, of which the first element is an iterator that points
-<span class="lineNum">     368 </span>                :        *           to the possibly inserted element, and the second is a bool
-<span class="lineNum">     369 </span>                :        *           that is true if the element was actually inserted.
-<span class="lineNum">     370 </span>                :        *
-<span class="lineNum">     371 </span>                :        *  This function attempts to insert an element into the %set.  A %set
-<span class="lineNum">     372 </span>                :        *  relies on unique keys and thus an element is only inserted if it is
-<span class="lineNum">     373 </span>                :        *  not already present in the %set.
-<span class="lineNum">     374 </span>                :        *
-<span class="lineNum">     375 </span>                :        *  Insertion requires logarithmic time.
-<span class="lineNum">     376 </span>                :        */
-<span class="lineNum">     377 </span>                :       std::pair&lt;iterator, bool&gt;
-<span class="lineNum">     378 </span><span class="lineCov">        1422360 :       insert(const value_type&amp; __x)</span>
-<span class="lineNum">     379 </span>                :       {
-<span class="lineNum">     380 </span>                :         std::pair&lt;typename _Rep_type::iterator, bool&gt; __p =
-<span class="lineNum">     381 </span><span class="lineCov">        1422360 :           _M_t._M_insert_unique(__x);</span>
-<span class="lineNum">     382 </span><span class="lineCov">        1422360 :         return std::pair&lt;iterator, bool&gt;(__p.first, __p.second);</span>
-<span class="lineNum">     383 </span>                :       }
-<span class="lineNum">     384 </span>                : 
-<span class="lineNum">     385 </span>                :       /**
-<span class="lineNum">     386 </span>                :        *  @brief Attempts to insert an element into the %set.
-<span class="lineNum">     387 </span>                :        *  @param  position  An iterator that serves as a hint as to where the
-<span class="lineNum">     388 </span>                :        *                    element should be inserted.
-<span class="lineNum">     389 </span>                :        *  @param  x  Element to be inserted.
-<span class="lineNum">     390 </span>                :        *  @return  An iterator that points to the element with key of @a x (may
-<span class="lineNum">     391 </span>                :        *           or may not be the element passed in).
-<span class="lineNum">     392 </span>                :        *
-<span class="lineNum">     393 </span>                :        *  This function is not concerned about whether the insertion took place,
-<span class="lineNum">     394 </span>                :        *  and thus does not return a boolean like the single-argument insert()
-<span class="lineNum">     395 </span>                :        *  does.  Note that the first parameter is only a hint and can
-<span class="lineNum">     396 </span>                :        *  potentially improve the performance of the insertion process.  A bad
-<span class="lineNum">     397 </span>                :        *  hint would cause no gains in efficiency.
-<span class="lineNum">     398 </span>                :        *
-<span class="lineNum">     399 </span>                :        *  See http://gcc.gnu.org/onlinedocs/libstdc++/23_containers/howto.html#4
-<span class="lineNum">     400 </span>                :        *  for more on &quot;hinting&quot;.
-<span class="lineNum">     401 </span>                :        *
-<span class="lineNum">     402 </span>                :        *  Insertion requires logarithmic time (if the hint is not taken).
-<span class="lineNum">     403 </span>                :        */
-<span class="lineNum">     404 </span>                :       iterator
-<span class="lineNum">     405 </span><span class="lineCov">         107613 :       insert(iterator __position, const value_type&amp; __x)</span>
-<span class="lineNum">     406 </span><span class="lineCov">         107613 :       { return _M_t._M_insert_unique_(__position, __x); }</span>
-<span class="lineNum">     407 </span>                : 
-<span class="lineNum">     408 </span>                :       /**
-<span class="lineNum">     409 </span>                :        *  @brief A template function that attempts to insert a range of elements.
-<span class="lineNum">     410 </span>                :        *  @param  first  Iterator pointing to the start of the range to be
-<span class="lineNum">     411 </span>                :        *                 inserted.
-<span class="lineNum">     412 </span>                :        *  @param  last  Iterator pointing to the end of the range.
-<span class="lineNum">     413 </span>                :        *
-<span class="lineNum">     414 </span>                :        *  Complexity similar to that of the range constructor.
-<span class="lineNum">     415 </span>                :        */
-<span class="lineNum">     416 </span>                :       template&lt;typename _InputIterator&gt;
-<span class="lineNum">     417 </span>                :         void
-<span class="lineNum">     418 </span>                :         insert(_InputIterator __first, _InputIterator __last)
-<span class="lineNum">     419 </span>                :         { _M_t._M_insert_unique(__first, __last); }
-<span class="lineNum">     420 </span>                : 
-<span class="lineNum">     421 </span>                :       /**
-<span class="lineNum">     422 </span>                :        *  @brief Erases an element from a %set.
-<span class="lineNum">     423 </span>                :        *  @param  position  An iterator pointing to the element to be erased.
-<span class="lineNum">     424 </span>                :        *
-<span class="lineNum">     425 </span>                :        *  This function erases an element, pointed to by the given iterator,
-<span class="lineNum">     426 </span>                :        *  from a %set.  Note that this function only erases the element, and
-<span class="lineNum">     427 </span>                :        *  that if the element is itself a pointer, the pointed-to memory is not
-<span class="lineNum">     428 </span>                :        *  touched in any way.  Managing the pointer is the user's responsibility.
-<span class="lineNum">     429 </span>                :        */
-<span class="lineNum">     430 </span>                :       void
-<span class="lineNum">     431 </span><span class="lineCov">            129 :       erase(iterator __position)</span>
-<span class="lineNum">     432 </span><span class="lineCov">            129 :       { _M_t.erase(__position); }</span>
-<span class="lineNum">     433 </span>                : 
-<span class="lineNum">     434 </span>                :       /**
-<span class="lineNum">     435 </span>                :        *  @brief Erases elements according to the provided key.
-<span class="lineNum">     436 </span>                :        *  @param  x  Key of element to be erased.
-<span class="lineNum">     437 </span>                :        *  @return  The number of elements erased.
-<span class="lineNum">     438 </span>                :        *
-<span class="lineNum">     439 </span>                :        *  This function erases all the elements located by the given key from
-<span class="lineNum">     440 </span>                :        *  a %set.
-<span class="lineNum">     441 </span>                :        *  Note that this function only erases the element, and that if
-<span class="lineNum">     442 </span>                :        *  the element is itself a pointer, the pointed-to memory is not touched
-<span class="lineNum">     443 </span>                :        *  in any way.  Managing the pointer is the user's responsibility.
-<span class="lineNum">     444 </span>                :        */
-<span class="lineNum">     445 </span>                :       size_type
-<span class="lineNum">     446 </span><span class="lineCov">              9 :       erase(const key_type&amp; __x)</span>
-<span class="lineNum">     447 </span><span class="lineCov">              9 :       { return _M_t.erase(__x); }</span>
-<span class="lineNum">     448 </span>                : 
-<span class="lineNum">     449 </span>                :       /**
-<span class="lineNum">     450 </span>                :        *  @brief Erases a [first,last) range of elements from a %set.
-<span class="lineNum">     451 </span>                :        *  @param  first  Iterator pointing to the start of the range to be
-<span class="lineNum">     452 </span>                :        *                 erased.
-<span class="lineNum">     453 </span>                :        *  @param  last  Iterator pointing to the end of the range to be erased.
-<span class="lineNum">     454 </span>                :        *
-<span class="lineNum">     455 </span>                :        *  This function erases a sequence of elements from a %set.
-<span class="lineNum">     456 </span>                :        *  Note that this function only erases the element, and that if
-<span class="lineNum">     457 </span>                :        *  the element is itself a pointer, the pointed-to memory is not touched
-<span class="lineNum">     458 </span>                :        *  in any way.  Managing the pointer is the user's responsibility.
-<span class="lineNum">     459 </span>                :        */
-<span class="lineNum">     460 </span>                :       void
-<span class="lineNum">     461 </span>                :       erase(iterator __first, iterator __last)
-<span class="lineNum">     462 </span>                :       { _M_t.erase(__first, __last); }
-<span class="lineNum">     463 </span>                : 
-<span class="lineNum">     464 </span>                :       /**
-<span class="lineNum">     465 </span>                :        *  Erases all elements in a %set.  Note that this function only erases
-<span class="lineNum">     466 </span>                :        *  the elements, and that if the elements themselves are pointers, the
-<span class="lineNum">     467 </span>                :        *  pointed-to memory is not touched in any way.  Managing the pointer is
-<span class="lineNum">     468 </span>                :        *  the user's responsibility.
-<span class="lineNum">     469 </span>                :        */
-<span class="lineNum">     470 </span>                :       void
-<span class="lineNum">     471 </span><span class="lineCov">          84600 :       clear()</span>
-<span class="lineNum">     472 </span><span class="lineCov">          84600 :       { _M_t.clear(); }</span>
-<span class="lineNum">     473 </span>                : 
-<span class="lineNum">     474 </span>                :       // set operations:
-<span class="lineNum">     475 </span>                : 
-<span class="lineNum">     476 </span>                :       /**
-<span class="lineNum">     477 </span>                :        *  @brief  Finds the number of elements.
-<span class="lineNum">     478 </span>                :        *  @param  x  Element to located.
-<span class="lineNum">     479 </span>                :        *  @return  Number of elements with specified key.
-<span class="lineNum">     480 </span>                :        *
-<span class="lineNum">     481 </span>                :        *  This function only makes sense for multisets; for set the result will
-<span class="lineNum">     482 </span>                :        *  either be 0 (not present) or 1 (present).
-<span class="lineNum">     483 </span>                :        */
-<span class="lineNum">     484 </span>                :       size_type
-<span class="lineNum">     485 </span>                :       count(const key_type&amp; __x) const
-<span class="lineNum">     486 </span>                :       { return _M_t.find(__x) == _M_t.end() ? 0 : 1; }
-<span class="lineNum">     487 </span>                : 
-<span class="lineNum">     488 </span>                :       // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     489 </span>                :       // 214.  set::find() missing const overload
-<span class="lineNum">     490 </span>                :       //@{
-<span class="lineNum">     491 </span>                :       /**
-<span class="lineNum">     492 </span>                :        *  @brief Tries to locate an element in a %set.
-<span class="lineNum">     493 </span>                :        *  @param  x  Element to be located.
-<span class="lineNum">     494 </span>                :        *  @return  Iterator pointing to sought-after element, or end() if not
-<span class="lineNum">     495 </span>                :        *           found.
-<span class="lineNum">     496 </span>                :        *
-<span class="lineNum">     497 </span>                :        *  This function takes a key and tries to locate the element with which
-<span class="lineNum">     498 </span>                :        *  the key matches.  If successful the function returns an iterator
-<span class="lineNum">     499 </span>                :        *  pointing to the sought after element.  If unsuccessful it returns the
-<span class="lineNum">     500 </span>                :        *  past-the-end ( @c end() ) iterator.
-<span class="lineNum">     501 </span>                :        */
-<span class="lineNum">     502 </span>                :       iterator
-<span class="lineNum">     503 </span><span class="lineCov">             39 :       find(const key_type&amp; __x)</span>
-<span class="lineNum">     504 </span><span class="lineCov">             39 :       { return _M_t.find(__x); }</span>
-<span class="lineNum">     505 </span>                : 
-<span class="lineNum">     506 </span>                :       const_iterator
-<span class="lineNum">     507 </span><span class="lineCov">             16 :       find(const key_type&amp; __x) const</span>
-<span class="lineNum">     508 </span><span class="lineCov">             16 :       { return _M_t.find(__x); }</span>
-<span class="lineNum">     509 </span>                :       //@}
-<span class="lineNum">     510 </span>                : 
-<span class="lineNum">     511 </span>                :       //@{
-<span class="lineNum">     512 </span>                :       /**
-<span class="lineNum">     513 </span>                :        *  @brief Finds the beginning of a subsequence matching given key.
-<span class="lineNum">     514 </span>                :        *  @param  x  Key to be located.
-<span class="lineNum">     515 </span>                :        *  @return  Iterator pointing to first element equal to or greater
-<span class="lineNum">     516 </span>                :        *           than key, or end().
-<span class="lineNum">     517 </span>                :        *
-<span class="lineNum">     518 </span>                :        *  This function returns the first element of a subsequence of elements
-<span class="lineNum">     519 </span>                :        *  that matches the given key.  If unsuccessful it returns an iterator
-<span class="lineNum">     520 </span>                :        *  pointing to the first element that has a greater value than given key
-<span class="lineNum">     521 </span>                :        *  or end() if no such element exists.
-<span class="lineNum">     522 </span>                :        */
-<span class="lineNum">     523 </span>                :       iterator
-<span class="lineNum">     524 </span>                :       lower_bound(const key_type&amp; __x)
-<span class="lineNum">     525 </span>                :       { return _M_t.lower_bound(__x); }
-<span class="lineNum">     526 </span>                : 
-<span class="lineNum">     527 </span>                :       const_iterator
-<span class="lineNum">     528 </span>                :       lower_bound(const key_type&amp; __x) const
-<span class="lineNum">     529 </span>                :       { return _M_t.lower_bound(__x); }
-<span class="lineNum">     530 </span>                :       //@}
-<span class="lineNum">     531 </span>                : 
-<span class="lineNum">     532 </span>                :       //@{
-<span class="lineNum">     533 </span>                :       /**
-<span class="lineNum">     534 </span>                :        *  @brief Finds the end of a subsequence matching given key.
-<span class="lineNum">     535 </span>                :        *  @param  x  Key to be located.
-<span class="lineNum">     536 </span>                :        *  @return Iterator pointing to the first element
-<span class="lineNum">     537 </span>                :        *          greater than key, or end().
-<span class="lineNum">     538 </span>                :        */
-<span class="lineNum">     539 </span>                :       iterator
-<span class="lineNum">     540 </span>                :       upper_bound(const key_type&amp; __x)
-<span class="lineNum">     541 </span>                :       { return _M_t.upper_bound(__x); }
-<span class="lineNum">     542 </span>                : 
-<span class="lineNum">     543 </span>                :       const_iterator
-<span class="lineNum">     544 </span>                :       upper_bound(const key_type&amp; __x) const
-<span class="lineNum">     545 </span>                :       { return _M_t.upper_bound(__x); }
-<span class="lineNum">     546 </span>                :       //@}
-<span class="lineNum">     547 </span>                : 
-<span class="lineNum">     548 </span>                :       //@{
-<span class="lineNum">     549 </span>                :       /**
-<span class="lineNum">     550 </span>                :        *  @brief Finds a subsequence matching given key.
-<span class="lineNum">     551 </span>                :        *  @param  x  Key to be located.
-<span class="lineNum">     552 </span>                :        *  @return  Pair of iterators that possibly points to the subsequence
-<span class="lineNum">     553 </span>                :        *           matching given key.
-<span class="lineNum">     554 </span>                :        *
-<span class="lineNum">     555 </span>                :        *  This function is equivalent to
-<span class="lineNum">     556 </span>                :        *  @code
-<span class="lineNum">     557 </span>                :        *    std::make_pair(c.lower_bound(val),
-<span class="lineNum">     558 </span>                :        *                   c.upper_bound(val))
-<span class="lineNum">     559 </span>                :        *  @endcode
-<span class="lineNum">     560 </span>                :        *  (but is faster than making the calls separately).
-<span class="lineNum">     561 </span>                :        *
-<span class="lineNum">     562 </span>                :        *  This function probably only makes sense for multisets.
-<span class="lineNum">     563 </span>                :        */
-<span class="lineNum">     564 </span>                :       std::pair&lt;iterator, iterator&gt;
-<span class="lineNum">     565 </span>                :       equal_range(const key_type&amp; __x)
-<span class="lineNum">     566 </span>                :       { return _M_t.equal_range(__x); }
-<span class="lineNum">     567 </span>                : 
-<span class="lineNum">     568 </span>                :       std::pair&lt;const_iterator, const_iterator&gt;
-<span class="lineNum">     569 </span>                :       equal_range(const key_type&amp; __x) const
-<span class="lineNum">     570 </span>                :       { return _M_t.equal_range(__x); }
-<span class="lineNum">     571 </span>                :       //@}
-<span class="lineNum">     572 </span>                : 
-<span class="lineNum">     573 </span>                :       template&lt;typename _K1, typename _C1, typename _A1&gt;
-<span class="lineNum">     574 </span>                :         friend bool
-<span class="lineNum">     575 </span>                :         operator==(const set&lt;_K1, _C1, _A1&gt;&amp;, const set&lt;_K1, _C1, _A1&gt;&amp;);
-<span class="lineNum">     576 </span>                : 
-<span class="lineNum">     577 </span>                :       template&lt;typename _K1, typename _C1, typename _A1&gt;
-<span class="lineNum">     578 </span>                :         friend bool
-<span class="lineNum">     579 </span>                :         operator&lt;(const set&lt;_K1, _C1, _A1&gt;&amp;, const set&lt;_K1, _C1, _A1&gt;&amp;);
-<span class="lineNum">     580 </span>                :     };
-<span class="lineNum">     581 </span>                : 
-<span class="lineNum">     582 </span>                : 
-<span class="lineNum">     583 </span>                :   /**
-<span class="lineNum">     584 </span>                :    *  @brief  Set equality comparison.
-<span class="lineNum">     585 </span>                :    *  @param  x  A %set.
-<span class="lineNum">     586 </span>                :    *  @param  y  A %set of the same type as @a x.
-<span class="lineNum">     587 </span>                :    *  @return  True iff the size and elements of the sets are equal.
-<span class="lineNum">     588 </span>                :    *
-<span class="lineNum">     589 </span>                :    *  This is an equivalence relation.  It is linear in the size of the sets.
-<span class="lineNum">     590 </span>                :    *  Sets are considered equivalent if their sizes are equal, and if
-<span class="lineNum">     591 </span>                :    *  corresponding elements compare equal.
-<span class="lineNum">     592 </span>                :   */
-<span class="lineNum">     593 </span>                :   template&lt;typename _Key, typename _Compare, typename _Alloc&gt;
-<span class="lineNum">     594 </span>                :     inline bool
-<span class="lineNum">     595 </span>                :     operator==(const set&lt;_Key, _Compare, _Alloc&gt;&amp; __x,
-<span class="lineNum">     596 </span><span class="lineCov">              4 :                const set&lt;_Key, _Compare, _Alloc&gt;&amp; __y)</span>
-<span class="lineNum">     597 </span><span class="lineCov">              4 :     { return __x._M_t == __y._M_t; }</span>
-<span class="lineNum">     598 </span>                : 
-<span class="lineNum">     599 </span>                :   /**
-<span class="lineNum">     600 </span>                :    *  @brief  Set ordering relation.
-<span class="lineNum">     601 </span>                :    *  @param  x  A %set.
-<span class="lineNum">     602 </span>                :    *  @param  y  A %set of the same type as @a x.
-<span class="lineNum">     603 </span>                :    *  @return  True iff @a x is lexicographically less than @a y.
-<span class="lineNum">     604 </span>                :    *
-<span class="lineNum">     605 </span>                :    *  This is a total ordering relation.  It is linear in the size of the
-<span class="lineNum">     606 </span>                :    *  maps.  The elements must be comparable with @c &lt;.
-<span class="lineNum">     607 </span>                :    *
-<span class="lineNum">     608 </span>                :    *  See std::lexicographical_compare() for how the determination is made.
-<span class="lineNum">     609 </span>                :   */
-<span class="lineNum">     610 </span>                :   template&lt;typename _Key, typename _Compare, typename _Alloc&gt;
-<span class="lineNum">     611 </span>                :     inline bool
-<span class="lineNum">     612 </span>                :     operator&lt;(const set&lt;_Key, _Compare, _Alloc&gt;&amp; __x,
-<span class="lineNum">     613 </span>                :               const set&lt;_Key, _Compare, _Alloc&gt;&amp; __y)
-<span class="lineNum">     614 </span>                :     { return __x._M_t &lt; __y._M_t; }
-<span class="lineNum">     615 </span>                : 
-<span class="lineNum">     616 </span>                :   ///  Returns !(x == y).
-<span class="lineNum">     617 </span>                :   template&lt;typename _Key, typename _Compare, typename _Alloc&gt;
-<span class="lineNum">     618 </span>                :     inline bool
-<span class="lineNum">     619 </span>                :     operator!=(const set&lt;_Key, _Compare, _Alloc&gt;&amp; __x,
-<span class="lineNum">     620 </span>                :                const set&lt;_Key, _Compare, _Alloc&gt;&amp; __y)
-<span class="lineNum">     621 </span>                :     { return !(__x == __y); }
-<span class="lineNum">     622 </span>                : 
-<span class="lineNum">     623 </span>                :   ///  Returns y &lt; x.
-<span class="lineNum">     624 </span>                :   template&lt;typename _Key, typename _Compare, typename _Alloc&gt;
-<span class="lineNum">     625 </span>                :     inline bool
-<span class="lineNum">     626 </span>                :     operator&gt;(const set&lt;_Key, _Compare, _Alloc&gt;&amp; __x,
-<span class="lineNum">     627 </span>                :               const set&lt;_Key, _Compare, _Alloc&gt;&amp; __y)
-<span class="lineNum">     628 </span>                :     { return __y &lt; __x; }
-<span class="lineNum">     629 </span>                : 
-<span class="lineNum">     630 </span>                :   ///  Returns !(y &lt; x)
-<span class="lineNum">     631 </span>                :   template&lt;typename _Key, typename _Compare, typename _Alloc&gt;
-<span class="lineNum">     632 </span>                :     inline bool
-<span class="lineNum">     633 </span>                :     operator&lt;=(const set&lt;_Key, _Compare, _Alloc&gt;&amp; __x,
-<span class="lineNum">     634 </span>                :                const set&lt;_Key, _Compare, _Alloc&gt;&amp; __y)
-<span class="lineNum">     635 </span>                :     { return !(__y &lt; __x); }
-<span class="lineNum">     636 </span>                : 
-<span class="lineNum">     637 </span>                :   ///  Returns !(x &lt; y)
-<span class="lineNum">     638 </span>                :   template&lt;typename _Key, typename _Compare, typename _Alloc&gt;
-<span class="lineNum">     639 </span>                :     inline bool
-<span class="lineNum">     640 </span>                :     operator&gt;=(const set&lt;_Key, _Compare, _Alloc&gt;&amp; __x,
-<span class="lineNum">     641 </span>                :                const set&lt;_Key, _Compare, _Alloc&gt;&amp; __y)
-<span class="lineNum">     642 </span>                :     { return !(__x &lt; __y); }
-<span class="lineNum">     643 </span>                : 
-<span class="lineNum">     644 </span>                :   /// See std::set::swap().
-<span class="lineNum">     645 </span>                :   template&lt;typename _Key, typename _Compare, typename _Alloc&gt;
-<span class="lineNum">     646 </span>                :     inline void
-<span class="lineNum">     647 </span>                :     swap(set&lt;_Key, _Compare, _Alloc&gt;&amp; __x, set&lt;_Key, _Compare, _Alloc&gt;&amp; __y)
-<span class="lineNum">     648 </span>                :     { __x.swap(__y); }
-<span class="lineNum">     649 </span>                : 
-<span class="lineNum">     650 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     651 </span>                :   template&lt;typename _Key, typename _Compare, typename _Alloc&gt;
-<span class="lineNum">     652 </span>                :     inline void
-<span class="lineNum">     653 </span>                :     swap(set&lt;_Key, _Compare, _Alloc&gt;&amp;&amp; __x, set&lt;_Key, _Compare, _Alloc&gt;&amp; __y)
-<span class="lineNum">     654 </span>                :     { __x.swap(__y); }
-<span class="lineNum">     655 </span>                : 
-<span class="lineNum">     656 </span>                :   template&lt;typename _Key, typename _Compare, typename _Alloc&gt;
-<span class="lineNum">     657 </span>                :     inline void
-<span class="lineNum">     658 </span>                :     swap(set&lt;_Key, _Compare, _Alloc&gt;&amp; __x, set&lt;_Key, _Compare, _Alloc&gt;&amp;&amp; __y)
-<span class="lineNum">     659 </span>                :     { __x.swap(__y); }
-<span class="lineNum">     660 </span>                : #endif
-<span class="lineNum">     661 </span>                : 
-<span class="lineNum">     662 </span>                : _GLIBCXX_END_NESTED_NAMESPACE
-<span class="lineNum">     663 </span>                : 
-<span class="lineNum">     664 </span>                : #endif /* _STL_SET_H */
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/bits/stl_stack.h.gcov.html b/rep/usr/include/c++/4.3/bits/stl_stack.h.gcov.html
deleted file mode 100644
index d033bc3..0000000
--- a/rep/usr/include/c++/4.3/bits/stl_stack.h.gcov.html
+++ /dev/null
@@ -1,369 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_stack.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_stack.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">12</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">12</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // Stack implementation -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007
-<span class="lineNum">       4 </span>                : // Free Software Foundation, Inc.
-<span class="lineNum">       5 </span>                : //
-<span class="lineNum">       6 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       7 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       8 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">       9 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      10 </span>                : // any later version.
-<span class="lineNum">      11 </span>                : 
-<span class="lineNum">      12 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      13 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      14 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      15 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      16 </span>                : 
-<span class="lineNum">      17 </span>                : // You should have received a copy of the GNU General Public License along
-<span class="lineNum">      18 </span>                : // with this library; see the file COPYING.  If not, write to the Free
-<span class="lineNum">      19 </span>                : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-<span class="lineNum">      20 </span>                : // USA.
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      23 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      24 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      25 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      26 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      27 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      28 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      29 </span>                : // the GNU General Public License.
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : /*
-<span class="lineNum">      32 </span>                :  *
-<span class="lineNum">      33 </span>                :  * Copyright (c) 1994
-<span class="lineNum">      34 </span>                :  * Hewlett-Packard Company
-<span class="lineNum">      35 </span>                :  *
-<span class="lineNum">      36 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      37 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      38 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      39 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      40 </span>                :  * in supporting documentation.  Hewlett-Packard Company makes no
-<span class="lineNum">      41 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      42 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      43 </span>                :  *
-<span class="lineNum">      44 </span>                :  *
-<span class="lineNum">      45 </span>                :  * Copyright (c) 1996,1997
-<span class="lineNum">      46 </span>                :  * Silicon Graphics Computer Systems, Inc.
-<span class="lineNum">      47 </span>                :  *
-<span class="lineNum">      48 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      49 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      50 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      51 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      52 </span>                :  * in supporting documentation.  Silicon Graphics makes no
-<span class="lineNum">      53 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      54 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      55 </span>                :  */
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span>                : /** @file stl_stack.h
-<span class="lineNum">      58 </span>                :  *  This is an internal header file, included by other library headers.
-<span class="lineNum">      59 </span>                :  *  You should not attempt to use it directly.
-<span class="lineNum">      60 </span>                :  */
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span>                : #ifndef _STL_STACK_H
-<span class="lineNum">      63 </span>                : #define _STL_STACK_H 1
-<span class="lineNum">      64 </span>                : 
-<span class="lineNum">      65 </span>                : #include &lt;bits/concept_check.h&gt;
-<span class="lineNum">      66 </span>                : #include &lt;debug/debug.h&gt;
-<span class="lineNum">      67 </span>                : 
-<span class="lineNum">      68 </span>                : _GLIBCXX_BEGIN_NAMESPACE(std)
-<span class="lineNum">      69 </span>                : 
-<span class="lineNum">      70 </span>                :   /**
-<span class="lineNum">      71 </span>                :    *  @brief  A standard container giving FILO behavior.
-<span class="lineNum">      72 </span>                :    *
-<span class="lineNum">      73 </span>                :    *  @ingroup Containers
-<span class="lineNum">      74 </span>                :    *  @ingroup Sequences
-<span class="lineNum">      75 </span>                :    *
-<span class="lineNum">      76 </span>                :    *  Meets many of the requirements of a
-<span class="lineNum">      77 </span>                :    *  &lt;a href=&quot;tables.html#65&quot;&gt;container&lt;/a&gt;,
-<span class="lineNum">      78 </span>                :    *  but does not define anything to do with iterators.  Very few of the
-<span class="lineNum">      79 </span>                :    *  other standard container interfaces are defined.
-<span class="lineNum">      80 </span>                :    *
-<span class="lineNum">      81 </span>                :    *  This is not a true container, but an @e adaptor.  It holds
-<span class="lineNum">      82 </span>                :    *  another container, and provides a wrapper interface to that
-<span class="lineNum">      83 </span>                :    *  container.  The wrapper is what enforces strict
-<span class="lineNum">      84 </span>                :    *  first-in-last-out %stack behavior.
-<span class="lineNum">      85 </span>                :    *
-<span class="lineNum">      86 </span>                :    *  The second template parameter defines the type of the underlying
-<span class="lineNum">      87 </span>                :    *  sequence/container.  It defaults to std::deque, but it can be
-<span class="lineNum">      88 </span>                :    *  any type that supports @c back, @c push_back, and @c pop_front,
-<span class="lineNum">      89 </span>                :    *  such as std::list, std::vector, or an appropriate user-defined
-<span class="lineNum">      90 </span>                :    *  type.
-<span class="lineNum">      91 </span>                :    *
-<span class="lineNum">      92 </span>                :    *  Members not found in &quot;normal&quot; containers are @c container_type,
-<span class="lineNum">      93 </span>                :    *  which is a typedef for the second Sequence parameter, and @c
-<span class="lineNum">      94 </span>                :    *  push, @c pop, and @c top, which are standard %stack/FILO
-<span class="lineNum">      95 </span>                :    *  operations.
-<span class="lineNum">      96 </span>                :   */
-<span class="lineNum">      97 </span>                :   template&lt;typename _Tp, typename _Sequence = deque&lt;_Tp&gt; &gt;
-<span class="lineNum">      98 </span>                :     class stack
-<span class="lineNum">      99 </span><span class="lineCov">             13 :     {</span>
-<span class="lineNum">     100 </span>                :       // concept requirements
-<span class="lineNum">     101 </span>                :       typedef typename _Sequence::value_type _Sequence_value_type;
-<span class="lineNum">     102 </span>                :       __glibcxx_class_requires(_Tp, _SGIAssignableConcept)
-<span class="lineNum">     103 </span>                :       __glibcxx_class_requires(_Sequence, _BackInsertionSequenceConcept)
-<span class="lineNum">     104 </span>                :       __glibcxx_class_requires2(_Tp, _Sequence_value_type, _SameTypeConcept)
-<span class="lineNum">     105 </span>                : 
-<span class="lineNum">     106 </span>                :       template&lt;typename _Tp1, typename _Seq1&gt;
-<span class="lineNum">     107 </span>                :         friend bool
-<span class="lineNum">     108 </span>                :         operator==(const stack&lt;_Tp1, _Seq1&gt;&amp;, const stack&lt;_Tp1, _Seq1&gt;&amp;);
-<span class="lineNum">     109 </span>                : 
-<span class="lineNum">     110 </span>                :       template&lt;typename _Tp1, typename _Seq1&gt;
-<span class="lineNum">     111 </span>                :         friend bool
-<span class="lineNum">     112 </span>                :         operator&lt;(const stack&lt;_Tp1, _Seq1&gt;&amp;, const stack&lt;_Tp1, _Seq1&gt;&amp;);
-<span class="lineNum">     113 </span>                : 
-<span class="lineNum">     114 </span>                :     public:
-<span class="lineNum">     115 </span>                :       typedef typename _Sequence::value_type                value_type;
-<span class="lineNum">     116 </span>                :       typedef typename _Sequence::reference                 reference;
-<span class="lineNum">     117 </span>                :       typedef typename _Sequence::const_reference           const_reference;
-<span class="lineNum">     118 </span>                :       typedef typename _Sequence::size_type                 size_type;
-<span class="lineNum">     119 </span>                :       typedef          _Sequence                            container_type;
-<span class="lineNum">     120 </span>                : 
-<span class="lineNum">     121 </span>                :     protected:
-<span class="lineNum">     122 </span>                :       //  See queue::c for notes on this name.
-<span class="lineNum">     123 </span>                :       _Sequence c;
-<span class="lineNum">     124 </span>                : 
-<span class="lineNum">     125 </span>                :     public:
-<span class="lineNum">     126 </span>                :       // XXX removed old def ctor, added def arg to this one to match 14882
-<span class="lineNum">     127 </span>                :       /**
-<span class="lineNum">     128 </span>                :        *  @brief  Default constructor creates no elements.
-<span class="lineNum">     129 </span>                :        */
-<span class="lineNum">     130 </span>                : #ifndef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     131 </span>                :       explicit
-<span class="lineNum">     132 </span><span class="lineCov">             13 :       stack(const _Sequence&amp; __c = _Sequence())</span>
-<span class="lineNum">     133 </span><span class="lineCov">             13 :       : c(__c) { }</span>
-<span class="lineNum">     134 </span>                : #else
-<span class="lineNum">     135 </span>                :       explicit
-<span class="lineNum">     136 </span>                :       stack(const _Sequence&amp; __c)
-<span class="lineNum">     137 </span>                :       : c(__c) { }
-<span class="lineNum">     138 </span>                : 
-<span class="lineNum">     139 </span>                :       explicit
-<span class="lineNum">     140 </span>                :       stack(_Sequence&amp;&amp; __c = _Sequence())
-<span class="lineNum">     141 </span>                :       : c(std::move(__c)) { }
-<span class="lineNum">     142 </span>                : #endif
-<span class="lineNum">     143 </span>                : 
-<span class="lineNum">     144 </span>                :       /**
-<span class="lineNum">     145 </span>                :        *  Returns true if the %stack is empty.
-<span class="lineNum">     146 </span>                :        */
-<span class="lineNum">     147 </span>                :       bool
-<span class="lineNum">     148 </span><span class="lineCov">             32 :       empty() const</span>
-<span class="lineNum">     149 </span><span class="lineCov">             32 :       { return c.empty(); }</span>
-<span class="lineNum">     150 </span>                : 
-<span class="lineNum">     151 </span>                :       /**  Returns the number of elements in the %stack.  */
-<span class="lineNum">     152 </span>                :       size_type
-<span class="lineNum">     153 </span>                :       size() const
-<span class="lineNum">     154 </span>                :       { return c.size(); }
-<span class="lineNum">     155 </span>                : 
-<span class="lineNum">     156 </span>                :       /**
-<span class="lineNum">     157 </span>                :        *  Returns a read/write reference to the data at the first
-<span class="lineNum">     158 </span>                :        *  element of the %stack.
-<span class="lineNum">     159 </span>                :        */
-<span class="lineNum">     160 </span>                :       reference
-<span class="lineNum">     161 </span><span class="lineCov">             39 :       top()</span>
-<span class="lineNum">     162 </span>                :       {
-<span class="lineNum">     163 </span>                :         __glibcxx_requires_nonempty();
-<span class="lineNum">     164 </span><span class="lineCov">             39 :         return c.back();</span>
-<span class="lineNum">     165 </span>                :       }
-<span class="lineNum">     166 </span>                : 
-<span class="lineNum">     167 </span>                :       /**
-<span class="lineNum">     168 </span>                :        *  Returns a read-only (constant) reference to the data at the first
-<span class="lineNum">     169 </span>                :        *  element of the %stack.
-<span class="lineNum">     170 </span>                :        */
-<span class="lineNum">     171 </span>                :       const_reference
-<span class="lineNum">     172 </span>                :       top() const
-<span class="lineNum">     173 </span>                :       {
-<span class="lineNum">     174 </span>                :         __glibcxx_requires_nonempty();
-<span class="lineNum">     175 </span>                :         return c.back();
-<span class="lineNum">     176 </span>                :       }
-<span class="lineNum">     177 </span>                : 
-<span class="lineNum">     178 </span>                :       /**
-<span class="lineNum">     179 </span>                :        *  @brief  Add data to the top of the %stack.
-<span class="lineNum">     180 </span>                :        *  @param  x  Data to be added.
-<span class="lineNum">     181 </span>                :        *
-<span class="lineNum">     182 </span>                :        *  This is a typical %stack operation.  The function creates an
-<span class="lineNum">     183 </span>                :        *  element at the top of the %stack and assigns the given data
-<span class="lineNum">     184 </span>                :        *  to it.  The time complexity of the operation depends on the
-<span class="lineNum">     185 </span>                :        *  underlying sequence.
-<span class="lineNum">     186 </span>                :        */
-<span class="lineNum">     187 </span>                : #ifndef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     188 </span>                :       void
-<span class="lineNum">     189 </span><span class="lineCov">             24 :       push(const value_type&amp; __x)</span>
-<span class="lineNum">     190 </span><span class="lineCov">             24 :       { c.push_back(__x); }</span>
-<span class="lineNum">     191 </span>                : #else
-<span class="lineNum">     192 </span>                :       // NB: DR 756.
-<span class="lineNum">     193 </span>                :       template&lt;typename... _Args&gt;
-<span class="lineNum">     194 </span>                :         void
-<span class="lineNum">     195 </span>                :         push(_Args&amp;&amp;... __args)
-<span class="lineNum">     196 </span>                :         { c.push_back(std::forward&lt;_Args&gt;(__args)...); }
-<span class="lineNum">     197 </span>                : #endif
-<span class="lineNum">     198 </span>                : 
-<span class="lineNum">     199 </span>                :       /**
-<span class="lineNum">     200 </span>                :        *  @brief  Removes first element.
-<span class="lineNum">     201 </span>                :        *
-<span class="lineNum">     202 </span>                :        *  This is a typical %stack operation.  It shrinks the %stack
-<span class="lineNum">     203 </span>                :        *  by one.  The time complexity of the operation depends on the
-<span class="lineNum">     204 </span>                :        *  underlying sequence.
-<span class="lineNum">     205 </span>                :        *
-<span class="lineNum">     206 </span>                :        *  Note that no data is returned, and if the first element's
-<span class="lineNum">     207 </span>                :        *  data is needed, it should be retrieved before pop() is
-<span class="lineNum">     208 </span>                :        *  called.
-<span class="lineNum">     209 </span>                :        */
-<span class="lineNum">     210 </span>                :       void
-<span class="lineNum">     211 </span><span class="lineCov">             24 :       pop()</span>
-<span class="lineNum">     212 </span>                :       {
-<span class="lineNum">     213 </span>                :         __glibcxx_requires_nonempty();
-<span class="lineNum">     214 </span><span class="lineCov">             24 :         c.pop_back();</span>
-<span class="lineNum">     215 </span><span class="lineCov">             24 :       }</span>
-<span class="lineNum">     216 </span>                : 
-<span class="lineNum">     217 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     218 </span>                :       void
-<span class="lineNum">     219 </span>                :       swap(stack&amp;&amp; __s)
-<span class="lineNum">     220 </span>                :       { c.swap(__s.c); }
-<span class="lineNum">     221 </span>                : #endif
-<span class="lineNum">     222 </span>                :     };
-<span class="lineNum">     223 </span>                : 
-<span class="lineNum">     224 </span>                :   /**
-<span class="lineNum">     225 </span>                :    *  @brief  Stack equality comparison.
-<span class="lineNum">     226 </span>                :    *  @param  x  A %stack.
-<span class="lineNum">     227 </span>                :    *  @param  y  A %stack of the same type as @a x.
-<span class="lineNum">     228 </span>                :    *  @return  True iff the size and elements of the stacks are equal.
-<span class="lineNum">     229 </span>                :    *
-<span class="lineNum">     230 </span>                :    *  This is an equivalence relation.  Complexity and semantics
-<span class="lineNum">     231 </span>                :    *  depend on the underlying sequence type, but the expected rules
-<span class="lineNum">     232 </span>                :    *  are: this relation is linear in the size of the sequences, and
-<span class="lineNum">     233 </span>                :    *  stacks are considered equivalent if their sequences compare
-<span class="lineNum">     234 </span>                :    *  equal.
-<span class="lineNum">     235 </span>                :   */
-<span class="lineNum">     236 </span>                :   template&lt;typename _Tp, typename _Seq&gt;
-<span class="lineNum">     237 </span>                :     inline bool
-<span class="lineNum">     238 </span>                :     operator==(const stack&lt;_Tp, _Seq&gt;&amp; __x, const stack&lt;_Tp, _Seq&gt;&amp; __y)
-<span class="lineNum">     239 </span>                :     { return __x.c == __y.c; }
-<span class="lineNum">     240 </span>                : 
-<span class="lineNum">     241 </span>                :   /**
-<span class="lineNum">     242 </span>                :    *  @brief  Stack ordering relation.
-<span class="lineNum">     243 </span>                :    *  @param  x  A %stack.
-<span class="lineNum">     244 </span>                :    *  @param  y  A %stack of the same type as @a x.
-<span class="lineNum">     245 </span>                :    *  @return  True iff @a x is lexicographically less than @a y.
-<span class="lineNum">     246 </span>                :    *
-<span class="lineNum">     247 </span>                :    *  This is an total ordering relation.  Complexity and semantics
-<span class="lineNum">     248 </span>                :    *  depend on the underlying sequence type, but the expected rules
-<span class="lineNum">     249 </span>                :    *  are: this relation is linear in the size of the sequences, the
-<span class="lineNum">     250 </span>                :    *  elements must be comparable with @c &lt;, and
-<span class="lineNum">     251 </span>                :    *  std::lexicographical_compare() is usually used to make the
-<span class="lineNum">     252 </span>                :    *  determination.
-<span class="lineNum">     253 </span>                :   */
-<span class="lineNum">     254 </span>                :   template&lt;typename _Tp, typename _Seq&gt;
-<span class="lineNum">     255 </span>                :     inline bool
-<span class="lineNum">     256 </span>                :     operator&lt;(const stack&lt;_Tp, _Seq&gt;&amp; __x, const stack&lt;_Tp, _Seq&gt;&amp; __y)
-<span class="lineNum">     257 </span>                :     { return __x.c &lt; __y.c; }
-<span class="lineNum">     258 </span>                : 
-<span class="lineNum">     259 </span>                :   /// Based on operator==
-<span class="lineNum">     260 </span>                :   template&lt;typename _Tp, typename _Seq&gt;
-<span class="lineNum">     261 </span>                :     inline bool
-<span class="lineNum">     262 </span>                :     operator!=(const stack&lt;_Tp, _Seq&gt;&amp; __x, const stack&lt;_Tp, _Seq&gt;&amp; __y)
-<span class="lineNum">     263 </span>                :     { return !(__x == __y); }
-<span class="lineNum">     264 </span>                : 
-<span class="lineNum">     265 </span>                :   /// Based on operator&lt;
-<span class="lineNum">     266 </span>                :   template&lt;typename _Tp, typename _Seq&gt;
-<span class="lineNum">     267 </span>                :     inline bool
-<span class="lineNum">     268 </span>                :     operator&gt;(const stack&lt;_Tp, _Seq&gt;&amp; __x, const stack&lt;_Tp, _Seq&gt;&amp; __y)
-<span class="lineNum">     269 </span>                :     { return __y &lt; __x; }
-<span class="lineNum">     270 </span>                : 
-<span class="lineNum">     271 </span>                :   /// Based on operator&lt;
-<span class="lineNum">     272 </span>                :   template&lt;typename _Tp, typename _Seq&gt;
-<span class="lineNum">     273 </span>                :     inline bool
-<span class="lineNum">     274 </span>                :     operator&lt;=(const stack&lt;_Tp, _Seq&gt;&amp; __x, const stack&lt;_Tp, _Seq&gt;&amp; __y)
-<span class="lineNum">     275 </span>                :     { return !(__y &lt; __x); }
-<span class="lineNum">     276 </span>                : 
-<span class="lineNum">     277 </span>                :   /// Based on operator&lt;
-<span class="lineNum">     278 </span>                :   template&lt;typename _Tp, typename _Seq&gt;
-<span class="lineNum">     279 </span>                :     inline bool
-<span class="lineNum">     280 </span>                :     operator&gt;=(const stack&lt;_Tp, _Seq&gt;&amp; __x, const stack&lt;_Tp, _Seq&gt;&amp; __y)
-<span class="lineNum">     281 </span>                :     { return !(__x &lt; __y); }
-<span class="lineNum">     282 </span>                : 
-<span class="lineNum">     283 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     284 </span>                :   template&lt;typename _Tp, typename _Seq&gt;
-<span class="lineNum">     285 </span>                :     inline void
-<span class="lineNum">     286 </span>                :     swap(stack&lt;_Tp, _Seq&gt;&amp; __x, stack&lt;_Tp, _Seq&gt;&amp; __y)
-<span class="lineNum">     287 </span>                :     { __x.swap(__y); }
-<span class="lineNum">     288 </span>                : 
-<span class="lineNum">     289 </span>                :   template&lt;typename _Tp, typename _Seq&gt;
-<span class="lineNum">     290 </span>                :     inline void
-<span class="lineNum">     291 </span>                :     swap(stack&lt;_Tp, _Seq&gt;&amp;&amp; __x, stack&lt;_Tp, _Seq&gt;&amp; __y)
-<span class="lineNum">     292 </span>                :     { __x.swap(__y); }
-<span class="lineNum">     293 </span>                : 
-<span class="lineNum">     294 </span>                :   template&lt;typename _Tp, typename _Seq&gt;
-<span class="lineNum">     295 </span>                :     inline void
-<span class="lineNum">     296 </span>                :     swap(stack&lt;_Tp, _Seq&gt;&amp; __x, stack&lt;_Tp, _Seq&gt;&amp;&amp; __y)
-<span class="lineNum">     297 </span>                :     { __x.swap(__y); }
-<span class="lineNum">     298 </span>                : #endif
-<span class="lineNum">     299 </span>                : 
-<span class="lineNum">     300 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">     301 </span>                : 
-<span class="lineNum">     302 </span>                : #endif /* _STL_STACK_H */
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/bits/stl_tree.h.gcov.html b/rep/usr/include/c++/4.3/bits/stl_tree.h.gcov.html
deleted file mode 100644
index 9827a27..0000000
--- a/rep/usr/include/c++/4.3/bits/stl_tree.h.gcov.html
+++ /dev/null
@@ -1,1533 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_tree.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_tree.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">295</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">94.2 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">278</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // RB tree implementation -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007
-<span class="lineNum">       4 </span>                : // Free Software Foundation, Inc.
-<span class="lineNum">       5 </span>                : //
-<span class="lineNum">       6 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       7 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       8 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">       9 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      10 </span>                : // any later version.
-<span class="lineNum">      11 </span>                : 
-<span class="lineNum">      12 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      13 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      14 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      15 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      16 </span>                : 
-<span class="lineNum">      17 </span>                : // You should have received a copy of the GNU General Public License along
-<span class="lineNum">      18 </span>                : // with this library; see the file COPYING.  If not, write to the Free
-<span class="lineNum">      19 </span>                : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-<span class="lineNum">      20 </span>                : // USA.
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      23 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      24 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      25 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      26 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      27 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      28 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      29 </span>                : // the GNU General Public License.
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : /*
-<span class="lineNum">      32 </span>                :  *
-<span class="lineNum">      33 </span>                :  * Copyright (c) 1996,1997
-<span class="lineNum">      34 </span>                :  * Silicon Graphics Computer Systems, Inc.
-<span class="lineNum">      35 </span>                :  *
-<span class="lineNum">      36 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      37 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      38 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      39 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      40 </span>                :  * in supporting documentation.  Silicon Graphics makes no
-<span class="lineNum">      41 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      42 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      43 </span>                :  *
-<span class="lineNum">      44 </span>                :  *
-<span class="lineNum">      45 </span>                :  * Copyright (c) 1994
-<span class="lineNum">      46 </span>                :  * Hewlett-Packard Company
-<span class="lineNum">      47 </span>                :  *
-<span class="lineNum">      48 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      49 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      50 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      51 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      52 </span>                :  * in supporting documentation.  Hewlett-Packard Company makes no
-<span class="lineNum">      53 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      54 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      55 </span>                :  *
-<span class="lineNum">      56 </span>                :  *
-<span class="lineNum">      57 </span>                :  */
-<span class="lineNum">      58 </span>                : 
-<span class="lineNum">      59 </span>                : /** @file stl_tree.h
-<span class="lineNum">      60 </span>                :  *  This is an internal header file, included by other library headers.
-<span class="lineNum">      61 </span>                :  *  You should not attempt to use it directly.
-<span class="lineNum">      62 </span>                :  */
-<span class="lineNum">      63 </span>                : 
-<span class="lineNum">      64 </span>                : #ifndef _STL_TREE_H
-<span class="lineNum">      65 </span>                : #define _STL_TREE_H 1
-<span class="lineNum">      66 </span>                : 
-<span class="lineNum">      67 </span>                : #include &lt;bits/stl_algobase.h&gt;
-<span class="lineNum">      68 </span>                : #include &lt;bits/allocator.h&gt;
-<span class="lineNum">      69 </span>                : #include &lt;bits/stl_function.h&gt;
-<span class="lineNum">      70 </span>                : #include &lt;bits/cpp_type_traits.h&gt;
-<span class="lineNum">      71 </span>                : 
-<span class="lineNum">      72 </span>                : _GLIBCXX_BEGIN_NAMESPACE(std)
-<span class="lineNum">      73 </span>                : 
-<span class="lineNum">      74 </span>                :   // Red-black tree class, designed for use in implementing STL
-<span class="lineNum">      75 </span>                :   // associative containers (set, multiset, map, and multimap). The
-<span class="lineNum">      76 </span>                :   // insertion and deletion algorithms are based on those in Cormen,
-<span class="lineNum">      77 </span>                :   // Leiserson, and Rivest, Introduction to Algorithms (MIT Press,
-<span class="lineNum">      78 </span>                :   // 1990), except that
-<span class="lineNum">      79 </span>                :   //
-<span class="lineNum">      80 </span>                :   // (1) the header cell is maintained with links not only to the root
-<span class="lineNum">      81 </span>                :   // but also to the leftmost node of the tree, to enable constant
-<span class="lineNum">      82 </span>                :   // time begin(), and to the rightmost node of the tree, to enable
-<span class="lineNum">      83 </span>                :   // linear time performance when used with the generic set algorithms
-<span class="lineNum">      84 </span>                :   // (set_union, etc.)
-<span class="lineNum">      85 </span>                :   // 
-<span class="lineNum">      86 </span>                :   // (2) when a node being deleted has two children its successor node
-<span class="lineNum">      87 </span>                :   // is relinked into its place, rather than copied, so that the only
-<span class="lineNum">      88 </span>                :   // iterators invalidated are those referring to the deleted node.
-<span class="lineNum">      89 </span>                : 
-<span class="lineNum">      90 </span>                :   enum _Rb_tree_color { _S_red = false, _S_black = true };
-<span class="lineNum">      91 </span>                : 
-<span class="lineNum">      92 </span>                :   struct _Rb_tree_node_base
-<span class="lineNum">      93 </span>                :   {
-<span class="lineNum">      94 </span>                :     typedef _Rb_tree_node_base* _Base_ptr;
-<span class="lineNum">      95 </span>                :     typedef const _Rb_tree_node_base* _Const_Base_ptr;
-<span class="lineNum">      96 </span>                : 
-<span class="lineNum">      97 </span>                :     _Rb_tree_color      _M_color;
-<span class="lineNum">      98 </span>                :     _Base_ptr           _M_parent;
-<span class="lineNum">      99 </span>                :     _Base_ptr           _M_left;
-<span class="lineNum">     100 </span>                :     _Base_ptr           _M_right;
-<span class="lineNum">     101 </span>                : 
-<span class="lineNum">     102 </span>                :     static _Base_ptr
-<span class="lineNum">     103 </span><span class="lineCov">         880633 :     _S_minimum(_Base_ptr __x)</span>
-<span class="lineNum">     104 </span>                :     {
-<span class="lineNum">     105 </span><span class="lineCov">         880633 :       while (__x-&gt;_M_left != 0) __x = __x-&gt;_M_left;</span>
-<span class="lineNum">     106 </span><span class="lineCov">         880633 :       return __x;</span>
-<span class="lineNum">     107 </span>                :     }
-<span class="lineNum">     108 </span>                : 
-<span class="lineNum">     109 </span>                :     static _Const_Base_ptr
-<span class="lineNum">     110 </span>                :     _S_minimum(_Const_Base_ptr __x)
-<span class="lineNum">     111 </span>                :     {
-<span class="lineNum">     112 </span>                :       while (__x-&gt;_M_left != 0) __x = __x-&gt;_M_left;
-<span class="lineNum">     113 </span>                :       return __x;
-<span class="lineNum">     114 </span>                :     }
-<span class="lineNum">     115 </span>                : 
-<span class="lineNum">     116 </span>                :     static _Base_ptr
-<span class="lineNum">     117 </span><span class="lineCov">         880633 :     _S_maximum(_Base_ptr __x)</span>
-<span class="lineNum">     118 </span>                :     {
-<span class="lineNum">     119 </span><span class="lineCov">         880633 :       while (__x-&gt;_M_right != 0) __x = __x-&gt;_M_right;</span>
-<span class="lineNum">     120 </span><span class="lineCov">         880633 :       return __x;</span>
-<span class="lineNum">     121 </span>                :     }
-<span class="lineNum">     122 </span>                : 
-<span class="lineNum">     123 </span>                :     static _Const_Base_ptr
-<span class="lineNum">     124 </span>                :     _S_maximum(_Const_Base_ptr __x)
-<span class="lineNum">     125 </span>                :     {
-<span class="lineNum">     126 </span>                :       while (__x-&gt;_M_right != 0) __x = __x-&gt;_M_right;
-<span class="lineNum">     127 </span>                :       return __x;
-<span class="lineNum">     128 </span>                :     }
-<span class="lineNum">     129 </span>                :   };
-<span class="lineNum">     130 </span>                : 
-<span class="lineNum">     131 </span>                :   template&lt;typename _Val&gt;
-<span class="lineNum">     132 </span>                :     struct _Rb_tree_node : public _Rb_tree_node_base
-<span class="lineNum">     133 </span>                :     {
-<span class="lineNum">     134 </span>                :       typedef _Rb_tree_node&lt;_Val&gt;* _Link_type;
-<span class="lineNum">     135 </span>                :       _Val _M_value_field;
-<span class="lineNum">     136 </span>                :     };
-<span class="lineNum">     137 </span>                : 
-<span class="lineNum">     138 </span>                :   _Rb_tree_node_base*
-<span class="lineNum">     139 </span>                :   _Rb_tree_increment(_Rb_tree_node_base* __x);
-<span class="lineNum">     140 </span>                : 
-<span class="lineNum">     141 </span>                :   const _Rb_tree_node_base*
-<span class="lineNum">     142 </span>                :   _Rb_tree_increment(const _Rb_tree_node_base* __x);
-<span class="lineNum">     143 </span>                : 
-<span class="lineNum">     144 </span>                :   _Rb_tree_node_base*
-<span class="lineNum">     145 </span>                :   _Rb_tree_decrement(_Rb_tree_node_base* __x);
-<span class="lineNum">     146 </span>                : 
-<span class="lineNum">     147 </span>                :   const _Rb_tree_node_base*
-<span class="lineNum">     148 </span>                :   _Rb_tree_decrement(const _Rb_tree_node_base* __x);
-<span class="lineNum">     149 </span>                : 
-<span class="lineNum">     150 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     151 </span>                :     struct _Rb_tree_iterator
-<span class="lineNum">     152 </span>                :     {
-<span class="lineNum">     153 </span>                :       typedef _Tp  value_type;
-<span class="lineNum">     154 </span>                :       typedef _Tp&amp; reference;
-<span class="lineNum">     155 </span>                :       typedef _Tp* pointer;
-<span class="lineNum">     156 </span>                : 
-<span class="lineNum">     157 </span>                :       typedef bidirectional_iterator_tag iterator_category;
-<span class="lineNum">     158 </span>                :       typedef ptrdiff_t                  difference_type;
-<span class="lineNum">     159 </span>                : 
-<span class="lineNum">     160 </span>                :       typedef _Rb_tree_iterator&lt;_Tp&gt;        _Self;
-<span class="lineNum">     161 </span>                :       typedef _Rb_tree_node_base::_Base_ptr _Base_ptr;
-<span class="lineNum">     162 </span>                :       typedef _Rb_tree_node&lt;_Tp&gt;*           _Link_type;
-<span class="lineNum">     163 </span>                : 
-<span class="lineNum">     164 </span>                :       _Rb_tree_iterator()
-<span class="lineNum">     165 </span>                :       : _M_node() { }
-<span class="lineNum">     166 </span>                : 
-<span class="lineNum">     167 </span>                :       explicit
-<span class="lineNum">     168 </span><span class="lineCov">        4550329 :       _Rb_tree_iterator(_Link_type __x)</span>
-<span class="lineNum">     169 </span><span class="lineCov">        4550329 :       : _M_node(__x) { }</span>
-<span class="lineNum">     170 </span>                : 
-<span class="lineNum">     171 </span>                :       reference
-<span class="lineNum">     172 </span><span class="lineCov">           9593 :       operator*() const</span>
-<span class="lineNum">     173 </span><span class="lineCov">           9593 :       { return static_cast&lt;_Link_type&gt;(_M_node)-&gt;_M_value_field; }</span>
-<span class="lineNum">     174 </span>                : 
-<span class="lineNum">     175 </span>                :       pointer
-<span class="lineNum">     176 </span><span class="lineCov">          32985 :       operator-&gt;() const</span>
-<span class="lineNum">     177 </span><span class="lineCov">          32985 :       { return &amp;static_cast&lt;_Link_type&gt;(_M_node)-&gt;_M_value_field; }</span>
-<span class="lineNum">     178 </span>                : 
-<span class="lineNum">     179 </span>                :       _Self&amp;
-<span class="lineNum">     180 </span>                :       operator++()
-<span class="lineNum">     181 </span>                :       {
-<span class="lineNum">     182 </span>                :         _M_node = _Rb_tree_increment(_M_node);
-<span class="lineNum">     183 </span>                :         return *this;
-<span class="lineNum">     184 </span>                :       }
-<span class="lineNum">     185 </span>                : 
-<span class="lineNum">     186 </span>                :       _Self
-<span class="lineNum">     187 </span><span class="lineCov">            658 :       operator++(int)</span>
-<span class="lineNum">     188 </span>                :       {
-<span class="lineNum">     189 </span><span class="lineCov">            658 :         _Self __tmp = *this;</span>
-<span class="lineNum">     190 </span><span class="lineCov">            658 :         _M_node = _Rb_tree_increment(_M_node);</span>
-<span class="lineNum">     191 </span>                :         return __tmp;
-<span class="lineNum">     192 </span>                :       }
-<span class="lineNum">     193 </span>                : 
-<span class="lineNum">     194 </span>                :       _Self&amp;
-<span class="lineNum">     195 </span><span class="lineCov">          83333 :       operator--()</span>
-<span class="lineNum">     196 </span>                :       {
-<span class="lineNum">     197 </span><span class="lineCov">          83333 :         _M_node = _Rb_tree_decrement(_M_node);</span>
-<span class="lineNum">     198 </span><span class="lineCov">          83333 :         return *this;</span>
-<span class="lineNum">     199 </span>                :       }
-<span class="lineNum">     200 </span>                : 
-<span class="lineNum">     201 </span>                :       _Self
-<span class="lineNum">     202 </span>                :       operator--(int)
-<span class="lineNum">     203 </span>                :       {
-<span class="lineNum">     204 </span>                :         _Self __tmp = *this;
-<span class="lineNum">     205 </span>                :         _M_node = _Rb_tree_decrement(_M_node);
-<span class="lineNum">     206 </span>                :         return __tmp;
-<span class="lineNum">     207 </span>                :       }
-<span class="lineNum">     208 </span>                : 
-<span class="lineNum">     209 </span>                :       bool
-<span class="lineNum">     210 </span><span class="lineCov">         638793 :       operator==(const _Self&amp; __x) const</span>
-<span class="lineNum">     211 </span><span class="lineCov">         638793 :       { return _M_node == __x._M_node; }</span>
-<span class="lineNum">     212 </span>                : 
-<span class="lineNum">     213 </span>                :       bool
-<span class="lineNum">     214 </span><span class="lineCov">            749 :       operator!=(const _Self&amp; __x) const</span>
-<span class="lineNum">     215 </span><span class="lineCov">            749 :       { return _M_node != __x._M_node; }</span>
-<span class="lineNum">     216 </span>                : 
-<span class="lineNum">     217 </span>                :       _Base_ptr _M_node;
-<span class="lineNum">     218 </span>                :   };
-<span class="lineNum">     219 </span>                : 
-<span class="lineNum">     220 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     221 </span>                :     struct _Rb_tree_const_iterator
-<span class="lineNum">     222 </span>                :     {
-<span class="lineNum">     223 </span>                :       typedef _Tp        value_type;
-<span class="lineNum">     224 </span>                :       typedef const _Tp&amp; reference;
-<span class="lineNum">     225 </span>                :       typedef const _Tp* pointer;
-<span class="lineNum">     226 </span>                : 
-<span class="lineNum">     227 </span>                :       typedef _Rb_tree_iterator&lt;_Tp&gt; iterator;
-<span class="lineNum">     228 </span>                : 
-<span class="lineNum">     229 </span>                :       typedef bidirectional_iterator_tag iterator_category;
-<span class="lineNum">     230 </span>                :       typedef ptrdiff_t                  difference_type;
-<span class="lineNum">     231 </span>                : 
-<span class="lineNum">     232 </span>                :       typedef _Rb_tree_const_iterator&lt;_Tp&gt;        _Self;
-<span class="lineNum">     233 </span>                :       typedef _Rb_tree_node_base::_Const_Base_ptr _Base_ptr;
-<span class="lineNum">     234 </span>                :       typedef const _Rb_tree_node&lt;_Tp&gt;*           _Link_type;
-<span class="lineNum">     235 </span>                : 
-<span class="lineNum">     236 </span>                :       _Rb_tree_const_iterator()
-<span class="lineNum">     237 </span>                :       : _M_node() { }
-<span class="lineNum">     238 </span>                : 
-<span class="lineNum">     239 </span>                :       explicit
-<span class="lineNum">     240 </span><span class="lineCov">        2494703 :       _Rb_tree_const_iterator(_Link_type __x)</span>
-<span class="lineNum">     241 </span><span class="lineCov">        2494703 :       : _M_node(__x) { }</span>
-<span class="lineNum">     242 </span>                : 
-<span class="lineNum">     243 </span><span class="lineCov">        1643427 :       _Rb_tree_const_iterator(const iterator&amp; __it)</span>
-<span class="lineNum">     244 </span><span class="lineCov">        1643427 :       : _M_node(__it._M_node) { }</span>
-<span class="lineNum">     245 </span>                : 
-<span class="lineNum">     246 </span>                :       reference
-<span class="lineNum">     247 </span><span class="lineCov">        1553025 :       operator*() const</span>
-<span class="lineNum">     248 </span><span class="lineCov">        1553025 :       { return static_cast&lt;_Link_type&gt;(_M_node)-&gt;_M_value_field; }</span>
-<span class="lineNum">     249 </span>                : 
-<span class="lineNum">     250 </span>                :       pointer
-<span class="lineNum">     251 </span><span class="lineCov">         817027 :       operator-&gt;() const</span>
-<span class="lineNum">     252 </span><span class="lineCov">         817027 :       { return &amp;static_cast&lt;_Link_type&gt;(_M_node)-&gt;_M_value_field; }</span>
-<span class="lineNum">     253 </span>                : 
-<span class="lineNum">     254 </span>                :       _Self&amp;
-<span class="lineNum">     255 </span><span class="lineCov">        1717591 :       operator++()</span>
-<span class="lineNum">     256 </span>                :       {
-<span class="lineNum">     257 </span><span class="lineCov">        1717591 :         _M_node = _Rb_tree_increment(_M_node);</span>
-<span class="lineNum">     258 </span><span class="lineCov">        1717591 :         return *this;</span>
-<span class="lineNum">     259 </span>                :       }
-<span class="lineNum">     260 </span>                : 
-<span class="lineNum">     261 </span>                :       _Self
-<span class="lineNum">     262 </span><span class="lineCov">           9048 :       operator++(int)</span>
-<span class="lineNum">     263 </span>                :       {
-<span class="lineNum">     264 </span><span class="lineCov">           9048 :         _Self __tmp = *this;</span>
-<span class="lineNum">     265 </span><span class="lineCov">           9048 :         _M_node = _Rb_tree_increment(_M_node);</span>
-<span class="lineNum">     266 </span>                :         return __tmp;
-<span class="lineNum">     267 </span>                :       }
-<span class="lineNum">     268 </span>                : 
-<span class="lineNum">     269 </span>                :       _Self&amp;
-<span class="lineNum">     270 </span><span class="lineCov">           2000 :       operator--()</span>
-<span class="lineNum">     271 </span>                :       {
-<span class="lineNum">     272 </span><span class="lineCov">           2000 :         _M_node = _Rb_tree_decrement(_M_node);</span>
-<span class="lineNum">     273 </span><span class="lineCov">           2000 :         return *this;</span>
-<span class="lineNum">     274 </span>                :       }
-<span class="lineNum">     275 </span>                : 
-<span class="lineNum">     276 </span>                :       _Self
-<span class="lineNum">     277 </span>                :       operator--(int)
-<span class="lineNum">     278 </span>                :       {
-<span class="lineNum">     279 </span>                :         _Self __tmp = *this;
-<span class="lineNum">     280 </span>                :         _M_node = _Rb_tree_decrement(_M_node);
-<span class="lineNum">     281 </span>                :         return __tmp;
-<span class="lineNum">     282 </span>                :       }
-<span class="lineNum">     283 </span>                : 
-<span class="lineNum">     284 </span>                :       bool
-<span class="lineNum">     285 </span><span class="lineCov">         177758 :       operator==(const _Self&amp; __x) const</span>
-<span class="lineNum">     286 </span><span class="lineCov">         177758 :       { return _M_node == __x._M_node; }</span>
-<span class="lineNum">     287 </span>                : 
-<span class="lineNum">     288 </span>                :       bool
-<span class="lineNum">     289 </span><span class="lineCov">        2095612 :       operator!=(const _Self&amp; __x) const</span>
-<span class="lineNum">     290 </span><span class="lineCov">        2095612 :       { return _M_node != __x._M_node; }</span>
-<span class="lineNum">     291 </span>                : 
-<span class="lineNum">     292 </span>                :       _Base_ptr _M_node;
-<span class="lineNum">     293 </span>                :     };
-<span class="lineNum">     294 </span>                : 
-<span class="lineNum">     295 </span>                :   template&lt;typename _Val&gt;
-<span class="lineNum">     296 </span>                :     inline bool
-<span class="lineNum">     297 </span>                :     operator==(const _Rb_tree_iterator&lt;_Val&gt;&amp; __x,
-<span class="lineNum">     298 </span>                :                const _Rb_tree_const_iterator&lt;_Val&gt;&amp; __y)
-<span class="lineNum">     299 </span>                :     { return __x._M_node == __y._M_node; }
-<span class="lineNum">     300 </span>                : 
-<span class="lineNum">     301 </span>                :   template&lt;typename _Val&gt;
-<span class="lineNum">     302 </span>                :     inline bool
-<span class="lineNum">     303 </span>                :     operator!=(const _Rb_tree_iterator&lt;_Val&gt;&amp; __x,
-<span class="lineNum">     304 </span>                :                const _Rb_tree_const_iterator&lt;_Val&gt;&amp; __y)
-<span class="lineNum">     305 </span>                :     { return __x._M_node != __y._M_node; }
-<span class="lineNum">     306 </span>                : 
-<span class="lineNum">     307 </span>                :   void
-<span class="lineNum">     308 </span>                :   _Rb_tree_insert_and_rebalance(const bool __insert_left,
-<span class="lineNum">     309 </span>                :                                 _Rb_tree_node_base* __x,
-<span class="lineNum">     310 </span>                :                                 _Rb_tree_node_base* __p,
-<span class="lineNum">     311 </span>                :                                 _Rb_tree_node_base&amp; __header);
-<span class="lineNum">     312 </span>                : 
-<span class="lineNum">     313 </span>                :   _Rb_tree_node_base*
-<span class="lineNum">     314 </span>                :   _Rb_tree_rebalance_for_erase(_Rb_tree_node_base* const __z,
-<span class="lineNum">     315 </span>                :                                _Rb_tree_node_base&amp; __header);
-<span class="lineNum">     316 </span>                : 
-<span class="lineNum">     317 </span>                : 
-<span class="lineNum">     318 </span>                :   template&lt;typename _Key, typename _Val, typename _KeyOfValue,
-<span class="lineNum">     319 </span>                :            typename _Compare, typename _Alloc = allocator&lt;_Val&gt; &gt;
-<span class="lineNum">     320 </span>                :     class _Rb_tree
-<span class="lineNum">     321 </span>                :     {
-<span class="lineNum">     322 </span>                :       typedef typename _Alloc::template rebind&lt;_Rb_tree_node&lt;_Val&gt; &gt;::other
-<span class="lineNum">     323 </span>                :               _Node_allocator;
-<span class="lineNum">     324 </span>                : 
-<span class="lineNum">     325 </span>                :     protected:
-<span class="lineNum">     326 </span>                :       typedef _Rb_tree_node_base* _Base_ptr;
-<span class="lineNum">     327 </span>                :       typedef const _Rb_tree_node_base* _Const_Base_ptr;
-<span class="lineNum">     328 </span>                : 
-<span class="lineNum">     329 </span>                :     public:
-<span class="lineNum">     330 </span>                :       typedef _Key key_type;
-<span class="lineNum">     331 </span>                :       typedef _Val value_type;
-<span class="lineNum">     332 </span>                :       typedef value_type* pointer;
-<span class="lineNum">     333 </span>                :       typedef const value_type* const_pointer;
-<span class="lineNum">     334 </span>                :       typedef value_type&amp; reference;
-<span class="lineNum">     335 </span>                :       typedef const value_type&amp; const_reference;
-<span class="lineNum">     336 </span>                :       typedef _Rb_tree_node&lt;_Val&gt;* _Link_type;
-<span class="lineNum">     337 </span>                :       typedef const _Rb_tree_node&lt;_Val&gt;* _Const_Link_type;
-<span class="lineNum">     338 </span>                :       typedef size_t size_type;
-<span class="lineNum">     339 </span>                :       typedef ptrdiff_t difference_type;
-<span class="lineNum">     340 </span>                :       typedef _Alloc allocator_type;
-<span class="lineNum">     341 </span>                : 
-<span class="lineNum">     342 </span>                :       _Node_allocator&amp;
-<span class="lineNum">     343 </span>                :       _M_get_Node_allocator()
-<span class="lineNum">     344 </span>                :       { return *static_cast&lt;_Node_allocator*&gt;(&amp;this-&gt;_M_impl); }
-<span class="lineNum">     345 </span>                :       
-<span class="lineNum">     346 </span>                :       const _Node_allocator&amp;
-<span class="lineNum">     347 </span><span class="lineCov">       12223942 :       _M_get_Node_allocator() const</span>
-<span class="lineNum">     348 </span><span class="lineCov">       12223942 :       { return *static_cast&lt;const _Node_allocator*&gt;(&amp;this-&gt;_M_impl); }</span>
-<span class="lineNum">     349 </span>                : 
-<span class="lineNum">     350 </span>                :       allocator_type
-<span class="lineNum">     351 </span><span class="lineCov">       11289346 :       get_allocator() const</span>
-<span class="lineNum">     352 </span><span class="lineCov">       11289346 :       { return allocator_type(_M_get_Node_allocator()); }</span>
-<span class="lineNum">     353 </span>                : 
-<span class="lineNum">     354 </span>                :     protected:
-<span class="lineNum">     355 </span>                :       _Link_type
-<span class="lineNum">     356 </span><span class="lineCov">        5644688 :       _M_get_node()</span>
-<span class="lineNum">     357 </span><span class="lineCov">        5644688 :       { return _M_impl._Node_allocator::allocate(1); }</span>
-<span class="lineNum">     358 </span>                : 
-<span class="lineNum">     359 </span>                :       void
-<span class="lineNum">     360 </span><span class="lineCov">        5644658 :       _M_put_node(_Link_type __p)</span>
-<span class="lineNum">     361 </span><span class="lineCov">        5644658 :       { _M_impl._Node_allocator::deallocate(__p, 1); }</span>
-<span class="lineNum">     362 </span>                : 
-<span class="lineNum">     363 </span>                :       _Link_type
-<span class="lineNum">     364 </span><span class="lineCov">        5644688 :       _M_create_node(const value_type&amp; __x)</span>
-<span class="lineNum">     365 </span>                :       {
-<span class="lineNum">     366 </span><span class="lineCov">        5644688 :         _Link_type __tmp = _M_get_node();</span>
-<span class="lineNum">     367 </span>                :         try
-<span class="lineNum">     368 </span><span class="lineCov">        5644688 :           { get_allocator().construct(&amp;__tmp-&gt;_M_value_field, __x); }</span>
-<span class="lineNum">     369 </span><span class="lineNoCov">              0 :         catch(...)</span>
-<span class="lineNum">     370 </span>                :           {
-<span class="lineNum">     371 </span><span class="lineNoCov">              0 :             _M_put_node(__tmp);</span>
-<span class="lineNum">     372 </span><span class="lineNoCov">              0 :             __throw_exception_again;</span>
-<span class="lineNum">     373 </span>                :           }
-<span class="lineNum">     374 </span><span class="lineCov">        5644688 :         return __tmp;</span>
-<span class="lineNum">     375 </span>                :       }
-<span class="lineNum">     376 </span>                : 
-<span class="lineNum">     377 </span>                :       _Link_type
-<span class="lineNum">     378 </span><span class="lineCov">        3573982 :       _M_clone_node(_Const_Link_type __x)</span>
-<span class="lineNum">     379 </span>                :       {
-<span class="lineNum">     380 </span><span class="lineCov">        3573982 :         _Link_type __tmp = _M_create_node(__x-&gt;_M_value_field);</span>
-<span class="lineNum">     381 </span><span class="lineCov">        3573982 :         __tmp-&gt;_M_color = __x-&gt;_M_color;</span>
-<span class="lineNum">     382 </span><span class="lineCov">        3573982 :         __tmp-&gt;_M_left = 0;</span>
-<span class="lineNum">     383 </span><span class="lineCov">        3573982 :         __tmp-&gt;_M_right = 0;</span>
-<span class="lineNum">     384 </span><span class="lineCov">        3573982 :         return __tmp;</span>
-<span class="lineNum">     385 </span>                :       }
-<span class="lineNum">     386 </span>                : 
-<span class="lineNum">     387 </span>                :       void
-<span class="lineNum">     388 </span><span class="lineCov">        5644658 :       _M_destroy_node(_Link_type __p)</span>
-<span class="lineNum">     389 </span>                :       {
-<span class="lineNum">     390 </span><span class="lineCov">        5644658 :         get_allocator().destroy(&amp;__p-&gt;_M_value_field);</span>
-<span class="lineNum">     391 </span><span class="lineCov">        5644658 :         _M_put_node(__p);</span>
-<span class="lineNum">     392 </span><span class="lineCov">        5644658 :       }</span>
-<span class="lineNum">     393 </span>                : 
-<span class="lineNum">     394 </span>                :     protected:
-<span class="lineNum">     395 </span>                :       template&lt;typename _Key_compare, 
-<span class="lineNum">     396 </span>                :                bool _Is_pod_comparator = __is_pod(_Key_compare)&gt;
-<span class="lineNum">     397 </span>                :         struct _Rb_tree_impl : public _Node_allocator
-<span class="lineNum">     398 </span><span class="lineCov">        1320929 :         {</span>
-<span class="lineNum">     399 </span>                :           _Key_compare          _M_key_compare;
-<span class="lineNum">     400 </span>                :           _Rb_tree_node_base    _M_header;
-<span class="lineNum">     401 </span>                :           size_type             _M_node_count; // Keeps track of size of tree.
-<span class="lineNum">     402 </span>                : 
-<span class="lineNum">     403 </span><span class="lineCov">         280599 :           _Rb_tree_impl()</span>
-<span class="lineNum">     404 </span>                :           : _Node_allocator(), _M_key_compare(), _M_header(),
-<span class="lineNum">     405 </span><span class="lineCov">         280599 :             _M_node_count(0)</span>
-<span class="lineNum">     406 </span><span class="lineCov">         280599 :           { _M_initialize(); }</span>
-<span class="lineNum">     407 </span>                : 
-<span class="lineNum">     408 </span><span class="lineCov">         934596 :           _Rb_tree_impl(const _Key_compare&amp; __comp, const _Node_allocator&amp; __a)</span>
-<span class="lineNum">     409 </span>                :           : _Node_allocator(__a), _M_key_compare(__comp), _M_header(),
-<span class="lineNum">     410 </span><span class="lineCov">         934596 :             _M_node_count(0)</span>
-<span class="lineNum">     411 </span><span class="lineCov">         934596 :           { _M_initialize(); }</span>
-<span class="lineNum">     412 </span>                : 
-<span class="lineNum">     413 </span>                :         private:
-<span class="lineNum">     414 </span>                :           void
-<span class="lineNum">     415 </span><span class="lineCov">        1215195 :           _M_initialize()</span>
-<span class="lineNum">     416 </span>                :           {
-<span class="lineNum">     417 </span><span class="lineCov">        1215195 :             this-&gt;_M_header._M_color = _S_red;</span>
-<span class="lineNum">     418 </span><span class="lineCov">        1215195 :             this-&gt;_M_header._M_parent = 0;</span>
-<span class="lineNum">     419 </span><span class="lineCov">        1215195 :             this-&gt;_M_header._M_left = &amp;this-&gt;_M_header;</span>
-<span class="lineNum">     420 </span><span class="lineCov">        1215195 :             this-&gt;_M_header._M_right = &amp;this-&gt;_M_header;</span>
-<span class="lineNum">     421 </span><span class="lineCov">        1215195 :           }         </span>
-<span class="lineNum">     422 </span>                :         };
-<span class="lineNum">     423 </span>                : 
-<span class="lineNum">     424 </span>                :       _Rb_tree_impl&lt;_Compare&gt; _M_impl;
-<span class="lineNum">     425 </span>                : 
-<span class="lineNum">     426 </span>                :     protected:
-<span class="lineNum">     427 </span>                :       _Base_ptr&amp;
-<span class="lineNum">     428 </span><span class="lineCov">        2729891 :       _M_root()</span>
-<span class="lineNum">     429 </span><span class="lineCov">        2729891 :       { return this-&gt;_M_impl._M_header._M_parent; }</span>
-<span class="lineNum">     430 </span>                : 
-<span class="lineNum">     431 </span>                :       _Const_Base_ptr
-<span class="lineNum">     432 </span><span class="lineCov">         934693 :       _M_root() const</span>
-<span class="lineNum">     433 </span><span class="lineCov">         934693 :       { return this-&gt;_M_impl._M_header._M_parent; }</span>
-<span class="lineNum">     434 </span>                : 
-<span class="lineNum">     435 </span>                :       _Base_ptr&amp;
-<span class="lineNum">     436 </span><span class="lineCov">         970809 :       _M_leftmost()</span>
-<span class="lineNum">     437 </span><span class="lineCov">         970809 :       { return this-&gt;_M_impl._M_header._M_left; }</span>
-<span class="lineNum">     438 </span>                : 
-<span class="lineNum">     439 </span>                :       _Const_Base_ptr
-<span class="lineNum">     440 </span>                :       _M_leftmost() const
-<span class="lineNum">     441 </span>                :       { return this-&gt;_M_impl._M_header._M_left; }
-<span class="lineNum">     442 </span>                : 
-<span class="lineNum">     443 </span>                :       _Base_ptr&amp;
-<span class="lineNum">     444 </span><span class="lineCov">        2012568 :       _M_rightmost()</span>
-<span class="lineNum">     445 </span><span class="lineCov">        2012568 :       { return this-&gt;_M_impl._M_header._M_right; }</span>
-<span class="lineNum">     446 </span>                : 
-<span class="lineNum">     447 </span>                :       _Const_Base_ptr
-<span class="lineNum">     448 </span>                :       _M_rightmost() const
-<span class="lineNum">     449 </span>                :       { return this-&gt;_M_impl._M_header._M_right; }
-<span class="lineNum">     450 </span>                : 
-<span class="lineNum">     451 </span>                :       _Link_type
-<span class="lineNum">     452 </span><span class="lineCov">        3119123 :       _M_begin()</span>
-<span class="lineNum">     453 </span><span class="lineCov">        3119123 :       { return static_cast&lt;_Link_type&gt;(this-&gt;_M_impl._M_header._M_parent); }</span>
-<span class="lineNum">     454 </span>                : 
-<span class="lineNum">     455 </span>                :       _Const_Link_type
-<span class="lineNum">     456 </span><span class="lineCov">         884565 :       _M_begin() const</span>
-<span class="lineNum">     457 </span>                :       {
-<span class="lineNum">     458 </span>                :         return static_cast&lt;_Const_Link_type&gt;
-<span class="lineNum">     459 </span><span class="lineCov">         884565 :           (this-&gt;_M_impl._M_header._M_parent);</span>
-<span class="lineNum">     460 </span>                :       }
-<span class="lineNum">     461 </span>                : 
-<span class="lineNum">     462 </span>                :       _Link_type
-<span class="lineNum">     463 </span><span class="lineCov">        5489610 :       _M_end()</span>
-<span class="lineNum">     464 </span><span class="lineCov">        5489610 :       { return static_cast&lt;_Link_type&gt;(&amp;this-&gt;_M_impl._M_header); }</span>
-<span class="lineNum">     465 </span>                : 
-<span class="lineNum">     466 </span>                :       _Const_Link_type
-<span class="lineNum">     467 </span><span class="lineCov">           3932 :       _M_end() const</span>
-<span class="lineNum">     468 </span><span class="lineCov">           3932 :       { return static_cast&lt;_Const_Link_type&gt;(&amp;this-&gt;_M_impl._M_header); }</span>
-<span class="lineNum">     469 </span>                : 
-<span class="lineNum">     470 </span>                :       static const_reference
-<span class="lineNum">     471 </span><span class="lineCov">        7342455 :       _S_value(_Const_Link_type __x)</span>
-<span class="lineNum">     472 </span><span class="lineCov">        7342455 :       { return __x-&gt;_M_value_field; }</span>
-<span class="lineNum">     473 </span>                : 
-<span class="lineNum">     474 </span>                :       static const _Key&amp;
-<span class="lineNum">     475 </span><span class="lineCov">        7342455 :       _S_key(_Const_Link_type __x)</span>
-<span class="lineNum">     476 </span><span class="lineCov">        7342455 :       { return _KeyOfValue()(_S_value(__x)); }</span>
-<span class="lineNum">     477 </span>                : 
-<span class="lineNum">     478 </span>                :       static _Link_type
-<span class="lineNum">     479 </span><span class="lineCov">        6468290 :       _S_left(_Base_ptr __x)</span>
-<span class="lineNum">     480 </span><span class="lineCov">        6468290 :       { return static_cast&lt;_Link_type&gt;(__x-&gt;_M_left); }</span>
-<span class="lineNum">     481 </span>                : 
-<span class="lineNum">     482 </span>                :       static _Const_Link_type
-<span class="lineNum">     483 </span><span class="lineCov">        3579867 :       _S_left(_Const_Base_ptr __x)</span>
-<span class="lineNum">     484 </span><span class="lineCov">        3579867 :       { return static_cast&lt;_Const_Link_type&gt;(__x-&gt;_M_left); }</span>
-<span class="lineNum">     485 </span>                : 
-<span class="lineNum">     486 </span>                :       static _Link_type
-<span class="lineNum">     487 </span><span class="lineCov">       12155056 :       _S_right(_Base_ptr __x)</span>
-<span class="lineNum">     488 </span><span class="lineCov">       12155056 :       { return static_cast&lt;_Link_type&gt;(__x-&gt;_M_right); }</span>
-<span class="lineNum">     489 </span>                : 
-<span class="lineNum">     490 </span>                :       static _Const_Link_type
-<span class="lineNum">     491 </span><span class="lineCov">        1503831 :       _S_right(_Const_Base_ptr __x)</span>
-<span class="lineNum">     492 </span><span class="lineCov">        1503831 :       { return static_cast&lt;_Const_Link_type&gt;(__x-&gt;_M_right); }</span>
-<span class="lineNum">     493 </span>                : 
-<span class="lineNum">     494 </span>                :       static const_reference
-<span class="lineNum">     495 </span><span class="lineCov">        3381491 :       _S_value(_Const_Base_ptr __x)</span>
-<span class="lineNum">     496 </span><span class="lineCov">        3381491 :       { return static_cast&lt;_Const_Link_type&gt;(__x)-&gt;_M_value_field; }</span>
-<span class="lineNum">     497 </span>                : 
-<span class="lineNum">     498 </span>                :       static const _Key&amp;
-<span class="lineNum">     499 </span><span class="lineCov">        3381491 :       _S_key(_Const_Base_ptr __x)</span>
-<span class="lineNum">     500 </span><span class="lineCov">        3381491 :       { return _KeyOfValue()(_S_value(__x)); }</span>
-<span class="lineNum">     501 </span>                : 
-<span class="lineNum">     502 </span>                :       static _Base_ptr
-<span class="lineNum">     503 </span><span class="lineCov">         880633 :       _S_minimum(_Base_ptr __x)</span>
-<span class="lineNum">     504 </span><span class="lineCov">         880633 :       { return _Rb_tree_node_base::_S_minimum(__x); }</span>
-<span class="lineNum">     505 </span>                : 
-<span class="lineNum">     506 </span>                :       static _Const_Base_ptr
-<span class="lineNum">     507 </span>                :       _S_minimum(_Const_Base_ptr __x)
-<span class="lineNum">     508 </span>                :       { return _Rb_tree_node_base::_S_minimum(__x); }
-<span class="lineNum">     509 </span>                : 
-<span class="lineNum">     510 </span>                :       static _Base_ptr
-<span class="lineNum">     511 </span><span class="lineCov">         880633 :       _S_maximum(_Base_ptr __x)</span>
-<span class="lineNum">     512 </span><span class="lineCov">         880633 :       { return _Rb_tree_node_base::_S_maximum(__x); }</span>
-<span class="lineNum">     513 </span>                : 
-<span class="lineNum">     514 </span>                :       static _Const_Base_ptr
-<span class="lineNum">     515 </span>                :       _S_maximum(_Const_Base_ptr __x)
-<span class="lineNum">     516 </span>                :       { return _Rb_tree_node_base::_S_maximum(__x); }
-<span class="lineNum">     517 </span>                : 
-<span class="lineNum">     518 </span>                :     public:
-<span class="lineNum">     519 </span>                :       typedef _Rb_tree_iterator&lt;value_type&gt;       iterator;
-<span class="lineNum">     520 </span>                :       typedef _Rb_tree_const_iterator&lt;value_type&gt; const_iterator;
-<span class="lineNum">     521 </span>                : 
-<span class="lineNum">     522 </span>                :       typedef std::reverse_iterator&lt;iterator&gt;       reverse_iterator;
-<span class="lineNum">     523 </span>                :       typedef std::reverse_iterator&lt;const_iterator&gt; const_reverse_iterator;
-<span class="lineNum">     524 </span>                : 
-<span class="lineNum">     525 </span>                :     private:
-<span class="lineNum">     526 </span>                :       iterator
-<span class="lineNum">     527 </span>                :       _M_insert_(_Const_Base_ptr __x, _Const_Base_ptr __y,
-<span class="lineNum">     528 </span>                :                  const value_type&amp; __v);
-<span class="lineNum">     529 </span>                : 
-<span class="lineNum">     530 </span>                :       // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     531 </span>                :       // 233. Insertion hints in associative containers.
-<span class="lineNum">     532 </span>                :       iterator
-<span class="lineNum">     533 </span>                :       _M_insert_lower(_Base_ptr __x, _Base_ptr __y, const value_type&amp; __v);
-<span class="lineNum">     534 </span>                : 
-<span class="lineNum">     535 </span>                :       iterator
-<span class="lineNum">     536 </span>                :       _M_insert_equal_lower(const value_type&amp; __x);
-<span class="lineNum">     537 </span>                : 
-<span class="lineNum">     538 </span>                :       _Link_type
-<span class="lineNum">     539 </span>                :       _M_copy(_Const_Link_type __x, _Link_type __p);
-<span class="lineNum">     540 </span>                : 
-<span class="lineNum">     541 </span>                :       void
-<span class="lineNum">     542 </span>                :       _M_erase(_Link_type __x);
-<span class="lineNum">     543 </span>                : 
-<span class="lineNum">     544 </span>                :       iterator
-<span class="lineNum">     545 </span>                :       _M_lower_bound(_Link_type __x, _Link_type __y,
-<span class="lineNum">     546 </span>                :                      const _Key&amp; __k);
-<span class="lineNum">     547 </span>                : 
-<span class="lineNum">     548 </span>                :       const_iterator
-<span class="lineNum">     549 </span>                :       _M_lower_bound(_Const_Link_type __x, _Const_Link_type __y,
-<span class="lineNum">     550 </span>                :                      const _Key&amp; __k) const;
-<span class="lineNum">     551 </span>                : 
-<span class="lineNum">     552 </span>                :       iterator
-<span class="lineNum">     553 </span>                :       _M_upper_bound(_Link_type __x, _Link_type __y,
-<span class="lineNum">     554 </span>                :                      const _Key&amp; __k);
-<span class="lineNum">     555 </span>                : 
-<span class="lineNum">     556 </span>                :       const_iterator
-<span class="lineNum">     557 </span>                :       _M_upper_bound(_Const_Link_type __x, _Const_Link_type __y,
-<span class="lineNum">     558 </span>                :                      const _Key&amp; __k) const;
-<span class="lineNum">     559 </span>                : 
-<span class="lineNum">     560 </span>                :     public:
-<span class="lineNum">     561 </span>                :       // allocation/deallocation
-<span class="lineNum">     562 </span><span class="lineCov">         280599 :       _Rb_tree() { }</span>
-<span class="lineNum">     563 </span>                : 
-<span class="lineNum">     564 </span>                :       _Rb_tree(const _Compare&amp; __comp,
-<span class="lineNum">     565 </span>                :                const allocator_type&amp; __a = allocator_type())
-<span class="lineNum">     566 </span>                :       : _M_impl(__comp, __a) { }
-<span class="lineNum">     567 </span>                : 
-<span class="lineNum">     568 </span><span class="lineCov">         934596 :       _Rb_tree(const _Rb_tree&amp; __x)</span>
-<span class="lineNum">     569 </span><span class="lineCov">         934596 :       : _M_impl(__x._M_impl._M_key_compare, __x._M_get_Node_allocator())</span>
-<span class="lineNum">     570 </span>                :       {
-<span class="lineNum">     571 </span><span class="lineCov">         934596 :         if (__x._M_root() != 0)</span>
-<span class="lineNum">     572 </span>                :           {
-<span class="lineNum">     573 </span><span class="lineCov">         880580 :             _M_root() = _M_copy(__x._M_begin(), _M_end());</span>
-<span class="lineNum">     574 </span><span class="lineCov">         880580 :             _M_leftmost() = _S_minimum(_M_root());</span>
-<span class="lineNum">     575 </span><span class="lineCov">         880580 :             _M_rightmost() = _S_maximum(_M_root());</span>
-<span class="lineNum">     576 </span><span class="lineCov">         880580 :             _M_impl._M_node_count = __x._M_impl._M_node_count;</span>
-<span class="lineNum">     577 </span>                :           }
-<span class="lineNum">     578 </span><span class="lineCov">         934596 :       }</span>
-<span class="lineNum">     579 </span>                : 
-<span class="lineNum">     580 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     581 </span>                :       _Rb_tree(_Rb_tree&amp;&amp; __x);
-<span class="lineNum">     582 </span>                : #endif
-<span class="lineNum">     583 </span>                : 
-<span class="lineNum">     584 </span><span class="lineCov">        1320929 :       ~_Rb_tree()</span>
-<span class="lineNum">     585 </span><span class="lineCov">        1320929 :       { _M_erase(_M_begin()); }</span>
-<span class="lineNum">     586 </span>                : 
-<span class="lineNum">     587 </span>                :       _Rb_tree&amp;
-<span class="lineNum">     588 </span>                :       operator=(const _Rb_tree&amp; __x);
-<span class="lineNum">     589 </span>                : 
-<span class="lineNum">     590 </span>                :       // Accessors.
-<span class="lineNum">     591 </span>                :       _Compare
-<span class="lineNum">     592 </span><span class="lineCov">           3296 :       key_comp() const</span>
-<span class="lineNum">     593 </span><span class="lineCov">           3296 :       { return _M_impl._M_key_compare; }</span>
-<span class="lineNum">     594 </span>                : 
-<span class="lineNum">     595 </span>                :       iterator
-<span class="lineNum">     596 </span><span class="lineCov">         538878 :       begin()</span>
-<span class="lineNum">     597 </span>                :       { 
-<span class="lineNum">     598 </span>                :         return iterator(static_cast&lt;_Link_type&gt;
-<span class="lineNum">     599 </span><span class="lineCov">         538878 :                         (this-&gt;_M_impl._M_header._M_left));</span>
-<span class="lineNum">     600 </span>                :       }
-<span class="lineNum">     601 </span>                : 
-<span class="lineNum">     602 </span>                :       const_iterator
-<span class="lineNum">     603 </span><span class="lineCov">         468185 :       begin() const</span>
-<span class="lineNum">     604 </span>                :       { 
-<span class="lineNum">     605 </span>                :         return const_iterator(static_cast&lt;_Const_Link_type&gt;
-<span class="lineNum">     606 </span><span class="lineCov">         468185 :                               (this-&gt;_M_impl._M_header._M_left));</span>
-<span class="lineNum">     607 </span>                :       }
-<span class="lineNum">     608 </span>                : 
-<span class="lineNum">     609 </span>                :       iterator
-<span class="lineNum">     610 </span><span class="lineCov">         230534 :       end()</span>
-<span class="lineNum">     611 </span><span class="lineCov">         230534 :       { return iterator(static_cast&lt;_Link_type&gt;(&amp;this-&gt;_M_impl._M_header)); }</span>
-<span class="lineNum">     612 </span>                : 
-<span class="lineNum">     613 </span>                :       const_iterator
-<span class="lineNum">     614 </span><span class="lineCov">        2022586 :       end() const</span>
-<span class="lineNum">     615 </span>                :       { 
-<span class="lineNum">     616 </span>                :         return const_iterator(static_cast&lt;_Const_Link_type&gt;
-<span class="lineNum">     617 </span><span class="lineCov">        2022586 :                               (&amp;this-&gt;_M_impl._M_header));</span>
-<span class="lineNum">     618 </span>                :       }
-<span class="lineNum">     619 </span>                : 
-<span class="lineNum">     620 </span>                :       reverse_iterator
-<span class="lineNum">     621 </span>                :       rbegin()
-<span class="lineNum">     622 </span>                :       { return reverse_iterator(end()); }
-<span class="lineNum">     623 </span>                : 
-<span class="lineNum">     624 </span>                :       const_reverse_iterator
-<span class="lineNum">     625 </span><span class="lineCov">             32 :       rbegin() const</span>
-<span class="lineNum">     626 </span><span class="lineCov">             32 :       { return const_reverse_iterator(end()); }</span>
-<span class="lineNum">     627 </span>                : 
-<span class="lineNum">     628 </span>                :       reverse_iterator
-<span class="lineNum">     629 </span>                :       rend()
-<span class="lineNum">     630 </span>                :       { return reverse_iterator(begin()); }
-<span class="lineNum">     631 </span>                : 
-<span class="lineNum">     632 </span>                :       const_reverse_iterator
-<span class="lineNum">     633 </span>                :       rend() const
-<span class="lineNum">     634 </span>                :       { return const_reverse_iterator(begin()); }
-<span class="lineNum">     635 </span>                : 
-<span class="lineNum">     636 </span>                :       bool
-<span class="lineNum">     637 </span><span class="lineCov">         342325 :       empty() const</span>
-<span class="lineNum">     638 </span><span class="lineCov">         342325 :       { return _M_impl._M_node_count == 0; }</span>
-<span class="lineNum">     639 </span>                : 
-<span class="lineNum">     640 </span>                :       size_type
-<span class="lineNum">     641 </span><span class="lineCov">         734435 :       size() const</span>
-<span class="lineNum">     642 </span><span class="lineCov">         734435 :       { return _M_impl._M_node_count; }</span>
-<span class="lineNum">     643 </span>                : 
-<span class="lineNum">     644 </span>                :       size_type
-<span class="lineNum">     645 </span>                :       max_size() const
-<span class="lineNum">     646 </span>                :       { return get_allocator().max_size(); }
-<span class="lineNum">     647 </span>                : 
-<span class="lineNum">     648 </span>                :       void
-<span class="lineNum">     649 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     650 </span>                :       swap(_Rb_tree&amp;&amp; __t);
-<span class="lineNum">     651 </span>                : #else
-<span class="lineNum">     652 </span>                :       swap(_Rb_tree&amp; __t);      
-<span class="lineNum">     653 </span>                : #endif
-<span class="lineNum">     654 </span>                : 
-<span class="lineNum">     655 </span>                :       // Insert/erase.
-<span class="lineNum">     656 </span>                :       pair&lt;iterator, bool&gt;
-<span class="lineNum">     657 </span>                :       _M_insert_unique(const value_type&amp; __x);
-<span class="lineNum">     658 </span>                : 
-<span class="lineNum">     659 </span>                :       iterator
-<span class="lineNum">     660 </span>                :       _M_insert_equal(const value_type&amp; __x);
-<span class="lineNum">     661 </span>                : 
-<span class="lineNum">     662 </span>                :       iterator
-<span class="lineNum">     663 </span>                :       _M_insert_unique_(const_iterator __position, const value_type&amp; __x);
-<span class="lineNum">     664 </span>                : 
-<span class="lineNum">     665 </span>                :       iterator
-<span class="lineNum">     666 </span>                :       _M_insert_equal_(const_iterator __position, const value_type&amp; __x);
-<span class="lineNum">     667 </span>                : 
-<span class="lineNum">     668 </span>                :       template&lt;typename _InputIterator&gt;
-<span class="lineNum">     669 </span>                :         void
-<span class="lineNum">     670 </span>                :         _M_insert_unique(_InputIterator __first, _InputIterator __last);
-<span class="lineNum">     671 </span>                : 
-<span class="lineNum">     672 </span>                :       template&lt;typename _InputIterator&gt;
-<span class="lineNum">     673 </span>                :         void
-<span class="lineNum">     674 </span>                :         _M_insert_equal(_InputIterator __first, _InputIterator __last);
-<span class="lineNum">     675 </span>                : 
-<span class="lineNum">     676 </span>                :       void
-<span class="lineNum">     677 </span>                :       erase(iterator __position);
-<span class="lineNum">     678 </span>                : 
-<span class="lineNum">     679 </span>                :       void
-<span class="lineNum">     680 </span>                :       erase(const_iterator __position);
-<span class="lineNum">     681 </span>                : 
-<span class="lineNum">     682 </span>                :       size_type
-<span class="lineNum">     683 </span>                :       erase(const key_type&amp; __x);
-<span class="lineNum">     684 </span>                : 
-<span class="lineNum">     685 </span>                :       void
-<span class="lineNum">     686 </span>                :       erase(iterator __first, iterator __last);
-<span class="lineNum">     687 </span>                : 
-<span class="lineNum">     688 </span>                :       void
-<span class="lineNum">     689 </span>                :       erase(const_iterator __first, const_iterator __last);
-<span class="lineNum">     690 </span>                : 
-<span class="lineNum">     691 </span>                :       void
-<span class="lineNum">     692 </span>                :       erase(const key_type* __first, const key_type* __last);
-<span class="lineNum">     693 </span>                : 
-<span class="lineNum">     694 </span>                :       void
-<span class="lineNum">     695 </span><span class="lineCov">          87992 :       clear()</span>
-<span class="lineNum">     696 </span>                :       {
-<span class="lineNum">     697 </span><span class="lineCov">          87992 :         _M_erase(_M_begin());</span>
-<span class="lineNum">     698 </span><span class="lineCov">          87992 :         _M_leftmost() = _M_end();</span>
-<span class="lineNum">     699 </span><span class="lineCov">          87992 :         _M_root() = 0;</span>
-<span class="lineNum">     700 </span><span class="lineCov">          87992 :         _M_rightmost() = _M_end();</span>
-<span class="lineNum">     701 </span><span class="lineCov">          87992 :         _M_impl._M_node_count = 0;</span>
-<span class="lineNum">     702 </span><span class="lineCov">          87992 :       }</span>
-<span class="lineNum">     703 </span>                : 
-<span class="lineNum">     704 </span>                :       // Set operations.
-<span class="lineNum">     705 </span>                :       iterator
-<span class="lineNum">     706 </span>                :       find(const key_type&amp; __k);
-<span class="lineNum">     707 </span>                : 
-<span class="lineNum">     708 </span>                :       const_iterator
-<span class="lineNum">     709 </span>                :       find(const key_type&amp; __k) const;
-<span class="lineNum">     710 </span>                : 
-<span class="lineNum">     711 </span>                :       size_type
-<span class="lineNum">     712 </span>                :       count(const key_type&amp; __k) const;
-<span class="lineNum">     713 </span>                : 
-<span class="lineNum">     714 </span>                :       iterator
-<span class="lineNum">     715 </span><span class="lineCov">           6297 :       lower_bound(const key_type&amp; __k)</span>
-<span class="lineNum">     716 </span><span class="lineCov">           6297 :       { return _M_lower_bound(_M_begin(), _M_end(), __k); }</span>
-<span class="lineNum">     717 </span>                : 
-<span class="lineNum">     718 </span>                :       const_iterator
-<span class="lineNum">     719 </span>                :       lower_bound(const key_type&amp; __k) const
-<span class="lineNum">     720 </span>                :       { return _M_lower_bound(_M_begin(), _M_end(), __k); }
-<span class="lineNum">     721 </span>                : 
-<span class="lineNum">     722 </span>                :       iterator
-<span class="lineNum">     723 </span>                :       upper_bound(const key_type&amp; __k)
-<span class="lineNum">     724 </span>                :       { return _M_upper_bound(_M_begin(), _M_end(), __k); }
-<span class="lineNum">     725 </span>                : 
-<span class="lineNum">     726 </span>                :       const_iterator
-<span class="lineNum">     727 </span>                :       upper_bound(const key_type&amp; __k) const
-<span class="lineNum">     728 </span>                :       { return _M_upper_bound(_M_begin(), _M_end(), __k); }
-<span class="lineNum">     729 </span>                : 
-<span class="lineNum">     730 </span>                :       pair&lt;iterator, iterator&gt;
-<span class="lineNum">     731 </span>                :       equal_range(const key_type&amp; __k);
-<span class="lineNum">     732 </span>                : 
-<span class="lineNum">     733 </span>                :       pair&lt;const_iterator, const_iterator&gt;
-<span class="lineNum">     734 </span>                :       equal_range(const key_type&amp; __k) const;
-<span class="lineNum">     735 </span>                : 
-<span class="lineNum">     736 </span>                :       // Debugging.
-<span class="lineNum">     737 </span>                :       bool
-<span class="lineNum">     738 </span>                :       __rb_verify() const;
-<span class="lineNum">     739 </span>                :     };
-<span class="lineNum">     740 </span>                : 
-<span class="lineNum">     741 </span>                :   template&lt;typename _Key, typename _Val, typename _KeyOfValue,
-<span class="lineNum">     742 </span>                :            typename _Compare, typename _Alloc&gt;
-<span class="lineNum">     743 </span>                :     inline bool
-<span class="lineNum">     744 </span>                :     operator==(const _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;&amp; __x,
-<span class="lineNum">     745 </span><span class="lineCov">              4 :                const _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;&amp; __y)</span>
-<span class="lineNum">     746 </span>                :     {
-<span class="lineNum">     747 </span>                :       return __x.size() == __y.size()
-<span class="lineNum">     748 </span><span class="lineCov">              4 :              &amp;&amp; std::equal(__x.begin(), __x.end(), __y.begin());</span>
-<span class="lineNum">     749 </span>                :     }
-<span class="lineNum">     750 </span>                : 
-<span class="lineNum">     751 </span>                :   template&lt;typename _Key, typename _Val, typename _KeyOfValue,
-<span class="lineNum">     752 </span>                :            typename _Compare, typename _Alloc&gt;
-<span class="lineNum">     753 </span>                :     inline bool
-<span class="lineNum">     754 </span>                :     operator&lt;(const _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;&amp; __x,
-<span class="lineNum">     755 </span>                :               const _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;&amp; __y)
-<span class="lineNum">     756 </span>                :     {
-<span class="lineNum">     757 </span>                :       return std::lexicographical_compare(__x.begin(), __x.end(), 
-<span class="lineNum">     758 </span>                :                                           __y.begin(), __y.end());
-<span class="lineNum">     759 </span>                :     }
-<span class="lineNum">     760 </span>                : 
-<span class="lineNum">     761 </span>                :   template&lt;typename _Key, typename _Val, typename _KeyOfValue,
-<span class="lineNum">     762 </span>                :            typename _Compare, typename _Alloc&gt;
-<span class="lineNum">     763 </span>                :     inline bool
-<span class="lineNum">     764 </span>                :     operator!=(const _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;&amp; __x,
-<span class="lineNum">     765 </span>                :                const _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;&amp; __y)
-<span class="lineNum">     766 </span>                :     { return !(__x == __y); }
-<span class="lineNum">     767 </span>                : 
-<span class="lineNum">     768 </span>                :   template&lt;typename _Key, typename _Val, typename _KeyOfValue,
-<span class="lineNum">     769 </span>                :            typename _Compare, typename _Alloc&gt;
-<span class="lineNum">     770 </span>                :     inline bool
-<span class="lineNum">     771 </span>                :     operator&gt;(const _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;&amp; __x,
-<span class="lineNum">     772 </span>                :               const _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;&amp; __y)
-<span class="lineNum">     773 </span>                :     { return __y &lt; __x; }
-<span class="lineNum">     774 </span>                : 
-<span class="lineNum">     775 </span>                :   template&lt;typename _Key, typename _Val, typename _KeyOfValue,
-<span class="lineNum">     776 </span>                :            typename _Compare, typename _Alloc&gt;
-<span class="lineNum">     777 </span>                :     inline bool
-<span class="lineNum">     778 </span>                :     operator&lt;=(const _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;&amp; __x,
-<span class="lineNum">     779 </span>                :                const _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;&amp; __y)
-<span class="lineNum">     780 </span>                :     { return !(__y &lt; __x); }
-<span class="lineNum">     781 </span>                : 
-<span class="lineNum">     782 </span>                :   template&lt;typename _Key, typename _Val, typename _KeyOfValue,
-<span class="lineNum">     783 </span>                :            typename _Compare, typename _Alloc&gt;
-<span class="lineNum">     784 </span>                :     inline bool
-<span class="lineNum">     785 </span>                :     operator&gt;=(const _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;&amp; __x,
-<span class="lineNum">     786 </span>                :                const _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;&amp; __y)
-<span class="lineNum">     787 </span>                :     { return !(__x &lt; __y); }
-<span class="lineNum">     788 </span>                : 
-<span class="lineNum">     789 </span>                :   template&lt;typename _Key, typename _Val, typename _KeyOfValue,
-<span class="lineNum">     790 </span>                :            typename _Compare, typename _Alloc&gt;
-<span class="lineNum">     791 </span>                :     inline void
-<span class="lineNum">     792 </span>                :     swap(_Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;&amp; __x,
-<span class="lineNum">     793 </span>                :          _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;&amp; __y)
-<span class="lineNum">     794 </span>                :     { __x.swap(__y); }
-<span class="lineNum">     795 </span>                : 
-<span class="lineNum">     796 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     797 </span>                :   template&lt;typename _Key, typename _Val, typename _KeyOfValue,
-<span class="lineNum">     798 </span>                :            typename _Compare, typename _Alloc&gt;
-<span class="lineNum">     799 </span>                :     _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;::
-<span class="lineNum">     800 </span>                :     _Rb_tree(_Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;&amp;&amp; __x)
-<span class="lineNum">     801 </span>                :     : _M_impl(__x._M_impl._M_key_compare, __x._M_get_Node_allocator())
-<span class="lineNum">     802 </span>                :     {
-<span class="lineNum">     803 </span>                :       if (__x._M_root() != 0)
-<span class="lineNum">     804 </span>                :         {
-<span class="lineNum">     805 </span>                :           _M_root() = __x._M_root();
-<span class="lineNum">     806 </span>                :           _M_leftmost() = __x._M_leftmost();
-<span class="lineNum">     807 </span>                :           _M_rightmost() = __x._M_rightmost();
-<span class="lineNum">     808 </span>                :           _M_root()-&gt;_M_parent = _M_end();
-<span class="lineNum">     809 </span>                : 
-<span class="lineNum">     810 </span>                :           __x._M_root() = 0;
-<span class="lineNum">     811 </span>                :           __x._M_leftmost() = __x._M_end();
-<span class="lineNum">     812 </span>                :           __x._M_rightmost() = __x._M_end();
-<span class="lineNum">     813 </span>                : 
-<span class="lineNum">     814 </span>                :           this-&gt;_M_impl._M_node_count = __x._M_impl._M_node_count;
-<span class="lineNum">     815 </span>                :           __x._M_impl._M_node_count = 0;
-<span class="lineNum">     816 </span>                :         }
-<span class="lineNum">     817 </span>                :     }
-<span class="lineNum">     818 </span>                : #endif
-<span class="lineNum">     819 </span>                : 
-<span class="lineNum">     820 </span>                :   template&lt;typename _Key, typename _Val, typename _KeyOfValue,
-<span class="lineNum">     821 </span>                :            typename _Compare, typename _Alloc&gt;
-<span class="lineNum">     822 </span>                :     _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;&amp;
-<span class="lineNum">     823 </span>                :     _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;::
-<span class="lineNum">     824 </span><span class="lineCov">             97 :     operator=(const _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;&amp; __x)</span>
-<span class="lineNum">     825 </span>                :     {
-<span class="lineNum">     826 </span><span class="lineCov">             97 :       if (this != &amp;__x)</span>
-<span class="lineNum">     827 </span>                :         {
-<span class="lineNum">     828 </span>                :           // Note that _Key may be a constant type.
-<span class="lineNum">     829 </span><span class="lineCov">             97 :           clear();</span>
-<span class="lineNum">     830 </span><span class="lineCov">             97 :           _M_impl._M_key_compare = __x._M_impl._M_key_compare;</span>
-<span class="lineNum">     831 </span><span class="lineCov">             97 :           if (__x._M_root() != 0)</span>
-<span class="lineNum">     832 </span>                :             {
-<span class="lineNum">     833 </span><span class="lineCov">             53 :               _M_root() = _M_copy(__x._M_begin(), _M_end());</span>
-<span class="lineNum">     834 </span><span class="lineCov">             53 :               _M_leftmost() = _S_minimum(_M_root());</span>
-<span class="lineNum">     835 </span><span class="lineCov">             53 :               _M_rightmost() = _S_maximum(_M_root());</span>
-<span class="lineNum">     836 </span><span class="lineCov">             53 :               _M_impl._M_node_count = __x._M_impl._M_node_count;</span>
-<span class="lineNum">     837 </span>                :             }
-<span class="lineNum">     838 </span>                :         }
-<span class="lineNum">     839 </span><span class="lineCov">             97 :       return *this;</span>
-<span class="lineNum">     840 </span>                :     }
-<span class="lineNum">     841 </span>                : 
-<span class="lineNum">     842 </span>                :   template&lt;typename _Key, typename _Val, typename _KeyOfValue,
-<span class="lineNum">     843 </span>                :            typename _Compare, typename _Alloc&gt;
-<span class="lineNum">     844 </span>                :     typename _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;::iterator
-<span class="lineNum">     845 </span>                :     _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;::
-<span class="lineNum">     846 </span><span class="lineCov">        2070706 :     _M_insert_(_Const_Base_ptr __x, _Const_Base_ptr __p, const _Val&amp; __v)</span>
-<span class="lineNum">     847 </span>                :     {
-<span class="lineNum">     848 </span>                :       bool __insert_left = (__x != 0 || __p == _M_end()
-<span class="lineNum">     849 </span>                :                             || _M_impl._M_key_compare(_KeyOfValue()(__v), 
-<span class="lineNum">     850 </span><span class="lineCov">        2070706 :                                                       _S_key(__p)));</span>
-<span class="lineNum">     851 </span>                : 
-<span class="lineNum">     852 </span><span class="lineCov">        2070706 :       _Link_type __z = _M_create_node(__v);</span>
-<span class="lineNum">     853 </span>                : 
-<span class="lineNum">     854 </span><span class="lineCov">        2070706 :       _Rb_tree_insert_and_rebalance(__insert_left, __z,</span>
-<span class="lineNum">     855 </span>                :                                     const_cast&lt;_Base_ptr&gt;(__p),  
-<span class="lineNum">     856 </span>                :                                     this-&gt;_M_impl._M_header);
-<span class="lineNum">     857 </span><span class="lineCov">        2070706 :       ++_M_impl._M_node_count;</span>
-<span class="lineNum">     858 </span><span class="lineCov">        2070706 :       return iterator(__z);</span>
-<span class="lineNum">     859 </span>                :     }
-<span class="lineNum">     860 </span>                : 
-<span class="lineNum">     861 </span>                :   template&lt;typename _Key, typename _Val, typename _KeyOfValue,
-<span class="lineNum">     862 </span>                :            typename _Compare, typename _Alloc&gt;
-<span class="lineNum">     863 </span>                :     typename _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;::iterator
-<span class="lineNum">     864 </span>                :     _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;::
-<span class="lineNum">     865 </span>                :     _M_insert_lower(_Base_ptr __x, _Base_ptr __p, const _Val&amp; __v)
-<span class="lineNum">     866 </span>                :     {
-<span class="lineNum">     867 </span>                :       bool __insert_left = (__x != 0 || __p == _M_end()
-<span class="lineNum">     868 </span>                :                             || !_M_impl._M_key_compare(_S_key(__p),
-<span class="lineNum">     869 </span>                :                                                        _KeyOfValue()(__v)));
-<span class="lineNum">     870 </span>                : 
-<span class="lineNum">     871 </span>                :       _Link_type __z = _M_create_node(__v);
-<span class="lineNum">     872 </span>                : 
-<span class="lineNum">     873 </span>                :       _Rb_tree_insert_and_rebalance(__insert_left, __z, __p,  
-<span class="lineNum">     874 </span>                :                                     this-&gt;_M_impl._M_header);
-<span class="lineNum">     875 </span>                :       ++_M_impl._M_node_count;
-<span class="lineNum">     876 </span>                :       return iterator(__z);
-<span class="lineNum">     877 </span>                :     }
-<span class="lineNum">     878 </span>                : 
-<span class="lineNum">     879 </span>                :   template&lt;typename _Key, typename _Val, typename _KeyOfValue,
-<span class="lineNum">     880 </span>                :            typename _Compare, typename _Alloc&gt;
-<span class="lineNum">     881 </span>                :     typename _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;::iterator
-<span class="lineNum">     882 </span>                :     _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;::
-<span class="lineNum">     883 </span>                :     _M_insert_equal_lower(const _Val&amp; __v)
-<span class="lineNum">     884 </span>                :     {
-<span class="lineNum">     885 </span>                :       _Link_type __x = _M_begin();
-<span class="lineNum">     886 </span>                :       _Link_type __y = _M_end();
-<span class="lineNum">     887 </span>                :       while (__x != 0)
-<span class="lineNum">     888 </span>                :         {
-<span class="lineNum">     889 </span>                :           __y = __x;
-<span class="lineNum">     890 </span>                :           __x = !_M_impl._M_key_compare(_S_key(__x), _KeyOfValue()(__v)) ?
-<span class="lineNum">     891 </span>                :                 _S_left(__x) : _S_right(__x);
-<span class="lineNum">     892 </span>                :         }
-<span class="lineNum">     893 </span>                :       return _M_insert_lower(__x, __y, __v);
-<span class="lineNum">     894 </span>                :     }
-<span class="lineNum">     895 </span>                : 
-<span class="lineNum">     896 </span>                :   template&lt;typename _Key, typename _Val, typename _KoV,
-<span class="lineNum">     897 </span>                :            typename _Compare, typename _Alloc&gt;
-<span class="lineNum">     898 </span>                :     typename _Rb_tree&lt;_Key, _Val, _KoV, _Compare, _Alloc&gt;::_Link_type
-<span class="lineNum">     899 </span>                :     _Rb_tree&lt;_Key, _Val, _KoV, _Compare, _Alloc&gt;::
-<span class="lineNum">     900 </span><span class="lineCov">        2381075 :     _M_copy(_Const_Link_type __x, _Link_type __p)</span>
-<span class="lineNum">     901 </span>                :     {
-<span class="lineNum">     902 </span>                :       // Structural copy.  __x and __p must be non-null.
-<span class="lineNum">     903 </span><span class="lineCov">        2381075 :       _Link_type __top = _M_clone_node(__x);</span>
-<span class="lineNum">     904 </span><span class="lineCov">        2381075 :       __top-&gt;_M_parent = __p;</span>
-<span class="lineNum">     905 </span>                : 
-<span class="lineNum">     906 </span>                :       try
-<span class="lineNum">     907 </span>                :         {
-<span class="lineNum">     908 </span><span class="lineCov">        2381075 :           if (__x-&gt;_M_right)</span>
-<span class="lineNum">     909 </span><span class="lineCov">        1355924 :             __top-&gt;_M_right = _M_copy(_S_right(__x), __top);</span>
-<span class="lineNum">     910 </span><span class="lineCov">        2381075 :           __p = __top;</span>
-<span class="lineNum">     911 </span><span class="lineCov">        2381075 :           __x = _S_left(__x);</span>
-<span class="lineNum">     912 </span>                : 
-<span class="lineNum">     913 </span><span class="lineCov">        5955057 :           while (__x != 0)</span>
-<span class="lineNum">     914 </span>                :             {
-<span class="lineNum">     915 </span><span class="lineCov">        1192907 :               _Link_type __y = _M_clone_node(__x);</span>
-<span class="lineNum">     916 </span><span class="lineCov">        1192907 :               __p-&gt;_M_left = __y;</span>
-<span class="lineNum">     917 </span><span class="lineCov">        1192907 :               __y-&gt;_M_parent = __p;</span>
-<span class="lineNum">     918 </span><span class="lineCov">        1192907 :               if (__x-&gt;_M_right)</span>
-<span class="lineNum">     919 </span><span class="lineCov">         144518 :                 __y-&gt;_M_right = _M_copy(_S_right(__x), __y);</span>
-<span class="lineNum">     920 </span><span class="lineCov">        1192907 :               __p = __y;</span>
-<span class="lineNum">     921 </span><span class="lineCov">        1192907 :               __x = _S_left(__x);</span>
-<span class="lineNum">     922 </span>                :             }
-<span class="lineNum">     923 </span>                :         }
-<span class="lineNum">     924 </span><span class="lineNoCov">              0 :       catch(...)</span>
-<span class="lineNum">     925 </span>                :         {
-<span class="lineNum">     926 </span><span class="lineNoCov">              0 :           _M_erase(__top);</span>
-<span class="lineNum">     927 </span><span class="lineNoCov">              0 :           __throw_exception_again;</span>
-<span class="lineNum">     928 </span>                :         }
-<span class="lineNum">     929 </span><span class="lineCov">        2381075 :       return __top;</span>
-<span class="lineNum">     930 </span>                :     }
-<span class="lineNum">     931 </span>                : 
-<span class="lineNum">     932 </span>                :   template&lt;typename _Key, typename _Val, typename _KeyOfValue,
-<span class="lineNum">     933 </span>                :            typename _Compare, typename _Alloc&gt;
-<span class="lineNum">     934 </span>                :     void
-<span class="lineNum">     935 </span>                :     _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;::
-<span class="lineNum">     936 </span><span class="lineCov">        7053477 :     _M_erase(_Link_type __x)</span>
-<span class="lineNum">     937 </span>                :     {
-<span class="lineNum">     938 </span>                :       // Erase without rebalancing.
-<span class="lineNum">     939 </span><span class="lineCov">       19751483 :       while (__x != 0)</span>
-<span class="lineNum">     940 </span>                :         {
-<span class="lineNum">     941 </span><span class="lineCov">        5644529 :           _M_erase(_S_right(__x));</span>
-<span class="lineNum">     942 </span><span class="lineCov">        5644529 :           _Link_type __y = _S_left(__x);</span>
-<span class="lineNum">     943 </span><span class="lineCov">        5644529 :           _M_destroy_node(__x);</span>
-<span class="lineNum">     944 </span><span class="lineCov">        5644529 :           __x = __y;</span>
-<span class="lineNum">     945 </span>                :         }
-<span class="lineNum">     946 </span><span class="lineCov">        7053477 :     }</span>
-<span class="lineNum">     947 </span>                : 
-<span class="lineNum">     948 </span>                :   template&lt;typename _Key, typename _Val, typename _KeyOfValue,
-<span class="lineNum">     949 </span>                :            typename _Compare, typename _Alloc&gt;
-<span class="lineNum">     950 </span>                :     typename _Rb_tree&lt;_Key, _Val, _KeyOfValue,
-<span class="lineNum">     951 </span>                :                       _Compare, _Alloc&gt;::iterator
-<span class="lineNum">     952 </span>                :     _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;::
-<span class="lineNum">     953 </span>                :     _M_lower_bound(_Link_type __x, _Link_type __y,
-<span class="lineNum">     954 </span><span class="lineCov">          56455 :                    const _Key&amp; __k)</span>
-<span class="lineNum">     955 </span>                :     {
-<span class="lineNum">     956 </span><span class="lineCov">         956283 :       while (__x != 0)</span>
-<span class="lineNum">     957 </span><span class="lineCov">         843373 :         if (!_M_impl._M_key_compare(_S_key(__x), __k))</span>
-<span class="lineNum">     958 </span><span class="lineCov">         159236 :           __y = __x, __x = _S_left(__x);</span>
-<span class="lineNum">     959 </span>                :         else
-<span class="lineNum">     960 </span><span class="lineCov">         684137 :           __x = _S_right(__x);</span>
-<span class="lineNum">     961 </span><span class="lineCov">          56455 :       return iterator(__y);</span>
-<span class="lineNum">     962 </span>                :     }
-<span class="lineNum">     963 </span>                : 
-<span class="lineNum">     964 </span>                :   template&lt;typename _Key, typename _Val, typename _KeyOfValue,
-<span class="lineNum">     965 </span>                :            typename _Compare, typename _Alloc&gt;
-<span class="lineNum">     966 </span>                :     typename _Rb_tree&lt;_Key, _Val, _KeyOfValue,
-<span class="lineNum">     967 </span>                :                       _Compare, _Alloc&gt;::const_iterator
-<span class="lineNum">     968 </span>                :     _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;::
-<span class="lineNum">     969 </span>                :     _M_lower_bound(_Const_Link_type __x, _Const_Link_type __y,
-<span class="lineNum">     970 </span><span class="lineCov">           3932 :                    const _Key&amp; __k) const</span>
-<span class="lineNum">     971 </span>                :     {
-<span class="lineNum">     972 </span><span class="lineCov">          16029 :       while (__x != 0)</span>
-<span class="lineNum">     973 </span><span class="lineCov">           8165 :         if (!_M_impl._M_key_compare(_S_key(__x), __k))</span>
-<span class="lineNum">     974 </span><span class="lineCov">           5885 :           __y = __x, __x = _S_left(__x);</span>
-<span class="lineNum">     975 </span>                :         else
-<span class="lineNum">     976 </span><span class="lineCov">           2280 :           __x = _S_right(__x);</span>
-<span class="lineNum">     977 </span><span class="lineCov">           3932 :       return const_iterator(__y);</span>
-<span class="lineNum">     978 </span>                :     }
-<span class="lineNum">     979 </span>                : 
-<span class="lineNum">     980 </span>                :   template&lt;typename _Key, typename _Val, typename _KeyOfValue,
-<span class="lineNum">     981 </span>                :            typename _Compare, typename _Alloc&gt;
-<span class="lineNum">     982 </span>                :     typename _Rb_tree&lt;_Key, _Val, _KeyOfValue,
-<span class="lineNum">     983 </span>                :                       _Compare, _Alloc&gt;::iterator
-<span class="lineNum">     984 </span>                :     _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;::
-<span class="lineNum">     985 </span>                :     _M_upper_bound(_Link_type __x, _Link_type __y,
-<span class="lineNum">     986 </span><span class="lineCov">              2 :                    const _Key&amp; __k)</span>
-<span class="lineNum">     987 </span>                :     {
-<span class="lineNum">     988 </span><span class="lineCov">              4 :       while (__x != 0)</span>
-<span class="lineNum">     989 </span><span class="lineNoCov">              0 :         if (_M_impl._M_key_compare(__k, _S_key(__x)))</span>
-<span class="lineNum">     990 </span><span class="lineNoCov">              0 :           __y = __x, __x = _S_left(__x);</span>
-<span class="lineNum">     991 </span>                :         else
-<span class="lineNum">     992 </span><span class="lineNoCov">              0 :           __x = _S_right(__x);</span>
-<span class="lineNum">     993 </span><span class="lineCov">              2 :       return iterator(__y);</span>
-<span class="lineNum">     994 </span>                :     }
-<span class="lineNum">     995 </span>                : 
-<span class="lineNum">     996 </span>                :   template&lt;typename _Key, typename _Val, typename _KeyOfValue,
-<span class="lineNum">     997 </span>                :            typename _Compare, typename _Alloc&gt;
-<span class="lineNum">     998 </span>                :     typename _Rb_tree&lt;_Key, _Val, _KeyOfValue,
-<span class="lineNum">     999 </span>                :                       _Compare, _Alloc&gt;::const_iterator
-<span class="lineNum">    1000 </span>                :     _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;::
-<span class="lineNum">    1001 </span>                :     _M_upper_bound(_Const_Link_type __x, _Const_Link_type __y,
-<span class="lineNum">    1002 </span>                :                    const _Key&amp; __k) const
-<span class="lineNum">    1003 </span>                :     {
-<span class="lineNum">    1004 </span>                :       while (__x != 0)
-<span class="lineNum">    1005 </span>                :         if (_M_impl._M_key_compare(__k, _S_key(__x)))
-<span class="lineNum">    1006 </span>                :           __y = __x, __x = _S_left(__x);
-<span class="lineNum">    1007 </span>                :         else
-<span class="lineNum">    1008 </span>                :           __x = _S_right(__x);
-<span class="lineNum">    1009 </span>                :       return const_iterator(__y);
-<span class="lineNum">    1010 </span>                :     }
-<span class="lineNum">    1011 </span>                : 
-<span class="lineNum">    1012 </span>                :   template&lt;typename _Key, typename _Val, typename _KeyOfValue,
-<span class="lineNum">    1013 </span>                :            typename _Compare, typename _Alloc&gt;
-<span class="lineNum">    1014 </span>                :     pair&lt;typename _Rb_tree&lt;_Key, _Val, _KeyOfValue,
-<span class="lineNum">    1015 </span>                :                            _Compare, _Alloc&gt;::iterator,
-<span class="lineNum">    1016 </span>                :          typename _Rb_tree&lt;_Key, _Val, _KeyOfValue,
-<span class="lineNum">    1017 </span>                :                            _Compare, _Alloc&gt;::iterator&gt;
-<span class="lineNum">    1018 </span>                :     _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;::
-<span class="lineNum">    1019 </span><span class="lineCov">              9 :     equal_range(const _Key&amp; __k)</span>
-<span class="lineNum">    1020 </span>                :     {
-<span class="lineNum">    1021 </span><span class="lineCov">              9 :       _Link_type __x = _M_begin();</span>
-<span class="lineNum">    1022 </span><span class="lineCov">              9 :       _Link_type __y = _M_end();</span>
-<span class="lineNum">    1023 </span><span class="lineCov">             20 :       while (__x != 0)</span>
-<span class="lineNum">    1024 </span>                :         {
-<span class="lineNum">    1025 </span><span class="lineCov">              4 :           if (_M_impl._M_key_compare(_S_key(__x), __k))</span>
-<span class="lineNum">    1026 </span><span class="lineNoCov">              0 :             __x = _S_right(__x);</span>
-<span class="lineNum">    1027 </span><span class="lineCov">              4 :           else if (_M_impl._M_key_compare(__k, _S_key(__x)))</span>
-<span class="lineNum">    1028 </span><span class="lineCov">              2 :             __y = __x, __x = _S_left(__x);</span>
-<span class="lineNum">    1029 </span>                :           else
-<span class="lineNum">    1030 </span>                :             {
-<span class="lineNum">    1031 </span><span class="lineCov">              2 :               _Link_type __xu(__x), __yu(__y);</span>
-<span class="lineNum">    1032 </span><span class="lineCov">              2 :               __y = __x, __x = _S_left(__x);</span>
-<span class="lineNum">    1033 </span><span class="lineCov">              2 :               __xu = _S_right(__xu);</span>
-<span class="lineNum">    1034 </span>                :               return pair&lt;iterator,
-<span class="lineNum">    1035 </span>                :                           iterator&gt;(_M_lower_bound(__x, __y, __k),
-<span class="lineNum">    1036 </span><span class="lineCov">              2 :                                     _M_upper_bound(__xu, __yu, __k));</span>
-<span class="lineNum">    1037 </span>                :             }
-<span class="lineNum">    1038 </span>                :         }
-<span class="lineNum">    1039 </span>                :       return pair&lt;iterator, iterator&gt;(iterator(__y),
-<span class="lineNum">    1040 </span><span class="lineCov">              7 :                                       iterator(__y));</span>
-<span class="lineNum">    1041 </span>                :     }
-<span class="lineNum">    1042 </span>                : 
-<span class="lineNum">    1043 </span>                :   template&lt;typename _Key, typename _Val, typename _KeyOfValue,
-<span class="lineNum">    1044 </span>                :            typename _Compare, typename _Alloc&gt;
-<span class="lineNum">    1045 </span>                :     pair&lt;typename _Rb_tree&lt;_Key, _Val, _KeyOfValue,
-<span class="lineNum">    1046 </span>                :                            _Compare, _Alloc&gt;::const_iterator,
-<span class="lineNum">    1047 </span>                :          typename _Rb_tree&lt;_Key, _Val, _KeyOfValue,
-<span class="lineNum">    1048 </span>                :                            _Compare, _Alloc&gt;::const_iterator&gt;
-<span class="lineNum">    1049 </span>                :     _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;::
-<span class="lineNum">    1050 </span>                :     equal_range(const _Key&amp; __k) const
-<span class="lineNum">    1051 </span>                :     {
-<span class="lineNum">    1052 </span>                :       _Const_Link_type __x = _M_begin();
-<span class="lineNum">    1053 </span>                :       _Const_Link_type __y = _M_end();
-<span class="lineNum">    1054 </span>                :       while (__x != 0)
-<span class="lineNum">    1055 </span>                :         {
-<span class="lineNum">    1056 </span>                :           if (_M_impl._M_key_compare(_S_key(__x), __k))
-<span class="lineNum">    1057 </span>                :             __x = _S_right(__x);
-<span class="lineNum">    1058 </span>                :           else if (_M_impl._M_key_compare(__k, _S_key(__x)))
-<span class="lineNum">    1059 </span>                :             __y = __x, __x = _S_left(__x);
-<span class="lineNum">    1060 </span>                :           else
-<span class="lineNum">    1061 </span>                :             {
-<span class="lineNum">    1062 </span>                :               _Const_Link_type __xu(__x), __yu(__y);
-<span class="lineNum">    1063 </span>                :               __y = __x, __x = _S_left(__x);
-<span class="lineNum">    1064 </span>                :               __xu = _S_right(__xu);
-<span class="lineNum">    1065 </span>                :               return pair&lt;const_iterator,
-<span class="lineNum">    1066 </span>                :                           const_iterator&gt;(_M_lower_bound(__x, __y, __k),
-<span class="lineNum">    1067 </span>                :                                           _M_upper_bound(__xu, __yu, __k));
-<span class="lineNum">    1068 </span>                :             }
-<span class="lineNum">    1069 </span>                :         }
-<span class="lineNum">    1070 </span>                :       return pair&lt;const_iterator, const_iterator&gt;(const_iterator(__y),
-<span class="lineNum">    1071 </span>                :                                                   const_iterator(__y));
-<span class="lineNum">    1072 </span>                :     }
-<span class="lineNum">    1073 </span>                : 
-<span class="lineNum">    1074 </span>                :   template&lt;typename _Key, typename _Val, typename _KeyOfValue,
-<span class="lineNum">    1075 </span>                :            typename _Compare, typename _Alloc&gt;
-<span class="lineNum">    1076 </span>                :     void
-<span class="lineNum">    1077 </span>                :     _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;::
-<span class="lineNum">    1078 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">    1079 </span>                :     swap(_Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;&amp;&amp; __t)
-<span class="lineNum">    1080 </span>                : #else
-<span class="lineNum">    1081 </span>                :     swap(_Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;&amp; __t)
-<span class="lineNum">    1082 </span>                : #endif
-<span class="lineNum">    1083 </span>                :     {
-<span class="lineNum">    1084 </span>                :       if (_M_root() == 0)
-<span class="lineNum">    1085 </span>                :         {
-<span class="lineNum">    1086 </span>                :           if (__t._M_root() != 0)
-<span class="lineNum">    1087 </span>                :             {
-<span class="lineNum">    1088 </span>                :               _M_root() = __t._M_root();
-<span class="lineNum">    1089 </span>                :               _M_leftmost() = __t._M_leftmost();
-<span class="lineNum">    1090 </span>                :               _M_rightmost() = __t._M_rightmost();
-<span class="lineNum">    1091 </span>                :               _M_root()-&gt;_M_parent = _M_end();
-<span class="lineNum">    1092 </span>                :               
-<span class="lineNum">    1093 </span>                :               __t._M_root() = 0;
-<span class="lineNum">    1094 </span>                :               __t._M_leftmost() = __t._M_end();
-<span class="lineNum">    1095 </span>                :               __t._M_rightmost() = __t._M_end();
-<span class="lineNum">    1096 </span>                :             }
-<span class="lineNum">    1097 </span>                :         }
-<span class="lineNum">    1098 </span>                :       else if (__t._M_root() == 0)
-<span class="lineNum">    1099 </span>                :         {
-<span class="lineNum">    1100 </span>                :           __t._M_root() = _M_root();
-<span class="lineNum">    1101 </span>                :           __t._M_leftmost() = _M_leftmost();
-<span class="lineNum">    1102 </span>                :           __t._M_rightmost() = _M_rightmost();
-<span class="lineNum">    1103 </span>                :           __t._M_root()-&gt;_M_parent = __t._M_end();
-<span class="lineNum">    1104 </span>                :           
-<span class="lineNum">    1105 </span>                :           _M_root() = 0;
-<span class="lineNum">    1106 </span>                :           _M_leftmost() = _M_end();
-<span class="lineNum">    1107 </span>                :           _M_rightmost() = _M_end();
-<span class="lineNum">    1108 </span>                :         }
-<span class="lineNum">    1109 </span>                :       else
-<span class="lineNum">    1110 </span>                :         {
-<span class="lineNum">    1111 </span>                :           std::swap(_M_root(),__t._M_root());
-<span class="lineNum">    1112 </span>                :           std::swap(_M_leftmost(),__t._M_leftmost());
-<span class="lineNum">    1113 </span>                :           std::swap(_M_rightmost(),__t._M_rightmost());
-<span class="lineNum">    1114 </span>                :           
-<span class="lineNum">    1115 </span>                :           _M_root()-&gt;_M_parent = _M_end();
-<span class="lineNum">    1116 </span>                :           __t._M_root()-&gt;_M_parent = __t._M_end();
-<span class="lineNum">    1117 </span>                :         }
-<span class="lineNum">    1118 </span>                :       // No need to swap header's color as it does not change.
-<span class="lineNum">    1119 </span>                :       std::swap(this-&gt;_M_impl._M_node_count, __t._M_impl._M_node_count);
-<span class="lineNum">    1120 </span>                :       std::swap(this-&gt;_M_impl._M_key_compare, __t._M_impl._M_key_compare);
-<span class="lineNum">    1121 </span>                :       
-<span class="lineNum">    1122 </span>                :       // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">    1123 </span>                :       // 431. Swapping containers with unequal allocators.
-<span class="lineNum">    1124 </span>                :       std::__alloc_swap&lt;_Node_allocator&gt;::
-<span class="lineNum">    1125 </span>                :         _S_do_it(_M_get_Node_allocator(), __t._M_get_Node_allocator());
-<span class="lineNum">    1126 </span>                :     }
-<span class="lineNum">    1127 </span>                : 
-<span class="lineNum">    1128 </span>                :   template&lt;typename _Key, typename _Val, typename _KeyOfValue,
-<span class="lineNum">    1129 </span>                :            typename _Compare, typename _Alloc&gt;
-<span class="lineNum">    1130 </span>                :     pair&lt;typename _Rb_tree&lt;_Key, _Val, _KeyOfValue,
-<span class="lineNum">    1131 </span>                :                            _Compare, _Alloc&gt;::iterator, bool&gt;
-<span class="lineNum">    1132 </span>                :     _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;::
-<span class="lineNum">    1133 </span><span class="lineCov">        1653740 :     _M_insert_unique(const _Val&amp; __v)</span>
-<span class="lineNum">    1134 </span>                :     {
-<span class="lineNum">    1135 </span><span class="lineCov">        1653740 :       _Link_type __x = _M_begin();</span>
-<span class="lineNum">    1136 </span><span class="lineCov">        1653740 :       _Link_type __y = _M_end();</span>
-<span class="lineNum">    1137 </span><span class="lineCov">        1653740 :       bool __comp = true;</span>
-<span class="lineNum">    1138 </span><span class="lineCov">        9798389 :       while (__x != 0)</span>
-<span class="lineNum">    1139 </span>                :         {
-<span class="lineNum">    1140 </span><span class="lineCov">        6490909 :           __y = __x;</span>
-<span class="lineNum">    1141 </span><span class="lineCov">        6490909 :           __comp = _M_impl._M_key_compare(_KeyOfValue()(__v), _S_key(__x));</span>
-<span class="lineNum">    1142 </span><span class="lineCov">        6490909 :           __x = __comp ? _S_left(__x) : _S_right(__x);</span>
-<span class="lineNum">    1143 </span>                :         }
-<span class="lineNum">    1144 </span><span class="lineCov">        1653740 :       iterator __j = iterator(__y);</span>
-<span class="lineNum">    1145 </span><span class="lineCov">        1653740 :       if (__comp)</span>
-<span class="lineNum">    1146 </span>                :         {
-<span class="lineNum">    1147 </span><span class="lineCov">         536188 :           if (__j == begin())</span>
-<span class="lineNum">    1148 </span><span class="lineCov">         452855 :             return pair&lt;iterator, bool&gt;(_M_insert_(__x, __y, __v), true);</span>
-<span class="lineNum">    1149 </span>                :           else
-<span class="lineNum">    1150 </span><span class="lineCov">          83333 :             --__j;</span>
-<span class="lineNum">    1151 </span>                :         }
-<span class="lineNum">    1152 </span><span class="lineCov">        1200885 :       if (_M_impl._M_key_compare(_S_key(__j._M_node), _KeyOfValue()(__v)))</span>
-<span class="lineNum">    1153 </span><span class="lineCov">        1095156 :         return pair&lt;iterator, bool&gt;(_M_insert_(__x, __y, __v), true);</span>
-<span class="lineNum">    1154 </span><span class="lineCov">         105729 :       return pair&lt;iterator, bool&gt;(__j, false);</span>
-<span class="lineNum">    1155 </span>                :     }
-<span class="lineNum">    1156 </span>                : 
-<span class="lineNum">    1157 </span>                :   template&lt;typename _Key, typename _Val, typename _KeyOfValue,
-<span class="lineNum">    1158 </span>                :            typename _Compare, typename _Alloc&gt;
-<span class="lineNum">    1159 </span>                :     typename _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;::iterator
-<span class="lineNum">    1160 </span>                :     _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;::
-<span class="lineNum">    1161 </span>                :     _M_insert_equal(const _Val&amp; __v)
-<span class="lineNum">    1162 </span>                :     {
-<span class="lineNum">    1163 </span>                :       _Link_type __x = _M_begin();
-<span class="lineNum">    1164 </span>                :       _Link_type __y = _M_end();
-<span class="lineNum">    1165 </span>                :       while (__x != 0)
-<span class="lineNum">    1166 </span>                :         {
-<span class="lineNum">    1167 </span>                :           __y = __x;
-<span class="lineNum">    1168 </span>                :           __x = _M_impl._M_key_compare(_KeyOfValue()(__v), _S_key(__x)) ?
-<span class="lineNum">    1169 </span>                :                 _S_left(__x) : _S_right(__x);
-<span class="lineNum">    1170 </span>                :         }
-<span class="lineNum">    1171 </span>                :       return _M_insert_(__x, __y, __v);
-<span class="lineNum">    1172 </span>                :     }
-<span class="lineNum">    1173 </span>                : 
-<span class="lineNum">    1174 </span>                :   template&lt;typename _Key, typename _Val, typename _KeyOfValue,
-<span class="lineNum">    1175 </span>                :            typename _Compare, typename _Alloc&gt;
-<span class="lineNum">    1176 </span>                :     typename _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;::iterator
-<span class="lineNum">    1177 </span>                :     _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;::
-<span class="lineNum">    1178 </span><span class="lineCov">         652700 :     _M_insert_unique_(const_iterator __position, const _Val&amp; __v)</span>
-<span class="lineNum">    1179 </span>                :     {
-<span class="lineNum">    1180 </span>                :       // end()
-<span class="lineNum">    1181 </span><span class="lineCov">         652700 :       if (__position._M_node == _M_end())</span>
-<span class="lineNum">    1182 </span>                :         {
-<span class="lineNum">    1183 </span><span class="lineCov">         649758 :           if (size() &gt; 0</span>
-<span class="lineNum">    1184 </span>                :               &amp;&amp; _M_impl._M_key_compare(_S_key(_M_rightmost()), 
-<span class="lineNum">    1185 </span>                :                                         _KeyOfValue()(__v)))
-<span class="lineNum">    1186 </span><span class="lineCov">         521501 :             return _M_insert_(0, _M_rightmost(), __v);</span>
-<span class="lineNum">    1187 </span>                :           else
-<span class="lineNum">    1188 </span><span class="lineCov">         128257 :             return _M_insert_unique(__v).first;</span>
-<span class="lineNum">    1189 </span>                :         }
-<span class="lineNum">    1190 </span><span class="lineCov">           2942 :       else if (_M_impl._M_key_compare(_KeyOfValue()(__v),</span>
-<span class="lineNum">    1191 </span>                :                                       _S_key(__position._M_node)))
-<span class="lineNum">    1192 </span>                :         {
-<span class="lineNum">    1193 </span>                :           // First, try before...
-<span class="lineNum">    1194 </span><span class="lineCov">           2040 :           const_iterator __before = __position;</span>
-<span class="lineNum">    1195 </span><span class="lineCov">           2040 :           if (__position._M_node == _M_leftmost()) // begin()</span>
-<span class="lineNum">    1196 </span><span class="lineCov">             72 :             return _M_insert_(_M_leftmost(), _M_leftmost(), __v);</span>
-<span class="lineNum">    1197 </span><span class="lineCov">           1968 :           else if (_M_impl._M_key_compare(_S_key((--__before)._M_node), </span>
-<span class="lineNum">    1198 </span>                :                                           _KeyOfValue()(__v)))
-<span class="lineNum">    1199 </span>                :             {
-<span class="lineNum">    1200 </span><span class="lineCov">           1101 :               if (_S_right(__before._M_node) == 0)</span>
-<span class="lineNum">    1201 </span><span class="lineCov">            562 :                 return _M_insert_(0, __before._M_node, __v);</span>
-<span class="lineNum">    1202 </span>                :               else
-<span class="lineNum">    1203 </span>                :                 return _M_insert_(__position._M_node,
-<span class="lineNum">    1204 </span><span class="lineCov">            539 :                                   __position._M_node, __v);</span>
-<span class="lineNum">    1205 </span>                :             }
-<span class="lineNum">    1206 </span>                :           else
-<span class="lineNum">    1207 </span><span class="lineCov">            867 :             return _M_insert_unique(__v).first;</span>
-<span class="lineNum">    1208 </span>                :         }
-<span class="lineNum">    1209 </span><span class="lineCov">            902 :       else if (_M_impl._M_key_compare(_S_key(__position._M_node),</span>
-<span class="lineNum">    1210 </span>                :                                       _KeyOfValue()(__v)))
-<span class="lineNum">    1211 </span>                :         {
-<span class="lineNum">    1212 </span>                :           // ... then try after.
-<span class="lineNum">    1213 </span><span class="lineCov">            902 :           const_iterator __after = __position;</span>
-<span class="lineNum">    1214 </span><span class="lineCov">            902 :           if (__position._M_node == _M_rightmost())</span>
-<span class="lineNum">    1215 </span><span class="lineCov">             13 :             return _M_insert_(0, _M_rightmost(), __v);</span>
-<span class="lineNum">    1216 </span><span class="lineCov">            889 :           else if (_M_impl._M_key_compare(_KeyOfValue()(__v),</span>
-<span class="lineNum">    1217 </span>                :                                           _S_key((++__after)._M_node)))
-<span class="lineNum">    1218 </span>                :             {
-<span class="lineNum">    1219 </span><span class="lineCov">              8 :               if (_S_right(__position._M_node) == 0)</span>
-<span class="lineNum">    1220 </span><span class="lineCov">              4 :                 return _M_insert_(0, __position._M_node, __v);</span>
-<span class="lineNum">    1221 </span>                :               else
-<span class="lineNum">    1222 </span><span class="lineCov">              4 :                 return _M_insert_(__after._M_node, __after._M_node, __v);</span>
-<span class="lineNum">    1223 </span>                :             }
-<span class="lineNum">    1224 </span>                :           else
-<span class="lineNum">    1225 </span><span class="lineCov">            881 :             return _M_insert_unique(__v).first;</span>
-<span class="lineNum">    1226 </span>                :         }
-<span class="lineNum">    1227 </span>                :       else
-<span class="lineNum">    1228 </span>                :         // Equivalent keys.
-<span class="lineNum">    1229 </span>                :         return iterator(static_cast&lt;_Link_type&gt;
-<span class="lineNum">    1230 </span><span class="lineNoCov">              0 :                         (const_cast&lt;_Base_ptr&gt;(__position._M_node)));</span>
-<span class="lineNum">    1231 </span>                :     }
-<span class="lineNum">    1232 </span>                : 
-<span class="lineNum">    1233 </span>                :   template&lt;typename _Key, typename _Val, typename _KeyOfValue,
-<span class="lineNum">    1234 </span>                :            typename _Compare, typename _Alloc&gt;
-<span class="lineNum">    1235 </span>                :     typename _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;::iterator
-<span class="lineNum">    1236 </span>                :     _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;::
-<span class="lineNum">    1237 </span>                :     _M_insert_equal_(const_iterator __position, const _Val&amp; __v)
-<span class="lineNum">    1238 </span>                :     {
-<span class="lineNum">    1239 </span>                :       // end()
-<span class="lineNum">    1240 </span>                :       if (__position._M_node == _M_end())
-<span class="lineNum">    1241 </span>                :         {
-<span class="lineNum">    1242 </span>                :           if (size() &gt; 0
-<span class="lineNum">    1243 </span>                :               &amp;&amp; !_M_impl._M_key_compare(_KeyOfValue()(__v),
-<span class="lineNum">    1244 </span>                :                                          _S_key(_M_rightmost())))
-<span class="lineNum">    1245 </span>                :             return _M_insert_(0, _M_rightmost(), __v);
-<span class="lineNum">    1246 </span>                :           else
-<span class="lineNum">    1247 </span>                :             return _M_insert_equal(__v);
-<span class="lineNum">    1248 </span>                :         }
-<span class="lineNum">    1249 </span>                :       else if (!_M_impl._M_key_compare(_S_key(__position._M_node),
-<span class="lineNum">    1250 </span>                :                                        _KeyOfValue()(__v)))
-<span class="lineNum">    1251 </span>                :         {
-<span class="lineNum">    1252 </span>                :           // First, try before...
-<span class="lineNum">    1253 </span>                :           const_iterator __before = __position;
-<span class="lineNum">    1254 </span>                :           if (__position._M_node == _M_leftmost()) // begin()
-<span class="lineNum">    1255 </span>                :             return _M_insert_(_M_leftmost(), _M_leftmost(), __v);
-<span class="lineNum">    1256 </span>                :           else if (!_M_impl._M_key_compare(_KeyOfValue()(__v),
-<span class="lineNum">    1257 </span>                :                                            _S_key((--__before)._M_node)))
-<span class="lineNum">    1258 </span>                :             {
-<span class="lineNum">    1259 </span>                :               if (_S_right(__before._M_node) == 0)
-<span class="lineNum">    1260 </span>                :                 return _M_insert_(0, __before._M_node, __v);
-<span class="lineNum">    1261 </span>                :               else
-<span class="lineNum">    1262 </span>                :                 return _M_insert_(__position._M_node,
-<span class="lineNum">    1263 </span>                :                                   __position._M_node, __v);
-<span class="lineNum">    1264 </span>                :             }
-<span class="lineNum">    1265 </span>                :           else
-<span class="lineNum">    1266 </span>                :             return _M_insert_equal(__v);
-<span class="lineNum">    1267 </span>                :         }
-<span class="lineNum">    1268 </span>                :       else
-<span class="lineNum">    1269 </span>                :         {
-<span class="lineNum">    1270 </span>                :           // ... then try after.  
-<span class="lineNum">    1271 </span>                :           const_iterator __after = __position;
-<span class="lineNum">    1272 </span>                :           if (__position._M_node == _M_rightmost())
-<span class="lineNum">    1273 </span>                :             return _M_insert_(0, _M_rightmost(), __v);
-<span class="lineNum">    1274 </span>                :           else if (!_M_impl._M_key_compare(_S_key((++__after)._M_node),
-<span class="lineNum">    1275 </span>                :                                            _KeyOfValue()(__v)))
-<span class="lineNum">    1276 </span>                :             {
-<span class="lineNum">    1277 </span>                :               if (_S_right(__position._M_node) == 0)
-<span class="lineNum">    1278 </span>                :                 return _M_insert_(0, __position._M_node, __v);
-<span class="lineNum">    1279 </span>                :               else
-<span class="lineNum">    1280 </span>                :                 return _M_insert_(__after._M_node, __after._M_node, __v);
-<span class="lineNum">    1281 </span>                :             }
-<span class="lineNum">    1282 </span>                :           else
-<span class="lineNum">    1283 </span>                :             return _M_insert_equal_lower(__v);
-<span class="lineNum">    1284 </span>                :         }
-<span class="lineNum">    1285 </span>                :     }
-<span class="lineNum">    1286 </span>                : 
-<span class="lineNum">    1287 </span>                :   template&lt;typename _Key, typename _Val, typename _KoV,
-<span class="lineNum">    1288 </span>                :            typename _Cmp, typename _Alloc&gt;
-<span class="lineNum">    1289 </span>                :     template&lt;class _II&gt;
-<span class="lineNum">    1290 </span>                :       void
-<span class="lineNum">    1291 </span>                :       _Rb_tree&lt;_Key, _Val, _KoV, _Cmp, _Alloc&gt;::
-<span class="lineNum">    1292 </span>                :       _M_insert_unique(_II __first, _II __last)
-<span class="lineNum">    1293 </span>                :       {
-<span class="lineNum">    1294 </span>                :         for (; __first != __last; ++__first)
-<span class="lineNum">    1295 </span>                :           _M_insert_unique_(end(), *__first);
-<span class="lineNum">    1296 </span>                :       }
-<span class="lineNum">    1297 </span>                : 
-<span class="lineNum">    1298 </span>                :   template&lt;typename _Key, typename _Val, typename _KoV,
-<span class="lineNum">    1299 </span>                :            typename _Cmp, typename _Alloc&gt;
-<span class="lineNum">    1300 </span>                :     template&lt;class _II&gt;
-<span class="lineNum">    1301 </span>                :       void
-<span class="lineNum">    1302 </span>                :       _Rb_tree&lt;_Key, _Val, _KoV, _Cmp, _Alloc&gt;::
-<span class="lineNum">    1303 </span>                :       _M_insert_equal(_II __first, _II __last)
-<span class="lineNum">    1304 </span>                :       {
-<span class="lineNum">    1305 </span>                :         for (; __first != __last; ++__first)
-<span class="lineNum">    1306 </span>                :           _M_insert_equal_(end(), *__first);
-<span class="lineNum">    1307 </span>                :       }
-<span class="lineNum">    1308 </span>                : 
-<span class="lineNum">    1309 </span>                :   template&lt;typename _Key, typename _Val, typename _KeyOfValue,
-<span class="lineNum">    1310 </span>                :            typename _Compare, typename _Alloc&gt;
-<span class="lineNum">    1311 </span>                :     inline void
-<span class="lineNum">    1312 </span>                :     _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;::
-<span class="lineNum">    1313 </span><span class="lineNoCov">              0 :     erase(iterator __position)</span>
-<span class="lineNum">    1314 </span>                :     {
-<span class="lineNum">    1315 </span>                :       _Link_type __y =
-<span class="lineNum">    1316 </span>                :         static_cast&lt;_Link_type&gt;(_Rb_tree_rebalance_for_erase
-<span class="lineNum">    1317 </span>                :                                 (__position._M_node,
-<span class="lineNum">    1318 </span><span class="lineNoCov">              0 :                                  this-&gt;_M_impl._M_header));</span>
-<span class="lineNum">    1319 </span><span class="lineNoCov">              0 :       _M_destroy_node(__y);</span>
-<span class="lineNum">    1320 </span><span class="lineNoCov">              0 :       --_M_impl._M_node_count;</span>
-<span class="lineNum">    1321 </span><span class="lineNoCov">              0 :     }</span>
-<span class="lineNum">    1322 </span>                : 
-<span class="lineNum">    1323 </span>                :   template&lt;typename _Key, typename _Val, typename _KeyOfValue,
-<span class="lineNum">    1324 </span>                :            typename _Compare, typename _Alloc&gt;
-<span class="lineNum">    1325 </span>                :     inline void
-<span class="lineNum">    1326 </span>                :     _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;::
-<span class="lineNum">    1327 </span><span class="lineCov">            129 :     erase(const_iterator __position)</span>
-<span class="lineNum">    1328 </span>                :     {
-<span class="lineNum">    1329 </span>                :       _Link_type __y =
-<span class="lineNum">    1330 </span>                :         static_cast&lt;_Link_type&gt;(_Rb_tree_rebalance_for_erase
-<span class="lineNum">    1331 </span>                :                                 (const_cast&lt;_Base_ptr&gt;(__position._M_node),
-<span class="lineNum">    1332 </span><span class="lineCov">            129 :                                  this-&gt;_M_impl._M_header));</span>
-<span class="lineNum">    1333 </span><span class="lineCov">            129 :       _M_destroy_node(__y);</span>
-<span class="lineNum">    1334 </span><span class="lineCov">            129 :       --_M_impl._M_node_count;</span>
-<span class="lineNum">    1335 </span><span class="lineCov">            129 :     }</span>
-<span class="lineNum">    1336 </span>                : 
-<span class="lineNum">    1337 </span>                :   template&lt;typename _Key, typename _Val, typename _KeyOfValue,
-<span class="lineNum">    1338 </span>                :            typename _Compare, typename _Alloc&gt;
-<span class="lineNum">    1339 </span>                :     typename _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;::size_type
-<span class="lineNum">    1340 </span>                :     _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;::
-<span class="lineNum">    1341 </span><span class="lineCov">              9 :     erase(const _Key&amp; __x)</span>
-<span class="lineNum">    1342 </span>                :     {
-<span class="lineNum">    1343 </span><span class="lineCov">              9 :       pair&lt;iterator, iterator&gt; __p = equal_range(__x);</span>
-<span class="lineNum">    1344 </span><span class="lineCov">              9 :       const size_type __old_size = size();</span>
-<span class="lineNum">    1345 </span><span class="lineCov">              9 :       erase(__p.first, __p.second);</span>
-<span class="lineNum">    1346 </span><span class="lineCov">              9 :       return __old_size - size();</span>
-<span class="lineNum">    1347 </span>                :     }
-<span class="lineNum">    1348 </span>                : 
-<span class="lineNum">    1349 </span>                :   template&lt;typename _Key, typename _Val, typename _KeyOfValue,
-<span class="lineNum">    1350 </span>                :            typename _Compare, typename _Alloc&gt;
-<span class="lineNum">    1351 </span>                :     void
-<span class="lineNum">    1352 </span>                :     _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;::
-<span class="lineNum">    1353 </span><span class="lineCov">              9 :     erase(iterator __first, iterator __last)</span>
-<span class="lineNum">    1354 </span>                :     {
-<span class="lineNum">    1355 </span><span class="lineCov">              9 :       if (__first == begin() &amp;&amp; __last == end())</span>
-<span class="lineNum">    1356 </span><span class="lineCov">              7 :         clear();</span>
-<span class="lineNum">    1357 </span>                :       else
-<span class="lineNum">    1358 </span><span class="lineCov">              4 :         while (__first != __last)</span>
-<span class="lineNum">    1359 </span><span class="lineNoCov">              0 :           erase(__first++);</span>
-<span class="lineNum">    1360 </span><span class="lineCov">              9 :     }</span>
-<span class="lineNum">    1361 </span>                : 
-<span class="lineNum">    1362 </span>                :   template&lt;typename _Key, typename _Val, typename _KeyOfValue,
-<span class="lineNum">    1363 </span>                :            typename _Compare, typename _Alloc&gt;
-<span class="lineNum">    1364 </span>                :     void
-<span class="lineNum">    1365 </span>                :     _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;::
-<span class="lineNum">    1366 </span>                :     erase(const_iterator __first, const_iterator __last)
-<span class="lineNum">    1367 </span>                :     {
-<span class="lineNum">    1368 </span>                :       if (__first == begin() &amp;&amp; __last == end())
-<span class="lineNum">    1369 </span>                :         clear();
-<span class="lineNum">    1370 </span>                :       else
-<span class="lineNum">    1371 </span>                :         while (__first != __last)
-<span class="lineNum">    1372 </span>                :           erase(__first++);
-<span class="lineNum">    1373 </span>                :     }
-<span class="lineNum">    1374 </span>                : 
-<span class="lineNum">    1375 </span>                :   template&lt;typename _Key, typename _Val, typename _KeyOfValue,
-<span class="lineNum">    1376 </span>                :            typename _Compare, typename _Alloc&gt;
-<span class="lineNum">    1377 </span>                :     void
-<span class="lineNum">    1378 </span>                :     _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;::
-<span class="lineNum">    1379 </span>                :     erase(const _Key* __first, const _Key* __last)
-<span class="lineNum">    1380 </span>                :     {
-<span class="lineNum">    1381 </span>                :       while (__first != __last)
-<span class="lineNum">    1382 </span>                :         erase(*__first++);
-<span class="lineNum">    1383 </span>                :     }
-<span class="lineNum">    1384 </span>                : 
-<span class="lineNum">    1385 </span>                :   template&lt;typename _Key, typename _Val, typename _KeyOfValue,
-<span class="lineNum">    1386 </span>                :            typename _Compare, typename _Alloc&gt;
-<span class="lineNum">    1387 </span>                :     typename _Rb_tree&lt;_Key, _Val, _KeyOfValue,
-<span class="lineNum">    1388 </span>                :                       _Compare, _Alloc&gt;::iterator
-<span class="lineNum">    1389 </span>                :     _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;::
-<span class="lineNum">    1390 </span><span class="lineCov">          50156 :     find(const _Key&amp; __k)</span>
-<span class="lineNum">    1391 </span>                :     {
-<span class="lineNum">    1392 </span><span class="lineCov">          50156 :       iterator __j = _M_lower_bound(_M_begin(), _M_end(), __k);</span>
-<span class="lineNum">    1393 </span>                :       return (__j == end()
-<span class="lineNum">    1394 </span>                :               || _M_impl._M_key_compare(__k,
-<span class="lineNum">    1395 </span><span class="lineCov">          50156 :                                         _S_key(__j._M_node))) ? end() : __j;</span>
-<span class="lineNum">    1396 </span>                :     }
-<span class="lineNum">    1397 </span>                : 
-<span class="lineNum">    1398 </span>                :   template&lt;typename _Key, typename _Val, typename _KeyOfValue,
-<span class="lineNum">    1399 </span>                :            typename _Compare, typename _Alloc&gt;
-<span class="lineNum">    1400 </span>                :     typename _Rb_tree&lt;_Key, _Val, _KeyOfValue,
-<span class="lineNum">    1401 </span>                :                       _Compare, _Alloc&gt;::const_iterator
-<span class="lineNum">    1402 </span>                :     _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;::
-<span class="lineNum">    1403 </span><span class="lineCov">           3932 :     find(const _Key&amp; __k) const</span>
-<span class="lineNum">    1404 </span>                :     {
-<span class="lineNum">    1405 </span><span class="lineCov">           3932 :       const_iterator __j = _M_lower_bound(_M_begin(), _M_end(), __k);</span>
-<span class="lineNum">    1406 </span>                :       return (__j == end()
-<span class="lineNum">    1407 </span>                :               || _M_impl._M_key_compare(__k, 
-<span class="lineNum">    1408 </span><span class="lineCov">           3932 :                                         _S_key(__j._M_node))) ? end() : __j;</span>
-<span class="lineNum">    1409 </span>                :     }
-<span class="lineNum">    1410 </span>                : 
-<span class="lineNum">    1411 </span>                :   template&lt;typename _Key, typename _Val, typename _KeyOfValue,
-<span class="lineNum">    1412 </span>                :            typename _Compare, typename _Alloc&gt;
-<span class="lineNum">    1413 </span>                :     typename _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;::size_type
-<span class="lineNum">    1414 </span>                :     _Rb_tree&lt;_Key, _Val, _KeyOfValue, _Compare, _Alloc&gt;::
-<span class="lineNum">    1415 </span>                :     count(const _Key&amp; __k) const
-<span class="lineNum">    1416 </span>                :     {
-<span class="lineNum">    1417 </span>                :       pair&lt;const_iterator, const_iterator&gt; __p = equal_range(__k);
-<span class="lineNum">    1418 </span>                :       const size_type __n = std::distance(__p.first, __p.second);
-<span class="lineNum">    1419 </span>                :       return __n;
-<span class="lineNum">    1420 </span>                :     }
-<span class="lineNum">    1421 </span>                : 
-<span class="lineNum">    1422 </span>                :   unsigned int
-<span class="lineNum">    1423 </span>                :   _Rb_tree_black_count(const _Rb_tree_node_base* __node,
-<span class="lineNum">    1424 </span>                :                        const _Rb_tree_node_base* __root);
-<span class="lineNum">    1425 </span>                : 
-<span class="lineNum">    1426 </span>                :   template&lt;typename _Key, typename _Val, typename _KeyOfValue,
-<span class="lineNum">    1427 </span>                :            typename _Compare, typename _Alloc&gt;
-<span class="lineNum">    1428 </span>                :     bool
-<span class="lineNum">    1429 </span>                :     _Rb_tree&lt;_Key,_Val,_KeyOfValue,_Compare,_Alloc&gt;::__rb_verify() const
-<span class="lineNum">    1430 </span>                :     {
-<span class="lineNum">    1431 </span>                :       if (_M_impl._M_node_count == 0 || begin() == end())
-<span class="lineNum">    1432 </span>                :         return _M_impl._M_node_count == 0 &amp;&amp; begin() == end()
-<span class="lineNum">    1433 </span>                :                &amp;&amp; this-&gt;_M_impl._M_header._M_left == _M_end()
-<span class="lineNum">    1434 </span>                :                &amp;&amp; this-&gt;_M_impl._M_header._M_right == _M_end();
-<span class="lineNum">    1435 </span>                : 
-<span class="lineNum">    1436 </span>                :       unsigned int __len = _Rb_tree_black_count(_M_leftmost(), _M_root());
-<span class="lineNum">    1437 </span>                :       for (const_iterator __it = begin(); __it != end(); ++__it)
-<span class="lineNum">    1438 </span>                :         {
-<span class="lineNum">    1439 </span>                :           _Const_Link_type __x = static_cast&lt;_Const_Link_type&gt;(__it._M_node);
-<span class="lineNum">    1440 </span>                :           _Const_Link_type __L = _S_left(__x);
-<span class="lineNum">    1441 </span>                :           _Const_Link_type __R = _S_right(__x);
-<span class="lineNum">    1442 </span>                : 
-<span class="lineNum">    1443 </span>                :           if (__x-&gt;_M_color == _S_red)
-<span class="lineNum">    1444 </span>                :             if ((__L &amp;&amp; __L-&gt;_M_color == _S_red)
-<span class="lineNum">    1445 </span>                :                 || (__R &amp;&amp; __R-&gt;_M_color == _S_red))
-<span class="lineNum">    1446 </span>                :               return false;
-<span class="lineNum">    1447 </span>                : 
-<span class="lineNum">    1448 </span>                :           if (__L &amp;&amp; _M_impl._M_key_compare(_S_key(__x), _S_key(__L)))
-<span class="lineNum">    1449 </span>                :             return false;
-<span class="lineNum">    1450 </span>                :           if (__R &amp;&amp; _M_impl._M_key_compare(_S_key(__R), _S_key(__x)))
-<span class="lineNum">    1451 </span>                :             return false;
-<span class="lineNum">    1452 </span>                : 
-<span class="lineNum">    1453 </span>                :           if (!__L &amp;&amp; !__R &amp;&amp; _Rb_tree_black_count(__x, _M_root()) != __len)
-<span class="lineNum">    1454 </span>                :             return false;
-<span class="lineNum">    1455 </span>                :         }
-<span class="lineNum">    1456 </span>                : 
-<span class="lineNum">    1457 </span>                :       if (_M_leftmost() != _Rb_tree_node_base::_S_minimum(_M_root()))
-<span class="lineNum">    1458 </span>                :         return false;
-<span class="lineNum">    1459 </span>                :       if (_M_rightmost() != _Rb_tree_node_base::_S_maximum(_M_root()))
-<span class="lineNum">    1460 </span>                :         return false;
-<span class="lineNum">    1461 </span>                :       return true;
-<span class="lineNum">    1462 </span>                :     }
-<span class="lineNum">    1463 </span>                : 
-<span class="lineNum">    1464 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">    1465 </span>                : 
-<span class="lineNum">    1466 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/bits/stl_uninitialized.h.gcov.html b/rep/usr/include/c++/4.3/bits/stl_uninitialized.h.gcov.html
deleted file mode 100644
index 08dd2e7..0000000
--- a/rep/usr/include/c++/4.3/bits/stl_uninitialized.h.gcov.html
+++ /dev/null
@@ -1,503 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_uninitialized.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_uninitialized.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">43</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">58.1 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">25</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // Raw memory manipulators -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007
-<span class="lineNum">       4 </span>                : // Free Software Foundation, Inc.
-<span class="lineNum">       5 </span>                : //
-<span class="lineNum">       6 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       7 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       8 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">       9 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      10 </span>                : // any later version.
-<span class="lineNum">      11 </span>                : 
-<span class="lineNum">      12 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      13 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      14 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      15 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      16 </span>                : 
-<span class="lineNum">      17 </span>                : // You should have received a copy of the GNU General Public License along
-<span class="lineNum">      18 </span>                : // with this library; see the file COPYING.  If not, write to the Free
-<span class="lineNum">      19 </span>                : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-<span class="lineNum">      20 </span>                : // USA.
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      23 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      24 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      25 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      26 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      27 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      28 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      29 </span>                : // the GNU General Public License.
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : /*
-<span class="lineNum">      32 </span>                :  *
-<span class="lineNum">      33 </span>                :  * Copyright (c) 1994
-<span class="lineNum">      34 </span>                :  * Hewlett-Packard Company
-<span class="lineNum">      35 </span>                :  *
-<span class="lineNum">      36 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      37 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      38 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      39 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      40 </span>                :  * in supporting documentation.  Hewlett-Packard Company makes no
-<span class="lineNum">      41 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      42 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      43 </span>                :  *
-<span class="lineNum">      44 </span>                :  *
-<span class="lineNum">      45 </span>                :  * Copyright (c) 1996,1997
-<span class="lineNum">      46 </span>                :  * Silicon Graphics Computer Systems, Inc.
-<span class="lineNum">      47 </span>                :  *
-<span class="lineNum">      48 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      49 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      50 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      51 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      52 </span>                :  * in supporting documentation.  Silicon Graphics makes no
-<span class="lineNum">      53 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      54 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      55 </span>                :  */
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span>                : /** @file stl_uninitialized.h
-<span class="lineNum">      58 </span>                :  *  This is an internal header file, included by other library headers.
-<span class="lineNum">      59 </span>                :  *  You should not attempt to use it directly.
-<span class="lineNum">      60 </span>                :  */
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span>                : #ifndef _STL_UNINITIALIZED_H
-<span class="lineNum">      63 </span>                : #define _STL_UNINITIALIZED_H 1
-<span class="lineNum">      64 </span>                : 
-<span class="lineNum">      65 </span>                : _GLIBCXX_BEGIN_NAMESPACE(std)
-<span class="lineNum">      66 </span>                : 
-<span class="lineNum">      67 </span>                :   template&lt;bool&gt;
-<span class="lineNum">      68 </span>                :     struct __uninitialized_copy
-<span class="lineNum">      69 </span>                :     {
-<span class="lineNum">      70 </span>                :       template&lt;typename _InputIterator, typename _ForwardIterator&gt;
-<span class="lineNum">      71 </span>                :         static _ForwardIterator
-<span class="lineNum">      72 </span>                :         uninitialized_copy(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">      73 </span><span class="lineCov">          36673 :                            _ForwardIterator __result)</span>
-<span class="lineNum">      74 </span>                :         {
-<span class="lineNum">      75 </span><span class="lineCov">          36673 :           _ForwardIterator __cur = __result;</span>
-<span class="lineNum">      76 </span>                :           try
-<span class="lineNum">      77 </span>                :             {
-<span class="lineNum">      78 </span><span class="lineCov">          84888 :               for (; __first != __last; ++__first, ++__cur)</span>
-<span class="lineNum">      79 </span><span class="lineCov">          48215 :                 ::new(static_cast&lt;void*&gt;(&amp;*__cur)) typename</span>
-<span class="lineNum">      80 </span>                :                     iterator_traits&lt;_ForwardIterator&gt;::value_type(*__first);
-<span class="lineNum">      81 </span><span class="lineCov">          36660 :               return __cur;</span>
-<span class="lineNum">      82 </span>                :             }
-<span class="lineNum">      83 </span><span class="lineNoCov">              0 :           catch(...)</span>
-<span class="lineNum">      84 </span>                :             {
-<span class="lineNum">      85 </span><span class="lineNoCov">              0 :               std::_Destroy(__result, __cur);</span>
-<span class="lineNum">      86 </span><span class="lineNoCov">              0 :               __throw_exception_again;</span>
-<span class="lineNum">      87 </span>                :             }
-<span class="lineNum">      88 </span>                :         }
-<span class="lineNum">      89 </span>                :     };
-<span class="lineNum">      90 </span>                : 
-<span class="lineNum">      91 </span>                :   template&lt;&gt;
-<span class="lineNum">      92 </span>                :     struct __uninitialized_copy&lt;true&gt;
-<span class="lineNum">      93 </span>                :     {
-<span class="lineNum">      94 </span>                :       template&lt;typename _InputIterator, typename _ForwardIterator&gt;
-<span class="lineNum">      95 </span>                :         static _ForwardIterator
-<span class="lineNum">      96 </span>                :         uninitialized_copy(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">      97 </span><span class="lineCov">          27152 :                            _ForwardIterator __result)</span>
-<span class="lineNum">      98 </span><span class="lineCov">          27152 :         { return std::copy(__first, __last, __result); }</span>
-<span class="lineNum">      99 </span>                :     };
-<span class="lineNum">     100 </span>                : 
-<span class="lineNum">     101 </span>                :   /**
-<span class="lineNum">     102 </span>                :    *  @brief Copies the range [first,last) into result.
-<span class="lineNum">     103 </span>                :    *  @param  first  An input iterator.
-<span class="lineNum">     104 </span>                :    *  @param  last   An input iterator.
-<span class="lineNum">     105 </span>                :    *  @param  result An output iterator.
-<span class="lineNum">     106 </span>                :    *  @return   result + (first - last)
-<span class="lineNum">     107 </span>                :    *
-<span class="lineNum">     108 </span>                :    *  Like copy(), but does not require an initialized output range.
-<span class="lineNum">     109 </span>                :   */
-<span class="lineNum">     110 </span>                :   template&lt;typename _InputIterator, typename _ForwardIterator&gt;
-<span class="lineNum">     111 </span>                :     inline _ForwardIterator
-<span class="lineNum">     112 </span>                :     uninitialized_copy(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">     113 </span><span class="lineCov">          63825 :                        _ForwardIterator __result)</span>
-<span class="lineNum">     114 </span>                :     {
-<span class="lineNum">     115 </span>                :       typedef typename iterator_traits&lt;_InputIterator&gt;::value_type
-<span class="lineNum">     116 </span>                :         _ValueType1;
-<span class="lineNum">     117 </span>                :       typedef typename iterator_traits&lt;_ForwardIterator&gt;::value_type
-<span class="lineNum">     118 </span>                :         _ValueType2;
-<span class="lineNum">     119 </span>                : 
-<span class="lineNum">     120 </span>                :       return std::__uninitialized_copy&lt;(__is_pod(_ValueType1)
-<span class="lineNum">     121 </span>                :                                         &amp;&amp; __is_pod(_ValueType2))&gt;::
-<span class="lineNum">     122 </span><span class="lineCov">          63825 :         uninitialized_copy(__first, __last, __result);</span>
-<span class="lineNum">     123 </span>                :     }
-<span class="lineNum">     124 </span>                : 
-<span class="lineNum">     125 </span>                : 
-<span class="lineNum">     126 </span>                :   template&lt;bool&gt;
-<span class="lineNum">     127 </span>                :     struct __uninitialized_fill
-<span class="lineNum">     128 </span>                :     {
-<span class="lineNum">     129 </span>                :       template&lt;typename _ForwardIterator, typename _Tp&gt;
-<span class="lineNum">     130 </span>                :         static void
-<span class="lineNum">     131 </span>                :         uninitialized_fill(_ForwardIterator __first,
-<span class="lineNum">     132 </span>                :                            _ForwardIterator __last, const _Tp&amp; __x)
-<span class="lineNum">     133 </span>                :         {
-<span class="lineNum">     134 </span>                :           _ForwardIterator __cur = __first;
-<span class="lineNum">     135 </span>                :           try
-<span class="lineNum">     136 </span>                :             {
-<span class="lineNum">     137 </span>                :               for (; __cur != __last; ++__cur)
-<span class="lineNum">     138 </span>                :                 std::_Construct(&amp;*__cur, __x);
-<span class="lineNum">     139 </span>                :             }
-<span class="lineNum">     140 </span>                :           catch(...)
-<span class="lineNum">     141 </span>                :             {
-<span class="lineNum">     142 </span>                :               std::_Destroy(__first, __cur);
-<span class="lineNum">     143 </span>                :               __throw_exception_again;
-<span class="lineNum">     144 </span>                :             }
-<span class="lineNum">     145 </span>                :         }
-<span class="lineNum">     146 </span>                :     };
-<span class="lineNum">     147 </span>                : 
-<span class="lineNum">     148 </span>                :   template&lt;&gt;
-<span class="lineNum">     149 </span>                :     struct __uninitialized_fill&lt;true&gt;
-<span class="lineNum">     150 </span>                :     {
-<span class="lineNum">     151 </span>                :       template&lt;typename _ForwardIterator, typename _Tp&gt;
-<span class="lineNum">     152 </span>                :         static void
-<span class="lineNum">     153 </span>                :         uninitialized_fill(_ForwardIterator __first,
-<span class="lineNum">     154 </span>                :                            _ForwardIterator __last, const _Tp&amp; __x)
-<span class="lineNum">     155 </span>                :         { std::fill(__first, __last, __x); }
-<span class="lineNum">     156 </span>                :     };
-<span class="lineNum">     157 </span>                : 
-<span class="lineNum">     158 </span>                :   /**
-<span class="lineNum">     159 </span>                :    *  @brief Copies the value x into the range [first,last).
-<span class="lineNum">     160 </span>                :    *  @param  first  An input iterator.
-<span class="lineNum">     161 </span>                :    *  @param  last   An input iterator.
-<span class="lineNum">     162 </span>                :    *  @param  x      The source value.
-<span class="lineNum">     163 </span>                :    *  @return   Nothing.
-<span class="lineNum">     164 </span>                :    *
-<span class="lineNum">     165 </span>                :    *  Like fill(), but does not require an initialized output range.
-<span class="lineNum">     166 </span>                :   */
-<span class="lineNum">     167 </span>                :   template&lt;typename _ForwardIterator, typename _Tp&gt;
-<span class="lineNum">     168 </span>                :     inline void
-<span class="lineNum">     169 </span>                :     uninitialized_fill(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">     170 </span>                :                        const _Tp&amp; __x)
-<span class="lineNum">     171 </span>                :     {
-<span class="lineNum">     172 </span>                :       typedef typename iterator_traits&lt;_ForwardIterator&gt;::value_type
-<span class="lineNum">     173 </span>                :         _ValueType;
-<span class="lineNum">     174 </span>                : 
-<span class="lineNum">     175 </span>                :       std::__uninitialized_fill&lt;__is_pod(_ValueType)&gt;::
-<span class="lineNum">     176 </span>                :         uninitialized_fill(__first, __last, __x);
-<span class="lineNum">     177 </span>                :     }
-<span class="lineNum">     178 </span>                : 
-<span class="lineNum">     179 </span>                : 
-<span class="lineNum">     180 </span>                :   template&lt;bool&gt;
-<span class="lineNum">     181 </span>                :     struct __uninitialized_fill_n
-<span class="lineNum">     182 </span>                :     {
-<span class="lineNum">     183 </span>                :       template&lt;typename _ForwardIterator, typename _Size, typename _Tp&gt;
-<span class="lineNum">     184 </span>                :         static void
-<span class="lineNum">     185 </span>                :         uninitialized_fill_n(_ForwardIterator __first, _Size __n,
-<span class="lineNum">     186 </span><span class="lineCov">          22443 :                              const _Tp&amp; __x)</span>
-<span class="lineNum">     187 </span>                :         {
-<span class="lineNum">     188 </span><span class="lineCov">          22443 :           _ForwardIterator __cur = __first;</span>
-<span class="lineNum">     189 </span>                :           try
-<span class="lineNum">     190 </span>                :             {
-<span class="lineNum">     191 </span><span class="lineCov">          46138 :               for (; __n &gt; 0; --__n, ++__cur)</span>
-<span class="lineNum">     192 </span><span class="lineCov">          23695 :                 std::_Construct(&amp;*__cur, __x);</span>
-<span class="lineNum">     193 </span>                :             }
-<span class="lineNum">     194 </span><span class="lineNoCov">              0 :           catch(...)</span>
-<span class="lineNum">     195 </span>                :             {
-<span class="lineNum">     196 </span><span class="lineNoCov">              0 :               std::_Destroy(__first, __cur);</span>
-<span class="lineNum">     197 </span><span class="lineNoCov">              0 :               __throw_exception_again;</span>
-<span class="lineNum">     198 </span>                :             }
-<span class="lineNum">     199 </span><span class="lineCov">          22443 :         }</span>
-<span class="lineNum">     200 </span>                :     };
-<span class="lineNum">     201 </span>                : 
-<span class="lineNum">     202 </span>                :   template&lt;&gt;
-<span class="lineNum">     203 </span>                :     struct __uninitialized_fill_n&lt;true&gt;
-<span class="lineNum">     204 </span>                :     {
-<span class="lineNum">     205 </span>                :       template&lt;typename _ForwardIterator, typename _Size, typename _Tp&gt;
-<span class="lineNum">     206 </span>                :         static void
-<span class="lineNum">     207 </span>                :         uninitialized_fill_n(_ForwardIterator __first, _Size __n,
-<span class="lineNum">     208 </span><span class="lineCov">              9 :                              const _Tp&amp; __x)</span>
-<span class="lineNum">     209 </span><span class="lineCov">              9 :         { std::fill_n(__first, __n, __x); }</span>
-<span class="lineNum">     210 </span>                :     };
-<span class="lineNum">     211 </span>                : 
-<span class="lineNum">     212 </span>                :   /**
-<span class="lineNum">     213 </span>                :    *  @brief Copies the value x into the range [first,first+n).
-<span class="lineNum">     214 </span>                :    *  @param  first  An input iterator.
-<span class="lineNum">     215 </span>                :    *  @param  n      The number of copies to make.
-<span class="lineNum">     216 </span>                :    *  @param  x      The source value.
-<span class="lineNum">     217 </span>                :    *  @return   Nothing.
-<span class="lineNum">     218 </span>                :    *
-<span class="lineNum">     219 </span>                :    *  Like fill_n(), but does not require an initialized output range.
-<span class="lineNum">     220 </span>                :   */
-<span class="lineNum">     221 </span>                :   template&lt;typename _ForwardIterator, typename _Size, typename _Tp&gt;
-<span class="lineNum">     222 </span>                :     inline void
-<span class="lineNum">     223 </span><span class="lineCov">          22452 :     uninitialized_fill_n(_ForwardIterator __first, _Size __n, const _Tp&amp; __x)</span>
-<span class="lineNum">     224 </span>                :     {
-<span class="lineNum">     225 </span>                :       typedef typename iterator_traits&lt;_ForwardIterator&gt;::value_type
-<span class="lineNum">     226 </span>                :         _ValueType;
-<span class="lineNum">     227 </span>                : 
-<span class="lineNum">     228 </span><span class="lineCov">          22452 :       std::__uninitialized_fill_n&lt;__is_pod(_ValueType)&gt;::</span>
-<span class="lineNum">     229 </span>                :         uninitialized_fill_n(__first, __n, __x);
-<span class="lineNum">     230 </span><span class="lineCov">          22452 :     }</span>
-<span class="lineNum">     231 </span>                : 
-<span class="lineNum">     232 </span>                :   // Extensions: versions of uninitialized_copy, uninitialized_fill,
-<span class="lineNum">     233 </span>                :   //  and uninitialized_fill_n that take an allocator parameter.
-<span class="lineNum">     234 </span>                :   //  We dispatch back to the standard versions when we're given the
-<span class="lineNum">     235 </span>                :   //  default allocator.  For nondefault allocators we do not use 
-<span class="lineNum">     236 </span>                :   //  any of the POD optimizations.
-<span class="lineNum">     237 </span>                : 
-<span class="lineNum">     238 </span>                :   template&lt;typename _InputIterator, typename _ForwardIterator,
-<span class="lineNum">     239 </span>                :            typename _Allocator&gt;
-<span class="lineNum">     240 </span>                :     _ForwardIterator
-<span class="lineNum">     241 </span>                :     __uninitialized_copy_a(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">     242 </span>                :                            _ForwardIterator __result, _Allocator&amp; __alloc)
-<span class="lineNum">     243 </span>                :     {
-<span class="lineNum">     244 </span>                :       _ForwardIterator __cur = __result;
-<span class="lineNum">     245 </span>                :       try
-<span class="lineNum">     246 </span>                :         {
-<span class="lineNum">     247 </span>                :           for (; __first != __last; ++__first, ++__cur)
-<span class="lineNum">     248 </span>                :             __alloc.construct(&amp;*__cur, *__first);
-<span class="lineNum">     249 </span>                :           return __cur;
-<span class="lineNum">     250 </span>                :         }
-<span class="lineNum">     251 </span>                :       catch(...)
-<span class="lineNum">     252 </span>                :         {
-<span class="lineNum">     253 </span>                :           std::_Destroy(__result, __cur, __alloc);
-<span class="lineNum">     254 </span>                :           __throw_exception_again;
-<span class="lineNum">     255 </span>                :         }
-<span class="lineNum">     256 </span>                :     }
-<span class="lineNum">     257 </span>                : 
-<span class="lineNum">     258 </span>                :   template&lt;typename _InputIterator, typename _ForwardIterator, typename _Tp&gt;
-<span class="lineNum">     259 </span>                :     inline _ForwardIterator
-<span class="lineNum">     260 </span>                :     __uninitialized_copy_a(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">     261 </span><span class="lineCov">          63825 :                            _ForwardIterator __result, allocator&lt;_Tp&gt;&amp;)</span>
-<span class="lineNum">     262 </span><span class="lineCov">          63825 :     { return std::uninitialized_copy(__first, __last, __result); }</span>
-<span class="lineNum">     263 </span>                : 
-<span class="lineNum">     264 </span>                :   template&lt;typename _InputIterator, typename _ForwardIterator,
-<span class="lineNum">     265 </span>                :            typename _Allocator&gt;
-<span class="lineNum">     266 </span>                :     inline _ForwardIterator
-<span class="lineNum">     267 </span>                :     __uninitialized_move_a(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">     268 </span><span class="lineCov">          63802 :                            _ForwardIterator __result, _Allocator&amp; __alloc)</span>
-<span class="lineNum">     269 </span>                :     {
-<span class="lineNum">     270 </span>                :       return std::__uninitialized_copy_a(_GLIBCXX_MAKE_MOVE_ITERATOR(__first),
-<span class="lineNum">     271 </span>                :                                          _GLIBCXX_MAKE_MOVE_ITERATOR(__last),
-<span class="lineNum">     272 </span><span class="lineCov">          63802 :                                          __result, __alloc);</span>
-<span class="lineNum">     273 </span>                :     }
-<span class="lineNum">     274 </span>                : 
-<span class="lineNum">     275 </span>                :   template&lt;typename _ForwardIterator, typename _Tp, typename _Allocator&gt;
-<span class="lineNum">     276 </span>                :     void
-<span class="lineNum">     277 </span>                :     __uninitialized_fill_a(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">     278 </span>                :                            const _Tp&amp; __x, _Allocator&amp; __alloc)
-<span class="lineNum">     279 </span>                :     {
-<span class="lineNum">     280 </span>                :       _ForwardIterator __cur = __first;
-<span class="lineNum">     281 </span>                :       try
-<span class="lineNum">     282 </span>                :         {
-<span class="lineNum">     283 </span>                :           for (; __cur != __last; ++__cur)
-<span class="lineNum">     284 </span>                :             __alloc.construct(&amp;*__cur, __x);
-<span class="lineNum">     285 </span>                :         }
-<span class="lineNum">     286 </span>                :       catch(...)
-<span class="lineNum">     287 </span>                :         {
-<span class="lineNum">     288 </span>                :           std::_Destroy(__first, __cur, __alloc);
-<span class="lineNum">     289 </span>                :           __throw_exception_again;
-<span class="lineNum">     290 </span>                :         }
-<span class="lineNum">     291 </span>                :     }
-<span class="lineNum">     292 </span>                : 
-<span class="lineNum">     293 </span>                :   template&lt;typename _ForwardIterator, typename _Tp, typename _Tp2&gt;
-<span class="lineNum">     294 </span>                :     inline void
-<span class="lineNum">     295 </span>                :     __uninitialized_fill_a(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">     296 </span>                :                            const _Tp&amp; __x, allocator&lt;_Tp2&gt;&amp;)
-<span class="lineNum">     297 </span>                :     { std::uninitialized_fill(__first, __last, __x); }
-<span class="lineNum">     298 </span>                : 
-<span class="lineNum">     299 </span>                :   template&lt;typename _ForwardIterator, typename _Size, typename _Tp,
-<span class="lineNum">     300 </span>                :            typename _Allocator&gt;
-<span class="lineNum">     301 </span>                :     void
-<span class="lineNum">     302 </span>                :     __uninitialized_fill_n_a(_ForwardIterator __first, _Size __n, 
-<span class="lineNum">     303 </span>                :                              const _Tp&amp; __x, _Allocator&amp; __alloc)
-<span class="lineNum">     304 </span>                :     {
-<span class="lineNum">     305 </span>                :       _ForwardIterator __cur = __first;
-<span class="lineNum">     306 </span>                :       try
-<span class="lineNum">     307 </span>                :         {
-<span class="lineNum">     308 </span>                :           for (; __n &gt; 0; --__n, ++__cur)
-<span class="lineNum">     309 </span>                :             __alloc.construct(&amp;*__cur, __x);
-<span class="lineNum">     310 </span>                :         }
-<span class="lineNum">     311 </span>                :       catch(...)
-<span class="lineNum">     312 </span>                :         {
-<span class="lineNum">     313 </span>                :           std::_Destroy(__first, __cur, __alloc);
-<span class="lineNum">     314 </span>                :           __throw_exception_again;
-<span class="lineNum">     315 </span>                :         }
-<span class="lineNum">     316 </span>                :     }
-<span class="lineNum">     317 </span>                : 
-<span class="lineNum">     318 </span>                :   template&lt;typename _ForwardIterator, typename _Size, typename _Tp,
-<span class="lineNum">     319 </span>                :            typename _Tp2&gt;
-<span class="lineNum">     320 </span>                :     inline void
-<span class="lineNum">     321 </span>                :     __uninitialized_fill_n_a(_ForwardIterator __first, _Size __n, 
-<span class="lineNum">     322 </span><span class="lineCov">          22452 :                              const _Tp&amp; __x, allocator&lt;_Tp2&gt;&amp;)</span>
-<span class="lineNum">     323 </span><span class="lineCov">          22452 :     { std::uninitialized_fill_n(__first, __n, __x); }</span>
-<span class="lineNum">     324 </span>                : 
-<span class="lineNum">     325 </span>                : 
-<span class="lineNum">     326 </span>                :   // Extensions: __uninitialized_copy_move, __uninitialized_move_copy,
-<span class="lineNum">     327 </span>                :   // __uninitialized_fill_move, __uninitialized_move_fill.
-<span class="lineNum">     328 </span>                :   // All of these algorithms take a user-supplied allocator, which is used
-<span class="lineNum">     329 </span>                :   // for construction and destruction.
-<span class="lineNum">     330 </span>                : 
-<span class="lineNum">     331 </span>                :   // __uninitialized_copy_move
-<span class="lineNum">     332 </span>                :   // Copies [first1, last1) into [result, result + (last1 - first1)), and
-<span class="lineNum">     333 </span>                :   //  move [first2, last2) into
-<span class="lineNum">     334 </span>                :   //  [result, result + (last1 - first1) + (last2 - first2)).
-<span class="lineNum">     335 </span>                :   template&lt;typename _InputIterator1, typename _InputIterator2,
-<span class="lineNum">     336 </span>                :            typename _ForwardIterator, typename _Allocator&gt;
-<span class="lineNum">     337 </span>                :     inline _ForwardIterator
-<span class="lineNum">     338 </span>                :     __uninitialized_copy_move(_InputIterator1 __first1,
-<span class="lineNum">     339 </span>                :                               _InputIterator1 __last1,
-<span class="lineNum">     340 </span>                :                               _InputIterator2 __first2,
-<span class="lineNum">     341 </span>                :                               _InputIterator2 __last2,
-<span class="lineNum">     342 </span>                :                               _ForwardIterator __result,
-<span class="lineNum">     343 </span><span class="lineNoCov">              0 :                               _Allocator&amp; __alloc)</span>
-<span class="lineNum">     344 </span>                :     {
-<span class="lineNum">     345 </span>                :       _ForwardIterator __mid = std::__uninitialized_copy_a(__first1, __last1,
-<span class="lineNum">     346 </span>                :                                                            __result,
-<span class="lineNum">     347 </span><span class="lineNoCov">              0 :                                                            __alloc);</span>
-<span class="lineNum">     348 </span>                :       try
-<span class="lineNum">     349 </span>                :         {
-<span class="lineNum">     350 </span><span class="lineNoCov">              0 :           return std::__uninitialized_move_a(__first2, __last2, __mid, __alloc);</span>
-<span class="lineNum">     351 </span>                :         }
-<span class="lineNum">     352 </span><span class="lineNoCov">              0 :       catch(...)</span>
-<span class="lineNum">     353 </span>                :         {
-<span class="lineNum">     354 </span><span class="lineNoCov">              0 :           std::_Destroy(__result, __mid, __alloc);</span>
-<span class="lineNum">     355 </span><span class="lineNoCov">              0 :           __throw_exception_again;</span>
-<span class="lineNum">     356 </span>                :         }
-<span class="lineNum">     357 </span>                :     }
-<span class="lineNum">     358 </span>                : 
-<span class="lineNum">     359 </span>                :   // __uninitialized_move_copy
-<span class="lineNum">     360 </span>                :   // Moves [first1, last1) into [result, result + (last1 - first1)), and
-<span class="lineNum">     361 </span>                :   //  copies [first2, last2) into
-<span class="lineNum">     362 </span>                :   //  [result, result + (last1 - first1) + (last2 - first2)).
-<span class="lineNum">     363 </span>                :   template&lt;typename _InputIterator1, typename _InputIterator2,
-<span class="lineNum">     364 </span>                :            typename _ForwardIterator, typename _Allocator&gt;
-<span class="lineNum">     365 </span>                :     inline _ForwardIterator
-<span class="lineNum">     366 </span>                :     __uninitialized_move_copy(_InputIterator1 __first1,
-<span class="lineNum">     367 </span>                :                               _InputIterator1 __last1,
-<span class="lineNum">     368 </span>                :                               _InputIterator2 __first2,
-<span class="lineNum">     369 </span>                :                               _InputIterator2 __last2,
-<span class="lineNum">     370 </span>                :                               _ForwardIterator __result,
-<span class="lineNum">     371 </span><span class="lineNoCov">              0 :                               _Allocator&amp; __alloc)</span>
-<span class="lineNum">     372 </span>                :     {
-<span class="lineNum">     373 </span>                :       _ForwardIterator __mid = std::__uninitialized_move_a(__first1, __last1,
-<span class="lineNum">     374 </span>                :                                                            __result,
-<span class="lineNum">     375 </span><span class="lineNoCov">              0 :                                                            __alloc);</span>
-<span class="lineNum">     376 </span>                :       try
-<span class="lineNum">     377 </span>                :         {
-<span class="lineNum">     378 </span><span class="lineNoCov">              0 :           return std::__uninitialized_copy_a(__first2, __last2, __mid, __alloc);</span>
-<span class="lineNum">     379 </span>                :         }
-<span class="lineNum">     380 </span><span class="lineNoCov">              0 :       catch(...)</span>
-<span class="lineNum">     381 </span>                :         {
-<span class="lineNum">     382 </span><span class="lineNoCov">              0 :           std::_Destroy(__result, __mid, __alloc);</span>
-<span class="lineNum">     383 </span><span class="lineNoCov">              0 :           __throw_exception_again;</span>
-<span class="lineNum">     384 </span>                :         }
-<span class="lineNum">     385 </span>                :     }
-<span class="lineNum">     386 </span>                :   
-<span class="lineNum">     387 </span>                :   // __uninitialized_fill_move
-<span class="lineNum">     388 </span>                :   // Fills [result, mid) with x, and moves [first, last) into
-<span class="lineNum">     389 </span>                :   //  [mid, mid + (last - first)).
-<span class="lineNum">     390 </span>                :   template&lt;typename _ForwardIterator, typename _Tp, typename _InputIterator,
-<span class="lineNum">     391 </span>                :            typename _Allocator&gt;
-<span class="lineNum">     392 </span>                :     inline _ForwardIterator
-<span class="lineNum">     393 </span>                :     __uninitialized_fill_move(_ForwardIterator __result, _ForwardIterator __mid,
-<span class="lineNum">     394 </span>                :                               const _Tp&amp; __x, _InputIterator __first,
-<span class="lineNum">     395 </span>                :                               _InputIterator __last, _Allocator&amp; __alloc)
-<span class="lineNum">     396 </span>                :     {
-<span class="lineNum">     397 </span>                :       std::__uninitialized_fill_a(__result, __mid, __x, __alloc);
-<span class="lineNum">     398 </span>                :       try
-<span class="lineNum">     399 </span>                :         {
-<span class="lineNum">     400 </span>                :           return std::__uninitialized_move_a(__first, __last, __mid, __alloc);
-<span class="lineNum">     401 </span>                :         }
-<span class="lineNum">     402 </span>                :       catch(...)
-<span class="lineNum">     403 </span>                :         {
-<span class="lineNum">     404 </span>                :           std::_Destroy(__result, __mid, __alloc);
-<span class="lineNum">     405 </span>                :           __throw_exception_again;
-<span class="lineNum">     406 </span>                :         }
-<span class="lineNum">     407 </span>                :     }
-<span class="lineNum">     408 </span>                : 
-<span class="lineNum">     409 </span>                :   // __uninitialized_move_fill
-<span class="lineNum">     410 </span>                :   // Moves [first1, last1) into [first2, first2 + (last1 - first1)), and
-<span class="lineNum">     411 </span>                :   //  fills [first2 + (last1 - first1), last2) with x.
-<span class="lineNum">     412 </span>                :   template&lt;typename _InputIterator, typename _ForwardIterator, typename _Tp,
-<span class="lineNum">     413 </span>                :            typename _Allocator&gt;
-<span class="lineNum">     414 </span>                :     inline void
-<span class="lineNum">     415 </span>                :     __uninitialized_move_fill(_InputIterator __first1, _InputIterator __last1,
-<span class="lineNum">     416 </span>                :                               _ForwardIterator __first2,
-<span class="lineNum">     417 </span>                :                               _ForwardIterator __last2, const _Tp&amp; __x,
-<span class="lineNum">     418 </span>                :                               _Allocator&amp; __alloc)
-<span class="lineNum">     419 </span>                :     {
-<span class="lineNum">     420 </span>                :       _ForwardIterator __mid2 = std::__uninitialized_move_a(__first1, __last1,
-<span class="lineNum">     421 </span>                :                                                             __first2,
-<span class="lineNum">     422 </span>                :                                                             __alloc);
-<span class="lineNum">     423 </span>                :       try
-<span class="lineNum">     424 </span>                :         {
-<span class="lineNum">     425 </span>                :           std::__uninitialized_fill_a(__mid2, __last2, __x, __alloc);
-<span class="lineNum">     426 </span>                :         }
-<span class="lineNum">     427 </span>                :       catch(...)
-<span class="lineNum">     428 </span>                :         {
-<span class="lineNum">     429 </span>                :           std::_Destroy(__first2, __mid2, __alloc);
-<span class="lineNum">     430 </span>                :           __throw_exception_again;
-<span class="lineNum">     431 </span>                :         }
-<span class="lineNum">     432 </span>                :     }
-<span class="lineNum">     433 </span>                : 
-<span class="lineNum">     434 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">     435 </span>                : 
-<span class="lineNum">     436 </span>                : #endif /* _STL_UNINITIALIZED_H */
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/bits/stl_vector.h.gcov.html b/rep/usr/include/c++/4.3/bits/stl_vector.h.gcov.html
deleted file mode 100644
index 847af95..0000000
--- a/rep/usr/include/c++/4.3/bits/stl_vector.h.gcov.html
+++ /dev/null
@@ -1,1241 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_vector.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_vector.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">103</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">91.3 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">94</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // Vector implementation -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
-<span class="lineNum">       4 </span>                : // Free Software Foundation, Inc.
-<span class="lineNum">       5 </span>                : //
-<span class="lineNum">       6 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       7 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       8 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">       9 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      10 </span>                : // any later version.
-<span class="lineNum">      11 </span>                : 
-<span class="lineNum">      12 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      13 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      14 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      15 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      16 </span>                : 
-<span class="lineNum">      17 </span>                : // You should have received a copy of the GNU General Public License along
-<span class="lineNum">      18 </span>                : // with this library; see the file COPYING.  If not, write to the Free
-<span class="lineNum">      19 </span>                : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-<span class="lineNum">      20 </span>                : // USA.
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      23 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      24 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      25 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      26 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      27 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      28 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      29 </span>                : // the GNU General Public License.
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : /*
-<span class="lineNum">      32 </span>                :  *
-<span class="lineNum">      33 </span>                :  * Copyright (c) 1994
-<span class="lineNum">      34 </span>                :  * Hewlett-Packard Company
-<span class="lineNum">      35 </span>                :  *
-<span class="lineNum">      36 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      37 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      38 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      39 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      40 </span>                :  * in supporting documentation.  Hewlett-Packard Company makes no
-<span class="lineNum">      41 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      42 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      43 </span>                :  *
-<span class="lineNum">      44 </span>                :  *
-<span class="lineNum">      45 </span>                :  * Copyright (c) 1996
-<span class="lineNum">      46 </span>                :  * Silicon Graphics Computer Systems, Inc.
-<span class="lineNum">      47 </span>                :  *
-<span class="lineNum">      48 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      49 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      50 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      51 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      52 </span>                :  * in supporting documentation.  Silicon Graphics makes no
-<span class="lineNum">      53 </span>                :  * representations about the suitability of this  software for any
-<span class="lineNum">      54 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      55 </span>                :  */
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span>                : /** @file stl_vector.h
-<span class="lineNum">      58 </span>                :  *  This is an internal header file, included by other library headers.
-<span class="lineNum">      59 </span>                :  *  You should not attempt to use it directly.
-<span class="lineNum">      60 </span>                :  */
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span>                : #ifndef _STL_VECTOR_H
-<span class="lineNum">      63 </span>                : #define _STL_VECTOR_H 1
-<span class="lineNum">      64 </span>                : 
-<span class="lineNum">      65 </span>                : #include &lt;bits/stl_iterator_base_funcs.h&gt;
-<span class="lineNum">      66 </span>                : #include &lt;bits/functexcept.h&gt;
-<span class="lineNum">      67 </span>                : #include &lt;bits/concept_check.h&gt;
-<span class="lineNum">      68 </span>                : 
-<span class="lineNum">      69 </span>                : _GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D)
-<span class="lineNum">      70 </span>                : 
-<span class="lineNum">      71 </span>                :   /// See bits/stl_deque.h's _Deque_base for an explanation.
-<span class="lineNum">      72 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">      73 </span>                :     struct _Vector_base
-<span class="lineNum">      74 </span>                :     {
-<span class="lineNum">      75 </span>                :       typedef typename _Alloc::template rebind&lt;_Tp&gt;::other _Tp_alloc_type;
-<span class="lineNum">      76 </span>                : 
-<span class="lineNum">      77 </span>                :       struct _Vector_impl 
-<span class="lineNum">      78 </span>                :       : public _Tp_alloc_type
-<span class="lineNum">      79 </span><span class="lineCov">           4841 :       {</span>
-<span class="lineNum">      80 </span>                :         _Tp*           _M_start;
-<span class="lineNum">      81 </span>                :         _Tp*           _M_finish;
-<span class="lineNum">      82 </span>                :         _Tp*           _M_end_of_storage;
-<span class="lineNum">      83 </span>                : 
-<span class="lineNum">      84 </span><span class="lineCov">           4840 :         _Vector_impl()</span>
-<span class="lineNum">      85 </span><span class="lineCov">           4840 :         : _Tp_alloc_type(), _M_start(0), _M_finish(0), _M_end_of_storage(0)</span>
-<span class="lineNum">      86 </span><span class="lineCov">           4840 :         { }</span>
-<span class="lineNum">      87 </span>                : 
-<span class="lineNum">      88 </span><span class="lineCov">              9 :         _Vector_impl(_Tp_alloc_type const&amp; __a)</span>
-<span class="lineNum">      89 </span><span class="lineCov">              9 :         : _Tp_alloc_type(__a), _M_start(0), _M_finish(0), _M_end_of_storage(0)</span>
-<span class="lineNum">      90 </span><span class="lineCov">              9 :         { }</span>
-<span class="lineNum">      91 </span>                :       };
-<span class="lineNum">      92 </span>                :       
-<span class="lineNum">      93 </span>                :     public:
-<span class="lineNum">      94 </span>                :       typedef _Alloc allocator_type;
-<span class="lineNum">      95 </span>                : 
-<span class="lineNum">      96 </span>                :       _Tp_alloc_type&amp;
-<span class="lineNum">      97 </span><span class="lineCov">         119679 :       _M_get_Tp_allocator()</span>
-<span class="lineNum">      98 </span><span class="lineCov">         119679 :       { return *static_cast&lt;_Tp_alloc_type*&gt;(&amp;this-&gt;_M_impl); }</span>
-<span class="lineNum">      99 </span>                : 
-<span class="lineNum">     100 </span>                :       const _Tp_alloc_type&amp;
-<span class="lineNum">     101 </span><span class="lineCov">          41426 :       _M_get_Tp_allocator() const</span>
-<span class="lineNum">     102 </span><span class="lineCov">          41426 :       { return *static_cast&lt;const _Tp_alloc_type*&gt;(&amp;this-&gt;_M_impl); }</span>
-<span class="lineNum">     103 </span>                : 
-<span class="lineNum">     104 </span>                :       allocator_type
-<span class="lineNum">     105 </span>                :       get_allocator() const
-<span class="lineNum">     106 </span>                :       { return allocator_type(_M_get_Tp_allocator()); }
-<span class="lineNum">     107 </span>                : 
-<span class="lineNum">     108 </span><span class="lineCov">           4840 :       _Vector_base()</span>
-<span class="lineNum">     109 </span><span class="lineCov">           4840 :       : _M_impl() { }</span>
-<span class="lineNum">     110 </span>                : 
-<span class="lineNum">     111 </span>                :       _Vector_base(const allocator_type&amp; __a)
-<span class="lineNum">     112 </span>                :       : _M_impl(__a) { }
-<span class="lineNum">     113 </span>                : 
-<span class="lineNum">     114 </span><span class="lineCov">              9 :       _Vector_base(size_t __n, const allocator_type&amp; __a)</span>
-<span class="lineNum">     115 </span><span class="lineCov">              9 :       : _M_impl(__a)</span>
-<span class="lineNum">     116 </span>                :       {
-<span class="lineNum">     117 </span><span class="lineCov">              9 :         this-&gt;_M_impl._M_start = this-&gt;_M_allocate(__n);</span>
-<span class="lineNum">     118 </span><span class="lineCov">              9 :         this-&gt;_M_impl._M_finish = this-&gt;_M_impl._M_start;</span>
-<span class="lineNum">     119 </span><span class="lineCov">              9 :         this-&gt;_M_impl._M_end_of_storage = this-&gt;_M_impl._M_start + __n;</span>
-<span class="lineNum">     120 </span><span class="lineCov">              9 :       }</span>
-<span class="lineNum">     121 </span>                : 
-<span class="lineNum">     122 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     123 </span>                :       _Vector_base(_Vector_base&amp;&amp; __x)
-<span class="lineNum">     124 </span>                :       : _M_impl(__x._M_get_Tp_allocator())
-<span class="lineNum">     125 </span>                :       {
-<span class="lineNum">     126 </span>                :         this-&gt;_M_impl._M_start = __x._M_impl._M_start;
-<span class="lineNum">     127 </span>                :         this-&gt;_M_impl._M_finish = __x._M_impl._M_finish;
-<span class="lineNum">     128 </span>                :         this-&gt;_M_impl._M_end_of_storage = __x._M_impl._M_end_of_storage;
-<span class="lineNum">     129 </span>                :         __x._M_impl._M_start = 0;
-<span class="lineNum">     130 </span>                :         __x._M_impl._M_finish = 0;
-<span class="lineNum">     131 </span>                :         __x._M_impl._M_end_of_storage = 0;
-<span class="lineNum">     132 </span>                :       }
-<span class="lineNum">     133 </span>                : #endif
-<span class="lineNum">     134 </span>                : 
-<span class="lineNum">     135 </span><span class="lineCov">           4841 :       ~_Vector_base()</span>
-<span class="lineNum">     136 </span><span class="lineCov">           4841 :       { _M_deallocate(this-&gt;_M_impl._M_start, this-&gt;_M_impl._M_end_of_storage</span>
-<span class="lineNum">     137 </span><span class="lineCov">           4841 :                       - this-&gt;_M_impl._M_start); }</span>
-<span class="lineNum">     138 </span>                : 
-<span class="lineNum">     139 </span>                :     public:
-<span class="lineNum">     140 </span>                :       _Vector_impl _M_impl;
-<span class="lineNum">     141 </span>                : 
-<span class="lineNum">     142 </span>                :       _Tp*
-<span class="lineNum">     143 </span><span class="lineCov">          20727 :       _M_allocate(size_t __n)</span>
-<span class="lineNum">     144 </span><span class="lineCov">          20727 :       { return __n != 0 ? _M_impl.allocate(__n) : 0; }</span>
-<span class="lineNum">     145 </span>                : 
-<span class="lineNum">     146 </span>                :       void
-<span class="lineNum">     147 </span><span class="lineCov">          25559 :       _M_deallocate(_Tp* __p, size_t __n)</span>
-<span class="lineNum">     148 </span>                :       {
-<span class="lineNum">     149 </span><span class="lineCov">          25559 :         if (__p)</span>
-<span class="lineNum">     150 </span><span class="lineCov">          20616 :           _M_impl.deallocate(__p, __n);</span>
-<span class="lineNum">     151 </span><span class="lineCov">          25559 :       }</span>
-<span class="lineNum">     152 </span>                :     };
-<span class="lineNum">     153 </span>                : 
-<span class="lineNum">     154 </span>                : 
-<span class="lineNum">     155 </span>                :   /**
-<span class="lineNum">     156 </span>                :    *  @brief A standard container which offers fixed time access to
-<span class="lineNum">     157 </span>                :    *  individual elements in any order.
-<span class="lineNum">     158 </span>                :    *
-<span class="lineNum">     159 </span>                :    *  @ingroup Containers
-<span class="lineNum">     160 </span>                :    *  @ingroup Sequences
-<span class="lineNum">     161 </span>                :    *
-<span class="lineNum">     162 </span>                :    *  Meets the requirements of a &lt;a href=&quot;tables.html#65&quot;&gt;container&lt;/a&gt;, a
-<span class="lineNum">     163 </span>                :    *  &lt;a href=&quot;tables.html#66&quot;&gt;reversible container&lt;/a&gt;, and a
-<span class="lineNum">     164 </span>                :    *  &lt;a href=&quot;tables.html#67&quot;&gt;sequence&lt;/a&gt;, including the
-<span class="lineNum">     165 </span>                :    *  &lt;a href=&quot;tables.html#68&quot;&gt;optional sequence requirements&lt;/a&gt; with the
-<span class="lineNum">     166 </span>                :    *  %exception of @c push_front and @c pop_front.
-<span class="lineNum">     167 </span>                :    *
-<span class="lineNum">     168 </span>                :    *  In some terminology a %vector can be described as a dynamic
-<span class="lineNum">     169 </span>                :    *  C-style array, it offers fast and efficient access to individual
-<span class="lineNum">     170 </span>                :    *  elements in any order and saves the user from worrying about
-<span class="lineNum">     171 </span>                :    *  memory and size allocation.  Subscripting ( @c [] ) access is
-<span class="lineNum">     172 </span>                :    *  also provided as with C-style arrays.
-<span class="lineNum">     173 </span>                :   */
-<span class="lineNum">     174 </span>                :   template&lt;typename _Tp, typename _Alloc = std::allocator&lt;_Tp&gt; &gt;
-<span class="lineNum">     175 </span>                :     class vector : protected _Vector_base&lt;_Tp, _Alloc&gt;
-<span class="lineNum">     176 </span>                :     {
-<span class="lineNum">     177 </span>                :       // Concept requirements.
-<span class="lineNum">     178 </span>                :       typedef typename _Alloc::value_type                _Alloc_value_type;
-<span class="lineNum">     179 </span>                :       __glibcxx_class_requires(_Tp, _SGIAssignableConcept)
-<span class="lineNum">     180 </span>                :       __glibcxx_class_requires2(_Tp, _Alloc_value_type, _SameTypeConcept)
-<span class="lineNum">     181 </span>                :       
-<span class="lineNum">     182 </span>                :       typedef _Vector_base&lt;_Tp, _Alloc&gt;                    _Base;
-<span class="lineNum">     183 </span>                :       typedef vector&lt;_Tp, _Alloc&gt;                  vector_type;
-<span class="lineNum">     184 </span>                :       typedef typename _Base::_Tp_alloc_type             _Tp_alloc_type;
-<span class="lineNum">     185 </span>                : 
-<span class="lineNum">     186 </span>                :     public:
-<span class="lineNum">     187 </span>                :       typedef _Tp                                        value_type;
-<span class="lineNum">     188 </span>                :       typedef typename _Tp_alloc_type::pointer           pointer;
-<span class="lineNum">     189 </span>                :       typedef typename _Tp_alloc_type::const_pointer     const_pointer;
-<span class="lineNum">     190 </span>                :       typedef typename _Tp_alloc_type::reference         reference;
-<span class="lineNum">     191 </span>                :       typedef typename _Tp_alloc_type::const_reference   const_reference;
-<span class="lineNum">     192 </span>                :       typedef __gnu_cxx::__normal_iterator&lt;pointer, vector_type&gt; iterator;
-<span class="lineNum">     193 </span>                :       typedef __gnu_cxx::__normal_iterator&lt;const_pointer, vector_type&gt;
-<span class="lineNum">     194 </span>                :       const_iterator;
-<span class="lineNum">     195 </span>                :       typedef std::reverse_iterator&lt;const_iterator&gt;  const_reverse_iterator;
-<span class="lineNum">     196 </span>                :       typedef std::reverse_iterator&lt;iterator&gt;              reverse_iterator;
-<span class="lineNum">     197 </span>                :       typedef size_t                                     size_type;
-<span class="lineNum">     198 </span>                :       typedef ptrdiff_t                                  difference_type;
-<span class="lineNum">     199 </span>                :       typedef _Alloc                                     allocator_type;
-<span class="lineNum">     200 </span>                : 
-<span class="lineNum">     201 </span>                :     protected:
-<span class="lineNum">     202 </span>                :       using _Base::_M_allocate;
-<span class="lineNum">     203 </span>                :       using _Base::_M_deallocate;
-<span class="lineNum">     204 </span>                :       using _Base::_M_impl;
-<span class="lineNum">     205 </span>                :       using _Base::_M_get_Tp_allocator;
-<span class="lineNum">     206 </span>                : 
-<span class="lineNum">     207 </span>                :     public:
-<span class="lineNum">     208 </span>                :       // [23.2.4.1] construct/copy/destroy
-<span class="lineNum">     209 </span>                :       // (assign() and get_allocator() are also listed in this section)
-<span class="lineNum">     210 </span>                :       /**
-<span class="lineNum">     211 </span>                :        *  @brief  Default constructor creates no elements.
-<span class="lineNum">     212 </span>                :        */
-<span class="lineNum">     213 </span><span class="lineCov">           4840 :       vector()</span>
-<span class="lineNum">     214 </span><span class="lineCov">           4840 :       : _Base() { }</span>
-<span class="lineNum">     215 </span>                : 
-<span class="lineNum">     216 </span>                :       /**
-<span class="lineNum">     217 </span>                :        *  @brief  Creates a %vector with no elements.
-<span class="lineNum">     218 </span>                :        *  @param  a  An allocator object.
-<span class="lineNum">     219 </span>                :        */
-<span class="lineNum">     220 </span>                :       explicit
-<span class="lineNum">     221 </span>                :       vector(const allocator_type&amp; __a)
-<span class="lineNum">     222 </span>                :       : _Base(__a) { }
-<span class="lineNum">     223 </span>                : 
-<span class="lineNum">     224 </span>                :       /**
-<span class="lineNum">     225 </span>                :        *  @brief  Creates a %vector with copies of an exemplar element.
-<span class="lineNum">     226 </span>                :        *  @param  n  The number of elements to initially create.
-<span class="lineNum">     227 </span>                :        *  @param  value  An element to copy.
-<span class="lineNum">     228 </span>                :        *  @param  a  An allocator.
-<span class="lineNum">     229 </span>                :        *
-<span class="lineNum">     230 </span>                :        *  This constructor fills the %vector with @a n copies of @a value.
-<span class="lineNum">     231 </span>                :        */
-<span class="lineNum">     232 </span>                :       explicit
-<span class="lineNum">     233 </span>                :       vector(size_type __n, const value_type&amp; __value = value_type(),
-<span class="lineNum">     234 </span><span class="lineCov">              9 :              const allocator_type&amp; __a = allocator_type())</span>
-<span class="lineNum">     235 </span><span class="lineCov">              9 :       : _Base(__n, __a)</span>
-<span class="lineNum">     236 </span><span class="lineCov">              9 :       { _M_fill_initialize(__n, __value); }</span>
-<span class="lineNum">     237 </span>                : 
-<span class="lineNum">     238 </span>                :       /**
-<span class="lineNum">     239 </span>                :        *  @brief  %Vector copy constructor.
-<span class="lineNum">     240 </span>                :        *  @param  x  A %vector of identical element and allocator types.
-<span class="lineNum">     241 </span>                :        *
-<span class="lineNum">     242 </span>                :        *  The newly-created %vector uses a copy of the allocation
-<span class="lineNum">     243 </span>                :        *  object used by @a x.  All the elements of @a x are copied,
-<span class="lineNum">     244 </span>                :        *  but any extra memory in
-<span class="lineNum">     245 </span>                :        *  @a x (for fast expansion) will not be copied.
-<span class="lineNum">     246 </span>                :        */
-<span class="lineNum">     247 </span><span class="lineNoCov">              0 :       vector(const vector&amp; __x)</span>
-<span class="lineNum">     248 </span><span class="lineNoCov">              0 :       : _Base(__x.size(), __x._M_get_Tp_allocator())</span>
-<span class="lineNum">     249 </span><span class="lineNoCov">              0 :       { this-&gt;_M_impl._M_finish =</span>
-<span class="lineNum">     250 </span>                :           std::__uninitialized_copy_a(__x.begin(), __x.end(),
-<span class="lineNum">     251 </span>                :                                       this-&gt;_M_impl._M_start,
-<span class="lineNum">     252 </span>                :                                       _M_get_Tp_allocator());
-<span class="lineNum">     253 </span><span class="lineNoCov">              0 :       }</span>
-<span class="lineNum">     254 </span>                : 
-<span class="lineNum">     255 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     256 </span>                :       /**
-<span class="lineNum">     257 </span>                :        *  @brief  %Vector move constructor.
-<span class="lineNum">     258 </span>                :        *  @param  x  A %vector of identical element and allocator types.
-<span class="lineNum">     259 </span>                :        *
-<span class="lineNum">     260 </span>                :        *  The newly-created %vector contains the exact contents of @a x.
-<span class="lineNum">     261 </span>                :        *  The contents of @a x are a valid, but unspecified %vector.
-<span class="lineNum">     262 </span>                :        */
-<span class="lineNum">     263 </span>                :       vector(vector&amp;&amp; __x)
-<span class="lineNum">     264 </span>                :       : _Base(std::forward&lt;_Base&gt;(__x)) { }
-<span class="lineNum">     265 </span>                : #endif
-<span class="lineNum">     266 </span>                : 
-<span class="lineNum">     267 </span>                :       /**
-<span class="lineNum">     268 </span>                :        *  @brief  Builds a %vector from a range.
-<span class="lineNum">     269 </span>                :        *  @param  first  An input iterator.
-<span class="lineNum">     270 </span>                :        *  @param  last  An input iterator.
-<span class="lineNum">     271 </span>                :        *  @param  a  An allocator.
-<span class="lineNum">     272 </span>                :        *
-<span class="lineNum">     273 </span>                :        *  Create a %vector consisting of copies of the elements from
-<span class="lineNum">     274 </span>                :        *  [first,last).
-<span class="lineNum">     275 </span>                :        *
-<span class="lineNum">     276 </span>                :        *  If the iterators are forward, bidirectional, or
-<span class="lineNum">     277 </span>                :        *  random-access, then this will call the elements' copy
-<span class="lineNum">     278 </span>                :        *  constructor N times (where N is distance(first,last)) and do
-<span class="lineNum">     279 </span>                :        *  no memory reallocation.  But if only input iterators are
-<span class="lineNum">     280 </span>                :        *  used, then this will do at most 2N calls to the copy
-<span class="lineNum">     281 </span>                :        *  constructor, and logN memory reallocations.
-<span class="lineNum">     282 </span>                :        */
-<span class="lineNum">     283 </span>                :       template&lt;typename _InputIterator&gt;
-<span class="lineNum">     284 </span>                :         vector(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">     285 </span>                :                const allocator_type&amp; __a = allocator_type())
-<span class="lineNum">     286 </span>                :         : _Base(__a)
-<span class="lineNum">     287 </span>                :         {
-<span class="lineNum">     288 </span>                :           // Check whether it's an integral type.  If so, it's not an iterator.
-<span class="lineNum">     289 </span>                :           typedef typename std::__is_integer&lt;_InputIterator&gt;::__type _Integral;
-<span class="lineNum">     290 </span>                :           _M_initialize_dispatch(__first, __last, _Integral());
-<span class="lineNum">     291 </span>                :         }
-<span class="lineNum">     292 </span>                : 
-<span class="lineNum">     293 </span>                :       /**
-<span class="lineNum">     294 </span>                :        *  The dtor only erases the elements, and note that if the
-<span class="lineNum">     295 </span>                :        *  elements themselves are pointers, the pointed-to memory is
-<span class="lineNum">     296 </span>                :        *  not touched in any way.  Managing the pointer is the user's
-<span class="lineNum">     297 </span>                :        *  responsibility.
-<span class="lineNum">     298 </span>                :        */
-<span class="lineNum">     299 </span><span class="lineCov">           4841 :       ~vector()</span>
-<span class="lineNum">     300 </span><span class="lineCov">           4841 :       { std::_Destroy(this-&gt;_M_impl._M_start, this-&gt;_M_impl._M_finish,</span>
-<span class="lineNum">     301 </span><span class="lineCov">           4841 :                       _M_get_Tp_allocator()); }</span>
-<span class="lineNum">     302 </span>                : 
-<span class="lineNum">     303 </span>                :       /**
-<span class="lineNum">     304 </span>                :        *  @brief  %Vector assignment operator.
-<span class="lineNum">     305 </span>                :        *  @param  x  A %vector of identical element and allocator types.
-<span class="lineNum">     306 </span>                :        *
-<span class="lineNum">     307 </span>                :        *  All the elements of @a x are copied, but any extra memory in
-<span class="lineNum">     308 </span>                :        *  @a x (for fast expansion) will not be copied.  Unlike the
-<span class="lineNum">     309 </span>                :        *  copy constructor, the allocator object is not copied.
-<span class="lineNum">     310 </span>                :        */
-<span class="lineNum">     311 </span>                :       vector&amp;
-<span class="lineNum">     312 </span>                :       operator=(const vector&amp; __x);
-<span class="lineNum">     313 </span>                : 
-<span class="lineNum">     314 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     315 </span>                :       /**
-<span class="lineNum">     316 </span>                :        *  @brief  %Vector move assignment operator.
-<span class="lineNum">     317 </span>                :        *  @param  x  A %vector of identical element and allocator types.
-<span class="lineNum">     318 </span>                :        *
-<span class="lineNum">     319 </span>                :        *  The contents of @a x are moved into this %vector (without copying).
-<span class="lineNum">     320 </span>                :        *  @a x is a valid, but unspecified %vector.
-<span class="lineNum">     321 </span>                :        */
-<span class="lineNum">     322 </span>                :       vector&amp;
-<span class="lineNum">     323 </span>                :       operator=(vector&amp;&amp; __x)
-<span class="lineNum">     324 </span>                :       {
-<span class="lineNum">     325 </span>                :         // NB: DR 675.
-<span class="lineNum">     326 </span>                :         this-&gt;clear();
-<span class="lineNum">     327 </span>                :         this-&gt;swap(__x); 
-<span class="lineNum">     328 </span>                :         return *this;
-<span class="lineNum">     329 </span>                :       }
-<span class="lineNum">     330 </span>                : #endif
-<span class="lineNum">     331 </span>                : 
-<span class="lineNum">     332 </span>                :       /**
-<span class="lineNum">     333 </span>                :        *  @brief  Assigns a given value to a %vector.
-<span class="lineNum">     334 </span>                :        *  @param  n  Number of elements to be assigned.
-<span class="lineNum">     335 </span>                :        *  @param  val  Value to be assigned.
-<span class="lineNum">     336 </span>                :        *
-<span class="lineNum">     337 </span>                :        *  This function fills a %vector with @a n copies of the given
-<span class="lineNum">     338 </span>                :        *  value.  Note that the assignment completely changes the
-<span class="lineNum">     339 </span>                :        *  %vector and that the resulting %vector's size is the same as
-<span class="lineNum">     340 </span>                :        *  the number of elements assigned.  Old data may be lost.
-<span class="lineNum">     341 </span>                :        */
-<span class="lineNum">     342 </span>                :       void
-<span class="lineNum">     343 </span>                :       assign(size_type __n, const value_type&amp; __val)
-<span class="lineNum">     344 </span>                :       { _M_fill_assign(__n, __val); }
-<span class="lineNum">     345 </span>                : 
-<span class="lineNum">     346 </span>                :       /**
-<span class="lineNum">     347 </span>                :        *  @brief  Assigns a range to a %vector.
-<span class="lineNum">     348 </span>                :        *  @param  first  An input iterator.
-<span class="lineNum">     349 </span>                :        *  @param  last   An input iterator.
-<span class="lineNum">     350 </span>                :        *
-<span class="lineNum">     351 </span>                :        *  This function fills a %vector with copies of the elements in the
-<span class="lineNum">     352 </span>                :        *  range [first,last).
-<span class="lineNum">     353 </span>                :        *
-<span class="lineNum">     354 </span>                :        *  Note that the assignment completely changes the %vector and
-<span class="lineNum">     355 </span>                :        *  that the resulting %vector's size is the same as the number
-<span class="lineNum">     356 </span>                :        *  of elements assigned.  Old data may be lost.
-<span class="lineNum">     357 </span>                :        */
-<span class="lineNum">     358 </span>                :       template&lt;typename _InputIterator&gt;
-<span class="lineNum">     359 </span>                :         void
-<span class="lineNum">     360 </span>                :         assign(_InputIterator __first, _InputIterator __last)
-<span class="lineNum">     361 </span>                :         {
-<span class="lineNum">     362 </span>                :           // Check whether it's an integral type.  If so, it's not an iterator.
-<span class="lineNum">     363 </span>                :           typedef typename std::__is_integer&lt;_InputIterator&gt;::__type _Integral;
-<span class="lineNum">     364 </span>                :           _M_assign_dispatch(__first, __last, _Integral());
-<span class="lineNum">     365 </span>                :         }
-<span class="lineNum">     366 </span>                : 
-<span class="lineNum">     367 </span>                :       /// Get a copy of the memory allocation object.
-<span class="lineNum">     368 </span>                :       using _Base::get_allocator;
-<span class="lineNum">     369 </span>                : 
-<span class="lineNum">     370 </span>                :       // iterators
-<span class="lineNum">     371 </span>                :       /**
-<span class="lineNum">     372 </span>                :        *  Returns a read/write iterator that points to the first
-<span class="lineNum">     373 </span>                :        *  element in the %vector.  Iteration is done in ordinary
-<span class="lineNum">     374 </span>                :        *  element order.
-<span class="lineNum">     375 </span>                :        */
-<span class="lineNum">     376 </span>                :       iterator
-<span class="lineNum">     377 </span><span class="lineCov">           4034 :       begin()</span>
-<span class="lineNum">     378 </span><span class="lineCov">           4034 :       { return iterator(this-&gt;_M_impl._M_start); }</span>
-<span class="lineNum">     379 </span>                : 
-<span class="lineNum">     380 </span>                :       /**
-<span class="lineNum">     381 </span>                :        *  Returns a read-only (constant) iterator that points to the
-<span class="lineNum">     382 </span>                :        *  first element in the %vector.  Iteration is done in ordinary
-<span class="lineNum">     383 </span>                :        *  element order.
-<span class="lineNum">     384 </span>                :        */
-<span class="lineNum">     385 </span>                :       const_iterator
-<span class="lineNum">     386 </span><span class="lineCov">             91 :       begin() const</span>
-<span class="lineNum">     387 </span><span class="lineCov">             91 :       { return const_iterator(this-&gt;_M_impl._M_start); }</span>
-<span class="lineNum">     388 </span>                : 
-<span class="lineNum">     389 </span>                :       /**
-<span class="lineNum">     390 </span>                :        *  Returns a read/write iterator that points one past the last
-<span class="lineNum">     391 </span>                :        *  element in the %vector.  Iteration is done in ordinary
-<span class="lineNum">     392 </span>                :        *  element order.
-<span class="lineNum">     393 </span>                :        */
-<span class="lineNum">     394 </span>                :       iterator
-<span class="lineNum">     395 </span><span class="lineCov">          69161 :       end()</span>
-<span class="lineNum">     396 </span><span class="lineCov">          69161 :       { return iterator(this-&gt;_M_impl._M_finish); }</span>
-<span class="lineNum">     397 </span>                : 
-<span class="lineNum">     398 </span>                :       /**
-<span class="lineNum">     399 </span>                :        *  Returns a read-only (constant) iterator that points one past
-<span class="lineNum">     400 </span>                :        *  the last element in the %vector.  Iteration is done in
-<span class="lineNum">     401 </span>                :        *  ordinary element order.
-<span class="lineNum">     402 </span>                :        */
-<span class="lineNum">     403 </span>                :       const_iterator
-<span class="lineNum">     404 </span><span class="lineCov">            175 :       end() const</span>
-<span class="lineNum">     405 </span><span class="lineCov">            175 :       { return const_iterator(this-&gt;_M_impl._M_finish); }</span>
-<span class="lineNum">     406 </span>                : 
-<span class="lineNum">     407 </span>                :       /**
-<span class="lineNum">     408 </span>                :        *  Returns a read/write reverse iterator that points to the
-<span class="lineNum">     409 </span>                :        *  last element in the %vector.  Iteration is done in reverse
-<span class="lineNum">     410 </span>                :        *  element order.
-<span class="lineNum">     411 </span>                :        */
-<span class="lineNum">     412 </span>                :       reverse_iterator
-<span class="lineNum">     413 </span><span class="lineCov">              1 :       rbegin()</span>
-<span class="lineNum">     414 </span><span class="lineCov">              1 :       { return reverse_iterator(end()); }</span>
-<span class="lineNum">     415 </span>                : 
-<span class="lineNum">     416 </span>                :       /**
-<span class="lineNum">     417 </span>                :        *  Returns a read-only (constant) reverse iterator that points
-<span class="lineNum">     418 </span>                :        *  to the last element in the %vector.  Iteration is done in
-<span class="lineNum">     419 </span>                :        *  reverse element order.
-<span class="lineNum">     420 </span>                :        */
-<span class="lineNum">     421 </span>                :       const_reverse_iterator
-<span class="lineNum">     422 </span>                :       rbegin() const
-<span class="lineNum">     423 </span>                :       { return const_reverse_iterator(end()); }
-<span class="lineNum">     424 </span>                : 
-<span class="lineNum">     425 </span>                :       /**
-<span class="lineNum">     426 </span>                :        *  Returns a read/write reverse iterator that points to one
-<span class="lineNum">     427 </span>                :        *  before the first element in the %vector.  Iteration is done
-<span class="lineNum">     428 </span>                :        *  in reverse element order.
-<span class="lineNum">     429 </span>                :        */
-<span class="lineNum">     430 </span>                :       reverse_iterator
-<span class="lineNum">     431 </span>                :       rend()
-<span class="lineNum">     432 </span>                :       { return reverse_iterator(begin()); }
-<span class="lineNum">     433 </span>                : 
-<span class="lineNum">     434 </span>                :       /**
-<span class="lineNum">     435 </span>                :        *  Returns a read-only (constant) reverse iterator that points
-<span class="lineNum">     436 </span>                :        *  to one before the first element in the %vector.  Iteration
-<span class="lineNum">     437 </span>                :        *  is done in reverse element order.
-<span class="lineNum">     438 </span>                :        */
-<span class="lineNum">     439 </span>                :       const_reverse_iterator
-<span class="lineNum">     440 </span>                :       rend() const
-<span class="lineNum">     441 </span>                :       { return const_reverse_iterator(begin()); }
-<span class="lineNum">     442 </span>                : 
-<span class="lineNum">     443 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     444 </span>                :       /**
-<span class="lineNum">     445 </span>                :        *  Returns a read-only (constant) iterator that points to the
-<span class="lineNum">     446 </span>                :        *  first element in the %vector.  Iteration is done in ordinary
-<span class="lineNum">     447 </span>                :        *  element order.
-<span class="lineNum">     448 </span>                :        */
-<span class="lineNum">     449 </span>                :       const_iterator
-<span class="lineNum">     450 </span>                :       cbegin() const
-<span class="lineNum">     451 </span>                :       { return const_iterator(this-&gt;_M_impl._M_start); }
-<span class="lineNum">     452 </span>                : 
-<span class="lineNum">     453 </span>                :       /**
-<span class="lineNum">     454 </span>                :        *  Returns a read-only (constant) iterator that points one past
-<span class="lineNum">     455 </span>                :        *  the last element in the %vector.  Iteration is done in
-<span class="lineNum">     456 </span>                :        *  ordinary element order.
-<span class="lineNum">     457 </span>                :        */
-<span class="lineNum">     458 </span>                :       const_iterator
-<span class="lineNum">     459 </span>                :       cend() const
-<span class="lineNum">     460 </span>                :       { return const_iterator(this-&gt;_M_impl._M_finish); }
-<span class="lineNum">     461 </span>                : 
-<span class="lineNum">     462 </span>                :       /**
-<span class="lineNum">     463 </span>                :        *  Returns a read-only (constant) reverse iterator that points
-<span class="lineNum">     464 </span>                :        *  to the last element in the %vector.  Iteration is done in
-<span class="lineNum">     465 </span>                :        *  reverse element order.
-<span class="lineNum">     466 </span>                :        */
-<span class="lineNum">     467 </span>                :       const_reverse_iterator
-<span class="lineNum">     468 </span>                :       crbegin() const
-<span class="lineNum">     469 </span>                :       { return const_reverse_iterator(end()); }
-<span class="lineNum">     470 </span>                : 
-<span class="lineNum">     471 </span>                :       /**
-<span class="lineNum">     472 </span>                :        *  Returns a read-only (constant) reverse iterator that points
-<span class="lineNum">     473 </span>                :        *  to one before the first element in the %vector.  Iteration
-<span class="lineNum">     474 </span>                :        *  is done in reverse element order.
-<span class="lineNum">     475 </span>                :        */
-<span class="lineNum">     476 </span>                :       const_reverse_iterator
-<span class="lineNum">     477 </span>                :       crend() const
-<span class="lineNum">     478 </span>                :       { return const_reverse_iterator(begin()); }
-<span class="lineNum">     479 </span>                : #endif
-<span class="lineNum">     480 </span>                : 
-<span class="lineNum">     481 </span>                :       // [23.2.4.2] capacity
-<span class="lineNum">     482 </span>                :       /**  Returns the number of elements in the %vector.  */
-<span class="lineNum">     483 </span>                :       size_type
-<span class="lineNum">     484 </span><span class="lineCov">        1028954 :       size() const</span>
-<span class="lineNum">     485 </span><span class="lineCov">        1028954 :       { return size_type(this-&gt;_M_impl._M_finish - this-&gt;_M_impl._M_start); }</span>
-<span class="lineNum">     486 </span>                : 
-<span class="lineNum">     487 </span>                :       /**  Returns the size() of the largest possible %vector.  */
-<span class="lineNum">     488 </span>                :       size_type
-<span class="lineNum">     489 </span><span class="lineCov">          41426 :       max_size() const</span>
-<span class="lineNum">     490 </span><span class="lineCov">          41426 :       { return _M_get_Tp_allocator().max_size(); }</span>
-<span class="lineNum">     491 </span>                : 
-<span class="lineNum">     492 </span>                :       /**
-<span class="lineNum">     493 </span>                :        *  @brief  Resizes the %vector to the specified number of elements.
-<span class="lineNum">     494 </span>                :        *  @param  new_size  Number of elements the %vector should contain.
-<span class="lineNum">     495 </span>                :        *  @param  x  Data with which new elements should be populated.
-<span class="lineNum">     496 </span>                :        *
-<span class="lineNum">     497 </span>                :        *  This function will %resize the %vector to the specified
-<span class="lineNum">     498 </span>                :        *  number of elements.  If the number is smaller than the
-<span class="lineNum">     499 </span>                :        *  %vector's current size the %vector is truncated, otherwise
-<span class="lineNum">     500 </span>                :        *  the %vector is extended and new elements are populated with
-<span class="lineNum">     501 </span>                :        *  given data.
-<span class="lineNum">     502 </span>                :        */
-<span class="lineNum">     503 </span>                :       void
-<span class="lineNum">     504 </span><span class="lineCov">          22443 :       resize(size_type __new_size, value_type __x = value_type())</span>
-<span class="lineNum">     505 </span>                :       {
-<span class="lineNum">     506 </span><span class="lineCov">          22443 :         if (__new_size &lt; size())</span>
-<span class="lineNum">     507 </span><span class="lineNoCov">              0 :           _M_erase_at_end(this-&gt;_M_impl._M_start + __new_size);</span>
-<span class="lineNum">     508 </span>                :         else
-<span class="lineNum">     509 </span><span class="lineCov">          22443 :           insert(end(), __new_size - size(), __x);</span>
-<span class="lineNum">     510 </span><span class="lineCov">          22443 :       }</span>
-<span class="lineNum">     511 </span>                : 
-<span class="lineNum">     512 </span>                :       /**
-<span class="lineNum">     513 </span>                :        *  Returns the total number of elements that the %vector can
-<span class="lineNum">     514 </span>                :        *  hold before needing to allocate more memory.
-<span class="lineNum">     515 </span>                :        */
-<span class="lineNum">     516 </span>                :       size_type
-<span class="lineNum">     517 </span><span class="lineCov">             10 :       capacity() const</span>
-<span class="lineNum">     518 </span>                :       { return size_type(this-&gt;_M_impl._M_end_of_storage
-<span class="lineNum">     519 </span><span class="lineCov">             10 :                          - this-&gt;_M_impl._M_start); }</span>
-<span class="lineNum">     520 </span>                : 
-<span class="lineNum">     521 </span>                :       /**
-<span class="lineNum">     522 </span>                :        *  Returns true if the %vector is empty.  (Thus begin() would
-<span class="lineNum">     523 </span>                :        *  equal end().)
-<span class="lineNum">     524 </span>                :        */
-<span class="lineNum">     525 </span>                :       bool
-<span class="lineNum">     526 </span><span class="lineCov">             25 :       empty() const</span>
-<span class="lineNum">     527 </span><span class="lineCov">             25 :       { return begin() == end(); }</span>
-<span class="lineNum">     528 </span>                : 
-<span class="lineNum">     529 </span>                :       /**
-<span class="lineNum">     530 </span>                :        *  @brief  Attempt to preallocate enough memory for specified number of
-<span class="lineNum">     531 </span>                :        *          elements.
-<span class="lineNum">     532 </span>                :        *  @param  n  Number of elements required.
-<span class="lineNum">     533 </span>                :        *  @throw  std::length_error  If @a n exceeds @c max_size().
-<span class="lineNum">     534 </span>                :        *
-<span class="lineNum">     535 </span>                :        *  This function attempts to reserve enough memory for the
-<span class="lineNum">     536 </span>                :        *  %vector to hold the specified number of elements.  If the
-<span class="lineNum">     537 </span>                :        *  number requested is more than max_size(), length_error is
-<span class="lineNum">     538 </span>                :        *  thrown.
-<span class="lineNum">     539 </span>                :        *
-<span class="lineNum">     540 </span>                :        *  The advantage of this function is that if optimal code is a
-<span class="lineNum">     541 </span>                :        *  necessity and the user can determine the number of elements
-<span class="lineNum">     542 </span>                :        *  that will be required, the user can reserve the memory in
-<span class="lineNum">     543 </span>                :        *  %advance, and thus prevent a possible reallocation of memory
-<span class="lineNum">     544 </span>                :        *  and copying of %vector data.
-<span class="lineNum">     545 </span>                :        */
-<span class="lineNum">     546 </span>                :       void
-<span class="lineNum">     547 </span>                :       reserve(size_type __n);
-<span class="lineNum">     548 </span>                : 
-<span class="lineNum">     549 </span>                :       // element access
-<span class="lineNum">     550 </span>                :       /**
-<span class="lineNum">     551 </span>                :        *  @brief  Subscript access to the data contained in the %vector.
-<span class="lineNum">     552 </span>                :        *  @param n The index of the element for which data should be
-<span class="lineNum">     553 </span>                :        *  accessed.
-<span class="lineNum">     554 </span>                :        *  @return  Read/write reference to data.
-<span class="lineNum">     555 </span>                :        *
-<span class="lineNum">     556 </span>                :        *  This operator allows for easy, array-style, data access.
-<span class="lineNum">     557 </span>                :        *  Note that data access with this operator is unchecked and
-<span class="lineNum">     558 </span>                :        *  out_of_range lookups are not defined. (For checked lookups
-<span class="lineNum">     559 </span>                :        *  see at().)
-<span class="lineNum">     560 </span>                :        */
-<span class="lineNum">     561 </span>                :       reference
-<span class="lineNum">     562 </span><span class="lineCov">         256895 :       operator[](size_type __n)</span>
-<span class="lineNum">     563 </span><span class="lineCov">         256895 :       { return *(this-&gt;_M_impl._M_start + __n); }</span>
-<span class="lineNum">     564 </span>                : 
-<span class="lineNum">     565 </span>                :       /**
-<span class="lineNum">     566 </span>                :        *  @brief  Subscript access to the data contained in the %vector.
-<span class="lineNum">     567 </span>                :        *  @param n The index of the element for which data should be
-<span class="lineNum">     568 </span>                :        *  accessed.
-<span class="lineNum">     569 </span>                :        *  @return  Read-only (constant) reference to data.
-<span class="lineNum">     570 </span>                :        *
-<span class="lineNum">     571 </span>                :        *  This operator allows for easy, array-style, data access.
-<span class="lineNum">     572 </span>                :        *  Note that data access with this operator is unchecked and
-<span class="lineNum">     573 </span>                :        *  out_of_range lookups are not defined. (For checked lookups
-<span class="lineNum">     574 </span>                :        *  see at().)
-<span class="lineNum">     575 </span>                :        */
-<span class="lineNum">     576 </span>                :       const_reference
-<span class="lineNum">     577 </span><span class="lineCov">        1925198 :       operator[](size_type __n) const</span>
-<span class="lineNum">     578 </span><span class="lineCov">        1925198 :       { return *(this-&gt;_M_impl._M_start + __n); }</span>
-<span class="lineNum">     579 </span>                : 
-<span class="lineNum">     580 </span>                :     protected:
-<span class="lineNum">     581 </span>                :       /// Safety check used only from at().
-<span class="lineNum">     582 </span>                :       void
-<span class="lineNum">     583 </span>                :       _M_range_check(size_type __n) const
-<span class="lineNum">     584 </span>                :       {
-<span class="lineNum">     585 </span>                :         if (__n &gt;= this-&gt;size())
-<span class="lineNum">     586 </span>                :           __throw_out_of_range(__N(&quot;vector::_M_range_check&quot;));
-<span class="lineNum">     587 </span>                :       }
-<span class="lineNum">     588 </span>                : 
-<span class="lineNum">     589 </span>                :     public:
-<span class="lineNum">     590 </span>                :       /**
-<span class="lineNum">     591 </span>                :        *  @brief  Provides access to the data contained in the %vector.
-<span class="lineNum">     592 </span>                :        *  @param n The index of the element for which data should be
-<span class="lineNum">     593 </span>                :        *  accessed.
-<span class="lineNum">     594 </span>                :        *  @return  Read/write reference to data.
-<span class="lineNum">     595 </span>                :        *  @throw  std::out_of_range  If @a n is an invalid index.
-<span class="lineNum">     596 </span>                :        *
-<span class="lineNum">     597 </span>                :        *  This function provides for safer data access.  The parameter
-<span class="lineNum">     598 </span>                :        *  is first checked that it is in the range of the vector.  The
-<span class="lineNum">     599 </span>                :        *  function throws out_of_range if the check fails.
-<span class="lineNum">     600 </span>                :        */
-<span class="lineNum">     601 </span>                :       reference
-<span class="lineNum">     602 </span>                :       at(size_type __n)
-<span class="lineNum">     603 </span>                :       {
-<span class="lineNum">     604 </span>                :         _M_range_check(__n);
-<span class="lineNum">     605 </span>                :         return (*this)[__n]; 
-<span class="lineNum">     606 </span>                :       }
-<span class="lineNum">     607 </span>                : 
-<span class="lineNum">     608 </span>                :       /**
-<span class="lineNum">     609 </span>                :        *  @brief  Provides access to the data contained in the %vector.
-<span class="lineNum">     610 </span>                :        *  @param n The index of the element for which data should be
-<span class="lineNum">     611 </span>                :        *  accessed.
-<span class="lineNum">     612 </span>                :        *  @return  Read-only (constant) reference to data.
-<span class="lineNum">     613 </span>                :        *  @throw  std::out_of_range  If @a n is an invalid index.
-<span class="lineNum">     614 </span>                :        *
-<span class="lineNum">     615 </span>                :        *  This function provides for safer data access.  The parameter
-<span class="lineNum">     616 </span>                :        *  is first checked that it is in the range of the vector.  The
-<span class="lineNum">     617 </span>                :        *  function throws out_of_range if the check fails.
-<span class="lineNum">     618 </span>                :        */
-<span class="lineNum">     619 </span>                :       const_reference
-<span class="lineNum">     620 </span>                :       at(size_type __n) const
-<span class="lineNum">     621 </span>                :       {
-<span class="lineNum">     622 </span>                :         _M_range_check(__n);
-<span class="lineNum">     623 </span>                :         return (*this)[__n];
-<span class="lineNum">     624 </span>                :       }
-<span class="lineNum">     625 </span>                : 
-<span class="lineNum">     626 </span>                :       /**
-<span class="lineNum">     627 </span>                :        *  Returns a read/write reference to the data at the first
-<span class="lineNum">     628 </span>                :        *  element of the %vector.
-<span class="lineNum">     629 </span>                :        */
-<span class="lineNum">     630 </span>                :       reference
-<span class="lineNum">     631 </span>                :       front()
-<span class="lineNum">     632 </span>                :       { return *begin(); }
-<span class="lineNum">     633 </span>                : 
-<span class="lineNum">     634 </span>                :       /**
-<span class="lineNum">     635 </span>                :        *  Returns a read-only (constant) reference to the data at the first
-<span class="lineNum">     636 </span>                :        *  element of the %vector.
-<span class="lineNum">     637 </span>                :        */
-<span class="lineNum">     638 </span>                :       const_reference
-<span class="lineNum">     639 </span>                :       front() const
-<span class="lineNum">     640 </span>                :       { return *begin(); }
-<span class="lineNum">     641 </span>                : 
-<span class="lineNum">     642 </span>                :       /**
-<span class="lineNum">     643 </span>                :        *  Returns a read/write reference to the data at the last
-<span class="lineNum">     644 </span>                :        *  element of the %vector.
-<span class="lineNum">     645 </span>                :        */
-<span class="lineNum">     646 </span>                :       reference
-<span class="lineNum">     647 </span><span class="lineCov">              3 :       back()</span>
-<span class="lineNum">     648 </span><span class="lineCov">              3 :       { return *(end() - 1); }</span>
-<span class="lineNum">     649 </span>                :       
-<span class="lineNum">     650 </span>                :       /**
-<span class="lineNum">     651 </span>                :        *  Returns a read-only (constant) reference to the data at the
-<span class="lineNum">     652 </span>                :        *  last element of the %vector.
-<span class="lineNum">     653 </span>                :        */
-<span class="lineNum">     654 </span>                :       const_reference
-<span class="lineNum">     655 </span>                :       back() const
-<span class="lineNum">     656 </span>                :       { return *(end() - 1); }
-<span class="lineNum">     657 </span>                : 
-<span class="lineNum">     658 </span>                :       // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     659 </span>                :       // DR 464. Suggestion for new member functions in standard containers.
-<span class="lineNum">     660 </span>                :       // data access
-<span class="lineNum">     661 </span>                :       /**
-<span class="lineNum">     662 </span>                :        *   Returns a pointer such that [data(), data() + size()) is a valid
-<span class="lineNum">     663 </span>                :        *   range.  For a non-empty %vector, data() == &amp;front().
-<span class="lineNum">     664 </span>                :        */
-<span class="lineNum">     665 </span>                :       pointer
-<span class="lineNum">     666 </span>                :       data()
-<span class="lineNum">     667 </span>                :       { return pointer(this-&gt;_M_impl._M_start); }
-<span class="lineNum">     668 </span>                : 
-<span class="lineNum">     669 </span>                :       const_pointer
-<span class="lineNum">     670 </span>                :       data() const
-<span class="lineNum">     671 </span>                :       { return const_pointer(this-&gt;_M_impl._M_start); }
-<span class="lineNum">     672 </span>                : 
-<span class="lineNum">     673 </span>                :       // [23.2.4.3] modifiers
-<span class="lineNum">     674 </span>                :       /**
-<span class="lineNum">     675 </span>                :        *  @brief  Add data to the end of the %vector.
-<span class="lineNum">     676 </span>                :        *  @param  x  Data to be added.
-<span class="lineNum">     677 </span>                :        *
-<span class="lineNum">     678 </span>                :        *  This is a typical stack operation.  The function creates an
-<span class="lineNum">     679 </span>                :        *  element at the end of the %vector and assigns the given data
-<span class="lineNum">     680 </span>                :        *  to it.  Due to the nature of a %vector this operation can be
-<span class="lineNum">     681 </span>                :        *  done in constant time if the %vector has preallocated space
-<span class="lineNum">     682 </span>                :        *  available.
-<span class="lineNum">     683 </span>                :        */
-<span class="lineNum">     684 </span>                : #ifndef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     685 </span>                :       void
-<span class="lineNum">     686 </span><span class="lineCov">         129213 :       push_back(const value_type&amp; __x)</span>
-<span class="lineNum">     687 </span>                :       {
-<span class="lineNum">     688 </span><span class="lineCov">         129213 :         if (this-&gt;_M_impl._M_finish != this-&gt;_M_impl._M_end_of_storage)</span>
-<span class="lineNum">     689 </span>                :           {
-<span class="lineNum">     690 </span><span class="lineCov">         108914 :             this-&gt;_M_impl.construct(this-&gt;_M_impl._M_finish, __x);</span>
-<span class="lineNum">     691 </span><span class="lineCov">         108914 :             ++this-&gt;_M_impl._M_finish;</span>
-<span class="lineNum">     692 </span>                :           }
-<span class="lineNum">     693 </span>                :         else
-<span class="lineNum">     694 </span><span class="lineCov">          20299 :           _M_insert_aux(end(), __x);</span>
-<span class="lineNum">     695 </span><span class="lineCov">         129213 :       }</span>
-<span class="lineNum">     696 </span>                : #else
-<span class="lineNum">     697 </span>                :       template&lt;typename... _Args&gt;
-<span class="lineNum">     698 </span>                :         void
-<span class="lineNum">     699 </span>                :         push_back(_Args&amp;&amp;... __args)
-<span class="lineNum">     700 </span>                :         {
-<span class="lineNum">     701 </span>                :           if (this-&gt;_M_impl._M_finish != this-&gt;_M_impl._M_end_of_storage)
-<span class="lineNum">     702 </span>                :             {
-<span class="lineNum">     703 </span>                :               this-&gt;_M_impl.construct(this-&gt;_M_impl._M_finish,
-<span class="lineNum">     704 </span>                :                                       std::forward&lt;_Args&gt;(__args)...);
-<span class="lineNum">     705 </span>                :               ++this-&gt;_M_impl._M_finish;
-<span class="lineNum">     706 </span>                :             }
-<span class="lineNum">     707 </span>                :           else
-<span class="lineNum">     708 </span>                :             _M_insert_aux(end(), std::forward&lt;_Args&gt;(__args)...);
-<span class="lineNum">     709 </span>                :         }
-<span class="lineNum">     710 </span>                : #endif
-<span class="lineNum">     711 </span>                : 
-<span class="lineNum">     712 </span>                :       /**
-<span class="lineNum">     713 </span>                :        *  @brief  Removes last element.
-<span class="lineNum">     714 </span>                :        *
-<span class="lineNum">     715 </span>                :        *  This is a typical stack operation. It shrinks the %vector by one.
-<span class="lineNum">     716 </span>                :        *
-<span class="lineNum">     717 </span>                :        *  Note that no data is returned, and if the last element's
-<span class="lineNum">     718 </span>                :        *  data is needed, it should be retrieved before pop_back() is
-<span class="lineNum">     719 </span>                :        *  called.
-<span class="lineNum">     720 </span>                :        */
-<span class="lineNum">     721 </span>                :       void
-<span class="lineNum">     722 </span><span class="lineCov">              3 :       pop_back()</span>
-<span class="lineNum">     723 </span>                :       {
-<span class="lineNum">     724 </span><span class="lineCov">              3 :         --this-&gt;_M_impl._M_finish;</span>
-<span class="lineNum">     725 </span><span class="lineCov">              3 :         this-&gt;_M_impl.destroy(this-&gt;_M_impl._M_finish);</span>
-<span class="lineNum">     726 </span><span class="lineCov">              3 :       }</span>
-<span class="lineNum">     727 </span>                : 
-<span class="lineNum">     728 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     729 </span>                :       /**
-<span class="lineNum">     730 </span>                :        *  @brief  Inserts an object in %vector before specified iterator.
-<span class="lineNum">     731 </span>                :        *  @param  position  An iterator into the %vector.
-<span class="lineNum">     732 </span>                :        *  @param  args  Arguments.
-<span class="lineNum">     733 </span>                :        *  @return  An iterator that points to the inserted data.
-<span class="lineNum">     734 </span>                :        *
-<span class="lineNum">     735 </span>                :        *  This function will insert an object of type T constructed
-<span class="lineNum">     736 </span>                :        *  with T(std::forward&lt;Args&gt;(args)...) before the specified location.
-<span class="lineNum">     737 </span>                :        *  Note that this kind of operation could be expensive for a %vector
-<span class="lineNum">     738 </span>                :        *  and if it is frequently used the user should consider using
-<span class="lineNum">     739 </span>                :        *  std::list.
-<span class="lineNum">     740 </span>                :        */
-<span class="lineNum">     741 </span>                :       template&lt;typename... _Args&gt;
-<span class="lineNum">     742 </span>                :         iterator
-<span class="lineNum">     743 </span>                :         emplace(iterator __position, _Args&amp;&amp;... __args);
-<span class="lineNum">     744 </span>                : #endif
-<span class="lineNum">     745 </span>                : 
-<span class="lineNum">     746 </span>                :       /**
-<span class="lineNum">     747 </span>                :        *  @brief  Inserts given value into %vector before specified iterator.
-<span class="lineNum">     748 </span>                :        *  @param  position  An iterator into the %vector.
-<span class="lineNum">     749 </span>                :        *  @param  x  Data to be inserted.
-<span class="lineNum">     750 </span>                :        *  @return  An iterator that points to the inserted data.
-<span class="lineNum">     751 </span>                :        *
-<span class="lineNum">     752 </span>                :        *  This function will insert a copy of the given value before
-<span class="lineNum">     753 </span>                :        *  the specified location.  Note that this kind of operation
-<span class="lineNum">     754 </span>                :        *  could be expensive for a %vector and if it is frequently
-<span class="lineNum">     755 </span>                :        *  used the user should consider using std::list.
-<span class="lineNum">     756 </span>                :        */
-<span class="lineNum">     757 </span>                :       iterator
-<span class="lineNum">     758 </span>                :       insert(iterator __position, const value_type&amp; __x);
-<span class="lineNum">     759 </span>                : 
-<span class="lineNum">     760 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     761 </span>                :       /**
-<span class="lineNum">     762 </span>                :        *  @brief  Inserts given rvalue into %vector before specified iterator.
-<span class="lineNum">     763 </span>                :        *  @param  position  An iterator into the %vector.
-<span class="lineNum">     764 </span>                :        *  @param  x  Data to be inserted.
-<span class="lineNum">     765 </span>                :        *  @return  An iterator that points to the inserted data.
-<span class="lineNum">     766 </span>                :        *
-<span class="lineNum">     767 </span>                :        *  This function will insert a copy of the given rvalue before
-<span class="lineNum">     768 </span>                :        *  the specified location.  Note that this kind of operation
-<span class="lineNum">     769 </span>                :        *  could be expensive for a %vector and if it is frequently
-<span class="lineNum">     770 </span>                :        *  used the user should consider using std::list.
-<span class="lineNum">     771 </span>                :        */
-<span class="lineNum">     772 </span>                :       iterator
-<span class="lineNum">     773 </span>                :       insert(iterator __position, value_type&amp;&amp; __x)
-<span class="lineNum">     774 </span>                :       { return emplace(__position, std::move(__x)); }
-<span class="lineNum">     775 </span>                : #endif
-<span class="lineNum">     776 </span>                : 
-<span class="lineNum">     777 </span>                :       /**
-<span class="lineNum">     778 </span>                :        *  @brief  Inserts a number of copies of given data into the %vector.
-<span class="lineNum">     779 </span>                :        *  @param  position  An iterator into the %vector.
-<span class="lineNum">     780 </span>                :        *  @param  n  Number of elements to be inserted.
-<span class="lineNum">     781 </span>                :        *  @param  x  Data to be inserted.
-<span class="lineNum">     782 </span>                :        *
-<span class="lineNum">     783 </span>                :        *  This function will insert a specified number of copies of
-<span class="lineNum">     784 </span>                :        *  the given data before the location specified by @a position.
-<span class="lineNum">     785 </span>                :        *
-<span class="lineNum">     786 </span>                :        *  Note that this kind of operation could be expensive for a
-<span class="lineNum">     787 </span>                :        *  %vector and if it is frequently used the user should
-<span class="lineNum">     788 </span>                :        *  consider using std::list.
-<span class="lineNum">     789 </span>                :        */
-<span class="lineNum">     790 </span>                :       void
-<span class="lineNum">     791 </span><span class="lineCov">          22443 :       insert(iterator __position, size_type __n, const value_type&amp; __x)</span>
-<span class="lineNum">     792 </span><span class="lineCov">          22443 :       { _M_fill_insert(__position, __n, __x); }</span>
-<span class="lineNum">     793 </span>                : 
-<span class="lineNum">     794 </span>                :       /**
-<span class="lineNum">     795 </span>                :        *  @brief  Inserts a range into the %vector.
-<span class="lineNum">     796 </span>                :        *  @param  position  An iterator into the %vector.
-<span class="lineNum">     797 </span>                :        *  @param  first  An input iterator.
-<span class="lineNum">     798 </span>                :        *  @param  last   An input iterator.
-<span class="lineNum">     799 </span>                :        *
-<span class="lineNum">     800 </span>                :        *  This function will insert copies of the data in the range
-<span class="lineNum">     801 </span>                :        *  [first,last) into the %vector before the location specified
-<span class="lineNum">     802 </span>                :        *  by @a pos.
-<span class="lineNum">     803 </span>                :        *
-<span class="lineNum">     804 </span>                :        *  Note that this kind of operation could be expensive for a
-<span class="lineNum">     805 </span>                :        *  %vector and if it is frequently used the user should
-<span class="lineNum">     806 </span>                :        *  consider using std::list.
-<span class="lineNum">     807 </span>                :        */
-<span class="lineNum">     808 </span>                :       template&lt;typename _InputIterator&gt;
-<span class="lineNum">     809 </span>                :         void
-<span class="lineNum">     810 </span>                :         insert(iterator __position, _InputIterator __first,
-<span class="lineNum">     811 </span>                :                _InputIterator __last)
-<span class="lineNum">     812 </span>                :         {
-<span class="lineNum">     813 </span>                :           // Check whether it's an integral type.  If so, it's not an iterator.
-<span class="lineNum">     814 </span>                :           typedef typename std::__is_integer&lt;_InputIterator&gt;::__type _Integral;
-<span class="lineNum">     815 </span>                :           _M_insert_dispatch(__position, __first, __last, _Integral());
-<span class="lineNum">     816 </span>                :         }
-<span class="lineNum">     817 </span>                : 
-<span class="lineNum">     818 </span>                :       /**
-<span class="lineNum">     819 </span>                :        *  @brief  Remove element at given position.
-<span class="lineNum">     820 </span>                :        *  @param  position  Iterator pointing to element to be erased.
-<span class="lineNum">     821 </span>                :        *  @return  An iterator pointing to the next element (or end()).
-<span class="lineNum">     822 </span>                :        *
-<span class="lineNum">     823 </span>                :        *  This function will erase the element at the given position and thus
-<span class="lineNum">     824 </span>                :        *  shorten the %vector by one.
-<span class="lineNum">     825 </span>                :        *
-<span class="lineNum">     826 </span>                :        *  Note This operation could be expensive and if it is
-<span class="lineNum">     827 </span>                :        *  frequently used the user should consider using std::list.
-<span class="lineNum">     828 </span>                :        *  The user is also cautioned that this function only erases
-<span class="lineNum">     829 </span>                :        *  the element, and that if the element is itself a pointer,
-<span class="lineNum">     830 </span>                :        *  the pointed-to memory is not touched in any way.  Managing
-<span class="lineNum">     831 </span>                :        *  the pointer is the user's responsibility.
-<span class="lineNum">     832 </span>                :        */
-<span class="lineNum">     833 </span>                :       iterator
-<span class="lineNum">     834 </span>                :       erase(iterator __position);
-<span class="lineNum">     835 </span>                : 
-<span class="lineNum">     836 </span>                :       /**
-<span class="lineNum">     837 </span>                :        *  @brief  Remove a range of elements.
-<span class="lineNum">     838 </span>                :        *  @param  first  Iterator pointing to the first element to be erased.
-<span class="lineNum">     839 </span>                :        *  @param  last  Iterator pointing to one past the last element to be
-<span class="lineNum">     840 </span>                :        *                erased.
-<span class="lineNum">     841 </span>                :        *  @return  An iterator pointing to the element pointed to by @a last
-<span class="lineNum">     842 </span>                :        *           prior to erasing (or end()).
-<span class="lineNum">     843 </span>                :        *
-<span class="lineNum">     844 </span>                :        *  This function will erase the elements in the range [first,last) and
-<span class="lineNum">     845 </span>                :        *  shorten the %vector accordingly.
-<span class="lineNum">     846 </span>                :        *
-<span class="lineNum">     847 </span>                :        *  Note This operation could be expensive and if it is
-<span class="lineNum">     848 </span>                :        *  frequently used the user should consider using std::list.
-<span class="lineNum">     849 </span>                :        *  The user is also cautioned that this function only erases
-<span class="lineNum">     850 </span>                :        *  the elements, and that if the elements themselves are
-<span class="lineNum">     851 </span>                :        *  pointers, the pointed-to memory is not touched in any way.
-<span class="lineNum">     852 </span>                :        *  Managing the pointer is the user's responsibility.
-<span class="lineNum">     853 </span>                :        */
-<span class="lineNum">     854 </span>                :       iterator
-<span class="lineNum">     855 </span>                :       erase(iterator __first, iterator __last);
-<span class="lineNum">     856 </span>                : 
-<span class="lineNum">     857 </span>                :       /**
-<span class="lineNum">     858 </span>                :        *  @brief  Swaps data with another %vector.
-<span class="lineNum">     859 </span>                :        *  @param  x  A %vector of the same element and allocator types.
-<span class="lineNum">     860 </span>                :        *
-<span class="lineNum">     861 </span>                :        *  This exchanges the elements between two vectors in constant time.
-<span class="lineNum">     862 </span>                :        *  (Three pointers, so it should be quite fast.)
-<span class="lineNum">     863 </span>                :        *  Note that the global std::swap() function is specialized such that
-<span class="lineNum">     864 </span>                :        *  std::swap(v1,v2) will feed to this function.
-<span class="lineNum">     865 </span>                :        */
-<span class="lineNum">     866 </span>                :       void
-<span class="lineNum">     867 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     868 </span>                :       swap(vector&amp;&amp; __x)
-<span class="lineNum">     869 </span>                : #else
-<span class="lineNum">     870 </span>                :       swap(vector&amp; __x)
-<span class="lineNum">     871 </span>                : #endif
-<span class="lineNum">     872 </span>                :       {
-<span class="lineNum">     873 </span>                :         std::swap(this-&gt;_M_impl._M_start, __x._M_impl._M_start);
-<span class="lineNum">     874 </span>                :         std::swap(this-&gt;_M_impl._M_finish, __x._M_impl._M_finish);
-<span class="lineNum">     875 </span>                :         std::swap(this-&gt;_M_impl._M_end_of_storage,
-<span class="lineNum">     876 </span>                :                   __x._M_impl._M_end_of_storage);
-<span class="lineNum">     877 </span>                : 
-<span class="lineNum">     878 </span>                :         // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     879 </span>                :         // 431. Swapping containers with unequal allocators.
-<span class="lineNum">     880 </span>                :         std::__alloc_swap&lt;_Tp_alloc_type&gt;::_S_do_it(_M_get_Tp_allocator(),
-<span class="lineNum">     881 </span>                :                                                     __x._M_get_Tp_allocator());
-<span class="lineNum">     882 </span>                :       }
-<span class="lineNum">     883 </span>                : 
-<span class="lineNum">     884 </span>                :       /**
-<span class="lineNum">     885 </span>                :        *  Erases all the elements.  Note that this function only erases the
-<span class="lineNum">     886 </span>                :        *  elements, and that if the elements themselves are pointers, the
-<span class="lineNum">     887 </span>                :        *  pointed-to memory is not touched in any way.  Managing the pointer is
-<span class="lineNum">     888 </span>                :        *  the user's responsibility.
-<span class="lineNum">     889 </span>                :        */
-<span class="lineNum">     890 </span>                :       void
-<span class="lineNum">     891 </span><span class="lineCov">           7856 :       clear()</span>
-<span class="lineNum">     892 </span><span class="lineCov">           7856 :       { _M_erase_at_end(this-&gt;_M_impl._M_start); }</span>
-<span class="lineNum">     893 </span>                : 
-<span class="lineNum">     894 </span>                :     protected:
-<span class="lineNum">     895 </span>                :       /**
-<span class="lineNum">     896 </span>                :        *  Memory expansion handler.  Uses the member allocation function to
-<span class="lineNum">     897 </span>                :        *  obtain @a n bytes of memory, and then copies [first,last) into it.
-<span class="lineNum">     898 </span>                :        */
-<span class="lineNum">     899 </span>                :       template&lt;typename _ForwardIterator&gt;
-<span class="lineNum">     900 </span>                :         pointer
-<span class="lineNum">     901 </span>                :         _M_allocate_and_copy(size_type __n,
-<span class="lineNum">     902 </span><span class="lineCov">             10 :                              _ForwardIterator __first, _ForwardIterator __last)</span>
-<span class="lineNum">     903 </span>                :         {
-<span class="lineNum">     904 </span><span class="lineCov">             10 :           pointer __result = this-&gt;_M_allocate(__n);</span>
-<span class="lineNum">     905 </span>                :           try
-<span class="lineNum">     906 </span>                :             {
-<span class="lineNum">     907 </span><span class="lineCov">             10 :               std::__uninitialized_copy_a(__first, __last, __result,</span>
-<span class="lineNum">     908 </span>                :                                           _M_get_Tp_allocator());
-<span class="lineNum">     909 </span><span class="lineCov">             10 :               return __result;</span>
-<span class="lineNum">     910 </span>                :             }
-<span class="lineNum">     911 </span><span class="lineNoCov">              0 :           catch(...)</span>
-<span class="lineNum">     912 </span>                :             {
-<span class="lineNum">     913 </span><span class="lineNoCov">              0 :               _M_deallocate(__result, __n);</span>
-<span class="lineNum">     914 </span><span class="lineNoCov">              0 :               __throw_exception_again;</span>
-<span class="lineNum">     915 </span>                :             }
-<span class="lineNum">     916 </span>                :         }
-<span class="lineNum">     917 </span>                : 
-<span class="lineNum">     918 </span>                : 
-<span class="lineNum">     919 </span>                :       // Internal constructor functions follow.
-<span class="lineNum">     920 </span>                : 
-<span class="lineNum">     921 </span>                :       // Called by the range constructor to implement [23.1.1]/9
-<span class="lineNum">     922 </span>                : 
-<span class="lineNum">     923 </span>                :       // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     924 </span>                :       // 438. Ambiguity in the &quot;do the right thing&quot; clause
-<span class="lineNum">     925 </span>                :       template&lt;typename _Integer&gt;
-<span class="lineNum">     926 </span>                :         void
-<span class="lineNum">     927 </span>                :         _M_initialize_dispatch(_Integer __n, _Integer __value, __true_type)
-<span class="lineNum">     928 </span>                :         {
-<span class="lineNum">     929 </span>                :           this-&gt;_M_impl._M_start = _M_allocate(static_cast&lt;size_type&gt;(__n));
-<span class="lineNum">     930 </span>                :           this-&gt;_M_impl._M_end_of_storage =
-<span class="lineNum">     931 </span>                :             this-&gt;_M_impl._M_start + static_cast&lt;size_type&gt;(__n);
-<span class="lineNum">     932 </span>                :           _M_fill_initialize(static_cast&lt;size_type&gt;(__n), __value);
-<span class="lineNum">     933 </span>                :         }
-<span class="lineNum">     934 </span>                : 
-<span class="lineNum">     935 </span>                :       // Called by the range constructor to implement [23.1.1]/9
-<span class="lineNum">     936 </span>                :       template&lt;typename _InputIterator&gt;
-<span class="lineNum">     937 </span>                :         void
-<span class="lineNum">     938 </span>                :         _M_initialize_dispatch(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">     939 </span>                :                                __false_type)
-<span class="lineNum">     940 </span>                :         {
-<span class="lineNum">     941 </span>                :           typedef typename std::iterator_traits&lt;_InputIterator&gt;::
-<span class="lineNum">     942 </span>                :             iterator_category _IterCategory;
-<span class="lineNum">     943 </span>                :           _M_range_initialize(__first, __last, _IterCategory());
-<span class="lineNum">     944 </span>                :         }
-<span class="lineNum">     945 </span>                : 
-<span class="lineNum">     946 </span>                :       // Called by the second initialize_dispatch above
-<span class="lineNum">     947 </span>                :       template&lt;typename _InputIterator&gt;
-<span class="lineNum">     948 </span>                :         void
-<span class="lineNum">     949 </span>                :         _M_range_initialize(_InputIterator __first,
-<span class="lineNum">     950 </span>                :                             _InputIterator __last, std::input_iterator_tag)
-<span class="lineNum">     951 </span>                :         {
-<span class="lineNum">     952 </span>                :           for (; __first != __last; ++__first)
-<span class="lineNum">     953 </span>                :             push_back(*__first);
-<span class="lineNum">     954 </span>                :         }
-<span class="lineNum">     955 </span>                : 
-<span class="lineNum">     956 </span>                :       // Called by the second initialize_dispatch above
-<span class="lineNum">     957 </span>                :       template&lt;typename _ForwardIterator&gt;
-<span class="lineNum">     958 </span>                :         void
-<span class="lineNum">     959 </span>                :         _M_range_initialize(_ForwardIterator __first,
-<span class="lineNum">     960 </span>                :                             _ForwardIterator __last, std::forward_iterator_tag)
-<span class="lineNum">     961 </span>                :         {
-<span class="lineNum">     962 </span>                :           const size_type __n = std::distance(__first, __last);
-<span class="lineNum">     963 </span>                :           this-&gt;_M_impl._M_start = this-&gt;_M_allocate(__n);
-<span class="lineNum">     964 </span>                :           this-&gt;_M_impl._M_end_of_storage = this-&gt;_M_impl._M_start + __n;
-<span class="lineNum">     965 </span>                :           this-&gt;_M_impl._M_finish =
-<span class="lineNum">     966 </span>                :             std::__uninitialized_copy_a(__first, __last,
-<span class="lineNum">     967 </span>                :                                         this-&gt;_M_impl._M_start,
-<span class="lineNum">     968 </span>                :                                         _M_get_Tp_allocator());
-<span class="lineNum">     969 </span>                :         }
-<span class="lineNum">     970 </span>                : 
-<span class="lineNum">     971 </span>                :       // Called by the first initialize_dispatch above and by the
-<span class="lineNum">     972 </span>                :       // vector(n,value,a) constructor.
-<span class="lineNum">     973 </span>                :       void
-<span class="lineNum">     974 </span><span class="lineCov">              9 :       _M_fill_initialize(size_type __n, const value_type&amp; __value)</span>
-<span class="lineNum">     975 </span>                :       {
-<span class="lineNum">     976 </span><span class="lineCov">              9 :         std::__uninitialized_fill_n_a(this-&gt;_M_impl._M_start, __n, __value, </span>
-<span class="lineNum">     977 </span>                :                                       _M_get_Tp_allocator());
-<span class="lineNum">     978 </span><span class="lineCov">              9 :         this-&gt;_M_impl._M_finish = this-&gt;_M_impl._M_end_of_storage;</span>
-<span class="lineNum">     979 </span><span class="lineCov">              9 :       }</span>
-<span class="lineNum">     980 </span>                : 
-<span class="lineNum">     981 </span>                : 
-<span class="lineNum">     982 </span>                :       // Internal assign functions follow.  The *_aux functions do the actual
-<span class="lineNum">     983 </span>                :       // assignment work for the range versions.
-<span class="lineNum">     984 </span>                : 
-<span class="lineNum">     985 </span>                :       // Called by the range assign to implement [23.1.1]/9
-<span class="lineNum">     986 </span>                : 
-<span class="lineNum">     987 </span>                :       // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     988 </span>                :       // 438. Ambiguity in the &quot;do the right thing&quot; clause
-<span class="lineNum">     989 </span>                :       template&lt;typename _Integer&gt;
-<span class="lineNum">     990 </span>                :         void
-<span class="lineNum">     991 </span>                :         _M_assign_dispatch(_Integer __n, _Integer __val, __true_type)
-<span class="lineNum">     992 </span>                :         { _M_fill_assign(__n, __val); }
-<span class="lineNum">     993 </span>                : 
-<span class="lineNum">     994 </span>                :       // Called by the range assign to implement [23.1.1]/9
-<span class="lineNum">     995 </span>                :       template&lt;typename _InputIterator&gt;
-<span class="lineNum">     996 </span>                :         void
-<span class="lineNum">     997 </span>                :         _M_assign_dispatch(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">     998 </span>                :                            __false_type)
-<span class="lineNum">     999 </span>                :         {
-<span class="lineNum">    1000 </span>                :           typedef typename std::iterator_traits&lt;_InputIterator&gt;::
-<span class="lineNum">    1001 </span>                :             iterator_category _IterCategory;
-<span class="lineNum">    1002 </span>                :           _M_assign_aux(__first, __last, _IterCategory());
-<span class="lineNum">    1003 </span>                :         }
-<span class="lineNum">    1004 </span>                : 
-<span class="lineNum">    1005 </span>                :       // Called by the second assign_dispatch above
-<span class="lineNum">    1006 </span>                :       template&lt;typename _InputIterator&gt;
-<span class="lineNum">    1007 </span>                :         void
-<span class="lineNum">    1008 </span>                :         _M_assign_aux(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">    1009 </span>                :                       std::input_iterator_tag);
-<span class="lineNum">    1010 </span>                : 
-<span class="lineNum">    1011 </span>                :       // Called by the second assign_dispatch above
-<span class="lineNum">    1012 </span>                :       template&lt;typename _ForwardIterator&gt;
-<span class="lineNum">    1013 </span>                :         void
-<span class="lineNum">    1014 </span>                :         _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">    1015 </span>                :                       std::forward_iterator_tag);
-<span class="lineNum">    1016 </span>                : 
-<span class="lineNum">    1017 </span>                :       // Called by assign(n,t), and the range assign when it turns out
-<span class="lineNum">    1018 </span>                :       // to be the same thing.
-<span class="lineNum">    1019 </span>                :       void
-<span class="lineNum">    1020 </span>                :       _M_fill_assign(size_type __n, const value_type&amp; __val);
-<span class="lineNum">    1021 </span>                : 
-<span class="lineNum">    1022 </span>                : 
-<span class="lineNum">    1023 </span>                :       // Internal insert functions follow.
-<span class="lineNum">    1024 </span>                : 
-<span class="lineNum">    1025 </span>                :       // Called by the range insert to implement [23.1.1]/9
-<span class="lineNum">    1026 </span>                : 
-<span class="lineNum">    1027 </span>                :       // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">    1028 </span>                :       // 438. Ambiguity in the &quot;do the right thing&quot; clause
-<span class="lineNum">    1029 </span>                :       template&lt;typename _Integer&gt;
-<span class="lineNum">    1030 </span>                :         void
-<span class="lineNum">    1031 </span>                :         _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val,
-<span class="lineNum">    1032 </span>                :                            __true_type)
-<span class="lineNum">    1033 </span>                :         { _M_fill_insert(__pos, __n, __val); }
-<span class="lineNum">    1034 </span>                : 
-<span class="lineNum">    1035 </span>                :       // Called by the range insert to implement [23.1.1]/9
-<span class="lineNum">    1036 </span>                :       template&lt;typename _InputIterator&gt;
-<span class="lineNum">    1037 </span>                :         void
-<span class="lineNum">    1038 </span>                :         _M_insert_dispatch(iterator __pos, _InputIterator __first,
-<span class="lineNum">    1039 </span>                :                            _InputIterator __last, __false_type)
-<span class="lineNum">    1040 </span>                :         {
-<span class="lineNum">    1041 </span>                :           typedef typename std::iterator_traits&lt;_InputIterator&gt;::
-<span class="lineNum">    1042 </span>                :             iterator_category _IterCategory;
-<span class="lineNum">    1043 </span>                :           _M_range_insert(__pos, __first, __last, _IterCategory());
-<span class="lineNum">    1044 </span>                :         }
-<span class="lineNum">    1045 </span>                : 
-<span class="lineNum">    1046 </span>                :       // Called by the second insert_dispatch above
-<span class="lineNum">    1047 </span>                :       template&lt;typename _InputIterator&gt;
-<span class="lineNum">    1048 </span>                :         void
-<span class="lineNum">    1049 </span>                :         _M_range_insert(iterator __pos, _InputIterator __first,
-<span class="lineNum">    1050 </span>                :                         _InputIterator __last, std::input_iterator_tag);
-<span class="lineNum">    1051 </span>                : 
-<span class="lineNum">    1052 </span>                :       // Called by the second insert_dispatch above
-<span class="lineNum">    1053 </span>                :       template&lt;typename _ForwardIterator&gt;
-<span class="lineNum">    1054 </span>                :         void
-<span class="lineNum">    1055 </span>                :         _M_range_insert(iterator __pos, _ForwardIterator __first,
-<span class="lineNum">    1056 </span>                :                         _ForwardIterator __last, std::forward_iterator_tag);
-<span class="lineNum">    1057 </span>                : 
-<span class="lineNum">    1058 </span>                :       // Called by insert(p,n,x), and the range insert when it turns out to be
-<span class="lineNum">    1059 </span>                :       // the same thing.
-<span class="lineNum">    1060 </span>                :       void
-<span class="lineNum">    1061 </span>                :       _M_fill_insert(iterator __pos, size_type __n, const value_type&amp; __x);
-<span class="lineNum">    1062 </span>                : 
-<span class="lineNum">    1063 </span>                :       // Called by insert(p,x)
-<span class="lineNum">    1064 </span>                : #ifndef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">    1065 </span>                :       void
-<span class="lineNum">    1066 </span>                :       _M_insert_aux(iterator __position, const value_type&amp; __x);
-<span class="lineNum">    1067 </span>                : #else
-<span class="lineNum">    1068 </span>                :       template&lt;typename... _Args&gt;
-<span class="lineNum">    1069 </span>                :         void
-<span class="lineNum">    1070 </span>                :         _M_insert_aux(iterator __position, _Args&amp;&amp;... __args);
-<span class="lineNum">    1071 </span>                : #endif
-<span class="lineNum">    1072 </span>                : 
-<span class="lineNum">    1073 </span>                :       // Called by the latter.
-<span class="lineNum">    1074 </span>                :       size_type
-<span class="lineNum">    1075 </span><span class="lineCov">          20708 :       _M_check_len(size_type __n, const char* __s) const</span>
-<span class="lineNum">    1076 </span>                :       {
-<span class="lineNum">    1077 </span><span class="lineCov">          20708 :         if (max_size() - size() &lt; __n)</span>
-<span class="lineNum">    1078 </span><span class="lineNoCov">              0 :           __throw_length_error(__N(__s));</span>
-<span class="lineNum">    1079 </span>                : 
-<span class="lineNum">    1080 </span><span class="lineCov">          20708 :         const size_type __len = size() + std::max(size(), __n);</span>
-<span class="lineNum">    1081 </span><span class="lineCov">          20708 :         return (__len &lt; size() || __len &gt; max_size()) ? max_size() : __len;</span>
-<span class="lineNum">    1082 </span>                :       }
-<span class="lineNum">    1083 </span>                : 
-<span class="lineNum">    1084 </span>                :       // Internal erase functions follow.
-<span class="lineNum">    1085 </span>                : 
-<span class="lineNum">    1086 </span>                :       // Called by erase(q1,q2), clear(), resize(), _M_fill_assign,
-<span class="lineNum">    1087 </span>                :       // _M_assign_aux.
-<span class="lineNum">    1088 </span>                :       void
-<span class="lineNum">    1089 </span><span class="lineCov">           7856 :       _M_erase_at_end(pointer __pos)</span>
-<span class="lineNum">    1090 </span>                :       {
-<span class="lineNum">    1091 </span><span class="lineCov">           7856 :         std::_Destroy(__pos, this-&gt;_M_impl._M_finish, _M_get_Tp_allocator());</span>
-<span class="lineNum">    1092 </span><span class="lineCov">           7856 :         this-&gt;_M_impl._M_finish = __pos;</span>
-<span class="lineNum">    1093 </span><span class="lineCov">           7856 :       }</span>
-<span class="lineNum">    1094 </span>                :     };
-<span class="lineNum">    1095 </span>                : 
-<span class="lineNum">    1096 </span>                : 
-<span class="lineNum">    1097 </span>                :   /**
-<span class="lineNum">    1098 </span>                :    *  @brief  Vector equality comparison.
-<span class="lineNum">    1099 </span>                :    *  @param  x  A %vector.
-<span class="lineNum">    1100 </span>                :    *  @param  y  A %vector of the same type as @a x.
-<span class="lineNum">    1101 </span>                :    *  @return  True iff the size and elements of the vectors are equal.
-<span class="lineNum">    1102 </span>                :    *
-<span class="lineNum">    1103 </span>                :    *  This is an equivalence relation.  It is linear in the size of the
-<span class="lineNum">    1104 </span>                :    *  vectors.  Vectors are considered equivalent if their sizes are equal,
-<span class="lineNum">    1105 </span>                :    *  and if corresponding elements compare equal.
-<span class="lineNum">    1106 </span>                :   */
-<span class="lineNum">    1107 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">    1108 </span>                :     inline bool
-<span class="lineNum">    1109 </span>                :     operator==(const vector&lt;_Tp, _Alloc&gt;&amp; __x, const vector&lt;_Tp, _Alloc&gt;&amp; __y)
-<span class="lineNum">    1110 </span>                :     { return (__x.size() == __y.size()
-<span class="lineNum">    1111 </span>                :               &amp;&amp; std::equal(__x.begin(), __x.end(), __y.begin())); }
-<span class="lineNum">    1112 </span>                : 
-<span class="lineNum">    1113 </span>                :   /**
-<span class="lineNum">    1114 </span>                :    *  @brief  Vector ordering relation.
-<span class="lineNum">    1115 </span>                :    *  @param  x  A %vector.
-<span class="lineNum">    1116 </span>                :    *  @param  y  A %vector of the same type as @a x.
-<span class="lineNum">    1117 </span>                :    *  @return  True iff @a x is lexicographically less than @a y.
-<span class="lineNum">    1118 </span>                :    *
-<span class="lineNum">    1119 </span>                :    *  This is a total ordering relation.  It is linear in the size of the
-<span class="lineNum">    1120 </span>                :    *  vectors.  The elements must be comparable with @c &lt;.
-<span class="lineNum">    1121 </span>                :    *
-<span class="lineNum">    1122 </span>                :    *  See std::lexicographical_compare() for how the determination is made.
-<span class="lineNum">    1123 </span>                :   */
-<span class="lineNum">    1124 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">    1125 </span>                :     inline bool
-<span class="lineNum">    1126 </span>                :     operator&lt;(const vector&lt;_Tp, _Alloc&gt;&amp; __x, const vector&lt;_Tp, _Alloc&gt;&amp; __y)
-<span class="lineNum">    1127 </span>                :     { return std::lexicographical_compare(__x.begin(), __x.end(),
-<span class="lineNum">    1128 </span>                :                                           __y.begin(), __y.end()); }
-<span class="lineNum">    1129 </span>                : 
-<span class="lineNum">    1130 </span>                :   /// Based on operator==
-<span class="lineNum">    1131 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">    1132 </span>                :     inline bool
-<span class="lineNum">    1133 </span>                :     operator!=(const vector&lt;_Tp, _Alloc&gt;&amp; __x, const vector&lt;_Tp, _Alloc&gt;&amp; __y)
-<span class="lineNum">    1134 </span>                :     { return !(__x == __y); }
-<span class="lineNum">    1135 </span>                : 
-<span class="lineNum">    1136 </span>                :   /// Based on operator&lt;
-<span class="lineNum">    1137 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">    1138 </span>                :     inline bool
-<span class="lineNum">    1139 </span>                :     operator&gt;(const vector&lt;_Tp, _Alloc&gt;&amp; __x, const vector&lt;_Tp, _Alloc&gt;&amp; __y)
-<span class="lineNum">    1140 </span>                :     { return __y &lt; __x; }
-<span class="lineNum">    1141 </span>                : 
-<span class="lineNum">    1142 </span>                :   /// Based on operator&lt;
-<span class="lineNum">    1143 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">    1144 </span>                :     inline bool
-<span class="lineNum">    1145 </span>                :     operator&lt;=(const vector&lt;_Tp, _Alloc&gt;&amp; __x, const vector&lt;_Tp, _Alloc&gt;&amp; __y)
-<span class="lineNum">    1146 </span>                :     { return !(__y &lt; __x); }
-<span class="lineNum">    1147 </span>                : 
-<span class="lineNum">    1148 </span>                :   /// Based on operator&lt;
-<span class="lineNum">    1149 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">    1150 </span>                :     inline bool
-<span class="lineNum">    1151 </span>                :     operator&gt;=(const vector&lt;_Tp, _Alloc&gt;&amp; __x, const vector&lt;_Tp, _Alloc&gt;&amp; __y)
-<span class="lineNum">    1152 </span>                :     { return !(__x &lt; __y); }
-<span class="lineNum">    1153 </span>                : 
-<span class="lineNum">    1154 </span>                :   /// See std::vector::swap().
-<span class="lineNum">    1155 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">    1156 </span>                :     inline void
-<span class="lineNum">    1157 </span>                :     swap(vector&lt;_Tp, _Alloc&gt;&amp; __x, vector&lt;_Tp, _Alloc&gt;&amp; __y)
-<span class="lineNum">    1158 </span>                :     { __x.swap(__y); }
-<span class="lineNum">    1159 </span>                : 
-<span class="lineNum">    1160 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">    1161 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">    1162 </span>                :     inline void
-<span class="lineNum">    1163 </span>                :     swap(vector&lt;_Tp, _Alloc&gt;&amp;&amp; __x, vector&lt;_Tp, _Alloc&gt;&amp; __y)
-<span class="lineNum">    1164 </span>                :     { __x.swap(__y); }
-<span class="lineNum">    1165 </span>                : 
-<span class="lineNum">    1166 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">    1167 </span>                :     inline void
-<span class="lineNum">    1168 </span>                :     swap(vector&lt;_Tp, _Alloc&gt;&amp; __x, vector&lt;_Tp, _Alloc&gt;&amp;&amp; __y)
-<span class="lineNum">    1169 </span>                :     { __x.swap(__y); }
-<span class="lineNum">    1170 </span>                : #endif
-<span class="lineNum">    1171 </span>                : 
-<span class="lineNum">    1172 </span>                : _GLIBCXX_END_NESTED_NAMESPACE
-<span class="lineNum">    1173 </span>                : 
-<span class="lineNum">    1174 </span>                : #endif /* _STL_VECTOR_H */
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/bits/stream_iterator.h.gcov.html b/rep/usr/include/c++/4.3/bits/stream_iterator.h.gcov.html
deleted file mode 100644
index e74322d..0000000
--- a/rep/usr/include/c++/4.3/bits/stream_iterator.h.gcov.html
+++ /dev/null
@@ -1,283 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stream_iterator.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stream_iterator.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">33</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">33</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // Stream iterators
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 2001, 2004, 2005 Free Software Foundation, Inc.
-<span class="lineNum">       4 </span>                : //
-<span class="lineNum">       5 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       6 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       7 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">       8 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">       9 </span>                : // any later version.
-<span class="lineNum">      10 </span>                : 
-<span class="lineNum">      11 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      12 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      13 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      14 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      15 </span>                : 
-<span class="lineNum">      16 </span>                : // You should have received a copy of the GNU General Public License along
-<span class="lineNum">      17 </span>                : // with this library; see the file COPYING.  If not, write to the Free
-<span class="lineNum">      18 </span>                : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-<span class="lineNum">      19 </span>                : // USA.
-<span class="lineNum">      20 </span>                : 
-<span class="lineNum">      21 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      22 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      23 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      24 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      25 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      26 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      27 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      28 </span>                : // the GNU General Public License.
-<span class="lineNum">      29 </span>                : 
-<span class="lineNum">      30 </span>                : /** @file stream_iterator.h
-<span class="lineNum">      31 </span>                :  *  This is an internal header file, included by other library headers.
-<span class="lineNum">      32 </span>                :  *  You should not attempt to use it directly.
-<span class="lineNum">      33 </span>                :  */
-<span class="lineNum">      34 </span>                : 
-<span class="lineNum">      35 </span>                : #ifndef _STREAM_ITERATOR_H
-<span class="lineNum">      36 </span>                : #define _STREAM_ITERATOR_H 1
-<span class="lineNum">      37 </span>                : 
-<span class="lineNum">      38 </span>                : #pragma GCC system_header
-<span class="lineNum">      39 </span>                : 
-<span class="lineNum">      40 </span>                : #include &lt;debug/debug.h&gt;
-<span class="lineNum">      41 </span>                : 
-<span class="lineNum">      42 </span>                : _GLIBCXX_BEGIN_NAMESPACE(std)
-<span class="lineNum">      43 </span>                : 
-<span class="lineNum">      44 </span>                :   /// Provides input iterator semantics for streams.
-<span class="lineNum">      45 </span>                :   template&lt;typename _Tp, typename _CharT = char,
-<span class="lineNum">      46 </span>                :            typename _Traits = char_traits&lt;_CharT&gt;, typename _Dist = ptrdiff_t&gt;
-<span class="lineNum">      47 </span>                :     class istream_iterator
-<span class="lineNum">      48 </span>                :     : public iterator&lt;input_iterator_tag, _Tp, _Dist, const _Tp*, const _Tp&amp;&gt;
-<span class="lineNum">      49 </span><span class="lineCov">             32 :     {</span>
-<span class="lineNum">      50 </span>                :     public:
-<span class="lineNum">      51 </span>                :       typedef _CharT                         char_type;
-<span class="lineNum">      52 </span>                :       typedef _Traits                        traits_type;
-<span class="lineNum">      53 </span>                :       typedef basic_istream&lt;_CharT, _Traits&gt; istream_type;
-<span class="lineNum">      54 </span>                : 
-<span class="lineNum">      55 </span>                :     private:
-<span class="lineNum">      56 </span>                :       istream_type*     _M_stream;
-<span class="lineNum">      57 </span>                :       _Tp               _M_value;
-<span class="lineNum">      58 </span>                :       bool              _M_ok;
-<span class="lineNum">      59 </span>                : 
-<span class="lineNum">      60 </span>                :     public:
-<span class="lineNum">      61 </span>                :       ///  Construct end of input stream iterator.
-<span class="lineNum">      62 </span><span class="lineCov">             16 :       istream_iterator()</span>
-<span class="lineNum">      63 </span><span class="lineCov">             16 :       : _M_stream(0), _M_value(), _M_ok(false) {}</span>
-<span class="lineNum">      64 </span>                : 
-<span class="lineNum">      65 </span>                :       ///  Construct start of input stream iterator.
-<span class="lineNum">      66 </span><span class="lineCov">             16 :       istream_iterator(istream_type&amp; __s)</span>
-<span class="lineNum">      67 </span><span class="lineCov">             16 :       : _M_stream(&amp;__s)</span>
-<span class="lineNum">      68 </span><span class="lineCov">             16 :       { _M_read(); }</span>
-<span class="lineNum">      69 </span>                : 
-<span class="lineNum">      70 </span>                :       istream_iterator(const istream_iterator&amp; __obj)
-<span class="lineNum">      71 </span>                :       : _M_stream(__obj._M_stream), _M_value(__obj._M_value),
-<span class="lineNum">      72 </span>                :         _M_ok(__obj._M_ok)
-<span class="lineNum">      73 </span>                :       { }
-<span class="lineNum">      74 </span>                : 
-<span class="lineNum">      75 </span>                :       const _Tp&amp;
-<span class="lineNum">      76 </span><span class="lineCov">            112 :       operator*() const</span>
-<span class="lineNum">      77 </span>                :       {
-<span class="lineNum">      78 </span>                :         __glibcxx_requires_cond(_M_ok,
-<span class="lineNum">      79 </span>                :                                 _M_message(__gnu_debug::__msg_deref_istream)
-<span class="lineNum">      80 </span>                :                                 ._M_iterator(*this));
-<span class="lineNum">      81 </span><span class="lineCov">            112 :         return _M_value;</span>
-<span class="lineNum">      82 </span>                :       }
-<span class="lineNum">      83 </span>                : 
-<span class="lineNum">      84 </span>                :       const _Tp*
-<span class="lineNum">      85 </span>                :       operator-&gt;() const { return &amp;(operator*()); }
-<span class="lineNum">      86 </span>                : 
-<span class="lineNum">      87 </span>                :       istream_iterator&amp;
-<span class="lineNum">      88 </span><span class="lineCov">             64 :       operator++()</span>
-<span class="lineNum">      89 </span>                :       {
-<span class="lineNum">      90 </span>                :         __glibcxx_requires_cond(_M_ok,
-<span class="lineNum">      91 </span>                :                                 _M_message(__gnu_debug::__msg_inc_istream)
-<span class="lineNum">      92 </span>                :                                 ._M_iterator(*this));
-<span class="lineNum">      93 </span><span class="lineCov">             64 :         _M_read();</span>
-<span class="lineNum">      94 </span><span class="lineCov">             64 :         return *this;</span>
-<span class="lineNum">      95 </span>                :       }
-<span class="lineNum">      96 </span>                : 
-<span class="lineNum">      97 </span>                :       istream_iterator
-<span class="lineNum">      98 </span>                :       operator++(int)
-<span class="lineNum">      99 </span>                :       {
-<span class="lineNum">     100 </span>                :         __glibcxx_requires_cond(_M_ok,
-<span class="lineNum">     101 </span>                :                                 _M_message(__gnu_debug::__msg_inc_istream)
-<span class="lineNum">     102 </span>                :                                 ._M_iterator(*this));
-<span class="lineNum">     103 </span>                :         istream_iterator __tmp = *this;
-<span class="lineNum">     104 </span>                :         _M_read();
-<span class="lineNum">     105 </span>                :         return __tmp;
-<span class="lineNum">     106 </span>                :       }
-<span class="lineNum">     107 </span>                : 
-<span class="lineNum">     108 </span>                :       bool
-<span class="lineNum">     109 </span><span class="lineCov">             80 :       _M_equal(const istream_iterator&amp; __x) const</span>
-<span class="lineNum">     110 </span><span class="lineCov">             80 :       { return (_M_ok == __x._M_ok) &amp;&amp; (!_M_ok || _M_stream == __x._M_stream); }</span>
-<span class="lineNum">     111 </span>                : 
-<span class="lineNum">     112 </span>                :     private:
-<span class="lineNum">     113 </span>                :       void
-<span class="lineNum">     114 </span><span class="lineCov">             80 :       _M_read()</span>
-<span class="lineNum">     115 </span>                :       {
-<span class="lineNum">     116 </span><span class="lineCov">             80 :         _M_ok = (_M_stream &amp;&amp; *_M_stream) ? true : false;</span>
-<span class="lineNum">     117 </span><span class="lineCov">             80 :         if (_M_ok)</span>
-<span class="lineNum">     118 </span>                :           {
-<span class="lineNum">     119 </span><span class="lineCov">             80 :             *_M_stream &gt;&gt; _M_value;</span>
-<span class="lineNum">     120 </span><span class="lineCov">             80 :             _M_ok = *_M_stream ? true : false;</span>
-<span class="lineNum">     121 </span>                :           }
-<span class="lineNum">     122 </span><span class="lineCov">             80 :       }</span>
-<span class="lineNum">     123 </span>                :     };
-<span class="lineNum">     124 </span>                : 
-<span class="lineNum">     125 </span>                :   ///  Return true if x and y are both end or not end, or x and y are the same.
-<span class="lineNum">     126 </span>                :   template&lt;typename _Tp, typename _CharT, typename _Traits, typename _Dist&gt;
-<span class="lineNum">     127 </span>                :     inline bool
-<span class="lineNum">     128 </span>                :     operator==(const istream_iterator&lt;_Tp, _CharT, _Traits, _Dist&gt;&amp; __x,
-<span class="lineNum">     129 </span>                :                const istream_iterator&lt;_Tp, _CharT, _Traits, _Dist&gt;&amp; __y)
-<span class="lineNum">     130 </span>                :     { return __x._M_equal(__y); }
-<span class="lineNum">     131 </span>                : 
-<span class="lineNum">     132 </span>                :   ///  Return false if x and y are both end or not end, or x and y are the same.
-<span class="lineNum">     133 </span>                :   template &lt;class _Tp, class _CharT, class _Traits, class _Dist&gt;
-<span class="lineNum">     134 </span>                :     inline bool
-<span class="lineNum">     135 </span>                :     operator!=(const istream_iterator&lt;_Tp, _CharT, _Traits, _Dist&gt;&amp; __x,
-<span class="lineNum">     136 </span><span class="lineCov">             80 :                const istream_iterator&lt;_Tp, _CharT, _Traits, _Dist&gt;&amp; __y)</span>
-<span class="lineNum">     137 </span><span class="lineCov">             80 :     { return !__x._M_equal(__y); }</span>
-<span class="lineNum">     138 </span>                : 
-<span class="lineNum">     139 </span>                :   /**
-<span class="lineNum">     140 </span>                :    *  @brief  Provides output iterator semantics for streams.
-<span class="lineNum">     141 </span>                :    *
-<span class="lineNum">     142 </span>                :    *  This class provides an iterator to write to an ostream.  The type Tp is
-<span class="lineNum">     143 </span>                :    *  the only type written by this iterator and there must be an
-<span class="lineNum">     144 </span>                :    *  operator&lt;&lt;(Tp) defined.
-<span class="lineNum">     145 </span>                :    *
-<span class="lineNum">     146 </span>                :    *  @param  Tp  The type to write to the ostream.
-<span class="lineNum">     147 </span>                :    *  @param  CharT  The ostream char_type.
-<span class="lineNum">     148 </span>                :    *  @param  Traits  The ostream char_traits.
-<span class="lineNum">     149 </span>                :   */
-<span class="lineNum">     150 </span>                :   template&lt;typename _Tp, typename _CharT = char,
-<span class="lineNum">     151 </span>                :            typename _Traits = char_traits&lt;_CharT&gt; &gt;
-<span class="lineNum">     152 </span>                :     class ostream_iterator
-<span class="lineNum">     153 </span>                :     : public iterator&lt;output_iterator_tag, void, void, void, void&gt;
-<span class="lineNum">     154 </span>                :     {
-<span class="lineNum">     155 </span>                :     public:
-<span class="lineNum">     156 </span>                :       //@{
-<span class="lineNum">     157 </span>                :       /// Public typedef
-<span class="lineNum">     158 </span>                :       typedef _CharT                         char_type;
-<span class="lineNum">     159 </span>                :       typedef _Traits                        traits_type;
-<span class="lineNum">     160 </span>                :       typedef basic_ostream&lt;_CharT, _Traits&gt; ostream_type;
-<span class="lineNum">     161 </span>                :       //@}
-<span class="lineNum">     162 </span>                : 
-<span class="lineNum">     163 </span>                :     private:
-<span class="lineNum">     164 </span>                :       ostream_type*     _M_stream;
-<span class="lineNum">     165 </span>                :       const _CharT*     _M_string;
-<span class="lineNum">     166 </span>                : 
-<span class="lineNum">     167 </span>                :     public:
-<span class="lineNum">     168 </span>                :       /// Construct from an ostream.
-<span class="lineNum">     169 </span>                :       ostream_iterator(ostream_type&amp; __s) : _M_stream(&amp;__s), _M_string(0) {}
-<span class="lineNum">     170 </span>                : 
-<span class="lineNum">     171 </span>                :       /**
-<span class="lineNum">     172 </span>                :        *  Construct from an ostream.
-<span class="lineNum">     173 </span>                :        *
-<span class="lineNum">     174 </span>                :        *  The delimiter string @a c is written to the stream after every Tp
-<span class="lineNum">     175 </span>                :        *  written to the stream.  The delimiter is not copied, and thus must
-<span class="lineNum">     176 </span>                :        *  not be destroyed while this iterator is in use.
-<span class="lineNum">     177 </span>                :        *
-<span class="lineNum">     178 </span>                :        *  @param  s  Underlying ostream to write to.
-<span class="lineNum">     179 </span>                :        *  @param  c  CharT delimiter string to insert.
-<span class="lineNum">     180 </span>                :       */
-<span class="lineNum">     181 </span><span class="lineCov">              5 :       ostream_iterator(ostream_type&amp; __s, const _CharT* __c)</span>
-<span class="lineNum">     182 </span><span class="lineCov">              5 :       : _M_stream(&amp;__s), _M_string(__c)  { }</span>
-<span class="lineNum">     183 </span>                : 
-<span class="lineNum">     184 </span>                :       /// Copy constructor.
-<span class="lineNum">     185 </span><span class="lineCov">             25 :       ostream_iterator(const ostream_iterator&amp; __obj)</span>
-<span class="lineNum">     186 </span><span class="lineCov">             25 :       : _M_stream(__obj._M_stream), _M_string(__obj._M_string)  { }</span>
-<span class="lineNum">     187 </span>                : 
-<span class="lineNum">     188 </span>                :       /// Writes @a value to underlying ostream using operator&lt;&lt;.  If
-<span class="lineNum">     189 </span>                :       /// constructed with delimiter string, writes delimiter to ostream.
-<span class="lineNum">     190 </span>                :       ostream_iterator&amp;
-<span class="lineNum">     191 </span><span class="lineCov">              8 :       operator=(const _Tp&amp; __value)</span>
-<span class="lineNum">     192 </span>                :       {
-<span class="lineNum">     193 </span>                :         __glibcxx_requires_cond(_M_stream != 0,
-<span class="lineNum">     194 </span>                :                                 _M_message(__gnu_debug::__msg_output_ostream)
-<span class="lineNum">     195 </span>                :                                 ._M_iterator(*this));
-<span class="lineNum">     196 </span><span class="lineCov">              8 :         *_M_stream &lt;&lt; __value;</span>
-<span class="lineNum">     197 </span><span class="lineCov">              8 :         if (_M_string) *_M_stream &lt;&lt; _M_string;</span>
-<span class="lineNum">     198 </span><span class="lineCov">              8 :         return *this;</span>
-<span class="lineNum">     199 </span>                :       }
-<span class="lineNum">     200 </span>                : 
-<span class="lineNum">     201 </span>                :       ostream_iterator&amp;
-<span class="lineNum">     202 </span><span class="lineCov">              8 :       operator*()</span>
-<span class="lineNum">     203 </span><span class="lineCov">              8 :       { return *this; }</span>
-<span class="lineNum">     204 </span>                : 
-<span class="lineNum">     205 </span>                :       ostream_iterator&amp;
-<span class="lineNum">     206 </span><span class="lineCov">              8 :       operator++()</span>
-<span class="lineNum">     207 </span><span class="lineCov">              8 :       { return *this; }</span>
-<span class="lineNum">     208 </span>                : 
-<span class="lineNum">     209 </span>                :       ostream_iterator&amp;
-<span class="lineNum">     210 </span>                :       operator++(int)
-<span class="lineNum">     211 </span>                :       { return *this; }
-<span class="lineNum">     212 </span>                :     };
-<span class="lineNum">     213 </span>                : 
-<span class="lineNum">     214 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">     215 </span>                : 
-<span class="lineNum">     216 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/bits/vector.tcc.gcov.html b/rep/usr/include/c++/4.3/bits/vector.tcc.gcov.html
deleted file mode 100644
index e0268a8..0000000
--- a/rep/usr/include/c++/4.3/bits/vector.tcc.gcov.html
+++ /dev/null
@@ -1,723 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/vector.tcc</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - vector.tcc</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">96</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">75.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">72</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // Vector implementation (out of line) -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007
-<span class="lineNum">       4 </span>                : // Free Software Foundation, Inc.
-<span class="lineNum">       5 </span>                : //
-<span class="lineNum">       6 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       7 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       8 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">       9 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      10 </span>                : // any later version.
-<span class="lineNum">      11 </span>                : 
-<span class="lineNum">      12 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      13 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      14 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      15 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      16 </span>                : 
-<span class="lineNum">      17 </span>                : // You should have received a copy of the GNU General Public License along
-<span class="lineNum">      18 </span>                : // with this library; see the file COPYING.  If not, write to the Free
-<span class="lineNum">      19 </span>                : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-<span class="lineNum">      20 </span>                : // USA.
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      23 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      24 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      25 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      26 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      27 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      28 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      29 </span>                : // the GNU General Public License.
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : /*
-<span class="lineNum">      32 </span>                :  *
-<span class="lineNum">      33 </span>                :  * Copyright (c) 1994
-<span class="lineNum">      34 </span>                :  * Hewlett-Packard Company
-<span class="lineNum">      35 </span>                :  *
-<span class="lineNum">      36 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      37 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      38 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      39 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      40 </span>                :  * in supporting documentation.  Hewlett-Packard Company makes no
-<span class="lineNum">      41 </span>                :  * representations about the suitability of this software for any
-<span class="lineNum">      42 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      43 </span>                :  *
-<span class="lineNum">      44 </span>                :  *
-<span class="lineNum">      45 </span>                :  * Copyright (c) 1996
-<span class="lineNum">      46 </span>                :  * Silicon Graphics Computer Systems, Inc.
-<span class="lineNum">      47 </span>                :  *
-<span class="lineNum">      48 </span>                :  * Permission to use, copy, modify, distribute and sell this software
-<span class="lineNum">      49 </span>                :  * and its documentation for any purpose is hereby granted without fee,
-<span class="lineNum">      50 </span>                :  * provided that the above copyright notice appear in all copies and
-<span class="lineNum">      51 </span>                :  * that both that copyright notice and this permission notice appear
-<span class="lineNum">      52 </span>                :  * in supporting documentation.  Silicon Graphics makes no
-<span class="lineNum">      53 </span>                :  * representations about the suitability of this  software for any
-<span class="lineNum">      54 </span>                :  * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
-<span class="lineNum">      55 </span>                :  */
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span>                : /** @file vector.tcc
-<span class="lineNum">      58 </span>                :  *  This is an internal header file, included by other library headers.
-<span class="lineNum">      59 </span>                :  *  You should not attempt to use it directly.
-<span class="lineNum">      60 </span>                :  */
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span>                : #ifndef _VECTOR_TCC
-<span class="lineNum">      63 </span>                : #define _VECTOR_TCC 1
-<span class="lineNum">      64 </span>                : 
-<span class="lineNum">      65 </span>                : _GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D)
-<span class="lineNum">      66 </span>                : 
-<span class="lineNum">      67 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">      68 </span>                :     void
-<span class="lineNum">      69 </span>                :     vector&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">      70 </span><span class="lineCov">             10 :     reserve(size_type __n)</span>
-<span class="lineNum">      71 </span>                :     {
-<span class="lineNum">      72 </span><span class="lineCov">             10 :       if (__n &gt; this-&gt;max_size())</span>
-<span class="lineNum">      73 </span><span class="lineNoCov">              0 :         __throw_length_error(__N(&quot;vector::reserve&quot;));</span>
-<span class="lineNum">      74 </span><span class="lineCov">             10 :       if (this-&gt;capacity() &lt; __n)</span>
-<span class="lineNum">      75 </span>                :         {
-<span class="lineNum">      76 </span><span class="lineCov">             10 :           const size_type __old_size = size();</span>
-<span class="lineNum">      77 </span>                :           pointer __tmp = _M_allocate_and_copy(__n,
-<span class="lineNum">      78 </span>                :                  _GLIBCXX_MAKE_MOVE_ITERATOR(this-&gt;_M_impl._M_start),
-<span class="lineNum">      79 </span><span class="lineCov">             10 :                  _GLIBCXX_MAKE_MOVE_ITERATOR(this-&gt;_M_impl._M_finish));</span>
-<span class="lineNum">      80 </span><span class="lineCov">             10 :           std::_Destroy(this-&gt;_M_impl._M_start, this-&gt;_M_impl._M_finish,</span>
-<span class="lineNum">      81 </span>                :                         _M_get_Tp_allocator());
-<span class="lineNum">      82 </span><span class="lineCov">             10 :           _M_deallocate(this-&gt;_M_impl._M_start,</span>
-<span class="lineNum">      83 </span>                :                         this-&gt;_M_impl._M_end_of_storage
-<span class="lineNum">      84 </span>                :                         - this-&gt;_M_impl._M_start);
-<span class="lineNum">      85 </span><span class="lineCov">             10 :           this-&gt;_M_impl._M_start = __tmp;</span>
-<span class="lineNum">      86 </span><span class="lineCov">             10 :           this-&gt;_M_impl._M_finish = __tmp + __old_size;</span>
-<span class="lineNum">      87 </span><span class="lineCov">             10 :           this-&gt;_M_impl._M_end_of_storage = this-&gt;_M_impl._M_start + __n;</span>
-<span class="lineNum">      88 </span>                :         }
-<span class="lineNum">      89 </span><span class="lineCov">             10 :     }</span>
-<span class="lineNum">      90 </span>                : 
-<span class="lineNum">      91 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">      92 </span>                :     typename vector&lt;_Tp, _Alloc&gt;::iterator
-<span class="lineNum">      93 </span>                :     vector&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">      94 </span><span class="lineCov">             19 :     insert(iterator __position, const value_type&amp; __x)</span>
-<span class="lineNum">      95 </span>                :     {
-<span class="lineNum">      96 </span><span class="lineCov">             19 :       const size_type __n = __position - begin();</span>
-<span class="lineNum">      97 </span><span class="lineCov">             19 :       if (this-&gt;_M_impl._M_finish != this-&gt;_M_impl._M_end_of_storage</span>
-<span class="lineNum">      98 </span>                :           &amp;&amp; __position == end())
-<span class="lineNum">      99 </span>                :         {
-<span class="lineNum">     100 </span><span class="lineNoCov">              0 :           this-&gt;_M_impl.construct(this-&gt;_M_impl._M_finish, __x);</span>
-<span class="lineNum">     101 </span><span class="lineNoCov">              0 :           ++this-&gt;_M_impl._M_finish;</span>
-<span class="lineNum">     102 </span>                :         }
-<span class="lineNum">     103 </span>                :       else
-<span class="lineNum">     104 </span>                :         {
-<span class="lineNum">     105 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     106 </span>                :           if (this-&gt;_M_impl._M_finish != this-&gt;_M_impl._M_end_of_storage)
-<span class="lineNum">     107 </span>                :             {
-<span class="lineNum">     108 </span>                :               _Tp __x_copy = __x;
-<span class="lineNum">     109 </span>                :               _M_insert_aux(__position, std::move(__x_copy));
-<span class="lineNum">     110 </span>                :             }
-<span class="lineNum">     111 </span>                :           else
-<span class="lineNum">     112 </span>                : #endif
-<span class="lineNum">     113 </span><span class="lineCov">             19 :             _M_insert_aux(__position, __x);</span>
-<span class="lineNum">     114 </span>                :         }
-<span class="lineNum">     115 </span><span class="lineCov">             19 :       return iterator(this-&gt;_M_impl._M_start + __n);</span>
-<span class="lineNum">     116 </span>                :     }
-<span class="lineNum">     117 </span>                : 
-<span class="lineNum">     118 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     119 </span>                :     typename vector&lt;_Tp, _Alloc&gt;::iterator
-<span class="lineNum">     120 </span>                :     vector&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     121 </span><span class="lineCov">              2 :     erase(iterator __position)</span>
-<span class="lineNum">     122 </span>                :     {
-<span class="lineNum">     123 </span><span class="lineCov">              2 :       if (__position + 1 != end())</span>
-<span class="lineNum">     124 </span><span class="lineNoCov">              0 :         _GLIBCXX_MOVE3(__position + 1, end(), __position);</span>
-<span class="lineNum">     125 </span><span class="lineCov">              2 :       --this-&gt;_M_impl._M_finish;</span>
-<span class="lineNum">     126 </span><span class="lineCov">              2 :       this-&gt;_M_impl.destroy(this-&gt;_M_impl._M_finish);</span>
-<span class="lineNum">     127 </span><span class="lineCov">              2 :       return __position;</span>
-<span class="lineNum">     128 </span>                :     }
-<span class="lineNum">     129 </span>                : 
-<span class="lineNum">     130 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     131 </span>                :     typename vector&lt;_Tp, _Alloc&gt;::iterator
-<span class="lineNum">     132 </span>                :     vector&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     133 </span>                :     erase(iterator __first, iterator __last)
-<span class="lineNum">     134 </span>                :     {
-<span class="lineNum">     135 </span>                :       if (__last != end())
-<span class="lineNum">     136 </span>                :         _GLIBCXX_MOVE3(__last, end(), __first);
-<span class="lineNum">     137 </span>                :       _M_erase_at_end(__first.base() + (end() - __last));
-<span class="lineNum">     138 </span>                :       return __first;
-<span class="lineNum">     139 </span>                :     }
-<span class="lineNum">     140 </span>                : 
-<span class="lineNum">     141 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     142 </span>                :     vector&lt;_Tp, _Alloc&gt;&amp;
-<span class="lineNum">     143 </span>                :     vector&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     144 </span>                :     operator=(const vector&lt;_Tp, _Alloc&gt;&amp; __x)
-<span class="lineNum">     145 </span>                :     {
-<span class="lineNum">     146 </span>                :       if (&amp;__x != this)
-<span class="lineNum">     147 </span>                :         {
-<span class="lineNum">     148 </span>                :           const size_type __xlen = __x.size();
-<span class="lineNum">     149 </span>                :           if (__xlen &gt; capacity())
-<span class="lineNum">     150 </span>                :             {
-<span class="lineNum">     151 </span>                :               pointer __tmp = _M_allocate_and_copy(__xlen, __x.begin(),
-<span class="lineNum">     152 </span>                :                                                    __x.end());
-<span class="lineNum">     153 </span>                :               std::_Destroy(this-&gt;_M_impl._M_start, this-&gt;_M_impl._M_finish,
-<span class="lineNum">     154 </span>                :                             _M_get_Tp_allocator());
-<span class="lineNum">     155 </span>                :               _M_deallocate(this-&gt;_M_impl._M_start,
-<span class="lineNum">     156 </span>                :                             this-&gt;_M_impl._M_end_of_storage
-<span class="lineNum">     157 </span>                :                             - this-&gt;_M_impl._M_start);
-<span class="lineNum">     158 </span>                :               this-&gt;_M_impl._M_start = __tmp;
-<span class="lineNum">     159 </span>                :               this-&gt;_M_impl._M_end_of_storage = this-&gt;_M_impl._M_start + __xlen;
-<span class="lineNum">     160 </span>                :             }
-<span class="lineNum">     161 </span>                :           else if (size() &gt;= __xlen)
-<span class="lineNum">     162 </span>                :             {
-<span class="lineNum">     163 </span>                :               std::_Destroy(std::copy(__x.begin(), __x.end(), begin()),
-<span class="lineNum">     164 </span>                :                             end(), _M_get_Tp_allocator());
-<span class="lineNum">     165 </span>                :             }
-<span class="lineNum">     166 </span>                :           else
-<span class="lineNum">     167 </span>                :             {
-<span class="lineNum">     168 </span>                :               std::copy(__x._M_impl._M_start, __x._M_impl._M_start + size(),
-<span class="lineNum">     169 </span>                :                         this-&gt;_M_impl._M_start);
-<span class="lineNum">     170 </span>                :               std::__uninitialized_copy_a(__x._M_impl._M_start + size(),
-<span class="lineNum">     171 </span>                :                                           __x._M_impl._M_finish,
-<span class="lineNum">     172 </span>                :                                           this-&gt;_M_impl._M_finish,
-<span class="lineNum">     173 </span>                :                                           _M_get_Tp_allocator());
-<span class="lineNum">     174 </span>                :             }
-<span class="lineNum">     175 </span>                :           this-&gt;_M_impl._M_finish = this-&gt;_M_impl._M_start + __xlen;
-<span class="lineNum">     176 </span>                :         }
-<span class="lineNum">     177 </span>                :       return *this;
-<span class="lineNum">     178 </span>                :     }
-<span class="lineNum">     179 </span>                : 
-<span class="lineNum">     180 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     181 </span>                :     void
-<span class="lineNum">     182 </span>                :     vector&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     183 </span>                :     _M_fill_assign(size_t __n, const value_type&amp; __val)
-<span class="lineNum">     184 </span>                :     {
-<span class="lineNum">     185 </span>                :       if (__n &gt; capacity())
-<span class="lineNum">     186 </span>                :         {
-<span class="lineNum">     187 </span>                :           vector __tmp(__n, __val, _M_get_Tp_allocator());
-<span class="lineNum">     188 </span>                :           __tmp.swap(*this);
-<span class="lineNum">     189 </span>                :         }
-<span class="lineNum">     190 </span>                :       else if (__n &gt; size())
-<span class="lineNum">     191 </span>                :         {
-<span class="lineNum">     192 </span>                :           std::fill(begin(), end(), __val);
-<span class="lineNum">     193 </span>                :           std::__uninitialized_fill_n_a(this-&gt;_M_impl._M_finish,
-<span class="lineNum">     194 </span>                :                                         __n - size(), __val,
-<span class="lineNum">     195 </span>                :                                         _M_get_Tp_allocator());
-<span class="lineNum">     196 </span>                :           this-&gt;_M_impl._M_finish += __n - size();
-<span class="lineNum">     197 </span>                :         }
-<span class="lineNum">     198 </span>                :       else
-<span class="lineNum">     199 </span>                :         _M_erase_at_end(std::fill_n(this-&gt;_M_impl._M_start, __n, __val));
-<span class="lineNum">     200 </span>                :     }
-<span class="lineNum">     201 </span>                : 
-<span class="lineNum">     202 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     203 </span>                :     template&lt;typename _InputIterator&gt;
-<span class="lineNum">     204 </span>                :       void
-<span class="lineNum">     205 </span>                :       vector&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     206 </span>                :       _M_assign_aux(_InputIterator __first, _InputIterator __last,
-<span class="lineNum">     207 </span>                :                     std::input_iterator_tag)
-<span class="lineNum">     208 </span>                :       {
-<span class="lineNum">     209 </span>                :         pointer __cur(this-&gt;_M_impl._M_start);
-<span class="lineNum">     210 </span>                :         for (; __first != __last &amp;&amp; __cur != this-&gt;_M_impl._M_finish;
-<span class="lineNum">     211 </span>                :              ++__cur, ++__first)
-<span class="lineNum">     212 </span>                :           *__cur = *__first;
-<span class="lineNum">     213 </span>                :         if (__first == __last)
-<span class="lineNum">     214 </span>                :           _M_erase_at_end(__cur);
-<span class="lineNum">     215 </span>                :         else
-<span class="lineNum">     216 </span>                :           insert(end(), __first, __last);
-<span class="lineNum">     217 </span>                :       }
-<span class="lineNum">     218 </span>                : 
-<span class="lineNum">     219 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     220 </span>                :     template&lt;typename _ForwardIterator&gt;
-<span class="lineNum">     221 </span>                :       void
-<span class="lineNum">     222 </span>                :       vector&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     223 </span>                :       _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last,
-<span class="lineNum">     224 </span>                :                     std::forward_iterator_tag)
-<span class="lineNum">     225 </span>                :       {
-<span class="lineNum">     226 </span>                :         const size_type __len = std::distance(__first, __last);
-<span class="lineNum">     227 </span>                : 
-<span class="lineNum">     228 </span>                :         if (__len &gt; capacity())
-<span class="lineNum">     229 </span>                :           {
-<span class="lineNum">     230 </span>                :             pointer __tmp(_M_allocate_and_copy(__len, __first, __last));
-<span class="lineNum">     231 </span>                :             std::_Destroy(this-&gt;_M_impl._M_start, this-&gt;_M_impl._M_finish,
-<span class="lineNum">     232 </span>                :                           _M_get_Tp_allocator());
-<span class="lineNum">     233 </span>                :             _M_deallocate(this-&gt;_M_impl._M_start,
-<span class="lineNum">     234 </span>                :                           this-&gt;_M_impl._M_end_of_storage
-<span class="lineNum">     235 </span>                :                           - this-&gt;_M_impl._M_start);
-<span class="lineNum">     236 </span>                :             this-&gt;_M_impl._M_start = __tmp;
-<span class="lineNum">     237 </span>                :             this-&gt;_M_impl._M_finish = this-&gt;_M_impl._M_start + __len;
-<span class="lineNum">     238 </span>                :             this-&gt;_M_impl._M_end_of_storage = this-&gt;_M_impl._M_finish;
-<span class="lineNum">     239 </span>                :           }
-<span class="lineNum">     240 </span>                :         else if (size() &gt;= __len)
-<span class="lineNum">     241 </span>                :           _M_erase_at_end(std::copy(__first, __last, this-&gt;_M_impl._M_start));
-<span class="lineNum">     242 </span>                :         else
-<span class="lineNum">     243 </span>                :           {
-<span class="lineNum">     244 </span>                :             _ForwardIterator __mid = __first;
-<span class="lineNum">     245 </span>                :             std::advance(__mid, size());
-<span class="lineNum">     246 </span>                :             std::copy(__first, __mid, this-&gt;_M_impl._M_start);
-<span class="lineNum">     247 </span>                :             this-&gt;_M_impl._M_finish =
-<span class="lineNum">     248 </span>                :               std::__uninitialized_copy_a(__mid, __last,
-<span class="lineNum">     249 </span>                :                                           this-&gt;_M_impl._M_finish,
-<span class="lineNum">     250 </span>                :                                           _M_get_Tp_allocator());
-<span class="lineNum">     251 </span>                :           }
-<span class="lineNum">     252 </span>                :       }
-<span class="lineNum">     253 </span>                : 
-<span class="lineNum">     254 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     255 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     256 </span>                :     template&lt;typename... _Args&gt;
-<span class="lineNum">     257 </span>                :       typename vector&lt;_Tp, _Alloc&gt;::iterator
-<span class="lineNum">     258 </span>                :       vector&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     259 </span>                :       emplace(iterator __position, _Args&amp;&amp;... __args)
-<span class="lineNum">     260 </span>                :       {
-<span class="lineNum">     261 </span>                :         const size_type __n = __position - begin();
-<span class="lineNum">     262 </span>                :         if (this-&gt;_M_impl._M_finish != this-&gt;_M_impl._M_end_of_storage
-<span class="lineNum">     263 </span>                :             &amp;&amp; __position == end())
-<span class="lineNum">     264 </span>                :           {
-<span class="lineNum">     265 </span>                :             this-&gt;_M_impl.construct(this-&gt;_M_impl._M_finish,
-<span class="lineNum">     266 </span>                :                                     std::forward&lt;_Args&gt;(__args)...);
-<span class="lineNum">     267 </span>                :             ++this-&gt;_M_impl._M_finish;
-<span class="lineNum">     268 </span>                :           }
-<span class="lineNum">     269 </span>                :         else
-<span class="lineNum">     270 </span>                :           _M_insert_aux(__position, std::forward&lt;_Args&gt;(__args)...);
-<span class="lineNum">     271 </span>                :         return iterator(this-&gt;_M_impl._M_start + __n);
-<span class="lineNum">     272 </span>                :       }
-<span class="lineNum">     273 </span>                : 
-<span class="lineNum">     274 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     275 </span>                :     template&lt;typename... _Args&gt;
-<span class="lineNum">     276 </span>                :       void
-<span class="lineNum">     277 </span>                :       vector&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     278 </span>                :       _M_insert_aux(iterator __position, _Args&amp;&amp;... __args)
-<span class="lineNum">     279 </span>                : #else
-<span class="lineNum">     280 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     281 </span>                :     void
-<span class="lineNum">     282 </span>                :     vector&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     283 </span><span class="lineCov">          20651 :     _M_insert_aux(iterator __position, const _Tp&amp; __x)</span>
-<span class="lineNum">     284 </span>                : #endif
-<span class="lineNum">     285 </span>                :     {
-<span class="lineNum">     286 </span><span class="lineCov">          20651 :       if (this-&gt;_M_impl._M_finish != this-&gt;_M_impl._M_end_of_storage)</span>
-<span class="lineNum">     287 </span>                :         {
-<span class="lineNum">     288 </span><span class="lineNoCov">              0 :           this-&gt;_M_impl.construct(this-&gt;_M_impl._M_finish,</span>
-<span class="lineNum">     289 </span>                :                                   _GLIBCXX_MOVE(*(this-&gt;_M_impl._M_finish
-<span class="lineNum">     290 </span>                :                                                   - 1)));
-<span class="lineNum">     291 </span><span class="lineNoCov">              0 :           ++this-&gt;_M_impl._M_finish;</span>
-<span class="lineNum">     292 </span>                : #ifndef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     293 </span><span class="lineNoCov">              0 :           _Tp __x_copy = __x;</span>
-<span class="lineNum">     294 </span>                : #endif
-<span class="lineNum">     295 </span><span class="lineNoCov">              0 :           _GLIBCXX_MOVE_BACKWARD3(__position.base(),</span>
-<span class="lineNum">     296 </span>                :                                   this-&gt;_M_impl._M_finish - 2,
-<span class="lineNum">     297 </span>                :                                   this-&gt;_M_impl._M_finish - 1);
-<span class="lineNum">     298 </span>                : #ifndef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     299 </span><span class="lineNoCov">              0 :           *__position = __x_copy;</span>
-<span class="lineNum">     300 </span>                : #else
-<span class="lineNum">     301 </span>                :           *__position = _Tp(std::forward&lt;_Args&gt;(__args)...);
-<span class="lineNum">     302 </span>                : #endif
-<span class="lineNum">     303 </span>                :         }
-<span class="lineNum">     304 </span>                :       else
-<span class="lineNum">     305 </span>                :         {
-<span class="lineNum">     306 </span>                :           const size_type __len =
-<span class="lineNum">     307 </span><span class="lineCov">          20651 :             _M_check_len(size_type(1), &quot;vector::_M_insert_aux&quot;);</span>
-<span class="lineNum">     308 </span><span class="lineCov">          20651 :           pointer __new_start(this-&gt;_M_allocate(__len));</span>
-<span class="lineNum">     309 </span><span class="lineCov">          20651 :           pointer __new_finish(__new_start);</span>
-<span class="lineNum">     310 </span>                :           try
-<span class="lineNum">     311 </span>                :             {
-<span class="lineNum">     312 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     313 </span>                :               this-&gt;_M_impl.construct(__new_start + (__position - begin()),
-<span class="lineNum">     314 </span>                :                                       std::forward&lt;_Args&gt;(__args)...);
-<span class="lineNum">     315 </span>                : #endif
-<span class="lineNum">     316 </span><span class="lineCov">          20651 :               __new_finish =</span>
-<span class="lineNum">     317 </span>                :                 std::__uninitialized_move_a(this-&gt;_M_impl._M_start,
-<span class="lineNum">     318 </span>                :                                             __position.base(), __new_start,
-<span class="lineNum">     319 </span>                :                                             _M_get_Tp_allocator());
-<span class="lineNum">     320 </span>                : #ifndef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     321 </span><span class="lineCov">          20651 :               this-&gt;_M_impl.construct(__new_finish, __x);</span>
-<span class="lineNum">     322 </span>                : #endif
-<span class="lineNum">     323 </span><span class="lineCov">          20651 :               ++__new_finish;</span>
-<span class="lineNum">     324 </span><span class="lineCov">          20651 :               __new_finish =</span>
-<span class="lineNum">     325 </span>                :                 std::__uninitialized_move_a(__position.base(),
-<span class="lineNum">     326 </span>                :                                             this-&gt;_M_impl._M_finish,
-<span class="lineNum">     327 </span>                :                                             __new_finish,
-<span class="lineNum">     328 </span>                :                                             _M_get_Tp_allocator());
-<span class="lineNum">     329 </span>                :             }
-<span class="lineNum">     330 </span><span class="lineNoCov">              0 :           catch(...)</span>
-<span class="lineNum">     331 </span>                :             {
-<span class="lineNum">     332 </span><span class="lineNoCov">              0 :               std::_Destroy(__new_start, __new_finish, _M_get_Tp_allocator());</span>
-<span class="lineNum">     333 </span><span class="lineNoCov">              0 :               _M_deallocate(__new_start, __len);</span>
-<span class="lineNum">     334 </span><span class="lineNoCov">              0 :               __throw_exception_again;</span>
-<span class="lineNum">     335 </span>                :             }
-<span class="lineNum">     336 </span><span class="lineCov">          20651 :           std::_Destroy(this-&gt;_M_impl._M_start, this-&gt;_M_impl._M_finish,</span>
-<span class="lineNum">     337 </span>                :                         _M_get_Tp_allocator());
-<span class="lineNum">     338 </span><span class="lineCov">          20651 :           _M_deallocate(this-&gt;_M_impl._M_start,</span>
-<span class="lineNum">     339 </span>                :                         this-&gt;_M_impl._M_end_of_storage
-<span class="lineNum">     340 </span>                :                         - this-&gt;_M_impl._M_start);
-<span class="lineNum">     341 </span><span class="lineCov">          20651 :           this-&gt;_M_impl._M_start = __new_start;</span>
-<span class="lineNum">     342 </span><span class="lineCov">          20651 :           this-&gt;_M_impl._M_finish = __new_finish;</span>
-<span class="lineNum">     343 </span><span class="lineCov">          20651 :           this-&gt;_M_impl._M_end_of_storage = __new_start + __len;</span>
-<span class="lineNum">     344 </span>                :         }
-<span class="lineNum">     345 </span><span class="lineCov">          20651 :     }</span>
-<span class="lineNum">     346 </span>                : 
-<span class="lineNum">     347 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     348 </span>                :     void
-<span class="lineNum">     349 </span>                :     vector&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     350 </span><span class="lineCov">          22443 :     _M_fill_insert(iterator __position, size_type __n, const value_type&amp; __x)</span>
-<span class="lineNum">     351 </span>                :     {
-<span class="lineNum">     352 </span><span class="lineCov">          22443 :       if (__n != 0)</span>
-<span class="lineNum">     353 </span>                :         {
-<span class="lineNum">     354 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     355 </span>                :           value_type __x_copy = __x;
-<span class="lineNum">     356 </span>                : #endif
-<span class="lineNum">     357 </span><span class="lineCov">          22443 :           if (size_type(this-&gt;_M_impl._M_end_of_storage</span>
-<span class="lineNum">     358 </span>                :                         - this-&gt;_M_impl._M_finish) &gt;= __n)
-<span class="lineNum">     359 </span>                :             {
-<span class="lineNum">     360 </span>                : #ifndef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     361 </span><span class="lineCov">          22386 :               value_type __x_copy = __x;</span>
-<span class="lineNum">     362 </span>                : #endif
-<span class="lineNum">     363 </span><span class="lineCov">          22386 :               const size_type __elems_after = end() - __position;</span>
-<span class="lineNum">     364 </span><span class="lineCov">          22386 :               pointer __old_finish(this-&gt;_M_impl._M_finish);</span>
-<span class="lineNum">     365 </span><span class="lineCov">          22386 :               if (__elems_after &gt; __n)</span>
-<span class="lineNum">     366 </span>                :                 {
-<span class="lineNum">     367 </span><span class="lineNoCov">              0 :                   std::__uninitialized_move_a(this-&gt;_M_impl._M_finish - __n,</span>
-<span class="lineNum">     368 </span>                :                                               this-&gt;_M_impl._M_finish,
-<span class="lineNum">     369 </span>                :                                               this-&gt;_M_impl._M_finish,
-<span class="lineNum">     370 </span>                :                                               _M_get_Tp_allocator());
-<span class="lineNum">     371 </span><span class="lineNoCov">              0 :                   this-&gt;_M_impl._M_finish += __n;</span>
-<span class="lineNum">     372 </span><span class="lineNoCov">              0 :                   _GLIBCXX_MOVE_BACKWARD3(__position.base(),</span>
-<span class="lineNum">     373 </span>                :                                           __old_finish - __n, __old_finish);
-<span class="lineNum">     374 </span><span class="lineNoCov">              0 :                   std::fill(__position.base(), __position.base() + __n,</span>
-<span class="lineNum">     375 </span>                :                             __x_copy);
-<span class="lineNum">     376 </span>                :                 }
-<span class="lineNum">     377 </span>                :               else
-<span class="lineNum">     378 </span>                :                 {
-<span class="lineNum">     379 </span><span class="lineCov">          22386 :                   std::__uninitialized_fill_n_a(this-&gt;_M_impl._M_finish,</span>
-<span class="lineNum">     380 </span>                :                                                 __n - __elems_after,
-<span class="lineNum">     381 </span>                :                                                 __x_copy,
-<span class="lineNum">     382 </span>                :                                                 _M_get_Tp_allocator());
-<span class="lineNum">     383 </span><span class="lineCov">          22386 :                   this-&gt;_M_impl._M_finish += __n - __elems_after;</span>
-<span class="lineNum">     384 </span><span class="lineCov">          22386 :                   std::__uninitialized_move_a(__position.base(), __old_finish,</span>
-<span class="lineNum">     385 </span>                :                                               this-&gt;_M_impl._M_finish,
-<span class="lineNum">     386 </span>                :                                               _M_get_Tp_allocator());
-<span class="lineNum">     387 </span><span class="lineCov">          22386 :                   this-&gt;_M_impl._M_finish += __elems_after;</span>
-<span class="lineNum">     388 </span><span class="lineCov">          22386 :                   std::fill(__position.base(), __old_finish, __x_copy);</span>
-<span class="lineNum">     389 </span>                :                 }
-<span class="lineNum">     390 </span>                :             }
-<span class="lineNum">     391 </span>                :           else
-<span class="lineNum">     392 </span>                :             {
-<span class="lineNum">     393 </span>                :               const size_type __len =
-<span class="lineNum">     394 </span><span class="lineCov">             57 :                 _M_check_len(__n, &quot;vector::_M_fill_insert&quot;);</span>
-<span class="lineNum">     395 </span><span class="lineCov">             57 :               pointer __new_start(this-&gt;_M_allocate(__len));</span>
-<span class="lineNum">     396 </span><span class="lineCov">             57 :               pointer __new_finish(__new_start);</span>
-<span class="lineNum">     397 </span>                :               try
-<span class="lineNum">     398 </span>                :                 {
-<span class="lineNum">     399 </span><span class="lineCov">             57 :                   __new_finish =</span>
-<span class="lineNum">     400 </span>                :                     std::__uninitialized_move_a(this-&gt;_M_impl._M_start,
-<span class="lineNum">     401 </span>                :                                                 __position.base(),
-<span class="lineNum">     402 </span>                :                                                 __new_start,
-<span class="lineNum">     403 </span>                :                                                 _M_get_Tp_allocator());
-<span class="lineNum">     404 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     405 </span>                :                   std::__uninitialized_fill_n_a(__new_finish, __n, __x_copy,
-<span class="lineNum">     406 </span>                : #else
-<span class="lineNum">     407 </span><span class="lineCov">             57 :                   std::__uninitialized_fill_n_a(__new_finish, __n, __x,</span>
-<span class="lineNum">     408 </span>                : #endif
-<span class="lineNum">     409 </span>                :                                                 _M_get_Tp_allocator());
-<span class="lineNum">     410 </span><span class="lineCov">             57 :                   __new_finish += __n;</span>
-<span class="lineNum">     411 </span><span class="lineCov">             57 :                   __new_finish =</span>
-<span class="lineNum">     412 </span>                :                     std::__uninitialized_move_a(__position.base(),
-<span class="lineNum">     413 </span>                :                                                 this-&gt;_M_impl._M_finish,
-<span class="lineNum">     414 </span>                :                                                 __new_finish,
-<span class="lineNum">     415 </span>                :                                                 _M_get_Tp_allocator());
-<span class="lineNum">     416 </span>                :                 }
-<span class="lineNum">     417 </span><span class="lineNoCov">              0 :               catch(...)</span>
-<span class="lineNum">     418 </span>                :                 {
-<span class="lineNum">     419 </span><span class="lineNoCov">              0 :                   std::_Destroy(__new_start, __new_finish,</span>
-<span class="lineNum">     420 </span>                :                                 _M_get_Tp_allocator());
-<span class="lineNum">     421 </span><span class="lineNoCov">              0 :                   _M_deallocate(__new_start, __len);</span>
-<span class="lineNum">     422 </span><span class="lineNoCov">              0 :                   __throw_exception_again;</span>
-<span class="lineNum">     423 </span>                :                 }
-<span class="lineNum">     424 </span><span class="lineCov">             57 :               std::_Destroy(this-&gt;_M_impl._M_start, this-&gt;_M_impl._M_finish,</span>
-<span class="lineNum">     425 </span>                :                             _M_get_Tp_allocator());
-<span class="lineNum">     426 </span><span class="lineCov">             57 :               _M_deallocate(this-&gt;_M_impl._M_start,</span>
-<span class="lineNum">     427 </span>                :                             this-&gt;_M_impl._M_end_of_storage
-<span class="lineNum">     428 </span>                :                             - this-&gt;_M_impl._M_start);
-<span class="lineNum">     429 </span><span class="lineCov">             57 :               this-&gt;_M_impl._M_start = __new_start;</span>
-<span class="lineNum">     430 </span><span class="lineCov">             57 :               this-&gt;_M_impl._M_finish = __new_finish;</span>
-<span class="lineNum">     431 </span><span class="lineCov">             57 :               this-&gt;_M_impl._M_end_of_storage = __new_start + __len;</span>
-<span class="lineNum">     432 </span>                :             }
-<span class="lineNum">     433 </span>                :         }
-<span class="lineNum">     434 </span><span class="lineCov">          22443 :     }</span>
-<span class="lineNum">     435 </span>                : 
-<span class="lineNum">     436 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     437 </span>                :     template&lt;typename _InputIterator&gt;
-<span class="lineNum">     438 </span>                :       void
-<span class="lineNum">     439 </span>                :       vector&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     440 </span>                :       _M_range_insert(iterator __pos, _InputIterator __first,
-<span class="lineNum">     441 </span>                :                       _InputIterator __last, std::input_iterator_tag)
-<span class="lineNum">     442 </span>                :       {
-<span class="lineNum">     443 </span>                :         for (; __first != __last; ++__first)
-<span class="lineNum">     444 </span>                :           {
-<span class="lineNum">     445 </span>                :             __pos = insert(__pos, *__first);
-<span class="lineNum">     446 </span>                :             ++__pos;
-<span class="lineNum">     447 </span>                :           }
-<span class="lineNum">     448 </span>                :       }
-<span class="lineNum">     449 </span>                : 
-<span class="lineNum">     450 </span>                :   template&lt;typename _Tp, typename _Alloc&gt;
-<span class="lineNum">     451 </span>                :     template&lt;typename _ForwardIterator&gt;
-<span class="lineNum">     452 </span>                :       void
-<span class="lineNum">     453 </span>                :       vector&lt;_Tp, _Alloc&gt;::
-<span class="lineNum">     454 </span>                :       _M_range_insert(iterator __position, _ForwardIterator __first,
-<span class="lineNum">     455 </span>                :                       _ForwardIterator __last, std::forward_iterator_tag)
-<span class="lineNum">     456 </span>                :       {
-<span class="lineNum">     457 </span>                :         if (__first != __last)
-<span class="lineNum">     458 </span>                :           {
-<span class="lineNum">     459 </span>                :             const size_type __n = std::distance(__first, __last);
-<span class="lineNum">     460 </span>                :             if (size_type(this-&gt;_M_impl._M_end_of_storage
-<span class="lineNum">     461 </span>                :                           - this-&gt;_M_impl._M_finish) &gt;= __n)
-<span class="lineNum">     462 </span>                :               {
-<span class="lineNum">     463 </span>                :                 const size_type __elems_after = end() - __position;
-<span class="lineNum">     464 </span>                :                 pointer __old_finish(this-&gt;_M_impl._M_finish);
-<span class="lineNum">     465 </span>                :                 if (__elems_after &gt; __n)
-<span class="lineNum">     466 </span>                :                   {
-<span class="lineNum">     467 </span>                :                     std::__uninitialized_move_a(this-&gt;_M_impl._M_finish - __n,
-<span class="lineNum">     468 </span>                :                                                 this-&gt;_M_impl._M_finish,
-<span class="lineNum">     469 </span>                :                                                 this-&gt;_M_impl._M_finish,
-<span class="lineNum">     470 </span>                :                                                 _M_get_Tp_allocator());
-<span class="lineNum">     471 </span>                :                     this-&gt;_M_impl._M_finish += __n;
-<span class="lineNum">     472 </span>                :                     _GLIBCXX_MOVE_BACKWARD3(__position.base(),
-<span class="lineNum">     473 </span>                :                                             __old_finish - __n, __old_finish);
-<span class="lineNum">     474 </span>                :                     std::copy(__first, __last, __position);
-<span class="lineNum">     475 </span>                :                   }
-<span class="lineNum">     476 </span>                :                 else
-<span class="lineNum">     477 </span>                :                   {
-<span class="lineNum">     478 </span>                :                     _ForwardIterator __mid = __first;
-<span class="lineNum">     479 </span>                :                     std::advance(__mid, __elems_after);
-<span class="lineNum">     480 </span>                :                     std::__uninitialized_copy_a(__mid, __last,
-<span class="lineNum">     481 </span>                :                                                 this-&gt;_M_impl._M_finish,
-<span class="lineNum">     482 </span>                :                                                 _M_get_Tp_allocator());
-<span class="lineNum">     483 </span>                :                     this-&gt;_M_impl._M_finish += __n - __elems_after;
-<span class="lineNum">     484 </span>                :                     std::__uninitialized_move_a(__position.base(),
-<span class="lineNum">     485 </span>                :                                                 __old_finish,
-<span class="lineNum">     486 </span>                :                                                 this-&gt;_M_impl._M_finish,
-<span class="lineNum">     487 </span>                :                                                 _M_get_Tp_allocator());
-<span class="lineNum">     488 </span>                :                     this-&gt;_M_impl._M_finish += __elems_after;
-<span class="lineNum">     489 </span>                :                     std::copy(__first, __mid, __position);
-<span class="lineNum">     490 </span>                :                   }
-<span class="lineNum">     491 </span>                :               }
-<span class="lineNum">     492 </span>                :             else
-<span class="lineNum">     493 </span>                :               {
-<span class="lineNum">     494 </span>                :                 const size_type __len =
-<span class="lineNum">     495 </span>                :                   _M_check_len(__n, &quot;vector::_M_range_insert&quot;);
-<span class="lineNum">     496 </span>                :                 pointer __new_start(this-&gt;_M_allocate(__len));
-<span class="lineNum">     497 </span>                :                 pointer __new_finish(__new_start);
-<span class="lineNum">     498 </span>                :                 try
-<span class="lineNum">     499 </span>                :                   {
-<span class="lineNum">     500 </span>                :                     __new_finish =
-<span class="lineNum">     501 </span>                :                       std::__uninitialized_move_a(this-&gt;_M_impl._M_start,
-<span class="lineNum">     502 </span>                :                                                   __position.base(),
-<span class="lineNum">     503 </span>                :                                                   __new_start,
-<span class="lineNum">     504 </span>                :                                                   _M_get_Tp_allocator());
-<span class="lineNum">     505 </span>                :                     __new_finish =
-<span class="lineNum">     506 </span>                :                       std::__uninitialized_copy_a(__first, __last,
-<span class="lineNum">     507 </span>                :                                                   __new_finish,
-<span class="lineNum">     508 </span>                :                                                   _M_get_Tp_allocator());
-<span class="lineNum">     509 </span>                :                     __new_finish =
-<span class="lineNum">     510 </span>                :                       std::__uninitialized_move_a(__position.base(),
-<span class="lineNum">     511 </span>                :                                                   this-&gt;_M_impl._M_finish,
-<span class="lineNum">     512 </span>                :                                                   __new_finish,
-<span class="lineNum">     513 </span>                :                                                   _M_get_Tp_allocator());
-<span class="lineNum">     514 </span>                :                   }
-<span class="lineNum">     515 </span>                :                 catch(...)
-<span class="lineNum">     516 </span>                :                   {
-<span class="lineNum">     517 </span>                :                     std::_Destroy(__new_start, __new_finish,
-<span class="lineNum">     518 </span>                :                                   _M_get_Tp_allocator());
-<span class="lineNum">     519 </span>                :                     _M_deallocate(__new_start, __len);
-<span class="lineNum">     520 </span>                :                     __throw_exception_again;
-<span class="lineNum">     521 </span>                :                   }
-<span class="lineNum">     522 </span>                :                 std::_Destroy(this-&gt;_M_impl._M_start, this-&gt;_M_impl._M_finish,
-<span class="lineNum">     523 </span>                :                               _M_get_Tp_allocator());
-<span class="lineNum">     524 </span>                :                 _M_deallocate(this-&gt;_M_impl._M_start,
-<span class="lineNum">     525 </span>                :                               this-&gt;_M_impl._M_end_of_storage
-<span class="lineNum">     526 </span>                :                               - this-&gt;_M_impl._M_start);
-<span class="lineNum">     527 </span>                :                 this-&gt;_M_impl._M_start = __new_start;
-<span class="lineNum">     528 </span>                :                 this-&gt;_M_impl._M_finish = __new_finish;
-<span class="lineNum">     529 </span>                :                 this-&gt;_M_impl._M_end_of_storage = __new_start + __len;
-<span class="lineNum">     530 </span>                :               }
-<span class="lineNum">     531 </span>                :           }
-<span class="lineNum">     532 </span>                :       }
-<span class="lineNum">     533 </span>                : 
-<span class="lineNum">     534 </span>                : 
-<span class="lineNum">     535 </span>                :   // vector&lt;bool&gt;
-<span class="lineNum">     536 </span>                : 
-<span class="lineNum">     537 </span>                :   template&lt;typename _Alloc&gt;
-<span class="lineNum">     538 </span>                :     void
-<span class="lineNum">     539 </span>                :     vector&lt;bool, _Alloc&gt;::
-<span class="lineNum">     540 </span>                :     reserve(size_type __n)
-<span class="lineNum">     541 </span>                :     {
-<span class="lineNum">     542 </span>                :       if (__n &gt; this-&gt;max_size())
-<span class="lineNum">     543 </span>                :         __throw_length_error(__N(&quot;vector::reserve&quot;));
-<span class="lineNum">     544 </span>                :       if (this-&gt;capacity() &lt; __n)
-<span class="lineNum">     545 </span>                :         {
-<span class="lineNum">     546 </span>                :           _Bit_type* __q = this-&gt;_M_allocate(__n);
-<span class="lineNum">     547 </span>                :           this-&gt;_M_impl._M_finish = _M_copy_aligned(begin(), end(),
-<span class="lineNum">     548 </span>                :                                                     iterator(__q, 0));
-<span class="lineNum">     549 </span>                :           this-&gt;_M_deallocate();
-<span class="lineNum">     550 </span>                :           this-&gt;_M_impl._M_start = iterator(__q, 0);
-<span class="lineNum">     551 </span>                :           this-&gt;_M_impl._M_end_of_storage = (__q + (__n + int(_S_word_bit) - 1)
-<span class="lineNum">     552 </span>                :                                              / int(_S_word_bit));
-<span class="lineNum">     553 </span>                :         }
-<span class="lineNum">     554 </span>                :     }
-<span class="lineNum">     555 </span>                : 
-<span class="lineNum">     556 </span>                :   template&lt;typename _Alloc&gt;
-<span class="lineNum">     557 </span>                :     void
-<span class="lineNum">     558 </span>                :     vector&lt;bool, _Alloc&gt;::
-<span class="lineNum">     559 </span>                :     _M_fill_insert(iterator __position, size_type __n, bool __x)
-<span class="lineNum">     560 </span>                :     {
-<span class="lineNum">     561 </span>                :       if (__n == 0)
-<span class="lineNum">     562 </span>                :         return;
-<span class="lineNum">     563 </span>                :       if (capacity() - size() &gt;= __n)
-<span class="lineNum">     564 </span>                :         {
-<span class="lineNum">     565 </span>                :           std::copy_backward(__position, end(),
-<span class="lineNum">     566 </span>                :                              this-&gt;_M_impl._M_finish + difference_type(__n));
-<span class="lineNum">     567 </span>                :           std::fill(__position, __position + difference_type(__n), __x);
-<span class="lineNum">     568 </span>                :           this-&gt;_M_impl._M_finish += difference_type(__n);
-<span class="lineNum">     569 </span>                :         }
-<span class="lineNum">     570 </span>                :       else
-<span class="lineNum">     571 </span>                :         {
-<span class="lineNum">     572 </span>                :           const size_type __len = 
-<span class="lineNum">     573 </span>                :             _M_check_len(__n, &quot;vector&lt;bool&gt;::_M_fill_insert&quot;);
-<span class="lineNum">     574 </span>                :           _Bit_type * __q = this-&gt;_M_allocate(__len);
-<span class="lineNum">     575 </span>                :           iterator __i = _M_copy_aligned(begin(), __position,
-<span class="lineNum">     576 </span>                :                                          iterator(__q, 0));
-<span class="lineNum">     577 </span>                :           std::fill(__i, __i + difference_type(__n), __x);
-<span class="lineNum">     578 </span>                :           this-&gt;_M_impl._M_finish = std::copy(__position, end(),
-<span class="lineNum">     579 </span>                :                                               __i + difference_type(__n));
-<span class="lineNum">     580 </span>                :           this-&gt;_M_deallocate();
-<span class="lineNum">     581 </span>                :           this-&gt;_M_impl._M_end_of_storage = (__q + ((__len
-<span class="lineNum">     582 </span>                :                                                      + int(_S_word_bit) - 1)
-<span class="lineNum">     583 </span>                :                                                     / int(_S_word_bit)));
-<span class="lineNum">     584 </span>                :           this-&gt;_M_impl._M_start = iterator(__q, 0);
-<span class="lineNum">     585 </span>                :         }
-<span class="lineNum">     586 </span>                :     }
-<span class="lineNum">     587 </span>                : 
-<span class="lineNum">     588 </span>                :   template&lt;typename _Alloc&gt;
-<span class="lineNum">     589 </span>                :     template&lt;typename _ForwardIterator&gt;
-<span class="lineNum">     590 </span>                :       void
-<span class="lineNum">     591 </span>                :       vector&lt;bool, _Alloc&gt;::
-<span class="lineNum">     592 </span>                :       _M_insert_range(iterator __position, _ForwardIterator __first, 
-<span class="lineNum">     593 </span>                :                       _ForwardIterator __last, std::forward_iterator_tag)
-<span class="lineNum">     594 </span>                :       {
-<span class="lineNum">     595 </span>                :         if (__first != __last)
-<span class="lineNum">     596 </span>                :           {
-<span class="lineNum">     597 </span>                :             size_type __n = std::distance(__first, __last);
-<span class="lineNum">     598 </span>                :             if (capacity() - size() &gt;= __n)
-<span class="lineNum">     599 </span>                :               {
-<span class="lineNum">     600 </span>                :                 std::copy_backward(__position, end(),
-<span class="lineNum">     601 </span>                :                                    this-&gt;_M_impl._M_finish
-<span class="lineNum">     602 </span>                :                                    + difference_type(__n));
-<span class="lineNum">     603 </span>                :                 std::copy(__first, __last, __position);
-<span class="lineNum">     604 </span>                :                 this-&gt;_M_impl._M_finish += difference_type(__n);
-<span class="lineNum">     605 </span>                :               }
-<span class="lineNum">     606 </span>                :             else
-<span class="lineNum">     607 </span>                :               {
-<span class="lineNum">     608 </span>                :                 const size_type __len =
-<span class="lineNum">     609 </span>                :                   _M_check_len(__n, &quot;vector&lt;bool&gt;::_M_insert_range&quot;);
-<span class="lineNum">     610 </span>                :                 _Bit_type * __q = this-&gt;_M_allocate(__len);
-<span class="lineNum">     611 </span>                :                 iterator __i = _M_copy_aligned(begin(), __position,
-<span class="lineNum">     612 </span>                :                                                iterator(__q, 0));
-<span class="lineNum">     613 </span>                :                 __i = std::copy(__first, __last, __i);
-<span class="lineNum">     614 </span>                :                 this-&gt;_M_impl._M_finish = std::copy(__position, end(), __i);
-<span class="lineNum">     615 </span>                :                 this-&gt;_M_deallocate();
-<span class="lineNum">     616 </span>                :                 this-&gt;_M_impl._M_end_of_storage = (__q
-<span class="lineNum">     617 </span>                :                                                    + ((__len
-<span class="lineNum">     618 </span>                :                                                        + int(_S_word_bit) - 1)
-<span class="lineNum">     619 </span>                :                                                       / int(_S_word_bit)));
-<span class="lineNum">     620 </span>                :                 this-&gt;_M_impl._M_start = iterator(__q, 0);
-<span class="lineNum">     621 </span>                :               }
-<span class="lineNum">     622 </span>                :           }
-<span class="lineNum">     623 </span>                :       }
-<span class="lineNum">     624 </span>                : 
-<span class="lineNum">     625 </span>                :   template&lt;typename _Alloc&gt;
-<span class="lineNum">     626 </span>                :     void
-<span class="lineNum">     627 </span>                :     vector&lt;bool, _Alloc&gt;::
-<span class="lineNum">     628 </span><span class="lineCov">              1 :     _M_insert_aux(iterator __position, bool __x)</span>
-<span class="lineNum">     629 </span>                :     {
-<span class="lineNum">     630 </span><span class="lineCov">              1 :       if (this-&gt;_M_impl._M_finish._M_p != this-&gt;_M_impl._M_end_of_storage)</span>
-<span class="lineNum">     631 </span>                :         {
-<span class="lineNum">     632 </span><span class="lineNoCov">              0 :           std::copy_backward(__position, this-&gt;_M_impl._M_finish, </span>
-<span class="lineNum">     633 </span>                :                              this-&gt;_M_impl._M_finish + 1);
-<span class="lineNum">     634 </span><span class="lineNoCov">              0 :           *__position = __x;</span>
-<span class="lineNum">     635 </span><span class="lineNoCov">              0 :           ++this-&gt;_M_impl._M_finish;</span>
-<span class="lineNum">     636 </span>                :         }
-<span class="lineNum">     637 </span>                :       else
-<span class="lineNum">     638 </span>                :         {
-<span class="lineNum">     639 </span>                :           const size_type __len =
-<span class="lineNum">     640 </span><span class="lineCov">              1 :             _M_check_len(size_type(1), &quot;vector&lt;bool&gt;::_M_insert_aux&quot;);</span>
-<span class="lineNum">     641 </span><span class="lineCov">              1 :           _Bit_type * __q = this-&gt;_M_allocate(__len);</span>
-<span class="lineNum">     642 </span>                :           iterator __i = _M_copy_aligned(begin(), __position,
-<span class="lineNum">     643 </span><span class="lineCov">              1 :                                          iterator(__q, 0));</span>
-<span class="lineNum">     644 </span><span class="lineCov">              1 :           *__i++ = __x;</span>
-<span class="lineNum">     645 </span><span class="lineCov">              1 :           this-&gt;_M_impl._M_finish = std::copy(__position, end(), __i);</span>
-<span class="lineNum">     646 </span><span class="lineCov">              1 :           this-&gt;_M_deallocate();</span>
-<span class="lineNum">     647 </span><span class="lineCov">              1 :           this-&gt;_M_impl._M_end_of_storage = (__q + ((__len</span>
-<span class="lineNum">     648 </span>                :                                                      + int(_S_word_bit) - 1)
-<span class="lineNum">     649 </span>                :                                                     / int(_S_word_bit)));
-<span class="lineNum">     650 </span><span class="lineCov">              1 :           this-&gt;_M_impl._M_start = iterator(__q, 0);</span>
-<span class="lineNum">     651 </span>                :         }
-<span class="lineNum">     652 </span><span class="lineCov">              1 :     }</span>
-<span class="lineNum">     653 </span>                : 
-<span class="lineNum">     654 </span>                : _GLIBCXX_END_NESTED_NAMESPACE
-<span class="lineNum">     655 </span>                : 
-<span class="lineNum">     656 </span>                : #endif /* _VECTOR_TCC */
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/cmath.gcov.html b/rep/usr/include/c++/4.3/cmath.gcov.html
deleted file mode 100644
index cd12c31..0000000
--- a/rep/usr/include/c++/4.3/cmath.gcov.html
+++ /dev/null
@@ -1,710 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/cmath</title>
-  <link rel="stylesheet" type="text/css" href="../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3</a> - cmath</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">2</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">2</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- C++ -*- C forwarding header.
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005,
-<span class="lineNum">       4 </span>                : // 2006, 2007
-<span class="lineNum">       5 </span>                : // Free Software Foundation, Inc.
-<span class="lineNum">       6 </span>                : //
-<span class="lineNum">       7 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       8 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       9 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">      10 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      11 </span>                : // any later version.
-<span class="lineNum">      12 </span>                : 
-<span class="lineNum">      13 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      14 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      15 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      16 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      17 </span>                : 
-<span class="lineNum">      18 </span>                : // You should have received a copy of the GNU General Public License
-<span class="lineNum">      19 </span>                : // along with this library; see the file COPYING.  If not, write to
-<span class="lineNum">      20 </span>                : // the Free Software Foundation, 51 Franklin Street, Fifth Floor,
-<span class="lineNum">      21 </span>                : // Boston, MA 02110-1301, USA.
-<span class="lineNum">      22 </span>                : 
-<span class="lineNum">      23 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      24 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      25 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      26 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      27 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      28 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      29 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      30 </span>                : // the GNU General Public License.
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span>                : /** @file include/cmath
-<span class="lineNum">      33 </span>                :  *  This is a Standard C++ Library file.  You should @c #include this file
-<span class="lineNum">      34 </span>                :  *  in your programs, rather than any of the &quot;*.h&quot; implementation files.
-<span class="lineNum">      35 </span>                :  *
-<span class="lineNum">      36 </span>                :  *  This is the C++ version of the Standard C Library header @c math.h,
-<span class="lineNum">      37 </span>                :  *  and its contents are (mostly) the same as that header, but are all
-<span class="lineNum">      38 </span>                :  *  contained in the namespace @c std (except for names which are defined
-<span class="lineNum">      39 </span>                :  *  as macros in C).
-<span class="lineNum">      40 </span>                :  */
-<span class="lineNum">      41 </span>                : 
-<span class="lineNum">      42 </span>                : //
-<span class="lineNum">      43 </span>                : // ISO C++ 14882: 26.5  C library
-<span class="lineNum">      44 </span>                : //
-<span class="lineNum">      45 </span>                : 
-<span class="lineNum">      46 </span>                : #pragma GCC system_header
-<span class="lineNum">      47 </span>                : 
-<span class="lineNum">      48 </span>                : #include &lt;bits/c++config.h&gt;
-<span class="lineNum">      49 </span>                : #include &lt;bits/cpp_type_traits.h&gt;
-<span class="lineNum">      50 </span>                : #include &lt;ext/type_traits.h&gt;
-<span class="lineNum">      51 </span>                : #include_next &lt;math.h&gt;
-<span class="lineNum">      52 </span>                : 
-<span class="lineNum">      53 </span>                : #ifndef _GLIBCXX_CMATH
-<span class="lineNum">      54 </span>                : #define _GLIBCXX_CMATH 1
-<span class="lineNum">      55 </span>                : 
-<span class="lineNum">      56 </span>                : // Get rid of those macros defined in &lt;math.h&gt; in lieu of real functions.
-<span class="lineNum">      57 </span>                : #undef abs
-<span class="lineNum">      58 </span>                : #undef div
-<span class="lineNum">      59 </span>                : #undef acos
-<span class="lineNum">      60 </span>                : #undef asin
-<span class="lineNum">      61 </span>                : #undef atan
-<span class="lineNum">      62 </span>                : #undef atan2
-<span class="lineNum">      63 </span>                : #undef ceil
-<span class="lineNum">      64 </span>                : #undef cos
-<span class="lineNum">      65 </span>                : #undef cosh
-<span class="lineNum">      66 </span>                : #undef exp
-<span class="lineNum">      67 </span>                : #undef fabs
-<span class="lineNum">      68 </span>                : #undef floor
-<span class="lineNum">      69 </span>                : #undef fmod
-<span class="lineNum">      70 </span>                : #undef frexp
-<span class="lineNum">      71 </span>                : #undef ldexp
-<span class="lineNum">      72 </span>                : #undef log
-<span class="lineNum">      73 </span>                : #undef log10
-<span class="lineNum">      74 </span>                : #undef modf
-<span class="lineNum">      75 </span>                : #undef pow
-<span class="lineNum">      76 </span>                : #undef sin
-<span class="lineNum">      77 </span>                : #undef sinh
-<span class="lineNum">      78 </span>                : #undef sqrt
-<span class="lineNum">      79 </span>                : #undef tan
-<span class="lineNum">      80 </span>                : #undef tanh
-<span class="lineNum">      81 </span>                : 
-<span class="lineNum">      82 </span>                : _GLIBCXX_BEGIN_NAMESPACE(std)
-<span class="lineNum">      83 </span>                : 
-<span class="lineNum">      84 </span>                :   // Forward declaration of a helper function.  This really should be
-<span class="lineNum">      85 </span>                :   // an `exported' forward declaration.
-<span class="lineNum">      86 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">      87 </span>                :     _Tp __cmath_power(_Tp, unsigned int);
-<span class="lineNum">      88 </span>                : 
-<span class="lineNum">      89 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">      90 </span>                :     inline _Tp
-<span class="lineNum">      91 </span>                :     __pow_helper(_Tp __x, int __n)
-<span class="lineNum">      92 </span>                :     {
-<span class="lineNum">      93 </span>                :       return __n &lt; 0
-<span class="lineNum">      94 </span>                :         ? _Tp(1)/__cmath_power(__x, -__n)
-<span class="lineNum">      95 </span>                :         : __cmath_power(__x, __n);
-<span class="lineNum">      96 </span>                :     }
-<span class="lineNum">      97 </span>                : 
-<span class="lineNum">      98 </span>                :   inline double
-<span class="lineNum">      99 </span>                :   abs(double __x)
-<span class="lineNum">     100 </span>                :   { return __builtin_fabs(__x); }
-<span class="lineNum">     101 </span>                : 
-<span class="lineNum">     102 </span>                :   inline float
-<span class="lineNum">     103 </span>                :   abs(float __x)
-<span class="lineNum">     104 </span>                :   { return __builtin_fabsf(__x); }
-<span class="lineNum">     105 </span>                : 
-<span class="lineNum">     106 </span>                :   inline long double
-<span class="lineNum">     107 </span>                :   abs(long double __x)
-<span class="lineNum">     108 </span>                :   { return __builtin_fabsl(__x); }
-<span class="lineNum">     109 </span>                : 
-<span class="lineNum">     110 </span>                :   using ::acos;
-<span class="lineNum">     111 </span>                : 
-<span class="lineNum">     112 </span>                :   inline float
-<span class="lineNum">     113 </span>                :   acos(float __x)
-<span class="lineNum">     114 </span>                :   { return __builtin_acosf(__x); }
-<span class="lineNum">     115 </span>                : 
-<span class="lineNum">     116 </span>                :   inline long double
-<span class="lineNum">     117 </span>                :   acos(long double __x)
-<span class="lineNum">     118 </span>                :   { return __builtin_acosl(__x); }
-<span class="lineNum">     119 </span>                : 
-<span class="lineNum">     120 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     121 </span>                :     inline typename __gnu_cxx::__enable_if&lt;__is_integer&lt;_Tp&gt;::__value, 
-<span class="lineNum">     122 </span>                :                                            double&gt;::__type
-<span class="lineNum">     123 </span>                :     acos(_Tp __x)
-<span class="lineNum">     124 </span>                :     { return __builtin_acos(__x); }
-<span class="lineNum">     125 </span>                : 
-<span class="lineNum">     126 </span>                :   using ::asin;
-<span class="lineNum">     127 </span>                : 
-<span class="lineNum">     128 </span>                :   inline float
-<span class="lineNum">     129 </span>                :   asin(float __x)
-<span class="lineNum">     130 </span>                :   { return __builtin_asinf(__x); }
-<span class="lineNum">     131 </span>                : 
-<span class="lineNum">     132 </span>                :   inline long double
-<span class="lineNum">     133 </span>                :   asin(long double __x)
-<span class="lineNum">     134 </span>                :   { return __builtin_asinl(__x); }
-<span class="lineNum">     135 </span>                : 
-<span class="lineNum">     136 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     137 </span>                :     inline typename __gnu_cxx::__enable_if&lt;__is_integer&lt;_Tp&gt;::__value,
-<span class="lineNum">     138 </span>                :                                            double&gt;::__type
-<span class="lineNum">     139 </span>                :     asin(_Tp __x)
-<span class="lineNum">     140 </span>                :     { return __builtin_asin(__x); }
-<span class="lineNum">     141 </span>                : 
-<span class="lineNum">     142 </span>                :   using ::atan;
-<span class="lineNum">     143 </span>                : 
-<span class="lineNum">     144 </span>                :   inline float
-<span class="lineNum">     145 </span>                :   atan(float __x)
-<span class="lineNum">     146 </span>                :   { return __builtin_atanf(__x); }
-<span class="lineNum">     147 </span>                : 
-<span class="lineNum">     148 </span>                :   inline long double
-<span class="lineNum">     149 </span>                :   atan(long double __x)
-<span class="lineNum">     150 </span>                :   { return __builtin_atanl(__x); }
-<span class="lineNum">     151 </span>                : 
-<span class="lineNum">     152 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     153 </span>                :     inline typename __gnu_cxx::__enable_if&lt;__is_integer&lt;_Tp&gt;::__value, 
-<span class="lineNum">     154 </span>                :                                            double&gt;::__type
-<span class="lineNum">     155 </span>                :     atan(_Tp __x)
-<span class="lineNum">     156 </span>                :     { return __builtin_atan(__x); }
-<span class="lineNum">     157 </span>                : 
-<span class="lineNum">     158 </span>                :   using ::atan2;
-<span class="lineNum">     159 </span>                : 
-<span class="lineNum">     160 </span>                :   inline float
-<span class="lineNum">     161 </span>                :   atan2(float __y, float __x)
-<span class="lineNum">     162 </span>                :   { return __builtin_atan2f(__y, __x); }
-<span class="lineNum">     163 </span>                : 
-<span class="lineNum">     164 </span>                :   inline long double
-<span class="lineNum">     165 </span>                :   atan2(long double __y, long double __x)
-<span class="lineNum">     166 </span>                :   { return __builtin_atan2l(__y, __x); }
-<span class="lineNum">     167 </span>                : 
-<span class="lineNum">     168 </span>                :   template&lt;typename _Tp, typename _Up&gt;
-<span class="lineNum">     169 </span>                :     inline
-<span class="lineNum">     170 </span>                :     typename __gnu_cxx::__promote_2&lt;
-<span class="lineNum">     171 </span>                :     typename __gnu_cxx::__enable_if&lt;__is_arithmetic&lt;_Tp&gt;::__value
-<span class="lineNum">     172 </span>                :                                     &amp;&amp; __is_arithmetic&lt;_Up&gt;::__value,
-<span class="lineNum">     173 </span>                :                                     _Tp&gt;::__type, _Up&gt;::__type
-<span class="lineNum">     174 </span>                :     atan2(_Tp __y, _Up __x)
-<span class="lineNum">     175 </span>                :     {
-<span class="lineNum">     176 </span>                :       typedef typename __gnu_cxx::__promote_2&lt;_Tp, _Up&gt;::__type __type;
-<span class="lineNum">     177 </span>                :       return atan2(__type(__y), __type(__x));
-<span class="lineNum">     178 </span>                :     }
-<span class="lineNum">     179 </span>                : 
-<span class="lineNum">     180 </span>                :   using ::ceil;
-<span class="lineNum">     181 </span>                : 
-<span class="lineNum">     182 </span>                :   inline float
-<span class="lineNum">     183 </span>                :   ceil(float __x)
-<span class="lineNum">     184 </span>                :   { return __builtin_ceilf(__x); }
-<span class="lineNum">     185 </span>                : 
-<span class="lineNum">     186 </span>                :   inline long double
-<span class="lineNum">     187 </span>                :   ceil(long double __x)
-<span class="lineNum">     188 </span>                :   { return __builtin_ceill(__x); }
-<span class="lineNum">     189 </span>                : 
-<span class="lineNum">     190 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     191 </span>                :     inline typename __gnu_cxx::__enable_if&lt;__is_integer&lt;_Tp&gt;::__value, 
-<span class="lineNum">     192 </span>                :                                            double&gt;::__type
-<span class="lineNum">     193 </span>                :     ceil(_Tp __x)
-<span class="lineNum">     194 </span>                :     { return __builtin_ceil(__x); }
-<span class="lineNum">     195 </span>                : 
-<span class="lineNum">     196 </span>                :   using ::cos;
-<span class="lineNum">     197 </span>                : 
-<span class="lineNum">     198 </span>                :   inline float
-<span class="lineNum">     199 </span>                :   cos(float __x)
-<span class="lineNum">     200 </span>                :   { return __builtin_cosf(__x); }
-<span class="lineNum">     201 </span>                : 
-<span class="lineNum">     202 </span>                :   inline long double
-<span class="lineNum">     203 </span>                :   cos(long double __x)
-<span class="lineNum">     204 </span>                :   { return __builtin_cosl(__x); }
-<span class="lineNum">     205 </span>                : 
-<span class="lineNum">     206 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     207 </span>                :     inline typename __gnu_cxx::__enable_if&lt;__is_integer&lt;_Tp&gt;::__value, 
-<span class="lineNum">     208 </span>                :                                            double&gt;::__type
-<span class="lineNum">     209 </span>                :     cos(_Tp __x)
-<span class="lineNum">     210 </span>                :     { return __builtin_cos(__x); }
-<span class="lineNum">     211 </span>                : 
-<span class="lineNum">     212 </span>                :   using ::cosh;
-<span class="lineNum">     213 </span>                : 
-<span class="lineNum">     214 </span>                :   inline float
-<span class="lineNum">     215 </span>                :   cosh(float __x)
-<span class="lineNum">     216 </span>                :   { return __builtin_coshf(__x); }
-<span class="lineNum">     217 </span>                : 
-<span class="lineNum">     218 </span>                :   inline long double
-<span class="lineNum">     219 </span>                :   cosh(long double __x)
-<span class="lineNum">     220 </span>                :   { return __builtin_coshl(__x); }
-<span class="lineNum">     221 </span>                : 
-<span class="lineNum">     222 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     223 </span>                :     inline typename __gnu_cxx::__enable_if&lt;__is_integer&lt;_Tp&gt;::__value, 
-<span class="lineNum">     224 </span>                :                                            double&gt;::__type
-<span class="lineNum">     225 </span>                :     cosh(_Tp __x)
-<span class="lineNum">     226 </span>                :     { return __builtin_cosh(__x); }
-<span class="lineNum">     227 </span>                : 
-<span class="lineNum">     228 </span>                :   using ::exp;
-<span class="lineNum">     229 </span>                : 
-<span class="lineNum">     230 </span>                :   inline float
-<span class="lineNum">     231 </span>                :   exp(float __x)
-<span class="lineNum">     232 </span>                :   { return __builtin_expf(__x); }
-<span class="lineNum">     233 </span>                : 
-<span class="lineNum">     234 </span>                :   inline long double
-<span class="lineNum">     235 </span>                :   exp(long double __x)
-<span class="lineNum">     236 </span>                :   { return __builtin_expl(__x); }
-<span class="lineNum">     237 </span>                : 
-<span class="lineNum">     238 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     239 </span>                :     inline typename __gnu_cxx::__enable_if&lt;__is_integer&lt;_Tp&gt;::__value, 
-<span class="lineNum">     240 </span>                :                                            double&gt;::__type
-<span class="lineNum">     241 </span>                :     exp(_Tp __x)
-<span class="lineNum">     242 </span>                :     { return __builtin_exp(__x); }
-<span class="lineNum">     243 </span>                : 
-<span class="lineNum">     244 </span>                :   using ::fabs;
-<span class="lineNum">     245 </span>                : 
-<span class="lineNum">     246 </span>                :   inline float
-<span class="lineNum">     247 </span>                :   fabs(float __x)
-<span class="lineNum">     248 </span>                :   { return __builtin_fabsf(__x); }
-<span class="lineNum">     249 </span>                : 
-<span class="lineNum">     250 </span>                :   inline long double
-<span class="lineNum">     251 </span>                :   fabs(long double __x)
-<span class="lineNum">     252 </span>                :   { return __builtin_fabsl(__x); }
-<span class="lineNum">     253 </span>                : 
-<span class="lineNum">     254 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     255 </span>                :     inline typename __gnu_cxx::__enable_if&lt;__is_integer&lt;_Tp&gt;::__value, 
-<span class="lineNum">     256 </span>                :                                            double&gt;::__type
-<span class="lineNum">     257 </span>                :     fabs(_Tp __x)
-<span class="lineNum">     258 </span>                :     { return __builtin_fabs(__x); }
-<span class="lineNum">     259 </span>                : 
-<span class="lineNum">     260 </span>                :   using ::floor;
-<span class="lineNum">     261 </span>                : 
-<span class="lineNum">     262 </span>                :   inline float
-<span class="lineNum">     263 </span>                :   floor(float __x)
-<span class="lineNum">     264 </span>                :   { return __builtin_floorf(__x); }
-<span class="lineNum">     265 </span>                : 
-<span class="lineNum">     266 </span>                :   inline long double
-<span class="lineNum">     267 </span>                :   floor(long double __x)
-<span class="lineNum">     268 </span>                :   { return __builtin_floorl(__x); }
-<span class="lineNum">     269 </span>                : 
-<span class="lineNum">     270 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     271 </span>                :     inline typename __gnu_cxx::__enable_if&lt;__is_integer&lt;_Tp&gt;::__value, 
-<span class="lineNum">     272 </span>                :                                            double&gt;::__type
-<span class="lineNum">     273 </span>                :     floor(_Tp __x)
-<span class="lineNum">     274 </span>                :     { return __builtin_floor(__x); }
-<span class="lineNum">     275 </span>                : 
-<span class="lineNum">     276 </span>                :   using ::fmod;
-<span class="lineNum">     277 </span>                : 
-<span class="lineNum">     278 </span>                :   inline float
-<span class="lineNum">     279 </span>                :   fmod(float __x, float __y)
-<span class="lineNum">     280 </span>                :   { return __builtin_fmodf(__x, __y); }
-<span class="lineNum">     281 </span>                : 
-<span class="lineNum">     282 </span>                :   inline long double
-<span class="lineNum">     283 </span>                :   fmod(long double __x, long double __y)
-<span class="lineNum">     284 </span>                :   { return __builtin_fmodl(__x, __y); }
-<span class="lineNum">     285 </span>                : 
-<span class="lineNum">     286 </span>                :   using ::frexp;
-<span class="lineNum">     287 </span>                : 
-<span class="lineNum">     288 </span>                :   inline float
-<span class="lineNum">     289 </span>                :   frexp(float __x, int* __exp)
-<span class="lineNum">     290 </span>                :   { return __builtin_frexpf(__x, __exp); }
-<span class="lineNum">     291 </span>                : 
-<span class="lineNum">     292 </span>                :   inline long double
-<span class="lineNum">     293 </span>                :   frexp(long double __x, int* __exp)
-<span class="lineNum">     294 </span>                :   { return __builtin_frexpl(__x, __exp); }
-<span class="lineNum">     295 </span>                : 
-<span class="lineNum">     296 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     297 </span>                :     inline typename __gnu_cxx::__enable_if&lt;__is_integer&lt;_Tp&gt;::__value, 
-<span class="lineNum">     298 </span>                :                                            double&gt;::__type
-<span class="lineNum">     299 </span>                :     frexp(_Tp __x, int* __exp)
-<span class="lineNum">     300 </span>                :     { return __builtin_frexp(__x, __exp); }
-<span class="lineNum">     301 </span>                : 
-<span class="lineNum">     302 </span>                :   using ::ldexp;
-<span class="lineNum">     303 </span>                : 
-<span class="lineNum">     304 </span>                :   inline float
-<span class="lineNum">     305 </span>                :   ldexp(float __x, int __exp)
-<span class="lineNum">     306 </span>                :   { return __builtin_ldexpf(__x, __exp); }
-<span class="lineNum">     307 </span>                : 
-<span class="lineNum">     308 </span>                :   inline long double
-<span class="lineNum">     309 </span>                :   ldexp(long double __x, int __exp)
-<span class="lineNum">     310 </span>                :   { return __builtin_ldexpl(__x, __exp); }
-<span class="lineNum">     311 </span>                : 
-<span class="lineNum">     312 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     313 </span>                :     inline typename __gnu_cxx::__enable_if&lt;__is_integer&lt;_Tp&gt;::__value, 
-<span class="lineNum">     314 </span>                :                                            double&gt;::__type
-<span class="lineNum">     315 </span>                :   ldexp(_Tp __x, int __exp)
-<span class="lineNum">     316 </span>                :   { return __builtin_ldexp(__x, __exp); }
-<span class="lineNum">     317 </span>                : 
-<span class="lineNum">     318 </span>                :   using ::log;
-<span class="lineNum">     319 </span>                : 
-<span class="lineNum">     320 </span>                :   inline float
-<span class="lineNum">     321 </span><span class="lineCov">              1 :   log(float __x)</span>
-<span class="lineNum">     322 </span><span class="lineCov">              1 :   { return __builtin_logf(__x); }</span>
-<span class="lineNum">     323 </span>                : 
-<span class="lineNum">     324 </span>                :   inline long double
-<span class="lineNum">     325 </span>                :   log(long double __x)
-<span class="lineNum">     326 </span>                :   { return __builtin_logl(__x); }
-<span class="lineNum">     327 </span>                : 
-<span class="lineNum">     328 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     329 </span>                :     inline typename __gnu_cxx::__enable_if&lt;__is_integer&lt;_Tp&gt;::__value, 
-<span class="lineNum">     330 </span>                :                                            double&gt;::__type
-<span class="lineNum">     331 </span>                :     log(_Tp __x)
-<span class="lineNum">     332 </span>                :     { return __builtin_log(__x); }
-<span class="lineNum">     333 </span>                : 
-<span class="lineNum">     334 </span>                :   using ::log10;
-<span class="lineNum">     335 </span>                : 
-<span class="lineNum">     336 </span>                :   inline float
-<span class="lineNum">     337 </span>                :   log10(float __x)
-<span class="lineNum">     338 </span>                :   { return __builtin_log10f(__x); }
-<span class="lineNum">     339 </span>                : 
-<span class="lineNum">     340 </span>                :   inline long double
-<span class="lineNum">     341 </span>                :   log10(long double __x)
-<span class="lineNum">     342 </span>                :   { return __builtin_log10l(__x); }
-<span class="lineNum">     343 </span>                : 
-<span class="lineNum">     344 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     345 </span>                :     inline typename __gnu_cxx::__enable_if&lt;__is_integer&lt;_Tp&gt;::__value, 
-<span class="lineNum">     346 </span>                :                                            double&gt;::__type
-<span class="lineNum">     347 </span>                :     log10(_Tp __x)
-<span class="lineNum">     348 </span>                :     { return __builtin_log10(__x); }
-<span class="lineNum">     349 </span>                : 
-<span class="lineNum">     350 </span>                :   using ::modf;
-<span class="lineNum">     351 </span>                : 
-<span class="lineNum">     352 </span>                :   inline float
-<span class="lineNum">     353 </span>                :   modf(float __x, float* __iptr)
-<span class="lineNum">     354 </span>                :   { return __builtin_modff(__x, __iptr); }
-<span class="lineNum">     355 </span>                : 
-<span class="lineNum">     356 </span>                :   inline long double
-<span class="lineNum">     357 </span>                :   modf(long double __x, long double* __iptr)
-<span class="lineNum">     358 </span>                :   { return __builtin_modfl(__x, __iptr); }
-<span class="lineNum">     359 </span>                : 
-<span class="lineNum">     360 </span>                :   using ::pow;
-<span class="lineNum">     361 </span>                : 
-<span class="lineNum">     362 </span>                :   inline float
-<span class="lineNum">     363 </span>                :   pow(float __x, float __y)
-<span class="lineNum">     364 </span>                :   { return __builtin_powf(__x, __y); }
-<span class="lineNum">     365 </span>                : 
-<span class="lineNum">     366 </span>                :   inline long double
-<span class="lineNum">     367 </span>                :   pow(long double __x, long double __y)
-<span class="lineNum">     368 </span>                :   { return __builtin_powl(__x, __y); }
-<span class="lineNum">     369 </span>                : 
-<span class="lineNum">     370 </span>                :   // DR 550.
-<span class="lineNum">     371 </span>                :   inline double
-<span class="lineNum">     372 </span>                :   pow(double __x, int __i)
-<span class="lineNum">     373 </span>                :   { return __builtin_powi(__x, __i); }
-<span class="lineNum">     374 </span>                : 
-<span class="lineNum">     375 </span>                :   inline float
-<span class="lineNum">     376 </span>                :   pow(float __x, int __n)
-<span class="lineNum">     377 </span>                :   { return __builtin_powif(__x, __n); }
-<span class="lineNum">     378 </span>                : 
-<span class="lineNum">     379 </span>                :   inline long double
-<span class="lineNum">     380 </span>                :   pow(long double __x, int __n)
-<span class="lineNum">     381 </span>                :   { return __builtin_powil(__x, __n); }
-<span class="lineNum">     382 </span>                : 
-<span class="lineNum">     383 </span>                :   template&lt;typename _Tp, typename _Up&gt;
-<span class="lineNum">     384 </span>                :     inline
-<span class="lineNum">     385 </span>                :     typename __gnu_cxx::__promote_2&lt;
-<span class="lineNum">     386 </span>                :     typename __gnu_cxx::__enable_if&lt;__is_arithmetic&lt;_Tp&gt;::__value
-<span class="lineNum">     387 </span>                :                                     &amp;&amp; __is_arithmetic&lt;_Up&gt;::__value,
-<span class="lineNum">     388 </span>                :                                     _Tp&gt;::__type, _Up&gt;::__type
-<span class="lineNum">     389 </span>                :     pow(_Tp __x, _Up __y)
-<span class="lineNum">     390 </span>                :     {
-<span class="lineNum">     391 </span>                :       typedef typename __gnu_cxx::__promote_2&lt;_Tp, _Up&gt;::__type __type;
-<span class="lineNum">     392 </span>                :       return pow(__type(__x), __type(__y));
-<span class="lineNum">     393 </span>                :     }
-<span class="lineNum">     394 </span>                : 
-<span class="lineNum">     395 </span>                :   using ::sin;
-<span class="lineNum">     396 </span>                : 
-<span class="lineNum">     397 </span>                :   inline float
-<span class="lineNum">     398 </span>                :   sin(float __x)
-<span class="lineNum">     399 </span>                :   { return __builtin_sinf(__x); }
-<span class="lineNum">     400 </span>                : 
-<span class="lineNum">     401 </span>                :   inline long double
-<span class="lineNum">     402 </span>                :   sin(long double __x)
-<span class="lineNum">     403 </span>                :   { return __builtin_sinl(__x); }
-<span class="lineNum">     404 </span>                : 
-<span class="lineNum">     405 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     406 </span>                :     inline typename __gnu_cxx::__enable_if&lt;__is_integer&lt;_Tp&gt;::__value, 
-<span class="lineNum">     407 </span>                :                                            double&gt;::__type
-<span class="lineNum">     408 </span>                :     sin(_Tp __x)
-<span class="lineNum">     409 </span>                :     { return __builtin_sin(__x); }
-<span class="lineNum">     410 </span>                : 
-<span class="lineNum">     411 </span>                :   using ::sinh;
-<span class="lineNum">     412 </span>                : 
-<span class="lineNum">     413 </span>                :   inline float
-<span class="lineNum">     414 </span>                :   sinh(float __x)
-<span class="lineNum">     415 </span>                :   { return __builtin_sinhf(__x); }
-<span class="lineNum">     416 </span>                : 
-<span class="lineNum">     417 </span>                :   inline long double
-<span class="lineNum">     418 </span>                :   sinh(long double __x)
-<span class="lineNum">     419 </span>                :   { return __builtin_sinhl(__x); }
-<span class="lineNum">     420 </span>                : 
-<span class="lineNum">     421 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     422 </span>                :     inline typename __gnu_cxx::__enable_if&lt;__is_integer&lt;_Tp&gt;::__value, 
-<span class="lineNum">     423 </span>                :                                            double&gt;::__type
-<span class="lineNum">     424 </span>                :     sinh(_Tp __x)
-<span class="lineNum">     425 </span>                :     { return __builtin_sinh(__x); }
-<span class="lineNum">     426 </span>                : 
-<span class="lineNum">     427 </span>                :   using ::sqrt;
-<span class="lineNum">     428 </span>                : 
-<span class="lineNum">     429 </span>                :   inline float
-<span class="lineNum">     430 </span>                :   sqrt(float __x)
-<span class="lineNum">     431 </span>                :   { return __builtin_sqrtf(__x); }
-<span class="lineNum">     432 </span>                : 
-<span class="lineNum">     433 </span>                :   inline long double
-<span class="lineNum">     434 </span>                :   sqrt(long double __x)
-<span class="lineNum">     435 </span>                :   { return __builtin_sqrtl(__x); }
-<span class="lineNum">     436 </span>                : 
-<span class="lineNum">     437 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     438 </span>                :     inline typename __gnu_cxx::__enable_if&lt;__is_integer&lt;_Tp&gt;::__value, 
-<span class="lineNum">     439 </span>                :                                            double&gt;::__type
-<span class="lineNum">     440 </span>                :     sqrt(_Tp __x)
-<span class="lineNum">     441 </span>                :     { return __builtin_sqrt(__x); }
-<span class="lineNum">     442 </span>                : 
-<span class="lineNum">     443 </span>                :   using ::tan;
-<span class="lineNum">     444 </span>                : 
-<span class="lineNum">     445 </span>                :   inline float
-<span class="lineNum">     446 </span>                :   tan(float __x)
-<span class="lineNum">     447 </span>                :   { return __builtin_tanf(__x); }
-<span class="lineNum">     448 </span>                : 
-<span class="lineNum">     449 </span>                :   inline long double
-<span class="lineNum">     450 </span>                :   tan(long double __x)
-<span class="lineNum">     451 </span>                :   { return __builtin_tanl(__x); }
-<span class="lineNum">     452 </span>                : 
-<span class="lineNum">     453 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     454 </span>                :     inline typename __gnu_cxx::__enable_if&lt;__is_integer&lt;_Tp&gt;::__value, 
-<span class="lineNum">     455 </span>                :                                            double&gt;::__type
-<span class="lineNum">     456 </span>                :     tan(_Tp __x)
-<span class="lineNum">     457 </span>                :     { return __builtin_tan(__x); }
-<span class="lineNum">     458 </span>                : 
-<span class="lineNum">     459 </span>                :   using ::tanh;
-<span class="lineNum">     460 </span>                : 
-<span class="lineNum">     461 </span>                :   inline float
-<span class="lineNum">     462 </span>                :   tanh(float __x)
-<span class="lineNum">     463 </span>                :   { return __builtin_tanhf(__x); }
-<span class="lineNum">     464 </span>                : 
-<span class="lineNum">     465 </span>                :   inline long double
-<span class="lineNum">     466 </span>                :   tanh(long double __x)
-<span class="lineNum">     467 </span>                :   { return __builtin_tanhl(__x); }
-<span class="lineNum">     468 </span>                : 
-<span class="lineNum">     469 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     470 </span>                :     inline typename __gnu_cxx::__enable_if&lt;__is_integer&lt;_Tp&gt;::__value, 
-<span class="lineNum">     471 </span>                :                                            double&gt;::__type
-<span class="lineNum">     472 </span>                :     tanh(_Tp __x)
-<span class="lineNum">     473 </span>                :     { return __builtin_tanh(__x); }
-<span class="lineNum">     474 </span>                : 
-<span class="lineNum">     475 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">     476 </span>                : 
-<span class="lineNum">     477 </span>                : #if _GLIBCXX_USE_C99_MATH
-<span class="lineNum">     478 </span>                : #if !_GLIBCXX_USE_C99_FP_MACROS_DYNAMIC
-<span class="lineNum">     479 </span>                : // These are possible macros imported from C99-land. For strict
-<span class="lineNum">     480 </span>                : // conformance, remove possible C99-injected names from the global
-<span class="lineNum">     481 </span>                : // namespace, and sequester them in the __gnu_cxx extension namespace.
-<span class="lineNum">     482 </span>                : 
-<span class="lineNum">     483 </span>                : _GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx)
-<span class="lineNum">     484 </span>                : 
-<span class="lineNum">     485 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     486 </span>                :     inline int
-<span class="lineNum">     487 </span>                :     __capture_fpclassify(_Tp __f) { return fpclassify(__f); }
-<span class="lineNum">     488 </span>                : 
-<span class="lineNum">     489 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">     490 </span>                : 
-<span class="lineNum">     491 </span>                : // Only undefine the C99 FP macros, if actually captured for namespace movement
-<span class="lineNum">     492 </span>                : #undef fpclassify
-<span class="lineNum">     493 </span>                : #undef isfinite
-<span class="lineNum">     494 </span>                : #undef isinf
-<span class="lineNum">     495 </span>                : #undef isnan
-<span class="lineNum">     496 </span>                : #undef isnormal
-<span class="lineNum">     497 </span>                : #undef signbit
-<span class="lineNum">     498 </span>                : #undef isgreater
-<span class="lineNum">     499 </span>                : #undef isgreaterequal
-<span class="lineNum">     500 </span>                : #undef isless
-<span class="lineNum">     501 </span>                : #undef islessequal
-<span class="lineNum">     502 </span>                : #undef islessgreater
-<span class="lineNum">     503 </span>                : #undef isunordered
-<span class="lineNum">     504 </span>                : 
-<span class="lineNum">     505 </span>                : _GLIBCXX_BEGIN_NAMESPACE(std)
-<span class="lineNum">     506 </span>                : 
-<span class="lineNum">     507 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     508 </span>                :     inline typename __gnu_cxx::__enable_if&lt;__is_arithmetic&lt;_Tp&gt;::__value,
-<span class="lineNum">     509 </span>                :                                            int&gt;::__type
-<span class="lineNum">     510 </span>                :     fpclassify(_Tp __f)
-<span class="lineNum">     511 </span>                :     {
-<span class="lineNum">     512 </span>                :       typedef typename __gnu_cxx::__promote&lt;_Tp&gt;::__type __type;
-<span class="lineNum">     513 </span>                :       return ::__gnu_cxx::__capture_fpclassify(__type(__f));
-<span class="lineNum">     514 </span>                :     }
-<span class="lineNum">     515 </span>                : 
-<span class="lineNum">     516 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     517 </span>                :     inline typename __gnu_cxx::__enable_if&lt;__is_arithmetic&lt;_Tp&gt;::__value,
-<span class="lineNum">     518 </span>                :                                            int&gt;::__type
-<span class="lineNum">     519 </span>                :     isfinite(_Tp __f)
-<span class="lineNum">     520 </span>                :     {
-<span class="lineNum">     521 </span>                :       typedef typename __gnu_cxx::__promote&lt;_Tp&gt;::__type __type;
-<span class="lineNum">     522 </span>                :       return __builtin_isfinite(__type(__f));
-<span class="lineNum">     523 </span>                :     }
-<span class="lineNum">     524 </span>                : 
-<span class="lineNum">     525 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     526 </span>                :     inline typename __gnu_cxx::__enable_if&lt;__is_arithmetic&lt;_Tp&gt;::__value,
-<span class="lineNum">     527 </span>                :                                            int&gt;::__type
-<span class="lineNum">     528 </span>                :     isinf(_Tp __f)
-<span class="lineNum">     529 </span>                :     {
-<span class="lineNum">     530 </span>                :       typedef typename __gnu_cxx::__promote&lt;_Tp&gt;::__type __type;
-<span class="lineNum">     531 </span>                :       return __builtin_isinf(__type(__f));
-<span class="lineNum">     532 </span>                :     }
-<span class="lineNum">     533 </span>                : 
-<span class="lineNum">     534 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     535 </span>                :     inline typename __gnu_cxx::__enable_if&lt;__is_arithmetic&lt;_Tp&gt;::__value,
-<span class="lineNum">     536 </span>                :                                            int&gt;::__type
-<span class="lineNum">     537 </span>                :     isnan(_Tp __f)
-<span class="lineNum">     538 </span>                :     {
-<span class="lineNum">     539 </span>                :       typedef typename __gnu_cxx::__promote&lt;_Tp&gt;::__type __type;
-<span class="lineNum">     540 </span>                :       return __builtin_isnan(__type(__f));
-<span class="lineNum">     541 </span>                :     }
-<span class="lineNum">     542 </span>                : 
-<span class="lineNum">     543 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     544 </span>                :     inline typename __gnu_cxx::__enable_if&lt;__is_arithmetic&lt;_Tp&gt;::__value,
-<span class="lineNum">     545 </span>                :                                            int&gt;::__type
-<span class="lineNum">     546 </span>                :     isnormal(_Tp __f)
-<span class="lineNum">     547 </span>                :     {
-<span class="lineNum">     548 </span>                :       typedef typename __gnu_cxx::__promote&lt;_Tp&gt;::__type __type;
-<span class="lineNum">     549 </span>                :       return __builtin_isnormal(__type(__f));
-<span class="lineNum">     550 </span>                :     }
-<span class="lineNum">     551 </span>                : 
-<span class="lineNum">     552 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     553 </span>                :     inline typename __gnu_cxx::__enable_if&lt;__is_arithmetic&lt;_Tp&gt;::__value,
-<span class="lineNum">     554 </span>                :                                            int&gt;::__type
-<span class="lineNum">     555 </span>                :     signbit(_Tp __f)
-<span class="lineNum">     556 </span>                :     {
-<span class="lineNum">     557 </span>                :       typedef typename __gnu_cxx::__promote&lt;_Tp&gt;::__type __type;
-<span class="lineNum">     558 </span>                :       return __builtin_signbit(__type(__f));
-<span class="lineNum">     559 </span>                :     }
-<span class="lineNum">     560 </span>                : 
-<span class="lineNum">     561 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     562 </span>                :     inline typename __gnu_cxx::__enable_if&lt;__is_arithmetic&lt;_Tp&gt;::__value,
-<span class="lineNum">     563 </span>                :                                            int&gt;::__type
-<span class="lineNum">     564 </span>                :     isgreater(_Tp __f1, _Tp __f2)
-<span class="lineNum">     565 </span>                :     {
-<span class="lineNum">     566 </span>                :       typedef typename __gnu_cxx::__promote&lt;_Tp&gt;::__type __type;
-<span class="lineNum">     567 </span>                :       return __builtin_isgreater(__type(__f1), __type(__f2));
-<span class="lineNum">     568 </span>                :     }
-<span class="lineNum">     569 </span>                : 
-<span class="lineNum">     570 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     571 </span>                :     inline typename __gnu_cxx::__enable_if&lt;__is_arithmetic&lt;_Tp&gt;::__value,
-<span class="lineNum">     572 </span>                :                                            int&gt;::__type
-<span class="lineNum">     573 </span>                :     isgreaterequal(_Tp __f1, _Tp __f2)
-<span class="lineNum">     574 </span>                :     {
-<span class="lineNum">     575 </span>                :       typedef typename __gnu_cxx::__promote&lt;_Tp&gt;::__type __type;
-<span class="lineNum">     576 </span>                :       return __builtin_isgreaterequal(__type(__f1), __type(__f2));
-<span class="lineNum">     577 </span>                :     }
-<span class="lineNum">     578 </span>                : 
-<span class="lineNum">     579 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     580 </span>                :     inline typename __gnu_cxx::__enable_if&lt;__is_arithmetic&lt;_Tp&gt;::__value,
-<span class="lineNum">     581 </span>                :                                            int&gt;::__type
-<span class="lineNum">     582 </span>                :     isless(_Tp __f1, _Tp __f2)
-<span class="lineNum">     583 </span>                :     {
-<span class="lineNum">     584 </span>                :       typedef typename __gnu_cxx::__promote&lt;_Tp&gt;::__type __type;
-<span class="lineNum">     585 </span>                :       return __builtin_isless(__type(__f1), __type(__f2));
-<span class="lineNum">     586 </span>                :     }
-<span class="lineNum">     587 </span>                : 
-<span class="lineNum">     588 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     589 </span>                :     inline typename __gnu_cxx::__enable_if&lt;__is_arithmetic&lt;_Tp&gt;::__value,
-<span class="lineNum">     590 </span>                :                                            int&gt;::__type
-<span class="lineNum">     591 </span>                :     islessequal(_Tp __f1, _Tp __f2)
-<span class="lineNum">     592 </span>                :     {
-<span class="lineNum">     593 </span>                :       typedef typename __gnu_cxx::__promote&lt;_Tp&gt;::__type __type;
-<span class="lineNum">     594 </span>                :       return __builtin_islessequal(__type(__f1), __type(__f2));
-<span class="lineNum">     595 </span>                :     }
-<span class="lineNum">     596 </span>                : 
-<span class="lineNum">     597 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     598 </span>                :     inline typename __gnu_cxx::__enable_if&lt;__is_arithmetic&lt;_Tp&gt;::__value,
-<span class="lineNum">     599 </span>                :                                            int&gt;::__type
-<span class="lineNum">     600 </span>                :     islessgreater(_Tp __f1, _Tp __f2)
-<span class="lineNum">     601 </span>                :     {
-<span class="lineNum">     602 </span>                :       typedef typename __gnu_cxx::__promote&lt;_Tp&gt;::__type __type;
-<span class="lineNum">     603 </span>                :       return __builtin_islessgreater(__type(__f1), __type(__f2));
-<span class="lineNum">     604 </span>                :     }
-<span class="lineNum">     605 </span>                : 
-<span class="lineNum">     606 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     607 </span>                :     inline typename __gnu_cxx::__enable_if&lt;__is_arithmetic&lt;_Tp&gt;::__value,
-<span class="lineNum">     608 </span>                :                                            int&gt;::__type
-<span class="lineNum">     609 </span>                :     isunordered(_Tp __f1, _Tp __f2)
-<span class="lineNum">     610 </span>                :     {
-<span class="lineNum">     611 </span>                :       typedef typename __gnu_cxx::__promote&lt;_Tp&gt;::__type __type;
-<span class="lineNum">     612 </span>                :       return __builtin_isunordered(__type(__f1), __type(__f2));
-<span class="lineNum">     613 </span>                :     }
-<span class="lineNum">     614 </span>                : 
-<span class="lineNum">     615 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">     616 </span>                : 
-<span class="lineNum">     617 </span>                : #endif /* _GLIBCXX_USE_C99_FP_MACROS_DYNAMIC */
-<span class="lineNum">     618 </span>                : #endif
-<span class="lineNum">     619 </span>                : 
-<span class="lineNum">     620 </span>                : #ifndef _GLIBCXX_EXPORT_TEMPLATE
-<span class="lineNum">     621 </span>                : # include &lt;bits/cmath.tcc&gt;
-<span class="lineNum">     622 </span>                : #endif
-<span class="lineNum">     623 </span>                : 
-<span class="lineNum">     624 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     625 </span>                : #  if defined(_GLIBCXX_INCLUDE_AS_TR1)
-<span class="lineNum">     626 </span>                : #    error C++0x header cannot be included from TR1 header
-<span class="lineNum">     627 </span>                : #  endif
-<span class="lineNum">     628 </span>                : #  if defined(_GLIBCXX_INCLUDE_AS_CXX0X)
-<span class="lineNum">     629 </span>                : #    include &lt;tr1_impl/cmath&gt;
-<span class="lineNum">     630 </span>                : #  else
-<span class="lineNum">     631 </span>                : #    define _GLIBCXX_INCLUDE_AS_CXX0X
-<span class="lineNum">     632 </span>                : #    define _GLIBCXX_BEGIN_NAMESPACE_TR1
-<span class="lineNum">     633 </span>                : #    define _GLIBCXX_END_NAMESPACE_TR1
-<span class="lineNum">     634 </span>                : #    define _GLIBCXX_TR1
-<span class="lineNum">     635 </span>                : #    include &lt;tr1_impl/cmath&gt;
-<span class="lineNum">     636 </span>                : #    undef _GLIBCXX_TR1
-<span class="lineNum">     637 </span>                : #    undef _GLIBCXX_END_NAMESPACE_TR1
-<span class="lineNum">     638 </span>                : #    undef _GLIBCXX_BEGIN_NAMESPACE_TR1
-<span class="lineNum">     639 </span>                : #    undef _GLIBCXX_INCLUDE_AS_CXX0X
-<span class="lineNum">     640 </span>                : #  endif
-<span class="lineNum">     641 </span>                : #endif
-<span class="lineNum">     642 </span>                : 
-<span class="lineNum">     643 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/exception.gcov.html b/rep/usr/include/c++/4.3/exception.gcov.html
deleted file mode 100644
index 70fe998..0000000
--- a/rep/usr/include/c++/4.3/exception.gcov.html
+++ /dev/null
@@ -1,202 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/exception</title>
-  <link rel="stylesheet" type="text/css" href="../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3</a> - exception</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">2</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">50.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">1</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // Exception Handling support header for -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003,
-<span class="lineNum">       4 </span>                : // 2004, 2005, 2006, 2007
-<span class="lineNum">       5 </span>                : // Free Software Foundation
-<span class="lineNum">       6 </span>                : //
-<span class="lineNum">       7 </span>                : // This file is part of GCC.
-<span class="lineNum">       8 </span>                : //
-<span class="lineNum">       9 </span>                : // GCC is free software; you can redistribute it and/or modify
-<span class="lineNum">      10 </span>                : // it under the terms of the GNU General Public License as published by
-<span class="lineNum">      11 </span>                : // the Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      12 </span>                : // any later version.
-<span class="lineNum">      13 </span>                : // 
-<span class="lineNum">      14 </span>                : // GCC is distributed in the hope that it will be useful,
-<span class="lineNum">      15 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      16 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      17 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      18 </span>                : // 
-<span class="lineNum">      19 </span>                : // You should have received a copy of the GNU General Public License
-<span class="lineNum">      20 </span>                : // along with GCC; see the file COPYING.  If not, write to
-<span class="lineNum">      21 </span>                : // the Free Software Foundation, 51 Franklin Street, Fifth Floor,
-<span class="lineNum">      22 </span>                : // Boston, MA 02110-1301, USA.
-<span class="lineNum">      23 </span>                : 
-<span class="lineNum">      24 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      25 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      26 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      27 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      28 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      29 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      30 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      31 </span>                : // the GNU General Public License.
-<span class="lineNum">      32 </span>                : 
-<span class="lineNum">      33 </span>                : /** @file exception
-<span class="lineNum">      34 </span>                :  *  This is a Standard C++ Library header.
-<span class="lineNum">      35 </span>                :  */
-<span class="lineNum">      36 </span>                : 
-<span class="lineNum">      37 </span>                : #ifndef __EXCEPTION__
-<span class="lineNum">      38 </span>                : #define __EXCEPTION__
-<span class="lineNum">      39 </span>                : 
-<span class="lineNum">      40 </span>                : #pragma GCC visibility push(default)
-<span class="lineNum">      41 </span>                : 
-<span class="lineNum">      42 </span>                : #include &lt;bits/c++config.h&gt;
-<span class="lineNum">      43 </span>                : 
-<span class="lineNum">      44 </span>                : extern &quot;C++&quot; {
-<span class="lineNum">      45 </span>                : 
-<span class="lineNum">      46 </span>                : namespace std 
-<span class="lineNum">      47 </span>                : {
-<span class="lineNum">      48 </span>                :   /**
-<span class="lineNum">      49 </span>                :    *  @brief Base class for all library exceptions.
-<span class="lineNum">      50 </span>                :    *
-<span class="lineNum">      51 </span>                :    *  This is the base class for all exceptions thrown by the standard
-<span class="lineNum">      52 </span>                :    *  library, and by certain language expressions.  You are free to derive
-<span class="lineNum">      53 </span>                :    *  your own %exception classes, or use a different hierarchy, or to
-<span class="lineNum">      54 </span>                :    *  throw non-class data (e.g., fundamental types).
-<span class="lineNum">      55 </span>                :    */
-<span class="lineNum">      56 </span>                :   class exception 
-<span class="lineNum">      57 </span><span class="lineNoCov">              0 :   {</span>
-<span class="lineNum">      58 </span>                :   public:
-<span class="lineNum">      59 </span><span class="lineCov">              6 :     exception() throw() { }</span>
-<span class="lineNum">      60 </span>                :     virtual ~exception() throw();
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span>                :     /** Returns a C-style character string describing the general cause
-<span class="lineNum">      63 </span>                :      *  of the current error.  */
-<span class="lineNum">      64 </span>                :     virtual const char* what() const throw();
-<span class="lineNum">      65 </span>                :   };
-<span class="lineNum">      66 </span>                : 
-<span class="lineNum">      67 </span>                :   /** If an %exception is thrown which is not listed in a function's
-<span class="lineNum">      68 </span>                :    *  %exception specification, one of these may be thrown.  */
-<span class="lineNum">      69 </span>                :   class bad_exception : public exception 
-<span class="lineNum">      70 </span>                :   {
-<span class="lineNum">      71 </span>                :   public:
-<span class="lineNum">      72 </span>                :     bad_exception() throw() { }
-<span class="lineNum">      73 </span>                : 
-<span class="lineNum">      74 </span>                :     // This declaration is not useless:
-<span class="lineNum">      75 </span>                :     // http://gcc.gnu.org/onlinedocs/gcc-3.0.2/gcc_6.html#SEC118
-<span class="lineNum">      76 </span>                :     virtual ~bad_exception() throw();
-<span class="lineNum">      77 </span>                : 
-<span class="lineNum">      78 </span>                :     // See comment in eh_exception.cc.
-<span class="lineNum">      79 </span>                :     virtual const char* what() const throw();
-<span class="lineNum">      80 </span>                :   };
-<span class="lineNum">      81 </span>                : 
-<span class="lineNum">      82 </span>                :   /// If you write a replacement %terminate handler, it must be of this type.
-<span class="lineNum">      83 </span>                :   typedef void (*terminate_handler) ();
-<span class="lineNum">      84 </span>                : 
-<span class="lineNum">      85 </span>                :   /// If you write a replacement %unexpected handler, it must be of this type.
-<span class="lineNum">      86 </span>                :   typedef void (*unexpected_handler) ();
-<span class="lineNum">      87 </span>                : 
-<span class="lineNum">      88 </span>                :   /// Takes a new handler function as an argument, returns the old function.
-<span class="lineNum">      89 </span>                :   terminate_handler set_terminate(terminate_handler) throw();
-<span class="lineNum">      90 </span>                : 
-<span class="lineNum">      91 </span>                :   /** The runtime will call this function if %exception handling must be
-<span class="lineNum">      92 </span>                :    *  abandoned for any reason.  It can also be called by the user.  */
-<span class="lineNum">      93 </span>                :   void terminate() __attribute__ ((__noreturn__));
-<span class="lineNum">      94 </span>                : 
-<span class="lineNum">      95 </span>                :   /// Takes a new handler function as an argument, returns the old function.
-<span class="lineNum">      96 </span>                :   unexpected_handler set_unexpected(unexpected_handler) throw();
-<span class="lineNum">      97 </span>                : 
-<span class="lineNum">      98 </span>                :   /** The runtime will call this function if an %exception is thrown which
-<span class="lineNum">      99 </span>                :    *  violates the function's %exception specification.  */
-<span class="lineNum">     100 </span>                :   void unexpected() __attribute__ ((__noreturn__));
-<span class="lineNum">     101 </span>                : 
-<span class="lineNum">     102 </span>                :   /** [18.6.4]/1:  &quot;Returns true after completing evaluation of a
-<span class="lineNum">     103 </span>                :    *  throw-expression until either completing initialization of the
-<span class="lineNum">     104 </span>                :    *  exception-declaration in the matching handler or entering @c unexpected()
-<span class="lineNum">     105 </span>                :    *  due to the throw; or after entering @c terminate() for any reason
-<span class="lineNum">     106 </span>                :    *  other than an explicit call to @c terminate().  [Note: This includes
-<span class="lineNum">     107 </span>                :    *  stack unwinding [15.2].  end note]&quot;
-<span class="lineNum">     108 </span>                :    *
-<span class="lineNum">     109 </span>                :    *  2:  &quot;When @c uncaught_exception() is true, throwing an %exception can
-<span class="lineNum">     110 </span>                :    *  result in a call of @c terminate() (15.5.1).&quot;
-<span class="lineNum">     111 </span>                :    */
-<span class="lineNum">     112 </span>                :   bool uncaught_exception() throw();
-<span class="lineNum">     113 </span>                : } // namespace std
-<span class="lineNum">     114 </span>                : 
-<span class="lineNum">     115 </span>                : _GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx)
-<span class="lineNum">     116 </span>                : 
-<span class="lineNum">     117 </span>                :   /** A replacement for the standard terminate_handler which prints more
-<span class="lineNum">     118 </span>                :       information about the terminating exception (if any) on stderr.  Call
-<span class="lineNum">     119 </span>                :       @code
-<span class="lineNum">     120 </span>                :         std::set_terminate (__gnu_cxx::__verbose_terminate_handler)
-<span class="lineNum">     121 </span>                :       @endcode
-<span class="lineNum">     122 </span>                :       to use.  For more info, see
-<span class="lineNum">     123 </span>                :       http://gcc.gnu.org/onlinedocs/libstdc++/19_diagnostics/howto.html#4
-<span class="lineNum">     124 </span>                : 
-<span class="lineNum">     125 </span>                :       In 3.4 and later, this is on by default.
-<span class="lineNum">     126 </span>                :   */
-<span class="lineNum">     127 </span>                :   void __verbose_terminate_handler ();
-<span class="lineNum">     128 </span>                : 
-<span class="lineNum">     129 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">     130 </span>                :   
-<span class="lineNum">     131 </span>                : } // extern &quot;C++&quot;
-<span class="lineNum">     132 </span>                : 
-<span class="lineNum">     133 </span>                : #pragma GCC visibility pop
-<span class="lineNum">     134 </span>                : 
-<span class="lineNum">     135 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/ext/atomicity.h.gcov.html b/rep/usr/include/c++/4.3/ext/atomicity.h.gcov.html
deleted file mode 100644
index 5ba11ee..0000000
--- a/rep/usr/include/c++/4.3/ext/atomicity.h.gcov.html
+++ /dev/null
@@ -1,185 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/ext/atomicity.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/ext</a> - atomicity.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">10</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">0.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">0</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // Support for atomic operations -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 2004, 2005, 2006 Free Software Foundation, Inc.
-<span class="lineNum">       4 </span>                : //
-<span class="lineNum">       5 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       6 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       7 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">       8 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">       9 </span>                : // any later version.
-<span class="lineNum">      10 </span>                : 
-<span class="lineNum">      11 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      12 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      13 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      14 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      15 </span>                : 
-<span class="lineNum">      16 </span>                : // You should have received a copy of the GNU General Public License along
-<span class="lineNum">      17 </span>                : // with this library; see the file COPYING.  If not, write to the Free
-<span class="lineNum">      18 </span>                : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-<span class="lineNum">      19 </span>                : // USA.
-<span class="lineNum">      20 </span>                : 
-<span class="lineNum">      21 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      22 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      23 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      24 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      25 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      26 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      27 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      28 </span>                : // the GNU General Public License.
-<span class="lineNum">      29 </span>                : 
-<span class="lineNum">      30 </span>                : /** @file atomicity.h
-<span class="lineNum">      31 </span>                :  *  This is an internal header file, included by other library headers.
-<span class="lineNum">      32 </span>                :  *  You should not attempt to use it directly.
-<span class="lineNum">      33 </span>                :  */
-<span class="lineNum">      34 </span>                : 
-<span class="lineNum">      35 </span>                : #ifndef _GLIBCXX_ATOMICITY_H
-<span class="lineNum">      36 </span>                : #define _GLIBCXX_ATOMICITY_H    1
-<span class="lineNum">      37 </span>                : 
-<span class="lineNum">      38 </span>                : #include &lt;bits/c++config.h&gt;
-<span class="lineNum">      39 </span>                : #include &lt;bits/gthr.h&gt;
-<span class="lineNum">      40 </span>                : #include &lt;bits/atomic_word.h&gt;
-<span class="lineNum">      41 </span>                : 
-<span class="lineNum">      42 </span>                : _GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx)
-<span class="lineNum">      43 </span>                : 
-<span class="lineNum">      44 </span>                :   // Functions for portable atomic access.
-<span class="lineNum">      45 </span>                :   // To abstract locking primitives across all thread policies, use:
-<span class="lineNum">      46 </span>                :   // __exchange_and_add_dispatch
-<span class="lineNum">      47 </span>                :   // __atomic_add_dispatch
-<span class="lineNum">      48 </span>                : #ifdef _GLIBCXX_ATOMIC_BUILTINS
-<span class="lineNum">      49 </span>                :   static inline _Atomic_word 
-<span class="lineNum">      50 </span><span class="lineNoCov">              0 :   __exchange_and_add(volatile _Atomic_word* __mem, int __val)</span>
-<span class="lineNum">      51 </span><span class="lineNoCov">              0 :   { return __sync_fetch_and_add(__mem, __val); }</span>
-<span class="lineNum">      52 </span>                : 
-<span class="lineNum">      53 </span>                :   static inline void
-<span class="lineNum">      54 </span>                :   __atomic_add(volatile _Atomic_word* __mem, int __val)
-<span class="lineNum">      55 </span>                :   { __sync_fetch_and_add(__mem, __val); }
-<span class="lineNum">      56 </span>                : #else
-<span class="lineNum">      57 </span>                :   _Atomic_word
-<span class="lineNum">      58 </span>                :   __attribute__ ((__unused__))
-<span class="lineNum">      59 </span>                :   __exchange_and_add(volatile _Atomic_word*, int);
-<span class="lineNum">      60 </span>                : 
-<span class="lineNum">      61 </span>                :   void
-<span class="lineNum">      62 </span>                :   __attribute__ ((__unused__))
-<span class="lineNum">      63 </span>                :   __atomic_add(volatile _Atomic_word*, int);
-<span class="lineNum">      64 </span>                : #endif
-<span class="lineNum">      65 </span>                : 
-<span class="lineNum">      66 </span>                :   static inline _Atomic_word
-<span class="lineNum">      67 </span><span class="lineNoCov">              0 :   __exchange_and_add_single(_Atomic_word* __mem, int __val)</span>
-<span class="lineNum">      68 </span>                :   {
-<span class="lineNum">      69 </span><span class="lineNoCov">              0 :     _Atomic_word __result = *__mem;</span>
-<span class="lineNum">      70 </span><span class="lineNoCov">              0 :     *__mem += __val;</span>
-<span class="lineNum">      71 </span><span class="lineNoCov">              0 :     return __result;</span>
-<span class="lineNum">      72 </span>                :   }
-<span class="lineNum">      73 </span>                : 
-<span class="lineNum">      74 </span>                :   static inline void
-<span class="lineNum">      75 </span>                :   __atomic_add_single(_Atomic_word* __mem, int __val)
-<span class="lineNum">      76 </span>                :   { *__mem += __val; }
-<span class="lineNum">      77 </span>                : 
-<span class="lineNum">      78 </span>                :   static inline _Atomic_word
-<span class="lineNum">      79 </span>                :   __attribute__ ((__unused__))
-<span class="lineNum">      80 </span><span class="lineNoCov">              0 :   __exchange_and_add_dispatch(_Atomic_word* __mem, int __val)</span>
-<span class="lineNum">      81 </span>                :   {
-<span class="lineNum">      82 </span>                : #ifdef __GTHREADS
-<span class="lineNum">      83 </span><span class="lineNoCov">              0 :     if (__gthread_active_p())</span>
-<span class="lineNum">      84 </span><span class="lineNoCov">              0 :       return __exchange_and_add(__mem, __val);</span>
-<span class="lineNum">      85 </span>                :     else
-<span class="lineNum">      86 </span><span class="lineNoCov">              0 :       return __exchange_and_add_single(__mem, __val);</span>
-<span class="lineNum">      87 </span>                : #else
-<span class="lineNum">      88 </span>                :     return __exchange_and_add_single(__mem, __val);
-<span class="lineNum">      89 </span>                : #endif
-<span class="lineNum">      90 </span>                :   }
-<span class="lineNum">      91 </span>                : 
-<span class="lineNum">      92 </span>                :   static inline void
-<span class="lineNum">      93 </span>                :   __attribute__ ((__unused__))
-<span class="lineNum">      94 </span>                :   __atomic_add_dispatch(_Atomic_word* __mem, int __val)
-<span class="lineNum">      95 </span>                :   {
-<span class="lineNum">      96 </span>                : #ifdef __GTHREADS
-<span class="lineNum">      97 </span>                :     if (__gthread_active_p())
-<span class="lineNum">      98 </span>                :       __atomic_add(__mem, __val);
-<span class="lineNum">      99 </span>                :     else
-<span class="lineNum">     100 </span>                :       __atomic_add_single(__mem, __val);
-<span class="lineNum">     101 </span>                : #else
-<span class="lineNum">     102 </span>                :     __atomic_add_single(__mem, __val);
-<span class="lineNum">     103 </span>                : #endif
-<span class="lineNum">     104 </span>                :   }
-<span class="lineNum">     105 </span>                : 
-<span class="lineNum">     106 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">     107 </span>                : 
-<span class="lineNum">     108 </span>                : // Even if the CPU doesn't need a memory barrier, we need to ensure
-<span class="lineNum">     109 </span>                : // that the compiler doesn't reorder memory accesses across the
-<span class="lineNum">     110 </span>                : // barriers.
-<span class="lineNum">     111 </span>                : #ifndef _GLIBCXX_READ_MEM_BARRIER
-<span class="lineNum">     112 </span>                : #define _GLIBCXX_READ_MEM_BARRIER __asm __volatile (&quot;&quot;:::&quot;memory&quot;)
-<span class="lineNum">     113 </span>                : #endif
-<span class="lineNum">     114 </span>                : #ifndef _GLIBCXX_WRITE_MEM_BARRIER
-<span class="lineNum">     115 </span>                : #define _GLIBCXX_WRITE_MEM_BARRIER __asm __volatile (&quot;&quot;:::&quot;memory&quot;)
-<span class="lineNum">     116 </span>                : #endif
-<span class="lineNum">     117 </span>                : 
-<span class="lineNum">     118 </span>                : #endif 
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/ext/index.html b/rep/usr/include/c++/4.3/ext/index.html
deleted file mode 100644
index 3d42502..0000000
--- a/rep/usr/include/c++/4.3/ext/index.html
+++ /dev/null
@@ -1,101 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/ext</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - /usr/include/c++/4.3/ext</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">28</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">53.6 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">15</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <center>
-  <table width="80%" cellpadding=2 cellspacing=1 border=0>
-
-    <tr>
-      <td width="50%"><br></td>
-      <td width="15%"></td>
-      <td width="15%"></td>
-      <td width="20%"></td>
-    </tr>
-
-    <tr>
-      <td class="tableHead">Filename</td>
-      <td class="tableHead" colspan=3>Coverage</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="atomicity.h.gcov.html">atomicity.h</a></td>
-      <td class="coverBar" align="center">
-                <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../snow.png" width=100 height=10 alt="0.0%"></td></tr></table>
-      </td>
-      <td class="coverPerLo">0.0&nbsp;%</td>
-      <td class="coverNumLo">0&nbsp;/&nbsp;10&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="new_allocator.h.gcov.html">new_allocator.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=93 height=10 alt="92.9%"><img src="../../../../../snow.png" width=7 height=10 alt="92.9%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">92.9&nbsp;%</td>
-      <td class="coverNumHi">13&nbsp;/&nbsp;14&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="type_traits.h.gcov.html">type_traits.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=50 height=10 alt="50.0%"><img src="../../../../../snow.png" width=50 height=10 alt="50.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">50.0&nbsp;%</td>
-      <td class="coverNumHi">2&nbsp;/&nbsp;4&nbsp;lines</td>
-    </tr>
-
-  </table>
-  </center>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/ext/new_allocator.h.gcov.html b/rep/usr/include/c++/4.3/ext/new_allocator.h.gcov.html
deleted file mode 100644
index 1111116..0000000
--- a/rep/usr/include/c++/4.3/ext/new_allocator.h.gcov.html
+++ /dev/null
@@ -1,200 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/ext/new_allocator.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/ext</a> - new_allocator.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">14</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">92.9 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">13</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // Allocator that wraps operator new -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc.
-<span class="lineNum">       4 </span>                : //
-<span class="lineNum">       5 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       6 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       7 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">       8 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">       9 </span>                : // any later version.
-<span class="lineNum">      10 </span>                : 
-<span class="lineNum">      11 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      12 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      13 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      14 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      15 </span>                : 
-<span class="lineNum">      16 </span>                : // You should have received a copy of the GNU General Public License along
-<span class="lineNum">      17 </span>                : // with this library; see the file COPYING.  If not, write to the Free
-<span class="lineNum">      18 </span>                : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-<span class="lineNum">      19 </span>                : // USA.
-<span class="lineNum">      20 </span>                : 
-<span class="lineNum">      21 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      22 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      23 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      24 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      25 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      26 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      27 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      28 </span>                : // the GNU General Public License.
-<span class="lineNum">      29 </span>                : 
-<span class="lineNum">      30 </span>                : /** @file ext/new_allocator.h
-<span class="lineNum">      31 </span>                :  *  This file is a GNU extension to the Standard C++ Library.
-<span class="lineNum">      32 </span>                :  */
-<span class="lineNum">      33 </span>                : 
-<span class="lineNum">      34 </span>                : #ifndef _NEW_ALLOCATOR_H
-<span class="lineNum">      35 </span>                : #define _NEW_ALLOCATOR_H 1
-<span class="lineNum">      36 </span>                : 
-<span class="lineNum">      37 </span>                : #include &lt;new&gt;
-<span class="lineNum">      38 </span>                : #include &lt;bits/functexcept.h&gt;
-<span class="lineNum">      39 </span>                : #include &lt;bits/stl_move.h&gt;
-<span class="lineNum">      40 </span>                : 
-<span class="lineNum">      41 </span>                : _GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx)
-<span class="lineNum">      42 </span>                : 
-<span class="lineNum">      43 </span>                :   using std::size_t;
-<span class="lineNum">      44 </span>                :   using std::ptrdiff_t;
-<span class="lineNum">      45 </span>                : 
-<span class="lineNum">      46 </span>                :   /**
-<span class="lineNum">      47 </span>                :    *  @brief  An allocator that uses global new, as per [20.4].
-<span class="lineNum">      48 </span>                :    *
-<span class="lineNum">      49 </span>                :    *  This is precisely the allocator defined in the C++ Standard. 
-<span class="lineNum">      50 </span>                :    *    - all allocation calls operator new
-<span class="lineNum">      51 </span>                :    *    - all deallocation calls operator delete
-<span class="lineNum">      52 </span>                :    */
-<span class="lineNum">      53 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">      54 </span>                :     class new_allocator
-<span class="lineNum">      55 </span>                :     {
-<span class="lineNum">      56 </span>                :     public:
-<span class="lineNum">      57 </span>                :       typedef size_t     size_type;
-<span class="lineNum">      58 </span>                :       typedef ptrdiff_t  difference_type;
-<span class="lineNum">      59 </span>                :       typedef _Tp*       pointer;
-<span class="lineNum">      60 </span>                :       typedef const _Tp* const_pointer;
-<span class="lineNum">      61 </span>                :       typedef _Tp&amp;       reference;
-<span class="lineNum">      62 </span>                :       typedef const _Tp&amp; const_reference;
-<span class="lineNum">      63 </span>                :       typedef _Tp        value_type;
-<span class="lineNum">      64 </span>                : 
-<span class="lineNum">      65 </span>                :       template&lt;typename _Tp1&gt;
-<span class="lineNum">      66 </span>                :         struct rebind
-<span class="lineNum">      67 </span>                :         { typedef new_allocator&lt;_Tp1&gt; other; };
-<span class="lineNum">      68 </span>                : 
-<span class="lineNum">      69 </span><span class="lineCov">       11574945 :       new_allocator() throw() { }</span>
-<span class="lineNum">      70 </span>                : 
-<span class="lineNum">      71 </span><span class="lineCov">         934618 :       new_allocator(const new_allocator&amp;) throw() { }</span>
-<span class="lineNum">      72 </span>                : 
-<span class="lineNum">      73 </span>                :       template&lt;typename _Tp1&gt;
-<span class="lineNum">      74 </span>                :         new_allocator(const new_allocator&lt;_Tp1&gt;&amp;) throw() { }
-<span class="lineNum">      75 </span>                : 
-<span class="lineNum">      76 </span><span class="lineCov">       12615289 :       ~new_allocator() throw() { }</span>
-<span class="lineNum">      77 </span>                : 
-<span class="lineNum">      78 </span>                :       pointer
-<span class="lineNum">      79 </span>                :       address(reference __x) const { return &amp;__x; }
-<span class="lineNum">      80 </span>                : 
-<span class="lineNum">      81 </span>                :       const_pointer
-<span class="lineNum">      82 </span>                :       address(const_reference __x) const { return &amp;__x; }
-<span class="lineNum">      83 </span>                : 
-<span class="lineNum">      84 </span>                :       // NB: __n is permitted to be 0.  The C++ standard says nothing
-<span class="lineNum">      85 </span>                :       // about what the return value is when __n == 0.
-<span class="lineNum">      86 </span>                :       pointer
-<span class="lineNum">      87 </span><span class="lineCov">        5665535 :       allocate(size_type __n, const void* = 0)</span>
-<span class="lineNum">      88 </span>                :       { 
-<span class="lineNum">      89 </span><span class="lineCov">        5665535 :         if (__builtin_expect(__n &gt; this-&gt;max_size(), false))</span>
-<span class="lineNum">      90 </span><span class="lineNoCov">              0 :           std::__throw_bad_alloc();</span>
-<span class="lineNum">      91 </span>                : 
-<span class="lineNum">      92 </span><span class="lineCov">        5665535 :         return static_cast&lt;_Tp*&gt;(::operator new(__n * sizeof(_Tp)));</span>
-<span class="lineNum">      93 </span>                :       }
-<span class="lineNum">      94 </span>                : 
-<span class="lineNum">      95 </span>                :       // __p is not permitted to be a null pointer.
-<span class="lineNum">      96 </span>                :       void
-<span class="lineNum">      97 </span><span class="lineCov">        5665395 :       deallocate(pointer __p, size_type)</span>
-<span class="lineNum">      98 </span><span class="lineCov">        5665395 :       { ::operator delete(__p); }</span>
-<span class="lineNum">      99 </span>                : 
-<span class="lineNum">     100 </span>                :       size_type
-<span class="lineNum">     101 </span><span class="lineCov">        5706963 :       max_size() const throw() </span>
-<span class="lineNum">     102 </span><span class="lineCov">        5706963 :       { return size_t(-1) / sizeof(_Tp); }</span>
-<span class="lineNum">     103 </span>                : 
-<span class="lineNum">     104 </span>                :       // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     105 </span>                :       // 402. wrong new expression in [some_] allocator::construct
-<span class="lineNum">     106 </span>                :       void 
-<span class="lineNum">     107 </span><span class="lineCov">        5786312 :       construct(pointer __p, const _Tp&amp; __val) </span>
-<span class="lineNum">     108 </span><span class="lineCov">        5786312 :       { ::new((void *)__p) _Tp(__val); }</span>
-<span class="lineNum">     109 </span>                : 
-<span class="lineNum">     110 </span>                : #ifdef __GXX_EXPERIMENTAL_CXX0X__
-<span class="lineNum">     111 </span>                :       template&lt;typename... _Args&gt;
-<span class="lineNum">     112 </span>                :         void
-<span class="lineNum">     113 </span>                :         construct(pointer __p, _Args&amp;&amp;... __args)
-<span class="lineNum">     114 </span>                :         { ::new((void *)__p) _Tp(std::forward&lt;_Args&gt;(__args)...); }
-<span class="lineNum">     115 </span>                : #endif
-<span class="lineNum">     116 </span>                : 
-<span class="lineNum">     117 </span>                :       void 
-<span class="lineNum">     118 </span><span class="lineCov">        5644734 :       destroy(pointer __p) { __p-&gt;~_Tp(); }</span>
-<span class="lineNum">     119 </span>                :     };
-<span class="lineNum">     120 </span>                : 
-<span class="lineNum">     121 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     122 </span>                :     inline bool
-<span class="lineNum">     123 </span>                :     operator==(const new_allocator&lt;_Tp&gt;&amp;, const new_allocator&lt;_Tp&gt;&amp;)
-<span class="lineNum">     124 </span>                :     { return true; }
-<span class="lineNum">     125 </span>                :   
-<span class="lineNum">     126 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     127 </span>                :     inline bool
-<span class="lineNum">     128 </span>                :     operator!=(const new_allocator&lt;_Tp&gt;&amp;, const new_allocator&lt;_Tp&gt;&amp;)
-<span class="lineNum">     129 </span>                :     { return false; }
-<span class="lineNum">     130 </span>                : 
-<span class="lineNum">     131 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">     132 </span>                : 
-<span class="lineNum">     133 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/ext/type_traits.h.gcov.html b/rep/usr/include/c++/4.3/ext/type_traits.h.gcov.html
deleted file mode 100644
index 2b9b989..0000000
--- a/rep/usr/include/c++/4.3/ext/type_traits.h.gcov.html
+++ /dev/null
@@ -1,277 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/ext/type_traits.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/ext</a> - type_traits.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">4</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">50.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">2</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 2005, 2006, 2007 Free Software Foundation, Inc.
-<span class="lineNum">       4 </span>                : //
-<span class="lineNum">       5 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       6 </span>                : // software; you can redistribute it and/or modify it under the terms
-<span class="lineNum">       7 </span>                : // of the GNU General Public License as published by the Free Software
-<span class="lineNum">       8 </span>                : // Foundation; either version 2, or (at your option) any later
-<span class="lineNum">       9 </span>                : // version.
-<span class="lineNum">      10 </span>                : 
-<span class="lineNum">      11 </span>                : // This library is distributed in the hope that it will be useful, but
-<span class="lineNum">      12 </span>                : // WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      13 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-<span class="lineNum">      14 </span>                : // General Public License for more details.
-<span class="lineNum">      15 </span>                : 
-<span class="lineNum">      16 </span>                : // You should have received a copy of the GNU General Public License along
-<span class="lineNum">      17 </span>                : // with this library; see the file COPYING.  If not, write to the Free
-<span class="lineNum">      18 </span>                : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-<span class="lineNum">      19 </span>                : // USA.
-<span class="lineNum">      20 </span>                : 
-<span class="lineNum">      21 </span>                : // As a special exception, you may use this file as part of a free
-<span class="lineNum">      22 </span>                : // software library without restriction.  Specifically, if other files
-<span class="lineNum">      23 </span>                : // instantiate templates or use macros or inline functions from this
-<span class="lineNum">      24 </span>                : // file, or you compile this file and link it with other files to
-<span class="lineNum">      25 </span>                : // produce an executable, this file does not by itself cause the
-<span class="lineNum">      26 </span>                : // resulting executable to be covered by the GNU General Public
-<span class="lineNum">      27 </span>                : // License.  This exception does not however invalidate any other
-<span class="lineNum">      28 </span>                : // reasons why the executable file might be covered by the GNU General
-<span class="lineNum">      29 </span>                : // Public License.
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : /** @file ext/type_traits.h
-<span class="lineNum">      32 </span>                :  *  This file is a GNU extension to the Standard C++ Library.
-<span class="lineNum">      33 </span>                :  */
-<span class="lineNum">      34 </span>                : 
-<span class="lineNum">      35 </span>                : #ifndef _EXT_TYPE_TRAITS
-<span class="lineNum">      36 </span>                : #define _EXT_TYPE_TRAITS 1
-<span class="lineNum">      37 </span>                : 
-<span class="lineNum">      38 </span>                : #pragma GCC system_header
-<span class="lineNum">      39 </span>                : 
-<span class="lineNum">      40 </span>                : #include &lt;bits/c++config.h&gt;
-<span class="lineNum">      41 </span>                : #include &lt;bits/cpp_type_traits.h&gt;
-<span class="lineNum">      42 </span>                : 
-<span class="lineNum">      43 </span>                : _GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx)
-<span class="lineNum">      44 </span>                : 
-<span class="lineNum">      45 </span>                :   // Define a nested type if some predicate holds.
-<span class="lineNum">      46 </span>                :   template&lt;bool, typename&gt;
-<span class="lineNum">      47 </span>                :     struct __enable_if 
-<span class="lineNum">      48 </span>                :     { };
-<span class="lineNum">      49 </span>                : 
-<span class="lineNum">      50 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">      51 </span>                :     struct __enable_if&lt;true, _Tp&gt;
-<span class="lineNum">      52 </span>                :     { typedef _Tp __type; };
-<span class="lineNum">      53 </span>                : 
-<span class="lineNum">      54 </span>                : 
-<span class="lineNum">      55 </span>                :   // Conditional expression for types. If true, first, if false, second.
-<span class="lineNum">      56 </span>                :   template&lt;bool _Cond, typename _Iftrue, typename _Iffalse&gt;
-<span class="lineNum">      57 </span>                :     struct __conditional_type
-<span class="lineNum">      58 </span>                :     { typedef _Iftrue __type; };
-<span class="lineNum">      59 </span>                : 
-<span class="lineNum">      60 </span>                :   template&lt;typename _Iftrue, typename _Iffalse&gt;
-<span class="lineNum">      61 </span>                :     struct __conditional_type&lt;false, _Iftrue, _Iffalse&gt;
-<span class="lineNum">      62 </span>                :     { typedef _Iffalse __type; };
-<span class="lineNum">      63 </span>                : 
-<span class="lineNum">      64 </span>                : 
-<span class="lineNum">      65 </span>                :   // Given an integral builtin type, return the corresponding unsigned type.
-<span class="lineNum">      66 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">      67 </span>                :     struct __add_unsigned
-<span class="lineNum">      68 </span>                :     { 
-<span class="lineNum">      69 </span>                :     private:
-<span class="lineNum">      70 </span>                :       typedef __enable_if&lt;std::__is_integer&lt;_Tp&gt;::__value, _Tp&gt; __if_type;
-<span class="lineNum">      71 </span>                :       
-<span class="lineNum">      72 </span>                :     public:
-<span class="lineNum">      73 </span>                :       typedef typename __if_type::__type __type; 
-<span class="lineNum">      74 </span>                :     };
-<span class="lineNum">      75 </span>                : 
-<span class="lineNum">      76 </span>                :   template&lt;&gt;
-<span class="lineNum">      77 </span>                :     struct __add_unsigned&lt;char&gt;
-<span class="lineNum">      78 </span>                :     { typedef unsigned char __type; };
-<span class="lineNum">      79 </span>                : 
-<span class="lineNum">      80 </span>                :   template&lt;&gt;
-<span class="lineNum">      81 </span>                :     struct __add_unsigned&lt;signed char&gt;
-<span class="lineNum">      82 </span>                :     { typedef unsigned char __type; };
-<span class="lineNum">      83 </span>                : 
-<span class="lineNum">      84 </span>                :   template&lt;&gt;
-<span class="lineNum">      85 </span>                :     struct __add_unsigned&lt;short&gt;
-<span class="lineNum">      86 </span>                :     { typedef unsigned short __type; };
-<span class="lineNum">      87 </span>                : 
-<span class="lineNum">      88 </span>                :   template&lt;&gt;
-<span class="lineNum">      89 </span>                :     struct __add_unsigned&lt;int&gt;
-<span class="lineNum">      90 </span>                :     { typedef unsigned int __type; };
-<span class="lineNum">      91 </span>                : 
-<span class="lineNum">      92 </span>                :   template&lt;&gt;
-<span class="lineNum">      93 </span>                :     struct __add_unsigned&lt;long&gt;
-<span class="lineNum">      94 </span>                :     { typedef unsigned long __type; };
-<span class="lineNum">      95 </span>                : 
-<span class="lineNum">      96 </span>                :   template&lt;&gt;
-<span class="lineNum">      97 </span>                :     struct __add_unsigned&lt;long long&gt;
-<span class="lineNum">      98 </span>                :     { typedef unsigned long long __type; };
-<span class="lineNum">      99 </span>                : 
-<span class="lineNum">     100 </span>                :   // Declare but don't define.
-<span class="lineNum">     101 </span>                :   template&lt;&gt;
-<span class="lineNum">     102 </span>                :     struct __add_unsigned&lt;bool&gt;;
-<span class="lineNum">     103 </span>                : 
-<span class="lineNum">     104 </span>                :   template&lt;&gt;
-<span class="lineNum">     105 </span>                :     struct __add_unsigned&lt;wchar_t&gt;;
-<span class="lineNum">     106 </span>                : 
-<span class="lineNum">     107 </span>                : 
-<span class="lineNum">     108 </span>                :   // Given an integral builtin type, return the corresponding signed type.
-<span class="lineNum">     109 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     110 </span>                :     struct __remove_unsigned
-<span class="lineNum">     111 </span>                :     { 
-<span class="lineNum">     112 </span>                :     private:
-<span class="lineNum">     113 </span>                :       typedef __enable_if&lt;std::__is_integer&lt;_Tp&gt;::__value, _Tp&gt; __if_type;
-<span class="lineNum">     114 </span>                :       
-<span class="lineNum">     115 </span>                :     public:
-<span class="lineNum">     116 </span>                :       typedef typename __if_type::__type __type; 
-<span class="lineNum">     117 </span>                :     };
-<span class="lineNum">     118 </span>                : 
-<span class="lineNum">     119 </span>                :   template&lt;&gt;
-<span class="lineNum">     120 </span>                :     struct __remove_unsigned&lt;char&gt;
-<span class="lineNum">     121 </span>                :     { typedef signed char __type; };
-<span class="lineNum">     122 </span>                : 
-<span class="lineNum">     123 </span>                :   template&lt;&gt;
-<span class="lineNum">     124 </span>                :     struct __remove_unsigned&lt;unsigned char&gt;
-<span class="lineNum">     125 </span>                :     { typedef signed char __type; };
-<span class="lineNum">     126 </span>                : 
-<span class="lineNum">     127 </span>                :   template&lt;&gt;
-<span class="lineNum">     128 </span>                :     struct __remove_unsigned&lt;unsigned short&gt;
-<span class="lineNum">     129 </span>                :     { typedef short __type; };
-<span class="lineNum">     130 </span>                : 
-<span class="lineNum">     131 </span>                :   template&lt;&gt;
-<span class="lineNum">     132 </span>                :     struct __remove_unsigned&lt;unsigned int&gt;
-<span class="lineNum">     133 </span>                :     { typedef int __type; };
-<span class="lineNum">     134 </span>                : 
-<span class="lineNum">     135 </span>                :   template&lt;&gt;
-<span class="lineNum">     136 </span>                :     struct __remove_unsigned&lt;unsigned long&gt;
-<span class="lineNum">     137 </span>                :     { typedef long __type; };
-<span class="lineNum">     138 </span>                : 
-<span class="lineNum">     139 </span>                :   template&lt;&gt;
-<span class="lineNum">     140 </span>                :     struct __remove_unsigned&lt;unsigned long long&gt;
-<span class="lineNum">     141 </span>                :     { typedef long long __type; };
-<span class="lineNum">     142 </span>                : 
-<span class="lineNum">     143 </span>                :   // Declare but don't define.
-<span class="lineNum">     144 </span>                :   template&lt;&gt;
-<span class="lineNum">     145 </span>                :     struct __remove_unsigned&lt;bool&gt;;
-<span class="lineNum">     146 </span>                : 
-<span class="lineNum">     147 </span>                :   template&lt;&gt;
-<span class="lineNum">     148 </span>                :     struct __remove_unsigned&lt;wchar_t&gt;;
-<span class="lineNum">     149 </span>                : 
-<span class="lineNum">     150 </span>                : 
-<span class="lineNum">     151 </span>                :   // For use in string and vstring.
-<span class="lineNum">     152 </span>                :   template&lt;typename _Type&gt;
-<span class="lineNum">     153 </span>                :     inline bool
-<span class="lineNum">     154 </span><span class="lineNoCov">              0 :     __is_null_pointer(_Type* __ptr)</span>
-<span class="lineNum">     155 </span><span class="lineNoCov">              0 :     { return __ptr == 0; }</span>
-<span class="lineNum">     156 </span>                : 
-<span class="lineNum">     157 </span>                :   template&lt;typename _Type&gt;
-<span class="lineNum">     158 </span>                :     inline bool
-<span class="lineNum">     159 </span><span class="lineCov">           1287 :     __is_null_pointer(_Type)</span>
-<span class="lineNum">     160 </span><span class="lineCov">           1287 :     { return false; }</span>
-<span class="lineNum">     161 </span>                : 
-<span class="lineNum">     162 </span>                : 
-<span class="lineNum">     163 </span>                :   // For complex and cmath
-<span class="lineNum">     164 </span>                :   template&lt;typename _Tp, bool = std::__is_integer&lt;_Tp&gt;::__value&gt;
-<span class="lineNum">     165 </span>                :     struct __promote
-<span class="lineNum">     166 </span>                :     { typedef double __type; };
-<span class="lineNum">     167 </span>                : 
-<span class="lineNum">     168 </span>                :   template&lt;typename _Tp&gt;
-<span class="lineNum">     169 </span>                :     struct __promote&lt;_Tp, false&gt;
-<span class="lineNum">     170 </span>                :     { typedef _Tp __type; };
-<span class="lineNum">     171 </span>                : 
-<span class="lineNum">     172 </span>                :   template&lt;typename _Tp, typename _Up&gt;
-<span class="lineNum">     173 </span>                :     struct __promote_2
-<span class="lineNum">     174 </span>                :     {
-<span class="lineNum">     175 </span>                :     private:
-<span class="lineNum">     176 </span>                :       typedef typename __promote&lt;_Tp&gt;::__type __type1;
-<span class="lineNum">     177 </span>                :       typedef typename __promote&lt;_Up&gt;::__type __type2;
-<span class="lineNum">     178 </span>                : 
-<span class="lineNum">     179 </span>                :     public:
-<span class="lineNum">     180 </span>                :       typedef __typeof__(__type1() + __type2()) __type;
-<span class="lineNum">     181 </span>                :     };
-<span class="lineNum">     182 </span>                : 
-<span class="lineNum">     183 </span>                :   template&lt;typename _Tp, typename _Up, typename _Vp&gt;
-<span class="lineNum">     184 </span>                :     struct __promote_3
-<span class="lineNum">     185 </span>                :     {
-<span class="lineNum">     186 </span>                :     private:
-<span class="lineNum">     187 </span>                :       typedef typename __promote&lt;_Tp&gt;::__type __type1;
-<span class="lineNum">     188 </span>                :       typedef typename __promote&lt;_Up&gt;::__type __type2;
-<span class="lineNum">     189 </span>                :       typedef typename __promote&lt;_Vp&gt;::__type __type3;
-<span class="lineNum">     190 </span>                : 
-<span class="lineNum">     191 </span>                :     public:
-<span class="lineNum">     192 </span>                :       typedef __typeof__(__type1() + __type2() + __type3()) __type;
-<span class="lineNum">     193 </span>                :     };
-<span class="lineNum">     194 </span>                : 
-<span class="lineNum">     195 </span>                :   template&lt;typename _Tp, typename _Up, typename _Vp, typename _Wp&gt;
-<span class="lineNum">     196 </span>                :     struct __promote_4
-<span class="lineNum">     197 </span>                :     {
-<span class="lineNum">     198 </span>                :     private:
-<span class="lineNum">     199 </span>                :       typedef typename __promote&lt;_Tp&gt;::__type __type1;
-<span class="lineNum">     200 </span>                :       typedef typename __promote&lt;_Up&gt;::__type __type2;
-<span class="lineNum">     201 </span>                :       typedef typename __promote&lt;_Vp&gt;::__type __type3;
-<span class="lineNum">     202 </span>                :       typedef typename __promote&lt;_Wp&gt;::__type __type4;
-<span class="lineNum">     203 </span>                : 
-<span class="lineNum">     204 </span>                :     public:
-<span class="lineNum">     205 </span>                :       typedef __typeof__(__type1() + __type2() + __type3() + __type4()) __type;
-<span class="lineNum">     206 </span>                :     };
-<span class="lineNum">     207 </span>                : 
-<span class="lineNum">     208 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">     209 </span>                : 
-<span class="lineNum">     210 </span>                : #endif 
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/fstream.gcov.html b/rep/usr/include/c++/4.3/fstream.gcov.html
deleted file mode 100644
index 9432d72..0000000
--- a/rep/usr/include/c++/4.3/fstream.gcov.html
+++ /dev/null
@@ -1,853 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/fstream</title>
-  <link rel="stylesheet" type="text/css" href="../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3</a> - fstream</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">38</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">0.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">0</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // File based streams -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005,
-<span class="lineNum">       4 </span>                : // 2006, 2007, 2008
-<span class="lineNum">       5 </span>                : // Free Software Foundation, Inc.
-<span class="lineNum">       6 </span>                : //
-<span class="lineNum">       7 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       8 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       9 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">      10 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      11 </span>                : // any later version.
-<span class="lineNum">      12 </span>                : 
-<span class="lineNum">      13 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      14 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      15 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      16 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      17 </span>                : 
-<span class="lineNum">      18 </span>                : // You should have received a copy of the GNU General Public License
-<span class="lineNum">      19 </span>                : // along with this library; see the file COPYING.  If not, write to
-<span class="lineNum">      20 </span>                : // the Free Software Foundation, 51 Franklin Street, Fifth Floor,
-<span class="lineNum">      21 </span>                : // Boston, MA 02110-1301, USA.
-<span class="lineNum">      22 </span>                : 
-<span class="lineNum">      23 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      24 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      25 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      26 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      27 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      28 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      29 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      30 </span>                : // the GNU General Public License.
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span>                : /** @file fstream
-<span class="lineNum">      33 </span>                :  *  This is a Standard C++ Library header.
-<span class="lineNum">      34 </span>                :  */
-<span class="lineNum">      35 </span>                : 
-<span class="lineNum">      36 </span>                : //
-<span class="lineNum">      37 </span>                : // ISO C++ 14882: 27.8  File-based streams
-<span class="lineNum">      38 </span>                : //
-<span class="lineNum">      39 </span>                : 
-<span class="lineNum">      40 </span>                : #ifndef _GLIBCXX_FSTREAM
-<span class="lineNum">      41 </span>                : #define _GLIBCXX_FSTREAM 1
-<span class="lineNum">      42 </span>                : 
-<span class="lineNum">      43 </span>                : #pragma GCC system_header
-<span class="lineNum">      44 </span>                : 
-<span class="lineNum">      45 </span>                : #include &lt;istream&gt;
-<span class="lineNum">      46 </span>                : #include &lt;ostream&gt;
-<span class="lineNum">      47 </span>                : #include &lt;bits/codecvt.h&gt;
-<span class="lineNum">      48 </span>                : #include &lt;cstdio&gt;             // For BUFSIZ     
-<span class="lineNum">      49 </span>                : #include &lt;bits/basic_file.h&gt;  // For __basic_file, __c_lock
-<span class="lineNum">      50 </span>                : 
-<span class="lineNum">      51 </span>                : _GLIBCXX_BEGIN_NAMESPACE(std)
-<span class="lineNum">      52 </span>                : 
-<span class="lineNum">      53 </span>                :   // [27.8.1.1] template class basic_filebuf
-<span class="lineNum">      54 </span>                :   /**
-<span class="lineNum">      55 </span>                :    *  @brief  The actual work of input and output (for files).
-<span class="lineNum">      56 </span>                :    *
-<span class="lineNum">      57 </span>                :    *  This class associates both its input and output sequence with an
-<span class="lineNum">      58 </span>                :    *  external disk file, and maintains a joint file position for both
-<span class="lineNum">      59 </span>                :    *  sequences.  Many of its semantics are described in terms of similar
-<span class="lineNum">      60 </span>                :    *  behavior in the Standard C Library's @c FILE streams.
-<span class="lineNum">      61 </span>                :   */
-<span class="lineNum">      62 </span>                :   // Requirements on traits_type, specific to this class:
-<span class="lineNum">      63 </span>                :   // traits_type::pos_type must be fpos&lt;traits_type::state_type&gt;
-<span class="lineNum">      64 </span>                :   // traits_type::off_type must be streamoff
-<span class="lineNum">      65 </span>                :   // traits_type::state_type must be Assignable and DefaultConstructible,
-<span class="lineNum">      66 </span>                :   // and traits_type::state_type() must be the initial state for codecvt.
-<span class="lineNum">      67 </span>                :   template&lt;typename _CharT, typename _Traits&gt;
-<span class="lineNum">      68 </span>                :     class basic_filebuf : public basic_streambuf&lt;_CharT, _Traits&gt;
-<span class="lineNum">      69 </span>                :     {
-<span class="lineNum">      70 </span>                :     public:
-<span class="lineNum">      71 </span>                :       // Types:
-<span class="lineNum">      72 </span>                :       typedef _CharT                                    char_type;
-<span class="lineNum">      73 </span>                :       typedef _Traits                                   traits_type;
-<span class="lineNum">      74 </span>                :       typedef typename traits_type::int_type            int_type;
-<span class="lineNum">      75 </span>                :       typedef typename traits_type::pos_type            pos_type;
-<span class="lineNum">      76 </span>                :       typedef typename traits_type::off_type            off_type;
-<span class="lineNum">      77 </span>                : 
-<span class="lineNum">      78 </span>                :       typedef basic_streambuf&lt;char_type, traits_type&gt;     __streambuf_type;
-<span class="lineNum">      79 </span>                :       typedef basic_filebuf&lt;char_type, traits_type&gt;     __filebuf_type;
-<span class="lineNum">      80 </span>                :       typedef __basic_file&lt;char&gt;                  __file_type;
-<span class="lineNum">      81 </span>                :       typedef typename traits_type::state_type          __state_type;
-<span class="lineNum">      82 </span>                :       typedef codecvt&lt;char_type, char, __state_type&gt;    __codecvt_type;
-<span class="lineNum">      83 </span>                : 
-<span class="lineNum">      84 </span>                :       friend class ios_base; // For sync_with_stdio.
-<span class="lineNum">      85 </span>                : 
-<span class="lineNum">      86 </span>                :     protected:
-<span class="lineNum">      87 </span>                :       // Data Members:
-<span class="lineNum">      88 </span>                :       // MT lock inherited from libio or other low-level io library.
-<span class="lineNum">      89 </span>                :       __c_lock                  _M_lock;
-<span class="lineNum">      90 </span>                : 
-<span class="lineNum">      91 </span>                :       // External buffer.
-<span class="lineNum">      92 </span>                :       __file_type               _M_file;
-<span class="lineNum">      93 </span>                : 
-<span class="lineNum">      94 </span>                :       /// Place to stash in || out || in | out settings for current filebuf.
-<span class="lineNum">      95 </span>                :       ios_base::openmode        _M_mode;
-<span class="lineNum">      96 </span>                : 
-<span class="lineNum">      97 </span>                :       // Beginning state type for codecvt.
-<span class="lineNum">      98 </span>                :       __state_type              _M_state_beg;
-<span class="lineNum">      99 </span>                : 
-<span class="lineNum">     100 </span>                :       // During output, the state that corresponds to pptr(),
-<span class="lineNum">     101 </span>                :       // during input, the state that corresponds to egptr() and
-<span class="lineNum">     102 </span>                :       // _M_ext_next.
-<span class="lineNum">     103 </span>                :       __state_type              _M_state_cur;
-<span class="lineNum">     104 </span>                : 
-<span class="lineNum">     105 </span>                :       // Not used for output. During input, the state that corresponds
-<span class="lineNum">     106 </span>                :       // to eback() and _M_ext_buf.
-<span class="lineNum">     107 </span>                :       __state_type              _M_state_last;
-<span class="lineNum">     108 </span>                : 
-<span class="lineNum">     109 </span>                :       /// Pointer to the beginning of internal buffer.
-<span class="lineNum">     110 </span>                :       char_type*                _M_buf;         
-<span class="lineNum">     111 </span>                : 
-<span class="lineNum">     112 </span>                :       /**
-<span class="lineNum">     113 </span>                :        *  Actual size of internal buffer. This number is equal to the size
-<span class="lineNum">     114 </span>                :        *  of the put area + 1 position, reserved for the overflow char of
-<span class="lineNum">     115 </span>                :        *  a full area.
-<span class="lineNum">     116 </span>                :       */
-<span class="lineNum">     117 </span>                :       size_t                    _M_buf_size;
-<span class="lineNum">     118 </span>                : 
-<span class="lineNum">     119 </span>                :       // Set iff _M_buf is allocated memory from _M_allocate_internal_buffer.
-<span class="lineNum">     120 </span>                :       bool                      _M_buf_allocated;
-<span class="lineNum">     121 </span>                : 
-<span class="lineNum">     122 </span>                :       /**
-<span class="lineNum">     123 </span>                :        *  _M_reading == false &amp;&amp; _M_writing == false for 'uncommitted' mode;  
-<span class="lineNum">     124 </span>                :        *  _M_reading == true for 'read' mode;
-<span class="lineNum">     125 </span>                :        *  _M_writing == true for 'write' mode;
-<span class="lineNum">     126 </span>                :        *
-<span class="lineNum">     127 </span>                :        *  NB: _M_reading == true &amp;&amp; _M_writing == true is unused.
-<span class="lineNum">     128 </span>                :       */ 
-<span class="lineNum">     129 </span>                :       bool                      _M_reading;
-<span class="lineNum">     130 </span>                :       bool                      _M_writing;
-<span class="lineNum">     131 </span>                : 
-<span class="lineNum">     132 </span>                :       //@{
-<span class="lineNum">     133 </span>                :       /**
-<span class="lineNum">     134 </span>                :        *  Necessary bits for putback buffer management.
-<span class="lineNum">     135 </span>                :        *
-<span class="lineNum">     136 </span>                :        *  @note pbacks of over one character are not currently supported.
-<span class="lineNum">     137 </span>                :       */
-<span class="lineNum">     138 </span>                :       char_type                 _M_pback; 
-<span class="lineNum">     139 </span>                :       char_type*                _M_pback_cur_save;
-<span class="lineNum">     140 </span>                :       char_type*                _M_pback_end_save;
-<span class="lineNum">     141 </span>                :       bool                      _M_pback_init; 
-<span class="lineNum">     142 </span>                :       //@}
-<span class="lineNum">     143 </span>                : 
-<span class="lineNum">     144 </span>                :       // Cached codecvt facet.
-<span class="lineNum">     145 </span>                :       const __codecvt_type*     _M_codecvt;
-<span class="lineNum">     146 </span>                : 
-<span class="lineNum">     147 </span>                :       /**
-<span class="lineNum">     148 </span>                :        *  Buffer for external characters. Used for input when
-<span class="lineNum">     149 </span>                :        *  codecvt::always_noconv() == false. When valid, this corresponds
-<span class="lineNum">     150 </span>                :        *  to eback().
-<span class="lineNum">     151 </span>                :       */ 
-<span class="lineNum">     152 </span>                :       char*                     _M_ext_buf;
-<span class="lineNum">     153 </span>                : 
-<span class="lineNum">     154 </span>                :       /**
-<span class="lineNum">     155 </span>                :        *  Size of buffer held by _M_ext_buf.
-<span class="lineNum">     156 </span>                :       */ 
-<span class="lineNum">     157 </span>                :       streamsize                _M_ext_buf_size;
-<span class="lineNum">     158 </span>                : 
-<span class="lineNum">     159 </span>                :       /**
-<span class="lineNum">     160 </span>                :        *  Pointers into the buffer held by _M_ext_buf that delimit a
-<span class="lineNum">     161 </span>                :        *  subsequence of bytes that have been read but not yet converted.
-<span class="lineNum">     162 </span>                :        *  When valid, _M_ext_next corresponds to egptr().
-<span class="lineNum">     163 </span>                :       */ 
-<span class="lineNum">     164 </span>                :       const char*               _M_ext_next;
-<span class="lineNum">     165 </span>                :       char*                     _M_ext_end;
-<span class="lineNum">     166 </span>                : 
-<span class="lineNum">     167 </span>                :       /**
-<span class="lineNum">     168 </span>                :        *  Initializes pback buffers, and moves normal buffers to safety.
-<span class="lineNum">     169 </span>                :        *  Assumptions:
-<span class="lineNum">     170 </span>                :        *  _M_in_cur has already been moved back
-<span class="lineNum">     171 </span>                :       */
-<span class="lineNum">     172 </span>                :       void
-<span class="lineNum">     173 </span>                :       _M_create_pback()
-<span class="lineNum">     174 </span>                :       {
-<span class="lineNum">     175 </span>                :         if (!_M_pback_init)
-<span class="lineNum">     176 </span>                :           {
-<span class="lineNum">     177 </span>                :             _M_pback_cur_save = this-&gt;gptr();
-<span class="lineNum">     178 </span>                :             _M_pback_end_save = this-&gt;egptr();
-<span class="lineNum">     179 </span>                :             this-&gt;setg(&amp;_M_pback, &amp;_M_pback, &amp;_M_pback + 1);
-<span class="lineNum">     180 </span>                :             _M_pback_init = true;
-<span class="lineNum">     181 </span>                :           }
-<span class="lineNum">     182 </span>                :       }
-<span class="lineNum">     183 </span>                : 
-<span class="lineNum">     184 </span>                :       /**
-<span class="lineNum">     185 </span>                :        *  Deactivates pback buffer contents, and restores normal buffer.
-<span class="lineNum">     186 </span>                :        *  Assumptions:
-<span class="lineNum">     187 </span>                :        *  The pback buffer has only moved forward.
-<span class="lineNum">     188 </span>                :       */ 
-<span class="lineNum">     189 </span>                :       void
-<span class="lineNum">     190 </span>                :       _M_destroy_pback() throw()
-<span class="lineNum">     191 </span>                :       {
-<span class="lineNum">     192 </span>                :         if (_M_pback_init)
-<span class="lineNum">     193 </span>                :           {
-<span class="lineNum">     194 </span>                :             // Length _M_in_cur moved in the pback buffer.
-<span class="lineNum">     195 </span>                :             _M_pback_cur_save += this-&gt;gptr() != this-&gt;eback();
-<span class="lineNum">     196 </span>                :             this-&gt;setg(_M_buf, _M_pback_cur_save, _M_pback_end_save);
-<span class="lineNum">     197 </span>                :             _M_pback_init = false;
-<span class="lineNum">     198 </span>                :           }
-<span class="lineNum">     199 </span>                :       }
-<span class="lineNum">     200 </span>                : 
-<span class="lineNum">     201 </span>                :     public:
-<span class="lineNum">     202 </span>                :       // Constructors/destructor:
-<span class="lineNum">     203 </span>                :       /**
-<span class="lineNum">     204 </span>                :        *  @brief  Does not open any files.
-<span class="lineNum">     205 </span>                :        *
-<span class="lineNum">     206 </span>                :        *  The default constructor initializes the parent class using its
-<span class="lineNum">     207 </span>                :        *  own default ctor.
-<span class="lineNum">     208 </span>                :       */
-<span class="lineNum">     209 </span>                :       basic_filebuf();
-<span class="lineNum">     210 </span>                : 
-<span class="lineNum">     211 </span>                :       /**
-<span class="lineNum">     212 </span>                :        *  @brief  The destructor closes the file first.
-<span class="lineNum">     213 </span>                :       */
-<span class="lineNum">     214 </span>                :       virtual
-<span class="lineNum">     215 </span><span class="lineNoCov">              0 :       ~basic_filebuf()</span>
-<span class="lineNum">     216 </span><span class="lineNoCov">              0 :       { this-&gt;close(); }</span>
-<span class="lineNum">     217 </span>                : 
-<span class="lineNum">     218 </span>                :       // Members:
-<span class="lineNum">     219 </span>                :       /**
-<span class="lineNum">     220 </span>                :        *  @brief  Returns true if the external file is open.
-<span class="lineNum">     221 </span>                :       */
-<span class="lineNum">     222 </span>                :       bool
-<span class="lineNum">     223 </span><span class="lineNoCov">              0 :       is_open() const throw()</span>
-<span class="lineNum">     224 </span><span class="lineNoCov">              0 :       { return _M_file.is_open(); }</span>
-<span class="lineNum">     225 </span>                : 
-<span class="lineNum">     226 </span>                :       /**
-<span class="lineNum">     227 </span>                :        *  @brief  Opens an external file.
-<span class="lineNum">     228 </span>                :        *  @param  s  The name of the file.
-<span class="lineNum">     229 </span>                :        *  @param  mode  The open mode flags.
-<span class="lineNum">     230 </span>                :        *  @return  @c this on success, NULL on failure
-<span class="lineNum">     231 </span>                :        *
-<span class="lineNum">     232 </span>                :        *  If a file is already open, this function immediately fails.
-<span class="lineNum">     233 </span>                :        *  Otherwise it tries to open the file named @a s using the flags
-<span class="lineNum">     234 </span>                :        *  given in @a mode.
-<span class="lineNum">     235 </span>                :        *
-<span class="lineNum">     236 </span>                :        *  Table 92, adapted here, gives the relation between openmode
-<span class="lineNum">     237 </span>                :        *  combinations and the equivalent fopen() flags.
-<span class="lineNum">     238 </span>                :        *  (NB: lines app, in|out|app, in|app, binary|app, binary|in|out|app,
-<span class="lineNum">     239 </span>                :        *  and binary|in|app per DR 596)
-<span class="lineNum">     240 </span>                :        *  +---------------------------------------------------------+
-<span class="lineNum">     241 </span>                :        *  | ios_base Flag combination            stdio equivalent   |
-<span class="lineNum">     242 </span>                :        *  |binary  in  out  trunc  app                              |
-<span class="lineNum">     243 </span>                :        *  +---------------------------------------------------------+
-<span class="lineNum">     244 </span>                :        *  |             +                        &quot;w&quot;                |
-<span class="lineNum">     245 </span>                :        *  |             +           +            &quot;a&quot;                |
-<span class="lineNum">     246 </span>                :        *  |                         +            &quot;a&quot;                |
-<span class="lineNum">     247 </span>                :        *  |             +     +                  &quot;w&quot;                |
-<span class="lineNum">     248 </span>                :        *  |         +                            &quot;r&quot;                |
-<span class="lineNum">     249 </span>                :        *  |         +   +                        &quot;r+&quot;               |
-<span class="lineNum">     250 </span>                :        *  |         +   +     +                  &quot;w+&quot;               |
-<span class="lineNum">     251 </span>                :        *  |         +   +           +            &quot;a+&quot;               |
-<span class="lineNum">     252 </span>                :        *  |         +               +            &quot;a+&quot;               |
-<span class="lineNum">     253 </span>                :        *  +---------------------------------------------------------+
-<span class="lineNum">     254 </span>                :        *  |   +         +                        &quot;wb&quot;               |
-<span class="lineNum">     255 </span>                :        *  |   +         +           +            &quot;ab&quot;               |
-<span class="lineNum">     256 </span>                :        *  |   +                     +            &quot;ab&quot;               |
-<span class="lineNum">     257 </span>                :        *  |   +         +     +                  &quot;wb&quot;               |
-<span class="lineNum">     258 </span>                :        *  |   +     +                            &quot;rb&quot;               |
-<span class="lineNum">     259 </span>                :        *  |   +     +   +                        &quot;r+b&quot;              |
-<span class="lineNum">     260 </span>                :        *  |   +     +   +     +                  &quot;w+b&quot;              |
-<span class="lineNum">     261 </span>                :        *  |   +     +   +           +            &quot;a+b&quot;              |
-<span class="lineNum">     262 </span>                :        *  |   +     +               +            &quot;a+b&quot;              |
-<span class="lineNum">     263 </span>                :        *  +---------------------------------------------------------+
-<span class="lineNum">     264 </span>                :        */
-<span class="lineNum">     265 </span>                :       __filebuf_type*
-<span class="lineNum">     266 </span>                :       open(const char* __s, ios_base::openmode __mode);
-<span class="lineNum">     267 </span>                : 
-<span class="lineNum">     268 </span>                :       /**
-<span class="lineNum">     269 </span>                :        *  @brief  Closes the currently associated file.
-<span class="lineNum">     270 </span>                :        *  @return  @c this on success, NULL on failure
-<span class="lineNum">     271 </span>                :        *
-<span class="lineNum">     272 </span>                :        *  If no file is currently open, this function immediately fails.
-<span class="lineNum">     273 </span>                :        *
-<span class="lineNum">     274 </span>                :        *  If a &quot;put buffer area&quot; exists, @c overflow(eof) is called to flush
-<span class="lineNum">     275 </span>                :        *  all the characters.  The file is then closed.
-<span class="lineNum">     276 </span>                :        *
-<span class="lineNum">     277 </span>                :        *  If any operations fail, this function also fails.
-<span class="lineNum">     278 </span>                :       */
-<span class="lineNum">     279 </span>                :       __filebuf_type*
-<span class="lineNum">     280 </span>                :       close();
-<span class="lineNum">     281 </span>                : 
-<span class="lineNum">     282 </span>                :     protected:
-<span class="lineNum">     283 </span>                :       void
-<span class="lineNum">     284 </span>                :       _M_allocate_internal_buffer();
-<span class="lineNum">     285 </span>                : 
-<span class="lineNum">     286 </span>                :       void
-<span class="lineNum">     287 </span>                :       _M_destroy_internal_buffer() throw();
-<span class="lineNum">     288 </span>                : 
-<span class="lineNum">     289 </span>                :       // [27.8.1.4] overridden virtual functions
-<span class="lineNum">     290 </span>                :       virtual streamsize
-<span class="lineNum">     291 </span>                :       showmanyc();
-<span class="lineNum">     292 </span>                : 
-<span class="lineNum">     293 </span>                :       // Stroustrup, 1998, p. 628
-<span class="lineNum">     294 </span>                :       // underflow() and uflow() functions are called to get the next
-<span class="lineNum">     295 </span>                :       // character from the real input source when the buffer is empty.
-<span class="lineNum">     296 </span>                :       // Buffered input uses underflow()
-<span class="lineNum">     297 </span>                : 
-<span class="lineNum">     298 </span>                :       virtual int_type
-<span class="lineNum">     299 </span>                :       underflow();
-<span class="lineNum">     300 </span>                : 
-<span class="lineNum">     301 </span>                :       virtual int_type
-<span class="lineNum">     302 </span>                :       pbackfail(int_type __c = _Traits::eof());
-<span class="lineNum">     303 </span>                : 
-<span class="lineNum">     304 </span>                :       // Stroustrup, 1998, p 648
-<span class="lineNum">     305 </span>                :       // The overflow() function is called to transfer characters to the
-<span class="lineNum">     306 </span>                :       // real output destination when the buffer is full. A call to
-<span class="lineNum">     307 </span>                :       // overflow(c) outputs the contents of the buffer plus the
-<span class="lineNum">     308 </span>                :       // character c.
-<span class="lineNum">     309 </span>                :       // 27.5.2.4.5
-<span class="lineNum">     310 </span>                :       // Consume some sequence of the characters in the pending sequence.
-<span class="lineNum">     311 </span>                :       virtual int_type
-<span class="lineNum">     312 </span>                :       overflow(int_type __c = _Traits::eof());
-<span class="lineNum">     313 </span>                : 
-<span class="lineNum">     314 </span>                :       // Convert internal byte sequence to external, char-based
-<span class="lineNum">     315 </span>                :       // sequence via codecvt.
-<span class="lineNum">     316 </span>                :       bool
-<span class="lineNum">     317 </span>                :       _M_convert_to_external(char_type*, streamsize);
-<span class="lineNum">     318 </span>                : 
-<span class="lineNum">     319 </span>                :       /**
-<span class="lineNum">     320 </span>                :        *  @brief  Manipulates the buffer.
-<span class="lineNum">     321 </span>                :        *  @param  s  Pointer to a buffer area.
-<span class="lineNum">     322 </span>                :        *  @param  n  Size of @a s.
-<span class="lineNum">     323 </span>                :        *  @return  @c this
-<span class="lineNum">     324 </span>                :        *
-<span class="lineNum">     325 </span>                :        *  If no file has been opened, and both @a s and @a n are zero, then
-<span class="lineNum">     326 </span>                :        *  the stream becomes unbuffered.  Otherwise, @c s is used as a
-<span class="lineNum">     327 </span>                :        *  buffer; see
-<span class="lineNum">     328 </span>                :        *  http://gcc.gnu.org/onlinedocs/libstdc++/27_io/howto.html#2
-<span class="lineNum">     329 </span>                :        *  for more.
-<span class="lineNum">     330 </span>                :       */
-<span class="lineNum">     331 </span>                :       virtual __streambuf_type*
-<span class="lineNum">     332 </span>                :       setbuf(char_type* __s, streamsize __n);
-<span class="lineNum">     333 </span>                : 
-<span class="lineNum">     334 </span>                :       virtual pos_type
-<span class="lineNum">     335 </span>                :       seekoff(off_type __off, ios_base::seekdir __way,
-<span class="lineNum">     336 </span>                :               ios_base::openmode __mode = ios_base::in | ios_base::out);
-<span class="lineNum">     337 </span>                : 
-<span class="lineNum">     338 </span>                :       virtual pos_type
-<span class="lineNum">     339 </span>                :       seekpos(pos_type __pos,
-<span class="lineNum">     340 </span>                :               ios_base::openmode __mode = ios_base::in | ios_base::out);
-<span class="lineNum">     341 </span>                : 
-<span class="lineNum">     342 </span>                :       // Common code for seekoff and seekpos
-<span class="lineNum">     343 </span>                :       pos_type
-<span class="lineNum">     344 </span>                :       _M_seek(off_type __off, ios_base::seekdir __way, __state_type __state);
-<span class="lineNum">     345 </span>                : 
-<span class="lineNum">     346 </span>                :       virtual int
-<span class="lineNum">     347 </span>                :       sync();
-<span class="lineNum">     348 </span>                : 
-<span class="lineNum">     349 </span>                :       virtual void
-<span class="lineNum">     350 </span>                :       imbue(const locale&amp; __loc);
-<span class="lineNum">     351 </span>                : 
-<span class="lineNum">     352 </span>                :       virtual streamsize
-<span class="lineNum">     353 </span>                :       xsgetn(char_type* __s, streamsize __n);
-<span class="lineNum">     354 </span>                : 
-<span class="lineNum">     355 </span>                :       virtual streamsize
-<span class="lineNum">     356 </span>                :       xsputn(const char_type* __s, streamsize __n);
-<span class="lineNum">     357 </span>                : 
-<span class="lineNum">     358 </span>                :       // Flushes output buffer, then writes unshift sequence.
-<span class="lineNum">     359 </span>                :       bool
-<span class="lineNum">     360 </span>                :       _M_terminate_output();
-<span class="lineNum">     361 </span>                : 
-<span class="lineNum">     362 </span>                :       /**
-<span class="lineNum">     363 </span>                :        *  This function sets the pointers of the internal buffer, both get
-<span class="lineNum">     364 </span>                :        *  and put areas. Typically:
-<span class="lineNum">     365 </span>                :        *
-<span class="lineNum">     366 </span>                :        *   __off == egptr() - eback() upon underflow/uflow ('read' mode);
-<span class="lineNum">     367 </span>                :        *   __off == 0 upon overflow ('write' mode);
-<span class="lineNum">     368 </span>                :        *   __off == -1 upon open, setbuf, seekoff/pos ('uncommitted' mode).
-<span class="lineNum">     369 </span>                :        * 
-<span class="lineNum">     370 </span>                :        *  NB: epptr() - pbase() == _M_buf_size - 1, since _M_buf_size
-<span class="lineNum">     371 </span>                :        *  reflects the actual allocated memory and the last cell is reserved
-<span class="lineNum">     372 </span>                :        *  for the overflow char of a full put area.
-<span class="lineNum">     373 </span>                :       */
-<span class="lineNum">     374 </span>                :       void
-<span class="lineNum">     375 </span>                :       _M_set_buffer(streamsize __off)
-<span class="lineNum">     376 </span>                :       {
-<span class="lineNum">     377 </span>                :         const bool __testin = _M_mode &amp; ios_base::in;
-<span class="lineNum">     378 </span>                :         const bool __testout = _M_mode &amp; ios_base::out;
-<span class="lineNum">     379 </span>                :         
-<span class="lineNum">     380 </span>                :         if (__testin &amp;&amp; __off &gt; 0)
-<span class="lineNum">     381 </span>                :           this-&gt;setg(_M_buf, _M_buf, _M_buf + __off);
-<span class="lineNum">     382 </span>                :         else
-<span class="lineNum">     383 </span>                :           this-&gt;setg(_M_buf, _M_buf, _M_buf);
-<span class="lineNum">     384 </span>                : 
-<span class="lineNum">     385 </span>                :         if (__testout &amp;&amp; __off == 0 &amp;&amp; _M_buf_size &gt; 1 )
-<span class="lineNum">     386 </span>                :           this-&gt;setp(_M_buf, _M_buf + _M_buf_size - 1);
-<span class="lineNum">     387 </span>                :         else
-<span class="lineNum">     388 </span>                :           this-&gt;setp(NULL, NULL);
-<span class="lineNum">     389 </span>                :       }
-<span class="lineNum">     390 </span>                :     };
-<span class="lineNum">     391 </span>                : 
-<span class="lineNum">     392 </span>                :   // [27.8.1.5] Template class basic_ifstream
-<span class="lineNum">     393 </span>                :   /**
-<span class="lineNum">     394 </span>                :    *  @brief  Controlling input for files.
-<span class="lineNum">     395 </span>                :    *
-<span class="lineNum">     396 </span>                :    *  This class supports reading from named files, using the inherited
-<span class="lineNum">     397 </span>                :    *  functions from std::basic_istream.  To control the associated
-<span class="lineNum">     398 </span>                :    *  sequence, an instance of std::basic_filebuf is used, which this page
-<span class="lineNum">     399 </span>                :    *  refers to as @c sb.
-<span class="lineNum">     400 </span>                :   */
-<span class="lineNum">     401 </span>                :   template&lt;typename _CharT, typename _Traits&gt;
-<span class="lineNum">     402 </span>                :     class basic_ifstream : public basic_istream&lt;_CharT, _Traits&gt;
-<span class="lineNum">     403 </span>                :     {
-<span class="lineNum">     404 </span>                :     public:
-<span class="lineNum">     405 </span>                :       // Types:
-<span class="lineNum">     406 </span>                :       typedef _CharT                                    char_type;
-<span class="lineNum">     407 </span>                :       typedef _Traits                                   traits_type;
-<span class="lineNum">     408 </span>                :       typedef typename traits_type::int_type            int_type;
-<span class="lineNum">     409 </span>                :       typedef typename traits_type::pos_type            pos_type;
-<span class="lineNum">     410 </span>                :       typedef typename traits_type::off_type            off_type;
-<span class="lineNum">     411 </span>                : 
-<span class="lineNum">     412 </span>                :       // Non-standard types:
-<span class="lineNum">     413 </span>                :       typedef basic_filebuf&lt;char_type, traits_type&gt;       __filebuf_type;
-<span class="lineNum">     414 </span>                :       typedef basic_istream&lt;char_type, traits_type&gt;       __istream_type;
-<span class="lineNum">     415 </span>                : 
-<span class="lineNum">     416 </span>                :     private:
-<span class="lineNum">     417 </span>                :       __filebuf_type    _M_filebuf;
-<span class="lineNum">     418 </span>                : 
-<span class="lineNum">     419 </span>                :     public:
-<span class="lineNum">     420 </span>                :       // Constructors/Destructors:
-<span class="lineNum">     421 </span>                :       /**
-<span class="lineNum">     422 </span>                :        *  @brief  Default constructor.
-<span class="lineNum">     423 </span>                :        *
-<span class="lineNum">     424 </span>                :        *  Initializes @c sb using its default constructor, and passes
-<span class="lineNum">     425 </span>                :        *  @c &amp;sb to the base class initializer.  Does not open any files
-<span class="lineNum">     426 </span>                :        *  (you haven't given it a filename to open).
-<span class="lineNum">     427 </span>                :       */
-<span class="lineNum">     428 </span><span class="lineNoCov">              0 :       basic_ifstream() : __istream_type(), _M_filebuf()</span>
-<span class="lineNum">     429 </span><span class="lineNoCov">              0 :       { this-&gt;init(&amp;_M_filebuf); }</span>
-<span class="lineNum">     430 </span>                : 
-<span class="lineNum">     431 </span>                :       /**
-<span class="lineNum">     432 </span>                :        *  @brief  Create an input file stream.
-<span class="lineNum">     433 </span>                :        *  @param  s  Null terminated string specifying the filename.
-<span class="lineNum">     434 </span>                :        *  @param  mode  Open file in specified mode (see std::ios_base).
-<span class="lineNum">     435 </span>                :        *
-<span class="lineNum">     436 </span>                :        *  @c ios_base::in is automatically included in @a mode.
-<span class="lineNum">     437 </span>                :        *
-<span class="lineNum">     438 </span>                :        *  Tip:  When using std::string to hold the filename, you must use
-<span class="lineNum">     439 </span>                :        *  .c_str() before passing it to this constructor.
-<span class="lineNum">     440 </span>                :       */
-<span class="lineNum">     441 </span>                :       explicit
-<span class="lineNum">     442 </span><span class="lineNoCov">              0 :       basic_ifstream(const char* __s, ios_base::openmode __mode = ios_base::in)</span>
-<span class="lineNum">     443 </span><span class="lineNoCov">              0 :       : __istream_type(), _M_filebuf()</span>
-<span class="lineNum">     444 </span>                :       {
-<span class="lineNum">     445 </span><span class="lineNoCov">              0 :         this-&gt;init(&amp;_M_filebuf);</span>
-<span class="lineNum">     446 </span><span class="lineNoCov">              0 :         this-&gt;open(__s, __mode);</span>
-<span class="lineNum">     447 </span><span class="lineNoCov">              0 :       }</span>
-<span class="lineNum">     448 </span>                : 
-<span class="lineNum">     449 </span>                :       /**
-<span class="lineNum">     450 </span>                :        *  @brief  The destructor does nothing.
-<span class="lineNum">     451 </span>                :        *
-<span class="lineNum">     452 </span>                :        *  The file is closed by the filebuf object, not the formatting
-<span class="lineNum">     453 </span>                :        *  stream.
-<span class="lineNum">     454 </span>                :       */
-<span class="lineNum">     455 </span><span class="lineNoCov">              0 :       ~basic_ifstream()</span>
-<span class="lineNum">     456 </span><span class="lineNoCov">              0 :       { }</span>
-<span class="lineNum">     457 </span>                : 
-<span class="lineNum">     458 </span>                :       // Members:
-<span class="lineNum">     459 </span>                :       /**
-<span class="lineNum">     460 </span>                :        *  @brief  Accessing the underlying buffer.
-<span class="lineNum">     461 </span>                :        *  @return  The current basic_filebuf buffer.
-<span class="lineNum">     462 </span>                :        *
-<span class="lineNum">     463 </span>                :        *  This hides both signatures of std::basic_ios::rdbuf().
-<span class="lineNum">     464 </span>                :       */
-<span class="lineNum">     465 </span>                :       __filebuf_type*
-<span class="lineNum">     466 </span>                :       rdbuf() const
-<span class="lineNum">     467 </span>                :       { return const_cast&lt;__filebuf_type*&gt;(&amp;_M_filebuf); }
-<span class="lineNum">     468 </span>                : 
-<span class="lineNum">     469 </span>                :       /**
-<span class="lineNum">     470 </span>                :        *  @brief  Wrapper to test for an open file.
-<span class="lineNum">     471 </span>                :        *  @return  @c rdbuf()-&gt;is_open()
-<span class="lineNum">     472 </span>                :       */
-<span class="lineNum">     473 </span>                :       bool
-<span class="lineNum">     474 </span><span class="lineNoCov">              0 :       is_open()</span>
-<span class="lineNum">     475 </span><span class="lineNoCov">              0 :       { return _M_filebuf.is_open(); }</span>
-<span class="lineNum">     476 </span>                : 
-<span class="lineNum">     477 </span>                :       // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     478 </span>                :       // 365. Lack of const-qualification in clause 27
-<span class="lineNum">     479 </span>                :       bool
-<span class="lineNum">     480 </span>                :       is_open() const
-<span class="lineNum">     481 </span>                :       { return _M_filebuf.is_open(); }
-<span class="lineNum">     482 </span>                : 
-<span class="lineNum">     483 </span>                :       /**
-<span class="lineNum">     484 </span>                :        *  @brief  Opens an external file.
-<span class="lineNum">     485 </span>                :        *  @param  s  The name of the file.
-<span class="lineNum">     486 </span>                :        *  @param  mode  The open mode flags.
-<span class="lineNum">     487 </span>                :        *
-<span class="lineNum">     488 </span>                :        *  Calls @c std::basic_filebuf::open(s,mode|in).  If that function
-<span class="lineNum">     489 </span>                :        *  fails, @c failbit is set in the stream's error state.
-<span class="lineNum">     490 </span>                :        *
-<span class="lineNum">     491 </span>                :        *  Tip:  When using std::string to hold the filename, you must use
-<span class="lineNum">     492 </span>                :        *  .c_str() before passing it to this constructor.
-<span class="lineNum">     493 </span>                :       */
-<span class="lineNum">     494 </span>                :       void
-<span class="lineNum">     495 </span><span class="lineNoCov">              0 :       open(const char* __s, ios_base::openmode __mode = ios_base::in)</span>
-<span class="lineNum">     496 </span>                :       {
-<span class="lineNum">     497 </span><span class="lineNoCov">              0 :         if (!_M_filebuf.open(__s, __mode | ios_base::in))</span>
-<span class="lineNum">     498 </span><span class="lineNoCov">              0 :           this-&gt;setstate(ios_base::failbit);</span>
-<span class="lineNum">     499 </span>                :         else
-<span class="lineNum">     500 </span>                :           // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     501 </span>                :           // 409. Closing an fstream should clear error state
-<span class="lineNum">     502 </span><span class="lineNoCov">              0 :           this-&gt;clear();</span>
-<span class="lineNum">     503 </span><span class="lineNoCov">              0 :       }</span>
-<span class="lineNum">     504 </span>                : 
-<span class="lineNum">     505 </span>                :       /**
-<span class="lineNum">     506 </span>                :        *  @brief  Close the file.
-<span class="lineNum">     507 </span>                :        *
-<span class="lineNum">     508 </span>                :        *  Calls @c std::basic_filebuf::close().  If that function
-<span class="lineNum">     509 </span>                :        *  fails, @c failbit is set in the stream's error state.
-<span class="lineNum">     510 </span>                :       */
-<span class="lineNum">     511 </span>                :       void
-<span class="lineNum">     512 </span><span class="lineNoCov">              0 :       close()</span>
-<span class="lineNum">     513 </span>                :       {
-<span class="lineNum">     514 </span><span class="lineNoCov">              0 :         if (!_M_filebuf.close())</span>
-<span class="lineNum">     515 </span><span class="lineNoCov">              0 :           this-&gt;setstate(ios_base::failbit);</span>
-<span class="lineNum">     516 </span><span class="lineNoCov">              0 :       }</span>
-<span class="lineNum">     517 </span>                :     };
-<span class="lineNum">     518 </span>                : 
-<span class="lineNum">     519 </span>                : 
-<span class="lineNum">     520 </span>                :   // [27.8.1.8] Template class basic_ofstream
-<span class="lineNum">     521 </span>                :   /**
-<span class="lineNum">     522 </span>                :    *  @brief  Controlling output for files.
-<span class="lineNum">     523 </span>                :    *
-<span class="lineNum">     524 </span>                :    *  This class supports reading from named files, using the inherited
-<span class="lineNum">     525 </span>                :    *  functions from std::basic_ostream.  To control the associated
-<span class="lineNum">     526 </span>                :    *  sequence, an instance of std::basic_filebuf is used, which this page
-<span class="lineNum">     527 </span>                :    *  refers to as @c sb.
-<span class="lineNum">     528 </span>                :   */
-<span class="lineNum">     529 </span>                :   template&lt;typename _CharT, typename _Traits&gt;
-<span class="lineNum">     530 </span>                :     class basic_ofstream : public basic_ostream&lt;_CharT,_Traits&gt;
-<span class="lineNum">     531 </span>                :     {
-<span class="lineNum">     532 </span>                :     public:
-<span class="lineNum">     533 </span>                :       // Types:
-<span class="lineNum">     534 </span>                :       typedef _CharT                                    char_type;
-<span class="lineNum">     535 </span>                :       typedef _Traits                                   traits_type;
-<span class="lineNum">     536 </span>                :       typedef typename traits_type::int_type            int_type;
-<span class="lineNum">     537 </span>                :       typedef typename traits_type::pos_type            pos_type;
-<span class="lineNum">     538 </span>                :       typedef typename traits_type::off_type            off_type;
-<span class="lineNum">     539 </span>                : 
-<span class="lineNum">     540 </span>                :       // Non-standard types:
-<span class="lineNum">     541 </span>                :       typedef basic_filebuf&lt;char_type, traits_type&gt;       __filebuf_type;
-<span class="lineNum">     542 </span>                :       typedef basic_ostream&lt;char_type, traits_type&gt;       __ostream_type;
-<span class="lineNum">     543 </span>                : 
-<span class="lineNum">     544 </span>                :     private:
-<span class="lineNum">     545 </span>                :       __filebuf_type    _M_filebuf;
-<span class="lineNum">     546 </span>                : 
-<span class="lineNum">     547 </span>                :     public:
-<span class="lineNum">     548 </span>                :       // Constructors:
-<span class="lineNum">     549 </span>                :       /**
-<span class="lineNum">     550 </span>                :        *  @brief  Default constructor.
-<span class="lineNum">     551 </span>                :        *
-<span class="lineNum">     552 </span>                :        *  Initializes @c sb using its default constructor, and passes
-<span class="lineNum">     553 </span>                :        *  @c &amp;sb to the base class initializer.  Does not open any files
-<span class="lineNum">     554 </span>                :        *  (you haven't given it a filename to open).
-<span class="lineNum">     555 </span>                :       */
-<span class="lineNum">     556 </span>                :       basic_ofstream(): __ostream_type(), _M_filebuf()
-<span class="lineNum">     557 </span>                :       { this-&gt;init(&amp;_M_filebuf); }
-<span class="lineNum">     558 </span>                : 
-<span class="lineNum">     559 </span>                :       /**
-<span class="lineNum">     560 </span>                :        *  @brief  Create an output file stream.
-<span class="lineNum">     561 </span>                :        *  @param  s  Null terminated string specifying the filename.
-<span class="lineNum">     562 </span>                :        *  @param  mode  Open file in specified mode (see std::ios_base).
-<span class="lineNum">     563 </span>                :        *
-<span class="lineNum">     564 </span>                :        *  @c ios_base::out|ios_base::trunc is automatically included in
-<span class="lineNum">     565 </span>                :        *  @a mode.
-<span class="lineNum">     566 </span>                :        *
-<span class="lineNum">     567 </span>                :        *  Tip:  When using std::string to hold the filename, you must use
-<span class="lineNum">     568 </span>                :        *  .c_str() before passing it to this constructor.
-<span class="lineNum">     569 </span>                :       */
-<span class="lineNum">     570 </span>                :       explicit
-<span class="lineNum">     571 </span>                :       basic_ofstream(const char* __s,
-<span class="lineNum">     572 </span><span class="lineNoCov">              0 :                      ios_base::openmode __mode = ios_base::out|ios_base::trunc)</span>
-<span class="lineNum">     573 </span><span class="lineNoCov">              0 :       : __ostream_type(), _M_filebuf()</span>
-<span class="lineNum">     574 </span>                :       {
-<span class="lineNum">     575 </span><span class="lineNoCov">              0 :         this-&gt;init(&amp;_M_filebuf);</span>
-<span class="lineNum">     576 </span><span class="lineNoCov">              0 :         this-&gt;open(__s, __mode);</span>
-<span class="lineNum">     577 </span><span class="lineNoCov">              0 :       }</span>
-<span class="lineNum">     578 </span>                : 
-<span class="lineNum">     579 </span>                :       /**
-<span class="lineNum">     580 </span>                :        *  @brief  The destructor does nothing.
-<span class="lineNum">     581 </span>                :        *
-<span class="lineNum">     582 </span>                :        *  The file is closed by the filebuf object, not the formatting
-<span class="lineNum">     583 </span>                :        *  stream.
-<span class="lineNum">     584 </span>                :       */
-<span class="lineNum">     585 </span><span class="lineNoCov">              0 :       ~basic_ofstream()</span>
-<span class="lineNum">     586 </span><span class="lineNoCov">              0 :       { }</span>
-<span class="lineNum">     587 </span>                : 
-<span class="lineNum">     588 </span>                :       // Members:
-<span class="lineNum">     589 </span>                :       /**
-<span class="lineNum">     590 </span>                :        *  @brief  Accessing the underlying buffer.
-<span class="lineNum">     591 </span>                :        *  @return  The current basic_filebuf buffer.
-<span class="lineNum">     592 </span>                :        *
-<span class="lineNum">     593 </span>                :        *  This hides both signatures of std::basic_ios::rdbuf().
-<span class="lineNum">     594 </span>                :       */
-<span class="lineNum">     595 </span>                :       __filebuf_type*
-<span class="lineNum">     596 </span>                :       rdbuf() const
-<span class="lineNum">     597 </span>                :       { return const_cast&lt;__filebuf_type*&gt;(&amp;_M_filebuf); }
-<span class="lineNum">     598 </span>                : 
-<span class="lineNum">     599 </span>                :       /**
-<span class="lineNum">     600 </span>                :        *  @brief  Wrapper to test for an open file.
-<span class="lineNum">     601 </span>                :        *  @return  @c rdbuf()-&gt;is_open()
-<span class="lineNum">     602 </span>                :       */
-<span class="lineNum">     603 </span>                :       bool
-<span class="lineNum">     604 </span><span class="lineNoCov">              0 :       is_open()</span>
-<span class="lineNum">     605 </span><span class="lineNoCov">              0 :       { return _M_filebuf.is_open(); }</span>
-<span class="lineNum">     606 </span>                : 
-<span class="lineNum">     607 </span>                :       // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     608 </span>                :       // 365. Lack of const-qualification in clause 27
-<span class="lineNum">     609 </span>                :       bool
-<span class="lineNum">     610 </span>                :       is_open() const
-<span class="lineNum">     611 </span>                :       { return _M_filebuf.is_open(); }
-<span class="lineNum">     612 </span>                : 
-<span class="lineNum">     613 </span>                :       /**
-<span class="lineNum">     614 </span>                :        *  @brief  Opens an external file.
-<span class="lineNum">     615 </span>                :        *  @param  s  The name of the file.
-<span class="lineNum">     616 </span>                :        *  @param  mode  The open mode flags.
-<span class="lineNum">     617 </span>                :        *
-<span class="lineNum">     618 </span>                :        *  Calls @c std::basic_filebuf::open(s,mode|out|trunc).  If that
-<span class="lineNum">     619 </span>                :        *  function fails, @c failbit is set in the stream's error state.
-<span class="lineNum">     620 </span>                :        *
-<span class="lineNum">     621 </span>                :        *  Tip:  When using std::string to hold the filename, you must use
-<span class="lineNum">     622 </span>                :        *  .c_str() before passing it to this constructor.
-<span class="lineNum">     623 </span>                :       */
-<span class="lineNum">     624 </span>                :       void
-<span class="lineNum">     625 </span>                :       open(const char* __s,
-<span class="lineNum">     626 </span><span class="lineNoCov">              0 :            ios_base::openmode __mode = ios_base::out | ios_base::trunc)</span>
-<span class="lineNum">     627 </span>                :       {
-<span class="lineNum">     628 </span><span class="lineNoCov">              0 :         if (!_M_filebuf.open(__s, __mode | ios_base::out))</span>
-<span class="lineNum">     629 </span><span class="lineNoCov">              0 :           this-&gt;setstate(ios_base::failbit);</span>
-<span class="lineNum">     630 </span>                :         else
-<span class="lineNum">     631 </span>                :           // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     632 </span>                :           // 409. Closing an fstream should clear error state
-<span class="lineNum">     633 </span><span class="lineNoCov">              0 :           this-&gt;clear();</span>
-<span class="lineNum">     634 </span><span class="lineNoCov">              0 :       }</span>
-<span class="lineNum">     635 </span>                : 
-<span class="lineNum">     636 </span>                :       /**
-<span class="lineNum">     637 </span>                :        *  @brief  Close the file.
-<span class="lineNum">     638 </span>                :        *
-<span class="lineNum">     639 </span>                :        *  Calls @c std::basic_filebuf::close().  If that function
-<span class="lineNum">     640 </span>                :        *  fails, @c failbit is set in the stream's error state.
-<span class="lineNum">     641 </span>                :       */
-<span class="lineNum">     642 </span>                :       void
-<span class="lineNum">     643 </span>                :       close()
-<span class="lineNum">     644 </span>                :       {
-<span class="lineNum">     645 </span>                :         if (!_M_filebuf.close())
-<span class="lineNum">     646 </span>                :           this-&gt;setstate(ios_base::failbit);
-<span class="lineNum">     647 </span>                :       }
-<span class="lineNum">     648 </span>                :     };
-<span class="lineNum">     649 </span>                : 
-<span class="lineNum">     650 </span>                : 
-<span class="lineNum">     651 </span>                :   // [27.8.1.11] Template class basic_fstream
-<span class="lineNum">     652 </span>                :   /**
-<span class="lineNum">     653 </span>                :    *  @brief  Controlling input and output for files.
-<span class="lineNum">     654 </span>                :    *
-<span class="lineNum">     655 </span>                :    *  This class supports reading from and writing to named files, using
-<span class="lineNum">     656 </span>                :    *  the inherited functions from std::basic_iostream.  To control the
-<span class="lineNum">     657 </span>                :    *  associated sequence, an instance of std::basic_filebuf is used, which
-<span class="lineNum">     658 </span>                :    *  this page refers to as @c sb.
-<span class="lineNum">     659 </span>                :   */
-<span class="lineNum">     660 </span>                :   template&lt;typename _CharT, typename _Traits&gt;
-<span class="lineNum">     661 </span>                :     class basic_fstream : public basic_iostream&lt;_CharT, _Traits&gt;
-<span class="lineNum">     662 </span>                :     {
-<span class="lineNum">     663 </span>                :     public:
-<span class="lineNum">     664 </span>                :       // Types:
-<span class="lineNum">     665 </span>                :       typedef _CharT                                    char_type;
-<span class="lineNum">     666 </span>                :       typedef _Traits                                   traits_type;
-<span class="lineNum">     667 </span>                :       typedef typename traits_type::int_type            int_type;
-<span class="lineNum">     668 </span>                :       typedef typename traits_type::pos_type            pos_type;
-<span class="lineNum">     669 </span>                :       typedef typename traits_type::off_type            off_type;
-<span class="lineNum">     670 </span>                : 
-<span class="lineNum">     671 </span>                :       // Non-standard types:
-<span class="lineNum">     672 </span>                :       typedef basic_filebuf&lt;char_type, traits_type&gt;       __filebuf_type;
-<span class="lineNum">     673 </span>                :       typedef basic_ios&lt;char_type, traits_type&gt;           __ios_type;
-<span class="lineNum">     674 </span>                :       typedef basic_iostream&lt;char_type, traits_type&gt;      __iostream_type;
-<span class="lineNum">     675 </span>                : 
-<span class="lineNum">     676 </span>                :     private:
-<span class="lineNum">     677 </span>                :       __filebuf_type    _M_filebuf;
-<span class="lineNum">     678 </span>                : 
-<span class="lineNum">     679 </span>                :     public:
-<span class="lineNum">     680 </span>                :       // Constructors/destructor:
-<span class="lineNum">     681 </span>                :       /**
-<span class="lineNum">     682 </span>                :        *  @brief  Default constructor.
-<span class="lineNum">     683 </span>                :        *
-<span class="lineNum">     684 </span>                :        *  Initializes @c sb using its default constructor, and passes
-<span class="lineNum">     685 </span>                :        *  @c &amp;sb to the base class initializer.  Does not open any files
-<span class="lineNum">     686 </span>                :        *  (you haven't given it a filename to open).
-<span class="lineNum">     687 </span>                :       */
-<span class="lineNum">     688 </span>                :       basic_fstream()
-<span class="lineNum">     689 </span>                :       : __iostream_type(), _M_filebuf()
-<span class="lineNum">     690 </span>                :       { this-&gt;init(&amp;_M_filebuf); }
-<span class="lineNum">     691 </span>                : 
-<span class="lineNum">     692 </span>                :       /**
-<span class="lineNum">     693 </span>                :        *  @brief  Create an input/output file stream.
-<span class="lineNum">     694 </span>                :        *  @param  s  Null terminated string specifying the filename.
-<span class="lineNum">     695 </span>                :        *  @param  mode  Open file in specified mode (see std::ios_base).
-<span class="lineNum">     696 </span>                :        *
-<span class="lineNum">     697 </span>                :        *  Tip:  When using std::string to hold the filename, you must use
-<span class="lineNum">     698 </span>                :        *  .c_str() before passing it to this constructor.
-<span class="lineNum">     699 </span>                :       */
-<span class="lineNum">     700 </span>                :       explicit
-<span class="lineNum">     701 </span>                :       basic_fstream(const char* __s,
-<span class="lineNum">     702 </span>                :                     ios_base::openmode __mode = ios_base::in | ios_base::out)
-<span class="lineNum">     703 </span>                :       : __iostream_type(NULL), _M_filebuf()
-<span class="lineNum">     704 </span>                :       {
-<span class="lineNum">     705 </span>                :         this-&gt;init(&amp;_M_filebuf);
-<span class="lineNum">     706 </span>                :         this-&gt;open(__s, __mode);
-<span class="lineNum">     707 </span>                :       }
-<span class="lineNum">     708 </span>                : 
-<span class="lineNum">     709 </span>                :       /**
-<span class="lineNum">     710 </span>                :        *  @brief  The destructor does nothing.
-<span class="lineNum">     711 </span>                :        *
-<span class="lineNum">     712 </span>                :        *  The file is closed by the filebuf object, not the formatting
-<span class="lineNum">     713 </span>                :        *  stream.
-<span class="lineNum">     714 </span>                :       */
-<span class="lineNum">     715 </span>                :       ~basic_fstream()
-<span class="lineNum">     716 </span>                :       { }
-<span class="lineNum">     717 </span>                : 
-<span class="lineNum">     718 </span>                :       // Members:
-<span class="lineNum">     719 </span>                :       /**
-<span class="lineNum">     720 </span>                :        *  @brief  Accessing the underlying buffer.
-<span class="lineNum">     721 </span>                :        *  @return  The current basic_filebuf buffer.
-<span class="lineNum">     722 </span>                :        *
-<span class="lineNum">     723 </span>                :        *  This hides both signatures of std::basic_ios::rdbuf().
-<span class="lineNum">     724 </span>                :       */
-<span class="lineNum">     725 </span>                :       __filebuf_type*
-<span class="lineNum">     726 </span>                :       rdbuf() const
-<span class="lineNum">     727 </span>                :       { return const_cast&lt;__filebuf_type*&gt;(&amp;_M_filebuf); }
-<span class="lineNum">     728 </span>                : 
-<span class="lineNum">     729 </span>                :       /**
-<span class="lineNum">     730 </span>                :        *  @brief  Wrapper to test for an open file.
-<span class="lineNum">     731 </span>                :        *  @return  @c rdbuf()-&gt;is_open()
-<span class="lineNum">     732 </span>                :       */
-<span class="lineNum">     733 </span>                :       bool
-<span class="lineNum">     734 </span>                :       is_open()
-<span class="lineNum">     735 </span>                :       { return _M_filebuf.is_open(); }
-<span class="lineNum">     736 </span>                : 
-<span class="lineNum">     737 </span>                :       // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     738 </span>                :       // 365. Lack of const-qualification in clause 27
-<span class="lineNum">     739 </span>                :       bool
-<span class="lineNum">     740 </span>                :       is_open() const
-<span class="lineNum">     741 </span>                :       { return _M_filebuf.is_open(); }
-<span class="lineNum">     742 </span>                : 
-<span class="lineNum">     743 </span>                :       /**
-<span class="lineNum">     744 </span>                :        *  @brief  Opens an external file.
-<span class="lineNum">     745 </span>                :        *  @param  s  The name of the file.
-<span class="lineNum">     746 </span>                :        *  @param  mode  The open mode flags.
-<span class="lineNum">     747 </span>                :        *
-<span class="lineNum">     748 </span>                :        *  Calls @c std::basic_filebuf::open(s,mode).  If that
-<span class="lineNum">     749 </span>                :        *  function fails, @c failbit is set in the stream's error state.
-<span class="lineNum">     750 </span>                :        *
-<span class="lineNum">     751 </span>                :        *  Tip:  When using std::string to hold the filename, you must use
-<span class="lineNum">     752 </span>                :        *  .c_str() before passing it to this constructor.
-<span class="lineNum">     753 </span>                :       */
-<span class="lineNum">     754 </span>                :       void
-<span class="lineNum">     755 </span>                :       open(const char* __s,
-<span class="lineNum">     756 </span>                :            ios_base::openmode __mode = ios_base::in | ios_base::out)
-<span class="lineNum">     757 </span>                :       {
-<span class="lineNum">     758 </span>                :         if (!_M_filebuf.open(__s, __mode))
-<span class="lineNum">     759 </span>                :           this-&gt;setstate(ios_base::failbit);
-<span class="lineNum">     760 </span>                :         else
-<span class="lineNum">     761 </span>                :           // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     762 </span>                :           // 409. Closing an fstream should clear error state
-<span class="lineNum">     763 </span>                :           this-&gt;clear();
-<span class="lineNum">     764 </span>                :       }
-<span class="lineNum">     765 </span>                : 
-<span class="lineNum">     766 </span>                :       /**
-<span class="lineNum">     767 </span>                :        *  @brief  Close the file.
-<span class="lineNum">     768 </span>                :        *
-<span class="lineNum">     769 </span>                :        *  Calls @c std::basic_filebuf::close().  If that function
-<span class="lineNum">     770 </span>                :        *  fails, @c failbit is set in the stream's error state.
-<span class="lineNum">     771 </span>                :       */
-<span class="lineNum">     772 </span>                :       void
-<span class="lineNum">     773 </span>                :       close()
-<span class="lineNum">     774 </span>                :       {
-<span class="lineNum">     775 </span>                :         if (!_M_filebuf.close())
-<span class="lineNum">     776 </span>                :           this-&gt;setstate(ios_base::failbit);
-<span class="lineNum">     777 </span>                :       }
-<span class="lineNum">     778 </span>                :     };
-<span class="lineNum">     779 </span>                : 
-<span class="lineNum">     780 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">     781 </span>                : 
-<span class="lineNum">     782 </span>                : #ifndef _GLIBCXX_EXPORT_TEMPLATE
-<span class="lineNum">     783 </span>                : # include &lt;bits/fstream.tcc&gt;
-<span class="lineNum">     784 </span>                : #endif
-<span class="lineNum">     785 </span>                : 
-<span class="lineNum">     786 </span>                : #endif /* _GLIBCXX_FSTREAM */
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h.gcov.html b/rep/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h.gcov.html
deleted file mode 100644
index 5529fc3..0000000
--- a/rep/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h.gcov.html
+++ /dev/null
@@ -1,837 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/i486-linux-gnu/bits</a> - gthr-default.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">2</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">0.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">0</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /* Threads compatibility routines for libgcc2 and libobjc.  */
-<span class="lineNum">       2 </span>                : /* Compile this one with gcc.  */
-<span class="lineNum">       3 </span>                : /* Copyright (C) 1997, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007
-<span class="lineNum">       4 </span>                :    Free Software Foundation, Inc.
-<span class="lineNum">       5 </span>                : 
-<span class="lineNum">       6 </span>                : This file is part of GCC.
-<span class="lineNum">       7 </span>                : 
-<span class="lineNum">       8 </span>                : GCC is free software; you can redistribute it and/or modify it under
-<span class="lineNum">       9 </span>                : the terms of the GNU General Public License as published by the Free
-<span class="lineNum">      10 </span>                : Software Foundation; either version 2, or (at your option) any later
-<span class="lineNum">      11 </span>                : version.
-<span class="lineNum">      12 </span>                : 
-<span class="lineNum">      13 </span>                : GCC is distributed in the hope that it will be useful, but WITHOUT ANY
-<span class="lineNum">      14 </span>                : WARRANTY; without even the implied warranty of MERCHANTABILITY or
-<span class="lineNum">      15 </span>                : FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-<span class="lineNum">      16 </span>                : for more details.
-<span class="lineNum">      17 </span>                : 
-<span class="lineNum">      18 </span>                : You should have received a copy of the GNU General Public License
-<span class="lineNum">      19 </span>                : along with GCC; see the file COPYING.  If not, write to the Free
-<span class="lineNum">      20 </span>                : Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
-<span class="lineNum">      21 </span>                : 02110-1301, USA.  */
-<span class="lineNum">      22 </span>                : 
-<span class="lineNum">      23 </span>                : /* As a special exception, if you link this library with other files,
-<span class="lineNum">      24 </span>                :    some of which are compiled with GCC, to produce an executable,
-<span class="lineNum">      25 </span>                :    this library does not by itself cause the resulting executable
-<span class="lineNum">      26 </span>                :    to be covered by the GNU General Public License.
-<span class="lineNum">      27 </span>                :    This exception does not however invalidate any other reasons why
-<span class="lineNum">      28 </span>                :    the executable file might be covered by the GNU General Public License.  */
-<span class="lineNum">      29 </span>                : 
-<span class="lineNum">      30 </span>                : #ifndef _GLIBCXX_GCC_GTHR_POSIX_H
-<span class="lineNum">      31 </span>                : #define _GLIBCXX_GCC_GTHR_POSIX_H
-<span class="lineNum">      32 </span>                : 
-<span class="lineNum">      33 </span>                : /* POSIX threads specific definitions.
-<span class="lineNum">      34 </span>                :    Easy, since the interface is just one-to-one mapping.  */
-<span class="lineNum">      35 </span>                : 
-<span class="lineNum">      36 </span>                : #define __GTHREADS 1
-<span class="lineNum">      37 </span>                : 
-<span class="lineNum">      38 </span>                : /* Some implementations of &lt;pthread.h&gt; require this to be defined.  */
-<span class="lineNum">      39 </span>                : #if !defined(_REENTRANT) &amp;&amp; defined(__osf__)
-<span class="lineNum">      40 </span>                : #define _REENTRANT 1
-<span class="lineNum">      41 </span>                : #endif
-<span class="lineNum">      42 </span>                : 
-<span class="lineNum">      43 </span>                : #include &lt;pthread.h&gt;
-<span class="lineNum">      44 </span>                : #include &lt;unistd.h&gt;
-<span class="lineNum">      45 </span>                : 
-<span class="lineNum">      46 </span>                : typedef pthread_key_t __gthread_key_t;
-<span class="lineNum">      47 </span>                : typedef pthread_once_t __gthread_once_t;
-<span class="lineNum">      48 </span>                : typedef pthread_mutex_t __gthread_mutex_t;
-<span class="lineNum">      49 </span>                : typedef pthread_mutex_t __gthread_recursive_mutex_t;
-<span class="lineNum">      50 </span>                : typedef pthread_cond_t __gthread_cond_t;
-<span class="lineNum">      51 </span>                : 
-<span class="lineNum">      52 </span>                : /* POSIX like conditional variables are supported.  Please look at comments
-<span class="lineNum">      53 </span>                :    in gthr.h for details. */
-<span class="lineNum">      54 </span>                : #define __GTHREAD_HAS_COND      1       
-<span class="lineNum">      55 </span>                : 
-<span class="lineNum">      56 </span>                : #define __GTHREAD_MUTEX_INIT PTHREAD_MUTEX_INITIALIZER
-<span class="lineNum">      57 </span>                : #define __GTHREAD_ONCE_INIT PTHREAD_ONCE_INIT
-<span class="lineNum">      58 </span>                : #if defined(PTHREAD_RECURSIVE_MUTEX_INITIALIZER)
-<span class="lineNum">      59 </span>                : #define __GTHREAD_RECURSIVE_MUTEX_INIT PTHREAD_RECURSIVE_MUTEX_INITIALIZER
-<span class="lineNum">      60 </span>                : #elif defined(PTHREAD_RECURSIVE_MUTEX_INITIALIZER_NP)
-<span class="lineNum">      61 </span>                : #define __GTHREAD_RECURSIVE_MUTEX_INIT PTHREAD_RECURSIVE_MUTEX_INITIALIZER_NP
-<span class="lineNum">      62 </span>                : #else
-<span class="lineNum">      63 </span>                : #define __GTHREAD_RECURSIVE_MUTEX_INIT_FUNCTION __gthread_recursive_mutex_init_function
-<span class="lineNum">      64 </span>                : #endif
-<span class="lineNum">      65 </span>                : #define __GTHREAD_COND_INIT PTHREAD_COND_INITIALIZER
-<span class="lineNum">      66 </span>                : 
-<span class="lineNum">      67 </span>                : #if __GXX_WEAK__ &amp;&amp; _GLIBCXX_GTHREAD_USE_WEAK
-<span class="lineNum">      68 </span>                : # ifndef __gthrw_pragma
-<span class="lineNum">      69 </span>                : #  define __gthrw_pragma(pragma)
-<span class="lineNum">      70 </span>                : # endif
-<span class="lineNum">      71 </span>                : # define __gthrw2(name,name2,type) \
-<span class="lineNum">      72 </span>                :   static __typeof(type) name __attribute__ ((__weakref__(#name2))); \
-<span class="lineNum">      73 </span>                :   __gthrw_pragma(weak type)
-<span class="lineNum">      74 </span>                : # define __gthrw_(name) __gthrw_ ## name
-<span class="lineNum">      75 </span>                : #else
-<span class="lineNum">      76 </span>                : # define __gthrw2(name,name2,type)
-<span class="lineNum">      77 </span>                : # define __gthrw_(name) name
-<span class="lineNum">      78 </span>                : #endif
-<span class="lineNum">      79 </span>                : 
-<span class="lineNum">      80 </span>                : /* Typically, __gthrw_foo is a weak reference to symbol foo.  */
-<span class="lineNum">      81 </span>                : #define __gthrw(name) __gthrw2(__gthrw_ ## name,name,name)
-<span class="lineNum">      82 </span>                : 
-<span class="lineNum">      83 </span>                : /* On Tru64, /usr/include/pthread.h uses #pragma extern_prefix &quot;__&quot; to
-<span class="lineNum">      84 </span>                :    map a subset of the POSIX pthread API to mangled versions of their
-<span class="lineNum">      85 </span>                :    names.  */
-<span class="lineNum">      86 </span>                : #if defined(__osf__) &amp;&amp; defined(_PTHREAD_USE_MANGLED_NAMES_)
-<span class="lineNum">      87 </span>                : #define __gthrw3(name) __gthrw2(__gthrw_ ## name, __ ## name, name)
-<span class="lineNum">      88 </span>                : __gthrw3(pthread_once)
-<span class="lineNum">      89 </span>                : __gthrw3(pthread_getspecific)
-<span class="lineNum">      90 </span>                : __gthrw3(pthread_setspecific)
-<span class="lineNum">      91 </span>                : __gthrw3(pthread_create)
-<span class="lineNum">      92 </span>                : __gthrw3(pthread_cancel)
-<span class="lineNum">      93 </span>                : __gthrw3(pthread_mutex_lock)
-<span class="lineNum">      94 </span>                : __gthrw3(pthread_mutex_trylock)
-<span class="lineNum">      95 </span>                : __gthrw3(pthread_mutex_unlock)
-<span class="lineNum">      96 </span>                : __gthrw3(pthread_mutex_init)
-<span class="lineNum">      97 </span>                : __gthrw3(pthread_cond_broadcast)
-<span class="lineNum">      98 </span>                : __gthrw3(pthread_cond_wait)
-<span class="lineNum">      99 </span>                : #else
-<span class="lineNum">     100 </span>                : __gthrw(pthread_once)
-<span class="lineNum">     101 </span>                : __gthrw(pthread_getspecific)
-<span class="lineNum">     102 </span>                : __gthrw(pthread_setspecific)
-<span class="lineNum">     103 </span>                : __gthrw(pthread_create)
-<span class="lineNum">     104 </span>                : __gthrw(pthread_cancel)
-<span class="lineNum">     105 </span>                : __gthrw(pthread_mutex_lock)
-<span class="lineNum">     106 </span>                : __gthrw(pthread_mutex_trylock)
-<span class="lineNum">     107 </span>                : __gthrw(pthread_mutex_unlock)
-<span class="lineNum">     108 </span>                : __gthrw(pthread_mutex_init)
-<span class="lineNum">     109 </span>                : __gthrw(pthread_cond_broadcast)
-<span class="lineNum">     110 </span>                : __gthrw(pthread_cond_wait)
-<span class="lineNum">     111 </span>                : #endif
-<span class="lineNum">     112 </span>                : 
-<span class="lineNum">     113 </span>                : __gthrw(pthread_key_create)
-<span class="lineNum">     114 </span>                : __gthrw(pthread_key_delete)
-<span class="lineNum">     115 </span>                : __gthrw(pthread_mutexattr_init)
-<span class="lineNum">     116 </span>                : __gthrw(pthread_mutexattr_settype)
-<span class="lineNum">     117 </span>                : __gthrw(pthread_mutexattr_destroy)
-<span class="lineNum">     118 </span>                : 
-<span class="lineNum">     119 </span>                : 
-<span class="lineNum">     120 </span>                : #if defined(_LIBOBJC) || defined(_LIBOBJC_WEAK)
-<span class="lineNum">     121 </span>                : /* Objective-C.  */
-<span class="lineNum">     122 </span>                : #if defined(__osf__) &amp;&amp; defined(_PTHREAD_USE_MANGLED_NAMES_)
-<span class="lineNum">     123 </span>                : __gthrw3(pthread_cond_destroy)
-<span class="lineNum">     124 </span>                : __gthrw3(pthread_cond_init)
-<span class="lineNum">     125 </span>                : __gthrw3(pthread_cond_signal)
-<span class="lineNum">     126 </span>                : __gthrw3(pthread_exit)
-<span class="lineNum">     127 </span>                : __gthrw3(pthread_mutex_destroy)
-<span class="lineNum">     128 </span>                : __gthrw3(pthread_self)
-<span class="lineNum">     129 </span>                : #else
-<span class="lineNum">     130 </span>                : __gthrw(pthread_cond_destroy)
-<span class="lineNum">     131 </span>                : __gthrw(pthread_cond_init)
-<span class="lineNum">     132 </span>                : __gthrw(pthread_cond_signal)
-<span class="lineNum">     133 </span>                : __gthrw(pthread_exit)
-<span class="lineNum">     134 </span>                : __gthrw(pthread_mutex_destroy)
-<span class="lineNum">     135 </span>                : __gthrw(pthread_self)
-<span class="lineNum">     136 </span>                : #endif /* __osf__ &amp;&amp; _PTHREAD_USE_MANGLED_NAMES_ */
-<span class="lineNum">     137 </span>                : #ifdef _POSIX_PRIORITY_SCHEDULING
-<span class="lineNum">     138 </span>                : #ifdef _POSIX_THREAD_PRIORITY_SCHEDULING
-<span class="lineNum">     139 </span>                : __gthrw(sched_get_priority_max)
-<span class="lineNum">     140 </span>                : __gthrw(sched_get_priority_min)
-<span class="lineNum">     141 </span>                : #endif /* _POSIX_THREAD_PRIORITY_SCHEDULING */
-<span class="lineNum">     142 </span>                : #endif /* _POSIX_PRIORITY_SCHEDULING */
-<span class="lineNum">     143 </span>                : __gthrw(sched_yield)
-<span class="lineNum">     144 </span>                : __gthrw(pthread_attr_destroy)
-<span class="lineNum">     145 </span>                : __gthrw(pthread_attr_init)
-<span class="lineNum">     146 </span>                : __gthrw(pthread_attr_setdetachstate)
-<span class="lineNum">     147 </span>                : #ifdef _POSIX_THREAD_PRIORITY_SCHEDULING
-<span class="lineNum">     148 </span>                : __gthrw(pthread_getschedparam)
-<span class="lineNum">     149 </span>                : __gthrw(pthread_setschedparam)
-<span class="lineNum">     150 </span>                : #endif /* _POSIX_THREAD_PRIORITY_SCHEDULING */
-<span class="lineNum">     151 </span>                : #endif /* _LIBOBJC || _LIBOBJC_WEAK */
-<span class="lineNum">     152 </span>                : 
-<span class="lineNum">     153 </span>                : #if __GXX_WEAK__ &amp;&amp; _GLIBCXX_GTHREAD_USE_WEAK
-<span class="lineNum">     154 </span>                : 
-<span class="lineNum">     155 </span>                : /* On Solaris 2.6 up to 9, the libc exposes a POSIX threads interface even if
-<span class="lineNum">     156 </span>                :    -pthreads is not specified.  The functions are dummies and most return an
-<span class="lineNum">     157 </span>                :    error value.  However pthread_once returns 0 without invoking the routine
-<span class="lineNum">     158 </span>                :    it is passed so we cannot pretend that the interface is active if -pthreads
-<span class="lineNum">     159 </span>                :    is not specified.  On Solaris 2.5.1, the interface is not exposed at all so
-<span class="lineNum">     160 </span>                :    we need to play the usual game with weak symbols.  On Solaris 10 and up, a
-<span class="lineNum">     161 </span>                :    working interface is always exposed.  On FreeBSD 6 and later, libc also
-<span class="lineNum">     162 </span>                :    exposes a dummy POSIX threads interface, similar to what Solaris 2.6 up
-<span class="lineNum">     163 </span>                :    to 9 does.  FreeBSD &gt;= 700014 even provides a pthread_cancel stub in libc,
-<span class="lineNum">     164 </span>                :    which means the alternate __gthread_active_p below cannot be used there.  */
-<span class="lineNum">     165 </span>                : 
-<span class="lineNum">     166 </span>                : #if defined(__FreeBSD__) || (defined(__sun) &amp;&amp; defined(__svr4__))
-<span class="lineNum">     167 </span>                : 
-<span class="lineNum">     168 </span>                : static volatile int __gthread_active = -1;
-<span class="lineNum">     169 </span>                : 
-<span class="lineNum">     170 </span>                : static void
-<span class="lineNum">     171 </span>                : __gthread_trigger (void)
-<span class="lineNum">     172 </span>                : {
-<span class="lineNum">     173 </span>                :   __gthread_active = 1;
-<span class="lineNum">     174 </span>                : }
-<span class="lineNum">     175 </span>                : 
-<span class="lineNum">     176 </span>                : static inline int
-<span class="lineNum">     177 </span>                : __gthread_active_p (void)
-<span class="lineNum">     178 </span>                : {
-<span class="lineNum">     179 </span>                :   static pthread_mutex_t __gthread_active_mutex = PTHREAD_MUTEX_INITIALIZER;
-<span class="lineNum">     180 </span>                :   static pthread_once_t __gthread_active_once = PTHREAD_ONCE_INIT;
-<span class="lineNum">     181 </span>                : 
-<span class="lineNum">     182 </span>                :   /* Avoid reading __gthread_active twice on the main code path.  */
-<span class="lineNum">     183 </span>                :   int __gthread_active_latest_value = __gthread_active;
-<span class="lineNum">     184 </span>                : 
-<span class="lineNum">     185 </span>                :   /* This test is not protected to avoid taking a lock on the main code
-<span class="lineNum">     186 </span>                :      path so every update of __gthread_active in a threaded program must
-<span class="lineNum">     187 </span>                :      be atomic with regard to the result of the test.  */
-<span class="lineNum">     188 </span>                :   if (__builtin_expect (__gthread_active_latest_value &lt; 0, 0))
-<span class="lineNum">     189 </span>                :     {
-<span class="lineNum">     190 </span>                :       if (__gthrw_(pthread_once))
-<span class="lineNum">     191 </span>                :         {
-<span class="lineNum">     192 </span>                :           /* If this really is a threaded program, then we must ensure that
-<span class="lineNum">     193 </span>                :              __gthread_active has been set to 1 before exiting this block.  */
-<span class="lineNum">     194 </span>                :           __gthrw_(pthread_mutex_lock) (&amp;__gthread_active_mutex);
-<span class="lineNum">     195 </span>                :           __gthrw_(pthread_once) (&amp;__gthread_active_once, __gthread_trigger);
-<span class="lineNum">     196 </span>                :           __gthrw_(pthread_mutex_unlock) (&amp;__gthread_active_mutex);
-<span class="lineNum">     197 </span>                :         }
-<span class="lineNum">     198 </span>                : 
-<span class="lineNum">     199 </span>                :       /* Make sure we'll never enter this block again.  */
-<span class="lineNum">     200 </span>                :       if (__gthread_active &lt; 0)
-<span class="lineNum">     201 </span>                :         __gthread_active = 0;
-<span class="lineNum">     202 </span>                : 
-<span class="lineNum">     203 </span>                :       __gthread_active_latest_value = __gthread_active;
-<span class="lineNum">     204 </span>                :     }
-<span class="lineNum">     205 </span>                : 
-<span class="lineNum">     206 </span>                :   return __gthread_active_latest_value != 0;
-<span class="lineNum">     207 </span>                : }
-<span class="lineNum">     208 </span>                : 
-<span class="lineNum">     209 </span>                : #else /* neither FreeBSD nor Solaris */
-<span class="lineNum">     210 </span>                : 
-<span class="lineNum">     211 </span>                : static inline int
-<span class="lineNum">     212 </span><span class="lineNoCov">              0 : __gthread_active_p (void)</span>
-<span class="lineNum">     213 </span>                : {
-<span class="lineNum">     214 </span>                :   static void *const __gthread_active_ptr 
-<span class="lineNum">     215 </span>                :     = __extension__ (void *) &amp;__gthrw_(pthread_cancel);
-<span class="lineNum">     216 </span><span class="lineNoCov">              0 :   return __gthread_active_ptr != 0;</span>
-<span class="lineNum">     217 </span>                : }
-<span class="lineNum">     218 </span>                : 
-<span class="lineNum">     219 </span>                : #endif /* FreeBSD or Solaris */
-<span class="lineNum">     220 </span>                : 
-<span class="lineNum">     221 </span>                : #else /* not __GXX_WEAK__ */
-<span class="lineNum">     222 </span>                : 
-<span class="lineNum">     223 </span>                : /* Similar to Solaris, HP-UX 11 for PA-RISC provides stubs for pthread
-<span class="lineNum">     224 </span>                :    calls in shared flavors of the HP-UX C library.  Most of the stubs
-<span class="lineNum">     225 </span>                :    have no functionality.  The details are described in the &quot;libc cumulative
-<span class="lineNum">     226 </span>                :    patch&quot; for each subversion of HP-UX 11.  There are two special interfaces
-<span class="lineNum">     227 </span>                :    provided for checking whether an application is linked to a pthread
-<span class="lineNum">     228 </span>                :    library or not.  However, these interfaces aren't available in early
-<span class="lineNum">     229 </span>                :    libc versions.  We also can't use pthread_once as some libc versions
-<span class="lineNum">     230 </span>                :    call the init function.  So, we use pthread_create to check whether it
-<span class="lineNum">     231 </span>                :    is possible to create a thread or not.  The stub implementation returns
-<span class="lineNum">     232 </span>                :    the error number ENOSYS.  */
-<span class="lineNum">     233 </span>                : 
-<span class="lineNum">     234 </span>                : #if defined(__hppa__) &amp;&amp; defined(__hpux__)
-<span class="lineNum">     235 </span>                : 
-<span class="lineNum">     236 </span>                : #include &lt;errno.h&gt;
-<span class="lineNum">     237 </span>                : 
-<span class="lineNum">     238 </span>                : static volatile int __gthread_active = -1;
-<span class="lineNum">     239 </span>                : 
-<span class="lineNum">     240 </span>                : static void *
-<span class="lineNum">     241 </span>                : __gthread_start (void *arg __attribute__((unused)))
-<span class="lineNum">     242 </span>                : {
-<span class="lineNum">     243 </span>                :   return NULL;
-<span class="lineNum">     244 </span>                : }
-<span class="lineNum">     245 </span>                : 
-<span class="lineNum">     246 </span>                : static void __gthread_active_init (void) __attribute__((noinline));
-<span class="lineNum">     247 </span>                : static void
-<span class="lineNum">     248 </span>                : __gthread_active_init (void)
-<span class="lineNum">     249 </span>                : {
-<span class="lineNum">     250 </span>                :   static pthread_mutex_t __gthread_active_mutex = PTHREAD_MUTEX_INITIALIZER;
-<span class="lineNum">     251 </span>                :   pthread_t t;
-<span class="lineNum">     252 </span>                :   pthread_attr_t a;
-<span class="lineNum">     253 </span>                :   int result;
-<span class="lineNum">     254 </span>                : 
-<span class="lineNum">     255 </span>                :   __gthrw_(pthread_mutex_lock) (&amp;__gthread_active_mutex);
-<span class="lineNum">     256 </span>                :   if (__gthread_active &lt; 0)
-<span class="lineNum">     257 </span>                :     {
-<span class="lineNum">     258 </span>                :       __gthrw_(pthread_attr_init) (&amp;a);
-<span class="lineNum">     259 </span>                :       __gthrw_(pthread_attr_setdetachstate) (&amp;a, PTHREAD_CREATE_DETACHED);
-<span class="lineNum">     260 </span>                :       result = __gthrw_(pthread_create) (&amp;t, &amp;a, __gthread_start, NULL);
-<span class="lineNum">     261 </span>                :       if (result != ENOSYS)
-<span class="lineNum">     262 </span>                :         __gthread_active = 1;
-<span class="lineNum">     263 </span>                :       else
-<span class="lineNum">     264 </span>                :         __gthread_active = 0;
-<span class="lineNum">     265 </span>                :       __gthrw_(pthread_attr_destroy) (&amp;a);
-<span class="lineNum">     266 </span>                :     }
-<span class="lineNum">     267 </span>                :   __gthrw_(pthread_mutex_unlock) (&amp;__gthread_active_mutex);
-<span class="lineNum">     268 </span>                : }
-<span class="lineNum">     269 </span>                : 
-<span class="lineNum">     270 </span>                : static inline int
-<span class="lineNum">     271 </span>                : __gthread_active_p (void)
-<span class="lineNum">     272 </span>                : {
-<span class="lineNum">     273 </span>                :   /* Avoid reading __gthread_active twice on the main code path.  */
-<span class="lineNum">     274 </span>                :   int __gthread_active_latest_value = __gthread_active;
-<span class="lineNum">     275 </span>                : 
-<span class="lineNum">     276 </span>                :   /* This test is not protected to avoid taking a lock on the main code
-<span class="lineNum">     277 </span>                :      path so every update of __gthread_active in a threaded program must
-<span class="lineNum">     278 </span>                :      be atomic with regard to the result of the test.  */
-<span class="lineNum">     279 </span>                :   if (__builtin_expect (__gthread_active_latest_value &lt; 0, 0))
-<span class="lineNum">     280 </span>                :     {
-<span class="lineNum">     281 </span>                :       __gthread_active_init ();
-<span class="lineNum">     282 </span>                :       __gthread_active_latest_value = __gthread_active;
-<span class="lineNum">     283 </span>                :     }
-<span class="lineNum">     284 </span>                : 
-<span class="lineNum">     285 </span>                :   return __gthread_active_latest_value != 0;
-<span class="lineNum">     286 </span>                : }
-<span class="lineNum">     287 </span>                : 
-<span class="lineNum">     288 </span>                : #else /* not hppa-hpux */
-<span class="lineNum">     289 </span>                : 
-<span class="lineNum">     290 </span>                : static inline int
-<span class="lineNum">     291 </span>                : __gthread_active_p (void)
-<span class="lineNum">     292 </span>                : {
-<span class="lineNum">     293 </span>                :   return 1;
-<span class="lineNum">     294 </span>                : }
-<span class="lineNum">     295 </span>                : 
-<span class="lineNum">     296 </span>                : #endif /* hppa-hpux */
-<span class="lineNum">     297 </span>                : 
-<span class="lineNum">     298 </span>                : #endif /* __GXX_WEAK__ */
-<span class="lineNum">     299 </span>                : 
-<span class="lineNum">     300 </span>                : #ifdef _LIBOBJC
-<span class="lineNum">     301 </span>                : 
-<span class="lineNum">     302 </span>                : /* This is the config.h file in libobjc/ */
-<span class="lineNum">     303 </span>                : #include &lt;config.h&gt;
-<span class="lineNum">     304 </span>                : 
-<span class="lineNum">     305 </span>                : #ifdef HAVE_SCHED_H
-<span class="lineNum">     306 </span>                : # include &lt;sched.h&gt;
-<span class="lineNum">     307 </span>                : #endif
-<span class="lineNum">     308 </span>                : 
-<span class="lineNum">     309 </span>                : /* Key structure for maintaining thread specific storage */
-<span class="lineNum">     310 </span>                : static pthread_key_t _objc_thread_storage;
-<span class="lineNum">     311 </span>                : static pthread_attr_t _objc_thread_attribs;
-<span class="lineNum">     312 </span>                : 
-<span class="lineNum">     313 </span>                : /* Thread local storage for a single thread */
-<span class="lineNum">     314 </span>                : static void *thread_local_storage = NULL;
-<span class="lineNum">     315 </span>                : 
-<span class="lineNum">     316 </span>                : /* Backend initialization functions */
-<span class="lineNum">     317 </span>                : 
-<span class="lineNum">     318 </span>                : /* Initialize the threads subsystem.  */
-<span class="lineNum">     319 </span>                : static inline int
-<span class="lineNum">     320 </span>                : __gthread_objc_init_thread_system (void)
-<span class="lineNum">     321 </span>                : {
-<span class="lineNum">     322 </span>                :   if (__gthread_active_p ())
-<span class="lineNum">     323 </span>                :     {
-<span class="lineNum">     324 </span>                :       /* Initialize the thread storage key.  */
-<span class="lineNum">     325 </span>                :       if (__gthrw_(pthread_key_create) (&amp;_objc_thread_storage, NULL) == 0)
-<span class="lineNum">     326 </span>                :         {
-<span class="lineNum">     327 </span>                :           /* The normal default detach state for threads is
-<span class="lineNum">     328 </span>                :            * PTHREAD_CREATE_JOINABLE which causes threads to not die
-<span class="lineNum">     329 </span>                :            * when you think they should.  */
-<span class="lineNum">     330 </span>                :           if (__gthrw_(pthread_attr_init) (&amp;_objc_thread_attribs) == 0
-<span class="lineNum">     331 </span>                :               &amp;&amp; __gthrw_(pthread_attr_setdetachstate) (&amp;_objc_thread_attribs,
-<span class="lineNum">     332 </span>                :                                               PTHREAD_CREATE_DETACHED) == 0)
-<span class="lineNum">     333 </span>                :             return 0;
-<span class="lineNum">     334 </span>                :         }
-<span class="lineNum">     335 </span>                :     }
-<span class="lineNum">     336 </span>                : 
-<span class="lineNum">     337 </span>                :   return -1;
-<span class="lineNum">     338 </span>                : }
-<span class="lineNum">     339 </span>                : 
-<span class="lineNum">     340 </span>                : /* Close the threads subsystem.  */
-<span class="lineNum">     341 </span>                : static inline int
-<span class="lineNum">     342 </span>                : __gthread_objc_close_thread_system (void)
-<span class="lineNum">     343 </span>                : {
-<span class="lineNum">     344 </span>                :   if (__gthread_active_p ()
-<span class="lineNum">     345 </span>                :       &amp;&amp; __gthrw_(pthread_key_delete) (_objc_thread_storage) == 0
-<span class="lineNum">     346 </span>                :       &amp;&amp; __gthrw_(pthread_attr_destroy) (&amp;_objc_thread_attribs) == 0)
-<span class="lineNum">     347 </span>                :     return 0;
-<span class="lineNum">     348 </span>                : 
-<span class="lineNum">     349 </span>                :   return -1;
-<span class="lineNum">     350 </span>                : }
-<span class="lineNum">     351 </span>                : 
-<span class="lineNum">     352 </span>                : /* Backend thread functions */
-<span class="lineNum">     353 </span>                : 
-<span class="lineNum">     354 </span>                : /* Create a new thread of execution.  */
-<span class="lineNum">     355 </span>                : static inline objc_thread_t
-<span class="lineNum">     356 </span>                : __gthread_objc_thread_detach (void (*func)(void *), void *arg)
-<span class="lineNum">     357 </span>                : {
-<span class="lineNum">     358 </span>                :   objc_thread_t thread_id;
-<span class="lineNum">     359 </span>                :   pthread_t new_thread_handle;
-<span class="lineNum">     360 </span>                : 
-<span class="lineNum">     361 </span>                :   if (!__gthread_active_p ())
-<span class="lineNum">     362 </span>                :     return NULL;
-<span class="lineNum">     363 </span>                : 
-<span class="lineNum">     364 </span>                :   if (!(__gthrw_(pthread_create) (&amp;new_thread_handle, NULL, (void *) func, arg)))
-<span class="lineNum">     365 </span>                :     thread_id = (objc_thread_t) new_thread_handle;
-<span class="lineNum">     366 </span>                :   else
-<span class="lineNum">     367 </span>                :     thread_id = NULL;
-<span class="lineNum">     368 </span>                : 
-<span class="lineNum">     369 </span>                :   return thread_id;
-<span class="lineNum">     370 </span>                : }
-<span class="lineNum">     371 </span>                : 
-<span class="lineNum">     372 </span>                : /* Set the current thread's priority.  */
-<span class="lineNum">     373 </span>                : static inline int
-<span class="lineNum">     374 </span>                : __gthread_objc_thread_set_priority (int priority)
-<span class="lineNum">     375 </span>                : {
-<span class="lineNum">     376 </span>                :   if (!__gthread_active_p ())
-<span class="lineNum">     377 </span>                :     return -1;
-<span class="lineNum">     378 </span>                :   else
-<span class="lineNum">     379 </span>                :     {
-<span class="lineNum">     380 </span>                : #ifdef _POSIX_PRIORITY_SCHEDULING
-<span class="lineNum">     381 </span>                : #ifdef _POSIX_THREAD_PRIORITY_SCHEDULING
-<span class="lineNum">     382 </span>                :       pthread_t thread_id = __gthrw_(pthread_self) ();
-<span class="lineNum">     383 </span>                :       int policy;
-<span class="lineNum">     384 </span>                :       struct sched_param params;
-<span class="lineNum">     385 </span>                :       int priority_min, priority_max;
-<span class="lineNum">     386 </span>                : 
-<span class="lineNum">     387 </span>                :       if (__gthrw_(pthread_getschedparam) (thread_id, &amp;policy, &amp;params) == 0)
-<span class="lineNum">     388 </span>                :         {
-<span class="lineNum">     389 </span>                :           if ((priority_max = __gthrw_(sched_get_priority_max) (policy)) == -1)
-<span class="lineNum">     390 </span>                :             return -1;
-<span class="lineNum">     391 </span>                : 
-<span class="lineNum">     392 </span>                :           if ((priority_min = __gthrw_(sched_get_priority_min) (policy)) == -1)
-<span class="lineNum">     393 </span>                :             return -1;
-<span class="lineNum">     394 </span>                : 
-<span class="lineNum">     395 </span>                :           if (priority &gt; priority_max)
-<span class="lineNum">     396 </span>                :             priority = priority_max;
-<span class="lineNum">     397 </span>                :           else if (priority &lt; priority_min)
-<span class="lineNum">     398 </span>                :             priority = priority_min;
-<span class="lineNum">     399 </span>                :           params.sched_priority = priority;
-<span class="lineNum">     400 </span>                : 
-<span class="lineNum">     401 </span>                :           /*
-<span class="lineNum">     402 </span>                :            * The solaris 7 and several other man pages incorrectly state that
-<span class="lineNum">     403 </span>                :            * this should be a pointer to policy but pthread.h is universally
-<span class="lineNum">     404 </span>                :            * at odds with this.
-<span class="lineNum">     405 </span>                :            */
-<span class="lineNum">     406 </span>                :           if (__gthrw_(pthread_setschedparam) (thread_id, policy, &amp;params) == 0)
-<span class="lineNum">     407 </span>                :             return 0;
-<span class="lineNum">     408 </span>                :         }
-<span class="lineNum">     409 </span>                : #endif /* _POSIX_THREAD_PRIORITY_SCHEDULING */
-<span class="lineNum">     410 </span>                : #endif /* _POSIX_PRIORITY_SCHEDULING */
-<span class="lineNum">     411 </span>                :       return -1;
-<span class="lineNum">     412 </span>                :     }
-<span class="lineNum">     413 </span>                : }
-<span class="lineNum">     414 </span>                : 
-<span class="lineNum">     415 </span>                : /* Return the current thread's priority.  */
-<span class="lineNum">     416 </span>                : static inline int
-<span class="lineNum">     417 </span>                : __gthread_objc_thread_get_priority (void)
-<span class="lineNum">     418 </span>                : {
-<span class="lineNum">     419 </span>                : #ifdef _POSIX_PRIORITY_SCHEDULING
-<span class="lineNum">     420 </span>                : #ifdef _POSIX_THREAD_PRIORITY_SCHEDULING
-<span class="lineNum">     421 </span>                :   if (__gthread_active_p ())
-<span class="lineNum">     422 </span>                :     {
-<span class="lineNum">     423 </span>                :       int policy;
-<span class="lineNum">     424 </span>                :       struct sched_param params;
-<span class="lineNum">     425 </span>                : 
-<span class="lineNum">     426 </span>                :       if (__gthrw_(pthread_getschedparam) (__gthrw_(pthread_self) (), &amp;policy, &amp;params) == 0)
-<span class="lineNum">     427 </span>                :         return params.sched_priority;
-<span class="lineNum">     428 </span>                :       else
-<span class="lineNum">     429 </span>                :         return -1;
-<span class="lineNum">     430 </span>                :     }
-<span class="lineNum">     431 </span>                :   else
-<span class="lineNum">     432 </span>                : #endif /* _POSIX_THREAD_PRIORITY_SCHEDULING */
-<span class="lineNum">     433 </span>                : #endif /* _POSIX_PRIORITY_SCHEDULING */
-<span class="lineNum">     434 </span>                :     return OBJC_THREAD_INTERACTIVE_PRIORITY;
-<span class="lineNum">     435 </span>                : }
-<span class="lineNum">     436 </span>                : 
-<span class="lineNum">     437 </span>                : /* Yield our process time to another thread.  */
-<span class="lineNum">     438 </span>                : static inline void
-<span class="lineNum">     439 </span>                : __gthread_objc_thread_yield (void)
-<span class="lineNum">     440 </span>                : {
-<span class="lineNum">     441 </span>                :   if (__gthread_active_p ())
-<span class="lineNum">     442 </span>                :     __gthrw_(sched_yield) ();
-<span class="lineNum">     443 </span>                : }
-<span class="lineNum">     444 </span>                : 
-<span class="lineNum">     445 </span>                : /* Terminate the current thread.  */
-<span class="lineNum">     446 </span>                : static inline int
-<span class="lineNum">     447 </span>                : __gthread_objc_thread_exit (void)
-<span class="lineNum">     448 </span>                : {
-<span class="lineNum">     449 </span>                :   if (__gthread_active_p ())
-<span class="lineNum">     450 </span>                :     /* exit the thread */
-<span class="lineNum">     451 </span>                :     __gthrw_(pthread_exit) (&amp;__objc_thread_exit_status);
-<span class="lineNum">     452 </span>                : 
-<span class="lineNum">     453 </span>                :   /* Failed if we reached here */
-<span class="lineNum">     454 </span>                :   return -1;
-<span class="lineNum">     455 </span>                : }
-<span class="lineNum">     456 </span>                : 
-<span class="lineNum">     457 </span>                : /* Returns an integer value which uniquely describes a thread.  */
-<span class="lineNum">     458 </span>                : static inline objc_thread_t
-<span class="lineNum">     459 </span>                : __gthread_objc_thread_id (void)
-<span class="lineNum">     460 </span>                : {
-<span class="lineNum">     461 </span>                :   if (__gthread_active_p ())
-<span class="lineNum">     462 </span>                :     return (objc_thread_t) __gthrw_(pthread_self) ();
-<span class="lineNum">     463 </span>                :   else
-<span class="lineNum">     464 </span>                :     return (objc_thread_t) 1;
-<span class="lineNum">     465 </span>                : }
-<span class="lineNum">     466 </span>                : 
-<span class="lineNum">     467 </span>                : /* Sets the thread's local storage pointer.  */
-<span class="lineNum">     468 </span>                : static inline int
-<span class="lineNum">     469 </span>                : __gthread_objc_thread_set_data (void *value)
-<span class="lineNum">     470 </span>                : {
-<span class="lineNum">     471 </span>                :   if (__gthread_active_p ())
-<span class="lineNum">     472 </span>                :     return __gthrw_(pthread_setspecific) (_objc_thread_storage, value);
-<span class="lineNum">     473 </span>                :   else
-<span class="lineNum">     474 </span>                :     {
-<span class="lineNum">     475 </span>                :       thread_local_storage = value;
-<span class="lineNum">     476 </span>                :       return 0;
-<span class="lineNum">     477 </span>                :     }
-<span class="lineNum">     478 </span>                : }
-<span class="lineNum">     479 </span>                : 
-<span class="lineNum">     480 </span>                : /* Returns the thread's local storage pointer.  */
-<span class="lineNum">     481 </span>                : static inline void *
-<span class="lineNum">     482 </span>                : __gthread_objc_thread_get_data (void)
-<span class="lineNum">     483 </span>                : {
-<span class="lineNum">     484 </span>                :   if (__gthread_active_p ())
-<span class="lineNum">     485 </span>                :     return __gthrw_(pthread_getspecific) (_objc_thread_storage);
-<span class="lineNum">     486 </span>                :   else
-<span class="lineNum">     487 </span>                :     return thread_local_storage;
-<span class="lineNum">     488 </span>                : }
-<span class="lineNum">     489 </span>                : 
-<span class="lineNum">     490 </span>                : /* Backend mutex functions */
-<span class="lineNum">     491 </span>                : 
-<span class="lineNum">     492 </span>                : /* Allocate a mutex.  */
-<span class="lineNum">     493 </span>                : static inline int
-<span class="lineNum">     494 </span>                : __gthread_objc_mutex_allocate (objc_mutex_t mutex)
-<span class="lineNum">     495 </span>                : {
-<span class="lineNum">     496 </span>                :   if (__gthread_active_p ())
-<span class="lineNum">     497 </span>                :     {
-<span class="lineNum">     498 </span>                :       mutex-&gt;backend = objc_malloc (sizeof (pthread_mutex_t));
-<span class="lineNum">     499 </span>                : 
-<span class="lineNum">     500 </span>                :       if (__gthrw_(pthread_mutex_init) ((pthread_mutex_t *) mutex-&gt;backend, NULL))
-<span class="lineNum">     501 </span>                :         {
-<span class="lineNum">     502 </span>                :           objc_free (mutex-&gt;backend);
-<span class="lineNum">     503 </span>                :           mutex-&gt;backend = NULL;
-<span class="lineNum">     504 </span>                :           return -1;
-<span class="lineNum">     505 </span>                :         }
-<span class="lineNum">     506 </span>                :     }
-<span class="lineNum">     507 </span>                : 
-<span class="lineNum">     508 </span>                :   return 0;
-<span class="lineNum">     509 </span>                : }
-<span class="lineNum">     510 </span>                : 
-<span class="lineNum">     511 </span>                : /* Deallocate a mutex.  */
-<span class="lineNum">     512 </span>                : static inline int
-<span class="lineNum">     513 </span>                : __gthread_objc_mutex_deallocate (objc_mutex_t mutex)
-<span class="lineNum">     514 </span>                : {
-<span class="lineNum">     515 </span>                :   if (__gthread_active_p ())
-<span class="lineNum">     516 </span>                :     {
-<span class="lineNum">     517 </span>                :       int count;
-<span class="lineNum">     518 </span>                : 
-<span class="lineNum">     519 </span>                :       /*
-<span class="lineNum">     520 </span>                :        * Posix Threads specifically require that the thread be unlocked
-<span class="lineNum">     521 </span>                :        * for __gthrw_(pthread_mutex_destroy) to work.
-<span class="lineNum">     522 </span>                :        */
-<span class="lineNum">     523 </span>                : 
-<span class="lineNum">     524 </span>                :       do
-<span class="lineNum">     525 </span>                :         {
-<span class="lineNum">     526 </span>                :           count = __gthrw_(pthread_mutex_unlock) ((pthread_mutex_t *) mutex-&gt;backend);
-<span class="lineNum">     527 </span>                :           if (count &lt; 0)
-<span class="lineNum">     528 </span>                :             return -1;
-<span class="lineNum">     529 </span>                :         }
-<span class="lineNum">     530 </span>                :       while (count);
-<span class="lineNum">     531 </span>                : 
-<span class="lineNum">     532 </span>                :       if (__gthrw_(pthread_mutex_destroy) ((pthread_mutex_t *) mutex-&gt;backend))
-<span class="lineNum">     533 </span>                :         return -1;
-<span class="lineNum">     534 </span>                : 
-<span class="lineNum">     535 </span>                :       objc_free (mutex-&gt;backend);
-<span class="lineNum">     536 </span>                :       mutex-&gt;backend = NULL;
-<span class="lineNum">     537 </span>                :     }
-<span class="lineNum">     538 </span>                :   return 0;
-<span class="lineNum">     539 </span>                : }
-<span class="lineNum">     540 </span>                : 
-<span class="lineNum">     541 </span>                : /* Grab a lock on a mutex.  */
-<span class="lineNum">     542 </span>                : static inline int
-<span class="lineNum">     543 </span>                : __gthread_objc_mutex_lock (objc_mutex_t mutex)
-<span class="lineNum">     544 </span>                : {
-<span class="lineNum">     545 </span>                :   if (__gthread_active_p ()
-<span class="lineNum">     546 </span>                :       &amp;&amp; __gthrw_(pthread_mutex_lock) ((pthread_mutex_t *) mutex-&gt;backend) != 0)
-<span class="lineNum">     547 </span>                :     {
-<span class="lineNum">     548 </span>                :       return -1;
-<span class="lineNum">     549 </span>                :     }
-<span class="lineNum">     550 </span>                : 
-<span class="lineNum">     551 </span>                :   return 0;
-<span class="lineNum">     552 </span>                : }
-<span class="lineNum">     553 </span>                : 
-<span class="lineNum">     554 </span>                : /* Try to grab a lock on a mutex.  */
-<span class="lineNum">     555 </span>                : static inline int
-<span class="lineNum">     556 </span>                : __gthread_objc_mutex_trylock (objc_mutex_t mutex)
-<span class="lineNum">     557 </span>                : {
-<span class="lineNum">     558 </span>                :   if (__gthread_active_p ()
-<span class="lineNum">     559 </span>                :       &amp;&amp; __gthrw_(pthread_mutex_trylock) ((pthread_mutex_t *) mutex-&gt;backend) != 0)
-<span class="lineNum">     560 </span>                :     {
-<span class="lineNum">     561 </span>                :       return -1;
-<span class="lineNum">     562 </span>                :     }
-<span class="lineNum">     563 </span>                : 
-<span class="lineNum">     564 </span>                :   return 0;
-<span class="lineNum">     565 </span>                : }
-<span class="lineNum">     566 </span>                : 
-<span class="lineNum">     567 </span>                : /* Unlock the mutex */
-<span class="lineNum">     568 </span>                : static inline int
-<span class="lineNum">     569 </span>                : __gthread_objc_mutex_unlock (objc_mutex_t mutex)
-<span class="lineNum">     570 </span>                : {
-<span class="lineNum">     571 </span>                :   if (__gthread_active_p ()
-<span class="lineNum">     572 </span>                :       &amp;&amp; __gthrw_(pthread_mutex_unlock) ((pthread_mutex_t *) mutex-&gt;backend) != 0)
-<span class="lineNum">     573 </span>                :     {
-<span class="lineNum">     574 </span>                :       return -1;
-<span class="lineNum">     575 </span>                :     }
-<span class="lineNum">     576 </span>                : 
-<span class="lineNum">     577 </span>                :   return 0;
-<span class="lineNum">     578 </span>                : }
-<span class="lineNum">     579 </span>                : 
-<span class="lineNum">     580 </span>                : /* Backend condition mutex functions */
-<span class="lineNum">     581 </span>                : 
-<span class="lineNum">     582 </span>                : /* Allocate a condition.  */
-<span class="lineNum">     583 </span>                : static inline int
-<span class="lineNum">     584 </span>                : __gthread_objc_condition_allocate (objc_condition_t condition)
-<span class="lineNum">     585 </span>                : {
-<span class="lineNum">     586 </span>                :   if (__gthread_active_p ())
-<span class="lineNum">     587 </span>                :     {
-<span class="lineNum">     588 </span>                :       condition-&gt;backend = objc_malloc (sizeof (pthread_cond_t));
-<span class="lineNum">     589 </span>                : 
-<span class="lineNum">     590 </span>                :       if (__gthrw_(pthread_cond_init) ((pthread_cond_t *) condition-&gt;backend, NULL))
-<span class="lineNum">     591 </span>                :         {
-<span class="lineNum">     592 </span>                :           objc_free (condition-&gt;backend);
-<span class="lineNum">     593 </span>                :           condition-&gt;backend = NULL;
-<span class="lineNum">     594 </span>                :           return -1;
-<span class="lineNum">     595 </span>                :         }
-<span class="lineNum">     596 </span>                :     }
-<span class="lineNum">     597 </span>                : 
-<span class="lineNum">     598 </span>                :   return 0;
-<span class="lineNum">     599 </span>                : }
-<span class="lineNum">     600 </span>                : 
-<span class="lineNum">     601 </span>                : /* Deallocate a condition.  */
-<span class="lineNum">     602 </span>                : static inline int
-<span class="lineNum">     603 </span>                : __gthread_objc_condition_deallocate (objc_condition_t condition)
-<span class="lineNum">     604 </span>                : {
-<span class="lineNum">     605 </span>                :   if (__gthread_active_p ())
-<span class="lineNum">     606 </span>                :     {
-<span class="lineNum">     607 </span>                :       if (__gthrw_(pthread_cond_destroy) ((pthread_cond_t *) condition-&gt;backend))
-<span class="lineNum">     608 </span>                :         return -1;
-<span class="lineNum">     609 </span>                : 
-<span class="lineNum">     610 </span>                :       objc_free (condition-&gt;backend);
-<span class="lineNum">     611 </span>                :       condition-&gt;backend = NULL;
-<span class="lineNum">     612 </span>                :     }
-<span class="lineNum">     613 </span>                :   return 0;
-<span class="lineNum">     614 </span>                : }
-<span class="lineNum">     615 </span>                : 
-<span class="lineNum">     616 </span>                : /* Wait on the condition */
-<span class="lineNum">     617 </span>                : static inline int
-<span class="lineNum">     618 </span>                : __gthread_objc_condition_wait (objc_condition_t condition, objc_mutex_t mutex)
-<span class="lineNum">     619 </span>                : {
-<span class="lineNum">     620 </span>                :   if (__gthread_active_p ())
-<span class="lineNum">     621 </span>                :     return __gthrw_(pthread_cond_wait) ((pthread_cond_t *) condition-&gt;backend,
-<span class="lineNum">     622 </span>                :                               (pthread_mutex_t *) mutex-&gt;backend);
-<span class="lineNum">     623 </span>                :   else
-<span class="lineNum">     624 </span>                :     return 0;
-<span class="lineNum">     625 </span>                : }
-<span class="lineNum">     626 </span>                : 
-<span class="lineNum">     627 </span>                : /* Wake up all threads waiting on this condition.  */
-<span class="lineNum">     628 </span>                : static inline int
-<span class="lineNum">     629 </span>                : __gthread_objc_condition_broadcast (objc_condition_t condition)
-<span class="lineNum">     630 </span>                : {
-<span class="lineNum">     631 </span>                :   if (__gthread_active_p ())
-<span class="lineNum">     632 </span>                :     return __gthrw_(pthread_cond_broadcast) ((pthread_cond_t *) condition-&gt;backend);
-<span class="lineNum">     633 </span>                :   else
-<span class="lineNum">     634 </span>                :     return 0;
-<span class="lineNum">     635 </span>                : }
-<span class="lineNum">     636 </span>                : 
-<span class="lineNum">     637 </span>                : /* Wake up one thread waiting on this condition.  */
-<span class="lineNum">     638 </span>                : static inline int
-<span class="lineNum">     639 </span>                : __gthread_objc_condition_signal (objc_condition_t condition)
-<span class="lineNum">     640 </span>                : {
-<span class="lineNum">     641 </span>                :   if (__gthread_active_p ())
-<span class="lineNum">     642 </span>                :     return __gthrw_(pthread_cond_signal) ((pthread_cond_t *) condition-&gt;backend);
-<span class="lineNum">     643 </span>                :   else
-<span class="lineNum">     644 </span>                :     return 0;
-<span class="lineNum">     645 </span>                : }
-<span class="lineNum">     646 </span>                : 
-<span class="lineNum">     647 </span>                : #else /* _LIBOBJC */
-<span class="lineNum">     648 </span>                : 
-<span class="lineNum">     649 </span>                : static inline int
-<span class="lineNum">     650 </span>                : __gthread_once (__gthread_once_t *once, void (*func) (void))
-<span class="lineNum">     651 </span>                : {
-<span class="lineNum">     652 </span>                :   if (__gthread_active_p ())
-<span class="lineNum">     653 </span>                :     return __gthrw_(pthread_once) (once, func);
-<span class="lineNum">     654 </span>                :   else
-<span class="lineNum">     655 </span>                :     return -1;
-<span class="lineNum">     656 </span>                : }
-<span class="lineNum">     657 </span>                : 
-<span class="lineNum">     658 </span>                : static inline int
-<span class="lineNum">     659 </span>                : __gthread_key_create (__gthread_key_t *key, void (*dtor) (void *))
-<span class="lineNum">     660 </span>                : {
-<span class="lineNum">     661 </span>                :   return __gthrw_(pthread_key_create) (key, dtor);
-<span class="lineNum">     662 </span>                : }
-<span class="lineNum">     663 </span>                : 
-<span class="lineNum">     664 </span>                : static inline int
-<span class="lineNum">     665 </span>                : __gthread_key_delete (__gthread_key_t key)
-<span class="lineNum">     666 </span>                : {
-<span class="lineNum">     667 </span>                :   return __gthrw_(pthread_key_delete) (key);
-<span class="lineNum">     668 </span>                : }
-<span class="lineNum">     669 </span>                : 
-<span class="lineNum">     670 </span>                : static inline void *
-<span class="lineNum">     671 </span>                : __gthread_getspecific (__gthread_key_t key)
-<span class="lineNum">     672 </span>                : {
-<span class="lineNum">     673 </span>                :   return __gthrw_(pthread_getspecific) (key);
-<span class="lineNum">     674 </span>                : }
-<span class="lineNum">     675 </span>                : 
-<span class="lineNum">     676 </span>                : static inline int
-<span class="lineNum">     677 </span>                : __gthread_setspecific (__gthread_key_t key, const void *ptr)
-<span class="lineNum">     678 </span>                : {
-<span class="lineNum">     679 </span>                :   return __gthrw_(pthread_setspecific) (key, ptr);
-<span class="lineNum">     680 </span>                : }
-<span class="lineNum">     681 </span>                : 
-<span class="lineNum">     682 </span>                : static inline int
-<span class="lineNum">     683 </span>                : __gthread_mutex_lock (__gthread_mutex_t *mutex)
-<span class="lineNum">     684 </span>                : {
-<span class="lineNum">     685 </span>                :   if (__gthread_active_p ())
-<span class="lineNum">     686 </span>                :     return __gthrw_(pthread_mutex_lock) (mutex);
-<span class="lineNum">     687 </span>                :   else
-<span class="lineNum">     688 </span>                :     return 0;
-<span class="lineNum">     689 </span>                : }
-<span class="lineNum">     690 </span>                : 
-<span class="lineNum">     691 </span>                : static inline int
-<span class="lineNum">     692 </span>                : __gthread_mutex_trylock (__gthread_mutex_t *mutex)
-<span class="lineNum">     693 </span>                : {
-<span class="lineNum">     694 </span>                :   if (__gthread_active_p ())
-<span class="lineNum">     695 </span>                :     return __gthrw_(pthread_mutex_trylock) (mutex);
-<span class="lineNum">     696 </span>                :   else
-<span class="lineNum">     697 </span>                :     return 0;
-<span class="lineNum">     698 </span>                : }
-<span class="lineNum">     699 </span>                : 
-<span class="lineNum">     700 </span>                : static inline int
-<span class="lineNum">     701 </span>                : __gthread_mutex_unlock (__gthread_mutex_t *mutex)
-<span class="lineNum">     702 </span>                : {
-<span class="lineNum">     703 </span>                :   if (__gthread_active_p ())
-<span class="lineNum">     704 </span>                :     return __gthrw_(pthread_mutex_unlock) (mutex);
-<span class="lineNum">     705 </span>                :   else
-<span class="lineNum">     706 </span>                :     return 0;
-<span class="lineNum">     707 </span>                : }
-<span class="lineNum">     708 </span>                : 
-<span class="lineNum">     709 </span>                : #ifndef PTHREAD_RECURSIVE_MUTEX_INITIALIZER_NP
-<span class="lineNum">     710 </span>                : static inline int
-<span class="lineNum">     711 </span>                : __gthread_recursive_mutex_init_function (__gthread_recursive_mutex_t *mutex)
-<span class="lineNum">     712 </span>                : {
-<span class="lineNum">     713 </span>                :   if (__gthread_active_p ())
-<span class="lineNum">     714 </span>                :     {
-<span class="lineNum">     715 </span>                :       pthread_mutexattr_t attr;
-<span class="lineNum">     716 </span>                :       int r;
-<span class="lineNum">     717 </span>                : 
-<span class="lineNum">     718 </span>                :       r = __gthrw_(pthread_mutexattr_init) (&amp;attr);
-<span class="lineNum">     719 </span>                :       if (!r)
-<span class="lineNum">     720 </span>                :         r = __gthrw_(pthread_mutexattr_settype) (&amp;attr, PTHREAD_MUTEX_RECURSIVE);
-<span class="lineNum">     721 </span>                :       if (!r)
-<span class="lineNum">     722 </span>                :         r = __gthrw_(pthread_mutex_init) (mutex, &amp;attr);
-<span class="lineNum">     723 </span>                :       if (!r)
-<span class="lineNum">     724 </span>                :         r = __gthrw_(pthread_mutexattr_destroy) (&amp;attr);
-<span class="lineNum">     725 </span>                :       return r;
-<span class="lineNum">     726 </span>                :     }
-<span class="lineNum">     727 </span>                :   return 0;
-<span class="lineNum">     728 </span>                : }
-<span class="lineNum">     729 </span>                : #endif
-<span class="lineNum">     730 </span>                : 
-<span class="lineNum">     731 </span>                : static inline int
-<span class="lineNum">     732 </span>                : __gthread_recursive_mutex_lock (__gthread_recursive_mutex_t *mutex)
-<span class="lineNum">     733 </span>                : {
-<span class="lineNum">     734 </span>                :   return __gthread_mutex_lock (mutex);
-<span class="lineNum">     735 </span>                : }
-<span class="lineNum">     736 </span>                : 
-<span class="lineNum">     737 </span>                : static inline int
-<span class="lineNum">     738 </span>                : __gthread_recursive_mutex_trylock (__gthread_recursive_mutex_t *mutex)
-<span class="lineNum">     739 </span>                : {
-<span class="lineNum">     740 </span>                :   return __gthread_mutex_trylock (mutex);
-<span class="lineNum">     741 </span>                : }
-<span class="lineNum">     742 </span>                : 
-<span class="lineNum">     743 </span>                : static inline int
-<span class="lineNum">     744 </span>                : __gthread_recursive_mutex_unlock (__gthread_recursive_mutex_t *mutex)
-<span class="lineNum">     745 </span>                : {
-<span class="lineNum">     746 </span>                :   return __gthread_mutex_unlock (mutex);
-<span class="lineNum">     747 </span>                : }
-<span class="lineNum">     748 </span>                : 
-<span class="lineNum">     749 </span>                : static inline int
-<span class="lineNum">     750 </span>                : __gthread_cond_broadcast (__gthread_cond_t *cond)
-<span class="lineNum">     751 </span>                : {
-<span class="lineNum">     752 </span>                :   return __gthrw_(pthread_cond_broadcast) (cond);
-<span class="lineNum">     753 </span>                : }
-<span class="lineNum">     754 </span>                : 
-<span class="lineNum">     755 </span>                : static inline int
-<span class="lineNum">     756 </span>                : __gthread_cond_wait (__gthread_cond_t *cond, __gthread_mutex_t *mutex)
-<span class="lineNum">     757 </span>                : {
-<span class="lineNum">     758 </span>                :   return __gthrw_(pthread_cond_wait) (cond, mutex);
-<span class="lineNum">     759 </span>                : }
-<span class="lineNum">     760 </span>                : 
-<span class="lineNum">     761 </span>                : static inline int
-<span class="lineNum">     762 </span>                : __gthread_cond_wait_recursive (__gthread_cond_t *cond,
-<span class="lineNum">     763 </span>                :                                __gthread_recursive_mutex_t *mutex)
-<span class="lineNum">     764 </span>                : {
-<span class="lineNum">     765 </span>                :   return __gthread_cond_wait (cond, mutex);
-<span class="lineNum">     766 </span>                : }
-<span class="lineNum">     767 </span>                : 
-<span class="lineNum">     768 </span>                : #endif /* _LIBOBJC */
-<span class="lineNum">     769 </span>                : 
-<span class="lineNum">     770 </span>                : #endif /* ! _GLIBCXX_GCC_GTHR_POSIX_H */
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/i486-linux-gnu/bits/index.html b/rep/usr/include/c++/4.3/i486-linux-gnu/bits/index.html
deleted file mode 100644
index 14ebc63..0000000
--- a/rep/usr/include/c++/4.3/i486-linux-gnu/bits/index.html
+++ /dev/null
@@ -1,83 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/i486-linux-gnu/bits</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../../index.html">directory</a> - /usr/include/c++/4.3/i486-linux-gnu/bits</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">2</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">0.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">0</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <center>
-  <table width="80%" cellpadding=2 cellspacing=1 border=0>
-
-    <tr>
-      <td width="50%"><br></td>
-      <td width="15%"></td>
-      <td width="15%"></td>
-      <td width="20%"></td>
-    </tr>
-
-    <tr>
-      <td class="tableHead">Filename</td>
-      <td class="tableHead" colspan=3>Coverage</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="gthr-default.h.gcov.html">gthr-default.h</a></td>
-      <td class="coverBar" align="center">
-                <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../../snow.png" width=100 height=10 alt="0.0%"></td></tr></table>
-      </td>
-      <td class="coverPerLo">0.0&nbsp;%</td>
-      <td class="coverNumLo">0&nbsp;/&nbsp;2&nbsp;lines</td>
-    </tr>
-
-  </table>
-  </center>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/index.html b/rep/usr/include/c++/4.3/index.html
deleted file mode 100644
index 9ddc70b..0000000
--- a/rep/usr/include/c++/4.3/index.html
+++ /dev/null
@@ -1,191 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3</title>
-  <link rel="stylesheet" type="text/css" href="../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - /usr/include/c++/4.3</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">181</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">6.6 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">12</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <center>
-  <table width="80%" cellpadding=2 cellspacing=1 border=0>
-
-    <tr>
-      <td width="50%"><br></td>
-      <td width="15%"></td>
-      <td width="15%"></td>
-      <td width="20%"></td>
-    </tr>
-
-    <tr>
-      <td class="tableHead">Filename</td>
-      <td class="tableHead" colspan=3>Coverage</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="cmath.gcov.html">cmath</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">2&nbsp;/&nbsp;2&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="exception.gcov.html">exception</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../emerald.png" width=50 height=10 alt="50.0%"><img src="../../../../snow.png" width=50 height=10 alt="50.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">50.0&nbsp;%</td>
-      <td class="coverNumHi">1&nbsp;/&nbsp;2&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="fstream.gcov.html">fstream</a></td>
-      <td class="coverBar" align="center">
-                <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../snow.png" width=100 height=10 alt="0.0%"></td></tr></table>
-      </td>
-      <td class="coverPerLo">0.0&nbsp;%</td>
-      <td class="coverNumLo">0&nbsp;/&nbsp;38&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="iomanip.gcov.html">iomanip</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../amber.png" width=40 height=10 alt="40.0%"><img src="../../../../snow.png" width=60 height=10 alt="40.0%"></td></tr></table>
-      </td>
-      <td class="coverPerMed">40.0&nbsp;%</td>
-      <td class="coverNumMed">4&nbsp;/&nbsp;10&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="iosfwd.gcov.html">iosfwd</a></td>
-      <td class="coverBar" align="center">
-                <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../snow.png" width=100 height=10 alt="0.0%"></td></tr></table>
-      </td>
-      <td class="coverPerLo">0.0&nbsp;%</td>
-      <td class="coverNumLo">0&nbsp;/&nbsp;1&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="iostream.gcov.html">iostream</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">1&nbsp;/&nbsp;1&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="istream.gcov.html">istream</a></td>
-      <td class="coverBar" align="center">
-                <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../snow.png" width=100 height=10 alt="0.0%"></td></tr></table>
-      </td>
-      <td class="coverPerLo">0.0&nbsp;%</td>
-      <td class="coverNumLo">0&nbsp;/&nbsp;8&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="new.gcov.html">new</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../emerald.png" width=50 height=10 alt="50.0%"><img src="../../../../snow.png" width=50 height=10 alt="50.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">50.0&nbsp;%</td>
-      <td class="coverNumHi">1&nbsp;/&nbsp;2&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="ostream.gcov.html">ostream</a></td>
-      <td class="coverBar" align="center">
-                <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../snow.png" width=100 height=10 alt="0.0%"></td></tr></table>
-      </td>
-      <td class="coverPerLo">0.0&nbsp;%</td>
-      <td class="coverNumLo">0&nbsp;/&nbsp;33&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="sstream.gcov.html">sstream</a></td>
-      <td class="coverBar" align="center">
-                <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../snow.png" width=100 height=10 alt="0.0%"></td></tr></table>
-      </td>
-      <td class="coverPerLo">0.0&nbsp;%</td>
-      <td class="coverNumLo">0&nbsp;/&nbsp;43&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="stdexcept.gcov.html">stdexcept</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">1&nbsp;/&nbsp;1&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="streambuf.gcov.html">streambuf</a></td>
-      <td class="coverBar" align="center">
-                <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../snow.png" width=100 height=10 alt="0.0%"></td></tr></table>
-      </td>
-      <td class="coverPerLo">0.0&nbsp;%</td>
-      <td class="coverNumLo">0&nbsp;/&nbsp;36&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="typeinfo.gcov.html">typeinfo</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../emerald.png" width=50 height=10 alt="50.0%"><img src="../../../../snow.png" width=50 height=10 alt="50.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">50.0&nbsp;%</td>
-      <td class="coverNumHi">2&nbsp;/&nbsp;4&nbsp;lines</td>
-    </tr>
-
-  </table>
-  </center>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/iomanip.gcov.html b/rep/usr/include/c++/4.3/iomanip.gcov.html
deleted file mode 100644
index 3873f4c..0000000
--- a/rep/usr/include/c++/4.3/iomanip.gcov.html
+++ /dev/null
@@ -1,368 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/iomanip</title>
-  <link rel="stylesheet" type="text/css" href="../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3</a> - iomanip</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">10</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">40.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">4</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // Standard stream manipulators -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005
-<span class="lineNum">       4 </span>                : // 2006, 2007
-<span class="lineNum">       5 </span>                : // Free Software Foundation, Inc.
-<span class="lineNum">       6 </span>                : //
-<span class="lineNum">       7 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       8 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       9 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">      10 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      11 </span>                : // any later version.
-<span class="lineNum">      12 </span>                : 
-<span class="lineNum">      13 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      14 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      15 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      16 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      17 </span>                : 
-<span class="lineNum">      18 </span>                : // You should have received a copy of the GNU General Public License
-<span class="lineNum">      19 </span>                : // along with this library; see the file COPYING.  If not, write to
-<span class="lineNum">      20 </span>                : // the Free Software Foundation, 51 Franklin Street, Fifth Floor,
-<span class="lineNum">      21 </span>                : // Boston, MA 02110-1301, USA.
-<span class="lineNum">      22 </span>                : 
-<span class="lineNum">      23 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      24 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      25 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      26 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      27 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      28 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      29 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      30 </span>                : // the GNU General Public License.
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span>                : /** @file iomanip
-<span class="lineNum">      33 </span>                :  *  This is a Standard C++ Library header.
-<span class="lineNum">      34 </span>                :  */
-<span class="lineNum">      35 </span>                : 
-<span class="lineNum">      36 </span>                : //
-<span class="lineNum">      37 </span>                : // ISO C++ 14882: 27.6.3  Standard manipulators
-<span class="lineNum">      38 </span>                : //
-<span class="lineNum">      39 </span>                : 
-<span class="lineNum">      40 </span>                : #ifndef _GLIBCXX_IOMANIP
-<span class="lineNum">      41 </span>                : #define _GLIBCXX_IOMANIP 1
-<span class="lineNum">      42 </span>                : 
-<span class="lineNum">      43 </span>                : #pragma GCC system_header
-<span class="lineNum">      44 </span>                : 
-<span class="lineNum">      45 </span>                : #include &lt;bits/c++config.h&gt;
-<span class="lineNum">      46 </span>                : #include &lt;iosfwd&gt;
-<span class="lineNum">      47 </span>                : #include &lt;bits/ios_base.h&gt;
-<span class="lineNum">      48 </span>                : 
-<span class="lineNum">      49 </span>                : _GLIBCXX_BEGIN_NAMESPACE(std)
-<span class="lineNum">      50 </span>                : 
-<span class="lineNum">      51 </span>                :   // [27.6.3] standard manipulators
-<span class="lineNum">      52 </span>                :   // Also see DR 183.
-<span class="lineNum">      53 </span>                : 
-<span class="lineNum">      54 </span>                :   struct _Resetiosflags { ios_base::fmtflags _M_mask; };
-<span class="lineNum">      55 </span>                : 
-<span class="lineNum">      56 </span>                :   /**
-<span class="lineNum">      57 </span>                :    *  @brief  Manipulator for @c setf.
-<span class="lineNum">      58 </span>                :    *  @param  mask  A format flags mask.
-<span class="lineNum">      59 </span>                :    *
-<span class="lineNum">      60 </span>                :    *  Sent to a stream object, this manipulator resets the specified flags,
-<span class="lineNum">      61 </span>                :    *  via @e stream.setf(0,mask).
-<span class="lineNum">      62 </span>                :   */
-<span class="lineNum">      63 </span>                :   inline _Resetiosflags 
-<span class="lineNum">      64 </span>                :   resetiosflags(ios_base::fmtflags __mask)
-<span class="lineNum">      65 </span>                :   { 
-<span class="lineNum">      66 </span>                :     _Resetiosflags __x; 
-<span class="lineNum">      67 </span>                :     __x._M_mask = __mask; 
-<span class="lineNum">      68 </span>                :     return __x; 
-<span class="lineNum">      69 </span>                :   }
-<span class="lineNum">      70 </span>                : 
-<span class="lineNum">      71 </span>                :   template&lt;typename _CharT, typename _Traits&gt;
-<span class="lineNum">      72 </span>                :     inline basic_istream&lt;_CharT, _Traits&gt;&amp; 
-<span class="lineNum">      73 </span>                :     operator&gt;&gt;(basic_istream&lt;_CharT, _Traits&gt;&amp; __is, _Resetiosflags __f)
-<span class="lineNum">      74 </span>                :     { 
-<span class="lineNum">      75 </span>                :       __is.setf(ios_base::fmtflags(0), __f._M_mask); 
-<span class="lineNum">      76 </span>                :       return __is; 
-<span class="lineNum">      77 </span>                :     }
-<span class="lineNum">      78 </span>                : 
-<span class="lineNum">      79 </span>                :   template&lt;typename _CharT, typename _Traits&gt;
-<span class="lineNum">      80 </span>                :     inline basic_ostream&lt;_CharT, _Traits&gt;&amp; 
-<span class="lineNum">      81 </span>                :     operator&lt;&lt;(basic_ostream&lt;_CharT, _Traits&gt;&amp; __os, _Resetiosflags __f)
-<span class="lineNum">      82 </span>                :     { 
-<span class="lineNum">      83 </span>                :       __os.setf(ios_base::fmtflags(0), __f._M_mask); 
-<span class="lineNum">      84 </span>                :       return __os; 
-<span class="lineNum">      85 </span>                :     }
-<span class="lineNum">      86 </span>                : 
-<span class="lineNum">      87 </span>                : 
-<span class="lineNum">      88 </span>                :   struct _Setiosflags { ios_base::fmtflags _M_mask; };
-<span class="lineNum">      89 </span>                : 
-<span class="lineNum">      90 </span>                :   /**
-<span class="lineNum">      91 </span>                :    *  @brief  Manipulator for @c setf.
-<span class="lineNum">      92 </span>                :    *  @param  mask  A format flags mask.
-<span class="lineNum">      93 </span>                :    *
-<span class="lineNum">      94 </span>                :    *  Sent to a stream object, this manipulator sets the format flags
-<span class="lineNum">      95 </span>                :    *  to @a mask.
-<span class="lineNum">      96 </span>                :   */
-<span class="lineNum">      97 </span>                :   inline _Setiosflags 
-<span class="lineNum">      98 </span>                :   setiosflags(ios_base::fmtflags __mask)
-<span class="lineNum">      99 </span>                :   { 
-<span class="lineNum">     100 </span>                :     _Setiosflags __x; 
-<span class="lineNum">     101 </span>                :     __x._M_mask = __mask; 
-<span class="lineNum">     102 </span>                :     return __x; 
-<span class="lineNum">     103 </span>                :   }
-<span class="lineNum">     104 </span>                : 
-<span class="lineNum">     105 </span>                :   template&lt;typename _CharT, typename _Traits&gt;
-<span class="lineNum">     106 </span>                :     inline basic_istream&lt;_CharT, _Traits&gt;&amp; 
-<span class="lineNum">     107 </span>                :     operator&gt;&gt;(basic_istream&lt;_CharT, _Traits&gt;&amp; __is, _Setiosflags __f)
-<span class="lineNum">     108 </span>                :     { 
-<span class="lineNum">     109 </span>                :       __is.setf(__f._M_mask); 
-<span class="lineNum">     110 </span>                :       return __is; 
-<span class="lineNum">     111 </span>                :     }
-<span class="lineNum">     112 </span>                : 
-<span class="lineNum">     113 </span>                :   template&lt;typename _CharT, typename _Traits&gt;
-<span class="lineNum">     114 </span>                :     inline basic_ostream&lt;_CharT, _Traits&gt;&amp; 
-<span class="lineNum">     115 </span>                :     operator&lt;&lt;(basic_ostream&lt;_CharT, _Traits&gt;&amp; __os, _Setiosflags __f)
-<span class="lineNum">     116 </span>                :     { 
-<span class="lineNum">     117 </span>                :       __os.setf(__f._M_mask); 
-<span class="lineNum">     118 </span>                :       return __os; 
-<span class="lineNum">     119 </span>                :     }
-<span class="lineNum">     120 </span>                : 
-<span class="lineNum">     121 </span>                : 
-<span class="lineNum">     122 </span>                :   struct _Setbase { int _M_base; };
-<span class="lineNum">     123 </span>                : 
-<span class="lineNum">     124 </span>                :   /**
-<span class="lineNum">     125 </span>                :    *  @brief  Manipulator for @c setf.
-<span class="lineNum">     126 </span>                :    *  @param  base  A numeric base.
-<span class="lineNum">     127 </span>                :    *
-<span class="lineNum">     128 </span>                :    *  Sent to a stream object, this manipulator changes the
-<span class="lineNum">     129 </span>                :    *  @c ios_base::basefield flags to @c oct, @c dec, or @c hex when @a base
-<span class="lineNum">     130 </span>                :    *  is 8, 10, or 16, accordingly, and to 0 if @a base is any other value.
-<span class="lineNum">     131 </span>                :   */
-<span class="lineNum">     132 </span>                :   inline _Setbase 
-<span class="lineNum">     133 </span>                :   setbase(int __base)
-<span class="lineNum">     134 </span>                :   { 
-<span class="lineNum">     135 </span>                :     _Setbase __x; 
-<span class="lineNum">     136 </span>                :     __x._M_base = __base; 
-<span class="lineNum">     137 </span>                :     return __x; 
-<span class="lineNum">     138 </span>                :   }
-<span class="lineNum">     139 </span>                : 
-<span class="lineNum">     140 </span>                :   template&lt;typename _CharT, typename _Traits&gt;
-<span class="lineNum">     141 </span>                :     inline basic_istream&lt;_CharT, _Traits&gt;&amp; 
-<span class="lineNum">     142 </span>                :     operator&gt;&gt;(basic_istream&lt;_CharT, _Traits&gt;&amp; __is, _Setbase __f)
-<span class="lineNum">     143 </span>                :     {
-<span class="lineNum">     144 </span>                :       __is.setf(__f._M_base ==  8 ? ios_base::oct : 
-<span class="lineNum">     145 </span>                :                 __f._M_base == 10 ? ios_base::dec : 
-<span class="lineNum">     146 </span>                :                 __f._M_base == 16 ? ios_base::hex : 
-<span class="lineNum">     147 </span>                :                 ios_base::fmtflags(0), ios_base::basefield);
-<span class="lineNum">     148 </span>                :       return __is; 
-<span class="lineNum">     149 </span>                :     }
-<span class="lineNum">     150 </span>                :   
-<span class="lineNum">     151 </span>                :   template&lt;typename _CharT, typename _Traits&gt;
-<span class="lineNum">     152 </span>                :     inline basic_ostream&lt;_CharT, _Traits&gt;&amp; 
-<span class="lineNum">     153 </span>                :     operator&lt;&lt;(basic_ostream&lt;_CharT, _Traits&gt;&amp; __os, _Setbase __f)
-<span class="lineNum">     154 </span>                :     {
-<span class="lineNum">     155 </span>                :       __os.setf(__f._M_base ==  8 ? ios_base::oct : 
-<span class="lineNum">     156 </span>                :                 __f._M_base == 10 ? ios_base::dec : 
-<span class="lineNum">     157 </span>                :                 __f._M_base == 16 ? ios_base::hex : 
-<span class="lineNum">     158 </span>                :                 ios_base::fmtflags(0), ios_base::basefield);
-<span class="lineNum">     159 </span>                :       return __os; 
-<span class="lineNum">     160 </span>                :     }
-<span class="lineNum">     161 </span>                :   
-<span class="lineNum">     162 </span>                : 
-<span class="lineNum">     163 </span>                :   template&lt;typename _CharT&gt; 
-<span class="lineNum">     164 </span>                :     struct _Setfill { _CharT _M_c; };
-<span class="lineNum">     165 </span>                : 
-<span class="lineNum">     166 </span>                :   /**
-<span class="lineNum">     167 </span>                :    *  @brief  Manipulator for @c fill.
-<span class="lineNum">     168 </span>                :    *  @param  c  The new fill character.
-<span class="lineNum">     169 </span>                :    *
-<span class="lineNum">     170 </span>                :    *  Sent to a stream object, this manipulator calls @c fill(c) for that
-<span class="lineNum">     171 </span>                :    *  object.
-<span class="lineNum">     172 </span>                :   */
-<span class="lineNum">     173 </span>                :   template&lt;typename _CharT&gt; 
-<span class="lineNum">     174 </span>                :     inline _Setfill&lt;_CharT&gt; 
-<span class="lineNum">     175 </span><span class="lineCov">             33 :     setfill(_CharT __c)</span>
-<span class="lineNum">     176 </span>                :     { 
-<span class="lineNum">     177 </span>                :       _Setfill&lt;_CharT&gt; __x; 
-<span class="lineNum">     178 </span><span class="lineCov">             33 :       __x._M_c = __c; </span>
-<span class="lineNum">     179 </span>                :       return __x; 
-<span class="lineNum">     180 </span>                :     }
-<span class="lineNum">     181 </span>                : 
-<span class="lineNum">     182 </span>                :   template&lt;typename _CharT, typename _Traits&gt;
-<span class="lineNum">     183 </span>                :     inline basic_istream&lt;_CharT, _Traits&gt;&amp; 
-<span class="lineNum">     184 </span>                :     operator&gt;&gt;(basic_istream&lt;_CharT, _Traits&gt;&amp; __is, _Setfill&lt;_CharT&gt; __f)
-<span class="lineNum">     185 </span>                :     { 
-<span class="lineNum">     186 </span>                :       __is.fill(__f._M_c); 
-<span class="lineNum">     187 </span>                :       return __is; 
-<span class="lineNum">     188 </span>                :     }
-<span class="lineNum">     189 </span>                : 
-<span class="lineNum">     190 </span>                :   template&lt;typename _CharT, typename _Traits&gt;
-<span class="lineNum">     191 </span>                :     inline basic_ostream&lt;_CharT, _Traits&gt;&amp; 
-<span class="lineNum">     192 </span><span class="lineNoCov">              0 :     operator&lt;&lt;(basic_ostream&lt;_CharT, _Traits&gt;&amp; __os, _Setfill&lt;_CharT&gt; __f)</span>
-<span class="lineNum">     193 </span>                :     { 
-<span class="lineNum">     194 </span><span class="lineNoCov">              0 :       __os.fill(__f._M_c); </span>
-<span class="lineNum">     195 </span><span class="lineNoCov">              0 :       return __os; </span>
-<span class="lineNum">     196 </span>                :     }
-<span class="lineNum">     197 </span>                : 
-<span class="lineNum">     198 </span>                : 
-<span class="lineNum">     199 </span>                :   struct _Setprecision { int _M_n; };
-<span class="lineNum">     200 </span>                : 
-<span class="lineNum">     201 </span>                :   /**
-<span class="lineNum">     202 </span>                :    *  @brief  Manipulator for @c precision.
-<span class="lineNum">     203 </span>                :    *  @param  n  The new precision.
-<span class="lineNum">     204 </span>                :    *
-<span class="lineNum">     205 </span>                :    *  Sent to a stream object, this manipulator calls @c precision(n) for
-<span class="lineNum">     206 </span>                :    *  that object.
-<span class="lineNum">     207 </span>                :   */
-<span class="lineNum">     208 </span>                :   inline _Setprecision 
-<span class="lineNum">     209 </span>                :   setprecision(int __n)
-<span class="lineNum">     210 </span>                :   { 
-<span class="lineNum">     211 </span>                :     _Setprecision __x; 
-<span class="lineNum">     212 </span>                :     __x._M_n = __n; 
-<span class="lineNum">     213 </span>                :     return __x; 
-<span class="lineNum">     214 </span>                :   }
-<span class="lineNum">     215 </span>                : 
-<span class="lineNum">     216 </span>                :   template&lt;typename _CharT, typename _Traits&gt;
-<span class="lineNum">     217 </span>                :     inline basic_istream&lt;_CharT, _Traits&gt;&amp; 
-<span class="lineNum">     218 </span>                :     operator&gt;&gt;(basic_istream&lt;_CharT, _Traits&gt;&amp; __is, _Setprecision __f)
-<span class="lineNum">     219 </span>                :     { 
-<span class="lineNum">     220 </span>                :       __is.precision(__f._M_n); 
-<span class="lineNum">     221 </span>                :       return __is; 
-<span class="lineNum">     222 </span>                :     }
-<span class="lineNum">     223 </span>                : 
-<span class="lineNum">     224 </span>                :   template&lt;typename _CharT, typename _Traits&gt;
-<span class="lineNum">     225 </span>                :     inline basic_ostream&lt;_CharT, _Traits&gt;&amp; 
-<span class="lineNum">     226 </span>                :     operator&lt;&lt;(basic_ostream&lt;_CharT, _Traits&gt;&amp; __os, _Setprecision __f)
-<span class="lineNum">     227 </span>                :     { 
-<span class="lineNum">     228 </span>                :       __os.precision(__f._M_n); 
-<span class="lineNum">     229 </span>                :       return __os; 
-<span class="lineNum">     230 </span>                :     }
-<span class="lineNum">     231 </span>                : 
-<span class="lineNum">     232 </span>                : 
-<span class="lineNum">     233 </span>                :   struct _Setw { int _M_n; };
-<span class="lineNum">     234 </span>                : 
-<span class="lineNum">     235 </span>                :   /**
-<span class="lineNum">     236 </span>                :    *  @brief  Manipulator for @c width.
-<span class="lineNum">     237 </span>                :    *  @param  n  The new width.
-<span class="lineNum">     238 </span>                :    *
-<span class="lineNum">     239 </span>                :    *  Sent to a stream object, this manipulator calls @c width(n) for
-<span class="lineNum">     240 </span>                :    *  that object.
-<span class="lineNum">     241 </span>                :   */
-<span class="lineNum">     242 </span>                :   inline _Setw 
-<span class="lineNum">     243 </span><span class="lineCov">            165 :   setw(int __n)</span>
-<span class="lineNum">     244 </span>                :   { 
-<span class="lineNum">     245 </span>                :     _Setw __x; 
-<span class="lineNum">     246 </span><span class="lineCov">            165 :     __x._M_n = __n; </span>
-<span class="lineNum">     247 </span>                :     return __x; 
-<span class="lineNum">     248 </span>                :   }
-<span class="lineNum">     249 </span>                : 
-<span class="lineNum">     250 </span>                :   template&lt;typename _CharT, typename _Traits&gt;
-<span class="lineNum">     251 </span>                :     inline basic_istream&lt;_CharT, _Traits&gt;&amp; 
-<span class="lineNum">     252 </span>                :     operator&gt;&gt;(basic_istream&lt;_CharT, _Traits&gt;&amp; __is, _Setw __f)
-<span class="lineNum">     253 </span>                :     { 
-<span class="lineNum">     254 </span>                :       __is.width(__f._M_n); 
-<span class="lineNum">     255 </span>                :       return __is; 
-<span class="lineNum">     256 </span>                :     }
-<span class="lineNum">     257 </span>                : 
-<span class="lineNum">     258 </span>                :   template&lt;typename _CharT, typename _Traits&gt;
-<span class="lineNum">     259 </span>                :     inline basic_ostream&lt;_CharT, _Traits&gt;&amp; 
-<span class="lineNum">     260 </span><span class="lineNoCov">              0 :     operator&lt;&lt;(basic_ostream&lt;_CharT, _Traits&gt;&amp; __os, _Setw __f)</span>
-<span class="lineNum">     261 </span>                :     { 
-<span class="lineNum">     262 </span><span class="lineNoCov">              0 :       __os.width(__f._M_n); </span>
-<span class="lineNum">     263 </span><span class="lineNoCov">              0 :       return __os; </span>
-<span class="lineNum">     264 </span>                :     }
-<span class="lineNum">     265 </span>                : 
-<span class="lineNum">     266 </span>                :   // Inhibit implicit instantiations for required instantiations,
-<span class="lineNum">     267 </span>                :   // which are defined via explicit instantiations elsewhere.  
-<span class="lineNum">     268 </span>                :   // NB:  This syntax is a GNU extension.
-<span class="lineNum">     269 </span>                : #if _GLIBCXX_EXTERN_TEMPLATE
-<span class="lineNum">     270 </span>                :   extern template ostream&amp; operator&lt;&lt;(ostream&amp;, _Setfill&lt;char&gt;);
-<span class="lineNum">     271 </span>                :   extern template ostream&amp; operator&lt;&lt;(ostream&amp;, _Setiosflags);
-<span class="lineNum">     272 </span>                :   extern template ostream&amp; operator&lt;&lt;(ostream&amp;, _Resetiosflags);
-<span class="lineNum">     273 </span>                :   extern template ostream&amp; operator&lt;&lt;(ostream&amp;, _Setbase);
-<span class="lineNum">     274 </span>                :   extern template ostream&amp; operator&lt;&lt;(ostream&amp;, _Setprecision);
-<span class="lineNum">     275 </span>                :   extern template ostream&amp; operator&lt;&lt;(ostream&amp;, _Setw);
-<span class="lineNum">     276 </span>                :   extern template istream&amp; operator&gt;&gt;(istream&amp;, _Setfill&lt;char&gt;);
-<span class="lineNum">     277 </span>                :   extern template istream&amp; operator&gt;&gt;(istream&amp;, _Setiosflags);
-<span class="lineNum">     278 </span>                :   extern template istream&amp; operator&gt;&gt;(istream&amp;, _Resetiosflags);
-<span class="lineNum">     279 </span>                :   extern template istream&amp; operator&gt;&gt;(istream&amp;, _Setbase);
-<span class="lineNum">     280 </span>                :   extern template istream&amp; operator&gt;&gt;(istream&amp;, _Setprecision);
-<span class="lineNum">     281 </span>                :   extern template istream&amp; operator&gt;&gt;(istream&amp;, _Setw);
-<span class="lineNum">     282 </span>                : 
-<span class="lineNum">     283 </span>                : #ifdef _GLIBCXX_USE_WCHAR_T
-<span class="lineNum">     284 </span>                :   extern template wostream&amp; operator&lt;&lt;(wostream&amp;, _Setfill&lt;wchar_t&gt;);
-<span class="lineNum">     285 </span>                :   extern template wostream&amp; operator&lt;&lt;(wostream&amp;, _Setiosflags);
-<span class="lineNum">     286 </span>                :   extern template wostream&amp; operator&lt;&lt;(wostream&amp;, _Resetiosflags);
-<span class="lineNum">     287 </span>                :   extern template wostream&amp; operator&lt;&lt;(wostream&amp;, _Setbase);
-<span class="lineNum">     288 </span>                :   extern template wostream&amp; operator&lt;&lt;(wostream&amp;, _Setprecision);
-<span class="lineNum">     289 </span>                :   extern template wostream&amp; operator&lt;&lt;(wostream&amp;, _Setw);
-<span class="lineNum">     290 </span>                :   extern template wistream&amp; operator&gt;&gt;(wistream&amp;, _Setfill&lt;wchar_t&gt;);
-<span class="lineNum">     291 </span>                :   extern template wistream&amp; operator&gt;&gt;(wistream&amp;, _Setiosflags);
-<span class="lineNum">     292 </span>                :   extern template wistream&amp; operator&gt;&gt;(wistream&amp;, _Resetiosflags);
-<span class="lineNum">     293 </span>                :   extern template wistream&amp; operator&gt;&gt;(wistream&amp;, _Setbase);
-<span class="lineNum">     294 </span>                :   extern template wistream&amp; operator&gt;&gt;(wistream&amp;, _Setprecision);
-<span class="lineNum">     295 </span>                :   extern template wistream&amp; operator&gt;&gt;(wistream&amp;, _Setw);
-<span class="lineNum">     296 </span>                : #endif
-<span class="lineNum">     297 </span>                : #endif
-<span class="lineNum">     298 </span>                : 
-<span class="lineNum">     299 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">     300 </span>                : 
-<span class="lineNum">     301 </span>                : #endif /* _GLIBCXX_IOMANIP */
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/iosfwd.gcov.html b/rep/usr/include/c++/4.3/iosfwd.gcov.html
deleted file mode 100644
index 1509075..0000000
--- a/rep/usr/include/c++/4.3/iosfwd.gcov.html
+++ /dev/null
@@ -1,232 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/iosfwd</title>
-  <link rel="stylesheet" type="text/css" href="../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3</a> - iosfwd</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">1</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">0.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">0</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // Forwarding declarations -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005,
-<span class="lineNum">       4 </span>                : // 2006, 2007
-<span class="lineNum">       5 </span>                : // Free Software Foundation, Inc.
-<span class="lineNum">       6 </span>                : //
-<span class="lineNum">       7 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       8 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       9 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">      10 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      11 </span>                : // any later version.
-<span class="lineNum">      12 </span>                : 
-<span class="lineNum">      13 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      14 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      15 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      16 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      17 </span>                : 
-<span class="lineNum">      18 </span>                : // You should have received a copy of the GNU General Public License
-<span class="lineNum">      19 </span>                : // along with this library; see the file COPYING.  If not, write to
-<span class="lineNum">      20 </span>                : // the Free Software Foundation, 51 Franklin Street, Fifth Floor,
-<span class="lineNum">      21 </span>                : // Boston, MA 02110-1301, USA.
-<span class="lineNum">      22 </span>                : 
-<span class="lineNum">      23 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      24 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      25 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      26 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      27 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      28 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      29 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      30 </span>                : // the GNU General Public License.
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span>                : /** @file iosfwd
-<span class="lineNum">      33 </span>                :  *  This is a Standard C++ Library header.
-<span class="lineNum">      34 </span>                :  */
-<span class="lineNum">      35 </span>                : 
-<span class="lineNum">      36 </span>                : //
-<span class="lineNum">      37 </span>                : // ISO C++ 14882: 27.2  Forward declarations
-<span class="lineNum">      38 </span>                : //
-<span class="lineNum">      39 </span>                : 
-<span class="lineNum">      40 </span>                : #ifndef _GLIBCXX_IOSFWD
-<span class="lineNum">      41 </span>                : #define _GLIBCXX_IOSFWD 1
-<span class="lineNum">      42 </span>                : 
-<span class="lineNum">      43 </span>                : #pragma GCC system_header
-<span class="lineNum">      44 </span>                : 
-<span class="lineNum">      45 </span>                : #include &lt;bits/c++config.h&gt;
-<span class="lineNum">      46 </span>                : #include &lt;bits/stringfwd.h&gt;       // For string forward declarations.
-<span class="lineNum">      47 </span>                : #include &lt;bits/postypes.h&gt;
-<span class="lineNum">      48 </span>                : 
-<span class="lineNum">      49 </span>                : _GLIBCXX_BEGIN_NAMESPACE(std)
-<span class="lineNum">      50 </span>                : 
-<span class="lineNum">      51 </span>                :   template&lt;typename _CharT, typename _Traits = char_traits&lt;_CharT&gt; &gt;
-<span class="lineNum">      52 </span>                :     class basic_ios;
-<span class="lineNum">      53 </span>                : 
-<span class="lineNum">      54 </span>                :   template&lt;typename _CharT, typename _Traits = char_traits&lt;_CharT&gt; &gt;
-<span class="lineNum">      55 </span>                :     class basic_streambuf;
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span>                :   template&lt;typename _CharT, typename _Traits = char_traits&lt;_CharT&gt; &gt;
-<span class="lineNum">      58 </span>                :     class basic_istream;
-<span class="lineNum">      59 </span>                : 
-<span class="lineNum">      60 </span>                :   template&lt;typename _CharT, typename _Traits = char_traits&lt;_CharT&gt; &gt;
-<span class="lineNum">      61 </span>                :     class basic_ostream;
-<span class="lineNum">      62 </span>                : 
-<span class="lineNum">      63 </span>                :   template&lt;typename _CharT, typename _Traits = char_traits&lt;_CharT&gt; &gt;
-<span class="lineNum">      64 </span>                :     class basic_iostream;
-<span class="lineNum">      65 </span>                : 
-<span class="lineNum">      66 </span>                :   template&lt;typename _CharT, typename _Traits = char_traits&lt;_CharT&gt;,
-<span class="lineNum">      67 </span>                :             typename _Alloc = allocator&lt;_CharT&gt; &gt;
-<span class="lineNum">      68 </span><span class="lineNoCov">              0 :     class basic_stringbuf;</span>
-<span class="lineNum">      69 </span>                : 
-<span class="lineNum">      70 </span>                :   template&lt;typename _CharT, typename _Traits = char_traits&lt;_CharT&gt;,
-<span class="lineNum">      71 </span>                :            typename _Alloc = allocator&lt;_CharT&gt; &gt;
-<span class="lineNum">      72 </span>                :     class basic_istringstream;
-<span class="lineNum">      73 </span>                : 
-<span class="lineNum">      74 </span>                :   template&lt;typename _CharT, typename _Traits = char_traits&lt;_CharT&gt;,
-<span class="lineNum">      75 </span>                :            typename _Alloc = allocator&lt;_CharT&gt; &gt;
-<span class="lineNum">      76 </span>                :     class basic_ostringstream;
-<span class="lineNum">      77 </span>                : 
-<span class="lineNum">      78 </span>                :   template&lt;typename _CharT, typename _Traits = char_traits&lt;_CharT&gt;,
-<span class="lineNum">      79 </span>                :            typename _Alloc = allocator&lt;_CharT&gt; &gt;
-<span class="lineNum">      80 </span>                :     class basic_stringstream;
-<span class="lineNum">      81 </span>                : 
-<span class="lineNum">      82 </span>                :   template&lt;typename _CharT, typename _Traits = char_traits&lt;_CharT&gt; &gt;
-<span class="lineNum">      83 </span>                :     class basic_filebuf;
-<span class="lineNum">      84 </span>                : 
-<span class="lineNum">      85 </span>                :   template&lt;typename _CharT, typename _Traits = char_traits&lt;_CharT&gt; &gt;
-<span class="lineNum">      86 </span>                :     class basic_ifstream;
-<span class="lineNum">      87 </span>                : 
-<span class="lineNum">      88 </span>                :   template&lt;typename _CharT, typename _Traits = char_traits&lt;_CharT&gt; &gt;
-<span class="lineNum">      89 </span>                :     class basic_ofstream;
-<span class="lineNum">      90 </span>                : 
-<span class="lineNum">      91 </span>                :   template&lt;typename _CharT, typename _Traits = char_traits&lt;_CharT&gt; &gt;
-<span class="lineNum">      92 </span>                :     class basic_fstream;
-<span class="lineNum">      93 </span>                : 
-<span class="lineNum">      94 </span>                :   template&lt;typename _CharT, typename _Traits = char_traits&lt;_CharT&gt; &gt;
-<span class="lineNum">      95 </span>                :     class istreambuf_iterator;
-<span class="lineNum">      96 </span>                : 
-<span class="lineNum">      97 </span>                :   template&lt;typename _CharT, typename _Traits = char_traits&lt;_CharT&gt; &gt;
-<span class="lineNum">      98 </span>                :     class ostreambuf_iterator;
-<span class="lineNum">      99 </span>                : 
-<span class="lineNum">     100 </span>                :   // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     101 </span>                :   // Not included.   (??? Apparently no LWG number?)
-<span class="lineNum">     102 </span>                :   class ios_base; 
-<span class="lineNum">     103 </span>                : 
-<span class="lineNum">     104 </span>                :   /** 
-<span class="lineNum">     105 </span>                :    *  @defgroup s27_2_iosfwd I/O Forward Declarations
-<span class="lineNum">     106 </span>                :    *
-<span class="lineNum">     107 </span>                :    *  Nearly all of the I/O classes are parameterized on the type of
-<span class="lineNum">     108 </span>                :    *  characters they read and write.  (The major exception is ios_base at
-<span class="lineNum">     109 </span>                :    *  the top of the hierarchy.)  This is a change from pre-Standard
-<span class="lineNum">     110 </span>                :    *  streams, which were not templates.
-<span class="lineNum">     111 </span>                :    *
-<span class="lineNum">     112 </span>                :    *  For ease of use and compatibility, all of the basic_* I/O-related
-<span class="lineNum">     113 </span>                :    *  classes are given typedef names for both of the builtin character
-<span class="lineNum">     114 </span>                :    *  widths (wide and narrow).  The typedefs are the same as the
-<span class="lineNum">     115 </span>                :    *  pre-Standard names, for example:
-<span class="lineNum">     116 </span>                :    *
-<span class="lineNum">     117 </span>                :    *  @code
-<span class="lineNum">     118 </span>                :    *     typedef basic_ifstream&lt;char&gt;  ifstream;
-<span class="lineNum">     119 </span>                :    *  @endcode
-<span class="lineNum">     120 </span>                :    *
-<span class="lineNum">     121 </span>                :    *  Because properly forward-declaring these classes can be difficult, you
-<span class="lineNum">     122 </span>                :    *  should not do it yourself.  Instead, include the &amp;lt;iosfwd&amp;gt;
-<span class="lineNum">     123 </span>                :    *  header, which contains only declarations of all the I/O classes as
-<span class="lineNum">     124 </span>                :    *  well as the typedefs.  Trying to forward-declare the typedefs
-<span class="lineNum">     125 </span>                :    *  themselves (e.g., &quot;class ostream;&quot;) is not valid ISO C++.
-<span class="lineNum">     126 </span>                :    *
-<span class="lineNum">     127 </span>                :    *  For more specific declarations, see
-<span class="lineNum">     128 </span>                :    *  http://gcc.gnu.org/onlinedocs/libstdc++/27_io/howto.html#10
-<span class="lineNum">     129 </span>                :    *
-<span class="lineNum">     130 </span>                :    *  @{
-<span class="lineNum">     131 </span>                :   */
-<span class="lineNum">     132 </span>                :   typedef basic_ios&lt;char&gt;                 ios;            ///&lt; @isiosfwd
-<span class="lineNum">     133 </span>                :   typedef basic_streambuf&lt;char&gt;   streambuf;      ///&lt; @isiosfwd
-<span class="lineNum">     134 </span>                :   typedef basic_istream&lt;char&gt;             istream;        ///&lt; @isiosfwd
-<span class="lineNum">     135 </span>                :   typedef basic_ostream&lt;char&gt;             ostream;        ///&lt; @isiosfwd
-<span class="lineNum">     136 </span>                :   typedef basic_iostream&lt;char&gt;            iostream;       ///&lt; @isiosfwd
-<span class="lineNum">     137 </span>                :   typedef basic_stringbuf&lt;char&gt;   stringbuf;      ///&lt; @isiosfwd
-<span class="lineNum">     138 </span>                :   typedef basic_istringstream&lt;char&gt;       istringstream;  ///&lt; @isiosfwd
-<span class="lineNum">     139 </span>                :   typedef basic_ostringstream&lt;char&gt;       ostringstream;  ///&lt; @isiosfwd
-<span class="lineNum">     140 </span>                :   typedef basic_stringstream&lt;char&gt;        stringstream;   ///&lt; @isiosfwd
-<span class="lineNum">     141 </span>                :   typedef basic_filebuf&lt;char&gt;             filebuf;        ///&lt; @isiosfwd
-<span class="lineNum">     142 </span>                :   typedef basic_ifstream&lt;char&gt;            ifstream;       ///&lt; @isiosfwd
-<span class="lineNum">     143 </span>                :   typedef basic_ofstream&lt;char&gt;            ofstream;       ///&lt; @isiosfwd
-<span class="lineNum">     144 </span>                :   typedef basic_fstream&lt;char&gt;             fstream;        ///&lt; @isiosfwd
-<span class="lineNum">     145 </span>                : 
-<span class="lineNum">     146 </span>                : #ifdef _GLIBCXX_USE_WCHAR_T
-<span class="lineNum">     147 </span>                :   typedef basic_ios&lt;wchar_t&gt;              wios;           ///&lt; @isiosfwd
-<span class="lineNum">     148 </span>                :   typedef basic_streambuf&lt;wchar_t&gt;        wstreambuf;     ///&lt; @isiosfwd
-<span class="lineNum">     149 </span>                :   typedef basic_istream&lt;wchar_t&gt;  wistream;       ///&lt; @isiosfwd
-<span class="lineNum">     150 </span>                :   typedef basic_ostream&lt;wchar_t&gt;  wostream;       ///&lt; @isiosfwd
-<span class="lineNum">     151 </span>                :   typedef basic_iostream&lt;wchar_t&gt;         wiostream;      ///&lt; @isiosfwd
-<span class="lineNum">     152 </span>                :   typedef basic_stringbuf&lt;wchar_t&gt;        wstringbuf;     ///&lt; @isiosfwd
-<span class="lineNum">     153 </span>                :   typedef basic_istringstream&lt;wchar_t&gt;    wistringstream; ///&lt; @isiosfwd
-<span class="lineNum">     154 </span>                :   typedef basic_ostringstream&lt;wchar_t&gt;    wostringstream; ///&lt; @isiosfwd
-<span class="lineNum">     155 </span>                :   typedef basic_stringstream&lt;wchar_t&gt;     wstringstream;  ///&lt; @isiosfwd
-<span class="lineNum">     156 </span>                :   typedef basic_filebuf&lt;wchar_t&gt;  wfilebuf;       ///&lt; @isiosfwd
-<span class="lineNum">     157 </span>                :   typedef basic_ifstream&lt;wchar_t&gt;         wifstream;      ///&lt; @isiosfwd
-<span class="lineNum">     158 </span>                :   typedef basic_ofstream&lt;wchar_t&gt;         wofstream;      ///&lt; @isiosfwd
-<span class="lineNum">     159 </span>                :   typedef basic_fstream&lt;wchar_t&gt;  wfstream;       ///&lt; @isiosfwd
-<span class="lineNum">     160 </span>                : #endif
-<span class="lineNum">     161 </span>                :   /** @}  */
-<span class="lineNum">     162 </span>                : 
-<span class="lineNum">     163 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">     164 </span>                : 
-<span class="lineNum">     165 </span>                : #endif /* _GLIBCXX_IOSFWD */
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/iostream.gcov.html b/rep/usr/include/c++/4.3/iostream.gcov.html
deleted file mode 100644
index 26372c4..0000000
--- a/rep/usr/include/c++/4.3/iostream.gcov.html
+++ /dev/null
@@ -1,148 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/iostream</title>
-  <link rel="stylesheet" type="text/css" href="../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3</a> - iostream</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">1</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">1</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // Standard iostream objects -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 1997, 1998, 1999, 2001, 2002, 2005
-<span class="lineNum">       4 </span>                : // Free Software Foundation, Inc.
-<span class="lineNum">       5 </span>                : //
-<span class="lineNum">       6 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       7 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       8 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">       9 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      10 </span>                : // any later version.
-<span class="lineNum">      11 </span>                : 
-<span class="lineNum">      12 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      13 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      14 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      15 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      16 </span>                : 
-<span class="lineNum">      17 </span>                : // You should have received a copy of the GNU General Public License
-<span class="lineNum">      18 </span>                : // along with this library; see the file COPYING.  If not, write to
-<span class="lineNum">      19 </span>                : // the Free Software Foundation, 51 Franklin Street, Fifth Floor,
-<span class="lineNum">      20 </span>                : // Boston, MA 02110-1301, USA.
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      23 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      24 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      25 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      26 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      27 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      28 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      29 </span>                : // the GNU General Public License.
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : /** @file iostream
-<span class="lineNum">      32 </span>                :  *  This is a Standard C++ Library header. 
-<span class="lineNum">      33 </span>                :  */
-<span class="lineNum">      34 </span>                : 
-<span class="lineNum">      35 </span>                : //
-<span class="lineNum">      36 </span>                : // ISO C++ 14882: 27.3  Standard iostream objects
-<span class="lineNum">      37 </span>                : //
-<span class="lineNum">      38 </span>                : 
-<span class="lineNum">      39 </span>                : #ifndef _GLIBCXX_IOSTREAM
-<span class="lineNum">      40 </span>                : #define _GLIBCXX_IOSTREAM 1
-<span class="lineNum">      41 </span>                : 
-<span class="lineNum">      42 </span>                : #pragma GCC system_header
-<span class="lineNum">      43 </span>                : 
-<span class="lineNum">      44 </span>                : #include &lt;bits/c++config.h&gt;
-<span class="lineNum">      45 </span>                : #include &lt;ostream&gt;
-<span class="lineNum">      46 </span>                : #include &lt;istream&gt;
-<span class="lineNum">      47 </span>                : 
-<span class="lineNum">      48 </span>                : _GLIBCXX_BEGIN_NAMESPACE(std)
-<span class="lineNum">      49 </span>                : 
-<span class="lineNum">      50 </span>                :   /**
-<span class="lineNum">      51 </span>                :    *  @name Standard Stream Objects
-<span class="lineNum">      52 </span>                :    *
-<span class="lineNum">      53 </span>                :    *  The &amp;lt;iostream&amp;gt; header declares the eight &lt;em&gt;standard stream
-<span class="lineNum">      54 </span>                :    *  objects&lt;/em&gt;.  For other declarations, see
-<span class="lineNum">      55 </span>                :    *  http://gcc.gnu.org/onlinedocs/libstdc++/27_io/howto.html#10 and the
-<span class="lineNum">      56 </span>                :    *  @link s27_2_iosfwd I/O forward declarations @endlink
-<span class="lineNum">      57 </span>                :    *
-<span class="lineNum">      58 </span>                :    *  They are required by default to cooperate with the global C library's
-<span class="lineNum">      59 </span>                :    *  @c FILE streams, and to be available during program startup and
-<span class="lineNum">      60 </span>                :    *  termination.  For more information, see the HOWTO linked to above.
-<span class="lineNum">      61 </span>                :   */
-<span class="lineNum">      62 </span>                :   //@{
-<span class="lineNum">      63 </span>                :   extern istream cin;           ///&lt; Linked to standard input
-<span class="lineNum">      64 </span>                :   extern ostream cout;          ///&lt; Linked to standard output
-<span class="lineNum">      65 </span>                :   extern ostream cerr;          ///&lt; Linked to standard error (unbuffered)
-<span class="lineNum">      66 </span>                :   extern ostream clog;          ///&lt; Linked to standard error (buffered)
-<span class="lineNum">      67 </span>                : 
-<span class="lineNum">      68 </span>                : #ifdef _GLIBCXX_USE_WCHAR_T
-<span class="lineNum">      69 </span>                :   extern wistream wcin;         ///&lt; Linked to standard input
-<span class="lineNum">      70 </span>                :   extern wostream wcout;        ///&lt; Linked to standard output
-<span class="lineNum">      71 </span>                :   extern wostream wcerr;        ///&lt; Linked to standard error (unbuffered)
-<span class="lineNum">      72 </span>                :   extern wostream wclog;        ///&lt; Linked to standard error (buffered)
-<span class="lineNum">      73 </span>                : #endif
-<span class="lineNum">      74 </span>                :   //@}
-<span class="lineNum">      75 </span>                : 
-<span class="lineNum">      76 </span>                :   // For construction of filebuffers for cout, cin, cerr, clog et. al.
-<span class="lineNum">      77 </span><span class="lineCov">            104 :   static ios_base::Init __ioinit;</span>
-<span class="lineNum">      78 </span>                : 
-<span class="lineNum">      79 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">      80 </span>                : 
-<span class="lineNum">      81 </span>                : #endif /* _GLIBCXX_IOSTREAM */
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/istream.gcov.html b/rep/usr/include/c++/4.3/istream.gcov.html
deleted file mode 100644
index e8ffaf0..0000000
--- a/rep/usr/include/c++/4.3/istream.gcov.html
+++ /dev/null
@@ -1,906 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/istream</title>
-  <link rel="stylesheet" type="text/css" href="../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3</a> - istream</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">8</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">0.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">0</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // Input streams -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005,
-<span class="lineNum">       4 </span>                : // 2006, 2007, 2008
-<span class="lineNum">       5 </span>                : // Free Software Foundation, Inc.
-<span class="lineNum">       6 </span>                : //
-<span class="lineNum">       7 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       8 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       9 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">      10 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      11 </span>                : // any later version.
-<span class="lineNum">      12 </span>                : 
-<span class="lineNum">      13 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      14 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      15 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      16 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      17 </span>                : 
-<span class="lineNum">      18 </span>                : // You should have received a copy of the GNU General Public License
-<span class="lineNum">      19 </span>                : // along with this library; see the file COPYING.  If not, write to
-<span class="lineNum">      20 </span>                : // the Free Software Foundation, 51 Franklin Street, Fifth Floor,
-<span class="lineNum">      21 </span>                : // Boston, MA 02110-1301, USA.
-<span class="lineNum">      22 </span>                : 
-<span class="lineNum">      23 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      24 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      25 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      26 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      27 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      28 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      29 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      30 </span>                : // the GNU General Public License.
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span>                : //
-<span class="lineNum">      33 </span>                : // ISO C++ 14882: 27.6.1  Input streams
-<span class="lineNum">      34 </span>                : //
-<span class="lineNum">      35 </span>                : 
-<span class="lineNum">      36 </span>                : /** @file istream
-<span class="lineNum">      37 </span>                :  *  This is a Standard C++ Library header.
-<span class="lineNum">      38 </span>                :  */
-<span class="lineNum">      39 </span>                : 
-<span class="lineNum">      40 </span>                : #ifndef _GLIBCXX_ISTREAM
-<span class="lineNum">      41 </span>                : #define _GLIBCXX_ISTREAM 1
-<span class="lineNum">      42 </span>                : 
-<span class="lineNum">      43 </span>                : #pragma GCC system_header
-<span class="lineNum">      44 </span>                : 
-<span class="lineNum">      45 </span>                : #include &lt;ios&gt;
-<span class="lineNum">      46 </span>                : #include &lt;ostream&gt;
-<span class="lineNum">      47 </span>                : 
-<span class="lineNum">      48 </span>                : _GLIBCXX_BEGIN_NAMESPACE(std)
-<span class="lineNum">      49 </span>                : 
-<span class="lineNum">      50 </span>                :   // [27.6.1.1] Template class basic_istream
-<span class="lineNum">      51 </span>                :   /**
-<span class="lineNum">      52 </span>                :    *  @brief  Controlling input.
-<span class="lineNum">      53 </span>                :    *
-<span class="lineNum">      54 </span>                :    *  This is the base class for all input streams.  It provides text
-<span class="lineNum">      55 </span>                :    *  formatting of all builtin types, and communicates with any class
-<span class="lineNum">      56 </span>                :    *  derived from basic_streambuf to do the actual input.
-<span class="lineNum">      57 </span>                :   */
-<span class="lineNum">      58 </span>                :   template&lt;typename _CharT, typename _Traits&gt;
-<span class="lineNum">      59 </span>                :     class basic_istream : virtual public basic_ios&lt;_CharT, _Traits&gt;
-<span class="lineNum">      60 </span>                :     {
-<span class="lineNum">      61 </span>                :     public:
-<span class="lineNum">      62 </span>                :       // Types (inherited from basic_ios (27.4.4)):
-<span class="lineNum">      63 </span>                :       typedef _CharT                                    char_type;
-<span class="lineNum">      64 </span>                :       typedef typename _Traits::int_type                int_type;
-<span class="lineNum">      65 </span>                :       typedef typename _Traits::pos_type                pos_type;
-<span class="lineNum">      66 </span>                :       typedef typename _Traits::off_type                off_type;
-<span class="lineNum">      67 </span>                :       typedef _Traits                                   traits_type;
-<span class="lineNum">      68 </span>                :       
-<span class="lineNum">      69 </span>                :       // Non-standard Types:
-<span class="lineNum">      70 </span>                :       typedef basic_streambuf&lt;_CharT, _Traits&gt;            __streambuf_type;
-<span class="lineNum">      71 </span>                :       typedef basic_ios&lt;_CharT, _Traits&gt;          __ios_type;
-<span class="lineNum">      72 </span>                :       typedef basic_istream&lt;_CharT, _Traits&gt;              __istream_type;
-<span class="lineNum">      73 </span>                :       typedef num_get&lt;_CharT, istreambuf_iterator&lt;_CharT, _Traits&gt; &gt;        
-<span class="lineNum">      74 </span>                :                                                         __num_get_type;
-<span class="lineNum">      75 </span>                :       typedef ctype&lt;_CharT&gt;                               __ctype_type;
-<span class="lineNum">      76 </span>                : 
-<span class="lineNum">      77 </span>                :     protected:
-<span class="lineNum">      78 </span>                :       // Data Members:
-<span class="lineNum">      79 </span>                :       /**
-<span class="lineNum">      80 </span>                :        *  The number of characters extracted in the previous unformatted
-<span class="lineNum">      81 </span>                :        *  function; see gcount().
-<span class="lineNum">      82 </span>                :       */
-<span class="lineNum">      83 </span>                :       streamsize                _M_gcount;
-<span class="lineNum">      84 </span>                : 
-<span class="lineNum">      85 </span>                :     public:
-<span class="lineNum">      86 </span>                :       // [27.6.1.1.1] constructor/destructor
-<span class="lineNum">      87 </span>                :       /**
-<span class="lineNum">      88 </span>                :        *  @brief  Base constructor.
-<span class="lineNum">      89 </span>                :        *
-<span class="lineNum">      90 </span>                :        *  This ctor is almost never called by the user directly, rather from
-<span class="lineNum">      91 </span>                :        *  derived classes' initialization lists, which pass a pointer to
-<span class="lineNum">      92 </span>                :        *  their own stream buffer.
-<span class="lineNum">      93 </span>                :       */
-<span class="lineNum">      94 </span>                :       explicit
-<span class="lineNum">      95 </span>                :       basic_istream(__streambuf_type* __sb)
-<span class="lineNum">      96 </span>                :       : _M_gcount(streamsize(0))
-<span class="lineNum">      97 </span>                :       { this-&gt;init(__sb); }
-<span class="lineNum">      98 </span>                : 
-<span class="lineNum">      99 </span>                :       /**
-<span class="lineNum">     100 </span>                :        *  @brief  Base destructor.
-<span class="lineNum">     101 </span>                :        *
-<span class="lineNum">     102 </span>                :        *  This does very little apart from providing a virtual base dtor.
-<span class="lineNum">     103 </span>                :       */
-<span class="lineNum">     104 </span>                :       virtual 
-<span class="lineNum">     105 </span><span class="lineNoCov">              0 :       ~basic_istream() </span>
-<span class="lineNum">     106 </span><span class="lineNoCov">              0 :       { _M_gcount = streamsize(0); }</span>
-<span class="lineNum">     107 </span>                : 
-<span class="lineNum">     108 </span>                :       // [27.6.1.1.2] prefix/suffix
-<span class="lineNum">     109 </span>                :       class sentry;
-<span class="lineNum">     110 </span>                :       friend class sentry;
-<span class="lineNum">     111 </span>                : 
-<span class="lineNum">     112 </span>                :       // [27.6.1.2] formatted input
-<span class="lineNum">     113 </span>                :       // [27.6.1.2.3] basic_istream::operator&gt;&gt;
-<span class="lineNum">     114 </span>                :       //@{
-<span class="lineNum">     115 </span>                :       /**
-<span class="lineNum">     116 </span>                :        *  @brief  Interface for manipulators.
-<span class="lineNum">     117 </span>                :        *
-<span class="lineNum">     118 </span>                :        *  Manipulators such as @c std::ws and @c std::dec use these
-<span class="lineNum">     119 </span>                :        *  functions in constructs like &quot;std::cin &gt;&gt; std::ws&quot;.  For more
-<span class="lineNum">     120 </span>                :        *  information, see the iomanip header.
-<span class="lineNum">     121 </span>                :       */
-<span class="lineNum">     122 </span>                :       __istream_type&amp;
-<span class="lineNum">     123 </span>                :       operator&gt;&gt;(__istream_type&amp; (*__pf)(__istream_type&amp;))
-<span class="lineNum">     124 </span>                :       { return __pf(*this); }
-<span class="lineNum">     125 </span>                : 
-<span class="lineNum">     126 </span>                :       __istream_type&amp;
-<span class="lineNum">     127 </span>                :       operator&gt;&gt;(__ios_type&amp; (*__pf)(__ios_type&amp;))
-<span class="lineNum">     128 </span>                :       { 
-<span class="lineNum">     129 </span>                :         __pf(*this);
-<span class="lineNum">     130 </span>                :         return *this;
-<span class="lineNum">     131 </span>                :       }
-<span class="lineNum">     132 </span>                : 
-<span class="lineNum">     133 </span>                :       __istream_type&amp;
-<span class="lineNum">     134 </span>                :       operator&gt;&gt;(ios_base&amp; (*__pf)(ios_base&amp;))
-<span class="lineNum">     135 </span>                :       {
-<span class="lineNum">     136 </span>                :         __pf(*this);
-<span class="lineNum">     137 </span>                :         return *this;
-<span class="lineNum">     138 </span>                :       }
-<span class="lineNum">     139 </span>                :       //@}
-<span class="lineNum">     140 </span>                :       
-<span class="lineNum">     141 </span>                :       // [27.6.1.2.2] arithmetic extractors
-<span class="lineNum">     142 </span>                :       /**
-<span class="lineNum">     143 </span>                :        *  @name Arithmetic Extractors
-<span class="lineNum">     144 </span>                :        *
-<span class="lineNum">     145 </span>                :        *  All the @c operator&gt;&gt; functions (aka &lt;em&gt;formatted input
-<span class="lineNum">     146 </span>                :        *  functions&lt;/em&gt;) have some common behavior.  Each starts by
-<span class="lineNum">     147 </span>                :        *  constructing a temporary object of type std::basic_istream::sentry
-<span class="lineNum">     148 </span>                :        *  with the second argument (noskipws) set to false.  This has several
-<span class="lineNum">     149 </span>                :        *  effects, concluding with the setting of a status flag; see the
-<span class="lineNum">     150 </span>                :        *  sentry documentation for more.
-<span class="lineNum">     151 </span>                :        *
-<span class="lineNum">     152 </span>                :        *  If the sentry status is good, the function tries to extract
-<span class="lineNum">     153 </span>                :        *  whatever data is appropriate for the type of the argument.
-<span class="lineNum">     154 </span>                :        *
-<span class="lineNum">     155 </span>                :        *  If an exception is thrown during extraction, ios_base::badbit
-<span class="lineNum">     156 </span>                :        *  will be turned on in the stream's error state without causing an
-<span class="lineNum">     157 </span>                :        *  ios_base::failure to be thrown.  The original exception will then
-<span class="lineNum">     158 </span>                :        *  be rethrown.
-<span class="lineNum">     159 </span>                :       */
-<span class="lineNum">     160 </span>                :       //@{
-<span class="lineNum">     161 </span>                :       /**
-<span class="lineNum">     162 </span>                :        *  @brief  Basic arithmetic extractors
-<span class="lineNum">     163 </span>                :        *  @param  A variable of builtin type.
-<span class="lineNum">     164 </span>                :        *  @return  @c *this if successful
-<span class="lineNum">     165 </span>                :        *
-<span class="lineNum">     166 </span>                :        *  These functions use the stream's current locale (specifically, the
-<span class="lineNum">     167 </span>                :        *  @c num_get facet) to parse the input data.
-<span class="lineNum">     168 </span>                :       */
-<span class="lineNum">     169 </span>                :       __istream_type&amp; 
-<span class="lineNum">     170 </span>                :       operator&gt;&gt;(bool&amp; __n)
-<span class="lineNum">     171 </span>                :       { return _M_extract(__n); }
-<span class="lineNum">     172 </span>                :       
-<span class="lineNum">     173 </span>                :       __istream_type&amp; 
-<span class="lineNum">     174 </span>                :       operator&gt;&gt;(short&amp; __n);
-<span class="lineNum">     175 </span>                :       
-<span class="lineNum">     176 </span>                :       __istream_type&amp; 
-<span class="lineNum">     177 </span>                :       operator&gt;&gt;(unsigned short&amp; __n)
-<span class="lineNum">     178 </span>                :       { return _M_extract(__n); }
-<span class="lineNum">     179 </span>                : 
-<span class="lineNum">     180 </span>                :       __istream_type&amp; 
-<span class="lineNum">     181 </span>                :       operator&gt;&gt;(int&amp; __n);
-<span class="lineNum">     182 </span>                :     
-<span class="lineNum">     183 </span>                :       __istream_type&amp; 
-<span class="lineNum">     184 </span>                :       operator&gt;&gt;(unsigned int&amp; __n)
-<span class="lineNum">     185 </span>                :       { return _M_extract(__n); }
-<span class="lineNum">     186 </span>                : 
-<span class="lineNum">     187 </span>                :       __istream_type&amp; 
-<span class="lineNum">     188 </span>                :       operator&gt;&gt;(long&amp; __n)
-<span class="lineNum">     189 </span>                :       { return _M_extract(__n); }
-<span class="lineNum">     190 </span>                :       
-<span class="lineNum">     191 </span>                :       __istream_type&amp; 
-<span class="lineNum">     192 </span>                :       operator&gt;&gt;(unsigned long&amp; __n)
-<span class="lineNum">     193 </span>                :       { return _M_extract(__n); }
-<span class="lineNum">     194 </span>                : 
-<span class="lineNum">     195 </span>                : #ifdef _GLIBCXX_USE_LONG_LONG
-<span class="lineNum">     196 </span>                :       __istream_type&amp; 
-<span class="lineNum">     197 </span>                :       operator&gt;&gt;(long long&amp; __n)
-<span class="lineNum">     198 </span>                :       { return _M_extract(__n); }
-<span class="lineNum">     199 </span>                : 
-<span class="lineNum">     200 </span>                :       __istream_type&amp; 
-<span class="lineNum">     201 </span>                :       operator&gt;&gt;(unsigned long long&amp; __n)
-<span class="lineNum">     202 </span>                :       { return _M_extract(__n); }
-<span class="lineNum">     203 </span>                : #endif
-<span class="lineNum">     204 </span>                : 
-<span class="lineNum">     205 </span>                :       __istream_type&amp; 
-<span class="lineNum">     206 </span>                :       operator&gt;&gt;(float&amp; __f)
-<span class="lineNum">     207 </span>                :       { return _M_extract(__f); }
-<span class="lineNum">     208 </span>                : 
-<span class="lineNum">     209 </span>                :       __istream_type&amp; 
-<span class="lineNum">     210 </span>                :       operator&gt;&gt;(double&amp; __f)
-<span class="lineNum">     211 </span>                :       { return _M_extract(__f); }
-<span class="lineNum">     212 </span>                : 
-<span class="lineNum">     213 </span>                :       __istream_type&amp; 
-<span class="lineNum">     214 </span>                :       operator&gt;&gt;(long double&amp; __f)
-<span class="lineNum">     215 </span>                :       { return _M_extract(__f); }
-<span class="lineNum">     216 </span>                : 
-<span class="lineNum">     217 </span>                :       __istream_type&amp; 
-<span class="lineNum">     218 </span>                :       operator&gt;&gt;(void*&amp; __p)
-<span class="lineNum">     219 </span>                :       { return _M_extract(__p); }
-<span class="lineNum">     220 </span>                : 
-<span class="lineNum">     221 </span>                :       /**
-<span class="lineNum">     222 </span>                :        *  @brief  Extracting into another streambuf.
-<span class="lineNum">     223 </span>                :        *  @param  sb  A pointer to a streambuf
-<span class="lineNum">     224 </span>                :        *
-<span class="lineNum">     225 </span>                :        *  This function behaves like one of the basic arithmetic extractors,
-<span class="lineNum">     226 </span>                :        *  in that it also constructs a sentry object and has the same error
-<span class="lineNum">     227 </span>                :        *  handling behavior.
-<span class="lineNum">     228 </span>                :        *
-<span class="lineNum">     229 </span>                :        *  If @a sb is NULL, the stream will set failbit in its error state.
-<span class="lineNum">     230 </span>                :        *
-<span class="lineNum">     231 </span>                :        *  Characters are extracted from this stream and inserted into the
-<span class="lineNum">     232 </span>                :        *  @a sb streambuf until one of the following occurs:
-<span class="lineNum">     233 </span>                :        *
-<span class="lineNum">     234 </span>                :        *  - the input stream reaches end-of-file,
-<span class="lineNum">     235 </span>                :        *  - insertion into the output buffer fails (in this case, the
-<span class="lineNum">     236 </span>                :        *    character that would have been inserted is not extracted), or
-<span class="lineNum">     237 </span>                :        *  - an exception occurs (and in this case is caught)
-<span class="lineNum">     238 </span>                :        *
-<span class="lineNum">     239 </span>                :        *  If the function inserts no characters, failbit is set.
-<span class="lineNum">     240 </span>                :       */
-<span class="lineNum">     241 </span>                :       __istream_type&amp; 
-<span class="lineNum">     242 </span>                :       operator&gt;&gt;(__streambuf_type* __sb);
-<span class="lineNum">     243 </span>                :       //@}
-<span class="lineNum">     244 </span>                :       
-<span class="lineNum">     245 </span>                :       // [27.6.1.3] unformatted input
-<span class="lineNum">     246 </span>                :       /**
-<span class="lineNum">     247 </span>                :        *  @brief  Character counting
-<span class="lineNum">     248 </span>                :        *  @return  The number of characters extracted by the previous
-<span class="lineNum">     249 </span>                :        *           unformatted input function dispatched for this stream.
-<span class="lineNum">     250 </span>                :       */
-<span class="lineNum">     251 </span>                :       streamsize 
-<span class="lineNum">     252 </span>                :       gcount() const 
-<span class="lineNum">     253 </span>                :       { return _M_gcount; }
-<span class="lineNum">     254 </span>                :       
-<span class="lineNum">     255 </span>                :       /**
-<span class="lineNum">     256 </span>                :        *  @name Unformatted Input Functions
-<span class="lineNum">     257 </span>                :        *
-<span class="lineNum">     258 </span>                :        *  All the unformatted input functions have some common behavior.
-<span class="lineNum">     259 </span>                :        *  Each starts by constructing a temporary object of type
-<span class="lineNum">     260 </span>                :        *  std::basic_istream::sentry with the second argument (noskipws)
-<span class="lineNum">     261 </span>                :        *  set to true.  This has several effects, concluding with the
-<span class="lineNum">     262 </span>                :        *  setting of a status flag; see the sentry documentation for more.
-<span class="lineNum">     263 </span>                :        *
-<span class="lineNum">     264 </span>                :        *  If the sentry status is good, the function tries to extract
-<span class="lineNum">     265 </span>                :        *  whatever data is appropriate for the type of the argument.
-<span class="lineNum">     266 </span>                :        *
-<span class="lineNum">     267 </span>                :        *  The number of characters extracted is stored for later retrieval
-<span class="lineNum">     268 </span>                :        *  by gcount().
-<span class="lineNum">     269 </span>                :        *
-<span class="lineNum">     270 </span>                :        *  If an exception is thrown during extraction, ios_base::badbit
-<span class="lineNum">     271 </span>                :        *  will be turned on in the stream's error state without causing an
-<span class="lineNum">     272 </span>                :        *  ios_base::failure to be thrown.  The original exception will then
-<span class="lineNum">     273 </span>                :        *  be rethrown.
-<span class="lineNum">     274 </span>                :       */
-<span class="lineNum">     275 </span>                :       //@{
-<span class="lineNum">     276 </span>                :       /**
-<span class="lineNum">     277 </span>                :        *  @brief  Simple extraction.
-<span class="lineNum">     278 </span>                :        *  @return  A character, or eof().
-<span class="lineNum">     279 </span>                :        *
-<span class="lineNum">     280 </span>                :        *  Tries to extract a character.  If none are available, sets failbit
-<span class="lineNum">     281 </span>                :        *  and returns traits::eof().
-<span class="lineNum">     282 </span>                :       */
-<span class="lineNum">     283 </span>                :       int_type 
-<span class="lineNum">     284 </span>                :       get();
-<span class="lineNum">     285 </span>                : 
-<span class="lineNum">     286 </span>                :       /**
-<span class="lineNum">     287 </span>                :        *  @brief  Simple extraction.
-<span class="lineNum">     288 </span>                :        *  @param  c  The character in which to store data.
-<span class="lineNum">     289 </span>                :        *  @return  *this
-<span class="lineNum">     290 </span>                :        *
-<span class="lineNum">     291 </span>                :        *  Tries to extract a character and store it in @a c.  If none are
-<span class="lineNum">     292 </span>                :        *  available, sets failbit and returns traits::eof().
-<span class="lineNum">     293 </span>                :        *
-<span class="lineNum">     294 </span>                :        *  @note  This function is not overloaded on signed char and
-<span class="lineNum">     295 </span>                :        *         unsigned char.
-<span class="lineNum">     296 </span>                :       */
-<span class="lineNum">     297 </span>                :       __istream_type&amp; 
-<span class="lineNum">     298 </span>                :       get(char_type&amp; __c);
-<span class="lineNum">     299 </span>                : 
-<span class="lineNum">     300 </span>                :       /**
-<span class="lineNum">     301 </span>                :        *  @brief  Simple multiple-character extraction.
-<span class="lineNum">     302 </span>                :        *  @param  s  Pointer to an array.
-<span class="lineNum">     303 </span>                :        *  @param  n  Maximum number of characters to store in @a s.
-<span class="lineNum">     304 </span>                :        *  @param  delim  A &quot;stop&quot; character.
-<span class="lineNum">     305 </span>                :        *  @return  *this
-<span class="lineNum">     306 </span>                :        *
-<span class="lineNum">     307 </span>                :        *  Characters are extracted and stored into @a s until one of the
-<span class="lineNum">     308 </span>                :        *  following happens:
-<span class="lineNum">     309 </span>                :        *
-<span class="lineNum">     310 </span>                :        *  - @c n-1 characters are stored
-<span class="lineNum">     311 </span>                :        *  - the input sequence reaches EOF
-<span class="lineNum">     312 </span>                :        *  - the next character equals @a delim, in which case the character
-<span class="lineNum">     313 </span>                :        *    is not extracted
-<span class="lineNum">     314 </span>                :        *
-<span class="lineNum">     315 </span>                :        * If no characters are stored, failbit is set in the stream's error
-<span class="lineNum">     316 </span>                :        * state.
-<span class="lineNum">     317 </span>                :        *
-<span class="lineNum">     318 </span>                :        * In any case, a null character is stored into the next location in
-<span class="lineNum">     319 </span>                :        * the array.
-<span class="lineNum">     320 </span>                :        *
-<span class="lineNum">     321 </span>                :        *  @note  This function is not overloaded on signed char and
-<span class="lineNum">     322 </span>                :        *         unsigned char.
-<span class="lineNum">     323 </span>                :       */
-<span class="lineNum">     324 </span>                :       __istream_type&amp; 
-<span class="lineNum">     325 </span>                :       get(char_type* __s, streamsize __n, char_type __delim);
-<span class="lineNum">     326 </span>                : 
-<span class="lineNum">     327 </span>                :       /**
-<span class="lineNum">     328 </span>                :        *  @brief  Simple multiple-character extraction.
-<span class="lineNum">     329 </span>                :        *  @param  s  Pointer to an array.
-<span class="lineNum">     330 </span>                :        *  @param  n  Maximum number of characters to store in @a s.
-<span class="lineNum">     331 </span>                :        *  @return  *this
-<span class="lineNum">     332 </span>                :        *
-<span class="lineNum">     333 </span>                :        *  Returns @c get(s,n,widen('\n')).
-<span class="lineNum">     334 </span>                :       */
-<span class="lineNum">     335 </span>                :       __istream_type&amp; 
-<span class="lineNum">     336 </span>                :       get(char_type* __s, streamsize __n)
-<span class="lineNum">     337 </span>                :       { return this-&gt;get(__s, __n, this-&gt;widen('\n')); }
-<span class="lineNum">     338 </span>                : 
-<span class="lineNum">     339 </span>                :       /**
-<span class="lineNum">     340 </span>                :        *  @brief  Extraction into another streambuf.
-<span class="lineNum">     341 </span>                :        *  @param  sb  A streambuf in which to store data.
-<span class="lineNum">     342 </span>                :        *  @param  delim  A &quot;stop&quot; character.
-<span class="lineNum">     343 </span>                :        *  @return  *this
-<span class="lineNum">     344 </span>                :        *
-<span class="lineNum">     345 </span>                :        *  Characters are extracted and inserted into @a sb until one of the
-<span class="lineNum">     346 </span>                :        *  following happens:
-<span class="lineNum">     347 </span>                :        *
-<span class="lineNum">     348 </span>                :        *  - the input sequence reaches EOF
-<span class="lineNum">     349 </span>                :        *  - insertion into the output buffer fails (in this case, the
-<span class="lineNum">     350 </span>                :        *    character that would have been inserted is not extracted)
-<span class="lineNum">     351 </span>                :        *  - the next character equals @a delim (in this case, the character
-<span class="lineNum">     352 </span>                :        *    is not extracted)
-<span class="lineNum">     353 </span>                :        *  - an exception occurs (and in this case is caught)
-<span class="lineNum">     354 </span>                :        *
-<span class="lineNum">     355 </span>                :        * If no characters are stored, failbit is set in the stream's error
-<span class="lineNum">     356 </span>                :        * state.
-<span class="lineNum">     357 </span>                :       */
-<span class="lineNum">     358 </span>                :       __istream_type&amp;
-<span class="lineNum">     359 </span>                :       get(__streambuf_type&amp; __sb, char_type __delim);
-<span class="lineNum">     360 </span>                : 
-<span class="lineNum">     361 </span>                :       /**
-<span class="lineNum">     362 </span>                :        *  @brief  Extraction into another streambuf.
-<span class="lineNum">     363 </span>                :        *  @param  sb  A streambuf in which to store data.
-<span class="lineNum">     364 </span>                :        *  @return  *this
-<span class="lineNum">     365 </span>                :        *
-<span class="lineNum">     366 </span>                :        *  Returns @c get(sb,widen('\n')).
-<span class="lineNum">     367 </span>                :       */
-<span class="lineNum">     368 </span>                :       __istream_type&amp;
-<span class="lineNum">     369 </span>                :       get(__streambuf_type&amp; __sb)
-<span class="lineNum">     370 </span>                :       { return this-&gt;get(__sb, this-&gt;widen('\n')); }
-<span class="lineNum">     371 </span>                : 
-<span class="lineNum">     372 </span>                :       /**
-<span class="lineNum">     373 </span>                :        *  @brief  String extraction.
-<span class="lineNum">     374 </span>                :        *  @param  s  A character array in which to store the data.
-<span class="lineNum">     375 </span>                :        *  @param  n  Maximum number of characters to extract.
-<span class="lineNum">     376 </span>                :        *  @param  delim  A &quot;stop&quot; character.
-<span class="lineNum">     377 </span>                :        *  @return  *this
-<span class="lineNum">     378 </span>                :        *
-<span class="lineNum">     379 </span>                :        *  Extracts and stores characters into @a s until one of the
-<span class="lineNum">     380 </span>                :        *  following happens.  Note that these criteria are required to be
-<span class="lineNum">     381 </span>                :        *  tested in the order listed here, to allow an input line to exactly
-<span class="lineNum">     382 </span>                :        *  fill the @a s array without setting failbit.
-<span class="lineNum">     383 </span>                :        *
-<span class="lineNum">     384 </span>                :        *  -# the input sequence reaches end-of-file, in which case eofbit
-<span class="lineNum">     385 </span>                :        *     is set in the stream error state
-<span class="lineNum">     386 </span>                :        *  -# the next character equals @c delim, in which case the character
-<span class="lineNum">     387 </span>                :        *     is extracted (and therefore counted in @c gcount()) but not stored
-<span class="lineNum">     388 </span>                :        *  -# @c n-1 characters are stored, in which case failbit is set
-<span class="lineNum">     389 </span>                :        *     in the stream error state
-<span class="lineNum">     390 </span>                :        *
-<span class="lineNum">     391 </span>                :        *  If no characters are extracted, failbit is set.  (An empty line of
-<span class="lineNum">     392 </span>                :        *  input should therefore not cause failbit to be set.)
-<span class="lineNum">     393 </span>                :        *
-<span class="lineNum">     394 </span>                :        *  In any case, a null character is stored in the next location in
-<span class="lineNum">     395 </span>                :        *  the array.
-<span class="lineNum">     396 </span>                :       */
-<span class="lineNum">     397 </span>                :       __istream_type&amp; 
-<span class="lineNum">     398 </span>                :       getline(char_type* __s, streamsize __n, char_type __delim);
-<span class="lineNum">     399 </span>                : 
-<span class="lineNum">     400 </span>                :       /**
-<span class="lineNum">     401 </span>                :        *  @brief  String extraction.
-<span class="lineNum">     402 </span>                :        *  @param  s  A character array in which to store the data.
-<span class="lineNum">     403 </span>                :        *  @param  n  Maximum number of characters to extract.
-<span class="lineNum">     404 </span>                :        *  @return  *this
-<span class="lineNum">     405 </span>                :        *
-<span class="lineNum">     406 </span>                :        *  Returns @c getline(s,n,widen('\n')).
-<span class="lineNum">     407 </span>                :       */
-<span class="lineNum">     408 </span>                :       __istream_type&amp; 
-<span class="lineNum">     409 </span>                :       getline(char_type* __s, streamsize __n)
-<span class="lineNum">     410 </span>                :       { return this-&gt;getline(__s, __n, this-&gt;widen('\n')); }
-<span class="lineNum">     411 </span>                : 
-<span class="lineNum">     412 </span>                :       /**
-<span class="lineNum">     413 </span>                :        *  @brief  Discarding characters
-<span class="lineNum">     414 </span>                :        *  @param  n  Number of characters to discard.
-<span class="lineNum">     415 </span>                :        *  @param  delim  A &quot;stop&quot; character.
-<span class="lineNum">     416 </span>                :        *  @return  *this
-<span class="lineNum">     417 </span>                :        *
-<span class="lineNum">     418 </span>                :        *  Extracts characters and throws them away until one of the
-<span class="lineNum">     419 </span>                :        *  following happens:
-<span class="lineNum">     420 </span>                :        *  - if @a n @c != @c std::numeric_limits&lt;int&gt;::max(), @a n
-<span class="lineNum">     421 </span>                :        *    characters are extracted
-<span class="lineNum">     422 </span>                :        *  - the input sequence reaches end-of-file
-<span class="lineNum">     423 </span>                :        *  - the next character equals @a delim (in this case, the character
-<span class="lineNum">     424 </span>                :        *    is extracted); note that this condition will never occur if
-<span class="lineNum">     425 </span>                :        *    @a delim equals @c traits::eof().
-<span class="lineNum">     426 </span>                :        *
-<span class="lineNum">     427 </span>                :        *  NB: Provide three overloads, instead of the single function
-<span class="lineNum">     428 </span>                :        *  (with defaults) mandated by the Standard: this leads to a
-<span class="lineNum">     429 </span>                :        *  better performing implementation, while still conforming to
-<span class="lineNum">     430 </span>                :        *  the Standard.
-<span class="lineNum">     431 </span>                :       */
-<span class="lineNum">     432 </span>                :       __istream_type&amp; 
-<span class="lineNum">     433 </span>                :       ignore();
-<span class="lineNum">     434 </span>                : 
-<span class="lineNum">     435 </span>                :       __istream_type&amp; 
-<span class="lineNum">     436 </span>                :       ignore(streamsize __n);
-<span class="lineNum">     437 </span>                : 
-<span class="lineNum">     438 </span>                :       __istream_type&amp; 
-<span class="lineNum">     439 </span>                :       ignore(streamsize __n, int_type __delim);
-<span class="lineNum">     440 </span>                :       
-<span class="lineNum">     441 </span>                :       /**
-<span class="lineNum">     442 </span>                :        *  @brief  Looking ahead in the stream
-<span class="lineNum">     443 </span>                :        *  @return  The next character, or eof().
-<span class="lineNum">     444 </span>                :        *
-<span class="lineNum">     445 </span>                :        *  If, after constructing the sentry object, @c good() is false,
-<span class="lineNum">     446 </span>                :        *  returns @c traits::eof().  Otherwise reads but does not extract
-<span class="lineNum">     447 </span>                :        *  the next input character.
-<span class="lineNum">     448 </span>                :       */
-<span class="lineNum">     449 </span>                :       int_type 
-<span class="lineNum">     450 </span>                :       peek();
-<span class="lineNum">     451 </span>                :       
-<span class="lineNum">     452 </span>                :       /**
-<span class="lineNum">     453 </span>                :        *  @brief  Extraction without delimiters.
-<span class="lineNum">     454 </span>                :        *  @param  s  A character array.
-<span class="lineNum">     455 </span>                :        *  @param  n  Maximum number of characters to store.
-<span class="lineNum">     456 </span>                :        *  @return  *this
-<span class="lineNum">     457 </span>                :        *
-<span class="lineNum">     458 </span>                :        *  If the stream state is @c good(), extracts characters and stores
-<span class="lineNum">     459 </span>                :        *  them into @a s until one of the following happens:
-<span class="lineNum">     460 </span>                :        *  - @a n characters are stored
-<span class="lineNum">     461 </span>                :        *  - the input sequence reaches end-of-file, in which case the error
-<span class="lineNum">     462 </span>                :        *    state is set to @c failbit|eofbit.
-<span class="lineNum">     463 </span>                :        *
-<span class="lineNum">     464 </span>                :        *  @note  This function is not overloaded on signed char and
-<span class="lineNum">     465 </span>                :        *         unsigned char.
-<span class="lineNum">     466 </span>                :       */
-<span class="lineNum">     467 </span>                :       __istream_type&amp; 
-<span class="lineNum">     468 </span>                :       read(char_type* __s, streamsize __n);
-<span class="lineNum">     469 </span>                : 
-<span class="lineNum">     470 </span>                :       /**
-<span class="lineNum">     471 </span>                :        *  @brief  Extraction until the buffer is exhausted, but no more.
-<span class="lineNum">     472 </span>                :        *  @param  s  A character array.
-<span class="lineNum">     473 </span>                :        *  @param  n  Maximum number of characters to store.
-<span class="lineNum">     474 </span>                :        *  @return  The number of characters extracted.
-<span class="lineNum">     475 </span>                :        *
-<span class="lineNum">     476 </span>                :        *  Extracts characters and stores them into @a s depending on the
-<span class="lineNum">     477 </span>                :        *  number of characters remaining in the streambuf's buffer,
-<span class="lineNum">     478 </span>                :        *  @c rdbuf()-&gt;in_avail(), called @c A here:
-<span class="lineNum">     479 </span>                :        *  - if @c A @c == @c -1, sets eofbit and extracts no characters
-<span class="lineNum">     480 </span>                :        *  - if @c A @c == @c 0, extracts no characters
-<span class="lineNum">     481 </span>                :        *  - if @c A @c &gt; @c 0, extracts @c min(A,n)
-<span class="lineNum">     482 </span>                :        *
-<span class="lineNum">     483 </span>                :        *  The goal is to empty the current buffer, and to not request any
-<span class="lineNum">     484 </span>                :        *  more from the external input sequence controlled by the streambuf.
-<span class="lineNum">     485 </span>                :       */
-<span class="lineNum">     486 </span>                :       streamsize 
-<span class="lineNum">     487 </span>                :       readsome(char_type* __s, streamsize __n);
-<span class="lineNum">     488 </span>                :       
-<span class="lineNum">     489 </span>                :       /**
-<span class="lineNum">     490 </span>                :        *  @brief  Unextracting a single character.
-<span class="lineNum">     491 </span>                :        *  @param  c  The character to push back into the input stream.
-<span class="lineNum">     492 </span>                :        *  @return  *this
-<span class="lineNum">     493 </span>                :        *
-<span class="lineNum">     494 </span>                :        *  If @c rdbuf() is not null, calls @c rdbuf()-&gt;sputbackc(c).
-<span class="lineNum">     495 </span>                :        *
-<span class="lineNum">     496 </span>                :        *  If @c rdbuf() is null or if @c sputbackc() fails, sets badbit in
-<span class="lineNum">     497 </span>                :        *  the error state.
-<span class="lineNum">     498 </span>                :        *
-<span class="lineNum">     499 </span>                :        *  @note  Since no characters are extracted, the next call to
-<span class="lineNum">     500 </span>                :        *         @c gcount() will return 0, as required by DR 60.
-<span class="lineNum">     501 </span>                :       */
-<span class="lineNum">     502 </span>                :       __istream_type&amp; 
-<span class="lineNum">     503 </span>                :       putback(char_type __c);
-<span class="lineNum">     504 </span>                : 
-<span class="lineNum">     505 </span>                :       /**
-<span class="lineNum">     506 </span>                :        *  @brief  Unextracting the previous character.
-<span class="lineNum">     507 </span>                :        *  @return  *this
-<span class="lineNum">     508 </span>                :        *
-<span class="lineNum">     509 </span>                :        *  If @c rdbuf() is not null, calls @c rdbuf()-&gt;sungetc(c).
-<span class="lineNum">     510 </span>                :        *
-<span class="lineNum">     511 </span>                :        *  If @c rdbuf() is null or if @c sungetc() fails, sets badbit in
-<span class="lineNum">     512 </span>                :        *  the error state.
-<span class="lineNum">     513 </span>                :        *
-<span class="lineNum">     514 </span>                :        *  @note  Since no characters are extracted, the next call to
-<span class="lineNum">     515 </span>                :        *         @c gcount() will return 0, as required by DR 60.
-<span class="lineNum">     516 </span>                :       */
-<span class="lineNum">     517 </span>                :       __istream_type&amp; 
-<span class="lineNum">     518 </span>                :       unget();
-<span class="lineNum">     519 </span>                : 
-<span class="lineNum">     520 </span>                :       /**
-<span class="lineNum">     521 </span>                :        *  @brief  Synchronizing the stream buffer.
-<span class="lineNum">     522 </span>                :        *  @return  0 on success, -1 on failure
-<span class="lineNum">     523 </span>                :        *
-<span class="lineNum">     524 </span>                :        *  If @c rdbuf() is a null pointer, returns -1.
-<span class="lineNum">     525 </span>                :        *
-<span class="lineNum">     526 </span>                :        *  Otherwise, calls @c rdbuf()-&gt;pubsync(), and if that returns -1,
-<span class="lineNum">     527 </span>                :        *  sets badbit and returns -1.
-<span class="lineNum">     528 </span>                :        *
-<span class="lineNum">     529 </span>                :        *  Otherwise, returns 0.
-<span class="lineNum">     530 </span>                :        *
-<span class="lineNum">     531 </span>                :        *  @note  This function does not count the number of characters
-<span class="lineNum">     532 </span>                :        *         extracted, if any, and therefore does not affect the next
-<span class="lineNum">     533 </span>                :        *         call to @c gcount().
-<span class="lineNum">     534 </span>                :       */
-<span class="lineNum">     535 </span>                :       int 
-<span class="lineNum">     536 </span>                :       sync();
-<span class="lineNum">     537 </span>                : 
-<span class="lineNum">     538 </span>                :       /**
-<span class="lineNum">     539 </span>                :        *  @brief  Getting the current read position.
-<span class="lineNum">     540 </span>                :        *  @return  A file position object.
-<span class="lineNum">     541 </span>                :        *
-<span class="lineNum">     542 </span>                :        *  If @c fail() is not false, returns @c pos_type(-1) to indicate
-<span class="lineNum">     543 </span>                :        *  failure.  Otherwise returns @c rdbuf()-&gt;pubseekoff(0,cur,in).
-<span class="lineNum">     544 </span>                :        *
-<span class="lineNum">     545 </span>                :        *  @note  This function does not count the number of characters
-<span class="lineNum">     546 </span>                :        *         extracted, if any, and therefore does not affect the next
-<span class="lineNum">     547 </span>                :        *         call to @c gcount().
-<span class="lineNum">     548 </span>                :       */
-<span class="lineNum">     549 </span>                :       pos_type 
-<span class="lineNum">     550 </span>                :       tellg();
-<span class="lineNum">     551 </span>                : 
-<span class="lineNum">     552 </span>                :       /**
-<span class="lineNum">     553 </span>                :        *  @brief  Changing the current read position.
-<span class="lineNum">     554 </span>                :        *  @param  pos  A file position object.
-<span class="lineNum">     555 </span>                :        *  @return  *this
-<span class="lineNum">     556 </span>                :        *
-<span class="lineNum">     557 </span>                :        *  If @c fail() is not true, calls @c rdbuf()-&gt;pubseekpos(pos).  If
-<span class="lineNum">     558 </span>                :        *  that function fails, sets failbit.
-<span class="lineNum">     559 </span>                :        *
-<span class="lineNum">     560 </span>                :        *  @note  This function does not count the number of characters
-<span class="lineNum">     561 </span>                :        *         extracted, if any, and therefore does not affect the next
-<span class="lineNum">     562 </span>                :        *         call to @c gcount().
-<span class="lineNum">     563 </span>                :       */
-<span class="lineNum">     564 </span>                :       __istream_type&amp; 
-<span class="lineNum">     565 </span>                :       seekg(pos_type);
-<span class="lineNum">     566 </span>                : 
-<span class="lineNum">     567 </span>                :       /**
-<span class="lineNum">     568 </span>                :        *  @brief  Changing the current read position.
-<span class="lineNum">     569 </span>                :        *  @param  off  A file offset object.
-<span class="lineNum">     570 </span>                :        *  @param  dir  The direction in which to seek.
-<span class="lineNum">     571 </span>                :        *  @return  *this
-<span class="lineNum">     572 </span>                :        *
-<span class="lineNum">     573 </span>                :        *  If @c fail() is not true, calls @c rdbuf()-&gt;pubseekoff(off,dir).
-<span class="lineNum">     574 </span>                :        *  If that function fails, sets failbit.
-<span class="lineNum">     575 </span>                :        *
-<span class="lineNum">     576 </span>                :        *  @note  This function does not count the number of characters
-<span class="lineNum">     577 </span>                :        *         extracted, if any, and therefore does not affect the next
-<span class="lineNum">     578 </span>                :        *         call to @c gcount().
-<span class="lineNum">     579 </span>                :       */
-<span class="lineNum">     580 </span>                :       __istream_type&amp; 
-<span class="lineNum">     581 </span>                :       seekg(off_type, ios_base::seekdir);
-<span class="lineNum">     582 </span>                :       //@}
-<span class="lineNum">     583 </span>                : 
-<span class="lineNum">     584 </span>                :     protected:
-<span class="lineNum">     585 </span><span class="lineNoCov">              0 :       basic_istream()</span>
-<span class="lineNum">     586 </span><span class="lineNoCov">              0 :       : _M_gcount(streamsize(0))</span>
-<span class="lineNum">     587 </span><span class="lineNoCov">              0 :       { this-&gt;init(0); }</span>
-<span class="lineNum">     588 </span>                : 
-<span class="lineNum">     589 </span>                :       template&lt;typename _ValueT&gt;
-<span class="lineNum">     590 </span>                :         __istream_type&amp;
-<span class="lineNum">     591 </span>                :         _M_extract(_ValueT&amp; __v);
-<span class="lineNum">     592 </span>                :     };
-<span class="lineNum">     593 </span>                : 
-<span class="lineNum">     594 </span>                :   // Explicit specialization declarations, defined in src/istream.cc.
-<span class="lineNum">     595 </span>                :   template&lt;&gt; 
-<span class="lineNum">     596 </span>                :     basic_istream&lt;char&gt;&amp; 
-<span class="lineNum">     597 </span>                :     basic_istream&lt;char&gt;::
-<span class="lineNum">     598 </span>                :     getline(char_type* __s, streamsize __n, char_type __delim);
-<span class="lineNum">     599 </span>                :   
-<span class="lineNum">     600 </span>                :   template&lt;&gt;
-<span class="lineNum">     601 </span>                :     basic_istream&lt;char&gt;&amp;
-<span class="lineNum">     602 </span>                :     basic_istream&lt;char&gt;::
-<span class="lineNum">     603 </span>                :     ignore(streamsize __n);
-<span class="lineNum">     604 </span>                :   
-<span class="lineNum">     605 </span>                :   template&lt;&gt;
-<span class="lineNum">     606 </span>                :     basic_istream&lt;char&gt;&amp;
-<span class="lineNum">     607 </span>                :     basic_istream&lt;char&gt;::
-<span class="lineNum">     608 </span>                :     ignore(streamsize __n, int_type __delim);
-<span class="lineNum">     609 </span>                : 
-<span class="lineNum">     610 </span>                : #ifdef _GLIBCXX_USE_WCHAR_T
-<span class="lineNum">     611 </span>                :   template&lt;&gt; 
-<span class="lineNum">     612 </span>                :     basic_istream&lt;wchar_t&gt;&amp; 
-<span class="lineNum">     613 </span>                :     basic_istream&lt;wchar_t&gt;::
-<span class="lineNum">     614 </span>                :     getline(char_type* __s, streamsize __n, char_type __delim);
-<span class="lineNum">     615 </span>                : 
-<span class="lineNum">     616 </span>                :   template&lt;&gt;
-<span class="lineNum">     617 </span>                :     basic_istream&lt;wchar_t&gt;&amp;
-<span class="lineNum">     618 </span>                :     basic_istream&lt;wchar_t&gt;::
-<span class="lineNum">     619 </span>                :     ignore(streamsize __n);
-<span class="lineNum">     620 </span>                :   
-<span class="lineNum">     621 </span>                :   template&lt;&gt;
-<span class="lineNum">     622 </span>                :     basic_istream&lt;wchar_t&gt;&amp;
-<span class="lineNum">     623 </span>                :     basic_istream&lt;wchar_t&gt;::
-<span class="lineNum">     624 </span>                :     ignore(streamsize __n, int_type __delim);
-<span class="lineNum">     625 </span>                : #endif
-<span class="lineNum">     626 </span>                : 
-<span class="lineNum">     627 </span>                :   /**
-<span class="lineNum">     628 </span>                :    *  @brief  Performs setup work for input streams.
-<span class="lineNum">     629 </span>                :    *
-<span class="lineNum">     630 </span>                :    *  Objects of this class are created before all of the standard
-<span class="lineNum">     631 </span>                :    *  extractors are run.  It is responsible for &quot;exception-safe prefix and
-<span class="lineNum">     632 </span>                :    *  suffix operations,&quot; although only prefix actions are currently required
-<span class="lineNum">     633 </span>                :    *  by the standard.  Additional actions may be added by the
-<span class="lineNum">     634 </span>                :    *  implementation, and we list them in
-<span class="lineNum">     635 </span>                :    *  http://gcc.gnu.org/onlinedocs/libstdc++/17_intro/howto.html#5
-<span class="lineNum">     636 </span>                :    *  under [27.6] notes.
-<span class="lineNum">     637 </span>                :   */
-<span class="lineNum">     638 </span>                :   template&lt;typename _CharT, typename _Traits&gt;
-<span class="lineNum">     639 </span>                :     class basic_istream&lt;_CharT, _Traits&gt;::sentry
-<span class="lineNum">     640 </span>                :     {
-<span class="lineNum">     641 </span>                :     public:
-<span class="lineNum">     642 </span>                :       /// Easy access to dependant types.
-<span class="lineNum">     643 </span>                :       typedef _Traits                                   traits_type;
-<span class="lineNum">     644 </span>                :       typedef basic_streambuf&lt;_CharT, _Traits&gt;            __streambuf_type;
-<span class="lineNum">     645 </span>                :       typedef basic_istream&lt;_CharT, _Traits&gt;              __istream_type;
-<span class="lineNum">     646 </span>                :       typedef typename __istream_type::__ctype_type     __ctype_type;
-<span class="lineNum">     647 </span>                :       typedef typename _Traits::int_type                __int_type;
-<span class="lineNum">     648 </span>                : 
-<span class="lineNum">     649 </span>                :       /**
-<span class="lineNum">     650 </span>                :        *  @brief  The constructor performs all the work.
-<span class="lineNum">     651 </span>                :        *  @param  is  The input stream to guard.
-<span class="lineNum">     652 </span>                :        *  @param  noskipws  Whether to consume whitespace or not.
-<span class="lineNum">     653 </span>                :        *
-<span class="lineNum">     654 </span>                :        *  If the stream state is good (@a is.good() is true), then the
-<span class="lineNum">     655 </span>                :        *  following actions are performed, otherwise the sentry state is
-<span class="lineNum">     656 </span>                :        *  false (&quot;not okay&quot;) and failbit is set in the stream state.
-<span class="lineNum">     657 </span>                :        *
-<span class="lineNum">     658 </span>                :        *  The sentry's preparatory actions are:
-<span class="lineNum">     659 </span>                :        *
-<span class="lineNum">     660 </span>                :        *  -# if the stream is tied to an output stream, @c is.tie()-&gt;flush()
-<span class="lineNum">     661 </span>                :        *     is called to synchronize the output sequence
-<span class="lineNum">     662 </span>                :        *  -# if @a noskipws is false, and @c ios_base::skipws is set in
-<span class="lineNum">     663 </span>                :        *     @c is.flags(), the sentry extracts and discards whitespace
-<span class="lineNum">     664 </span>                :        *     characters from the stream.  The currently imbued locale is
-<span class="lineNum">     665 </span>                :        *     used to determine whether each character is whitespace.
-<span class="lineNum">     666 </span>                :        *
-<span class="lineNum">     667 </span>                :        *  If the stream state is still good, then the sentry state becomes
-<span class="lineNum">     668 </span>                :        *  true (&quot;okay&quot;).
-<span class="lineNum">     669 </span>                :       */
-<span class="lineNum">     670 </span>                :       explicit
-<span class="lineNum">     671 </span>                :       sentry(basic_istream&lt;_CharT, _Traits&gt;&amp; __is, bool __noskipws = false);
-<span class="lineNum">     672 </span>                : 
-<span class="lineNum">     673 </span>                :       /**
-<span class="lineNum">     674 </span>                :        *  @brief  Quick status checking.
-<span class="lineNum">     675 </span>                :        *  @return  The sentry state.
-<span class="lineNum">     676 </span>                :        *
-<span class="lineNum">     677 </span>                :        *  For ease of use, sentries may be converted to booleans.  The
-<span class="lineNum">     678 </span>                :        *  return value is that of the sentry state (true == okay).
-<span class="lineNum">     679 </span>                :       */
-<span class="lineNum">     680 </span>                :       operator bool() const
-<span class="lineNum">     681 </span>                :       { return _M_ok; }
-<span class="lineNum">     682 </span>                : 
-<span class="lineNum">     683 </span>                :     private:
-<span class="lineNum">     684 </span>                :       bool _M_ok;
-<span class="lineNum">     685 </span>                :     };
-<span class="lineNum">     686 </span>                : 
-<span class="lineNum">     687 </span>                :   // [27.6.1.2.3] character extraction templates
-<span class="lineNum">     688 </span>                :   //@{
-<span class="lineNum">     689 </span>                :   /**
-<span class="lineNum">     690 </span>                :    *  @brief  Character extractors
-<span class="lineNum">     691 </span>                :    *  @param  in  An input stream.
-<span class="lineNum">     692 </span>                :    *  @param  c  A character reference.
-<span class="lineNum">     693 </span>                :    *  @return  in
-<span class="lineNum">     694 </span>                :    *
-<span class="lineNum">     695 </span>                :    *  Behaves like one of the formatted arithmetic extractors described in
-<span class="lineNum">     696 </span>                :    *  std::basic_istream.  After constructing a sentry object with good
-<span class="lineNum">     697 </span>                :    *  status, this function extracts a character (if one is available) and
-<span class="lineNum">     698 </span>                :    *  stores it in @a c.  Otherwise, sets failbit in the input stream.
-<span class="lineNum">     699 </span>                :   */
-<span class="lineNum">     700 </span>                :   template&lt;typename _CharT, typename _Traits&gt;
-<span class="lineNum">     701 </span>                :     basic_istream&lt;_CharT, _Traits&gt;&amp;
-<span class="lineNum">     702 </span>                :     operator&gt;&gt;(basic_istream&lt;_CharT, _Traits&gt;&amp; __in, _CharT&amp; __c);
-<span class="lineNum">     703 </span>                : 
-<span class="lineNum">     704 </span>                :   template&lt;class _Traits&gt;
-<span class="lineNum">     705 </span>                :     inline basic_istream&lt;char, _Traits&gt;&amp;
-<span class="lineNum">     706 </span>                :     operator&gt;&gt;(basic_istream&lt;char, _Traits&gt;&amp; __in, unsigned char&amp; __c)
-<span class="lineNum">     707 </span>                :     { return (__in &gt;&gt; reinterpret_cast&lt;char&amp;&gt;(__c)); }
-<span class="lineNum">     708 </span>                : 
-<span class="lineNum">     709 </span>                :   template&lt;class _Traits&gt;
-<span class="lineNum">     710 </span>                :     inline basic_istream&lt;char, _Traits&gt;&amp;
-<span class="lineNum">     711 </span>                :     operator&gt;&gt;(basic_istream&lt;char, _Traits&gt;&amp; __in, signed char&amp; __c)
-<span class="lineNum">     712 </span>                :     { return (__in &gt;&gt; reinterpret_cast&lt;char&amp;&gt;(__c)); }
-<span class="lineNum">     713 </span>                :   //@}
-<span class="lineNum">     714 </span>                : 
-<span class="lineNum">     715 </span>                :   //@{
-<span class="lineNum">     716 </span>                :   /**
-<span class="lineNum">     717 </span>                :    *  @brief  Character string extractors
-<span class="lineNum">     718 </span>                :    *  @param  in  An input stream.
-<span class="lineNum">     719 </span>                :    *  @param  s  A pointer to a character array.
-<span class="lineNum">     720 </span>                :    *  @return  in
-<span class="lineNum">     721 </span>                :    *
-<span class="lineNum">     722 </span>                :    *  Behaves like one of the formatted arithmetic extractors described in
-<span class="lineNum">     723 </span>                :    *  std::basic_istream.  After constructing a sentry object with good
-<span class="lineNum">     724 </span>                :    *  status, this function extracts up to @c n characters and stores them
-<span class="lineNum">     725 </span>                :    *  into the array starting at @a s.  @c n is defined as:
-<span class="lineNum">     726 </span>                :    *
-<span class="lineNum">     727 </span>                :    *  - if @c width() is greater than zero, @c n is width()
-<span class="lineNum">     728 </span>                :    *  - otherwise @c n is &quot;the number of elements of the largest array of
-<span class="lineNum">     729 </span>                :    *    @c char_type that can store a terminating @c eos.&quot; [27.6.1.2.3]/6
-<span class="lineNum">     730 </span>                :    *
-<span class="lineNum">     731 </span>                :    *  Characters are extracted and stored until one of the following happens:
-<span class="lineNum">     732 </span>                :    *  - @c n-1 characters are stored
-<span class="lineNum">     733 </span>                :    *  - EOF is reached
-<span class="lineNum">     734 </span>                :    *  - the next character is whitespace according to the current locale
-<span class="lineNum">     735 </span>                :    *  - the next character is a null byte (i.e., @c charT() )
-<span class="lineNum">     736 </span>                :    *
-<span class="lineNum">     737 </span>                :    *  @c width(0) is then called for the input stream.
-<span class="lineNum">     738 </span>                :    *
-<span class="lineNum">     739 </span>                :    *  If no characters are extracted, sets failbit.
-<span class="lineNum">     740 </span>                :   */
-<span class="lineNum">     741 </span>                :   template&lt;typename _CharT, typename _Traits&gt;
-<span class="lineNum">     742 </span>                :     basic_istream&lt;_CharT, _Traits&gt;&amp;
-<span class="lineNum">     743 </span>                :     operator&gt;&gt;(basic_istream&lt;_CharT, _Traits&gt;&amp; __in, _CharT* __s);
-<span class="lineNum">     744 </span>                : 
-<span class="lineNum">     745 </span>                :   // Explicit specialization declaration, defined in src/istream.cc.
-<span class="lineNum">     746 </span>                :   template&lt;&gt;
-<span class="lineNum">     747 </span>                :     basic_istream&lt;char&gt;&amp;
-<span class="lineNum">     748 </span>                :     operator&gt;&gt;(basic_istream&lt;char&gt;&amp; __in, char* __s);
-<span class="lineNum">     749 </span>                : 
-<span class="lineNum">     750 </span>                :   template&lt;class _Traits&gt;
-<span class="lineNum">     751 </span>                :     inline basic_istream&lt;char, _Traits&gt;&amp;
-<span class="lineNum">     752 </span>                :     operator&gt;&gt;(basic_istream&lt;char, _Traits&gt;&amp; __in, unsigned char* __s)
-<span class="lineNum">     753 </span>                :     { return (__in &gt;&gt; reinterpret_cast&lt;char*&gt;(__s)); }
-<span class="lineNum">     754 </span>                : 
-<span class="lineNum">     755 </span>                :   template&lt;class _Traits&gt;
-<span class="lineNum">     756 </span>                :     inline basic_istream&lt;char, _Traits&gt;&amp;
-<span class="lineNum">     757 </span>                :     operator&gt;&gt;(basic_istream&lt;char, _Traits&gt;&amp; __in, signed char* __s)
-<span class="lineNum">     758 </span>                :     { return (__in &gt;&gt; reinterpret_cast&lt;char*&gt;(__s)); }
-<span class="lineNum">     759 </span>                :   //@}
-<span class="lineNum">     760 </span>                : 
-<span class="lineNum">     761 </span>                :   // 27.6.1.5 Template class basic_iostream
-<span class="lineNum">     762 </span>                :   /**
-<span class="lineNum">     763 </span>                :    *  @brief  Merging istream and ostream capabilities.
-<span class="lineNum">     764 </span>                :    *
-<span class="lineNum">     765 </span>                :    *  This class multiply inherits from the input and output stream classes
-<span class="lineNum">     766 </span>                :    *  simply to provide a single interface.
-<span class="lineNum">     767 </span>                :   */
-<span class="lineNum">     768 </span>                :   template&lt;typename _CharT, typename _Traits&gt;
-<span class="lineNum">     769 </span>                :     class basic_iostream
-<span class="lineNum">     770 </span>                :     : public basic_istream&lt;_CharT, _Traits&gt;, 
-<span class="lineNum">     771 </span>                :       public basic_ostream&lt;_CharT, _Traits&gt;
-<span class="lineNum">     772 </span>                :     {
-<span class="lineNum">     773 </span>                :     public:
-<span class="lineNum">     774 </span>                :       // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     775 </span>                :       // 271. basic_iostream missing typedefs
-<span class="lineNum">     776 </span>                :       // Types (inherited):
-<span class="lineNum">     777 </span>                :       typedef _CharT                                    char_type;
-<span class="lineNum">     778 </span>                :       typedef typename _Traits::int_type                int_type;
-<span class="lineNum">     779 </span>                :       typedef typename _Traits::pos_type                pos_type;
-<span class="lineNum">     780 </span>                :       typedef typename _Traits::off_type                off_type;
-<span class="lineNum">     781 </span>                :       typedef _Traits                                   traits_type;
-<span class="lineNum">     782 </span>                : 
-<span class="lineNum">     783 </span>                :       // Non-standard Types:
-<span class="lineNum">     784 </span>                :       typedef basic_istream&lt;_CharT, _Traits&gt;              __istream_type;
-<span class="lineNum">     785 </span>                :       typedef basic_ostream&lt;_CharT, _Traits&gt;              __ostream_type;
-<span class="lineNum">     786 </span>                : 
-<span class="lineNum">     787 </span>                :       /**
-<span class="lineNum">     788 </span>                :        *  @brief  Constructor does nothing.
-<span class="lineNum">     789 </span>                :        *
-<span class="lineNum">     790 </span>                :        *  Both of the parent classes are initialized with the same
-<span class="lineNum">     791 </span>                :        *  streambuf pointer passed to this constructor.
-<span class="lineNum">     792 </span>                :       */
-<span class="lineNum">     793 </span>                :       explicit
-<span class="lineNum">     794 </span>                :       basic_iostream(basic_streambuf&lt;_CharT, _Traits&gt;* __sb)
-<span class="lineNum">     795 </span>                :       : __istream_type(__sb), __ostream_type(__sb) { }
-<span class="lineNum">     796 </span>                : 
-<span class="lineNum">     797 </span>                :       /**
-<span class="lineNum">     798 </span>                :        *  @brief  Destructor does nothing.
-<span class="lineNum">     799 </span>                :       */
-<span class="lineNum">     800 </span>                :       virtual 
-<span class="lineNum">     801 </span><span class="lineNoCov">              0 :       ~basic_iostream() { }</span>
-<span class="lineNum">     802 </span>                : 
-<span class="lineNum">     803 </span>                :     protected:
-<span class="lineNum">     804 </span><span class="lineNoCov">              0 :       basic_iostream()</span>
-<span class="lineNum">     805 </span><span class="lineNoCov">              0 :       : __istream_type(), __ostream_type() { }</span>
-<span class="lineNum">     806 </span>                :     };
-<span class="lineNum">     807 </span>                : 
-<span class="lineNum">     808 </span>                :   // [27.6.1.4] standard basic_istream manipulators
-<span class="lineNum">     809 </span>                :   /**
-<span class="lineNum">     810 </span>                :    *  @brief  Quick and easy way to eat whitespace
-<span class="lineNum">     811 </span>                :    *
-<span class="lineNum">     812 </span>                :    *  This manipulator extracts whitespace characters, stopping when the
-<span class="lineNum">     813 </span>                :    *  next character is non-whitespace, or when the input sequence is empty.
-<span class="lineNum">     814 </span>                :    *  If the sequence is empty, @c eofbit is set in the stream, but not
-<span class="lineNum">     815 </span>                :    *  @c failbit.
-<span class="lineNum">     816 </span>                :    *
-<span class="lineNum">     817 </span>                :    *  The current locale is used to distinguish whitespace characters.
-<span class="lineNum">     818 </span>                :    *
-<span class="lineNum">     819 </span>                :    *  Example:
-<span class="lineNum">     820 </span>                :    *  @code
-<span class="lineNum">     821 </span>                :    *     MyClass   mc;
-<span class="lineNum">     822 </span>                :    *
-<span class="lineNum">     823 </span>                :    *     std::cin &gt;&gt; std::ws &gt;&gt; mc;
-<span class="lineNum">     824 </span>                :    *  @endcode
-<span class="lineNum">     825 </span>                :    *  will skip leading whitespace before calling operator&gt;&gt; on cin and your
-<span class="lineNum">     826 </span>                :    *  object.  Note that the same effect can be achieved by creating a
-<span class="lineNum">     827 </span>                :    *  std::basic_istream::sentry inside your definition of operator&gt;&gt;.
-<span class="lineNum">     828 </span>                :   */
-<span class="lineNum">     829 </span>                :   template&lt;typename _CharT, typename _Traits&gt;
-<span class="lineNum">     830 </span>                :     basic_istream&lt;_CharT, _Traits&gt;&amp; 
-<span class="lineNum">     831 </span>                :     ws(basic_istream&lt;_CharT, _Traits&gt;&amp; __is);
-<span class="lineNum">     832 </span>                : 
-<span class="lineNum">     833 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">     834 </span>                : 
-<span class="lineNum">     835 </span>                : #ifndef _GLIBCXX_EXPORT_TEMPLATE
-<span class="lineNum">     836 </span>                : # include &lt;bits/istream.tcc&gt;
-<span class="lineNum">     837 </span>                : #endif
-<span class="lineNum">     838 </span>                : 
-<span class="lineNum">     839 </span>                : #endif  /* _GLIBCXX_ISTREAM */
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/new.gcov.html b/rep/usr/include/c++/4.3/new.gcov.html
deleted file mode 100644
index 991b58e..0000000
--- a/rep/usr/include/c++/4.3/new.gcov.html
+++ /dev/null
@@ -1,183 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/new</title>
-  <link rel="stylesheet" type="text/css" href="../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3</a> - new</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">2</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">50.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">1</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // The -*- C++ -*- dynamic memory management header.
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-<span class="lineNum">       4 </span>                : // 2003, 2004, 2005, 2006, 2007
-<span class="lineNum">       5 </span>                : // Free Software Foundation
-<span class="lineNum">       6 </span>                : 
-<span class="lineNum">       7 </span>                : // This file is part of GCC.
-<span class="lineNum">       8 </span>                : //
-<span class="lineNum">       9 </span>                : // GCC is free software; you can redistribute it and/or modify
-<span class="lineNum">      10 </span>                : // it under the terms of the GNU General Public License as published by
-<span class="lineNum">      11 </span>                : // the Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      12 </span>                : // any later version.
-<span class="lineNum">      13 </span>                : // 
-<span class="lineNum">      14 </span>                : // GCC is distributed in the hope that it will be useful,
-<span class="lineNum">      15 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      16 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      17 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      18 </span>                : // 
-<span class="lineNum">      19 </span>                : // You should have received a copy of the GNU General Public License
-<span class="lineNum">      20 </span>                : // along with GCC; see the file COPYING.  If not, write to
-<span class="lineNum">      21 </span>                : // the Free Software Foundation, 51 Franklin Street, Fifth Floor,
-<span class="lineNum">      22 </span>                : // Boston, MA 02110-1301, USA.
-<span class="lineNum">      23 </span>                : 
-<span class="lineNum">      24 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      25 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      26 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      27 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      28 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      29 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      30 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      31 </span>                : // the GNU General Public License.
-<span class="lineNum">      32 </span>                : 
-<span class="lineNum">      33 </span>                : /** @file new
-<span class="lineNum">      34 </span>                :  *  This is a Standard C++ Library header.
-<span class="lineNum">      35 </span>                :  *
-<span class="lineNum">      36 </span>                :  *  The header @c new defines several functions to manage dynamic memory and
-<span class="lineNum">      37 </span>                :  *  handling memory allocation errors; see
-<span class="lineNum">      38 </span>                :  *  http://gcc.gnu.org/onlinedocs/libstdc++/18_support/howto.html#4 for more.
-<span class="lineNum">      39 </span>                :  */
-<span class="lineNum">      40 </span>                : 
-<span class="lineNum">      41 </span>                : #ifndef _NEW
-<span class="lineNum">      42 </span>                : #define _NEW
-<span class="lineNum">      43 </span>                : 
-<span class="lineNum">      44 </span>                : #include &lt;cstddef&gt;
-<span class="lineNum">      45 </span>                : #include &lt;exception&gt;
-<span class="lineNum">      46 </span>                : 
-<span class="lineNum">      47 </span>                : #pragma GCC visibility push(default)
-<span class="lineNum">      48 </span>                : 
-<span class="lineNum">      49 </span>                : extern &quot;C++&quot; {
-<span class="lineNum">      50 </span>                : 
-<span class="lineNum">      51 </span>                : namespace std 
-<span class="lineNum">      52 </span>                : {
-<span class="lineNum">      53 </span>                :   /**
-<span class="lineNum">      54 </span>                :    *  @brief  Exception possibly thrown by @c new.
-<span class="lineNum">      55 </span>                :    *
-<span class="lineNum">      56 </span>                :    *  @c bad_alloc (or classes derived from it) is used to report allocation
-<span class="lineNum">      57 </span>                :    *  errors from the throwing forms of @c new.  */
-<span class="lineNum">      58 </span>                :   class bad_alloc : public exception 
-<span class="lineNum">      59 </span>                :   {
-<span class="lineNum">      60 </span>                :   public:
-<span class="lineNum">      61 </span>                :     bad_alloc() throw() { }
-<span class="lineNum">      62 </span>                : 
-<span class="lineNum">      63 </span>                :     // This declaration is not useless:
-<span class="lineNum">      64 </span>                :     // http://gcc.gnu.org/onlinedocs/gcc-3.0.2/gcc_6.html#SEC118
-<span class="lineNum">      65 </span>                :     virtual ~bad_alloc() throw();
-<span class="lineNum">      66 </span>                : 
-<span class="lineNum">      67 </span>                :     // See comment in eh_exception.cc.
-<span class="lineNum">      68 </span>                :     virtual const char* what() const throw();
-<span class="lineNum">      69 </span>                :   };
-<span class="lineNum">      70 </span>                : 
-<span class="lineNum">      71 </span>                :   struct nothrow_t { };
-<span class="lineNum">      72 </span>                : 
-<span class="lineNum">      73 </span>                :   extern const nothrow_t nothrow;
-<span class="lineNum">      74 </span>                : 
-<span class="lineNum">      75 </span>                :   /** If you write your own error handler to be called by @c new, it must
-<span class="lineNum">      76 </span>                :    *  be of this type.  */
-<span class="lineNum">      77 </span>                :   typedef void (*new_handler)();
-<span class="lineNum">      78 </span>                : 
-<span class="lineNum">      79 </span>                :   /// Takes a replacement handler as the argument, returns the
-<span class="lineNum">      80 </span>                :   /// previous handler.
-<span class="lineNum">      81 </span>                :   new_handler set_new_handler(new_handler) throw();
-<span class="lineNum">      82 </span>                : } // namespace std
-<span class="lineNum">      83 </span>                : 
-<span class="lineNum">      84 </span>                : //@{
-<span class="lineNum">      85 </span>                : /** These are replaceable signatures:
-<span class="lineNum">      86 </span>                :  *  - normal single new and delete (no arguments, throw @c bad_alloc on error)
-<span class="lineNum">      87 </span>                :  *  - normal array new and delete (same)
-<span class="lineNum">      88 </span>                :  *  - @c nothrow single new and delete (take a @c nothrow argument, return
-<span class="lineNum">      89 </span>                :  *    @c NULL on error)
-<span class="lineNum">      90 </span>                :  *  - @c nothrow array new and delete (same)
-<span class="lineNum">      91 </span>                :  *
-<span class="lineNum">      92 </span>                :  *  Placement new and delete signatures (take a memory address argument,
-<span class="lineNum">      93 </span>                :  *  does nothing) may not be replaced by a user's program.
-<span class="lineNum">      94 </span>                : */
-<span class="lineNum">      95 </span>                : void* operator new(std::size_t) throw (std::bad_alloc);
-<span class="lineNum">      96 </span>                : void* operator new[](std::size_t) throw (std::bad_alloc);
-<span class="lineNum">      97 </span>                : void operator delete(void*) throw();
-<span class="lineNum">      98 </span>                : void operator delete[](void*) throw();
-<span class="lineNum">      99 </span>                : void* operator new(std::size_t, const std::nothrow_t&amp;) throw();
-<span class="lineNum">     100 </span>                : void* operator new[](std::size_t, const std::nothrow_t&amp;) throw();
-<span class="lineNum">     101 </span>                : void operator delete(void*, const std::nothrow_t&amp;) throw();
-<span class="lineNum">     102 </span>                : void operator delete[](void*, const std::nothrow_t&amp;) throw();
-<span class="lineNum">     103 </span>                : 
-<span class="lineNum">     104 </span>                : // Default placement versions of operator new.
-<span class="lineNum">     105 </span><span class="lineCov">        5858225 : inline void* operator new(std::size_t, void* __p) throw() { return __p; }</span>
-<span class="lineNum">     106 </span>                : inline void* operator new[](std::size_t, void* __p) throw() { return __p; }
-<span class="lineNum">     107 </span>                : 
-<span class="lineNum">     108 </span>                : // Default placement versions of operator delete.
-<span class="lineNum">     109 </span><span class="lineNoCov">              0 : inline void  operator delete  (void*, void*) throw() { }</span>
-<span class="lineNum">     110 </span>                : inline void  operator delete[](void*, void*) throw() { }
-<span class="lineNum">     111 </span>                : //@}
-<span class="lineNum">     112 </span>                : } // extern &quot;C++&quot;
-<span class="lineNum">     113 </span>                : 
-<span class="lineNum">     114 </span>                : #pragma GCC visibility pop
-<span class="lineNum">     115 </span>                : 
-<span class="lineNum">     116 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/ostream.gcov.html b/rep/usr/include/c++/4.3/ostream.gcov.html
deleted file mode 100644
index b2c2c3f..0000000
--- a/rep/usr/include/c++/4.3/ostream.gcov.html
+++ /dev/null
@@ -1,642 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/ostream</title>
-  <link rel="stylesheet" type="text/css" href="../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3</a> - ostream</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">33</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">0.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">0</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // Output streams -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005,
-<span class="lineNum">       4 </span>                : // 2006, 2007, 2008
-<span class="lineNum">       5 </span>                : // Free Software Foundation, Inc.
-<span class="lineNum">       6 </span>                : //
-<span class="lineNum">       7 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       8 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       9 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">      10 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      11 </span>                : // any later version.
-<span class="lineNum">      12 </span>                : 
-<span class="lineNum">      13 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      14 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      15 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      16 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      17 </span>                : 
-<span class="lineNum">      18 </span>                : // You should have received a copy of the GNU General Public License
-<span class="lineNum">      19 </span>                : // along with this library; see the file COPYING.  If not, write to
-<span class="lineNum">      20 </span>                : // the Free Software Foundation, 51 Franklin Street, Fifth Floor,
-<span class="lineNum">      21 </span>                : // Boston, MA 02110-1301, USA.
-<span class="lineNum">      22 </span>                : 
-<span class="lineNum">      23 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      24 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      25 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      26 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      27 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      28 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      29 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      30 </span>                : // the GNU General Public License.
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span>                : /** @file ostream
-<span class="lineNum">      33 </span>                :  *  This is a Standard C++ Library header.
-<span class="lineNum">      34 </span>                :  */
-<span class="lineNum">      35 </span>                : 
-<span class="lineNum">      36 </span>                : //
-<span class="lineNum">      37 </span>                : // ISO C++ 14882: 27.6.2  Output streams
-<span class="lineNum">      38 </span>                : //
-<span class="lineNum">      39 </span>                : 
-<span class="lineNum">      40 </span>                : #ifndef _GLIBCXX_OSTREAM
-<span class="lineNum">      41 </span>                : #define _GLIBCXX_OSTREAM 1
-<span class="lineNum">      42 </span>                : 
-<span class="lineNum">      43 </span>                : #pragma GCC system_header
-<span class="lineNum">      44 </span>                : 
-<span class="lineNum">      45 </span>                : #include &lt;ios&gt;
-<span class="lineNum">      46 </span>                : #include &lt;bits/ostream_insert.h&gt;
-<span class="lineNum">      47 </span>                : 
-<span class="lineNum">      48 </span>                : _GLIBCXX_BEGIN_NAMESPACE(std)
-<span class="lineNum">      49 </span>                : 
-<span class="lineNum">      50 </span>                :   // [27.6.2.1] Template class basic_ostream
-<span class="lineNum">      51 </span>                :   /**
-<span class="lineNum">      52 </span>                :    *  @brief  Controlling output.
-<span class="lineNum">      53 </span>                :    *
-<span class="lineNum">      54 </span>                :    *  This is the base class for all output streams.  It provides text
-<span class="lineNum">      55 </span>                :    *  formatting of all builtin types, and communicates with any class
-<span class="lineNum">      56 </span>                :    *  derived from basic_streambuf to do the actual output.
-<span class="lineNum">      57 </span>                :   */
-<span class="lineNum">      58 </span>                :   template&lt;typename _CharT, typename _Traits&gt;
-<span class="lineNum">      59 </span>                :     class basic_ostream : virtual public basic_ios&lt;_CharT, _Traits&gt;
-<span class="lineNum">      60 </span>                :     {
-<span class="lineNum">      61 </span>                :     public:
-<span class="lineNum">      62 </span>                :       // Types (inherited from basic_ios (27.4.4)):
-<span class="lineNum">      63 </span>                :       typedef _CharT                                    char_type;
-<span class="lineNum">      64 </span>                :       typedef typename _Traits::int_type                int_type;
-<span class="lineNum">      65 </span>                :       typedef typename _Traits::pos_type                pos_type;
-<span class="lineNum">      66 </span>                :       typedef typename _Traits::off_type                off_type;
-<span class="lineNum">      67 </span>                :       typedef _Traits                                   traits_type;
-<span class="lineNum">      68 </span>                :       
-<span class="lineNum">      69 </span>                :       // Non-standard Types:
-<span class="lineNum">      70 </span>                :       typedef basic_streambuf&lt;_CharT, _Traits&gt;            __streambuf_type;
-<span class="lineNum">      71 </span>                :       typedef basic_ios&lt;_CharT, _Traits&gt;          __ios_type;
-<span class="lineNum">      72 </span>                :       typedef basic_ostream&lt;_CharT, _Traits&gt;              __ostream_type;
-<span class="lineNum">      73 </span>                :       typedef num_put&lt;_CharT, ostreambuf_iterator&lt;_CharT, _Traits&gt; &gt;        
-<span class="lineNum">      74 </span>                :                                                         __num_put_type;
-<span class="lineNum">      75 </span>                :       typedef ctype&lt;_CharT&gt;                               __ctype_type;
-<span class="lineNum">      76 </span>                : 
-<span class="lineNum">      77 </span>                :       // [27.6.2.2] constructor/destructor
-<span class="lineNum">      78 </span>                :       /**
-<span class="lineNum">      79 </span>                :        *  @brief  Base constructor.
-<span class="lineNum">      80 </span>                :        *
-<span class="lineNum">      81 </span>                :        *  This ctor is almost never called by the user directly, rather from
-<span class="lineNum">      82 </span>                :        *  derived classes' initialization lists, which pass a pointer to
-<span class="lineNum">      83 </span>                :        *  their own stream buffer.
-<span class="lineNum">      84 </span>                :       */
-<span class="lineNum">      85 </span>                :       explicit 
-<span class="lineNum">      86 </span><span class="lineNoCov">              0 :       basic_ostream(__streambuf_type* __sb)</span>
-<span class="lineNum">      87 </span><span class="lineNoCov">              0 :       { this-&gt;init(__sb); }</span>
-<span class="lineNum">      88 </span>                : 
-<span class="lineNum">      89 </span>                :       /**
-<span class="lineNum">      90 </span>                :        *  @brief  Base destructor.
-<span class="lineNum">      91 </span>                :        *
-<span class="lineNum">      92 </span>                :        *  This does very little apart from providing a virtual base dtor.
-<span class="lineNum">      93 </span>                :       */
-<span class="lineNum">      94 </span>                :       virtual 
-<span class="lineNum">      95 </span><span class="lineNoCov">              0 :       ~basic_ostream() { }</span>
-<span class="lineNum">      96 </span>                : 
-<span class="lineNum">      97 </span>                :       // [27.6.2.3] prefix/suffix
-<span class="lineNum">      98 </span>                :       class sentry;
-<span class="lineNum">      99 </span>                :       friend class sentry;
-<span class="lineNum">     100 </span>                :       
-<span class="lineNum">     101 </span>                :       // [27.6.2.5] formatted output
-<span class="lineNum">     102 </span>                :       // [27.6.2.5.3]  basic_ostream::operator&lt;&lt;
-<span class="lineNum">     103 </span>                :       //@{
-<span class="lineNum">     104 </span>                :       /**
-<span class="lineNum">     105 </span>                :        *  @brief  Interface for manipulators.
-<span class="lineNum">     106 </span>                :        *
-<span class="lineNum">     107 </span>                :        *  Manipulators such as @c std::endl and @c std::hex use these
-<span class="lineNum">     108 </span>                :        *  functions in constructs like &quot;std::cout &lt;&lt; std::endl&quot;.  For more
-<span class="lineNum">     109 </span>                :        *  information, see the iomanip header.
-<span class="lineNum">     110 </span>                :       */
-<span class="lineNum">     111 </span>                :       __ostream_type&amp;
-<span class="lineNum">     112 </span><span class="lineNoCov">              0 :       operator&lt;&lt;(__ostream_type&amp; (*__pf)(__ostream_type&amp;))</span>
-<span class="lineNum">     113 </span>                :       {
-<span class="lineNum">     114 </span>                :         // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     115 </span>                :         // DR 60. What is a formatted input function?
-<span class="lineNum">     116 </span>                :         // The inserters for manipulators are *not* formatted output functions.
-<span class="lineNum">     117 </span><span class="lineNoCov">              0 :         return __pf(*this);</span>
-<span class="lineNum">     118 </span>                :       }
-<span class="lineNum">     119 </span>                : 
-<span class="lineNum">     120 </span>                :       __ostream_type&amp;
-<span class="lineNum">     121 </span>                :       operator&lt;&lt;(__ios_type&amp; (*__pf)(__ios_type&amp;))
-<span class="lineNum">     122 </span>                :       {
-<span class="lineNum">     123 </span>                :         // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     124 </span>                :         // DR 60. What is a formatted input function?
-<span class="lineNum">     125 </span>                :         // The inserters for manipulators are *not* formatted output functions.
-<span class="lineNum">     126 </span>                :         __pf(*this);
-<span class="lineNum">     127 </span>                :         return *this;
-<span class="lineNum">     128 </span>                :       }
-<span class="lineNum">     129 </span>                : 
-<span class="lineNum">     130 </span>                :       __ostream_type&amp;
-<span class="lineNum">     131 </span><span class="lineNoCov">              0 :       operator&lt;&lt;(ios_base&amp; (*__pf) (ios_base&amp;))</span>
-<span class="lineNum">     132 </span>                :       {
-<span class="lineNum">     133 </span>                :         // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     134 </span>                :         // DR 60. What is a formatted input function?
-<span class="lineNum">     135 </span>                :         // The inserters for manipulators are *not* formatted output functions.
-<span class="lineNum">     136 </span><span class="lineNoCov">              0 :         __pf(*this);</span>
-<span class="lineNum">     137 </span><span class="lineNoCov">              0 :         return *this;</span>
-<span class="lineNum">     138 </span>                :       }
-<span class="lineNum">     139 </span>                :       //@}
-<span class="lineNum">     140 </span>                : 
-<span class="lineNum">     141 </span>                :       // [27.6.2.5.2] arithmetic inserters
-<span class="lineNum">     142 </span>                :       /**
-<span class="lineNum">     143 </span>                :        *  @name Arithmetic Inserters
-<span class="lineNum">     144 </span>                :        *
-<span class="lineNum">     145 </span>                :        *  All the @c operator&lt;&lt; functions (aka &lt;em&gt;formatted output
-<span class="lineNum">     146 </span>                :        *  functions&lt;/em&gt;) have some common behavior.  Each starts by
-<span class="lineNum">     147 </span>                :        *  constructing a temporary object of type std::basic_ostream::sentry.
-<span class="lineNum">     148 </span>                :        *  This can have several effects, concluding with the setting of a
-<span class="lineNum">     149 </span>                :        *  status flag; see the sentry documentation for more.
-<span class="lineNum">     150 </span>                :        *
-<span class="lineNum">     151 </span>                :        *  If the sentry status is good, the function tries to generate
-<span class="lineNum">     152 </span>                :        *  whatever data is appropriate for the type of the argument.
-<span class="lineNum">     153 </span>                :        *
-<span class="lineNum">     154 </span>                :        *  If an exception is thrown during insertion, ios_base::badbit
-<span class="lineNum">     155 </span>                :        *  will be turned on in the stream's error state without causing an
-<span class="lineNum">     156 </span>                :        *  ios_base::failure to be thrown.  The original exception will then
-<span class="lineNum">     157 </span>                :        *  be rethrown.
-<span class="lineNum">     158 </span>                :       */
-<span class="lineNum">     159 </span>                :       //@{
-<span class="lineNum">     160 </span>                :       /**
-<span class="lineNum">     161 </span>                :        *  @brief  Basic arithmetic inserters
-<span class="lineNum">     162 </span>                :        *  @param  A variable of builtin type.
-<span class="lineNum">     163 </span>                :        *  @return  @c *this if successful
-<span class="lineNum">     164 </span>                :        *
-<span class="lineNum">     165 </span>                :        *  These functions use the stream's current locale (specifically, the
-<span class="lineNum">     166 </span>                :        *  @c num_get facet) to perform numeric formatting.
-<span class="lineNum">     167 </span>                :       */
-<span class="lineNum">     168 </span>                :       __ostream_type&amp; 
-<span class="lineNum">     169 </span><span class="lineNoCov">              0 :       operator&lt;&lt;(long __n)</span>
-<span class="lineNum">     170 </span><span class="lineNoCov">              0 :       { return _M_insert(__n); }</span>
-<span class="lineNum">     171 </span>                :       
-<span class="lineNum">     172 </span>                :       __ostream_type&amp; 
-<span class="lineNum">     173 </span>                :       operator&lt;&lt;(unsigned long __n)
-<span class="lineNum">     174 </span>                :       { return _M_insert(__n); }        
-<span class="lineNum">     175 </span>                : 
-<span class="lineNum">     176 </span>                :       __ostream_type&amp; 
-<span class="lineNum">     177 </span><span class="lineNoCov">              0 :       operator&lt;&lt;(bool __n)</span>
-<span class="lineNum">     178 </span><span class="lineNoCov">              0 :       { return _M_insert(__n); }</span>
-<span class="lineNum">     179 </span>                : 
-<span class="lineNum">     180 </span>                :       __ostream_type&amp; 
-<span class="lineNum">     181 </span>                :       operator&lt;&lt;(short __n);
-<span class="lineNum">     182 </span>                : 
-<span class="lineNum">     183 </span>                :       __ostream_type&amp; 
-<span class="lineNum">     184 </span>                :       operator&lt;&lt;(unsigned short __n)
-<span class="lineNum">     185 </span>                :       {
-<span class="lineNum">     186 </span>                :         // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     187 </span>                :         // 117. basic_ostream uses nonexistent num_put member functions.
-<span class="lineNum">     188 </span>                :         return _M_insert(static_cast&lt;unsigned long&gt;(__n));
-<span class="lineNum">     189 </span>                :       }
-<span class="lineNum">     190 </span>                : 
-<span class="lineNum">     191 </span>                :       __ostream_type&amp; 
-<span class="lineNum">     192 </span>                :       operator&lt;&lt;(int __n);
-<span class="lineNum">     193 </span>                : 
-<span class="lineNum">     194 </span>                :       __ostream_type&amp; 
-<span class="lineNum">     195 </span><span class="lineNoCov">              0 :       operator&lt;&lt;(unsigned int __n)</span>
-<span class="lineNum">     196 </span>                :       {
-<span class="lineNum">     197 </span>                :         // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     198 </span>                :         // 117. basic_ostream uses nonexistent num_put member functions.
-<span class="lineNum">     199 </span><span class="lineNoCov">              0 :         return _M_insert(static_cast&lt;unsigned long&gt;(__n));</span>
-<span class="lineNum">     200 </span>                :       }
-<span class="lineNum">     201 </span>                : 
-<span class="lineNum">     202 </span>                : #ifdef _GLIBCXX_USE_LONG_LONG
-<span class="lineNum">     203 </span>                :       __ostream_type&amp; 
-<span class="lineNum">     204 </span><span class="lineNoCov">              0 :       operator&lt;&lt;(long long __n)</span>
-<span class="lineNum">     205 </span><span class="lineNoCov">              0 :       { return _M_insert(__n); }</span>
-<span class="lineNum">     206 </span>                : 
-<span class="lineNum">     207 </span>                :       __ostream_type&amp; 
-<span class="lineNum">     208 </span>                :       operator&lt;&lt;(unsigned long long __n)
-<span class="lineNum">     209 </span>                :       { return _M_insert(__n); }        
-<span class="lineNum">     210 </span>                : #endif
-<span class="lineNum">     211 </span>                : 
-<span class="lineNum">     212 </span>                :       __ostream_type&amp; 
-<span class="lineNum">     213 </span><span class="lineNoCov">              0 :       operator&lt;&lt;(double __f)</span>
-<span class="lineNum">     214 </span><span class="lineNoCov">              0 :       { return _M_insert(__f); }</span>
-<span class="lineNum">     215 </span>                : 
-<span class="lineNum">     216 </span>                :       __ostream_type&amp; 
-<span class="lineNum">     217 </span>                :       operator&lt;&lt;(float __f)
-<span class="lineNum">     218 </span>                :       {
-<span class="lineNum">     219 </span>                :         // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     220 </span>                :         // 117. basic_ostream uses nonexistent num_put member functions.
-<span class="lineNum">     221 </span>                :         return _M_insert(static_cast&lt;double&gt;(__f));
-<span class="lineNum">     222 </span>                :       }
-<span class="lineNum">     223 </span>                : 
-<span class="lineNum">     224 </span>                :       __ostream_type&amp; 
-<span class="lineNum">     225 </span>                :       operator&lt;&lt;(long double __f)
-<span class="lineNum">     226 </span>                :       { return _M_insert(__f); }
-<span class="lineNum">     227 </span>                : 
-<span class="lineNum">     228 </span>                :       __ostream_type&amp; 
-<span class="lineNum">     229 </span><span class="lineNoCov">              0 :       operator&lt;&lt;(const void* __p)</span>
-<span class="lineNum">     230 </span><span class="lineNoCov">              0 :       { return _M_insert(__p); }</span>
-<span class="lineNum">     231 </span>                : 
-<span class="lineNum">     232 </span>                :       /**
-<span class="lineNum">     233 </span>                :        *  @brief  Extracting from another streambuf.
-<span class="lineNum">     234 </span>                :        *  @param  sb  A pointer to a streambuf
-<span class="lineNum">     235 </span>                :        *
-<span class="lineNum">     236 </span>                :        *  This function behaves like one of the basic arithmetic extractors,
-<span class="lineNum">     237 </span>                :        *  in that it also constructs a sentry object and has the same error
-<span class="lineNum">     238 </span>                :        *  handling behavior.
-<span class="lineNum">     239 </span>                :        *
-<span class="lineNum">     240 </span>                :        *  If @a sb is NULL, the stream will set failbit in its error state.
-<span class="lineNum">     241 </span>                :        *
-<span class="lineNum">     242 </span>                :        *  Characters are extracted from @a sb and inserted into @c *this
-<span class="lineNum">     243 </span>                :        *  until one of the following occurs:
-<span class="lineNum">     244 </span>                :        *
-<span class="lineNum">     245 </span>                :        *  - the input stream reaches end-of-file,
-<span class="lineNum">     246 </span>                :        *  - insertion into the output sequence fails (in this case, the
-<span class="lineNum">     247 </span>                :        *    character that would have been inserted is not extracted), or
-<span class="lineNum">     248 </span>                :        *  - an exception occurs while getting a character from @a sb, which
-<span class="lineNum">     249 </span>                :        *    sets failbit in the error state
-<span class="lineNum">     250 </span>                :        *
-<span class="lineNum">     251 </span>                :        *  If the function inserts no characters, failbit is set.
-<span class="lineNum">     252 </span>                :       */
-<span class="lineNum">     253 </span>                :       __ostream_type&amp; 
-<span class="lineNum">     254 </span>                :       operator&lt;&lt;(__streambuf_type* __sb);
-<span class="lineNum">     255 </span>                :       //@}
-<span class="lineNum">     256 </span>                : 
-<span class="lineNum">     257 </span>                :       // [27.6.2.6] unformatted output functions
-<span class="lineNum">     258 </span>                :       /**
-<span class="lineNum">     259 </span>                :        *  @name Unformatted Output Functions
-<span class="lineNum">     260 </span>                :        *
-<span class="lineNum">     261 </span>                :        *  All the unformatted output functions have some common behavior.
-<span class="lineNum">     262 </span>                :        *  Each starts by constructing a temporary object of type
-<span class="lineNum">     263 </span>                :        *  std::basic_ostream::sentry.  This has several effects, concluding
-<span class="lineNum">     264 </span>                :        *  with the setting of a status flag; see the sentry documentation
-<span class="lineNum">     265 </span>                :        *  for more.
-<span class="lineNum">     266 </span>                :        *
-<span class="lineNum">     267 </span>                :        *  If the sentry status is good, the function tries to generate
-<span class="lineNum">     268 </span>                :        *  whatever data is appropriate for the type of the argument.
-<span class="lineNum">     269 </span>                :        *
-<span class="lineNum">     270 </span>                :        *  If an exception is thrown during insertion, ios_base::badbit
-<span class="lineNum">     271 </span>                :        *  will be turned on in the stream's error state.  If badbit is on in
-<span class="lineNum">     272 </span>                :        *  the stream's exceptions mask, the exception will be rethrown
-<span class="lineNum">     273 </span>                :        *  without completing its actions.
-<span class="lineNum">     274 </span>                :       */
-<span class="lineNum">     275 </span>                :       //@{
-<span class="lineNum">     276 </span>                :       /**
-<span class="lineNum">     277 </span>                :        *  @brief  Simple insertion.
-<span class="lineNum">     278 </span>                :        *  @param  c  The character to insert.
-<span class="lineNum">     279 </span>                :        *  @return  *this
-<span class="lineNum">     280 </span>                :        *
-<span class="lineNum">     281 </span>                :        *  Tries to insert @a c.
-<span class="lineNum">     282 </span>                :        *
-<span class="lineNum">     283 </span>                :        *  @note  This function is not overloaded on signed char and
-<span class="lineNum">     284 </span>                :        *         unsigned char.
-<span class="lineNum">     285 </span>                :       */
-<span class="lineNum">     286 </span>                :       __ostream_type&amp; 
-<span class="lineNum">     287 </span>                :       put(char_type __c);
-<span class="lineNum">     288 </span>                : 
-<span class="lineNum">     289 </span>                :       // Core write functionality, without sentry.
-<span class="lineNum">     290 </span>                :       void
-<span class="lineNum">     291 </span>                :       _M_write(const char_type* __s, streamsize __n)
-<span class="lineNum">     292 </span>                :       {
-<span class="lineNum">     293 </span>                :         const streamsize __put = this-&gt;rdbuf()-&gt;sputn(__s, __n);
-<span class="lineNum">     294 </span>                :         if (__put != __n)
-<span class="lineNum">     295 </span>                :           this-&gt;setstate(ios_base::badbit);
-<span class="lineNum">     296 </span>                :       }
-<span class="lineNum">     297 </span>                : 
-<span class="lineNum">     298 </span>                :       /**
-<span class="lineNum">     299 </span>                :        *  @brief  Character string insertion.
-<span class="lineNum">     300 </span>                :        *  @param  s  The array to insert.
-<span class="lineNum">     301 </span>                :        *  @param  n  Maximum number of characters to insert.
-<span class="lineNum">     302 </span>                :        *  @return  *this
-<span class="lineNum">     303 </span>                :        *
-<span class="lineNum">     304 </span>                :        *  Characters are copied from @a s and inserted into the stream until
-<span class="lineNum">     305 </span>                :        *  one of the following happens:
-<span class="lineNum">     306 </span>                :        *
-<span class="lineNum">     307 </span>                :        *  - @a n characters are inserted
-<span class="lineNum">     308 </span>                :        *  - inserting into the output sequence fails (in this case, badbit
-<span class="lineNum">     309 </span>                :        *    will be set in the stream's error state)
-<span class="lineNum">     310 </span>                :        *
-<span class="lineNum">     311 </span>                :        *  @note  This function is not overloaded on signed char and
-<span class="lineNum">     312 </span>                :        *         unsigned char.
-<span class="lineNum">     313 </span>                :       */
-<span class="lineNum">     314 </span>                :       __ostream_type&amp; 
-<span class="lineNum">     315 </span>                :       write(const char_type* __s, streamsize __n);
-<span class="lineNum">     316 </span>                :       //@}
-<span class="lineNum">     317 </span>                : 
-<span class="lineNum">     318 </span>                :       /**
-<span class="lineNum">     319 </span>                :        *  @brief  Synchronizing the stream buffer.
-<span class="lineNum">     320 </span>                :        *  @return  *this
-<span class="lineNum">     321 </span>                :        *
-<span class="lineNum">     322 </span>                :        *  If @c rdbuf() is a null pointer, changes nothing.
-<span class="lineNum">     323 </span>                :        *
-<span class="lineNum">     324 </span>                :        *  Otherwise, calls @c rdbuf()-&gt;pubsync(), and if that returns -1,
-<span class="lineNum">     325 </span>                :        *  sets badbit.
-<span class="lineNum">     326 </span>                :       */
-<span class="lineNum">     327 </span>                :       __ostream_type&amp; 
-<span class="lineNum">     328 </span>                :       flush();
-<span class="lineNum">     329 </span>                : 
-<span class="lineNum">     330 </span>                :       // [27.6.2.4] seek members
-<span class="lineNum">     331 </span>                :       /**
-<span class="lineNum">     332 </span>                :        *  @brief  Getting the current write position.
-<span class="lineNum">     333 </span>                :        *  @return  A file position object.
-<span class="lineNum">     334 </span>                :        *
-<span class="lineNum">     335 </span>                :        *  If @c fail() is not false, returns @c pos_type(-1) to indicate
-<span class="lineNum">     336 </span>                :        *  failure.  Otherwise returns @c rdbuf()-&gt;pubseekoff(0,cur,out).
-<span class="lineNum">     337 </span>                :       */
-<span class="lineNum">     338 </span>                :       pos_type 
-<span class="lineNum">     339 </span>                :       tellp();
-<span class="lineNum">     340 </span>                : 
-<span class="lineNum">     341 </span>                :       /**
-<span class="lineNum">     342 </span>                :        *  @brief  Changing the current write position.
-<span class="lineNum">     343 </span>                :        *  @param  pos  A file position object.
-<span class="lineNum">     344 </span>                :        *  @return  *this
-<span class="lineNum">     345 </span>                :        *
-<span class="lineNum">     346 </span>                :        *  If @c fail() is not true, calls @c rdbuf()-&gt;pubseekpos(pos).  If
-<span class="lineNum">     347 </span>                :        *  that function fails, sets failbit.
-<span class="lineNum">     348 </span>                :       */
-<span class="lineNum">     349 </span>                :       __ostream_type&amp; 
-<span class="lineNum">     350 </span>                :       seekp(pos_type);
-<span class="lineNum">     351 </span>                : 
-<span class="lineNum">     352 </span>                :       /**
-<span class="lineNum">     353 </span>                :        *  @brief  Changing the current write position.
-<span class="lineNum">     354 </span>                :        *  @param  off  A file offset object.
-<span class="lineNum">     355 </span>                :        *  @param  dir  The direction in which to seek.
-<span class="lineNum">     356 </span>                :        *  @return  *this
-<span class="lineNum">     357 </span>                :        *
-<span class="lineNum">     358 </span>                :        *  If @c fail() is not true, calls @c rdbuf()-&gt;pubseekoff(off,dir).
-<span class="lineNum">     359 </span>                :        *  If that function fails, sets failbit.
-<span class="lineNum">     360 </span>                :       */
-<span class="lineNum">     361 </span>                :        __ostream_type&amp; 
-<span class="lineNum">     362 </span>                :       seekp(off_type, ios_base::seekdir);
-<span class="lineNum">     363 </span>                :       
-<span class="lineNum">     364 </span>                :     protected:
-<span class="lineNum">     365 </span><span class="lineNoCov">              0 :       basic_ostream()</span>
-<span class="lineNum">     366 </span><span class="lineNoCov">              0 :       { this-&gt;init(0); }</span>
-<span class="lineNum">     367 </span>                : 
-<span class="lineNum">     368 </span>                :       template&lt;typename _ValueT&gt;
-<span class="lineNum">     369 </span>                :         __ostream_type&amp;
-<span class="lineNum">     370 </span>                :         _M_insert(_ValueT __v);
-<span class="lineNum">     371 </span>                :     };
-<span class="lineNum">     372 </span>                : 
-<span class="lineNum">     373 </span>                :   /**
-<span class="lineNum">     374 </span>                :    *  @brief  Performs setup work for output streams.
-<span class="lineNum">     375 </span>                :    *
-<span class="lineNum">     376 </span>                :    *  Objects of this class are created before all of the standard
-<span class="lineNum">     377 </span>                :    *  inserters are run.  It is responsible for &quot;exception-safe prefix and
-<span class="lineNum">     378 </span>                :    *  suffix operations.&quot;  Additional actions may be added by the
-<span class="lineNum">     379 </span>                :    *  implementation, and we list them in
-<span class="lineNum">     380 </span>                :    *  http://gcc.gnu.org/onlinedocs/libstdc++/17_intro/howto.html#5
-<span class="lineNum">     381 </span>                :    *  under [27.6] notes.
-<span class="lineNum">     382 </span>                :   */
-<span class="lineNum">     383 </span>                :   template &lt;typename _CharT, typename _Traits&gt;
-<span class="lineNum">     384 </span>                :     class basic_ostream&lt;_CharT, _Traits&gt;::sentry
-<span class="lineNum">     385 </span>                :     {
-<span class="lineNum">     386 </span>                :       // Data Members:
-<span class="lineNum">     387 </span>                :       bool                              _M_ok;
-<span class="lineNum">     388 </span>                :       basic_ostream&lt;_CharT, _Traits&gt;&amp;         _M_os;
-<span class="lineNum">     389 </span>                :       
-<span class="lineNum">     390 </span>                :     public:
-<span class="lineNum">     391 </span>                :       /**
-<span class="lineNum">     392 </span>                :        *  @brief  The constructor performs preparatory work.
-<span class="lineNum">     393 </span>                :        *  @param  os  The output stream to guard.
-<span class="lineNum">     394 </span>                :        *
-<span class="lineNum">     395 </span>                :        *  If the stream state is good (@a os.good() is true), then if the
-<span class="lineNum">     396 </span>                :        *  stream is tied to another output stream, @c is.tie()-&gt;flush()
-<span class="lineNum">     397 </span>                :        *  is called to synchronize the output sequences.
-<span class="lineNum">     398 </span>                :        *
-<span class="lineNum">     399 </span>                :        *  If the stream state is still good, then the sentry state becomes
-<span class="lineNum">     400 </span>                :        *  true (&quot;okay&quot;).
-<span class="lineNum">     401 </span>                :       */
-<span class="lineNum">     402 </span>                :       explicit
-<span class="lineNum">     403 </span>                :       sentry(basic_ostream&lt;_CharT, _Traits&gt;&amp; __os);
-<span class="lineNum">     404 </span>                : 
-<span class="lineNum">     405 </span>                :       /**
-<span class="lineNum">     406 </span>                :        *  @brief  Possibly flushes the stream.
-<span class="lineNum">     407 </span>                :        *
-<span class="lineNum">     408 </span>                :        *  If @c ios_base::unitbuf is set in @c os.flags(), and
-<span class="lineNum">     409 </span>                :        *  @c std::uncaught_exception() is true, the sentry destructor calls
-<span class="lineNum">     410 </span>                :        *  @c flush() on the output stream.
-<span class="lineNum">     411 </span>                :       */
-<span class="lineNum">     412 </span>                :       ~sentry()
-<span class="lineNum">     413 </span>                :       {
-<span class="lineNum">     414 </span>                :         // XXX MT
-<span class="lineNum">     415 </span>                :         if (bool(_M_os.flags() &amp; ios_base::unitbuf) &amp;&amp; !uncaught_exception())
-<span class="lineNum">     416 </span>                :           {
-<span class="lineNum">     417 </span>                :             // Can't call flush directly or else will get into recursive lock.
-<span class="lineNum">     418 </span>                :             if (_M_os.rdbuf() &amp;&amp; _M_os.rdbuf()-&gt;pubsync() == -1)
-<span class="lineNum">     419 </span>                :               _M_os.setstate(ios_base::badbit);
-<span class="lineNum">     420 </span>                :           }
-<span class="lineNum">     421 </span>                :       }
-<span class="lineNum">     422 </span>                : 
-<span class="lineNum">     423 </span>                :       /**
-<span class="lineNum">     424 </span>                :        *  @brief  Quick status checking.
-<span class="lineNum">     425 </span>                :        *  @return  The sentry state.
-<span class="lineNum">     426 </span>                :        *
-<span class="lineNum">     427 </span>                :        *  For ease of use, sentries may be converted to booleans.  The
-<span class="lineNum">     428 </span>                :        *  return value is that of the sentry state (true == okay).
-<span class="lineNum">     429 </span>                :       */
-<span class="lineNum">     430 </span>                :       operator bool() const
-<span class="lineNum">     431 </span>                :       { return _M_ok; }
-<span class="lineNum">     432 </span>                :     };
-<span class="lineNum">     433 </span>                : 
-<span class="lineNum">     434 </span>                :   // [27.6.2.5.4] character insertion templates
-<span class="lineNum">     435 </span>                :   //@{
-<span class="lineNum">     436 </span>                :   /**
-<span class="lineNum">     437 </span>                :    *  @brief  Character inserters
-<span class="lineNum">     438 </span>                :    *  @param  out  An output stream.
-<span class="lineNum">     439 </span>                :    *  @param  c  A character.
-<span class="lineNum">     440 </span>                :    *  @return  out
-<span class="lineNum">     441 </span>                :    *
-<span class="lineNum">     442 </span>                :    *  Behaves like one of the formatted arithmetic inserters described in
-<span class="lineNum">     443 </span>                :    *  std::basic_ostream.  After constructing a sentry object with good
-<span class="lineNum">     444 </span>                :    *  status, this function inserts a single character and any required
-<span class="lineNum">     445 </span>                :    *  padding (as determined by [22.2.2.2.2]).  @c out.width(0) is then
-<span class="lineNum">     446 </span>                :    *  called.
-<span class="lineNum">     447 </span>                :    *
-<span class="lineNum">     448 </span>                :    *  If @a c is of type @c char and the character type of the stream is not
-<span class="lineNum">     449 </span>                :    *  @c char, the character is widened before insertion.
-<span class="lineNum">     450 </span>                :   */
-<span class="lineNum">     451 </span>                :   template&lt;typename _CharT, typename _Traits&gt;
-<span class="lineNum">     452 </span>                :     inline basic_ostream&lt;_CharT, _Traits&gt;&amp;
-<span class="lineNum">     453 </span>                :     operator&lt;&lt;(basic_ostream&lt;_CharT, _Traits&gt;&amp; __out, _CharT __c)
-<span class="lineNum">     454 </span>                :     { return __ostream_insert(__out, &amp;__c, 1); }
-<span class="lineNum">     455 </span>                : 
-<span class="lineNum">     456 </span>                :   template&lt;typename _CharT, typename _Traits&gt;
-<span class="lineNum">     457 </span>                :     inline basic_ostream&lt;_CharT, _Traits&gt;&amp;
-<span class="lineNum">     458 </span>                :     operator&lt;&lt;(basic_ostream&lt;_CharT, _Traits&gt;&amp; __out, char __c)
-<span class="lineNum">     459 </span>                :     { return (__out &lt;&lt; __out.widen(__c)); }
-<span class="lineNum">     460 </span>                : 
-<span class="lineNum">     461 </span>                :   // Specialization
-<span class="lineNum">     462 </span>                :   template &lt;class _Traits&gt; 
-<span class="lineNum">     463 </span>                :     inline basic_ostream&lt;char, _Traits&gt;&amp;
-<span class="lineNum">     464 </span><span class="lineNoCov">              0 :     operator&lt;&lt;(basic_ostream&lt;char, _Traits&gt;&amp; __out, char __c)</span>
-<span class="lineNum">     465 </span><span class="lineNoCov">              0 :     { return __ostream_insert(__out, &amp;__c, 1); }</span>
-<span class="lineNum">     466 </span>                : 
-<span class="lineNum">     467 </span>                :   // Signed and unsigned
-<span class="lineNum">     468 </span>                :   template&lt;class _Traits&gt;
-<span class="lineNum">     469 </span>                :     inline basic_ostream&lt;char, _Traits&gt;&amp;
-<span class="lineNum">     470 </span>                :     operator&lt;&lt;(basic_ostream&lt;char, _Traits&gt;&amp; __out, signed char __c)
-<span class="lineNum">     471 </span>                :     { return (__out &lt;&lt; static_cast&lt;char&gt;(__c)); }
-<span class="lineNum">     472 </span>                :   
-<span class="lineNum">     473 </span>                :   template&lt;class _Traits&gt;
-<span class="lineNum">     474 </span>                :     inline basic_ostream&lt;char, _Traits&gt;&amp;
-<span class="lineNum">     475 </span>                :     operator&lt;&lt;(basic_ostream&lt;char, _Traits&gt;&amp; __out, unsigned char __c)
-<span class="lineNum">     476 </span>                :     { return (__out &lt;&lt; static_cast&lt;char&gt;(__c)); }
-<span class="lineNum">     477 </span>                :   //@}
-<span class="lineNum">     478 </span>                :   
-<span class="lineNum">     479 </span>                :   //@{
-<span class="lineNum">     480 </span>                :   /**
-<span class="lineNum">     481 </span>                :    *  @brief  String inserters
-<span class="lineNum">     482 </span>                :    *  @param  out  An output stream.
-<span class="lineNum">     483 </span>                :    *  @param  s  A character string.
-<span class="lineNum">     484 </span>                :    *  @return  out
-<span class="lineNum">     485 </span>                :    *  @pre  @a s must be a non-NULL pointer
-<span class="lineNum">     486 </span>                :    *
-<span class="lineNum">     487 </span>                :    *  Behaves like one of the formatted arithmetic inserters described in
-<span class="lineNum">     488 </span>                :    *  std::basic_ostream.  After constructing a sentry object with good
-<span class="lineNum">     489 </span>                :    *  status, this function inserts @c traits::length(s) characters starting
-<span class="lineNum">     490 </span>                :    *  at @a s, widened if necessary, followed by any required padding (as
-<span class="lineNum">     491 </span>                :    *  determined by [22.2.2.2.2]).  @c out.width(0) is then called.
-<span class="lineNum">     492 </span>                :   */
-<span class="lineNum">     493 </span>                :   template&lt;typename _CharT, typename _Traits&gt;
-<span class="lineNum">     494 </span>                :     inline basic_ostream&lt;_CharT, _Traits&gt;&amp;
-<span class="lineNum">     495 </span>                :     operator&lt;&lt;(basic_ostream&lt;_CharT, _Traits&gt;&amp; __out, const _CharT* __s)
-<span class="lineNum">     496 </span>                :     {
-<span class="lineNum">     497 </span>                :       if (!__s)
-<span class="lineNum">     498 </span>                :         __out.setstate(ios_base::badbit);
-<span class="lineNum">     499 </span>                :       else
-<span class="lineNum">     500 </span>                :         __ostream_insert(__out, __s,
-<span class="lineNum">     501 </span>                :                          static_cast&lt;streamsize&gt;(_Traits::length(__s)));
-<span class="lineNum">     502 </span>                :       return __out;
-<span class="lineNum">     503 </span>                :     }
-<span class="lineNum">     504 </span>                : 
-<span class="lineNum">     505 </span>                :   template&lt;typename _CharT, typename _Traits&gt;
-<span class="lineNum">     506 </span>                :     basic_ostream&lt;_CharT, _Traits&gt; &amp;
-<span class="lineNum">     507 </span>                :     operator&lt;&lt;(basic_ostream&lt;_CharT, _Traits&gt;&amp; __out, const char* __s);
-<span class="lineNum">     508 </span>                : 
-<span class="lineNum">     509 </span>                :   // Partial specializations
-<span class="lineNum">     510 </span>                :   template&lt;class _Traits&gt;
-<span class="lineNum">     511 </span>                :     inline basic_ostream&lt;char, _Traits&gt;&amp;
-<span class="lineNum">     512 </span><span class="lineNoCov">              0 :     operator&lt;&lt;(basic_ostream&lt;char, _Traits&gt;&amp; __out, const char* __s)</span>
-<span class="lineNum">     513 </span>                :     {
-<span class="lineNum">     514 </span><span class="lineNoCov">              0 :       if (!__s)</span>
-<span class="lineNum">     515 </span><span class="lineNoCov">              0 :         __out.setstate(ios_base::badbit);</span>
-<span class="lineNum">     516 </span>                :       else
-<span class="lineNum">     517 </span><span class="lineNoCov">              0 :         __ostream_insert(__out, __s,</span>
-<span class="lineNum">     518 </span>                :                          static_cast&lt;streamsize&gt;(_Traits::length(__s)));
-<span class="lineNum">     519 </span><span class="lineNoCov">              0 :       return __out;</span>
-<span class="lineNum">     520 </span>                :     }
-<span class="lineNum">     521 </span>                : 
-<span class="lineNum">     522 </span>                :   // Signed and unsigned
-<span class="lineNum">     523 </span>                :   template&lt;class _Traits&gt;
-<span class="lineNum">     524 </span>                :     inline basic_ostream&lt;char, _Traits&gt;&amp;
-<span class="lineNum">     525 </span>                :     operator&lt;&lt;(basic_ostream&lt;char, _Traits&gt;&amp; __out, const signed char* __s)
-<span class="lineNum">     526 </span>                :     { return (__out &lt;&lt; reinterpret_cast&lt;const char*&gt;(__s)); }
-<span class="lineNum">     527 </span>                : 
-<span class="lineNum">     528 </span>                :   template&lt;class _Traits&gt;
-<span class="lineNum">     529 </span>                :     inline basic_ostream&lt;char, _Traits&gt; &amp;
-<span class="lineNum">     530 </span>                :     operator&lt;&lt;(basic_ostream&lt;char, _Traits&gt;&amp; __out, const unsigned char* __s)
-<span class="lineNum">     531 </span>                :     { return (__out &lt;&lt; reinterpret_cast&lt;const char*&gt;(__s)); }
-<span class="lineNum">     532 </span>                :   //@}
-<span class="lineNum">     533 </span>                : 
-<span class="lineNum">     534 </span>                :   // [27.6.2.7] standard basic_ostream manipulators
-<span class="lineNum">     535 </span>                :   /**
-<span class="lineNum">     536 </span>                :    *  @brief  Write a newline and flush the stream.
-<span class="lineNum">     537 </span>                :    *
-<span class="lineNum">     538 </span>                :    *  This manipulator is often mistakenly used when a simple newline is
-<span class="lineNum">     539 </span>                :    *  desired, leading to poor buffering performance.  See
-<span class="lineNum">     540 </span>                :    *  http://gcc.gnu.org/onlinedocs/libstdc++/27_io/howto.html#2 for more
-<span class="lineNum">     541 </span>                :    *  on this subject.
-<span class="lineNum">     542 </span>                :   */
-<span class="lineNum">     543 </span>                :   template&lt;typename _CharT, typename _Traits&gt;
-<span class="lineNum">     544 </span>                :     inline basic_ostream&lt;_CharT, _Traits&gt;&amp; 
-<span class="lineNum">     545 </span><span class="lineNoCov">              0 :     endl(basic_ostream&lt;_CharT, _Traits&gt;&amp; __os)</span>
-<span class="lineNum">     546 </span><span class="lineNoCov">              0 :     { return flush(__os.put(__os.widen('\n'))); }</span>
-<span class="lineNum">     547 </span>                : 
-<span class="lineNum">     548 </span>                :   /**
-<span class="lineNum">     549 </span>                :    *  @brief  Write a null character into the output sequence.
-<span class="lineNum">     550 </span>                :    *
-<span class="lineNum">     551 </span>                :    *  &quot;Null character&quot; is @c CharT() by definition.  For CharT of @c char,
-<span class="lineNum">     552 </span>                :    *  this correctly writes the ASCII @c NUL character string terminator.
-<span class="lineNum">     553 </span>                :   */
-<span class="lineNum">     554 </span>                :   template&lt;typename _CharT, typename _Traits&gt;
-<span class="lineNum">     555 </span>                :     inline basic_ostream&lt;_CharT, _Traits&gt;&amp; 
-<span class="lineNum">     556 </span>                :     ends(basic_ostream&lt;_CharT, _Traits&gt;&amp; __os)
-<span class="lineNum">     557 </span>                :     { return __os.put(_CharT()); }
-<span class="lineNum">     558 </span>                :   
-<span class="lineNum">     559 </span>                :   /**
-<span class="lineNum">     560 </span>                :    *  @brief  Flushes the output stream.
-<span class="lineNum">     561 </span>                :    *
-<span class="lineNum">     562 </span>                :    *  This manipulator simply calls the stream's @c flush() member function.
-<span class="lineNum">     563 </span>                :   */
-<span class="lineNum">     564 </span>                :   template&lt;typename _CharT, typename _Traits&gt;
-<span class="lineNum">     565 </span>                :     inline basic_ostream&lt;_CharT, _Traits&gt;&amp; 
-<span class="lineNum">     566 </span><span class="lineNoCov">              0 :     flush(basic_ostream&lt;_CharT, _Traits&gt;&amp; __os)</span>
-<span class="lineNum">     567 </span><span class="lineNoCov">              0 :     { return __os.flush(); }</span>
-<span class="lineNum">     568 </span>                : 
-<span class="lineNum">     569 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">     570 </span>                : 
-<span class="lineNum">     571 </span>                : #ifndef _GLIBCXX_EXPORT_TEMPLATE
-<span class="lineNum">     572 </span>                : # include &lt;bits/ostream.tcc&gt;
-<span class="lineNum">     573 </span>                : #endif
-<span class="lineNum">     574 </span>                : 
-<span class="lineNum">     575 </span>                : #endif  /* _GLIBCXX_OSTREAM */
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/sstream.gcov.html b/rep/usr/include/c++/4.3/sstream.gcov.html
deleted file mode 100644
index 0254a8d..0000000
--- a/rep/usr/include/c++/4.3/sstream.gcov.html
+++ /dev/null
@@ -1,642 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/sstream</title>
-  <link rel="stylesheet" type="text/css" href="../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3</a> - sstream</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">43</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">0.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">0</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // String based streams -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005,
-<span class="lineNum">       4 </span>                : // 2006, 2008 Free Software Foundation, Inc.
-<span class="lineNum">       5 </span>                : //
-<span class="lineNum">       6 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       7 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       8 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">       9 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      10 </span>                : // any later version.
-<span class="lineNum">      11 </span>                : 
-<span class="lineNum">      12 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      13 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      14 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      15 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      16 </span>                : 
-<span class="lineNum">      17 </span>                : // You should have received a copy of the GNU General Public License
-<span class="lineNum">      18 </span>                : // along with this library; see the file COPYING.  If not, write to
-<span class="lineNum">      19 </span>                : // the Free Software Foundation, 51 Franklin Street, Fifth Floor,
-<span class="lineNum">      20 </span>                : // Boston, MA 02110-1301, USA.
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      23 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      24 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      25 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      26 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      27 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      28 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      29 </span>                : // the GNU General Public License.
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : /** @file sstream
-<span class="lineNum">      32 </span>                :  *  This is a Standard C++ Library header.
-<span class="lineNum">      33 </span>                :  */
-<span class="lineNum">      34 </span>                : 
-<span class="lineNum">      35 </span>                : //
-<span class="lineNum">      36 </span>                : // ISO C++ 14882: 27.7  String-based streams
-<span class="lineNum">      37 </span>                : //
-<span class="lineNum">      38 </span>                : 
-<span class="lineNum">      39 </span>                : #ifndef _GLIBCXX_SSTREAM
-<span class="lineNum">      40 </span>                : #define _GLIBCXX_SSTREAM 1
-<span class="lineNum">      41 </span>                : 
-<span class="lineNum">      42 </span>                : #pragma GCC system_header
-<span class="lineNum">      43 </span>                : 
-<span class="lineNum">      44 </span>                : #include &lt;istream&gt;
-<span class="lineNum">      45 </span>                : #include &lt;ostream&gt;
-<span class="lineNum">      46 </span>                : 
-<span class="lineNum">      47 </span>                : _GLIBCXX_BEGIN_NAMESPACE(std)
-<span class="lineNum">      48 </span>                : 
-<span class="lineNum">      49 </span>                :   // [27.7.1] template class basic_stringbuf
-<span class="lineNum">      50 </span>                :   /**
-<span class="lineNum">      51 </span>                :    *  @brief  The actual work of input and output (for std::string).
-<span class="lineNum">      52 </span>                :    *
-<span class="lineNum">      53 </span>                :    *  This class associates either or both of its input and output sequences
-<span class="lineNum">      54 </span>                :    *  with a sequence of characters, which can be initialized from, or made
-<span class="lineNum">      55 </span>                :    *  available as, a @c std::basic_string.  (Paraphrased from [27.7.1]/1.)
-<span class="lineNum">      56 </span>                :    *
-<span class="lineNum">      57 </span>                :    *  For this class, open modes (of type @c ios_base::openmode) have
-<span class="lineNum">      58 </span>                :    *  @c in set if the input sequence can be read, and @c out set if the
-<span class="lineNum">      59 </span>                :    *  output sequence can be written.
-<span class="lineNum">      60 </span>                :   */
-<span class="lineNum">      61 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">      62 </span>                :     class basic_stringbuf : public basic_streambuf&lt;_CharT, _Traits&gt;
-<span class="lineNum">      63 </span>                :     {
-<span class="lineNum">      64 </span>                :     public:
-<span class="lineNum">      65 </span>                :       // Types:
-<span class="lineNum">      66 </span>                :       typedef _CharT                                    char_type;
-<span class="lineNum">      67 </span>                :       typedef _Traits                                   traits_type;
-<span class="lineNum">      68 </span>                :       // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">      69 </span>                :       // 251. basic_stringbuf missing allocator_type
-<span class="lineNum">      70 </span>                :       typedef _Alloc                                    allocator_type;
-<span class="lineNum">      71 </span>                :       typedef typename traits_type::int_type            int_type;
-<span class="lineNum">      72 </span>                :       typedef typename traits_type::pos_type            pos_type;
-<span class="lineNum">      73 </span>                :       typedef typename traits_type::off_type            off_type;
-<span class="lineNum">      74 </span>                : 
-<span class="lineNum">      75 </span>                :       typedef basic_streambuf&lt;char_type, traits_type&gt;     __streambuf_type;
-<span class="lineNum">      76 </span>                :       typedef basic_string&lt;char_type, _Traits, _Alloc&gt;    __string_type;
-<span class="lineNum">      77 </span>                :       typedef typename __string_type::size_type         __size_type;
-<span class="lineNum">      78 </span>                : 
-<span class="lineNum">      79 </span>                :     protected:
-<span class="lineNum">      80 </span>                :       /// Place to stash in || out || in | out settings for current stringbuf.
-<span class="lineNum">      81 </span>                :       ios_base::openmode        _M_mode;
-<span class="lineNum">      82 </span>                : 
-<span class="lineNum">      83 </span>                :       // Data Members:
-<span class="lineNum">      84 </span>                :       __string_type             _M_string;
-<span class="lineNum">      85 </span>                : 
-<span class="lineNum">      86 </span>                :     public:
-<span class="lineNum">      87 </span>                :       // Constructors:
-<span class="lineNum">      88 </span>                :       /**
-<span class="lineNum">      89 </span>                :        *  @brief  Starts with an empty string buffer.
-<span class="lineNum">      90 </span>                :        *  @param  mode  Whether the buffer can read, or write, or both.
-<span class="lineNum">      91 </span>                :        *
-<span class="lineNum">      92 </span>                :        *  The default constructor initializes the parent class using its
-<span class="lineNum">      93 </span>                :        *  own default ctor.
-<span class="lineNum">      94 </span>                :       */
-<span class="lineNum">      95 </span>                :       explicit
-<span class="lineNum">      96 </span><span class="lineNoCov">              0 :       basic_stringbuf(ios_base::openmode __mode = ios_base::in | ios_base::out)</span>
-<span class="lineNum">      97 </span><span class="lineNoCov">              0 :       : __streambuf_type(), _M_mode(__mode), _M_string()</span>
-<span class="lineNum">      98 </span><span class="lineNoCov">              0 :       { }</span>
-<span class="lineNum">      99 </span>                : 
-<span class="lineNum">     100 </span>                :       /**
-<span class="lineNum">     101 </span>                :        *  @brief  Starts with an existing string buffer.
-<span class="lineNum">     102 </span>                :        *  @param  str  A string to copy as a starting buffer.
-<span class="lineNum">     103 </span>                :        *  @param  mode  Whether the buffer can read, or write, or both.
-<span class="lineNum">     104 </span>                :        *
-<span class="lineNum">     105 </span>                :        *  This constructor initializes the parent class using its
-<span class="lineNum">     106 </span>                :        *  own default ctor.
-<span class="lineNum">     107 </span>                :       */
-<span class="lineNum">     108 </span>                :       explicit
-<span class="lineNum">     109 </span>                :       basic_stringbuf(const __string_type&amp; __str,
-<span class="lineNum">     110 </span><span class="lineNoCov">              0 :                       ios_base::openmode __mode = ios_base::in | ios_base::out)</span>
-<span class="lineNum">     111 </span><span class="lineNoCov">              0 :       : __streambuf_type(), _M_mode(), _M_string(__str.data(), __str.size())</span>
-<span class="lineNum">     112 </span><span class="lineNoCov">              0 :       { _M_stringbuf_init(__mode); }</span>
-<span class="lineNum">     113 </span>                : 
-<span class="lineNum">     114 </span>                :       // Get and set:
-<span class="lineNum">     115 </span>                :       /**
-<span class="lineNum">     116 </span>                :        *  @brief  Copying out the string buffer.
-<span class="lineNum">     117 </span>                :        *  @return  A copy of one of the underlying sequences.
-<span class="lineNum">     118 </span>                :        *
-<span class="lineNum">     119 </span>                :        *  &quot;If the buffer is only created in input mode, the underlying
-<span class="lineNum">     120 </span>                :        *  character sequence is equal to the input sequence; otherwise, it
-<span class="lineNum">     121 </span>                :        *  is equal to the output sequence.&quot; [27.7.1.2]/1
-<span class="lineNum">     122 </span>                :       */
-<span class="lineNum">     123 </span>                :       __string_type
-<span class="lineNum">     124 </span><span class="lineNoCov">              0 :       str() const</span>
-<span class="lineNum">     125 </span>                :       {
-<span class="lineNum">     126 </span><span class="lineNoCov">              0 :         __string_type __ret;</span>
-<span class="lineNum">     127 </span><span class="lineNoCov">              0 :         if (this-&gt;pptr())</span>
-<span class="lineNum">     128 </span>                :           {
-<span class="lineNum">     129 </span>                :             // The current egptr() may not be the actual string end.
-<span class="lineNum">     130 </span><span class="lineNoCov">              0 :             if (this-&gt;pptr() &gt; this-&gt;egptr())</span>
-<span class="lineNum">     131 </span><span class="lineNoCov">              0 :               __ret = __string_type(this-&gt;pbase(), this-&gt;pptr());</span>
-<span class="lineNum">     132 </span>                :             else
-<span class="lineNum">     133 </span><span class="lineNoCov">              0 :               __ret = __string_type(this-&gt;pbase(), this-&gt;egptr());</span>
-<span class="lineNum">     134 </span>                :           }
-<span class="lineNum">     135 </span>                :         else
-<span class="lineNum">     136 </span><span class="lineNoCov">              0 :           __ret = _M_string;</span>
-<span class="lineNum">     137 </span><span class="lineNoCov">              0 :         return __ret;</span>
-<span class="lineNum">     138 </span>                :       }
-<span class="lineNum">     139 </span>                : 
-<span class="lineNum">     140 </span>                :       /**
-<span class="lineNum">     141 </span>                :        *  @brief  Setting a new buffer.
-<span class="lineNum">     142 </span>                :        *  @param  s  The string to use as a new sequence.
-<span class="lineNum">     143 </span>                :        *
-<span class="lineNum">     144 </span>                :        *  Deallocates any previous stored sequence, then copies @a s to
-<span class="lineNum">     145 </span>                :        *  use as a new one.
-<span class="lineNum">     146 </span>                :       */
-<span class="lineNum">     147 </span>                :       void
-<span class="lineNum">     148 </span>                :       str(const __string_type&amp; __s)
-<span class="lineNum">     149 </span>                :       {
-<span class="lineNum">     150 </span>                :         // Cannot use _M_string = __s, since v3 strings are COW.
-<span class="lineNum">     151 </span>                :         _M_string.assign(__s.data(), __s.size());
-<span class="lineNum">     152 </span>                :         _M_stringbuf_init(_M_mode);
-<span class="lineNum">     153 </span>                :       }
-<span class="lineNum">     154 </span>                : 
-<span class="lineNum">     155 </span>                :     protected:
-<span class="lineNum">     156 </span>                :       // Common initialization code goes here.
-<span class="lineNum">     157 </span>                :       void
-<span class="lineNum">     158 </span><span class="lineNoCov">              0 :       _M_stringbuf_init(ios_base::openmode __mode)</span>
-<span class="lineNum">     159 </span>                :       {
-<span class="lineNum">     160 </span><span class="lineNoCov">              0 :         _M_mode = __mode;</span>
-<span class="lineNum">     161 </span><span class="lineNoCov">              0 :         __size_type __len = 0;</span>
-<span class="lineNum">     162 </span><span class="lineNoCov">              0 :         if (_M_mode &amp; (ios_base::ate | ios_base::app))</span>
-<span class="lineNum">     163 </span><span class="lineNoCov">              0 :           __len = _M_string.size();</span>
-<span class="lineNum">     164 </span><span class="lineNoCov">              0 :         _M_sync(const_cast&lt;char_type*&gt;(_M_string.data()), 0, __len);</span>
-<span class="lineNum">     165 </span><span class="lineNoCov">              0 :       }</span>
-<span class="lineNum">     166 </span>                : 
-<span class="lineNum">     167 </span>                :       virtual streamsize
-<span class="lineNum">     168 </span>                :       showmanyc()
-<span class="lineNum">     169 </span>                :       { 
-<span class="lineNum">     170 </span>                :         streamsize __ret = -1;
-<span class="lineNum">     171 </span>                :         if (_M_mode &amp; ios_base::in)
-<span class="lineNum">     172 </span>                :           {
-<span class="lineNum">     173 </span>                :             _M_update_egptr();
-<span class="lineNum">     174 </span>                :             __ret = this-&gt;egptr() - this-&gt;gptr();
-<span class="lineNum">     175 </span>                :           }
-<span class="lineNum">     176 </span>                :         return __ret;
-<span class="lineNum">     177 </span>                :       }
-<span class="lineNum">     178 </span>                : 
-<span class="lineNum">     179 </span>                :       virtual int_type
-<span class="lineNum">     180 </span>                :       underflow();
-<span class="lineNum">     181 </span>                : 
-<span class="lineNum">     182 </span>                :       virtual int_type
-<span class="lineNum">     183 </span>                :       pbackfail(int_type __c = traits_type::eof());
-<span class="lineNum">     184 </span>                : 
-<span class="lineNum">     185 </span>                :       virtual int_type
-<span class="lineNum">     186 </span>                :       overflow(int_type __c = traits_type::eof());
-<span class="lineNum">     187 </span>                : 
-<span class="lineNum">     188 </span>                :       /**
-<span class="lineNum">     189 </span>                :        *  @brief  Manipulates the buffer.
-<span class="lineNum">     190 </span>                :        *  @param  s  Pointer to a buffer area.
-<span class="lineNum">     191 </span>                :        *  @param  n  Size of @a s.
-<span class="lineNum">     192 </span>                :        *  @return  @c this
-<span class="lineNum">     193 </span>                :        *
-<span class="lineNum">     194 </span>                :        *  If no buffer has already been created, and both @a s and @a n are
-<span class="lineNum">     195 </span>                :        *  non-zero, then @c s is used as a buffer; see
-<span class="lineNum">     196 </span>                :        *  http://gcc.gnu.org/onlinedocs/libstdc++/27_io/howto.html#2
-<span class="lineNum">     197 </span>                :        *  for more.
-<span class="lineNum">     198 </span>                :       */
-<span class="lineNum">     199 </span>                :       virtual __streambuf_type*
-<span class="lineNum">     200 </span>                :       setbuf(char_type* __s, streamsize __n)
-<span class="lineNum">     201 </span>                :       {
-<span class="lineNum">     202 </span>                :         if (__s &amp;&amp; __n &gt;= 0)
-<span class="lineNum">     203 </span>                :           {
-<span class="lineNum">     204 </span>                :             // This is implementation-defined behavior, and assumes
-<span class="lineNum">     205 </span>                :             // that an external char_type array of length __n exists
-<span class="lineNum">     206 </span>                :             // and has been pre-allocated. If this is not the case,
-<span class="lineNum">     207 </span>                :             // things will quickly blow up.
-<span class="lineNum">     208 </span>                :             
-<span class="lineNum">     209 </span>                :             // Step 1: Destroy the current internal array.
-<span class="lineNum">     210 </span>                :             _M_string.clear();
-<span class="lineNum">     211 </span>                :             
-<span class="lineNum">     212 </span>                :             // Step 2: Use the external array.
-<span class="lineNum">     213 </span>                :             _M_sync(__s, __n, 0);
-<span class="lineNum">     214 </span>                :           }
-<span class="lineNum">     215 </span>                :         return this;
-<span class="lineNum">     216 </span>                :       }
-<span class="lineNum">     217 </span>                : 
-<span class="lineNum">     218 </span>                :       virtual pos_type
-<span class="lineNum">     219 </span>                :       seekoff(off_type __off, ios_base::seekdir __way,
-<span class="lineNum">     220 </span>                :               ios_base::openmode __mode = ios_base::in | ios_base::out);
-<span class="lineNum">     221 </span>                : 
-<span class="lineNum">     222 </span>                :       virtual pos_type
-<span class="lineNum">     223 </span>                :       seekpos(pos_type __sp,
-<span class="lineNum">     224 </span>                :               ios_base::openmode __mode = ios_base::in | ios_base::out);
-<span class="lineNum">     225 </span>                : 
-<span class="lineNum">     226 </span>                :       // Internal function for correctly updating the internal buffer
-<span class="lineNum">     227 </span>                :       // for a particular _M_string, due to initialization or re-sizing
-<span class="lineNum">     228 </span>                :       // of an existing _M_string.
-<span class="lineNum">     229 </span>                :       void
-<span class="lineNum">     230 </span>                :       _M_sync(char_type* __base, __size_type __i, __size_type __o);
-<span class="lineNum">     231 </span>                : 
-<span class="lineNum">     232 </span>                :       // Internal function for correctly updating egptr() to the actual
-<span class="lineNum">     233 </span>                :       // string end.
-<span class="lineNum">     234 </span>                :       void
-<span class="lineNum">     235 </span>                :       _M_update_egptr()
-<span class="lineNum">     236 </span>                :       {
-<span class="lineNum">     237 </span>                :         const bool __testin = _M_mode &amp; ios_base::in;
-<span class="lineNum">     238 </span>                :         if (this-&gt;pptr() &amp;&amp; this-&gt;pptr() &gt; this-&gt;egptr())
-<span class="lineNum">     239 </span>                :           if (__testin)
-<span class="lineNum">     240 </span>                :             this-&gt;setg(this-&gt;eback(), this-&gt;gptr(), this-&gt;pptr());
-<span class="lineNum">     241 </span>                :           else
-<span class="lineNum">     242 </span>                :             this-&gt;setg(this-&gt;pptr(), this-&gt;pptr(), this-&gt;pptr());
-<span class="lineNum">     243 </span>                :       }
-<span class="lineNum">     244 </span>                :     };
-<span class="lineNum">     245 </span>                : 
-<span class="lineNum">     246 </span>                : 
-<span class="lineNum">     247 </span>                :   // [27.7.2] Template class basic_istringstream
-<span class="lineNum">     248 </span>                :   /**
-<span class="lineNum">     249 </span>                :    *  @brief  Controlling input for std::string.
-<span class="lineNum">     250 </span>                :    *
-<span class="lineNum">     251 </span>                :    *  This class supports reading from objects of type std::basic_string,
-<span class="lineNum">     252 </span>                :    *  using the inherited functions from std::basic_istream.  To control
-<span class="lineNum">     253 </span>                :    *  the associated sequence, an instance of std::basic_stringbuf is used,
-<span class="lineNum">     254 </span>                :    *  which this page refers to as @c sb.
-<span class="lineNum">     255 </span>                :   */
-<span class="lineNum">     256 </span>                :   template&lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     257 </span>                :     class basic_istringstream : public basic_istream&lt;_CharT, _Traits&gt;
-<span class="lineNum">     258 </span>                :     {
-<span class="lineNum">     259 </span>                :     public:
-<span class="lineNum">     260 </span>                :       // Types:
-<span class="lineNum">     261 </span>                :       typedef _CharT                                    char_type;
-<span class="lineNum">     262 </span>                :       typedef _Traits                                   traits_type;
-<span class="lineNum">     263 </span>                :       // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     264 </span>                :       // 251. basic_stringbuf missing allocator_type
-<span class="lineNum">     265 </span>                :       typedef _Alloc                                    allocator_type;
-<span class="lineNum">     266 </span>                :       typedef typename traits_type::int_type            int_type;
-<span class="lineNum">     267 </span>                :       typedef typename traits_type::pos_type            pos_type;
-<span class="lineNum">     268 </span>                :       typedef typename traits_type::off_type            off_type;
-<span class="lineNum">     269 </span>                : 
-<span class="lineNum">     270 </span>                :       // Non-standard types:
-<span class="lineNum">     271 </span>                :       typedef basic_string&lt;_CharT, _Traits, _Alloc&gt;       __string_type;
-<span class="lineNum">     272 </span>                :       typedef basic_stringbuf&lt;_CharT, _Traits, _Alloc&gt;    __stringbuf_type;
-<span class="lineNum">     273 </span>                :       typedef basic_istream&lt;char_type, traits_type&gt;       __istream_type;
-<span class="lineNum">     274 </span>                : 
-<span class="lineNum">     275 </span>                :     private:
-<span class="lineNum">     276 </span>                :       __stringbuf_type  _M_stringbuf;
-<span class="lineNum">     277 </span>                : 
-<span class="lineNum">     278 </span>                :     public:
-<span class="lineNum">     279 </span>                :       // Constructors:
-<span class="lineNum">     280 </span>                :       /**
-<span class="lineNum">     281 </span>                :        *  @brief  Default constructor starts with an empty string buffer.
-<span class="lineNum">     282 </span>                :        *  @param  mode  Whether the buffer can read, or write, or both.
-<span class="lineNum">     283 </span>                :        *
-<span class="lineNum">     284 </span>                :        *  @c ios_base::in is automatically included in @a mode.
-<span class="lineNum">     285 </span>                :        *
-<span class="lineNum">     286 </span>                :        *  Initializes @c sb using @c mode|in, and passes @c &amp;sb to the base
-<span class="lineNum">     287 </span>                :        *  class initializer.  Does not allocate any buffer.
-<span class="lineNum">     288 </span>                :        *
-<span class="lineNum">     289 </span>                :        *  That's a lie.  We initialize the base class with NULL, because the
-<span class="lineNum">     290 </span>                :        *  string class does its own memory management.
-<span class="lineNum">     291 </span>                :       */
-<span class="lineNum">     292 </span>                :       explicit
-<span class="lineNum">     293 </span>                :       basic_istringstream(ios_base::openmode __mode = ios_base::in)
-<span class="lineNum">     294 </span>                :       : __istream_type(), _M_stringbuf(__mode | ios_base::in)
-<span class="lineNum">     295 </span>                :       { this-&gt;init(&amp;_M_stringbuf); }
-<span class="lineNum">     296 </span>                : 
-<span class="lineNum">     297 </span>                :       /**
-<span class="lineNum">     298 </span>                :        *  @brief  Starts with an existing string buffer.
-<span class="lineNum">     299 </span>                :        *  @param  str  A string to copy as a starting buffer.
-<span class="lineNum">     300 </span>                :        *  @param  mode  Whether the buffer can read, or write, or both.
-<span class="lineNum">     301 </span>                :        *
-<span class="lineNum">     302 </span>                :        *  @c ios_base::in is automatically included in @a mode.
-<span class="lineNum">     303 </span>                :        *
-<span class="lineNum">     304 </span>                :        *  Initializes @c sb using @a str and @c mode|in, and passes @c &amp;sb
-<span class="lineNum">     305 </span>                :        *  to the base class initializer.
-<span class="lineNum">     306 </span>                :        *
-<span class="lineNum">     307 </span>                :        *  That's a lie.  We initialize the base class with NULL, because the
-<span class="lineNum">     308 </span>                :        *  string class does its own memory management.
-<span class="lineNum">     309 </span>                :       */
-<span class="lineNum">     310 </span>                :       explicit
-<span class="lineNum">     311 </span>                :       basic_istringstream(const __string_type&amp; __str,
-<span class="lineNum">     312 </span><span class="lineNoCov">              0 :                           ios_base::openmode __mode = ios_base::in)</span>
-<span class="lineNum">     313 </span><span class="lineNoCov">              0 :       : __istream_type(), _M_stringbuf(__str, __mode | ios_base::in)</span>
-<span class="lineNum">     314 </span><span class="lineNoCov">              0 :       { this-&gt;init(&amp;_M_stringbuf); }</span>
-<span class="lineNum">     315 </span>                : 
-<span class="lineNum">     316 </span>                :       /**
-<span class="lineNum">     317 </span>                :        *  @brief  The destructor does nothing.
-<span class="lineNum">     318 </span>                :        *
-<span class="lineNum">     319 </span>                :        *  The buffer is deallocated by the stringbuf object, not the
-<span class="lineNum">     320 </span>                :        *  formatting stream.
-<span class="lineNum">     321 </span>                :       */
-<span class="lineNum">     322 </span><span class="lineNoCov">              0 :       ~basic_istringstream()</span>
-<span class="lineNum">     323 </span><span class="lineNoCov">              0 :       { }</span>
-<span class="lineNum">     324 </span>                : 
-<span class="lineNum">     325 </span>                :       // Members:
-<span class="lineNum">     326 </span>                :       /**
-<span class="lineNum">     327 </span>                :        *  @brief  Accessing the underlying buffer.
-<span class="lineNum">     328 </span>                :        *  @return  The current basic_stringbuf buffer.
-<span class="lineNum">     329 </span>                :        *
-<span class="lineNum">     330 </span>                :        *  This hides both signatures of std::basic_ios::rdbuf().
-<span class="lineNum">     331 </span>                :       */
-<span class="lineNum">     332 </span>                :       __stringbuf_type*
-<span class="lineNum">     333 </span>                :       rdbuf() const
-<span class="lineNum">     334 </span>                :       { return const_cast&lt;__stringbuf_type*&gt;(&amp;_M_stringbuf); }
-<span class="lineNum">     335 </span>                : 
-<span class="lineNum">     336 </span>                :       /**
-<span class="lineNum">     337 </span>                :        *  @brief  Copying out the string buffer.
-<span class="lineNum">     338 </span>                :        *  @return  @c rdbuf()-&gt;str()
-<span class="lineNum">     339 </span>                :       */
-<span class="lineNum">     340 </span>                :       __string_type
-<span class="lineNum">     341 </span>                :       str() const
-<span class="lineNum">     342 </span>                :       { return _M_stringbuf.str(); }
-<span class="lineNum">     343 </span>                : 
-<span class="lineNum">     344 </span>                :       /**
-<span class="lineNum">     345 </span>                :        *  @brief  Setting a new buffer.
-<span class="lineNum">     346 </span>                :        *  @param  s  The string to use as a new sequence.
-<span class="lineNum">     347 </span>                :        *
-<span class="lineNum">     348 </span>                :        *  Calls @c rdbuf()-&gt;str(s).
-<span class="lineNum">     349 </span>                :       */
-<span class="lineNum">     350 </span>                :       void
-<span class="lineNum">     351 </span>                :       str(const __string_type&amp; __s)
-<span class="lineNum">     352 </span>                :       { _M_stringbuf.str(__s); }
-<span class="lineNum">     353 </span>                :     };
-<span class="lineNum">     354 </span>                : 
-<span class="lineNum">     355 </span>                : 
-<span class="lineNum">     356 </span>                :   // [27.7.3] Template class basic_ostringstream
-<span class="lineNum">     357 </span>                :   /**
-<span class="lineNum">     358 </span>                :    *  @brief  Controlling output for std::string.
-<span class="lineNum">     359 </span>                :    *
-<span class="lineNum">     360 </span>                :    *  This class supports writing to objects of type std::basic_string,
-<span class="lineNum">     361 </span>                :    *  using the inherited functions from std::basic_ostream.  To control
-<span class="lineNum">     362 </span>                :    *  the associated sequence, an instance of std::basic_stringbuf is used,
-<span class="lineNum">     363 </span>                :    *  which this page refers to as @c sb.
-<span class="lineNum">     364 </span>                :   */
-<span class="lineNum">     365 </span>                :   template &lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     366 </span>                :     class basic_ostringstream : public basic_ostream&lt;_CharT, _Traits&gt;
-<span class="lineNum">     367 </span>                :     {
-<span class="lineNum">     368 </span>                :     public:
-<span class="lineNum">     369 </span>                :       // Types:
-<span class="lineNum">     370 </span>                :       typedef _CharT                                    char_type;
-<span class="lineNum">     371 </span>                :       typedef _Traits                                   traits_type;
-<span class="lineNum">     372 </span>                :       // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     373 </span>                :       // 251. basic_stringbuf missing allocator_type
-<span class="lineNum">     374 </span>                :       typedef _Alloc                                    allocator_type;
-<span class="lineNum">     375 </span>                :       typedef typename traits_type::int_type            int_type;
-<span class="lineNum">     376 </span>                :       typedef typename traits_type::pos_type            pos_type;
-<span class="lineNum">     377 </span>                :       typedef typename traits_type::off_type            off_type;
-<span class="lineNum">     378 </span>                : 
-<span class="lineNum">     379 </span>                :       // Non-standard types:
-<span class="lineNum">     380 </span>                :       typedef basic_string&lt;_CharT, _Traits, _Alloc&gt;       __string_type;
-<span class="lineNum">     381 </span>                :       typedef basic_stringbuf&lt;_CharT, _Traits, _Alloc&gt;    __stringbuf_type;
-<span class="lineNum">     382 </span>                :       typedef basic_ostream&lt;char_type, traits_type&gt;       __ostream_type;
-<span class="lineNum">     383 </span>                : 
-<span class="lineNum">     384 </span>                :     private:
-<span class="lineNum">     385 </span>                :       __stringbuf_type  _M_stringbuf;
-<span class="lineNum">     386 </span>                : 
-<span class="lineNum">     387 </span>                :     public:
-<span class="lineNum">     388 </span>                :       // Constructors/destructor:
-<span class="lineNum">     389 </span>                :       /**
-<span class="lineNum">     390 </span>                :        *  @brief  Default constructor starts with an empty string buffer.
-<span class="lineNum">     391 </span>                :        *  @param  mode  Whether the buffer can read, or write, or both.
-<span class="lineNum">     392 </span>                :        *
-<span class="lineNum">     393 </span>                :        *  @c ios_base::out is automatically included in @a mode.
-<span class="lineNum">     394 </span>                :        *
-<span class="lineNum">     395 </span>                :        *  Initializes @c sb using @c mode|out, and passes @c &amp;sb to the base
-<span class="lineNum">     396 </span>                :        *  class initializer.  Does not allocate any buffer.
-<span class="lineNum">     397 </span>                :        *
-<span class="lineNum">     398 </span>                :        *  That's a lie.  We initialize the base class with NULL, because the
-<span class="lineNum">     399 </span>                :        *  string class does its own memory management.
-<span class="lineNum">     400 </span>                :       */
-<span class="lineNum">     401 </span>                :       explicit
-<span class="lineNum">     402 </span><span class="lineNoCov">              0 :       basic_ostringstream(ios_base::openmode __mode = ios_base::out)</span>
-<span class="lineNum">     403 </span><span class="lineNoCov">              0 :       : __ostream_type(), _M_stringbuf(__mode | ios_base::out)</span>
-<span class="lineNum">     404 </span><span class="lineNoCov">              0 :       { this-&gt;init(&amp;_M_stringbuf); }</span>
-<span class="lineNum">     405 </span>                : 
-<span class="lineNum">     406 </span>                :       /**
-<span class="lineNum">     407 </span>                :        *  @brief  Starts with an existing string buffer.
-<span class="lineNum">     408 </span>                :        *  @param  str  A string to copy as a starting buffer.
-<span class="lineNum">     409 </span>                :        *  @param  mode  Whether the buffer can read, or write, or both.
-<span class="lineNum">     410 </span>                :        *
-<span class="lineNum">     411 </span>                :        *  @c ios_base::out is automatically included in @a mode.
-<span class="lineNum">     412 </span>                :        *
-<span class="lineNum">     413 </span>                :        *  Initializes @c sb using @a str and @c mode|out, and passes @c &amp;sb
-<span class="lineNum">     414 </span>                :        *  to the base class initializer.
-<span class="lineNum">     415 </span>                :        *
-<span class="lineNum">     416 </span>                :        *  That's a lie.  We initialize the base class with NULL, because the
-<span class="lineNum">     417 </span>                :        *  string class does its own memory management.
-<span class="lineNum">     418 </span>                :       */
-<span class="lineNum">     419 </span>                :       explicit
-<span class="lineNum">     420 </span>                :       basic_ostringstream(const __string_type&amp; __str,
-<span class="lineNum">     421 </span>                :                           ios_base::openmode __mode = ios_base::out)
-<span class="lineNum">     422 </span>                :       : __ostream_type(), _M_stringbuf(__str, __mode | ios_base::out)
-<span class="lineNum">     423 </span>                :       { this-&gt;init(&amp;_M_stringbuf); }
-<span class="lineNum">     424 </span>                : 
-<span class="lineNum">     425 </span>                :       /**
-<span class="lineNum">     426 </span>                :        *  @brief  The destructor does nothing.
-<span class="lineNum">     427 </span>                :        *
-<span class="lineNum">     428 </span>                :        *  The buffer is deallocated by the stringbuf object, not the
-<span class="lineNum">     429 </span>                :        *  formatting stream.
-<span class="lineNum">     430 </span>                :       */
-<span class="lineNum">     431 </span><span class="lineNoCov">              0 :       ~basic_ostringstream()</span>
-<span class="lineNum">     432 </span><span class="lineNoCov">              0 :       { }</span>
-<span class="lineNum">     433 </span>                : 
-<span class="lineNum">     434 </span>                :       // Members:
-<span class="lineNum">     435 </span>                :       /**
-<span class="lineNum">     436 </span>                :        *  @brief  Accessing the underlying buffer.
-<span class="lineNum">     437 </span>                :        *  @return  The current basic_stringbuf buffer.
-<span class="lineNum">     438 </span>                :        *
-<span class="lineNum">     439 </span>                :        *  This hides both signatures of std::basic_ios::rdbuf().
-<span class="lineNum">     440 </span>                :       */
-<span class="lineNum">     441 </span>                :       __stringbuf_type*
-<span class="lineNum">     442 </span>                :       rdbuf() const
-<span class="lineNum">     443 </span>                :       { return const_cast&lt;__stringbuf_type*&gt;(&amp;_M_stringbuf); }
-<span class="lineNum">     444 </span>                : 
-<span class="lineNum">     445 </span>                :       /**
-<span class="lineNum">     446 </span>                :        *  @brief  Copying out the string buffer.
-<span class="lineNum">     447 </span>                :        *  @return  @c rdbuf()-&gt;str()
-<span class="lineNum">     448 </span>                :       */
-<span class="lineNum">     449 </span>                :       __string_type
-<span class="lineNum">     450 </span><span class="lineNoCov">              0 :       str() const</span>
-<span class="lineNum">     451 </span><span class="lineNoCov">              0 :       { return _M_stringbuf.str(); }</span>
-<span class="lineNum">     452 </span>                : 
-<span class="lineNum">     453 </span>                :       /**
-<span class="lineNum">     454 </span>                :        *  @brief  Setting a new buffer.
-<span class="lineNum">     455 </span>                :        *  @param  s  The string to use as a new sequence.
-<span class="lineNum">     456 </span>                :        *
-<span class="lineNum">     457 </span>                :        *  Calls @c rdbuf()-&gt;str(s).
-<span class="lineNum">     458 </span>                :       */
-<span class="lineNum">     459 </span>                :       void
-<span class="lineNum">     460 </span>                :       str(const __string_type&amp; __s)
-<span class="lineNum">     461 </span>                :       { _M_stringbuf.str(__s); }
-<span class="lineNum">     462 </span>                :     };
-<span class="lineNum">     463 </span>                : 
-<span class="lineNum">     464 </span>                : 
-<span class="lineNum">     465 </span>                :   // [27.7.4] Template class basic_stringstream
-<span class="lineNum">     466 </span>                :   /**
-<span class="lineNum">     467 </span>                :    *  @brief  Controlling input and output for std::string.
-<span class="lineNum">     468 </span>                :    *
-<span class="lineNum">     469 </span>                :    *  This class supports reading from and writing to objects of type
-<span class="lineNum">     470 </span>                :    *  std::basic_string, using the inherited functions from
-<span class="lineNum">     471 </span>                :    *  std::basic_iostream.  To control the associated sequence, an instance
-<span class="lineNum">     472 </span>                :    *  of std::basic_stringbuf is used, which this page refers to as @c sb.
-<span class="lineNum">     473 </span>                :   */
-<span class="lineNum">     474 </span>                :   template &lt;typename _CharT, typename _Traits, typename _Alloc&gt;
-<span class="lineNum">     475 </span>                :     class basic_stringstream : public basic_iostream&lt;_CharT, _Traits&gt;
-<span class="lineNum">     476 </span>                :     {
-<span class="lineNum">     477 </span>                :     public:
-<span class="lineNum">     478 </span>                :       // Types:
-<span class="lineNum">     479 </span>                :       typedef _CharT                                    char_type;
-<span class="lineNum">     480 </span>                :       typedef _Traits                                   traits_type;
-<span class="lineNum">     481 </span>                :       // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     482 </span>                :       // 251. basic_stringbuf missing allocator_type
-<span class="lineNum">     483 </span>                :       typedef _Alloc                                    allocator_type;
-<span class="lineNum">     484 </span>                :       typedef typename traits_type::int_type            int_type;
-<span class="lineNum">     485 </span>                :       typedef typename traits_type::pos_type            pos_type;
-<span class="lineNum">     486 </span>                :       typedef typename traits_type::off_type            off_type;
-<span class="lineNum">     487 </span>                : 
-<span class="lineNum">     488 </span>                :       // Non-standard Types:
-<span class="lineNum">     489 </span>                :       typedef basic_string&lt;_CharT, _Traits, _Alloc&gt;       __string_type;
-<span class="lineNum">     490 </span>                :       typedef basic_stringbuf&lt;_CharT, _Traits, _Alloc&gt;    __stringbuf_type;
-<span class="lineNum">     491 </span>                :       typedef basic_iostream&lt;char_type, traits_type&gt;      __iostream_type;
-<span class="lineNum">     492 </span>                : 
-<span class="lineNum">     493 </span>                :     private:
-<span class="lineNum">     494 </span>                :       __stringbuf_type  _M_stringbuf;
-<span class="lineNum">     495 </span>                : 
-<span class="lineNum">     496 </span>                :     public:
-<span class="lineNum">     497 </span>                :       // Constructors/destructors
-<span class="lineNum">     498 </span>                :       /**
-<span class="lineNum">     499 </span>                :        *  @brief  Default constructor starts with an empty string buffer.
-<span class="lineNum">     500 </span>                :        *  @param  mode  Whether the buffer can read, or write, or both.
-<span class="lineNum">     501 </span>                :        *
-<span class="lineNum">     502 </span>                :        *  Initializes @c sb using @c mode, and passes @c &amp;sb to the base
-<span class="lineNum">     503 </span>                :        *  class initializer.  Does not allocate any buffer.
-<span class="lineNum">     504 </span>                :        *
-<span class="lineNum">     505 </span>                :        *  That's a lie.  We initialize the base class with NULL, because the
-<span class="lineNum">     506 </span>                :        *  string class does its own memory management.
-<span class="lineNum">     507 </span>                :       */
-<span class="lineNum">     508 </span>                :       explicit
-<span class="lineNum">     509 </span><span class="lineNoCov">              0 :       basic_stringstream(ios_base::openmode __m = ios_base::out | ios_base::in)</span>
-<span class="lineNum">     510 </span><span class="lineNoCov">              0 :       : __iostream_type(), _M_stringbuf(__m)</span>
-<span class="lineNum">     511 </span><span class="lineNoCov">              0 :       { this-&gt;init(&amp;_M_stringbuf); }</span>
-<span class="lineNum">     512 </span>                : 
-<span class="lineNum">     513 </span>                :       /**
-<span class="lineNum">     514 </span>                :        *  @brief  Starts with an existing string buffer.
-<span class="lineNum">     515 </span>                :        *  @param  str  A string to copy as a starting buffer.
-<span class="lineNum">     516 </span>                :        *  @param  mode  Whether the buffer can read, or write, or both.
-<span class="lineNum">     517 </span>                :        *
-<span class="lineNum">     518 </span>                :        *  Initializes @c sb using @a str and @c mode, and passes @c &amp;sb
-<span class="lineNum">     519 </span>                :        *  to the base class initializer.
-<span class="lineNum">     520 </span>                :        *
-<span class="lineNum">     521 </span>                :        *  That's a lie.  We initialize the base class with NULL, because the
-<span class="lineNum">     522 </span>                :        *  string class does its own memory management.
-<span class="lineNum">     523 </span>                :       */
-<span class="lineNum">     524 </span>                :       explicit
-<span class="lineNum">     525 </span>                :       basic_stringstream(const __string_type&amp; __str,
-<span class="lineNum">     526 </span><span class="lineNoCov">              0 :                          ios_base::openmode __m = ios_base::out | ios_base::in)</span>
-<span class="lineNum">     527 </span><span class="lineNoCov">              0 :       : __iostream_type(), _M_stringbuf(__str, __m)</span>
-<span class="lineNum">     528 </span><span class="lineNoCov">              0 :       { this-&gt;init(&amp;_M_stringbuf); }</span>
-<span class="lineNum">     529 </span>                : 
-<span class="lineNum">     530 </span>                :       /**
-<span class="lineNum">     531 </span>                :        *  @brief  The destructor does nothing.
-<span class="lineNum">     532 </span>                :        *
-<span class="lineNum">     533 </span>                :        *  The buffer is deallocated by the stringbuf object, not the
-<span class="lineNum">     534 </span>                :        *  formatting stream.
-<span class="lineNum">     535 </span>                :       */
-<span class="lineNum">     536 </span><span class="lineNoCov">              0 :       ~basic_stringstream()</span>
-<span class="lineNum">     537 </span><span class="lineNoCov">              0 :       { }</span>
-<span class="lineNum">     538 </span>                : 
-<span class="lineNum">     539 </span>                :       // Members:
-<span class="lineNum">     540 </span>                :       /**
-<span class="lineNum">     541 </span>                :        *  @brief  Accessing the underlying buffer.
-<span class="lineNum">     542 </span>                :        *  @return  The current basic_stringbuf buffer.
-<span class="lineNum">     543 </span>                :        *
-<span class="lineNum">     544 </span>                :        *  This hides both signatures of std::basic_ios::rdbuf().
-<span class="lineNum">     545 </span>                :       */
-<span class="lineNum">     546 </span>                :       __stringbuf_type*
-<span class="lineNum">     547 </span>                :       rdbuf() const
-<span class="lineNum">     548 </span>                :       { return const_cast&lt;__stringbuf_type*&gt;(&amp;_M_stringbuf); }
-<span class="lineNum">     549 </span>                : 
-<span class="lineNum">     550 </span>                :       /**
-<span class="lineNum">     551 </span>                :        *  @brief  Copying out the string buffer.
-<span class="lineNum">     552 </span>                :        *  @return  @c rdbuf()-&gt;str()
-<span class="lineNum">     553 </span>                :       */
-<span class="lineNum">     554 </span>                :       __string_type
-<span class="lineNum">     555 </span><span class="lineNoCov">              0 :       str() const</span>
-<span class="lineNum">     556 </span><span class="lineNoCov">              0 :       { return _M_stringbuf.str(); }</span>
-<span class="lineNum">     557 </span>                : 
-<span class="lineNum">     558 </span>                :       /**
-<span class="lineNum">     559 </span>                :        *  @brief  Setting a new buffer.
-<span class="lineNum">     560 </span>                :        *  @param  s  The string to use as a new sequence.
-<span class="lineNum">     561 </span>                :        *
-<span class="lineNum">     562 </span>                :        *  Calls @c rdbuf()-&gt;str(s).
-<span class="lineNum">     563 </span>                :       */
-<span class="lineNum">     564 </span>                :       void
-<span class="lineNum">     565 </span>                :       str(const __string_type&amp; __s)
-<span class="lineNum">     566 </span>                :       { _M_stringbuf.str(__s); }
-<span class="lineNum">     567 </span>                :     };
-<span class="lineNum">     568 </span>                : 
-<span class="lineNum">     569 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">     570 </span>                : 
-<span class="lineNum">     571 </span>                : #ifndef _GLIBCXX_EXPORT_TEMPLATE
-<span class="lineNum">     572 </span>                : # include &lt;bits/sstream.tcc&gt;
-<span class="lineNum">     573 </span>                : #endif
-<span class="lineNum">     574 </span>                : 
-<span class="lineNum">     575 </span>                : #endif /* _GLIBCXX_SSTREAM */
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/stdexcept.gcov.html b/rep/usr/include/c++/4.3/stdexcept.gcov.html
deleted file mode 100644
index b64ecdf..0000000
--- a/rep/usr/include/c++/4.3/stdexcept.gcov.html
+++ /dev/null
@@ -1,215 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/stdexcept</title>
-  <link rel="stylesheet" type="text/css" href="../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3</a> - stdexcept</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">1</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">1</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // Standard exception classes  -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 2001, 2002, 2005, 2007 Free Software Foundation, Inc.
-<span class="lineNum">       4 </span>                : //
-<span class="lineNum">       5 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       6 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       7 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">       8 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">       9 </span>                : // any later version.
-<span class="lineNum">      10 </span>                : 
-<span class="lineNum">      11 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      12 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      13 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      14 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      15 </span>                : 
-<span class="lineNum">      16 </span>                : // You should have received a copy of the GNU General Public License
-<span class="lineNum">      17 </span>                : // along with this library; see the file COPYING.  If not, write to
-<span class="lineNum">      18 </span>                : // the Free Software Foundation, 51 Franklin Street, Fifth Floor,
-<span class="lineNum">      19 </span>                : // Boston, MA 02110-1301, USA.
-<span class="lineNum">      20 </span>                : 
-<span class="lineNum">      21 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      22 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      23 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      24 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      25 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      26 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      27 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      28 </span>                : // the GNU General Public License.
-<span class="lineNum">      29 </span>                : 
-<span class="lineNum">      30 </span>                : /** @file stdexcept
-<span class="lineNum">      31 </span>                :  *  This is a Standard C++ Library header.
-<span class="lineNum">      32 </span>                :  */
-<span class="lineNum">      33 </span>                : 
-<span class="lineNum">      34 </span>                : //
-<span class="lineNum">      35 </span>                : // ISO C++ 19.1  Exception classes
-<span class="lineNum">      36 </span>                : //
-<span class="lineNum">      37 </span>                : 
-<span class="lineNum">      38 </span>                : #ifndef _GLIBCXX_STDEXCEPT
-<span class="lineNum">      39 </span>                : #define _GLIBCXX_STDEXCEPT 1
-<span class="lineNum">      40 </span>                : 
-<span class="lineNum">      41 </span>                : #pragma GCC system_header
-<span class="lineNum">      42 </span>                : 
-<span class="lineNum">      43 </span>                : #include &lt;exception&gt;
-<span class="lineNum">      44 </span>                : #include &lt;string&gt;
-<span class="lineNum">      45 </span>                : 
-<span class="lineNum">      46 </span>                : _GLIBCXX_BEGIN_NAMESPACE(std)
-<span class="lineNum">      47 </span>                : 
-<span class="lineNum">      48 </span>                :   /** Logic errors represent problems in the internal logic of a program;
-<span class="lineNum">      49 </span>                :    *  in theory, these are preventable, and even detectable before the
-<span class="lineNum">      50 </span>                :    *  program runs (e.g., violations of class invariants).
-<span class="lineNum">      51 </span>                :    *  @brief One of two subclasses of exception.
-<span class="lineNum">      52 </span>                :    */
-<span class="lineNum">      53 </span>                :   class logic_error : public exception 
-<span class="lineNum">      54 </span>                :   {
-<span class="lineNum">      55 </span>                :     string _M_msg;
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span>                :   public:
-<span class="lineNum">      58 </span>                :     /** Takes a character string describing the error.  */
-<span class="lineNum">      59 </span>                :     explicit 
-<span class="lineNum">      60 </span>                :     logic_error(const string&amp; __arg);
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span>                :     virtual 
-<span class="lineNum">      63 </span>                :     ~logic_error() throw();
-<span class="lineNum">      64 </span>                : 
-<span class="lineNum">      65 </span>                :     /** Returns a C-style character string describing the general cause of
-<span class="lineNum">      66 </span>                :      *  the current error (the same string passed to the ctor).  */
-<span class="lineNum">      67 </span>                :     virtual const char* 
-<span class="lineNum">      68 </span>                :     what() const throw();
-<span class="lineNum">      69 </span>                :   };
-<span class="lineNum">      70 </span>                : 
-<span class="lineNum">      71 </span>                :   /** Thrown by the library, or by you, to report domain errors (domain in
-<span class="lineNum">      72 </span>                :    *  the mathematical sense).  */
-<span class="lineNum">      73 </span>                :   class domain_error : public logic_error 
-<span class="lineNum">      74 </span>                :   {
-<span class="lineNum">      75 </span>                :   public:
-<span class="lineNum">      76 </span>                :     explicit domain_error(const string&amp; __arg);
-<span class="lineNum">      77 </span>                :   };
-<span class="lineNum">      78 </span>                : 
-<span class="lineNum">      79 </span>                :   /** Thrown to report invalid arguments to functions.  */
-<span class="lineNum">      80 </span>                :   class invalid_argument : public logic_error 
-<span class="lineNum">      81 </span>                :   {
-<span class="lineNum">      82 </span>                :   public:
-<span class="lineNum">      83 </span>                :     explicit invalid_argument(const string&amp; __arg);
-<span class="lineNum">      84 </span>                :   };
-<span class="lineNum">      85 </span>                : 
-<span class="lineNum">      86 </span>                :   /** Thrown when an object is constructed that would exceed its maximum
-<span class="lineNum">      87 </span>                :    *  permitted size (e.g., a basic_string instance).  */
-<span class="lineNum">      88 </span>                :   class length_error : public logic_error 
-<span class="lineNum">      89 </span>                :   {
-<span class="lineNum">      90 </span>                :   public:
-<span class="lineNum">      91 </span>                :     explicit length_error(const string&amp; __arg);
-<span class="lineNum">      92 </span>                :   };
-<span class="lineNum">      93 </span>                : 
-<span class="lineNum">      94 </span>                :   /** This represents an argument whose value is not within the expected
-<span class="lineNum">      95 </span>                :    *  range (e.g., boundary checks in basic_string).  */
-<span class="lineNum">      96 </span>                :   class out_of_range : public logic_error 
-<span class="lineNum">      97 </span><span class="lineCov">              1 :   {</span>
-<span class="lineNum">      98 </span>                :   public:
-<span class="lineNum">      99 </span>                :     explicit out_of_range(const string&amp; __arg);
-<span class="lineNum">     100 </span>                :   };
-<span class="lineNum">     101 </span>                : 
-<span class="lineNum">     102 </span>                :   /** Runtime errors represent problems outside the scope of a program;
-<span class="lineNum">     103 </span>                :    *  they cannot be easily predicted and can generally only be caught as
-<span class="lineNum">     104 </span>                :    *  the program executes.
-<span class="lineNum">     105 </span>                :    *  @brief One of two subclasses of exception.
-<span class="lineNum">     106 </span>                :    */
-<span class="lineNum">     107 </span>                :   class runtime_error : public exception 
-<span class="lineNum">     108 </span>                :   {
-<span class="lineNum">     109 </span>                :     string _M_msg;
-<span class="lineNum">     110 </span>                : 
-<span class="lineNum">     111 </span>                :   public:
-<span class="lineNum">     112 </span>                :     /** Takes a character string describing the error.  */
-<span class="lineNum">     113 </span>                :     explicit 
-<span class="lineNum">     114 </span>                :     runtime_error(const string&amp; __arg);
-<span class="lineNum">     115 </span>                : 
-<span class="lineNum">     116 </span>                :     virtual 
-<span class="lineNum">     117 </span>                :     ~runtime_error() throw();
-<span class="lineNum">     118 </span>                : 
-<span class="lineNum">     119 </span>                :     /** Returns a C-style character string describing the general cause of
-<span class="lineNum">     120 </span>                :      *  the current error (the same string passed to the ctor).  */
-<span class="lineNum">     121 </span>                :     virtual const char* 
-<span class="lineNum">     122 </span>                :     what() const throw();
-<span class="lineNum">     123 </span>                :   };
-<span class="lineNum">     124 </span>                : 
-<span class="lineNum">     125 </span>                :   /** Thrown to indicate range errors in internal computations.  */
-<span class="lineNum">     126 </span>                :   class range_error : public runtime_error 
-<span class="lineNum">     127 </span>                :   {
-<span class="lineNum">     128 </span>                :   public:
-<span class="lineNum">     129 </span>                :     explicit range_error(const string&amp; __arg);
-<span class="lineNum">     130 </span>                :   };
-<span class="lineNum">     131 </span>                : 
-<span class="lineNum">     132 </span>                :   /** Thrown to indicate arithmetic overflow.  */
-<span class="lineNum">     133 </span>                :   class overflow_error : public runtime_error 
-<span class="lineNum">     134 </span>                :   {
-<span class="lineNum">     135 </span>                :   public:
-<span class="lineNum">     136 </span>                :     explicit overflow_error(const string&amp; __arg);
-<span class="lineNum">     137 </span>                :   };
-<span class="lineNum">     138 </span>                : 
-<span class="lineNum">     139 </span>                :   /** Thrown to indicate arithmetic underflow.  */
-<span class="lineNum">     140 </span>                :   class underflow_error : public runtime_error 
-<span class="lineNum">     141 </span>                :   {
-<span class="lineNum">     142 </span>                :   public:
-<span class="lineNum">     143 </span>                :     explicit underflow_error(const string&amp; __arg);
-<span class="lineNum">     144 </span>                :   };
-<span class="lineNum">     145 </span>                : 
-<span class="lineNum">     146 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">     147 </span>                : 
-<span class="lineNum">     148 </span>                : #endif /* _GLIBCXX_STDEXCEPT */
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/streambuf.gcov.html b/rep/usr/include/c++/4.3/streambuf.gcov.html
deleted file mode 100644
index f3d6dee..0000000
--- a/rep/usr/include/c++/4.3/streambuf.gcov.html
+++ /dev/null
@@ -1,871 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/streambuf</title>
-  <link rel="stylesheet" type="text/css" href="../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3</a> - streambuf</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">36</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">0.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">0</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // Stream buffer classes -*- C++ -*-
-<span class="lineNum">       2 </span>                : 
-<span class="lineNum">       3 </span>                : // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005,
-<span class="lineNum">       4 </span>                : // 2006, 2007, 2008 Free Software Foundation, Inc.
-<span class="lineNum">       5 </span>                : //
-<span class="lineNum">       6 </span>                : // This file is part of the GNU ISO C++ Library.  This library is free
-<span class="lineNum">       7 </span>                : // software; you can redistribute it and/or modify it under the
-<span class="lineNum">       8 </span>                : // terms of the GNU General Public License as published by the
-<span class="lineNum">       9 </span>                : // Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      10 </span>                : // any later version.
-<span class="lineNum">      11 </span>                : 
-<span class="lineNum">      12 </span>                : // This library is distributed in the hope that it will be useful,
-<span class="lineNum">      13 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      14 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      15 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      16 </span>                : 
-<span class="lineNum">      17 </span>                : // You should have received a copy of the GNU General Public License
-<span class="lineNum">      18 </span>                : // along with this library; see the file COPYING.  If not, write to
-<span class="lineNum">      19 </span>                : // the Free Software Foundation, 51 Franklin Street, Fifth Floor,
-<span class="lineNum">      20 </span>                : // Boston, MA 02110-1301, USA.
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      23 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      24 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      25 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      26 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      27 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      28 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      29 </span>                : // the GNU General Public License.
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : /** @file streambuf
-<span class="lineNum">      32 </span>                :  *  This is a Standard C++ Library header.
-<span class="lineNum">      33 </span>                :  */
-<span class="lineNum">      34 </span>                : 
-<span class="lineNum">      35 </span>                : //
-<span class="lineNum">      36 </span>                : // ISO C++ 14882: 27.5  Stream buffers
-<span class="lineNum">      37 </span>                : //
-<span class="lineNum">      38 </span>                : 
-<span class="lineNum">      39 </span>                : #ifndef _GLIBXX_STREAMBUF
-<span class="lineNum">      40 </span>                : #define _GLIBXX_STREAMBUF 1
-<span class="lineNum">      41 </span>                : 
-<span class="lineNum">      42 </span>                : #pragma GCC system_header
-<span class="lineNum">      43 </span>                : 
-<span class="lineNum">      44 </span>                : #include &lt;bits/c++config.h&gt;
-<span class="lineNum">      45 </span>                : #include &lt;iosfwd&gt;
-<span class="lineNum">      46 </span>                : #include &lt;bits/localefwd.h&gt;
-<span class="lineNum">      47 </span>                : #include &lt;bits/ios_base.h&gt;
-<span class="lineNum">      48 </span>                : #include &lt;bits/cpp_type_traits.h&gt;
-<span class="lineNum">      49 </span>                : #include &lt;ext/type_traits.h&gt;
-<span class="lineNum">      50 </span>                : 
-<span class="lineNum">      51 </span>                : _GLIBCXX_BEGIN_NAMESPACE(std)
-<span class="lineNum">      52 </span>                : 
-<span class="lineNum">      53 </span>                :   template&lt;typename _CharT, typename _Traits&gt;
-<span class="lineNum">      54 </span>                :     streamsize
-<span class="lineNum">      55 </span>                :     __copy_streambufs_eof(basic_streambuf&lt;_CharT, _Traits&gt;*,
-<span class="lineNum">      56 </span>                :                           basic_streambuf&lt;_CharT, _Traits&gt;*, bool&amp;);
-<span class="lineNum">      57 </span>                : 
-<span class="lineNum">      58 </span>                :   /**
-<span class="lineNum">      59 </span>                :    *  @brief  The actual work of input and output (interface).
-<span class="lineNum">      60 </span>                :    *
-<span class="lineNum">      61 </span>                :    *  This is a base class.  Derived stream buffers each control a
-<span class="lineNum">      62 </span>                :    *  pair of character sequences:  one for input, and one for output.
-<span class="lineNum">      63 </span>                :    *
-<span class="lineNum">      64 </span>                :    *  Section [27.5.1] of the standard describes the requirements and
-<span class="lineNum">      65 </span>                :    *  behavior of stream buffer classes.  That section (three paragraphs)
-<span class="lineNum">      66 </span>                :    *  is reproduced here, for simplicity and accuracy.
-<span class="lineNum">      67 </span>                :    *
-<span class="lineNum">      68 </span>                :    *  -# Stream buffers can impose various constraints on the sequences
-<span class="lineNum">      69 </span>                :    *     they control.  Some constraints are:
-<span class="lineNum">      70 </span>                :    *     - The controlled input sequence can be not readable.
-<span class="lineNum">      71 </span>                :    *     - The controlled output sequence can be not writable.
-<span class="lineNum">      72 </span>                :    *     - The controlled sequences can be associated with the contents of
-<span class="lineNum">      73 </span>                :    *       other representations for character sequences, such as external
-<span class="lineNum">      74 </span>                :    *       files.
-<span class="lineNum">      75 </span>                :    *     - The controlled sequences can support operations @e directly to or
-<span class="lineNum">      76 </span>                :    *       from associated sequences.
-<span class="lineNum">      77 </span>                :    *     - The controlled sequences can impose limitations on how the
-<span class="lineNum">      78 </span>                :    *       program can read characters from a sequence, write characters to
-<span class="lineNum">      79 </span>                :    *       a sequence, put characters back into an input sequence, or alter
-<span class="lineNum">      80 </span>                :    *       the stream position.
-<span class="lineNum">      81 </span>                :    *     .
-<span class="lineNum">      82 </span>                :    *  -# Each sequence is characterized by three pointers which, if non-null,
-<span class="lineNum">      83 </span>                :    *     all point into the same @c charT array object.  The array object
-<span class="lineNum">      84 </span>                :    *     represents, at any moment, a (sub)sequence of characters from the
-<span class="lineNum">      85 </span>                :    *     sequence.  Operations performed on a sequence alter the values
-<span class="lineNum">      86 </span>                :    *     stored in these pointers, perform reads and writes directly to or
-<span class="lineNum">      87 </span>                :    *     from associated sequences, and alter &quot;the stream position&quot; and
-<span class="lineNum">      88 </span>                :    *     conversion state as needed to maintain this subsequence relationship.
-<span class="lineNum">      89 </span>                :    *     The three pointers are:
-<span class="lineNum">      90 </span>                :    *     - the &lt;em&gt;beginning pointer&lt;/em&gt;, or lowest element address in the
-<span class="lineNum">      91 </span>                :    *       array (called @e xbeg here);
-<span class="lineNum">      92 </span>                :    *     - the &lt;em&gt;next pointer&lt;/em&gt;, or next element address that is a
-<span class="lineNum">      93 </span>                :    *       current candidate for reading or writing (called @e xnext here);
-<span class="lineNum">      94 </span>                :    *     - the &lt;em&gt;end pointer&lt;/em&gt;, or first element address beyond the
-<span class="lineNum">      95 </span>                :    *       end of the array (called @e xend here).
-<span class="lineNum">      96 </span>                :    *     .
-<span class="lineNum">      97 </span>                :    *  -# The following semantic constraints shall always apply for any set
-<span class="lineNum">      98 </span>                :    *     of three pointers for a sequence, using the pointer names given
-<span class="lineNum">      99 </span>                :    *     immediately above:
-<span class="lineNum">     100 </span>                :    *     - If @e xnext is not a null pointer, then @e xbeg and @e xend shall
-<span class="lineNum">     101 </span>                :    *       also be non-null pointers into the same @c charT array, as
-<span class="lineNum">     102 </span>                :    *       described above; otherwise, @e xbeg and @e xend shall also be null.
-<span class="lineNum">     103 </span>                :    *     - If @e xnext is not a null pointer and @e xnext &lt; @e xend for an
-<span class="lineNum">     104 </span>                :    *       output sequence, then a &lt;em&gt;write position&lt;/em&gt; is available.
-<span class="lineNum">     105 </span>                :    *       In this case, @e *xnext shall be assignable as the next element
-<span class="lineNum">     106 </span>                :    *       to write (to put, or to store a character value, into the sequence).
-<span class="lineNum">     107 </span>                :    *     - If @e xnext is not a null pointer and @e xbeg &lt; @e xnext for an
-<span class="lineNum">     108 </span>                :    *       input sequence, then a &lt;em&gt;putback position&lt;/em&gt; is available.
-<span class="lineNum">     109 </span>                :    *       In this case, @e xnext[-1] shall have a defined value and is the
-<span class="lineNum">     110 </span>                :    *       next (preceding) element to store a character that is put back
-<span class="lineNum">     111 </span>                :    *       into the input sequence.
-<span class="lineNum">     112 </span>                :    *     - If @e xnext is not a null pointer and @e xnext&lt; @e xend for an
-<span class="lineNum">     113 </span>                :    *       input sequence, then a &lt;em&gt;read position&lt;/em&gt; is available.
-<span class="lineNum">     114 </span>                :    *       In this case, @e *xnext shall have a defined value and is the
-<span class="lineNum">     115 </span>                :    *       next element to read (to get, or to obtain a character value,
-<span class="lineNum">     116 </span>                :    *       from the sequence).
-<span class="lineNum">     117 </span>                :   */
-<span class="lineNum">     118 </span>                :   template&lt;typename _CharT, typename _Traits&gt;
-<span class="lineNum">     119 </span>                :     class basic_streambuf 
-<span class="lineNum">     120 </span>                :     {
-<span class="lineNum">     121 </span>                :     public:
-<span class="lineNum">     122 </span>                :       //@{
-<span class="lineNum">     123 </span>                :       /**
-<span class="lineNum">     124 </span>                :        *  These are standard types.  They permit a standardized way of
-<span class="lineNum">     125 </span>                :        *  referring to names of (or names dependant on) the template
-<span class="lineNum">     126 </span>                :        *  parameters, which are specific to the implementation.
-<span class="lineNum">     127 </span>                :       */
-<span class="lineNum">     128 </span>                :       typedef _CharT                                    char_type;
-<span class="lineNum">     129 </span>                :       typedef _Traits                                   traits_type;
-<span class="lineNum">     130 </span>                :       typedef typename traits_type::int_type            int_type;
-<span class="lineNum">     131 </span>                :       typedef typename traits_type::pos_type            pos_type;
-<span class="lineNum">     132 </span>                :       typedef typename traits_type::off_type            off_type;
-<span class="lineNum">     133 </span>                :       //@}
-<span class="lineNum">     134 </span>                : 
-<span class="lineNum">     135 </span>                :       //@{
-<span class="lineNum">     136 </span>                :       /// This is a non-standard type.
-<span class="lineNum">     137 </span>                :       typedef basic_streambuf&lt;char_type, traits_type&gt;     __streambuf_type;
-<span class="lineNum">     138 </span>                :       //@}
-<span class="lineNum">     139 </span>                :       
-<span class="lineNum">     140 </span>                :       friend class basic_ios&lt;char_type, traits_type&gt;;
-<span class="lineNum">     141 </span>                :       friend class basic_istream&lt;char_type, traits_type&gt;;
-<span class="lineNum">     142 </span>                :       friend class basic_ostream&lt;char_type, traits_type&gt;;
-<span class="lineNum">     143 </span>                :       friend class istreambuf_iterator&lt;char_type, traits_type&gt;;
-<span class="lineNum">     144 </span>                :       friend class ostreambuf_iterator&lt;char_type, traits_type&gt;;
-<span class="lineNum">     145 </span>                : 
-<span class="lineNum">     146 </span>                :       friend streamsize
-<span class="lineNum">     147 </span>                :       __copy_streambufs_eof&lt;&gt;(__streambuf_type*, __streambuf_type*, bool&amp;);
-<span class="lineNum">     148 </span>                : 
-<span class="lineNum">     149 </span>                :       template&lt;bool _IsMove, typename _CharT2&gt;
-<span class="lineNum">     150 </span>                :         friend typename __gnu_cxx::__enable_if&lt;__is_char&lt;_CharT2&gt;::__value, 
-<span class="lineNum">     151 </span>                :                                                _CharT2*&gt;::__type
-<span class="lineNum">     152 </span>                :         __copy_move_a2(istreambuf_iterator&lt;_CharT2&gt;,
-<span class="lineNum">     153 </span>                :                        istreambuf_iterator&lt;_CharT2&gt;, _CharT2*);
-<span class="lineNum">     154 </span>                : 
-<span class="lineNum">     155 </span>                :       template&lt;typename _CharT2&gt;
-<span class="lineNum">     156 </span>                :         friend typename __gnu_cxx::__enable_if&lt;__is_char&lt;_CharT2&gt;::__value,
-<span class="lineNum">     157 </span>                :                                   istreambuf_iterator&lt;_CharT2&gt; &gt;::__type
-<span class="lineNum">     158 </span>                :         find(istreambuf_iterator&lt;_CharT2&gt;, istreambuf_iterator&lt;_CharT2&gt;,
-<span class="lineNum">     159 </span>                :              const _CharT2&amp;);
-<span class="lineNum">     160 </span>                : 
-<span class="lineNum">     161 </span>                :       template&lt;typename _CharT2, typename _Traits2&gt;
-<span class="lineNum">     162 </span>                :         friend basic_istream&lt;_CharT2, _Traits2&gt;&amp;
-<span class="lineNum">     163 </span>                :         operator&gt;&gt;(basic_istream&lt;_CharT2, _Traits2&gt;&amp;, _CharT2*);
-<span class="lineNum">     164 </span>                : 
-<span class="lineNum">     165 </span>                :       template&lt;typename _CharT2, typename _Traits2, typename _Alloc&gt;
-<span class="lineNum">     166 </span>                :         friend basic_istream&lt;_CharT2, _Traits2&gt;&amp;
-<span class="lineNum">     167 </span>                :         operator&gt;&gt;(basic_istream&lt;_CharT2, _Traits2&gt;&amp;,
-<span class="lineNum">     168 </span>                :                    basic_string&lt;_CharT2, _Traits2, _Alloc&gt;&amp;);
-<span class="lineNum">     169 </span>                : 
-<span class="lineNum">     170 </span>                :       template&lt;typename _CharT2, typename _Traits2, typename _Alloc&gt;
-<span class="lineNum">     171 </span>                :         friend basic_istream&lt;_CharT2, _Traits2&gt;&amp;
-<span class="lineNum">     172 </span>                :         getline(basic_istream&lt;_CharT2, _Traits2&gt;&amp;,
-<span class="lineNum">     173 </span>                :                 basic_string&lt;_CharT2, _Traits2, _Alloc&gt;&amp;, _CharT2);
-<span class="lineNum">     174 </span>                : 
-<span class="lineNum">     175 </span>                :     protected:
-<span class="lineNum">     176 </span>                :       //@{
-<span class="lineNum">     177 </span>                :       /**
-<span class="lineNum">     178 </span>                :        *  This is based on _IO_FILE, just reordered to be more consistent,
-<span class="lineNum">     179 </span>                :        *  and is intended to be the most minimal abstraction for an
-<span class="lineNum">     180 </span>                :        *  internal buffer.
-<span class="lineNum">     181 </span>                :        *  -  get == input == read
-<span class="lineNum">     182 </span>                :        *  -  put == output == write
-<span class="lineNum">     183 </span>                :       */
-<span class="lineNum">     184 </span>                :       char_type*                _M_in_beg;     // Start of get area. 
-<span class="lineNum">     185 </span>                :       char_type*                _M_in_cur;     // Current read area. 
-<span class="lineNum">     186 </span>                :       char_type*                _M_in_end;     // End of get area. 
-<span class="lineNum">     187 </span>                :       char_type*                _M_out_beg;    // Start of put area. 
-<span class="lineNum">     188 </span>                :       char_type*                _M_out_cur;    // Current put area. 
-<span class="lineNum">     189 </span>                :       char_type*                _M_out_end;    // End of put area.
-<span class="lineNum">     190 </span>                : 
-<span class="lineNum">     191 </span>                :       /// Current locale setting.
-<span class="lineNum">     192 </span>                :       locale                    _M_buf_locale;  
-<span class="lineNum">     193 </span>                : 
-<span class="lineNum">     194 </span>                :   public:
-<span class="lineNum">     195 </span>                :       /// Destructor deallocates no buffer space.
-<span class="lineNum">     196 </span>                :       virtual 
-<span class="lineNum">     197 </span><span class="lineNoCov">              0 :       ~basic_streambuf() </span>
-<span class="lineNum">     198 </span><span class="lineNoCov">              0 :       { }</span>
-<span class="lineNum">     199 </span>                : 
-<span class="lineNum">     200 </span>                :       // [27.5.2.2.1] locales
-<span class="lineNum">     201 </span>                :       /**
-<span class="lineNum">     202 </span>                :        *  @brief  Entry point for imbue().
-<span class="lineNum">     203 </span>                :        *  @param  loc  The new locale.
-<span class="lineNum">     204 </span>                :        *  @return  The previous locale.
-<span class="lineNum">     205 </span>                :        *
-<span class="lineNum">     206 </span>                :        *  Calls the derived imbue(loc).
-<span class="lineNum">     207 </span>                :       */
-<span class="lineNum">     208 </span>                :       locale 
-<span class="lineNum">     209 </span>                :       pubimbue(const locale &amp;__loc)
-<span class="lineNum">     210 </span>                :       {
-<span class="lineNum">     211 </span>                :         locale __tmp(this-&gt;getloc());
-<span class="lineNum">     212 </span>                :         this-&gt;imbue(__loc);
-<span class="lineNum">     213 </span>                :         _M_buf_locale = __loc;
-<span class="lineNum">     214 </span>                :         return __tmp;
-<span class="lineNum">     215 </span>                :       }
-<span class="lineNum">     216 </span>                : 
-<span class="lineNum">     217 </span>                :       /**
-<span class="lineNum">     218 </span>                :        *  @brief  Locale access.
-<span class="lineNum">     219 </span>                :        *  @return  The current locale in effect.
-<span class="lineNum">     220 </span>                :        *
-<span class="lineNum">     221 </span>                :        *  If pubimbue(loc) has been called, then the most recent @c loc
-<span class="lineNum">     222 </span>                :        *  is returned.  Otherwise the global locale in effect at the time
-<span class="lineNum">     223 </span>                :        *  of construction is returned.
-<span class="lineNum">     224 </span>                :       */
-<span class="lineNum">     225 </span>                :       locale   
-<span class="lineNum">     226 </span>                :       getloc() const
-<span class="lineNum">     227 </span>                :       { return _M_buf_locale; } 
-<span class="lineNum">     228 </span>                : 
-<span class="lineNum">     229 </span>                :       // [27.5.2.2.2] buffer management and positioning
-<span class="lineNum">     230 </span>                :       //@{
-<span class="lineNum">     231 </span>                :       /**
-<span class="lineNum">     232 </span>                :        *  @brief  Entry points for derived buffer functions.
-<span class="lineNum">     233 </span>                :        *
-<span class="lineNum">     234 </span>                :        *  The public versions of @c pubfoo dispatch to the protected
-<span class="lineNum">     235 </span>                :        *  derived @c foo member functions, passing the arguments (if any)
-<span class="lineNum">     236 </span>                :        *  and returning the result unchanged.
-<span class="lineNum">     237 </span>                :       */
-<span class="lineNum">     238 </span>                :       __streambuf_type* 
-<span class="lineNum">     239 </span>                :       pubsetbuf(char_type* __s, streamsize __n) 
-<span class="lineNum">     240 </span>                :       { return this-&gt;setbuf(__s, __n); }
-<span class="lineNum">     241 </span>                : 
-<span class="lineNum">     242 </span>                :       pos_type 
-<span class="lineNum">     243 </span>                :       pubseekoff(off_type __off, ios_base::seekdir __way, 
-<span class="lineNum">     244 </span>                :                  ios_base::openmode __mode = ios_base::in | ios_base::out)
-<span class="lineNum">     245 </span>                :       { return this-&gt;seekoff(__off, __way, __mode); }
-<span class="lineNum">     246 </span>                : 
-<span class="lineNum">     247 </span>                :       pos_type 
-<span class="lineNum">     248 </span>                :       pubseekpos(pos_type __sp,
-<span class="lineNum">     249 </span>                :                  ios_base::openmode __mode = ios_base::in | ios_base::out)
-<span class="lineNum">     250 </span>                :       { return this-&gt;seekpos(__sp, __mode); }
-<span class="lineNum">     251 </span>                : 
-<span class="lineNum">     252 </span>                :       int 
-<span class="lineNum">     253 </span>                :       pubsync() { return this-&gt;sync(); }
-<span class="lineNum">     254 </span>                :       //@}
-<span class="lineNum">     255 </span>                : 
-<span class="lineNum">     256 </span>                :       // [27.5.2.2.3] get area
-<span class="lineNum">     257 </span>                :       /**
-<span class="lineNum">     258 </span>                :        *  @brief  Looking ahead into the stream.
-<span class="lineNum">     259 </span>                :        *  @return  The number of characters available.
-<span class="lineNum">     260 </span>                :        *
-<span class="lineNum">     261 </span>                :        *  If a read position is available, returns the number of characters
-<span class="lineNum">     262 </span>                :        *  available for reading before the buffer must be refilled.
-<span class="lineNum">     263 </span>                :        *  Otherwise returns the derived @c showmanyc().
-<span class="lineNum">     264 </span>                :       */
-<span class="lineNum">     265 </span>                :       streamsize 
-<span class="lineNum">     266 </span>                :       in_avail() 
-<span class="lineNum">     267 </span>                :       { 
-<span class="lineNum">     268 </span>                :         const streamsize __ret = this-&gt;egptr() - this-&gt;gptr();
-<span class="lineNum">     269 </span>                :         return __ret ? __ret : this-&gt;showmanyc();
-<span class="lineNum">     270 </span>                :       }
-<span class="lineNum">     271 </span>                : 
-<span class="lineNum">     272 </span>                :       /**
-<span class="lineNum">     273 </span>                :        *  @brief  Getting the next character.
-<span class="lineNum">     274 </span>                :        *  @return  The next character, or eof.
-<span class="lineNum">     275 </span>                :        *
-<span class="lineNum">     276 </span>                :        *  Calls @c sbumpc(), and if that function returns
-<span class="lineNum">     277 </span>                :        *  @c traits::eof(), so does this function.  Otherwise, @c sgetc().
-<span class="lineNum">     278 </span>                :       */
-<span class="lineNum">     279 </span>                :       int_type 
-<span class="lineNum">     280 </span>                :       snextc()
-<span class="lineNum">     281 </span>                :       {
-<span class="lineNum">     282 </span>                :         int_type __ret = traits_type::eof();
-<span class="lineNum">     283 </span>                :         if (__builtin_expect(!traits_type::eq_int_type(this-&gt;sbumpc(), 
-<span class="lineNum">     284 </span>                :                                                        __ret), true))
-<span class="lineNum">     285 </span>                :           __ret = this-&gt;sgetc();
-<span class="lineNum">     286 </span>                :         return __ret;
-<span class="lineNum">     287 </span>                :       }
-<span class="lineNum">     288 </span>                : 
-<span class="lineNum">     289 </span>                :       /**
-<span class="lineNum">     290 </span>                :        *  @brief  Getting the next character.
-<span class="lineNum">     291 </span>                :        *  @return  The next character, or eof.
-<span class="lineNum">     292 </span>                :        *
-<span class="lineNum">     293 </span>                :        *  If the input read position is available, returns that character
-<span class="lineNum">     294 </span>                :        *  and increments the read pointer, otherwise calls and returns
-<span class="lineNum">     295 </span>                :        *  @c uflow().
-<span class="lineNum">     296 </span>                :       */
-<span class="lineNum">     297 </span>                :       int_type 
-<span class="lineNum">     298 </span>                :       sbumpc()
-<span class="lineNum">     299 </span>                :       {
-<span class="lineNum">     300 </span>                :         int_type __ret;
-<span class="lineNum">     301 </span>                :         if (__builtin_expect(this-&gt;gptr() &lt; this-&gt;egptr(), true))
-<span class="lineNum">     302 </span>                :           {
-<span class="lineNum">     303 </span>                :             __ret = traits_type::to_int_type(*this-&gt;gptr());
-<span class="lineNum">     304 </span>                :             this-&gt;gbump(1);
-<span class="lineNum">     305 </span>                :           }
-<span class="lineNum">     306 </span>                :         else 
-<span class="lineNum">     307 </span>                :           __ret = this-&gt;uflow();
-<span class="lineNum">     308 </span>                :         return __ret;
-<span class="lineNum">     309 </span>                :       }
-<span class="lineNum">     310 </span>                : 
-<span class="lineNum">     311 </span>                :       /**
-<span class="lineNum">     312 </span>                :        *  @brief  Getting the next character.
-<span class="lineNum">     313 </span>                :        *  @return  The next character, or eof.
-<span class="lineNum">     314 </span>                :        *
-<span class="lineNum">     315 </span>                :        *  If the input read position is available, returns that character,
-<span class="lineNum">     316 </span>                :        *  otherwise calls and returns @c underflow().  Does not move the 
-<span class="lineNum">     317 </span>                :        *  read position after fetching the character.
-<span class="lineNum">     318 </span>                :       */
-<span class="lineNum">     319 </span>                :       int_type 
-<span class="lineNum">     320 </span>                :       sgetc()
-<span class="lineNum">     321 </span>                :       {
-<span class="lineNum">     322 </span>                :         int_type __ret;
-<span class="lineNum">     323 </span>                :         if (__builtin_expect(this-&gt;gptr() &lt; this-&gt;egptr(), true))
-<span class="lineNum">     324 </span>                :           __ret = traits_type::to_int_type(*this-&gt;gptr());
-<span class="lineNum">     325 </span>                :         else 
-<span class="lineNum">     326 </span>                :           __ret = this-&gt;underflow();
-<span class="lineNum">     327 </span>                :         return __ret;
-<span class="lineNum">     328 </span>                :       }
-<span class="lineNum">     329 </span>                : 
-<span class="lineNum">     330 </span>                :       /**
-<span class="lineNum">     331 </span>                :        *  @brief  Entry point for xsgetn.
-<span class="lineNum">     332 </span>                :        *  @param  s  A buffer area.
-<span class="lineNum">     333 </span>                :        *  @param  n  A count.
-<span class="lineNum">     334 </span>                :        *
-<span class="lineNum">     335 </span>                :        *  Returns xsgetn(s,n).  The effect is to fill @a s[0] through
-<span class="lineNum">     336 </span>                :        *  @a s[n-1] with characters from the input sequence, if possible.
-<span class="lineNum">     337 </span>                :       */
-<span class="lineNum">     338 </span>                :       streamsize 
-<span class="lineNum">     339 </span>                :       sgetn(char_type* __s, streamsize __n)
-<span class="lineNum">     340 </span>                :       { return this-&gt;xsgetn(__s, __n); }
-<span class="lineNum">     341 </span>                : 
-<span class="lineNum">     342 </span>                :       // [27.5.2.2.4] putback
-<span class="lineNum">     343 </span>                :       /**
-<span class="lineNum">     344 </span>                :        *  @brief  Pushing characters back into the input stream.
-<span class="lineNum">     345 </span>                :        *  @param  c  The character to push back.
-<span class="lineNum">     346 </span>                :        *  @return  The previous character, if possible.
-<span class="lineNum">     347 </span>                :        *
-<span class="lineNum">     348 </span>                :        *  Similar to sungetc(), but @a c is pushed onto the stream instead
-<span class="lineNum">     349 </span>                :        *  of &quot;the previous character&quot;.  If successful, the next character
-<span class="lineNum">     350 </span>                :        *  fetched from the input stream will be @a c.
-<span class="lineNum">     351 </span>                :       */
-<span class="lineNum">     352 </span>                :       int_type 
-<span class="lineNum">     353 </span>                :       sputbackc(char_type __c)
-<span class="lineNum">     354 </span>                :       {
-<span class="lineNum">     355 </span>                :         int_type __ret;
-<span class="lineNum">     356 </span>                :         const bool __testpos = this-&gt;eback() &lt; this-&gt;gptr();
-<span class="lineNum">     357 </span>                :         if (__builtin_expect(!__testpos || 
-<span class="lineNum">     358 </span>                :                              !traits_type::eq(__c, this-&gt;gptr()[-1]), false))
-<span class="lineNum">     359 </span>                :           __ret = this-&gt;pbackfail(traits_type::to_int_type(__c));
-<span class="lineNum">     360 </span>                :         else 
-<span class="lineNum">     361 </span>                :           {
-<span class="lineNum">     362 </span>                :             this-&gt;gbump(-1);
-<span class="lineNum">     363 </span>                :             __ret = traits_type::to_int_type(*this-&gt;gptr());
-<span class="lineNum">     364 </span>                :           }
-<span class="lineNum">     365 </span>                :         return __ret;
-<span class="lineNum">     366 </span>                :       }
-<span class="lineNum">     367 </span>                : 
-<span class="lineNum">     368 </span>                :       /**
-<span class="lineNum">     369 </span>                :        *  @brief  Moving backwards in the input stream.
-<span class="lineNum">     370 </span>                :        *  @return  The previous character, if possible.
-<span class="lineNum">     371 </span>                :        *
-<span class="lineNum">     372 </span>                :        *  If a putback position is available, this function decrements the
-<span class="lineNum">     373 </span>                :        *  input pointer and returns that character.  Otherwise, calls and
-<span class="lineNum">     374 </span>                :        *  returns pbackfail().  The effect is to &quot;unget&quot; the last character
-<span class="lineNum">     375 </span>                :        *  &quot;gotten&quot;.
-<span class="lineNum">     376 </span>                :       */
-<span class="lineNum">     377 </span>                :       int_type 
-<span class="lineNum">     378 </span>                :       sungetc()
-<span class="lineNum">     379 </span>                :       {
-<span class="lineNum">     380 </span>                :         int_type __ret;
-<span class="lineNum">     381 </span>                :         if (__builtin_expect(this-&gt;eback() &lt; this-&gt;gptr(), true))
-<span class="lineNum">     382 </span>                :           {
-<span class="lineNum">     383 </span>                :             this-&gt;gbump(-1);
-<span class="lineNum">     384 </span>                :             __ret = traits_type::to_int_type(*this-&gt;gptr());
-<span class="lineNum">     385 </span>                :           }
-<span class="lineNum">     386 </span>                :         else 
-<span class="lineNum">     387 </span>                :           __ret = this-&gt;pbackfail();
-<span class="lineNum">     388 </span>                :         return __ret;
-<span class="lineNum">     389 </span>                :       }
-<span class="lineNum">     390 </span>                : 
-<span class="lineNum">     391 </span>                :       // [27.5.2.2.5] put area
-<span class="lineNum">     392 </span>                :       /**
-<span class="lineNum">     393 </span>                :        *  @brief  Entry point for all single-character output functions.
-<span class="lineNum">     394 </span>                :        *  @param  c  A character to output.
-<span class="lineNum">     395 </span>                :        *  @return  @a c, if possible.
-<span class="lineNum">     396 </span>                :        *
-<span class="lineNum">     397 </span>                :        *  One of two public output functions.
-<span class="lineNum">     398 </span>                :        *
-<span class="lineNum">     399 </span>                :        *  If a write position is available for the output sequence (i.e.,
-<span class="lineNum">     400 </span>                :        *  the buffer is not full), stores @a c in that position, increments
-<span class="lineNum">     401 </span>                :        *  the position, and returns @c traits::to_int_type(c).  If a write
-<span class="lineNum">     402 </span>                :        *  position is not available, returns @c overflow(c).
-<span class="lineNum">     403 </span>                :       */
-<span class="lineNum">     404 </span>                :       int_type 
-<span class="lineNum">     405 </span>                :       sputc(char_type __c)
-<span class="lineNum">     406 </span>                :       {
-<span class="lineNum">     407 </span>                :         int_type __ret;
-<span class="lineNum">     408 </span>                :         if (__builtin_expect(this-&gt;pptr() &lt; this-&gt;epptr(), true))
-<span class="lineNum">     409 </span>                :           {
-<span class="lineNum">     410 </span>                :             *this-&gt;pptr() = __c;
-<span class="lineNum">     411 </span>                :             this-&gt;pbump(1);
-<span class="lineNum">     412 </span>                :             __ret = traits_type::to_int_type(__c);
-<span class="lineNum">     413 </span>                :           }
-<span class="lineNum">     414 </span>                :         else
-<span class="lineNum">     415 </span>                :           __ret = this-&gt;overflow(traits_type::to_int_type(__c));
-<span class="lineNum">     416 </span>                :         return __ret;
-<span class="lineNum">     417 </span>                :       }
-<span class="lineNum">     418 </span>                : 
-<span class="lineNum">     419 </span>                :       /**
-<span class="lineNum">     420 </span>                :        *  @brief  Entry point for all single-character output functions.
-<span class="lineNum">     421 </span>                :        *  @param  s  A buffer read area.
-<span class="lineNum">     422 </span>                :        *  @param  n  A count.
-<span class="lineNum">     423 </span>                :        *
-<span class="lineNum">     424 </span>                :        *  One of two public output functions.
-<span class="lineNum">     425 </span>                :        *
-<span class="lineNum">     426 </span>                :        *
-<span class="lineNum">     427 </span>                :        *  Returns xsputn(s,n).  The effect is to write @a s[0] through
-<span class="lineNum">     428 </span>                :        *  @a s[n-1] to the output sequence, if possible.
-<span class="lineNum">     429 </span>                :       */
-<span class="lineNum">     430 </span>                :       streamsize 
-<span class="lineNum">     431 </span>                :       sputn(const char_type* __s, streamsize __n)
-<span class="lineNum">     432 </span>                :       { return this-&gt;xsputn(__s, __n); }
-<span class="lineNum">     433 </span>                : 
-<span class="lineNum">     434 </span>                :     protected:
-<span class="lineNum">     435 </span>                :       /**
-<span class="lineNum">     436 </span>                :        *  @brief  Base constructor.
-<span class="lineNum">     437 </span>                :        *
-<span class="lineNum">     438 </span>                :        *  Only called from derived constructors, and sets up all the
-<span class="lineNum">     439 </span>                :        *  buffer data to zero, including the pointers described in the
-<span class="lineNum">     440 </span>                :        *  basic_streambuf class description.  Note that, as a result,
-<span class="lineNum">     441 </span>                :        *  - the class starts with no read nor write positions available,
-<span class="lineNum">     442 </span>                :        *  - this is not an error
-<span class="lineNum">     443 </span>                :       */
-<span class="lineNum">     444 </span><span class="lineNoCov">              0 :       basic_streambuf()</span>
-<span class="lineNum">     445 </span>                :       : _M_in_beg(0), _M_in_cur(0), _M_in_end(0), 
-<span class="lineNum">     446 </span>                :       _M_out_beg(0), _M_out_cur(0), _M_out_end(0),
-<span class="lineNum">     447 </span><span class="lineNoCov">              0 :       _M_buf_locale(locale()) </span>
-<span class="lineNum">     448 </span><span class="lineNoCov">              0 :       { }</span>
-<span class="lineNum">     449 </span>                : 
-<span class="lineNum">     450 </span>                :       // [27.5.2.3.1] get area access
-<span class="lineNum">     451 </span>                :       //@{
-<span class="lineNum">     452 </span>                :       /**
-<span class="lineNum">     453 </span>                :        *  @brief  Access to the get area.
-<span class="lineNum">     454 </span>                :        *
-<span class="lineNum">     455 </span>                :        *  These functions are only available to other protected functions,
-<span class="lineNum">     456 </span>                :        *  including derived classes.
-<span class="lineNum">     457 </span>                :        *
-<span class="lineNum">     458 </span>                :        *  - eback() returns the beginning pointer for the input sequence
-<span class="lineNum">     459 </span>                :        *  - gptr() returns the next pointer for the input sequence
-<span class="lineNum">     460 </span>                :        *  - egptr() returns the end pointer for the input sequence
-<span class="lineNum">     461 </span>                :       */
-<span class="lineNum">     462 </span>                :       char_type* 
-<span class="lineNum">     463 </span>                :       eback() const { return _M_in_beg; }
-<span class="lineNum">     464 </span>                : 
-<span class="lineNum">     465 </span>                :       char_type* 
-<span class="lineNum">     466 </span><span class="lineNoCov">              0 :       gptr()  const { return _M_in_cur;  }</span>
-<span class="lineNum">     467 </span>                : 
-<span class="lineNum">     468 </span>                :       char_type* 
-<span class="lineNum">     469 </span><span class="lineNoCov">              0 :       egptr() const { return _M_in_end; }</span>
-<span class="lineNum">     470 </span>                :       //@}
-<span class="lineNum">     471 </span>                : 
-<span class="lineNum">     472 </span>                :       /**
-<span class="lineNum">     473 </span>                :        *  @brief  Moving the read position.
-<span class="lineNum">     474 </span>                :        *  @param  n  The delta by which to move.
-<span class="lineNum">     475 </span>                :        *
-<span class="lineNum">     476 </span>                :        *  This just advances the read position without returning any data.
-<span class="lineNum">     477 </span>                :       */
-<span class="lineNum">     478 </span>                :       void 
-<span class="lineNum">     479 </span><span class="lineNoCov">              0 :       gbump(int __n) { _M_in_cur += __n; }</span>
-<span class="lineNum">     480 </span>                : 
-<span class="lineNum">     481 </span>                :       /**
-<span class="lineNum">     482 </span>                :        *  @brief  Setting the three read area pointers.
-<span class="lineNum">     483 </span>                :        *  @param  gbeg  A pointer.
-<span class="lineNum">     484 </span>                :        *  @param  gnext  A pointer.
-<span class="lineNum">     485 </span>                :        *  @param  gend  A pointer.
-<span class="lineNum">     486 </span>                :        *  @post  @a gbeg == @c eback(), @a gnext == @c gptr(), and
-<span class="lineNum">     487 </span>                :        *         @a gend == @c egptr()
-<span class="lineNum">     488 </span>                :       */
-<span class="lineNum">     489 </span>                :       void 
-<span class="lineNum">     490 </span>                :       setg(char_type* __gbeg, char_type* __gnext, char_type* __gend)
-<span class="lineNum">     491 </span>                :       {
-<span class="lineNum">     492 </span>                :         _M_in_beg = __gbeg;
-<span class="lineNum">     493 </span>                :         _M_in_cur = __gnext;
-<span class="lineNum">     494 </span>                :         _M_in_end = __gend;
-<span class="lineNum">     495 </span>                :       }
-<span class="lineNum">     496 </span>                : 
-<span class="lineNum">     497 </span>                :       // [27.5.2.3.2] put area access
-<span class="lineNum">     498 </span>                :       //@{
-<span class="lineNum">     499 </span>                :       /**
-<span class="lineNum">     500 </span>                :        *  @brief  Access to the put area.
-<span class="lineNum">     501 </span>                :        *
-<span class="lineNum">     502 </span>                :        *  These functions are only available to other protected functions,
-<span class="lineNum">     503 </span>                :        *  including derived classes.
-<span class="lineNum">     504 </span>                :        *
-<span class="lineNum">     505 </span>                :        *  - pbase() returns the beginning pointer for the output sequence
-<span class="lineNum">     506 </span>                :        *  - pptr() returns the next pointer for the output sequence
-<span class="lineNum">     507 </span>                :        *  - epptr() returns the end pointer for the output sequence
-<span class="lineNum">     508 </span>                :       */
-<span class="lineNum">     509 </span>                :       char_type* 
-<span class="lineNum">     510 </span><span class="lineNoCov">              0 :       pbase() const { return _M_out_beg; }</span>
-<span class="lineNum">     511 </span>                : 
-<span class="lineNum">     512 </span>                :       char_type* 
-<span class="lineNum">     513 </span><span class="lineNoCov">              0 :       pptr() const { return _M_out_cur; }</span>
-<span class="lineNum">     514 </span>                : 
-<span class="lineNum">     515 </span>                :       char_type* 
-<span class="lineNum">     516 </span>                :       epptr() const { return _M_out_end; }
-<span class="lineNum">     517 </span>                :       //@}
-<span class="lineNum">     518 </span>                : 
-<span class="lineNum">     519 </span>                :       /**
-<span class="lineNum">     520 </span>                :        *  @brief  Moving the write position.
-<span class="lineNum">     521 </span>                :        *  @param  n  The delta by which to move.
-<span class="lineNum">     522 </span>                :        *
-<span class="lineNum">     523 </span>                :        *  This just advances the write position without returning any data.
-<span class="lineNum">     524 </span>                :       */
-<span class="lineNum">     525 </span>                :       void 
-<span class="lineNum">     526 </span><span class="lineNoCov">              0 :       pbump(int __n) { _M_out_cur += __n; }</span>
-<span class="lineNum">     527 </span>                : 
-<span class="lineNum">     528 </span>                :       /**
-<span class="lineNum">     529 </span>                :        *  @brief  Setting the three write area pointers.
-<span class="lineNum">     530 </span>                :        *  @param  pbeg  A pointer.
-<span class="lineNum">     531 </span>                :        *  @param  pend  A pointer.
-<span class="lineNum">     532 </span>                :        *  @post  @a pbeg == @c pbase(), @a pbeg == @c pptr(), and
-<span class="lineNum">     533 </span>                :        *         @a pend == @c epptr()
-<span class="lineNum">     534 </span>                :       */
-<span class="lineNum">     535 </span>                :       void 
-<span class="lineNum">     536 </span><span class="lineNoCov">              0 :       setp(char_type* __pbeg, char_type* __pend)</span>
-<span class="lineNum">     537 </span>                :       { 
-<span class="lineNum">     538 </span><span class="lineNoCov">              0 :         _M_out_beg = _M_out_cur = __pbeg; </span>
-<span class="lineNum">     539 </span><span class="lineNoCov">              0 :         _M_out_end = __pend;</span>
-<span class="lineNum">     540 </span><span class="lineNoCov">              0 :       }</span>
-<span class="lineNum">     541 </span>                : 
-<span class="lineNum">     542 </span>                :       // [27.5.2.4] virtual functions
-<span class="lineNum">     543 </span>                :       // [27.5.2.4.1] locales
-<span class="lineNum">     544 </span>                :       /**
-<span class="lineNum">     545 </span>                :        *  @brief  Changes translations.
-<span class="lineNum">     546 </span>                :        *  @param  loc  A new locale.
-<span class="lineNum">     547 </span>                :        *
-<span class="lineNum">     548 </span>                :        *  Translations done during I/O which depend on the current locale
-<span class="lineNum">     549 </span>                :        *  are changed by this call.  The standard adds, &quot;Between invocations
-<span class="lineNum">     550 </span>                :        *  of this function a class derived from streambuf can safely cache
-<span class="lineNum">     551 </span>                :        *  results of calls to locale functions and to members of facets
-<span class="lineNum">     552 </span>                :        *  so obtained.&quot;
-<span class="lineNum">     553 </span>                :        *
-<span class="lineNum">     554 </span>                :        *  @note  Base class version does nothing.
-<span class="lineNum">     555 </span>                :       */
-<span class="lineNum">     556 </span>                :       virtual void 
-<span class="lineNum">     557 </span><span class="lineNoCov">              0 :       imbue(const locale&amp;) </span>
-<span class="lineNum">     558 </span><span class="lineNoCov">              0 :       { }</span>
-<span class="lineNum">     559 </span>                : 
-<span class="lineNum">     560 </span>                :       // [27.5.2.4.2] buffer management and positioning
-<span class="lineNum">     561 </span>                :       /**
-<span class="lineNum">     562 </span>                :        *  @brief  Manipulates the buffer.
-<span class="lineNum">     563 </span>                :        *
-<span class="lineNum">     564 </span>                :        *  Each derived class provides its own appropriate behavior.  See
-<span class="lineNum">     565 </span>                :        *  the next-to-last paragraph of 
-<span class="lineNum">     566 </span>                :        *  http://gcc.gnu.org/onlinedocs/libstdc++/27_io/howto.html#2 for
-<span class="lineNum">     567 </span>                :        *  more on this function.
-<span class="lineNum">     568 </span>                :        *
-<span class="lineNum">     569 </span>                :        *  @note  Base class version does nothing, returns @c this.
-<span class="lineNum">     570 </span>                :       */
-<span class="lineNum">     571 </span>                :       virtual basic_streambuf&lt;char_type,_Traits&gt;* 
-<span class="lineNum">     572 </span><span class="lineNoCov">              0 :       setbuf(char_type*, streamsize)</span>
-<span class="lineNum">     573 </span><span class="lineNoCov">              0 :       { return this; }</span>
-<span class="lineNum">     574 </span>                :       
-<span class="lineNum">     575 </span>                :       /**
-<span class="lineNum">     576 </span>                :        *  @brief  Alters the stream positions.
-<span class="lineNum">     577 </span>                :        *
-<span class="lineNum">     578 </span>                :        *  Each derived class provides its own appropriate behavior.
-<span class="lineNum">     579 </span>                :        *  @note  Base class version does nothing, returns a @c pos_type
-<span class="lineNum">     580 </span>                :        *         that represents an invalid stream position.
-<span class="lineNum">     581 </span>                :       */
-<span class="lineNum">     582 </span>                :       virtual pos_type 
-<span class="lineNum">     583 </span>                :       seekoff(off_type, ios_base::seekdir,
-<span class="lineNum">     584 </span><span class="lineNoCov">              0 :               ios_base::openmode /*__mode*/ = ios_base::in | ios_base::out)</span>
-<span class="lineNum">     585 </span><span class="lineNoCov">              0 :       { return pos_type(off_type(-1)); } </span>
-<span class="lineNum">     586 </span>                : 
-<span class="lineNum">     587 </span>                :       /**
-<span class="lineNum">     588 </span>                :        *  @brief  Alters the stream positions.
-<span class="lineNum">     589 </span>                :        *
-<span class="lineNum">     590 </span>                :        *  Each derived class provides its own appropriate behavior.
-<span class="lineNum">     591 </span>                :        *  @note  Base class version does nothing, returns a @c pos_type
-<span class="lineNum">     592 </span>                :        *         that represents an invalid stream position.
-<span class="lineNum">     593 </span>                :       */
-<span class="lineNum">     594 </span>                :       virtual pos_type 
-<span class="lineNum">     595 </span>                :       seekpos(pos_type, 
-<span class="lineNum">     596 </span><span class="lineNoCov">              0 :               ios_base::openmode /*__mode*/ = ios_base::in | ios_base::out)</span>
-<span class="lineNum">     597 </span><span class="lineNoCov">              0 :       { return pos_type(off_type(-1)); } </span>
-<span class="lineNum">     598 </span>                : 
-<span class="lineNum">     599 </span>                :       /**
-<span class="lineNum">     600 </span>                :        *  @brief  Synchronizes the buffer arrays with the controlled sequences.
-<span class="lineNum">     601 </span>                :        *  @return  -1 on failure.
-<span class="lineNum">     602 </span>                :        *
-<span class="lineNum">     603 </span>                :        *  Each derived class provides its own appropriate behavior,
-<span class="lineNum">     604 </span>                :        *  including the definition of &quot;failure&quot;.
-<span class="lineNum">     605 </span>                :        *  @note  Base class version does nothing, returns zero.
-<span class="lineNum">     606 </span>                :       */
-<span class="lineNum">     607 </span>                :       virtual int 
-<span class="lineNum">     608 </span><span class="lineNoCov">              0 :       sync() { return 0; }</span>
-<span class="lineNum">     609 </span>                : 
-<span class="lineNum">     610 </span>                :       // [27.5.2.4.3] get area
-<span class="lineNum">     611 </span>                :       /**
-<span class="lineNum">     612 </span>                :        *  @brief  Investigating the data available.
-<span class="lineNum">     613 </span>                :        *  @return  An estimate of the number of characters available in the
-<span class="lineNum">     614 </span>                :        *           input sequence, or -1.
-<span class="lineNum">     615 </span>                :        *
-<span class="lineNum">     616 </span>                :        *  &quot;If it returns a positive value, then successive calls to
-<span class="lineNum">     617 </span>                :        *  @c underflow() will not return @c traits::eof() until at least that
-<span class="lineNum">     618 </span>                :        *  number of characters have been supplied.  If @c showmanyc()
-<span class="lineNum">     619 </span>                :        *  returns -1, then calls to @c underflow() or @c uflow() will fail.&quot;
-<span class="lineNum">     620 </span>                :        *  [27.5.2.4.3]/1
-<span class="lineNum">     621 </span>                :        *
-<span class="lineNum">     622 </span>                :        *  @note  Base class version does nothing, returns zero.
-<span class="lineNum">     623 </span>                :        *  @note  The standard adds that &quot;the intention is not only that the
-<span class="lineNum">     624 </span>                :        *         calls [to underflow or uflow] will not return @c eof() but
-<span class="lineNum">     625 </span>                :        *         that they will return &quot;immediately&quot;.
-<span class="lineNum">     626 </span>                :        *  @note  The standard adds that &quot;the morphemes of @c showmanyc are
-<span class="lineNum">     627 </span>                :        *         &quot;es-how-many-see&quot;, not &quot;show-manic&quot;.
-<span class="lineNum">     628 </span>                :       */
-<span class="lineNum">     629 </span>                :       virtual streamsize 
-<span class="lineNum">     630 </span><span class="lineNoCov">              0 :       showmanyc() { return 0; }</span>
-<span class="lineNum">     631 </span>                : 
-<span class="lineNum">     632 </span>                :       /**
-<span class="lineNum">     633 </span>                :        *  @brief  Multiple character extraction.
-<span class="lineNum">     634 </span>                :        *  @param  s  A buffer area.
-<span class="lineNum">     635 </span>                :        *  @param  n  Maximum number of characters to assign.
-<span class="lineNum">     636 </span>                :        *  @return  The number of characters assigned.
-<span class="lineNum">     637 </span>                :        *
-<span class="lineNum">     638 </span>                :        *  Fills @a s[0] through @a s[n-1] with characters from the input
-<span class="lineNum">     639 </span>                :        *  sequence, as if by @c sbumpc().  Stops when either @a n characters
-<span class="lineNum">     640 </span>                :        *  have been copied, or when @c traits::eof() would be copied.
-<span class="lineNum">     641 </span>                :        *
-<span class="lineNum">     642 </span>                :        *  It is expected that derived classes provide a more efficient
-<span class="lineNum">     643 </span>                :        *  implementation by overriding this definition.
-<span class="lineNum">     644 </span>                :       */
-<span class="lineNum">     645 </span>                :       virtual streamsize 
-<span class="lineNum">     646 </span>                :       xsgetn(char_type* __s, streamsize __n);
-<span class="lineNum">     647 </span>                : 
-<span class="lineNum">     648 </span>                :       /**
-<span class="lineNum">     649 </span>                :        *  @brief  Fetches more data from the controlled sequence.
-<span class="lineNum">     650 </span>                :        *  @return  The first character from the &lt;em&gt;pending sequence&lt;/em&gt;.
-<span class="lineNum">     651 </span>                :        *
-<span class="lineNum">     652 </span>                :        *  Informally, this function is called when the input buffer is
-<span class="lineNum">     653 </span>                :        *  exhausted (or does not exist, as buffering need not actually be
-<span class="lineNum">     654 </span>                :        *  done).  If a buffer exists, it is &quot;refilled&quot;.  In either case, the
-<span class="lineNum">     655 </span>                :        *  next available character is returned, or @c traits::eof() to
-<span class="lineNum">     656 </span>                :        *  indicate a null pending sequence.
-<span class="lineNum">     657 </span>                :        *
-<span class="lineNum">     658 </span>                :        *  For a formal definition of the pending sequence, see a good text
-<span class="lineNum">     659 </span>                :        *  such as Langer &amp; Kreft, or [27.5.2.4.3]/7-14.
-<span class="lineNum">     660 </span>                :        *
-<span class="lineNum">     661 </span>                :        *  A functioning input streambuf can be created by overriding only
-<span class="lineNum">     662 </span>                :        *  this function (no buffer area will be used).  For an example, see
-<span class="lineNum">     663 </span>                :        *  http://gcc.gnu.org/onlinedocs/libstdc++/27_io/howto.html#6
-<span class="lineNum">     664 </span>                :        *
-<span class="lineNum">     665 </span>                :        *  @note  Base class version does nothing, returns eof().
-<span class="lineNum">     666 </span>                :       */
-<span class="lineNum">     667 </span>                :       virtual int_type 
-<span class="lineNum">     668 </span><span class="lineNoCov">              0 :       underflow()</span>
-<span class="lineNum">     669 </span><span class="lineNoCov">              0 :       { return traits_type::eof(); }</span>
-<span class="lineNum">     670 </span>                : 
-<span class="lineNum">     671 </span>                :       /**
-<span class="lineNum">     672 </span>                :        *  @brief  Fetches more data from the controlled sequence.
-<span class="lineNum">     673 </span>                :        *  @return  The first character from the &lt;em&gt;pending sequence&lt;/em&gt;.
-<span class="lineNum">     674 </span>                :        *
-<span class="lineNum">     675 </span>                :        *  Informally, this function does the same thing as @c underflow(),
-<span class="lineNum">     676 </span>                :        *  and in fact is required to call that function.  It also returns
-<span class="lineNum">     677 </span>                :        *  the new character, like @c underflow() does.  However, this
-<span class="lineNum">     678 </span>                :        *  function also moves the read position forward by one.
-<span class="lineNum">     679 </span>                :       */
-<span class="lineNum">     680 </span>                :       virtual int_type 
-<span class="lineNum">     681 </span><span class="lineNoCov">              0 :       uflow() </span>
-<span class="lineNum">     682 </span>                :       {
-<span class="lineNum">     683 </span><span class="lineNoCov">              0 :         int_type __ret = traits_type::eof();</span>
-<span class="lineNum">     684 </span>                :         const bool __testeof = traits_type::eq_int_type(this-&gt;underflow(), 
-<span class="lineNum">     685 </span><span class="lineNoCov">              0 :                                                         __ret);</span>
-<span class="lineNum">     686 </span><span class="lineNoCov">              0 :         if (!__testeof)</span>
-<span class="lineNum">     687 </span>                :           {
-<span class="lineNum">     688 </span><span class="lineNoCov">              0 :             __ret = traits_type::to_int_type(*this-&gt;gptr());</span>
-<span class="lineNum">     689 </span><span class="lineNoCov">              0 :             this-&gt;gbump(1);</span>
-<span class="lineNum">     690 </span>                :           }
-<span class="lineNum">     691 </span><span class="lineNoCov">              0 :         return __ret;    </span>
-<span class="lineNum">     692 </span>                :       }
-<span class="lineNum">     693 </span>                : 
-<span class="lineNum">     694 </span>                :       // [27.5.2.4.4] putback
-<span class="lineNum">     695 </span>                :       /**
-<span class="lineNum">     696 </span>                :        *  @brief  Tries to back up the input sequence.
-<span class="lineNum">     697 </span>                :        *  @param  c  The character to be inserted back into the sequence.
-<span class="lineNum">     698 </span>                :        *  @return  eof() on failure, &quot;some other value&quot; on success
-<span class="lineNum">     699 </span>                :        *  @post  The constraints of @c gptr(), @c eback(), and @c pptr()
-<span class="lineNum">     700 </span>                :        *         are the same as for @c underflow().
-<span class="lineNum">     701 </span>                :        *
-<span class="lineNum">     702 </span>                :        *  @note  Base class version does nothing, returns eof().
-<span class="lineNum">     703 </span>                :       */
-<span class="lineNum">     704 </span>                :       virtual int_type 
-<span class="lineNum">     705 </span><span class="lineNoCov">              0 :       pbackfail(int_type /* __c */  = traits_type::eof())</span>
-<span class="lineNum">     706 </span><span class="lineNoCov">              0 :       { return traits_type::eof(); }</span>
-<span class="lineNum">     707 </span>                : 
-<span class="lineNum">     708 </span>                :       // Put area:
-<span class="lineNum">     709 </span>                :       /**
-<span class="lineNum">     710 </span>                :        *  @brief  Multiple character insertion.
-<span class="lineNum">     711 </span>                :        *  @param  s  A buffer area.
-<span class="lineNum">     712 </span>                :        *  @param  n  Maximum number of characters to write.
-<span class="lineNum">     713 </span>                :        *  @return  The number of characters written.
-<span class="lineNum">     714 </span>                :        *
-<span class="lineNum">     715 </span>                :        *  Writes @a s[0] through @a s[n-1] to the output sequence, as if
-<span class="lineNum">     716 </span>                :        *  by @c sputc().  Stops when either @a n characters have been
-<span class="lineNum">     717 </span>                :        *  copied, or when @c sputc() would return @c traits::eof().
-<span class="lineNum">     718 </span>                :        *
-<span class="lineNum">     719 </span>                :        *  It is expected that derived classes provide a more efficient
-<span class="lineNum">     720 </span>                :        *  implementation by overriding this definition.
-<span class="lineNum">     721 </span>                :       */
-<span class="lineNum">     722 </span>                :       virtual streamsize 
-<span class="lineNum">     723 </span>                :       xsputn(const char_type* __s, streamsize __n);
-<span class="lineNum">     724 </span>                : 
-<span class="lineNum">     725 </span>                :       /**
-<span class="lineNum">     726 </span>                :        *  @brief  Consumes data from the buffer; writes to the
-<span class="lineNum">     727 </span>                :        *          controlled sequence.
-<span class="lineNum">     728 </span>                :        *  @param  c  An additional character to consume.
-<span class="lineNum">     729 </span>                :        *  @return  eof() to indicate failure, something else (usually
-<span class="lineNum">     730 </span>                :        *           @a c, or not_eof())
-<span class="lineNum">     731 </span>                :        *
-<span class="lineNum">     732 </span>                :        *  Informally, this function is called when the output buffer is full
-<span class="lineNum">     733 </span>                :        *  (or does not exist, as buffering need not actually be done).  If a
-<span class="lineNum">     734 </span>                :        *  buffer exists, it is &quot;consumed&quot;, with &quot;some effect&quot; on the
-<span class="lineNum">     735 </span>                :        *  controlled sequence.  (Typically, the buffer is written out to the
-<span class="lineNum">     736 </span>                :        *  sequence verbatim.)  In either case, the character @a c is also
-<span class="lineNum">     737 </span>                :        *  written out, if @a c is not @c eof().
-<span class="lineNum">     738 </span>                :        *
-<span class="lineNum">     739 </span>                :        *  For a formal definition of this function, see a good text
-<span class="lineNum">     740 </span>                :        *  such as Langer &amp; Kreft, or [27.5.2.4.5]/3-7.
-<span class="lineNum">     741 </span>                :        *
-<span class="lineNum">     742 </span>                :        *  A functioning output streambuf can be created by overriding only
-<span class="lineNum">     743 </span>                :        *  this function (no buffer area will be used).
-<span class="lineNum">     744 </span>                :        *
-<span class="lineNum">     745 </span>                :        *  @note  Base class version does nothing, returns eof().
-<span class="lineNum">     746 </span>                :       */
-<span class="lineNum">     747 </span>                :       virtual int_type 
-<span class="lineNum">     748 </span>                :       overflow(int_type /* __c */ = traits_type::eof())
-<span class="lineNum">     749 </span>                :       { return traits_type::eof(); }
-<span class="lineNum">     750 </span>                : 
-<span class="lineNum">     751 </span>                : #if _GLIBCXX_DEPRECATED
-<span class="lineNum">     752 </span>                :     // Annex D.6
-<span class="lineNum">     753 </span>                :     public:
-<span class="lineNum">     754 </span>                :       /**
-<span class="lineNum">     755 </span>                :        *  @brief  Tosses a character.
-<span class="lineNum">     756 </span>                :        *
-<span class="lineNum">     757 </span>                :        *  Advances the read pointer, ignoring the character that would have
-<span class="lineNum">     758 </span>                :        *  been read.
-<span class="lineNum">     759 </span>                :        *
-<span class="lineNum">     760 </span>                :        *  See http://gcc.gnu.org/ml/libstdc++/2002-05/msg00168.html
-<span class="lineNum">     761 </span>                :        */
-<span class="lineNum">     762 </span>                :       void 
-<span class="lineNum">     763 </span>                :       stossc() 
-<span class="lineNum">     764 </span>                :       {
-<span class="lineNum">     765 </span>                :         if (this-&gt;gptr() &lt; this-&gt;egptr()) 
-<span class="lineNum">     766 </span>                :           this-&gt;gbump(1);
-<span class="lineNum">     767 </span>                :         else 
-<span class="lineNum">     768 </span>                :           this-&gt;uflow();
-<span class="lineNum">     769 </span>                :       }
-<span class="lineNum">     770 </span>                : #endif
-<span class="lineNum">     771 </span>                : 
-<span class="lineNum">     772 </span>                :     private:
-<span class="lineNum">     773 </span>                :       // _GLIBCXX_RESOLVE_LIB_DEFECTS
-<span class="lineNum">     774 </span>                :       // Side effect of DR 50. 
-<span class="lineNum">     775 </span>                :       basic_streambuf(const __streambuf_type&amp; __sb)
-<span class="lineNum">     776 </span>                :       : _M_in_beg(__sb._M_in_beg), _M_in_cur(__sb._M_in_cur), 
-<span class="lineNum">     777 </span>                :       _M_in_end(__sb._M_in_end), _M_out_beg(__sb._M_out_beg), 
-<span class="lineNum">     778 </span>                :       _M_out_cur(__sb._M_out_cur), _M_out_end(__sb._M_out_cur),
-<span class="lineNum">     779 </span>                :       _M_buf_locale(__sb._M_buf_locale) 
-<span class="lineNum">     780 </span>                :       { }
-<span class="lineNum">     781 </span>                : 
-<span class="lineNum">     782 </span>                :       __streambuf_type&amp; 
-<span class="lineNum">     783 </span>                :       operator=(const __streambuf_type&amp;) { return *this; };
-<span class="lineNum">     784 </span>                :     };
-<span class="lineNum">     785 </span>                : 
-<span class="lineNum">     786 </span>                :   // Explicit specialization declarations, defined in src/streambuf.cc.
-<span class="lineNum">     787 </span>                :   template&lt;&gt;
-<span class="lineNum">     788 </span>                :     streamsize
-<span class="lineNum">     789 </span>                :     __copy_streambufs_eof(basic_streambuf&lt;char&gt;* __sbin,
-<span class="lineNum">     790 </span>                :                           basic_streambuf&lt;char&gt;* __sbout, bool&amp; __ineof);
-<span class="lineNum">     791 </span>                : #ifdef _GLIBCXX_USE_WCHAR_T
-<span class="lineNum">     792 </span>                :   template&lt;&gt;
-<span class="lineNum">     793 </span>                :     streamsize
-<span class="lineNum">     794 </span>                :     __copy_streambufs_eof(basic_streambuf&lt;wchar_t&gt;* __sbin,
-<span class="lineNum">     795 </span>                :                           basic_streambuf&lt;wchar_t&gt;* __sbout, bool&amp; __ineof);
-<span class="lineNum">     796 </span>                : #endif
-<span class="lineNum">     797 </span>                : 
-<span class="lineNum">     798 </span>                : _GLIBCXX_END_NAMESPACE
-<span class="lineNum">     799 </span>                : 
-<span class="lineNum">     800 </span>                : #ifndef _GLIBCXX_EXPORT_TEMPLATE
-<span class="lineNum">     801 </span>                : # include &lt;bits/streambuf.tcc&gt;
-<span class="lineNum">     802 </span>                : #endif
-<span class="lineNum">     803 </span>                : 
-<span class="lineNum">     804 </span>                : #endif /* _GLIBCXX_STREAMBUF */
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/c++/4.3/typeinfo.gcov.html b/rep/usr/include/c++/4.3/typeinfo.gcov.html
deleted file mode 100644
index de9327e..0000000
--- a/rep/usr/include/c++/4.3/typeinfo.gcov.html
+++ /dev/null
@@ -1,264 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/c++/4.3/typeinfo</title>
-  <link rel="stylesheet" type="text/css" href="../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3</a> - typeinfo</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">4</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">50.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">2</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : // RTTI support for -*- C++ -*-
-<span class="lineNum">       2 </span>                : // Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-<span class="lineNum">       3 </span>                : // 2003, 2004, 2005, 2006, 2007
-<span class="lineNum">       4 </span>                : // Free Software Foundation
-<span class="lineNum">       5 </span>                : //
-<span class="lineNum">       6 </span>                : // This file is part of GCC.
-<span class="lineNum">       7 </span>                : //
-<span class="lineNum">       8 </span>                : // GCC is free software; you can redistribute it and/or modify
-<span class="lineNum">       9 </span>                : // it under the terms of the GNU General Public License as published by
-<span class="lineNum">      10 </span>                : // the Free Software Foundation; either version 2, or (at your option)
-<span class="lineNum">      11 </span>                : // any later version.
-<span class="lineNum">      12 </span>                : // 
-<span class="lineNum">      13 </span>                : // GCC is distributed in the hope that it will be useful,
-<span class="lineNum">      14 </span>                : // but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      15 </span>                : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      16 </span>                : // GNU General Public License for more details.
-<span class="lineNum">      17 </span>                : // 
-<span class="lineNum">      18 </span>                : // You should have received a copy of the GNU General Public License
-<span class="lineNum">      19 </span>                : // along with GCC; see the file COPYING.  If not, write to
-<span class="lineNum">      20 </span>                : // the Free Software Foundation, 51 Franklin Street, Fifth Floor,
-<span class="lineNum">      21 </span>                : // Boston, MA 02110-1301, USA.
-<span class="lineNum">      22 </span>                : 
-<span class="lineNum">      23 </span>                : // As a special exception, you may use this file as part of a free software
-<span class="lineNum">      24 </span>                : // library without restriction.  Specifically, if other files instantiate
-<span class="lineNum">      25 </span>                : // templates or use macros or inline functions from this file, or you compile
-<span class="lineNum">      26 </span>                : // this file and link it with other files to produce an executable, this
-<span class="lineNum">      27 </span>                : // file does not by itself cause the resulting executable to be covered by
-<span class="lineNum">      28 </span>                : // the GNU General Public License.  This exception does not however
-<span class="lineNum">      29 </span>                : // invalidate any other reasons why the executable file might be covered by
-<span class="lineNum">      30 </span>                : // the GNU General Public License.
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span>                : /** @file typeinfo
-<span class="lineNum">      33 </span>                :  *  This is a Standard C++ Library header.
-<span class="lineNum">      34 </span>                :  */
-<span class="lineNum">      35 </span>                : 
-<span class="lineNum">      36 </span>                : #ifndef _TYPEINFO
-<span class="lineNum">      37 </span>                : #define _TYPEINFO
-<span class="lineNum">      38 </span>                : 
-<span class="lineNum">      39 </span>                : #include &lt;exception&gt;
-<span class="lineNum">      40 </span>                : 
-<span class="lineNum">      41 </span>                : #pragma GCC visibility push(default)
-<span class="lineNum">      42 </span>                : 
-<span class="lineNum">      43 </span>                : extern &quot;C++&quot; {
-<span class="lineNum">      44 </span>                : 
-<span class="lineNum">      45 </span>                : namespace __cxxabiv1
-<span class="lineNum">      46 </span>                : {
-<span class="lineNum">      47 </span>                :   class __class_type_info;
-<span class="lineNum">      48 </span>                : } // namespace __cxxabiv1
-<span class="lineNum">      49 </span>                : 
-<span class="lineNum">      50 </span>                : // Determine whether typeinfo names for the same type are merged (in which
-<span class="lineNum">      51 </span>                : // case comparison can just compare pointers) or not (in which case
-<span class="lineNum">      52 </span>                : // strings must be compared and g++.dg/abi/local1.C will fail), and
-<span class="lineNum">      53 </span>                : // whether comparison is to be implemented inline or not.  By default we
-<span class="lineNum">      54 </span>                : // use inline pointer comparison if weak symbols are available, and
-<span class="lineNum">      55 </span>                : // out-of-line strcmp if not.  Out-of-line pointer comparison is used
-<span class="lineNum">      56 </span>                : // where the object files are to be portable to multiple systems, some of
-<span class="lineNum">      57 </span>                : // which may not be able to use pointer comparison, but the particular
-<span class="lineNum">      58 </span>                : // system for which libstdc++ is being built can use pointer comparison;
-<span class="lineNum">      59 </span>                : // in particular for most ARM EABI systems, where the ABI specifies
-<span class="lineNum">      60 </span>                : // out-of-line comparison.  Inline strcmp is not currently supported.  The
-<span class="lineNum">      61 </span>                : // compiler's target configuration can override the defaults by defining
-<span class="lineNum">      62 </span>                : // __GXX_TYPEINFO_EQUALITY_INLINE to 1 or 0 to indicate whether or not
-<span class="lineNum">      63 </span>                : // comparison is inline, and __GXX_MERGED_TYPEINFO_NAMES to 1 or 0 to
-<span class="lineNum">      64 </span>                : // indicate whether or not pointer comparison can be used.
-<span class="lineNum">      65 </span>                : 
-<span class="lineNum">      66 </span>                : #ifndef __GXX_MERGED_TYPEINFO_NAMES
-<span class="lineNum">      67 </span>                :   #if !__GXX_WEAK__
-<span class="lineNum">      68 </span>                :     // If weak symbols are not supported, typeinfo names are not merged.
-<span class="lineNum">      69 </span>                :     #define __GXX_MERGED_TYPEINFO_NAMES 0
-<span class="lineNum">      70 </span>                :   #else
-<span class="lineNum">      71 </span>                :     // On platforms that support weak symbols, typeinfo names are merged.
-<span class="lineNum">      72 </span>                :     #define __GXX_MERGED_TYPEINFO_NAMES 1
-<span class="lineNum">      73 </span>                :   #endif
-<span class="lineNum">      74 </span>                : #endif
-<span class="lineNum">      75 </span>                : 
-<span class="lineNum">      76 </span>                : // By default follow the same rules as for __GXX_MERGED_TYPEINFO_NAMES.
-<span class="lineNum">      77 </span>                : #ifndef __GXX_TYPEINFO_EQUALITY_INLINE
-<span class="lineNum">      78 </span>                :   #if !__GXX_WEAK__
-<span class="lineNum">      79 </span>                :     #define __GXX_TYPEINFO_EQUALITY_INLINE 0
-<span class="lineNum">      80 </span>                :   #else
-<span class="lineNum">      81 </span>                :     #define __GXX_TYPEINFO_EQUALITY_INLINE 1
-<span class="lineNum">      82 </span>                :   #endif
-<span class="lineNum">      83 </span>                : #endif
-<span class="lineNum">      84 </span>                : 
-<span class="lineNum">      85 </span>                : namespace std 
-<span class="lineNum">      86 </span>                : {
-<span class="lineNum">      87 </span>                :   /**
-<span class="lineNum">      88 </span>                :    *  @brief  Part of RTTI.
-<span class="lineNum">      89 </span>                :    *
-<span class="lineNum">      90 </span>                :    *  The @c type_info class describes type information generated by
-<span class="lineNum">      91 </span>                :    *  an implementation.
-<span class="lineNum">      92 </span>                :   */
-<span class="lineNum">      93 </span>                :   class type_info 
-<span class="lineNum">      94 </span>                :   {
-<span class="lineNum">      95 </span>                :   public:
-<span class="lineNum">      96 </span>                :     /** Destructor first. Being the first non-inline virtual function, this
-<span class="lineNum">      97 </span>                :      *  controls in which translation unit the vtable is emitted. The
-<span class="lineNum">      98 </span>                :      *  compiler makes use of that information to know where to emit
-<span class="lineNum">      99 </span>                :      *  the runtime-mandated type_info structures in the new-abi.  */
-<span class="lineNum">     100 </span>                :     virtual ~type_info();
-<span class="lineNum">     101 </span>                : 
-<span class="lineNum">     102 </span>                :     /** Returns an @e implementation-defined byte string; this is not
-<span class="lineNum">     103 </span>                :      *  portable between compilers!  */
-<span class="lineNum">     104 </span><span class="lineCov">              2 :     const char* name() const</span>
-<span class="lineNum">     105 </span><span class="lineCov">              2 :     { return __name; }</span>
-<span class="lineNum">     106 </span>                : 
-<span class="lineNum">     107 </span>                : #if !__GXX_TYPEINFO_EQUALITY_INLINE
-<span class="lineNum">     108 </span>                :     bool before(const type_info&amp; __arg) const;
-<span class="lineNum">     109 </span>                : 
-<span class="lineNum">     110 </span>                :     // In old abi, or when weak symbols are not supported, there can
-<span class="lineNum">     111 </span>                :     // be multiple instances of a type_info object for one
-<span class="lineNum">     112 </span>                :     // type. Uniqueness must use the _name value, not object address.
-<span class="lineNum">     113 </span>                :     bool operator==(const type_info&amp; __arg) const;
-<span class="lineNum">     114 </span>                : #else
-<span class="lineNum">     115 </span>                :   #if !__GXX_MERGED_TYPEINFO_NAMES
-<span class="lineNum">     116 </span>                :     #error &quot;Inline implementation of type_info comparision requires merging of type_info objects&quot;
-<span class="lineNum">     117 </span>                :   #endif
-<span class="lineNum">     118 </span>                :     /** Returns true if @c *this precedes @c __arg in the implementation's
-<span class="lineNum">     119 </span>                :      *  collation order.  */
-<span class="lineNum">     120 </span>                :     // In new abi we can rely on type_info's NTBS being unique,
-<span class="lineNum">     121 </span>                :     // and therefore address comparisons are sufficient.
-<span class="lineNum">     122 </span><span class="lineNoCov">              0 :     bool before(const type_info&amp; __arg) const</span>
-<span class="lineNum">     123 </span><span class="lineNoCov">              0 :     { return __name &lt; __arg.__name; }</span>
-<span class="lineNum">     124 </span>                : 
-<span class="lineNum">     125 </span>                :     bool operator==(const type_info&amp; __arg) const
-<span class="lineNum">     126 </span>                :     { return __name == __arg.__name; }
-<span class="lineNum">     127 </span>                : #endif
-<span class="lineNum">     128 </span>                :     bool operator!=(const type_info&amp; __arg) const
-<span class="lineNum">     129 </span>                :     { return !operator==(__arg); }
-<span class="lineNum">     130 </span>                : 
-<span class="lineNum">     131 </span>                :     // Return true if this is a pointer type of some kind
-<span class="lineNum">     132 </span>                :     virtual bool __is_pointer_p() const;
-<span class="lineNum">     133 </span>                : 
-<span class="lineNum">     134 </span>                :     // Return true if this is a function type
-<span class="lineNum">     135 </span>                :     virtual bool __is_function_p() const;
-<span class="lineNum">     136 </span>                : 
-<span class="lineNum">     137 </span>                :     // Try and catch a thrown type. Store an adjusted pointer to the
-<span class="lineNum">     138 </span>                :     // caught type in THR_OBJ. If THR_TYPE is not a pointer type, then
-<span class="lineNum">     139 </span>                :     // THR_OBJ points to the thrown object. If THR_TYPE is a pointer
-<span class="lineNum">     140 </span>                :     // type, then THR_OBJ is the pointer itself. OUTER indicates the
-<span class="lineNum">     141 </span>                :     // number of outer pointers, and whether they were const
-<span class="lineNum">     142 </span>                :     // qualified.
-<span class="lineNum">     143 </span>                :     virtual bool __do_catch(const type_info *__thr_type, void **__thr_obj,
-<span class="lineNum">     144 </span>                :                             unsigned __outer) const;
-<span class="lineNum">     145 </span>                : 
-<span class="lineNum">     146 </span>                :     // Internally used during catch matching
-<span class="lineNum">     147 </span>                :     virtual bool __do_upcast(const __cxxabiv1::__class_type_info *__target,
-<span class="lineNum">     148 </span>                :                              void **__obj_ptr) const;
-<span class="lineNum">     149 </span>                : 
-<span class="lineNum">     150 </span>                :   protected:
-<span class="lineNum">     151 </span>                :     const char *__name;
-<span class="lineNum">     152 </span>                :     
-<span class="lineNum">     153 </span>                :     explicit type_info(const char *__n): __name(__n) { }
-<span class="lineNum">     154 </span>                :     
-<span class="lineNum">     155 </span>                :   private:
-<span class="lineNum">     156 </span>                :     /// Assigning type_info is not supported.
-<span class="lineNum">     157 </span>                :     type_info&amp; operator=(const type_info&amp;);
-<span class="lineNum">     158 </span>                :     type_info(const type_info&amp;);
-<span class="lineNum">     159 </span>                :   };
-<span class="lineNum">     160 </span>                : 
-<span class="lineNum">     161 </span>                :   /**
-<span class="lineNum">     162 </span>                :    *  @brief  Thrown during incorrect typecasting.
-<span class="lineNum">     163 </span>                :    *
-<span class="lineNum">     164 </span>                :    *  If you attempt an invalid @c dynamic_cast expression, an instance of
-<span class="lineNum">     165 </span>                :    *  this class (or something derived from this class) is thrown.  */
-<span class="lineNum">     166 </span>                :   class bad_cast : public exception 
-<span class="lineNum">     167 </span>                :   {
-<span class="lineNum">     168 </span>                :   public:
-<span class="lineNum">     169 </span>                :     bad_cast() throw() { }
-<span class="lineNum">     170 </span>                : 
-<span class="lineNum">     171 </span>                :     // This declaration is not useless:
-<span class="lineNum">     172 </span>                :     // http://gcc.gnu.org/onlinedocs/gcc-3.0.2/gcc_6.html#SEC118
-<span class="lineNum">     173 </span>                :     virtual ~bad_cast() throw();
-<span class="lineNum">     174 </span>                : 
-<span class="lineNum">     175 </span>                :     // See comment in eh_exception.cc.
-<span class="lineNum">     176 </span>                :     virtual const char* what() const throw();
-<span class="lineNum">     177 </span>                :   };
-<span class="lineNum">     178 </span>                :   
-<span class="lineNum">     179 </span>                :   /** If you use a NULL pointer in a @c typeid expression, this is thrown.  */
-<span class="lineNum">     180 </span>                :   class bad_typeid : public exception 
-<span class="lineNum">     181 </span>                :   {
-<span class="lineNum">     182 </span>                :   public:
-<span class="lineNum">     183 </span>                :     bad_typeid () throw() { }
-<span class="lineNum">     184 </span>                : 
-<span class="lineNum">     185 </span>                :     // This declaration is not useless:
-<span class="lineNum">     186 </span>                :     // http://gcc.gnu.org/onlinedocs/gcc-3.0.2/gcc_6.html#SEC118
-<span class="lineNum">     187 </span>                :     virtual ~bad_typeid() throw();
-<span class="lineNum">     188 </span>                : 
-<span class="lineNum">     189 </span>                :     // See comment in eh_exception.cc.
-<span class="lineNum">     190 </span>                :     virtual const char* what() const throw();
-<span class="lineNum">     191 </span>                :   };
-<span class="lineNum">     192 </span>                : } // namespace std
-<span class="lineNum">     193 </span>                : 
-<span class="lineNum">     194 </span>                : #pragma GCC visibility pop
-<span class="lineNum">     195 </span>                : 
-<span class="lineNum">     196 </span>                : } // extern &quot;C++&quot;
-<span class="lineNum">     197 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/TextFormat.h.gcov.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/TextFormat.h.gcov.html
deleted file mode 100644
index 040ef47..0000000
--- a/rep/usr/include/tagcoll-2.0.11/tagcoll/TextFormat.h.gcov.html
+++ /dev/null
@@ -1,261 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/TextFormat.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - <a href="index.html">usr/include/tagcoll-2.0.11/tagcoll</a> - TextFormat.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">7</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">14.3 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">1</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #ifndef TAGCOLL_TEXTFORMAT_H
-<span class="lineNum">       2 </span>                : #define TAGCOLL_TEXTFORMAT_H
-<span class="lineNum">       3 </span>                : 
-<span class="lineNum">       4 </span>                : /** \file
-<span class="lineNum">       5 </span>                :  * Serialize and deserialize a tagged collection to a text file
-<span class="lineNum">       6 </span>                :  */
-<span class="lineNum">       7 </span>                : 
-<span class="lineNum">       8 </span>                : /*
-<span class="lineNum">       9 </span>                :  * Copyright (C) 2003--2006  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">      10 </span>                :  *
-<span class="lineNum">      11 </span>                :  * This library is free software; you can redistribute it and/or
-<span class="lineNum">      12 </span>                :  * modify it under the terms of the GNU Lesser General Public
-<span class="lineNum">      13 </span>                :  * License as published by the Free Software Foundation; either
-<span class="lineNum">      14 </span>                :  * version 2.1 of the License, or (at your option) any later version.
-<span class="lineNum">      15 </span>                :  *
-<span class="lineNum">      16 </span>                :  * This library is distributed in the hope that it will be useful,
-<span class="lineNum">      17 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      18 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-<span class="lineNum">      19 </span>                :  * Lesser General Public License for more details.
-<span class="lineNum">      20 </span>                :  *
-<span class="lineNum">      21 </span>                :  * You should have received a copy of the GNU Lesser General Public
-<span class="lineNum">      22 </span>                :  * License along with this library; if not, write to the Free Software
-<span class="lineNum">      23 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
-<span class="lineNum">      24 </span>                :  */
-<span class="lineNum">      25 </span>                : 
-<span class="lineNum">      26 </span>                : #include &lt;wibble/mixin.h&gt;
-<span class="lineNum">      27 </span>                : #include &lt;wibble/empty.h&gt;
-<span class="lineNum">      28 </span>                : #include &lt;wibble/singleton.h&gt;
-<span class="lineNum">      29 </span>                : #include &lt;tagcoll/input/base.h&gt;
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : #include &lt;stdio.h&gt;
-<span class="lineNum">      32 </span>                : 
-<span class="lineNum">      33 </span>                : //#define TRACE_PARSE
-<span class="lineNum">      34 </span>                : 
-<span class="lineNum">      35 </span>                : namespace tagcoll
-<span class="lineNum">      36 </span>                : {
-<span class="lineNum">      37 </span>                : template&lt;class ITEM, class TAG&gt;
-<span class="lineNum">      38 </span>                : class PatchList;
-<span class="lineNum">      39 </span>                : template&lt;class ITEM, class TAG&gt;
-<span class="lineNum">      40 </span>                : class Patch;
-<span class="lineNum">      41 </span>                : 
-<span class="lineNum">      42 </span>                : namespace textformat
-<span class="lineNum">      43 </span>                : {
-<span class="lineNum">      44 </span>                : 
-<span class="lineNum">      45 </span>                : /**
-<span class="lineNum">      46 </span>                :  * TagcollConsumer that serializes its input to an output stream
-<span class="lineNum">      47 </span>                :  *
-<span class="lineNum">      48 </span>                :  * The format of the output is:
-<span class="lineNum">      49 </span>                :  *   lines of &quot;comma+space&quot;-separated items, followed by &quot;colon+space&quot;,
-<span class="lineNum">      50 </span>                :  *   followed by the corresponding &quot;comma+space&quot;-separated tags.
-<span class="lineNum">      51 </span>                :  * Examples:
-<span class="lineNum">      52 </span>                :  *   ITEM:
-<span class="lineNum">      53 </span>                :  *   ITEM: TAG
-<span class="lineNum">      54 </span>                :  *   ITEM: TAG1, TAG2, TAG3
-<span class="lineNum">      55 </span>                :  *   ITEM1, ITEM2, ITEM3:
-<span class="lineNum">      56 </span>                :  *   ITEM1, ITEM2, ITEM3: TAG1, TAG2, TAG3
-<span class="lineNum">      57 </span>                :  */
-<span class="lineNum">      58 </span>                : class StdioWriter : public wibble::mixin::OutputIterator&lt;StdioWriter&gt;
-<span class="lineNum">      59 </span>                : {
-<span class="lineNum">      60 </span>                : protected:
-<span class="lineNum">      61 </span>                :         FILE* out;
-<span class="lineNum">      62 </span>                : 
-<span class="lineNum">      63 </span>                : public:
-<span class="lineNum">      64 </span><span class="lineCov">              1 :         StdioWriter(FILE* out) : out(out) {}</span>
-<span class="lineNum">      65 </span>                : 
-<span class="lineNum">      66 </span>                :         template&lt;typename Items, typename Tags&gt;
-<span class="lineNum">      67 </span>                :         StdioWriter&amp; operator=(const std::pair&lt;Items, Tags&gt;&amp; data);
-<span class="lineNum">      68 </span>                : };
-<span class="lineNum">      69 </span>                : 
-<span class="lineNum">      70 </span>                : class OstreamWriter : public wibble::mixin::OutputIterator&lt;OstreamWriter&gt;
-<span class="lineNum">      71 </span>                : {
-<span class="lineNum">      72 </span>                : protected:
-<span class="lineNum">      73 </span>                :         std::ostream&amp; out;
-<span class="lineNum">      74 </span>                : 
-<span class="lineNum">      75 </span>                : public:
-<span class="lineNum">      76 </span>                :         OstreamWriter(std::ostream&amp; out) : out(out) {}
-<span class="lineNum">      77 </span>                : 
-<span class="lineNum">      78 </span>                :         template&lt;typename Items, typename Tags&gt;
-<span class="lineNum">      79 </span>                :         OstreamWriter&amp; operator=(const std::pair&lt;Items, Tags&gt;&amp; data);
-<span class="lineNum">      80 </span>                : };
-<span class="lineNum">      81 </span>                : 
-<span class="lineNum">      82 </span>                : /**
-<span class="lineNum">      83 </span>                :  * Parse an element from input
-<span class="lineNum">      84 </span>                :  *
-<span class="lineNum">      85 </span>                :  * @retval item
-<span class="lineNum">      86 </span>                :  *   The item found on input
-<span class="lineNum">      87 </span>                :  * @return
-<span class="lineNum">      88 </span>                :  *   the trailing separating char, that can be:
-<span class="lineNum">      89 </span>                :  *   \li input::Input::Eof
-<span class="lineNum">      90 </span>                :  *   \li '\n'
-<span class="lineNum">      91 </span>                :  *   \li ':'
-<span class="lineNum">      92 </span>                :  *   \li ','
-<span class="lineNum">      93 </span>                :  */
-<span class="lineNum">      94 </span>                : int parseElement(input::Input&amp; in, std::string&amp; item);
-<span class="lineNum">      95 </span>                : 
-<span class="lineNum">      96 </span>                : 
-<span class="lineNum">      97 </span>                : /**
-<span class="lineNum">      98 </span>                :  * Serialize a patch
-<span class="lineNum">      99 </span>                :  */
-<span class="lineNum">     100 </span>                : template&lt;typename ITEM, typename TAG, typename ITEMSER, typename TAGSER&gt;
-<span class="lineNum">     101 </span>                : void outputPatch(
-<span class="lineNum">     102 </span>                :                 ITEMSER&amp; itemconv,
-<span class="lineNum">     103 </span>                :                 TAGSER&amp; tagconv,
-<span class="lineNum">     104 </span>                :                 const PatchList&lt;ITEM, TAG&gt;&amp; patch,
-<span class="lineNum">     105 </span>                :                 FILE* out);
-<span class="lineNum">     106 </span>                : 
-<span class="lineNum">     107 </span>                : void outputPatch(
-<span class="lineNum">     108 </span>                :                 const PatchList&lt;std::string, std::string&gt;&amp; patch,
-<span class="lineNum">     109 </span>                :                 FILE* out);
-<span class="lineNum">     110 </span>                : 
-<span class="lineNum">     111 </span>                : 
-<span class="lineNum">     112 </span>                : /*
-<span class="lineNum">     113 </span>                :  * Parse a tagged collection, sending the results to out.
-<span class="lineNum">     114 </span>                :  *
-<span class="lineNum">     115 </span>                :  * @param out
-<span class="lineNum">     116 </span>                :  *   An output iterator accepting a std::pair&lt;string, string&gt;
-<span class="lineNum">     117 </span>                :  */
-<span class="lineNum">     118 </span>                : template&lt;typename OUT&gt;
-<span class="lineNum">     119 </span>                : void parse(input::Input&amp; in, OUT out);
-<span class="lineNum">     120 </span>                : 
-<span class="lineNum">     121 </span>                : /**
-<span class="lineNum">     122 </span>                :  * Assemble a patch from a stream of &quot;item: +added, -removed&quot; items and tags
-<span class="lineNum">     123 </span>                :  */
-<span class="lineNum">     124 </span>                : template&lt;typename OUT&gt;
-<span class="lineNum">     125 </span>                : class PatchAssembler : public wibble::mixin::OutputIterator&lt; PatchAssembler&lt;OUT&gt; &gt;
-<span class="lineNum">     126 </span>                : {
-<span class="lineNum">     127 </span>                :         OUT out;
-<span class="lineNum">     128 </span>                : public:
-<span class="lineNum">     129 </span><span class="lineNoCov">              0 :         PatchAssembler(const OUT&amp; out) : out(out) {}</span>
-<span class="lineNum">     130 </span>                : 
-<span class="lineNum">     131 </span>                :         template&lt;typename ITEMS, typename TAGS&gt;
-<span class="lineNum">     132 </span>                :         PatchAssembler&amp; operator=(const std::pair&lt;ITEMS, TAGS&gt;&amp; data);
-<span class="lineNum">     133 </span>                : };
-<span class="lineNum">     134 </span>                : 
-<span class="lineNum">     135 </span>                : template&lt;typename OUT&gt;
-<span class="lineNum">     136 </span><span class="lineNoCov">              0 : PatchAssembler&lt;OUT&gt; patchAssembler(const OUT&amp; out)</span>
-<span class="lineNum">     137 </span>                : {
-<span class="lineNum">     138 </span><span class="lineNoCov">              0 :         return PatchAssembler&lt;OUT&gt;(out);</span>
-<span class="lineNum">     139 </span>                : }
-<span class="lineNum">     140 </span>                : 
-<span class="lineNum">     141 </span>                : template&lt;typename OUT&gt;
-<span class="lineNum">     142 </span><span class="lineNoCov">              0 : void parsePatch(input::Input&amp; in, OUT out)</span>
-<span class="lineNum">     143 </span>                : {
-<span class="lineNum">     144 </span><span class="lineNoCov">              0 :         parse(in, patchAssembler(out));</span>
-<span class="lineNum">     145 </span><span class="lineNoCov">              0 : }</span>
-<span class="lineNum">     146 </span>                : 
-<span class="lineNum">     147 </span>                : /**
-<span class="lineNum">     148 </span>                :  * Parse a tagcoll patch
-<span class="lineNum">     149 </span>                :  */
-<span class="lineNum">     150 </span>                : template&lt;typename ITEM, typename TAG, typename ITEMSER, typename TAGSER&gt;
-<span class="lineNum">     151 </span>                : PatchList&lt;ITEM, TAG&gt; parsePatch(
-<span class="lineNum">     152 </span>                :                 ITEMSER&amp; itemconv,
-<span class="lineNum">     153 </span>                :                 TAGSER&amp; tagconv,
-<span class="lineNum">     154 </span>                :                 input::Input&amp; in);
-<span class="lineNum">     155 </span>                : 
-<span class="lineNum">     156 </span>                : PatchList&lt;std::string, std::string&gt; parsePatch(input::Input&amp; in);
-<span class="lineNum">     157 </span>                : 
-<span class="lineNum">     158 </span>                : 
-<span class="lineNum">     159 </span>                : 
-<span class="lineNum">     160 </span>                : template&lt;typename ITEM, typename TAG, typename ITEMSER, typename TAGSER&gt;
-<span class="lineNum">     161 </span>                : class PatchBuilder : public wibble::mixin::OutputIterator&lt; PatchBuilder&lt;ITEM, TAG, ITEMSER, TAGSER&gt; &gt;
-<span class="lineNum">     162 </span>                : {
-<span class="lineNum">     163 </span>                : protected:
-<span class="lineNum">     164 </span>                :         PatchList&lt;ITEM, TAG&gt;&amp; patch;
-<span class="lineNum">     165 </span>                :         const ITEMSER&amp; itemconv;
-<span class="lineNum">     166 </span>                :         const TAGSER&amp; tagconv;
-<span class="lineNum">     167 </span>                : 
-<span class="lineNum">     168 </span>                : public:
-<span class="lineNum">     169 </span>                :         PatchBuilder(
-<span class="lineNum">     170 </span>                :                         PatchList&lt;ITEM, TAG&gt;&amp; patch,
-<span class="lineNum">     171 </span>                :                         const ITEMSER&amp; itemconv,
-<span class="lineNum">     172 </span>                :                         const TAGSER&amp; tagconv)
-<span class="lineNum">     173 </span>                :                 : patch(patch), itemconv(itemconv), tagconv(tagconv) {}
-<span class="lineNum">     174 </span>                : 
-<span class="lineNum">     175 </span>                :         template&lt;typename ITEMS, typename TAGS&gt;
-<span class="lineNum">     176 </span>                :         PatchBuilder&lt;ITEM, TAG, ITEMSER, TAGSER&gt;&amp; operator=(const std::pair&lt;ITEMS, TAGS&gt;&amp; data);
-<span class="lineNum">     177 </span>                : 
-<span class="lineNum">     178 </span>                :         const PatchList&lt;ITEM, TAG&gt;&amp; getPatch() const throw () { return patch; }
-<span class="lineNum">     179 </span>                : };
-<span class="lineNum">     180 </span>                : 
-<span class="lineNum">     181 </span>                : template&lt;typename ITEM, typename TAG, typename ITEMSER, typename TAGSER&gt;
-<span class="lineNum">     182 </span>                : PatchBuilder&lt;ITEM, TAG, ITEMSER, TAGSER&gt; patchBuilder(
-<span class="lineNum">     183 </span>                :                         PatchList&lt;ITEM, TAG&gt;&amp; patch,
-<span class="lineNum">     184 </span>                :                         const ITEMSER&amp; itemconv,
-<span class="lineNum">     185 </span>                :                         const TAGSER&amp; tagconv)
-<span class="lineNum">     186 </span>                : {
-<span class="lineNum">     187 </span>                :         return PatchBuilder&lt;ITEM, TAG, ITEMSER, TAGSER&gt;(patch, itemconv, tagconv);
-<span class="lineNum">     188 </span>                : }
-<span class="lineNum">     189 </span>                : 
-<span class="lineNum">     190 </span>                : }
-<span class="lineNum">     191 </span>                : }
-<span class="lineNum">     192 </span>                : 
-<span class="lineNum">     193 </span>                : // vim:set ts=4 sw=4:
-<span class="lineNum">     194 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/TextFormat.tcc.gcov.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/TextFormat.tcc.gcov.html
deleted file mode 100644
index 3b6b659..0000000
--- a/rep/usr/include/tagcoll-2.0.11/tagcoll/TextFormat.tcc.gcov.html
+++ /dev/null
@@ -1,357 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/TextFormat.tcc</title>
-  <link rel="stylesheet" type="text/css" href="../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - <a href="index.html">usr/include/tagcoll-2.0.11/tagcoll</a> - TextFormat.tcc</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">79</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">54.4 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">43</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /*
-<span class="lineNum">       2 </span>                :  * Serialize a tagged collection to a text file
-<span class="lineNum">       3 </span>                :  *
-<span class="lineNum">       4 </span>                :  * Copyright (C) 2003--2008  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">       5 </span>                :  *
-<span class="lineNum">       6 </span>                :  * This library is free software; you can redistribute it and/or
-<span class="lineNum">       7 </span>                :  * modify it under the terms of the GNU Lesser General Public
-<span class="lineNum">       8 </span>                :  * License as published by the Free Software Foundation; either
-<span class="lineNum">       9 </span>                :  * version 2.1 of the License, or (at your option) any later version.
-<span class="lineNum">      10 </span>                :  *
-<span class="lineNum">      11 </span>                :  * This library is distributed in the hope that it will be useful,
-<span class="lineNum">      12 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      13 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-<span class="lineNum">      14 </span>                :  * Lesser General Public License for more details.
-<span class="lineNum">      15 </span>                :  *
-<span class="lineNum">      16 </span>                :  * You should have received a copy of the GNU Lesser General Public
-<span class="lineNum">      17 </span>                :  * License along with this library; if not, write to the Free Software
-<span class="lineNum">      18 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
-<span class="lineNum">      19 </span>                :  */
-<span class="lineNum">      20 </span>                : 
-<span class="lineNum">      21 </span>                : #ifndef TAGCOLL_TEXTFORMAT_TCC
-<span class="lineNum">      22 </span>                : #define TAGCOLL_TEXTFORMAT_TCC
-<span class="lineNum">      23 </span>                : 
-<span class="lineNum">      24 </span>                : #include &lt;tagcoll/TextFormat.h&gt;
-<span class="lineNum">      25 </span>                : #include &lt;tagcoll/patch.h&gt;
-<span class="lineNum">      26 </span>                : 
-<span class="lineNum">      27 </span>                : #include &lt;wibble/exception.h&gt;
-<span class="lineNum">      28 </span>                : #include &lt;wibble/empty.h&gt;
-<span class="lineNum">      29 </span>                : #include &lt;wibble/operators.h&gt;
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : #include &lt;ostream&gt;
-<span class="lineNum">      32 </span>                : 
-<span class="lineNum">      33 </span>                : using namespace std;
-<span class="lineNum">      34 </span>                : using namespace wibble;
-<span class="lineNum">      35 </span>                : using namespace wibble::operators;
-<span class="lineNum">      36 </span>                : 
-<span class="lineNum">      37 </span><span class="lineNoCov">              0 : static void printTagset(const std::set&lt;string&gt;&amp; ts, FILE* out)</span>
-<span class="lineNum">      38 </span>                : {
-<span class="lineNum">      39 </span><span class="lineNoCov">              0 :         for (std::set&lt;string&gt;::const_iterator i = ts.begin();</span>
-<span class="lineNum">      40 </span>                :                         i != ts.end(); i++)
-<span class="lineNum">      41 </span><span class="lineNoCov">              0 :                 if (i == ts.begin())</span>
-<span class="lineNum">      42 </span>                :                 {
-<span class="lineNum">      43 </span><span class="lineNoCov">              0 :                         if (fprintf(out, &quot;%s&quot;, i-&gt;c_str()) &lt; 0)</span>
-<span class="lineNum">      44 </span><span class="lineNoCov">              0 :                                 throw wibble::exception::System(&quot;writing tagset&quot;);</span>
-<span class="lineNum">      45 </span>                :                 }
-<span class="lineNum">      46 </span>                :                 else
-<span class="lineNum">      47 </span>                :                 {
-<span class="lineNum">      48 </span><span class="lineNoCov">              0 :                         if (fprintf(out, &quot;, %s&quot;, i-&gt;c_str()) &lt; 0)</span>
-<span class="lineNum">      49 </span><span class="lineNoCov">              0 :                                 throw wibble::exception::System(&quot;writing tagset&quot;);</span>
-<span class="lineNum">      50 </span>                :                 }
-<span class="lineNum">      51 </span><span class="lineNoCov">              0 : }</span>
-<span class="lineNum">      52 </span>                : 
-<span class="lineNum">      53 </span>                : namespace tagcoll {
-<span class="lineNum">      54 </span>                : namespace textformat {
-<span class="lineNum">      55 </span>                : 
-<span class="lineNum">      56 </span><span class="lineCov">         126871 : inline static void outString(const std::string&amp; str, FILE* out, const char* what)</span>
-<span class="lineNum">      57 </span>                : {
-<span class="lineNum">      58 </span><span class="lineCov">         126871 :         if (fwrite(str.data(), str.size(), 1, out) != 1)</span>
-<span class="lineNum">      59 </span><span class="lineNoCov">              0 :                 throw wibble::exception::System(string(&quot;writing &quot;) + what);</span>
-<span class="lineNum">      60 </span><span class="lineCov">         126871 : }</span>
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span>                : template&lt;typename Items, typename Tags&gt;
-<span class="lineNum">      63 </span><span class="lineCov">          21145 : StdioWriter&amp; StdioWriter::operator=(const std::pair&lt;Items, Tags&gt;&amp; data)</span>
-<span class="lineNum">      64 </span>                : {
-<span class="lineNum">      65 </span><span class="lineCov">          42290 :         for (typename Items::const_iterator i = data.first.begin();</span>
-<span class="lineNum">      66 </span>                :                         i != data.first.end(); ++i)
-<span class="lineNum">      67 </span>                :         {
-<span class="lineNum">      68 </span><span class="lineCov">          21145 :                 if (i != data.first.begin())</span>
-<span class="lineNum">      69 </span><span class="lineNoCov">              0 :                         if (fputs(&quot;, &quot;, out) == EOF)</span>
-<span class="lineNum">      70 </span><span class="lineNoCov">              0 :                                 throw wibble::exception::System(&quot;writing comma after item&quot;);</span>
-<span class="lineNum">      71 </span><span class="lineCov">          21145 :                 outString(*i, out, &quot;item&quot;);</span>
-<span class="lineNum">      72 </span>                :         }
-<span class="lineNum">      73 </span><span class="lineCov">          21145 :         if (data.second.begin() != data.second.end())</span>
-<span class="lineNum">      74 </span>                :         {
-<span class="lineNum">      75 </span><span class="lineCov">          21145 :                 if (fputs(&quot;: &quot;, out) == EOF)</span>
-<span class="lineNum">      76 </span><span class="lineNoCov">              0 :                         throw wibble::exception::System(&quot;writing colon after items&quot;);</span>
-<span class="lineNum">      77 </span><span class="lineCov">         126871 :                 for (typename Tags::const_iterator i = data.second.begin();</span>
-<span class="lineNum">      78 </span>                :                                 i != data.second.end(); ++i)
-<span class="lineNum">      79 </span>                :                 {
-<span class="lineNum">      80 </span><span class="lineCov">         105726 :                         if (i != data.second.begin())</span>
-<span class="lineNum">      81 </span><span class="lineCov">          84581 :                                 if (fputs(&quot;, &quot;, out) == EOF)</span>
-<span class="lineNum">      82 </span><span class="lineNoCov">              0 :                                         throw wibble::exception::System(&quot;writing comma after tag&quot;);</span>
-<span class="lineNum">      83 </span><span class="lineCov">         105726 :                         outString(*i, out, &quot;tag&quot;);</span>
-<span class="lineNum">      84 </span>                :                 }
-<span class="lineNum">      85 </span>                :         }
-<span class="lineNum">      86 </span><span class="lineCov">          21145 :         if (fputc('\n', out) == EOF)</span>
-<span class="lineNum">      87 </span><span class="lineNoCov">              0 :                 throw wibble::exception::System(&quot;writing newline after tagset&quot;);</span>
-<span class="lineNum">      88 </span><span class="lineCov">          21145 :         return *this;</span>
-<span class="lineNum">      89 </span>                : }
-<span class="lineNum">      90 </span>                : 
-<span class="lineNum">      91 </span>                : template&lt;typename Items, typename Tags&gt;
-<span class="lineNum">      92 </span>                : OstreamWriter&amp; OstreamWriter::operator=(const std::pair&lt;Items, Tags&gt;&amp; data)
-<span class="lineNum">      93 </span>                : {
-<span class="lineNum">      94 </span>                :         for (typename Items::const_iterator i = data.first.begin();
-<span class="lineNum">      95 </span>                :                         i != data.first.end(); ++i)
-<span class="lineNum">      96 </span>                :         {
-<span class="lineNum">      97 </span>                :                 if (i != data.first.begin())
-<span class="lineNum">      98 </span>                :                         out &lt;&lt; &quot;, &quot;;
-<span class="lineNum">      99 </span>                :                 out &lt;&lt; *i;
-<span class="lineNum">     100 </span>                :         }
-<span class="lineNum">     101 </span>                :         if (data.second.begin() != data.second.end())
-<span class="lineNum">     102 </span>                :         {
-<span class="lineNum">     103 </span>                :                 out &lt;&lt; &quot;: &quot;;
-<span class="lineNum">     104 </span>                :                 for (typename Tags::const_iterator i = data.second.begin();
-<span class="lineNum">     105 </span>                :                                 i != data.second.end(); ++i)
-<span class="lineNum">     106 </span>                :                 {
-<span class="lineNum">     107 </span>                :                         if (i != data.second.begin())
-<span class="lineNum">     108 </span>                :                                 out &lt;&lt; &quot;, &quot;;
-<span class="lineNum">     109 </span>                :                         out &lt;&lt; *i;
-<span class="lineNum">     110 </span>                :                 }
-<span class="lineNum">     111 </span>                :         }
-<span class="lineNum">     112 </span>                :         out &lt;&lt; endl;
-<span class="lineNum">     113 </span>                :         return *this;
-<span class="lineNum">     114 </span>                : }
-<span class="lineNum">     115 </span>                : 
-<span class="lineNum">     116 </span>                : 
-<span class="lineNum">     117 </span>                : 
-<span class="lineNum">     118 </span>                : // item1, item2, item3: tag1, tag2, tag3
-<span class="lineNum">     119 </span>                : 
-<span class="lineNum">     120 </span>                : //#define TRACE_PARSE
-<span class="lineNum">     121 </span>                : template&lt;typename OUT&gt;
-<span class="lineNum">     122 </span><span class="lineCov">              2 : void parse(input::Input&amp; in, OUT out)</span>
-<span class="lineNum">     123 </span>                : {
-<span class="lineNum">     124 </span><span class="lineCov">              2 :         string item;</span>
-<span class="lineNum">     125 </span>                : 
-<span class="lineNum">     126 </span><span class="lineCov">              2 :         std::set&lt;string&gt; itemset;</span>
-<span class="lineNum">     127 </span><span class="lineCov">              2 :         std::set&lt;string&gt; tagset;</span>
-<span class="lineNum">     128 </span>                :         int sep;
-<span class="lineNum">     129 </span><span class="lineCov">              2 :         enum {ITEMS, TAGS} state = ITEMS;</span>
-<span class="lineNum">     130 </span><span class="lineCov">              2 :         int line = 1;</span>
-<span class="lineNum">     131 </span><span class="lineCov">         253744 :         do</span>
-<span class="lineNum">     132 </span>                :         {
-<span class="lineNum">     133 </span>                :                 try {
-<span class="lineNum">     134 </span><span class="lineCov">         253744 :                         sep = parseElement(in, item);</span>
-<span class="lineNum">     135 </span><span class="lineNoCov">              0 :                 } catch (tagcoll::exception::Parser&amp; e) {</span>
-<span class="lineNum">     136 </span>                :                         // Add the line number and propagate
-<span class="lineNum">     137 </span><span class="lineNoCov">              0 :                         e.line(line);</span>
-<span class="lineNum">     138 </span><span class="lineNoCov">              0 :                         throw e;</span>
-<span class="lineNum">     139 </span>                :                 }
-<span class="lineNum">     140 </span>                :                 
-<span class="lineNum">     141 </span><span class="lineCov">         507488 :                 if (item.size() != 0)</span>
-<span class="lineNum">     142 </span>                :                 {
-<span class="lineNum">     143 </span><span class="lineCov">         253742 :                         if (state == ITEMS)</span>
-<span class="lineNum">     144 </span><span class="lineCov">          42290 :                                 itemset |= item;</span>
-<span class="lineNum">     145 </span>                :                         else
-<span class="lineNum">     146 </span><span class="lineCov">         211452 :                                 tagset |= item;</span>
-<span class="lineNum">     147 </span>                :                 }
-<span class="lineNum">     148 </span>                :                 
-<span class="lineNum">     149 </span><span class="lineCov">         253744 :                 switch (sep)</span>
-<span class="lineNum">     150 </span>                :                 {
-<span class="lineNum">     151 </span>                :                         case '\n':
-<span class="lineNum">     152 </span><span class="lineCov">          42290 :                                 line++;</span>
-<span class="lineNum">     153 </span>                :                         case input::Input::Eof:
-<span class="lineNum">     154 </span><span class="lineCov">          42292 :                                 if (!(itemset.empty() &amp;&amp; tagset.empty()))</span>
-<span class="lineNum">     155 </span>                :                                 {
-<span class="lineNum">     156 </span><span class="lineCov">          42290 :                                         if (itemset.empty())</span>
-<span class="lineNum">     157 </span><span class="lineNoCov">              0 :                                                 throw tagcoll::exception::Input(line, &quot;no elements before `:' separator&quot;);</span>
-<span class="lineNum">     158 </span><span class="lineCov">          42290 :                                         if (tagset.empty())</span>
-<span class="lineNum">     159 </span><span class="lineNoCov">              0 :                                                 *out = make_pair(itemset, wibble::Empty&lt;std::string&gt;());</span>
-<span class="lineNum">     160 </span>                :                                         else
-<span class="lineNum">     161 </span><span class="lineCov">          42290 :                                                 *out = make_pair(itemset, tagset);</span>
-<span class="lineNum">     162 </span><span class="lineCov">          42290 :                                         ++out;</span>
-<span class="lineNum">     163 </span>                :                                 }
-<span class="lineNum">     164 </span><span class="lineCov">          42292 :                                 itemset.clear();</span>
-<span class="lineNum">     165 </span><span class="lineCov">          42292 :                                 tagset.clear();</span>
-<span class="lineNum">     166 </span><span class="lineCov">          42292 :                                 state = ITEMS;</span>
-<span class="lineNum">     167 </span><span class="lineCov">          42292 :                                 break;</span>
-<span class="lineNum">     168 </span>                :                         case ':':
-<span class="lineNum">     169 </span><span class="lineCov">          42290 :                                 if (state == TAGS)</span>
-<span class="lineNum">     170 </span><span class="lineNoCov">              0 :                                         throw tagcoll::exception::Input(line, &quot;separator `:' appears twice&quot;);</span>
-<span class="lineNum">     171 </span><span class="lineCov">          42290 :                                 state = TAGS;</span>
-<span class="lineNum">     172 </span>                :                                 break;
-<span class="lineNum">     173 </span>                :                         default:
-<span class="lineNum">     174 </span><span class="lineCov">              2 :                                 break;</span>
-<span class="lineNum">     175 </span>                :                 }
-<span class="lineNum">     176 </span>                :         } while (sep != input::Input::Eof);
-<span class="lineNum">     177 </span><span class="lineCov">              2 : }</span>
-<span class="lineNum">     178 </span>                : 
-<span class="lineNum">     179 </span>                : template&lt;typename OUT&gt; template&lt;typename ITEMS, typename TAGS&gt;
-<span class="lineNum">     180 </span><span class="lineNoCov">              0 : PatchAssembler&lt;OUT&gt;&amp; PatchAssembler&lt;OUT&gt;::operator=(const std::pair&lt;ITEMS, TAGS&gt;&amp; data)</span>
-<span class="lineNum">     181 </span>                : {
-<span class="lineNum">     182 </span><span class="lineNoCov">              0 :         std::set&lt;std::string&gt; added;</span>
-<span class="lineNum">     183 </span><span class="lineNoCov">              0 :         std::set&lt;std::string&gt; removed;</span>
-<span class="lineNum">     184 </span>                : 
-<span class="lineNum">     185 </span><span class="lineNoCov">              0 :         for (typename TAGS::const_iterator i = data.second.begin();</span>
-<span class="lineNum">     186 </span>                :                         i != data.second.end(); ++i)
-<span class="lineNum">     187 </span>                :         {
-<span class="lineNum">     188 </span><span class="lineNoCov">              0 :                 std::string tag = i-&gt;substr(1);</span>
-<span class="lineNum">     189 </span><span class="lineNoCov">              0 :                 if (!tag.empty())</span>
-<span class="lineNum">     190 </span>                :                 {
-<span class="lineNum">     191 </span><span class="lineNoCov">              0 :                         if ((*i)[0] == '-')</span>
-<span class="lineNum">     192 </span><span class="lineNoCov">              0 :                                 removed.insert(tag);</span>
-<span class="lineNum">     193 </span><span class="lineNoCov">              0 :                         else if ((*i)[0] == '+')</span>
-<span class="lineNum">     194 </span><span class="lineNoCov">              0 :                                 added.insert(tag);</span>
-<span class="lineNum">     195 </span>                :                 }
-<span class="lineNum">     196 </span>                :         }
-<span class="lineNum">     197 </span>                : 
-<span class="lineNum">     198 </span><span class="lineNoCov">              0 :         for (typename ITEMS::const_iterator i = data.first.begin();</span>
-<span class="lineNum">     199 </span>                :                         i != data.first.end(); ++i)
-<span class="lineNum">     200 </span>                :         {
-<span class="lineNum">     201 </span><span class="lineNoCov">              0 :                 std::string it = *i;</span>
-<span class="lineNum">     202 </span><span class="lineNoCov">              0 :                 if (!it.empty())</span>
-<span class="lineNum">     203 </span>                :                 {
-<span class="lineNum">     204 </span><span class="lineNoCov">              0 :                         *out = Patch&lt;std::string, std::string&gt;(it, added, removed);</span>
-<span class="lineNum">     205 </span><span class="lineNoCov">              0 :                         ++out;</span>
-<span class="lineNum">     206 </span>                :                 }
-<span class="lineNum">     207 </span>                :         }
-<span class="lineNum">     208 </span><span class="lineNoCov">              0 :         return *this;</span>
-<span class="lineNum">     209 </span>                : }
-<span class="lineNum">     210 </span>                : 
-<span class="lineNum">     211 </span>                : 
-<span class="lineNum">     212 </span>                : 
-<span class="lineNum">     213 </span>                : template&lt;typename ITEM, typename TAG, typename ITEMSER, typename TAGSER&gt;
-<span class="lineNum">     214 </span>                : void outputPatch(
-<span class="lineNum">     215 </span>                :                 ITEMSER&amp; itemconv,
-<span class="lineNum">     216 </span>                :                 TAGSER&amp; tagconv,
-<span class="lineNum">     217 </span>                :                 const PatchList&lt;ITEM, TAG&gt;&amp; patch,
-<span class="lineNum">     218 </span>                :                 FILE* out)
-<span class="lineNum">     219 </span>                : {
-<span class="lineNum">     220 </span>                :         for (typename PatchList&lt;ITEM, TAG&gt;::const_iterator i = patch.begin();
-<span class="lineNum">     221 </span>                :                         i != patch.end(); i++)
-<span class="lineNum">     222 </span>                :         {
-<span class="lineNum">     223 </span>                :                 string sitem = itemconv(i-&gt;first);
-<span class="lineNum">     224 </span>                :                 if (fprintf(out, &quot;%s: &quot;, sitem.c_str()) &lt; 0)
-<span class="lineNum">     225 </span>                :                         throw wibble::exception::System(&quot;writing item&quot;);
-<span class="lineNum">     226 </span>                : 
-<span class="lineNum">     227 </span>                :                 std::set&lt;string&gt; stags;
-<span class="lineNum">     228 </span>                :                 for (typename std::set&lt;TAG&gt;::const_iterator j = i-&gt;second.added.begin();
-<span class="lineNum">     229 </span>                :                                 j != i-&gt;second.added.end(); j++)
-<span class="lineNum">     230 </span>                :                         stags |= &quot;+&quot;+tagconv(*j);
-<span class="lineNum">     231 </span>                :                 for (typename std::set&lt;TAG&gt;::const_iterator j = i-&gt;second.removed.begin();
-<span class="lineNum">     232 </span>                :                                 j != i-&gt;second.removed.end(); j++)
-<span class="lineNum">     233 </span>                :                         stags |= &quot;-&quot;+tagconv(*j);
-<span class="lineNum">     234 </span>                : 
-<span class="lineNum">     235 </span>                :                 printTagset(stags, out);
-<span class="lineNum">     236 </span>                :                 if (fprintf(out, &quot;\n&quot;) &lt; 0)
-<span class="lineNum">     237 </span>                :                         throw wibble::exception::System(&quot;writing newline after tagset&quot;);
-<span class="lineNum">     238 </span>                :         }
-<span class="lineNum">     239 </span>                : }
-<span class="lineNum">     240 </span>                : 
-<span class="lineNum">     241 </span>                : template&lt;typename ITEM, typename TAG, typename ITEMSER, typename TAGSER&gt;
-<span class="lineNum">     242 </span>                : template&lt;typename ITEMS, typename TAGS&gt;
-<span class="lineNum">     243 </span>                : PatchBuilder&lt;ITEM, TAG, ITEMSER, TAGSER&gt;&amp; PatchBuilder&lt;ITEM, TAG, ITEMSER, TAGSER&gt;::operator=(const std::pair&lt;ITEMS, TAGS&gt;&amp; data)
-<span class="lineNum">     244 </span>                : {
-<span class="lineNum">     245 </span>                :         std::set&lt;TAG&gt; added;
-<span class="lineNum">     246 </span>                :         std::set&lt;TAG&gt; removed;
-<span class="lineNum">     247 </span>                : 
-<span class="lineNum">     248 </span>                :         for (typename TAGS::const_iterator i = data.second.begin();
-<span class="lineNum">     249 </span>                :                         i != data.second.end(); ++i)
-<span class="lineNum">     250 </span>                :         {
-<span class="lineNum">     251 </span>                :                 TAG tag = tagconv(i-&gt;substr(1));
-<span class="lineNum">     252 </span>                :                 if (tag != TAG())
-<span class="lineNum">     253 </span>                :                 {
-<span class="lineNum">     254 </span>                :                         if ((*i)[0] == '-')
-<span class="lineNum">     255 </span>                :                                 removed.insert(tag);
-<span class="lineNum">     256 </span>                :                         else if ((*i)[0] == '+')
-<span class="lineNum">     257 </span>                :                                 added.insert(tag);
-<span class="lineNum">     258 </span>                :                 }
-<span class="lineNum">     259 </span>                :         }
-<span class="lineNum">     260 </span>                : 
-<span class="lineNum">     261 </span>                :         for (typename ITEMS::const_iterator i = data.first.begin();
-<span class="lineNum">     262 </span>                :                         i != data.first.end(); ++i)
-<span class="lineNum">     263 </span>                :         {
-<span class="lineNum">     264 </span>                :                 ITEM it = itemconv(*i);
-<span class="lineNum">     265 </span>                :                 if (it != ITEM())
-<span class="lineNum">     266 </span>                :                         patch.addPatch(Patch&lt;ITEM, TAG&gt;(it, added, removed));
-<span class="lineNum">     267 </span>                :         }
-<span class="lineNum">     268 </span>                :         return *this;
-<span class="lineNum">     269 </span>                : }
-<span class="lineNum">     270 </span>                : 
-<span class="lineNum">     271 </span>                : 
-<span class="lineNum">     272 </span>                : template&lt;typename ITEM, typename TAG, typename ITEMSER, typename TAGSER&gt;
-<span class="lineNum">     273 </span>                : PatchList&lt;ITEM, TAG&gt; parsePatch(
-<span class="lineNum">     274 </span>                :                 ITEMSER&amp; itemconv,
-<span class="lineNum">     275 </span>                :                 TAGSER&amp; tagconv,
-<span class="lineNum">     276 </span>                :                 input::Input&amp; in)
-<span class="lineNum">     277 </span>                : {
-<span class="lineNum">     278 </span>                :         PatchList&lt;ITEM, TAG&gt; patch;
-<span class="lineNum">     279 </span>                :         parse(in, patchBuilder(patch, itemconv, tagconv));
-<span class="lineNum">     280 </span>                :         return patch;
-<span class="lineNum">     281 </span>                : }
-<span class="lineNum">     282 </span>                : 
-<span class="lineNum">     283 </span>                : }
-<span class="lineNum">     284 </span><span class="lineCov">              6 : }</span>
-<span class="lineNum">     285 </span>                : 
-<span class="lineNum">     286 </span>                : #include &lt;tagcoll/patch.tcc&gt;
-<span class="lineNum">     287 </span>                : 
-<span class="lineNum">     288 </span>                : #endif
-<span class="lineNum">     289 </span>                : 
-<span class="lineNum">     290 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/base.h.gcov.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/base.h.gcov.html
deleted file mode 100644
index 99bba0c..0000000
--- a/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/base.h.gcov.html
+++ /dev/null
@@ -1,400 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/coll/base.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/tagcoll-2.0.11/tagcoll/coll</a> - base.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">11</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">11</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #ifndef TAGCOLL_COLL_BASE_H
-<span class="lineNum">       2 </span>                : #define TAGCOLL_COLL_BASE_H
-<span class="lineNum">       3 </span>                : 
-<span class="lineNum">       4 </span>                : /** \file
-<span class="lineNum">       5 </span>                :  * Base mixins for tagged collections
-<span class="lineNum">       6 </span>                :  */
-<span class="lineNum">       7 </span>                : 
-<span class="lineNum">       8 </span>                : /*
-<span class="lineNum">       9 </span>                :  * Copyright (C) 2003,2004,2005,2006  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">      10 </span>                :  *
-<span class="lineNum">      11 </span>                :  * This library is free software; you can redistribute it and/or
-<span class="lineNum">      12 </span>                :  * modify it under the terms of the GNU Lesser General Public
-<span class="lineNum">      13 </span>                :  * License as published by the Free Software Foundation; either
-<span class="lineNum">      14 </span>                :  * version 2.1 of the License, or (at your option) any later version.
-<span class="lineNum">      15 </span>                :  *
-<span class="lineNum">      16 </span>                :  * This library is distributed in the hope that it will be useful,
-<span class="lineNum">      17 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      18 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-<span class="lineNum">      19 </span>                :  * Lesser General Public License for more details.
-<span class="lineNum">      20 </span>                :  *
-<span class="lineNum">      21 </span>                :  * You should have received a copy of the GNU Lesser General Public
-<span class="lineNum">      22 </span>                :  * License along with this library; if not, write to the Free Software
-<span class="lineNum">      23 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
-<span class="lineNum">      24 </span>                :  */
-<span class="lineNum">      25 </span>                : 
-<span class="lineNum">      26 </span>                : #include &lt;wibble/mixin.h&gt;
-<span class="lineNum">      27 </span>                : #include &lt;vector&gt;
-<span class="lineNum">      28 </span>                : 
-<span class="lineNum">      29 </span>                : namespace std {
-<span class="lineNum">      30 </span>                : template&lt;typename A, typename B&gt; class pair;
-<span class="lineNum">      31 </span>                : }
-<span class="lineNum">      32 </span>                : 
-<span class="lineNum">      33 </span>                : namespace tagcoll {
-<span class="lineNum">      34 </span>                : namespace coll {
-<span class="lineNum">      35 </span>                : 
-<span class="lineNum">      36 </span>                : template&lt;typename T&gt;
-<span class="lineNum">      37 </span>                : class coll_traits;
-<span class="lineNum">      38 </span>                :         
-<span class="lineNum">      39 </span>                : /**
-<span class="lineNum">      40 </span>                :  * Interface for all collections of tagged items.
-<span class="lineNum">      41 </span>                :  *
-<span class="lineNum">      42 </span>                :  * \note The point of a collection is to track the tags attached to items, and
-<span class="lineNum">      43 </span>                :  * not to store the items themselves.  This means that collections are not
-<span class="lineNum">      44 </span>                :  * required to keep track of items with no tags.
-<span class="lineNum">      45 </span>                :  */
-<span class="lineNum">      46 </span>                : template&lt;typename Self&gt;
-<span class="lineNum">      47 </span>                : class ReadonlyCollection
-<span class="lineNum">      48 </span><span class="lineCov">             37 : {</span>
-<span class="lineNum">      49 </span><span class="lineCov">          84611 :         const Self&amp; self() const { return *static_cast&lt;const Self*&gt;(this); }</span>
-<span class="lineNum">      50 </span>                : 
-<span class="lineNum">      51 </span>                :         class CardinalityOrder
-<span class="lineNum">      52 </span>                :         {
-<span class="lineNum">      53 </span>                :                 const Self&amp; coll;
-<span class="lineNum">      54 </span>                :         public:
-<span class="lineNum">      55 </span>                :                 CardinalityOrder(const Self&amp; coll) : coll(coll) {}
-<span class="lineNum">      56 </span>                :                 bool operator()(const typename coll_traits&lt;Self&gt;::tag_type&amp; t1, const typename coll_traits&lt;Self&gt;::tag_type&amp; t2)
-<span class="lineNum">      57 </span>                :                 {
-<span class="lineNum">      58 </span>                :                         // Returns true if t1 precedes t2, and false otherwise
-<span class="lineNum">      59 </span>                :                         return coll.getCardinality(t1) &lt; coll.getCardinality(t2);
-<span class="lineNum">      60 </span>                :                 }
-<span class="lineNum">      61 </span>                :         };
-<span class="lineNum">      62 </span>                : 
-<span class="lineNum">      63 </span>                :         class DiscriminanceOrder
-<span class="lineNum">      64 </span>                :         {
-<span class="lineNum">      65 </span>                :                 const Self&amp; coll;
-<span class="lineNum">      66 </span>                :         public:
-<span class="lineNum">      67 </span>                :                 DiscriminanceOrder(const Self&amp; coll) : coll(coll) {}
-<span class="lineNum">      68 </span>                :                 bool operator()(const typename coll_traits&lt;Self&gt;::tag_type&amp; t1, const typename coll_traits&lt;Self&gt;::tag_type&amp; t2)
-<span class="lineNum">      69 </span>                :                 {
-<span class="lineNum">      70 </span>                :                         // Returns true if t1 precedes t2, and false otherwise
-<span class="lineNum">      71 </span>                :                         return coll.getDiscriminance(t1) &lt; coll.getDiscriminance(t2);
-<span class="lineNum">      72 </span>                :                 }
-<span class="lineNum">      73 </span>                :         };
-<span class="lineNum">      74 </span>                : 
-<span class="lineNum">      75 </span>                :         template&lt;typename COLL&gt;
-<span class="lineNum">      76 </span>                :         class RelevanceOrder
-<span class="lineNum">      77 </span>                :         {
-<span class="lineNum">      78 </span>                :                 const COLL&amp; first;
-<span class="lineNum">      79 </span>                :                 const Self&amp; second;
-<span class="lineNum">      80 </span>                :         public:
-<span class="lineNum">      81 </span>                :                 RelevanceOrder(const COLL&amp; first, const Self&amp; second)
-<span class="lineNum">      82 </span>                :                         : first(first), second(second) {}
-<span class="lineNum">      83 </span>                :                 bool operator()(const typename coll_traits&lt;Self&gt;::tag_type&amp; t1, const typename coll_traits&lt;Self&gt;::tag_type&amp; t2);
-<span class="lineNum">      84 </span>                :         };
-<span class="lineNum">      85 </span>                : 
-<span class="lineNum">      86 </span>                :         /**
-<span class="lineNum">      87 </span>                :          * Get the items which are tagged with at least the tag `tag'
-<span class="lineNum">      88 </span>                :          *
-<span class="lineNum">      89 </span>                :          * \return
-<span class="lineNum">      90 </span>                :          *   The items found, or an empty set if no items have that tag
-<span class="lineNum">      91 </span>                :          */
-<span class="lineNum">      92 </span>                :         //virtual std::set&lt;ITEM&gt; getItemsHavingTag(const TAG&amp; tag) const = 0;
-<span class="lineNum">      93 </span>                : 
-<span class="lineNum">      94 </span>                :         /**
-<span class="lineNum">      95 </span>                :          * Get the tags attached to an item.
-<span class="lineNum">      96 </span>                :          *
-<span class="lineNum">      97 </span>                :          * \param item
-<span class="lineNum">      98 </span>                :          *   The item to query
-<span class="lineNum">      99 </span>                :          * \return 
-<span class="lineNum">     100 </span>                :          *   The set of tags, or an empty set if the item has no tags or it does
-<span class="lineNum">     101 </span>                :          *   not exist.
-<span class="lineNum">     102 </span>                :          */
-<span class="lineNum">     103 </span>                :         //virtual std::set&lt;TAG&gt; getTagsOfItem(const ITEM&amp; item) const = 0;
-<span class="lineNum">     104 </span>                : 
-<span class="lineNum">     105 </span>                : public:
-<span class="lineNum">     106 </span>                :         /**
-<span class="lineNum">     107 </span>                :          * Check if the collection contains a tag
-<span class="lineNum">     108 </span>                :          *
-<span class="lineNum">     109 </span>                :          * \param tag
-<span class="lineNum">     110 </span>                :          *   The tag to look for
-<span class="lineNum">     111 </span>                :          * \return 
-<span class="lineNum">     112 </span>                :          *   true if the collection contains tag, false otherwise
-<span class="lineNum">     113 </span>                :          */
-<span class="lineNum">     114 </span>                :         bool hasTag(const typename coll_traits&lt;Self&gt;::tag_type&amp; tag) const;
-<span class="lineNum">     115 </span>                : 
-<span class="lineNum">     116 </span>                :         /**
-<span class="lineNum">     117 </span>                :          * Get the tags of item `item'.  Return an empty set if `item' does not exist
-<span class="lineNum">     118 </span>                :          */
-<span class="lineNum">     119 </span>                :         //std::set&lt;Self::tag_type&gt; getTags(const typename Self::item_type&amp; item) const = 0;
-<span class="lineNum">     120 </span>                : 
-<span class="lineNum">     121 </span>                :         /**
-<span class="lineNum">     122 </span>                :          * Get all the tags attached to the items in a set.
-<span class="lineNum">     123 </span>                :          *
-<span class="lineNum">     124 </span>                :          * \param items
-<span class="lineNum">     125 </span>                :          *   The items to query
-<span class="lineNum">     126 </span>                :          * \return 
-<span class="lineNum">     127 </span>                :          *   The set of tags, or an empty set if the items have no tags or do not
-<span class="lineNum">     128 </span>                :          *   exist.
-<span class="lineNum">     129 </span>                :          */
-<span class="lineNum">     130 </span>                :         template&lt;typename ITEMS&gt;
-<span class="lineNum">     131 </span>                :         typename coll_traits&lt;Self&gt;::tagset_type getTagsOfItems(const ITEMS&amp; items) const;
-<span class="lineNum">     132 </span>                : 
-<span class="lineNum">     133 </span>                :         /**
-<span class="lineNum">     134 </span>                :          * Get the items with tag `tag'.  Return an empty set if `tag' does not exist
-<span class="lineNum">     135 </span>                :          */
-<span class="lineNum">     136 </span>                :         //std::set&lt;typename Self::item_type&gt; getItems(const TAG&amp; tag) const { return getItemsHavingTag(tag); }
-<span class="lineNum">     137 </span>                : 
-<span class="lineNum">     138 </span>                :         /**
-<span class="lineNum">     139 </span>                :          * Get the items which are tagged with at least the tags `tags'
-<span class="lineNum">     140 </span>                :          *
-<span class="lineNum">     141 </span>                :          * \return
-<span class="lineNum">     142 </span>                :          *   The items found, or an empty set if no items have that tag
-<span class="lineNum">     143 </span>                :          */
-<span class="lineNum">     144 </span>                :         template&lt;typename TAGS&gt;
-<span class="lineNum">     145 </span><span class="lineCov">              2 :         typename coll_traits&lt;Self&gt;::itemset_type getItemsHavingTags(const TAGS&amp; tags) const;</span>
-<span class="lineNum">     146 </span>                : 
-<span class="lineNum">     147 </span>                :         /**
-<span class="lineNum">     148 </span>                :          * Get the set of all the items that have tags according to this collection
-<span class="lineNum">     149 </span>                :          */
-<span class="lineNum">     150 </span>                :         //virtual std::set&lt;Self::item_type&gt; getTaggedItems() const = 0;
-<span class="lineNum">     151 </span>                : 
-<span class="lineNum">     152 </span>                :         /**
-<span class="lineNum">     153 </span>                :          * Get the set of all the tags in this collection
-<span class="lineNum">     154 </span>                :          */
-<span class="lineNum">     155 </span>                :         //virtual std::set&lt;Self::tag_type&gt; getAllTags() const = 0;
-<span class="lineNum">     156 </span>                :         
-<span class="lineNum">     157 </span>                :         /**
-<span class="lineNum">     158 </span>                :          * Get all the tags in the collectin, as a vector
-<span class="lineNum">     159 </span>                :          */
-<span class="lineNum">     160 </span>                :         std::vector&lt;typename coll_traits&lt;Self&gt;::tag_type&gt; getAllTagsAsVector() const;
-<span class="lineNum">     161 </span>                : 
-<span class="lineNum">     162 </span>                :         /**
-<span class="lineNum">     163 </span>                :          * Get the cardinality of tag `tag' (that is, the number of items who have it)
-<span class="lineNum">     164 </span>                :          */
-<span class="lineNum">     165 </span>                :         unsigned int getCardinality(const typename coll_traits&lt;Self&gt;::tag_type&amp; tag) const;
-<span class="lineNum">     166 </span>                : 
-<span class="lineNum">     167 </span>                :         /**
-<span class="lineNum">     168 </span>                :          * Return the discriminance value for this tag, that is, the minimum number
-<span class="lineNum">     169 </span>                :          * of packages that would be eliminated by selecting only those tagged with
-<span class="lineNum">     170 </span>                :          * this tag or only those not tagged with this tag.
-<span class="lineNum">     171 </span>                :          */
-<span class="lineNum">     172 </span>                :         unsigned int getDiscriminance(const typename coll_traits&lt;Self&gt;::tag_type&amp; tag) const
-<span class="lineNum">     173 </span>                :         {
-<span class="lineNum">     174 </span>                :                 return self().getCardinality(tag) &lt; self().tagCount() - self().getCardinality(tag) ?
-<span class="lineNum">     175 </span>                :                                 self().getCardinality(tag) :
-<span class="lineNum">     176 </span>                :                                 self().tagCount() - self().getCardinality(tag);
-<span class="lineNum">     177 </span>                :         }
-<span class="lineNum">     178 </span>                : 
-<span class="lineNum">     179 </span>                :         /**
-<span class="lineNum">     180 </span>                :          * Get the set of all tags in this collection that appear in tagsets
-<span class="lineNum">     181 </span>                :          * containing `tags'
-<span class="lineNum">     182 </span>                :          *
-<span class="lineNum">     183 </span>                :          * Example:
-<span class="lineNum">     184 </span>                :          * \code
-<span class="lineNum">     185 </span>                :          * void refineSelection(const std::set&lt;Tag&gt;&amp; selection)
-<span class="lineNum">     186 </span>                :          * {
-<span class="lineNum">     187 </span>                :          *    std::set&lt;Tag&gt; extraTags = collection.getCompanionTags(selection);
-<span class="lineNum">     188 </span>                :          *    tagMenu.setAvailableOptions(extraTags);
-<span class="lineNum">     189 </span>                :          * }
-<span class="lineNum">     190 </span>                :          * \endcode
-<span class="lineNum">     191 </span>                :          */
-<span class="lineNum">     192 </span>                :         template&lt;typename TAGS&gt;
-<span class="lineNum">     193 </span>                :         typename coll_traits&lt;Self&gt;::tagset_type getCompanionTags(const TAGS&amp; tags) const;
-<span class="lineNum">     194 </span>                : 
-<span class="lineNum">     195 </span>                :         /**
-<span class="lineNum">     196 </span>                :          * Get the related items at the given maximum distance
-<span class="lineNum">     197 </span>                :          *
-<span class="lineNum">     198 </span>                :          * Examples:
-<span class="lineNum">     199 </span>                :          * \code
-<span class="lineNum">     200 </span>                :          * // Get the items related to a given one, at the given distance
-<span class="lineNum">     201 </span>                :          * std::set&lt;Item&gt; getRelated(const Item&amp; item, int distance)
-<span class="lineNum">     202 </span>                :          * {
-<span class="lineNum">     203 </span>                :          *    std::set&lt;Item&gt; res = collection.getRelatedItems(collection.getTags(item), distance);
-<span class="lineNum">     204 </span>                :          *    return res - item;
-<span class="lineNum">     205 </span>                :          * }
-<span class="lineNum">     206 </span>                :          *
-<span class="lineNum">     207 </span>                :          * // Get the items related to the given ones, at the given distance
-<span class="lineNum">     208 </span>                :          * std::set&lt;Item&gt; getRelated(const std::set&lt;Item&gt;&amp; items, int distance)
-<span class="lineNum">     209 </span>                :          * {
-<span class="lineNum">     210 </span>                :          *    std::set&lt;Item&gt; res = collection.getRelatedItems(collection.getTags(items), distance);
-<span class="lineNum">     211 </span>                :          *    return res - items;
-<span class="lineNum">     212 </span>                :          * }
-<span class="lineNum">     213 </span>                :          *
-<span class="lineNum">     214 </span>                :          * // Get the related items, increasing the distance until it finds at
-<span class="lineNum">     215 </span>                :          * // least 'minimum' items
-<span class="lineNum">     216 </span>                :          * std::set&lt;Item&gt; getRelated(const Item&amp; item, int minimum)
-<span class="lineNum">     217 </span>                :          * {
-<span class="lineNum">     218 </span>                :          *    std::set&lt;Tag&gt; tags = collection.getTags(item);
-<span class="lineNum">     219 </span>                :          *    std::set&lt;Item&gt; res;
-<span class="lineNum">     220 </span>                :          *    for (int i = 0; i &lt; tags.size() &amp;&amp; res.size() &lt; minimum; i++)
-<span class="lineNum">     221 </span>                :          *       res += collection.getRelatedItems(tags, i);
-<span class="lineNum">     222 </span>                :          *        return res - item;
-<span class="lineNum">     223 </span>                :          * }
-<span class="lineNum">     224 </span>                :          * \endcode
-<span class="lineNum">     225 </span>                :          */
-<span class="lineNum">     226 </span>                :         template&lt;typename TAGS&gt;
-<span class="lineNum">     227 </span>                :         typename coll_traits&lt;Self&gt;::itemset_type getRelatedItems(const TAGS&amp; tags, int maxdistance = 1) const;
-<span class="lineNum">     228 </span>                : 
-<span class="lineNum">     229 </span>                :         /**
-<span class="lineNum">     230 </span>                :          * Output all the contents of the collection to an output iterator
-<span class="lineNum">     231 </span>                :          */
-<span class="lineNum">     232 </span>                :         template&lt;typename OUT&gt;
-<span class="lineNum">     233 </span><span class="lineCov">              5 :         void output(OUT out) const;</span>
-<span class="lineNum">     234 </span>                : 
-<span class="lineNum">     235 </span>                :         /**
-<span class="lineNum">     236 </span>                :          * Send to a consumer all the items which are tagged with at least the
-<span class="lineNum">     237 </span>                :          * given tags
-<span class="lineNum">     238 </span>                :          */
-<span class="lineNum">     239 </span>                :         template&lt;typename TAGS, typename OUT&gt;
-<span class="lineNum">     240 </span>                :         void outputHavingTags(const TAGS&amp; tags, OUT out) const;
-<span class="lineNum">     241 </span>                : 
-<span class="lineNum">     242 </span>                :         /**
-<span class="lineNum">     243 </span>                :          * Get a vector containing all tags in this collection, sorted by
-<span class="lineNum">     244 </span>                :          * increasing cardinality
-<span class="lineNum">     245 </span>                :          */
-<span class="lineNum">     246 </span>                :         std::vector&lt;typename coll_traits&lt;Self&gt;::tag_type&gt; tagsInCardinalityOrder() const;
-<span class="lineNum">     247 </span>                : 
-<span class="lineNum">     248 </span>                :         /**
-<span class="lineNum">     249 </span>                :          * Get a vector containing all tags in this collection, sorted by
-<span class="lineNum">     250 </span>                :          * increasing discriminance value (@see getDiscriminance)
-<span class="lineNum">     251 </span>                :          */
-<span class="lineNum">     252 </span>                :         std::vector&lt;typename coll_traits&lt;Self&gt;::tag_type&gt; tagsInDiscriminanceOrder() const;
-<span class="lineNum">     253 </span>                : 
-<span class="lineNum">     254 </span>                :         /**
-<span class="lineNum">     255 </span>                :          * Get a vector containing all tags in this collection, sorted by
-<span class="lineNum">     256 </span>                :          * increasing relevance to the filtering applied between coll and this
-<span class="lineNum">     257 </span>                :          * collection
-<span class="lineNum">     258 </span>                :          */
-<span class="lineNum">     259 </span>                :         template&lt;typename COLL&gt;
-<span class="lineNum">     260 </span>                :         std::vector&lt;typename coll_traits&lt;Self&gt;::tag_type&gt; tagsInRelevanceOrder(const COLL&amp; coll) const;
-<span class="lineNum">     261 </span>                : };
-<span class="lineNum">     262 </span>                : 
-<span class="lineNum">     263 </span>                : 
-<span class="lineNum">     264 </span>                : /**
-<span class="lineNum">     265 </span>                :  * Interface for all collections of tagged items.
-<span class="lineNum">     266 </span>                :  *
-<span class="lineNum">     267 </span>                :  * \note The point of a collection is to track the tags attached to items, and
-<span class="lineNum">     268 </span>                :  * not to store the items themselves.  This means that collections are not
-<span class="lineNum">     269 </span>                :  * required to keep track of items with no tags.
-<span class="lineNum">     270 </span>                :  */
-<span class="lineNum">     271 </span>                : template&lt;typename Self&gt;
-<span class="lineNum">     272 </span>                : class Collection : public ReadonlyCollection&lt;Self&gt;
-<span class="lineNum">     273 </span><span class="lineCov">             27 : {</span>
-<span class="lineNum">     274 </span>                : //protected:
-<span class="lineNum">     275 </span>                :         /*
-<span class="lineNum">     276 </span>                :          * Implementation note: to avoid problems with classes implementing only
-<span class="lineNum">     277 </span>                :          * some of the virtual methods, they are given different names.  The common
-<span class="lineNum">     278 </span>                :          * 'comsume' methods are just inlined calls to the right virtual functions,
-<span class="lineNum">     279 </span>                :          * and are a way of keeping the unoverridden methods from being hidden.
-<span class="lineNum">     280 </span>                :          */
-<span class="lineNum">     281 </span>                : 
-<span class="lineNum">     282 </span>                :         //void consumeItemUntagged(const ITEM&amp;) {}
-<span class="lineNum">     283 </span>                :         //void consumeItemsUntagged(const std::set&lt;ITEM&gt;&amp;) {}
-<span class="lineNum">     284 </span>                : 
-<span class="lineNum">     285 </span>                : public:
-<span class="lineNum">     286 </span>                :         //virtual ~Collection() {}
-<span class="lineNum">     287 </span>                :         
-<span class="lineNum">     288 </span>                :         /**
-<span class="lineNum">     289 </span>                :          * Apply a patch to the collection
-<span class="lineNum">     290 </span>                :          *
-<span class="lineNum">     291 </span>                :          * Example:
-<span class="lineNum">     292 </span>                :          * \code
-<span class="lineNum">     293 </span>                :          * void perform(const PatchList&lt;ITEM, TAG&gt;&amp; change)
-<span class="lineNum">     294 </span>                :          * {
-<span class="lineNum">     295 </span>                :          *    collection.applyChange(change);
-<span class="lineNum">     296 </span>                :          *    undo.push_back(change.getReverse());
-<span class="lineNum">     297 </span>                :          * }
-<span class="lineNum">     298 </span>                :          * \endcode
-<span class="lineNum">     299 </span>                :          */
-<span class="lineNum">     300 </span>                : //      void applyChange(
-<span class="lineNum">     301 </span>                : //                      const PatchList&lt;
-<span class="lineNum">     302 </span>                : //                              typename coll_traits&lt;Self&gt;::item_type,
-<span class="lineNum">     303 </span>                : //                              typename coll_traits&lt;Self&gt;::tag_type&gt;&amp; change);
-<span class="lineNum">     304 </span>                : };
-<span class="lineNum">     305 </span>                : 
-<span class="lineNum">     306 </span>                : 
-<span class="lineNum">     307 </span>                : template&lt;typename COLL&gt;
-<span class="lineNum">     308 </span>                : class Inserter : public wibble::mixin::OutputIterator&lt; Inserter&lt;COLL&gt; &gt;
-<span class="lineNum">     309 </span>                : {
-<span class="lineNum">     310 </span>                :         COLL&amp; coll;
-<span class="lineNum">     311 </span>                : 
-<span class="lineNum">     312 </span>                : public:
-<span class="lineNum">     313 </span><span class="lineCov">             10 :         Inserter(COLL&amp; coll) : coll(coll) {}</span>
-<span class="lineNum">     314 </span>                : 
-<span class="lineNum">     315 </span>                :         template&lt;typename Items, typename Tags&gt;
-<span class="lineNum">     316 </span><span class="lineCov">          63426 :         Inserter&lt;COLL&gt;&amp; operator=(const std::pair&lt;Items, Tags&gt;&amp; data)</span>
-<span class="lineNum">     317 </span>                :         {
-<span class="lineNum">     318 </span><span class="lineCov">          63426 :                 coll.insert(data.first, data.second);</span>
-<span class="lineNum">     319 </span><span class="lineCov">          63426 :                 return *this;</span>
-<span class="lineNum">     320 </span>                :         }
-<span class="lineNum">     321 </span>                : };
-<span class="lineNum">     322 </span>                : 
-<span class="lineNum">     323 </span>                : template&lt;typename COLL&gt;
-<span class="lineNum">     324 </span><span class="lineCov">             10 : Inserter&lt;COLL&gt; inserter(COLL&amp; target)</span>
-<span class="lineNum">     325 </span>                : {
-<span class="lineNum">     326 </span><span class="lineCov">             10 :         return Inserter&lt;COLL&gt;(target);</span>
-<span class="lineNum">     327 </span>                : }
-<span class="lineNum">     328 </span>                : 
-<span class="lineNum">     329 </span>                : }
-<span class="lineNum">     330 </span>                : }
-<span class="lineNum">     331 </span>                : 
-<span class="lineNum">     332 </span>                : // vim:set ts=4 sw=4:
-<span class="lineNum">     333 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/base.tcc.gcov.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/base.tcc.gcov.html
deleted file mode 100644
index 5389355..0000000
--- a/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/base.tcc.gcov.html
+++ /dev/null
@@ -1,258 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/coll/base.tcc</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/tagcoll-2.0.11/tagcoll/coll</a> - base.tcc</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">18</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">88.9 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">16</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #ifndef TAGCOLL_COLL_BASE_TCC
-<span class="lineNum">       2 </span>                : #define TAGCOLL_COLL_BASE_TCC
-<span class="lineNum">       3 </span>                : 
-<span class="lineNum">       4 </span>                : /** \file
-<span class="lineNum">       5 </span>                :  * Base mixins for tagged collections
-<span class="lineNum">       6 </span>                :  */
-<span class="lineNum">       7 </span>                : 
-<span class="lineNum">       8 </span>                : /*
-<span class="lineNum">       9 </span>                :  * Copyright (C) 2003,2004,2005,2006  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">      10 </span>                :  *
-<span class="lineNum">      11 </span>                :  * This library is free software; you can redistribute it and/or
-<span class="lineNum">      12 </span>                :  * modify it under the terms of the GNU Lesser General Public
-<span class="lineNum">      13 </span>                :  * License as published by the Free Software Foundation; either
-<span class="lineNum">      14 </span>                :  * version 2.1 of the License, or (at your option) any later version.
-<span class="lineNum">      15 </span>                :  *
-<span class="lineNum">      16 </span>                :  * This library is distributed in the hope that it will be useful,
-<span class="lineNum">      17 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      18 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-<span class="lineNum">      19 </span>                :  * Lesser General Public License for more details.
-<span class="lineNum">      20 </span>                :  *
-<span class="lineNum">      21 </span>                :  * You should have received a copy of the GNU Lesser General Public
-<span class="lineNum">      22 </span>                :  * License along with this library; if not, write to the Free Software
-<span class="lineNum">      23 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
-<span class="lineNum">      24 </span>                :  */
-<span class="lineNum">      25 </span>                : 
-<span class="lineNum">      26 </span>                : #include &lt;tagcoll/coll/base.h&gt;
-<span class="lineNum">      27 </span>                : #include &lt;tagcoll/utils/set.h&gt;
-<span class="lineNum">      28 </span>                : #include &lt;algorithm&gt;
-<span class="lineNum">      29 </span>                : 
-<span class="lineNum">      30 </span>                : namespace tagcoll {
-<span class="lineNum">      31 </span>                : namespace coll {
-<span class="lineNum">      32 </span>                : 
-<span class="lineNum">      33 </span>                : template&lt;typename T&gt;
-<span class="lineNum">      34 </span>                : class coll_traits;
-<span class="lineNum">      35 </span>                : 
-<span class="lineNum">      36 </span>                : template&lt;typename Self&gt; template&lt;typename COLL&gt;
-<span class="lineNum">      37 </span>                : bool ReadonlyCollection&lt;Self&gt;::RelevanceOrder&lt;COLL&gt;::operator()(
-<span class="lineNum">      38 </span>                :                 const typename coll_traits&lt;Self&gt;::tag_type&amp; t1,
-<span class="lineNum">      39 </span>                :                 const typename coll_traits&lt;Self&gt;::tag_type&amp; t2)
-<span class="lineNum">      40 </span>                : {
-<span class="lineNum">      41 </span>                :         // New cardinality divided by the square root of the old cardinality.
-<span class="lineNum">      42 </span>                :         // The square root is used to downplay the very common tags a bit
-<span class="lineNum">      43 </span>                :         int csub1 = second.getCardinality(t1);
-<span class="lineNum">      44 </span>                :         float cfull1 = first.getCardinality(t1);
-<span class="lineNum">      45 </span>                :         int csub2 = second.getCardinality(t2);
-<span class="lineNum">      46 </span>                :         float cfull2 = first.getCardinality(t2);
-<span class="lineNum">      47 </span>                :         float rel1 = (float)(csub1 * csub1) / cfull1;
-<span class="lineNum">      48 </span>                :         float rel2 = (float)(csub2 * csub2) / cfull2;
-<span class="lineNum">      49 </span>                : 
-<span class="lineNum">      50 </span>                :         return rel1 &lt; rel2;
-<span class="lineNum">      51 </span>                : //      return 10000 * second.getCardinality(t1) / first.getCardinality(t1)
-<span class="lineNum">      52 </span>                : //               &lt; 10000 * second.getCardinality(t2) / first.getCardinality(t2);
-<span class="lineNum">      53 </span>                : }
-<span class="lineNum">      54 </span>                : 
-<span class="lineNum">      55 </span>                :         
-<span class="lineNum">      56 </span>                : template&lt;typename Self&gt;
-<span class="lineNum">      57 </span>                : bool ReadonlyCollection&lt;Self&gt;::hasTag(const typename coll_traits&lt;Self&gt;::tag_type&amp; tag) const
-<span class="lineNum">      58 </span>                : {
-<span class="lineNum">      59 </span>                :         return !self().getItemsHavingTag(tag).empty();
-<span class="lineNum">      60 </span>                : }
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span>                : template&lt;typename Self&gt; template&lt;typename ITEMS&gt;
-<span class="lineNum">      63 </span><span class="lineCov">              1 : typename coll_traits&lt;Self&gt;::tagset_type ReadonlyCollection&lt;Self&gt;::getTagsOfItems(const ITEMS&amp; items) const</span>
-<span class="lineNum">      64 </span>                : {
-<span class="lineNum">      65 </span>                :         using namespace wibble::operators;
-<span class="lineNum">      66 </span><span class="lineCov">              1 :         typename coll_traits&lt;Self&gt;::tagset_type res;</span>
-<span class="lineNum">      67 </span><span class="lineCov">              2 :         for (typename ITEMS::const_iterator i = items.begin();</span>
-<span class="lineNum">      68 </span>                :                         i != items.end(); i++)
-<span class="lineNum">      69 </span><span class="lineCov">              1 :                 res |= self().getTagsOfItem(*i);</span>
-<span class="lineNum">      70 </span><span class="lineNoCov">              0 :         return res;</span>
-<span class="lineNum">      71 </span>                : }
-<span class="lineNum">      72 </span>                : 
-<span class="lineNum">      73 </span>                : template&lt;typename Self&gt; template&lt;typename TAGS&gt;
-<span class="lineNum">      74 </span>                : typename coll_traits&lt;Self&gt;::itemset_type ReadonlyCollection&lt;Self&gt;::getItemsHavingTags(const TAGS&amp; tags) const 
-<span class="lineNum">      75 </span>                : {
-<span class="lineNum">      76 </span>                :         using namespace wibble::operators;
-<span class="lineNum">      77 </span><span class="lineCov">              2 :         if (tags.empty())</span>
-<span class="lineNum">      78 </span><span class="lineNoCov">              0 :                 return typename coll_traits&lt;Self&gt;::itemset_type();</span>
-<span class="lineNum">      79 </span>                : 
-<span class="lineNum">      80 </span><span class="lineCov">              2 :         typename TAGS::const_iterator i = tags.begin();</span>
-<span class="lineNum">      81 </span><span class="lineCov">              2 :         typename coll_traits&lt;Self&gt;::itemset_type res = self().getItemsHavingTag(*i);</span>
-<span class="lineNum">      82 </span>                : 
-<span class="lineNum">      83 </span><span class="lineCov">              9 :         for (++i ; i != tags.end(); ++i)</span>
-<span class="lineNum">      84 </span><span class="lineCov">              7 :                 res &amp;= self().getItemsHavingTag(*i);</span>
-<span class="lineNum">      85 </span>                : 
-<span class="lineNum">      86 </span><span class="lineCov">              2 :         return res;</span>
-<span class="lineNum">      87 </span>                : }
-<span class="lineNum">      88 </span>                : 
-<span class="lineNum">      89 </span>                : template&lt;typename Self&gt;
-<span class="lineNum">      90 </span>                : std::vector&lt;typename coll_traits&lt;Self&gt;::tag_type&gt; ReadonlyCollection&lt;Self&gt;::getAllTagsAsVector() const
-<span class="lineNum">      91 </span>                : {
-<span class="lineNum">      92 </span>                :         std::set&lt;typename coll_traits&lt;Self&gt;::tag_type&gt; asSet = self().getAllTags();
-<span class="lineNum">      93 </span>                :         std::vector&lt;typename coll_traits&lt;Self&gt;::tag_type&gt; res;
-<span class="lineNum">      94 </span>                :         res.reserve(asSet.size());
-<span class="lineNum">      95 </span>                :         std::copy(asSet.begin(), asSet.end(), back_inserter(res));
-<span class="lineNum">      96 </span>                :         return res;
-<span class="lineNum">      97 </span>                : }
-<span class="lineNum">      98 </span>                : 
-<span class="lineNum">      99 </span>                : template&lt;typename Self&gt;
-<span class="lineNum">     100 </span>                : unsigned int ReadonlyCollection&lt;Self&gt;::getCardinality(const typename coll_traits&lt;Self&gt;::tag_type&amp; tag) const
-<span class="lineNum">     101 </span>                : {
-<span class="lineNum">     102 </span>                :         return self().getItemsHavingTag(tag).size();
-<span class="lineNum">     103 </span>                : }
-<span class="lineNum">     104 </span>                : 
-<span class="lineNum">     105 </span>                : template&lt;typename Self&gt; template&lt;typename TAGS&gt;
-<span class="lineNum">     106 </span>                : typename coll_traits&lt;Self&gt;::tagset_type ReadonlyCollection&lt;Self&gt;::getCompanionTags(const TAGS&amp; tags) const
-<span class="lineNum">     107 </span>                : {
-<span class="lineNum">     108 </span>                :         using namespace wibble::operators;
-<span class="lineNum">     109 </span>                :         return self().getTagsOfItems(self().getItemsHavingTags(tags)) - tags;
-<span class="lineNum">     110 </span>                : }
-<span class="lineNum">     111 </span>                : 
-<span class="lineNum">     112 </span>                : template&lt;typename Self&gt; template&lt;typename TAGS&gt;
-<span class="lineNum">     113 </span>                : typename coll_traits&lt;Self&gt;::itemset_type ReadonlyCollection&lt;Self&gt;::getRelatedItems(const TAGS&amp; tags, int maxdistance) const
-<span class="lineNum">     114 </span>                : {
-<span class="lineNum">     115 </span>                :         using namespace wibble::operators;
-<span class="lineNum">     116 </span>                : 
-<span class="lineNum">     117 </span>                :         typename coll_traits&lt;Self&gt;::itemset_type packages;
-<span class="lineNum">     118 </span>                :         typename coll_traits&lt;Self&gt;::itemset_type res;
-<span class="lineNum">     119 </span>                : 
-<span class="lineNum">     120 </span>                :         // First get a list of packages that have a non-empty intersection with `tags'
-<span class="lineNum">     121 </span>                :         for (typename TAGS::const_iterator i = tags.begin(); i != tags.end(); i++)
-<span class="lineNum">     122 </span>                :                 packages |= self().getItemsHavingTag(*i);
-<span class="lineNum">     123 </span>                : 
-<span class="lineNum">     124 </span>                :         // Then keep only those within the given distance
-<span class="lineNum">     125 </span>                :         for (typename coll_traits&lt;Self&gt;::itemset_type::const_iterator i = packages.begin(); i != packages.end(); i++)
-<span class="lineNum">     126 </span>                :         {
-<span class="lineNum">     127 </span>                :                 int dist = utils::set_distance(tags, self().getTagsOfItem(*i));
-<span class="lineNum">     128 </span>                :                 if (dist &gt;= 0 &amp;&amp; dist &lt;= maxdistance)
-<span class="lineNum">     129 </span>                :                         res |= *i;
-<span class="lineNum">     130 </span>                :         }
-<span class="lineNum">     131 </span>                : 
-<span class="lineNum">     132 </span>                :         return res;
-<span class="lineNum">     133 </span>                : }
-<span class="lineNum">     134 </span>                : 
-<span class="lineNum">     135 </span>                : template&lt;typename Self&gt; template&lt;typename OUT&gt;
-<span class="lineNum">     136 </span><span class="lineCov">              4 : void ReadonlyCollection&lt;Self&gt;::output(OUT out) const</span>
-<span class="lineNum">     137 </span>                : {
-<span class="lineNum">     138 </span><span class="lineCov">         126890 :         for (typename Self::const_iterator i = self().begin();</span>
-<span class="lineNum">     139 </span>                :                         i != self().end(); ++i)
-<span class="lineNum">     140 </span>                :         {
-<span class="lineNum">     141 </span><span class="lineCov">          84583 :                 *out = make_pair(wibble::singleton(i-&gt;first), i-&gt;second);</span>
-<span class="lineNum">     142 </span><span class="lineCov">          84587 :                 ++out;</span>
-<span class="lineNum">     143 </span>                :         }
-<span class="lineNum">     144 </span><span class="lineCov">              9 : }</span>
-<span class="lineNum">     145 </span>                : 
-<span class="lineNum">     146 </span>                : template&lt;typename Self&gt; template&lt;typename TAGS, typename OUT&gt;
-<span class="lineNum">     147 </span>                : void ReadonlyCollection&lt;Self&gt;::outputHavingTags(const TAGS&amp; tags, OUT out) const
-<span class="lineNum">     148 </span>                : {
-<span class="lineNum">     149 </span>                :         typename coll_traits&lt;Self&gt;::itemset_type items = self().getItemsHavingTags(tags);
-<span class="lineNum">     150 </span>                :         for (typename coll_traits&lt;Self&gt;::itemset_type::const_iterator i = items.begin();
-<span class="lineNum">     151 </span>                :                         i != items.end(); ++i)
-<span class="lineNum">     152 </span>                :         {
-<span class="lineNum">     153 </span>                :                 *out = std::make_pair(wibble::singleton(*i), self().getTagsOfItem(*i));
-<span class="lineNum">     154 </span>                :                 ++out;
-<span class="lineNum">     155 </span>                :         }
-<span class="lineNum">     156 </span>                : }
-<span class="lineNum">     157 </span>                : 
-<span class="lineNum">     158 </span>                : template&lt;typename Self&gt;
-<span class="lineNum">     159 </span>                : std::vector&lt;typename coll_traits&lt;Self&gt;::tag_type&gt; ReadonlyCollection&lt;Self&gt;::tagsInCardinalityOrder() const
-<span class="lineNum">     160 </span>                : {
-<span class="lineNum">     161 </span>                :         std::vector&lt;typename coll_traits&lt;Self&gt;::tag_type&gt; res = self().getAllTagsAsVector();
-<span class="lineNum">     162 </span>                :         std::sort(res.begin(), res.end(), CardinalityOrder(self()));
-<span class="lineNum">     163 </span>                :         return res;
-<span class="lineNum">     164 </span>                : }
-<span class="lineNum">     165 </span>                : 
-<span class="lineNum">     166 </span>                : template&lt;typename Self&gt;
-<span class="lineNum">     167 </span>                : std::vector&lt;typename coll_traits&lt;Self&gt;::tag_type&gt; ReadonlyCollection&lt;Self&gt;::tagsInDiscriminanceOrder() const
-<span class="lineNum">     168 </span>                : {
-<span class="lineNum">     169 </span>                :         std::vector&lt;typename coll_traits&lt;Self&gt;::tag_type&gt; res = self().getAllTagsAsVector();
-<span class="lineNum">     170 </span>                :         std::sort(res.begin(), res.end(), DiscriminanceOrder(self()));
-<span class="lineNum">     171 </span>                :         return res;
-<span class="lineNum">     172 </span>                : }
-<span class="lineNum">     173 </span>                : 
-<span class="lineNum">     174 </span>                : /**
-<span class="lineNum">     175 </span>                :  * Get a vector containing all tags in this collection, sorted by
-<span class="lineNum">     176 </span>                :  * increasing relevance to the filtering applied between coll and this
-<span class="lineNum">     177 </span>                :  * collection
-<span class="lineNum">     178 </span>                :  */
-<span class="lineNum">     179 </span>                : template&lt;typename Self&gt; template&lt;typename COLL&gt;
-<span class="lineNum">     180 </span>                : std::vector&lt;typename coll_traits&lt;Self&gt;::tag_type&gt; ReadonlyCollection&lt;Self&gt;::tagsInRelevanceOrder(const COLL&amp; coll) const
-<span class="lineNum">     181 </span>                : {
-<span class="lineNum">     182 </span>                :         std::vector&lt;typename coll_traits&lt;Self&gt;::tag_type&gt; res = self().getAllTagsAsVector();
-<span class="lineNum">     183 </span>                :         std::sort(res.begin(), res.end(), RelevanceOrder&lt;COLL&gt;(coll, self()));
-<span class="lineNum">     184 </span>                :         return res;
-<span class="lineNum">     185 </span>                : }
-<span class="lineNum">     186 </span>                : 
-<span class="lineNum">     187 </span>                : }
-<span class="lineNum">     188 </span><span class="lineCov">              6 : }</span>
-<span class="lineNum">     189 </span>                : 
-<span class="lineNum">     190 </span>                : // vim:set ts=4 sw=4:
-<span class="lineNum">     191 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/index.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/index.html
deleted file mode 100644
index 0623d19..0000000
--- a/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/index.html
+++ /dev/null
@@ -1,137 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/coll</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - /usr/include/tagcoll-2.0.11/tagcoll/coll</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">177</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">79.7 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">141</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <center>
-  <table width="80%" cellpadding=2 cellspacing=1 border=0>
-
-    <tr>
-      <td width="50%"><br></td>
-      <td width="15%"></td>
-      <td width="15%"></td>
-      <td width="20%"></td>
-    </tr>
-
-    <tr>
-      <td class="tableHead">Filename</td>
-      <td class="tableHead" colspan=3>Coverage</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="base.h.gcov.html">base.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">11&nbsp;/&nbsp;11&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="base.tcc.gcov.html">base.tcc</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=89 height=10 alt="88.9%"><img src="../../../../../snow.png" width=11 height=10 alt="88.9%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">88.9&nbsp;%</td>
-      <td class="coverNumHi">16&nbsp;/&nbsp;18&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="intdiskindex.h.gcov.html">intdiskindex.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=92 height=10 alt="92.1%"><img src="../../../../../snow.png" width=8 height=10 alt="92.1%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">92.1&nbsp;%</td>
-      <td class="coverNumHi">35&nbsp;/&nbsp;38&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="patched.h.gcov.html">patched.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=67 height=10 alt="66.7%"><img src="../../../../../snow.png" width=33 height=10 alt="66.7%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">66.7&nbsp;%</td>
-      <td class="coverNumHi">38&nbsp;/&nbsp;57&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="patched.tcc.gcov.html">patched.tcc</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=59 height=10 alt="59.1%"><img src="../../../../../snow.png" width=41 height=10 alt="59.1%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">59.1&nbsp;%</td>
-      <td class="coverNumHi">13&nbsp;/&nbsp;22&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="simple.h.gcov.html">simple.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">14&nbsp;/&nbsp;14&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="simple.tcc.gcov.html">simple.tcc</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=82 height=10 alt="82.4%"><img src="../../../../../snow.png" width=18 height=10 alt="82.4%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">82.4&nbsp;%</td>
-      <td class="coverNumHi">14&nbsp;/&nbsp;17&nbsp;lines</td>
-    </tr>
-
-  </table>
-  </center>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/intdiskindex.h.gcov.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/intdiskindex.h.gcov.html
deleted file mode 100644
index 19678ae..0000000
--- a/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/intdiskindex.h.gcov.html
+++ /dev/null
@@ -1,265 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/coll/intdiskindex.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/tagcoll-2.0.11/tagcoll/coll</a> - intdiskindex.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">38</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">92.1 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">35</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #ifndef TAGCOLL_COLL_INT_DISK_INDEX_H
-<span class="lineNum">       2 </span>                : #define TAGCOLL_COLL_INT_DISK_INDEX_H
-<span class="lineNum">       3 </span>                : 
-<span class="lineNum">       4 </span>                : /** \file
-<span class="lineNum">       5 </span>                :  * Fast on-disk index for tag data
-<span class="lineNum">       6 </span>                :  */
-<span class="lineNum">       7 </span>                : 
-<span class="lineNum">       8 </span>                : /*
-<span class="lineNum">       9 </span>                :  * Copyright (C) 2006  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">      10 </span>                :  *
-<span class="lineNum">      11 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">      12 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">      13 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">      14 </span>                :  * (at your option) any later version.
-<span class="lineNum">      15 </span>                :  *
-<span class="lineNum">      16 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      17 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      18 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      19 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      20 </span>                :  *
-<span class="lineNum">      21 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      22 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      23 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      24 </span>                :  */
-<span class="lineNum">      25 </span>                : 
-<span class="lineNum">      26 </span>                : #include &lt;tagcoll/coll/base.h&gt;
-<span class="lineNum">      27 </span>                : #include &lt;tagcoll/diskindex/int.h&gt;
-<span class="lineNum">      28 </span>                : 
-<span class="lineNum">      29 </span>                : namespace tagcoll {
-<span class="lineNum">      30 </span>                : template&lt;typename ITEM, typename TAG&gt;
-<span class="lineNum">      31 </span>                : class PatchList;
-<span class="lineNum">      32 </span>                : 
-<span class="lineNum">      33 </span>                : namespace coll {
-<span class="lineNum">      34 </span>                : 
-<span class="lineNum">      35 </span>                : class IntDiskIndex;
-<span class="lineNum">      36 </span>                : 
-<span class="lineNum">      37 </span>                : template&lt;&gt;
-<span class="lineNum">      38 </span>                : struct coll_traits&lt; IntDiskIndex &gt;
-<span class="lineNum">      39 </span>                : {
-<span class="lineNum">      40 </span>                :         typedef int item_type;
-<span class="lineNum">      41 </span>                :         typedef int tag_type;
-<span class="lineNum">      42 </span>                :         typedef std::set&lt;int&gt; tagset_type;
-<span class="lineNum">      43 </span>                :         typedef std::set&lt;int&gt; itemset_type;
-<span class="lineNum">      44 </span>                : };
-<span class="lineNum">      45 </span>                : 
-<span class="lineNum">      46 </span>                : /**
-<span class="lineNum">      47 </span>                :  * Full TaggedCollection implementation on top of a persistent on-disk TDB
-<span class="lineNum">      48 </span>                :  * database.
-<span class="lineNum">      49 </span>                :  *
-<span class="lineNum">      50 </span>                :  * It allows to efficiently query a collection without having to store it all
-<span class="lineNum">      51 </span>                :  * into memory.
-<span class="lineNum">      52 </span>                :  *
-<span class="lineNum">      53 </span>                :  * If used for heavy modifications, the performance is slower compared to other
-<span class="lineNum">      54 </span>                :  * in-memory collections.  If database writes are mainly used for populating
-<span class="lineNum">      55 </span>                :  * the index, then TDBIndexer should be used to create the index and
-<span class="lineNum">      56 </span>                :  * TDBDiskIndex to access it afterwards.
-<span class="lineNum">      57 </span>                :  */
-<span class="lineNum">      58 </span>                : class IntDiskIndex : public coll::ReadonlyCollection&lt; IntDiskIndex &gt;
-<span class="lineNum">      59 </span>                : 
-<span class="lineNum">      60 </span>                : {
-<span class="lineNum">      61 </span>                : protected:
-<span class="lineNum">      62 </span>                :         diskindex::Int pkgidx;
-<span class="lineNum">      63 </span>                :         diskindex::Int tagidx;
-<span class="lineNum">      64 </span>                : 
-<span class="lineNum">      65 </span>                : public:
-<span class="lineNum">      66 </span>                :         class const_iterator
-<span class="lineNum">      67 </span>                :         {
-<span class="lineNum">      68 </span>                :                 const IntDiskIndex&amp; index;
-<span class="lineNum">      69 </span>                :                 int idx;
-<span class="lineNum">      70 </span>                :                 mutable std::pair&lt; int, std::set&lt;int&gt; &gt;* cached;
-<span class="lineNum">      71 </span>                : 
-<span class="lineNum">      72 </span>                :         public:
-<span class="lineNum">      73 </span>                :                 // Builds an iterator
-<span class="lineNum">      74 </span><span class="lineCov">              8 :                 const_iterator(const IntDiskIndex&amp; index, int idx)</span>
-<span class="lineNum">      75 </span><span class="lineCov">              8 :                         : index(index), idx(idx), cached(0) {}</span>
-<span class="lineNum">      76 </span>                :                 // Builds the end iterator
-<span class="lineNum">      77 </span><span class="lineCov">         274893 :                 const_iterator(const IntDiskIndex&amp; index)</span>
-<span class="lineNum">      78 </span><span class="lineCov">         274893 :                         : index(index), idx(index.pkgidx.size()), cached(0) {}</span>
-<span class="lineNum">      79 </span><span class="lineCov">         528661 :                 ~const_iterator() { if (cached) delete cached; }</span>
-<span class="lineNum">      80 </span>                : 
-<span class="lineNum">      81 </span><span class="lineCov">         105725 :                 std::pair&lt; int, std::set&lt;int&gt; &gt; operator*() const</span>
-<span class="lineNum">      82 </span>                :                 {
-<span class="lineNum">      83 </span><span class="lineCov">         105725 :                         return std::make_pair(idx, index.getTagsOfItem(idx));</span>
-<span class="lineNum">      84 </span>                :                 }
-<span class="lineNum">      85 </span><span class="lineCov">          42290 :                 std::pair&lt; int, std::set&lt;int&gt; &gt;* operator-&gt;() const</span>
-<span class="lineNum">      86 </span>                :                 {
-<span class="lineNum">      87 </span><span class="lineCov">          42290 :                         if (!cached)</span>
-<span class="lineNum">      88 </span><span class="lineCov">          21145 :                                 cached = new std::pair&lt; int, std::set&lt;int&gt; &gt;(operator*());</span>
-<span class="lineNum">      89 </span><span class="lineCov">          42290 :                         return cached;</span>
-<span class="lineNum">      90 </span>                :                 }
-<span class="lineNum">      91 </span>                : 
-<span class="lineNum">      92 </span><span class="lineCov">         105725 :                 const_iterator operator++()</span>
-<span class="lineNum">      93 </span>                :                 {
-<span class="lineNum">      94 </span><span class="lineCov">         105725 :                         ++idx;</span>
-<span class="lineNum">      95 </span><span class="lineCov">         105725 :                         if (cached) { delete cached; cached = 0; }</span>
-<span class="lineNum">      96 </span><span class="lineCov">         105725 :                         return *this;</span>
-<span class="lineNum">      97 </span>                :                 }
-<span class="lineNum">      98 </span><span class="lineCov">         169161 :                 bool operator==(const const_iterator&amp; iter) const</span>
-<span class="lineNum">      99 </span>                :                 {
-<span class="lineNum">     100 </span><span class="lineCov">         169161 :                         return idx == iter.idx;</span>
-<span class="lineNum">     101 </span>                :                 }
-<span class="lineNum">     102 </span><span class="lineCov">         105732 :                 bool operator!=(const const_iterator&amp; iter) const</span>
-<span class="lineNum">     103 </span>                :                 {
-<span class="lineNum">     104 </span><span class="lineCov">         105732 :                         return idx != iter.idx;</span>
-<span class="lineNum">     105 </span>                :                 }
-<span class="lineNum">     106 </span>                :         };
-<span class="lineNum">     107 </span><span class="lineCov">              8 :         const_iterator begin() const { return const_iterator(*this, 0); }</span>
-<span class="lineNum">     108 </span><span class="lineCov">         274893 :         const_iterator end() const { return const_iterator(*this); }</span>
-<span class="lineNum">     109 </span>                : 
-<span class="lineNum">     110 </span>                :         /**
-<span class="lineNum">     111 </span>                :          * Create a new IntDiskIndex
-<span class="lineNum">     112 </span>                :          *
-<span class="lineNum">     113 </span>                :          * @param filename
-<span class="lineNum">     114 </span>                :          *   The file name of the package index
-<span class="lineNum">     115 </span>                :          * @param tagidx
-<span class="lineNum">     116 </span>                :          *   The file name of the tag index
-<span class="lineNum">     117 </span>                :          * @param fromitem, fromtag, toitem, totag
-<span class="lineNum">     118 </span>                :          *   The Converter-s used to convert int and int to and from strings.
-<span class="lineNum">     119 </span>                :          *   If 0 is passed, this TDBDiskIndex will only be able to work with
-<span class="lineNum">     120 </span>                :          *   string items and string tags.
-<span class="lineNum">     121 </span>                :          * @param write
-<span class="lineNum">     122 </span>                :          *   Set to false if the index should be opened in read-only mode.  If
-<span class="lineNum">     123 </span>                :          *   opened in read-only mode, all non-const methods of this class will
-<span class="lineNum">     124 </span>                :          *   throw an exception if invoked.
-<span class="lineNum">     125 </span>                :          *   It defaults to true.
-<span class="lineNum">     126 </span>                :          */
-<span class="lineNum">     127 </span><span class="lineCov">             10 :         IntDiskIndex() {}</span>
-<span class="lineNum">     128 </span>                :         IntDiskIndex(
-<span class="lineNum">     129 </span>                :                         const diskindex::MasterMMap&amp; master,
-<span class="lineNum">     130 </span>                :                         int pkgindex, int tagindex)
-<span class="lineNum">     131 </span>                :                 :   pkgidx(master, pkgindex), tagidx(master, tagindex) {}
-<span class="lineNum">     132 </span>                : 
-<span class="lineNum">     133 </span><span class="lineCov">              9 :         void init(const diskindex::MasterMMap&amp; master, int pkgindex, int tagindex)</span>
-<span class="lineNum">     134 </span>                :         {
-<span class="lineNum">     135 </span><span class="lineCov">              9 :                 pkgidx.init(master, pkgindex);</span>
-<span class="lineNum">     136 </span><span class="lineCov">              9 :                 tagidx.init(master, tagindex);</span>
-<span class="lineNum">     137 </span><span class="lineCov">              9 :         }</span>
-<span class="lineNum">     138 </span>                : 
-<span class="lineNum">     139 </span>                :         std::set&lt;int&gt; getItemsHavingTag(const int&amp; tag) const;
-<span class="lineNum">     140 </span>                :         std::set&lt;int&gt; getItemsHavingTags(const std::set&lt;int&gt;&amp; tags) const;
-<span class="lineNum">     141 </span>                :         std::set&lt;int&gt; getTagsOfItem(const int&amp; item) const;
-<span class="lineNum">     142 </span>                :         std::set&lt;int&gt; getTagsOfItems(const std::set&lt;int&gt;&amp; items) const;
-<span class="lineNum">     143 </span>                : 
-<span class="lineNum">     144 </span>                :     bool hasTag(const int&amp; tag) const
-<span class="lineNum">     145 </span>                :         {
-<span class="lineNum">     146 </span>                :                 return tagidx.size(tag) &gt; 0;
-<span class="lineNum">     147 </span>                :         }
-<span class="lineNum">     148 </span>                : 
-<span class="lineNum">     149 </span>                :         std::set&lt;int&gt; getTaggedItems() const;
-<span class="lineNum">     150 </span>                : 
-<span class="lineNum">     151 </span>                :         std::set&lt;int&gt; getAllTags() const;
-<span class="lineNum">     152 </span>                :         std::vector&lt;int&gt; getAllTagsAsVector() const;
-<span class="lineNum">     153 </span>                : 
-<span class="lineNum">     154 </span>                :         unsigned int itemCount() const { return pkgidx.size(); }
-<span class="lineNum">     155 </span>                :         unsigned int tagCount() const { return tagidx.size(); }
-<span class="lineNum">     156 </span>                : 
-<span class="lineNum">     157 </span><span class="lineNoCov">              0 :         unsigned int getCardinality(const int&amp; tag) const</span>
-<span class="lineNum">     158 </span>                :         {
-<span class="lineNum">     159 </span><span class="lineNoCov">              0 :                 return tagidx.size(tag);</span>
-<span class="lineNum">     160 </span>                :         }
-<span class="lineNum">     161 </span>                : 
-<span class="lineNum">     162 </span>                :         std::set&lt;int&gt; getCompanionTags(const std::set&lt;int&gt;&amp; tags) const;
-<span class="lineNum">     163 </span>                : 
-<span class="lineNum">     164 </span>                :         //void output(Consumer&lt;int, int&gt;&amp; consumer) const;
-<span class="lineNum">     165 </span>                : };
-<span class="lineNum">     166 </span>                : 
-<span class="lineNum">     167 </span>                : class IntDiskIndexer
-<span class="lineNum">     168 </span><span class="lineCov">              2 : {</span>
-<span class="lineNum">     169 </span>                : protected:
-<span class="lineNum">     170 </span>                :         diskindex::IntIndexer pkgidx;
-<span class="lineNum">     171 </span>                :         diskindex::IntIndexer tagidx;
-<span class="lineNum">     172 </span>                : 
-<span class="lineNum">     173 </span>                : public:
-<span class="lineNum">     174 </span><span class="lineCov">              1 :         const diskindex::MMapIndexer&amp; pkgIndexer() const { return pkgidx; }</span>
-<span class="lineNum">     175 </span><span class="lineCov">              1 :         const diskindex::MMapIndexer&amp; tagIndexer() const { return tagidx; }</span>
-<span class="lineNum">     176 </span>                : 
-<span class="lineNum">     177 </span>                :         template&lt;typename ITEMS, typename TAGS&gt;
-<span class="lineNum">     178 </span><span class="lineCov">          21133 :         void insert(const ITEMS&amp; items, const TAGS&amp; tags)</span>
-<span class="lineNum">     179 </span>                :         {
-<span class="lineNum">     180 </span><span class="lineCov">          21133 :                 if (tags.empty())</span>
-<span class="lineNum">     181 </span><span class="lineNoCov">              0 :                         return;</span>
-<span class="lineNum">     182 </span><span class="lineCov">          42266 :                 for (typename ITEMS::const_iterator it = items.begin();</span>
-<span class="lineNum">     183 </span>                :                                 it != items.end(); ++it)
-<span class="lineNum">     184 </span><span class="lineCov">         126731 :                         for (typename TAGS::const_iterator ta = tags.begin();</span>
-<span class="lineNum">     185 </span>                :                                         ta != tags.end(); ++ta)
-<span class="lineNum">     186 </span>                :                         {
-<span class="lineNum">     187 </span><span class="lineCov">         105598 :                                 pkgidx.map(*it, *ta);</span>
-<span class="lineNum">     188 </span><span class="lineCov">         105598 :                                 tagidx.map(*ta, *it);</span>
-<span class="lineNum">     189 </span>                :                         }
-<span class="lineNum">     190 </span>                :         }
-<span class="lineNum">     191 </span>                : };
-<span class="lineNum">     192 </span>                : 
-<span class="lineNum">     193 </span>                : 
-<span class="lineNum">     194 </span>                : }
-<span class="lineNum">     195 </span>                : }
-<span class="lineNum">     196 </span>                : 
-<span class="lineNum">     197 </span>                : // vim:set ts=4 sw=4:
-<span class="lineNum">     198 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/patched.h.gcov.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/patched.h.gcov.html
deleted file mode 100644
index 78a82c0..0000000
--- a/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/patched.h.gcov.html
+++ /dev/null
@@ -1,307 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/coll/patched.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/tagcoll-2.0.11/tagcoll/coll</a> - patched.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">57</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">66.7 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">38</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #ifndef TAGCOLL_COLL_PATCHED_H
-<span class="lineNum">       2 </span>                : #define TAGCOLL_COLL_PATCHED_H
-<span class="lineNum">       3 </span>                : 
-<span class="lineNum">       4 </span>                : /** \file
-<span class="lineNum">       5 </span>                :  * Wrap a Collection, preserving modifications as patches
-<span class="lineNum">       6 </span>                :  */
-<span class="lineNum">       7 </span>                : 
-<span class="lineNum">       8 </span>                : /*
-<span class="lineNum">       9 </span>                :  * Copyright (C) 2005,2006  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">      10 </span>                :  *
-<span class="lineNum">      11 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">      12 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">      13 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">      14 </span>                :  * (at your option) any later version.
-<span class="lineNum">      15 </span>                :  *
-<span class="lineNum">      16 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      17 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      18 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      19 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      20 </span>                :  *
-<span class="lineNum">      21 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      22 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      23 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      24 </span>                :  */
-<span class="lineNum">      25 </span>                : 
-<span class="lineNum">      26 </span>                : #include &lt;tagcoll/coll/base.h&gt;
-<span class="lineNum">      27 </span>                : #include &lt;tagcoll/patch.h&gt;
-<span class="lineNum">      28 </span>                : 
-<span class="lineNum">      29 </span>                : namespace tagcoll {
-<span class="lineNum">      30 </span>                : template&lt;typename T1, typename T2&gt; class PatchList;
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span>                : namespace coll {
-<span class="lineNum">      33 </span>                : template&lt;typename ROCOLL&gt;
-<span class="lineNum">      34 </span>                : class Patched;
-<span class="lineNum">      35 </span>                : 
-<span class="lineNum">      36 </span>                : template&lt;typename ROCOLL&gt;
-<span class="lineNum">      37 </span>                : struct coll_traits&lt; Patched&lt;ROCOLL&gt; &gt;
-<span class="lineNum">      38 </span>                : {
-<span class="lineNum">      39 </span>                :         typedef typename coll_traits&lt;ROCOLL&gt;::item_type item_type;
-<span class="lineNum">      40 </span>                :         typedef typename coll_traits&lt;ROCOLL&gt;::tag_type tag_type;
-<span class="lineNum">      41 </span>                :         typedef typename coll_traits&lt;ROCOLL&gt;::tagset_type tagset_type;
-<span class="lineNum">      42 </span>                :         typedef typename coll_traits&lt;ROCOLL&gt;::itemset_type itemset_type;
-<span class="lineNum">      43 </span>                : };
-<span class="lineNum">      44 </span>                : 
-<span class="lineNum">      45 </span>                : /**
-<span class="lineNum">      46 </span>                :  * Wraps a collection by intercepting all changes to it and preserving them as
-<span class="lineNum">      47 </span>                :  * a PatchList.
-<span class="lineNum">      48 </span>                :  */
-<span class="lineNum">      49 </span>                : template&lt;typename ROCOLL&gt;
-<span class="lineNum">      50 </span>                : class Patched : public coll::Collection&lt; Patched&lt;ROCOLL&gt; &gt;
-<span class="lineNum">      51 </span><span class="lineCov">             10 : {</span>
-<span class="lineNum">      52 </span>                : public:
-<span class="lineNum">      53 </span>                :         typedef tagcoll::Patch&lt;
-<span class="lineNum">      54 </span>                :                 typename coll_traits&lt;ROCOLL&gt;::item_type,
-<span class="lineNum">      55 </span>                :                 typename coll_traits&lt;ROCOLL&gt;::tag_type&gt; Patch;
-<span class="lineNum">      56 </span>                :         typedef tagcoll::PatchList&lt;
-<span class="lineNum">      57 </span>                :                 typename coll_traits&lt;ROCOLL&gt;::item_type,
-<span class="lineNum">      58 </span>                :                 typename coll_traits&lt;ROCOLL&gt;::tag_type&gt; Patches;
-<span class="lineNum">      59 </span>                :         typedef tagcoll::Patch&lt;
-<span class="lineNum">      60 </span>                :                 typename coll_traits&lt;ROCOLL&gt;::tag_type,
-<span class="lineNum">      61 </span>                :                 typename coll_traits&lt;ROCOLL&gt;::item_type&gt; RPatch;
-<span class="lineNum">      62 </span>                :         typedef tagcoll::PatchList&lt;
-<span class="lineNum">      63 </span>                :                 typename coll_traits&lt;ROCOLL&gt;::tag_type,
-<span class="lineNum">      64 </span>                :                 typename coll_traits&lt;ROCOLL&gt;::item_type&gt; RPatches;
-<span class="lineNum">      65 </span>                : 
-<span class="lineNum">      66 </span>                : protected:
-<span class="lineNum">      67 </span>                :         typedef typename coll_traits&lt;ROCOLL&gt;::item_type Item;
-<span class="lineNum">      68 </span>                :         typedef typename coll_traits&lt;ROCOLL&gt;::tag_type Tag;
-<span class="lineNum">      69 </span>                :         typedef typename coll_traits&lt;ROCOLL&gt;::itemset_type ItemSet;
-<span class="lineNum">      70 </span>                :         typedef typename coll_traits&lt;ROCOLL&gt;::tagset_type TagSet;
-<span class="lineNum">      71 </span>                : 
-<span class="lineNum">      72 </span>                :         const ROCOLL&amp; coll;
-<span class="lineNum">      73 </span>                :         Patches m_changes;
-<span class="lineNum">      74 </span>                :         RPatches m_rchanges;
-<span class="lineNum">      75 </span>                : 
-<span class="lineNum">      76 </span>                : #if 0
-<span class="lineNum">      77 </span>                :         virtual void consumeItem(const ITEM&amp; item, const std::set&lt;TAG&gt;&amp; tags);
-<span class="lineNum">      78 </span>                : 
-<span class="lineNum">      79 </span>                :         virtual std::set&lt;ITEM&gt; getItemsHavingTag(const TAG&amp; tag) const;
-<span class="lineNum">      80 </span>                :         virtual std::set&lt;TAG&gt; getTagsOfItem(const ITEM&amp; item) const;
-<span class="lineNum">      81 </span>                : #endif
-<span class="lineNum">      82 </span>                : 
-<span class="lineNum">      83 </span>                : public:
-<span class="lineNum">      84 </span>                :         typedef std::pair&lt;Item, TagSet&gt; value_type;
-<span class="lineNum">      85 </span>                : 
-<span class="lineNum">      86 </span>                :         class const_iterator
-<span class="lineNum">      87 </span>                :         {
-<span class="lineNum">      88 </span>                :                 const Patched&lt;ROCOLL&gt;&amp; coll;
-<span class="lineNum">      89 </span>                :                 typename ROCOLL::const_iterator ci;
-<span class="lineNum">      90 </span>                :                 typename Patches::const_iterator pi;
-<span class="lineNum">      91 </span>                :                 mutable typename Patched&lt;ROCOLL&gt;::value_type* cached_val;
-<span class="lineNum">      92 </span>                : 
-<span class="lineNum">      93 </span>                :         protected:
-<span class="lineNum">      94 </span>                :                 const_iterator(const Patched&lt;ROCOLL&gt;&amp; coll,
-<span class="lineNum">      95 </span>                :                                                 const typename ROCOLL::const_iterator&amp; ci,
-<span class="lineNum">      96 </span><span class="lineCov">          84592 :                                                 const typename Patches::const_iterator&amp; pi)</span>
-<span class="lineNum">      97 </span><span class="lineCov">          84592 :                         : coll(coll), ci(ci), pi(pi), cached_val(0) {}</span>
-<span class="lineNum">      98 </span>                :         
-<span class="lineNum">      99 </span>                :         public:
-<span class="lineNum">     100 </span><span class="lineCov">         148035 :                 ~const_iterator()</span>
-<span class="lineNum">     101 </span>                :                 {
-<span class="lineNum">     102 </span><span class="lineCov">         148035 :                         if (cached_val)</span>
-<span class="lineNum">     103 </span><span class="lineNoCov">              0 :                                 delete cached_val;</span>
-<span class="lineNum">     104 </span><span class="lineCov">         148035 :                 }</span>
-<span class="lineNum">     105 </span><span class="lineCov">          84580 :                 const typename Patched&lt;ROCOLL&gt;::value_type operator*() const</span>
-<span class="lineNum">     106 </span>                :                 {
-<span class="lineNum">     107 </span><span class="lineCov">          84580 :                         if (cached_val)</span>
-<span class="lineNum">     108 </span><span class="lineNoCov">              0 :                                 return *cached_val;</span>
-<span class="lineNum">     109 </span>                : 
-<span class="lineNum">     110 </span><span class="lineCov">          84580 :                         if (ci == coll.coll.end() &amp;&amp; pi == coll.m_changes.end())</span>
-<span class="lineNum">     111 </span><span class="lineNoCov">              0 :                                 return *(typename Patched&lt;ROCOLL&gt;::value_type*)0;</span>
-<span class="lineNum">     112 </span><span class="lineCov">          84580 :                         else if (pi == coll.m_changes.end())</span>
-<span class="lineNum">     113 </span><span class="lineCov">          84580 :                                 return *ci;</span>
-<span class="lineNum">     114 </span><span class="lineNoCov">              0 :                         else if (ci == coll.coll.end())</span>
-<span class="lineNum">     115 </span><span class="lineNoCov">              0 :                                 return make_pair(pi-&gt;first, pi-&gt;second.added);</span>
-<span class="lineNum">     116 </span><span class="lineNoCov">              0 :                         else if (ci-&gt;first &lt; pi-&gt;first)</span>
-<span class="lineNum">     117 </span><span class="lineNoCov">              0 :                                 return *ci;</span>
-<span class="lineNum">     118 </span><span class="lineNoCov">              0 :                         else if (ci-&gt;first &gt; pi-&gt;first)</span>
-<span class="lineNum">     119 </span><span class="lineNoCov">              0 :                                 return make_pair(pi-&gt;first, pi-&gt;second.added);</span>
-<span class="lineNum">     120 </span>                :                         else
-<span class="lineNum">     121 </span><span class="lineNoCov">              0 :                                 return make_pair(ci-&gt;first, pi-&gt;second.apply(ci-&gt;second));</span>
-<span class="lineNum">     122 </span>                :                 }
-<span class="lineNum">     123 </span><span class="lineCov">         211450 :                 const typename Patched&lt;ROCOLL&gt;::value_type* operator-&gt;() const</span>
-<span class="lineNum">     124 </span>                :                 {
-<span class="lineNum">     125 </span><span class="lineCov">         211450 :                         if (cached_val)</span>
-<span class="lineNum">     126 </span><span class="lineCov">         126870 :                                 return cached_val;</span>
-<span class="lineNum">     127 </span><span class="lineCov">          84580 :                         return cached_val = new typename Patched&lt;ROCOLL&gt;::value_type(*(*this));</span>
-<span class="lineNum">     128 </span>                :                 }
-<span class="lineNum">     129 </span><span class="lineCov">          84580 :                 const_iterator&amp; operator++()</span>
-<span class="lineNum">     130 </span>                :                 {
-<span class="lineNum">     131 </span><span class="lineCov">          84580 :                         if (ci == coll.coll.end() &amp;&amp; pi == coll.m_changes.end())</span>
-<span class="lineNum">     132 </span>                :                                 ;
-<span class="lineNum">     133 </span><span class="lineCov">          84580 :                         else if (pi == coll.m_changes.end())</span>
-<span class="lineNum">     134 </span><span class="lineCov">          84580 :                                 ++ci;</span>
-<span class="lineNum">     135 </span><span class="lineNoCov">              0 :                         else if (ci == coll.coll.end())</span>
-<span class="lineNum">     136 </span><span class="lineNoCov">              0 :                                 ++pi;</span>
-<span class="lineNum">     137 </span><span class="lineNoCov">              0 :                         else if (ci-&gt;first &lt; pi-&gt;first)</span>
-<span class="lineNum">     138 </span><span class="lineNoCov">              0 :                                 ++ci;</span>
-<span class="lineNum">     139 </span><span class="lineNoCov">              0 :                         else if (ci-&gt;first &gt; pi-&gt;first)</span>
-<span class="lineNum">     140 </span><span class="lineNoCov">              0 :                                 ++pi;</span>
-<span class="lineNum">     141 </span>                :                         else
-<span class="lineNum">     142 </span>                :                         {
-<span class="lineNum">     143 </span><span class="lineNoCov">              0 :                                 ++ci;</span>
-<span class="lineNum">     144 </span><span class="lineNoCov">              0 :                                 ++pi;</span>
-<span class="lineNum">     145 </span>                :                         }
-<span class="lineNum">     146 </span><span class="lineCov">          84580 :                         if (cached_val)</span>
-<span class="lineNum">     147 </span>                :                         {
-<span class="lineNum">     148 </span><span class="lineCov">          84580 :                                 delete cached_val;</span>
-<span class="lineNum">     149 </span><span class="lineCov">          84580 :                                 cached_val = 0;</span>
-<span class="lineNum">     150 </span>                :                         }
-<span class="lineNum">     151 </span><span class="lineCov">          84580 :                         return *this;</span>
-<span class="lineNum">     152 </span>                :                 }
-<span class="lineNum">     153 </span><span class="lineCov">              1 :                 bool operator==(const const_iterator&amp; iter) const</span>
-<span class="lineNum">     154 </span>                :                 {
-<span class="lineNum">     155 </span><span class="lineCov">              1 :                         return ci == iter.ci &amp;&amp; pi == iter.pi;</span>
-<span class="lineNum">     156 </span>                :                 }
-<span class="lineNum">     157 </span><span class="lineCov">          84585 :                 bool operator!=(const const_iterator&amp; iter) const</span>
-<span class="lineNum">     158 </span>                :                 {
-<span class="lineNum">     159 </span><span class="lineCov">          84585 :                         return ci != iter.ci || pi != iter.pi;</span>
-<span class="lineNum">     160 </span>                :                 }
-<span class="lineNum">     161 </span>                :                 
-<span class="lineNum">     162 </span>                :                 friend class Patched&lt;ROCOLL&gt;;
-<span class="lineNum">     163 </span>                :         };
-<span class="lineNum">     164 </span><span class="lineCov">              6 :         const_iterator begin() const { return const_iterator(*this, coll.begin(), m_changes.begin()); }</span>
-<span class="lineNum">     165 </span><span class="lineCov">          84586 :         const_iterator end() const { return const_iterator(*this, coll.end(), m_changes.end()); }</span>
-<span class="lineNum">     166 </span>                : 
-<span class="lineNum">     167 </span><span class="lineCov">             10 :         Patched(const ROCOLL&amp; coll) : coll(coll) {}</span>
-<span class="lineNum">     168 </span>                : 
-<span class="lineNum">     169 </span>                :         template&lt;typename ITEMS, typename TAGS&gt;
-<span class="lineNum">     170 </span>                :         void insert(const ITEMS&amp; items, const TAGS&amp; tags);
-<span class="lineNum">     171 </span>                : 
-<span class="lineNum">     172 </span>                :         template&lt;typename ITEMS&gt;
-<span class="lineNum">     173 </span>                :         void insert(const ITEMS&amp; items, const wibble::Empty&lt;Tag&gt;&amp; tags)
-<span class="lineNum">     174 </span>                :         {
-<span class="lineNum">     175 </span>                :                 // Nothing to do in this case
-<span class="lineNum">     176 </span>                :         }
-<span class="lineNum">     177 </span>                : 
-<span class="lineNum">     178 </span>                :         /**
-<span class="lineNum">     179 </span>                :          * Removes all items from the collection
-<span class="lineNum">     180 </span>                :          */
-<span class="lineNum">     181 </span>                :         void clear();
-<span class="lineNum">     182 </span>                : 
-<span class="lineNum">     183 </span>                :         /**
-<span class="lineNum">     184 </span>                :          * Get the changes that have been applied to this collection
-<span class="lineNum">     185 </span>                :          */
-<span class="lineNum">     186 </span><span class="lineCov">              4 :         const Patches&amp; changes() const { return m_changes; }</span>
-<span class="lineNum">     187 </span>                : 
-<span class="lineNum">     188 </span>                :         /**
-<span class="lineNum">     189 </span>                :          * Throw away all changes previously applied to this collection
-<span class="lineNum">     190 </span>                :          */
-<span class="lineNum">     191 </span>                :         void resetChanges() { m_changes.clear(); m_rchanges.clear(); }
-<span class="lineNum">     192 </span>                : 
-<span class="lineNum">     193 </span>                :         /**
-<span class="lineNum">     194 </span>                :          * Set the changes list to a specific patch list
-<span class="lineNum">     195 </span>                :          */
-<span class="lineNum">     196 </span><span class="lineNoCov">              0 :         void setChanges(const Patches&amp; changes);</span>
-<span class="lineNum">     197 </span>                : 
-<span class="lineNum">     198 </span>                :         /**
-<span class="lineNum">     199 </span>                :          * Add a specific patch list to the changes list
-<span class="lineNum">     200 </span>                :          */
-<span class="lineNum">     201 </span><span class="lineCov">              2 :         void addChanges(const Patches&amp; changes);</span>
-<span class="lineNum">     202 </span>                : 
-<span class="lineNum">     203 </span>                :     bool hasTag(const Tag&amp; tag) const;
-<span class="lineNum">     204 </span>                : 
-<span class="lineNum">     205 </span><span class="lineCov">              5 :         TagSet getTagsOfItem(const Item&amp; item) const</span>
-<span class="lineNum">     206 </span>                :         {
-<span class="lineNum">     207 </span><span class="lineCov">              5 :                 return m_changes.patch(item, coll.getTagsOfItem(item));</span>
-<span class="lineNum">     208 </span>                :         }
-<span class="lineNum">     209 </span><span class="lineCov">              9 :         ItemSet getItemsHavingTag(const typename coll_traits&lt;ROCOLL&gt;::tag_type&amp; tag) const</span>
-<span class="lineNum">     210 </span>                :         {
-<span class="lineNum">     211 </span><span class="lineCov">              9 :                 return m_rchanges.patch(tag, coll.getItemsHavingTag(tag));</span>
-<span class="lineNum">     212 </span>                :         }
-<span class="lineNum">     213 </span>                : 
-<span class="lineNum">     214 </span>                :         ItemSet getTaggedItems() const;
-<span class="lineNum">     215 </span><span class="lineCov">              1 :         TagSet getAllTags() const;</span>
-<span class="lineNum">     216 </span>                : 
-<span class="lineNum">     217 </span>                :         unsigned int tagCount() const { return getAllTags().size(); }
-<span class="lineNum">     218 </span>                : 
-<span class="lineNum">     219 </span>                :         unsigned int getCardinality(const Tag&amp; tag) const;
-<span class="lineNum">     220 </span>                : 
-<span class="lineNum">     221 </span><span class="lineCov">              2 :         void applyChange(const Patches&amp; change) { this-&gt;addChanges(change); }</span>
-<span class="lineNum">     222 </span>                : 
-<span class="lineNum">     223 </span>                : #if 0
-<span class="lineNum">     224 </span>                :         template&lt;typename OUT&gt;
-<span class="lineNum">     225 </span>                :         void output(OUT out) const
-<span class="lineNum">     226 </span>                :         {
-<span class="lineNum">     227 </span>                :                 for (const_iterator i = begin(); i != end(); ++i)
-<span class="lineNum">     228 </span>                :                 {
-<span class="lineNum">     229 </span>                :                         *out = *i;
-<span class="lineNum">     230 </span>                :                         ++out;
-<span class="lineNum">     231 </span>                :                 }
-<span class="lineNum">     232 </span>                :         }
-<span class="lineNum">     233 </span>                : #endif
-<span class="lineNum">     234 </span>                : };
-<span class="lineNum">     235 </span>                : 
-<span class="lineNum">     236 </span>                : }
-<span class="lineNum">     237 </span>                : }
-<span class="lineNum">     238 </span>                : 
-<span class="lineNum">     239 </span>                : // vim:set ts=4 sw=4:
-<span class="lineNum">     240 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/patched.tcc.gcov.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/patched.tcc.gcov.html
deleted file mode 100644
index d6a3fec..0000000
--- a/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/patched.tcc.gcov.html
+++ /dev/null
@@ -1,274 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/coll/patched.tcc</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/tagcoll-2.0.11/tagcoll/coll</a> - patched.tcc</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">22</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">59.1 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">13</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /*
-<span class="lineNum">       2 </span>                :  * Wrap a Collection, preserving modifications as patches
-<span class="lineNum">       3 </span>                :  *
-<span class="lineNum">       4 </span>                :  * Copyright (C) 2005,2006  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">       5 </span>                :  *
-<span class="lineNum">       6 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">       7 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">       8 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">       9 </span>                :  * (at your option) any later version.
-<span class="lineNum">      10 </span>                :  *
-<span class="lineNum">      11 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      12 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      13 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      14 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      15 </span>                :  *
-<span class="lineNum">      16 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      17 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      18 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      19 </span>                :  */
-<span class="lineNum">      20 </span>                : 
-<span class="lineNum">      21 </span>                : #ifndef TAGCOLL_COLL_PATCHED_TCC
-<span class="lineNum">      22 </span>                : #define TAGCOLL_COLL_PATCHED_TCC
-<span class="lineNum">      23 </span>                : 
-<span class="lineNum">      24 </span>                : #include &lt;tagcoll/coll/patched.h&gt;
-<span class="lineNum">      25 </span>                : #include &lt;tagcoll/utils/set.h&gt;
-<span class="lineNum">      26 </span>                : 
-<span class="lineNum">      27 </span>                : #include &lt;wibble/operators.h&gt;
-<span class="lineNum">      28 </span>                : 
-<span class="lineNum">      29 </span>                : using namespace std;
-<span class="lineNum">      30 </span>                : using namespace wibble::operators;
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span>                : namespace tagcoll {
-<span class="lineNum">      33 </span>                : namespace coll {
-<span class="lineNum">      34 </span>                : 
-<span class="lineNum">      35 </span>                : template&lt;typename ROCOLL&gt; template&lt;typename ITEMS, typename TAGS&gt;
-<span class="lineNum">      36 </span>                : void Patched&lt;ROCOLL&gt;::insert(const ITEMS&amp; items, const TAGS&amp; tags)
-<span class="lineNum">      37 </span>                : {
-<span class="lineNum">      38 </span>                :         Patches changes;
-<span class="lineNum">      39 </span>                :         for (typename ITEMS::const_iterator i = items.begin();
-<span class="lineNum">      40 </span>                :                         i != items.end(); ++i)
-<span class="lineNum">      41 </span>                :                 changes.addPatch(Patch(*i, tags, TagSet()));
-<span class="lineNum">      42 </span>                :         addChanges(changes);
-<span class="lineNum">      43 </span>                : }
-<span class="lineNum">      44 </span>                : 
-<span class="lineNum">      45 </span>                : 
-<span class="lineNum">      46 </span>                : template&lt;typename ROCOLL&gt;
-<span class="lineNum">      47 </span>                : void Patched&lt;ROCOLL&gt;::clear()
-<span class="lineNum">      48 </span>                : {
-<span class="lineNum">      49 </span>                :         // Remove all patches
-<span class="lineNum">      50 </span>                :         m_changes.clear();
-<span class="lineNum">      51 </span>                :         m_rchanges.clear();
-<span class="lineNum">      52 </span>                : 
-<span class="lineNum">      53 </span>                :         // Add all tagsets of the underlying collection as removed tags in the patch
-<span class="lineNum">      54 </span>                :         for (typename ROCOLL::const_iterator i = coll.begin();
-<span class="lineNum">      55 </span>                :                         i != coll.end(); ++i)
-<span class="lineNum">      56 </span>                :         {
-<span class="lineNum">      57 </span>                :                 m_changes.addPatch(Patch(i-&gt;first, std::set&lt;Tag&gt;(), i-&gt;second));
-<span class="lineNum">      58 </span>                : 
-<span class="lineNum">      59 </span>                :                 for (typename TagSet::const_iterator j = i-&gt;second.begin();
-<span class="lineNum">      60 </span>                :                                 j != i-&gt;second.end(); ++j)
-<span class="lineNum">      61 </span>                :                         m_rchanges.addPatch(Patch(*j, wibble::Empty&lt;Tag&gt;(), wibble::singleton(i-&gt;first)));
-<span class="lineNum">      62 </span>                :         }
-<span class="lineNum">      63 </span>                : }
-<span class="lineNum">      64 </span>                : 
-<span class="lineNum">      65 </span>                : template&lt;typename ROCOLL&gt;
-<span class="lineNum">      66 </span>                : void Patched&lt;ROCOLL&gt;::setChanges(const Patches&amp; changes)
-<span class="lineNum">      67 </span>                : {
-<span class="lineNum">      68 </span><span class="lineNoCov">              0 :         this-&gt;m_changes.clear();</span>
-<span class="lineNum">      69 </span><span class="lineNoCov">              0 :         this-&gt;m_rchanges.clear();</span>
-<span class="lineNum">      70 </span>                :         
-<span class="lineNum">      71 </span><span class="lineNoCov">              0 :         addChanges(changes);</span>
-<span class="lineNum">      72 </span><span class="lineNoCov">              0 : }</span>
-<span class="lineNum">      73 </span>                : 
-<span class="lineNum">      74 </span>                : template&lt;typename ROCOLL&gt;
-<span class="lineNum">      75 </span>                : void Patched&lt;ROCOLL&gt;::addChanges(const Patches&amp; changes)
-<span class="lineNum">      76 </span>                : {
-<span class="lineNum">      77 </span>                :         // Simplify the patch against the contents of `coll' before adding it.
-<span class="lineNum">      78 </span><span class="lineCov">              4 :         for (typename Patches::const_iterator i = changes.begin(); i != changes.end(); ++i)</span>
-<span class="lineNum">      79 </span>                :                 // Consider only valid items
-<span class="lineNum">      80 </span><span class="lineCov">              2 :                 if (i-&gt;first != Item())</span>
-<span class="lineNum">      81 </span>                :                 {
-<span class="lineNum">      82 </span>                :                         // Merge with existing patches
-<span class="lineNum">      83 </span><span class="lineCov">              2 :                         this-&gt;m_changes.addPatch(i-&gt;second);</span>
-<span class="lineNum">      84 </span>                :                         // Simplify the result
-<span class="lineNum">      85 </span><span class="lineCov">              2 :                         this-&gt;m_changes.removeRedundant(i-&gt;first, coll.getTagsOfItem(i-&gt;first));</span>
-<span class="lineNum">      86 </span>                :                 }
-<span class="lineNum">      87 </span>                : 
-<span class="lineNum">      88 </span><span class="lineCov">              2 :         RPatches rchanges;</span>
-<span class="lineNum">      89 </span><span class="lineCov">              2 :         rchanges.addPatchInverted(changes);</span>
-<span class="lineNum">      90 </span><span class="lineCov">              4 :         for (typename RPatches::const_iterator i = rchanges.begin(); i != rchanges.end(); ++i)</span>
-<span class="lineNum">      91 </span>                :                 // Consider only valid tags
-<span class="lineNum">      92 </span><span class="lineCov">              2 :                 if (i-&gt;first != Tag())</span>
-<span class="lineNum">      93 </span>                :                 {
-<span class="lineNum">      94 </span>                :                         // Merge with existing patches
-<span class="lineNum">      95 </span><span class="lineCov">              2 :                         this-&gt;m_rchanges.addPatch(i-&gt;second);</span>
-<span class="lineNum">      96 </span>                :                         // Simplify the result
-<span class="lineNum">      97 </span><span class="lineCov">              4 :                         this-&gt;m_rchanges.removeRedundant(i-&gt;first, coll.getItemsHavingTag(i-&gt;first));</span>
-<span class="lineNum">      98 </span>                :                 }
-<span class="lineNum">      99 </span><span class="lineCov">              2 : }</span>
-<span class="lineNum">     100 </span>                : 
-<span class="lineNum">     101 </span>                : template&lt;typename ROCOLL&gt;
-<span class="lineNum">     102 </span>                : bool Patched&lt;ROCOLL&gt;::hasTag(const Tag&amp; tag) const
-<span class="lineNum">     103 </span>                : {
-<span class="lineNum">     104 </span>                :         typename RPatches::const_iterator i = m_rchanges.find(tag);
-<span class="lineNum">     105 </span>                :         if (i == m_rchanges.end())
-<span class="lineNum">     106 </span>                :                 return coll.hasTag(tag);
-<span class="lineNum">     107 </span>                :         if (! i-&gt;second.added.empty())
-<span class="lineNum">     108 </span>                :                 return true;
-<span class="lineNum">     109 </span>                :         return !this-&gt;getItemsHavingTag(tag).empty();
-<span class="lineNum">     110 </span>                : }
-<span class="lineNum">     111 </span>                : 
-<span class="lineNum">     112 </span>                : template&lt;typename ROCOLL&gt;
-<span class="lineNum">     113 </span>                : typename coll_traits&lt;ROCOLL&gt;::itemset_type Patched&lt;ROCOLL&gt;::getTaggedItems() const
-<span class="lineNum">     114 </span>                : {
-<span class="lineNum">     115 </span>                :         ItemSet res(coll.getTaggedItems());
-<span class="lineNum">     116 </span>                :         for (typename Patches::const_iterator i = m_changes.begin();
-<span class="lineNum">     117 </span>                :                         i != m_changes.end(); ++i)
-<span class="lineNum">     118 </span>                :                 if (!i-&gt;second.added.empty())
-<span class="lineNum">     119 </span>                :                         // Add packages for which tags are added
-<span class="lineNum">     120 </span>                :                         res |= i-&gt;first;
-<span class="lineNum">     121 </span>                :                 else if (getTagsOfItem(i-&gt;first).empty())
-<span class="lineNum">     122 </span>                :                         // Remove the packages to which the patch removes all tags
-<span class="lineNum">     123 </span>                :                         res -= i-&gt;first;
-<span class="lineNum">     124 </span>                :         return res;
-<span class="lineNum">     125 </span>                : }
-<span class="lineNum">     126 </span>                : 
-<span class="lineNum">     127 </span>                : template&lt;typename ROCOLL&gt;
-<span class="lineNum">     128 </span>                : typename coll_traits&lt;ROCOLL&gt;::tagset_type Patched&lt;ROCOLL&gt;::getAllTags() const
-<span class="lineNum">     129 </span>                : {
-<span class="lineNum">     130 </span><span class="lineCov">              1 :         TagSet res(coll.getAllTags());</span>
-<span class="lineNum">     131 </span><span class="lineCov">              1 :         for (typename RPatches::const_iterator i = m_rchanges.begin();</span>
-<span class="lineNum">     132 </span>                :                         i != m_rchanges.end(); ++i)
-<span class="lineNum">     133 </span><span class="lineNoCov">              0 :                 if (!i-&gt;second.added.empty())</span>
-<span class="lineNum">     134 </span>                :                         // Add tags for which packages are added
-<span class="lineNum">     135 </span><span class="lineNoCov">              0 :                         res |= i-&gt;first;</span>
-<span class="lineNum">     136 </span><span class="lineNoCov">              0 :                 else if (coll.getCardinality(i-&gt;first) - i-&gt;second.removed.size() &lt;= 0)</span>
-<span class="lineNum">     137 </span>                :                         // Remove the tags to which the patch removes all items
-<span class="lineNum">     138 </span><span class="lineNoCov">              0 :                         res -= i-&gt;first;</span>
-<span class="lineNum">     139 </span><span class="lineNoCov">              0 :         return res;</span>
-<span class="lineNum">     140 </span>                : }
-<span class="lineNum">     141 </span>                : 
-<span class="lineNum">     142 </span>                : #if 0
-<span class="lineNum">     143 </span>                : template&lt;typename ITEM, typename TAG, typename OUT&gt;
-<span class="lineNum">     144 </span>                : class UnpatchedOnly : public wibble::mixin::OutputIterator&lt; UnpatchedOnly&lt;ITEM, TAG, OUT&gt; &gt;
-<span class="lineNum">     145 </span>                : {
-<span class="lineNum">     146 </span>                : protected:
-<span class="lineNum">     147 </span>                :         OUT out;
-<span class="lineNum">     148 </span>                :         const PatchList&lt;ITEM, TAG&gt;&amp; changes;
-<span class="lineNum">     149 </span>                : 
-<span class="lineNum">     150 </span>                : public: 
-<span class="lineNum">     151 </span>                :         UnpatchedOnly(const PatchList&lt;ITEM, TAG&gt;&amp; changes, const OUT&amp; out) : out(out), changes(changes) {}
-<span class="lineNum">     152 </span>                : 
-<span class="lineNum">     153 </span>                :         UnpatchedOnly&lt;ITEM, TAG, OUT&gt;&amp; operator++() { return *this; }
-<span class="lineNum">     154 </span>                :         
-<span class="lineNum">     155 </span>                :         template&lt;typename Items, typename Tags&gt;
-<span class="lineNum">     156 </span>                :         UnpatchedOnly&lt;ITEM, TAG, OUT&gt;&amp; operator=(const std::pair&lt;Items, Tags&gt;&amp; data)
-<span class="lineNum">     157 </span>                :         {
-<span class="lineNum">     158 </span>                :                 for (typename Items::const_iterator i = data.first.begin();
-<span class="lineNum">     159 </span>                :                                 i != data.first.end(); ++i)
-<span class="lineNum">     160 </span>                :                         if (changes.find(*i) == changes.end())
-<span class="lineNum">     161 </span>                :                         {
-<span class="lineNum">     162 </span>                :                                 *out = data;
-<span class="lineNum">     163 </span>                :                                 ++out;
-<span class="lineNum">     164 </span>                :                         }
-<span class="lineNum">     165 </span>                :                 return *this;
-<span class="lineNum">     166 </span>                :         }
-<span class="lineNum">     167 </span>                : };
-<span class="lineNum">     168 </span>                : 
-<span class="lineNum">     169 </span>                : template&lt;typename ITEM, typename TAG, typename OUT&gt;
-<span class="lineNum">     170 </span>                : UnpatchedOnly&lt;ITEM, TAG, OUT&gt; unpatchedOnly(const PatchList&lt;ITEM, TAG&gt;&amp; changes, const OUT&amp; out)
-<span class="lineNum">     171 </span>                : {
-<span class="lineNum">     172 </span>                :         return UnpatchedOnly&lt;ITEM, TAG, OUT&gt;(changes, out);
-<span class="lineNum">     173 </span>                : }
-<span class="lineNum">     174 </span>                : 
-<span class="lineNum">     175 </span>                : template&lt;class ITEM, class TAG&gt;
-<span class="lineNum">     176 </span>                : void Patched&lt;ITEM, TAG&gt;::output(Consumer&lt;ITEM, TAG&gt;&amp; cons) const
-<span class="lineNum">     177 </span>                : {
-<span class="lineNum">     178 </span>                :         // First, only pass the unpatched items
-<span class="lineNum">     179 </span>                :         coll.outputToIterator(unpatchedOnly(changes, consumer(cons)));
-<span class="lineNum">     180 </span>                : 
-<span class="lineNum">     181 </span>                :         // Then output the items in the patch
-<span class="lineNum">     182 </span>                :         for (typename PatchList&lt;ITEM, TAG&gt;::const_iterator i = changes.begin();
-<span class="lineNum">     183 </span>                :                         i != changes.end(); i++)
-<span class="lineNum">     184 </span>                :                 cons.consume(i-&gt;first,
-<span class="lineNum">     185 </span>                :                                 changes.patch(i-&gt;first, coll.getTags(i-&gt;first)));
-<span class="lineNum">     186 </span>                : }
-<span class="lineNum">     187 </span>                : #endif
-<span class="lineNum">     188 </span>                : 
-<span class="lineNum">     189 </span>                : template&lt;typename ROCOLL&gt;
-<span class="lineNum">     190 </span>                : unsigned int Patched&lt;ROCOLL&gt;::getCardinality(const Tag&amp; tag) const
-<span class="lineNum">     191 </span>                : {
-<span class="lineNum">     192 </span>                :         typename RPatches::const_iterator i = m_rchanges.find(tag);
-<span class="lineNum">     193 </span>                :         if (i == m_rchanges.end())
-<span class="lineNum">     194 </span>                :                 return coll.getCardinality(tag);
-<span class="lineNum">     195 </span>                :         else
-<span class="lineNum">     196 </span>                :                 return coll.getCardinality(tag) + i-&gt;second.added.size() - i-&gt;second.removed.size();
-<span class="lineNum">     197 </span>                : }
-<span class="lineNum">     198 </span>                : 
-<span class="lineNum">     199 </span>                : }
-<span class="lineNum">     200 </span>                : }
-<span class="lineNum">     201 </span>                : 
-<span class="lineNum">     202 </span>                : #include &lt;tagcoll/coll/base.tcc&gt;
-<span class="lineNum">     203 </span>                : #include &lt;tagcoll/patch.tcc&gt;
-<span class="lineNum">     204 </span>                : 
-<span class="lineNum">     205 </span>                : #endif
-<span class="lineNum">     206 </span>                : 
-<span class="lineNum">     207 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/simple.h.gcov.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/simple.h.gcov.html
deleted file mode 100644
index 3ffdd0c..0000000
--- a/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/simple.h.gcov.html
+++ /dev/null
@@ -1,205 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/coll/simple.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/tagcoll-2.0.11/tagcoll/coll</a> - simple.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">14</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">14</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #ifndef TAGCOLL_COLL_SIMPLE_H
-<span class="lineNum">       2 </span>                : #define TAGCOLL_COLL_SIMPLE_H
-<span class="lineNum">       3 </span>                : 
-<span class="lineNum">       4 </span>                : /** \file
-<span class="lineNum">       5 </span>                :  * Simple tagged collection.
-<span class="lineNum">       6 </span>                :  *
-<span class="lineNum">       7 </span>                :  * Also used for merging tags of items appearing multiple times in a stream of
-<span class="lineNum">       8 </span>                :  * tagged items
-<span class="lineNum">       9 </span>                :  */
-<span class="lineNum">      10 </span>                : 
-<span class="lineNum">      11 </span>                : /*
-<span class="lineNum">      12 </span>                :  * Copyright (C) 2003,2004,2005,2006  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">      13 </span>                :  *
-<span class="lineNum">      14 </span>                :  * This library is free software; you can redistribute it and/or
-<span class="lineNum">      15 </span>                :  * modify it under the terms of the GNU Lesser General Public
-<span class="lineNum">      16 </span>                :  * License as published by the Free Software Foundation; either
-<span class="lineNum">      17 </span>                :  * version 2.1 of the License, or (at your option) any later version.
-<span class="lineNum">      18 </span>                :  *
-<span class="lineNum">      19 </span>                :  * This library is distributed in the hope that it will be useful,
-<span class="lineNum">      20 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      21 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-<span class="lineNum">      22 </span>                :  * Lesser General Public License for more details.
-<span class="lineNum">      23 </span>                :  *
-<span class="lineNum">      24 </span>                :  * You should have received a copy of the GNU Lesser General Public
-<span class="lineNum">      25 </span>                :  * License along with this library; if not, write to the Free Software
-<span class="lineNum">      26 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
-<span class="lineNum">      27 </span>                :  */
-<span class="lineNum">      28 </span>                : 
-<span class="lineNum">      29 </span>                : #include &lt;tagcoll/coll/base.h&gt;
-<span class="lineNum">      30 </span>                : #include &lt;set&gt;
-<span class="lineNum">      31 </span>                : #include &lt;map&gt;
-<span class="lineNum">      32 </span>                : 
-<span class="lineNum">      33 </span>                : namespace tagcoll {
-<span class="lineNum">      34 </span>                : template&lt;typename ITEM, typename TAG&gt;
-<span class="lineNum">      35 </span>                : class PatchList;
-<span class="lineNum">      36 </span>                : 
-<span class="lineNum">      37 </span>                : namespace coll {
-<span class="lineNum">      38 </span>                : 
-<span class="lineNum">      39 </span>                : template&lt;typename ITEM, typename TAG&gt;
-<span class="lineNum">      40 </span>                : class Simple;
-<span class="lineNum">      41 </span>                : 
-<span class="lineNum">      42 </span>                : template&lt;typename ITEM, typename TAG&gt;
-<span class="lineNum">      43 </span>                : struct coll_traits&lt; Simple&lt;ITEM, TAG&gt; &gt;
-<span class="lineNum">      44 </span>                : {
-<span class="lineNum">      45 </span>                :         typedef ITEM item_type;
-<span class="lineNum">      46 </span>                :         typedef TAG tag_type;
-<span class="lineNum">      47 </span>                :         typedef std::set&lt;ITEM&gt; tagset_type;
-<span class="lineNum">      48 </span>                :         typedef std::set&lt;TAG&gt; itemset_type;
-<span class="lineNum">      49 </span>                : };
-<span class="lineNum">      50 </span>                : 
-<span class="lineNum">      51 </span>                : 
-<span class="lineNum">      52 </span>                : /**
-<span class="lineNum">      53 </span>                :  * Simple Collection.
-<span class="lineNum">      54 </span>                :  *
-<span class="lineNum">      55 </span>                :  * It can be used to merge input values: if an item is added multiple times,
-<span class="lineNum">      56 </span>                :  * its various tagsets are merged in a single one.
-<span class="lineNum">      57 </span>                :  *
-<span class="lineNum">      58 </span>                :  * It is also a full-featured collection, although not very optimized.
-<span class="lineNum">      59 </span>                :  */
-<span class="lineNum">      60 </span>                : template&lt;typename ITEM, typename TAG&gt;
-<span class="lineNum">      61 </span>                : class Simple : public coll::Collection&lt; Simple&lt;ITEM, TAG&gt; &gt;
-<span class="lineNum">      62 </span><span class="lineCov">             14 : {</span>
-<span class="lineNum">      63 </span>                : protected:
-<span class="lineNum">      64 </span>                :         std::map&lt; ITEM, std::set&lt;TAG&gt; &gt; coll;
-<span class="lineNum">      65 </span>                :         
-<span class="lineNum">      66 </span>                : #if 0
-<span class="lineNum">      67 </span>                :         virtual void consumeItem(const ITEM&amp; item, const std::set&lt;TAG&gt;&amp; tags);
-<span class="lineNum">      68 </span>                : 
-<span class="lineNum">      69 </span>                :         virtual std::set&lt;ITEM&gt; getItemsHavingTags(const std::set&lt;TAG&gt;&amp; tags) const;
-<span class="lineNum">      70 </span>                : #endif
-<span class="lineNum">      71 </span>                : 
-<span class="lineNum">      72 </span>                : public:
-<span class="lineNum">      73 </span>                :         typedef typename std::map&lt; ITEM, std::set&lt;TAG&gt; &gt;::const_iterator const_iterator;
-<span class="lineNum">      74 </span>                :         typedef typename std::map&lt; ITEM, std::set&lt;TAG&gt; &gt;::iterator iterator;
-<span class="lineNum">      75 </span>                :         typedef typename std::map&lt; ITEM, std::set&lt;TAG&gt; &gt;::value_type value_type;
-<span class="lineNum">      76 </span>                : 
-<span class="lineNum">      77 </span><span class="lineCov">              5 :         const_iterator begin() const { return coll.begin(); }</span>
-<span class="lineNum">      78 </span><span class="lineCov">          42298 :         const_iterator end() const { return coll.end(); }</span>
-<span class="lineNum">      79 </span><span class="lineCov">              1 :         iterator begin() { return coll.begin(); }</span>
-<span class="lineNum">      80 </span><span class="lineCov">          21146 :         iterator end() { return coll.end(); }</span>
-<span class="lineNum">      81 </span>                : 
-<span class="lineNum">      82 </span><span class="lineCov">              2 :         bool empty() const { return coll.empty(); }</span>
-<span class="lineNum">      83 </span>                : 
-<span class="lineNum">      84 </span>                :         template&lt;typename ITEMS, typename TAGS&gt;
-<span class="lineNum">      85 </span><span class="lineCov">              2 :         void insert(const ITEMS&amp; items, const TAGS&amp; tags);</span>
-<span class="lineNum">      86 </span>                : 
-<span class="lineNum">      87 </span>                :         bool hasItem(const ITEM&amp; item) const { return coll.find(item) != coll.end(); }
-<span class="lineNum">      88 </span>                : 
-<span class="lineNum">      89 </span><span class="lineCov">              2 :         std::set&lt;TAG&gt; getTagsOfItem(const ITEM&amp; item) const;</span>
-<span class="lineNum">      90 </span>                :         std::set&lt;ITEM&gt; getItemsHavingTag(const TAG&amp; tag) const;
-<span class="lineNum">      91 </span>                :         template&lt;typename TAGS&gt;
-<span class="lineNum">      92 </span>                :         std::set&lt;ITEM&gt; getItemsHavingTags(const TAGS&amp; tag) const;
-<span class="lineNum">      93 </span>                : 
-<span class="lineNum">      94 </span>                :         template&lt;typename TAGS, typename OUT&gt;
-<span class="lineNum">      95 </span>                :         void outputHavingTags(const TAGS&amp; tags, OUT out) const;
-<span class="lineNum">      96 </span>                : 
-<span class="lineNum">      97 </span>                : #if 0
-<span class="lineNum">      98 </span>                :         void output(Consumer&lt;ITEM, TAG&gt;&amp; consumer) const;
-<span class="lineNum">      99 </span>                :         void outputHavingTags(const std::set&lt;TAG&gt;&amp; ts, Consumer&lt;ITEM, TAG&gt;&amp; consumer) const;
-<span class="lineNum">     100 </span>                : 
-<span class="lineNum">     101 </span>                :         /**
-<span class="lineNum">     102 </span>                :          * Send the merged data to a consumer, but reversed: the tag become items,
-<span class="lineNum">     103 </span>                :          * and they are tagged with the items that had them
-<span class="lineNum">     104 </span>                :          */
-<span class="lineNum">     105 </span>                :         void outputReversed(Consumer&lt;TAG, ITEM&gt;&amp; consumer) const;
-<span class="lineNum">     106 </span>                : #endif
-<span class="lineNum">     107 </span>                : 
-<span class="lineNum">     108 </span>                :         void applyChange(const PatchList&lt;ITEM, TAG&gt;&amp; change);
-<span class="lineNum">     109 </span>                : 
-<span class="lineNum">     110 </span>                :         std::set&lt;ITEM&gt; getTaggedItems() const;
-<span class="lineNum">     111 </span>                :         
-<span class="lineNum">     112 </span><span class="lineCov">              3 :         std::set&lt;TAG&gt; getAllTags() const;</span>
-<span class="lineNum">     113 </span>                : 
-<span class="lineNum">     114 </span>                :         std::set&lt;TAG&gt; getCompanionTags(const std::set&lt;TAG&gt;&amp; ts) const;
-<span class="lineNum">     115 </span>                : 
-<span class="lineNum">     116 </span>                :         std::set&lt;ITEM&gt; getRelatedItems(const std::set&lt;TAG&gt;&amp; ts, int maxdistance = 1) const;
-<span class="lineNum">     117 </span>                : 
-<span class="lineNum">     118 </span>                :         /**
-<span class="lineNum">     119 </span>                :          * Count the number of items
-<span class="lineNum">     120 </span>                :          */
-<span class="lineNum">     121 </span><span class="lineCov">              5 :         unsigned int itemCount() const;</span>
-<span class="lineNum">     122 </span>                : 
-<span class="lineNum">     123 </span><span class="lineCov">              3 :         unsigned int tagCount() const { return getAllTags().size(); }</span>
-<span class="lineNum">     124 </span>                : 
-<span class="lineNum">     125 </span>                :         /**
-<span class="lineNum">     126 </span>                :          * Empty the collection
-<span class="lineNum">     127 </span>                :          */
-<span class="lineNum">     128 </span><span class="lineCov">              1 :         void clear()</span>
-<span class="lineNum">     129 </span>                :         {
-<span class="lineNum">     130 </span><span class="lineCov">              1 :                 coll.clear();</span>
-<span class="lineNum">     131 </span><span class="lineCov">              1 :         }</span>
-<span class="lineNum">     132 </span>                : };
-<span class="lineNum">     133 </span>                : 
-<span class="lineNum">     134 </span>                : }
-<span class="lineNum">     135 </span>                : }
-<span class="lineNum">     136 </span>                : 
-<span class="lineNum">     137 </span>                : // vim:set ts=4 sw=4:
-<span class="lineNum">     138 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/simple.tcc.gcov.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/simple.tcc.gcov.html
deleted file mode 100644
index ae0c51f..0000000
--- a/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/simple.tcc.gcov.html
+++ /dev/null
@@ -1,263 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/coll/simple.tcc</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/tagcoll-2.0.11/tagcoll/coll</a> - simple.tcc</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">17</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">82.4 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">14</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /*
-<span class="lineNum">       2 </span>                :  * Merge tags of items appearing multiple times in a stream of tagged items
-<span class="lineNum">       3 </span>                :  *
-<span class="lineNum">       4 </span>                :  * Copyright (C) 2003--2006  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">       5 </span>                :  *
-<span class="lineNum">       6 </span>                :  * This library is free software; you can redistribute it and/or
-<span class="lineNum">       7 </span>                :  * modify it under the terms of the GNU Lesser General Public
-<span class="lineNum">       8 </span>                :  * License as published by the Free Software Foundation; either
-<span class="lineNum">       9 </span>                :  * version 2.1 of the License, or (at your option) any later version.
-<span class="lineNum">      10 </span>                :  *
-<span class="lineNum">      11 </span>                :  * This library is distributed in the hope that it will be useful,
-<span class="lineNum">      12 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      13 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-<span class="lineNum">      14 </span>                :  * Lesser General Public License for more details.
-<span class="lineNum">      15 </span>                :  *
-<span class="lineNum">      16 </span>                :  * You should have received a copy of the GNU Lesser General Public
-<span class="lineNum">      17 </span>                :  * License along with this library; if not, write to the Free Software
-<span class="lineNum">      18 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
-<span class="lineNum">      19 </span>                :  */
-<span class="lineNum">      20 </span>                : 
-<span class="lineNum">      21 </span>                : #ifndef TAGCOLL_COLL_SIMPLE_TCC
-<span class="lineNum">      22 </span>                : #define TAGCOLL_COLL_SIMPLE_TCC
-<span class="lineNum">      23 </span>                : 
-<span class="lineNum">      24 </span>                : #include &lt;tagcoll/utils/set.h&gt;
-<span class="lineNum">      25 </span>                : #include &lt;tagcoll/coll/simple.h&gt;
-<span class="lineNum">      26 </span>                : #include &lt;tagcoll/patch.h&gt;
-<span class="lineNum">      27 </span>                : 
-<span class="lineNum">      28 </span>                : #include &lt;wibble/operators.h&gt;
-<span class="lineNum">      29 </span>                : 
-<span class="lineNum">      30 </span>                : using namespace std;
-<span class="lineNum">      31 </span>                : using namespace wibble::operators;
-<span class="lineNum">      32 </span>                : 
-<span class="lineNum">      33 </span>                : namespace tagcoll {
-<span class="lineNum">      34 </span>                : namespace coll {
-<span class="lineNum">      35 </span>                : 
-<span class="lineNum">      36 </span>                : 
-<span class="lineNum">      37 </span>                : template&lt;class ITEM, class TAG&gt; template&lt;typename ITEMS, typename TAGS&gt;
-<span class="lineNum">      38 </span><span class="lineCov">          42293 : void Simple&lt;ITEM, TAG&gt;::insert(const ITEMS&amp; items, const TAGS&amp; tags)</span>
-<span class="lineNum">      39 </span>                : {
-<span class="lineNum">      40 </span>                :         using namespace wibble::operators;
-<span class="lineNum">      41 </span>                : 
-<span class="lineNum">      42 </span><span class="lineCov">          42295 :         if (tags.empty())</span>
-<span class="lineNum">      43 </span><span class="lineNoCov">              0 :                 return;</span>
-<span class="lineNum">      44 </span><span class="lineCov">          84590 :         for (typename ITEMS::const_iterator i = items.begin();</span>
-<span class="lineNum">      45 </span>                :                         i != items.end(); ++i)
-<span class="lineNum">      46 </span>                :         {
-<span class="lineNum">      47 </span><span class="lineCov">          42295 :                 typename std::map&lt; ITEM, std::set&lt;TAG&gt; &gt;::iterator iter = coll.find(*i);</span>
-<span class="lineNum">      48 </span><span class="lineCov">          42295 :                 if (iter == coll.end())</span>
-<span class="lineNum">      49 </span><span class="lineCov">          21149 :                         coll.insert(std::make_pair(*i, std::set&lt;TAG&gt;() | tags));</span>
-<span class="lineNum">      50 </span>                :                 else
-<span class="lineNum">      51 </span><span class="lineCov">          21146 :                         iter-&gt;second |= tags;</span>
-<span class="lineNum">      52 </span>                :         }
-<span class="lineNum">      53 </span>                : }
-<span class="lineNum">      54 </span>                : 
-<span class="lineNum">      55 </span>                : template&lt;class ITEM, class TAG&gt;
-<span class="lineNum">      56 </span>                : std::set&lt;TAG&gt; Simple&lt;ITEM, TAG&gt;::getTagsOfItem(const ITEM&amp; item) const
-<span class="lineNum">      57 </span>                : {
-<span class="lineNum">      58 </span><span class="lineCov">              2 :         typename map&lt; ITEM, std::set&lt;TAG&gt; &gt;::const_iterator i = coll.find(item);</span>
-<span class="lineNum">      59 </span>                :         
-<span class="lineNum">      60 </span><span class="lineCov">              2 :         if (i == coll.end())</span>
-<span class="lineNum">      61 </span><span class="lineNoCov">              0 :                 return std::set&lt;TAG&gt;();</span>
-<span class="lineNum">      62 </span>                :         else
-<span class="lineNum">      63 </span><span class="lineCov">              2 :                 return i-&gt;second;</span>
-<span class="lineNum">      64 </span>                : }
-<span class="lineNum">      65 </span>                : 
-<span class="lineNum">      66 </span>                : template&lt;class ITEM, class TAG&gt;
-<span class="lineNum">      67 </span>                : std::set&lt;ITEM&gt; Simple&lt;ITEM, TAG&gt;::getItemsHavingTag(const TAG&amp; tag) const
-<span class="lineNum">      68 </span>                : {
-<span class="lineNum">      69 </span>                :         std::set&lt;ITEM&gt; res;
-<span class="lineNum">      70 </span>                :         for (typename map&lt; ITEM, std::set&lt;TAG&gt; &gt;::const_iterator i = coll.begin();
-<span class="lineNum">      71 </span>                :                         i != coll.end(); i++)
-<span class="lineNum">      72 </span>                :                 if (i-&gt;second.find(tag) != i-&gt;second.end())
-<span class="lineNum">      73 </span>                :                         res |= i-&gt;first;
-<span class="lineNum">      74 </span>                :         return res;
-<span class="lineNum">      75 </span>                : }
-<span class="lineNum">      76 </span>                : 
-<span class="lineNum">      77 </span>                : template&lt;class ITEM, class TAG&gt; template&lt;typename TAGS&gt;
-<span class="lineNum">      78 </span>                : std::set&lt;ITEM&gt; Simple&lt;ITEM, TAG&gt;::getItemsHavingTags(const TAGS&amp; tags) const
-<span class="lineNum">      79 </span>                : {
-<span class="lineNum">      80 </span>                :         std::set&lt;ITEM&gt; res;
-<span class="lineNum">      81 </span>                :         for (typename map&lt; ITEM, std::set&lt;TAG&gt; &gt;::const_iterator i = coll.begin();
-<span class="lineNum">      82 </span>                :                         i != coll.end(); i++)
-<span class="lineNum">      83 </span>                :                 if (utils::set_contains(i-&gt;second, tags))
-<span class="lineNum">      84 </span>                :                         res |= i-&gt;first;
-<span class="lineNum">      85 </span>                :         return res;
-<span class="lineNum">      86 </span>                : }
-<span class="lineNum">      87 </span>                : 
-<span class="lineNum">      88 </span>                : #if 0
-<span class="lineNum">      89 </span>                : template&lt;class T, class Tag&gt;
-<span class="lineNum">      90 </span>                : void Simple&lt;T, Tag&gt;::outputReversed(Consumer&lt;Tag, T&gt;&amp; consumer) const
-<span class="lineNum">      91 </span>                : {
-<span class="lineNum">      92 </span>                :         for (typename map&lt; T, std::set&lt;Tag&gt; &gt;::const_iterator i = coll.begin();
-<span class="lineNum">      93 </span>                :                         i != coll.end(); i++)
-<span class="lineNum">      94 </span>                :         {
-<span class="lineNum">      95 </span>                :                 std::set&lt;T&gt; items;
-<span class="lineNum">      96 </span>                :                 items |= i-&gt;first;
-<span class="lineNum">      97 </span>                :                 consumer.consume(i-&gt;second, items);
-<span class="lineNum">      98 </span>                :         }
-<span class="lineNum">      99 </span>                : }
-<span class="lineNum">     100 </span>                : #endif
-<span class="lineNum">     101 </span>                : 
-<span class="lineNum">     102 </span>                : template&lt;class ITEM, class TAG&gt; template&lt;typename TAGS, typename OUT&gt;
-<span class="lineNum">     103 </span>                : void Simple&lt;ITEM, TAG&gt;::outputHavingTags(const TAGS&amp; ts, OUT out) const
-<span class="lineNum">     104 </span>                : {
-<span class="lineNum">     105 </span>                :         for (typename map&lt; ITEM, std::set&lt;TAG&gt; &gt;::const_iterator i = coll.begin();
-<span class="lineNum">     106 </span>                :                         i != coll.end(); ++i)
-<span class="lineNum">     107 </span>                :                 if (utils::set_contains(i-&gt;second, ts))
-<span class="lineNum">     108 </span>                :                 {
-<span class="lineNum">     109 </span>                :                         *out = *i;
-<span class="lineNum">     110 </span>                :                         ++out;
-<span class="lineNum">     111 </span>                :                 }
-<span class="lineNum">     112 </span>                : }
-<span class="lineNum">     113 </span>                :         
-<span class="lineNum">     114 </span>                : 
-<span class="lineNum">     115 </span>                : 
-<span class="lineNum">     116 </span>                : template&lt;class T, class Tag&gt;
-<span class="lineNum">     117 </span>                : void Simple&lt;T, Tag&gt;::applyChange(const PatchList&lt;T, Tag&gt;&amp; change)
-<span class="lineNum">     118 </span>                : {
-<span class="lineNum">     119 </span>                :         for (typename PatchList&lt;T, Tag&gt;::const_iterator i = change.begin(); i != change.end(); i++)
-<span class="lineNum">     120 </span>                :         {
-<span class="lineNum">     121 </span>                :                 typename map&lt; T, std::set&lt;Tag&gt; &gt;::iterator it = coll.find(i-&gt;first);
-<span class="lineNum">     122 </span>                :                 if (it == coll.end())
-<span class="lineNum">     123 </span>                :                 {
-<span class="lineNum">     124 </span>                :                         // If the item doesn't exist, create it
-<span class="lineNum">     125 </span>                :                         coll.insert(make_pair(i-&gt;first, i-&gt;second.added));
-<span class="lineNum">     126 </span>                :                 } else {
-<span class="lineNum">     127 </span>                :                         it-&gt;second = i-&gt;second.apply(it-&gt;second);
-<span class="lineNum">     128 </span>                :                 }
-<span class="lineNum">     129 </span>                :         }
-<span class="lineNum">     130 </span>                : }
-<span class="lineNum">     131 </span>                : 
-<span class="lineNum">     132 </span>                : template&lt;typename ITEM, typename TAG&gt;
-<span class="lineNum">     133 </span>                : std::set&lt;ITEM&gt; Simple&lt;ITEM, TAG&gt;::getTaggedItems() const
-<span class="lineNum">     134 </span>                : {
-<span class="lineNum">     135 </span>                :         std::set&lt;ITEM&gt; res;
-<span class="lineNum">     136 </span>                :         for (typename std::map&lt; ITEM, std::set&lt;TAG&gt; &gt;::const_iterator i = coll.begin();
-<span class="lineNum">     137 </span>                :                         i != coll.end(); i++)
-<span class="lineNum">     138 </span>                :                 res.insert(i-&gt;first);
-<span class="lineNum">     139 </span>                :         return res;
-<span class="lineNum">     140 </span>                : }
-<span class="lineNum">     141 </span>                : 
-<span class="lineNum">     142 </span>                : template&lt;class T, class Tag&gt;
-<span class="lineNum">     143 </span>                : std::set&lt;Tag&gt; Simple&lt;T, Tag&gt;::getAllTags() const
-<span class="lineNum">     144 </span>                : {
-<span class="lineNum">     145 </span><span class="lineCov">              3 :         std::set&lt;Tag&gt; tags;</span>
-<span class="lineNum">     146 </span>                : 
-<span class="lineNum">     147 </span><span class="lineCov">              6 :         for (typename map&lt; T, std::set&lt;Tag&gt; &gt;::const_iterator i = coll.begin();</span>
-<span class="lineNum">     148 </span>                :                         i != coll.end(); i++)
-<span class="lineNum">     149 </span><span class="lineCov">              3 :                 tags |= i-&gt;second;</span>
-<span class="lineNum">     150 </span>                :         
-<span class="lineNum">     151 </span><span class="lineNoCov">              0 :         return tags;</span>
-<span class="lineNum">     152 </span>                : }
-<span class="lineNum">     153 </span>                : 
-<span class="lineNum">     154 </span>                : template&lt;class T, class Tag&gt;
-<span class="lineNum">     155 </span>                : std::set&lt;Tag&gt; Simple&lt;T, Tag&gt;::getCompanionTags(const std::set&lt;Tag&gt;&amp; ts) const
-<span class="lineNum">     156 </span>                : {
-<span class="lineNum">     157 </span>                :         std::set&lt;Tag&gt; tags;
-<span class="lineNum">     158 </span>                : 
-<span class="lineNum">     159 </span>                :         for (typename map&lt; T, std::set&lt;Tag&gt; &gt;::const_iterator i = coll.begin();
-<span class="lineNum">     160 </span>                :                         i != coll.end(); i++)
-<span class="lineNum">     161 </span>                :                 if (utils::set_contains(i-&gt;second, (ts)))
-<span class="lineNum">     162 </span>                :                         tags |= i-&gt;second - ts;
-<span class="lineNum">     163 </span>                :         
-<span class="lineNum">     164 </span>                :         return tags;
-<span class="lineNum">     165 </span>                : }
-<span class="lineNum">     166 </span>                : 
-<span class="lineNum">     167 </span>                : template&lt;class T, class Tag&gt;
-<span class="lineNum">     168 </span>                : std::set&lt;T&gt; Simple&lt;T, Tag&gt;::getRelatedItems(const std::set&lt;Tag&gt;&amp; tags, int maxdistance) const
-<span class="lineNum">     169 </span>                : {
-<span class="lineNum">     170 </span>                :         std::set&lt;T&gt; res;
-<span class="lineNum">     171 </span>                : 
-<span class="lineNum">     172 </span>                :         for (typename map&lt; T, std::set&lt;Tag&gt; &gt;::const_iterator i = coll.begin();
-<span class="lineNum">     173 </span>                :                         i != coll.end(); i++)
-<span class="lineNum">     174 </span>                :         {
-<span class="lineNum">     175 </span>                :                 int dist = utils::set_distance(tags, i-&gt;second);
-<span class="lineNum">     176 </span>                :                 if (dist &gt;= 0 &amp;&amp; dist &lt;= maxdistance)
-<span class="lineNum">     177 </span>                :                         res |= i-&gt;first;
-<span class="lineNum">     178 </span>                :         }
-<span class="lineNum">     179 </span>                :         
-<span class="lineNum">     180 </span>                :         return res;
-<span class="lineNum">     181 </span>                : }
-<span class="lineNum">     182 </span>                : 
-<span class="lineNum">     183 </span>                : template&lt;class T, class Tag&gt;
-<span class="lineNum">     184 </span>                : unsigned int Simple&lt;T, Tag&gt;::itemCount() const
-<span class="lineNum">     185 </span>                : {
-<span class="lineNum">     186 </span><span class="lineCov">              5 :         return coll.size();</span>
-<span class="lineNum">     187 </span>                : }
-<span class="lineNum">     188 </span>                : 
-<span class="lineNum">     189 </span>                : }
-<span class="lineNum">     190 </span>                : }
-<span class="lineNum">     191 </span>                : 
-<span class="lineNum">     192 </span>                : #include &lt;tagcoll/coll/base.tcc&gt;
-<span class="lineNum">     193 </span>                : 
-<span class="lineNum">     194 </span>                : #endif
-<span class="lineNum">     195 </span>                : 
-<span class="lineNum">     196 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/diskindex/index.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/diskindex/index.html
deleted file mode 100644
index b47f674..0000000
--- a/rep/usr/include/tagcoll-2.0.11/tagcoll/diskindex/index.html
+++ /dev/null
@@ -1,92 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/diskindex</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - /usr/include/tagcoll-2.0.11/tagcoll/diskindex</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">15</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">93.3 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">14</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <center>
-  <table width="80%" cellpadding=2 cellspacing=1 border=0>
-
-    <tr>
-      <td width="50%"><br></td>
-      <td width="15%"></td>
-      <td width="15%"></td>
-      <td width="20%"></td>
-    </tr>
-
-    <tr>
-      <td class="tableHead">Filename</td>
-      <td class="tableHead" colspan=3>Coverage</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="int.h.gcov.html">int.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=91 height=10 alt="90.9%"><img src="../../../../../snow.png" width=9 height=10 alt="90.9%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">90.9&nbsp;%</td>
-      <td class="coverNumHi">10&nbsp;/&nbsp;11&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="mmap.h.gcov.html">mmap.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">4&nbsp;/&nbsp;4&nbsp;lines</td>
-    </tr>
-
-  </table>
-  </center>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/diskindex/int.h.gcov.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/diskindex/int.h.gcov.html
deleted file mode 100644
index 757c384..0000000
--- a/rep/usr/include/tagcoll-2.0.11/tagcoll/diskindex/int.h.gcov.html
+++ /dev/null
@@ -1,158 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/diskindex/int.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/tagcoll-2.0.11/tagcoll/diskindex</a> - int.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">11</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">90.9 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">10</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #ifndef TAGCOLL_DISKINDEX_INT_H
-<span class="lineNum">       2 </span>                : #define TAGCOLL_DISKINDEX_INT_H
-<span class="lineNum">       3 </span>                : 
-<span class="lineNum">       4 </span>                : /** \file
-<span class="lineNum">       5 </span>                :  * Fast index for tag data, based on integer indexes
-<span class="lineNum">       6 </span>                :  */
-<span class="lineNum">       7 </span>                : 
-<span class="lineNum">       8 </span>                : /*
-<span class="lineNum">       9 </span>                :  * Copyright (C) 2006  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">      10 </span>                :  *
-<span class="lineNum">      11 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">      12 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">      13 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">      14 </span>                :  * (at your option) any later version.
-<span class="lineNum">      15 </span>                :  *
-<span class="lineNum">      16 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      17 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      18 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      19 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      20 </span>                :  *
-<span class="lineNum">      21 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      22 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      23 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      24 </span>                :  */
-<span class="lineNum">      25 </span>                : 
-<span class="lineNum">      26 </span>                : #include &lt;tagcoll/diskindex/mmap.h&gt;
-<span class="lineNum">      27 </span>                : #include &lt;vector&gt;
-<span class="lineNum">      28 </span>                : #include &lt;set&gt;
-<span class="lineNum">      29 </span>                : 
-<span class="lineNum">      30 </span>                : namespace tagcoll {
-<span class="lineNum">      31 </span>                : namespace diskindex {
-<span class="lineNum">      32 </span>                : 
-<span class="lineNum">      33 </span>                : /**
-<span class="lineNum">      34 </span>                :  * MMap-based index of a -&gt; [x1, x2, x3] mappings
-<span class="lineNum">      35 </span>                :  *
-<span class="lineNum">      36 </span>                :  * The layout is:
-<span class="lineNum">      37 </span>                :  *
-<span class="lineNum">      38 </span>                :  * [offset of mapping for item 0, offset of mapping for item 1...]
-<span class="lineNum">      39 </span>                :  * [size of array][sorted array of ints pointed by index 0]
-<span class="lineNum">      40 </span>                :  * [size of array][sorted array of ints pointed by index 1]
-<span class="lineNum">      41 </span>                :  * [size of array][sorted array of ints pointed by index 2]
-<span class="lineNum">      42 </span>                :  * [...]
-<span class="lineNum">      43 </span>                :  * [number of items in the mapping]
-<span class="lineNum">      44 </span>                :  *
-<span class="lineNum">      45 </span>                :  * This allows fast lookups, as well as fast lookups of unions or intersections
-<span class="lineNum">      46 </span>                :  * of mapped arrays.
-<span class="lineNum">      47 </span>                :  *
-<span class="lineNum">      48 </span>                :  * The number of items for an ID not present in the index is assumed to be 0.
-<span class="lineNum">      49 </span>                :  */
-<span class="lineNum">      50 </span>                : class Int : public MMap
-<span class="lineNum">      51 </span>                : {
-<span class="lineNum">      52 </span>                : protected:
-<span class="lineNum">      53 </span><span class="lineCov">         274890 :         inline int* buf() const { return (int*)m_buf; }</span>
-<span class="lineNum">      54 </span><span class="lineCov">         274890 :         inline size_t ofs(int val) const { return buf()[val]; }</span>
-<span class="lineNum">      55 </span>                : 
-<span class="lineNum">      56 </span>                : public:
-<span class="lineNum">      57 </span><span class="lineCov">             20 :         Int() {}</span>
-<span class="lineNum">      58 </span>                :         Int(const MasterMMap&amp; master, int idx) : MMap(master, idx) {}
-<span class="lineNum">      59 </span>                : 
-<span class="lineNum">      60 </span>                :         const int* data(int val) const { return (val &gt;= 0 &amp;&amp; (unsigned)val &lt; size()) ? buf() + ofs(val) + 1 : 0; }
-<span class="lineNum">      61 </span><span class="lineNoCov">              0 :         size_t size(int val) const { return (val &gt;= 0 &amp;&amp; (unsigned)val &lt; size()) ? buf()[ofs(val)] : 0; }</span>
-<span class="lineNum">      62 </span><span class="lineCov">         274893 :         size_t size() const { return m_buf ? ofs(0) : 0; }</span>
-<span class="lineNum">      63 </span>                : };
-<span class="lineNum">      64 </span>                : 
-<span class="lineNum">      65 </span>                : /**
-<span class="lineNum">      66 </span>                :  * Creates an on-disk index to use for IntIndex
-<span class="lineNum">      67 </span>                :  */
-<span class="lineNum">      68 </span>                : class IntIndexer : public MMapIndexer, public std::vector&lt;std::set&lt;int&gt; &gt;
-<span class="lineNum">      69 </span><span class="lineCov">              4 : {</span>
-<span class="lineNum">      70 </span>                : public:
-<span class="lineNum">      71 </span>                :         /// Store the key-&gt;val mapping into the indexer
-<span class="lineNum">      72 </span><span class="lineCov">         211196 :         void map(unsigned int key, int val)</span>
-<span class="lineNum">      73 </span>                :         {
-<span class="lineNum">      74 </span><span class="lineCov">         211196 :                 if (size() &lt;= key)</span>
-<span class="lineNum">      75 </span><span class="lineCov">          21142 :                         resize(key + 1);</span>
-<span class="lineNum">      76 </span><span class="lineCov">         211196 :                 (*this)[key].insert(val);</span>
-<span class="lineNum">      77 </span><span class="lineCov">         211196 :         }</span>
-<span class="lineNum">      78 </span>                :         
-<span class="lineNum">      79 </span>                :         /// Return the size of the encoded index data
-<span class="lineNum">      80 </span>                :         virtual int encodedSize() const;
-<span class="lineNum">      81 </span>                : 
-<span class="lineNum">      82 </span>                :         /// Write the index data in the given buffer, which should be at least
-<span class="lineNum">      83 </span>                :         /// encodedSize bytes
-<span class="lineNum">      84 </span>                :         virtual void encode(char* buf) const;
-<span class="lineNum">      85 </span>                : };
-<span class="lineNum">      86 </span>                : 
-<span class="lineNum">      87 </span>                : }
-<span class="lineNum">      88 </span>                : }
-<span class="lineNum">      89 </span>                : 
-<span class="lineNum">      90 </span>                : // vim:set ts=4 sw=4:
-<span class="lineNum">      91 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/diskindex/mmap.h.gcov.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/diskindex/mmap.h.gcov.html
deleted file mode 100644
index 8925ba5..0000000
--- a/rep/usr/include/tagcoll-2.0.11/tagcoll/diskindex/mmap.h.gcov.html
+++ /dev/null
@@ -1,196 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/diskindex/mmap.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/tagcoll-2.0.11/tagcoll/diskindex</a> - mmap.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">4</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">4</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #ifndef TAGCOLL_DISKINDEX_MMAP_H
-<span class="lineNum">       2 </span>                : #define TAGCOLL_DISKINDEX_MMAP_H
-<span class="lineNum">       3 </span>                : 
-<span class="lineNum">       4 </span>                : /** \file
-<span class="lineNum">       5 </span>                :  * Basic infrastructure for implementing mmapped indexes
-<span class="lineNum">       6 </span>                :  */
-<span class="lineNum">       7 </span>                : 
-<span class="lineNum">       8 </span>                : /*
-<span class="lineNum">       9 </span>                :  * Copyright (C) 2006  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">      10 </span>                :  *
-<span class="lineNum">      11 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">      12 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">      13 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">      14 </span>                :  * (at your option) any later version.
-<span class="lineNum">      15 </span>                :  *
-<span class="lineNum">      16 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      17 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      18 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      19 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      20 </span>                :  *
-<span class="lineNum">      21 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      22 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      23 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-<span class="lineNum">      24 </span>                :  */
-<span class="lineNum">      25 </span>                : 
-<span class="lineNum">      26 </span>                : #include &lt;string&gt;
-<span class="lineNum">      27 </span>                : 
-<span class="lineNum">      28 </span>                : namespace tagcoll {
-<span class="lineNum">      29 </span>                : namespace diskindex {
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : class mmap;
-<span class="lineNum">      32 </span>                : 
-<span class="lineNum">      33 </span>                : /**
-<span class="lineNum">      34 </span>                :  * Performs the memory management and mmapping tasks for mmapped indexes.
-<span class="lineNum">      35 </span>                :  *
-<span class="lineNum">      36 </span>                :  * One MMap can contain many indexes.  Indexes come chained one after the
-<span class="lineNum">      37 </span>                :  * other, prefixed by an int that specifies their length:
-<span class="lineNum">      38 </span>                :  *
-<span class="lineNum">      39 </span>                :  * [size of index 1][index1][size of index 2][index]...
-<span class="lineNum">      40 </span>                :  *
-<span class="lineNum">      41 </span>                :  * Every index must make sure that its size is int-aligned, otherwise accessing
-<span class="lineNum">      42 </span>                :  * it would cause a bus error in many architectures.
-<span class="lineNum">      43 </span>                :  */
-<span class="lineNum">      44 </span>                : class MasterMMap
-<span class="lineNum">      45 </span>                : {
-<span class="lineNum">      46 </span>                : protected:
-<span class="lineNum">      47 </span>                :         std::string m_filename;
-<span class="lineNum">      48 </span>                :         size_t m_size;
-<span class="lineNum">      49 </span>                :         int m_fd;
-<span class="lineNum">      50 </span>                :         const char* m_buf;
-<span class="lineNum">      51 </span>                : 
-<span class="lineNum">      52 </span>                : public:
-<span class="lineNum">      53 </span>                :         MasterMMap();
-<span class="lineNum">      54 </span>                :         MasterMMap(const std::string&amp; filename);
-<span class="lineNum">      55 </span>                :         ~MasterMMap();
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span>                :         void init(const std::string&amp; filename);
-<span class="lineNum">      58 </span>                :         
-<span class="lineNum">      59 </span>                :         friend class MMap;
-<span class="lineNum">      60 </span>                : };
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span>                : class MMap
-<span class="lineNum">      63 </span>                : {
-<span class="lineNum">      64 </span>                : protected:
-<span class="lineNum">      65 </span>                :         const MasterMMap* m_master;
-<span class="lineNum">      66 </span>                :         const char* m_buf;
-<span class="lineNum">      67 </span>                :         size_t m_size;
-<span class="lineNum">      68 </span>                : 
-<span class="lineNum">      69 </span>                : public:
-<span class="lineNum">      70 </span>                :         MMap();
-<span class="lineNum">      71 </span>                :         MMap(const char* buf, int size);
-<span class="lineNum">      72 </span>                :         MMap(const MasterMMap&amp; master, size_t idx);
-<span class="lineNum">      73 </span>                : 
-<span class="lineNum">      74 </span>                :         void init(const char* buf, int size);
-<span class="lineNum">      75 </span>                :         void init(const MasterMMap&amp; master, size_t idx);
-<span class="lineNum">      76 </span>                : 
-<span class="lineNum">      77 </span>                :         /// Round a value to the next word size in the current architecture
-<span class="lineNum">      78 </span>                :         template&lt;class INT&gt;
-<span class="lineNum">      79 </span><span class="lineCov">             12 :         static inline INT align(INT val)</span>
-<span class="lineNum">      80 </span>                :         {
-<span class="lineNum">      81 </span><span class="lineCov">             12 :                 return (val + sizeof(int) - 1) &amp; ~(sizeof(int) - 1);</span>
-<span class="lineNum">      82 </span>                :         }
-<span class="lineNum">      83 </span>                : };
-<span class="lineNum">      84 </span>                : 
-<span class="lineNum">      85 </span>                : /**
-<span class="lineNum">      86 </span>                :  * Interface for indexers.
-<span class="lineNum">      87 </span>                :  */
-<span class="lineNum">      88 </span>                : class MMapIndexer
-<span class="lineNum">      89 </span><span class="lineCov">             20 : {</span>
-<span class="lineNum">      90 </span>                : public:
-<span class="lineNum">      91 </span><span class="lineCov">             20 :         virtual ~MMapIndexer() {}</span>
-<span class="lineNum">      92 </span>                : 
-<span class="lineNum">      93 </span>                :         /// Return the size of the encoded index data (in bytes)
-<span class="lineNum">      94 </span>                :         virtual int encodedSize() const = 0;
-<span class="lineNum">      95 </span>                : 
-<span class="lineNum">      96 </span>                :         /// Write the index data in the given buffer, which should be at least
-<span class="lineNum">      97 </span>                :         /// encodedSize bytes
-<span class="lineNum">      98 </span>                :         virtual void encode(char* buf) const = 0;
-<span class="lineNum">      99 </span>                : };
-<span class="lineNum">     100 </span>                : 
-<span class="lineNum">     101 </span>                : /**
-<span class="lineNum">     102 </span>                :  * Master index writer.  It allows to write many indexes in the same file,
-<span class="lineNum">     103 </span>                :  * atomically: the file will be created as a tempfile and atomically renamed to
-<span class="lineNum">     104 </span>                :  * the destination filename on class destruction.
-<span class="lineNum">     105 </span>                :  */
-<span class="lineNum">     106 </span>                : class MasterMMapIndexer
-<span class="lineNum">     107 </span>                : {
-<span class="lineNum">     108 </span>                : protected:
-<span class="lineNum">     109 </span>                :         std::string finalname;
-<span class="lineNum">     110 </span>                :         std::string tmpname;
-<span class="lineNum">     111 </span>                :         int fd;
-<span class="lineNum">     112 </span>                : 
-<span class="lineNum">     113 </span>                : public:
-<span class="lineNum">     114 </span>                :         MasterMMapIndexer(const std::string&amp; filename);
-<span class="lineNum">     115 </span>                :         ~MasterMMapIndexer();
-<span class="lineNum">     116 </span>                : 
-<span class="lineNum">     117 </span>                :         /// Close the file and perform the final rename
-<span class="lineNum">     118 </span>                :         void commit();
-<span class="lineNum">     119 </span>                : 
-<span class="lineNum">     120 </span>                :         /// Append one subindex
-<span class="lineNum">     121 </span>                :         void append(const MMapIndexer&amp; idx);
-<span class="lineNum">     122 </span>                : };
-<span class="lineNum">     123 </span>                : 
-<span class="lineNum">     124 </span>                : 
-<span class="lineNum">     125 </span>                : }
-<span class="lineNum">     126 </span>                : }
-<span class="lineNum">     127 </span>                : 
-<span class="lineNum">     128 </span>                : // vim:set ts=4 sw=4:
-<span class="lineNum">     129 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/expression.h.gcov.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/expression.h.gcov.html
deleted file mode 100644
index 128d3fb..0000000
--- a/rep/usr/include/tagcoll-2.0.11/tagcoll/expression.h.gcov.html
+++ /dev/null
@@ -1,249 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/expression.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - <a href="index.html">usr/include/tagcoll-2.0.11/tagcoll</a> - expression.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">10</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">10</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #ifndef TAGCOLL_EXPRESSION_H
-<span class="lineNum">       2 </span>                : #define TAGCOLL_EXPRESSION_H
-<span class="lineNum">       3 </span>                : 
-<span class="lineNum">       4 </span>                : /*
-<span class="lineNum">       5 </span>                :  * Expression that can match tagsets
-<span class="lineNum">       6 </span>                :  * 
-<span class="lineNum">       7 </span>                :  * Copyright (C) 2003,2004,2005,2006  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">       8 </span>                :  *
-<span class="lineNum">       9 </span>                :  * This library is free software; you can redistribute it and/or
-<span class="lineNum">      10 </span>                :  * modify it under the terms of the GNU Lesser General Public
-<span class="lineNum">      11 </span>                :  * License as published by the Free Software Foundation; either
-<span class="lineNum">      12 </span>                :  * version 2.1 of the License, or (at your option) any later version.
-<span class="lineNum">      13 </span>                :  *
-<span class="lineNum">      14 </span>                :  * This library is distributed in the hope that it will be useful,
-<span class="lineNum">      15 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      16 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-<span class="lineNum">      17 </span>                :  * Lesser General Public License for more details.
-<span class="lineNum">      18 </span>                :  *
-<span class="lineNum">      19 </span>                :  * You should have received a copy of the GNU Lesser General Public
-<span class="lineNum">      20 </span>                :  * License along with this library; if not, write to the Free Software
-<span class="lineNum">      21 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
-<span class="lineNum">      22 </span>                :  */
-<span class="lineNum">      23 </span>                : 
-<span class="lineNum">      24 </span>                : #include &lt;string&gt;
-<span class="lineNum">      25 </span>                : #include &lt;set&gt;
-<span class="lineNum">      26 </span>                : #include &lt;map&gt;
-<span class="lineNum">      27 </span>                : #include &lt;wibble/singleton.h&gt;
-<span class="lineNum">      28 </span>                : #include &lt;wibble/mixin.h&gt;
-<span class="lineNum">      29 </span>                : 
-<span class="lineNum">      30 </span>                : namespace tagcoll
-<span class="lineNum">      31 </span>                : {
-<span class="lineNum">      32 </span>                : 
-<span class="lineNum">      33 </span>                : class TagexprContext;
-<span class="lineNum">      34 </span>                : 
-<span class="lineNum">      35 </span>                : /**
-<span class="lineNum">      36 </span>                :  * Interface for parsed tag expressions
-<span class="lineNum">      37 </span>                :  */
-<span class="lineNum">      38 </span>                : class ExpressionImpl
-<span class="lineNum">      39 </span>                : {
-<span class="lineNum">      40 </span>                : protected:
-<span class="lineNum">      41 </span>                :         int _ref;
-<span class="lineNum">      42 </span>                : 
-<span class="lineNum">      43 </span>                : public:
-<span class="lineNum">      44 </span>                :         ExpressionImpl() : _ref(0) {}
-<span class="lineNum">      45 </span>                :         virtual ~ExpressionImpl() {}
-<span class="lineNum">      46 </span>                : 
-<span class="lineNum">      47 </span>                :         /// Increment the reference count for this object
-<span class="lineNum">      48 </span><span class="lineCov">             10 :         void ref() throw () { ++_ref; }</span>
-<span class="lineNum">      49 </span>                : 
-<span class="lineNum">      50 </span>                :         /// Decrement the reference count for this object, returning true when it
-<span class="lineNum">      51 </span>                :         /// reaches 0
-<span class="lineNum">      52 </span><span class="lineCov">             22 :         bool unref() throw () { return --_ref == 0; }</span>
-<span class="lineNum">      53 </span>                : 
-<span class="lineNum">      54 </span>                :         /**
-<span class="lineNum">      55 </span>                :          * Provide a string representation of this expression
-<span class="lineNum">      56 </span>                :          */
-<span class="lineNum">      57 </span>                :         virtual std::string format() const = 0;
-<span class="lineNum">      58 </span>                : 
-<span class="lineNum">      59 </span>                :         /**
-<span class="lineNum">      60 </span>                :          * Evaluates the expression on a recursive context
-<span class="lineNum">      61 </span>                :          *
-<span class="lineNum">      62 </span>                :          * \see TagexprContext
-<span class="lineNum">      63 </span>                :          */
-<span class="lineNum">      64 </span>                :         virtual bool eval(const TagexprContext&amp; context) const = 0;
-<span class="lineNum">      65 </span>                : 
-<span class="lineNum">      66 </span>                :         /**
-<span class="lineNum">      67 </span>                :          * Evaluates the expression on a set of tags
-<span class="lineNum">      68 </span>                :          *
-<span class="lineNum">      69 </span>                :          * \return
-<span class="lineNum">      70 </span>                :          *   true if the expression matches the tags, false otherwise
-<span class="lineNum">      71 </span>                :          */
-<span class="lineNum">      72 </span>                :         virtual bool eval(const std::set&lt;std::string&gt;&amp; tags) const = 0;
-<span class="lineNum">      73 </span>                : 
-<span class="lineNum">      74 </span>                :         /**
-<span class="lineNum">      75 </span>                :          * Return a clone of this tag expression
-<span class="lineNum">      76 </span>                :          */
-<span class="lineNum">      77 </span>                :         //virtual Tagexpr* clone() const = 0;
-<span class="lineNum">      78 </span>                : };
-<span class="lineNum">      79 </span>                : 
-<span class="lineNum">      80 </span>                : class Expression
-<span class="lineNum">      81 </span>                : {
-<span class="lineNum">      82 </span>                : protected:
-<span class="lineNum">      83 </span>                :         ExpressionImpl* m_impl;
-<span class="lineNum">      84 </span>                : 
-<span class="lineNum">      85 </span>                :         Expression(ExpressionImpl* impl) : m_impl(impl) { m_impl-&gt;ref(); }
-<span class="lineNum">      86 </span>                : 
-<span class="lineNum">      87 </span>                :         const ExpressionImpl* impl() const { return m_impl; }
-<span class="lineNum">      88 </span>                :         ExpressionImpl* impl() { return m_impl; }
-<span class="lineNum">      89 </span>                : 
-<span class="lineNum">      90 </span>                : public:
-<span class="lineNum">      91 </span>                :         Expression();
-<span class="lineNum">      92 </span>                :         Expression(const std::string&amp; expr);
-<span class="lineNum">      93 </span>                : 
-<span class="lineNum">      94 </span>                :         Expression(const Expression&amp; e)
-<span class="lineNum">      95 </span>                :         {
-<span class="lineNum">      96 </span>                :                 if (e.m_impl)
-<span class="lineNum">      97 </span>                :                         e.m_impl-&gt;ref();
-<span class="lineNum">      98 </span>                :                 m_impl = e.m_impl;
-<span class="lineNum">      99 </span>                :         }
-<span class="lineNum">     100 </span><span class="lineCov">             12 :         ~Expression() { if (m_impl-&gt;unref()) delete m_impl; }</span>
-<span class="lineNum">     101 </span>                : 
-<span class="lineNum">     102 </span><span class="lineCov">             10 :         Expression&amp; operator=(const Expression&amp; e)</span>
-<span class="lineNum">     103 </span>                :         {
-<span class="lineNum">     104 </span><span class="lineCov">             10 :                 if (e.m_impl)</span>
-<span class="lineNum">     105 </span><span class="lineCov">             10 :                         e.m_impl-&gt;ref();  // Do it early to correctly handle the case of x = x;</span>
-<span class="lineNum">     106 </span><span class="lineCov">             10 :                 if (m_impl &amp;&amp; m_impl-&gt;unref())</span>
-<span class="lineNum">     107 </span><span class="lineCov">             10 :                         delete m_impl;</span>
-<span class="lineNum">     108 </span><span class="lineCov">             10 :                 m_impl = e.m_impl;</span>
-<span class="lineNum">     109 </span><span class="lineCov">             10 :                 return *this;</span>
-<span class="lineNum">     110 </span>                :         }
-<span class="lineNum">     111 </span>                : 
-<span class="lineNum">     112 </span>                :         Expression operator and (const Expression&amp; e);
-<span class="lineNum">     113 </span>                :         Expression operator or (const Expression&amp; e);
-<span class="lineNum">     114 </span>                :         Expression operator not ();
-<span class="lineNum">     115 </span>                : 
-<span class="lineNum">     116 </span>                :         template&lt;typename Tags&gt;
-<span class="lineNum">     117 </span>                :         bool operator()(const Tags&amp; tags) const
-<span class="lineNum">     118 </span>                :         {
-<span class="lineNum">     119 </span>                :                 std::set&lt;std::string&gt; stags;
-<span class="lineNum">     120 </span>                :                 for (typename Tags::const_iterator i = tags.begin();
-<span class="lineNum">     121 </span>                :                                 i != tags.end(); ++i)
-<span class="lineNum">     122 </span>                :                         stags.insert(*i);
-<span class="lineNum">     123 </span>                :                 return m_impl-&gt;eval(stags);
-<span class="lineNum">     124 </span>                :         }
-<span class="lineNum">     125 </span>                :         bool operator()(const std::set&lt;std::string&gt;&amp; tags) const { return m_impl-&gt;eval(tags); }
-<span class="lineNum">     126 </span>                : 
-<span class="lineNum">     127 </span>                :         bool operator()(const TagexprContext&amp; context) const { return m_impl-&gt;eval(context); }
-<span class="lineNum">     128 </span>                : 
-<span class="lineNum">     129 </span>                :         std::string format() const { return m_impl-&gt;format(); }
-<span class="lineNum">     130 </span>                : 
-<span class="lineNum">     131 </span>                :         static Expression matchTag(const std::string&amp; pattern);
-<span class="lineNum">     132 </span>                : };
-<span class="lineNum">     133 </span>                : 
-<span class="lineNum">     134 </span>                : /**
-<span class="lineNum">     135 </span>                :  * Context for evaluating expressions of derived tags.
-<span class="lineNum">     136 </span>                :  *
-<span class="lineNum">     137 </span>                :  * A derived tag is a tag which is automatically inferred when a tag expression
-<span class="lineNum">     138 </span>                :  * is matched on a tagset.
-<span class="lineNum">     139 </span>                :  *
-<span class="lineNum">     140 </span>                :  * TagexprContext allows the inference engine to distinguish between a normal
-<span class="lineNum">     141 </span>                :  * tag or a derived tag.
-<span class="lineNum">     142 </span>                :  *
-<span class="lineNum">     143 </span>                :  * This class is mainly used to support DerivedTags and has probably little
-<span class="lineNum">     144 </span>                :  * applications elsewhere.
-<span class="lineNum">     145 </span>                :  */
-<span class="lineNum">     146 </span>                : class TagexprContext
-<span class="lineNum">     147 </span>                : {
-<span class="lineNum">     148 </span>                : protected:
-<span class="lineNum">     149 </span>                :         const std::set&lt;std::string&gt;&amp; tags;
-<span class="lineNum">     150 </span>                :         const std::map&lt;std::string, Expression&gt;&amp; derivedTags;
-<span class="lineNum">     151 </span>                :         // Tags &quot;visited&quot; during tag evaluation: used to break circular loops
-<span class="lineNum">     152 </span>                :         mutable std::set&lt;std::string&gt; seen;
-<span class="lineNum">     153 </span>                : 
-<span class="lineNum">     154 </span>                : public:
-<span class="lineNum">     155 </span>                :         /**
-<span class="lineNum">     156 </span>                :          * Create a context for recursive tagset evaluation
-<span class="lineNum">     157 </span>                :          *
-<span class="lineNum">     158 </span>                :          * Evaluation happens using a derivation table, which can list a tag as an
-<span class="lineNum">     159 </span>                :          * alias for another tag expression.  Whenever a tag is matched for
-<span class="lineNum">     160 </span>                :          * equality with a derived tag, the match is performed with the derived tag
-<span class="lineNum">     161 </span>                :          * expression instead.
-<span class="lineNum">     162 </span>                :          * 
-<span class="lineNum">     163 </span>                :          * \param tags
-<span class="lineNum">     164 </span>                :          *   The tags to evaluate
-<span class="lineNum">     165 </span>                :          * \param derivedTags
-<span class="lineNum">     166 </span>                :          *   The table of derived tags to use in the evaluation
-<span class="lineNum">     167 </span>                :          */
-<span class="lineNum">     168 </span>                :         TagexprContext(const std::set&lt;std::string&gt;&amp; tags, const std::map&lt;std::string, Expression&gt;&amp; derivedTags)
-<span class="lineNum">     169 </span>                :                 : tags(tags), derivedTags(derivedTags) {}
-<span class="lineNum">     170 </span>                : 
-<span class="lineNum">     171 </span>                :         /**
-<span class="lineNum">     172 </span>                :          * Evaluates the input tags on the contents to see if they contain the
-<span class="lineNum">     173 </span>                :          * given tag, or if they match its associated tag expression if tag is a
-<span class="lineNum">     174 </span>                :          * derived tag
-<span class="lineNum">     175 </span>                :          */
-<span class="lineNum">     176 </span>                :         bool eval(const std::string&amp; tag) const;
-<span class="lineNum">     177 </span>                : };
-<span class="lineNum">     178 </span>                : 
-<span class="lineNum">     179 </span>                : };
-<span class="lineNum">     180 </span>                : 
-<span class="lineNum">     181 </span>                : // vim:set ts=4 sw=4:
-<span class="lineNum">     182 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/index.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/index.html
deleted file mode 100644
index 664ae5b..0000000
--- a/rep/usr/include/tagcoll-2.0.11/tagcoll/index.html
+++ /dev/null
@@ -1,119 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll</title>
-  <link rel="stylesheet" type="text/css" href="../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - /usr/include/tagcoll-2.0.11/tagcoll</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">173</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">73.4 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">127</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <center>
-  <table width="80%" cellpadding=2 cellspacing=1 border=0>
-
-    <tr>
-      <td width="50%"><br></td>
-      <td width="15%"></td>
-      <td width="15%"></td>
-      <td width="20%"></td>
-    </tr>
-
-    <tr>
-      <td class="tableHead">Filename</td>
-      <td class="tableHead" colspan=3>Coverage</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="TextFormat.h.gcov.html">TextFormat.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../ruby.png" width=14 height=10 alt="14.3%"><img src="../../../../snow.png" width=86 height=10 alt="14.3%"></td></tr></table>
-      </td>
-      <td class="coverPerLo">14.3&nbsp;%</td>
-      <td class="coverNumLo">1&nbsp;/&nbsp;7&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="TextFormat.tcc.gcov.html">TextFormat.tcc</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../emerald.png" width=54 height=10 alt="54.4%"><img src="../../../../snow.png" width=46 height=10 alt="54.4%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">54.4&nbsp;%</td>
-      <td class="coverNumHi">43&nbsp;/&nbsp;79&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="expression.h.gcov.html">expression.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">10&nbsp;/&nbsp;10&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="patch.h.gcov.html">patch.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">42&nbsp;/&nbsp;42&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="patch.tcc.gcov.html">patch.tcc</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../emerald.png" width=89 height=10 alt="88.6%"><img src="../../../../snow.png" width=11 height=10 alt="88.6%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">88.6&nbsp;%</td>
-      <td class="coverNumHi">31&nbsp;/&nbsp;35&nbsp;lines</td>
-    </tr>
-
-  </table>
-  </center>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/input/base.h.gcov.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/input/base.h.gcov.html
deleted file mode 100644
index 5fb2a07..0000000
--- a/rep/usr/include/tagcoll-2.0.11/tagcoll/input/base.h.gcov.html
+++ /dev/null
@@ -1,184 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/input/base.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/tagcoll-2.0.11/tagcoll/input</a> - base.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">14</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">7.1 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">1</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #ifndef TAGCOLL_INPUT_BASE_H
-<span class="lineNum">       2 </span>                : #define TAGCOLL_INPUT_BASE_H
-<span class="lineNum">       3 </span>                : 
-<span class="lineNum">       4 </span>                : /** \file
-<span class="lineNum">       5 </span>                :  * Base class for parsers
-<span class="lineNum">       6 </span>                :  */
-<span class="lineNum">       7 </span>                : 
-<span class="lineNum">       8 </span>                : /*
-<span class="lineNum">       9 </span>                :  * Copyright (C) 2003,2004,2005,2006  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">      10 </span>                :  *
-<span class="lineNum">      11 </span>                :  * This library is free software; you can redistribute it and/or
-<span class="lineNum">      12 </span>                :  * modify it under the terms of the GNU Lesser General Public
-<span class="lineNum">      13 </span>                :  * License as published by the Free Software Foundation; either
-<span class="lineNum">      14 </span>                :  * version 2.1 of the License, or (at your option) any later version.
-<span class="lineNum">      15 </span>                :  *
-<span class="lineNum">      16 </span>                :  * This library is distributed in the hope that it will be useful,
-<span class="lineNum">      17 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      18 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-<span class="lineNum">      19 </span>                :  * Lesser General Public License for more details.
-<span class="lineNum">      20 </span>                :  *
-<span class="lineNum">      21 </span>                :  * You should have received a copy of the GNU Lesser General Public
-<span class="lineNum">      22 </span>                :  * License along with this library; if not, write to the Free Software
-<span class="lineNum">      23 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
-<span class="lineNum">      24 </span>                :  */
-<span class="lineNum">      25 </span>                : 
-<span class="lineNum">      26 </span>                : #include &lt;string&gt;
-<span class="lineNum">      27 </span>                : #include &lt;wibble/exception.h&gt;
-<span class="lineNum">      28 </span>                : 
-<span class="lineNum">      29 </span>                : namespace tagcoll {
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : namespace input {
-<span class="lineNum">      32 </span>                : class Input;
-<span class="lineNum">      33 </span>                : }
-<span class="lineNum">      34 </span>                : 
-<span class="lineNum">      35 </span>                : namespace exception {
-<span class="lineNum">      36 </span>                : 
-<span class="lineNum">      37 </span>                : /**
-<span class="lineNum">      38 </span>                :  * Base exception for parser errors
-<span class="lineNum">      39 </span>                :  */
-<span class="lineNum">      40 </span>                : class Input : public wibble::exception::Consistency
-<span class="lineNum">      41 </span><span class="lineNoCov">              0 : {</span>
-<span class="lineNum">      42 </span>                : protected:
-<span class="lineNum">      43 </span>                :         std::string _file;
-<span class="lineNum">      44 </span>                :         int _line;
-<span class="lineNum">      45 </span>                : 
-<span class="lineNum">      46 </span>                :         std::string makeContext(const std::string&amp; file, int line);
-<span class="lineNum">      47 </span>                :         
-<span class="lineNum">      48 </span>                : public:
-<span class="lineNum">      49 </span>                :         Input(const tagcoll::input::Input&amp; input, const std::string&amp; message) throw ();
-<span class="lineNum">      50 </span>                :         Input(const std::string&amp; file, int line, const std::string&amp; message) throw ()
-<span class="lineNum">      51 </span>                :                 : wibble::exception::Consistency(makeContext(file, line), message),
-<span class="lineNum">      52 </span>                :                  _file(file), _line(line) {}
-<span class="lineNum">      53 </span><span class="lineNoCov">              0 :         Input(int line, const std::string&amp; message) throw ()</span>
-<span class="lineNum">      54 </span><span class="lineNoCov">              0 :                 : wibble::exception::Consistency(makeContext(std::string(), line), message),</span>
-<span class="lineNum">      55 </span><span class="lineNoCov">              0 :                  _line(line) {}</span>
-<span class="lineNum">      56 </span>                :         Input(const std::string&amp; message) throw ()
-<span class="lineNum">      57 </span>                :                 : wibble::exception::Consistency(makeContext(std::string(), -1), message),
-<span class="lineNum">      58 </span>                :                  _line(-1) {}
-<span class="lineNum">      59 </span><span class="lineNoCov">              0 :         virtual ~Input() throw () {}</span>
-<span class="lineNum">      60 </span>                : 
-<span class="lineNum">      61 </span>                :         int line() const throw () { return _line; }
-<span class="lineNum">      62 </span><span class="lineNoCov">              0 :         int line(int line) throw () { return _line = line; }</span>
-<span class="lineNum">      63 </span>                : 
-<span class="lineNum">      64 </span>                :         const std::string&amp; file() const throw () { return _file; }
-<span class="lineNum">      65 </span>                :         std::string file() throw () { return _file; }
-<span class="lineNum">      66 </span>                :         std::string file(const std::string file) throw () { return _file = file; }
-<span class="lineNum">      67 </span>                : 
-<span class="lineNum">      68 </span><span class="lineNoCov">              0 :         virtual const char* type() const throw () { return &quot;Input&quot;; }</span>
-<span class="lineNum">      69 </span>                : };
-<span class="lineNum">      70 </span>                : 
-<span class="lineNum">      71 </span>                : /**
-<span class="lineNum">      72 </span>                :  * Exception thrown in case of problems accessing the input of the parser
-<span class="lineNum">      73 </span>                :  */
-<span class="lineNum">      74 </span>                : class Parser : public Input
-<span class="lineNum">      75 </span><span class="lineNoCov">              0 : {</span>
-<span class="lineNum">      76 </span>                : public:
-<span class="lineNum">      77 </span><span class="lineNoCov">              0 :         Parser(const tagcoll::input::Input&amp; input, const std::string&amp; message) throw ()</span>
-<span class="lineNum">      78 </span><span class="lineNoCov">              0 :                 : Input(input, message) {}</span>
-<span class="lineNum">      79 </span><span class="lineNoCov">              0 :         virtual ~Parser() throw () {}</span>
-<span class="lineNum">      80 </span>                : 
-<span class="lineNum">      81 </span><span class="lineNoCov">              0 :         virtual const char* type() const throw ()</span>
-<span class="lineNum">      82 </span>                :         {
-<span class="lineNum">      83 </span><span class="lineNoCov">              0 :                 return &quot;Parser&quot;;</span>
-<span class="lineNum">      84 </span>                :         }
-<span class="lineNum">      85 </span>                : };
-<span class="lineNum">      86 </span>                : 
-<span class="lineNum">      87 </span>                : }
-<span class="lineNum">      88 </span>                : 
-<span class="lineNum">      89 </span>                : namespace input {
-<span class="lineNum">      90 </span>                : 
-<span class="lineNum">      91 </span>                : /**
-<span class="lineNum">      92 </span>                :  * Generic interface for parser input readers.
-<span class="lineNum">      93 </span>                :  *
-<span class="lineNum">      94 </span>                :  * It encapsulates and hides the reading machinery.  It can be implemented as a
-<span class="lineNum">      95 </span>                :  * file read, a stream read, a decompressing file read, a network read or
-<span class="lineNum">      96 </span>                :  * whatever else is needed.
-<span class="lineNum">      97 </span>                :  */
-<span class="lineNum">      98 </span>                : class Input
-<span class="lineNum">      99 </span>                : {
-<span class="lineNum">     100 </span>                : public:
-<span class="lineNum">     101 </span>                :         static const int Eof = -1;
-<span class="lineNum">     102 </span>                : 
-<span class="lineNum">     103 </span>                :         Input() {}
-<span class="lineNum">     104 </span><span class="lineCov">           1305 :         virtual ~Input() {}</span>
-<span class="lineNum">     105 </span>                : 
-<span class="lineNum">     106 </span>                :         virtual const std::string&amp; fileName() const = 0;
-<span class="lineNum">     107 </span>                :         virtual int lineNumber() const = 0;
-<span class="lineNum">     108 </span>                :         virtual int nextChar()  = 0;
-<span class="lineNum">     109 </span>                :         virtual void pushChar(int c)  = 0;
-<span class="lineNum">     110 </span>                : };
-<span class="lineNum">     111 </span>                : 
-<span class="lineNum">     112 </span>                : }
-<span class="lineNum">     113 </span>                : 
-<span class="lineNum">     114 </span>                : }
-<span class="lineNum">     115 </span>                : 
-<span class="lineNum">     116 </span>                : // vim:set ts=4 sw=4:
-<span class="lineNum">     117 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/input/index.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/input/index.html
deleted file mode 100644
index 2d2187e..0000000
--- a/rep/usr/include/tagcoll-2.0.11/tagcoll/input/index.html
+++ /dev/null
@@ -1,101 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/input</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - /usr/include/tagcoll-2.0.11/tagcoll/input</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">16</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">18.8 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">3</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <center>
-  <table width="80%" cellpadding=2 cellspacing=1 border=0>
-
-    <tr>
-      <td width="50%"><br></td>
-      <td width="15%"></td>
-      <td width="15%"></td>
-      <td width="20%"></td>
-    </tr>
-
-    <tr>
-      <td class="tableHead">Filename</td>
-      <td class="tableHead" colspan=3>Coverage</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="base.h.gcov.html">base.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../ruby.png" width=7 height=10 alt="7.1%"><img src="../../../../../snow.png" width=93 height=10 alt="7.1%"></td></tr></table>
-      </td>
-      <td class="coverPerLo">7.1&nbsp;%</td>
-      <td class="coverNumLo">1&nbsp;/&nbsp;14&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="memory.h.gcov.html">memory.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">1&nbsp;/&nbsp;1&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="string.h.gcov.html">string.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">1&nbsp;/&nbsp;1&nbsp;lines</td>
-    </tr>
-
-  </table>
-  </center>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/input/memory.h.gcov.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/input/memory.h.gcov.html
deleted file mode 100644
index c7d8a43..0000000
--- a/rep/usr/include/tagcoll-2.0.11/tagcoll/input/memory.h.gcov.html
+++ /dev/null
@@ -1,127 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/input/memory.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/tagcoll-2.0.11/tagcoll/input</a> - memory.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">1</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">1</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #ifndef TAGCOLL_INPUT_MEMORY_H
-<span class="lineNum">       2 </span>                : #define TAGCOLL_INPUT_MEMORY_H
-<span class="lineNum">       3 </span>                : 
-<span class="lineNum">       4 </span>                : /** \file
-<span class="lineNum">       5 </span>                :  * Parser input using a buffer as input
-<span class="lineNum">       6 </span>                :  */
-<span class="lineNum">       7 </span>                : 
-<span class="lineNum">       8 </span>                : /*
-<span class="lineNum">       9 </span>                :  * Copyright (C) 2003-2006  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">      10 </span>                :  *
-<span class="lineNum">      11 </span>                :  * This library is free software; you can redistribute it and/or
-<span class="lineNum">      12 </span>                :  * modify it under the terms of the GNU Lesser General Public
-<span class="lineNum">      13 </span>                :  * License as published by the Free Software Foundation; either
-<span class="lineNum">      14 </span>                :  * version 2.1 of the License, or (at your option) any later version.
-<span class="lineNum">      15 </span>                :  *
-<span class="lineNum">      16 </span>                :  * This library is distributed in the hope that it will be useful,
-<span class="lineNum">      17 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      18 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-<span class="lineNum">      19 </span>                :  * Lesser General Public License for more details.
-<span class="lineNum">      20 </span>                :  *
-<span class="lineNum">      21 </span>                :  * You should have received a copy of the GNU Lesser General Public
-<span class="lineNum">      22 </span>                :  * License along with this library; if not, write to the Free Software
-<span class="lineNum">      23 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
-<span class="lineNum">      24 </span>                :  */
-<span class="lineNum">      25 </span>                : 
-<span class="lineNum">      26 </span>                : #include &lt;tagcoll/input/base.h&gt;
-<span class="lineNum">      27 </span>                : #include &lt;string&gt;
-<span class="lineNum">      28 </span>                : 
-<span class="lineNum">      29 </span>                : namespace tagcoll {
-<span class="lineNum">      30 </span>                : namespace input {
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span>                : /**
-<span class="lineNum">      33 </span>                :  * Parser input using a std::string as input
-<span class="lineNum">      34 </span>                :  */
-<span class="lineNum">      35 </span>                : class Memory : public Input
-<span class="lineNum">      36 </span>                : {
-<span class="lineNum">      37 </span>                : protected:
-<span class="lineNum">      38 </span>                :         const std::string fname;
-<span class="lineNum">      39 </span>                :         const char* buf;
-<span class="lineNum">      40 </span>                :         int pos;
-<span class="lineNum">      41 </span>                :         int len;
-<span class="lineNum">      42 </span>                :         int _line;
-<span class="lineNum">      43 </span>                :         
-<span class="lineNum">      44 </span>                : public:
-<span class="lineNum">      45 </span>                :         Memory(const std::string&amp; fname, const char* buf, int len) throw ();
-<span class="lineNum">      46 </span>                :         Memory(const char* buf, int len) throw ();
-<span class="lineNum">      47 </span><span class="lineCov">           1301 :         virtual ~Memory() throw () {}</span>
-<span class="lineNum">      48 </span>                :         
-<span class="lineNum">      49 </span>                :         virtual const std::string&amp; fileName() const throw () { return fname; }
-<span class="lineNum">      50 </span>                :         virtual int lineNumber() const throw () { return _line; }
-<span class="lineNum">      51 </span>                : 
-<span class="lineNum">      52 </span>                :         virtual int nextChar() throw ();
-<span class="lineNum">      53 </span>                :         virtual void pushChar(int c) throw ();
-<span class="lineNum">      54 </span>                : };
-<span class="lineNum">      55 </span>                : 
-<span class="lineNum">      56 </span>                : }
-<span class="lineNum">      57 </span>                : }
-<span class="lineNum">      58 </span>                : 
-<span class="lineNum">      59 </span>                : // vim:set ts=4 sw=4:
-<span class="lineNum">      60 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/input/string.h.gcov.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/input/string.h.gcov.html
deleted file mode 100644
index e3f330c..0000000
--- a/rep/usr/include/tagcoll-2.0.11/tagcoll/input/string.h.gcov.html
+++ /dev/null
@@ -1,125 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/input/string.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/tagcoll-2.0.11/tagcoll/input</a> - string.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">1</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">1</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #ifndef TAGCOLL_INPUT_STRING_H
-<span class="lineNum">       2 </span>                : #define TAGCOLL_INPUT_STRING_H
-<span class="lineNum">       3 </span>                : 
-<span class="lineNum">       4 </span>                : /** \file
-<span class="lineNum">       5 </span>                :  * Parser input using a std::string as input
-<span class="lineNum">       6 </span>                :  */
-<span class="lineNum">       7 </span>                : 
-<span class="lineNum">       8 </span>                : /*
-<span class="lineNum">       9 </span>                :  * Copyright (C) 2003--2006  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">      10 </span>                :  *
-<span class="lineNum">      11 </span>                :  * This library is free software; you can redistribute it and/or
-<span class="lineNum">      12 </span>                :  * modify it under the terms of the GNU Lesser General Public
-<span class="lineNum">      13 </span>                :  * License as published by the Free Software Foundation; either
-<span class="lineNum">      14 </span>                :  * version 2.1 of the License, or (at your option) any later version.
-<span class="lineNum">      15 </span>                :  *
-<span class="lineNum">      16 </span>                :  * This library is distributed in the hope that it will be useful,
-<span class="lineNum">      17 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      18 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-<span class="lineNum">      19 </span>                :  * Lesser General Public License for more details.
-<span class="lineNum">      20 </span>                :  *
-<span class="lineNum">      21 </span>                :  * You should have received a copy of the GNU Lesser General Public
-<span class="lineNum">      22 </span>                :  * License along with this library; if not, write to the Free Software
-<span class="lineNum">      23 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
-<span class="lineNum">      24 </span>                :  */
-<span class="lineNum">      25 </span>                : 
-<span class="lineNum">      26 </span>                : #include &lt;tagcoll/input/base.h&gt;
-<span class="lineNum">      27 </span>                : #include &lt;string&gt;
-<span class="lineNum">      28 </span>                : 
-<span class="lineNum">      29 </span>                : namespace tagcoll {
-<span class="lineNum">      30 </span>                : namespace input {
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span>                : /**
-<span class="lineNum">      33 </span>                :  * Parser input using a std::string as input
-<span class="lineNum">      34 </span>                :  */
-<span class="lineNum">      35 </span>                : class String : public Input
-<span class="lineNum">      36 </span>                : {
-<span class="lineNum">      37 </span>                : protected:
-<span class="lineNum">      38 </span>                :         static const std::string fname;
-<span class="lineNum">      39 </span>                :         std::string _str;
-<span class="lineNum">      40 </span>                :         std::string::const_iterator _s;
-<span class="lineNum">      41 </span>                :         int _line;
-<span class="lineNum">      42 </span>                :         
-<span class="lineNum">      43 </span>                : public:
-<span class="lineNum">      44 </span>                :         String(const std::string&amp; str);
-<span class="lineNum">      45 </span><span class="lineCov">              4 :         virtual ~String() {}</span>
-<span class="lineNum">      46 </span>                :         
-<span class="lineNum">      47 </span>                :         virtual const std::string&amp; fileName() const throw () { return fname; }
-<span class="lineNum">      48 </span>                :         virtual int lineNumber() const throw () { return _line; }
-<span class="lineNum">      49 </span>                : 
-<span class="lineNum">      50 </span>                :         virtual int nextChar();
-<span class="lineNum">      51 </span>                :         virtual void pushChar(int c);
-<span class="lineNum">      52 </span>                : };
-<span class="lineNum">      53 </span>                : 
-<span class="lineNum">      54 </span>                : }
-<span class="lineNum">      55 </span>                : }
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span>                : // vim:set ts=4 sw=4:
-<span class="lineNum">      58 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/patch.h.gcov.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/patch.h.gcov.html
deleted file mode 100644
index ba07ca2..0000000
--- a/rep/usr/include/tagcoll-2.0.11/tagcoll/patch.h.gcov.html
+++ /dev/null
@@ -1,271 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/patch.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - <a href="index.html">usr/include/tagcoll-2.0.11/tagcoll</a> - patch.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">42</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">42</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #ifndef TAGCOLL_PATCHES_H
-<span class="lineNum">       2 </span>                : #define TAGCOLL_PATCHES_H
-<span class="lineNum">       3 </span>                : 
-<span class="lineNum">       4 </span>                : /** \file
-<span class="lineNum">       5 </span>                :  * Classes handling tag patches
-<span class="lineNum">       6 </span>                :  */
-<span class="lineNum">       7 </span>                : 
-<span class="lineNum">       8 </span>                : /*
-<span class="lineNum">       9 </span>                :  * Copyright (C) 2003,2004,2005,2006  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">      10 </span>                :  *
-<span class="lineNum">      11 </span>                :  * This library is free software; you can redistribute it and/or
-<span class="lineNum">      12 </span>                :  * modify it under the terms of the GNU Lesser General Public
-<span class="lineNum">      13 </span>                :  * License as published by the Free Software Foundation; either
-<span class="lineNum">      14 </span>                :  * version 2.1 of the License, or (at your option) any later version.
-<span class="lineNum">      15 </span>                :  *
-<span class="lineNum">      16 </span>                :  * This library is distributed in the hope that it will be useful,
-<span class="lineNum">      17 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      18 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-<span class="lineNum">      19 </span>                :  * Lesser General Public License for more details.
-<span class="lineNum">      20 </span>                :  *
-<span class="lineNum">      21 </span>                :  * You should have received a copy of the GNU Lesser General Public
-<span class="lineNum">      22 </span>                :  * License along with this library; if not, write to the Free Software
-<span class="lineNum">      23 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
-<span class="lineNum">      24 </span>                :  */
-<span class="lineNum">      25 </span>                : 
-<span class="lineNum">      26 </span>                : #include &lt;wibble/operators.h&gt;
-<span class="lineNum">      27 </span>                : #include &lt;wibble/mixin.h&gt;
-<span class="lineNum">      28 </span>                : #include &lt;map&gt;
-<span class="lineNum">      29 </span>                : #include &lt;string&gt;
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : namespace tagcoll
-<span class="lineNum">      32 </span>                : {
-<span class="lineNum">      33 </span>                : 
-<span class="lineNum">      34 </span>                : /**
-<span class="lineNum">      35 </span>                :  * Patch for the tagset of a specific item
-<span class="lineNum">      36 </span>                :  */
-<span class="lineNum">      37 </span>                : template &lt;typename ITEM, typename TAG&gt;
-<span class="lineNum">      38 </span>                : struct Patch
-<span class="lineNum">      39 </span>                : {
-<span class="lineNum">      40 </span>                :         ITEM item;
-<span class="lineNum">      41 </span>                :         std::set&lt;TAG&gt; added;
-<span class="lineNum">      42 </span>                :         std::set&lt;TAG&gt; removed;
-<span class="lineNum">      43 </span>                : 
-<span class="lineNum">      44 </span><span class="lineCov">             55 :         Patch(const Patch&lt;ITEM, TAG&gt;&amp; p) : item(p.item), added(p.added), removed(p.removed) {}</span>
-<span class="lineNum">      45 </span><span class="lineCov">              5 :         Patch(const ITEM&amp; item) : item(item) {}</span>
-<span class="lineNum">      46 </span><span class="lineCov">              2 :         Patch(const ITEM&amp; item, const std::set&lt;TAG&gt;&amp; added, const std::set&lt;TAG&gt;&amp; removed);</span>
-<span class="lineNum">      47 </span>                :         template&lt;typename CONTA, typename CONTB&gt;
-<span class="lineNum">      48 </span><span class="lineCov">              2 :         Patch(const ITEM&amp; item, const CONTA&amp; added, const CONTB&amp; removed);</span>
-<span class="lineNum">      49 </span><span class="lineCov">             66 :         ~Patch() {}</span>
-<span class="lineNum">      50 </span>                : 
-<span class="lineNum">      51 </span><span class="lineCov">              5 :         void add(const TAG&amp; tag)</span>
-<span class="lineNum">      52 </span>                :         {
-<span class="lineNum">      53 </span>                :                 using namespace wibble::operators;
-<span class="lineNum">      54 </span><span class="lineCov">              5 :                 added |= tag; removed -= tag;</span>
-<span class="lineNum">      55 </span><span class="lineCov">              5 :         }</span>
-<span class="lineNum">      56 </span><span class="lineCov">              2 :         void add(const std::set&lt;TAG&gt;&amp; tags)</span>
-<span class="lineNum">      57 </span>                :         {
-<span class="lineNum">      58 </span>                :                 using namespace wibble::operators;
-<span class="lineNum">      59 </span><span class="lineCov">              2 :                 added |= tags; removed -= tags;</span>
-<span class="lineNum">      60 </span><span class="lineCov">              2 :         }</span>
-<span class="lineNum">      61 </span><span class="lineCov">              2 :         void remove(const TAG&amp; tag)</span>
-<span class="lineNum">      62 </span>                :         {
-<span class="lineNum">      63 </span>                :                 using namespace wibble::operators;
-<span class="lineNum">      64 </span><span class="lineCov">              2 :                 removed |= tag; added -= tag;</span>
-<span class="lineNum">      65 </span><span class="lineCov">              2 :         }</span>
-<span class="lineNum">      66 </span><span class="lineCov">              2 :         void remove(const std::set&lt;TAG&gt;&amp; tags)</span>
-<span class="lineNum">      67 </span>                :         {
-<span class="lineNum">      68 </span>                :                 using namespace wibble::operators;
-<span class="lineNum">      69 </span><span class="lineCov">              2 :                 removed |= tags; added -= tags;</span>
-<span class="lineNum">      70 </span><span class="lineCov">              2 :         }</span>
-<span class="lineNum">      71 </span>                : 
-<span class="lineNum">      72 </span>                :         Patch&lt;ITEM, TAG&gt; getReverse() const
-<span class="lineNum">      73 </span>                :         {
-<span class="lineNum">      74 </span>                :                 return Patch&lt;ITEM, TAG&gt;(item, removed, added);
-<span class="lineNum">      75 </span>                :         }
-<span class="lineNum">      76 </span>                : 
-<span class="lineNum">      77 </span><span class="lineCov">              2 :         void mergeWith(const Patch&lt;ITEM, TAG&gt;&amp; patch)</span>
-<span class="lineNum">      78 </span>                :         {
-<span class="lineNum">      79 </span><span class="lineCov">              2 :                 add(patch.added);</span>
-<span class="lineNum">      80 </span><span class="lineCov">              2 :                 remove(patch.removed);</span>
-<span class="lineNum">      81 </span><span class="lineCov">              2 :         }</span>
-<span class="lineNum">      82 </span>                : 
-<span class="lineNum">      83 </span><span class="lineCov">              1 :         std::set&lt;TAG&gt; apply(const std::set&lt;TAG&gt;&amp; ts) const</span>
-<span class="lineNum">      84 </span>                :         {
-<span class="lineNum">      85 </span>                :                 using namespace wibble::operators;
-<span class="lineNum">      86 </span><span class="lineCov">              1 :                 return (ts | added) - removed;</span>
-<span class="lineNum">      87 </span>                :         }
-<span class="lineNum">      88 </span>                : 
-<span class="lineNum">      89 </span>                :         template&lt;typename TAGS&gt;
-<span class="lineNum">      90 </span>                :         std::set&lt;TAG&gt; apply(const TAGS&amp; tags) const
-<span class="lineNum">      91 </span>                :         {
-<span class="lineNum">      92 </span>                :                 using namespace wibble::operators;
-<span class="lineNum">      93 </span>                :                 std::set&lt;TAG&gt; ts;
-<span class="lineNum">      94 </span>                :                 for (typename TAGS::const_iterator i = tags.begin();
-<span class="lineNum">      95 </span>                :                                 i != tags.end(); ++i)
-<span class="lineNum">      96 </span>                :                         ts.insert(*i);
-<span class="lineNum">      97 </span>                :                 return (ts | added) - removed;
-<span class="lineNum">      98 </span>                :         }
-<span class="lineNum">      99 </span>                : 
-<span class="lineNum">     100 </span><span class="lineCov">              4 :         void removeRedundant(const std::set&lt;TAG&gt; ts)</span>
-<span class="lineNum">     101 </span>                :         {
-<span class="lineNum">     102 </span>                :                 using namespace wibble::operators;
-<span class="lineNum">     103 </span>                :                 // Don't add what already exists
-<span class="lineNum">     104 </span><span class="lineCov">              4 :                 added -= ts;</span>
-<span class="lineNum">     105 </span>                :                 // Don't remove what does not exist
-<span class="lineNum">     106 </span><span class="lineCov">              4 :                 removed -= (removed - ts);</span>
-<span class="lineNum">     107 </span><span class="lineCov">              4 :         }</span>
-<span class="lineNum">     108 </span>                : 
-<span class="lineNum">     109 </span>                :         bool operator==(const Patch&lt;ITEM, TAG&gt;&amp; p) const
-<span class="lineNum">     110 </span>                :         {
-<span class="lineNum">     111 </span>                :                 return p.item == item &amp;&amp; p.added == added &amp;&amp; p.removed == removed;
-<span class="lineNum">     112 </span>                :         }
-<span class="lineNum">     113 </span>                :         bool operator!=(const Patch&lt;ITEM, TAG&gt;&amp; p) const
-<span class="lineNum">     114 </span>                :         {
-<span class="lineNum">     115 </span>                :                 return p.item != item || p.added != added || p.removed != removed;
-<span class="lineNum">     116 </span>                :         }
-<span class="lineNum">     117 </span>                : };
-<span class="lineNum">     118 </span>                : 
-<span class="lineNum">     119 </span>                : /**
-<span class="lineNum">     120 </span>                :  * List of patches that can be applied to a TaggedCollection
-<span class="lineNum">     121 </span>                :  */
-<span class="lineNum">     122 </span>                : template &lt;class ITEM, class TAG&gt;
-<span class="lineNum">     123 </span>                : class PatchList : public std::map&lt;ITEM, Patch&lt;ITEM, TAG&gt; &gt;
-<span class="lineNum">     124 </span><span class="lineCov">             36 : {</span>
-<span class="lineNum">     125 </span>                : public:
-<span class="lineNum">     126 </span><span class="lineCov">             32 :         PatchList() {}</span>
-<span class="lineNum">     127 </span><span class="lineCov">              3 :         PatchList(const PatchList&amp; pl) : std::map&lt;ITEM, Patch&lt;ITEM, TAG&gt; &gt;(pl) {}</span>
-<span class="lineNum">     128 </span>                : 
-<span class="lineNum">     129 </span>                :         typedef typename std::map&lt;ITEM, Patch&lt;ITEM, TAG&gt; &gt;::const_iterator const_iterator;
-<span class="lineNum">     130 </span>                :         typedef typename std::map&lt;ITEM, Patch&lt;ITEM, TAG&gt; &gt;::iterator iterator;
-<span class="lineNum">     131 </span>                : 
-<span class="lineNum">     132 </span>                :         /**
-<span class="lineNum">     133 </span>                :          * Add to this patchlist the patches needed to transform `im1' in `im2'
-<span class="lineNum">     134 </span>                :          */
-<span class="lineNum">     135 </span>                :         template&lt;typename COLL1, typename COLL2&gt;
-<span class="lineNum">     136 </span>                :         void addPatch(const COLL1&amp; im1, const COLL2&amp; im2);
-<span class="lineNum">     137 </span>                : 
-<span class="lineNum">     138 </span>                :         /**
-<span class="lineNum">     139 </span>                :          * Add `patch' to this PatchList
-<span class="lineNum">     140 </span>                :          */
-<span class="lineNum">     141 </span><span class="lineCov">             15 :         void addPatch(const Patch&lt;ITEM, TAG&gt;&amp; patch);</span>
-<span class="lineNum">     142 </span>                : 
-<span class="lineNum">     143 </span>                :         /**
-<span class="lineNum">     144 </span>                :          * Add `patches' to this PatchList
-<span class="lineNum">     145 </span>                :          */
-<span class="lineNum">     146 </span>                :         void addPatch(const PatchList&lt;ITEM, TAG&gt;&amp; patches);
-<span class="lineNum">     147 </span>                : 
-<span class="lineNum">     148 </span>                :         /**
-<span class="lineNum">     149 </span>                :          * Add 'patch' to this PatchList, as tag: +/- package rather than package
-<span class="lineNum">     150 </span>                :          * +/- tag
-<span class="lineNum">     151 </span>                :          */
-<span class="lineNum">     152 </span><span class="lineCov">              2 :         void addPatchInverted(const Patch&lt;TAG, ITEM&gt;&amp; patch);</span>
-<span class="lineNum">     153 </span>                : 
-<span class="lineNum">     154 </span>                :         /**
-<span class="lineNum">     155 </span>                :          * Add 'patches' to this PatchList, as tag: +/- package rather than package
-<span class="lineNum">     156 </span>                :          * +/- tag
-<span class="lineNum">     157 </span>                :          */
-<span class="lineNum">     158 </span><span class="lineCov">              2 :         void addPatchInverted(const PatchList&lt;TAG, ITEM&gt;&amp; patches);</span>
-<span class="lineNum">     159 </span>                : 
-<span class="lineNum">     160 </span>                :         /**
-<span class="lineNum">     161 </span>                :          * If the PatchList contains the give item, invoke
-<span class="lineNum">     162 </span>                :          * Patch::removeRedundant(tags) on its patch
-<span class="lineNum">     163 </span>                :          */
-<span class="lineNum">     164 </span><span class="lineCov">              4 :         void removeRedundant(const ITEM&amp; item, const std::set&lt;TAG&gt;&amp; tags);</span>
-<span class="lineNum">     165 </span>                : 
-<span class="lineNum">     166 </span>                :         /**
-<span class="lineNum">     167 </span>                :          * Patch a tagged item
-<span class="lineNum">     168 </span>                :          *
-<span class="lineNum">     169 </span>                :          * @return
-<span class="lineNum">     170 </span>                :          *   The new (patched) set of tags
-<span class="lineNum">     171 </span>                :          */
-<span class="lineNum">     172 </span><span class="lineCov">             14 :         std::set&lt;TAG&gt; patch(const ITEM&amp; item, const std::set&lt;TAG&gt;&amp; tagset) const;</span>
-<span class="lineNum">     173 </span>                : 
-<span class="lineNum">     174 </span>                :         // Output the patch list to a TagcollConsumer
-<span class="lineNum">     175 </span>                :         template&lt;typename OUT&gt;
-<span class="lineNum">     176 </span><span class="lineCov">              3 :         void output(OUT out) const;</span>
-<span class="lineNum">     177 </span>                : 
-<span class="lineNum">     178 </span>                :         PatchList&lt;ITEM, TAG&gt; getReverse() const;
-<span class="lineNum">     179 </span>                : };
-<span class="lineNum">     180 </span>                : 
-<span class="lineNum">     181 </span>                : template&lt;typename ITEM, typename TAG&gt;
-<span class="lineNum">     182 </span>                : class Inserter : public wibble::mixin::OutputIterator&lt; Inserter&lt;ITEM, TAG&gt; &gt;
-<span class="lineNum">     183 </span>                : {
-<span class="lineNum">     184 </span>                :         PatchList&lt;ITEM, TAG&gt;&amp; patches;
-<span class="lineNum">     185 </span>                : public:
-<span class="lineNum">     186 </span><span class="lineCov">              3 :         Inserter(PatchList&lt;ITEM, TAG&gt;&amp; patches) : patches(patches) {}</span>
-<span class="lineNum">     187 </span>                : 
-<span class="lineNum">     188 </span><span class="lineCov">              3 :         Inserter&lt;ITEM, TAG&gt;&amp; operator=(const Patch&lt;ITEM, TAG&gt;&amp; patch)</span>
-<span class="lineNum">     189 </span>                :         {
-<span class="lineNum">     190 </span><span class="lineCov">              3 :                 patches.addPatch(patch);</span>
-<span class="lineNum">     191 </span><span class="lineCov">              3 :                 return *this;</span>
-<span class="lineNum">     192 </span>                :         }
-<span class="lineNum">     193 </span>                : };
-<span class="lineNum">     194 </span>                : 
-<span class="lineNum">     195 </span>                : template&lt;typename ITEM, typename TAG&gt;
-<span class="lineNum">     196 </span><span class="lineCov">              3 : Inserter&lt;ITEM, TAG&gt; inserter(PatchList&lt;ITEM, TAG&gt;&amp; patches)</span>
-<span class="lineNum">     197 </span>                : {
-<span class="lineNum">     198 </span><span class="lineCov">              3 :         return Inserter&lt;ITEM, TAG&gt;(patches);</span>
-<span class="lineNum">     199 </span>                : }
-<span class="lineNum">     200 </span>                : 
-<span class="lineNum">     201 </span>                : }
-<span class="lineNum">     202 </span>                : 
-<span class="lineNum">     203 </span>                : // vim:set ts=4 sw=4:
-<span class="lineNum">     204 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/patch.tcc.gcov.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/patch.tcc.gcov.html
deleted file mode 100644
index 129ac91..0000000
--- a/rep/usr/include/tagcoll-2.0.11/tagcoll/patch.tcc.gcov.html
+++ /dev/null
@@ -1,231 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/patch.tcc</title>
-  <link rel="stylesheet" type="text/css" href="../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - <a href="index.html">usr/include/tagcoll-2.0.11/tagcoll</a> - patch.tcc</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">35</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">88.6 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">31</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /*
-<span class="lineNum">       2 </span>                :  * Classes handling tag patches
-<span class="lineNum">       3 </span>                :  *
-<span class="lineNum">       4 </span>                :  * Copyright (C) 2003--2006  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">       5 </span>                :  *
-<span class="lineNum">       6 </span>                :  * This library is free software; you can redistribute it and/or
-<span class="lineNum">       7 </span>                :  * modify it under the terms of the GNU Lesser General Public
-<span class="lineNum">       8 </span>                :  * License as published by the Free Software Foundation; either
-<span class="lineNum">       9 </span>                :  * version 2.1 of the License, or (at your option) any later version.
-<span class="lineNum">      10 </span>                :  *
-<span class="lineNum">      11 </span>                :  * This library is distributed in the hope that it will be useful,
-<span class="lineNum">      12 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      13 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-<span class="lineNum">      14 </span>                :  * Lesser General Public License for more details.
-<span class="lineNum">      15 </span>                :  *
-<span class="lineNum">      16 </span>                :  * You should have received a copy of the GNU Lesser General Public
-<span class="lineNum">      17 </span>                :  * License along with this library; if not, write to the Free Software
-<span class="lineNum">      18 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
-<span class="lineNum">      19 </span>                :  */
-<span class="lineNum">      20 </span>                : 
-<span class="lineNum">      21 </span>                : #ifndef TAGCOLL_PATCHES_TCC
-<span class="lineNum">      22 </span>                : #define TAGCOLL_PATCHES_TCC
-<span class="lineNum">      23 </span>                : 
-<span class="lineNum">      24 </span>                : #include &lt;tagcoll/patch.h&gt;
-<span class="lineNum">      25 </span>                : #include &lt;wibble/singleton.h&gt;
-<span class="lineNum">      26 </span>                : #include &lt;wibble/empty.h&gt;
-<span class="lineNum">      27 </span>                : 
-<span class="lineNum">      28 </span>                : using namespace std;
-<span class="lineNum">      29 </span>                : using namespace wibble::operators;
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : namespace tagcoll {
-<span class="lineNum">      32 </span>                : 
-<span class="lineNum">      33 </span>                : template &lt;typename ITEM, typename TAG&gt;
-<span class="lineNum">      34 </span>                : Patch&lt;ITEM, TAG&gt;::Patch(const ITEM&amp; item, const std::set&lt;TAG&gt;&amp; added, const std::set&lt;TAG&gt;&amp; removed)
-<span class="lineNum">      35 </span><span class="lineCov">              2 :         : item(item), added(added-removed), removed(removed-added)</span>
-<span class="lineNum">      36 </span><span class="lineNoCov">              0 : {</span>
-<span class="lineNum">      37 </span><span class="lineCov">              2 : }</span>
-<span class="lineNum">      38 </span>                : 
-<span class="lineNum">      39 </span>                : template &lt;typename ITEM, typename TAG&gt; template&lt;typename CONTA, typename CONTB&gt;
-<span class="lineNum">      40 </span><span class="lineCov">              2 : Patch&lt;ITEM, TAG&gt;::Patch(const ITEM&amp; item, const CONTA&amp; added, const CONTB&amp; removed)</span>
-<span class="lineNum">      41 </span><span class="lineCov">              4 :         : item(item)</span>
-<span class="lineNum">      42 </span>                : {
-<span class="lineNum">      43 </span><span class="lineCov">              4 :         std::copy(added.begin(), added.end(), inserter(this-&gt;added, this-&gt;added.begin()));</span>
-<span class="lineNum">      44 </span><span class="lineCov">              4 :         std::copy(removed.begin(), removed.end(), inserter(this-&gt;removed, this-&gt;removed.begin()));</span>
-<span class="lineNum">      45 </span><span class="lineCov">              4 : }</span>
-<span class="lineNum">      46 </span>                : 
-<span class="lineNum">      47 </span>                : template &lt;class ITEM, class TAG&gt;
-<span class="lineNum">      48 </span>                : void PatchList&lt;ITEM, TAG&gt;::addPatch(const Patch&lt;ITEM, TAG&gt;&amp; patch)
-<span class="lineNum">      49 </span>                : {
-<span class="lineNum">      50 </span>                :         // Filter out empty patches
-<span class="lineNum">      51 </span><span class="lineCov">             15 :         if (patch.added.empty() &amp;&amp; patch.removed.empty())</span>
-<span class="lineNum">      52 </span><span class="lineNoCov">              0 :                 return;</span>
-<span class="lineNum">      53 </span>                : 
-<span class="lineNum">      54 </span><span class="lineCov">             15 :         iterator i = this-&gt;find(patch.item);</span>
-<span class="lineNum">      55 </span><span class="lineCov">             15 :         if (i == this-&gt;end())</span>
-<span class="lineNum">      56 </span><span class="lineCov">             13 :                 insert(make_pair&lt;ITEM, Patch&lt;ITEM, TAG&gt; &gt;(patch.item, patch));</span>
-<span class="lineNum">      57 </span>                :         else
-<span class="lineNum">      58 </span><span class="lineCov">              2 :                 i-&gt;second.mergeWith(patch);</span>
-<span class="lineNum">      59 </span>                : }
-<span class="lineNum">      60 </span>                : 
-<span class="lineNum">      61 </span>                : template &lt;class ITEM, class TAG&gt;
-<span class="lineNum">      62 </span>                : void PatchList&lt;ITEM, TAG&gt;::addPatch(const PatchList&lt;ITEM, TAG&gt;&amp; patches)
-<span class="lineNum">      63 </span>                : {
-<span class="lineNum">      64 </span>                :         for (typename PatchList&lt;ITEM, TAG&gt;::const_iterator i = patches.begin();
-<span class="lineNum">      65 </span>                :                         i != patches.end(); i++)
-<span class="lineNum">      66 </span>                :                 addPatch(i-&gt;second);
-<span class="lineNum">      67 </span>                : }
-<span class="lineNum">      68 </span>                : 
-<span class="lineNum">      69 </span>                : template &lt;class ITEM, class TAG&gt;
-<span class="lineNum">      70 </span>                : void PatchList&lt;ITEM, TAG&gt;::addPatchInverted(const Patch&lt;TAG, ITEM&gt;&amp; patch)
-<span class="lineNum">      71 </span>                : {
-<span class="lineNum">      72 </span>                :         // Filter out empty patches
-<span class="lineNum">      73 </span><span class="lineCov">              2 :         if (patch.added.empty() &amp;&amp; patch.removed.empty())</span>
-<span class="lineNum">      74 </span><span class="lineNoCov">              0 :                 return;</span>
-<span class="lineNum">      75 </span>                : 
-<span class="lineNum">      76 </span><span class="lineCov">              8 :         for (typename std::set&lt;ITEM&gt;::const_iterator i = patch.added.begin();</span>
-<span class="lineNum">      77 </span>                :                         i != patch.added.end(); ++i)
-<span class="lineNum">      78 </span><span class="lineCov">              2 :                 addPatch(Patch&lt;ITEM, TAG&gt;(*i, wibble::singleton(patch.item), wibble::Empty&lt;TAG&gt;()));</span>
-<span class="lineNum">      79 </span><span class="lineCov">              4 :         for (typename std::set&lt;ITEM&gt;::const_iterator i = patch.removed.begin();</span>
-<span class="lineNum">      80 </span>                :                         i != patch.removed.end(); ++i)
-<span class="lineNum">      81 </span><span class="lineNoCov">              0 :                 addPatch(Patch&lt;ITEM, TAG&gt;(*i, wibble::Empty&lt;TAG&gt;(), wibble::singleton(patch.item)));</span>
-<span class="lineNum">      82 </span>                : }
-<span class="lineNum">      83 </span>                : 
-<span class="lineNum">      84 </span>                : template &lt;class ITEM, class TAG&gt;
-<span class="lineNum">      85 </span>                : void PatchList&lt;ITEM, TAG&gt;::addPatchInverted(const PatchList&lt;TAG, ITEM&gt;&amp; patches)
-<span class="lineNum">      86 </span>                : {
-<span class="lineNum">      87 </span><span class="lineCov">              4 :         for (typename PatchList&lt;TAG, ITEM&gt;::const_iterator i = patches.begin();</span>
-<span class="lineNum">      88 </span>                :                         i != patches.end(); i++)
-<span class="lineNum">      89 </span><span class="lineCov">              2 :                 addPatchInverted(i-&gt;second);</span>
-<span class="lineNum">      90 </span><span class="lineCov">              2 : }</span>
-<span class="lineNum">      91 </span>                : 
-<span class="lineNum">      92 </span>                : 
-<span class="lineNum">      93 </span>                : template &lt;class ITEM, class TAG&gt; template&lt;typename COLL1, typename COLL2&gt;
-<span class="lineNum">      94 </span>                : void PatchList&lt;ITEM, TAG&gt;::addPatch(const COLL1&amp; im1, const COLL2&amp; im2)
-<span class="lineNum">      95 </span>                : {
-<span class="lineNum">      96 </span>                :         // FIXME: if I could implement the guarantee that the collection iterators
-<span class="lineNum">      97 </span>                :         // iterate in sorted item order, then I wouldn't need to extract all the
-<span class="lineNum">      98 </span>                :         // items of im2
-<span class="lineNum">      99 </span>                :         std::set&lt;ITEM&gt; im2items = im2.getTaggedItems();
-<span class="lineNum">     100 </span>                :         for (typename COLL1::const_iterator i1 = im1.begin();
-<span class="lineNum">     101 </span>                :                         i1 != im1.end(); ++i1)
-<span class="lineNum">     102 </span>                :         {
-<span class="lineNum">     103 </span>                :                 im2items.erase(i1-&gt;first);
-<span class="lineNum">     104 </span>                :                 std::set&lt;TAG&gt; ts2 = im2.getTagsOfItem(i1-&gt;first);
-<span class="lineNum">     105 </span>                :                 std::set&lt;TAG&gt; added = ts2 - i1-&gt;second;
-<span class="lineNum">     106 </span>                :                 std::set&lt;TAG&gt; removed = i1-&gt;second - ts2;
-<span class="lineNum">     107 </span>                :                 if (!added.empty() || !removed.empty())
-<span class="lineNum">     108 </span>                :                         addPatch(Patch&lt;ITEM, TAG&gt;(i1-&gt;first, added, removed));
-<span class="lineNum">     109 </span>                :         }
-<span class="lineNum">     110 </span>                :         for (typename std::set&lt;ITEM&gt;::const_iterator i = im2items.begin();
-<span class="lineNum">     111 </span>                :                         i != im2items.end(); ++i)
-<span class="lineNum">     112 </span>                :         {
-<span class="lineNum">     113 </span>                :                 addPatch(Patch&lt;ITEM, TAG&gt;(*i, im2.getTagsOfItem(*i), wibble::Empty&lt;TAG&gt;()));
-<span class="lineNum">     114 </span>                :         }
-<span class="lineNum">     115 </span>                : }
-<span class="lineNum">     116 </span>                : 
-<span class="lineNum">     117 </span>                : template &lt;class ITEM, class TAG&gt;
-<span class="lineNum">     118 </span>                : void PatchList&lt;ITEM, TAG&gt;::removeRedundant(const ITEM&amp; item, const std::set&lt;TAG&gt;&amp; tags)
-<span class="lineNum">     119 </span>                : {
-<span class="lineNum">     120 </span><span class="lineCov">              4 :         iterator i = this-&gt;find(item);</span>
-<span class="lineNum">     121 </span><span class="lineCov">              4 :         if (i == this-&gt;end()) return;</span>
-<span class="lineNum">     122 </span><span class="lineCov">              4 :         i-&gt;second.removeRedundant(tags);</span>
-<span class="lineNum">     123 </span>                : }
-<span class="lineNum">     124 </span>                : 
-<span class="lineNum">     125 </span>                : template &lt;class ITEM, class TAG&gt;
-<span class="lineNum">     126 </span>                : std::set&lt;TAG&gt; PatchList&lt;ITEM, TAG&gt;::patch(const ITEM&amp; item, const std::set&lt;TAG&gt;&amp; tagset) const
-<span class="lineNum">     127 </span>                : {
-<span class="lineNum">     128 </span>                :         // Find the patch record for this item
-<span class="lineNum">     129 </span><span class="lineCov">             14 :         const_iterator p = this-&gt;find(item);</span>
-<span class="lineNum">     130 </span><span class="lineCov">             14 :         if (p == this-&gt;end())</span>
-<span class="lineNum">     131 </span>                :                 // If there are no patches, return the tagset unchanged
-<span class="lineNum">     132 </span><span class="lineCov">             13 :                 return tagset;</span>
-<span class="lineNum">     133 </span>                : 
-<span class="lineNum">     134 </span>                :         // There are patches: apply them:
-<span class="lineNum">     135 </span><span class="lineCov">              1 :         return p-&gt;second.apply(tagset);</span>
-<span class="lineNum">     136 </span>                : }
-<span class="lineNum">     137 </span>                : 
-<span class="lineNum">     138 </span>                : template &lt;class ITEM, class TAG&gt;
-<span class="lineNum">     139 </span>                : PatchList&lt;ITEM, TAG&gt; PatchList&lt;ITEM, TAG&gt;::getReverse() const
-<span class="lineNum">     140 </span>                : {
-<span class="lineNum">     141 </span>                :         PatchList&lt;ITEM, TAG&gt; res;
-<span class="lineNum">     142 </span>                :         for (typename PatchList&lt;ITEM, TAG&gt;::const_iterator i = this-&gt;begin();
-<span class="lineNum">     143 </span>                :                         i != this-&gt;end(); i++)
-<span class="lineNum">     144 </span>                :                 res.addPatch(i-&gt;second.getReverse());
-<span class="lineNum">     145 </span>                :         return res;
-<span class="lineNum">     146 </span>                : }
-<span class="lineNum">     147 </span>                : 
-<span class="lineNum">     148 </span>                : template&lt;typename ITEM, typename TAG&gt; template&lt;typename OUT&gt;
-<span class="lineNum">     149 </span>                : void PatchList&lt;ITEM, TAG&gt;::output(OUT out) const
-<span class="lineNum">     150 </span>                : {
-<span class="lineNum">     151 </span><span class="lineCov">              6 :         for (typename PatchList&lt;ITEM, TAG&gt;::const_iterator i = this-&gt;begin();</span>
-<span class="lineNum">     152 </span>                :                         i != this-&gt;end(); ++i)
-<span class="lineNum">     153 </span>                :         {
-<span class="lineNum">     154 </span><span class="lineCov">              3 :                 *out = i-&gt;second;</span>
-<span class="lineNum">     155 </span><span class="lineCov">              3 :                 ++out;</span>
-<span class="lineNum">     156 </span>                :         }
-<span class="lineNum">     157 </span><span class="lineCov">              3 : }</span>
-<span class="lineNum">     158 </span>                : 
-<span class="lineNum">     159 </span>                : 
-<span class="lineNum">     160 </span><span class="lineCov">              6 : }</span>
-<span class="lineNum">     161 </span>                : 
-<span class="lineNum">     162 </span>                : #endif
-<span class="lineNum">     163 </span>                : 
-<span class="lineNum">     164 </span>                : // vim:set ts=4 sw=4:
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/stream/index.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/stream/index.html
deleted file mode 100644
index fdf6159..0000000
--- a/rep/usr/include/tagcoll-2.0.11/tagcoll/stream/index.html
+++ /dev/null
@@ -1,83 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/stream</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - /usr/include/tagcoll-2.0.11/tagcoll/stream</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">8</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">8</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <center>
-  <table width="80%" cellpadding=2 cellspacing=1 border=0>
-
-    <tr>
-      <td width="50%"><br></td>
-      <td width="15%"></td>
-      <td width="15%"></td>
-      <td width="20%"></td>
-    </tr>
-
-    <tr>
-      <td class="tableHead">Filename</td>
-      <td class="tableHead" colspan=3>Coverage</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="sink.h.gcov.html">sink.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">8&nbsp;/&nbsp;8&nbsp;lines</td>
-    </tr>
-
-  </table>
-  </center>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/stream/sink.h.gcov.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/stream/sink.h.gcov.html
deleted file mode 100644
index 159f2ea..0000000
--- a/rep/usr/include/tagcoll-2.0.11/tagcoll/stream/sink.h.gcov.html
+++ /dev/null
@@ -1,150 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/stream/sink.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/tagcoll-2.0.11/tagcoll/stream</a> - sink.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">8</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">8</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #ifndef TAGCOLL_STREAM_SINK_H
-<span class="lineNum">       2 </span>                : #define TAGCOLL_STREAM_SINK_H
-<span class="lineNum">       3 </span>                : 
-<span class="lineNum">       4 </span>                : /** \file
-<span class="lineNum">       5 </span>                :  * Consumer interface for a stream of tagged items
-<span class="lineNum">       6 </span>                :  */
-<span class="lineNum">       7 </span>                : 
-<span class="lineNum">       8 </span>                : /*
-<span class="lineNum">       9 </span>                :  * Copyright (C) 2003,2004,2005,2006  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">      10 </span>                :  *
-<span class="lineNum">      11 </span>                :  * This library is free software; you can redistribute it and/or
-<span class="lineNum">      12 </span>                :  * modify it under the terms of the GNU Lesser General Public
-<span class="lineNum">      13 </span>                :  * License as published by the Free Software Foundation; either
-<span class="lineNum">      14 </span>                :  * version 2.1 of the License, or (at your option) any later version.
-<span class="lineNum">      15 </span>                :  *
-<span class="lineNum">      16 </span>                :  * This library is distributed in the hope that it will be useful,
-<span class="lineNum">      17 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      18 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-<span class="lineNum">      19 </span>                :  * Lesser General Public License for more details.
-<span class="lineNum">      20 </span>                :  *
-<span class="lineNum">      21 </span>                :  * You should have received a copy of the GNU Lesser General Public
-<span class="lineNum">      22 </span>                :  * License along with this library; if not, write to the Free Software
-<span class="lineNum">      23 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
-<span class="lineNum">      24 </span>                :  */
-<span class="lineNum">      25 </span>                : 
-<span class="lineNum">      26 </span>                : #include &lt;wibble/mixin.h&gt;
-<span class="lineNum">      27 </span>                : #include &lt;utility&gt;
-<span class="lineNum">      28 </span>                : 
-<span class="lineNum">      29 </span>                : namespace tagcoll {
-<span class="lineNum">      30 </span>                : namespace stream {
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span>                : /**
-<span class="lineNum">      33 </span>                :  * Consumer that discards its input
-<span class="lineNum">      34 </span>                :  */
-<span class="lineNum">      35 </span>                : class Sink : public wibble::mixin::OutputIterator&lt;Sink&gt;
-<span class="lineNum">      36 </span>                : {
-<span class="lineNum">      37 </span>                : public:
-<span class="lineNum">      38 </span>                :         template&lt;typename Data&gt;
-<span class="lineNum">      39 </span>                :         const Sink&amp; operator=(const Data&amp;) const { return *this; }
-<span class="lineNum">      40 </span>                : };
-<span class="lineNum">      41 </span>                : 
-<span class="lineNum">      42 </span>                : inline Sink sink()
-<span class="lineNum">      43 </span>                : {
-<span class="lineNum">      44 </span>                :         return Sink();
-<span class="lineNum">      45 </span>                : }
-<span class="lineNum">      46 </span>                : 
-<span class="lineNum">      47 </span>                : 
-<span class="lineNum">      48 </span>                : /**
-<span class="lineNum">      49 </span>                :  * Consumer that discards its input
-<span class="lineNum">      50 </span>                :  */
-<span class="lineNum">      51 </span>                : template&lt;typename COUNTER&gt;
-<span class="lineNum">      52 </span>                : class CountingSink : public wibble::mixin::OutputIterator&lt; CountingSink&lt;COUNTER&gt; &gt;
-<span class="lineNum">      53 </span>                : {
-<span class="lineNum">      54 </span>                :         COUNTER&amp; countItems;
-<span class="lineNum">      55 </span>                :         COUNTER&amp; countTags;
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span>                : public:
-<span class="lineNum">      58 </span><span class="lineCov">              2 :         CountingSink(COUNTER&amp; countItems, COUNTER&amp; countTags) :</span>
-<span class="lineNum">      59 </span><span class="lineCov">              2 :                 countItems(countItems), countTags(countTags) {}</span>
-<span class="lineNum">      60 </span>                : 
-<span class="lineNum">      61 </span>                :         // TODO: see if there's a way of implementing the count using size() when
-<span class="lineNum">      62 </span>                :         // the method actually exists
-<span class="lineNum">      63 </span>                :         template&lt;typename ITEMS, typename TAGS&gt;
-<span class="lineNum">      64 </span><span class="lineCov">          42266 :         CountingSink&amp; operator=(const std::pair&lt;ITEMS, TAGS&gt;&amp; data)</span>
-<span class="lineNum">      65 </span>                :         {
-<span class="lineNum">      66 </span><span class="lineCov">          42266 :                 countItems += data.first.size();</span>
-<span class="lineNum">      67 </span><span class="lineCov">          42266 :                 countTags += data.second.size();</span>
-<span class="lineNum">      68 </span><span class="lineCov">          42266 :                 return *this;</span>
-<span class="lineNum">      69 </span>                :         }
-<span class="lineNum">      70 </span>                : };
-<span class="lineNum">      71 </span>                : 
-<span class="lineNum">      72 </span>                : template&lt;typename COUNTER&gt;
-<span class="lineNum">      73 </span><span class="lineCov">              2 : inline CountingSink&lt;COUNTER&gt; countingSink(COUNTER&amp; countItems, COUNTER&amp; countTags)</span>
-<span class="lineNum">      74 </span>                : {
-<span class="lineNum">      75 </span><span class="lineCov">              2 :         return CountingSink&lt;COUNTER&gt;(countItems, countTags);</span>
-<span class="lineNum">      76 </span>                : }
-<span class="lineNum">      77 </span>                : 
-<span class="lineNum">      78 </span>                : 
-<span class="lineNum">      79 </span>                : }
-<span class="lineNum">      80 </span>                : }
-<span class="lineNum">      81 </span>                : 
-<span class="lineNum">      82 </span>                : // vim:set ts=4 sw=4:
-<span class="lineNum">      83 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/utils/index.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/utils/index.html
deleted file mode 100644
index 05577be..0000000
--- a/rep/usr/include/tagcoll-2.0.11/tagcoll/utils/index.html
+++ /dev/null
@@ -1,83 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/utils</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - /usr/include/tagcoll-2.0.11/tagcoll/utils</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">12</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">83.3 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">10</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <center>
-  <table width="80%" cellpadding=2 cellspacing=1 border=0>
-
-    <tr>
-      <td width="50%"><br></td>
-      <td width="15%"></td>
-      <td width="15%"></td>
-      <td width="20%"></td>
-    </tr>
-
-    <tr>
-      <td class="tableHead">Filename</td>
-      <td class="tableHead" colspan=3>Coverage</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="set.h.gcov.html">set.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=83 height=10 alt="83.3%"><img src="../../../../../snow.png" width=17 height=10 alt="83.3%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">83.3&nbsp;%</td>
-      <td class="coverNumHi">10&nbsp;/&nbsp;12&nbsp;lines</td>
-    </tr>
-
-  </table>
-  </center>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/utils/set.h.gcov.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/utils/set.h.gcov.html
deleted file mode 100644
index 2ddbb97..0000000
--- a/rep/usr/include/tagcoll-2.0.11/tagcoll/utils/set.h.gcov.html
+++ /dev/null
@@ -1,155 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/utils/set.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/tagcoll-2.0.11/tagcoll/utils</a> - set.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">12</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">83.3 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">10</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : #ifndef TAGCOLL_UTILS_SET_H
-<span class="lineNum">       2 </span>                : #define TAGCOLL_UTILS_SET_H
-<span class="lineNum">       3 </span>                : 
-<span class="lineNum">       4 </span>                : /** \file
-<span class="lineNum">       5 </span>                :  * Extra useful set operations
-<span class="lineNum">       6 </span>                :  */
-<span class="lineNum">       7 </span>                : 
-<span class="lineNum">       8 </span>                : /*
-<span class="lineNum">       9 </span>                :  * Copyright (C) 2003,2004,2005,2006  Enrico Zini &lt;enrico@debian.org&gt;
-<span class="lineNum">      10 </span>                :  *
-<span class="lineNum">      11 </span>                :  * This library is free software; you can redistribute it and/or
-<span class="lineNum">      12 </span>                :  * modify it under the terms of the GNU Lesser General Public
-<span class="lineNum">      13 </span>                :  * License as published by the Free Software Foundation; either
-<span class="lineNum">      14 </span>                :  * version 2.1 of the License, or (at your option) any later version.
-<span class="lineNum">      15 </span>                :  *
-<span class="lineNum">      16 </span>                :  * This library is distributed in the hope that it will be useful,
-<span class="lineNum">      17 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      18 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-<span class="lineNum">      19 </span>                :  * Lesser General Public License for more details.
-<span class="lineNum">      20 </span>                :  *
-<span class="lineNum">      21 </span>                :  * You should have received a copy of the GNU Lesser General Public
-<span class="lineNum">      22 </span>                :  * License along with this library; if not, write to the Free Software
-<span class="lineNum">      23 </span>                :  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
-<span class="lineNum">      24 </span>                :  */
-<span class="lineNum">      25 </span>                : 
-<span class="lineNum">      26 </span>                : #include &lt;wibble/operators.h&gt;
-<span class="lineNum">      27 </span>                : #include &lt;set&gt;
-<span class="lineNum">      28 </span>                : 
-<span class="lineNum">      29 </span>                : namespace tagcoll {
-<span class="lineNum">      30 </span>                : namespace utils {
-<span class="lineNum">      31 </span>                : 
-<span class="lineNum">      32 </span>                : template&lt;typename T&gt;
-<span class="lineNum">      33 </span>                : int set_distance(const std::set&lt;T&gt;&amp; set1, const std::set&lt;T&gt;&amp; set2)
-<span class="lineNum">      34 </span>                : {
-<span class="lineNum">      35 </span>                :         int res = 0;
-<span class="lineNum">      36 </span>                :         int intCount = 0;
-<span class="lineNum">      37 </span>                : 
-<span class="lineNum">      38 </span>                :         typename std::set&lt;T&gt;::const_iterator a = set1.begin();
-<span class="lineNum">      39 </span>                :         typename std::set&lt;T&gt;::const_iterator b = set2.begin();
-<span class="lineNum">      40 </span>                : 
-<span class="lineNum">      41 </span>                :         while (a != set1.end() || b != set2.end())
-<span class="lineNum">      42 </span>                :                 if ((b == set2.end()) || (a != set1.end() &amp;&amp; *a &lt; *b))
-<span class="lineNum">      43 </span>                :                 {
-<span class="lineNum">      44 </span>                :                         res++;
-<span class="lineNum">      45 </span>                :                         a++;
-<span class="lineNum">      46 </span>                :                 }
-<span class="lineNum">      47 </span>                :                 else if ((a == set1.end()) || (b != set2.end() &amp;&amp; *b &lt; *a))
-<span class="lineNum">      48 </span>                :                 {
-<span class="lineNum">      49 </span>                :                         res++;
-<span class="lineNum">      50 </span>                :                         b++;
-<span class="lineNum">      51 </span>                :                 }
-<span class="lineNum">      52 </span>                :                 else
-<span class="lineNum">      53 </span>                :                 {
-<span class="lineNum">      54 </span>                :                         a++;
-<span class="lineNum">      55 </span>                :                         b++;
-<span class="lineNum">      56 </span>                :                         intCount++;
-<span class="lineNum">      57 </span>                :                 }
-<span class="lineNum">      58 </span>                :         
-<span class="lineNum">      59 </span>                :         return intCount ? res : -1;
-<span class="lineNum">      60 </span>                : }
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span>                : template&lt;typename T&gt;
-<span class="lineNum">      63 </span><span class="lineCov">              1 : bool set_contains(const std::set&lt;T&gt;&amp; set1, const std::set&lt;T&gt;&amp; set2)</span>
-<span class="lineNum">      64 </span>                : {
-<span class="lineNum">      65 </span><span class="lineCov">              1 :         typename std::set&lt;T&gt;::const_iterator b = set2.begin();</span>
-<span class="lineNum">      66 </span>                : 
-<span class="lineNum">      67 </span><span class="lineCov">            574 :         for (typename std::set&lt;T&gt;::const_iterator a = set1.begin(); a != set1.end(); ++a)</span>
-<span class="lineNum">      68 </span><span class="lineCov">            574 :                 if (b == set2.end())</span>
-<span class="lineNum">      69 </span><span class="lineCov">              1 :                         return true;</span>
-<span class="lineNum">      70 </span><span class="lineCov">            573 :                 else if (*a == *b)</span>
-<span class="lineNum">      71 </span><span class="lineCov">             31 :                         b++;</span>
-<span class="lineNum">      72 </span><span class="lineCov">            542 :                 else if (*b &lt; *a)</span>
-<span class="lineNum">      73 </span><span class="lineNoCov">              0 :                         return false;</span>
-<span class="lineNum">      74 </span>                : 
-<span class="lineNum">      75 </span><span class="lineNoCov">              0 :         return b == set2.end();</span>
-<span class="lineNum">      76 </span>                : }
-<span class="lineNum">      77 </span>                : 
-<span class="lineNum">      78 </span>                : template&lt;typename T&gt;
-<span class="lineNum">      79 </span><span class="lineCov">              4 : bool set_contains(const std::set&lt;T&gt;&amp; set1, const T&amp; item)</span>
-<span class="lineNum">      80 </span>                : {
-<span class="lineNum">      81 </span><span class="lineCov">              4 :         return set1.find(item) != set1.end();</span>
-<span class="lineNum">      82 </span>                : }
-<span class="lineNum">      83 </span>                : 
-<span class="lineNum">      84 </span>                : }
-<span class="lineNum">      85 </span>                : }
-<span class="lineNum">      86 </span>                : 
-<span class="lineNum">      87 </span>                : // vim:set ts=4 sw=4:
-<span class="lineNum">      88 </span>                : #endif
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/xapian/base.h.gcov.html b/rep/usr/include/xapian/base.h.gcov.html
deleted file mode 100644
index 3717ae6..0000000
--- a/rep/usr/include/xapian/base.h.gcov.html
+++ /dev/null
@@ -1,239 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/xapian/base.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/xapian</a> - base.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">11</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">45.5 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">5</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /* base.h: Reference-counted pointers
-<span class="lineNum">       2 </span>                :  *
-<span class="lineNum">       3 </span>                :  * Copyright 1999,2000,2001 BrightStation PLC
-<span class="lineNum">       4 </span>                :  * Copyright 2002 Ananova Ltd
-<span class="lineNum">       5 </span>                :  * Copyright 2002,2003,2004,2007 Olly Betts
-<span class="lineNum">       6 </span>                :  *
-<span class="lineNum">       7 </span>                :  * This program is free software; you can redistribute it and/or
-<span class="lineNum">       8 </span>                :  * modify it under the terms of the GNU General Public License as
-<span class="lineNum">       9 </span>                :  * published by the Free Software Foundation; either version 2 of the
-<span class="lineNum">      10 </span>                :  * License, or (at your option) any later version.
-<span class="lineNum">      11 </span>                :  *
-<span class="lineNum">      12 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      13 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      14 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      15 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      16 </span>                :  *
-<span class="lineNum">      17 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      18 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      19 </span>                :  * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301
-<span class="lineNum">      20 </span>                :  * USA
-<span class="lineNum">      21 </span>                :  */
-<span class="lineNum">      22 </span>                : 
-<span class="lineNum">      23 </span>                : #ifndef XAPIAN_INCLUDED_BASE_H
-<span class="lineNum">      24 </span>                : #define XAPIAN_INCLUDED_BASE_H
-<span class="lineNum">      25 </span>                : 
-<span class="lineNum">      26 </span>                : #include &lt;xapian/deprecated.h&gt;
-<span class="lineNum">      27 </span>                : 
-<span class="lineNum">      28 </span>                : namespace Xapian {
-<span class="lineNum">      29 </span>                : namespace Internal {
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : /** @internal Reference counted internal classes should inherit from RefCntBase.
-<span class="lineNum">      32 </span>                :  *
-<span class="lineNum">      33 </span>                :  * This gives the object a reference count used by RefCntPtr.
-<span class="lineNum">      34 </span>                :  */
-<span class="lineNum">      35 </span>                : class RefCntBase {
-<span class="lineNum">      36 </span>                :     /* Note: We never delete a pointer to a subclass of RefCntBase using
-<span class="lineNum">      37 </span>                :      * a RefCntBase *, so we don't need a virtual destructor here.
-<span class="lineNum">      38 </span>                :      */
-<span class="lineNum">      39 </span>                :     protected:
-<span class="lineNum">      40 </span>                :         /** The copy constructor.
-<span class="lineNum">      41 </span>                :          *
-<span class="lineNum">      42 </span>                :          *  This is protected since it'll only be used by derived classes,
-<span class="lineNum">      43 </span>                :          *  which should only rarely need copying (this is, after all, a
-<span class="lineNum">      44 </span>                :          *  refcount implementation).  Sometimes it's needed, though,
-<span class="lineNum">      45 </span>                :          *  since we need to zero ref_count in the copy.
-<span class="lineNum">      46 </span>                :          */
-<span class="lineNum">      47 </span>                :         RefCntBase(const RefCntBase &amp;) : ref_count(0) { }
-<span class="lineNum">      48 </span>                : 
-<span class="lineNum">      49 </span>                :     public:
-<span class="lineNum">      50 </span>                :         /// The constructor, which initialises the ref_count to 0.
-<span class="lineNum">      51 </span>                :         RefCntBase() : ref_count(0) { }
-<span class="lineNum">      52 </span>                : 
-<span class="lineNum">      53 </span>                :         typedef unsigned int ref_count_t;
-<span class="lineNum">      54 </span>                : 
-<span class="lineNum">      55 </span>                :         /** The actual reference count.  It's mutable so we can have reference
-<span class="lineNum">      56 </span>                :          *  counting work with const pointers.
-<span class="lineNum">      57 </span>                :          */
-<span class="lineNum">      58 </span>                :         mutable ref_count_t ref_count;
-<span class="lineNum">      59 </span>                : };
-<span class="lineNum">      60 </span>                : 
-<span class="lineNum">      61 </span>                : /** @internal A reference-counted pointer.  Can be used with any
-<span class="lineNum">      62 </span>                :  *  class derived from RefCntBase, as long as it is allocated
-<span class="lineNum">      63 </span>                :  *  on the heap by new (not new[]!).
-<span class="lineNum">      64 </span>                :  */
-<span class="lineNum">      65 </span>                : template &lt;class T&gt;
-<span class="lineNum">      66 </span>                : class RefCntPtr {
-<span class="lineNum">      67 </span>                :     private:
-<span class="lineNum">      68 </span>                :         T *dest;
-<span class="lineNum">      69 </span>                : 
-<span class="lineNum">      70 </span>                :     public:
-<span class="lineNum">      71 </span>                :         T *operator-&gt;() const;
-<span class="lineNum">      72 </span>                :         T &amp;operator*() const;
-<span class="lineNum">      73 </span>                :         T *get() const;
-<span class="lineNum">      74 </span>                :         /** Make a RefCntPtr for an object which may already
-<span class="lineNum">      75 </span>                :          *  have reference counted pointers.
-<span class="lineNum">      76 </span>                :          *
-<span class="lineNum">      77 </span>                :          *  You usually pass in a newly created object, or an object may pass
-<span class="lineNum">      78 </span>                :          *  in &quot;this&quot; to get a RefCntPtr to itself to pass to other classes.
-<span class="lineNum">      79 </span>                :          *  (e.g. a database might pass a newly created postlist a reference
-<span class="lineNum">      80 </span>                :          *  counted pointer to itself.)
-<span class="lineNum">      81 </span>                :          */
-<span class="lineNum">      82 </span>                :         RefCntPtr(T *dest_);
-<span class="lineNum">      83 </span>                :         RefCntPtr();
-<span class="lineNum">      84 </span>                :         RefCntPtr(const RefCntPtr &amp;other);
-<span class="lineNum">      85 </span>                :         void operator=(const RefCntPtr &amp;other);
-<span class="lineNum">      86 </span>                :         void operator=(T *dest_);
-<span class="lineNum">      87 </span>                :         ~RefCntPtr();
-<span class="lineNum">      88 </span>                : 
-<span class="lineNum">      89 </span>                :         template &lt;class U&gt;
-<span class="lineNum">      90 </span>                :         RefCntPtr(const RefCntPtr&lt;U&gt; &amp;other);
-<span class="lineNum">      91 </span>                : };
-<span class="lineNum">      92 </span>                : 
-<span class="lineNum">      93 </span>                : template &lt;class T&gt;
-<span class="lineNum">      94 </span><span class="lineCov">             19 : inline RefCntPtr&lt;T&gt;::RefCntPtr(T *dest_) : dest(dest_)</span>
-<span class="lineNum">      95 </span>                : {
-<span class="lineNum">      96 </span><span class="lineCov">             19 :     if (dest) ++dest-&gt;ref_count;</span>
-<span class="lineNum">      97 </span><span class="lineCov">             19 : }</span>
-<span class="lineNum">      98 </span>                : 
-<span class="lineNum">      99 </span>                : template &lt;class T&gt;
-<span class="lineNum">     100 </span>                : inline RefCntPtr&lt;T&gt;::RefCntPtr() : dest(0)
-<span class="lineNum">     101 </span>                : {
-<span class="lineNum">     102 </span>                : }
-<span class="lineNum">     103 </span>                : 
-<span class="lineNum">     104 </span>                : template &lt;class T&gt;
-<span class="lineNum">     105 </span>                : inline RefCntPtr&lt;T&gt;::RefCntPtr(const RefCntPtr &amp;other) : dest(other.dest)
-<span class="lineNum">     106 </span>                : {
-<span class="lineNum">     107 </span>                :     if (dest) ++dest-&gt;ref_count;
-<span class="lineNum">     108 </span>                : }
-<span class="lineNum">     109 </span>                : 
-<span class="lineNum">     110 </span>                : template &lt;class T&gt;
-<span class="lineNum">     111 </span>                : inline void RefCntPtr&lt;T&gt;::operator=(const RefCntPtr &amp;other) {
-<span class="lineNum">     112 </span>                :     operator=(other.dest);
-<span class="lineNum">     113 </span>                : }
-<span class="lineNum">     114 </span>                : 
-<span class="lineNum">     115 </span>                : template &lt;class T&gt;
-<span class="lineNum">     116 </span>                : inline void RefCntPtr&lt;T&gt;::operator=(T *dest_) {
-<span class="lineNum">     117 </span>                :     // check if we're assigning a pointer to itself
-<span class="lineNum">     118 </span>                :     if (dest == dest_) return;
-<span class="lineNum">     119 </span>                : 
-<span class="lineNum">     120 </span>                :     // copy the new dest in before we delete the old to avoid a small
-<span class="lineNum">     121 </span>                :     // window in which dest points to a deleted object
-<span class="lineNum">     122 </span>                :     // FIXME: if pointer assignment isn't atomic, we ought to use locking...
-<span class="lineNum">     123 </span>                :     T *old_dest = dest;
-<span class="lineNum">     124 </span>                :     dest = dest_;
-<span class="lineNum">     125 </span>                :     if (dest) ++dest-&gt;ref_count;
-<span class="lineNum">     126 </span>                :     if (old_dest &amp;&amp; --old_dest-&gt;ref_count == 0) delete old_dest;
-<span class="lineNum">     127 </span>                : }
-<span class="lineNum">     128 </span>                : 
-<span class="lineNum">     129 </span>                : template &lt;class T&gt;
-<span class="lineNum">     130 </span><span class="lineNoCov">              0 : inline RefCntPtr&lt;T&gt;::~RefCntPtr()</span>
-<span class="lineNum">     131 </span>                : {
-<span class="lineNum">     132 </span><span class="lineNoCov">              0 :     if (dest &amp;&amp; --dest-&gt;ref_count == 0) {</span>
-<span class="lineNum">     133 </span>                :         // zero before we delete to avoid a small window in which dest points
-<span class="lineNum">     134 </span>                :         // to a deleted object
-<span class="lineNum">     135 </span>                :         // FIXME: if pointer assignment isn't atomic, we ought to use locking...
-<span class="lineNum">     136 </span><span class="lineNoCov">              0 :         T * condemned = dest;</span>
-<span class="lineNum">     137 </span><span class="lineNoCov">              0 :         dest = 0;</span>
-<span class="lineNum">     138 </span><span class="lineNoCov">              0 :         delete condemned;</span>
-<span class="lineNum">     139 </span>                :     }
-<span class="lineNum">     140 </span><span class="lineNoCov">              0 : }</span>
-<span class="lineNum">     141 </span>                : 
-<span class="lineNum">     142 </span>                : template &lt;class T&gt;
-<span class="lineNum">     143 </span>                : template &lt;class U&gt;
-<span class="lineNum">     144 </span>                : inline
-<span class="lineNum">     145 </span>                : RefCntPtr&lt;T&gt;::RefCntPtr(const RefCntPtr&lt;U&gt; &amp;other)
-<span class="lineNum">     146 </span>                :         : dest(other.get())
-<span class="lineNum">     147 </span>                : {
-<span class="lineNum">     148 </span>                :     if (dest) ++dest-&gt;ref_count;
-<span class="lineNum">     149 </span>                : }
-<span class="lineNum">     150 </span>                : 
-<span class="lineNum">     151 </span>                : template &lt;class T&gt;
-<span class="lineNum">     152 </span>                : inline T *RefCntPtr&lt;T&gt;::operator-&gt;() const
-<span class="lineNum">     153 </span>                : {
-<span class="lineNum">     154 </span>                :     return dest;
-<span class="lineNum">     155 </span>                : }
-<span class="lineNum">     156 </span>                : 
-<span class="lineNum">     157 </span>                : template &lt;class T&gt;
-<span class="lineNum">     158 </span>                : inline T &amp;RefCntPtr&lt;T&gt;::operator*() const
-<span class="lineNum">     159 </span>                : {
-<span class="lineNum">     160 </span>                :     return *dest;
-<span class="lineNum">     161 </span>                : }
-<span class="lineNum">     162 </span>                : 
-<span class="lineNum">     163 </span>                : template &lt;class T&gt;
-<span class="lineNum">     164 </span><span class="lineCov">             30 : inline T *RefCntPtr&lt;T&gt;::get() const</span>
-<span class="lineNum">     165 </span>                : {
-<span class="lineNum">     166 </span><span class="lineCov">             30 :     return dest;</span>
-<span class="lineNum">     167 </span>                : }
-<span class="lineNum">     168 </span>                : 
-<span class="lineNum">     169 </span>                : }
-<span class="lineNum">     170 </span>                : }
-<span class="lineNum">     171 </span>                : 
-<span class="lineNum">     172 </span>                : #endif /* XAPIAN_INCLUDED_BASE_H */
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/xapian/database.h.gcov.html b/rep/usr/include/xapian/database.h.gcov.html
deleted file mode 100644
index 2a75331..0000000
--- a/rep/usr/include/xapian/database.h.gcov.html
+++ /dev/null
@@ -1,803 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/xapian/database.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/xapian</a> - database.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">4</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">4</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /** \file database.h
-<span class="lineNum">       2 </span>                :  * \brief API for working with Xapian databases
-<span class="lineNum">       3 </span>                :  */
-<span class="lineNum">       4 </span>                : /* Copyright 1999,2000,2001 BrightStation PLC
-<span class="lineNum">       5 </span>                :  * Copyright 2002 Ananova Ltd
-<span class="lineNum">       6 </span>                :  * Copyright 2002,2003,2004,2005,2006,2007 Olly Betts
-<span class="lineNum">       7 </span>                :  * Copyright 2006 Richard Boulton
-<span class="lineNum">       8 </span>                :  *
-<span class="lineNum">       9 </span>                :  * This program is free software; you can redistribute it and/or
-<span class="lineNum">      10 </span>                :  * modify it under the terms of the GNU General Public License as
-<span class="lineNum">      11 </span>                :  * published by the Free Software Foundation; either version 2 of the
-<span class="lineNum">      12 </span>                :  * License, or (at your option) any later version.
-<span class="lineNum">      13 </span>                :  *
-<span class="lineNum">      14 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      15 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      16 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      17 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      18 </span>                :  *
-<span class="lineNum">      19 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      20 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      21 </span>                :  * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301
-<span class="lineNum">      22 </span>                :  * USA
-<span class="lineNum">      23 </span>                :  */
-<span class="lineNum">      24 </span>                : 
-<span class="lineNum">      25 </span>                : #ifndef XAPIAN_INCLUDED_DATABASE_H
-<span class="lineNum">      26 </span>                : #define XAPIAN_INCLUDED_DATABASE_H
-<span class="lineNum">      27 </span>                : 
-<span class="lineNum">      28 </span>                : #include &lt;string&gt;
-<span class="lineNum">      29 </span>                : #include &lt;vector&gt;
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : #include &lt;xapian/base.h&gt;
-<span class="lineNum">      32 </span>                : #include &lt;xapian/types.h&gt;
-<span class="lineNum">      33 </span>                : #include &lt;xapian/positioniterator.h&gt;
-<span class="lineNum">      34 </span>                : #include &lt;xapian/postingiterator.h&gt;
-<span class="lineNum">      35 </span>                : #include &lt;xapian/termiterator.h&gt;
-<span class="lineNum">      36 </span>                : #include &lt;xapian/visibility.h&gt;
-<span class="lineNum">      37 </span>                : 
-<span class="lineNum">      38 </span>                : /// The Xapian library lives in the Xapian namespace.
-<span class="lineNum">      39 </span>                : namespace Xapian {
-<span class="lineNum">      40 </span>                : 
-<span class="lineNum">      41 </span>                : class Document;
-<span class="lineNum">      42 </span>                : 
-<span class="lineNum">      43 </span>                : /** This class is used to access a database, or a group of databases.
-<span class="lineNum">      44 </span>                :  *
-<span class="lineNum">      45 </span>                :  *  For searching, this class is used in conjunction with an Enquire object.
-<span class="lineNum">      46 </span>                :  *
-<span class="lineNum">      47 </span>                :  *  @exception InvalidArgumentError will be thrown if an invalid
-<span class="lineNum">      48 </span>                :  *  argument is supplied, for example, an unknown database type.
-<span class="lineNum">      49 </span>                :  *
-<span class="lineNum">      50 </span>                :  *  @exception DatabaseOpeningError may be thrown if the database cannot
-<span class="lineNum">      51 </span>                :  *  be opened (for example, a required file cannot be found).
-<span class="lineNum">      52 </span>                :  *
-<span class="lineNum">      53 </span>                :  *  @exception DatabaseVersionError may be thrown if the database is in an
-<span class="lineNum">      54 </span>                :  *  unsupported format (for example, created by a newer version of Xapian
-<span class="lineNum">      55 </span>                :  *  which uses an incompatible format).
-<span class="lineNum">      56 </span>                :  */
-<span class="lineNum">      57 </span>                : class XAPIAN_VISIBILITY_DEFAULT Database {
-<span class="lineNum">      58 </span>                :     public:
-<span class="lineNum">      59 </span>                :         class Internal;
-<span class="lineNum">      60 </span>                :         /// @private @internal Reference counted internals.
-<span class="lineNum">      61 </span>                :         std::vector&lt;Xapian::Internal::RefCntPtr&lt;Internal&gt; &gt; internal;
-<span class="lineNum">      62 </span>                : 
-<span class="lineNum">      63 </span>                :         /** Add an existing database (or group of databases) to those
-<span class="lineNum">      64 </span>                :          *  accessed by this object.
-<span class="lineNum">      65 </span>                :          *
-<span class="lineNum">      66 </span>                :          *  @param database the database(s) to add.
-<span class="lineNum">      67 </span>                :          */
-<span class="lineNum">      68 </span>                :         void add_database(const Database &amp; database);
-<span class="lineNum">      69 </span>                : 
-<span class="lineNum">      70 </span>                :         /** Create a Database with no databases in.
-<span class="lineNum">      71 </span>                :          */
-<span class="lineNum">      72 </span>                :         Database();
-<span class="lineNum">      73 </span>                : 
-<span class="lineNum">      74 </span>                :         /** Open a Database, automatically determining the database
-<span class="lineNum">      75 </span>                :          *  backend to use.
-<span class="lineNum">      76 </span>                :          *
-<span class="lineNum">      77 </span>                :          * @param path directory that the database is stored in.
-<span class="lineNum">      78 </span>                :          */
-<span class="lineNum">      79 </span>                :         explicit Database(const std::string &amp;path);
-<span class="lineNum">      80 </span>                : 
-<span class="lineNum">      81 </span>                :         /** @private @internal Create a Database from its internals.
-<span class="lineNum">      82 </span>                :          */
-<span class="lineNum">      83 </span>                :         explicit Database(Internal *internal);
-<span class="lineNum">      84 </span>                : 
-<span class="lineNum">      85 </span>                :         /** Destroy this handle on the database.
-<span class="lineNum">      86 </span>                :          *
-<span class="lineNum">      87 </span>                :          *  If there are no copies of this object remaining, the database(s)
-<span class="lineNum">      88 </span>                :          *  will be closed.
-<span class="lineNum">      89 </span>                :          */
-<span class="lineNum">      90 </span>                :         virtual ~Database();
-<span class="lineNum">      91 </span>                : 
-<span class="lineNum">      92 </span>                :         /** Copying is allowed.  The internals are reference counted, so
-<span class="lineNum">      93 </span>                :          *  copying is cheap.
-<span class="lineNum">      94 </span>                :          */
-<span class="lineNum">      95 </span>                :         Database(const Database &amp;other);
-<span class="lineNum">      96 </span>                : 
-<span class="lineNum">      97 </span>                :         /** Assignment is allowed.  The internals are reference counted,
-<span class="lineNum">      98 </span>                :          *  so assignment is cheap.
-<span class="lineNum">      99 </span>                :          */
-<span class="lineNum">     100 </span>                :         void operator=(const Database &amp;other);
-<span class="lineNum">     101 </span>                : 
-<span class="lineNum">     102 </span>                :         /** Re-open the database.
-<span class="lineNum">     103 </span>                :          *  This re-opens the database(s) to the latest available version(s).
-<span class="lineNum">     104 </span>                :          *  It can be used either to make sure the latest results are
-<span class="lineNum">     105 </span>                :          *  returned, or to recover from a Xapian::DatabaseModifiedError.
-<span class="lineNum">     106 </span>                :          */
-<span class="lineNum">     107 </span>                :         void reopen();
-<span class="lineNum">     108 </span>                : 
-<span class="lineNum">     109 </span>                :         /// Return a string describing this object.
-<span class="lineNum">     110 </span>                :         virtual std::string get_description() const;
-<span class="lineNum">     111 </span>                : 
-<span class="lineNum">     112 </span>                :         /** An iterator pointing to the start of the postlist
-<span class="lineNum">     113 </span>                :          *  for a given term.
-<span class="lineNum">     114 </span>                :          *
-<span class="lineNum">     115 </span>                :          *  If the term name is the empty string, the iterator returned
-<span class="lineNum">     116 </span>                :          *  will list all the documents in the database.  Such an iterator
-<span class="lineNum">     117 </span>                :          *  will always return a WDF value of 1, since there is no obvious
-<span class="lineNum">     118 </span>                :          *  meaning for this quantity in this case.
-<span class="lineNum">     119 </span>                :          */
-<span class="lineNum">     120 </span>                :         PostingIterator postlist_begin(const std::string &amp;tname) const;
-<span class="lineNum">     121 </span>                : 
-<span class="lineNum">     122 </span>                :         /** Corresponding end iterator to postlist_begin().
-<span class="lineNum">     123 </span>                :          */
-<span class="lineNum">     124 </span><span class="lineCov">             10 :         PostingIterator postlist_end(const std::string &amp;) const {</span>
-<span class="lineNum">     125 </span><span class="lineCov">             10 :             return PostingIterator(NULL);</span>
-<span class="lineNum">     126 </span>                :         }
-<span class="lineNum">     127 </span>                : 
-<span class="lineNum">     128 </span>                :         /** An iterator pointing to the start of the termlist
-<span class="lineNum">     129 </span>                :          *  for a given document.
-<span class="lineNum">     130 </span>                :          */
-<span class="lineNum">     131 </span>                :         TermIterator termlist_begin(Xapian::docid did) const;
-<span class="lineNum">     132 </span>                : 
-<span class="lineNum">     133 </span>                :         /** Corresponding end iterator to termlist_begin().
-<span class="lineNum">     134 </span>                :          */
-<span class="lineNum">     135 </span>                :         TermIterator termlist_end(Xapian::docid) const {
-<span class="lineNum">     136 </span>                :             return TermIterator(NULL);
-<span class="lineNum">     137 </span>                :         }
-<span class="lineNum">     138 </span>                : 
-<span class="lineNum">     139 </span>                :         /** Does this database have any positional information? */
-<span class="lineNum">     140 </span>                :         bool has_positions() const;
-<span class="lineNum">     141 </span>                : 
-<span class="lineNum">     142 </span>                :         /** An iterator pointing to the start of the position list
-<span class="lineNum">     143 </span>                :          *  for a given term in a given document.
-<span class="lineNum">     144 </span>                :          */
-<span class="lineNum">     145 </span>                :         PositionIterator positionlist_begin(Xapian::docid did, const std::string &amp;tname) const;
-<span class="lineNum">     146 </span>                : 
-<span class="lineNum">     147 </span>                :         /** Corresponding end iterator to positionlist_begin().
-<span class="lineNum">     148 </span>                :          */
-<span class="lineNum">     149 </span>                :         PositionIterator positionlist_end(Xapian::docid, const std::string &amp;) const {
-<span class="lineNum">     150 </span>                :             return PositionIterator(NULL);
-<span class="lineNum">     151 </span>                :         }
-<span class="lineNum">     152 </span>                : 
-<span class="lineNum">     153 </span>                :         /** An iterator which runs across all terms in the database.
-<span class="lineNum">     154 </span>                :          */
-<span class="lineNum">     155 </span>                :         TermIterator allterms_begin() const;
-<span class="lineNum">     156 </span>                : 
-<span class="lineNum">     157 </span>                :         /** Corresponding end iterator to allterms_begin().
-<span class="lineNum">     158 </span>                :          */
-<span class="lineNum">     159 </span>                :         TermIterator allterms_end() const {
-<span class="lineNum">     160 </span>                :             return TermIterator(NULL);
-<span class="lineNum">     161 </span>                :         }
-<span class="lineNum">     162 </span>                : 
-<span class="lineNum">     163 </span>                :         /** An iterator which runs across all terms with a given prefix.
-<span class="lineNum">     164 </span>                :          *
-<span class="lineNum">     165 </span>                :          *  This is functionally similar to getting an iterator with
-<span class="lineNum">     166 </span>                :          *  allterms_begin() and then calling skip_to(prefix) on that iterator
-<span class="lineNum">     167 </span>                :          *  to move to the start of the prefix, but is more convenient (because
-<span class="lineNum">     168 </span>                :          *  it detects the end of the prefixed terms), and may be more
-<span class="lineNum">     169 </span>                :          *  efficient than simply calling skip_to() after opening the iterator,
-<span class="lineNum">     170 </span>                :          *  particularly for network databases.
-<span class="lineNum">     171 </span>                :          *
-<span class="lineNum">     172 </span>                :          *  @param prefix The prefix to restrict the returned terms to.
-<span class="lineNum">     173 </span>                :          */
-<span class="lineNum">     174 </span>                :         TermIterator allterms_begin(const std::string &amp; prefix) const;
-<span class="lineNum">     175 </span>                : 
-<span class="lineNum">     176 </span>                :         /** Corresponding end iterator to allterms_begin(prefix).
-<span class="lineNum">     177 </span>                :          */
-<span class="lineNum">     178 </span><span class="lineCov">              1 :         TermIterator allterms_end(const std::string &amp;) const {</span>
-<span class="lineNum">     179 </span><span class="lineCov">              1 :             return TermIterator(NULL);</span>
-<span class="lineNum">     180 </span>                :         }
-<span class="lineNum">     181 </span>                : 
-<span class="lineNum">     182 </span>                :         /// Get the number of documents in the database.
-<span class="lineNum">     183 </span>                :         Xapian::doccount get_doccount() const;
-<span class="lineNum">     184 </span>                : 
-<span class="lineNum">     185 </span>                :         /// Get the highest document id which has been used in the database.
-<span class="lineNum">     186 </span>                :         Xapian::docid get_lastdocid() const;
-<span class="lineNum">     187 </span>                : 
-<span class="lineNum">     188 </span>                :         /// Get the average length of the documents in the database.
-<span class="lineNum">     189 </span>                :         Xapian::doclength get_avlength() const;
-<span class="lineNum">     190 </span>                : 
-<span class="lineNum">     191 </span>                :         /// Get the number of documents in the database indexed by a given term.
-<span class="lineNum">     192 </span>                :         Xapian::doccount get_termfreq(const std::string &amp; tname) const;
-<span class="lineNum">     193 </span>                : 
-<span class="lineNum">     194 </span>                :         /** Check if a given term exists in the database.
-<span class="lineNum">     195 </span>                :          *
-<span class="lineNum">     196 </span>                :          *  Return true if and only if the term exists in the database.
-<span class="lineNum">     197 </span>                :          *  This is the same as (get_termfreq(tname) != 0), but will often be
-<span class="lineNum">     198 </span>                :          *  more efficient.
-<span class="lineNum">     199 </span>                :          */
-<span class="lineNum">     200 </span>                :         bool term_exists(const std::string &amp; tname) const;
-<span class="lineNum">     201 </span>                : 
-<span class="lineNum">     202 </span>                :         /** Return the total number of occurrences of the given term.
-<span class="lineNum">     203 </span>                :          *
-<span class="lineNum">     204 </span>                :          *  This is the sum of the number of occurrences of the term in each
-<span class="lineNum">     205 </span>                :          *  document it indexes: i.e., the sum of the within document
-<span class="lineNum">     206 </span>                :          *  frequencies of the term.
-<span class="lineNum">     207 </span>                :          *
-<span class="lineNum">     208 </span>                :          *  @param tname  The term whose collection frequency is being
-<span class="lineNum">     209 </span>                :          *  requested.
-<span class="lineNum">     210 </span>                :          */
-<span class="lineNum">     211 </span>                :         Xapian::termcount get_collection_freq(const std::string &amp; tname) const;
-<span class="lineNum">     212 </span>                : 
-<span class="lineNum">     213 </span>                :         /** Get the length of a document.
-<span class="lineNum">     214 </span>                :          */
-<span class="lineNum">     215 </span>                :         Xapian::doclength get_doclength(Xapian::docid did) const;
-<span class="lineNum">     216 </span>                : 
-<span class="lineNum">     217 </span>                :         /** Send a &quot;keep-alive&quot; to remote databases to stop them timing
-<span class="lineNum">     218 </span>                :          *  out.
-<span class="lineNum">     219 </span>                :          */
-<span class="lineNum">     220 </span>                :         void keep_alive();
-<span class="lineNum">     221 </span>                : 
-<span class="lineNum">     222 </span>                :         /** Get a document from the database, given its document id.
-<span class="lineNum">     223 </span>                :          *
-<span class="lineNum">     224 </span>                :          *  This method returns a Xapian::Document object which provides the
-<span class="lineNum">     225 </span>                :          *  information about a document.
-<span class="lineNum">     226 </span>                :          *
-<span class="lineNum">     227 </span>                :          *  @param did   The document id for which to retrieve the data.
-<span class="lineNum">     228 </span>                :          *
-<span class="lineNum">     229 </span>                :          *  @return      A Xapian::Document object containing the document data
-<span class="lineNum">     230 </span>                :          *
-<span class="lineNum">     231 </span>                :          *  @exception Xapian::DocNotFoundError      The document specified
-<span class="lineNum">     232 </span>                :          *              could not be found in the database.
-<span class="lineNum">     233 </span>                :          */
-<span class="lineNum">     234 </span>                :         Xapian::Document get_document(Xapian::docid did) const;
-<span class="lineNum">     235 </span>                : 
-<span class="lineNum">     236 </span>                :         /** Suggest a spelling correction.
-<span class="lineNum">     237 </span>                :          *
-<span class="lineNum">     238 </span>                :          *  @param word                 The potentially misspelled word.
-<span class="lineNum">     239 </span>                :          *  @param max_edit_distance    Only consider words which are at most
-<span class="lineNum">     240 </span>                :          *      @a max_edit_distance edits from @a word.  An edit is a
-<span class="lineNum">     241 </span>                :          *      character insertion, deletion, or the transposition of two
-<span class="lineNum">     242 </span>                :          *      adjacent characters (default is 2).
-<span class="lineNum">     243 </span>                :          */
-<span class="lineNum">     244 </span>                :         std::string get_spelling_suggestion(const std::string &amp;word,
-<span class="lineNum">     245 </span>                :                                             unsigned max_edit_distance = 2) const;
-<span class="lineNum">     246 </span>                : 
-<span class="lineNum">     247 </span>                :         /** An iterator which returns all the spelling correction targets.
-<span class="lineNum">     248 </span>                :          *
-<span class="lineNum">     249 </span>                :          *  This returns all the words which are considered as targets for the
-<span class="lineNum">     250 </span>                :          *  spelling correction algorithm.  The frequency of each word is
-<span class="lineNum">     251 </span>                :          *  available as the term frequency of each entry in the returned
-<span class="lineNum">     252 </span>                :          *  iterator.
-<span class="lineNum">     253 </span>                :          */
-<span class="lineNum">     254 </span>                :         Xapian::TermIterator spellings_begin() const;
-<span class="lineNum">     255 </span>                : 
-<span class="lineNum">     256 </span>                :         /// Corresponding end iterator to spellings_begin().
-<span class="lineNum">     257 </span>                :         Xapian::TermIterator spellings_end() const {
-<span class="lineNum">     258 </span>                :             return Xapian::TermIterator(NULL);
-<span class="lineNum">     259 </span>                :         }
-<span class="lineNum">     260 </span>                : 
-<span class="lineNum">     261 </span>                :         /** An iterator which returns all the synonyms for a given term.
-<span class="lineNum">     262 </span>                :          *
-<span class="lineNum">     263 </span>                :          *  @param term     The term to return synonyms for.
-<span class="lineNum">     264 </span>                :          */
-<span class="lineNum">     265 </span>                :         Xapian::TermIterator synonyms_begin(const std::string &amp;term) const;
-<span class="lineNum">     266 </span>                : 
-<span class="lineNum">     267 </span>                :         /// Corresponding end iterator to synonyms_begin(term).
-<span class="lineNum">     268 </span>                :         Xapian::TermIterator synonyms_end(const std::string &amp;) const {
-<span class="lineNum">     269 </span>                :             return Xapian::TermIterator(NULL);
-<span class="lineNum">     270 </span>                :         }
-<span class="lineNum">     271 </span>                : 
-<span class="lineNum">     272 </span>                :         /** An iterator which returns all terms which have synonyms.
-<span class="lineNum">     273 </span>                :          *
-<span class="lineNum">     274 </span>                :          *  @param prefix   If non-empty, only terms with this prefix are
-<span class="lineNum">     275 </span>                :          *                  returned.
-<span class="lineNum">     276 </span>                :          */
-<span class="lineNum">     277 </span>                :         Xapian::TermIterator synonym_keys_begin(const std::string &amp;prefix = &quot;&quot;) const;
-<span class="lineNum">     278 </span>                : 
-<span class="lineNum">     279 </span>                :         /// Corresponding end iterator to synonym_keys_begin(prefix).
-<span class="lineNum">     280 </span>                :         Xapian::TermIterator synonym_keys_end(const std::string &amp; = &quot;&quot;) const {
-<span class="lineNum">     281 </span>                :             return Xapian::TermIterator(NULL);
-<span class="lineNum">     282 </span>                :         }
-<span class="lineNum">     283 </span>                : 
-<span class="lineNum">     284 </span>                :         /** Get the user-specified metadata associated with a given key.
-<span class="lineNum">     285 </span>                :          *
-<span class="lineNum">     286 </span>                :          *  User-specified metadata allows you to store arbitrary information
-<span class="lineNum">     287 </span>                :          *  in the form of (key,tag) pairs.  See @a
-<span class="lineNum">     288 </span>                :          *  WritableDatabase::set_metadata() for more information.
-<span class="lineNum">     289 </span>                :          *
-<span class="lineNum">     290 </span>                :          *  When invoked on a Xapian::Database object representing multiple
-<span class="lineNum">     291 </span>                :          *  databases, currently only the metadata for the first is considered
-<span class="lineNum">     292 </span>                :          *  but this behaviour may change in the future.
-<span class="lineNum">     293 </span>                :          *
-<span class="lineNum">     294 </span>                :          *  If there is no piece of metadata associated with the specified
-<span class="lineNum">     295 </span>                :          *  key, an empty string is returned (this applies even for backends
-<span class="lineNum">     296 </span>                :          *  which don't support metadata).
-<span class="lineNum">     297 </span>                :          *
-<span class="lineNum">     298 </span>                :          *  Empty keys are not valid, and specifying one will cause an
-<span class="lineNum">     299 </span>                :          *  exception.
-<span class="lineNum">     300 </span>                :          *
-<span class="lineNum">     301 </span>                :          *  @param key The key of the metadata item to access.
-<span class="lineNum">     302 </span>                :          *
-<span class="lineNum">     303 </span>                :          *  @return    The retrieved metadata item's value.
-<span class="lineNum">     304 </span>                :          *
-<span class="lineNum">     305 </span>                :          *  @exception Xapian::InvalidArgumentError will be thrown if the
-<span class="lineNum">     306 </span>                :          *             key supplied is empty.
-<span class="lineNum">     307 </span>                :          *
-<span class="lineNum">     308 </span>                :          *  @exception Xapian::UnimplementedError will be thrown if the
-<span class="lineNum">     309 </span>                :          *             database backend in use doesn't support user-specified
-<span class="lineNum">     310 </span>                :          *             metadata.
-<span class="lineNum">     311 </span>                :          */
-<span class="lineNum">     312 </span>                :         std::string get_metadata(const std::string &amp; key) const;
-<span class="lineNum">     313 </span>                : };
-<span class="lineNum">     314 </span>                : 
-<span class="lineNum">     315 </span>                : /** This class provides read/write access to a database.
-<span class="lineNum">     316 </span>                :  */
-<span class="lineNum">     317 </span>                : class XAPIAN_VISIBILITY_DEFAULT WritableDatabase : public Database {
-<span class="lineNum">     318 </span>                :     public:
-<span class="lineNum">     319 </span>                :         /** Destroy this handle on the database.
-<span class="lineNum">     320 </span>                :          *
-<span class="lineNum">     321 </span>                :          *  If there are no copies of this object remaining, the database
-<span class="lineNum">     322 </span>                :          *  will be closed.  If there are any transactions in progress
-<span class="lineNum">     323 </span>                :          *  these will be aborted as if cancel_transaction had been called.
-<span class="lineNum">     324 </span>                :          */
-<span class="lineNum">     325 </span>                :         virtual ~WritableDatabase();
-<span class="lineNum">     326 </span>                : 
-<span class="lineNum">     327 </span>                :         /** Create an empty WritableDatabase.
-<span class="lineNum">     328 </span>                :          */
-<span class="lineNum">     329 </span>                :         WritableDatabase();
-<span class="lineNum">     330 </span>                : 
-<span class="lineNum">     331 </span>                :         /** Open a database for update, automatically determining the database
-<span class="lineNum">     332 </span>                :          *  backend to use.
-<span class="lineNum">     333 </span>                :          *
-<span class="lineNum">     334 </span>                :          *  If the database is to be created, Xapian will try
-<span class="lineNum">     335 </span>                :          *  to create the directory indicated by path if it doesn't already
-<span class="lineNum">     336 </span>                :          *  exist (but only the leaf directory, not recursively).
-<span class="lineNum">     337 </span>                :          *
-<span class="lineNum">     338 </span>                :          * @param path directory that the database is stored in.
-<span class="lineNum">     339 </span>                :          * @param action one of:
-<span class="lineNum">     340 </span>                :          *  - Xapian::DB_CREATE_OR_OPEN open for read/write; create if no db
-<span class="lineNum">     341 </span>                :          *    exists
-<span class="lineNum">     342 </span>                :          *  - Xapian::DB_CREATE create new database; fail if db exists
-<span class="lineNum">     343 </span>                :          *  - Xapian::DB_CREATE_OR_OVERWRITE overwrite existing db; create if
-<span class="lineNum">     344 </span>                :          *    none exists
-<span class="lineNum">     345 </span>                :          *  - Xapian::DB_OPEN open for read/write; fail if no db exists
-<span class="lineNum">     346 </span>                :          */
-<span class="lineNum">     347 </span>                :         WritableDatabase(const std::string &amp;path, int action);
-<span class="lineNum">     348 </span>                : 
-<span class="lineNum">     349 </span>                :         /** @private @internal Create an WritableDatabase given its internals.
-<span class="lineNum">     350 </span>                :          */
-<span class="lineNum">     351 </span>                :         explicit WritableDatabase(Database::Internal *internal);
-<span class="lineNum">     352 </span>                : 
-<span class="lineNum">     353 </span>                :         /** Copying is allowed.  The internals are reference counted, so
-<span class="lineNum">     354 </span>                :          *  copying is cheap.
-<span class="lineNum">     355 </span>                :          */
-<span class="lineNum">     356 </span>                :         WritableDatabase(const WritableDatabase &amp;other);
-<span class="lineNum">     357 </span>                : 
-<span class="lineNum">     358 </span>                :         /** Assignment is allowed.  The internals are reference counted,
-<span class="lineNum">     359 </span>                :          *  so assignment is cheap.
-<span class="lineNum">     360 </span>                :          *
-<span class="lineNum">     361 </span>                :          *  Note that only an WritableDatabase may be assigned to an
-<span class="lineNum">     362 </span>                :          *  WritableDatabase: an attempt to assign a Database is caught
-<span class="lineNum">     363 </span>                :          *  at compile-time.
-<span class="lineNum">     364 </span>                :          */
-<span class="lineNum">     365 </span>                :         void operator=(const WritableDatabase &amp;other);
-<span class="lineNum">     366 </span>                : 
-<span class="lineNum">     367 </span>                :         /** Flush to disk any modifications made to the database.
-<span class="lineNum">     368 </span>                :          *
-<span class="lineNum">     369 </span>                :          *  For efficiency reasons, when performing multiple updates to a
-<span class="lineNum">     370 </span>                :          *  database it is best (indeed, almost essential) to make as many
-<span class="lineNum">     371 </span>                :          *  modifications as memory will permit in a single pass through
-<span class="lineNum">     372 </span>                :          *  the database.  To ensure this, Xapian batches up modifications.
-<span class="lineNum">     373 </span>                :          *
-<span class="lineNum">     374 </span>                :          *  Flush may be called at any time to
-<span class="lineNum">     375 </span>                :          *  ensure that the modifications which have been made are written to
-<span class="lineNum">     376 </span>                :          *  disk: if the flush succeeds, all the preceding modifications will
-<span class="lineNum">     377 </span>                :          *  have been written to disk.
-<span class="lineNum">     378 </span>                :          *
-<span class="lineNum">     379 </span>                :          *  If any of the modifications fail, an exception will be thrown and
-<span class="lineNum">     380 </span>                :          *  the database will be left in a state in which each separate
-<span class="lineNum">     381 </span>                :          *  addition, replacement or deletion operation has either been fully
-<span class="lineNum">     382 </span>                :          *  performed or not performed at all: it is then up to the
-<span class="lineNum">     383 </span>                :          *  application to work out which operations need to be repeated.
-<span class="lineNum">     384 </span>                :          *
-<span class="lineNum">     385 </span>                :          *  It's not valid to call flush within a transaction.
-<span class="lineNum">     386 </span>                :          *
-<span class="lineNum">     387 </span>                :          *  Beware of calling flush too frequently: this will have a severe
-<span class="lineNum">     388 </span>                :          *  performance cost.
-<span class="lineNum">     389 </span>                :          *
-<span class="lineNum">     390 </span>                :          *  Note that flush need not be called explicitly: it will be called
-<span class="lineNum">     391 </span>                :          *  automatically when the database is closed, or when a sufficient
-<span class="lineNum">     392 </span>                :          *  number of modifications have been made.
-<span class="lineNum">     393 </span>                :          *
-<span class="lineNum">     394 </span>                :          *  @exception Xapian::DatabaseError will be thrown if a problem occurs
-<span class="lineNum">     395 </span>                :          *             while modifying the database.
-<span class="lineNum">     396 </span>                :          *
-<span class="lineNum">     397 </span>                :          *  @exception Xapian::DatabaseCorruptError will be thrown if the
-<span class="lineNum">     398 </span>                :          *             database is in a corrupt state.
-<span class="lineNum">     399 </span>                :          *
-<span class="lineNum">     400 </span>                :          *  @exception Xapian::DatabaseLockError will be thrown if a lock
-<span class="lineNum">     401 </span>                :          *             couldn't be acquired on the database.
-<span class="lineNum">     402 </span>                :          */
-<span class="lineNum">     403 </span>                :         void flush();
-<span class="lineNum">     404 </span>                : 
-<span class="lineNum">     405 </span>                :         /** Begin a transaction.
-<span class="lineNum">     406 </span>                :          *
-<span class="lineNum">     407 </span>                :          *  In Xapian a transaction is a group of modifications to the database
-<span class="lineNum">     408 </span>                :          *  which are linked such that either all will be applied
-<span class="lineNum">     409 </span>                :          *  simultaneously or none will be applied at all.  Even in the case of
-<span class="lineNum">     410 </span>                :          *  a power failure, this characteristic should be preserved (as long
-<span class="lineNum">     411 </span>                :          *  as the filesystem isn't corrupted, etc).
-<span class="lineNum">     412 </span>                :          *
-<span class="lineNum">     413 </span>                :          *  A transaction is started with begin_transaction() and can
-<span class="lineNum">     414 </span>                :          *  either be committed by calling commit_transaction() or aborted
-<span class="lineNum">     415 </span>                :          *  by calling cancel_transaction().
-<span class="lineNum">     416 </span>                :          *
-<span class="lineNum">     417 </span>                :          *  By default, a transaction implicitly calls flush before and after
-<span class="lineNum">     418 </span>                :          *  so that the modifications stand and fall without affecting
-<span class="lineNum">     419 </span>                :          *  modifications before or after.
-<span class="lineNum">     420 </span>                :          *
-<span class="lineNum">     421 </span>                :          *  The downside of this flushing is that small transactions cause
-<span class="lineNum">     422 </span>                :          *  modifications to be frequently flushed which can harm indexing
-<span class="lineNum">     423 </span>                :          *  performance in the same way that explicitly calling flush
-<span class="lineNum">     424 </span>                :          *  frequently can.
-<span class="lineNum">     425 </span>                :          *
-<span class="lineNum">     426 </span>                :          *  If you're applying atomic groups of changes and only wish to
-<span class="lineNum">     427 </span>                :          *  ensure that each group is either applied or not applied, then
-<span class="lineNum">     428 </span>                :          *  you can prevent the automatic flush before and after the
-<span class="lineNum">     429 </span>                :          *  transaction by starting the transaction with
-<span class="lineNum">     430 </span>                :          *  begin_transaction(false).  However, if cancel_transaction is
-<span class="lineNum">     431 </span>                :          *  called (or if commit_transaction isn't called before the
-<span class="lineNum">     432 </span>                :          *  WritableDatabase object is destroyed) then any changes which
-<span class="lineNum">     433 </span>                :          *  were pending before the transaction began will also be discarded.
-<span class="lineNum">     434 </span>                :          *
-<span class="lineNum">     435 </span>                :          *  Transactions aren't currently supported by the InMemory backend.
-<span class="lineNum">     436 </span>                :          *
-<span class="lineNum">     437 </span>                :          *  @exception Xapian::UnimplementedError will be thrown if transactions
-<span class="lineNum">     438 </span>                :          *             are not available for this database type.
-<span class="lineNum">     439 </span>                :          *
-<span class="lineNum">     440 </span>                :          *  @exception Xapian::InvalidOperationError will be thrown if this is
-<span class="lineNum">     441 </span>                :          *             called at an invalid time, such as when a transaction
-<span class="lineNum">     442 </span>                :          *             is already in progress.
-<span class="lineNum">     443 </span>                :          */
-<span class="lineNum">     444 </span>                :         void begin_transaction(bool flushed=true);
-<span class="lineNum">     445 </span>                : 
-<span class="lineNum">     446 </span>                :         /** Complete the transaction currently in progress.
-<span class="lineNum">     447 </span>                :          *
-<span class="lineNum">     448 </span>                :          *  If this method completes successfully and this is a flushed
-<span class="lineNum">     449 </span>                :          *  transaction, all the database modifications
-<span class="lineNum">     450 </span>                :          *  made during the transaction will have been committed to the
-<span class="lineNum">     451 </span>                :          *  database.
-<span class="lineNum">     452 </span>                :          *
-<span class="lineNum">     453 </span>                :          *  If an error occurs, an exception will be thrown, and none of
-<span class="lineNum">     454 </span>                :          *  the modifications made to the database during the transaction
-<span class="lineNum">     455 </span>                :          *  will have been applied to the database.
-<span class="lineNum">     456 </span>                :          *
-<span class="lineNum">     457 </span>                :          *  In all cases the transaction will no longer be in progress.
-<span class="lineNum">     458 </span>                :          *
-<span class="lineNum">     459 </span>                :          *  @exception Xapian::DatabaseError will be thrown if a problem occurs
-<span class="lineNum">     460 </span>                :          *             while modifying the database.
-<span class="lineNum">     461 </span>                :          *
-<span class="lineNum">     462 </span>                :          *  @exception Xapian::DatabaseCorruptError will be thrown if the
-<span class="lineNum">     463 </span>                :          *             database is in a corrupt state.
-<span class="lineNum">     464 </span>                :          *
-<span class="lineNum">     465 </span>                :          *  @exception Xapian::InvalidOperationError will be thrown if a
-<span class="lineNum">     466 </span>                :          *             transaction is not currently in progress.
-<span class="lineNum">     467 </span>                :          *
-<span class="lineNum">     468 </span>                :          *  @exception Xapian::UnimplementedError will be thrown if transactions
-<span class="lineNum">     469 </span>                :          *             are not available for this database type.
-<span class="lineNum">     470 </span>                :          */
-<span class="lineNum">     471 </span>                :         void commit_transaction();
-<span class="lineNum">     472 </span>                : 
-<span class="lineNum">     473 </span>                :         /** Abort the transaction currently in progress, discarding the
-<span class="lineNum">     474 </span>                :          *  potential modifications made to the database.
-<span class="lineNum">     475 </span>                :          *
-<span class="lineNum">     476 </span>                :          *  If an error occurs in this method, an exception will be thrown,
-<span class="lineNum">     477 </span>                :          *  but the transaction will be cancelled anyway.
-<span class="lineNum">     478 </span>                :          *
-<span class="lineNum">     479 </span>                :          *  @exception Xapian::DatabaseError will be thrown if a problem occurs
-<span class="lineNum">     480 </span>                :          *             while modifying the database.
-<span class="lineNum">     481 </span>                :          *
-<span class="lineNum">     482 </span>                :          *  @exception Xapian::DatabaseCorruptError will be thrown if the
-<span class="lineNum">     483 </span>                :          *             database is in a corrupt state.
-<span class="lineNum">     484 </span>                :          *
-<span class="lineNum">     485 </span>                :          *  @exception Xapian::InvalidOperationError will be thrown if a
-<span class="lineNum">     486 </span>                :          *             transaction is not currently in progress.
-<span class="lineNum">     487 </span>                :          *
-<span class="lineNum">     488 </span>                :          *  @exception Xapian::UnimplementedError will be thrown if transactions
-<span class="lineNum">     489 </span>                :          *             are not available for this database type.
-<span class="lineNum">     490 </span>                :          */
-<span class="lineNum">     491 </span>                :         void cancel_transaction();
-<span class="lineNum">     492 </span>                : 
-<span class="lineNum">     493 </span>                :         /** Add a new document to the database.
-<span class="lineNum">     494 </span>                :          *
-<span class="lineNum">     495 </span>                :          *  This method adds the specified document to the database,
-<span class="lineNum">     496 </span>                :          *  returning a newly allocated document ID.  Automatically allocated
-<span class="lineNum">     497 </span>                :          *  document IDs come from a per-database monotonically increasing
-<span class="lineNum">     498 </span>                :          *  counter, so IDs from deleted documents won't be reused.
-<span class="lineNum">     499 </span>                :          *
-<span class="lineNum">     500 </span>                :          *  If you want to specify the document ID to be used, you should
-<span class="lineNum">     501 </span>                :          *  call replace_document() instead.
-<span class="lineNum">     502 </span>                :          *
-<span class="lineNum">     503 </span>                :          *  Note that changes to the database won't be immediately committed to
-<span class="lineNum">     504 </span>                :          *  disk; see flush() for more details.
-<span class="lineNum">     505 </span>                :          *
-<span class="lineNum">     506 </span>                :          *  As with all database modification operations, the effect is
-<span class="lineNum">     507 </span>                :          *  atomic: the document will either be fully added, or the document
-<span class="lineNum">     508 </span>                :          *  fails to be added and an exception is thrown (possibly at a
-<span class="lineNum">     509 </span>                :          *  later time when flush is called or the database is closed).
-<span class="lineNum">     510 </span>                :          *
-<span class="lineNum">     511 </span>                :          *  @param document The new document to be added.
-<span class="lineNum">     512 </span>                :          *
-<span class="lineNum">     513 </span>                :          *  @return         The document ID of the newly added document.
-<span class="lineNum">     514 </span>                :          *
-<span class="lineNum">     515 </span>                :          *  @exception Xapian::DatabaseError will be thrown if a problem occurs
-<span class="lineNum">     516 </span>                :          *             while writing to the database.
-<span class="lineNum">     517 </span>                :          *
-<span class="lineNum">     518 </span>                :          *  @exception Xapian::DatabaseCorruptError will be thrown if the
-<span class="lineNum">     519 </span>                :          *             database is in a corrupt state.
-<span class="lineNum">     520 </span>                :          */
-<span class="lineNum">     521 </span>                :         Xapian::docid add_document(const Xapian::Document &amp; document);
-<span class="lineNum">     522 </span>                : 
-<span class="lineNum">     523 </span>                :         /** Delete a document from the database.
-<span class="lineNum">     524 </span>                :          *
-<span class="lineNum">     525 </span>                :          *  This method removes the document with the specified document ID
-<span class="lineNum">     526 </span>                :          *  from the database.
-<span class="lineNum">     527 </span>                :          *
-<span class="lineNum">     528 </span>                :          *  Note that changes to the database won't be immediately committed to
-<span class="lineNum">     529 </span>                :          *  disk; see flush() for more details.
-<span class="lineNum">     530 </span>                :          *
-<span class="lineNum">     531 </span>                :          *  As with all database modification operations, the effect is
-<span class="lineNum">     532 </span>                :          *  atomic: the document will either be fully removed, or the document
-<span class="lineNum">     533 </span>                :          *  fails to be removed and an exception is thrown (possibly at a
-<span class="lineNum">     534 </span>                :          *  later time when flush is called or the database is closed).
-<span class="lineNum">     535 </span>                :          *
-<span class="lineNum">     536 </span>                :          *  @param did     The document ID of the document to be removed.
-<span class="lineNum">     537 </span>                :          *
-<span class="lineNum">     538 </span>                :          *  @exception Xapian::DatabaseError will be thrown if a problem occurs
-<span class="lineNum">     539 </span>                :          *             while writing to the database.
-<span class="lineNum">     540 </span>                :          *
-<span class="lineNum">     541 </span>                :          *  @exception Xapian::DatabaseCorruptError will be thrown if the
-<span class="lineNum">     542 </span>                :          *             database is in a corrupt state.
-<span class="lineNum">     543 </span>                :          */
-<span class="lineNum">     544 </span>                :         void delete_document(Xapian::docid did);
-<span class="lineNum">     545 </span>                : 
-<span class="lineNum">     546 </span>                :         /** Delete any documents indexed by a term from the database.
-<span class="lineNum">     547 </span>                :          *
-<span class="lineNum">     548 </span>                :          *  This method removes any documents indexed by the specified term
-<span class="lineNum">     549 </span>                :          *  from the database.
-<span class="lineNum">     550 </span>                :          *
-<span class="lineNum">     551 </span>                :          *  A major use is for convenience when UIDs from another system are
-<span class="lineNum">     552 </span>                :          *  mapped to terms in Xapian, although this method has other uses
-<span class="lineNum">     553 </span>                :          *  (for example, you could add a &quot;deletion date&quot; term to documents at
-<span class="lineNum">     554 </span>                :          *  index time and use this method to delete all documents due for
-<span class="lineNum">     555 </span>                :          *  deletion on a particular date).
-<span class="lineNum">     556 </span>                :          *
-<span class="lineNum">     557 </span>                :          *  @param unique_term     The term to remove references to.
-<span class="lineNum">     558 </span>                :          *
-<span class="lineNum">     559 </span>                :          *  @exception Xapian::DatabaseError will be thrown if a problem occurs
-<span class="lineNum">     560 </span>                :          *             while writing to the database.
-<span class="lineNum">     561 </span>                :          *
-<span class="lineNum">     562 </span>                :          *  @exception Xapian::DatabaseCorruptError will be thrown if the
-<span class="lineNum">     563 </span>                :          *             database is in a corrupt state.
-<span class="lineNum">     564 </span>                :          */
-<span class="lineNum">     565 </span>                :         void delete_document(const std::string &amp; unique_term);
-<span class="lineNum">     566 </span>                : 
-<span class="lineNum">     567 </span>                :         /** Replace a given document in the database.
-<span class="lineNum">     568 </span>                :          *
-<span class="lineNum">     569 </span>                :          *  This method replaces the document with the specified document ID.
-<span class="lineNum">     570 </span>                :          *  If document ID @a did isn't currently used, the document will be
-<span class="lineNum">     571 </span>                :          *  added with document ID @a did.
-<span class="lineNum">     572 </span>                :          *
-<span class="lineNum">     573 </span>                :          *  The monotonic counter used for automatically allocating document
-<span class="lineNum">     574 </span>                :          *  IDs is increased so that the next automatically allocated document
-<span class="lineNum">     575 </span>                :          *  ID will be did + 1.  Be aware that if you use this method to
-<span class="lineNum">     576 </span>                :          *  specify a high document ID for a new document, and also use
-<span class="lineNum">     577 </span>                :          *  WritableDatabase::add_document(), Xapian may get to a state where
-<span class="lineNum">     578 </span>                :          *  this counter wraps around and will be unable to automatically
-<span class="lineNum">     579 </span>                :          *  allocate document IDs!
-<span class="lineNum">     580 </span>                :          *
-<span class="lineNum">     581 </span>                :          *  Note that changes to the database won't be immediately committed to
-<span class="lineNum">     582 </span>                :          *  disk; see flush() for more details.
-<span class="lineNum">     583 </span>                :          *
-<span class="lineNum">     584 </span>                :          *  As with all database modification operations, the effect is
-<span class="lineNum">     585 </span>                :          *  atomic: the document will either be fully replaced, or the document
-<span class="lineNum">     586 </span>                :          *  fails to be replaced and an exception is thrown (possibly at a
-<span class="lineNum">     587 </span>                :          *  later time when flush is called or the database is closed).
-<span class="lineNum">     588 </span>                :          *
-<span class="lineNum">     589 </span>                :          *  @param did     The document ID of the document to be replaced.
-<span class="lineNum">     590 </span>                :          *  @param document The new document.
-<span class="lineNum">     591 </span>                :          *
-<span class="lineNum">     592 </span>                :          *  @exception Xapian::DatabaseError will be thrown if a problem occurs
-<span class="lineNum">     593 </span>                :          *             while writing to the database.
-<span class="lineNum">     594 </span>                :          *
-<span class="lineNum">     595 </span>                :          *  @exception Xapian::DatabaseCorruptError will be thrown if the
-<span class="lineNum">     596 </span>                :          *             database is in a corrupt state.
-<span class="lineNum">     597 </span>                :          */
-<span class="lineNum">     598 </span>                :         void replace_document(Xapian::docid did,
-<span class="lineNum">     599 </span>                :                               const Xapian::Document &amp; document);
-<span class="lineNum">     600 </span>                : 
-<span class="lineNum">     601 </span>                :         /** Replace any documents matching a term.
-<span class="lineNum">     602 </span>                :          *
-<span class="lineNum">     603 </span>                :          *  This method replaces any documents indexed by the specified term
-<span class="lineNum">     604 </span>                :          *  with the specified document.  If any documents are indexed by the
-<span class="lineNum">     605 </span>                :          *  term, the lowest document ID will be used for the document,
-<span class="lineNum">     606 </span>                :          *  otherwise a new document ID will be generated as for add_document.
-<span class="lineNum">     607 </span>                :          *
-<span class="lineNum">     608 </span>                :          *  The intended use is to allow UIDs from another system to easily
-<span class="lineNum">     609 </span>                :          *  be mapped to terms in Xapian, although this method probably has
-<span class="lineNum">     610 </span>                :          *  other uses.
-<span class="lineNum">     611 </span>                :          *
-<span class="lineNum">     612 </span>                :          *  Note that changes to the database won't be immediately committed to
-<span class="lineNum">     613 </span>                :          *  disk; see flush() for more details.
-<span class="lineNum">     614 </span>                :          *
-<span class="lineNum">     615 </span>                :          *  As with all database modification operations, the effect is
-<span class="lineNum">     616 </span>                :          *  atomic: the document(s) will either be fully replaced, or the
-<span class="lineNum">     617 </span>                :          *  document(s) fail to be replaced and an exception is thrown
-<span class="lineNum">     618 </span>                :          *  (possibly at a
-<span class="lineNum">     619 </span>                :          *  later time when flush is called or the database is closed).
-<span class="lineNum">     620 </span>                :          *
-<span class="lineNum">     621 </span>                :          *  @param unique_term    The &quot;unique&quot; term.
-<span class="lineNum">     622 </span>                :          *  @param document The new document.
-<span class="lineNum">     623 </span>                :          *
-<span class="lineNum">     624 </span>                :          *  @return         The document ID that document was given.
-<span class="lineNum">     625 </span>                :          *
-<span class="lineNum">     626 </span>                :          *  @exception Xapian::DatabaseError will be thrown if a problem occurs
-<span class="lineNum">     627 </span>                :          *             while writing to the database.
-<span class="lineNum">     628 </span>                :          *
-<span class="lineNum">     629 </span>                :          *  @exception Xapian::DatabaseCorruptError will be thrown if the
-<span class="lineNum">     630 </span>                :          *             database is in a corrupt state.
-<span class="lineNum">     631 </span>                :          */
-<span class="lineNum">     632 </span>                :         Xapian::docid replace_document(const std::string &amp; unique_term,
-<span class="lineNum">     633 </span>                :                                        const Xapian::Document &amp; document);
-<span class="lineNum">     634 </span>                : 
-<span class="lineNum">     635 </span>                :         /** Add a word to the spelling dictionary.
-<span class="lineNum">     636 </span>                :          *
-<span class="lineNum">     637 </span>                :          *  If the word is already present, its frequency is increased.
-<span class="lineNum">     638 </span>                :          *
-<span class="lineNum">     639 </span>                :          *  @param word     The word to add.
-<span class="lineNum">     640 </span>                :          *  @param freqinc  How much to increase its frequency by (default 1).
-<span class="lineNum">     641 </span>                :          */
-<span class="lineNum">     642 </span>                :         void add_spelling(const std::string &amp; word,
-<span class="lineNum">     643 </span>                :                           Xapian::termcount freqinc = 1) const;
-<span class="lineNum">     644 </span>                : 
-<span class="lineNum">     645 </span>                :         /** Remove a word from the spelling dictionary.
-<span class="lineNum">     646 </span>                :          *
-<span class="lineNum">     647 </span>                :          *  The word's frequency is decreased, and if would become zero or less
-<span class="lineNum">     648 </span>                :          *  then the word is removed completely.
-<span class="lineNum">     649 </span>                :          *
-<span class="lineNum">     650 </span>                :          *  @param word     The word to remove.
-<span class="lineNum">     651 </span>                :          *  @param freqdec  How much to decrease its frequency by (default 1).
-<span class="lineNum">     652 </span>                :          */
-<span class="lineNum">     653 </span>                :         void remove_spelling(const std::string &amp; word,
-<span class="lineNum">     654 </span>                :                              Xapian::termcount freqdec = 1) const;
-<span class="lineNum">     655 </span>                : 
-<span class="lineNum">     656 </span>                :         /** Add a synonym for a term.
-<span class="lineNum">     657 </span>                :          *
-<span class="lineNum">     658 </span>                :          *  If @a synonym is already a synonym for @a term, then no action is
-<span class="lineNum">     659 </span>                :          *  taken.
-<span class="lineNum">     660 </span>                :          */
-<span class="lineNum">     661 </span>                :         void add_synonym(const std::string &amp; term,
-<span class="lineNum">     662 </span>                :                          const std::string &amp; synonym) const;
-<span class="lineNum">     663 </span>                : 
-<span class="lineNum">     664 </span>                :         /** Remove a synonym for a term.
-<span class="lineNum">     665 </span>                :          *
-<span class="lineNum">     666 </span>                :          *  If @a synonym isn't a synonym for @a term, then no action is taken.
-<span class="lineNum">     667 </span>                :          */
-<span class="lineNum">     668 </span>                :         void remove_synonym(const std::string &amp; term,
-<span class="lineNum">     669 </span>                :                             const std::string &amp; synonym) const;
-<span class="lineNum">     670 </span>                : 
-<span class="lineNum">     671 </span>                :         /** Remove all synonyms for a term.
-<span class="lineNum">     672 </span>                :          *
-<span class="lineNum">     673 </span>                :          *  If @a term has no synonyms, no action is taken.
-<span class="lineNum">     674 </span>                :          */
-<span class="lineNum">     675 </span>                :         void clear_synonyms(const std::string &amp; term) const;
-<span class="lineNum">     676 </span>                : 
-<span class="lineNum">     677 </span>                :         /** Set the user-specified metadata associated with a given key.
-<span class="lineNum">     678 </span>                :          *
-<span class="lineNum">     679 </span>                :          *  This method sets the metadata value associated with a given key.
-<span class="lineNum">     680 </span>                :          *  If there is already a metadata value stored in the database with
-<span class="lineNum">     681 </span>                :          *  the same key, the old value is replaced.  If you want to delete an
-<span class="lineNum">     682 </span>                :          *  existing item of metadata, just set its value to the empty string.
-<span class="lineNum">     683 </span>                :          *
-<span class="lineNum">     684 </span>                :          *  User-specified metadata allows you to store arbitrary information
-<span class="lineNum">     685 </span>                :          *  in the form of (key,tag) pairs.
-<span class="lineNum">     686 </span>                :          *
-<span class="lineNum">     687 </span>                :          *  There's no hard limit on the number of metadata items, or the size
-<span class="lineNum">     688 </span>                :          *  of the metadata values.  Metadata keys have a limited length, which
-<span class="lineNum">     689 </span>                :          *  depends on the backend.  We recommend limiting them to 200 bytes.
-<span class="lineNum">     690 </span>                :          *  Empty keys are not valid, and specifying one will cause an
-<span class="lineNum">     691 </span>                :          *  exception.
-<span class="lineNum">     692 </span>                :          *
-<span class="lineNum">     693 </span>                :          *  Metadata modifications are committed to disk in the same way as
-<span class="lineNum">     694 </span>                :          *  modifications to the documents in the database are: i.e.,
-<span class="lineNum">     695 </span>                :          *  modifications are atomic, and won't be committed to disk
-<span class="lineNum">     696 </span>                :          *  immediately (see flush() for more details).  This allows metadata
-<span class="lineNum">     697 </span>                :          *  to be used to link databases with versioned external resources
-<span class="lineNum">     698 </span>                :          *  by storing the appropriate version number in a metadata item.
-<span class="lineNum">     699 </span>                :          *
-<span class="lineNum">     700 </span>                :          *  You can also use the metadata to store arbitrary extra information
-<span class="lineNum">     701 </span>                :          *  associated with terms, documents, or postings by encoding the
-<span class="lineNum">     702 </span>                :          *  termname and/or document id into the metadata key.
-<span class="lineNum">     703 </span>                :          *
-<span class="lineNum">     704 </span>                :          *  @param key   The key of the metadata item to set.
-<span class="lineNum">     705 </span>                :          *
-<span class="lineNum">     706 </span>                :          *  @param value The value of the metadata item to set.
-<span class="lineNum">     707 </span>                :          *
-<span class="lineNum">     708 </span>                :          *  @exception Xapian::DatabaseError will be thrown if a problem occurs
-<span class="lineNum">     709 </span>                :          *             while writing to the database.
-<span class="lineNum">     710 </span>                :          *
-<span class="lineNum">     711 </span>                :          *  @exception Xapian::DatabaseCorruptError will be thrown if the
-<span class="lineNum">     712 </span>                :          *             database is in a corrupt state.
-<span class="lineNum">     713 </span>                :          *
-<span class="lineNum">     714 </span>                :          *  @exception Xapian::InvalidArgumentError will be thrown if the
-<span class="lineNum">     715 </span>                :          *             key supplied is empty.
-<span class="lineNum">     716 </span>                :          */
-<span class="lineNum">     717 </span>                :         void set_metadata(const std::string &amp; key, const std::string &amp; value);
-<span class="lineNum">     718 </span>                : 
-<span class="lineNum">     719 </span>                :         /// Return a string describing this object.
-<span class="lineNum">     720 </span>                :         std::string get_description() const;
-<span class="lineNum">     721 </span>                : };
-<span class="lineNum">     722 </span>                : 
-<span class="lineNum">     723 </span>                : /** Open for read/write; create if no db exists. */
-<span class="lineNum">     724 </span>                : const int DB_CREATE_OR_OPEN = 1;
-<span class="lineNum">     725 </span>                : /** Create a new database; fail if db exists. */
-<span class="lineNum">     726 </span>                : const int DB_CREATE = 2;
-<span class="lineNum">     727 </span>                : /** Overwrite existing db; create if none exists. */
-<span class="lineNum">     728 </span>                : const int DB_CREATE_OR_OVERWRITE = 3;
-<span class="lineNum">     729 </span>                : /** Open for read/write; fail if no db exists. */
-<span class="lineNum">     730 </span>                : const int DB_OPEN = 4;
-<span class="lineNum">     731 </span>                : // Can't see any sensible use for this one
-<span class="lineNum">     732 </span>                : // const int DB_OVERWRITE = XXX;
-<span class="lineNum">     733 </span>                : 
-<span class="lineNum">     734 </span>                : }
-<span class="lineNum">     735 </span>                : 
-<span class="lineNum">     736 </span>                : #endif /* XAPIAN_INCLUDED_DATABASE_H */
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/xapian/document.h.gcov.html b/rep/usr/include/xapian/document.h.gcov.html
deleted file mode 100644
index dace408..0000000
--- a/rep/usr/include/xapian/document.h.gcov.html
+++ /dev/null
@@ -1,267 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/xapian/document.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/xapian</a> - document.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">2</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">0.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">0</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /** \file document.h
-<span class="lineNum">       2 </span>                :  * \brief API for working with documents
-<span class="lineNum">       3 </span>                :  */
-<span class="lineNum">       4 </span>                : /* Copyright 1999,2000,2001 BrightStation PLC
-<span class="lineNum">       5 </span>                :  * Copyright 2002 Ananova Ltd
-<span class="lineNum">       6 </span>                :  * Copyright 2002,2003,2004,2006,2007 Olly Betts
-<span class="lineNum">       7 </span>                :  *
-<span class="lineNum">       8 </span>                :  * This program is free software; you can redistribute it and/or
-<span class="lineNum">       9 </span>                :  * modify it under the terms of the GNU General Public License as
-<span class="lineNum">      10 </span>                :  * published by the Free Software Foundation; either version 2 of the
-<span class="lineNum">      11 </span>                :  * License, or (at your option) any later version.
-<span class="lineNum">      12 </span>                :  *
-<span class="lineNum">      13 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      14 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      15 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      16 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      17 </span>                :  *
-<span class="lineNum">      18 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      19 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      20 </span>                :  * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301
-<span class="lineNum">      21 </span>                :  * USA
-<span class="lineNum">      22 </span>                :  */
-<span class="lineNum">      23 </span>                : 
-<span class="lineNum">      24 </span>                : #ifndef XAPIAN_INCLUDED_DOCUMENT_H
-<span class="lineNum">      25 </span>                : #define XAPIAN_INCLUDED_DOCUMENT_H
-<span class="lineNum">      26 </span>                : 
-<span class="lineNum">      27 </span>                : #include &lt;string&gt;
-<span class="lineNum">      28 </span>                : 
-<span class="lineNum">      29 </span>                : #include &lt;xapian/base.h&gt;
-<span class="lineNum">      30 </span>                : #include &lt;xapian/types.h&gt;
-<span class="lineNum">      31 </span>                : #include &lt;xapian/termiterator.h&gt;
-<span class="lineNum">      32 </span>                : #include &lt;xapian/visibility.h&gt;
-<span class="lineNum">      33 </span>                : 
-<span class="lineNum">      34 </span>                : namespace Xapian {
-<span class="lineNum">      35 </span>                : 
-<span class="lineNum">      36 </span>                : class ValueIterator;
-<span class="lineNum">      37 </span>                : 
-<span class="lineNum">      38 </span>                : /// A document in the database - holds data, values, terms, and postings
-<span class="lineNum">      39 </span>                : class XAPIAN_VISIBILITY_DEFAULT Document {
-<span class="lineNum">      40 </span>                :     public:
-<span class="lineNum">      41 </span>                :         class Internal;
-<span class="lineNum">      42 </span>                :         /// @private @internal Reference counted internals.
-<span class="lineNum">      43 </span>                :         Xapian::Internal::RefCntPtr&lt;Internal&gt; internal;
-<span class="lineNum">      44 </span>                : 
-<span class="lineNum">      45 </span>                :         /** @private @internal Constructor is only used by internal classes.
-<span class="lineNum">      46 </span>                :          *
-<span class="lineNum">      47 </span>                :          *  @param internal_ pointer to internal opaque class
-<span class="lineNum">      48 </span>                :          */
-<span class="lineNum">      49 </span>                :         explicit Document(Internal *internal_);
-<span class="lineNum">      50 </span>                : 
-<span class="lineNum">      51 </span>                :         /** Copying is allowed.  The internals are reference counted, so
-<span class="lineNum">      52 </span>                :          *  copying is cheap.
-<span class="lineNum">      53 </span>                :          */
-<span class="lineNum">      54 </span>                :         Document(const Document &amp;other);
-<span class="lineNum">      55 </span>                : 
-<span class="lineNum">      56 </span>                :         /** Assignment is allowed.  The internals are reference counted,
-<span class="lineNum">      57 </span>                :          *  so assignment is cheap.
-<span class="lineNum">      58 </span>                :          */
-<span class="lineNum">      59 </span>                :         void operator=(const Document &amp;other);
-<span class="lineNum">      60 </span>                : 
-<span class="lineNum">      61 </span>                :         /// Make a new empty Document
-<span class="lineNum">      62 </span>                :         Document();
-<span class="lineNum">      63 </span>                : 
-<span class="lineNum">      64 </span>                :         /// Destructor
-<span class="lineNum">      65 </span>                :         ~Document();
-<span class="lineNum">      66 </span>                : 
-<span class="lineNum">      67 </span>                :         /** Get value by number.
-<span class="lineNum">      68 </span>                :          *
-<span class="lineNum">      69 </span>                :          *  Returns an empty string if no value with the given number is present
-<span class="lineNum">      70 </span>                :          *  in the document.
-<span class="lineNum">      71 </span>                :          *
-<span class="lineNum">      72 </span>                :          *  @param valueno The number of the value.
-<span class="lineNum">      73 </span>                :          */
-<span class="lineNum">      74 </span>                :         std::string get_value(Xapian::valueno valueno) const;
-<span class="lineNum">      75 </span>                : 
-<span class="lineNum">      76 </span>                :         /** Add a new value.  It will replace any existing value with the
-<span class="lineNum">      77 </span>                :          *  same number.
-<span class="lineNum">      78 </span>                :          */
-<span class="lineNum">      79 </span>                :         void add_value(Xapian::valueno valueno, const std::string &amp;value);
-<span class="lineNum">      80 </span>                : 
-<span class="lineNum">      81 </span>                :         /// Remove any value with the given number.
-<span class="lineNum">      82 </span>                :         void remove_value(Xapian::valueno valueno);
-<span class="lineNum">      83 </span>                : 
-<span class="lineNum">      84 </span>                :         /// Remove all values associated with the document.
-<span class="lineNum">      85 </span>                :         void clear_values();
-<span class="lineNum">      86 </span>                : 
-<span class="lineNum">      87 </span>                :         /** Get data stored in the document.
-<span class="lineNum">      88 </span>                :          *  This is a potentially expensive operation, and shouldn't normally
-<span class="lineNum">      89 </span>                :          *  be used in a match decider functor.  Put data for use by match
-<span class="lineNum">      90 </span>                :          *  deciders in a value instead.
-<span class="lineNum">      91 </span>                :          */
-<span class="lineNum">      92 </span>                :         std::string get_data() const;
-<span class="lineNum">      93 </span>                : 
-<span class="lineNum">      94 </span>                :         /// Set data stored in the document.
-<span class="lineNum">      95 </span>                :         void set_data(const std::string &amp;data);
-<span class="lineNum">      96 </span>                : 
-<span class="lineNum">      97 </span>                :         /** Add an occurrence of a term at a particular position.
-<span class="lineNum">      98 </span>                :          *
-<span class="lineNum">      99 </span>                :          *  Multiple occurrences of the term at the same position are
-<span class="lineNum">     100 </span>                :          *  represented only once in the positional information, but do
-<span class="lineNum">     101 </span>                :          *  increase the wdf.
-<span class="lineNum">     102 </span>                :          *
-<span class="lineNum">     103 </span>                :          *  If the term is not already in the document, it will be added to
-<span class="lineNum">     104 </span>                :          *  it.
-<span class="lineNum">     105 </span>                :          *
-<span class="lineNum">     106 </span>                :          *  @param tname     The name of the term.
-<span class="lineNum">     107 </span>                :          *  @param tpos      The position of the term.
-<span class="lineNum">     108 </span>                :          *  @param wdfinc    The increment that will be applied to the wdf
-<span class="lineNum">     109 </span>                :          *                   for this term.
-<span class="lineNum">     110 </span>                :          */
-<span class="lineNum">     111 </span>                :         void add_posting(const std::string &amp; tname,
-<span class="lineNum">     112 </span>                :                          Xapian::termpos tpos,
-<span class="lineNum">     113 </span>                :                          Xapian::termcount wdfinc = 1);
-<span class="lineNum">     114 </span>                : 
-<span class="lineNum">     115 </span>                :         /** Add a term to the document, without positional information.
-<span class="lineNum">     116 </span>                :          *
-<span class="lineNum">     117 </span>                :          *  Any existing positional information for the term will be left
-<span class="lineNum">     118 </span>                :          *  unmodified.
-<span class="lineNum">     119 </span>                :          *
-<span class="lineNum">     120 </span>                :          *  @param tname     The name of the term.
-<span class="lineNum">     121 </span>                :          *  @param wdfinc    The increment that will be applied to the wdf
-<span class="lineNum">     122 </span>                :          *                   for this term.
-<span class="lineNum">     123 </span>                :          */
-<span class="lineNum">     124 </span>                :         void add_term(const std::string &amp; tname, Xapian::termcount wdfinc = 1);
-<span class="lineNum">     125 </span>                : 
-<span class="lineNum">     126 </span>                :         /** Remove a posting of a term from the document.
-<span class="lineNum">     127 </span>                :          *
-<span class="lineNum">     128 </span>                :          *  Note that the term will still index the document even if all
-<span class="lineNum">     129 </span>                :          *  occurrences are removed.  To remove a term from a document
-<span class="lineNum">     130 </span>                :          *  completely, use remove_term().
-<span class="lineNum">     131 </span>                :          *
-<span class="lineNum">     132 </span>                :          *  @param tname     The name of the term.
-<span class="lineNum">     133 </span>                :          *  @param tpos      The position of the term.
-<span class="lineNum">     134 </span>                :          *  @param wdfdec    The decrement that will be applied to the wdf
-<span class="lineNum">     135 </span>                :          *                   when removing this posting.  The wdf will not go
-<span class="lineNum">     136 </span>                :          *                   below the value of 0.
-<span class="lineNum">     137 </span>                :          *
-<span class="lineNum">     138 </span>                :          *  @exception Xapian::InvalidArgumentError will be thrown if the term
-<span class="lineNum">     139 </span>                :          *  is not at the position specified in the position list for this term
-<span class="lineNum">     140 </span>                :          *  in this document.
-<span class="lineNum">     141 </span>                :          *
-<span class="lineNum">     142 </span>                :          *  @exception Xapian::InvalidArgumentError will be thrown if the term
-<span class="lineNum">     143 </span>                :          *  is not in the document
-<span class="lineNum">     144 </span>                :          */
-<span class="lineNum">     145 </span>                :         void remove_posting(const std::string &amp; tname,
-<span class="lineNum">     146 </span>                :                             Xapian::termpos tpos,
-<span class="lineNum">     147 </span>                :                             Xapian::termcount wdfdec = 1);
-<span class="lineNum">     148 </span>                : 
-<span class="lineNum">     149 </span>                :         /** Remove a term and all postings associated with it.
-<span class="lineNum">     150 </span>                :          *
-<span class="lineNum">     151 </span>                :          *  @param tname  The name of the term.
-<span class="lineNum">     152 </span>                :          *
-<span class="lineNum">     153 </span>                :          *  @exception Xapian::InvalidArgumentError will be thrown if the term
-<span class="lineNum">     154 </span>                :          *  is not in the document
-<span class="lineNum">     155 </span>                :          */
-<span class="lineNum">     156 </span>                :         void remove_term(const std::string &amp; tname);
-<span class="lineNum">     157 </span>                : 
-<span class="lineNum">     158 </span>                :         /// Remove all terms (and postings) from the document.
-<span class="lineNum">     159 </span>                :         void clear_terms();
-<span class="lineNum">     160 </span>                : 
-<span class="lineNum">     161 </span>                :         /** The length of the termlist - i.e. the number of different terms
-<span class="lineNum">     162 </span>                :          *  which index this document.
-<span class="lineNum">     163 </span>                :          */
-<span class="lineNum">     164 </span>                :         Xapian::termcount termlist_count() const;
-<span class="lineNum">     165 </span>                : 
-<span class="lineNum">     166 </span>                :         /// Iterator for the terms in this document.
-<span class="lineNum">     167 </span>                :         TermIterator termlist_begin() const;
-<span class="lineNum">     168 </span>                : 
-<span class="lineNum">     169 </span>                :         /// Equivalent end iterator for termlist_begin().
-<span class="lineNum">     170 </span><span class="lineNoCov">              0 :         TermIterator termlist_end() const {</span>
-<span class="lineNum">     171 </span><span class="lineNoCov">              0 :             return TermIterator(NULL);</span>
-<span class="lineNum">     172 </span>                :         }
-<span class="lineNum">     173 </span>                : 
-<span class="lineNum">     174 </span>                :         /// Count the values in this document.
-<span class="lineNum">     175 </span>                :         Xapian::termcount values_count() const;
-<span class="lineNum">     176 </span>                : 
-<span class="lineNum">     177 </span>                :         /// Iterator for the values in this document.
-<span class="lineNum">     178 </span>                :         ValueIterator values_begin() const;
-<span class="lineNum">     179 </span>                : 
-<span class="lineNum">     180 </span>                :         /// Equivalent end iterator for values_begin().
-<span class="lineNum">     181 </span>                :         ValueIterator values_end() const;
-<span class="lineNum">     182 </span>                : 
-<span class="lineNum">     183 </span>                :         /** Get the document id which is associated with this document (if any).
-<span class="lineNum">     184 </span>                :          *
-<span class="lineNum">     185 </span>                :          *  NB If multiple databases are being searched together, then this
-<span class="lineNum">     186 </span>                :          *  will be the document id in the individual database, not the merged
-<span class="lineNum">     187 </span>                :          *  database!
-<span class="lineNum">     188 </span>                :          *
-<span class="lineNum">     189 </span>                :          *  @return If this document came from a database, return the document
-<span class="lineNum">     190 </span>                :          *          id in that database.  Otherwise, return 0.
-<span class="lineNum">     191 </span>                :          */
-<span class="lineNum">     192 </span>                :         docid get_docid() const;
-<span class="lineNum">     193 </span>                : 
-<span class="lineNum">     194 </span>                :         /// Return a string describing this object.
-<span class="lineNum">     195 </span>                :         std::string get_description() const;
-<span class="lineNum">     196 </span>                : };
-<span class="lineNum">     197 </span>                : 
-<span class="lineNum">     198 </span>                : }
-<span class="lineNum">     199 </span>                : 
-<span class="lineNum">     200 </span>                : #endif // XAPIAN_INCLUDED_DOCUMENT_H
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/xapian/enquire.h.gcov.html b/rep/usr/include/xapian/enquire.h.gcov.html
deleted file mode 100644
index 15ca5f0..0000000
--- a/rep/usr/include/xapian/enquire.h.gcov.html
+++ /dev/null
@@ -1,1361 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/xapian/enquire.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/xapian</a> - enquire.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">29</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">89.7 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">26</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /** \file enquire.h
-<span class="lineNum">       2 </span>                :  * \brief API for running queries
-<span class="lineNum">       3 </span>                :  */
-<span class="lineNum">       4 </span>                : /* Copyright 1999,2000,2001 BrightStation PLC
-<span class="lineNum">       5 </span>                :  * Copyright 2001,2002 Ananova Ltd
-<span class="lineNum">       6 </span>                :  * Copyright 2002,2003,2004,2005,2006,2007 Olly Betts
-<span class="lineNum">       7 </span>                :  *
-<span class="lineNum">       8 </span>                :  * This program is free software; you can redistribute it and/or
-<span class="lineNum">       9 </span>                :  * modify it under the terms of the GNU General Public License as
-<span class="lineNum">      10 </span>                :  * published by the Free Software Foundation; either version 2 of the
-<span class="lineNum">      11 </span>                :  * License, or (at your option) any later version.
-<span class="lineNum">      12 </span>                :  *
-<span class="lineNum">      13 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      14 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      15 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      16 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      17 </span>                :  *
-<span class="lineNum">      18 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      19 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      20 </span>                :  * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301
-<span class="lineNum">      21 </span>                :  * USA
-<span class="lineNum">      22 </span>                :  */
-<span class="lineNum">      23 </span>                : 
-<span class="lineNum">      24 </span>                : #ifndef XAPIAN_INCLUDED_ENQUIRE_H
-<span class="lineNum">      25 </span>                : #define XAPIAN_INCLUDED_ENQUIRE_H
-<span class="lineNum">      26 </span>                : 
-<span class="lineNum">      27 </span>                : #include &lt;string&gt;
-<span class="lineNum">      28 </span>                : 
-<span class="lineNum">      29 </span>                : #include &lt;xapian/base.h&gt;
-<span class="lineNum">      30 </span>                : #include &lt;xapian/deprecated.h&gt;
-<span class="lineNum">      31 </span>                : #include &lt;xapian/sorter.h&gt;
-<span class="lineNum">      32 </span>                : #include &lt;xapian/types.h&gt;
-<span class="lineNum">      33 </span>                : #include &lt;xapian/termiterator.h&gt;
-<span class="lineNum">      34 </span>                : #include &lt;xapian/visibility.h&gt;
-<span class="lineNum">      35 </span>                : 
-<span class="lineNum">      36 </span>                : namespace Xapian {
-<span class="lineNum">      37 </span>                : 
-<span class="lineNum">      38 </span>                : class Database;
-<span class="lineNum">      39 </span>                : class Document;
-<span class="lineNum">      40 </span>                : class ErrorHandler;
-<span class="lineNum">      41 </span>                : class ExpandDecider;
-<span class="lineNum">      42 </span>                : class MSetIterator;
-<span class="lineNum">      43 </span>                : class Query;
-<span class="lineNum">      44 </span>                : class Weight;
-<span class="lineNum">      45 </span>                : 
-<span class="lineNum">      46 </span>                : /** A match set (MSet).
-<span class="lineNum">      47 </span>                :  *  This class represents (a portion of) the results of a query.
-<span class="lineNum">      48 </span>                :  */
-<span class="lineNum">      49 </span>                : class XAPIAN_VISIBILITY_DEFAULT MSet {
-<span class="lineNum">      50 </span>                :     public:
-<span class="lineNum">      51 </span>                :         class Internal;
-<span class="lineNum">      52 </span>                :         /// @internal Reference counted internals.
-<span class="lineNum">      53 </span>                :         Xapian::Internal::RefCntPtr&lt;Internal&gt; internal;
-<span class="lineNum">      54 </span>                : 
-<span class="lineNum">      55 </span>                :         /// @internal Constructor for internal use.
-<span class="lineNum">      56 </span>                :         explicit MSet(MSet::Internal * internal_);
-<span class="lineNum">      57 </span>                : 
-<span class="lineNum">      58 </span>                :         /// Create an empty Xapian::MSet.
-<span class="lineNum">      59 </span>                :         MSet();
-<span class="lineNum">      60 </span>                : 
-<span class="lineNum">      61 </span>                :         /// Destroy a Xapian::MSet.
-<span class="lineNum">      62 </span>                :         ~MSet();
-<span class="lineNum">      63 </span>                : 
-<span class="lineNum">      64 </span>                :         /// Copying is allowed (and is cheap).
-<span class="lineNum">      65 </span>                :         MSet(const MSet &amp; other);
-<span class="lineNum">      66 </span>                : 
-<span class="lineNum">      67 </span>                :         /// Assignment is allowed (and is cheap).
-<span class="lineNum">      68 </span>                :         void operator=(const MSet &amp;other);
-<span class="lineNum">      69 </span>                : 
-<span class="lineNum">      70 </span>                :         /** Fetch the document info for a set of items in the MSet.
-<span class="lineNum">      71 </span>                :          *
-<span class="lineNum">      72 </span>                :          *  This method causes the documents in the range specified by the
-<span class="lineNum">      73 </span>                :          *  iterators to be fetched from the database, and cached in the
-<span class="lineNum">      74 </span>                :          *  Xapian::MSet object.  This has little effect when performing a
-<span class="lineNum">      75 </span>                :          *  search across a local database, but will greatly speed up
-<span class="lineNum">      76 </span>                :          *  subsequent access to the document contents when the documents are
-<span class="lineNum">      77 </span>                :          *  stored in a remote database.
-<span class="lineNum">      78 </span>                :          *
-<span class="lineNum">      79 </span>                :          *  The iterators must be over this Xapian::MSet - undefined behaviour
-<span class="lineNum">      80 </span>                :          *  will result otherwise.
-<span class="lineNum">      81 </span>                :          *
-<span class="lineNum">      82 </span>                :          *  @param begin   MSetIterator for first item to fetch.
-<span class="lineNum">      83 </span>                :          *  @param end     MSetIterator for item after last item to fetch.
-<span class="lineNum">      84 </span>                :          */
-<span class="lineNum">      85 </span>                :         void fetch(const MSetIterator &amp;begin, const MSetIterator &amp;end) const;
-<span class="lineNum">      86 </span>                : 
-<span class="lineNum">      87 </span>                :         /** Fetch the single item specified.
-<span class="lineNum">      88 </span>                :          */
-<span class="lineNum">      89 </span>                :         void fetch(const MSetIterator &amp;item) const;
-<span class="lineNum">      90 </span>                : 
-<span class="lineNum">      91 </span>                :         /** Fetch all the items in the MSet.
-<span class="lineNum">      92 </span>                :          */
-<span class="lineNum">      93 </span>                :         void fetch() const;
-<span class="lineNum">      94 </span>                : 
-<span class="lineNum">      95 </span>                :         /** This converts the weight supplied to a percentage score.
-<span class="lineNum">      96 </span>                :          *  The return value will be in the range 0 to 100, and will be 0 if
-<span class="lineNum">      97 </span>                :          *  and only if the item did not match the query at all.
-<span class="lineNum">      98 </span>                :          */
-<span class="lineNum">      99 </span>                :         Xapian::percent convert_to_percent(Xapian::weight wt) const;
-<span class="lineNum">     100 </span>                : 
-<span class="lineNum">     101 </span>                :         /// Return the percentage score for a particular item.
-<span class="lineNum">     102 </span>                :         Xapian::percent convert_to_percent(const MSetIterator &amp;it) const;
-<span class="lineNum">     103 </span>                : 
-<span class="lineNum">     104 </span>                :         /** Return the term frequency of the given query term.
-<span class="lineNum">     105 </span>                :          *
-<span class="lineNum">     106 </span>                :          *  @param tname The term to look for.
-<span class="lineNum">     107 </span>                :          *
-<span class="lineNum">     108 </span>                :          *  @exception Xapian::InvalidArgumentError is thrown if the term was
-<span class="lineNum">     109 </span>                :          *             not in the query.
-<span class="lineNum">     110 </span>                :          */
-<span class="lineNum">     111 </span>                :         Xapian::doccount get_termfreq(const std::string &amp;tname) const;
-<span class="lineNum">     112 </span>                : 
-<span class="lineNum">     113 </span>                :         /** Return the term weight of the given query term.
-<span class="lineNum">     114 </span>                :          *
-<span class="lineNum">     115 </span>                :          *  @param tname The term to look for.
-<span class="lineNum">     116 </span>                :          *
-<span class="lineNum">     117 </span>                :          *  @exception  Xapian::InvalidArgumentError is thrown if the term was
-<span class="lineNum">     118 </span>                :          *              not in the query.
-<span class="lineNum">     119 </span>                :          */
-<span class="lineNum">     120 </span>                :         Xapian::weight get_termweight(const std::string &amp;tname) const;
-<span class="lineNum">     121 </span>                : 
-<span class="lineNum">     122 </span>                :         /** The index of the first item in the result which was put into the
-<span class="lineNum">     123 </span>                :          *  MSet.
-<span class="lineNum">     124 </span>                :          *
-<span class="lineNum">     125 </span>                :          *  This corresponds to the parameter &quot;first&quot; specified in
-<span class="lineNum">     126 </span>                :          *  Xapian::Enquire::get_mset().  A value of 0 corresponds to the
-<span class="lineNum">     127 </span>                :          *  highest result being the first item in the MSet.
-<span class="lineNum">     128 </span>                :          */
-<span class="lineNum">     129 </span>                :         Xapian::doccount get_firstitem() const;
-<span class="lineNum">     130 </span>                : 
-<span class="lineNum">     131 </span>                :         /** A lower bound on the number of documents in the database which
-<span class="lineNum">     132 </span>                :          *  match the query.
-<span class="lineNum">     133 </span>                :          *
-<span class="lineNum">     134 </span>                :          *  This figure takes into account collapsing of duplicates,
-<span class="lineNum">     135 </span>                :          *  and weighting cutoff values.
-<span class="lineNum">     136 </span>                :          *
-<span class="lineNum">     137 </span>                :          *  This number is usually considerably less than the actual number
-<span class="lineNum">     138 </span>                :          *  of documents which match the query.
-<span class="lineNum">     139 </span>                :          */
-<span class="lineNum">     140 </span>                :         Xapian::doccount get_matches_lower_bound() const;
-<span class="lineNum">     141 </span>                : 
-<span class="lineNum">     142 </span>                :         /** An estimate for the number of documents in the database which
-<span class="lineNum">     143 </span>                :          *  match the query.
-<span class="lineNum">     144 </span>                :          *
-<span class="lineNum">     145 </span>                :          *  This figure takes into account collapsing of duplicates,
-<span class="lineNum">     146 </span>                :          *  and weighting cutoff values.
-<span class="lineNum">     147 </span>                :          *
-<span class="lineNum">     148 </span>                :          *  This value is returned because there is sometimes a request to
-<span class="lineNum">     149 </span>                :          *  display such information.  However, our experience is that
-<span class="lineNum">     150 </span>                :          *  presenting this value to users causes them to worry about the
-<span class="lineNum">     151 </span>                :          *  large number of results, rather than how useful those at the top
-<span class="lineNum">     152 </span>                :          *  of the result set are, and is thus undesirable.
-<span class="lineNum">     153 </span>                :          */
-<span class="lineNum">     154 </span>                :         Xapian::doccount get_matches_estimated() const;
-<span class="lineNum">     155 </span>                : 
-<span class="lineNum">     156 </span>                :         /** An upper bound on the number of documents in the database which
-<span class="lineNum">     157 </span>                :          *  match the query.
-<span class="lineNum">     158 </span>                :          *
-<span class="lineNum">     159 </span>                :          *  This figure takes into account collapsing of duplicates,
-<span class="lineNum">     160 </span>                :          *  and weighting cutoff values.
-<span class="lineNum">     161 </span>                :          *
-<span class="lineNum">     162 </span>                :          *  This number is usually considerably greater than the actual
-<span class="lineNum">     163 </span>                :          *  number of documents which match the query.
-<span class="lineNum">     164 </span>                :          */
-<span class="lineNum">     165 </span>                :         Xapian::doccount get_matches_upper_bound() const;
-<span class="lineNum">     166 </span>                : 
-<span class="lineNum">     167 </span>                :         /** The maximum possible weight in the MSet.
-<span class="lineNum">     168 </span>                :          *  This weight is likely not to be attained in the set of results,
-<span class="lineNum">     169 </span>                :          *  but represents an upper bound on the weight which a document
-<span class="lineNum">     170 </span>                :          *  could attain for the given query.
-<span class="lineNum">     171 </span>                :          */
-<span class="lineNum">     172 </span>                :         Xapian::weight get_max_possible() const;
-<span class="lineNum">     173 </span>                : 
-<span class="lineNum">     174 </span>                :         /** The greatest weight which is attained by any document in the
-<span class="lineNum">     175 </span>                :          *  database.
-<span class="lineNum">     176 </span>                :          *
-<span class="lineNum">     177 </span>                :          *  If firstitem == 0, this is the weight of the first entry in
-<span class="lineNum">     178 </span>                :          *  items.
-<span class="lineNum">     179 </span>                :          *
-<span class="lineNum">     180 </span>                :          *  If no documents are found by the query, this will be 0.
-<span class="lineNum">     181 </span>                :          *
-<span class="lineNum">     182 </span>                :          *  Note that calculation of max_attained requires calculation
-<span class="lineNum">     183 </span>                :          *  of at least one result item - therefore, if no items were
-<span class="lineNum">     184 </span>                :          *  requested when the query was performed (by specifying
-<span class="lineNum">     185 </span>                :          *  maxitems = 0 in Xapian::Enquire::get_mset()), this value will be 0.
-<span class="lineNum">     186 </span>                :          */
-<span class="lineNum">     187 </span>                :         Xapian::weight get_max_attained() const;
-<span class="lineNum">     188 </span>                : 
-<span class="lineNum">     189 </span>                :         /** The number of items in this MSet */
-<span class="lineNum">     190 </span>                :         Xapian::doccount size() const;
-<span class="lineNum">     191 </span>                : 
-<span class="lineNum">     192 </span>                :         /** Required to allow use as an STL container. */
-<span class="lineNum">     193 </span>                :         Xapian::doccount max_size() const { return size(); }
-<span class="lineNum">     194 </span>                : 
-<span class="lineNum">     195 </span>                :         /** Test if this MSet is empty */
-<span class="lineNum">     196 </span>                :         bool empty() const;
-<span class="lineNum">     197 </span>                : 
-<span class="lineNum">     198 </span>                :         /** Swap the MSet we point to with another */
-<span class="lineNum">     199 </span>                :         void swap(MSet &amp; other);
-<span class="lineNum">     200 </span>                : 
-<span class="lineNum">     201 </span>                :         /** Iterator for the terms in this MSet */
-<span class="lineNum">     202 </span>                :         MSetIterator begin() const;
-<span class="lineNum">     203 </span>                : 
-<span class="lineNum">     204 </span>                :         /** End iterator corresponding to begin() */
-<span class="lineNum">     205 </span>                :         MSetIterator end() const;
-<span class="lineNum">     206 </span>                : 
-<span class="lineNum">     207 </span>                :         /** Iterator pointing to the last element of this MSet */
-<span class="lineNum">     208 </span>                :         MSetIterator back() const;
-<span class="lineNum">     209 </span>                : 
-<span class="lineNum">     210 </span>                :         /** This returns the document at position i in this MSet object.
-<span class="lineNum">     211 </span>                :          *
-<span class="lineNum">     212 </span>                :          *  Note that this is not the same as the document at rank i in the
-<span class="lineNum">     213 </span>                :          *  query, unless the &quot;first&quot; parameter to Xapian::Enquire::get_mset
-<span class="lineNum">     214 </span>                :          *  was 0.  Rather, it is the document at rank i + first.
-<span class="lineNum">     215 </span>                :          *
-<span class="lineNum">     216 </span>                :          *  In other words, the offset is into the documents represented by
-<span class="lineNum">     217 </span>                :          *  this object, not into the set of documents matching the query.
-<span class="lineNum">     218 </span>                :          */
-<span class="lineNum">     219 </span>                :         MSetIterator operator[](Xapian::doccount i) const;
-<span class="lineNum">     220 </span>                : 
-<span class="lineNum">     221 </span>                :         /// Allow use as an STL container
-<span class="lineNum">     222 </span>                :         //@{
-<span class="lineNum">     223 </span>                :         typedef MSetIterator value_type; // FIXME: not assignable...
-<span class="lineNum">     224 </span>                :         typedef MSetIterator iterator;
-<span class="lineNum">     225 </span>                :         typedef MSetIterator const_iterator;
-<span class="lineNum">     226 </span>                :         typedef MSetIterator &amp; reference; // Hmm
-<span class="lineNum">     227 </span>                :         typedef MSetIterator &amp; const_reference;
-<span class="lineNum">     228 </span>                :         typedef MSetIterator * pointer; // Hmm
-<span class="lineNum">     229 </span>                :         typedef Xapian::doccount_diff difference_type;
-<span class="lineNum">     230 </span>                :         typedef Xapian::doccount size_type;
-<span class="lineNum">     231 </span>                :         //@}
-<span class="lineNum">     232 </span>                : 
-<span class="lineNum">     233 </span>                :         /// Return a string describing this object.
-<span class="lineNum">     234 </span>                :         std::string get_description() const;
-<span class="lineNum">     235 </span>                : };
-<span class="lineNum">     236 </span>                : 
-<span class="lineNum">     237 </span>                : /** An iterator pointing to items in an MSet.
-<span class="lineNum">     238 </span>                :  *  This is used for access to individual results of a match.
-<span class="lineNum">     239 </span>                :  */
-<span class="lineNum">     240 </span>                : class XAPIAN_VISIBILITY_DEFAULT MSetIterator {
-<span class="lineNum">     241 </span>                :     private:
-<span class="lineNum">     242 </span>                :         friend class MSet;
-<span class="lineNum">     243 </span>                :         friend bool operator==(const MSetIterator &amp;a, const MSetIterator &amp;b);
-<span class="lineNum">     244 </span>                :         friend bool operator!=(const MSetIterator &amp;a, const MSetIterator &amp;b);
-<span class="lineNum">     245 </span>                : 
-<span class="lineNum">     246 </span>                :         MSetIterator(Xapian::doccount index_, const MSet &amp; mset_)
-<span class="lineNum">     247 </span>                :             : index(index_), mset(mset_) { }
-<span class="lineNum">     248 </span>                : 
-<span class="lineNum">     249 </span>                :         Xapian::doccount index;
-<span class="lineNum">     250 </span>                :         MSet mset;
-<span class="lineNum">     251 </span>                : 
-<span class="lineNum">     252 </span>                :     public:
-<span class="lineNum">     253 </span>                :         /** Create an uninitialised iterator; this cannot be used, but is
-<span class="lineNum">     254 </span>                :          *  convenient syntactically.
-<span class="lineNum">     255 </span>                :          */
-<span class="lineNum">     256 </span><span class="lineCov">              3 :         MSetIterator() : index(0), mset() { }</span>
-<span class="lineNum">     257 </span>                : 
-<span class="lineNum">     258 </span><span class="lineCov">            165 :         ~MSetIterator() { }</span>
-<span class="lineNum">     259 </span>                : 
-<span class="lineNum">     260 </span>                :         /// Copying is allowed (and is cheap).
-<span class="lineNum">     261 </span><span class="lineCov">             58 :         MSetIterator(const MSetIterator &amp;other) {</span>
-<span class="lineNum">     262 </span><span class="lineCov">             58 :             index = other.index;</span>
-<span class="lineNum">     263 </span><span class="lineCov">             58 :             mset = other.mset;</span>
-<span class="lineNum">     264 </span><span class="lineCov">             58 :         }</span>
-<span class="lineNum">     265 </span>                : 
-<span class="lineNum">     266 </span>                :         /// Assignment is allowed (and is cheap).
-<span class="lineNum">     267 </span><span class="lineCov">             31 :         void operator=(const MSetIterator &amp;other) {</span>
-<span class="lineNum">     268 </span><span class="lineCov">             31 :             index = other.index;</span>
-<span class="lineNum">     269 </span><span class="lineCov">             31 :             mset = other.mset;</span>
-<span class="lineNum">     270 </span><span class="lineCov">             31 :         }</span>
-<span class="lineNum">     271 </span>                : 
-<span class="lineNum">     272 </span>                :         /// Advance the iterator.
-<span class="lineNum">     273 </span><span class="lineCov">             61 :         MSetIterator &amp; operator++() {</span>
-<span class="lineNum">     274 </span><span class="lineCov">             61 :             ++index;</span>
-<span class="lineNum">     275 </span><span class="lineCov">             61 :             return *this;</span>
-<span class="lineNum">     276 </span>                :         }
-<span class="lineNum">     277 </span>                : 
-<span class="lineNum">     278 </span>                :         /// Advance the iterator (postfix variant).
-<span class="lineNum">     279 </span><span class="lineCov">             28 :         MSetIterator operator++(int) {</span>
-<span class="lineNum">     280 </span><span class="lineCov">             28 :             MSetIterator tmp = *this;</span>
-<span class="lineNum">     281 </span><span class="lineCov">             28 :             ++index;</span>
-<span class="lineNum">     282 </span>                :             return tmp;
-<span class="lineNum">     283 </span>                :         }
-<span class="lineNum">     284 </span>                : 
-<span class="lineNum">     285 </span>                :         /// Decrement the iterator.
-<span class="lineNum">     286 </span>                :         MSetIterator &amp; operator--() {
-<span class="lineNum">     287 </span>                :             --index;
-<span class="lineNum">     288 </span>                :             return *this;
-<span class="lineNum">     289 </span>                :         }
-<span class="lineNum">     290 </span>                : 
-<span class="lineNum">     291 </span>                :         /// Decrement the iterator (postfix variant).
-<span class="lineNum">     292 </span>                :         MSetIterator operator--(int) {
-<span class="lineNum">     293 </span>                :             MSetIterator tmp = *this;
-<span class="lineNum">     294 </span>                :             --index;
-<span class="lineNum">     295 </span>                :             return tmp;
-<span class="lineNum">     296 </span>                :         }
-<span class="lineNum">     297 </span>                : 
-<span class="lineNum">     298 </span>                :         /// Get the document ID for the current position.
-<span class="lineNum">     299 </span>                :         Xapian::docid operator*() const;
-<span class="lineNum">     300 </span>                : 
-<span class="lineNum">     301 </span>                :         /** Get a Xapian::Document object for the current position.
-<span class="lineNum">     302 </span>                :          *
-<span class="lineNum">     303 </span>                :          *  This method returns a Xapian::Document object which provides the
-<span class="lineNum">     304 </span>                :          *  information about the document pointed to by the MSetIterator.
-<span class="lineNum">     305 </span>                :          *
-<span class="lineNum">     306 </span>                :          *  If the underlying database has suitable support, using this call
-<span class="lineNum">     307 </span>                :          *  (rather than asking the database for a document based on its
-<span class="lineNum">     308 </span>                :          *  document ID) will enable the system to ensure that the correct
-<span class="lineNum">     309 </span>                :          *  data is returned, and that the document has not been deleted
-<span class="lineNum">     310 </span>                :          *  or changed since the query was performed.
-<span class="lineNum">     311 </span>                :          *
-<span class="lineNum">     312 </span>                :          *  @return     A Xapian::Document object containing the document data.
-<span class="lineNum">     313 </span>                :          *
-<span class="lineNum">     314 </span>                :          *  @exception Xapian::DocNotFoundError The document specified could not
-<span class="lineNum">     315 </span>                :          *             be found in the database.
-<span class="lineNum">     316 </span>                :          */
-<span class="lineNum">     317 </span>                :         Xapian::Document get_document() const;
-<span class="lineNum">     318 </span>                : 
-<span class="lineNum">     319 </span>                :         /** Get the rank of the document at the current position.
-<span class="lineNum">     320 </span>                :          *
-<span class="lineNum">     321 </span>                :          *  The rank is the position that this document is at in the ordered
-<span class="lineNum">     322 </span>                :          *  list of results of the query.  The result is 0-based - i.e. the
-<span class="lineNum">     323 </span>                :          *  top-ranked document has a rank of 0.
-<span class="lineNum">     324 </span>                :          */
-<span class="lineNum">     325 </span>                :         Xapian::doccount get_rank() const {
-<span class="lineNum">     326 </span>                :             return mset.get_firstitem() + index;
-<span class="lineNum">     327 </span>                :         }
-<span class="lineNum">     328 </span>                : 
-<span class="lineNum">     329 </span>                :         /// Get the weight of the document at the current position
-<span class="lineNum">     330 </span>                :         Xapian::weight get_weight() const;
-<span class="lineNum">     331 </span>                : 
-<span class="lineNum">     332 </span>                :         /** Get the collapse key for this document.
-<span class="lineNum">     333 </span>                :          */
-<span class="lineNum">     334 </span>                :         std::string get_collapse_key() const;
-<span class="lineNum">     335 </span>                : 
-<span class="lineNum">     336 </span>                :         /** Get an estimate of the number of documents that have been collapsed
-<span class="lineNum">     337 </span>                :          *  into this one.
-<span class="lineNum">     338 </span>                :          *
-<span class="lineNum">     339 </span>                :          *  The estimate will always be less than or equal to the actual
-<span class="lineNum">     340 </span>                :          *  number of other documents satisfying the match criteria with the
-<span class="lineNum">     341 </span>                :          *  same collapse key as this document.
-<span class="lineNum">     342 </span>                :          *
-<span class="lineNum">     343 </span>                :          *  This method may return 0 even though there are other documents with
-<span class="lineNum">     344 </span>                :          *  the same collapse key which satisfying the match criteria.  However
-<span class="lineNum">     345 </span>                :          *  if this method returns non-zero, there definitely are other such
-<span class="lineNum">     346 </span>                :          *  documents.  So this method may be used to inform the user that
-<span class="lineNum">     347 </span>                :          *  there are &quot;at least N other matches in this group&quot;, or to control
-<span class="lineNum">     348 </span>                :          *  whether to offer a &quot;show other documents in this group&quot; feature
-<span class="lineNum">     349 </span>                :          *  (but note that it may not offer it in every case where it would
-<span class="lineNum">     350 </span>                :          *  show other documents).
-<span class="lineNum">     351 </span>                :          */
-<span class="lineNum">     352 </span>                :         Xapian::doccount get_collapse_count() const;
-<span class="lineNum">     353 </span>                : 
-<span class="lineNum">     354 </span>                :         /** This returns the weight of the document as a percentage score.
-<span class="lineNum">     355 </span>                :          *
-<span class="lineNum">     356 </span>                :          *  The return value will be in the range 0 to 100:  0 meaning
-<span class="lineNum">     357 </span>                :          *  that the item did not match the query at all.
-<span class="lineNum">     358 </span>                :          */
-<span class="lineNum">     359 </span>                :         Xapian::percent get_percent() const;
-<span class="lineNum">     360 </span>                : 
-<span class="lineNum">     361 </span>                :         /// Return a string describing this object.
-<span class="lineNum">     362 </span>                :         std::string get_description() const;
-<span class="lineNum">     363 </span>                : 
-<span class="lineNum">     364 </span>                :         /// Allow use as an STL iterator
-<span class="lineNum">     365 </span>                :         //@{
-<span class="lineNum">     366 </span>                :         typedef std::bidirectional_iterator_tag iterator_category; // FIXME: could enhance to be a randomaccess_iterator
-<span class="lineNum">     367 </span>                :         typedef Xapian::docid value_type;
-<span class="lineNum">     368 </span>                :         typedef Xapian::doccount_diff difference_type;
-<span class="lineNum">     369 </span>                :         typedef Xapian::docid * pointer;
-<span class="lineNum">     370 </span>                :         typedef Xapian::docid &amp; reference;
-<span class="lineNum">     371 </span>                :         //@}
-<span class="lineNum">     372 </span>                : };
-<span class="lineNum">     373 </span>                : 
-<span class="lineNum">     374 </span><span class="lineCov">             30 : inline bool operator==(const MSetIterator &amp;a, const MSetIterator &amp;b)</span>
-<span class="lineNum">     375 </span>                : {
-<span class="lineNum">     376 </span><span class="lineCov">             30 :     return (a.index == b.index);</span>
-<span class="lineNum">     377 </span>                : }
-<span class="lineNum">     378 </span>                : 
-<span class="lineNum">     379 </span><span class="lineCov">             58 : inline bool operator!=(const MSetIterator &amp;a, const MSetIterator &amp;b)</span>
-<span class="lineNum">     380 </span>                : {
-<span class="lineNum">     381 </span><span class="lineCov">             58 :     return (a.index != b.index);</span>
-<span class="lineNum">     382 </span>                : }
-<span class="lineNum">     383 </span>                : 
-<span class="lineNum">     384 </span>                : class ESetIterator;
-<span class="lineNum">     385 </span>                : 
-<span class="lineNum">     386 </span>                : /** Class representing an ordered set of expand terms (an ESet).
-<span class="lineNum">     387 </span>                :  *  This set represents the results of an expand operation, which is
-<span class="lineNum">     388 </span>                :  *  performed by Xapian::Enquire::get_eset().
-<span class="lineNum">     389 </span>                :  */
-<span class="lineNum">     390 </span>                : class XAPIAN_VISIBILITY_DEFAULT ESet {
-<span class="lineNum">     391 </span>                :     public:
-<span class="lineNum">     392 </span>                :         class Internal;
-<span class="lineNum">     393 </span>                :         /// @internal Reference counted internals.
-<span class="lineNum">     394 </span>                :         Xapian::Internal::RefCntPtr&lt;Internal&gt; internal;
-<span class="lineNum">     395 </span>                : 
-<span class="lineNum">     396 </span>                :         /// Construct an empty ESet
-<span class="lineNum">     397 </span>                :         ESet();
-<span class="lineNum">     398 </span>                : 
-<span class="lineNum">     399 </span>                :         /// Destructor.
-<span class="lineNum">     400 </span>                :         ~ESet();
-<span class="lineNum">     401 </span>                : 
-<span class="lineNum">     402 </span>                :         /// Copying is allowed (and is cheap).
-<span class="lineNum">     403 </span>                :         ESet(const ESet &amp; other);
-<span class="lineNum">     404 </span>                : 
-<span class="lineNum">     405 </span>                :         /// Assignment is allowed (and is cheap).
-<span class="lineNum">     406 </span>                :         void operator=(const ESet &amp;other);
-<span class="lineNum">     407 </span>                : 
-<span class="lineNum">     408 </span>                :         /** A lower bound on the number of terms which are in the full
-<span class="lineNum">     409 </span>                :          *  set of results of the expand.  This will be greater than or
-<span class="lineNum">     410 </span>                :          *  equal to size()
-<span class="lineNum">     411 </span>                :          */
-<span class="lineNum">     412 </span>                :         Xapian::termcount get_ebound() const;
-<span class="lineNum">     413 </span>                : 
-<span class="lineNum">     414 </span>                :         /** The number of terms in this E-Set */
-<span class="lineNum">     415 </span>                :         Xapian::termcount size() const;
-<span class="lineNum">     416 </span>                : 
-<span class="lineNum">     417 </span>                :         /** Required to allow use as an STL container. */
-<span class="lineNum">     418 </span>                :         Xapian::termcount max_size() const { return size(); }
-<span class="lineNum">     419 </span>                : 
-<span class="lineNum">     420 </span>                :         /** Test if this E-Set is empty */
-<span class="lineNum">     421 </span>                :         bool empty() const;
-<span class="lineNum">     422 </span>                : 
-<span class="lineNum">     423 </span>                :         /** Swap the E-Set we point to with another */
-<span class="lineNum">     424 </span>                :         void swap(ESet &amp; other);
-<span class="lineNum">     425 </span>                : 
-<span class="lineNum">     426 </span>                :         /** Iterator for the terms in this E-Set */
-<span class="lineNum">     427 </span>                :         ESetIterator begin() const;
-<span class="lineNum">     428 </span>                : 
-<span class="lineNum">     429 </span>                :         /** End iterator corresponding to begin() */
-<span class="lineNum">     430 </span>                :         ESetIterator end() const;
-<span class="lineNum">     431 </span>                : 
-<span class="lineNum">     432 </span>                :         /** Iterator pointing to the last element of this E-Set */
-<span class="lineNum">     433 </span>                :         ESetIterator back() const;
-<span class="lineNum">     434 </span>                : 
-<span class="lineNum">     435 </span>                :         /** This returns the term at position i in this E-Set.  */
-<span class="lineNum">     436 </span>                :         ESetIterator operator[](Xapian::termcount i) const;
-<span class="lineNum">     437 </span>                : 
-<span class="lineNum">     438 </span>                :         /// Return a string describing this object.
-<span class="lineNum">     439 </span>                :         std::string get_description() const;
-<span class="lineNum">     440 </span>                : };
-<span class="lineNum">     441 </span>                : 
-<span class="lineNum">     442 </span>                : /** Iterate through terms in the ESet */
-<span class="lineNum">     443 </span>                : class XAPIAN_VISIBILITY_DEFAULT ESetIterator {
-<span class="lineNum">     444 </span>                :     private:
-<span class="lineNum">     445 </span>                :         friend class ESet;
-<span class="lineNum">     446 </span>                :         friend bool operator==(const ESetIterator &amp;a, const ESetIterator &amp;b);
-<span class="lineNum">     447 </span>                :         friend bool operator!=(const ESetIterator &amp;a, const ESetIterator &amp;b);
-<span class="lineNum">     448 </span>                : 
-<span class="lineNum">     449 </span>                :         ESetIterator(Xapian::termcount index_, const ESet &amp; eset_)
-<span class="lineNum">     450 </span>                :             : index(index_), eset(eset_) { }
-<span class="lineNum">     451 </span>                : 
-<span class="lineNum">     452 </span>                :         Xapian::termcount index;
-<span class="lineNum">     453 </span>                :         ESet eset;
-<span class="lineNum">     454 </span>                : 
-<span class="lineNum">     455 </span>                :     public:
-<span class="lineNum">     456 </span>                :         /** Create an uninitialised iterator; this cannot be used, but is
-<span class="lineNum">     457 </span>                :          *  convenient syntactically.
-<span class="lineNum">     458 </span>                :          */
-<span class="lineNum">     459 </span>                :         ESetIterator() : index(0), eset() { }
-<span class="lineNum">     460 </span>                : 
-<span class="lineNum">     461 </span><span class="lineCov">              8 :         ~ESetIterator() { }</span>
-<span class="lineNum">     462 </span>                : 
-<span class="lineNum">     463 </span>                :         /// Copying is allowed (and is cheap).
-<span class="lineNum">     464 </span>                :         ESetIterator(const ESetIterator &amp;other) {
-<span class="lineNum">     465 </span>                :             index = other.index;
-<span class="lineNum">     466 </span>                :             eset = other.eset;
-<span class="lineNum">     467 </span>                :         }
-<span class="lineNum">     468 </span>                : 
-<span class="lineNum">     469 </span>                :         /// Assignment is allowed (and is cheap).
-<span class="lineNum">     470 </span>                :         void operator=(const ESetIterator &amp;other) {
-<span class="lineNum">     471 </span>                :             index = other.index;
-<span class="lineNum">     472 </span>                :             eset = other.eset;
-<span class="lineNum">     473 </span>                :         }
-<span class="lineNum">     474 </span>                : 
-<span class="lineNum">     475 </span>                :         /// Advance the iterator.
-<span class="lineNum">     476 </span><span class="lineNoCov">              0 :         ESetIterator &amp; operator++() {</span>
-<span class="lineNum">     477 </span><span class="lineNoCov">              0 :             ++index;</span>
-<span class="lineNum">     478 </span><span class="lineNoCov">              0 :             return *this;</span>
-<span class="lineNum">     479 </span>                :         }
-<span class="lineNum">     480 </span>                : 
-<span class="lineNum">     481 </span>                :         /// Advance the iterator (postfix variant).
-<span class="lineNum">     482 </span>                :         ESetIterator operator++(int) {
-<span class="lineNum">     483 </span>                :             ESetIterator tmp = *this;
-<span class="lineNum">     484 </span>                :             ++index;
-<span class="lineNum">     485 </span>                :             return tmp;
-<span class="lineNum">     486 </span>                :         }
-<span class="lineNum">     487 </span>                : 
-<span class="lineNum">     488 </span>                :         /// Decrement the iterator.
-<span class="lineNum">     489 </span>                :         ESetIterator &amp; operator--() {
-<span class="lineNum">     490 </span>                :             --index;
-<span class="lineNum">     491 </span>                :             return *this;
-<span class="lineNum">     492 </span>                :         }
-<span class="lineNum">     493 </span>                : 
-<span class="lineNum">     494 </span>                :         /// Decrement the iterator (postfix variant).
-<span class="lineNum">     495 </span>                :         ESetIterator operator--(int) {
-<span class="lineNum">     496 </span>                :             ESetIterator tmp = *this;
-<span class="lineNum">     497 </span>                :             --index;
-<span class="lineNum">     498 </span>                :             return tmp;
-<span class="lineNum">     499 </span>                :         }
-<span class="lineNum">     500 </span>                : 
-<span class="lineNum">     501 </span>                :         /// Get the term for the current position
-<span class="lineNum">     502 </span>                :         const std::string &amp; operator *() const;
-<span class="lineNum">     503 </span>                : 
-<span class="lineNum">     504 </span>                :         /// Get the weight of the term at the current position
-<span class="lineNum">     505 </span>                :         Xapian::weight get_weight() const;
-<span class="lineNum">     506 </span>                : 
-<span class="lineNum">     507 </span>                :         /// Return a string describing this object.
-<span class="lineNum">     508 </span>                :         std::string get_description() const;
-<span class="lineNum">     509 </span>                : 
-<span class="lineNum">     510 </span>                :         /// Allow use as an STL iterator
-<span class="lineNum">     511 </span>                :         //@{
-<span class="lineNum">     512 </span>                :         typedef std::bidirectional_iterator_tag iterator_category; // FIXME: go for randomaccess_iterator!
-<span class="lineNum">     513 </span>                :         typedef std::string value_type;
-<span class="lineNum">     514 </span>                :         typedef Xapian::termcount_diff difference_type;
-<span class="lineNum">     515 </span>                :         typedef std::string * pointer;
-<span class="lineNum">     516 </span>                :         typedef std::string &amp; reference;
-<span class="lineNum">     517 </span>                :         //@}
-<span class="lineNum">     518 </span>                : };
-<span class="lineNum">     519 </span>                : 
-<span class="lineNum">     520 </span>                : inline bool operator==(const ESetIterator &amp;a, const ESetIterator &amp;b)
-<span class="lineNum">     521 </span>                : {
-<span class="lineNum">     522 </span>                :     return (a.index == b.index);
-<span class="lineNum">     523 </span>                : }
-<span class="lineNum">     524 </span>                : 
-<span class="lineNum">     525 </span><span class="lineCov">              4 : inline bool operator!=(const ESetIterator &amp;a, const ESetIterator &amp;b)</span>
-<span class="lineNum">     526 </span>                : {
-<span class="lineNum">     527 </span><span class="lineCov">              4 :     return (a.index != b.index);</span>
-<span class="lineNum">     528 </span>                : }
-<span class="lineNum">     529 </span>                : 
-<span class="lineNum">     530 </span>                : /** A relevance set (R-Set).
-<span class="lineNum">     531 </span>                :  *  This is the set of documents which are marked as relevant, for use
-<span class="lineNum">     532 </span>                :  *  in modifying the term weights, and in performing query expansion.
-<span class="lineNum">     533 </span>                :  */
-<span class="lineNum">     534 </span>                : class XAPIAN_VISIBILITY_DEFAULT RSet {
-<span class="lineNum">     535 </span>                :     public:
-<span class="lineNum">     536 </span>                :         /// Class holding details of RSet
-<span class="lineNum">     537 </span>                :         class Internal;
-<span class="lineNum">     538 </span>                : 
-<span class="lineNum">     539 </span>                :         /// @internal Reference counted internals.
-<span class="lineNum">     540 </span>                :         Xapian::Internal::RefCntPtr&lt;Internal&gt; internal;
-<span class="lineNum">     541 </span>                : 
-<span class="lineNum">     542 </span>                :         /// Copy constructor
-<span class="lineNum">     543 </span>                :         RSet(const RSet &amp;rset);
-<span class="lineNum">     544 </span>                : 
-<span class="lineNum">     545 </span>                :         /// Assignment operator
-<span class="lineNum">     546 </span>                :         void operator=(const RSet &amp;rset);
-<span class="lineNum">     547 </span>                : 
-<span class="lineNum">     548 </span>                :         /// Default constructor
-<span class="lineNum">     549 </span>                :         RSet();
-<span class="lineNum">     550 </span>                : 
-<span class="lineNum">     551 </span>                :         /// Destructor
-<span class="lineNum">     552 </span>                :         ~RSet();
-<span class="lineNum">     553 </span>                : 
-<span class="lineNum">     554 </span>                :         /** The number of documents in this R-Set */
-<span class="lineNum">     555 </span>                :         Xapian::doccount size() const;
-<span class="lineNum">     556 </span>                : 
-<span class="lineNum">     557 </span>                :         /** Test if this R-Set is empty */
-<span class="lineNum">     558 </span>                :         bool empty() const;
-<span class="lineNum">     559 </span>                : 
-<span class="lineNum">     560 </span>                :         /// Add a document to the relevance set.
-<span class="lineNum">     561 </span>                :         void add_document(Xapian::docid did);
-<span class="lineNum">     562 </span>                : 
-<span class="lineNum">     563 </span>                :         /// Add a document to the relevance set.
-<span class="lineNum">     564 </span><span class="lineCov">             20 :         void add_document(const Xapian::MSetIterator &amp; i) { add_document(*i); }</span>
-<span class="lineNum">     565 </span>                : 
-<span class="lineNum">     566 </span>                :         /// Remove a document from the relevance set.
-<span class="lineNum">     567 </span>                :         void remove_document(Xapian::docid did);
-<span class="lineNum">     568 </span>                : 
-<span class="lineNum">     569 </span>                :         /// Remove a document from the relevance set.
-<span class="lineNum">     570 </span>                :         void remove_document(const Xapian::MSetIterator &amp; i) { remove_document(*i); }
-<span class="lineNum">     571 </span>                : 
-<span class="lineNum">     572 </span>                :         /// Test if a given document in the relevance set.
-<span class="lineNum">     573 </span>                :         bool contains(Xapian::docid did) const;
-<span class="lineNum">     574 </span>                : 
-<span class="lineNum">     575 </span>                :         /// Test if a given document in the relevance set.
-<span class="lineNum">     576 </span>                :         bool contains(const Xapian::MSetIterator &amp; i) const { return contains(*i); }
-<span class="lineNum">     577 </span>                : 
-<span class="lineNum">     578 </span>                :         /// Return a string describing this object.
-<span class="lineNum">     579 </span>                :         std::string get_description() const;
-<span class="lineNum">     580 </span>                : };
-<span class="lineNum">     581 </span>                : 
-<span class="lineNum">     582 </span>                : /** Base class for matcher decision functor.
-<span class="lineNum">     583 </span>                :  */
-<span class="lineNum">     584 </span>                : class XAPIAN_VISIBILITY_DEFAULT MatchDecider {
-<span class="lineNum">     585 </span>                :     public:
-<span class="lineNum">     586 </span>                :         /** Decide whether we want this document to be in the MSet.
-<span class="lineNum">     587 </span>                :          *
-<span class="lineNum">     588 </span>                :          *  Return true if the document is acceptable, or false if the document
-<span class="lineNum">     589 </span>                :          *  should be excluded from the MSet.
-<span class="lineNum">     590 </span>                :          */
-<span class="lineNum">     591 </span>                :         virtual bool operator()(const Xapian::Document &amp;doc) const = 0;
-<span class="lineNum">     592 </span>                : 
-<span class="lineNum">     593 </span>                :         /// Destructor.
-<span class="lineNum">     594 </span>                :         virtual ~MatchDecider();
-<span class="lineNum">     595 </span>                : };
-<span class="lineNum">     596 </span>                : 
-<span class="lineNum">     597 </span>                : /** This class provides an interface to the information retrieval
-<span class="lineNum">     598 </span>                :  *  system for the purpose of searching.
-<span class="lineNum">     599 </span>                :  *
-<span class="lineNum">     600 </span>                :  *  Databases are usually opened lazily, so exceptions may not be
-<span class="lineNum">     601 </span>                :  *  thrown where you would expect them to be.  You should catch
-<span class="lineNum">     602 </span>                :  *  Xapian::Error exceptions when calling any method in Xapian::Enquire.
-<span class="lineNum">     603 </span>                :  *
-<span class="lineNum">     604 </span>                :  *  @exception Xapian::InvalidArgumentError will be thrown if an invalid
-<span class="lineNum">     605 </span>                :  *  argument is supplied, for example, an unknown database type.
-<span class="lineNum">     606 </span>                :  */
-<span class="lineNum">     607 </span>                : class XAPIAN_VISIBILITY_DEFAULT Enquire {
-<span class="lineNum">     608 </span>                :     public:
-<span class="lineNum">     609 </span>                :         /// Copying is allowed (and is cheap).
-<span class="lineNum">     610 </span>                :         Enquire(const Enquire &amp; other);
-<span class="lineNum">     611 </span>                : 
-<span class="lineNum">     612 </span>                :         /// Assignment is allowed (and is cheap).
-<span class="lineNum">     613 </span>                :         void operator=(const Enquire &amp; other);
-<span class="lineNum">     614 </span>                : 
-<span class="lineNum">     615 </span>                :         class Internal;
-<span class="lineNum">     616 </span>                :         /// @internal Reference counted internals.
-<span class="lineNum">     617 </span>                :         Xapian::Internal::RefCntPtr&lt;Internal&gt; internal;
-<span class="lineNum">     618 </span>                : 
-<span class="lineNum">     619 </span>                :         /** Create a Xapian::Enquire object.
-<span class="lineNum">     620 </span>                :          *
-<span class="lineNum">     621 </span>                :          *  This specification cannot be changed once the Xapian::Enquire is
-<span class="lineNum">     622 </span>                :          *  opened: you must create a new Xapian::Enquire object to access a
-<span class="lineNum">     623 </span>                :          *  different database, or set of databases.
-<span class="lineNum">     624 </span>                :          *
-<span class="lineNum">     625 </span>                :          *  The database supplied must have been initialised (ie, must not be
-<span class="lineNum">     626 </span>                :          *  the result of calling the Database::Database() constructor).  If
-<span class="lineNum">     627 </span>                :          *  you need to handle a situation where you have no index gracefully,
-<span class="lineNum">     628 </span>                :          *  a database created with InMemory::open() can be passed here,
-<span class="lineNum">     629 </span>                :          *  which represents a completely empty database.
-<span class="lineNum">     630 </span>                :          *
-<span class="lineNum">     631 </span>                :          *  @param database Specification of the database or databases to
-<span class="lineNum">     632 </span>                :          *         use.
-<span class="lineNum">     633 </span>                :          *  @param errorhandler_  A pointer to the error handler to use.
-<span class="lineNum">     634 </span>                :          *         Ownership of the object pointed to is not assumed by the
-<span class="lineNum">     635 </span>                :          *         Xapian::Enquire object - the user should delete the
-<span class="lineNum">     636 </span>                :          *         Xapian::ErrorHandler object after the Xapian::Enquire object
-<span class="lineNum">     637 </span>                :          *         is deleted.  To use no error handler, this parameter
-<span class="lineNum">     638 </span>                :          *         should be 0.
-<span class="lineNum">     639 </span>                :          *
-<span class="lineNum">     640 </span>                :          *  @exception Xapian::InvalidArgumentError will be thrown if an
-<span class="lineNum">     641 </span>                :          *  initialised Database object is supplied.
-<span class="lineNum">     642 </span>                :          */
-<span class="lineNum">     643 </span>                :         explicit Enquire(const Database &amp;database, ErrorHandler * errorhandler_ = 0);
-<span class="lineNum">     644 </span>                : 
-<span class="lineNum">     645 </span>                :         /** Close the Xapian::Enquire object.
-<span class="lineNum">     646 </span>                :          */
-<span class="lineNum">     647 </span>                :         ~Enquire();
-<span class="lineNum">     648 </span>                : 
-<span class="lineNum">     649 </span>                :         /** Set the query to run.
-<span class="lineNum">     650 </span>                :          *
-<span class="lineNum">     651 </span>                :          *  @param query  the new query to run.
-<span class="lineNum">     652 </span>                :          *  @param qlen   the query length to use in weight calculations -
-<span class="lineNum">     653 </span>                :          *      by default the sum of the wqf of all terms is used.
-<span class="lineNum">     654 </span>                :          */
-<span class="lineNum">     655 </span>                :         void set_query(const Xapian::Query &amp; query, Xapian::termcount qlen = 0);
-<span class="lineNum">     656 </span>                : 
-<span class="lineNum">     657 </span>                :         /** Get the query which has been set.
-<span class="lineNum">     658 </span>                :          *  This is only valid after set_query() has been called.
-<span class="lineNum">     659 </span>                :          *
-<span class="lineNum">     660 </span>                :          *  @exception Xapian::InvalidArgumentError will be thrown if query has
-<span class="lineNum">     661 </span>                :          *             not yet been set.
-<span class="lineNum">     662 </span>                :          */
-<span class="lineNum">     663 </span>                :         const Xapian::Query &amp; get_query() const;
-<span class="lineNum">     664 </span>                : 
-<span class="lineNum">     665 </span>                :         /** Set the weighting scheme to use for queries.
-<span class="lineNum">     666 </span>                :          *
-<span class="lineNum">     667 </span>                :          *  @param weight_  the new weighting scheme.  If no weighting scheme
-<span class="lineNum">     668 </span>                :          *                  is specified, the default is BM25 with the
-<span class="lineNum">     669 </span>                :          *                  default parameters.
-<span class="lineNum">     670 </span>                :          */
-<span class="lineNum">     671 </span>                :         void set_weighting_scheme(const Weight &amp;weight_);
-<span class="lineNum">     672 </span>                : 
-<span class="lineNum">     673 </span>                :         /** Set the collapse key to use for queries.
-<span class="lineNum">     674 </span>                :          *
-<span class="lineNum">     675 </span>                :          *  @param collapse_key  value number to collapse on - at most one MSet
-<span class="lineNum">     676 </span>                :          *      entry with each particular value will be returned.
-<span class="lineNum">     677 </span>                :          *
-<span class="lineNum">     678 </span>                :          *      The entry returned will be the best entry with that particular
-<span class="lineNum">     679 </span>                :          *      value (highest weight or highest sorting key).
-<span class="lineNum">     680 </span>                :          *
-<span class="lineNum">     681 </span>                :          *      An example use might be to create a value for each document
-<span class="lineNum">     682 </span>                :          *      containing an MD5 hash of the document contents.  Then
-<span class="lineNum">     683 </span>                :          *      duplicate documents from different sources can be eliminated at
-<span class="lineNum">     684 </span>                :          *      search time (it's better to eliminate duplicates at index time,
-<span class="lineNum">     685 </span>                :          *      but this may not be always be possible - for example the search
-<span class="lineNum">     686 </span>                :          *      may be over more than one Xapian database).
-<span class="lineNum">     687 </span>                :          *
-<span class="lineNum">     688 </span>                :          *      Another use is to group matches in a particular category (e.g.
-<span class="lineNum">     689 </span>                :          *      you might collapse a mailing list search on the Subject: so
-<span class="lineNum">     690 </span>                :          *      that there's only one result per discussion thread).  In this
-<span class="lineNum">     691 </span>                :          *      case you can use get_collapse_count() to give the user some
-<span class="lineNum">     692 </span>                :          *      idea how many other results there are.  And if you index the
-<span class="lineNum">     693 </span>                :          *      Subject: as a boolean term as well as putting it in a value,
-<span class="lineNum">     694 </span>                :          *      you can offer a link to a non-collapsed search restricted to
-<span class="lineNum">     695 </span>                :          *      that thread using a boolean filter.
-<span class="lineNum">     696 </span>                :          *
-<span class="lineNum">     697 </span>                :          *      (default is Xapian::BAD_VALUENO which means no collapsing).
-<span class="lineNum">     698 </span>                :          */
-<span class="lineNum">     699 </span>                :         void set_collapse_key(Xapian::valueno collapse_key);
-<span class="lineNum">     700 </span>                : 
-<span class="lineNum">     701 </span>                :         typedef enum {
-<span class="lineNum">     702 </span>                :             ASCENDING = 1,
-<span class="lineNum">     703 </span>                :             DESCENDING = 0,
-<span class="lineNum">     704 </span>                :             DONT_CARE = 2
-<span class="lineNum">     705 </span>                :         } docid_order;
-<span class="lineNum">     706 </span>                : 
-<span class="lineNum">     707 </span>                :         /** Set the direction in which documents are ordered by document id
-<span class="lineNum">     708 </span>                :          *  in the returned MSet.
-<span class="lineNum">     709 </span>                :          *
-<span class="lineNum">     710 </span>                :          *  This order only has an effect on documents which would otherwise
-<span class="lineNum">     711 </span>                :          *  have equal rank.  For a weighted probabilistic match with no sort
-<span class="lineNum">     712 </span>                :          *  value, this means documents with equal weight.  For a boolean match,
-<span class="lineNum">     713 </span>                :          *  with no sort value, this means all documents.  And if a sort value
-<span class="lineNum">     714 </span>                :          *  is used, this means documents with equal sort value (and also equal
-<span class="lineNum">     715 </span>                :          *  weight if ordering on relevance after the sort).
-<span class="lineNum">     716 </span>                :          *
-<span class="lineNum">     717 </span>                :          * @param order  This can be:
-<span class="lineNum">     718 </span>                :          * - Xapian::Enquire::ASCENDING
-<span class="lineNum">     719 </span>                :          *      docids sort in ascending order (default)
-<span class="lineNum">     720 </span>                :          * - Xapian::Enquire::DESCENDING
-<span class="lineNum">     721 </span>                :          *      docids sort in descending order
-<span class="lineNum">     722 </span>                :          * - Xapian::Enquire::DONT_CARE
-<span class="lineNum">     723 </span>                :          *      docids sort in whatever order is most efficient for the backend
-<span class="lineNum">     724 </span>                :          *
-<span class="lineNum">     725 </span>                :          *  Note: If you add documents in strict date order, then a boolean
-<span class="lineNum">     726 </span>                :          *  search - i.e. set_weighting_scheme(Xapian::BoolWeight()) - with
-<span class="lineNum">     727 </span>                :          *  set_docid_order(Xapian::Enquire::DESCENDING) is a very efficient
-<span class="lineNum">     728 </span>                :          *  way to perform &quot;sort by date, newest first&quot;.
-<span class="lineNum">     729 </span>                :          */
-<span class="lineNum">     730 </span>                :         void set_docid_order(docid_order order);
-<span class="lineNum">     731 </span>                : 
-<span class="lineNum">     732 </span>                :         /** Set the percentage and/or weight cutoffs.
-<span class="lineNum">     733 </span>                :          *
-<span class="lineNum">     734 </span>                :          * @param percent_cutoff Minimum percentage score for returned
-<span class="lineNum">     735 </span>                :          *      documents. If a document has a lower percentage score than this,
-<span class="lineNum">     736 </span>                :          *      it will not appear in the MSet.  If your intention is to return
-<span class="lineNum">     737 </span>                :          *      only matches which contain all the terms in the query, then
-<span class="lineNum">     738 </span>                :          *      it's more efficient to use Xapian::Query::OP_AND instead of
-<span class="lineNum">     739 </span>                :          *      Xapian::Query::OP_OR in the query than to use set_cutoff(100).
-<span class="lineNum">     740 </span>                :          *      (default 0 =&gt; no percentage cut-off).
-<span class="lineNum">     741 </span>                :          * @param weight_cutoff Minimum weight for a document to be returned.
-<span class="lineNum">     742 </span>                :          *      If a document has a lower score that this, it will not appear
-<span class="lineNum">     743 </span>                :          *      in the MSet.  It is usually only possible to choose an
-<span class="lineNum">     744 </span>                :          *      appropriate weight for cutoff based on the results of a
-<span class="lineNum">     745 </span>                :          *      previous run of the same query; this is thus mainly useful for
-<span class="lineNum">     746 </span>                :          *      alerting operations.  The other potential use is with a user
-<span class="lineNum">     747 </span>                :          *      specified weighting scheme.
-<span class="lineNum">     748 </span>                :          *      (default 0 =&gt; no weight cut-off).
-<span class="lineNum">     749 </span>                :          */
-<span class="lineNum">     750 </span>                :         void set_cutoff(Xapian::percent percent_cutoff, Xapian::weight weight_cutoff = 0);
-<span class="lineNum">     751 </span>                : 
-<span class="lineNum">     752 </span>                :         /** Set the sorting to be by relevance only.
-<span class="lineNum">     753 </span>                :          *
-<span class="lineNum">     754 </span>                :          *  This is the default.
-<span class="lineNum">     755 </span>                :          */
-<span class="lineNum">     756 </span>                :         void set_sort_by_relevance();
-<span class="lineNum">     757 </span>                : 
-<span class="lineNum">     758 </span>                :         /** Set the sorting to be by value only.
-<span class="lineNum">     759 </span>                :          *
-<span class="lineNum">     760 </span>                :          *  NB sorting of values uses a string comparison, so you'll need to
-<span class="lineNum">     761 </span>                :          *  store numbers padded with leading zeros or spaces, or with the
-<span class="lineNum">     762 </span>                :          *  number of digits prepended.
-<span class="lineNum">     763 </span>                :          *
-<span class="lineNum">     764 </span>                :          * @param sort_key  value number to sort on.
-<span class="lineNum">     765 </span>                :          *
-<span class="lineNum">     766 </span>                :          * @param ascending  If true, documents values which sort higher by
-<span class="lineNum">     767 </span>                :          *               string compare are better.  If false, the sort order
-<span class="lineNum">     768 </span>                :          *               is reversed.  (default true)
-<span class="lineNum">     769 </span>                :          */
-<span class="lineNum">     770 </span>                :         void set_sort_by_value(Xapian::valueno sort_key, bool ascending = true);
-<span class="lineNum">     771 </span>                : 
-<span class="lineNum">     772 </span>                :         /** Set the sorting to be by key generated from values only.
-<span class="lineNum">     773 </span>                :          *
-<span class="lineNum">     774 </span>                :          * @param sorter    The functor to use for generating keys.
-<span class="lineNum">     775 </span>                :          *
-<span class="lineNum">     776 </span>                :          * @param ascending  If true, documents values which sort higher by
-<span class="lineNum">     777 </span>                :          *               string compare are better.  If false, the sort order
-<span class="lineNum">     778 </span>                :          *               is reversed.  (default true)
-<span class="lineNum">     779 </span>                :          */
-<span class="lineNum">     780 </span>                :         void set_sort_by_key(Xapian::Sorter * sorter, bool ascending = true);
-<span class="lineNum">     781 </span>                : 
-<span class="lineNum">     782 </span>                :         /** Set the sorting to be by value, then by relevance for documents
-<span class="lineNum">     783 </span>                :          *  with the same value.
-<span class="lineNum">     784 </span>                :          *
-<span class="lineNum">     785 </span>                :          *  NB sorting of values uses a string comparison, so you'll need to
-<span class="lineNum">     786 </span>                :          *  store numbers padded with leading zeros or spaces, or with the
-<span class="lineNum">     787 </span>                :          *  number of digits prepended.
-<span class="lineNum">     788 </span>                :          *
-<span class="lineNum">     789 </span>                :          * @param sort_key  value number to sort on.
-<span class="lineNum">     790 </span>                :          *
-<span class="lineNum">     791 </span>                :          * @param ascending  If true, documents values which sort higher by
-<span class="lineNum">     792 </span>                :          *               string compare are better.  If false, the sort order
-<span class="lineNum">     793 </span>                :          *               is reversed.  (default true)
-<span class="lineNum">     794 </span>                :          */
-<span class="lineNum">     795 </span>                :         void set_sort_by_value_then_relevance(Xapian::valueno sort_key,
-<span class="lineNum">     796 </span>                :                                               bool ascending = true);
-<span class="lineNum">     797 </span>                : 
-<span class="lineNum">     798 </span>                :         /** Set the sorting to be by keys generated from values, then by
-<span class="lineNum">     799 </span>                :          *  relevance for documents with identical keys.
-<span class="lineNum">     800 </span>                :          *
-<span class="lineNum">     801 </span>                :          * @param sorter    The functor to use for generating keys.
-<span class="lineNum">     802 </span>                :          *
-<span class="lineNum">     803 </span>                :          * @param ascending  If true, keys which sort higher by
-<span class="lineNum">     804 </span>                :          *               string compare are better.  If false, the sort order
-<span class="lineNum">     805 </span>                :          *               is reversed.  (default true)
-<span class="lineNum">     806 </span>                :          */
-<span class="lineNum">     807 </span>                :         void set_sort_by_key_then_relevance(Xapian::Sorter * sorter,
-<span class="lineNum">     808 </span>                :                                             bool ascending = true);
-<span class="lineNum">     809 </span>                : 
-<span class="lineNum">     810 </span>                :         /** Set the sorting to be by relevance then value.
-<span class="lineNum">     811 </span>                :          *
-<span class="lineNum">     812 </span>                :          *  NB sorting of values uses a string comparison, so you'll need to
-<span class="lineNum">     813 </span>                :          *  store numbers padded with leading zeros or spaces, or with the
-<span class="lineNum">     814 </span>                :          *  number of digits prepended.
-<span class="lineNum">     815 </span>                :          *
-<span class="lineNum">     816 </span>                :          *  Note that with the default BM25 weighting scheme parameters,
-<span class="lineNum">     817 </span>                :          *  non-identical documents will rarely have the same weight, so
-<span class="lineNum">     818 </span>                :          *  this setting will give very similar results to
-<span class="lineNum">     819 </span>                :          *  set_sort_by_relevance().  It becomes more useful with particular
-<span class="lineNum">     820 </span>                :          *  BM25 parameter settings (e.g. BM25Weight(1,0,1,0,0)) or custom
-<span class="lineNum">     821 </span>                :          *  weighting schemes.
-<span class="lineNum">     822 </span>                :          *
-<span class="lineNum">     823 </span>                :          * @param sort_key  value number to sort on.
-<span class="lineNum">     824 </span>                :          *
-<span class="lineNum">     825 </span>                :          * @param ascending  If true, documents values which sort higher by
-<span class="lineNum">     826 </span>                :          *               string compare are better.  If false, the sort order
-<span class="lineNum">     827 </span>                :          *               is reversed.  (default true)
-<span class="lineNum">     828 </span>                :          */
-<span class="lineNum">     829 </span>                :         void set_sort_by_relevance_then_value(Xapian::valueno sort_key,
-<span class="lineNum">     830 </span>                :                                               bool ascending = true);
-<span class="lineNum">     831 </span>                : 
-<span class="lineNum">     832 </span>                :         /** Set the sorting to be by relevance, then by keys generated from
-<span class="lineNum">     833 </span>                :          *  values.
-<span class="lineNum">     834 </span>                :          *
-<span class="lineNum">     835 </span>                :          *  Note that with the default BM25 weighting scheme parameters,
-<span class="lineNum">     836 </span>                :          *  non-identical documents will rarely have the same weight, so
-<span class="lineNum">     837 </span>                :          *  this setting will give very similar results to
-<span class="lineNum">     838 </span>                :          *  set_sort_by_relevance().  It becomes more useful with particular
-<span class="lineNum">     839 </span>                :          *  BM25 parameter settings (e.g. BM25Weight(1,0,1,0,0)) or custom
-<span class="lineNum">     840 </span>                :          *  weighting schemes.
-<span class="lineNum">     841 </span>                :          *
-<span class="lineNum">     842 </span>                :          * @param sorter    The functor to use for generating keys.
-<span class="lineNum">     843 </span>                :          *
-<span class="lineNum">     844 </span>                :          * @param ascending  If true, keys which sort higher by
-<span class="lineNum">     845 </span>                :          *               string compare are better.  If false, the sort order
-<span class="lineNum">     846 </span>                :          *               is reversed.  (default true)
-<span class="lineNum">     847 </span>                :          */
-<span class="lineNum">     848 </span>                :         void set_sort_by_relevance_then_key(Xapian::Sorter * sorter,
-<span class="lineNum">     849 </span>                :                                             bool ascending = true);
-<span class="lineNum">     850 </span>                : 
-<span class="lineNum">     851 </span>                :         /** Get (a portion of) the match set for the current query.
-<span class="lineNum">     852 </span>                :          *
-<span class="lineNum">     853 </span>                :          *  @param first     the first item in the result set to return.
-<span class="lineNum">     854 </span>                :          *                   A value of zero corresponds to the first item
-<span class="lineNum">     855 </span>                :          *                   returned being that with the highest score.
-<span class="lineNum">     856 </span>                :          *                   A value of 10 corresponds to the first 10 items
-<span class="lineNum">     857 </span>                :          *                   being ignored, and the returned items starting
-<span class="lineNum">     858 </span>                :          *                   at the eleventh.
-<span class="lineNum">     859 </span>                :          *  @param maxitems  the maximum number of items to return.
-<span class="lineNum">     860 </span>                :          *  @param checkatleast  the minimum number of items to check.  Because
-<span class="lineNum">     861 </span>                :          *                   the matcher optimises, it won't consider every
-<span class="lineNum">     862 </span>                :          *                   document which might match, so the total number
-<span class="lineNum">     863 </span>                :          *                   of matches is estimated.  Setting checkatleast
-<span class="lineNum">     864 </span>                :          *                   forces it to consider at least this many matches
-<span class="lineNum">     865 </span>                :          *                   and so allows for reliable paging links.
-<span class="lineNum">     866 </span>                :          *  @param omrset    the relevance set to use when performing the query.
-<span class="lineNum">     867 </span>                :          *  @param mdecider  a decision functor to use to decide whether a
-<span class="lineNum">     868 </span>                :          *                   given document should be put in the MSet.
-<span class="lineNum">     869 </span>                :          *  @param matchspy  a decision functor to use to decide whether a
-<span class="lineNum">     870 </span>                :          *                   given document should be put in the MSet.  The
-<span class="lineNum">     871 </span>                :          *                   matchspy is applied to every document which is
-<span class="lineNum">     872 </span>                :          *                   a potential candidate for the MSet, so if there are
-<span class="lineNum">     873 </span>                :          *                   checkatleast or more such documents, the matchspy
-<span class="lineNum">     874 </span>                :          *                   will see at least checkatleast.  The mdecider is
-<span class="lineNum">     875 </span>                :          *                   assumed to be a relatively expensive test so may
-<span class="lineNum">     876 </span>                :          *                   be applied in a lazier fashion.
-<span class="lineNum">     877 </span>                :          *
-<span class="lineNum">     878 </span>                :          *  @return          A Xapian::MSet object containing the results of the
-<span class="lineNum">     879 </span>                :          *                   query.
-<span class="lineNum">     880 </span>                :          *
-<span class="lineNum">     881 </span>                :          *  @exception Xapian::InvalidArgumentError  See class documentation.
-<span class="lineNum">     882 </span>                :          */
-<span class="lineNum">     883 </span>                :         MSet get_mset(Xapian::doccount first, Xapian::doccount maxitems,
-<span class="lineNum">     884 </span>                :                       Xapian::doccount checkatleast = 0,
-<span class="lineNum">     885 </span>                :                       const RSet * omrset = 0,
-<span class="lineNum">     886 </span>                :                       const MatchDecider * mdecider = 0) const;
-<span class="lineNum">     887 </span>                :         MSet get_mset(Xapian::doccount first, Xapian::doccount maxitems,
-<span class="lineNum">     888 </span>                :                       Xapian::doccount checkatleast,
-<span class="lineNum">     889 </span>                :                       const RSet * omrset,
-<span class="lineNum">     890 </span>                :                       const MatchDecider * mdecider,
-<span class="lineNum">     891 </span>                :                       const MatchDecider * matchspy) const;
-<span class="lineNum">     892 </span>                :         MSet get_mset(Xapian::doccount first, Xapian::doccount maxitems,
-<span class="lineNum">     893 </span>                :                       const RSet * omrset,
-<span class="lineNum">     894 </span>                :                       const MatchDecider * mdecider = 0) const {
-<span class="lineNum">     895 </span>                :             return get_mset(first, maxitems, 0, omrset, mdecider);
-<span class="lineNum">     896 </span>                :         }
-<span class="lineNum">     897 </span>                : 
-<span class="lineNum">     898 </span>                :         static const int INCLUDE_QUERY_TERMS = 1;
-<span class="lineNum">     899 </span>                :         static const int USE_EXACT_TERMFREQ = 2;
-<span class="lineNum">     900 </span>                : #ifndef _MSC_VER
-<span class="lineNum">     901 </span>                :         /// Deprecated in Xapian 1.0.0, use INCLUDE_QUERY_TERMS instead.
-<span class="lineNum">     902 </span>                :         XAPIAN_DEPRECATED(static const int include_query_terms) = 1;
-<span class="lineNum">     903 </span>                :         /// Deprecated in Xapian 1.0.0, use USE_EXACT_TERMFREQ instead.
-<span class="lineNum">     904 </span>                :         XAPIAN_DEPRECATED(static const int use_exact_termfreq) = 2;
-<span class="lineNum">     905 </span>                : #else
-<span class="lineNum">     906 </span>                :         // Work around MSVC stupidity (you get a warning for deprecating a
-<span class="lineNum">     907 </span>                :         // declaration).
-<span class="lineNum">     908 </span>                :         static const int include_query_terms = 1;
-<span class="lineNum">     909 </span>                :         static const int use_exact_termfreq = 2;
-<span class="lineNum">     910 </span>                : #pragma deprecated(&quot;Xapian::Enquire::include_query_terms&quot;, &quot;Xapian::Enquire::use_exact_termfreq&quot;)
-<span class="lineNum">     911 </span>                : #endif
-<span class="lineNum">     912 </span>                : 
-<span class="lineNum">     913 </span>                :         /** Get the expand set for the given rset.
-<span class="lineNum">     914 </span>                :          *
-<span class="lineNum">     915 </span>                :          *  @param maxitems  the maximum number of items to return.
-<span class="lineNum">     916 </span>                :          *  @param omrset    the relevance set to use when performing
-<span class="lineNum">     917 </span>                :          *                   the expand operation.
-<span class="lineNum">     918 </span>                :          *  @param flags     zero or more of these values |-ed together:
-<span class="lineNum">     919 </span>                :          *                    - Xapian::Enquire::INCLUDE_QUERY_TERMS query
-<span class="lineNum">     920 </span>                :          *                      terms may be returned from expand
-<span class="lineNum">     921 </span>                :          *                    - Xapian::Enquire::USE_EXACT_TERMFREQ for multi
-<span class="lineNum">     922 </span>                :          *                      dbs, calculate the exact termfreq; otherwise an
-<span class="lineNum">     923 </span>                :          *                      approximation is used which can greatly improve
-<span class="lineNum">     924 </span>                :          *                      efficiency, but still returns good results.
-<span class="lineNum">     925 </span>                :          *  @param k         the parameter k in the query expansion algorithm
-<span class="lineNum">     926 </span>                :          *                   (default is 1.0)
-<span class="lineNum">     927 </span>                :          *  @param edecider  a decision functor to use to decide whether a
-<span class="lineNum">     928 </span>                :          *                   given term should be put in the ESet
-<span class="lineNum">     929 </span>                :          *
-<span class="lineNum">     930 </span>                :          *  @return          An ESet object containing the results of the
-<span class="lineNum">     931 </span>                :          *                   expand.
-<span class="lineNum">     932 </span>                :          *
-<span class="lineNum">     933 </span>                :          *  @exception Xapian::InvalidArgumentError  See class documentation.
-<span class="lineNum">     934 </span>                :          */
-<span class="lineNum">     935 </span>                :         ESet get_eset(Xapian::termcount maxitems,
-<span class="lineNum">     936 </span>                :                         const RSet &amp; omrset,
-<span class="lineNum">     937 </span>                :                         int flags = 0,
-<span class="lineNum">     938 </span>                :                         double k = 1.0,
-<span class="lineNum">     939 </span>                :                         const Xapian::ExpandDecider * edecider = 0) const;
-<span class="lineNum">     940 </span>                : 
-<span class="lineNum">     941 </span>                :         /** Get the expand set for the given rset.
-<span class="lineNum">     942 </span>                :          *
-<span class="lineNum">     943 </span>                :          *  @param maxitems  the maximum number of items to return.
-<span class="lineNum">     944 </span>                :          *  @param omrset    the relevance set to use when performing
-<span class="lineNum">     945 </span>                :          *                   the expand operation.
-<span class="lineNum">     946 </span>                :          *  @param edecider  a decision functor to use to decide whether a
-<span class="lineNum">     947 </span>                :          *                   given term should be put in the ESet
-<span class="lineNum">     948 </span>                :          *
-<span class="lineNum">     949 </span>                :          *  @return          An ESet object containing the results of the
-<span class="lineNum">     950 </span>                :          *                   expand.
-<span class="lineNum">     951 </span>                :          *
-<span class="lineNum">     952 </span>                :          *  @exception Xapian::InvalidArgumentError  See class documentation.
-<span class="lineNum">     953 </span>                :          */
-<span class="lineNum">     954 </span>                :         inline ESet get_eset(Xapian::termcount maxitems, const RSet &amp; omrset,
-<span class="lineNum">     955 </span><span class="lineCov">              4 :                                const Xapian::ExpandDecider * edecider) const {</span>
-<span class="lineNum">     956 </span><span class="lineCov">              4 :             return get_eset(maxitems, omrset, 0, 1.0, edecider);</span>
-<span class="lineNum">     957 </span>                :         }
-<span class="lineNum">     958 </span>                : 
-<span class="lineNum">     959 </span>                :         /** Get terms which match a given document, by document id.
-<span class="lineNum">     960 </span>                :          *
-<span class="lineNum">     961 </span>                :          *  This method returns the terms in the current query which match
-<span class="lineNum">     962 </span>                :          *  the given document.
-<span class="lineNum">     963 </span>                :          *
-<span class="lineNum">     964 </span>                :          *  It is possible for the document to have been removed from the
-<span class="lineNum">     965 </span>                :          *  database between the time it is returned in an MSet, and the
-<span class="lineNum">     966 </span>                :          *  time that this call is made.  If possible, you should specify
-<span class="lineNum">     967 </span>                :          *  an MSetIterator instead of a Xapian::docid, since this will enable
-<span class="lineNum">     968 </span>                :          *  database backends with suitable support to prevent this
-<span class="lineNum">     969 </span>                :          *  occurring.
-<span class="lineNum">     970 </span>                :          *
-<span class="lineNum">     971 </span>                :          *  Note that a query does not need to have been run in order to
-<span class="lineNum">     972 </span>                :          *  make this call.
-<span class="lineNum">     973 </span>                :          *
-<span class="lineNum">     974 </span>                :          *  @param did     The document id for which to retrieve the matching
-<span class="lineNum">     975 </span>                :          *                 terms.
-<span class="lineNum">     976 </span>                :          *
-<span class="lineNum">     977 </span>                :          *  @return        An iterator returning the terms which match the
-<span class="lineNum">     978 </span>                :          *                 document.  The terms will be returned (as far as this
-<span class="lineNum">     979 </span>                :          *                 makes any sense) in the same order as the terms
-<span class="lineNum">     980 </span>                :          *                 in the query.  Terms will not occur more than once,
-<span class="lineNum">     981 </span>                :          *                 even if they do in the query.
-<span class="lineNum">     982 </span>                :          *
-<span class="lineNum">     983 </span>                :          *  @exception Xapian::InvalidArgumentError  See class documentation.
-<span class="lineNum">     984 </span>                :          *  @exception Xapian::DocNotFoundError      The document specified
-<span class="lineNum">     985 </span>                :          *      could not be found in the database.
-<span class="lineNum">     986 </span>                :          */
-<span class="lineNum">     987 </span>                :         TermIterator get_matching_terms_begin(Xapian::docid did) const;
-<span class="lineNum">     988 </span>                : 
-<span class="lineNum">     989 </span>                :         /** End iterator corresponding to get_matching_terms_begin() */
-<span class="lineNum">     990 </span>                :         TermIterator get_matching_terms_end(Xapian::docid /*did*/) const {
-<span class="lineNum">     991 </span>                :             return TermIterator(NULL);
-<span class="lineNum">     992 </span>                :         }
-<span class="lineNum">     993 </span>                : 
-<span class="lineNum">     994 </span>                :         /** Get terms which match a given document, by match set item.
-<span class="lineNum">     995 </span>                :          *
-<span class="lineNum">     996 </span>                :          *  This method returns the terms in the current query which match
-<span class="lineNum">     997 </span>                :          *  the given document.
-<span class="lineNum">     998 </span>                :          *
-<span class="lineNum">     999 </span>                :          *  If the underlying database has suitable support, using this call
-<span class="lineNum">    1000 </span>                :          *  (rather than passing a Xapian::docid) will enable the system to
-<span class="lineNum">    1001 </span>                :          *  ensure that the correct data is returned, and that the document
-<span class="lineNum">    1002 </span>                :          *  has not been deleted or changed since the query was performed.
-<span class="lineNum">    1003 </span>                :          *
-<span class="lineNum">    1004 </span>                :          *  @param it   The iterator for which to retrieve the matching terms.
-<span class="lineNum">    1005 </span>                :          *
-<span class="lineNum">    1006 </span>                :          *  @return     An iterator returning the terms which match the
-<span class="lineNum">    1007 </span>                :          *                 document.  The terms will be returned (as far as this
-<span class="lineNum">    1008 </span>                :          *                 makes any sense) in the same order as the terms
-<span class="lineNum">    1009 </span>                :          *                 in the query.  Terms will not occur more than once,
-<span class="lineNum">    1010 </span>                :          *                 even if they do in the query.
-<span class="lineNum">    1011 </span>                :          *
-<span class="lineNum">    1012 </span>                :          *  @exception Xapian::InvalidArgumentError  See class documentation.
-<span class="lineNum">    1013 </span>                :          *  @exception Xapian::DocNotFoundError      The document specified
-<span class="lineNum">    1014 </span>                :          *      could not be found in the database.
-<span class="lineNum">    1015 </span>                :          */
-<span class="lineNum">    1016 </span>                :         TermIterator get_matching_terms_begin(const MSetIterator &amp;it) const;
-<span class="lineNum">    1017 </span>                : 
-<span class="lineNum">    1018 </span>                :         /** End iterator corresponding to get_matching_terms_begin() */
-<span class="lineNum">    1019 </span>                :         TermIterator get_matching_terms_end(const MSetIterator &amp;/*it*/) const {
-<span class="lineNum">    1020 </span>                :             return TermIterator(NULL);
-<span class="lineNum">    1021 </span>                :         }
-<span class="lineNum">    1022 </span>                : 
-<span class="lineNum">    1023 </span>                :         /** Register a MatchDecider.
-<span class="lineNum">    1024 </span>                :          *
-<span class="lineNum">    1025 </span>                :          * This is used to associate a name with a matchdecider.
-<span class="lineNum">    1026 </span>                :          *
-<span class="lineNum">    1027 </span>                :          * @deprecated This method is deprecated.  It was added long ago with
-<span class="lineNum">    1028 </span>                :          * the intention that it would allow the remote backend to support
-<span class="lineNum">    1029 </span>                :          * use of MatchDecider objects, but there's a better approach.
-<span class="lineNum">    1030 </span>                :          *
-<span class="lineNum">    1031 </span>                :          * @param name          The name to register this matchdecider as.
-<span class="lineNum">    1032 </span>                :          * @param mdecider      The matchdecider.  If omitted, then remove
-<span class="lineNum">    1033 </span>                :          *                      any matchdecider registered with this name.
-<span class="lineNum">    1034 </span>                :          */
-<span class="lineNum">    1035 </span>                :         XAPIAN_DEPRECATED(
-<span class="lineNum">    1036 </span>                :         void register_match_decider(const std::string &amp;name,
-<span class="lineNum">    1037 </span>                :                                     const MatchDecider *mdecider = NULL));
-<span class="lineNum">    1038 </span>                : 
-<span class="lineNum">    1039 </span>                :         /// Return a string describing this object.
-<span class="lineNum">    1040 </span>                :         std::string get_description() const;
-<span class="lineNum">    1041 </span>                : };
-<span class="lineNum">    1042 </span>                : 
-<span class="lineNum">    1043 </span>                : }
-<span class="lineNum">    1044 </span>                : 
-<span class="lineNum">    1045 </span>                : class RemoteServer;
-<span class="lineNum">    1046 </span>                : class ScaleWeight;
-<span class="lineNum">    1047 </span>                : 
-<span class="lineNum">    1048 </span>                : namespace Xapian {
-<span class="lineNum">    1049 </span>                : 
-<span class="lineNum">    1050 </span>                : /// Abstract base class for weighting schemes
-<span class="lineNum">    1051 </span>                : class XAPIAN_VISIBILITY_DEFAULT Weight {
-<span class="lineNum">    1052 </span>                :     friend class Enquire; // So Enquire can clone us
-<span class="lineNum">    1053 </span>                :     friend class ::RemoteServer; // So RemoteServer can clone us - FIXME
-<span class="lineNum">    1054 </span>                :     friend class ::ScaleWeight;
-<span class="lineNum">    1055 </span>                :     public:
-<span class="lineNum">    1056 </span>                :         class Internal;
-<span class="lineNum">    1057 </span>                :     protected:
-<span class="lineNum">    1058 </span>                :         Weight(const Weight &amp;);
-<span class="lineNum">    1059 </span>                :     private:
-<span class="lineNum">    1060 </span>                :         void operator=(Weight &amp;);
-<span class="lineNum">    1061 </span>                : 
-<span class="lineNum">    1062 </span>                :         /** Return a new weight object of this type.
-<span class="lineNum">    1063 </span>                :          *
-<span class="lineNum">    1064 </span>                :          * A subclass called FooWeight taking parameters param1 and param2
-<span class="lineNum">    1065 </span>                :          * should implement this as:
-<span class="lineNum">    1066 </span>                :          *
-<span class="lineNum">    1067 </span>                :          * virtual FooWeight * clone() const {
-<span class="lineNum">    1068 </span>                :          *     return new FooWeight(param1, param2);
-<span class="lineNum">    1069 </span>                :          * }
-<span class="lineNum">    1070 </span>                :          */
-<span class="lineNum">    1071 </span>                :         virtual Weight * clone() const = 0;
-<span class="lineNum">    1072 </span>                : 
-<span class="lineNum">    1073 </span>                :     protected:
-<span class="lineNum">    1074 </span>                :         const Internal * internal; // Weight::Internal == Stats
-<span class="lineNum">    1075 </span>                :         Xapian::doclength querysize;
-<span class="lineNum">    1076 </span>                :         Xapian::termcount wqf;
-<span class="lineNum">    1077 </span>                :         std::string tname;
-<span class="lineNum">    1078 </span>                : 
-<span class="lineNum">    1079 </span>                :     public:
-<span class="lineNum">    1080 </span>                :         // FIXME:1.1: initialise internal to NULL here
-<span class="lineNum">    1081 </span>                :         Weight() { }
-<span class="lineNum">    1082 </span>                :         virtual ~Weight();
-<span class="lineNum">    1083 </span>                : 
-<span class="lineNum">    1084 </span>                :         /** Create a new weight object of the same type as this and initialise
-<span class="lineNum">    1085 </span>                :          *  it with the specified statistics.
-<span class="lineNum">    1086 </span>                :          *
-<span class="lineNum">    1087 </span>                :          *  You shouldn't call this method yourself - it's called by
-<span class="lineNum">    1088 </span>                :          *  Enquire.
-<span class="lineNum">    1089 </span>                :          *
-<span class="lineNum">    1090 </span>                :          *  @param internal_  Object to ask for collection statistics.
-<span class="lineNum">    1091 </span>                :          *  @param querysize_ Query size.
-<span class="lineNum">    1092 </span>                :          *  @param wqf_       Within query frequency of term this object is
-<span class="lineNum">    1093 </span>                :          *                    associated with.
-<span class="lineNum">    1094 </span>                :          *  @param tname_     Term which this object is associated with.
-<span class="lineNum">    1095 </span>                :          */
-<span class="lineNum">    1096 </span>                :         Weight * create(const Internal * internal_, Xapian::doclength querysize_,
-<span class="lineNum">    1097 </span>                :                         Xapian::termcount wqf_, const std::string &amp; tname_) const;
-<span class="lineNum">    1098 </span>                : 
-<span class="lineNum">    1099 </span>                :         /** Name of the weighting scheme.
-<span class="lineNum">    1100 </span>                :          *
-<span class="lineNum">    1101 </span>                :          *  If the subclass is called FooWeight, this should return &quot;Foo&quot;.
-<span class="lineNum">    1102 </span>                :          */
-<span class="lineNum">    1103 </span>                :         virtual std::string name() const = 0;
-<span class="lineNum">    1104 </span>                : 
-<span class="lineNum">    1105 </span>                :         /// Serialise object parameters into a string.
-<span class="lineNum">    1106 </span>                :         virtual std::string serialise() const = 0;
-<span class="lineNum">    1107 </span>                : 
-<span class="lineNum">    1108 </span>                :         /// Create object given string serialisation returned by serialise().
-<span class="lineNum">    1109 </span>                :         virtual Weight * unserialise(const std::string &amp;s) const = 0;
-<span class="lineNum">    1110 </span>                : 
-<span class="lineNum">    1111 </span>                :         /** Get a weight which is part of the sum over terms being performed.
-<span class="lineNum">    1112 </span>                :          *  This returns a weight for a given term and document.  These
-<span class="lineNum">    1113 </span>                :          *  weights are summed to give a total weight for the document.
-<span class="lineNum">    1114 </span>                :          *
-<span class="lineNum">    1115 </span>                :          *  @param wdf the within document frequency of the term.
-<span class="lineNum">    1116 </span>                :          *  @param len the (unnormalised) document length.
-<span class="lineNum">    1117 </span>                :          */
-<span class="lineNum">    1118 </span>                :         virtual Xapian::weight get_sumpart(Xapian::termcount wdf,
-<span class="lineNum">    1119 </span>                :                                       Xapian::doclength len) const = 0;
-<span class="lineNum">    1120 </span>                : 
-<span class="lineNum">    1121 </span>                :         /** Gets the maximum value that get_sumpart() may return.  This
-<span class="lineNum">    1122 </span>                :          *  is used in optimising searches, by having the postlist tree
-<span class="lineNum">    1123 </span>                :          *  decay appropriately when parts of it can have limited, or no,
-<span class="lineNum">    1124 </span>                :          *  further effect.
-<span class="lineNum">    1125 </span>                :          */
-<span class="lineNum">    1126 </span>                :         virtual Xapian::weight get_maxpart() const = 0;
-<span class="lineNum">    1127 </span>                : 
-<span class="lineNum">    1128 </span>                :         /** Get an extra weight for a document to add to the sum calculated
-<span class="lineNum">    1129 </span>                :          *  over the query terms.
-<span class="lineNum">    1130 </span>                :          *  This returns a weight for a given document, and is used by some
-<span class="lineNum">    1131 </span>                :          *  weighting schemes to account for influence such as document
-<span class="lineNum">    1132 </span>                :          *  length.
-<span class="lineNum">    1133 </span>                :          *
-<span class="lineNum">    1134 </span>                :          *  @param len the (unnormalised) document length.
-<span class="lineNum">    1135 </span>                :          */
-<span class="lineNum">    1136 </span>                :         virtual Xapian::weight get_sumextra(Xapian::doclength len) const = 0;
-<span class="lineNum">    1137 </span>                : 
-<span class="lineNum">    1138 </span>                :         /** Gets the maximum value that get_sumextra() may return.  This
-<span class="lineNum">    1139 </span>                :          *  is used in optimising searches.
-<span class="lineNum">    1140 </span>                :          */
-<span class="lineNum">    1141 </span>                :         virtual Xapian::weight get_maxextra() const = 0;
-<span class="lineNum">    1142 </span>                : 
-<span class="lineNum">    1143 </span>                :         /// return false if the weight object doesn't need doclength
-<span class="lineNum">    1144 </span>                :         virtual bool get_sumpart_needs_doclength() const; /* { return true; } */
-<span class="lineNum">    1145 </span>                : };
-<span class="lineNum">    1146 </span>                : 
-<span class="lineNum">    1147 </span>                : /// Boolean weighting scheme (everything gets 0)
-<span class="lineNum">    1148 </span>                : class XAPIAN_VISIBILITY_DEFAULT BoolWeight : public Weight {
-<span class="lineNum">    1149 </span>                :     public:
-<span class="lineNum">    1150 </span>                :         BoolWeight * clone() const;
-<span class="lineNum">    1151 </span>                :         BoolWeight() { }
-<span class="lineNum">    1152 </span>                :         ~BoolWeight();
-<span class="lineNum">    1153 </span>                :         std::string name() const;
-<span class="lineNum">    1154 </span>                :         std::string serialise() const;
-<span class="lineNum">    1155 </span>                :         BoolWeight * unserialise(const std::string &amp; s) const;
-<span class="lineNum">    1156 </span>                :         Xapian::weight get_sumpart(Xapian::termcount wdf, Xapian::doclength len) const;
-<span class="lineNum">    1157 </span>                :         Xapian::weight get_maxpart() const;
-<span class="lineNum">    1158 </span>                : 
-<span class="lineNum">    1159 </span>                :         Xapian::weight get_sumextra(Xapian::doclength len) const;
-<span class="lineNum">    1160 </span>                :         Xapian::weight get_maxextra() const;
-<span class="lineNum">    1161 </span>                : 
-<span class="lineNum">    1162 </span>                :         bool get_sumpart_needs_doclength() const;
-<span class="lineNum">    1163 </span>                : };
-<span class="lineNum">    1164 </span>                : 
-<span class="lineNum">    1165 </span>                : /** BM25 weighting scheme
-<span class="lineNum">    1166 </span>                :  *
-<span class="lineNum">    1167 </span>                :  * BM25 weighting options : The BM25 formula is \f[
-<span class="lineNum">    1168 </span>                :  *      \frac{k_{2}.n_{q}}{1+L_{d}}+\sum_{t}\frac{(k_{3}+1)q_{t}}{k_{3}+q_{t}}.\frac{(k_{1}+1)f_{t,d}}{k_{1}((1-b)+bL_{d})+f_{t,d}}.w_{t}
-<span class="lineNum">    1169 </span>                :  * \f] where
-<span class="lineNum">    1170 </span>                :  *   - \f$w_{t}\f$ is the termweight of term t
-<span class="lineNum">    1171 </span>                :  *   - \f$f_{t,d}\f$ is the within document frequency of term t in document d
-<span class="lineNum">    1172 </span>                :  *   - \f$q_{t}\f$ is the within query frequency of term t
-<span class="lineNum">    1173 </span>                :  *   - \f$L_{d}\f$ is the normalised length of document d
-<span class="lineNum">    1174 </span>                :  *   - \f$n_{q}\f$ is the size of the query
-<span class="lineNum">    1175 </span>                :  *   - \f$k_{1}\f$, \f$k_{2}\f$, \f$k_{3}\f$ and \f$b\f$ are user specified parameters
-<span class="lineNum">    1176 </span>                :  */
-<span class="lineNum">    1177 </span>                : class XAPIAN_VISIBILITY_DEFAULT BM25Weight : public Weight {
-<span class="lineNum">    1178 </span>                :     private:
-<span class="lineNum">    1179 </span>                :         mutable Xapian::weight termweight;
-<span class="lineNum">    1180 </span>                :         mutable Xapian::doclength lenpart;
-<span class="lineNum">    1181 </span>                : 
-<span class="lineNum">    1182 </span>                :         double k1, k2, k3, b;
-<span class="lineNum">    1183 </span>                :         Xapian::doclength min_normlen;
-<span class="lineNum">    1184 </span>                : 
-<span class="lineNum">    1185 </span>                :         mutable bool weight_calculated;
-<span class="lineNum">    1186 </span>                : 
-<span class="lineNum">    1187 </span>                :         void calc_termweight() const;
-<span class="lineNum">    1188 </span>                : 
-<span class="lineNum">    1189 </span>                :     public:
-<span class="lineNum">    1190 </span>                :         /** Construct a BM25 weight.
-<span class="lineNum">    1191 </span>                :          *
-<span class="lineNum">    1192 </span>                :          * @param k1 governs the importance of within document frequency.
-<span class="lineNum">    1193 </span>                :          *                Must be &gt;= 0.  0 means ignore wdf.  Default is 1.
-<span class="lineNum">    1194 </span>                :          * @param k2 compensation factor for the high wdf values in
-<span class="lineNum">    1195 </span>                :          *                large documents.  Must be &gt;= 0.  0 means no
-<span class="lineNum">    1196 </span>                :          *                compensation.  Default is 0.
-<span class="lineNum">    1197 </span>                :          * @param k3 governs the importance of within query frequency.
-<span class="lineNum">    1198 </span>                :          *                Must be &gt;= 0.  0 means ignore wqf.  Default is 1.
-<span class="lineNum">    1199 </span>                :          * @param b Relative importance of within document frequency and
-<span class="lineNum">    1200 </span>                :          *                document length.  Must be &gt;= 0 and &lt;= 1.  Default
-<span class="lineNum">    1201 </span>                :          *                is 0.5.
-<span class="lineNum">    1202 </span>                :          * @param min_normlen specifies a cutoff on the minimum value that
-<span class="lineNum">    1203 </span>                :          *                can be used for a normalised document length -
-<span class="lineNum">    1204 </span>                :          *                smaller values will be forced up to this cutoff.
-<span class="lineNum">    1205 </span>                :          *                This prevents very small documents getting a huge
-<span class="lineNum">    1206 </span>                :          *                bonus weight.  Default is 0.5.
-<span class="lineNum">    1207 </span>                :          */
-<span class="lineNum">    1208 </span>                :         BM25Weight(double k1_, double k2_, double k3_, double b_,
-<span class="lineNum">    1209 </span>                :                    double min_normlen_)
-<span class="lineNum">    1210 </span>                :                 : k1(k1_), k2(k2_), k3(k3_), b(b_), min_normlen(min_normlen_),
-<span class="lineNum">    1211 </span>                :                   weight_calculated(false)
-<span class="lineNum">    1212 </span>                :         {
-<span class="lineNum">    1213 </span>                :             if (k1 &lt; 0) k1 = 0;
-<span class="lineNum">    1214 </span>                :             if (k2 &lt; 0) k2 = 0;
-<span class="lineNum">    1215 </span>                :             if (k3 &lt; 0) k3 = 0;
-<span class="lineNum">    1216 </span>                :             if (b &lt; 0) b = 0; else if (b &gt; 1) b = 1;
-<span class="lineNum">    1217 </span>                :         }
-<span class="lineNum">    1218 </span>                :         BM25Weight() : k1(1), k2(0), k3(1), b(0.5), min_normlen(0.5),
-<span class="lineNum">    1219 </span>                :                        weight_calculated(false) { }
-<span class="lineNum">    1220 </span>                : 
-<span class="lineNum">    1221 </span>                :         BM25Weight * clone() const;
-<span class="lineNum">    1222 </span>                :         ~BM25Weight() { }
-<span class="lineNum">    1223 </span>                :         std::string name() const;
-<span class="lineNum">    1224 </span>                :         std::string serialise() const;
-<span class="lineNum">    1225 </span>                :         BM25Weight * unserialise(const std::string &amp; s) const;
-<span class="lineNum">    1226 </span>                :         Xapian::weight get_sumpart(Xapian::termcount wdf, Xapian::doclength len) const;
-<span class="lineNum">    1227 </span>                :         Xapian::weight get_maxpart() const;
-<span class="lineNum">    1228 </span>                : 
-<span class="lineNum">    1229 </span>                :         Xapian::weight get_sumextra(Xapian::doclength len) const;
-<span class="lineNum">    1230 </span>                :         Xapian::weight get_maxextra() const;
-<span class="lineNum">    1231 </span>                : 
-<span class="lineNum">    1232 </span>                :         bool get_sumpart_needs_doclength() const;
-<span class="lineNum">    1233 </span>                : };
-<span class="lineNum">    1234 </span>                : 
-<span class="lineNum">    1235 </span>                : /** Traditional probabilistic weighting scheme.
-<span class="lineNum">    1236 </span>                :  *
-<span class="lineNum">    1237 </span>                :  * This class implements the Traditional Probabilistic Weighting scheme, as
-<span class="lineNum">    1238 </span>                :  * described by the early papers on Probabilistic Retrieval.  BM25 generally
-<span class="lineNum">    1239 </span>                :  * gives better results.
-<span class="lineNum">    1240 </span>                :  *
-<span class="lineNum">    1241 </span>                :  * The Traditional weighting scheme formula is \f[
-<span class="lineNum">    1242 </span>                :  *      \sum_{t}\frac{f_{t,d}}{k.L_{d}+f_{t,d}}.w_{t}
-<span class="lineNum">    1243 </span>                :  * \f] where
-<span class="lineNum">    1244 </span>                :  *   - \f$w_{t}\f$ is the termweight of term t
-<span class="lineNum">    1245 </span>                :  *   - \f$f_{t,d}\f$ is the within document frequency of term t in document d
-<span class="lineNum">    1246 </span>                :  *   - \f$L_{d}\f$ is the normalised length of document d
-<span class="lineNum">    1247 </span>                :  *   - \f$k\f$ is a user specifiable parameter
-<span class="lineNum">    1248 </span>                :  *
-<span class="lineNum">    1249 </span>                :  * TradWeight(k) is equivalent to BM25Weight(k, 0, 0, 1, 0), except that
-<span class="lineNum">    1250 </span>                :  * the latter returns weights (k+1) times larger.
-<span class="lineNum">    1251 </span>                :  */
-<span class="lineNum">    1252 </span>                : class XAPIAN_VISIBILITY_DEFAULT TradWeight : public Weight {
-<span class="lineNum">    1253 </span>                :     private:
-<span class="lineNum">    1254 </span>                :         mutable Xapian::weight termweight;
-<span class="lineNum">    1255 </span>                :         mutable Xapian::doclength lenpart;
-<span class="lineNum">    1256 </span>                : 
-<span class="lineNum">    1257 </span>                :         double param_k;
-<span class="lineNum">    1258 </span>                : 
-<span class="lineNum">    1259 </span>                :         mutable bool weight_calculated;
-<span class="lineNum">    1260 </span>                : 
-<span class="lineNum">    1261 </span>                :         void calc_termweight() const;
-<span class="lineNum">    1262 </span>                : 
-<span class="lineNum">    1263 </span>                :     public:
-<span class="lineNum">    1264 </span>                :         /** Construct a TradWeight
-<span class="lineNum">    1265 </span>                :          *
-<span class="lineNum">    1266 </span>                :          * @param k  parameter governing the importance of within
-<span class="lineNum">    1267 </span>                :          *           document frequency and document length - any non-negative
-<span class="lineNum">    1268 </span>                :          *           number (0 meaning to ignore wdf and doc length when
-<span class="lineNum">    1269 </span>                :          *           calculating weights).  Default is 1.
-<span class="lineNum">    1270 </span>                :          */
-<span class="lineNum">    1271 </span>                :         explicit TradWeight(double k) : param_k(k), weight_calculated(false) {
-<span class="lineNum">    1272 </span>                :             if (param_k &lt; 0) param_k = 0;
-<span class="lineNum">    1273 </span>                :         }
-<span class="lineNum">    1274 </span>                : 
-<span class="lineNum">    1275 </span>                :         TradWeight() : param_k(1.0), weight_calculated(false) { }
-<span class="lineNum">    1276 </span>                : 
-<span class="lineNum">    1277 </span>                :         TradWeight * clone() const;
-<span class="lineNum">    1278 </span>                :         ~TradWeight() { }
-<span class="lineNum">    1279 </span>                :         std::string name() const;
-<span class="lineNum">    1280 </span>                :         std::string serialise() const;
-<span class="lineNum">    1281 </span>                :         TradWeight * unserialise(const std::string &amp; s) const;
-<span class="lineNum">    1282 </span>                : 
-<span class="lineNum">    1283 </span>                :         Xapian::weight get_sumpart(Xapian::termcount wdf, Xapian::doclength len) const;
-<span class="lineNum">    1284 </span>                :         Xapian::weight get_maxpart() const;
-<span class="lineNum">    1285 </span>                : 
-<span class="lineNum">    1286 </span>                :         Xapian::weight get_sumextra(Xapian::doclength len) const;
-<span class="lineNum">    1287 </span>                :         Xapian::weight get_maxextra() const;
-<span class="lineNum">    1288 </span>                : 
-<span class="lineNum">    1289 </span>                :         bool get_sumpart_needs_doclength() const;
-<span class="lineNum">    1290 </span>                : };
-<span class="lineNum">    1291 </span>                : 
-<span class="lineNum">    1292 </span>                : }
-<span class="lineNum">    1293 </span>                : 
-<span class="lineNum">    1294 </span>                : #endif /* XAPIAN_INCLUDED_ENQUIRE_H */
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/xapian/error.h.gcov.html b/rep/usr/include/xapian/error.h.gcov.html
deleted file mode 100644
index 62fba9b..0000000
--- a/rep/usr/include/xapian/error.h.gcov.html
+++ /dev/null
@@ -1,822 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/xapian/error.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/xapian</a> - error.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">3</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">0.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">0</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /** @file error.h
-<span class="lineNum">       2 </span>                :  *  @brief Hierarchy of classes which Xapian can throw as exceptions.
-<span class="lineNum">       3 </span>                :  */
-<span class="lineNum">       4 </span>                : /* Warning: This file is generated by ./generate-exceptions - do not modify directly! */
-<span class="lineNum">       5 </span>                : /* Copyright (C) 2003,2004,2006,2007 Olly Betts
-<span class="lineNum">       6 </span>                :  *
-<span class="lineNum">       7 </span>                :  * This program is free software; you can redistribute it and/or
-<span class="lineNum">       8 </span>                :  * modify it under the terms of the GNU General Public License as
-<span class="lineNum">       9 </span>                :  * published by the Free Software Foundation; either version 2 of the
-<span class="lineNum">      10 </span>                :  * License, or (at your option) any later version.
-<span class="lineNum">      11 </span>                :  *
-<span class="lineNum">      12 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      13 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      14 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      15 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      16 </span>                :  *
-<span class="lineNum">      17 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      18 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      19 </span>                :  * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
-<span class="lineNum">      20 </span>                :  */
-<span class="lineNum">      21 </span>                : 
-<span class="lineNum">      22 </span>                : #ifndef XAPIAN_INCLUDED_ERROR_H
-<span class="lineNum">      23 </span>                : #define XAPIAN_INCLUDED_ERROR_H
-<span class="lineNum">      24 </span>                : 
-<span class="lineNum">      25 </span>                : #include &lt;string&gt;
-<span class="lineNum">      26 </span>                : #include &lt;xapian/deprecated.h&gt;
-<span class="lineNum">      27 </span>                : #include &lt;xapian/visibility.h&gt;
-<span class="lineNum">      28 </span>                : 
-<span class="lineNum">      29 </span>                : namespace Xapian {
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : class ErrorHandler;
-<span class="lineNum">      32 </span>                : 
-<span class="lineNum">      33 </span>                : /** All exceptions thrown by Xapian are subclasses of Xapian::Error.
-<span class="lineNum">      34 </span>                :  *
-<span class="lineNum">      35 </span>                :  *  This class can not be instantiated directly - instead a subclass should
-<span class="lineNum">      36 </span>                :  *  be used.
-<span class="lineNum">      37 </span>                :  */
-<span class="lineNum">      38 </span>                : class XAPIAN_VISIBILITY_DEFAULT Error {
-<span class="lineNum">      39 </span>                :     // ErrorHandler needs to be able to access Error::already_handled.
-<span class="lineNum">      40 </span>                :     friend class ErrorHandler;
-<span class="lineNum">      41 </span>                : 
-<span class="lineNum">      42 </span>                :     /// Message giving details of the error, intended for human consumption.
-<span class="lineNum">      43 </span>                :     std::string msg;
-<span class="lineNum">      44 </span>                : 
-<span class="lineNum">      45 </span>                :     /** Optional context information.
-<span class="lineNum">      46 </span>                :      *
-<span class="lineNum">      47 </span>                :      *  This context is intended for use by Xapian::ErrorHandler (for example
-<span class="lineNum">      48 </span>                :      *  so it can know which remote server is unreliable and report the problem
-<span class="lineNum">      49 </span>                :      *  and remove that server from those being searched).  But it's typically
-<span class="lineNum">      50 </span>                :      *  a plain-text string, and so also fit for human consumption.
-<span class="lineNum">      51 </span>                :      */
-<span class="lineNum">      52 </span>                :     std::string context;
-<span class="lineNum">      53 </span>                : 
-<span class="lineNum">      54 </span>                :     /// The type of this error (e.g. DocNotFoundError.)
-<span class="lineNum">      55 </span>                :     const char * type;
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span>                :     /** Optional value of 'errno' associated with this error.
-<span class="lineNum">      58 </span>                :      *
-<span class="lineNum">      59 </span>                :      *  If no value is associated, this member variable will be 0.
-<span class="lineNum">      60 </span>                :      *
-<span class="lineNum">      61 </span>                :      *  On UNIX, if this value is &lt; 0, it's a negated h_errno value (giving
-<span class="lineNum">      62 </span>                :      *  an error from gethostbyname() or similar).
-<span class="lineNum">      63 </span>                :      *
-<span class="lineNum">      64 </span>                :      *  On Windows, if this value is &lt; 0, it's a negated Windows error code
-<span class="lineNum">      65 </span>                :      *  (as given by GetLastError() or WSAGetLastError()).
-<span class="lineNum">      66 </span>                :      *
-<span class="lineNum">      67 </span>                :      *  NB We don't just call this member &quot;errno&quot; to avoid problems on
-<span class="lineNum">      68 </span>                :      *  platforms where errno is a preprocessor macro.
-<span class="lineNum">      69 </span>                :      */
-<span class="lineNum">      70 </span>                :     int my_errno;
-<span class="lineNum">      71 </span>                : 
-<span class="lineNum">      72 </span>                :     /** The error string derived from my_errno.
-<span class="lineNum">      73 </span>                :      *
-<span class="lineNum">      74 </span>                :      *  This string is generated from my_errno lazily.
-<span class="lineNum">      75 </span>                :      */
-<span class="lineNum">      76 </span>                :     mutable std::string error_string;
-<span class="lineNum">      77 </span>                : 
-<span class="lineNum">      78 </span>                :     /// True if this error has already been passed to an ErrorHandler.
-<span class="lineNum">      79 </span>                :     bool already_handled;
-<span class="lineNum">      80 </span>                : 
-<span class="lineNum">      81 </span>                :     /// Don't allow assignment of the base class.
-<span class="lineNum">      82 </span>                :     void operator=(const Error &amp;o);
-<span class="lineNum">      83 </span>                : 
-<span class="lineNum">      84 </span>                :   protected:
-<span class="lineNum">      85 </span>                :     /** @private @internal
-<span class="lineNum">      86 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">      87 </span>                :      */
-<span class="lineNum">      88 </span>                :     Error(const std::string &amp;msg_, const std::string &amp;context_,
-<span class="lineNum">      89 </span>                :           const char * type_, const char * error_string_);
-<span class="lineNum">      90 </span>                : 
-<span class="lineNum">      91 </span>                :     /** @private @internal
-<span class="lineNum">      92 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">      93 </span>                :      */
-<span class="lineNum">      94 </span>                :     Error(const std::string &amp;msg_, const std::string &amp;context_,
-<span class="lineNum">      95 </span>                :           const char * type_, int errno_)
-<span class="lineNum">      96 </span>                :         : msg(msg_), context(context_), type(type_), my_errno(errno_),
-<span class="lineNum">      97 </span>                :           error_string(), already_handled(false) { }
-<span class="lineNum">      98 </span>                : 
-<span class="lineNum">      99 </span>                :   public:
-<span class="lineNum">     100 </span>                :     /// The type of this error (e.g. &quot;DocNotFoundError&quot;.)
-<span class="lineNum">     101 </span><span class="lineNoCov">              0 :     const char * get_type() const { return type; }</span>
-<span class="lineNum">     102 </span>                : 
-<span class="lineNum">     103 </span>                :     /// Message giving details of the error, intended for human consumption.
-<span class="lineNum">     104 </span><span class="lineNoCov">              0 :     const std::string &amp; get_msg() const { return msg; }</span>
-<span class="lineNum">     105 </span>                : 
-<span class="lineNum">     106 </span>                :     /** Optional context information.
-<span class="lineNum">     107 </span>                :      *
-<span class="lineNum">     108 </span>                :      *  This context is intended for use by Xapian::ErrorHandler (for example
-<span class="lineNum">     109 </span>                :      *  so it can know which remote server is unreliable and report the problem
-<span class="lineNum">     110 </span>                :      *  and remove that server from those being searched).  But it's typically
-<span class="lineNum">     111 </span>                :      *  a plain-text string, and so also fit for human consumption.
-<span class="lineNum">     112 </span>                :      */
-<span class="lineNum">     113 </span><span class="lineNoCov">              0 :     const std::string &amp; get_context() const { return context; }</span>
-<span class="lineNum">     114 </span>                : 
-<span class="lineNum">     115 </span>                :     /** Returns any system error string associated with this exception.
-<span class="lineNum">     116 </span>                :      *
-<span class="lineNum">     117 </span>                :      *  The system error string may come from errno, h_errno (on UNIX), or
-<span class="lineNum">     118 </span>                :      *  GetLastError() (on MS Windows).  If there is no associated system
-<span class="lineNum">     119 </span>                :      *  error string, NULL is returned.
-<span class="lineNum">     120 </span>                :      */
-<span class="lineNum">     121 </span>                :     const char * get_error_string() const;
-<span class="lineNum">     122 </span>                : 
-<span class="lineNum">     123 </span>                :     /** Optional value of 'errno' associated with this error.
-<span class="lineNum">     124 </span>                :      *
-<span class="lineNum">     125 </span>                :      *  If no 'errno' value is associated, returns 0.  If the returned value
-<span class="lineNum">     126 </span>                :      *  is negative, it's a platform-specific error code (on UNIX, -h_errno;
-<span class="lineNum">     127 </span>                :      *  on MS Windows, -GetLastError()).
-<span class="lineNum">     128 </span>                :      *
-<span class="lineNum">     129 </span>                :      *  @deprecated This method is deprecated, because errno values aren't
-<span class="lineNum">     130 </span>                :      *  portable between platforms, so we can't serialise them when passing
-<span class="lineNum">     131 </span>                :      *  exceptions from a remote server to a client.  Use the
-<span class="lineNum">     132 </span>                :      *  get_error_string() method instead.
-<span class="lineNum">     133 </span>                :      */
-<span class="lineNum">     134 </span>                :     XAPIAN_DEPRECATED(int get_errno() const);
-<span class="lineNum">     135 </span>                : 
-<span class="lineNum">     136 </span>                :     /// Return a string describing this object.
-<span class="lineNum">     137 </span>                :     std::string get_description() const;
-<span class="lineNum">     138 </span>                : };
-<span class="lineNum">     139 </span>                : 
-<span class="lineNum">     140 </span>                : inline int Xapian::Error::get_errno() const { return my_errno; }
-<span class="lineNum">     141 </span>                : 
-<span class="lineNum">     142 </span>                : /** The base class for exceptions indicating errors in the program logic.
-<span class="lineNum">     143 </span>                :  *
-<span class="lineNum">     144 </span>                :  *  A subclass of LogicError will be thrown if Xapian detects a violation
-<span class="lineNum">     145 </span>                :  *  of a class invariant or a logical precondition or postcondition, etc.
-<span class="lineNum">     146 </span>                :  */
-<span class="lineNum">     147 </span>                : class XAPIAN_VISIBILITY_DEFAULT LogicError : public Error {
-<span class="lineNum">     148 </span>                :   protected:
-<span class="lineNum">     149 </span>                :     /** @private @internal
-<span class="lineNum">     150 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     151 </span>                :      */
-<span class="lineNum">     152 </span>                :     LogicError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, const char * error_string_)
-<span class="lineNum">     153 </span>                :         : Error(msg_, context_, type_, error_string_) {}
-<span class="lineNum">     154 </span>                : 
-<span class="lineNum">     155 </span>                :     /** @private @internal
-<span class="lineNum">     156 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     157 </span>                :      */
-<span class="lineNum">     158 </span>                :     LogicError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, int errno_)
-<span class="lineNum">     159 </span>                :         : Error(msg_, context_, type_, errno_) {}
-<span class="lineNum">     160 </span>                : };
-<span class="lineNum">     161 </span>                : 
-<span class="lineNum">     162 </span>                : /** The base class for exceptions indicating errors only detectable at runtime.
-<span class="lineNum">     163 </span>                :  *
-<span class="lineNum">     164 </span>                :  *  A subclass of RuntimeError will be thrown if Xapian detects an error
-<span class="lineNum">     165 </span>                :  *  which is exception derived from RuntimeError is thrown when an
-<span class="lineNum">     166 </span>                :  *  error is caused by problems with the data or environment rather
-<span class="lineNum">     167 </span>                :  *  than a programming mistake.
-<span class="lineNum">     168 </span>                :  */
-<span class="lineNum">     169 </span>                : class XAPIAN_VISIBILITY_DEFAULT RuntimeError : public Error {
-<span class="lineNum">     170 </span>                :   protected:
-<span class="lineNum">     171 </span>                :     /** @private @internal
-<span class="lineNum">     172 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     173 </span>                :      */
-<span class="lineNum">     174 </span>                :     RuntimeError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, const char * error_string_)
-<span class="lineNum">     175 </span>                :         : Error(msg_, context_, type_, error_string_) {}
-<span class="lineNum">     176 </span>                : 
-<span class="lineNum">     177 </span>                :     /** @private @internal
-<span class="lineNum">     178 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     179 </span>                :      */
-<span class="lineNum">     180 </span>                :     RuntimeError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, int errno_)
-<span class="lineNum">     181 </span>                :         : Error(msg_, context_, type_, errno_) {}
-<span class="lineNum">     182 </span>                : };
-<span class="lineNum">     183 </span>                : 
-<span class="lineNum">     184 </span>                : /** AssertionError is thrown if a logical assertion inside Xapian fails.
-<span class="lineNum">     185 </span>                :  *
-<span class="lineNum">     186 </span>                :  *  In a debug build of Xapian, a failed assertion in the core library code
-<span class="lineNum">     187 </span>                :  *  will cause AssertionError to be thrown.
-<span class="lineNum">     188 </span>                :  *
-<span class="lineNum">     189 </span>                :  *  This represents a bug in Xapian (either an invariant, precondition, etc
-<span class="lineNum">     190 </span>                :  *  has been violated, or the assertion is incorrect!)
-<span class="lineNum">     191 </span>                :  */
-<span class="lineNum">     192 </span>                : class XAPIAN_VISIBILITY_DEFAULT AssertionError : public LogicError {
-<span class="lineNum">     193 </span>                :   public:
-<span class="lineNum">     194 </span>                :     /** @private @internal
-<span class="lineNum">     195 </span>                :      *  @brief Private constructor for use by remote backend.
-<span class="lineNum">     196 </span>                :      *
-<span class="lineNum">     197 </span>                :      *  @param error_string_    Optional string describing error.  May be NULL.
-<span class="lineNum">     198 </span>                :      */
-<span class="lineNum">     199 </span>                :     AssertionError(const std::string &amp;msg_, const std::string &amp;context_, const char * error_string_)
-<span class="lineNum">     200 </span>                :         : LogicError(msg_, context_, &quot;AssertionError&quot;, error_string_) {}
-<span class="lineNum">     201 </span>                :     /** General purpose constructor which allows setting errno. */
-<span class="lineNum">     202 </span>                :     explicit AssertionError(const std::string &amp;msg_, const std::string &amp;context_ = &quot;&quot;, int errno_ = 0)
-<span class="lineNum">     203 </span>                :         : LogicError(msg_, context_, &quot;AssertionError&quot;, errno_) {}
-<span class="lineNum">     204 </span>                :     /** Construct from message and errno value. */
-<span class="lineNum">     205 </span>                :     AssertionError(const std::string &amp;msg_, int errno_)
-<span class="lineNum">     206 </span>                :         : LogicError(msg_, &quot;&quot;, &quot;AssertionError&quot;, errno_) {}
-<span class="lineNum">     207 </span>                :   protected:
-<span class="lineNum">     208 </span>                :     /** @private @internal
-<span class="lineNum">     209 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     210 </span>                :      */
-<span class="lineNum">     211 </span>                :     AssertionError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, const char * error_string_)
-<span class="lineNum">     212 </span>                :         : LogicError(msg_, context_, type_, error_string_) {}
-<span class="lineNum">     213 </span>                : 
-<span class="lineNum">     214 </span>                :     /** @private @internal
-<span class="lineNum">     215 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     216 </span>                :      */
-<span class="lineNum">     217 </span>                :     AssertionError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, int errno_)
-<span class="lineNum">     218 </span>                :         : LogicError(msg_, context_, type_, errno_) {}
-<span class="lineNum">     219 </span>                : };
-<span class="lineNum">     220 </span>                : 
-<span class="lineNum">     221 </span>                : /** InvalidArgumentError indicates an invalid parameter value was passed to the API.
-<span class="lineNum">     222 </span>                : */
-<span class="lineNum">     223 </span>                : class XAPIAN_VISIBILITY_DEFAULT InvalidArgumentError : public LogicError {
-<span class="lineNum">     224 </span>                :   public:
-<span class="lineNum">     225 </span>                :     /** @private @internal
-<span class="lineNum">     226 </span>                :      *  @brief Private constructor for use by remote backend.
-<span class="lineNum">     227 </span>                :      *
-<span class="lineNum">     228 </span>                :      *  @param error_string_    Optional string describing error.  May be NULL.
-<span class="lineNum">     229 </span>                :      */
-<span class="lineNum">     230 </span>                :     InvalidArgumentError(const std::string &amp;msg_, const std::string &amp;context_, const char * error_string_)
-<span class="lineNum">     231 </span>                :         : LogicError(msg_, context_, &quot;InvalidArgumentError&quot;, error_string_) {}
-<span class="lineNum">     232 </span>                :     /** General purpose constructor which allows setting errno. */
-<span class="lineNum">     233 </span>                :     explicit InvalidArgumentError(const std::string &amp;msg_, const std::string &amp;context_ = &quot;&quot;, int errno_ = 0)
-<span class="lineNum">     234 </span>                :         : LogicError(msg_, context_, &quot;InvalidArgumentError&quot;, errno_) {}
-<span class="lineNum">     235 </span>                :     /** Construct from message and errno value. */
-<span class="lineNum">     236 </span>                :     InvalidArgumentError(const std::string &amp;msg_, int errno_)
-<span class="lineNum">     237 </span>                :         : LogicError(msg_, &quot;&quot;, &quot;InvalidArgumentError&quot;, errno_) {}
-<span class="lineNum">     238 </span>                :   protected:
-<span class="lineNum">     239 </span>                :     /** @private @internal
-<span class="lineNum">     240 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     241 </span>                :      */
-<span class="lineNum">     242 </span>                :     InvalidArgumentError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, const char * error_string_)
-<span class="lineNum">     243 </span>                :         : LogicError(msg_, context_, type_, error_string_) {}
-<span class="lineNum">     244 </span>                : 
-<span class="lineNum">     245 </span>                :     /** @private @internal
-<span class="lineNum">     246 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     247 </span>                :      */
-<span class="lineNum">     248 </span>                :     InvalidArgumentError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, int errno_)
-<span class="lineNum">     249 </span>                :         : LogicError(msg_, context_, type_, errno_) {}
-<span class="lineNum">     250 </span>                : };
-<span class="lineNum">     251 </span>                : 
-<span class="lineNum">     252 </span>                : /** InvalidOperationError indicates the API was used in an invalid way.
-<span class="lineNum">     253 </span>                :  */
-<span class="lineNum">     254 </span>                : class XAPIAN_VISIBILITY_DEFAULT InvalidOperationError : public LogicError {
-<span class="lineNum">     255 </span>                :   public:
-<span class="lineNum">     256 </span>                :     /** @private @internal
-<span class="lineNum">     257 </span>                :      *  @brief Private constructor for use by remote backend.
-<span class="lineNum">     258 </span>                :      *
-<span class="lineNum">     259 </span>                :      *  @param error_string_    Optional string describing error.  May be NULL.
-<span class="lineNum">     260 </span>                :      */
-<span class="lineNum">     261 </span>                :     InvalidOperationError(const std::string &amp;msg_, const std::string &amp;context_, const char * error_string_)
-<span class="lineNum">     262 </span>                :         : LogicError(msg_, context_, &quot;InvalidOperationError&quot;, error_string_) {}
-<span class="lineNum">     263 </span>                :     /** General purpose constructor which allows setting errno. */
-<span class="lineNum">     264 </span>                :     explicit InvalidOperationError(const std::string &amp;msg_, const std::string &amp;context_ = &quot;&quot;, int errno_ = 0)
-<span class="lineNum">     265 </span>                :         : LogicError(msg_, context_, &quot;InvalidOperationError&quot;, errno_) {}
-<span class="lineNum">     266 </span>                :     /** Construct from message and errno value. */
-<span class="lineNum">     267 </span>                :     InvalidOperationError(const std::string &amp;msg_, int errno_)
-<span class="lineNum">     268 </span>                :         : LogicError(msg_, &quot;&quot;, &quot;InvalidOperationError&quot;, errno_) {}
-<span class="lineNum">     269 </span>                :   protected:
-<span class="lineNum">     270 </span>                :     /** @private @internal
-<span class="lineNum">     271 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     272 </span>                :      */
-<span class="lineNum">     273 </span>                :     InvalidOperationError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, const char * error_string_)
-<span class="lineNum">     274 </span>                :         : LogicError(msg_, context_, type_, error_string_) {}
-<span class="lineNum">     275 </span>                : 
-<span class="lineNum">     276 </span>                :     /** @private @internal
-<span class="lineNum">     277 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     278 </span>                :      */
-<span class="lineNum">     279 </span>                :     InvalidOperationError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, int errno_)
-<span class="lineNum">     280 </span>                :         : LogicError(msg_, context_, type_, errno_) {}
-<span class="lineNum">     281 </span>                : };
-<span class="lineNum">     282 </span>                : 
-<span class="lineNum">     283 </span>                : /** UnimplementedError indicates an attempt to use an unimplemented feature. */
-<span class="lineNum">     284 </span>                : class XAPIAN_VISIBILITY_DEFAULT UnimplementedError : public LogicError {
-<span class="lineNum">     285 </span>                :   public:
-<span class="lineNum">     286 </span>                :     /** @private @internal
-<span class="lineNum">     287 </span>                :      *  @brief Private constructor for use by remote backend.
-<span class="lineNum">     288 </span>                :      *
-<span class="lineNum">     289 </span>                :      *  @param error_string_    Optional string describing error.  May be NULL.
-<span class="lineNum">     290 </span>                :      */
-<span class="lineNum">     291 </span>                :     UnimplementedError(const std::string &amp;msg_, const std::string &amp;context_, const char * error_string_)
-<span class="lineNum">     292 </span>                :         : LogicError(msg_, context_, &quot;UnimplementedError&quot;, error_string_) {}
-<span class="lineNum">     293 </span>                :     /** General purpose constructor which allows setting errno. */
-<span class="lineNum">     294 </span>                :     explicit UnimplementedError(const std::string &amp;msg_, const std::string &amp;context_ = &quot;&quot;, int errno_ = 0)
-<span class="lineNum">     295 </span>                :         : LogicError(msg_, context_, &quot;UnimplementedError&quot;, errno_) {}
-<span class="lineNum">     296 </span>                :     /** Construct from message and errno value. */
-<span class="lineNum">     297 </span>                :     UnimplementedError(const std::string &amp;msg_, int errno_)
-<span class="lineNum">     298 </span>                :         : LogicError(msg_, &quot;&quot;, &quot;UnimplementedError&quot;, errno_) {}
-<span class="lineNum">     299 </span>                :   protected:
-<span class="lineNum">     300 </span>                :     /** @private @internal
-<span class="lineNum">     301 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     302 </span>                :      */
-<span class="lineNum">     303 </span>                :     UnimplementedError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, const char * error_string_)
-<span class="lineNum">     304 </span>                :         : LogicError(msg_, context_, type_, error_string_) {}
-<span class="lineNum">     305 </span>                : 
-<span class="lineNum">     306 </span>                :     /** @private @internal
-<span class="lineNum">     307 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     308 </span>                :      */
-<span class="lineNum">     309 </span>                :     UnimplementedError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, int errno_)
-<span class="lineNum">     310 </span>                :         : LogicError(msg_, context_, type_, errno_) {}
-<span class="lineNum">     311 </span>                : };
-<span class="lineNum">     312 </span>                : 
-<span class="lineNum">     313 </span>                : /** DatabaseError indicates some sort of database related error. */
-<span class="lineNum">     314 </span>                : class XAPIAN_VISIBILITY_DEFAULT DatabaseError : public RuntimeError {
-<span class="lineNum">     315 </span>                :   public:
-<span class="lineNum">     316 </span>                :     /** @private @internal
-<span class="lineNum">     317 </span>                :      *  @brief Private constructor for use by remote backend.
-<span class="lineNum">     318 </span>                :      *
-<span class="lineNum">     319 </span>                :      *  @param error_string_    Optional string describing error.  May be NULL.
-<span class="lineNum">     320 </span>                :      */
-<span class="lineNum">     321 </span>                :     DatabaseError(const std::string &amp;msg_, const std::string &amp;context_, const char * error_string_)
-<span class="lineNum">     322 </span>                :         : RuntimeError(msg_, context_, &quot;DatabaseError&quot;, error_string_) {}
-<span class="lineNum">     323 </span>                :     /** General purpose constructor which allows setting errno. */
-<span class="lineNum">     324 </span>                :     explicit DatabaseError(const std::string &amp;msg_, const std::string &amp;context_ = &quot;&quot;, int errno_ = 0)
-<span class="lineNum">     325 </span>                :         : RuntimeError(msg_, context_, &quot;DatabaseError&quot;, errno_) {}
-<span class="lineNum">     326 </span>                :     /** Construct from message and errno value. */
-<span class="lineNum">     327 </span>                :     DatabaseError(const std::string &amp;msg_, int errno_)
-<span class="lineNum">     328 </span>                :         : RuntimeError(msg_, &quot;&quot;, &quot;DatabaseError&quot;, errno_) {}
-<span class="lineNum">     329 </span>                :   protected:
-<span class="lineNum">     330 </span>                :     /** @private @internal
-<span class="lineNum">     331 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     332 </span>                :      */
-<span class="lineNum">     333 </span>                :     DatabaseError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, const char * error_string_)
-<span class="lineNum">     334 </span>                :         : RuntimeError(msg_, context_, type_, error_string_) {}
-<span class="lineNum">     335 </span>                : 
-<span class="lineNum">     336 </span>                :     /** @private @internal
-<span class="lineNum">     337 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     338 </span>                :      */
-<span class="lineNum">     339 </span>                :     DatabaseError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, int errno_)
-<span class="lineNum">     340 </span>                :         : RuntimeError(msg_, context_, type_, errno_) {}
-<span class="lineNum">     341 </span>                : };
-<span class="lineNum">     342 </span>                : 
-<span class="lineNum">     343 </span>                : /** DatabaseCorruptError indicates database corruption was detected. */
-<span class="lineNum">     344 </span>                : class XAPIAN_VISIBILITY_DEFAULT DatabaseCorruptError : public DatabaseError {
-<span class="lineNum">     345 </span>                :   public:
-<span class="lineNum">     346 </span>                :     /** @private @internal
-<span class="lineNum">     347 </span>                :      *  @brief Private constructor for use by remote backend.
-<span class="lineNum">     348 </span>                :      *
-<span class="lineNum">     349 </span>                :      *  @param error_string_    Optional string describing error.  May be NULL.
-<span class="lineNum">     350 </span>                :      */
-<span class="lineNum">     351 </span>                :     DatabaseCorruptError(const std::string &amp;msg_, const std::string &amp;context_, const char * error_string_)
-<span class="lineNum">     352 </span>                :         : DatabaseError(msg_, context_, &quot;DatabaseCorruptError&quot;, error_string_) {}
-<span class="lineNum">     353 </span>                :     /** General purpose constructor which allows setting errno. */
-<span class="lineNum">     354 </span>                :     explicit DatabaseCorruptError(const std::string &amp;msg_, const std::string &amp;context_ = &quot;&quot;, int errno_ = 0)
-<span class="lineNum">     355 </span>                :         : DatabaseError(msg_, context_, &quot;DatabaseCorruptError&quot;, errno_) {}
-<span class="lineNum">     356 </span>                :     /** Construct from message and errno value. */
-<span class="lineNum">     357 </span>                :     DatabaseCorruptError(const std::string &amp;msg_, int errno_)
-<span class="lineNum">     358 </span>                :         : DatabaseError(msg_, &quot;&quot;, &quot;DatabaseCorruptError&quot;, errno_) {}
-<span class="lineNum">     359 </span>                :   protected:
-<span class="lineNum">     360 </span>                :     /** @private @internal
-<span class="lineNum">     361 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     362 </span>                :      */
-<span class="lineNum">     363 </span>                :     DatabaseCorruptError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, const char * error_string_)
-<span class="lineNum">     364 </span>                :         : DatabaseError(msg_, context_, type_, error_string_) {}
-<span class="lineNum">     365 </span>                : 
-<span class="lineNum">     366 </span>                :     /** @private @internal
-<span class="lineNum">     367 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     368 </span>                :      */
-<span class="lineNum">     369 </span>                :     DatabaseCorruptError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, int errno_)
-<span class="lineNum">     370 </span>                :         : DatabaseError(msg_, context_, type_, errno_) {}
-<span class="lineNum">     371 </span>                : };
-<span class="lineNum">     372 </span>                : 
-<span class="lineNum">     373 </span>                : /** DatabaseCreateError indicates a failure to create a database. */
-<span class="lineNum">     374 </span>                : class XAPIAN_VISIBILITY_DEFAULT DatabaseCreateError : public DatabaseError {
-<span class="lineNum">     375 </span>                :   public:
-<span class="lineNum">     376 </span>                :     /** @private @internal
-<span class="lineNum">     377 </span>                :      *  @brief Private constructor for use by remote backend.
-<span class="lineNum">     378 </span>                :      *
-<span class="lineNum">     379 </span>                :      *  @param error_string_    Optional string describing error.  May be NULL.
-<span class="lineNum">     380 </span>                :      */
-<span class="lineNum">     381 </span>                :     DatabaseCreateError(const std::string &amp;msg_, const std::string &amp;context_, const char * error_string_)
-<span class="lineNum">     382 </span>                :         : DatabaseError(msg_, context_, &quot;DatabaseCreateError&quot;, error_string_) {}
-<span class="lineNum">     383 </span>                :     /** General purpose constructor which allows setting errno. */
-<span class="lineNum">     384 </span>                :     explicit DatabaseCreateError(const std::string &amp;msg_, const std::string &amp;context_ = &quot;&quot;, int errno_ = 0)
-<span class="lineNum">     385 </span>                :         : DatabaseError(msg_, context_, &quot;DatabaseCreateError&quot;, errno_) {}
-<span class="lineNum">     386 </span>                :     /** Construct from message and errno value. */
-<span class="lineNum">     387 </span>                :     DatabaseCreateError(const std::string &amp;msg_, int errno_)
-<span class="lineNum">     388 </span>                :         : DatabaseError(msg_, &quot;&quot;, &quot;DatabaseCreateError&quot;, errno_) {}
-<span class="lineNum">     389 </span>                :   protected:
-<span class="lineNum">     390 </span>                :     /** @private @internal
-<span class="lineNum">     391 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     392 </span>                :      */
-<span class="lineNum">     393 </span>                :     DatabaseCreateError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, const char * error_string_)
-<span class="lineNum">     394 </span>                :         : DatabaseError(msg_, context_, type_, error_string_) {}
-<span class="lineNum">     395 </span>                : 
-<span class="lineNum">     396 </span>                :     /** @private @internal
-<span class="lineNum">     397 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     398 </span>                :      */
-<span class="lineNum">     399 </span>                :     DatabaseCreateError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, int errno_)
-<span class="lineNum">     400 </span>                :         : DatabaseError(msg_, context_, type_, errno_) {}
-<span class="lineNum">     401 </span>                : };
-<span class="lineNum">     402 </span>                : 
-<span class="lineNum">     403 </span>                : /** DatabaseLockError indicates failure to lock a database. */
-<span class="lineNum">     404 </span>                : class XAPIAN_VISIBILITY_DEFAULT DatabaseLockError : public DatabaseError {
-<span class="lineNum">     405 </span>                :   public:
-<span class="lineNum">     406 </span>                :     /** @private @internal
-<span class="lineNum">     407 </span>                :      *  @brief Private constructor for use by remote backend.
-<span class="lineNum">     408 </span>                :      *
-<span class="lineNum">     409 </span>                :      *  @param error_string_    Optional string describing error.  May be NULL.
-<span class="lineNum">     410 </span>                :      */
-<span class="lineNum">     411 </span>                :     DatabaseLockError(const std::string &amp;msg_, const std::string &amp;context_, const char * error_string_)
-<span class="lineNum">     412 </span>                :         : DatabaseError(msg_, context_, &quot;DatabaseLockError&quot;, error_string_) {}
-<span class="lineNum">     413 </span>                :     /** General purpose constructor which allows setting errno. */
-<span class="lineNum">     414 </span>                :     explicit DatabaseLockError(const std::string &amp;msg_, const std::string &amp;context_ = &quot;&quot;, int errno_ = 0)
-<span class="lineNum">     415 </span>                :         : DatabaseError(msg_, context_, &quot;DatabaseLockError&quot;, errno_) {}
-<span class="lineNum">     416 </span>                :     /** Construct from message and errno value. */
-<span class="lineNum">     417 </span>                :     DatabaseLockError(const std::string &amp;msg_, int errno_)
-<span class="lineNum">     418 </span>                :         : DatabaseError(msg_, &quot;&quot;, &quot;DatabaseLockError&quot;, errno_) {}
-<span class="lineNum">     419 </span>                :   protected:
-<span class="lineNum">     420 </span>                :     /** @private @internal
-<span class="lineNum">     421 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     422 </span>                :      */
-<span class="lineNum">     423 </span>                :     DatabaseLockError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, const char * error_string_)
-<span class="lineNum">     424 </span>                :         : DatabaseError(msg_, context_, type_, error_string_) {}
-<span class="lineNum">     425 </span>                : 
-<span class="lineNum">     426 </span>                :     /** @private @internal
-<span class="lineNum">     427 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     428 </span>                :      */
-<span class="lineNum">     429 </span>                :     DatabaseLockError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, int errno_)
-<span class="lineNum">     430 </span>                :         : DatabaseError(msg_, context_, type_, errno_) {}
-<span class="lineNum">     431 </span>                : };
-<span class="lineNum">     432 </span>                : 
-<span class="lineNum">     433 </span>                : /** DatabaseModifiedError indicates a database was modified.
-<span class="lineNum">     434 </span>                :  *
-<span class="lineNum">     435 </span>                :  *  To recover after catching this error, you need to call
-<span class="lineNum">     436 </span>                :  *  Xapian::Database::reopen() on the Database and repeat the operation
-<span class="lineNum">     437 </span>                :  *  which failed.
-<span class="lineNum">     438 </span>                :  */
-<span class="lineNum">     439 </span>                : class XAPIAN_VISIBILITY_DEFAULT DatabaseModifiedError : public DatabaseError {
-<span class="lineNum">     440 </span>                :   public:
-<span class="lineNum">     441 </span>                :     /** @private @internal
-<span class="lineNum">     442 </span>                :      *  @brief Private constructor for use by remote backend.
-<span class="lineNum">     443 </span>                :      *
-<span class="lineNum">     444 </span>                :      *  @param error_string_    Optional string describing error.  May be NULL.
-<span class="lineNum">     445 </span>                :      */
-<span class="lineNum">     446 </span>                :     DatabaseModifiedError(const std::string &amp;msg_, const std::string &amp;context_, const char * error_string_)
-<span class="lineNum">     447 </span>                :         : DatabaseError(msg_, context_, &quot;DatabaseModifiedError&quot;, error_string_) {}
-<span class="lineNum">     448 </span>                :     /** General purpose constructor which allows setting errno. */
-<span class="lineNum">     449 </span>                :     explicit DatabaseModifiedError(const std::string &amp;msg_, const std::string &amp;context_ = &quot;&quot;, int errno_ = 0)
-<span class="lineNum">     450 </span>                :         : DatabaseError(msg_, context_, &quot;DatabaseModifiedError&quot;, errno_) {}
-<span class="lineNum">     451 </span>                :     /** Construct from message and errno value. */
-<span class="lineNum">     452 </span>                :     DatabaseModifiedError(const std::string &amp;msg_, int errno_)
-<span class="lineNum">     453 </span>                :         : DatabaseError(msg_, &quot;&quot;, &quot;DatabaseModifiedError&quot;, errno_) {}
-<span class="lineNum">     454 </span>                :   protected:
-<span class="lineNum">     455 </span>                :     /** @private @internal
-<span class="lineNum">     456 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     457 </span>                :      */
-<span class="lineNum">     458 </span>                :     DatabaseModifiedError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, const char * error_string_)
-<span class="lineNum">     459 </span>                :         : DatabaseError(msg_, context_, type_, error_string_) {}
-<span class="lineNum">     460 </span>                : 
-<span class="lineNum">     461 </span>                :     /** @private @internal
-<span class="lineNum">     462 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     463 </span>                :      */
-<span class="lineNum">     464 </span>                :     DatabaseModifiedError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, int errno_)
-<span class="lineNum">     465 </span>                :         : DatabaseError(msg_, context_, type_, errno_) {}
-<span class="lineNum">     466 </span>                : };
-<span class="lineNum">     467 </span>                : 
-<span class="lineNum">     468 </span>                : /** DatabaseOpeningError indicates failure to open a database. */
-<span class="lineNum">     469 </span>                : class XAPIAN_VISIBILITY_DEFAULT DatabaseOpeningError : public DatabaseError {
-<span class="lineNum">     470 </span>                :   public:
-<span class="lineNum">     471 </span>                :     /** @private @internal
-<span class="lineNum">     472 </span>                :      *  @brief Private constructor for use by remote backend.
-<span class="lineNum">     473 </span>                :      *
-<span class="lineNum">     474 </span>                :      *  @param error_string_    Optional string describing error.  May be NULL.
-<span class="lineNum">     475 </span>                :      */
-<span class="lineNum">     476 </span>                :     DatabaseOpeningError(const std::string &amp;msg_, const std::string &amp;context_, const char * error_string_)
-<span class="lineNum">     477 </span>                :         : DatabaseError(msg_, context_, &quot;DatabaseOpeningError&quot;, error_string_) {}
-<span class="lineNum">     478 </span>                :     /** General purpose constructor which allows setting errno. */
-<span class="lineNum">     479 </span>                :     explicit DatabaseOpeningError(const std::string &amp;msg_, const std::string &amp;context_ = &quot;&quot;, int errno_ = 0)
-<span class="lineNum">     480 </span>                :         : DatabaseError(msg_, context_, &quot;DatabaseOpeningError&quot;, errno_) {}
-<span class="lineNum">     481 </span>                :     /** Construct from message and errno value. */
-<span class="lineNum">     482 </span>                :     DatabaseOpeningError(const std::string &amp;msg_, int errno_)
-<span class="lineNum">     483 </span>                :         : DatabaseError(msg_, &quot;&quot;, &quot;DatabaseOpeningError&quot;, errno_) {}
-<span class="lineNum">     484 </span>                :   protected:
-<span class="lineNum">     485 </span>                :     /** @private @internal
-<span class="lineNum">     486 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     487 </span>                :      */
-<span class="lineNum">     488 </span>                :     DatabaseOpeningError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, const char * error_string_)
-<span class="lineNum">     489 </span>                :         : DatabaseError(msg_, context_, type_, error_string_) {}
-<span class="lineNum">     490 </span>                : 
-<span class="lineNum">     491 </span>                :     /** @private @internal
-<span class="lineNum">     492 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     493 </span>                :      */
-<span class="lineNum">     494 </span>                :     DatabaseOpeningError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, int errno_)
-<span class="lineNum">     495 </span>                :         : DatabaseError(msg_, context_, type_, errno_) {}
-<span class="lineNum">     496 </span>                : };
-<span class="lineNum">     497 </span>                : 
-<span class="lineNum">     498 </span>                : /** DatabaseVersionError indicates that a database is in an unsupported format.
-<span class="lineNum">     499 </span>                :  *
-<span class="lineNum">     500 </span>                :  *  From time to time, new versions of Xapian will require the database format
-<span class="lineNum">     501 </span>                :  *  to be changed, to allow new information to be stored or new optimisations
-<span class="lineNum">     502 </span>                :  *  to be performed.  Backwards compatibility will sometimes be maintained, so
-<span class="lineNum">     503 </span>                :  *  that new versions of Xapian can open old databases, but in some cases
-<span class="lineNum">     504 </span>                :  *  Xapian will be unable to open a database because it is in too old (or new)
-<span class="lineNum">     505 </span>                :  *  a format.  This can be resolved either be upgrading or downgrading the
-<span class="lineNum">     506 </span>                :  *  version of Xapian in use, or by rebuilding the database from scratch with
-<span class="lineNum">     507 </span>                :  *  the current version of Xapian.
-<span class="lineNum">     508 </span>                :  */
-<span class="lineNum">     509 </span>                : class XAPIAN_VISIBILITY_DEFAULT DatabaseVersionError : public DatabaseOpeningError {
-<span class="lineNum">     510 </span>                :   public:
-<span class="lineNum">     511 </span>                :     /** @private @internal
-<span class="lineNum">     512 </span>                :      *  @brief Private constructor for use by remote backend.
-<span class="lineNum">     513 </span>                :      *
-<span class="lineNum">     514 </span>                :      *  @param error_string_    Optional string describing error.  May be NULL.
-<span class="lineNum">     515 </span>                :      */
-<span class="lineNum">     516 </span>                :     DatabaseVersionError(const std::string &amp;msg_, const std::string &amp;context_, const char * error_string_)
-<span class="lineNum">     517 </span>                :         : DatabaseOpeningError(msg_, context_, &quot;DatabaseVersionError&quot;, error_string_) {}
-<span class="lineNum">     518 </span>                :     /** General purpose constructor which allows setting errno. */
-<span class="lineNum">     519 </span>                :     explicit DatabaseVersionError(const std::string &amp;msg_, const std::string &amp;context_ = &quot;&quot;, int errno_ = 0)
-<span class="lineNum">     520 </span>                :         : DatabaseOpeningError(msg_, context_, &quot;DatabaseVersionError&quot;, errno_) {}
-<span class="lineNum">     521 </span>                :     /** Construct from message and errno value. */
-<span class="lineNum">     522 </span>                :     DatabaseVersionError(const std::string &amp;msg_, int errno_)
-<span class="lineNum">     523 </span>                :         : DatabaseOpeningError(msg_, &quot;&quot;, &quot;DatabaseVersionError&quot;, errno_) {}
-<span class="lineNum">     524 </span>                :   protected:
-<span class="lineNum">     525 </span>                :     /** @private @internal
-<span class="lineNum">     526 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     527 </span>                :      */
-<span class="lineNum">     528 </span>                :     DatabaseVersionError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, const char * error_string_)
-<span class="lineNum">     529 </span>                :         : DatabaseOpeningError(msg_, context_, type_, error_string_) {}
-<span class="lineNum">     530 </span>                : 
-<span class="lineNum">     531 </span>                :     /** @private @internal
-<span class="lineNum">     532 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     533 </span>                :      */
-<span class="lineNum">     534 </span>                :     DatabaseVersionError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, int errno_)
-<span class="lineNum">     535 </span>                :         : DatabaseOpeningError(msg_, context_, type_, errno_) {}
-<span class="lineNum">     536 </span>                : };
-<span class="lineNum">     537 </span>                : 
-<span class="lineNum">     538 </span>                : /** Indicates an attempt to access a document not present in the database. */
-<span class="lineNum">     539 </span>                : class XAPIAN_VISIBILITY_DEFAULT DocNotFoundError : public RuntimeError {
-<span class="lineNum">     540 </span>                :   public:
-<span class="lineNum">     541 </span>                :     /** @private @internal
-<span class="lineNum">     542 </span>                :      *  @brief Private constructor for use by remote backend.
-<span class="lineNum">     543 </span>                :      *
-<span class="lineNum">     544 </span>                :      *  @param error_string_    Optional string describing error.  May be NULL.
-<span class="lineNum">     545 </span>                :      */
-<span class="lineNum">     546 </span>                :     DocNotFoundError(const std::string &amp;msg_, const std::string &amp;context_, const char * error_string_)
-<span class="lineNum">     547 </span>                :         : RuntimeError(msg_, context_, &quot;DocNotFoundError&quot;, error_string_) {}
-<span class="lineNum">     548 </span>                :     /** General purpose constructor which allows setting errno. */
-<span class="lineNum">     549 </span>                :     explicit DocNotFoundError(const std::string &amp;msg_, const std::string &amp;context_ = &quot;&quot;, int errno_ = 0)
-<span class="lineNum">     550 </span>                :         : RuntimeError(msg_, context_, &quot;DocNotFoundError&quot;, errno_) {}
-<span class="lineNum">     551 </span>                :     /** Construct from message and errno value. */
-<span class="lineNum">     552 </span>                :     DocNotFoundError(const std::string &amp;msg_, int errno_)
-<span class="lineNum">     553 </span>                :         : RuntimeError(msg_, &quot;&quot;, &quot;DocNotFoundError&quot;, errno_) {}
-<span class="lineNum">     554 </span>                :   protected:
-<span class="lineNum">     555 </span>                :     /** @private @internal
-<span class="lineNum">     556 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     557 </span>                :      */
-<span class="lineNum">     558 </span>                :     DocNotFoundError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, const char * error_string_)
-<span class="lineNum">     559 </span>                :         : RuntimeError(msg_, context_, type_, error_string_) {}
-<span class="lineNum">     560 </span>                : 
-<span class="lineNum">     561 </span>                :     /** @private @internal
-<span class="lineNum">     562 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     563 </span>                :      */
-<span class="lineNum">     564 </span>                :     DocNotFoundError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, int errno_)
-<span class="lineNum">     565 </span>                :         : RuntimeError(msg_, context_, type_, errno_) {}
-<span class="lineNum">     566 </span>                : };
-<span class="lineNum">     567 </span>                : 
-<span class="lineNum">     568 </span>                : /** Indicates an attempt to use a feature which is unavailable.
-<span class="lineNum">     569 </span>                :  *
-<span class="lineNum">     570 </span>                :  *  Typically a feature is unavailable because it wasn't compiled in, or
-<span class="lineNum">     571 </span>                :  *  because it requires other software or facilities which aren't available.
-<span class="lineNum">     572 </span>                :  */
-<span class="lineNum">     573 </span>                : class XAPIAN_VISIBILITY_DEFAULT FeatureUnavailableError : public RuntimeError {
-<span class="lineNum">     574 </span>                :   public:
-<span class="lineNum">     575 </span>                :     /** @private @internal
-<span class="lineNum">     576 </span>                :      *  @brief Private constructor for use by remote backend.
-<span class="lineNum">     577 </span>                :      *
-<span class="lineNum">     578 </span>                :      *  @param error_string_    Optional string describing error.  May be NULL.
-<span class="lineNum">     579 </span>                :      */
-<span class="lineNum">     580 </span>                :     FeatureUnavailableError(const std::string &amp;msg_, const std::string &amp;context_, const char * error_string_)
-<span class="lineNum">     581 </span>                :         : RuntimeError(msg_, context_, &quot;FeatureUnavailableError&quot;, error_string_) {}
-<span class="lineNum">     582 </span>                :     /** General purpose constructor which allows setting errno. */
-<span class="lineNum">     583 </span>                :     explicit FeatureUnavailableError(const std::string &amp;msg_, const std::string &amp;context_ = &quot;&quot;, int errno_ = 0)
-<span class="lineNum">     584 </span>                :         : RuntimeError(msg_, context_, &quot;FeatureUnavailableError&quot;, errno_) {}
-<span class="lineNum">     585 </span>                :     /** Construct from message and errno value. */
-<span class="lineNum">     586 </span>                :     FeatureUnavailableError(const std::string &amp;msg_, int errno_)
-<span class="lineNum">     587 </span>                :         : RuntimeError(msg_, &quot;&quot;, &quot;FeatureUnavailableError&quot;, errno_) {}
-<span class="lineNum">     588 </span>                :   protected:
-<span class="lineNum">     589 </span>                :     /** @private @internal
-<span class="lineNum">     590 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     591 </span>                :      */
-<span class="lineNum">     592 </span>                :     FeatureUnavailableError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, const char * error_string_)
-<span class="lineNum">     593 </span>                :         : RuntimeError(msg_, context_, type_, error_string_) {}
-<span class="lineNum">     594 </span>                : 
-<span class="lineNum">     595 </span>                :     /** @private @internal
-<span class="lineNum">     596 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     597 </span>                :      */
-<span class="lineNum">     598 </span>                :     FeatureUnavailableError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, int errno_)
-<span class="lineNum">     599 </span>                :         : RuntimeError(msg_, context_, type_, errno_) {}
-<span class="lineNum">     600 </span>                : };
-<span class="lineNum">     601 </span>                : 
-<span class="lineNum">     602 </span>                : /** InternalError indicates a runtime problem of some sort. */
-<span class="lineNum">     603 </span>                : class XAPIAN_VISIBILITY_DEFAULT InternalError : public RuntimeError {
-<span class="lineNum">     604 </span>                :   public:
-<span class="lineNum">     605 </span>                :     /** @private @internal
-<span class="lineNum">     606 </span>                :      *  @brief Private constructor for use by remote backend.
-<span class="lineNum">     607 </span>                :      *
-<span class="lineNum">     608 </span>                :      *  @param error_string_    Optional string describing error.  May be NULL.
-<span class="lineNum">     609 </span>                :      */
-<span class="lineNum">     610 </span>                :     InternalError(const std::string &amp;msg_, const std::string &amp;context_, const char * error_string_)
-<span class="lineNum">     611 </span>                :         : RuntimeError(msg_, context_, &quot;InternalError&quot;, error_string_) {}
-<span class="lineNum">     612 </span>                :     /** General purpose constructor which allows setting errno. */
-<span class="lineNum">     613 </span>                :     explicit InternalError(const std::string &amp;msg_, const std::string &amp;context_ = &quot;&quot;, int errno_ = 0)
-<span class="lineNum">     614 </span>                :         : RuntimeError(msg_, context_, &quot;InternalError&quot;, errno_) {}
-<span class="lineNum">     615 </span>                :     /** Construct from message and errno value. */
-<span class="lineNum">     616 </span>                :     InternalError(const std::string &amp;msg_, int errno_)
-<span class="lineNum">     617 </span>                :         : RuntimeError(msg_, &quot;&quot;, &quot;InternalError&quot;, errno_) {}
-<span class="lineNum">     618 </span>                :   protected:
-<span class="lineNum">     619 </span>                :     /** @private @internal
-<span class="lineNum">     620 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     621 </span>                :      */
-<span class="lineNum">     622 </span>                :     InternalError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, const char * error_string_)
-<span class="lineNum">     623 </span>                :         : RuntimeError(msg_, context_, type_, error_string_) {}
-<span class="lineNum">     624 </span>                : 
-<span class="lineNum">     625 </span>                :     /** @private @internal
-<span class="lineNum">     626 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     627 </span>                :      */
-<span class="lineNum">     628 </span>                :     InternalError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, int errno_)
-<span class="lineNum">     629 </span>                :         : RuntimeError(msg_, context_, type_, errno_) {}
-<span class="lineNum">     630 </span>                : };
-<span class="lineNum">     631 </span>                : 
-<span class="lineNum">     632 </span>                : /** Indicates a problem communicating with a remote database. */
-<span class="lineNum">     633 </span>                : class XAPIAN_VISIBILITY_DEFAULT NetworkError : public RuntimeError {
-<span class="lineNum">     634 </span>                :   public:
-<span class="lineNum">     635 </span>                :     /** @private @internal
-<span class="lineNum">     636 </span>                :      *  @brief Private constructor for use by remote backend.
-<span class="lineNum">     637 </span>                :      *
-<span class="lineNum">     638 </span>                :      *  @param error_string_    Optional string describing error.  May be NULL.
-<span class="lineNum">     639 </span>                :      */
-<span class="lineNum">     640 </span>                :     NetworkError(const std::string &amp;msg_, const std::string &amp;context_, const char * error_string_)
-<span class="lineNum">     641 </span>                :         : RuntimeError(msg_, context_, &quot;NetworkError&quot;, error_string_) {}
-<span class="lineNum">     642 </span>                :     /** General purpose constructor which allows setting errno. */
-<span class="lineNum">     643 </span>                :     explicit NetworkError(const std::string &amp;msg_, const std::string &amp;context_ = &quot;&quot;, int errno_ = 0)
-<span class="lineNum">     644 </span>                :         : RuntimeError(msg_, context_, &quot;NetworkError&quot;, errno_) {}
-<span class="lineNum">     645 </span>                :     /** Construct from message and errno value. */
-<span class="lineNum">     646 </span>                :     NetworkError(const std::string &amp;msg_, int errno_)
-<span class="lineNum">     647 </span>                :         : RuntimeError(msg_, &quot;&quot;, &quot;NetworkError&quot;, errno_) {}
-<span class="lineNum">     648 </span>                :   protected:
-<span class="lineNum">     649 </span>                :     /** @private @internal
-<span class="lineNum">     650 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     651 </span>                :      */
-<span class="lineNum">     652 </span>                :     NetworkError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, const char * error_string_)
-<span class="lineNum">     653 </span>                :         : RuntimeError(msg_, context_, type_, error_string_) {}
-<span class="lineNum">     654 </span>                : 
-<span class="lineNum">     655 </span>                :     /** @private @internal
-<span class="lineNum">     656 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     657 </span>                :      */
-<span class="lineNum">     658 </span>                :     NetworkError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, int errno_)
-<span class="lineNum">     659 </span>                :         : RuntimeError(msg_, context_, type_, errno_) {}
-<span class="lineNum">     660 </span>                : };
-<span class="lineNum">     661 </span>                : 
-<span class="lineNum">     662 </span>                : /** Indicates a timeout expired while communicating with a remote database. */
-<span class="lineNum">     663 </span>                : class XAPIAN_VISIBILITY_DEFAULT NetworkTimeoutError : public NetworkError {
-<span class="lineNum">     664 </span>                :   public:
-<span class="lineNum">     665 </span>                :     /** @private @internal
-<span class="lineNum">     666 </span>                :      *  @brief Private constructor for use by remote backend.
-<span class="lineNum">     667 </span>                :      *
-<span class="lineNum">     668 </span>                :      *  @param error_string_    Optional string describing error.  May be NULL.
-<span class="lineNum">     669 </span>                :      */
-<span class="lineNum">     670 </span>                :     NetworkTimeoutError(const std::string &amp;msg_, const std::string &amp;context_, const char * error_string_)
-<span class="lineNum">     671 </span>                :         : NetworkError(msg_, context_, &quot;NetworkTimeoutError&quot;, error_string_) {}
-<span class="lineNum">     672 </span>                :     /** General purpose constructor which allows setting errno. */
-<span class="lineNum">     673 </span>                :     explicit NetworkTimeoutError(const std::string &amp;msg_, const std::string &amp;context_ = &quot;&quot;, int errno_ = 0)
-<span class="lineNum">     674 </span>                :         : NetworkError(msg_, context_, &quot;NetworkTimeoutError&quot;, errno_) {}
-<span class="lineNum">     675 </span>                :     /** Construct from message and errno value. */
-<span class="lineNum">     676 </span>                :     NetworkTimeoutError(const std::string &amp;msg_, int errno_)
-<span class="lineNum">     677 </span>                :         : NetworkError(msg_, &quot;&quot;, &quot;NetworkTimeoutError&quot;, errno_) {}
-<span class="lineNum">     678 </span>                :   protected:
-<span class="lineNum">     679 </span>                :     /** @private @internal
-<span class="lineNum">     680 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     681 </span>                :      */
-<span class="lineNum">     682 </span>                :     NetworkTimeoutError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, const char * error_string_)
-<span class="lineNum">     683 </span>                :         : NetworkError(msg_, context_, type_, error_string_) {}
-<span class="lineNum">     684 </span>                : 
-<span class="lineNum">     685 </span>                :     /** @private @internal
-<span class="lineNum">     686 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     687 </span>                :      */
-<span class="lineNum">     688 </span>                :     NetworkTimeoutError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, int errno_)
-<span class="lineNum">     689 </span>                :         : NetworkError(msg_, context_, type_, errno_) {}
-<span class="lineNum">     690 </span>                : };
-<span class="lineNum">     691 </span>                : 
-<span class="lineNum">     692 </span>                : /** Indicates a query string can't be parsed. */
-<span class="lineNum">     693 </span>                : class XAPIAN_VISIBILITY_DEFAULT QueryParserError : public RuntimeError {
-<span class="lineNum">     694 </span>                :   public:
-<span class="lineNum">     695 </span>                :     /** @private @internal
-<span class="lineNum">     696 </span>                :      *  @brief Private constructor for use by remote backend.
-<span class="lineNum">     697 </span>                :      *
-<span class="lineNum">     698 </span>                :      *  @param error_string_    Optional string describing error.  May be NULL.
-<span class="lineNum">     699 </span>                :      */
-<span class="lineNum">     700 </span>                :     QueryParserError(const std::string &amp;msg_, const std::string &amp;context_, const char * error_string_)
-<span class="lineNum">     701 </span>                :         : RuntimeError(msg_, context_, &quot;QueryParserError&quot;, error_string_) {}
-<span class="lineNum">     702 </span>                :     /** General purpose constructor which allows setting errno. */
-<span class="lineNum">     703 </span>                :     explicit QueryParserError(const std::string &amp;msg_, const std::string &amp;context_ = &quot;&quot;, int errno_ = 0)
-<span class="lineNum">     704 </span>                :         : RuntimeError(msg_, context_, &quot;QueryParserError&quot;, errno_) {}
-<span class="lineNum">     705 </span>                :     /** Construct from message and errno value. */
-<span class="lineNum">     706 </span>                :     QueryParserError(const std::string &amp;msg_, int errno_)
-<span class="lineNum">     707 </span>                :         : RuntimeError(msg_, &quot;&quot;, &quot;QueryParserError&quot;, errno_) {}
-<span class="lineNum">     708 </span>                :   protected:
-<span class="lineNum">     709 </span>                :     /** @private @internal
-<span class="lineNum">     710 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     711 </span>                :      */
-<span class="lineNum">     712 </span>                :     QueryParserError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, const char * error_string_)
-<span class="lineNum">     713 </span>                :         : RuntimeError(msg_, context_, type_, error_string_) {}
-<span class="lineNum">     714 </span>                : 
-<span class="lineNum">     715 </span>                :     /** @private @internal
-<span class="lineNum">     716 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     717 </span>                :      */
-<span class="lineNum">     718 </span>                :     QueryParserError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, int errno_)
-<span class="lineNum">     719 </span>                :         : RuntimeError(msg_, context_, type_, errno_) {}
-<span class="lineNum">     720 </span>                : };
-<span class="lineNum">     721 </span>                : 
-<span class="lineNum">     722 </span>                : /** RangeError indicates an attempt to access outside the bounds of a container.
-<span class="lineNum">     723 </span>                :  */
-<span class="lineNum">     724 </span>                : class XAPIAN_VISIBILITY_DEFAULT RangeError : public RuntimeError {
-<span class="lineNum">     725 </span>                :   public:
-<span class="lineNum">     726 </span>                :     /** @private @internal
-<span class="lineNum">     727 </span>                :      *  @brief Private constructor for use by remote backend.
-<span class="lineNum">     728 </span>                :      *
-<span class="lineNum">     729 </span>                :      *  @param error_string_    Optional string describing error.  May be NULL.
-<span class="lineNum">     730 </span>                :      */
-<span class="lineNum">     731 </span>                :     RangeError(const std::string &amp;msg_, const std::string &amp;context_, const char * error_string_)
-<span class="lineNum">     732 </span>                :         : RuntimeError(msg_, context_, &quot;RangeError&quot;, error_string_) {}
-<span class="lineNum">     733 </span>                :     /** General purpose constructor which allows setting errno. */
-<span class="lineNum">     734 </span>                :     explicit RangeError(const std::string &amp;msg_, const std::string &amp;context_ = &quot;&quot;, int errno_ = 0)
-<span class="lineNum">     735 </span>                :         : RuntimeError(msg_, context_, &quot;RangeError&quot;, errno_) {}
-<span class="lineNum">     736 </span>                :     /** Construct from message and errno value. */
-<span class="lineNum">     737 </span>                :     RangeError(const std::string &amp;msg_, int errno_)
-<span class="lineNum">     738 </span>                :         : RuntimeError(msg_, &quot;&quot;, &quot;RangeError&quot;, errno_) {}
-<span class="lineNum">     739 </span>                :   protected:
-<span class="lineNum">     740 </span>                :     /** @private @internal
-<span class="lineNum">     741 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     742 </span>                :      */
-<span class="lineNum">     743 </span>                :     RangeError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, const char * error_string_)
-<span class="lineNum">     744 </span>                :         : RuntimeError(msg_, context_, type_, error_string_) {}
-<span class="lineNum">     745 </span>                : 
-<span class="lineNum">     746 </span>                :     /** @private @internal
-<span class="lineNum">     747 </span>                :      *  @brief Constructor for use by constructors of derived classes.
-<span class="lineNum">     748 </span>                :      */
-<span class="lineNum">     749 </span>                :     RangeError(const std::string &amp;msg_, const std::string &amp;context_, const char * type_, int errno_)
-<span class="lineNum">     750 </span>                :         : RuntimeError(msg_, context_, type_, errno_) {}
-<span class="lineNum">     751 </span>                : };
-<span class="lineNum">     752 </span>                : 
-<span class="lineNum">     753 </span>                : }
-<span class="lineNum">     754 </span>                : 
-<span class="lineNum">     755 </span>                : #endif /* XAPIAN_INCLUDED_ERROR_H */
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/xapian/expanddecider.h.gcov.html b/rep/usr/include/xapian/expanddecider.h.gcov.html
deleted file mode 100644
index fabaa14..0000000
--- a/rep/usr/include/xapian/expanddecider.h.gcov.html
+++ /dev/null
@@ -1,155 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/xapian/expanddecider.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/xapian</a> - expanddecider.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">1</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">1</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /** @file expanddecider.h
-<span class="lineNum">       2 </span>                :  * @brief Allow rejection of terms during ESet generation.
-<span class="lineNum">       3 </span>                :  */
-<span class="lineNum">       4 </span>                : /* Copyright (C) 2007 Olly Betts
-<span class="lineNum">       5 </span>                :  *
-<span class="lineNum">       6 </span>                :  * This program is free software; you can redistribute it and/or
-<span class="lineNum">       7 </span>                :  * modify it under the terms of the GNU General Public License as
-<span class="lineNum">       8 </span>                :  * published by the Free Software Foundation; either version 2 of the
-<span class="lineNum">       9 </span>                :  * License, or (at your option) any later version.
-<span class="lineNum">      10 </span>                :  *
-<span class="lineNum">      11 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      12 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      13 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      14 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      15 </span>                :  *
-<span class="lineNum">      16 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      17 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      18 </span>                :  * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
-<span class="lineNum">      19 </span>                :  */
-<span class="lineNum">      20 </span>                : 
-<span class="lineNum">      21 </span>                : #ifndef XAPIAN_INCLUDED_EXPANDDECIDER_H
-<span class="lineNum">      22 </span>                : #define XAPIAN_INCLUDED_EXPANDDECIDER_H
-<span class="lineNum">      23 </span>                : 
-<span class="lineNum">      24 </span>                : #include &lt;set&gt;
-<span class="lineNum">      25 </span>                : #include &lt;string&gt;
-<span class="lineNum">      26 </span>                : 
-<span class="lineNum">      27 </span>                : #include &lt;xapian/visibility.h&gt;
-<span class="lineNum">      28 </span>                : 
-<span class="lineNum">      29 </span>                : namespace Xapian {
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : /** Virtual base class for expand decider functor. */
-<span class="lineNum">      32 </span><span class="lineCov">              5 : class XAPIAN_VISIBILITY_DEFAULT ExpandDecider {</span>
-<span class="lineNum">      33 </span>                :   public:
-<span class="lineNum">      34 </span>                :     /** Do we want this term in the ESet? */
-<span class="lineNum">      35 </span>                :     virtual bool operator()(const std::string &amp;term) const = 0;
-<span class="lineNum">      36 </span>                : 
-<span class="lineNum">      37 </span>                :     /** Virtual destructor, because we have virtual methods. */
-<span class="lineNum">      38 </span>                :     virtual ~ExpandDecider();
-<span class="lineNum">      39 </span>                : };
-<span class="lineNum">      40 </span>                : 
-<span class="lineNum">      41 </span>                : /** ExpandDecider subclass which rejects terms using two ExpandDeciders.
-<span class="lineNum">      42 </span>                :  *
-<span class="lineNum">      43 </span>                :  *  Terms are only accepted if they are accepted by both of the specified
-<span class="lineNum">      44 </span>                :  *  ExpandDecider objects.
-<span class="lineNum">      45 </span>                :  */
-<span class="lineNum">      46 </span>                : class XAPIAN_VISIBILITY_DEFAULT ExpandDeciderAnd : public ExpandDecider {
-<span class="lineNum">      47 </span>                :     const ExpandDecider &amp;first, &amp;second;
-<span class="lineNum">      48 </span>                : 
-<span class="lineNum">      49 </span>                :   public:
-<span class="lineNum">      50 </span>                :     /** Terms will be checked with @a first, and if accepted, then checked
-<span class="lineNum">      51 </span>                :      *  with @a second.
-<span class="lineNum">      52 </span>                :      */
-<span class="lineNum">      53 </span>                :     ExpandDeciderAnd(const ExpandDecider &amp;first_,
-<span class="lineNum">      54 </span>                :                      const ExpandDecider &amp;second_)
-<span class="lineNum">      55 </span>                :         : first(first_), second(second_) { }
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span>                :     /** Compatibility method. */
-<span class="lineNum">      58 </span>                :     ExpandDeciderAnd(const ExpandDecider *first_,
-<span class="lineNum">      59 </span>                :                      const ExpandDecider *second_)
-<span class="lineNum">      60 </span>                :         : first(*first_), second(*second_) { }
-<span class="lineNum">      61 </span>                : 
-<span class="lineNum">      62 </span>                :     virtual bool operator()(const std::string &amp;term) const;
-<span class="lineNum">      63 </span>                : };
-<span class="lineNum">      64 </span>                : 
-<span class="lineNum">      65 </span>                : /** ExpandDecider subclass which rejects terms in a specified list.
-<span class="lineNum">      66 </span>                :  *
-<span class="lineNum">      67 </span>                :  *  ExpandDeciderFilterTerms provides an easy way to filter out terms from
-<span class="lineNum">      68 </span>                :  *  a fixed list when generating an ESet.
-<span class="lineNum">      69 </span>                :  */
-<span class="lineNum">      70 </span>                : class XAPIAN_VISIBILITY_DEFAULT ExpandDeciderFilterTerms : public ExpandDecider {
-<span class="lineNum">      71 </span>                :     std::set&lt;std::string&gt; rejects;
-<span class="lineNum">      72 </span>                : 
-<span class="lineNum">      73 </span>                :   public:
-<span class="lineNum">      74 </span>                :     /** The two iterators specify a list of terms to be rejected.
-<span class="lineNum">      75 </span>                :      *
-<span class="lineNum">      76 </span>                :      *  @a reject_begin and @a reject_end can be any input_iterator type
-<span class="lineNum">      77 </span>                :      *  which returns std::string or char * (e.g. TermIterator or char **).
-<span class="lineNum">      78 </span>                :      */
-<span class="lineNum">      79 </span>                :     template &lt;class Iterator&gt;
-<span class="lineNum">      80 </span>                :     ExpandDeciderFilterTerms(Iterator reject_begin, Iterator reject_end)
-<span class="lineNum">      81 </span>                :         : rejects(reject_begin, reject_end) { }
-<span class="lineNum">      82 </span>                : 
-<span class="lineNum">      83 </span>                :     virtual bool operator()(const std::string &amp;term) const;
-<span class="lineNum">      84 </span>                : };
-<span class="lineNum">      85 </span>                : 
-<span class="lineNum">      86 </span>                : }
-<span class="lineNum">      87 </span>                : 
-<span class="lineNum">      88 </span>                : #endif // XAPIAN_INCLUDED_EXPANDDECIDER_H
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/xapian/index.html b/rep/usr/include/xapian/index.html
deleted file mode 100644
index fbdbd2c..0000000
--- a/rep/usr/include/xapian/index.html
+++ /dev/null
@@ -1,173 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/xapian</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - /usr/include/xapian</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">77</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">76.6 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">59</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <center>
-  <table width="80%" cellpadding=2 cellspacing=1 border=0>
-
-    <tr>
-      <td width="50%"><br></td>
-      <td width="15%"></td>
-      <td width="15%"></td>
-      <td width="20%"></td>
-    </tr>
-
-    <tr>
-      <td class="tableHead">Filename</td>
-      <td class="tableHead" colspan=3>Coverage</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="base.h.gcov.html">base.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../amber.png" width=45 height=10 alt="45.5%"><img src="../../../snow.png" width=55 height=10 alt="45.5%"></td></tr></table>
-      </td>
-      <td class="coverPerMed">45.5&nbsp;%</td>
-      <td class="coverNumMed">5&nbsp;/&nbsp;11&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="database.h.gcov.html">database.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">4&nbsp;/&nbsp;4&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="document.h.gcov.html">document.h</a></td>
-      <td class="coverBar" align="center">
-                <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../snow.png" width=100 height=10 alt="0.0%"></td></tr></table>
-      </td>
-      <td class="coverPerLo">0.0&nbsp;%</td>
-      <td class="coverNumLo">0&nbsp;/&nbsp;2&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="enquire.h.gcov.html">enquire.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=90 height=10 alt="89.7%"><img src="../../../snow.png" width=10 height=10 alt="89.7%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">89.7&nbsp;%</td>
-      <td class="coverNumHi">26&nbsp;/&nbsp;29&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="error.h.gcov.html">error.h</a></td>
-      <td class="coverBar" align="center">
-                <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../snow.png" width=100 height=10 alt="0.0%"></td></tr></table>
-      </td>
-      <td class="coverPerLo">0.0&nbsp;%</td>
-      <td class="coverNumLo">0&nbsp;/&nbsp;3&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="expanddecider.h.gcov.html">expanddecider.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">1&nbsp;/&nbsp;1&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="postingiterator.h.gcov.html">postingiterator.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">2&nbsp;/&nbsp;2&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="query.h.gcov.html">query.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=73 height=10 alt="72.7%"><img src="../../../snow.png" width=27 height=10 alt="72.7%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">72.7&nbsp;%</td>
-      <td class="coverNumHi">8&nbsp;/&nbsp;11&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="termgenerator.h.gcov.html">termgenerator.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">2&nbsp;/&nbsp;2&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="termiterator.h.gcov.html">termiterator.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">100.0&nbsp;%</td>
-      <td class="coverNumHi">4&nbsp;/&nbsp;4&nbsp;lines</td>
-    </tr>
-
-    <tr>
-      <td class="coverFile"><a href="unicode.h.gcov.html">unicode.h</a></td>
-      <td class="coverBar" align="center">
-        <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=88 height=10 alt="87.5%"><img src="../../../snow.png" width=12 height=10 alt="87.5%"></td></tr></table>
-      </td>
-      <td class="coverPerHi">87.5&nbsp;%</td>
-      <td class="coverNumHi">7&nbsp;/&nbsp;8&nbsp;lines</td>
-    </tr>
-
-  </table>
-  </center>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/xapian/postingiterator.h.gcov.html b/rep/usr/include/xapian/postingiterator.h.gcov.html
deleted file mode 100644
index 7137a28..0000000
--- a/rep/usr/include/xapian/postingiterator.h.gcov.html
+++ /dev/null
@@ -1,230 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/xapian/postingiterator.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/xapian</a> - postingiterator.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">2</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">2</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /** \file postingiterator.h
-<span class="lineNum">       2 </span>                :  * \brief Classes for iterating through posting lists
-<span class="lineNum">       3 </span>                :  */
-<span class="lineNum">       4 </span>                : /* Copyright 1999,2000,2001 BrightStation PLC
-<span class="lineNum">       5 </span>                :  * Copyright 2002 Ananova Ltd
-<span class="lineNum">       6 </span>                :  * Copyright 2003,2004,2005,2007 Olly Betts
-<span class="lineNum">       7 </span>                :  *
-<span class="lineNum">       8 </span>                :  * This program is free software; you can redistribute it and/or
-<span class="lineNum">       9 </span>                :  * modify it under the terms of the GNU General Public License as
-<span class="lineNum">      10 </span>                :  * published by the Free Software Foundation; either version 2 of the
-<span class="lineNum">      11 </span>                :  * License, or (at your option) any later version.
-<span class="lineNum">      12 </span>                :  *
-<span class="lineNum">      13 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      14 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      15 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      16 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      17 </span>                :  *
-<span class="lineNum">      18 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      19 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      20 </span>                :  * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301
-<span class="lineNum">      21 </span>                :  * USA
-<span class="lineNum">      22 </span>                :  */
-<span class="lineNum">      23 </span>                : 
-<span class="lineNum">      24 </span>                : #ifndef XAPIAN_INCLUDED_POSTINGITERATOR_H
-<span class="lineNum">      25 </span>                : #define XAPIAN_INCLUDED_POSTINGITERATOR_H
-<span class="lineNum">      26 </span>                : 
-<span class="lineNum">      27 </span>                : #include &lt;iterator&gt;
-<span class="lineNum">      28 </span>                : #include &lt;string&gt;
-<span class="lineNum">      29 </span>                : 
-<span class="lineNum">      30 </span>                : #include &lt;xapian/base.h&gt;
-<span class="lineNum">      31 </span>                : #include &lt;xapian/types.h&gt;
-<span class="lineNum">      32 </span>                : #include &lt;xapian/positioniterator.h&gt;
-<span class="lineNum">      33 </span>                : #include &lt;xapian/visibility.h&gt;
-<span class="lineNum">      34 </span>                : 
-<span class="lineNum">      35 </span>                : namespace Xapian {
-<span class="lineNum">      36 </span>                : 
-<span class="lineNum">      37 </span>                : class Database;
-<span class="lineNum">      38 </span>                : 
-<span class="lineNum">      39 </span>                : /** @internal A wrapper class for a docid which returns the docid if
-<span class="lineNum">      40 </span>                :  *  dereferenced with *.  We need this to implement input_iterator semantics.
-<span class="lineNum">      41 </span>                :  */
-<span class="lineNum">      42 </span>                : class DocIDWrapper {
-<span class="lineNum">      43 </span>                :     private:
-<span class="lineNum">      44 </span>                :         docid did;
-<span class="lineNum">      45 </span>                :     public:
-<span class="lineNum">      46 </span>                :         explicit DocIDWrapper(docid did_) : did(did_) { }
-<span class="lineNum">      47 </span>                :         docid operator*() const { return did; }
-<span class="lineNum">      48 </span>                : };
-<span class="lineNum">      49 </span>                : 
-<span class="lineNum">      50 </span>                : /** An iterator pointing to items in a list of postings.
-<span class="lineNum">      51 </span>                :  */
-<span class="lineNum">      52 </span>                : class XAPIAN_VISIBILITY_DEFAULT PostingIterator {
-<span class="lineNum">      53 </span>                :     public:
-<span class="lineNum">      54 </span>                :         class Internal;
-<span class="lineNum">      55 </span>                :         /// @private @internal Reference counted internals.
-<span class="lineNum">      56 </span>                :         Xapian::Internal::RefCntPtr&lt;Internal&gt; internal;
-<span class="lineNum">      57 </span>                : 
-<span class="lineNum">      58 </span>                :     private:
-<span class="lineNum">      59 </span>                :         friend class Database; // So Database can construct us
-<span class="lineNum">      60 </span>                : 
-<span class="lineNum">      61 </span>                :         explicit PostingIterator(Internal *internal_);
-<span class="lineNum">      62 </span>                : 
-<span class="lineNum">      63 </span>                :     public:
-<span class="lineNum">      64 </span>                :         friend bool operator==(const PostingIterator &amp;a,
-<span class="lineNum">      65 </span>                :                                const PostingIterator &amp;b);
-<span class="lineNum">      66 </span>                : 
-<span class="lineNum">      67 </span>                :         /// Default constructor - for declaring an uninitialised iterator
-<span class="lineNum">      68 </span>                :         PostingIterator();
-<span class="lineNum">      69 </span>                : 
-<span class="lineNum">      70 </span>                :         /// Destructor
-<span class="lineNum">      71 </span>                :         ~PostingIterator();
-<span class="lineNum">      72 </span>                : 
-<span class="lineNum">      73 </span>                :         /** Copying is allowed.  The internals are reference counted, so
-<span class="lineNum">      74 </span>                :          *  copying is also cheap.
-<span class="lineNum">      75 </span>                :          */
-<span class="lineNum">      76 </span>                :         PostingIterator(const PostingIterator &amp;other);
-<span class="lineNum">      77 </span>                : 
-<span class="lineNum">      78 </span>                :         /** Assignment is allowed.  The internals are reference counted,
-<span class="lineNum">      79 </span>                :          *  so assignment is also cheap.
-<span class="lineNum">      80 </span>                :          */
-<span class="lineNum">      81 </span>                :         void operator=(const PostingIterator &amp;other);
-<span class="lineNum">      82 </span>                : 
-<span class="lineNum">      83 </span>                :         PostingIterator &amp; operator++();
-<span class="lineNum">      84 </span>                : 
-<span class="lineNum">      85 </span>                :         DocIDWrapper operator++(int) {
-<span class="lineNum">      86 </span>                :             Xapian::docid tmp = **this;
-<span class="lineNum">      87 </span>                :             operator++();
-<span class="lineNum">      88 </span>                :             return DocIDWrapper(tmp);
-<span class="lineNum">      89 </span>                :         }
-<span class="lineNum">      90 </span>                : 
-<span class="lineNum">      91 </span>                :         /** Skip the iterator to document did, or the first document after did
-<span class="lineNum">      92 </span>                :          *  if did isn't in the list of documents being iterated.
-<span class="lineNum">      93 </span>                :          */
-<span class="lineNum">      94 </span>                :         void skip_to(Xapian::docid did);
-<span class="lineNum">      95 </span>                : 
-<span class="lineNum">      96 </span>                : // Get the weight of the posting at the current position: will
-<span class="lineNum">      97 </span>                : // need to set a weight object for this to work.
-<span class="lineNum">      98 </span>                : // Xapian::weight get_weight() const;
-<span class="lineNum">      99 </span>                : 
-<span class="lineNum">     100 </span>                :         /// Get the document id at the current position in the postlist.
-<span class="lineNum">     101 </span>                :         Xapian::docid operator *() const;
-<span class="lineNum">     102 </span>                : 
-<span class="lineNum">     103 </span>                :         /** Get the length of the document at the current position in the
-<span class="lineNum">     104 </span>                :          *  postlist.
-<span class="lineNum">     105 </span>                :          *
-<span class="lineNum">     106 </span>                :          *  This information may be stored in the postlist, in which case
-<span class="lineNum">     107 </span>                :          *  this lookup should be extremely fast (indeed, not require further
-<span class="lineNum">     108 </span>                :          *  disk access).  If the information is not present in the postlist,
-<span class="lineNum">     109 </span>                :          *  it will be retrieved from the database, at a greater performance
-<span class="lineNum">     110 </span>                :          *  cost.
-<span class="lineNum">     111 </span>                :          */
-<span class="lineNum">     112 </span>                :         Xapian::doclength get_doclength() const;
-<span class="lineNum">     113 </span>                : 
-<span class="lineNum">     114 </span>                :         /** Get the within document frequency of the document at the
-<span class="lineNum">     115 </span>                :          *  current position in the postlist.
-<span class="lineNum">     116 </span>                :          */
-<span class="lineNum">     117 </span>                :         Xapian::termcount get_wdf() const;
-<span class="lineNum">     118 </span>                : 
-<span class="lineNum">     119 </span>                :         /** Return PositionIterator pointing to start of positionlist for
-<span class="lineNum">     120 </span>                :          *  current document.
-<span class="lineNum">     121 </span>                :          */
-<span class="lineNum">     122 </span>                :         PositionIterator positionlist_begin() const;
-<span class="lineNum">     123 </span>                : 
-<span class="lineNum">     124 </span>                :         /** Return PositionIterator pointing to end of positionlist for
-<span class="lineNum">     125 </span>                :          *  current document.
-<span class="lineNum">     126 </span>                :          */
-<span class="lineNum">     127 </span>                :         PositionIterator positionlist_end() const {
-<span class="lineNum">     128 </span>                :             return PositionIterator(NULL);
-<span class="lineNum">     129 </span>                :         }
-<span class="lineNum">     130 </span>                : 
-<span class="lineNum">     131 </span>                :         // Don't expose these methods here.  A container iterator doesn't
-<span class="lineNum">     132 </span>                :         // provide a method to find the size of the container...
-<span class="lineNum">     133 </span>                :         // Xapian::doccount get_termfreq() const;
-<span class="lineNum">     134 </span>                :         // Xapian::termcount get_collection_freq() const;
-<span class="lineNum">     135 </span>                : 
-<span class="lineNum">     136 </span>                :         /// Return a string describing this object.
-<span class="lineNum">     137 </span>                :         std::string get_description() const;
-<span class="lineNum">     138 </span>                : 
-<span class="lineNum">     139 </span>                :         /// Allow use as an STL iterator
-<span class="lineNum">     140 </span>                :         //@{
-<span class="lineNum">     141 </span>                :         typedef std::input_iterator_tag iterator_category;
-<span class="lineNum">     142 </span>                :         typedef Xapian::docid value_type;
-<span class="lineNum">     143 </span>                :         typedef Xapian::doccount_diff difference_type;
-<span class="lineNum">     144 </span>                :         typedef Xapian::docid * pointer;
-<span class="lineNum">     145 </span>                :         typedef Xapian::docid &amp; reference;
-<span class="lineNum">     146 </span>                :         //@}
-<span class="lineNum">     147 </span>                : };
-<span class="lineNum">     148 </span>                : 
-<span class="lineNum">     149 </span>                : /// Test equality of two PostingIterators
-<span class="lineNum">     150 </span><span class="lineCov">             10 : inline bool operator==(const PostingIterator &amp;a, const PostingIterator &amp;b)</span>
-<span class="lineNum">     151 </span>                : {
-<span class="lineNum">     152 </span><span class="lineCov">             10 :     return (a.internal.get() == b.internal.get());</span>
-<span class="lineNum">     153 </span>                : }
-<span class="lineNum">     154 </span>                : 
-<span class="lineNum">     155 </span>                : /// Test inequality of two PostingIterators
-<span class="lineNum">     156 </span>                : inline bool operator!=(const PostingIterator &amp;a, const PostingIterator &amp;b)
-<span class="lineNum">     157 </span>                : {
-<span class="lineNum">     158 </span>                :     return !(a == b);
-<span class="lineNum">     159 </span>                : }
-<span class="lineNum">     160 </span>                : 
-<span class="lineNum">     161 </span>                : }
-<span class="lineNum">     162 </span>                : 
-<span class="lineNum">     163 </span>                : #endif /* XAPIAN_INCLUDED_POSTINGITERATOR_H */
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/xapian/query.h.gcov.html b/rep/usr/include/xapian/query.h.gcov.html
deleted file mode 100644
index da0ec8e..0000000
--- a/rep/usr/include/xapian/query.h.gcov.html
+++ /dev/null
@@ -1,520 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/xapian/query.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/xapian</a> - query.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">11</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">72.7 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">8</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /** \file query.h
-<span class="lineNum">       2 </span>                :  * \brief Classes for representing a query
-<span class="lineNum">       3 </span>                :  */
-<span class="lineNum">       4 </span>                : /* Copyright 1999,2000,2001 BrightStation PLC
-<span class="lineNum">       5 </span>                :  * Copyright 2002 Ananova Ltd
-<span class="lineNum">       6 </span>                :  * Copyright 2003,2004,2005,2006,2007 Olly Betts
-<span class="lineNum">       7 </span>                :  * Copyright 2006,2007,2008 Lemur Consulting Ltd
-<span class="lineNum">       8 </span>                :  *
-<span class="lineNum">       9 </span>                :  * This program is free software; you can redistribute it and/or
-<span class="lineNum">      10 </span>                :  * modify it under the terms of the GNU General Public License as
-<span class="lineNum">      11 </span>                :  * published by the Free Software Foundation; either version 2 of the
-<span class="lineNum">      12 </span>                :  * License, or (at your option) any later version.
-<span class="lineNum">      13 </span>                :  *
-<span class="lineNum">      14 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      15 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      16 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      17 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      18 </span>                :  *
-<span class="lineNum">      19 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      20 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      21 </span>                :  * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301
-<span class="lineNum">      22 </span>                :  * USA
-<span class="lineNum">      23 </span>                :  */
-<span class="lineNum">      24 </span>                : 
-<span class="lineNum">      25 </span>                : #ifndef XAPIAN_INCLUDED_QUERY_H
-<span class="lineNum">      26 </span>                : #define XAPIAN_INCLUDED_QUERY_H
-<span class="lineNum">      27 </span>                : 
-<span class="lineNum">      28 </span>                : #include &lt;string&gt;
-<span class="lineNum">      29 </span>                : #include &lt;vector&gt;
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : #include &lt;xapian/base.h&gt;
-<span class="lineNum">      32 </span>                : #include &lt;xapian/deprecated.h&gt;
-<span class="lineNum">      33 </span>                : #include &lt;xapian/types.h&gt;
-<span class="lineNum">      34 </span>                : #include &lt;xapian/termiterator.h&gt;
-<span class="lineNum">      35 </span>                : #include &lt;xapian/visibility.h&gt;
-<span class="lineNum">      36 </span>                : 
-<span class="lineNum">      37 </span>                : // FIXME: sort this out so we avoid exposing Xapian::Query::Internal
-<span class="lineNum">      38 </span>                : // - we need to at present so that the Xapian::Query's template ctors
-<span class="lineNum">      39 </span>                : // compile.
-<span class="lineNum">      40 </span>                : class LocalSubMatch;
-<span class="lineNum">      41 </span>                : class MultiMatch;
-<span class="lineNum">      42 </span>                : class QueryOptimiser;
-<span class="lineNum">      43 </span>                : struct SortPosName;
-<span class="lineNum">      44 </span>                : 
-<span class="lineNum">      45 </span>                : namespace Xapian {
-<span class="lineNum">      46 </span>                : 
-<span class="lineNum">      47 </span>                : /** Class representing a query.
-<span class="lineNum">      48 </span>                :  *
-<span class="lineNum">      49 </span>                :  *  Queries are represented as a tree of objects.
-<span class="lineNum">      50 </span>                :  */
-<span class="lineNum">      51 </span>                : class XAPIAN_VISIBILITY_DEFAULT Query {
-<span class="lineNum">      52 </span>                :     public:
-<span class="lineNum">      53 </span>                :         /// Class holding details of the query
-<span class="lineNum">      54 </span>                :         class Internal;
-<span class="lineNum">      55 </span>                :         /// @private @internal Reference counted internals.
-<span class="lineNum">      56 </span>                :         Xapian::Internal::RefCntPtr&lt;Internal&gt; internal;
-<span class="lineNum">      57 </span>                : 
-<span class="lineNum">      58 </span>                :         /// Enum of possible query operations
-<span class="lineNum">      59 </span>                :         typedef enum {
-<span class="lineNum">      60 </span>                :             /// Return iff both subqueries are satisfied
-<span class="lineNum">      61 </span>                :             OP_AND,
-<span class="lineNum">      62 </span>                : 
-<span class="lineNum">      63 </span>                :             /// Return if either subquery is satisfied
-<span class="lineNum">      64 </span>                :             OP_OR,
-<span class="lineNum">      65 </span>                : 
-<span class="lineNum">      66 </span>                :             /// Return if left but not right satisfied
-<span class="lineNum">      67 </span>                :             OP_AND_NOT,
-<span class="lineNum">      68 </span>                : 
-<span class="lineNum">      69 </span>                :             /// Return if one query satisfied, but not both
-<span class="lineNum">      70 </span>                :             OP_XOR,
-<span class="lineNum">      71 </span>                : 
-<span class="lineNum">      72 </span>                :             /// Return iff left satisfied, but use weights from both
-<span class="lineNum">      73 </span>                :             OP_AND_MAYBE,
-<span class="lineNum">      74 </span>                : 
-<span class="lineNum">      75 </span>                :             /// As AND, but use only weights from left subquery
-<span class="lineNum">      76 </span>                :             OP_FILTER,
-<span class="lineNum">      77 </span>                : 
-<span class="lineNum">      78 </span>                :             /** Find occurrences of a list of terms with all the terms
-<span class="lineNum">      79 </span>                :              *  occurring within a specified window of positions.
-<span class="lineNum">      80 </span>                :              *  Each occurrence of a term must be at a different position,
-<span class="lineNum">      81 </span>                :              *  but the order they appear in is irrelevant.
-<span class="lineNum">      82 </span>                :              *
-<span class="lineNum">      83 </span>                :              *  The window parameter should be specified for this operation,
-<span class="lineNum">      84 </span>                :              *  but will default to the number of terms in the list.
-<span class="lineNum">      85 </span>                :              */
-<span class="lineNum">      86 </span>                :             OP_NEAR,
-<span class="lineNum">      87 </span>                : 
-<span class="lineNum">      88 </span>                :             /** Find occurrences of a list of terms with all the terms
-<span class="lineNum">      89 </span>                :              *  occurring within a specified window of positions, and all
-<span class="lineNum">      90 </span>                :              *  the terms appearing in the order specified.  Each occurrence
-<span class="lineNum">      91 </span>                :              *  of a term must be at a different position.
-<span class="lineNum">      92 </span>                :              *
-<span class="lineNum">      93 </span>                :              *  The window parameter should be specified for this operation,
-<span class="lineNum">      94 </span>                :              *  but will default to the number of terms in the list.
-<span class="lineNum">      95 </span>                :              */
-<span class="lineNum">      96 </span>                :             OP_PHRASE,
-<span class="lineNum">      97 </span>                : 
-<span class="lineNum">      98 </span>                :             /** Filter by a range test on a document value. */
-<span class="lineNum">      99 </span>                :             OP_VALUE_RANGE,
-<span class="lineNum">     100 </span>                : 
-<span class="lineNum">     101 </span>                :             /** Scale the weight of a subquery by the specified factor.
-<span class="lineNum">     102 </span>                :              *
-<span class="lineNum">     103 </span>                :              *  A factor of 0 means this subquery will contribute no weight to
-<span class="lineNum">     104 </span>                :              *  the query - it will act as a purely boolean subquery.
-<span class="lineNum">     105 </span>                :              *
-<span class="lineNum">     106 </span>                :              *  If the factor is negative, Xapian::InvalidArgumentError will
-<span class="lineNum">     107 </span>                :              *  be thrown.
-<span class="lineNum">     108 </span>                :              */
-<span class="lineNum">     109 </span>                :             OP_SCALE_WEIGHT,
-<span class="lineNum">     110 </span>                : 
-<span class="lineNum">     111 </span>                :             /** Select an elite set from the subqueries, and perform
-<span class="lineNum">     112 </span>                :              *  a query with these combined as an OR query.
-<span class="lineNum">     113 </span>                :              */
-<span class="lineNum">     114 </span>                :             OP_ELITE_SET,
-<span class="lineNum">     115 </span>                : 
-<span class="lineNum">     116 </span>                :             /** Filter by a greater-than-or-equal test on a document value. */
-<span class="lineNum">     117 </span>                :             OP_VALUE_GE,
-<span class="lineNum">     118 </span>                : 
-<span class="lineNum">     119 </span>                :             /** Filter by a less-than-or-equal test on a document value. */
-<span class="lineNum">     120 </span>                :             OP_VALUE_LE
-<span class="lineNum">     121 </span>                :         } op;
-<span class="lineNum">     122 </span>                : 
-<span class="lineNum">     123 </span>                :         /** Copy constructor. */
-<span class="lineNum">     124 </span>                :         Query(const Query &amp; copyme);
-<span class="lineNum">     125 </span>                : 
-<span class="lineNum">     126 </span>                :         /** Assignment. */
-<span class="lineNum">     127 </span>                :         Query &amp; operator=(const Query &amp; copyme);
-<span class="lineNum">     128 </span>                : 
-<span class="lineNum">     129 </span>                :         /** Default constructor: makes an empty query which matches no
-<span class="lineNum">     130 </span>                :          *  documents.
-<span class="lineNum">     131 </span>                :          *
-<span class="lineNum">     132 </span>                :          *  Also useful for defining a Query object to be assigned to later.
-<span class="lineNum">     133 </span>                :          *
-<span class="lineNum">     134 </span>                :          *  An exception will be thrown if an attempt is made to use an
-<span class="lineNum">     135 </span>                :          *  undefined query when building up a composite query.
-<span class="lineNum">     136 </span>                :          */
-<span class="lineNum">     137 </span>                :         Query();
-<span class="lineNum">     138 </span>                : 
-<span class="lineNum">     139 </span>                :         /** Destructor. */
-<span class="lineNum">     140 </span>                :         ~Query();
-<span class="lineNum">     141 </span>                : 
-<span class="lineNum">     142 </span>                :         /** A query consisting of a single term. */
-<span class="lineNum">     143 </span>                :         Query(const std::string &amp; tname_, Xapian::termcount wqf_ = 1,
-<span class="lineNum">     144 </span>                :               Xapian::termpos pos_ = 0);
-<span class="lineNum">     145 </span>                : 
-<span class="lineNum">     146 </span>                :         /** A query consisting of two subqueries, opp-ed together. */
-<span class="lineNum">     147 </span>                :         Query(Query::op op_, const Query &amp; left, const Query &amp; right);
-<span class="lineNum">     148 </span>                : 
-<span class="lineNum">     149 </span>                :         /** A query consisting of two termnames opp-ed together. */
-<span class="lineNum">     150 </span>                :         Query(Query::op op_,
-<span class="lineNum">     151 </span>                :               const std::string &amp; left, const std::string &amp; right);
-<span class="lineNum">     152 </span>                : 
-<span class="lineNum">     153 </span>                :         /** Combine a number of Xapian::Query-s with the specified operator.
-<span class="lineNum">     154 </span>                :          *
-<span class="lineNum">     155 </span>                :          *  The Xapian::Query objects are specified with begin and end
-<span class="lineNum">     156 </span>                :          *  iterators.
-<span class="lineNum">     157 </span>                :          * 
-<span class="lineNum">     158 </span>                :          *  AND, OR, NEAR and PHRASE can take any number of subqueries.
-<span class="lineNum">     159 </span>                :          *  Other operators take exactly two subqueries.
-<span class="lineNum">     160 </span>                :          *
-<span class="lineNum">     161 </span>                :          *  The iterators may be to Xapian::Query objects, pointers to
-<span class="lineNum">     162 </span>                :          *  Xapian::Query objects, or termnames (std::string-s).
-<span class="lineNum">     163 </span>                :          *
-<span class="lineNum">     164 </span>                :          *  For NEAR and PHRASE, a window size can be specified in parameter.
-<span class="lineNum">     165 </span>                :          *
-<span class="lineNum">     166 </span>                :          *  For ELITE_SET, the elite set size can be specified in parameter.
-<span class="lineNum">     167 </span>                :          */
-<span class="lineNum">     168 </span>                :         template &lt;class Iterator&gt;
-<span class="lineNum">     169 </span>                :         Query(Query::op op_, Iterator qbegin, Iterator qend,
-<span class="lineNum">     170 </span>                :               Xapian::termcount parameter = 0);
-<span class="lineNum">     171 </span>                : 
-<span class="lineNum">     172 </span>                :         /** Apply the specified operator to a single Xapian::Query object.
-<span class="lineNum">     173 </span>                :          *
-<span class="lineNum">     174 </span>                :          *  @deprecated This method is deprecated because it isn't useful,
-<span class="lineNum">     175 </span>                :          *  since none of the current query operators can be usefully
-<span class="lineNum">     176 </span>                :          *  applied to a single subquery with a parameter value.
-<span class="lineNum">     177 </span>                :          */
-<span class="lineNum">     178 </span>                :         XAPIAN_DEPRECATED(Query(Query::op op_, Xapian::Query q));
-<span class="lineNum">     179 </span>                : 
-<span class="lineNum">     180 </span>                :         /** Apply the specified operator to a single Xapian::Query object, with
-<span class="lineNum">     181 </span>                :          *  a double parameter.
-<span class="lineNum">     182 </span>                :          */
-<span class="lineNum">     183 </span>                :         Query(Query::op op_, Xapian::Query q, double parameter);
-<span class="lineNum">     184 </span>                : 
-<span class="lineNum">     185 </span>                :         /** Construct a value range query on a document value.
-<span class="lineNum">     186 </span>                :          *
-<span class="lineNum">     187 </span>                :          *  A value range query matches those documents which have a value
-<span class="lineNum">     188 </span>                :          *  stored in the slot given by @a valno which is in the range
-<span class="lineNum">     189 </span>                :          *  specified by @a begin and @a end (in lexicographical
-<span class="lineNum">     190 </span>                :          *  order), including the endpoints.
-<span class="lineNum">     191 </span>                :          *
-<span class="lineNum">     192 </span>                :          *  @param op_   The operator to use for the query.  Currently, must
-<span class="lineNum">     193 </span>                :          *               be OP_VALUE_RANGE.
-<span class="lineNum">     194 </span>                :          *  @param valno The slot number to get the value from.
-<span class="lineNum">     195 </span>                :          *  @param begin The start of the range.
-<span class="lineNum">     196 </span>                :          *  @param end   The end of the range.
-<span class="lineNum">     197 </span>                :          */
-<span class="lineNum">     198 </span>                :         Query(Query::op op_, Xapian::valueno valno,
-<span class="lineNum">     199 </span>                :               const std::string &amp;begin, const std::string &amp;end);
-<span class="lineNum">     200 </span>                : 
-<span class="lineNum">     201 </span>                :         /** Construct a value comparison query on a document value.
-<span class="lineNum">     202 </span>                :          *
-<span class="lineNum">     203 </span>                :          *  This query matches those documents which have a value stored in the
-<span class="lineNum">     204 </span>                :          *  slot given by @a valno which compares, as specified by the
-<span class="lineNum">     205 </span>                :          *  operator, to @a value.
-<span class="lineNum">     206 </span>                :          *
-<span class="lineNum">     207 </span>                :          *  @param op_   The operator to use for the query.  Currently, must
-<span class="lineNum">     208 </span>                :          *               be OP_VALUE_GE or OP_VALUE_LE.
-<span class="lineNum">     209 </span>                :          *  @param valno The slot number to get the value from.
-<span class="lineNum">     210 </span>                :          *  @param value The value to compare.
-<span class="lineNum">     211 </span>                :          */
-<span class="lineNum">     212 </span>                :         Query(Query::op op_, Xapian::valueno valno, const std::string &amp;value);
-<span class="lineNum">     213 </span>                : 
-<span class="lineNum">     214 </span>                :         /** A query which matches all documents in the database. */
-<span class="lineNum">     215 </span>                :         static Xapian::Query MatchAll;
-<span class="lineNum">     216 </span>                : 
-<span class="lineNum">     217 </span>                :         /** A query which matches no documents. */
-<span class="lineNum">     218 </span>                :         static Xapian::Query MatchNothing;
-<span class="lineNum">     219 </span>                : 
-<span class="lineNum">     220 </span>                :         /** Get the length of the query, used by some ranking formulae.
-<span class="lineNum">     221 </span>                :          *  This value is calculated automatically - if you want to override
-<span class="lineNum">     222 </span>                :          *  it you can pass a different value to Enquire::set_query().
-<span class="lineNum">     223 </span>                :          */
-<span class="lineNum">     224 </span>                :         Xapian::termcount get_length() const;
-<span class="lineNum">     225 </span>                : 
-<span class="lineNum">     226 </span>                :         /** Return a Xapian::TermIterator returning all the terms in the query,
-<span class="lineNum">     227 </span>                :          *  in order of termpos.  If multiple terms have the same term
-<span class="lineNum">     228 </span>                :          *  position, their order is unspecified.  Duplicates (same term and
-<span class="lineNum">     229 </span>                :          *  termpos) will be removed.
-<span class="lineNum">     230 </span>                :          */
-<span class="lineNum">     231 </span>                :         TermIterator get_terms_begin() const;
-<span class="lineNum">     232 </span>                : 
-<span class="lineNum">     233 </span>                :         /** Return a Xapian::TermIterator to the end of the list of terms in the
-<span class="lineNum">     234 </span>                :          *  query.
-<span class="lineNum">     235 </span>                :          */
-<span class="lineNum">     236 </span>                :         TermIterator get_terms_end() const {
-<span class="lineNum">     237 </span>                :             return TermIterator(NULL);
-<span class="lineNum">     238 </span>                :         }
-<span class="lineNum">     239 </span>                : 
-<span class="lineNum">     240 </span>                :         /** Test if the query is empty (i.e. was constructed using
-<span class="lineNum">     241 </span>                :          *  the default ctor or with an empty iterator ctor).
-<span class="lineNum">     242 </span>                :          */
-<span class="lineNum">     243 </span>                :         bool empty() const;
-<span class="lineNum">     244 </span>                : 
-<span class="lineNum">     245 </span>                :         /// Return a string describing this object.
-<span class="lineNum">     246 </span>                :         std::string get_description() const;
-<span class="lineNum">     247 </span>                : 
-<span class="lineNum">     248 </span>                :     private:
-<span class="lineNum">     249 </span>                :         void add_subquery(const Query &amp; subq);
-<span class="lineNum">     250 </span>                :         void add_subquery(const Query * subq);
-<span class="lineNum">     251 </span>                :         void add_subquery(const std::string &amp; tname);
-<span class="lineNum">     252 </span>                :         void start_construction(Query::op op_, Xapian::termcount parameter);
-<span class="lineNum">     253 </span>                :         void end_construction();
-<span class="lineNum">     254 </span>                :         void abort_construction();
-<span class="lineNum">     255 </span>                : };
-<span class="lineNum">     256 </span>                : 
-<span class="lineNum">     257 </span>                : template &lt;class Iterator&gt;
-<span class="lineNum">     258 </span><span class="lineCov">             19 : Query::Query(Query::op op_, Iterator qbegin, Iterator qend, termcount parameter)</span>
-<span class="lineNum">     259 </span><span class="lineCov">             19 :     : internal(0)</span>
-<span class="lineNum">     260 </span>                : {
-<span class="lineNum">     261 </span>                :     try {
-<span class="lineNum">     262 </span><span class="lineCov">             19 :         start_construction(op_, parameter);</span>
-<span class="lineNum">     263 </span>                : 
-<span class="lineNum">     264 </span>                :         /* Add all the elements */
-<span class="lineNum">     265 </span><span class="lineCov">             61 :         while (qbegin != qend) {</span>
-<span class="lineNum">     266 </span><span class="lineCov">             23 :             add_subquery(*qbegin);</span>
-<span class="lineNum">     267 </span><span class="lineCov">             23 :             ++qbegin;</span>
-<span class="lineNum">     268 </span>                :         }
-<span class="lineNum">     269 </span>                : 
-<span class="lineNum">     270 </span><span class="lineCov">             19 :         end_construction();</span>
-<span class="lineNum">     271 </span><span class="lineNoCov">              0 :     } catch (...) {</span>
-<span class="lineNum">     272 </span><span class="lineNoCov">              0 :         abort_construction();</span>
-<span class="lineNum">     273 </span><span class="lineNoCov">              0 :         throw;</span>
-<span class="lineNum">     274 </span>                :     }
-<span class="lineNum">     275 </span><span class="lineCov">             19 : }</span>
-<span class="lineNum">     276 </span>                : 
-<span class="lineNum">     277 </span>                : /// @internal Internal class, implementing most of Xapian::Query.
-<span class="lineNum">     278 </span>                : class XAPIAN_VISIBILITY_DEFAULT Query::Internal : public Xapian::Internal::RefCntBase {
-<span class="lineNum">     279 </span>                :     friend class ::LocalSubMatch;
-<span class="lineNum">     280 </span>                :     friend class ::MultiMatch;
-<span class="lineNum">     281 </span>                :     friend class ::QueryOptimiser;
-<span class="lineNum">     282 </span>                :     friend struct ::SortPosName;
-<span class="lineNum">     283 </span>                :     friend class Query;
-<span class="lineNum">     284 </span>                :     public:
-<span class="lineNum">     285 </span>                :         static const int OP_LEAF = -1;
-<span class="lineNum">     286 </span>                : 
-<span class="lineNum">     287 </span>                :         /// The container type for storing pointers to subqueries
-<span class="lineNum">     288 </span>                :         typedef std::vector&lt;Internal *&gt; subquery_list;
-<span class="lineNum">     289 </span>                : 
-<span class="lineNum">     290 </span>                :         /// Type storing the operation
-<span class="lineNum">     291 </span>                :         typedef int op_t;
-<span class="lineNum">     292 </span>                : 
-<span class="lineNum">     293 </span>                :     private:
-<span class="lineNum">     294 </span>                :         /// Operation to be performed at this node
-<span class="lineNum">     295 </span>                :         Xapian::Query::Internal::op_t op;
-<span class="lineNum">     296 </span>                : 
-<span class="lineNum">     297 </span>                :         /// Sub queries on which to perform operation
-<span class="lineNum">     298 </span>                :         subquery_list subqs;
-<span class="lineNum">     299 </span>                : 
-<span class="lineNum">     300 </span>                :         /** For NEAR or PHRASE, how close terms must be to match: all terms
-<span class="lineNum">     301 </span>                :          *  within the operation must occur in a window of this size.
-<span class="lineNum">     302 </span>                :          *
-<span class="lineNum">     303 </span>                :          * For ELITE_SET, the number of terms to select from those specified.
-<span class="lineNum">     304 </span>                :          *
-<span class="lineNum">     305 </span>                :          * For RANGE, the value number to apply the range test to.
-<span class="lineNum">     306 </span>                :          */
-<span class="lineNum">     307 </span>                :         Xapian::termcount parameter;
-<span class="lineNum">     308 </span>                : 
-<span class="lineNum">     309 </span>                :         /** Term that this node represents, or start of a range query.
-<span class="lineNum">     310 </span>                :          *
-<span class="lineNum">     311 </span>                :          *  For a leaf node, this holds the term name.  For an OP_VALUE_RANGE
-<span class="lineNum">     312 </span>                :          *  query this holds the start of the range.  For an OP_VALUE_GE or
-<span class="lineNum">     313 </span>                :          *  OP_VALUE_LE query this holds the value to compare against.
-<span class="lineNum">     314 </span>                :          */
-<span class="lineNum">     315 </span>                :         std::string tname;
-<span class="lineNum">     316 </span>                : 
-<span class="lineNum">     317 </span>                :         /** Used to store the end of a range query. */
-<span class="lineNum">     318 </span>                :         std::string str_parameter;
-<span class="lineNum">     319 </span>                : 
-<span class="lineNum">     320 </span>                :         /// Position in query of this term - leaf node only
-<span class="lineNum">     321 </span>                :         Xapian::termpos term_pos;
-<span class="lineNum">     322 </span>                : 
-<span class="lineNum">     323 </span>                :         /// Within query frequency of this term - leaf node only
-<span class="lineNum">     324 </span>                :         Xapian::termcount wqf;
-<span class="lineNum">     325 </span>                : 
-<span class="lineNum">     326 </span>                :         /** swap the contents of this with another Xapian::Query::Internal,
-<span class="lineNum">     327 </span>                :          *  in a way which is guaranteed not to throw.  This is
-<span class="lineNum">     328 </span>                :          *  used with the assignment operator to make it exception
-<span class="lineNum">     329 </span>                :          *  safe.
-<span class="lineNum">     330 </span>                :          *  It's important to adjust swap with any addition of
-<span class="lineNum">     331 </span>                :          *  member variables!
-<span class="lineNum">     332 </span>                :          */
-<span class="lineNum">     333 </span>                :         void swap(Query::Internal &amp;other);
-<span class="lineNum">     334 </span>                : 
-<span class="lineNum">     335 </span>                :         /// Copy another Xapian::Query::Internal into self.
-<span class="lineNum">     336 </span>                :         void initialise_from_copy(const Query::Internal &amp; copyme);
-<span class="lineNum">     337 </span>                : 
-<span class="lineNum">     338 </span>                :         void accumulate_terms(
-<span class="lineNum">     339 </span>                :             std::vector&lt;std::pair&lt;std::string, Xapian::termpos&gt; &gt; &amp;terms) const;
-<span class="lineNum">     340 </span>                : 
-<span class="lineNum">     341 </span>                :         /** Simplify the query.
-<span class="lineNum">     342 </span>                :          *  For example, an AND query with only one subquery would become the
-<span class="lineNum">     343 </span>                :          *  subquery itself.
-<span class="lineNum">     344 </span>                :          */
-<span class="lineNum">     345 </span>                :         Internal * simplify_query();
-<span class="lineNum">     346 </span>                : 
-<span class="lineNum">     347 </span>                :         /** Perform checks that query is valid. (eg, has correct number of
-<span class="lineNum">     348 </span>                :          *  sub queries.)  Throw an exception if not.  This is initially called
-<span class="lineNum">     349 </span>                :          *  on the query before any simplifications have been made, and after
-<span class="lineNum">     350 </span>                :          *  simplications.
-<span class="lineNum">     351 </span>                :          */
-<span class="lineNum">     352 </span>                :         void validate_query() const;
-<span class="lineNum">     353 </span>                : 
-<span class="lineNum">     354 </span>                :         /** Simplify any matchnothing subqueries, either eliminating them,
-<span class="lineNum">     355 </span>                :          *  or setting this query to matchnothing, depending on the query
-<span class="lineNum">     356 </span>                :          *  operator.  Returns true if simplification resulted in a
-<span class="lineNum">     357 </span>                :          *  matchnothing query.
-<span class="lineNum">     358 </span>                :          */
-<span class="lineNum">     359 </span>                :         bool simplify_matchnothing();
-<span class="lineNum">     360 </span>                : 
-<span class="lineNum">     361 </span>                :         /** Get a string describing the given query type.
-<span class="lineNum">     362 </span>                :          */
-<span class="lineNum">     363 </span>                :         static std::string get_op_name(Xapian::Query::Internal::op_t op);
-<span class="lineNum">     364 </span>                : 
-<span class="lineNum">     365 </span>                :         /** Collapse the subqueries together if appropriate.
-<span class="lineNum">     366 </span>                :          */
-<span class="lineNum">     367 </span>                :         void collapse_subqs();
-<span class="lineNum">     368 </span>                : 
-<span class="lineNum">     369 </span>                :         /** Flatten a query structure, by changing, for example,
-<span class="lineNum">     370 </span>                :          *  &quot;A NEAR (B AND C)&quot; to &quot;(A NEAR B) AND (A NEAR C)&quot;
-<span class="lineNum">     371 </span>                :          */
-<span class="lineNum">     372 </span>                :         void flatten_subqs();
-<span class="lineNum">     373 </span>                : 
-<span class="lineNum">     374 </span>                :         /** Implementation of serialisation; called recursively.
-<span class="lineNum">     375 </span>                :          */
-<span class="lineNum">     376 </span>                :         std::string serialise(Xapian::termpos &amp; curpos) const;
-<span class="lineNum">     377 </span>                : 
-<span class="lineNum">     378 </span>                :     public:
-<span class="lineNum">     379 </span>                :         /** Copy constructor. */
-<span class="lineNum">     380 </span>                :         Internal(const Query::Internal &amp; copyme);
-<span class="lineNum">     381 </span>                : 
-<span class="lineNum">     382 </span>                :         /** Assignment. */
-<span class="lineNum">     383 </span>                :         void operator=(const Query::Internal &amp; copyme);
-<span class="lineNum">     384 </span>                : 
-<span class="lineNum">     385 </span>                :         /** A query consisting of a single term. */
-<span class="lineNum">     386 </span>                :         explicit Internal(const std::string &amp; tname_, Xapian::termcount wqf_ = 1,
-<span class="lineNum">     387 </span>                :                           Xapian::termpos term_pos_ = 0);
-<span class="lineNum">     388 </span>                : 
-<span class="lineNum">     389 </span>                :         /** Create internals given only the operator and a parameter. */
-<span class="lineNum">     390 </span>                :         Internal(op_t op_, Xapian::termcount parameter);
-<span class="lineNum">     391 </span>                : 
-<span class="lineNum">     392 </span>                :         /** Construct a range query on a document value. */
-<span class="lineNum">     393 </span>                :         Internal(op_t op_, Xapian::valueno valno,
-<span class="lineNum">     394 </span>                :                  const std::string &amp;begin, const std::string &amp;end);
-<span class="lineNum">     395 </span>                : 
-<span class="lineNum">     396 </span>                :         /** Construct a value greater-than-or-equal query on a document value.
-<span class="lineNum">     397 </span>                :          */
-<span class="lineNum">     398 </span>                :         Internal(op_t op_, Xapian::valueno valno, const std::string &amp;value);
-<span class="lineNum">     399 </span>                : 
-<span class="lineNum">     400 </span>                :         /** Destructor. */
-<span class="lineNum">     401 </span>                :         ~Internal();
-<span class="lineNum">     402 </span>                : 
-<span class="lineNum">     403 </span>                :         static Xapian::Query::Internal * unserialise(const std::string &amp;s);
-<span class="lineNum">     404 </span>                : 
-<span class="lineNum">     405 </span>                :         /** Add a subquery.
-<span class="lineNum">     406 </span>                :          */
-<span class="lineNum">     407 </span>                :         void add_subquery(const Query::Internal * subq);
-<span class="lineNum">     408 </span>                : 
-<span class="lineNum">     409 </span>                :         void set_dbl_parameter(double dbl_parameter_);
-<span class="lineNum">     410 </span>                : 
-<span class="lineNum">     411 </span>                :         double get_dbl_parameter() const;
-<span class="lineNum">     412 </span>                : 
-<span class="lineNum">     413 </span>                :         /** Finish off the construction.
-<span class="lineNum">     414 </span>                :          */
-<span class="lineNum">     415 </span>                :         Query::Internal * end_construction();
-<span class="lineNum">     416 </span>                : 
-<span class="lineNum">     417 </span>                :         /** Return a string in an easily parsed form
-<span class="lineNum">     418 </span>                :          *  which contains all the information in a query.
-<span class="lineNum">     419 </span>                :          */
-<span class="lineNum">     420 </span>                :         std::string serialise() const {
-<span class="lineNum">     421 </span>                :             Xapian::termpos curpos = 1;
-<span class="lineNum">     422 </span>                :             return serialise(curpos);
-<span class="lineNum">     423 </span>                :         }
-<span class="lineNum">     424 </span>                : 
-<span class="lineNum">     425 </span>                :         /// Return a string describing this object.
-<span class="lineNum">     426 </span>                :         std::string get_description() const;
-<span class="lineNum">     427 </span>                : 
-<span class="lineNum">     428 </span>                :         /** Get the numeric parameter used in this query.
-<span class="lineNum">     429 </span>                :          *
-<span class="lineNum">     430 </span>                :          *  This is used by the QueryParser to get the value number for
-<span class="lineNum">     431 </span>                :          *  VALUE_RANGE queries.  It should be replaced by a public method on
-<span class="lineNum">     432 </span>                :          *  the Query class at some point, but the API which should be used for
-<span class="lineNum">     433 </span>                :          *  that is unclear, so this is a temporary workaround.
-<span class="lineNum">     434 </span>                :          */
-<span class="lineNum">     435 </span>                :         Xapian::termcount get_parameter() const { return parameter; }
-<span class="lineNum">     436 </span>                : 
-<span class="lineNum">     437 </span>                :         /** Get the length of the query, used by some ranking formulae.
-<span class="lineNum">     438 </span>                :          *  This value is calculated automatically - if you want to override
-<span class="lineNum">     439 </span>                :          *  it you can pass a different value to Enquire::set_query().
-<span class="lineNum">     440 </span>                :          */
-<span class="lineNum">     441 </span>                :         Xapian::termcount get_length() const;
-<span class="lineNum">     442 </span>                : 
-<span class="lineNum">     443 </span>                :         /** Return an iterator over all the terms in the query,
-<span class="lineNum">     444 </span>                :          *  in order of termpos.  If multiple terms have the same term
-<span class="lineNum">     445 </span>                :          *  position, their order is unspecified.  Duplicates (same term and
-<span class="lineNum">     446 </span>                :          *  termpos) will be removed.
-<span class="lineNum">     447 </span>                :          */
-<span class="lineNum">     448 </span>                :         TermIterator get_terms() const;
-<span class="lineNum">     449 </span>                : };
-<span class="lineNum">     450 </span>                : 
-<span class="lineNum">     451 </span>                : }
-<span class="lineNum">     452 </span>                : 
-<span class="lineNum">     453 </span>                : #endif /* XAPIAN_INCLUDED_QUERY_H */
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/xapian/termgenerator.h.gcov.html b/rep/usr/include/xapian/termgenerator.h.gcov.html
deleted file mode 100644
index dc59577..0000000
--- a/rep/usr/include/xapian/termgenerator.h.gcov.html
+++ /dev/null
@@ -1,226 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/xapian/termgenerator.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/xapian</a> - termgenerator.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">2</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">2</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /** @file termgenerator.h
-<span class="lineNum">       2 </span>                :  * @brief parse free text and generate terms
-<span class="lineNum">       3 </span>                :  */
-<span class="lineNum">       4 </span>                : /* Copyright (C) 2007 Olly Betts
-<span class="lineNum">       5 </span>                :  *
-<span class="lineNum">       6 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">       7 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">       8 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">       9 </span>                :  * (at your option) any later version.
-<span class="lineNum">      10 </span>                :  *
-<span class="lineNum">      11 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      12 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      13 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      14 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      15 </span>                :  *
-<span class="lineNum">      16 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      17 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      18 </span>                :  * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
-<span class="lineNum">      19 </span>                :  */
-<span class="lineNum">      20 </span>                : 
-<span class="lineNum">      21 </span>                : #ifndef XAPIAN_INCLUDED_TERMGENERATOR_H
-<span class="lineNum">      22 </span>                : #define XAPIAN_INCLUDED_TERMGENERATOR_H
-<span class="lineNum">      23 </span>                : 
-<span class="lineNum">      24 </span>                : #include &lt;xapian/base.h&gt;
-<span class="lineNum">      25 </span>                : #include &lt;xapian/types.h&gt;
-<span class="lineNum">      26 </span>                : #include &lt;xapian/unicode.h&gt;
-<span class="lineNum">      27 </span>                : #include &lt;xapian/visibility.h&gt;
-<span class="lineNum">      28 </span>                : 
-<span class="lineNum">      29 </span>                : #include &lt;string&gt;
-<span class="lineNum">      30 </span>                : 
-<span class="lineNum">      31 </span>                : namespace Xapian {
-<span class="lineNum">      32 </span>                : 
-<span class="lineNum">      33 </span>                : class Document;
-<span class="lineNum">      34 </span>                : class Stem;
-<span class="lineNum">      35 </span>                : class Stopper;
-<span class="lineNum">      36 </span>                : class WritableDatabase;
-<span class="lineNum">      37 </span>                : 
-<span class="lineNum">      38 </span>                : /** Parses a piece of text and generate terms.
-<span class="lineNum">      39 </span>                :  *
-<span class="lineNum">      40 </span>                :  * This module takes a piece of text and parses it to produce words which are
-<span class="lineNum">      41 </span>                :  * then used to generate suitable terms for indexing.  The terms generated are
-<span class="lineNum">      42 </span>                :  * suitable for use with Query objects produced by the QueryParser class.
-<span class="lineNum">      43 </span>                :  */
-<span class="lineNum">      44 </span>                : class XAPIAN_VISIBILITY_DEFAULT TermGenerator {
-<span class="lineNum">      45 </span>                :   public:
-<span class="lineNum">      46 </span>                :     /// @private @internal Class representing the TermGenerator internals.
-<span class="lineNum">      47 </span>                :     class Internal;
-<span class="lineNum">      48 </span>                :     /// @private @internal Reference counted internals.
-<span class="lineNum">      49 </span>                :     Xapian::Internal::RefCntPtr&lt;Internal&gt; internal;
-<span class="lineNum">      50 </span>                : 
-<span class="lineNum">      51 </span>                :     /// Copy constructor.
-<span class="lineNum">      52 </span>                :     TermGenerator(const TermGenerator &amp; o);
-<span class="lineNum">      53 </span>                : 
-<span class="lineNum">      54 </span>                :     /// Assignment.
-<span class="lineNum">      55 </span>                :     TermGenerator &amp; operator=(const TermGenerator &amp; o);
-<span class="lineNum">      56 </span>                : 
-<span class="lineNum">      57 </span>                :     /// Default constructor.
-<span class="lineNum">      58 </span>                :     TermGenerator();
-<span class="lineNum">      59 </span>                : 
-<span class="lineNum">      60 </span>                :     /// Destructor.
-<span class="lineNum">      61 </span>                :     ~TermGenerator();
-<span class="lineNum">      62 </span>                : 
-<span class="lineNum">      63 </span>                :     /// Set the Xapian::Stem object to be used for generating stemmed terms.
-<span class="lineNum">      64 </span>                :     void set_stemmer(const Xapian::Stem &amp; stemmer);
-<span class="lineNum">      65 </span>                : 
-<span class="lineNum">      66 </span>                :     /// Set the Xapian::Stopper object to be used for identifying stopwords.
-<span class="lineNum">      67 </span>                :     void set_stopper(const Xapian::Stopper *stop = NULL);
-<span class="lineNum">      68 </span>                : 
-<span class="lineNum">      69 </span>                :     /// Set the current document.
-<span class="lineNum">      70 </span>                :     void set_document(const Xapian::Document &amp; doc);
-<span class="lineNum">      71 </span>                : 
-<span class="lineNum">      72 </span>                :     /// Get the current document.
-<span class="lineNum">      73 </span>                :     const Xapian::Document &amp; get_document() const;
-<span class="lineNum">      74 </span>                : 
-<span class="lineNum">      75 </span>                :     /// Set the database to index spelling data to.
-<span class="lineNum">      76 </span>                :     void set_database(const Xapian::WritableDatabase &amp;db);
-<span class="lineNum">      77 </span>                : 
-<span class="lineNum">      78 </span>                :     /// Flags to OR together and pass to TermGenerator::set_flags().
-<span class="lineNum">      79 </span>                :     enum flags {
-<span class="lineNum">      80 </span>                :         /// Index data required for spelling correction.
-<span class="lineNum">      81 </span>                :         FLAG_SPELLING = 128 // Value matches QueryParser flag.
-<span class="lineNum">      82 </span>                :     };
-<span class="lineNum">      83 </span>                : 
-<span class="lineNum">      84 </span>                :     /** Set flags.
-<span class="lineNum">      85 </span>                :      *
-<span class="lineNum">      86 </span>                :      *  The new value of flags is: (flags &amp; mask) ^ toggle
-<span class="lineNum">      87 </span>                :      *
-<span class="lineNum">      88 </span>                :      *  To just set the flags, pass the new flags in toggle and the
-<span class="lineNum">      89 </span>                :      *  default value for mask.
-<span class="lineNum">      90 </span>                :      *
-<span class="lineNum">      91 </span>                :      *  @param toggle   Flags to XOR.
-<span class="lineNum">      92 </span>                :      *  @param mask     Flags to AND with first.
-<span class="lineNum">      93 </span>                :      *
-<span class="lineNum">      94 </span>                :      *  @return         The old flags setting.
-<span class="lineNum">      95 </span>                :      */
-<span class="lineNum">      96 </span>                :     flags set_flags(flags toggle, flags mask = flags(0));
-<span class="lineNum">      97 </span>                : 
-<span class="lineNum">      98 </span>                :     /** Index some text.
-<span class="lineNum">      99 </span>                :      *
-<span class="lineNum">     100 </span>                :      * @param weight    The wdf increment (default 1).
-<span class="lineNum">     101 </span>                :      * @param prefix    The term prefix to use (default is no prefix).
-<span class="lineNum">     102 </span>                :      */
-<span class="lineNum">     103 </span>                :     void index_text(const Xapian::Utf8Iterator &amp; itor,
-<span class="lineNum">     104 </span>                :                     Xapian::termcount weight = 1,
-<span class="lineNum">     105 </span>                :                     const std::string &amp; prefix = &quot;&quot;);
-<span class="lineNum">     106 </span>                : 
-<span class="lineNum">     107 </span>                :     /** Index some text in a std::string.
-<span class="lineNum">     108 </span>                :      *
-<span class="lineNum">     109 </span>                :      * @param weight    The wdf increment (default 1).
-<span class="lineNum">     110 </span>                :      * @param prefix    The term prefix to use (default is no prefix).
-<span class="lineNum">     111 </span>                :      */
-<span class="lineNum">     112 </span>                :     void index_text(const std::string &amp; text,
-<span class="lineNum">     113 </span>                :                     Xapian::termcount weight = 1,
-<span class="lineNum">     114 </span>                :                     const std::string &amp; prefix = &quot;&quot;) {
-<span class="lineNum">     115 </span>                :         return index_text(Utf8Iterator(text), weight, prefix);
-<span class="lineNum">     116 </span>                :     }
-<span class="lineNum">     117 </span>                : 
-<span class="lineNum">     118 </span>                :     /** Index some text without positional information.
-<span class="lineNum">     119 </span>                :      *
-<span class="lineNum">     120 </span>                :      * Just like index_text, but no positional information is generated.  This
-<span class="lineNum">     121 </span>                :      * means that the database will be significantly smaller, but that phrase
-<span class="lineNum">     122 </span>                :      * searching and NEAR won't be supported.
-<span class="lineNum">     123 </span>                :      */
-<span class="lineNum">     124 </span>                :     void index_text_without_positions(const Xapian::Utf8Iterator &amp; itor,
-<span class="lineNum">     125 </span>                :                                       Xapian::termcount weight = 1,
-<span class="lineNum">     126 </span>                :                                       const std::string &amp; prefix = &quot;&quot;);
-<span class="lineNum">     127 </span>                : 
-<span class="lineNum">     128 </span>                :     /** Index some text in a std::string without positional information.
-<span class="lineNum">     129 </span>                :      *
-<span class="lineNum">     130 </span>                :      * Just like index_text, but no positional information is generated.  This
-<span class="lineNum">     131 </span>                :      * means that the database will be significantly smaller, but that phrase
-<span class="lineNum">     132 </span>                :      * searching and NEAR won't be supported.
-<span class="lineNum">     133 </span>                :      */
-<span class="lineNum">     134 </span>                :     void index_text_without_positions(const std::string &amp; text,
-<span class="lineNum">     135 </span>                :                                       Xapian::termcount weight = 1,
-<span class="lineNum">     136 </span><span class="lineCov">           5208 :                                       const std::string &amp; prefix = &quot;&quot;) {</span>
-<span class="lineNum">     137 </span><span class="lineCov">           5208 :         return index_text_without_positions(Utf8Iterator(text), weight, prefix);</span>
-<span class="lineNum">     138 </span>                :     }
-<span class="lineNum">     139 </span>                : 
-<span class="lineNum">     140 </span>                :     /** Increase the termpos used by index_text by @a delta.
-<span class="lineNum">     141 </span>                :      *
-<span class="lineNum">     142 </span>                :      *  This can be used to prevent phrase searches from spanning two
-<span class="lineNum">     143 </span>                :      *  unconnected blocks of text (e.g. the title and body text).
-<span class="lineNum">     144 </span>                :      */
-<span class="lineNum">     145 </span>                :     void increase_termpos(Xapian::termcount delta = 100);
-<span class="lineNum">     146 </span>                : 
-<span class="lineNum">     147 </span>                :     /// Get the current term position.
-<span class="lineNum">     148 </span>                :     Xapian::termcount get_termpos() const;
-<span class="lineNum">     149 </span>                : 
-<span class="lineNum">     150 </span>                :     /// Set the current term position.
-<span class="lineNum">     151 </span>                :     void set_termpos(Xapian::termcount termpos);
-<span class="lineNum">     152 </span>                : 
-<span class="lineNum">     153 </span>                :     /// Return a string describing this object.
-<span class="lineNum">     154 </span>                :     std::string get_description() const;
-<span class="lineNum">     155 </span>                : };
-<span class="lineNum">     156 </span>                : 
-<span class="lineNum">     157 </span>                : }
-<span class="lineNum">     158 </span>                : 
-<span class="lineNum">     159 </span>                : #endif // XAPIAN_INCLUDED_TERMGENERATOR_H
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/xapian/termiterator.h.gcov.html b/rep/usr/include/xapian/termiterator.h.gcov.html
deleted file mode 100644
index fbdbc0b..0000000
--- a/rep/usr/include/xapian/termiterator.h.gcov.html
+++ /dev/null
@@ -1,216 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/xapian/termiterator.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/xapian</a> - termiterator.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">4</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">100.0 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">4</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /** \file termiterator.h
-<span class="lineNum">       2 </span>                :  * \brief Classes for iterating through term lists
-<span class="lineNum">       3 </span>                :  */
-<span class="lineNum">       4 </span>                : /* Copyright 1999,2000,2001 BrightStation PLC
-<span class="lineNum">       5 </span>                :  * Copyright 2002 Ananova Ltd
-<span class="lineNum">       6 </span>                :  * Copyright 2003,2004,2005,2006,2007 Olly Betts
-<span class="lineNum">       7 </span>                :  *
-<span class="lineNum">       8 </span>                :  * This program is free software; you can redistribute it and/or
-<span class="lineNum">       9 </span>                :  * modify it under the terms of the GNU General Public License as
-<span class="lineNum">      10 </span>                :  * published by the Free Software Foundation; either version 2 of the
-<span class="lineNum">      11 </span>                :  * License, or (at your option) any later version.
-<span class="lineNum">      12 </span>                :  *
-<span class="lineNum">      13 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      14 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      15 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      16 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      17 </span>                :  *
-<span class="lineNum">      18 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      19 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      20 </span>                :  * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301
-<span class="lineNum">      21 </span>                :  * USA
-<span class="lineNum">      22 </span>                :  */
-<span class="lineNum">      23 </span>                : 
-<span class="lineNum">      24 </span>                : #ifndef XAPIAN_INCLUDED_TERMITERATOR_H
-<span class="lineNum">      25 </span>                : #define XAPIAN_INCLUDED_TERMITERATOR_H
-<span class="lineNum">      26 </span>                : 
-<span class="lineNum">      27 </span>                : #include &lt;iterator&gt;
-<span class="lineNum">      28 </span>                : #include &lt;string&gt;
-<span class="lineNum">      29 </span>                : 
-<span class="lineNum">      30 </span>                : #include &lt;xapian/base.h&gt;
-<span class="lineNum">      31 </span>                : #include &lt;xapian/types.h&gt;
-<span class="lineNum">      32 </span>                : #include &lt;xapian/positioniterator.h&gt;
-<span class="lineNum">      33 </span>                : #include &lt;xapian/visibility.h&gt;
-<span class="lineNum">      34 </span>                : 
-<span class="lineNum">      35 </span>                : namespace Xapian {
-<span class="lineNum">      36 </span>                : 
-<span class="lineNum">      37 </span>                : class Database;
-<span class="lineNum">      38 </span>                : 
-<span class="lineNum">      39 </span>                : /** @internal A wrapper class for a termname which returns the termname if
-<span class="lineNum">      40 </span>                :  *  dereferenced with *.  We need this to implement input_iterator semantics.
-<span class="lineNum">      41 </span>                :  */
-<span class="lineNum">      42 </span>                : class TermNameWrapper {
-<span class="lineNum">      43 </span>                :     private:
-<span class="lineNum">      44 </span>                :         std::string tname;
-<span class="lineNum">      45 </span>                :     public:
-<span class="lineNum">      46 </span>                :         explicit TermNameWrapper(const std::string &amp; tname_) : tname(tname_) { }
-<span class="lineNum">      47 </span>                :         const std::string &amp; operator*() const { return tname; }
-<span class="lineNum">      48 </span>                : };
-<span class="lineNum">      49 </span>                : 
-<span class="lineNum">      50 </span>                : /** An iterator pointing to items in a list of terms.
-<span class="lineNum">      51 </span>                :  */
-<span class="lineNum">      52 </span>                : class XAPIAN_VISIBILITY_DEFAULT TermIterator {
-<span class="lineNum">      53 </span>                :     public:
-<span class="lineNum">      54 </span>                :         class Internal;
-<span class="lineNum">      55 </span>                :         /// @internal Reference counted internals.
-<span class="lineNum">      56 </span>                :         Xapian::Internal::RefCntPtr&lt;Internal&gt; internal;
-<span class="lineNum">      57 </span>                : 
-<span class="lineNum">      58 </span>                :         /// @internal Reference counted internals.
-<span class="lineNum">      59 </span>                :         explicit TermIterator(Internal *internal_);
-<span class="lineNum">      60 </span>                : 
-<span class="lineNum">      61 </span>                :         /// Default constructor - for declaring an uninitialised iterator.
-<span class="lineNum">      62 </span>                :         TermIterator();
-<span class="lineNum">      63 </span>                : 
-<span class="lineNum">      64 </span>                :         /// Destructor.
-<span class="lineNum">      65 </span>                :         ~TermIterator();
-<span class="lineNum">      66 </span>                : 
-<span class="lineNum">      67 </span>                :         /** Copying is allowed.  The internals are reference counted, so
-<span class="lineNum">      68 </span>                :          *  copying is also cheap.
-<span class="lineNum">      69 </span>                :          */
-<span class="lineNum">      70 </span>                :         TermIterator(const TermIterator &amp;other);
-<span class="lineNum">      71 </span>                : 
-<span class="lineNum">      72 </span>                :         /** Assignment is allowed.  The internals are reference counted,
-<span class="lineNum">      73 </span>                :          *  so assignment is also cheap.
-<span class="lineNum">      74 </span>                :          */
-<span class="lineNum">      75 </span>                :         void operator=(const TermIterator &amp;other);
-<span class="lineNum">      76 </span>                : 
-<span class="lineNum">      77 </span>                :         /// Return the current term.
-<span class="lineNum">      78 </span>                :         std::string operator *() const;
-<span class="lineNum">      79 </span>                : 
-<span class="lineNum">      80 </span>                :         TermIterator &amp; operator++();
-<span class="lineNum">      81 </span>                : 
-<span class="lineNum">      82 </span>                :         TermNameWrapper operator++(int) {
-<span class="lineNum">      83 </span>                :             std::string tmp = **this;
-<span class="lineNum">      84 </span>                :             operator++();
-<span class="lineNum">      85 </span>                :             return TermNameWrapper(tmp);
-<span class="lineNum">      86 </span>                :         }
-<span class="lineNum">      87 </span>                : 
-<span class="lineNum">      88 </span>                :         /** Skip the iterator to term tname, or the first term after tname
-<span class="lineNum">      89 </span>                :          *  if tname isn't in the list of terms being iterated.
-<span class="lineNum">      90 </span>                :          */
-<span class="lineNum">      91 </span>                :         void skip_to(const std::string &amp; tname);
-<span class="lineNum">      92 </span>                : 
-<span class="lineNum">      93 </span>                :         /** Return the wdf of the current term (if meaningful).
-<span class="lineNum">      94 </span>                :          *
-<span class="lineNum">      95 </span>                :          *  The wdf (within document frequency) is the number of occurences
-<span class="lineNum">      96 </span>                :          *  of a term in a particular document.
-<span class="lineNum">      97 </span>                :          */
-<span class="lineNum">      98 </span>                :         Xapian::termcount get_wdf() const;
-<span class="lineNum">      99 </span>                : 
-<span class="lineNum">     100 </span>                :         /** Return the term frequency of the current term (if meaningful).
-<span class="lineNum">     101 </span>                :          *
-<span class="lineNum">     102 </span>                :          *  The term frequency is the number of documents which a term indexes.
-<span class="lineNum">     103 </span>                :          */
-<span class="lineNum">     104 </span>                :         Xapian::doccount get_termfreq() const;
-<span class="lineNum">     105 </span>                : 
-<span class="lineNum">     106 </span>                :         /** Return length of positionlist for current term.
-<span class="lineNum">     107 </span>                :          */
-<span class="lineNum">     108 </span>                :         Xapian::termcount positionlist_count() const;
-<span class="lineNum">     109 </span>                : 
-<span class="lineNum">     110 </span>                :         /** Return PositionIterator pointing to start of positionlist for
-<span class="lineNum">     111 </span>                :          *  current term.
-<span class="lineNum">     112 </span>                :          */
-<span class="lineNum">     113 </span>                :         PositionIterator positionlist_begin() const;
-<span class="lineNum">     114 </span>                : 
-<span class="lineNum">     115 </span>                :         /** Return PositionIterator pointing to end of positionlist for
-<span class="lineNum">     116 </span>                :          *  current term.
-<span class="lineNum">     117 </span>                :          */
-<span class="lineNum">     118 </span>                :         PositionIterator positionlist_end() const {
-<span class="lineNum">     119 </span>                :             return PositionIterator(NULL);
-<span class="lineNum">     120 </span>                :         }
-<span class="lineNum">     121 </span>                : 
-<span class="lineNum">     122 </span>                :         /// Return a string describing this object.
-<span class="lineNum">     123 </span>                :         std::string get_description() const;
-<span class="lineNum">     124 </span>                : 
-<span class="lineNum">     125 </span>                :         /// Allow use as an STL iterator
-<span class="lineNum">     126 </span>                :         //@{
-<span class="lineNum">     127 </span>                :         typedef std::input_iterator_tag iterator_category;
-<span class="lineNum">     128 </span>                :         typedef std::string value_type;
-<span class="lineNum">     129 </span>                :         typedef Xapian::termcount_diff difference_type;
-<span class="lineNum">     130 </span>                :         typedef std::string * pointer;
-<span class="lineNum">     131 </span>                :         typedef std::string &amp; reference;
-<span class="lineNum">     132 </span>                :         //@}
-<span class="lineNum">     133 </span>                : };
-<span class="lineNum">     134 </span>                : 
-<span class="lineNum">     135 </span>                : inline bool
-<span class="lineNum">     136 </span><span class="lineCov">              5 : operator==(const TermIterator &amp;a, const TermIterator &amp;b)</span>
-<span class="lineNum">     137 </span>                : {
-<span class="lineNum">     138 </span><span class="lineCov">              5 :     return (a.internal.get() == b.internal.get());</span>
-<span class="lineNum">     139 </span>                : }
-<span class="lineNum">     140 </span>                : 
-<span class="lineNum">     141 </span>                : inline bool
-<span class="lineNum">     142 </span><span class="lineCov">              5 : operator!=(const TermIterator &amp;a, const TermIterator &amp;b)</span>
-<span class="lineNum">     143 </span>                : {
-<span class="lineNum">     144 </span><span class="lineCov">              5 :     return !(a == b);</span>
-<span class="lineNum">     145 </span>                : }
-<span class="lineNum">     146 </span>                : 
-<span class="lineNum">     147 </span>                : }
-<span class="lineNum">     148 </span>                : 
-<span class="lineNum">     149 </span>                : #endif /* XAPIAN_INCLUDED_TERMITERATOR_H */
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/rep/usr/include/xapian/unicode.h.gcov.html b/rep/usr/include/xapian/unicode.h.gcov.html
deleted file mode 100644
index 72c1ad3..0000000
--- a/rep/usr/include/xapian/unicode.h.gcov.html
+++ /dev/null
@@ -1,433 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html lang="en">
-
-<head>
-  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-  <title>LCOV - lcov.info - /usr/include/xapian/unicode.h</title>
-  <link rel="stylesheet" type="text/css" href="../../../gcov.css">
-</head>
-
-<body>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-    <tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-
-    <tr>
-      <td width="100%">
-        <table cellpadding=1 border=0 width="100%">
-        <tr>
-          <td class="headerItem" width="20%">Current&nbsp;view:</td>
-          <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/xapian</a> - unicode.h</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Test:</td>
-          <td class="headerValue" width="80%" colspan=4>lcov.info</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Date:</td>
-          <td class="headerValue" width="20%">2008-08-14</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Instrumented&nbsp;lines:</td>
-          <td class="headerValue" width="20%">8</td>
-        </tr>
-        <tr>
-          <td class="headerItem" width="20%">Code&nbsp;covered:</td>
-          <td class="headerValue" width="20%">87.5 %</td>
-          <td width="20%"></td>
-          <td class="headerItem" width="20%">Executed&nbsp;lines:</td>
-          <td class="headerValue" width="20%">7</td>
-        </tr>
-        </table>
-      </td>
-    </tr>
-    <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  </table>
-
-  <table cellpadding=0 cellspacing=0 border=0>
-    <tr>
-      <td><br></td>
-    </tr>
-    <tr>
-      <td><pre class="source">
-<span class="lineNum">       1 </span>                : /** @file unicode.h
-<span class="lineNum">       2 </span>                :  * @brief Unicode and UTF-8 related classes and functions.
-<span class="lineNum">       3 </span>                :  */
-<span class="lineNum">       4 </span>                : /* Copyright (C) 2006,2007,2008 Olly Betts
-<span class="lineNum">       5 </span>                :  *
-<span class="lineNum">       6 </span>                :  * This program is free software; you can redistribute it and/or modify
-<span class="lineNum">       7 </span>                :  * it under the terms of the GNU General Public License as published by
-<span class="lineNum">       8 </span>                :  * the Free Software Foundation; either version 2 of the License, or
-<span class="lineNum">       9 </span>                :  * (at your option) any later version.
-<span class="lineNum">      10 </span>                :  *
-<span class="lineNum">      11 </span>                :  * This program is distributed in the hope that it will be useful,
-<span class="lineNum">      12 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
-<span class="lineNum">      13 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-<span class="lineNum">      14 </span>                :  * GNU General Public License for more details.
-<span class="lineNum">      15 </span>                :  *
-<span class="lineNum">      16 </span>                :  * You should have received a copy of the GNU General Public License
-<span class="lineNum">      17 </span>                :  * along with this program; if not, write to the Free Software
-<span class="lineNum">      18 </span>                :  * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
-<span class="lineNum">      19 </span>                :  */
-<span class="lineNum">      20 </span>                : 
-<span class="lineNum">      21 </span>                : #ifndef XAPIAN_INCLUDED_UNICODE_H
-<span class="lineNum">      22 </span>                : #define XAPIAN_INCLUDED_UNICODE_H
-<span class="lineNum">      23 </span>                : 
-<span class="lineNum">      24 </span>                : #include &lt;xapian/visibility.h&gt;
-<span class="lineNum">      25 </span>                : 
-<span class="lineNum">      26 </span>                : #include &lt;string&gt;
-<span class="lineNum">      27 </span>                : 
-<span class="lineNum">      28 </span>                : namespace Xapian {
-<span class="lineNum">      29 </span>                : 
-<span class="lineNum">      30 </span>                : /** An iterator which returns unicode character values from a UTF-8 encoded
-<span class="lineNum">      31 </span>                :  *  string.
-<span class="lineNum">      32 </span>                :  */
-<span class="lineNum">      33 </span>                : class XAPIAN_VISIBILITY_DEFAULT Utf8Iterator {
-<span class="lineNum">      34 </span>                :     const unsigned char *p;
-<span class="lineNum">      35 </span>                :     const unsigned char *end;
-<span class="lineNum">      36 </span>                :     mutable unsigned seqlen;
-<span class="lineNum">      37 </span>                : 
-<span class="lineNum">      38 </span>                :     void calculate_sequence_length() const;
-<span class="lineNum">      39 </span>                : 
-<span class="lineNum">      40 </span>                :     unsigned get_char() const;
-<span class="lineNum">      41 </span>                : 
-<span class="lineNum">      42 </span>                :     Utf8Iterator(const unsigned char *p_, const unsigned char *end_, unsigned seqlen_)
-<span class="lineNum">      43 </span>                :         : p(p_), end(end_), seqlen(seqlen_) { }
-<span class="lineNum">      44 </span>                : 
-<span class="lineNum">      45 </span>                :   public:
-<span class="lineNum">      46 </span>                :     /** Return the raw const char * pointer for the current position. */
-<span class="lineNum">      47 </span>                :     const char * raw() const {
-<span class="lineNum">      48 </span>                :         return reinterpret_cast&lt;const char *&gt;(p ? p : end);
-<span class="lineNum">      49 </span>                :     }
-<span class="lineNum">      50 </span>                : 
-<span class="lineNum">      51 </span>                :     /** Return the number of bytes left in the iterator's buffer. */
-<span class="lineNum">      52 </span>                :     size_t left() const { return p ? end - p : 0; }
-<span class="lineNum">      53 </span>                : 
-<span class="lineNum">      54 </span>                :     /** Assign a new string to the iterator.
-<span class="lineNum">      55 </span>                :      *
-<span class="lineNum">      56 </span>                :      *  The iterator will forget the string it was iterating through, and
-<span class="lineNum">      57 </span>                :      *  return characters from the start of the new string when next called.
-<span class="lineNum">      58 </span>                :      *  The string is not copied into the iterator, so it must remain valid
-<span class="lineNum">      59 </span>                :      *  while the iteration is in progress.
-<span class="lineNum">      60 </span>                :      *
-<span class="lineNum">      61 </span>                :      *  @param p A pointer to the start of the string to read.
-<span class="lineNum">      62 </span>                :      *
-<span class="lineNum">      63 </span>                :      *  @param len The length of the string to read.
-<span class="lineNum">      64 </span>                :      */
-<span class="lineNum">      65 </span><span class="lineCov">           5208 :     void assign(const char *p_, size_t len) {</span>
-<span class="lineNum">      66 </span><span class="lineCov">           5208 :         if (len) {</span>
-<span class="lineNum">      67 </span><span class="lineCov">           5208 :             p = reinterpret_cast&lt;const unsigned char*&gt;(p_);</span>
-<span class="lineNum">      68 </span><span class="lineCov">           5208 :             end = p + len;</span>
-<span class="lineNum">      69 </span><span class="lineCov">           5208 :             seqlen = 0;</span>
-<span class="lineNum">      70 </span>                :         } else {
-<span class="lineNum">      71 </span><span class="lineNoCov">              0 :             p = NULL;</span>
-<span class="lineNum">      72 </span>                :         }
-<span class="lineNum">      73 </span><span class="lineCov">           5208 :     }</span>
-<span class="lineNum">      74 </span>                : 
-<span class="lineNum">      75 </span>                :     /** Assign a new string to the iterator.
-<span class="lineNum">      76 </span>                :      *
-<span class="lineNum">      77 </span>                :      *  The iterator will forget the string it was iterating through, and
-<span class="lineNum">      78 </span>                :      *  return characters from the start of the new string when next called.
-<span class="lineNum">      79 </span>                :      *  The string is not copied into the iterator, so it must remain valid
-<span class="lineNum">      80 </span>                :      *  while the iteration is in progress.
-<span class="lineNum">      81 </span>                :      *
-<span class="lineNum">      82 </span>                :      *  @param s The string to read.  Must not be modified while the iteration
-<span class="lineNum">      83 </span>                :      *           is in progress.
-<span class="lineNum">      84 </span>                :      */
-<span class="lineNum">      85 </span>                :     void assign(const std::string &amp;s) { assign(s.data(), s.size()); }
-<span class="lineNum">      86 </span>                : 
-<span class="lineNum">      87 </span>                :     /** Create an iterator given a pointer to a null terminated string.
-<span class="lineNum">      88 </span>                :      *
-<span class="lineNum">      89 </span>                :      *  The iterator will return characters from the start of the string when
-<span class="lineNum">      90 </span>                :      *  next called.  The string is not copied into the iterator, so it must
-<span class="lineNum">      91 </span>                :      *  remain valid while the iteration is in progress.
-<span class="lineNum">      92 </span>                :      *
-<span class="lineNum">      93 </span>                :      *  @param p A pointer to the start of the null terminated string to read.
-<span class="lineNum">      94 </span>                :      */
-<span class="lineNum">      95 </span>                :     explicit Utf8Iterator(const char *p_);
-<span class="lineNum">      96 </span>                : 
-<span class="lineNum">      97 </span>                :     /** Create an iterator given a pointer and a length.
-<span class="lineNum">      98 </span>                :      *
-<span class="lineNum">      99 </span>                :      *  The iterator will return characters from the start of the string when
-<span class="lineNum">     100 </span>                :      *  next called.  The string is not copied into the iterator, so it must
-<span class="lineNum">     101 </span>                :      *  remain valid while the iteration is in progress.
-<span class="lineNum">     102 </span>                :      *
-<span class="lineNum">     103 </span>                :      *  @param p A pointer to the start of the string to read.
-<span class="lineNum">     104 </span>                :      *
-<span class="lineNum">     105 </span>                :      *  @param len The length of the string to read.
-<span class="lineNum">     106 </span>                :      */
-<span class="lineNum">     107 </span>                :     Utf8Iterator(const char *p_, size_t len) { assign(p_, len); }
-<span class="lineNum">     108 </span>                : 
-<span class="lineNum">     109 </span>                :     /** Create an iterator given a string.
-<span class="lineNum">     110 </span>                :      *
-<span class="lineNum">     111 </span>                :      *  The iterator will return characters from the start of the string when
-<span class="lineNum">     112 </span>                :      *  next called.  The string is not copied into the iterator, so it must
-<span class="lineNum">     113 </span>                :      *  remain valid while the iteration is in progress.
-<span class="lineNum">     114 </span>                :      *
-<span class="lineNum">     115 </span>                :      *  @param s The string to read.  Must not be modified while the iteration
-<span class="lineNum">     116 </span>                :      *           is in progress.
-<span class="lineNum">     117 </span>                :      */
-<span class="lineNum">     118 </span><span class="lineCov">           5208 :     Utf8Iterator(const std::string &amp;s) { assign(s.data(), s.size()); }</span>
-<span class="lineNum">     119 </span>                : 
-<span class="lineNum">     120 </span>                :     /** Create an iterator which is at the end of its iteration.
-<span class="lineNum">     121 </span>                :      *
-<span class="lineNum">     122 </span>                :      *  This can be compared to another iterator to check if the other iterator
-<span class="lineNum">     123 </span>                :      *  has reached its end.
-<span class="lineNum">     124 </span>                :      */
-<span class="lineNum">     125 </span>                :     Utf8Iterator() : p(NULL), end(0), seqlen(0) { }
-<span class="lineNum">     126 </span>                : 
-<span class="lineNum">     127 </span>                :     /** Get the current unicode character value pointed to by the iterator.
-<span class="lineNum">     128 </span>                :      *
-<span class="lineNum">     129 </span>                :      *  Returns unsigned(-1) if the iterator has reached the end of its buffer.
-<span class="lineNum">     130 </span>                :      */
-<span class="lineNum">     131 </span>                :     unsigned operator*() const;
-<span class="lineNum">     132 </span>                : 
-<span class="lineNum">     133 </span>                :     /** Move forward to the next unicode character.
-<span class="lineNum">     134 </span>                :      *
-<span class="lineNum">     135 </span>                :      *  @return An iterator pointing to the position before the move.
-<span class="lineNum">     136 </span>                :      */
-<span class="lineNum">     137 </span>                :     Utf8Iterator operator++(int) {
-<span class="lineNum">     138 </span>                :         // If we've not calculated seqlen yet, do so.
-<span class="lineNum">     139 </span>                :         if (seqlen == 0) calculate_sequence_length();
-<span class="lineNum">     140 </span>                :         const unsigned char *old_p = p;
-<span class="lineNum">     141 </span>                :         unsigned old_seqlen = seqlen;
-<span class="lineNum">     142 </span>                :         p += seqlen;
-<span class="lineNum">     143 </span>                :         if (p == end) p = NULL;
-<span class="lineNum">     144 </span>                :         seqlen = 0;
-<span class="lineNum">     145 </span>                :         return Utf8Iterator(old_p, end, old_seqlen);
-<span class="lineNum">     146 </span>                :     }
-<span class="lineNum">     147 </span>                : 
-<span class="lineNum">     148 </span>                :     /** Move forward to the next unicode character.
-<span class="lineNum">     149 </span>                :      *
-<span class="lineNum">     150 </span>                :      *  @return A reference to this object.
-<span class="lineNum">     151 </span>                :      */
-<span class="lineNum">     152 </span>                :     Utf8Iterator &amp; operator++() {
-<span class="lineNum">     153 </span>                :         if (seqlen == 0) calculate_sequence_length();
-<span class="lineNum">     154 </span>                :         p += seqlen;
-<span class="lineNum">     155 </span>                :         if (p == end) p = NULL;
-<span class="lineNum">     156 </span>                :         seqlen = 0;
-<span class="lineNum">     157 </span>                :         return *this;
-<span class="lineNum">     158 </span>                :     }
-<span class="lineNum">     159 </span>                : 
-<span class="lineNum">     160 </span>                :     /** Test two Utf8Iterators for equality.
-<span class="lineNum">     161 </span>                :      *
-<span class="lineNum">     162 </span>                :      *  @return true iff the iterators point to the same position.
-<span class="lineNum">     163 </span>                :      */
-<span class="lineNum">     164 </span>                :     bool operator==(const Utf8Iterator &amp;other) const { return p == other.p; }
-<span class="lineNum">     165 </span>                : 
-<span class="lineNum">     166 </span>                :     /** Test two Utf8Iterators for inequality.
-<span class="lineNum">     167 </span>                :      *
-<span class="lineNum">     168 </span>                :      *  @return true iff the iterators do not point to the same position.
-<span class="lineNum">     169 </span>                :      */
-<span class="lineNum">     170 </span>                :     bool operator!=(const Utf8Iterator &amp;other) const { return p != other.p; }
-<span class="lineNum">     171 </span>                : 
-<span class="lineNum">     172 </span>                :     /// We implement the semantics of an STL input_iterator.
-<span class="lineNum">     173 </span>                :     //@{
-<span class="lineNum">     174 </span>                :     typedef std::input_iterator_tag iterator_category;
-<span class="lineNum">     175 </span>                :     typedef unsigned value_type;
-<span class="lineNum">     176 </span>                :     typedef size_t difference_type;
-<span class="lineNum">     177 </span>                :     typedef const unsigned * pointer;
-<span class="lineNum">     178 </span>                :     typedef const unsigned &amp; reference;
-<span class="lineNum">     179 </span>                :     //@}
-<span class="lineNum">     180 </span>                : };
-<span class="lineNum">     181 </span>                : 
-<span class="lineNum">     182 </span>                : namespace Unicode {
-<span class="lineNum">     183 </span>                : 
-<span class="lineNum">     184 </span>                : /** Each unicode character is in one of these categories. */
-<span class="lineNum">     185 </span>                : typedef enum {
-<span class="lineNum">     186 </span>                :     UNASSIGNED,
-<span class="lineNum">     187 </span>                :     UPPERCASE_LETTER,
-<span class="lineNum">     188 </span>                :     LOWERCASE_LETTER,
-<span class="lineNum">     189 </span>                :     TITLECASE_LETTER,
-<span class="lineNum">     190 </span>                :     MODIFIER_LETTER,
-<span class="lineNum">     191 </span>                :     OTHER_LETTER,
-<span class="lineNum">     192 </span>                :     NON_SPACING_MARK,
-<span class="lineNum">     193 </span>                :     ENCLOSING_MARK,
-<span class="lineNum">     194 </span>                :     COMBINING_SPACING_MARK,
-<span class="lineNum">     195 </span>                :     DECIMAL_DIGIT_NUMBER,
-<span class="lineNum">     196 </span>                :     LETTER_NUMBER,
-<span class="lineNum">     197 </span>                :     OTHER_NUMBER,
-<span class="lineNum">     198 </span>                :     SPACE_SEPARATOR,
-<span class="lineNum">     199 </span>                :     LINE_SEPARATOR,
-<span class="lineNum">     200 </span>                :     PARAGRAPH_SEPARATOR,
-<span class="lineNum">     201 </span>                :     CONTROL,
-<span class="lineNum">     202 </span>                :     FORMAT,
-<span class="lineNum">     203 </span>                :     PRIVATE_USE,
-<span class="lineNum">     204 </span>                :     SURROGATE,
-<span class="lineNum">     205 </span>                :     CONNECTOR_PUNCTUATION,
-<span class="lineNum">     206 </span>                :     DASH_PUNCTUATION,
-<span class="lineNum">     207 </span>                :     OPEN_PUNCTUATION,
-<span class="lineNum">     208 </span>                :     CLOSE_PUNCTUATION,
-<span class="lineNum">     209 </span>                :     INITIAL_QUOTE_PUNCTUATION,
-<span class="lineNum">     210 </span>                :     FINAL_QUOTE_PUNCTUATION,
-<span class="lineNum">     211 </span>                :     OTHER_PUNCTUATION,
-<span class="lineNum">     212 </span>                :     MATH_SYMBOL,
-<span class="lineNum">     213 </span>                :     CURRENCY_SYMBOL,
-<span class="lineNum">     214 </span>                :     MODIFIER_SYMBOL,
-<span class="lineNum">     215 </span>                :     OTHER_SYMBOL
-<span class="lineNum">     216 </span>                : } category;
-<span class="lineNum">     217 </span>                : 
-<span class="lineNum">     218 </span>                : namespace Internal {
-<span class="lineNum">     219 </span>                :     /** @internal Extract the information about a character from the Unicode
-<span class="lineNum">     220 </span>                :      *  character tables.
-<span class="lineNum">     221 </span>                :      *
-<span class="lineNum">     222 </span>                :      *  ch must be a valid Unicode character value (i.e. &lt; 0x110000)
-<span class="lineNum">     223 </span>                :      */
-<span class="lineNum">     224 </span>                :     XAPIAN_VISIBILITY_DEFAULT
-<span class="lineNum">     225 </span>                :     int get_character_info(unsigned ch);
-<span class="lineNum">     226 </span>                : 
-<span class="lineNum">     227 </span>                :     /** @internal Extract how to convert the case of a unicode character from
-<span class="lineNum">     228 </span>                :      *  its info.
-<span class="lineNum">     229 </span>                :      */
-<span class="lineNum">     230 </span>                :     inline int get_case_type(int info) { return ((info &amp; 0xe0) &gt;&gt; 5); }
-<span class="lineNum">     231 </span>                : 
-<span class="lineNum">     232 </span>                :     /// @internal Extract the category of a unicode character from its info.
-<span class="lineNum">     233 </span>                :     inline category get_category(int info) { return static_cast&lt;category&gt;(info &amp; 0x1f); }
-<span class="lineNum">     234 </span>                : 
-<span class="lineNum">     235 </span>                :     /** @internal Extract the delta to use for case conversion of a character
-<span class="lineNum">     236 </span>                :      *  from its info.
-<span class="lineNum">     237 </span>                :      */
-<span class="lineNum">     238 </span>                :     inline int get_delta(int info) {
-<span class="lineNum">     239 </span>                :         /* It's implementation defined if sign extension happens on right shift
-<span class="lineNum">     240 </span>                :          * of a signed int, hence the conditional (hopefully the compiler will
-<span class="lineNum">     241 </span>                :          * spot this and optimise it to a sign-extending shift on architectures
-<span class="lineNum">     242 </span>                :          * with a suitable instruction).
-<span class="lineNum">     243 </span>                :          */
-<span class="lineNum">     244 </span>                :         return (info &gt;= 0) ? (info &gt;&gt; 15) : (~(~info &gt;&gt; 15));
-<span class="lineNum">     245 </span>                :     }
-<span class="lineNum">     246 </span>                : }
-<span class="lineNum">     247 </span>                : 
-<span class="lineNum">     248 </span>                : /** Convert a single non-ASCII unicode character to UTF-8.
-<span class="lineNum">     249 </span>                :  *
-<span class="lineNum">     250 </span>                :  *  This is intended mainly as a helper method for to_utf8().
-<span class="lineNum">     251 </span>                :  *
-<span class="lineNum">     252 </span>                :  *  The character @a ch (which must be &gt; 128) is written to the buffer @a buf
-<span class="lineNum">     253 </span>                :  *  and the length of the resultant UTF-8 character is returned.
-<span class="lineNum">     254 </span>                :  *
-<span class="lineNum">     255 </span>                :  *  NB buf must have space for (at least) 4 bytes.
-<span class="lineNum">     256 </span>                :  */
-<span class="lineNum">     257 </span>                : XAPIAN_VISIBILITY_DEFAULT
-<span class="lineNum">     258 </span>                : unsigned nonascii_to_utf8(unsigned ch, char * buf);
-<span class="lineNum">     259 </span>                : 
-<span class="lineNum">     260 </span>                : /** Convert a single unicode character to UTF-8.
-<span class="lineNum">     261 </span>                :  *
-<span class="lineNum">     262 </span>                :  *  The character @a ch is written to the buffer @a buf and the length of the
-<span class="lineNum">     263 </span>                :  *  resultant UTF-8 character is returned.
-<span class="lineNum">     264 </span>                :  *
-<span class="lineNum">     265 </span>                :  *  NB buf must have space for (at least) 4 bytes.
-<span class="lineNum">     266 </span>                :  */
-<span class="lineNum">     267 </span>                : inline unsigned to_utf8(unsigned ch, char *buf) {
-<span class="lineNum">     268 </span>                :     if (ch &lt; 128) {
-<span class="lineNum">     269 </span>                :         *buf = static_cast&lt;unsigned char&gt;(ch);
-<span class="lineNum">     270 </span>                :         return 1;
-<span class="lineNum">     271 </span>                :     }
-<span class="lineNum">     272 </span>                :     return Xapian::Unicode::nonascii_to_utf8(ch, buf);
-<span class="lineNum">     273 </span>                : }
-<span class="lineNum">     274 </span>                : 
-<span class="lineNum">     275 </span>                : /** Append the UTF-8 representation of a single unicode character to a
-<span class="lineNum">     276 </span>                :  *  std::string.
-<span class="lineNum">     277 </span>                :  */
-<span class="lineNum">     278 </span>                : inline void append_utf8(std::string &amp;s, unsigned ch) {
-<span class="lineNum">     279 </span>                :     char buf[4];
-<span class="lineNum">     280 </span>                :     s.append(buf, to_utf8(ch, buf));
-<span class="lineNum">     281 </span>                : }
-<span class="lineNum">     282 </span>                : 
-<span class="lineNum">     283 </span>                : /// Return the category which a given unicode character falls into.
-<span class="lineNum">     284 </span>                : inline category get_category(unsigned ch) {
-<span class="lineNum">     285 </span>                :     // Categorise non-Unicode values as UNASSIGNED.
-<span class="lineNum">     286 </span>                :     if (ch &gt;= 0x110000) return Xapian::Unicode::UNASSIGNED;
-<span class="lineNum">     287 </span>                :     return Internal::get_category(Internal::get_character_info(ch));
-<span class="lineNum">     288 </span>                : }
-<span class="lineNum">     289 </span>                : 
-<span class="lineNum">     290 </span>                : /// Test is a given unicode character is a letter or number.
-<span class="lineNum">     291 </span>                : inline bool is_wordchar(unsigned ch) {
-<span class="lineNum">     292 </span>                :     const unsigned int WORDCHAR_MASK =
-<span class="lineNum">     293 </span>                :             (1 &lt;&lt; Xapian::Unicode::UPPERCASE_LETTER) |
-<span class="lineNum">     294 </span>                :             (1 &lt;&lt; Xapian::Unicode::LOWERCASE_LETTER) |
-<span class="lineNum">     295 </span>                :             (1 &lt;&lt; Xapian::Unicode::TITLECASE_LETTER) |
-<span class="lineNum">     296 </span>                :             (1 &lt;&lt; Xapian::Unicode::MODIFIER_LETTER) |
-<span class="lineNum">     297 </span>                :             (1 &lt;&lt; Xapian::Unicode::OTHER_LETTER) |
-<span class="lineNum">     298 </span>                :             (1 &lt;&lt; Xapian::Unicode::DECIMAL_DIGIT_NUMBER) |
-<span class="lineNum">     299 </span>                :             (1 &lt;&lt; Xapian::Unicode::LETTER_NUMBER) |
-<span class="lineNum">     300 </span>                :             (1 &lt;&lt; Xapian::Unicode::OTHER_NUMBER) |
-<span class="lineNum">     301 </span>                :             (1 &lt;&lt; Xapian::Unicode::CONNECTOR_PUNCTUATION);
-<span class="lineNum">     302 </span>                :     return ((WORDCHAR_MASK &gt;&gt; get_category(ch)) &amp; 1);
-<span class="lineNum">     303 </span>                : }
-<span class="lineNum">     304 </span>                : 
-<span class="lineNum">     305 </span>                : /// Test is a given unicode character is a whitespace character.
-<span class="lineNum">     306 </span>                : inline bool is_whitespace(unsigned ch) {
-<span class="lineNum">     307 </span>                :     const unsigned int WHITESPACE_MASK =
-<span class="lineNum">     308 </span>                :             (1 &lt;&lt; Xapian::Unicode::CONTROL) | // For TAB, CR, LF, FF.
-<span class="lineNum">     309 </span>                :             (1 &lt;&lt; Xapian::Unicode::SPACE_SEPARATOR) |
-<span class="lineNum">     310 </span>                :             (1 &lt;&lt; Xapian::Unicode::LINE_SEPARATOR) |
-<span class="lineNum">     311 </span>                :             (1 &lt;&lt; Xapian::Unicode::PARAGRAPH_SEPARATOR);
-<span class="lineNum">     312 </span>                :     return ((WHITESPACE_MASK &gt;&gt; get_category(ch)) &amp; 1);
-<span class="lineNum">     313 </span>                : }
-<span class="lineNum">     314 </span>                : 
-<span class="lineNum">     315 </span>                : /// Test is a given unicode character is a currency symbol.
-<span class="lineNum">     316 </span>                : inline bool is_currency(unsigned ch) {
-<span class="lineNum">     317 </span>                :     return (get_category(ch) == Xapian::Unicode::CURRENCY_SYMBOL);
-<span class="lineNum">     318 </span>                : }
-<span class="lineNum">     319 </span>                : 
-<span class="lineNum">     320 </span>                : /// Convert a unicode character to lowercase.
-<span class="lineNum">     321 </span>                : inline unsigned tolower(unsigned ch) {
-<span class="lineNum">     322 </span>                :     int info;
-<span class="lineNum">     323 </span>                :     // Leave non-Unicode values unchanged.
-<span class="lineNum">     324 </span>                :     if (ch &gt;= 0x110000 || !(Internal::get_case_type((info = Xapian::Unicode::Internal::get_character_info(ch))) &amp; 2))
-<span class="lineNum">     325 </span>                :         return ch;
-<span class="lineNum">     326 </span>                :     return ch + Internal::get_delta(info);
-<span class="lineNum">     327 </span>                : }
-<span class="lineNum">     328 </span>                : 
-<span class="lineNum">     329 </span>                : /// Convert a unicode character to uppercase.
-<span class="lineNum">     330 </span>                : inline unsigned toupper(unsigned ch) {
-<span class="lineNum">     331 </span>                :     int info;
-<span class="lineNum">     332 </span>                :     // Leave non-Unicode values unchanged.
-<span class="lineNum">     333 </span>                :     if (ch &gt;= 0x110000 || !(Internal::get_case_type((info = Xapian::Unicode::Internal::get_character_info(ch))) &amp; 4))
-<span class="lineNum">     334 </span>                :         return ch;
-<span class="lineNum">     335 </span>                :     return ch - Internal::get_delta(info);
-<span class="lineNum">     336 </span>                : }
-<span class="lineNum">     337 </span>                : 
-<span class="lineNum">     338 </span>                : /// Convert a UTF-8 std::string to lowercase.
-<span class="lineNum">     339 </span>                : inline std::string
-<span class="lineNum">     340 </span>                : tolower(const std::string &amp;term)
-<span class="lineNum">     341 </span>                : {
-<span class="lineNum">     342 </span>                :     std::string result;
-<span class="lineNum">     343 </span>                :     result.reserve(term.size());
-<span class="lineNum">     344 </span>                :     for (Utf8Iterator i(term); i != Utf8Iterator(); ++i) {
-<span class="lineNum">     345 </span>                :         append_utf8(result, tolower(*i));
-<span class="lineNum">     346 </span>                :     }
-<span class="lineNum">     347 </span>                :     return result;
-<span class="lineNum">     348 </span>                : }
-<span class="lineNum">     349 </span>                : 
-<span class="lineNum">     350 </span>                : /// Convert a UTF-8 std::string to uppercase.
-<span class="lineNum">     351 </span>                : inline std::string
-<span class="lineNum">     352 </span>                : toupper(const std::string &amp;term)
-<span class="lineNum">     353 </span>                : {
-<span class="lineNum">     354 </span>                :     std::string result;
-<span class="lineNum">     355 </span>                :     result.reserve(term.size());
-<span class="lineNum">     356 </span>                :     for (Utf8Iterator i(term); i != Utf8Iterator(); ++i) {
-<span class="lineNum">     357 </span>                :         append_utf8(result, toupper(*i));
-<span class="lineNum">     358 </span>                :     }
-<span class="lineNum">     359 </span>                :     return result;
-<span class="lineNum">     360 </span>                : }
-<span class="lineNum">     361 </span>                : 
-<span class="lineNum">     362 </span>                : }
-<span class="lineNum">     363 </span>                : 
-<span class="lineNum">     364 </span>                : }
-<span class="lineNum">     365 </span>                : 
-<span class="lineNum">     366 </span>                : #endif // XAPIAN_INCLUDED_UNICODE_H
-</pre>
-      </td>
-    </tr>
-  </table>
-  <br>
-
-  <table width="100%" border=0 cellspacing=0 cellpadding=0>
-  <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr>
-  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
-  </table>
-  <br>
-
-</body>
-</html>
diff --git a/run-check b/run-check
new file mode 100755
index 0000000..ea05d69
--- /dev/null
+++ b/run-check
@@ -0,0 +1,59 @@
+#!/bin/sh -e
+
+TOP_SRCDIR=$(readlink -f $(dirname "$0"))
+CMD=$(readlink -f "$1")
+
+## Set up the test environment
+datadir="${TOP_SRCDIR}/ept/test-data"
+TESTDIR="`mktemp -d`"
+cd "$TESTDIR"
+
+## Clean up the test environment at exit unless asked otherwise
+cleanup() {
+	test -z "$PRESERVE" && rm -rf "$TESTDIR"
+}
+trap cleanup EXIT
+
+ARCH=$(dpkg --print-architecture)
+listfile=wherever_debian_._Packages
+mkdir -p etc state/lists/partial cache debtags cache/archives/partial desktop
+sed -e s,i386,${ARCH}, < ${datadir}/packagelist > state/lists/${listfile}
+cp -a ${datadir}/etc/sources.list etc/
+sed -e s,i386,${ARCH}, < ${datadir}/dpkg-status > dpkg-status
+cp -a ${datadir}/desktop/*.desktop desktop/
+cp ${datadir}/debtags/package-tags debtags/package-tags
+cp ${datadir}/debtags/vocabulary debtags/vocabulary
+mkdir -p debtags/empty
+mkdir -p debtags/user
+mkdir -p xapian/
+
+# Try to debug the libtool executable, if present
+DIR=`dirname $CMD`
+BASE=`basename $CMD`
+if [ ! -z "$DEBUGGER" ]
+then
+        echo "Running $DEBUGGER $CMD $ARGS"
+        RES=0
+        if ! $DEBUGGER $CMD $ARGS
+        then
+                RES=$?
+                echo "Failed with result $RES"
+        fi
+else
+        echo "Running $CMD $ARGS"
+        RES=0
+        if ! $CMD $ARGS
+        then
+                RES=$?
+                echo "Failed with result $RES"
+        fi
+fi
+
+if [ ! -z "$PAUSE" ]
+then
+	echo "Post-test inspection requested."
+	echo "Exit this shell to cleanup the test environment."
+	bash
+fi
+
+exit $RES
diff --git a/tools/CMakeLists.txt b/tools/CMakeLists.txt
index 33a4a6f..d3210f1 100644
--- a/tools/CMakeLists.txt
+++ b/tools/CMakeLists.txt
@@ -1,5 +1,6 @@
 include_directories( ${CMAKE_SOURCE_DIR} ${CMAKE_BINARY_DIR} 
                      ${TAGCOLL_INCLUDE_DIRS} ${WIBBLE_INCLUDE_DIRS} )
+add_definitions( --std=c++11 )
 link_libraries( ept )
 
 add_executable( ept-cat ept-cat.cpp )
diff --git a/tools/ept-cat.cpp b/tools/ept-cat.cpp
index d5af2f6..df68682 100644
--- a/tools/ept-cat.cpp
+++ b/tools/ept-cat.cpp
@@ -1,5 +1,5 @@
 #include <ept/apt/apt.h>
-#include <ept/apt/apt.h>
+#include <iostream>
 
 int summary = 0;
 
@@ -10,7 +10,7 @@ int main( int argc, char **argv ) {
     Apt db;
 
     for (Apt::record_iterator i = db.recordBegin(); i != db.recordEnd(); ++i)
-	    cout << *i << endl;
-   
+        cout << *i << endl;
+
     return 0;
 }